The old algorithm to solve 0-1 planning problem using DNA computing only searches the feasible solution set from all solution set, then we give an algorithm which can search optimization solution of 0-1 planning. prob...
详细信息
ISBN:
(纸本)1424400600
The old algorithm to solve 0-1 planning problem using DNA computing only searches the feasible solution set from all solution set, then we give an algorithm which can search optimization solution of 0-1 planning. problem from all solution set by encoding specially solution set, using technique of electrophoresis and fluorescence labeling technique, and then we give an example to explain the algorithm validity and correctness. We also give a kind of strategy to deal with the negative real number of value coefficient and the complexity of our algorithm is O(m).
Over the last decade, significant effort has been made in developing methods of facial expression analysis. Because of the limited data sets of facial expressions, comprehensive emotional facial expression recognition...
详细信息
ISBN:
(纸本)1424400600
Over the last decade, significant effort has been made in developing methods of facial expression analysis. Because of the limited data sets of facial expressions, comprehensive emotional facial expression recognition that is essential in he areas such as affective computing and human-machine interaction has not been well studied. This paper provides the Beiliang University Facial Expression Database, which includes 25 facial expressions (18 pure facial expressions, 3 mixed facial expressions and 4 complex facial expressions) and provides data of many unique emotional facial expressions not appeared in other face databases. The questionnaire investigation of videos of 18 pure facial expressions shows the effectiveness of the data. Facial expression recognition experiment on 9 pure facial expressions demonstrates the feasibility of multiple facial expression recognition.
In the mobile and resource-constrained ubiquitous computing environments, we need an effective Quality of Service (QoS) model to support dynamic service selection in tune with the variation of context. To serve this p...
详细信息
ISBN:
(纸本)1424400600
In the mobile and resource-constrained ubiquitous computing environments, we need an effective Quality of Service (QoS) model to support dynamic service selection in tune with the variation of context. To serve this purpose, we explore the concept of QoS and propose a context-based QoS model with hierarchical structure. Based on the context model, the QoS model can identify different types of context and evaluate the impact of context upon service selection through first-order logic inference and fuzzy logic evaluation. Quantitative methods are employed to quantify quality factors. The application of the model is demonstrated in the process of service selection. Two experiments have been conducted to evaluate the model. The result of the experiments has proved that with the application of the QoS model, service selection is of better scalability and performance.
Spatial information plays an increasingly important role in our society. In many situations, spatial information semantic understanding has often created barriers in spatial information sharing and interoperability. I...
详细信息
ISBN:
(纸本)1424400600
Spatial information plays an increasingly important role in our society. In many situations, spatial information semantic understanding has often created barriers in spatial information sharing and interoperability. In this paper, the inhere mechanism of spatial information semantics from the view of TFIG is studied. Based on this theory, spatial information semantic representation, equivalence, entailment are discussed, and an approach to achieve spatial information semantic computing is also proposed in this paper, which can better solve the barriers of semantic understanding in spatial information sharing and interoperability.
In mobile computing environment, the communication is asymmetric, the link is broken off frequently, and the user access patterns are diverse. In this paper, we focus on how to get the data which the user concerned ef...
详细信息
ISBN:
(纸本)1424400600
In mobile computing environment, the communication is asymmetric, the link is broken off frequently, and the user access patterns are diverse. In this paper, we focus on how to get the data which the user concerned effectively, and instantly In the paper, a method, which using data prefetch technology in parallel control system architecture, is proposed. Experiments results show that the performance of data access is enhanced. Compared with existing methods, the method enhanced the performance in terms of average time of data access and satisfied requirements of instant data access.
This paper presents a proportional sharing resource allocation strategy based on Nash equilibrium in grid computing. Given perfect information, the problem of resource allocation can be formulated as a multi-player ga...
详细信息
ISBN:
(纸本)1424400600
This paper presents a proportional sharing resource allocation strategy based on Nash equilibrium in grid computing. Given perfect information, the problem of resource allocation can be formulated as a multi-player game with the players being users purchasing computational service from a common resource. A computable Nash equilibrium for parallel tasks is derived to determine a grid user's bidding strategy. In particular, by introducing maximum entropy method, the initial Nash equilibrium problem can be converted into a differentiable optimal problem. The performance evaluation of the proposed Nash-based strategy is carried out under different configurations. The analytical and simulated results indicate that the Nash-based strategy is efficient, and has better performance than Round-Robin allocation.
In this paper a new technique for computing and ray tracing point based geometry is presented. It uses a novel point primitive that is called "Spherical Patch Point" (SPP) to approximate the vicinity of a su...
详细信息
ISBN:
(纸本)1424400600
In this paper a new technique for computing and ray tracing point based geometry is presented. It uses a novel point primitive that is called "Spherical Patch Point" (SPP) to approximate the vicinity of a surface point. Due to property of curvature, SPP can achieve similar visual quality compared with previous methods with much fewer primitives for the cost of a few additional bytes per point and thus makes a significant reduction in rendering time. During pre-process, important attributes are added to each SPP for the purpose of ray tracing. During rendering, an intersection algorithm different from previous ones has been demonstrated to get satisfied results. The proposed technique makes it possible to render high quality ray traced images with global illumination using SPPs. It offers a higher ray tracing speed in comparison with previous methods.
Text categorization is one of the important steps of many applications, e.g. webpage classification, indexing in search engine and information retrieval. When the number of documents available is huge, active learning...
详细信息
ISBN:
(纸本)1424400600
Text categorization is one of the important steps of many applications, e.g. webpage classification, indexing in search engine and information retrieval. When the number of documents available is huge, active learning could help relief the training time and cost. Moreover, active learning is able to filter out noisy samples for training and therefore may achieve better generalization capability. In this work, we adopt the localized generalization error model to active learning for text categorization. In our approach, the samples yielding the highest generalization error for those unseen samples local to it is selected as the next training sample. The feature extraction from raw documents is also discussed. Experimental results show that the proposed method is effective in reducing the number of training samples and achieves good generalization capability.
Differential Evolution (DE) is a new branch of Evolutionary Algorithms (EAs) and has been successfully applied to solve the optimal reactive power now (ORPF) problems in power systems. Although DE can avoid premature ...
详细信息
ISBN:
(纸本)1424400600
Differential Evolution (DE) is a new branch of Evolutionary Algorithms (EAs) and has been successfully applied to solve the optimal reactive power now (ORPF) problems in power systems. Although DE can avoid premature convergence, large population is needed and the application of DE is limited in large-scale power systems. Grid computing, as a prevalent paradigm for resource-intensive scientific application, is expected to provide a computing platform with tremendous computational power to speed up the optimization process of DE. When implanting DE based ORPF on grid system, fault tolerance due to unstable environment and variation of grid is a significant issue to be considered. In this paper, a fault tolerant DE-based ORPF method is proposed. In this method, when the individuals are distributed to the grid for fitness evaluation, a proportion of individuals, which returns from the grid slowly or fails to return, are replaced with new individuals generated randomly according to some specific rules. This approach can deal with the fault tolerance and also maintain diversity of the population of DE. The superior performance of the proposed approach is verified by numerical simulations on the ORPF problem of the IEEE 118-bus standard power system.
The network security problem has become a critical issue and many approaches have been proposed to tackle the information security problems, especially the Denial of Service (DoS) attacks. Multiple Classifier System (...
详细信息
暂无评论