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.
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.
36695959
Selective Ensemble Algorithms of Support Vector Machines Based on Constraint Projection
This paper proposes two novel ensemble algorithms for training support vector machines based on constraint projection technique and selective ensemble strategy. Firstly, projective matrices are determined upon randomly selected must-link and cannot-link constraint sets, with which original training samples are transformed into different representation spaces to train a group of base classifiers. Then, two selective ensemble techniques are used to learn the best weighting vector for combining them, namely genetic optimization and minimizing deviation errors respectively. Experiments on UCI datasets show that both proposed algorithms improve the generalization performance of support vector machines significantly, which are much better than classical ensemble algorithms, such as Bagging, Boosting, feature Bagging and LoBag.
15857630
Eliminating Redundant Communication of Code Generation for Distributed Memory Machines
How to eliminate redundant communications is a key issue in developing parallelizing compilers for distributed memory machines. An important way to improve the performance of the code generated by parallelizing compiler in distributed memory systems is to eliminate as much communications as possible. This paper investigates algorithms for generating communications code from previously published work and modifies them to eliminate redundant communications. Based on the mathematical model of symbolic coefficient linear inequalities the revisited formal specification of communications sets are presented and the corresponding improved algorithms are given. Experimental results indicate that the new algorithms can reduce communication messages and improve the performance of parallelized code significantly.
14940474
The Representation of Chinese Semantic Knowledge and its Application in the Document Copy Detection
Digital documents are easily copied and distributed ille- gally. Document copy detection is a powerful tool to pro- tect the author's intellectual property and to improve the efficiency of information retrieval. It is difficult for the ex- isting copy detection systems to identify the sentence struc- ture changed copies. To address the problem, we research the semantic level of natural language processing and pro- pose a document copy detection method based on Chinese semantic knowledge. We introduce the realization mecha- nisms of Chinese language analysis, which contains syn- tactic parsing and semantic analyzing. We also report on the experimental comparison the proposed method with the representative document copy detection systems. The result is satisfying.
14823691
MRF parameter estimation by MCMC method
Abstract Markov random field (MRF) modeling is a popular pattern analysis method and MRF parameter estimation plays an important role in MRF modeling. In this paper, a method based on Markov Chain Monte Carlo (MCMC) is proposed to estimate MRF parameters. Pseudo-likelihood is used to represent likelihood function and it gives a good estimation result.
14259461
Grid Unit: A Self-Managing Building Block for Grid System
Grid system software is inherently complex, hard to build and maintain. In this paper, we propose a self-managing building block: grid unit, which facilitates constructing grid system with higher availability and lower management overhead. We present an agent organization as autonomic management framework, and propose a self-recovering protocol to eliminate most of tough jobs from system administrator's routines. The system has been deployed on Dawning 4000A since 2004, the biggest node for China grid system. We have done extensive experiments to evaluate grid unit, and the collected log data shows the availability of a grid parallel process management service, built on the basis of grid unit, reaches 99.997%.