Search results for "binary"
showing 10 items of 833 documents
INTEGRAL long-term monitoring of the Supergiant Fast X-ray Transient XTE J1739-302
2008
In the past few years, a new class of High Mass X-Ray Binaries (HMXRB) has been claimed to exist, the Supergiant Fast X-ray Transients (SFXT). These are X-ray binary systems with a compact companion orbiting a supergiant star which show very short and bright outbursts in a series of activity periods overimposed on longer quiescent periods. Only very recently the first attempts to model the behaviour of these sources have been published, some of them within the framework of accretion from clumpy stellar winds.Our goal is to analyze the properties of XTE J1739-302/IGR J17391-3021 within the context of the clumpy structure of the supergiant wind. We have used INTEGRAL and RXTE/PCA observations…
Evolution in Recycling Scenario
2011
The recycling model argues the existence of an evolutionary connection between low mass X-ray binaries and radio millisecond pulsars. The main difficulties which this model finds in predict the parameters of the fully recycled millisecond pulsars, as mass and spin period, can be overcome by the onset of the so-called radio-ejection mechanism. This work is to provide observational support to the radio-ejection mechanism by inspecting the orbital and spin parameters of the known population of fully recycled radio pulsars and compare these with the expectation for the occurrence of this mechanism.
Hardware Computation of Moment Functions in a Silicon Retina Using Binary Patterns
2006
International audience; We present in this paper a method for implementing moment functions in a CMOS retina for shape recognition applications. The method is based on the use of binary patterns and it allows the computation of different moment functions such geometric and Zernike moments of any orders by an adequate choice of the binary patterns. The advantages of the method over other methods described in the literature is that it is particularly suitable for the design of a programmable retina circuit where moment functions of different orders are obtained by simply loading the correct binary patterns into the memory devices implemented on the circuit. The moment values computed by the m…
Extending CSG with projections: Towards formally certified geometric modeling
2015
We extend traditional Constructive Solid Geometry (CSG) trees to support the projection operator. Existing algorithms in the literature prove various topological properties of CSG sets. Our extension readily allows these algorithms to work on a greater variety of sets, in particular parametric sets, which are extensively used in CAD/CAM systems. Constructive Solid Geometry allows for algebraic representation which makes it easy for certification tools to apply. A geometric primitive may be defined in terms of a characteristic function, which can be seen as the zero-set of a corresponding system along with inequality constraints. To handle projections, we exploit the Disjunctive Normal Form,…
GW170814: A Three-Detector Observation of Gravitational Waves from a Binary Black Hole Coalescence
2017
On August 14, 2017 at 10 30:43 UTC, the Advanced Virgo detector and the two Advanced LIGO detectors coherently observed a transient gravitational-wave signal produced by the coalescence of two stellar mass black holes, with a false-alarm rate of 1 in 27 000 years. The signal was observed with a three-detector network matched-filter signal-to-noise ratio of 18. The inferred masses of the initial black holes are 30.5-3.0+5.7M and 25.3-4.2+2.8M (at the 90% credible level). The luminosity distance of the source is 540-210+130 Mpc, corresponding to a redshift of z=0.11-0.04+0.03. A network of three detectors improves the sky localization of the source, reducing the area of the 90% credible regio…
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
MODERATE DEVIATION PRINCIPLES FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS
2021
Bitseki and Delmas (2021) have studied recently the central limit theorem for kernel estimator of invariant density in bifurcating Markov chains models. We complete their work by proving a moderate deviation principle for this estimator. Unlike the work of Bitseki and Gorgui (2021), it is interesting to see that the distinction of the two regimes disappears and that we are able to get moderate deviation principle for large values of the ergodic rate. It is also interesting and surprising to see that for moderate deviation principle, the ergodic rate begins to have an impact on the choice of the bandwidth for values smaller than in the context of central limit theorem studied by Bitseki and …
CENTRAL LIMIT THEOREM FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS
2021
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the invariant probability measure which appears as the asymptotic distribution of the trait, we prove the consistence and the Gaussian fluctuations for a kernel estimator of this density based on late generations. In this setting, it is interesting to note that the distinction of the three regimes on the ergodic rate identified in a previous work (for fluctuations of average over large generations) disappears. This result is a first step to go beyond the thresh…
CENTRAL LIMIT THEOREM FOR BIFURCATING MARKOV CHAINS
2020
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We first provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (2007), where the considered additive functionals are sums of martingale increments, and only one regime appears. Our first result can be seen as a discrete time version, but with general trait evoluti…
All-Optical Measurement of Background, Amplitude and Timing Jitter for high speed pulse trains or prbs sequences using autocorrelation function
2006
We present a simple method for all-optical measurements of background, amplitude- and timing-jitter of ultra high speed pulse trains or prbs sequences using the jitter dependences of the intercorrelation-peak shape.