16923777
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method to identify redundant search engines in a very large-scale metasearch engine context. The general problem is equivalent to an NP hard problem -- the set-covering problem. Due to the large number of search engines that need to be considered and the large sizes of these search engines, approximate solutions must be developed. In this paper, we propose a general methodology to tackle this problem and within the context of this methodology, we propose several new heuristic algorithms for solving the set-covering problem.
9755561
A Treemap-Based Result Interface for Search Engine Users
Search engines and metasearch engines on the World Wide Web typically display representative information such as the result document titles and snippets in a one-dimensional ranked list. Alternatively, a few others such as Clusty and Kartoo cluster their results so that users can, to a certain extent, interact with documents, keywords and/or clusters. The number of documents that can be effectively presented in one screen is usually limited to between 10 and 20. In this paper, we propose a method based on treemap visualization that substantially improve the information compactness. In addition, it provides a few unique post-search interaction methods that enable a user to manage a large number of results. An online prototype system is built. Various experiments are designed and done to evaluate the efficiency, effectiveness and usability.
3399913
WISE-Integrator: A System for Extracting and Integrating Complex Web Search Interfaces of the Deep Web
We demonstrate WISE-Integrator - an automatic search interface extraction and integration tool. The basic research issues behind this tool will also be explained.
2888926
AllInOneNews: development and evaluation of a large-scale news metasearch engine
AllInOneNews is the largest news metasearch engine in the world, connecting to over 1,000 news sites over 150 countries. Implementing a large-scale metasearch engine like AllInOneNews needs to overcome unique challenges not faced by building small metasearch engines such as developing highly scalable search engine selection techniques. In this paper, we discuss these unique challenges and our solutions to these challenges. We also discuss some novel features of AllInOneNews such as highly automated solution and semantic query match. This paper also reports the results of a comparative evaluation of three commercial news search systems, one search engine - Google News and two metasearch engines - Mamma News and AllInOneNews. Several measures such as effectiveness, diversity and time-sensitivity are used to perform the comparison. Another contribution of this paper is that we introduce a novel scheme to compare multiple news search systems in a combined measure that takes both relevance and time-sensitivity of retrieved information into consideration.
12822673
Configuring Java-Based Web Application Development Environment for an Academic Setting
In this paper, we analyze the characteristics and constraints of a typical academic environment for web application development. A set of Java-based web technologies and tools are introduced and reviewed for such an environment. The motivation behind this work is to provide comprehensive resource for university faculty members and students about emerging technologies and available tools to facilitate rapid development of web applications.
15933707
Automatic extraction of web search interfaces for interface schema integration
This paper provides an overview of a technique for extracting information from the Web search interfaces of e-commerce search engines that is useful for supporting automatic search interface integration. In particular, we discuss how to group elements and labels on a search interface into attributes and how to derive certain meta-information for each attribute.
17480069
Similarity-based Web service matchmaking
With the increasing growth in popularity of Web services, matchmaking of relevant Web services becomes a significant challenge. Commonly, Web service is described by WSDL and published on UDDI registers. UDDI provides limited search facilities allowing only a keyword-based search of businesses, services, and the so called tModels based on names and identifiers. This category-based keyword-browsing method is clearly insufficient. Semantic Web service uses DAML-S instead of WSDL to represent capabilities of Web services. This improvement enables software agents or search engines to automatically find appropriate Web services via ontologies and reasoning algorithm enriched methods. However, the high cost of formally defining to the heavy and complicated services makes this improvement widespread adoption unlikely. To cope with these limitations, we have developed a suite of methods which assesses the similarity of Web services to achieve matchmaking. In particular, we present a conceptual model which classifies properties of Web services into four categories. For each category, a similarity assessment method has been given. In Web service matchmaking process, these similarity assessment methods can be used together or individually. Experiments highlight complementary contributions that our work makes to facilitate Web service matchmaking.
6719824
Performance modeling of multicast groups for multiplayer games in peer-to-peer networks
A computer game is usually considered as a finite state machine. For a distributed multiplayer game, state information has to be exchanged among its players when they move and interact in a virtual space. If the number of players is very large, only a small subset of the game entities, controlled by their players, is interested and forms a multicast group so as to reduce the information dissemination over the network. In this paper, analytical models are proposed for evaluating the performance of multicast groups with multiplayer games in peer-to-peer networks. The system modeling is based on two stochastic processes and their possible solutions in terms of game type, player activity, and entity vision size, mode of user input processing, and grouping strategy. The cost of game operations on consumed resources is introduced to characterize the performance measure. Numerical examples are demonstrated, which provide useful insights of the behaviors of such systems.
345054
An Evolutionary Algorithm for Parameters Identification in Parabolic Systems
In this paper we construct a novel evolutionary algorithm. It yields good performance on a collection of parabolic parameter identification problems. The algorithm has a good tolerability for the noise in the observed data. Even when the noise level is up to 10% we can also get such a good result.
44526903
Hamiltonicity, neighborhood intersections and the partially square graphs
Abstract Let G be a graph. The partially square graph G ∗ of G is a graph obtained from G by adding edges uv satisfying the conditions uv∉E(G), and there is some w∈N(u)∩N(v), such that N(w)⊆N(u)∪N(v)∪{u,v}. A non-negative rational sequence (a 1 ,a 2 ,…,a k+1 ) is called an LTW-sequence if the following conditions are satisfied: (1) a 1 ⩽1; (2) for arbitrary i 1 ,i 2 ,…,i h ∈{2,3,…,k+1},∑ j=1 h i j ⩽k+1 implies ∑ j=1 h (a i j −1)⩽1 . In this paper, we will use the technique of the vertex insertion on l -connected ( l=k,k−1 or k+1,k⩾2 ) graphs to provide a unified proof for G to be hamiltonian, traceable, 1 -hamiltonian or hamiltonian-connected, the sufficient conditions are expressed by weighted sums of the neighborhood intersections in G of independent sets in G ∗ , where the weights are LTW-sequences.
7810391
Refinement of Nmr-determined Protein Structures with Database Derived Distance Constraints
The protein structures determined by NMR (Nuclear Magnetic Resonance Spectroscopy) are not as detailed and accurate as those by X-ray crystallography and are often underdetermined due to the inadequate distance data available from NMR experiments. The uses of NMR-determined structures in such important applications as homology modeling and rational drug design have thus been severely limited. Here we show that with the increasing numbers of high quality protein structures being determined, a computational approach to enhancing the accuracy of the NMR-determined structures becomes possible by deriving additional distance constraints from the distributions of the distances in databases of known protein structures. We show through a survey on 462 NMR structures that, in fact, many inter-atomic distances in these structures deviate considerably from their database distributions and based on the refinement results on 10 selected NMR structures that these structures can actually be improved significantly when a selected set of distances are constrained within their high probability ranges in their database distributions.