The static network shortest path algorithms have been developed thoroughly, whereas the studies for dynamic network shortest path algorithms are few. To satisfy the need of theoretical research and application, the dy...
详细信息
The static network shortest path algorithms have been developed thoroughly, whereas the studies for dynamic network shortest path algorithms are few. To satisfy the need of theoretical research and application, the dynamic network shortest path problems have been a hot spot in the field of geographic information science and computer science. When the weights of the network are functions with parameter, the network is called a dynamic network, in which it is difficult to resolve shortest path by the traditional algorithms. In this paper, we first propose the shortest path problem in a multi-stage weighted network with quadratic parameter. Next, we give the implicit enumerative labelling algorithm to look for the shortest path of this network based on the thought of the Dijkstra algorithm and the implicit enumerative method. Finally, we analyse the complexity of the algorithm. The theory analysis and the experiment indicate that the algorithm is not polynomial but effective for proper scale of the network.
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.
An adaptive strategy based stable link selection algorithm is proposed in this paper, in which the stable neighbor metric and local movement metric are defined. On the basis, the stability probability of each link is ...
详细信息
An adaptive strategy based stable link selection algorithm is proposed in this paper, in which the stable neighbor metric and local movement metric are defined. On the basis, the stability probability of each link is computed adoptively to find the most stable link or route in a route discovery. The simulation results show that our algorithm can effectively adapt to the network conditions, and outperforms the longevity factor based algorithm as well as the residual lifetime based algorithm in selecting stable links.
Distance histogram has been used for shape representation and retrieval. Though it is efficient and effective, it looses the spatial information of a contour. In this paper, the pixels of a contour are classified into...
详细信息
Distance histogram has been used for shape representation and retrieval. Though it is efficient and effective, it looses the spatial information of a contour. In this paper, the pixels of a contour are classified into different types, convex, concave and smooth pixels. In addition to distance histograms, two novel descriptors named spatial location distribution (SLD) and spatial distribution entropy (SDE) are introduced. These descriptors have powerful descriptive power for contour with more spatial information. Comparisons are conducted between our method and several other feature descriptors. The results show that the new method is efficient and it provides noticeable improvement to the performance of shape retrieval.
We consider the problem of a searcher that looks, for example, for a lost flashlight in a dusty environment. The search agent finds the flashlight as soon as it crosses the ray emanating from the flashlight, and in or...
详细信息
This paper presents research to develop an agricultural information system based on a call centre (Agrilnfo) by keylaboratory for Modern Precision Agriculture System Integration, China Agricultural University. Based ...
详细信息
This paper presents research to develop an agricultural information system based on a call centre (Agrilnfo) by keylaboratory for Modern Precision Agriculture System Integration, China Agricultural University. Based on investigations, we analyse user needs and the difficulties involved in developing the system. User needs, architecture, main components, functions and working processes of the system are described. Last, we discuss the piloted effects of Agrilnfo and draw conclusions. Valuable insights into the use of the call centre as a tele‐consultation tool in agriculture are highlighted. Agrilnfo was piloted in the north of China. It shows that Agrilnfo can remove barriers by transmitting agricultural information to rural areas and provide a multilayer information service to match different farmer demands.
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.
We propose a new 3D image segmentation method based on prediction, block-matching and partial 3D constraint in this paper. The algorithm only needs to set a few key points in the first image. We use intensity informat...
详细信息
We propose a new 3D image segmentation method based on prediction, block-matching and partial 3D constraint in this paper. The algorithm only needs to set a few key points in the first image. We use intensity information and block-matching to optimize the initial condition, and consider the 3D object's characteristics at the same time. By using the partial 3D constraints we can get the result of 2D and 3D smoothness. Experimental results validate its usefulness in 3D image segmentation.
FAQ(Frequently-asked Question) is a good question and answer model to realize business advisory system in restricted domain.A FAQ question answering system model is presented in this *** the help of the idea of ontolo...
详细信息
FAQ(Frequently-asked Question) is a good question and answer model to realize business advisory system in restricted domain.A FAQ question answering system model is presented in this *** the help of the idea of ontology, a knowledge base is constructed in the *** the help of language KDML (Knowledge Database Mark-up Language) of HowNet,the domain ontology and the relationship of it are defined and described, and the fusion of domain knowledge base (Domain HowNet) and common knowledge base(HowNet) is *** this basis, a question similarity calculation method, which makes use of the characteristics of the domain question and combines lexical relationship, syntactic interdependent relationship and the semantic relationship of domains among question sentences, is *** based on the question similarity calculation, retrieval of related question from the candidate question set and extraction of answers can be implemented with this *** result of Yunnan tourism question-answer model experiment shows that this method is feasible and effective.
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.
暂无评论