With the rapid development of computer software, making the complexity of the software system increased dramatically, the inevitable cost of testing resources is also increasing. Under the conditions of limited resour...
详细信息
With the rapid development of computer software, making the complexity of the software system increased dramatically, the inevitable cost of testing resources is also increasing. Under the conditions of limited resources, how to better find the balance between resource consumption and reliability obtains more and more people's attention. Optimization of test resource allocation(OTRAPs) involves finding the optimal reliability, cost, etc. Therefore, the traditional test resource allocation optimization problem is a multi-objective optimization problem. In recent years, many effective algorithms, such as MOEA/D[15] and other famous algorithms, and achieved good results. However, the shortcomings of these algorithms are the use of a single operator and fixed neighborhood size, although the operator is not adapted to each search stage and small neighborhood size can accelerate convergence and big neighborhood size can get rid of the local optimal solution, The algorithm(DS-MAB-MOEA/D) we proposed based on the Multiarmed Bandit principle to adaptively select the excellent operator and neighborhood size in the pool during the different stages of evolution. Considering the retention of Pareto set's diversity, this paper embeded distance sorting algorithm in DS-MAB-MOEA/D algorithm and applies it to 16-module system, Experiments show that the algorithm is better than the MOEA/D algorithm.
Component-based software development method has gradually become the mainstream software development method, with the rapid development of component technology, the software development method of complex software syst...
详细信息
Component-based software development method has gradually become the mainstream software development method, with the rapid development of component technology, the software development method of complex software system with component design is more and more mature, but the software reliability analysis technology based on this technology is comparatively backward. At present, the component software reliability model does not consider the influence of component importance and complexity factors on software reliability, and presents the complexity analysis model of component software and the reliability evaluation model of important analysis model. In component-based software system, the granularity of component is usually less than the module, so based on the structure of component software, the complexity measure model with functional granularity is established, and the important measurement model is established according to the level, on the basis of which the state transition process between components is described as Markov process, This method calculates the reliability system-level reliability activity of software system by integrating component-level reliability evaluation. The feasibility of this method is validated by real time software, which is of great significance to the reliability evaluation of software development and the prediction of software reliability in the later stage.
This paper proposes a novel method for content-based image retrieval based on interest points. Interest points are detected from the scale and rotation normalized image. Then the normalized image is divided into a ser...
详细信息
This paper proposes a novel method for content-based image retrieval based on interest points. Interest points are detected from the scale and rotation normalized image. Then the normalized image is divided into a series of sector sub-regions with different area according to the distribution of interest points. With robustness to the image's rotation, scale and translation, local features of every sector sub-region are extracted to describe the image and make the similarity measure. In the relevant feedback phase, images are regarded as multi-instance (MI) bags, and the MI learning algorithm is employed to compute the target image feature. Finally, the similarity is recalculated. Experimental results show that our method can effectively describe the image, and obviously improve the average retrieval precision.
In this paper, a fast motion estimation algorithm is presented named as the Motion Vector Field and Direction Adaptive Search Technique. Early stop criteria is incorporated to recognize stationary macroblock;motion ve...
详细信息
In this paper, a fast motion estimation algorithm is presented named as the Motion Vector Field and Direction Adaptive Search Technique. Early stop criteria is incorporated to recognize stationary macroblock;motion vector field is used to predict the current motion activity and initial search point;Two novel directional adaptive search algorithms: the Line-Diamond Search and the Hexagon-Diamond Search are adaptively chosen by its motion activity. Experimental results show that the proposed algorithm can achieve fewer search points over other fast algorithms and can maintain smaller distortion error.
In this paper, a novel speckle reduction algorithm for SAR images based on contourlet transform was proposed. Logarithmic transform is first performed to convert the original multiplicative speckle noise into additive...
详细信息
In this paper, a novel speckle reduction algorithm for SAR images based on contourlet transform was proposed. Logarithmic transform is first performed to convert the original multiplicative speckle noise into additive noise. For noise can be effectively separated from real image signal in contourlet transform domain, a contourlet based hard thresholding algorithm is then applied. The Monte-Carlo method is adopted to estimate the statistics of contourlet coefficients for speckle noise, thus determining the optimal threshold set. To further improve the visual quality of despeckling, we also utilize the cycle-spinning technique. Experimental results show that the proposed contourlet based algorithm outperforms conventional algorithms in terms of both speckle reduction and edge preservation.
In this paper we propose a three dimensional multiplierless discrete cosine transform(DOT) with lifting scheme called 3D-binDCT. Based on 3D-binDCT, a novel video coding algorithm without motion estimation/compensat...
详细信息
In this paper we propose a three dimensional multiplierless discrete cosine transform(DOT) with lifting scheme called 3D-binDCT. Based on 3D-binDCT, a novel video coding algorithm without motion estimation/compensation is proposed. It uses the 3D-binDCT to exploit spatial or temporal redundancy. The computation of binDOT only needs shift and addition operations, thus the computational complexity is minimized. DO coefficient prediction, modified scan mode and arithmetic coding techniques are also adopted. Extensive simulation results show that the proposed coding scheme provides higher coding efficiency and improves visual aualitv, and it is easy to be realized by software and hardware.
Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate t...
详细信息
Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate the membrane protein's structure by wet-lab experiments,accurate and fast amino acid sequence-based computational methods are highly desired. In this paper, we report an online prediction tool called Mem Brain, whose input is the amino acid sequence. Mem Brain consists of specialized modules for predicting transmembrane helices, residue–residue contacts and relative accessible surface area of a-helical membrane proteins. Mem Brain achieves aprediction accuracy of 97.9% of ATMH, 87.1% of AP,3.2 ± 3.0 of N-score, 3.1 ± 2.8 of C-score. Mem BrainContact obtains 62%/64.1% prediction accuracy on training and independent dataset on top L/5 contact prediction,respectively. And Mem Brain-Rasa achieves Pearson correlation coefficient of 0.733 and its mean absolute error of13.593. These prediction results provide valuable hints for revealing the structure and function of membrane *** Brain web server is free for academic use and available at ***/bioinf/Mem Brain/.
This paper introduced a novel high performance algorithm and VLSI architectures for achieving bit plane coding (BPC) in word level sequential and parallel mode. The proposed BPC algorithm adopts the techniques of co...
详细信息
This paper introduced a novel high performance algorithm and VLSI architectures for achieving bit plane coding (BPC) in word level sequential and parallel mode. The proposed BPC algorithm adopts the techniques of coding pass prediction and parallel & pipeline to reduce the number of accessing memory and to increase the ability of concurrently processing of the system, where all the coefficient bits of a code block could be coded by only one scan. A new parallel bit plane architecture (PA) was proposed to achieve word-level sequential coding. Moreover, an efficient high-speed architecture (HA) was presented to achieve multi-word parallel coding. Compared to the state of the art, the proposed PA could reduce the hardware cost more efficiently, though the throughput retains one coefficient coded per clock. While the proposed HA could perform coding for 4 coefficients belonging to a stripe column at one intra-clock cycle, so that coding for an NxN code-block could be completed in approximate N2/4 intra-clock cycles. Theoretical analysis and experimental results demonstrate that the proposed designs have high throughput rate with good performance in terms of speedup to cost, which can be good alternatives for low power applications.
The overview presents the development and application of Hierarchical Temporal Memory (HTM). HTM is a new machine learning method which was proposed by Jeff Hawkins in 2005. It is a biologically inspired cognitive met...
详细信息
暂无评论