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

Alternative derivation of the relativistic contribution to perihelic precession

An alternative derivation of the first-order relativistic contribution to perihelic precession is presented. Orbital motion in the Schwarzschild geometry is considered in the Keplerian limit, and the orbit equation is derived for approximately elliptical motion. The method of solution makes use of coordinate transformations and the correspondence principle, rather than the standard perturbative approach. The form of the resulting orbit equation is similar to that derived from Newtonian mechanics and includes first-order corrections to Kepler's orbits due to general relativity. The associated relativistic contribution to perihelic precession agrees with established first-order results. The reduced radius for the circular orbit is in agreement to first-order with that calculated from the Schwarzschild effective potential. The method of solution is understandable by undergraduate students.Comment: 12 pages, 2 figures. Accepted for publication in the American Journal of Physic

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

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

Logical Characterizations of Weighted Complexity Classes

Fagin’s seminal result characterizing NP in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted) models of computations. In this paper, we start the study of descriptive complexity based on weighted Turing machines over arbitrary semirings. We provide machine-independent characterizations (over ordered structures) of the weighted complexity classes NP[S], FP[S], FPLOG[S], FPSPACE[S], and FPSPACEpoly[S] in terms of definability in suitable weighted logics for an arbitrary semiring S. In particular, we prove weighted versions of Fagin’s theorem (even for arbitrary structures, not necessarily ordered, provided that the semiring is idempotent and commutative), the Immerman–Vardi’s theorem (originally for P) and the Abiteboul–Vianu–Vardi’s theorem (originally for PSPACE). We also discuss a recent open problem proposed by Eiter and Kiesel. Recently, the above mentioned weighted complexity classes have been investigated in connection to classical counting complexity classes. Furthermore, several classical counting complexity classes have been characterized in terms of particular weighted logics over the semiring N of natural numbers. In this work, we cover several of these classes and obtain new results for others such as NPMV, ⊕P, or the collection of real-valued languages realized by polynomial-time real-valued nondeterministic Turing machines. Furthermore, our results apply to classes based on many other important semirings, such as the max-plus and the min-plus semirings over the natural numbers which correspond to the classical classes MaxP[O(log n)] and MinP[O(log n)], respectively. © Guillermo Badia, Manfred Droste, Carles Noguera, and Erik Paul

Evolutionary design of a full-envelope full-authority flight control system for an unstable high-performance aircraft

The use of an evolutionary algorithm in the framework of H1 control theory is being considered as a means for synthesizing controller gains that minimize a weighted combination of the infinite norm of the sensitivity function (for disturbance attenuation requirements) and complementary sensitivity function (for robust stability requirements) at the same time. The case study deals with a complete full-authority longitudinal control system for an unstable high-performance jet aircraft featuring (i) a stability and control augmentation system and (ii) autopilot functions (speed and altitude hold). Constraints on closed-loop response are enforced, that representing typical requirements on airplane handling qualities, that makes the control law synthesis process more demanding. Gain scheduling is required, in order to obtain satisfactory performance over the whole flight envelope, so that the synthesis is performed at different reference trim conditions, for several values of the dynamic pressure, used as the scheduling parameter. Nonetheless, the dynamic behaviour of the aircraft may exhibit significant variations when flying at different altitudes, even for the same value of the dynamic pressure, so that a trade-off is required between different feasible controllers synthesized at different altitudes for a given equivalent airspeed. A multiobjective search is thus considered for the determination of the best suited solution to be introduced in the scheduling of the control law. The obtained results are then tested on a longitudinal non-linear model of the aircraft

The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis

In their recent work, Lehre and Nguyen (FOGA 2019) show that the univariate marginal distribution algorithm (UMDA) needs time exponential in the parent populations size to optimize the DeceptiveLeadingBlocks (DLB) problem. They conclude from this result that univariate EDAs have difficulties with deception and epistasis. In this work, we show that this negative finding is caused by an unfortunate choice of the parameters of the UMDA. When the population sizes are chosen large enough to prevent genetic drift, then the UMDA optimizes the DLB problem with high probability with at most $\lambda(\frac{n}{2} + 2 e \ln n)$ fitness evaluations. Since an offspring population size $\lambda$ of order $n \log n$ can prevent genetic drift, the UMDA can solve the DLB problem with $O(n^2 \log n)$ fitness evaluations. In contrast, for classic evolutionary algorithms no better run time guarantee than $O(n^3)$ is known (which we prove to be tight for the ${(1+1)}$ EA), so our result rather suggests that the UMDA can cope well with deception and epistatis. From a broader perspective, our result shows that the UMDA can cope better with local optima than evolutionary algorithms; such a result was previously known only for the compact genetic algorithm. Together with the lower bound of Lehre and Nguyen, our result for the first time rigorously proves that running EDAs in the regime with genetic drift can lead to drastic performance losses

Integrated Structure and Semantics for Reo Connectors and Petri Nets

In this paper, we present an integrated structural and behavioral model of Reo connectors and Petri nets, allowing a direct comparison of the two concurrency models. For this purpose, we introduce a notion of connectors which consist of a number of interconnected, user-defined primitives with fixed behavior. While the structure of connectors resembles hypergraphs, their semantics is given in terms of so-called port automata. We define both models in a categorical setting where composition operations can be elegantly defined and integrated. Specifically, we formalize structural gluings of connectors as pushouts, and joins of port automata as pullbacks. We then define a semantical functor from the connector to the port automata category which preserves this composition. We further show how to encode Reo connectors and Petri nets into this model and indicate applications to dynamic reconfigurations modeled using double pushout graph transformation

Extreme objects with arbitrary large mass, or density, and arbitrary size

We consider a generalization of the interior Schwarzschild solution that we match to the exterior one to build global C^1 models that can have arbitrary large mass, or density, with arbitrary size. This is possible because of a new insight into the problem of localizing the center of symmetry of the models and the use of principal transformations to understand the structure of space.Comment: 20 pages, 6 figures. Fixed one reference. Added a new equatio