Search results for "algorithm"
showing 10 items of 4887 documents
Block–Savits Characterization and Star Ordering of Exponential Mixtures
2008
Block and Savits (1980) established a characterization of life distributions using the Laplace transform. In this article, we remark that one of the necessary conditions to be IFRA distribution is equivalent to the star ordering of exponential mixtures. It leads to the definition of two new classes of life distributions, called LIFR and LIFRA, and their dual classes: LDFR and LDFRA. It occurs that these classes have many useful aging properties and preserve known reliability operations. Properties of the classes are studied and relations with known classes are established.
A simple comparative analysis of exact and approximate quantum error correction
2014
We present a comparative analysis of exact and approximate quantum error correction by means of simple unabridged analytical computations. For the sake of clarity, using primitive quantum codes, we study the exact and approximate error correction of the two simplest unital (Pauli errors) and nonunital (non-Pauli errors) noise models, respectively. The similarities and differences between the two scenarios are stressed. In addition, the performances of quantum codes quantified by means of the entanglement fidelity for different recovery schemes are taken into consideration in the approximate case. Finally, the role of self-complementarity in approximate quantum error correction is briefly ad…
Doubling the success of quantum walk search using internal-state measurements
2015
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it doubles the success probability of many quantum spatial search algorithms. For example, this allows Grover's unstructured search problem to be solved with certainty, rather than with probability 1/2 if only the walker's position is measured, so the additional measurement yields a search algorithm that is twice as fast as without it, on average. Thus the internal state of discrete-time quantum walks holds valuable information that can be utilized to improve a…
An Operator-Based Exact Treatment of Open Quantum Systems
2005
"Quantum mechanics must be regarded as open systems. On one hand, this is due to the fact that, like in classical physics, any realistic system is subjected to a coupling to an uncontrollable environment which influences it in a non-negligible way. The theory of open quantum systems thus plays a major role in many applications of quantum physics since perfect isolation of quantum system is not possible and since a complete microscopic description or control of the environment degrees of freedom is not feasible or only partially so" [1]. Practical considerations therefore force one to seek for a simpler, effectively probabilistic description in terms of an open system. There is a close physi…
Bayesian hierarchical models in manufacturing bulk service queues
2006
In this paper, Queueing Theory and Bayesian statistical tools are used to analyze the congestion of various manufacturing bulk service queues with the same characteristics that are working independently of one another and in equilibrium. Hierarchical models are discussed in order to develop the whole inferential process for the parameters governing the system. Markov Chain Monte Carlo methods and numerical inversion of transforms are addressed to compute the posterior predictive distributions of the usual measures of performance in practice.
fICA : FastICA Algorithms and Their Improved Variants
2019
Abstract In independent component analysis (ICA) one searches for mutually independent non gaussian latent variables when the components of the multivariate data are assumed to be linear combinations of them. Arguably, the most popular method to perform ICA is FastICA. There are two classical versions, the deflation-based FastICA where the components are found one by one, and the symmetric FastICA where the components are found simultaneously. These methods have been implemented previously in two R packages, fastICA and ica. We present the R package fICA and compare it to the other packages. Additional features in fICA include optimization of the extraction order in the deflation-based vers…
Random walk networks
2004
Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.
On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing
2011
Abstract Although random walks (RWs) with single-step transitions have been extensively studied for almost a century as seen in Feller (1968), problems involving the analysis of RWs that contain interleaving random steps and random “jumps” are intrinsically hard. In this article, we consider the analysis of one such fascinating RW, where every step is paired with its counterpart random jump. In addition to this RW being conceptually interesting, it has applications in testing of entities (components or personnel), where the entity is never allowed to make more than a prespecified number of consecutive failures. The article contains the analysis of the chain, some fascinating limiting proper…
On statistical inference for the random set generated Cox process with set-marking.
2007
Cox point process is a process class for hierarchical modelling of systems of non-interacting points in ℝd under environmental heterogeneity which is modelled through a random intensity function. In this work a class of Cox processes is suggested where the random intensity is generated by a random closed set. Such heterogeneity appears for example in forestry where silvicultural treatments like harvesting and site-preparation create geometrical patterns for tree density variation in two different phases. In this paper the second order property, important both in data analysis and in the context of spatial sampling, is derived. The usefulness of the random set generated Cox process is highly…
Powerful short-cuts for multiple testing procedures with special reference to gatekeeping strategies.
2007
In this paper we present a general testing principle for a class of multiple testing problems based on weighted hypotheses. Under moderate conditions, this principle leads to powerful consonant multiple testing procedures. Furthermore, short-cut versions can be derived, which simplify substantially the implementation and interpretation of the related test procedures. It is shown that many well-known multiple test procedures turn out to be special cases of this general principle. Important examples include gatekeeping procedures, which are often applied in clinical trials when primary and secondary objectives are investigated, and multiple test procedures based on hypotheses which are comple…