On the type of triangle groups

We prove a conjecture of R. Schwartz about the type of some complex hyperbolic triangle groups.Comment: 10 pages, 3 figure

Infinite slabs and other weird plane symmetric space-times with constant positive density

We present the exact solution of Einstein's equation corresponding to a static and plane symmetric distribution of matter with constant positive density located below $z=0$. This solution depends essentially on two constants: the density $\rho$ and a parameter $\kappa$. We show that this space-time finishes down below at an inner singularity at finite depth. We match this solution to the vacuum one and compute the external gravitational field in terms of slab's parameters. Depending on the value of $\kappa$, these slabs can be attractive, repulsive or neutral. In the first case, the space-time also finishes up above at another singularity. In the other cases, they turn out to be semi-infinite and asymptotically flat when $z\to\infty$. We also find solutions consisting of joining an attractive slab and a repulsive one, and two neutral ones. We also discuss how to assemble a "gravitational capacitor" by inserting a slice of vacuum between two such slabs.Comment: 8 page

The kinematics of the swing phase obtained from accelerometer and gyroscope measurements

The kinematics needed to calculate the knee moment during the initial swing phase were obtained from a set of eight leg-mounted uni-axial accelerometers and two gyroscopes. The angular and linear accelerations of shank and thigh were calculated from the signals of two accelerometers mounted on each of the leg segments directed tangentially and radially to the movement. The angular velocities of shank and thigh were measured by the gyroscopes. The absolute angles of shank and thigh were obtained by integration of the gyroscope signal plus an added offset angle, estimated from radial and tangential accelerometer signals registered while standing. Movement was assumed to be in the saggital plane. The accuracy of the quantities found from the leg mounted sensors was calculated in terms of correlation and the RMS error by comparing against measurements obtained by a VICONTM system. The results were indistinguishable. The system was later applied in research measurement

Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems

International audienceMany design guidelines state that a software system architecture should avoid cycles between its packages. Yet such cycles appear again and again in many programs. We believe that the existing approaches for cycle detection are too coarse to assist the developers to remove cycles from their programs. In this paper, we describe an efficient algorithm that performs a fine-grained analysis of the cycles among the packages of an application. In addition, we define a metric to rank cycles by their level of undesirability, prioritizing the cycles that seems the more undesired by the developers. Our approach is validated on two large and mature software systems in Java and Smalltalk

On the equivalence between real and superfield 5d formalisms

We explicitly prove the equivalence and construct a dictionary between two different supersymmetric formalisms for five-dimensional theories commonly used in the literature. One is the real formalism, which consists in doubling the number of degrees of freedom and then imposing reality constraints and the other is the usual superfield formalism.Comment: 19 page

Processing Succinct Matrices and Vectors

We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of a semiring (instead of 0 and 1). A simple example shows that the product of two MTDD-represented matrices cannot be represented by an MTDD of polynomial size. To overcome this deficiency, we extended MTDDs to MTDD_+ by allowing componentwise symbolic addition of variables (of the same dimension) in rules. It is shown that accessing an entry, equality checking, matrix multiplication, and other basic matrix operations can be solved in polynomial time for MTDD_+-represented matrices. On the other hand, testing whether the determinant of a MTDD-represented matrix vanishes PSPACE$-complete, and the same problem is NP-complete for MTDD_+-represented diagonal matrices. Computing a specific entry in a product of MTDD-represented matrices is #P-complete.Comment: An extended abstract of this paper will appear in the Proceedings of CSR 201

Complexity Results for Modal Dependence Logic

Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is determined by those of p_1,...,p_(n-1). Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time. In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfibility for poor man's dependence logic, the language consisting of formulas built from literals and dependence atoms using conjunction, necessity and possibility (i.e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness. We also extend V\"a\"an\"anen's language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satistiability is complete for the second level of the polynomial hierarchy. In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by V\"a\"an\"anen and Sevenster.Comment: 22 pages, full version of CSL 2010 pape

Hierarchies of Predominantly Connected Communities

We consider communities whose vertices are predominantly connected, i.e., the vertices in each community are stronger connected to other community members of the same community than to vertices outside the community. Flake et al. introduced a hierarchical clustering algorithm that finds such predominantly connected communities of different coarseness depending on an input parameter. We present a simple and efficient method for constructing a clustering hierarchy according to Flake et al. that supersedes the necessity of choosing feasible parameter values and guarantees the completeness of the resulting hierarchy, i.e., the hierarchy contains all clusterings that can be constructed by the original algorithm for any parameter value. However, predominantly connected communities are not organized in a single hierarchy. Thus, we develop a framework that, after precomputing at most $2(n-1)$ maximum flows, admits a linear time construction of a clustering \C(S) of predominantly connected communities that contains a given community $S$ and is maximum in the sense that any further clustering of predominantly connected communities that also contains $S$ is hierarchically nested in \C(S). We further generalize this construction yielding a clustering with similar properties for $k$ given communities in $O(kn)$ time. This admits the analysis of a network's structure with respect to various communities in different hierarchies.Comment: to appear (WADS 2013