8366599
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches and are considered the state-of-the-art. Nevertheless, we see two aspects of these approaches which may be improved. First, high score under these algorithms' similarity measurement implies high probability of similarity between documents, which is different from high similarity of the documents. But how similar two documents are is what we really need to know. Second, there has to be a tradeoff between hash-code length and hash-code multiplicity in fingerprint paradigms, which makes it hard to maintain a satisfactory recall level while improving precision.
 In this paper our contributions are two-folded. First, we propose a framework for implementing the longest common subsequence (LCS) as a similarity measurement in reasonable computing time, which leads to both high precision and recall. Second, we present an algorithm to get a trustable partition from the LCS to reduce the negative impact from templates used in web page design. A comprehensive experiment was conducted to evaluate our method in terms of its effectiveness, efficiency, and quality of result. More specifically, the method has been successfully used to partition a set of 430 million web pages into 68 million subsets of similar pages, which demonstrates its effectiveness. For quality, we compared our method with simhash and a Cosine-based method through a sampling process (Cosine is compared to LCS as an alternative similarity measurement). The result showed that our algorithm reached an overall precision of 0.95 while simhash was 0.71 and Cosine was 0.82. At the same time our method obtains 1.86 times as much recall as simhash and 1.56 times as much recall as Cosine. Comparison experiment was also done for documents in the same web sites. For that, our algorithm, simhash and Cosine find almost the same number of true-positives at a precision of 0.91, 0.50 and 0.63 respectively. In terms of efficiency, our algorithm takes 118 hours to process the whole archive of 430 million topic-type pages on a cluster of six Linux boxes, at the same time the processing time of simhash and Cosine is 94 hours and 68 hours respectively. When considering the need of word segmentation for languages such as Chinese, the processing time of Cosine should be multiplied and in our experiment it is 602 hours.
27036823
A new method in multi-issue negotiation
In this paper we describe a mechanism for automated negotiation in which artificial agents can deal with a multiissue negotiation in a one-to-many way based on some strategies. The negotiation process are governed dynamically by some strategies that emphasize on the diverse processing methods under the considering of different commodity attributes, including dynamic delayed evaluation and response to the received offers, generation of offer group with the same utility. Our analysis shows that the mechanism ensures that bargaining agents could reach a better agreement automatically. We also implement a prototype system to verify the advantages of our mechanism
5460989
End-To-End Worst-Case Response Time Analysis for Hard Real-Time Distributed Systems
The verification of end-to-end response time for distributed hard real-time systems is quite necessary for safety-critical applications. Although current time analysis techniques can precisely analyze the response time, the performance is not quite satisfying, especially for large size distributed systems. This paper presents a novel end-to-end worst-case response time analysis approach for hard real-time distributed systems. This technique is based on the critical instant analysis and the canonical form transformation. It extends the traditional holistic analysis technique by exploiting the precedence relations between tasks on both different processors and the same processor. Simulation results have shown that this algorithm can achieve accurate results and offers good performance for systems with wide range of CPU utilizations and task set size, and therefore is applicable to schedulability analysis of complex distributed systems.
37162560
Fuzzy Control Strategy of Sub-mini Underwater Robots in Rectifying Control
119959033
Breast mass segmentation based on information theory
In this study, an information-based algorithm, called c-shells based deterministic annealing (CSDA), is proposed for breast mass segmentation on digital mammograms. CSDA recasts the fuzzy clustering concept into the probability framework and offers two improved features over existing clustering algorithms. First, it is a global minimization algorithm through mass constrained deterministic annealing rather than a local minimization method in the original fuzzy c-shells (FCS) approach. Second, the prototype in this algorithm is shell, which is more effective in segmentation with compact or hollow spherical shells compared to the standard deterministic annealing (DA) algorithm. Experimental results show that the information based CSDA clustering algorithm is a promising image segmentation technique for digital mammographic mass detection.
14334349
Learning Cascaded Reduced-Set SVMs Using Linear Programming
This paper proposes a simple and efficient detection framework that uses reduced-set kernels. We first describe our approach which reduces the number of kernels. A convex optimization method is used for calculating the reduced sets. Following this, we propose a method that optimally designs the cascade. Our experimental results indicate that our method minimizes complexity regarding the number of kernels in the cascaded structure while preserving the low error rates. Our algorithm generates the optimal weight of kernels for each cascade stage. This proposed algorithm achieves high detection-rates at low computational cost.
32346693
New Message Difference for MD4
This paper proposes several approaches to improve the collision attack on MD4 proposed byWang et al. First, we propose a new local collision that is the best for the MD4 collision attack. Selection of a good message difference is the most important step in achieving effective collision attacks. This is the first paper to introduce an improvement to the message difference approach of Wang et al., where we propose a new local collision. Second, we propose a new algorithm for constructing differential paths. While similar algorithms have been proposed, they do not support the new local collision technique. Finally, we complete a collision attack, and show that the complexity is smaller than the previous best work.