1,361 research outputs found

    Spectral geometry of Îș\kappa-Minkowski space

    Full text link
    After recalling Snyder's idea of using vector fields over a smooth manifold as `coordinates on a noncommutative space', we discuss a two dimensional toy-model whose `dual' noncommutative coordinates form a Lie algebra: this is the well known Îș\kappa-Minkowski space. We show how to improve Snyder's idea using the tools of quantum groups and noncommutative geometry. We find a natural representation of the coordinate algebra of Îș\kappa-Minkowski as linear operators on an Hilbert space study its `spectral properties' and discuss how to obtain a Dirac operator for this space. We describe two Dirac operators. The first is associated with a spectral triple. We prove that the cyclic integral of M. Dimitrijevic et al. can be obtained as Dixmier trace associated to this triple. The second Dirac operator is equivariant for the action of the quantum Euclidean group, but it has unbounded commutators with the algebra.Comment: 23 pages, expanded versio

    A Decomposition Approach to Multi-Vehicle Cooperative Control

    Full text link
    We present methods that generate cooperative strategies for multi-vehicle control problems using a decomposition approach. By introducing a set of tasks to be completed by the team of vehicles and a task execution method for each vehicle, we decomposed the problem into a combinatorial component and a continuous component. The continuous component of the problem is captured by task execution, and the combinatorial component is captured by task assignment. In this paper, we present a solver for task assignment that generates near-optimal assignments quickly and can be used in real-time applications. To motivate our methods, we apply them to an adversarial game between two teams of vehicles. One team is governed by simple rules and the other by our algorithms. In our study of this game we found phase transitions, showing that the task assignment problem is most difficult to solve when the capabilities of the adversaries are comparable. Finally, we implement our algorithms in a multi-level architecture with a variable replanning rate at each level to provide feedback on a dynamically changing and uncertain environment.Comment: 36 pages, 19 figures, for associated web page see http://control.mae.cornell.edu/earl/decom

    Fully-dynamic Approximation of Betweenness Centrality

    Full text link
    Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previous work we proposed the first semi-dynamic algorithms that recompute an approximation of betweenness in connected graphs after batches of edge insertions. In this paper we propose the first fully-dynamic approximation algorithms (for weighted and unweighted undirected graphs that need not to be connected) with a provable guarantee on the maximum approximation error. The transfer to fully-dynamic and disconnected graphs implies additional algorithmic problems that could be of independent interest. In particular, we propose a new upper bound on the vertex diameter for weighted undirected graphs. For both weighted and unweighted graphs, we also propose the first fully-dynamic algorithms that keep track of such upper bound. In addition, we extend our former algorithm for semi-dynamic BFS to batches of both edge insertions and deletions. Using approximation, our algorithms are the first to make in-memory computation of betweenness in fully-dynamic networks with millions of edges feasible. Our experiments show that they can achieve substantial speedups compared to recomputation, up to several orders of magnitude

    Open and / or laparoscopic surgical treatment of liver hydatic cysts

    Get PDF
    Hydatid disease is a severe parasitic disease with a widely ranging distribution. In the human being the liver is the most frequent organ affected. 1 The treatment should be individualized to the morphology, size, number and location of the cysts, that is why a variety of surgical operations have been advocated from complete resection like total pericystectomy or partial hepatectomy to laparoscopy to a minimally invasive procedures like percutaneous aspiration of cysts to conservative drug therapy. 3-4 This study compares laparoscopic versus open management of the hydatid cyst of liver the surgical approach to liver echinococcosis is still a controversial issue and shows our results of surgical treatment of liver hydatid cysts during a 3-years period

    Differential and Twistor Geometry of the Quantum Hopf Fibration

    Full text link
    We study a quantum version of the SU(2) Hopf fibration S7→S4S^7 \to S^4 and its associated twistor geometry. Our quantum sphere Sq7S^7_q arises as the unit sphere inside a q-deformed quaternion space Hq2\mathbb{H}^2_q. The resulting four-sphere Sq4S^4_q is a quantum analogue of the quaternionic projective space HP1\mathbb{HP}^1. The quantum fibration is endowed with compatible non-universal differential calculi. By investigating the quantum symmetries of the fibration, we obtain the geometry of the corresponding twistor space CPq3\mathbb{CP}^3_q and use it to study a system of anti-self-duality equations on Sq4S^4_q, for which we find an `instanton' solution coming from the natural projection defining the tautological bundle over Sq4S^4_q.Comment: v2: 38 pages; completely rewritten. The crucial difference with respect to the first version is that in the present one the quantum four-sphere, the base space of the fibration, is NOT a quantum homogeneous space. This has important consequences and led to very drastic changes to the paper. To appear in CM

    Quantized algebras of functions on homogeneous spaces with Poisson stabilizers

    Full text link
    Let G be a simply connected semisimple compact Lie group with standard Poisson structure, K a closed Poisson-Lie subgroup, 0<q<1. We study a quantization C(G_q/K_q) of the algebra of continuous functions on G/K. Using results of Soibelman and Dijkhuizen-Stokman we classify the irreducible representations of C(G_q/K_q) and obtain a composition series for C(G_q/K_q). We describe closures of the symplectic leaves of G/K refining the well-known description in the case of flag manifolds in terms of the Bruhat order. We then show that the same rules describe the topology on the spectrum of C(G_q/K_q). Next we show that the family of C*-algebras C(G_q/K_q), 0<q\le1, has a canonical structure of a continuous field of C*-algebras and provides a strict deformation quantization of the Poisson algebra \C[G/K]. Finally, extending a result of Nagy, we show that C(G_q/K_q) is canonically KK-equivalent to C(G/K).Comment: 23 pages; minor changes, typos correcte
    • 

    corecore