In the past decade, many papers about granular computing(GrC) have been published, but the keypoints about granular computing(GrC) are still unclear. In this paper, we try to find the key points of GrC in the informat...
详细信息
An Immune Genetic Algorithm (IGA) is used to solve weapon-target assignment problem (WTA). The used immune system serves as a local search mechanism for genetic algorithm. Besides, in our implementation, a new crossov...
详细信息
Predicting functional properties of proteins is needed in a number of applications. A protein is represented as an ordered list of amino acids, where each amino acid has a sequence and a structure component (the terms...
详细信息
Authorization mechanism is an effective technique of access control. In this paper, we construct a multidimensional authorization space for RSM with the guidance of the methodology of RSM design. This authorization sp...
详细信息
OWL-S Service Profile provides a way to describe services offered by providers and services needed by requesters. But some items in the Profile are not very suitable for describing a requester's demands while some...
详细信息
ISBN:
(纸本)9781577353386
OWL-S Service Profile provides a way to describe services offered by providers and services needed by requesters. But some items in the Profile are not very suitable for describing a requester's demands while some important information about the requester himself such as his identity which may play important role in precondition match are not considered in the Service Profile. In this paper we define an OWL compatible Request Profile ontology especially for service requesters to describe their special properties and their expectation about a service. Then a match algorithm is proposed to match service request described in Request Profile with service advertise described in Service Profile. The experiment results show that the match algorithm is efficient.
Due to the existence of a large amount of legacy information systems, how to obtain the information and integrate the legacy systems is becoming more and more concerned. This paper introduces the integration pattern b...
详细信息
In this paper, a 3D polar-radius surface moment is proposed, and is used for 3D model retrieval. 3D polar-radius surface moments are new moment invariants based on 3D polar-radius moments including the invariance on s...
详细信息
In this paper, a 3D polar-radius surface moment is proposed, and is used for 3D model retrieval. 3D polar-radius surface moments are new moment invariants based on 3D polar-radius moments including the invariance on shift, rotation and scale transforms. Compared to previous methods to compute such moments, the computational complexity for calculating 3D moments can be decreased considerably. With the help of these moment invariants, the 3D models are distinguished accurately.
Existing video research incorporates the use of relevance feedback based on user-dependent interpretations to improve the retrieval results. In this paper, we segregate the process of relevance feedback into 2 distinc...
详细信息
ISBN:
(纸本)9781595937025
Existing video research incorporates the use of relevance feedback based on user-dependent interpretations to improve the retrieval results. In this paper, we segregate the process of relevance feedback into 2 distinct facets: (a) recall-directed feedback;and (b) precision-directed feedback. The recall-directed facet employs general features such as text and high level features (HLFs) to maximize efficiency and recall during feedback, making it very suitable for large corpuses. The precision-directed facet on the other hand uses many other multimodal features in an active learning environment for improved accuracy. Combined with a performance-based adaptive sampling strategy, this process continuously re-ranks a subset of instances as the user annotates. Experiments done using TRECVID 2006 dataset show that our approach is efficient and effective. Copyright 2007 ACM.
A novel Pareto-based multi-objective fully-informed particle swarm algorithm (FIPS) is proposed to solve flexible job-shop problems in this paper. Firstly, the population is ranked based on Pareto optimal concept. And...
详细信息
A novel Pareto-based multi-objective fully-informed particle swarm algorithm (FIPS) is proposed to solve flexible job-shop problems in this paper. Firstly, the population is ranked based on Pareto optimal concept. And the neighborhood topology used in FIPS is based on the Pareto rank. Secondly, the crowding distance of individuals is computed in the same Pareto level for the secondary rank. Thirdly, addressing the problem of trapping into the local optimal, the mutation operators based on the coding mechanism are introduced into our algorithm. Finally, the performance of the proposed algorithm is demonstrated by applying it to several benchmark instances and comparing the experimental results.
In this paper a novel direct clustering algorithm based on generalized information distance (GID) is put forward. Firstly, based on information theory, a basic concept of measure of diversity is given and an inequalit...
详细信息
In this paper a novel direct clustering algorithm based on generalized information distance (GID) is put forward. Firstly, based on information theory, a basic concept of measure of diversity is given and an inequality about measure of diversity is proved. Based on this inequality, a concept of increment of diversity is discussed and a defined. Secondly, by analyzing distance measure, two new concepts of generalized information distance (GID) and improved generalized information distance (IGID) are proposed, and a new direct clustering algorithm based on GID and IGID is designed. Finally this algorithm is applied to soil fertility data processing, and compared with hierarchical clustering algorithm (HCA). The results of simulation application show that the algorithm presented here is feasible and effective. Because of simplicity of algorithm and robustness. It provides a new research approach for studies of pattern recognition theory.
暂无评论