Search

In the multistage reliability growth tests with instant and delayed fix modes, the failure data can be assumed to follow Weibull processes with different parameters at different stages. For the Weibull process within a stage, by the proper selection of prior distribution form and the parameters, a concise posterior distribution form is obtained, thus simplifying the Bayesian analysis. In the multistage tests, the improvement factor is used to convert the posterior of one stage to the prior of the subsequent stage. The conversion criterion is carefully analyzed to determine the distribution parameters of the subsequent stage's variable reasonably. Based on the mentioned results, a new synthetic Bayesian evaluation program and algorithm framework is put forward to evaluate the multistage reliability growth tests with instant and delayed fix modes. The example shows the effectiveness and flexibility of this method.

DNA sequencing by hybridization (SBH) is an important method in bioinformatics, and it has been proved to be a NP-hard problem in combinatorial optimization. It has two demerits which are the lower precision of solution and the lower speed of convergence in serial ACO?tabu search and evolutionary algorithm for DNA sequencing by hybridization. In this paper an improved parallel ACO algorithm (IPACO) was proposed for DNA sequencing by hybridization in this paper. It shows a better performance compared with serial ACO?tabu search and evolutionary algorithm in precision and convergence based on the experiments.

This paper studies the bitonic merge sort algorithm which is difficult to get the prospective sorted result for some odd sequence. We develop a new parallel sorting algorithm, increasing CCI (compare and conditionally interchange) operations, derived from the odd merge sort algorithm. The proposed algorithm is based on a divide-and-conquer strategy. First of all, the sequence to be sorted is decomposed in several groups that are sorted in parallel. After that, all groups are merged into a final, sorted sequence. Therefore, any odd bitonic sequence can be correctly sorted with the mended algorithm. Furthermore, the paper analyzes the computational complexity of the new algorithm and compares it with that of other well-known parallel sorting algorithms. It does not increase memory consumption, and keep the same complexity. Analytic results are compared with those of the sequential algorithm and parallel implementations of other sorting algorithms, obtaining that our proposal outperforms the other solutions.