Evolutionary Negative Selection Algorithms (ENSAs) could be regarded as hybrid algorithms of Evolutionary Algorithms (EAs) and Negative Selection Algorithms (NSAs). The average time complexity of ENSAs on combinationa...
详细信息
Evolutionary Negative Selection Algorithms (ENSAs) could be regarded as hybrid algorithms of Evolutionary Algorithms (EAs) and Negative Selection Algorithms (NSAs). The average time complexity of ENSAs on combinational optimization problems has never been studied before. In this paper, the average time complexity of ENSAs on one combinational optimization problem is analyzed. The theoretical results demonstrate that, for the Two Max function, the ENSA with an appropriate matching threshold could perform better than the traditional (N+N) EA. Some simulation experiments on the combinational problem are also done, and the experimental results are consistent with theoretical results.
This paper presents a practical approach to design guard robot alarm system using GPRS technology. GPRS offers an interesting communications infrastructure for remotely accessing, controlling and interacting with robo...
详细信息
This paper presents a practical approach to design guard robot alarm system using GPRS technology. GPRS offers an interesting communications infrastructure for remotely accessing, controlling and interacting with robots in an integrated and highly portable manner, particularly in recent years the GPRS network provides wireless access of internet for mobile phone which becomes the most important and common terminal equipment. Therefore, in this paper the alarm information is designed to send to the user's mobile phone, and add man-made intervention to the system, thus achieves a more convenient and reliable alarm system. The system mainly consists of two parts: detection of abnormal and dangerous situation in domestic environment and sending the alarm information as MMS form to the user's phone via GPRS networks. Finally experiments show that the alarm system can accurately send alarm information to the user's mobile phone. The system is low-cost, flexible, reliable, and can be widely used.
With the rapid advance of computer and network technology, more and more applications are deployed in the customer-side network. These applications require different quality of service (QoS), but have to share a few b...
详细信息
With the rapid advance of computer and network technology, more and more applications are deployed in the customer-side network. These applications require different quality of service (QoS), but have to share a few bandwidth limited Internet connections. Owing to the IP network's best-effort delivery mechanism, the QoS requirements are hard to be satisfied. There have been plenty of QoS solutions in research and industry areas, however, few of them are easy to understand or to deploy. Therefore, we provide a solution, based on a simple and clear model, has the ability of transparently deployed at the inner side of customer's gateway device and controlled in the application-oriented way. We also introduce a straightforward QoS policy definition language to allow user to create QoS rules for various applications. We conduct the evaluation of our prototype system running upon mid-end industrial personal computer under both the lab test-bed and the practical network. In the lab test, our system achieves 200Mbps throughput, in the practical field test, our system successfully manages a 100Mbps Internet link for over 3000 active users.
Support vector machine is kind of novel machine learning method, based on statistical learning theory, which becomes the hotspot of machine learning because of its excellent learning performance. The method of support...
详细信息
The traditional syntactic service matchmaking is lack of semantic information with machine understandable, so it can not achieve intelligent service discovery. In this paper, the fuzzy nature of matchmaking is conside...
详细信息
ISBN:
(纸本)9781424441327
The traditional syntactic service matchmaking is lack of semantic information with machine understandable, so it can not achieve intelligent service discovery. In this paper, the fuzzy nature of matchmaking is considered, and the conceptions of linguistic variables in fuzzy logics are introduced into service matchmaker. The matchmaking linguistic variables and the fuzzy relationship matrix are defined, and conjunction degree of fuzzy key words sets is proposed to solve the semantic match problem between service description and service request. The research provides a new valuable way for studying intelligent service discovery.
Trace-driven cache simulation is the most widely used method to evaluate different cache structures. Several techniques have been proposed to reduce the simulation time of sequential trace-driven simulation. An obviou...
详细信息
Trace-driven cache simulation is the most widely used method to evaluate different cache structures. Several techniques have been proposed to reduce the simulation time of sequential trace-driven simulation. An obvious way to achieve fast parallel simulation is to simulate the individual independent sets of a cache concurrently on different compute resources. We propose improvements to current trace-driven simulation methods to make them faster and more economical. This paper considers the use of generic GPU to accelerate cache simulation which exploits set-partitioning as the main source of parallelism. We develop more efficient parallel simulation techniques by introducing more knowledge into the compute unified device architecture (CUDA) on the GPU. Our experimental result shows that the new algorithm can produce performance results for a number of set-associative caches in just a single simulation run and still produce the exact results.
In today's web, more and more software and applications are wrapped as services. However interactions between services are not always perfectly completed because of mismatches among them. Service mediation and ada...
详细信息
In today's web, more and more software and applications are wrapped as services. However interactions between services are not always perfectly completed because of mismatches among them. Service mediation and adaptation problems obtain increasingly concerns. In this paper, we propose an extension of interface automata, labelled interface automata, to illustrate mismatching services and adaptation. We characterize the problem by classifying different kinds of adaptation scenarios. Then we focus on how to use labelled interface automata to illustrate the building of adaption service between mismatching services.
Fuzzy time series forecasting model is an effective method to solve the nonlinear problems forecasting. However, most published fuzzy time series based models did not count the change trend implicit in historical datu...
详细信息
Fuzzy time series forecasting model is an effective method to solve the nonlinear problems forecasting. However, most published fuzzy time series based models did not count the change trend implicit in historical datum. In this paper, authors proposed a novel method which applied heuristic information to the fuzzy time series model based on Fibonacci sequence. As an example, the USD/JPY exchange rate is tested in this model. The results show that this method not only improves the forecasting accuracy, but decreases the computational complexity.
This paper presents an improved genetic algorithm for solving conic fitting problem. We first use several parallel small-populations genetic algorithms to obtain initial population, which has better average fitness. T...
详细信息
This paper presents an improved genetic algorithm for solving conic fitting problem. We first use several parallel small-populations genetic algorithms to obtain initial population, which has better average fitness. The range of mutation operator is also set to be gradually reduced with the growing of generation to guarantee the proportion of outstanding individuals within the population. An experiment shows that our improvements on genetic algorithm can remarkably increase the average fitness of population during evolution and enhance the performance of the algorithm as a whole.
This paper proposes a new method for measuring the complexity of software systems based on complex network theory. We first construct the complex network model for software system. Then, the complexity of a homogeneou...
详细信息
This paper proposes a new method for measuring the complexity of software systems based on complex network theory. We first construct the complex network model for software system. Then, the complexity of a homogeneous system is defined according to the entropy theory. With the experiments on open source software systems, we show that our method can reveal the complexity on different aspects of software systems,such as inheritance and understanding complexity.
暂无评论