Predicting the Cosmological Constant from the Causal Entropic Principle

We compute the expected value of the cosmological constant in our universe from the Causal Entropic Principle. Since observers must obey the laws of thermodynamics and causality, the principle asserts that physical parameters are most likely to be found in the range of values for which the total entropy production within a causally connected region is maximized. Despite the absence of more explicit anthropic criteria, the resulting probability distribution turns out to be in excellent agreement with observation. In particular, we find that dust heated by stars dominates the entropy production, demonstrating the remarkable power of this thermodynamic selection criterion. The alternative approach - weighting by the number of "observers per baryon" - is less well-defined, requires problematic assumptions about the nature of observers, and yet prefers values larger than present experimental bounds.Comment: 38 pages, 9 figures, minor correction in Figure

Removing micromelody from fundamental frequency contours

In this paper we describe a new method to diminish microprosodic components of fundamental frequency contours by applying weight functions linked to microprosodically classified phone combinations. For vowel segments in obstruent environments our algorithm outperforms standard smoothing algorithms like Moving-Average filtering, Savitzky-Golay filtering or MOMEL in diminishing F0 variations related to microprosodic factors while retaining significant differences related to macroprosody

Observable Graphs

An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his position only from time to time, the graph is said to be \emph{partly observable}. Observability in graphs is desirable in situations where autonomous agents are moving on a network and one wants to localize them (or the agent wants to localize himself) with limited information. In this paper, we completely characterize observable and partly observable graphs and show how these concepts relate to observable discrete event systems and to local automata. Based on these characterizations, we provide polynomial time algorithms to decide observability, to decide partial observability, and to compute the minimal number of observations necessary for finding the position of an agent. In particular we prove that in the worst case this minimal number of observations increases quadratically with the number of nodes in the graph. From this it follows that it may be necessary for an agent to pass through the same node several times before he is finally able to determine his position in the graph. We then consider the more difficult question of assigning colors to a graph so as to make it observable and we prove that two different versions of this problem are NP-complete.Comment: 15 pages, 8 figure

On Primitivity of Sets of Matrices

A nonnegative matrix $A$ is called primitive if $A^k$ is positive for some integer $k>0$. A generalization of this concept to finite sets of matrices is as follows: a set of matrices $\mathcal M = \{A_1, A_2, \ldots, A_m \}$ is primitive if $A_{i_1} A_{i_2} \ldots A_{i_k}$ is positive for some indices $i_1, i_2, ..., i_k$. The concept of primitive sets of matrices comes up in a number of problems within the study of discrete-time switched systems. In this paper, we analyze the computational complexity of deciding if a given set of matrices is primitive and we derive bounds on the length of the shortest positive product. We show that while primitivity is algorithmically decidable, unless $P=NP$ it is not possible to decide primitivity of a matrix set in polynomial time. Moreover, we show that the length of the shortest positive sequence can be superpolynomial in the dimension of the matrices. On the other hand, defining ${\mathcal P}$ to be the set of matrices with no zero rows or columns, we give a simple combinatorial proof of a previously-known characterization of primitivity for matrices in ${\mathcal P}$ which can be tested in polynomial time. This latter observation is related to the well-known 1964 conjecture of Cerny on synchronizing automata; in fact, any bound on the minimal length of a synchronizing word for synchronizing automata immediately translates into a bound on the length of the shortest positive product of a primitive set of matrices in ${\mathcal P}$. In particular, any primitive set of $n \times n$ matrices in ${\mathcal P}$ has a positive product of length $O(n^3)$

Cosmology and the S-matrix

We study conditions for the existence of asymptotic observables in cosmology. With the exception of de Sitter space, the thermal properties of accelerating universes permit arbitrarily long observations, and guarantee the production of accessible states of arbitrarily large entropy. This suggests that some asymptotic observables may exist, despite the presence of an event horizon. Comparison with decelerating universes shows surprising similarities: Neither type suffers from the limitations encountered in de Sitter space, such as thermalization and boundedness of entropy. However, we argue that no realistic cosmology permits the global observations associated with an S-matrix.Comment: 16 pages, 5 figures; v2: minor editin

Feedback stabilization of dynamical systems with switched delays

We analyze a classification of two main families of controllers that are of interest when the feedback loop is subject to switching propagation delays due to routing via a wireless multi-hop communication network. We show that we can cast this problem as a subclass of classical switching systems, which is a non-trivial generalization of classical LTI systems with timevarying delays. We consider both cases where delay-dependent and delay independent controllers are used, and show that both can be modeled as switching systems with unconstrained switchings. We provide NP-hardness results for the stability verification problem, and propose a general methodology for approximate stability analysis with arbitrary precision. We finally give evidence that non-trivial design problems arise for which new algorithmic methods are needed

Strong screening in the plum pudding model

We study a generalized Thomson problem that appears in several condensed matter settings: identical point-charge particles can penetrate inside a homogeneously charged sphere, with global electro-neutrality. The emphasis is on scaling laws at large Coulombic couplings, and deviations from mean-field behaviour, by a combination of Monte Carlo simulations and an analytical treatment within a quasi-localized charge approximation, which provides reliable predictions. We also uncover a local overcharging phenomenon driven by ionic correlations alone