We present a series of fast and easily implemented algorithms for the computation of single and multivariate distributions of the order statistics for sequences of random variables which may be either independent or M...
详细信息
We present a series of fast and easily implemented algorithms for the computation of single and multivariate distributions of the order statistics for sequences of random variables which may be either independent or Markov. We discuss the computation of moments of L-statistics, principally means and Variances, and present algorithms which do not require that the distributions first be “differenced” to yield densities.
Abstract Basic data-driven and model-based process monitoring and fault diagnosis methods are surveyed from the application viewpoint. The main objective is to study the needed modifications and/or combined use of the...
详细信息
Abstract Basic data-driven and model-based process monitoring and fault diagnosis methods are surveyed from the application viewpoint. The main objective is to study the needed modifications and/or combined use of these methods under different real operating conditions.
The computational difficulty of DNA motif sequence finding algorithms is a well studied problem. One of the most promising directions in dealing with the challenges of a huge possible solution space are heuristic base...
详细信息
ISBN:
(纸本)9781467375467
The computational difficulty of DNA motif sequence finding algorithms is a well studied problem. One of the most promising directions in dealing with the challenges of a huge possible solution space are heuristic based methods. However, although there are various alternatives based on a stochastical model, there are few studies that look at differences across implementation methods. Generally recursive implementations are considered less desirable, due to the slower throughput rate and increased memory usage of recursion thus they are overlooked. In this article the goal is to illustrate differences in results of recursive versus iterative implementation of a stochastic, Monte-Carlo method based, nucleotide motif finding algorithm. To deal with the possible differences that may arise due to the internal construction of the pseudorandom function we have run the experiment on four implementations of the same algorithm, one iterative and one recursive on two programming languages. The experimental results presented in this article show that although both implementation tend to have the same central tendency for result value, recursive algorithms have better local optimum values and can potentially yield better results.
暂无评论