Search results for "algorithm"
showing 10 items of 4887 documents
Structure Learning in Nested Effects Models
2007
Nested Effects Models (NEMs) are a class of graphical models introduced to analyze the results of gene perturbation screens. NEMs explore noisy subset relations between the high-dimensional outputs of phenotyping studies, e.g., the effects showing in gene expression profiles or as morphological features of the perturbed cell. In this paper we expand the statistical basis of NEMs in four directions. First, we derive a new formula for the likelihood function of a NEM, which generalizes previous results for binary data. Second, we prove model identifiability under mild assumptions. Third, we show that the new formulation of the likelihood allows efficiency in traversing model space. Fourth, we…
Eleccion de variables en regresion lineal un problema de decision
1986
A general structure for the problem of selection of variables in regression is proposed using the decision theory framework. In particular, some results for the choice of the best linear normal homocedastic model are obtained when the main purpose is either to specify the predictive distribution over the response variable or to obtain a point estimate of it. A comparison of our results with the most widespread classical ones is presented
RabbitMash: accelerating hash-based genome analysis on modern multi-core architectures
2020
Abstract Motivation Mash is a popular hash-based genome analysis toolkit with applications to important downstream analyses tasks such as clustering and assembly. However, Mash is currently not able to fully exploit the capabilities of modern multi-core architectures, which in turn leads to high runtimes for large-scale genomic datasets. Results We present RabbitMash, an efficient highly optimized implementation of Mash which can take full advantage of modern hardware including multi-threading, vectorization and fast I/O. We show that our approach achieves speedups of at least 1.3, 9.8, 8.5 and 4.4 compared to Mash for the operations sketch, dist, triangle and screen, respectively. Furtherm…
Newton algorithm for Hamiltonian characterization in quantum control
2014
We propose a Newton algorithm to characterize the Hamiltonian of a quantum system interacting with a given laser field. The algorithm is based on the assumption that the evolution operator of the system is perfectly known at a fixed time. The computational scheme uses the Crank-Nicholson approximation to explicitly determine the derivatives of the propagator with respect to the Hamiltonians of the system. In order to globalize this algorithm, we use a continuation method that improves its convergence properties. This technique is applied to a two-level quantum system and to a molecular one with a double-well potential. The numerical tests show that accurate estimates of the unknown paramete…
Resuming Shapes with Applications
2004
Many image processing tasks need some kind of average of different shapes. Frequently, different shapes obtained from several images have to be summarized. If these shapes can be considered as different realizations of a given random compact set, then the natural summaries are the different mean sets proposed in the literature. In this paper, new mean sets are defined by using the basic transformations of Mathematical Morphology (dilation, erosion, opening and closing). These new definitions can be considered, under some additional assumptions, as particular cases of the distance average of Baddeley and Molchanov. The use of the former and new mean sets as summary descriptors of shapes is i…
New adaptive synchronization algorithm for a general class of complex hyperchaotic systems with unknown parameters and its application to secure comm…
2022
Abstract The aim of this report is to investigate an adaptive synchronization (AS) for the general class of complex hyperchaotic models with unknown parameters and a new algorithm to achieve this type of synchronization is proposed. Owing to the intricacy behavior of hyperchaotic models that could be effective in secure communications, the special control based on adaptive laws of parameters is constructed analytically, and the corresponding simulated results are performed to validate the algorithm’s accuracy. The complex Rabinovich model is utilized as an enticing example to examine the proposed synchronization technique. A strategy for secure communication improving the overall cryptosyst…
Diseño muestral optimo en el caso de no respuesta
1982
Discussed here are several aspects of a simple model for dealing with nonresponse. The model is, in a sense, a sequential one and is developed from a Bayesian decision theory point of view. Within this framework we examine how formalization and combination of one's opinions, and past experience concerning the proportion of nonrespondents, the differences and relations between respondents and nonrespondents, the cost of obtaining information from nonrespondents, etc. We examine the decisions concerning the selection of sampling size m and n, both in the nonrespondent population and in the overall population
On implementation of the Gibbs sampler for estimating the accuracy of multiple diagnostic tests
2010
Implementation of the Gibbs sampler for estimating the accuracy of multiple binary diagnostic tests in one population has been investigated. This method, proposed by Joseph, Gyorkos and Coupal, makes use of a Bayesian approach and is used in the absence of a gold standard to estimate the prevalence, the sensitivity and specificity of medical diagnostic tests. The expressions that allow this method to be implemented for an arbitrary number of tests are given. By using the convergence diagnostics procedure of Raftery and Lewis, the relation between the number of iterations of Gibbs sampling and the precision of the estimated quantiles of the posterior distributions is derived. An example conc…
Contributed discussion on article by Pratola
2016
The author should be commended for his outstanding contribution to the literature on Bayesian regression tree models. The author introduces three innovative sampling approaches which allow for efficient traversal of the model space. In this response, we add a fourth alternative.
Steady-state and tracking analysis of a robust adaptive filter with low computational cost
2007
This paper analyses a new adaptive algorithm that is robust to impulse noise and has a low computational load [E. Soria, J.D. Martin, A.J. Serrano, J. Calpe, and J. Chambers, A new robust adaptive algorithm with low computacional cost, Electron. Lett. 42 (1) (2006) 60-62]. The algorithm is based on two premises: the use of the cost function often used in independent component analysis and a fuzzy modelling of the hyperbolic tangent function. The steady-state error and tracking capability of the algorithm are analysed using conservation methods [A. Sayed, Fundamentals of Adaptive Filtering, Wiley, New York, 2003], thus verifying the correspondence between theory and experimental results.