Search results for "Crete"
showing 10 items of 2495 documents
Inversion of matrix pencils for generalized systems
1993
Abstract This paper clarifies the nature of the Leverrier-Faddeev algorithm for generalized and state-space systems. It presents useful diagrams for recursive computation of the coefficients of the characteristic polynomial and the coefficient matrices of the adjoint matrix for various matrix pencils. A simplified case covers recursive equations and diagrams for inversion of the second-order matrix pencil (Es2 + A1s + A0) where E may be singular. The appendix provides two examples of mechanical and heat exchange systems which can be described by the generalized models.
Unary Probabilistic and Quantum Automata on Promise Problems
2015
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
On the space of all regular operators from C(K) into C(K)
1988
AbstractIt is known that Lr(E, C(K)), the space of all regular operators from E into C(K), is a Riesz space for all Riesz spaces E if and only if K is Stonian. We prove that this statement holds if E is replaced by C(K), where K is a compact space, the cardinal number of which satisfies a certain condition.
EMERGENCE OF TRAVELLING WAVES IN SMOOTH NERVE FIBRES
2008
International audience; An approximate analytical solution characterizing initial condi- tions leading to action potential ¯ring in smooth nerve ¯bres is determined, using the bistable equation. In the ¯rst place, we present a non-trivial sta- tionary solution wave. Then, we extract the main features of this solution to obtain a frontier condition between the initiation of the travelling waves and a decay to the resting state. This frontier corresponds to a separatrix in the projected dynamics diagram depending on the width and the amplitude of the stationary wave.
Temporal aggregation in chain graph models
2005
The dependence structure of an observed process induced by temporal aggregation of a time evolving hidden spatial phenomenon is addressed. Data are described by means of chain graph models and an algorithm to compute the chain graph resulting from the temporal aggregation of a directed acyclic graph is provided. This chain graph is the best graph which covers the independencies of the resulting process within the chain graph class. A sufficient condition that produces a memory loss of the observed process with respect to its hidden origin is analyzed. Some examples are used for illustrating algorithms and results.
Random Logistic Maps II. The Critical Case
2003
Let (X n )∞ 0 be a Markov chain with state space S=[0,1] generated by the iteration of i.i.d. random logistic maps, i.e., X n+1=C n+1 X n (1−X n ),n≥0, where (C n )∞ 1 are i.i.d. random variables with values in [0, 4] and independent of X 0. In the critical case, i.e., when E(log C 1)=0, Athreya and Dai(2) have shown that X n → P 0. In this paper it is shown that if P(C 1=1)<1 and E(log C 1)=0 then (i) X n does not go to zero with probability one (w.p.1) and in fact, there exists a 0<β<1 and a countable set ▵⊂(0,1) such that for all x∈A≔(0,1)∖▵, P x (X n ≥β for infinitely many n≥1)=1, where P x stands for the probability distribution of (X n )∞ 0 with X 0=x w.p.1. A is a closed set for (X n…
A GALTON-WATSON BRANCHING PROCESS IN VARYING ENVIRONMENTS WITH ESSENTIALLY CONSTANT OFFSPRING MEANS AND TWO RATES OF GROWTH1
1983
Summary A Galton-Watson process in varying environments (Zn), with essentially constant offspring means, i.e. E(Zn)/mnα∈(0, ∞), and exactly two rates of growth is constructed. The underlying sample space Ω can be decomposed into parts A and B such that (Zn)n grows like 2non A and like mnon B (m > 4).
On Association Models Defined over Independence Graphs
1998
Conditions on joint distributions are given under which two variables will be conditionally associated whenever an independence graph does not imply a corresponding conditional independence statement. To this end the notions of parametric cancellation, of stable paths and of quasi-linear models are discussed in some detail.
Binary distributions of concentric rings
2014
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single parameter. It is an outstanding feature of these distributions that joint probabilities relate to evenly spaced concentric rings. Kronecker product characterizations make them computationally attractive for a large number of variables. We study the behavior of different measures of dependence and derive maximum likelihood estimates when all nodes are observed and when the inner node is hidden.
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.