824 research outputs found
Universal homogeneous causal sets
Causal sets are particular partially ordered sets which have been proposed as
a basic model for discrete space-time in quantum gravity. We show that the
class C of all countable past-finite causal sets contains a unique causal set
(U,<) which is universal (i.e., any member of C can be embedded into (U,<)) and
homogeneous (i.e., (U,<) has maximal degree of symmetry). Moreover, (U,<) can
be constructed both probabilistically and explicitly. In contrast, the larger
class of all countable causal sets does not contain a universal object.Comment: 14 page
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
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
Best usage of free-space capacitors in ASIC regulators
In this work we examine how to improve the performance of voltage regulators
in application specific integrated circuits (ASICs) by placing capacitors
into free layout space. The problem arising after layout, when there are
areas not covered by functional elements, is where to connect the free-space
capacitors (FSCs), as they can be connected to the input or the output net of
a voltage regulator. Therefore we designed a testbench for mathematical
calculations and one for simulations to identify the influence of a
capacitance connected at these certain positions. We mainly focused on PSR
analysis while not losing sight of transient effects. The results of
calculation and simulation illustrate that the best solution is to split the
capacitance half by half to both possible nets if no output capacitance was
installed during design. Otherwise a ratio of one to one for input capacitance to
output capacitance has to be set up for best performance
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 for a population size , 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
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 , 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
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 fitness
evaluations. Since an offspring population size of order
can prevent genetic drift, the UMDA can solve the DLB problem with fitness evaluations. In contrast, for classic evolutionary algorithms no
better run time guarantee than is known (which we prove to be tight
for the 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
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 theory of the exponential differential equations of semiabelian varieties
The complete first order theories of the exponential differential equations
of semiabelian varieties are given. It is shown that these theories also arises
from an amalgamation-with-predimension construction in the style of Hrushovski.
The theory includes necessary and sufficient conditions for a system of
equations to have a solution. The necessary condition generalizes Ax's
differential fields version of Schanuel's conjecture to semiabelian varieties.
There is a purely algebraic corollary, the "Weak CIT" for semiabelian
varieties, which concerns the intersections of algebraic subgroups with
algebraic varieties.Comment: 53 pages; v3: Substantial changes, including a completely new
introductio
- …