6906500
Web Appearance Disambiguation of Personal Names Based on Network Motif
Searching for information about a particular person is a common activity on search engines. However, current search engines do not provide any special function for search a person. Previous research has solved the problem by using additional background knowledge, such as a friend list, to cluster the searched Web pages. However, it is still difficult to retrieve and choose suitable background knowledge. In this paper, we propose a Web appearance disambiguation (WAD) system to solve the problem by only using the hyperlink structures between Web pages. The key idea of the WAD system is to find out smaller node motifs as evidences of close relationship between pages for clustering searched Web pages. Our experimental results show that, under no background knowledge, the performance of the WAD system achieves 70% for the F-measure
6388420
Proof: A DHT-Based Peer-to-Peer Search Engine
In this paper we focus on building a large scale keyword search service over structured peer-to-peer (P2P) networks. Current state-of-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be transmitted over the network. We propose a new P2P keyword search scheme, called "Proof", to reduce network traffic for queries. The key idea is storing a content summary for each Web page in the inverted list, so that a query can be processed by only transmitting a small size of candidate results. Our simulation results showed that, compared with previous DHT-based P2P systems, Proof can dramatically reduce network traffic and computation time. It provides 100% precision and 90.09% recall of search results, at an acceptable cost of storage overhead, even when the number of peers and documents increases continually
29113389
Approximate string matching in LDAP based on edit distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors. Against these problems "Edit distance" and "Soundex" are two common techniques, especially the latter one is a "sound-like" method and had been applied to the LDAP server. Nevertheless, it is not adequate for certain situations especially when we perform the symbol matching (as in DNA); it doesn't make sense to use the "sound-like" method. On the other hand, "Edit distance" has a clear definition and also is widely used in many fields of application. Since the design of LDAP server is optimized for reading, applying edit distance technique to LDAP server has the problem of lowering speed. In this paper we design efficient data structures and an algorithm to solve the speed problem, and furthermore we use three filter conditions [1] based on the n-gram technique to achieve a well filter performance. Finally we also demonstrate experimentally the benefits of applying our algorithm and its limitations.
11653478
Design and empirical evaluation of search software for legal professionals on the WWW
Abstract Our research focuses on designing effective search aids for legal researchers interested in law-related information on the world wide web. In this paper we report on the design and evaluation of two software systems developed to explore models for browsing and searching across a user-selected set of WWW sites. A directory services tool, LIBClient, provides a hierarchical index of legal information resources in an interface emphasizing ease-of-use by Internet novices and management of multiple-site searching. To study the relative effectiveness of LIBClient in the hands of legal professionals, nineteen law students were observed using LIBClient and, in separate trials, the popular general-purpose search services to perform known-item searches within a fixed time limit. The experiment indicates the value of LIBClient for focused searching, most properly as a supplement to general-purpose search engines. Motivated by observations from the LIBClient study, a second retrieval experiment explores the effectiveness of a radically different LIBClient design in which the LIBClient interface is combined with a crawler-enhanced search engine, IRISWeb. The LIBClient–IRISWeb system enables full-text searching using natural language queries across a set of WWW pages collected by the IRISWeb crawler. The page harvesting process relies on a cascading set of filters to define the final set of WWW pages to be collected, including user selections in LIBClient, search results from site-specific search engines, and the hyperlink structure at target sites. To evaluate the LIBClient–IRISWeb method, the queries used in the user study are submitted to the system, with excellent retrieval results. In conclusion, our research points to the promise of WWW search tool designs that tightly couple directed browsing with query-based search capabilities using new forms of search automation.
125681
Strengthening Zero-Knowledge Protocols Using Signatures
AbstractRecently there has been an interest in zero-knowledge protocols
with stronger properties, such as concurrency, simulation
soundness, non-malleability, and universal composability.
In this paper we show a novel technique to convert a large class of
existing honest-verifier zero-knowledge protocols into ones with these
stronger properties in the common reference string model.
More precisely, our technique utilizes a signature scheme
existentially unforgeable against adaptive chosen-message attacks, and
transforms any Σ-protocol (which is honest-verifier
zero-knowledge) into a simulation sound concurrent
zero-knowledge protocol. We also introduce Ω-protocols, a variant of
Σ-protocols for which our technique further achieves the properties of non-malleability and/or universal composability. In addition to its conceptual simplicity, a main advantage of this new technique over previous ones is that
it avoids the Cook-Levin theorem, which tends to be rather
inefficient. Indeed, our technique allows for very efficient instantiation
based on the security of some efficient signature schemes and standard
number-theoretic assumptions. For instance, one instantiation of our technique yields a universally composable zero-knowledge protocol under the
Strong RSA assumption, incurring an overhead of
a small constant number of exponentiations, plus the generation of two
signatures.
7799230
Passage feedback with IRIS
We compare a user-defined passage feedback (pf) system to a document feedback (df) system. Df employed the adaptive linear model for retrieval, while pf used weighted query expansion based on positive and negative feedback. Twenty-four searchers performed the same six tasks in varying search and system-order per TREC-8 guidelines. We hypothesized that pf, which featured interactive query expansion, would outperform df, which relied on automatic query expansion. Initial analysis appeared to reject this hypothesis, as df showed slightly higher overall performance than pf. However, analysis by system-order groups indicates only the first pf use had lower performance. These data suggest that pf was more difficult to learn than df, though the second pf use yielded competitive performance. If performance of pf is indeed affected by learning, an improved pf system with usability enhancements may prove to be an effective mechanism for interactive information retrieval.
5253044
Towards the classical communication complexity of entanglement distillation protocols with incomplete information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts nearly-perfect entanglement from imperfect entangled state. The classical communication complexity of these protocols is the minimal amount of classical information that needs to be exchanged for the conversion. In this paper, we focus on the communication complexity of protocols that operate with incomplete information, i.e., where the inputs are mixed states and/or prepared adversarially. We consider three models of imperfect entanglement, namely, the bounded measurement model, the depolarization model, and the fidelity model. We describe these models as well as the motivations for studying them. For the bounded measurement model and the depolarization model, we prove tight and almost-tight bounds on the output quality of non-interactive protocols. For the fidelity model, we prove a lower bound that matches the upper bound given by Ambainis et al., and thus completely characterizes communication complexity of entanglement distillation protocols for this model. Our result also suggests the optimality of the BB84 protocol in terms of communication complexity. We emphasize that although some of the results appear intuitively straightforward, their proofs are not. In fact, two novel techniques are developed for proving these results. We believe that these techniques are of independent interests, too.
895559
Co-Training and Expansion: Towards Bridging Theory and Practice
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical successes, yet previous theoretical analyses have needed very strong assumptions on the data that are unlikely to be satisfied in practice. 
 
In this paper, we propose a much weaker "expansion" assumption on the underlying data distribution, that we prove is sufficient for iterative co-training to succeed given appropriately strong PAC-learning algorithms on each feature set, and that to some extent is necessary as well. This expansion assumption in fact motivates the iterative nature of the original co-training algorithm, unlike stronger assumptions (such as independence given the label) that allow a simpler one-shot co-training to succeed. We also heuristically analyze the effect on performance of noise in the data. Predicted behavior is qualitatively matched in synthetic experiments on expander graphs.