8611890
Relevancy based semantic interoperation of reuse repositories
Software reuse is a promising solution to the software crisis. Reuse repositories are the basic infrastructure for software reuse. During the past decade, various academic, commercial, governmental, and industrial organizations have developed many Internet-enabled reuse repositories to provide access to software components and related resources. It has necessitated semantic interoperation to allow distributed maintenance and management of these repositories while enabling users to efficiently and conveniently access resources from multiple reuse repositories via a single representation view. In this paper, we have proposed an approach to enhancing the semantic interoperability of reuse repositories, called the improved relevancy matching and ranking (IRMR) method, based on analyzing the correlation of terms in representation methods of the repositories. A prototype system, the Virtual Repository supporting Semantic Interoperation (VRSI), is presented to illustrate the application of this approach to support the semantic interoperation of reuse repositories. Experimental results on real world reuse repositories demonstrated significant improvement in terms of searching effectiveness.
17864128
Traffic Localizing Strategy for Peer-to-Peer Systems
Topology mismatching problem between peer-to-peer overlay network and physical underlying network brings great stress to Internet infrastructure. This paper proposes a traffic localizing strategy (TLS), it keeps scalability property of current DHT algorithms and improves system routing performance by partitioning DHT key space associating with local physical information. Experiments based on CAN model show that the traffic localizing strategy can significantly alleviate the backbone link traffic burden. Meanwhile, the average routing hops are reduced.
14695418
Generic slow-motion replay detection in sports video
Slow-motion replays highlight important and exciting events in sports videos. Previous works for slow-motion replay detection, however, are usually limited to only some specific production rules such as frame repetition, special video effects and transitions. In this paper, we present a generic method for detecting slow-motion replays in sports video based on the difference of motions between slow-motion replays and normal shots within the same shot class. Experiments on different types of sports videos have verified our approach and achieve reasonable results.
5365763
An extended approach to improving the semantic interoperation among reuse epositories
Software reuse is widely believed as a feasible way to improve both the productivity and quality of software development. The developers must be capable to acquire enough desired components before developing with reuse. Many Internet-enabled reuse repositories exist to provide access to reusable resources. It is necessary to eliminate the semantic gaps of the repositories to enable users to access resources from multiple repositories via a single representation view. In some sense, the only usable information to mine the semantics of the terms representing the resources is the mutual components stored in the repositories. In this paper, the extended improved relevancy matching and ranking (EIRMR) method is proposed to enhance the semantic interoperability of reuse repositories, based on our previous work (IRMR) and the mutual components in the third-party repositories. Experimental results on the data sets from the real repositories demonstrated an improvement in terms of searching effectiveness.
38163613
Bayesian Learning for Image Retrieval Using Multiple Features
Image retrieval using multiple features often uses explicit weights that represent the importance of the features in their similarity metrics. In this paper, a novel retrieval method based on Bayesian Learning is presented. Instead of giving every feature a weight explicitly, the importance of a feature is regulated implicitly by learning a user's perception. Thus, the process of feature combination is adaptive and approximate to a user's perception. Experimental results demonstrate the significance of this method for improving the retrieval efficiency.
16543010
A novel multi-resolution video representation scheme based on kernel PCA
Content-based video analysis calls for efficient and flexible video representation. In this paper, a novel multi-resolution video representation (MRVR) scheme is proposed and realized by performing the kernel principal component analysis (KPCA) on the low-level visual features extracted from a video sequence. By simply changing the kernel parameters or the dimensionality of the subspace, this scheme can represent video content from coarser to finer levels in the subspace, according to its intrinsic structure. An application of keyframe extraction is investigated to show the advantages of this representation scheme. Furthermore, based on this scheme, a two-level video summarization approach is proposed to represent long video sequences. The experimental results of both short and long video sequences have demonstrated the effectiveness and flexibility of the proposed video representation scheme.
17584180
A compiler and runtime infrastructure for automatic program distribution
This paper presents the design and the implementation of a compiler and runtime infrastructure for automatic program distribution. We are building a research infrastructure that enables experimentation with various program partitioning and mapping strategies and the study of automatic distribution's effect on resource consumption (e.g., CPU, memory, communication). Since many optimization techniques are faced with conflicting optimization targets (e.g., memory and communication), we believe that it is important to be able to study their interaction. We present a set of techniques that enable flexible resource modeling and program distribution. These are: dependence analysis, weighted graph partitioning, code and communication generation, and profiling. We have developed these ideas in the context of the Java language. We present in detail the design and implementation of each of the techniques as part of our compiler and runtime infrastructure. Then, we evaluate our design and present preliminary experimental data for each component, as well as for the entire system.
734146
Using Description Logics Reasoner for Ontology Matching
Ontology matching produces correspondences between elements of two ontologies and it is a basic problem in many database application domains. A Description Logics-based ontology matching approach is proposed. The approach achieves the matching by means of semantic interpretation. The algorithm of deciding ontology correspondences (such as equivalence, more general, less general, disjointness, overlapping) is presented, which is reasoned based on concept inclusion. The reasoner RacerPro is selected to deduce ontology mapping, and the experimental results demonstrate that the approach is feasible.
15434765
A Dynamic Sub-vector Weighting Scheme for Image Retrieval with Relevance Feedback
In image retrieval with relevance feedback, feature components obtained from low-level descriptors are often weighted to reflect the high-level concepts and a user’s subjective perception embodied in the images labelled by the user in the feedback. However, the number of the labelled images is often small and an optimal weighting cannot be achieved in practice because of the singularity of the covariance matrix needed for weighting. To solve this problem, a dynamic sub-vector weighting scheme is proposed in this paper. In this scheme, a multi-dimensional feature vector is partitioned into multiple sub-vectors whose dimensions are dynamically adjusted to match the small number of available labelled images. Because of the lower dimensionality of the sub-vectors, the optimal weighting can be performed based on these sub-vectors, respectively. The multiple similarity scores obtained from sub-vector comparisons are then combined, as the final score, to rank the database images and determine the retrieval result. Experimental results demonstrated better performance of the proposed weighting scheme than some existing weighting schemes.