With the rapid development of service-oriented computing (SOC) and service-oriented architecture (SOA), the number of services is rapidly increasing. How to organize and manage services effectively in repositories to ...
详细信息
Grade serves as a fundamental quantitative index, and the graded rough set model is a basic model. Thus, this paper aims to investigate an original logical difference in the graded rough set model. According to the sp...
详细信息
The development of novel high-throughput experimental techniques makes it possible to comprehensively analyze biological data in health and disease. However, a large amount of data generated results in dramatic data-a...
详细信息
The distributed computations are widely used in the modern world for processing large scale jobs. Hadoop framework which is based on Google MapReduce model becomes popular due to its great processing power and ease to...
详细信息
Recent advances in mobile technologies have emerged new challenges for researchers. File management and retrieval on resource-limited devices has become a challenging problem as these devices are now equipped with lar...
详细信息
The coverage of Wireless Sensor Networks (WSNs) is one of the most important measurement criteria of Qos. Optimal coverage of sensors is propitious to the maximum possible utilization of the available sensors. It can ...
详细信息
Rule extraction is a main goal for rough set theory. This paper mainly constructs a new algorithm (LBRM Algorithm) for rule extraction based on rough membership. The confidence principle is established based on rough ...
详细信息
Aiming at the deficiency of the current meridian diagnosis algorithms, SVM is applied to meridian diagnosis system. The system structure is described firstly, then the model selection of SVM is discussed in detail by ...
详细信息
Aiming at the deficiency of the current meridian diagnosis algorithms, SVM is applied to meridian diagnosis system. The system structure is described firstly, then the model selection of SVM is discussed in detail by taking chronic pharyngitis as an example: one-against-one method is used to realize multi-class;the problem of non-symmetrical samples of C-SVM is solved by giving positive and negative samples of different weights;a margin-based bound on generalization method is used to search parameters of the model. Finally, test results show that the classifier, which is realized and tested using vc++6.0, possess a very high recognition rate and can be applied to meridian diagnosis system.
Because of OpenMP programs shielding the underlying parallel execution and scheduling details,data races and deadlocks are tend to occur during program ***,this paper puts forward the modeling method of OpenMP program...
详细信息
Because of OpenMP programs shielding the underlying parallel execution and scheduling details,data races and deadlocks are tend to occur during program ***,this paper puts forward the modeling method of OpenMP programs based on Petri *** flow of programs are modeled according to the semantics of program control statements and directives of OpenMP programs;Data flow of programs are modeled by abstracting read and write operations related to shared *** two detection algorithms of data race and deadlock for OpenMP program are given based on the coverability tree of Petri ***,corresponding software tool is designed and implemented,and an OpenMP program example of the dining philosophers problem is analyzed to indicate the effectiveness of this method and tools.
Particle swarm optimization (PSO) is a swarm intelligence technique that optimizes a problem by iterative exploration and exploitation in the search space. However, PSO cannot achieve the preservation of population di...
详细信息
Particle swarm optimization (PSO) is a swarm intelligence technique that optimizes a problem by iterative exploration and exploitation in the search space. However, PSO cannot achieve the preservation of population diversity on solving multimodal optimization problems, and once the swarm falls into local convergence, it cannot jump out of the local trap. In order to solve this problem, this paper presents a fast restarting particle swarm optimization (FRPSO), which uses a novel restarting strategy based on a discrete finite-time particle swarm optimization (DFPSO). Taking advantage of frequently speeding up the swarm to converge along with a greater exploitation capability and then jumping out of the trap, this algorithm can preserve population diversity and provide a superior solution. The experiment performs on twenty-five benchmark functions which consists of single-model, multimodal and hybrid composition problems, the experimental result demonstrates that the performance of the proposed FRPSO algorithm is better than the other three representatives of the advanced PSO algorithm on most of these functions.
暂无评论