Weighted Automata and Logics for Infinite Nested Words

Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties. Furthermore, Alur and Madhusudan introduced automata and equivalent logics for both finite and infinite nested words, thus extending B\"uchi's theorem to nested words. Recently, average and discounted computations of weights in quantitative systems found much interest. Here, we will introduce and investigate weighted automata models and weighted MSO logics for infinite nested words. As weight structures we consider valuation monoids which incorporate average and discounted computations of weights as well as the classical semirings. We show that under suitable assumptions, two resp. three fragments of our weighted logics can be transformed into each other. Moreover, we show that the logic fragments have the same expressive power as weighted nested word automata.Comment: LATA 2014, 12 page

Conjugation of injections by permutations

Let X be a countably infinite set, and let f, g, and h be any three injective self-maps of X, each having at least one infinite cycle. (For instance, this holds if f, g, and h are not bijections.) We show that there are permutations a and b of X such that h=afa^{-1}bgb^{-1} if and only if |X\Xf|+|X\Xg|=|X\Xh|. We also prove a version of this statement that holds for infinite sets X that are not necessarily countable. This generalizes results of Droste and Ore about permutations.Comment: 27 pages, 4 figure

A Myopic Adjustment Process Leading to Best-Reply Matching

stochastic adjustment process;best reply;mathcing;regret equilibrium

Mean-payoff Automaton Expressions

Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic mean-payoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions

Discounting in LTL

In recent years, there is growing need and interest in formalizing and reasoning about the quality of software and hardware systems. As opposed to traditional verification, where one handles the question of whether a system satisfies, or not, a given specification, reasoning about quality addresses the question of \emph{how well} the system satisfies the specification. One direction in this effort is to refine the "eventually" operators of temporal logic to {\em discounting operators}: the satisfaction value of a specification is a value in $[0,1]$, where the longer it takes to fulfill eventuality requirements, the smaller the satisfaction value is. In this paper we introduce an augmentation by discounting of Linear Temporal Logic (LTL), and study it, as well as its combination with propositional quality operators. We show that one can augment LTL with an arbitrary set of discounting functions, while preserving the decidability of the model-checking problem. Further augmenting the logic with unary propositional quality operators preserves decidability, whereas adding an average-operator makes some problems undecidable. We also discuss the complexity of the problem, as well as various extensions

Circadian and Ultradian Rhythms of Free Glucocorticoid Hormone Are Highly Synchronized between the Blood, the Subcutaneous Tissue, and the Brain

Total glucocorticoid hormone levels in plasma of various species, including humans, follow a circadian rhythm that is made up from an underlying series of hormone pulses. In blood most of the glucocorticoid is bound to corticosteroid-binding globulin and albumin, resulting in low levels of free hormone. Although only the free fraction is biologically active, surprisingly little is known about the rhythms of free glucocorticoid hormones. We used single-probe microdialysis to measure directly the free corticosterone levels in the blood of freely behaving rats. Free corticosterone in the blood shows a distinct circadian and ultradian rhythm with a pulse frequency of approximately one pulse per hour together with an increase in hormone levels and pulse height toward the active phase of the light/dark cycle. Similar rhythms were also evident in the subcutaneous tissue, demonstrating that free corticosterone rhythms are transferred from the blood into peripheral target tissues. Furthermore, in a dual-probe microdialysis study, we demonstrated that the circadian and ultradian rhythms of free corticosterone in the blood and the subcutaneous tissue were highly synchronized. Moreover, free corticosterone rhythms were also synchronous between the blood and the hippocampus. These data demonstrate for the first time an ultradian rhythm of free corticosterone in the blood that translates into synchronized rhythms of free glucocorticoid hormone in peripheral and central tissues. The maintenance of ultradian rhythms across tissue barriers in both the periphery and the brain has important implications for research into aberrant biological rhythms in disease and for the development of improved protocols for glucocorticoid therapy

Fourth order indirect integration method for black hole perturbations: even modes

On the basis of a recently proposed strategy of finite element integration in time domain for partial differential equations with a singular source term, we present a fourth order algorithm for non-rotating black hole perturbations in the Regge-Wheeler gauge. Herein, we address even perturbations induced by a particle plunging in. The forward time value at the upper node of the $(r^*,t)$ grid cell is obtained by an algebraic sum of i) the preceding node values of the same cell, ii) analytic expressions, related to the jump conditions on the wave function and its derivatives, iii) the values of the wave function at adjacent cells. In this approach, the numerical integration does not deal with the source and potential terms directly, for cells crossed by the particle world line. This scheme has also been applied to circular and eccentric orbits and it will be object of a forthcoming publication.Comment: This series of papers deals with EMRI for LISA. With the respect to the v1 version, the algorithm has been improved; convergence tests and references have been added; v2 is composed by 23 pages, and 6 figures. Paper accepted by Class. Quantum Gravity for the special issue on Theory Meets Data Analysis at Comparable and Extreme Mass Ratios (Capra and NRDA) at Perimeier Institute in June 201

Level-Based Analysis of the Population-Based Incremental Learning Algorithm

The Population-Based Incremental Learning (PBIL) algorithm uses a convex combination of the current model and the empirical model to construct the next model, which is then sampled to generate offspring. The Univariate Marginal Distribution Algorithm (UMDA) is a special case of the PBIL, where the current model is ignored. Dang and Lehre (GECCO 2015) showed that UMDA can optimise LeadingOnes efficiently. The question still remained open if the PBIL performs equally well. Here, by applying the level-based theorem in addition to Dvoretzky--Kiefer--Wolfowitz inequality, we show that the PBIL optimises function LeadingOnes in expected time $\mathcal{O}(n\lambda \log \lambda + n^2)$ for a population size $\lambda = \Omega(\log n)$, which matches the bound of the UMDA. Finally, we show that the result carries over to BinVal, giving the fist runtime result for the PBIL on the BinVal problem.Comment: To appea

Characterization of a 450-km Baseline GPS Carrier-Phase Link using an Optical Fiber Link

A GPS carrier-phase frequency transfer link along a baseline of 450 km has been established and is characterized by comparing it to a phase-stabilized optical fiber link of 920 km length, established between the two endpoints, the Max-Planck-Institut f\"ur Quantenoptik in Garching and the Physikalisch-Technische Bundesanstalt in Braunschweig. The characterization is accomplished by comparing two active hydrogen masers operated at both institutes. The masers serve as local oscillators and cancel out when the double differences are calculated, such that they do not constitute a limitation for the GPS link characterization. We achieve a frequency instability of 3 x 10^(-13) in 30 s and 5 x 10^(-16) for long averaging times. Frequency comparison results obtained via both links show no deviation larger than the statistical uncertainty of 6 x 10^(-16). These results can be interpreted as a successful cross-check of the measurement uncertainty of a truly remote end fiber link.Comment: 14 pages, 6 figure