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.
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.
27854712
Retrieval of Multimedia Web Documents and Removal of Redundant Information
This paper describes a search engine for multimedia web documents and a methodology for removing (partially or totally) redundant information from multiple documents in an effort to synthesize new documents. In this paper, a typical multimedia document contains free text and images and additionally has associating well-structured data. An SQL-like query language, WebSSQL, is proposed to retrieve this type of documents. The main differences between WebSSQL and other proposed SQL extensions for retrieving web documents are that WebSSQL is similarity-based and supports conditions on images. This paper also deals with the detection and removal of redundant information (text paragraphs and images) from multiple retrieved documents. Documents reporting the same or related events and stories may contain substantial redundant information. The removal of the redundant information and the synthesis of these documents into a single document can not only save a user's time to acquire the information but also storage space to archive the data. The methodology reported here consists of techniques for analyzing text paragraphs and images as well as a set of similarity criteria used to detect redundant paragraphs and images. Examples are provided to illustrate these techniques.
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.
33661341
Cycles of each length in tournaments
Let G = (V,A) be a digraph of order n. Digraph G is said to be arc-k-cyclic if each arc of G is contained in a cycle of length k (3 ≤ k ≤ n). An arc e of G is said to be pancyclic if e is contained in cycles of all lengths m, 3 ≤ m ≤ n. Digraph G is said to be arc-pancyclic if each arc of G is pancyclic. The main results of this paper are that (1) except for a certain family of counterexamples, every arc-3-cyclic tournament is arc-pancyclic; (2) at most one arc of an arc-3-cyclic tournament is not pancyclic.
7233121
PARMA: a PHY/MAC aware routing metric for ad-hoc wireless networks with multi-rate radios
Ad-hoc wireless networks with multi-rate radios (such as 802.11a, b, g) require a new class of MAC/PHY aware metrics that take into account factors such as physical-layer link speed and MAC-layer channel congestion. Conventional "layer 3" ad-hoc routing algorithms typically make routing decisions based on the minimum hop-count (MH). Use of the MH metric leads to the selection of paths with few hops, but one or more of these hops may turn out to be low-speed radio links due to adaptive rate selection at the physical layer We investigate a new cross-layer routing metric that takes into account both physical layer link speed and estimated channel congestion, thus aiming to minimize end-to-end delay that includes both transmission and access times. The proposed "PARMA" routing metric thus helps to spread the traffic across the "good links and nodes" in the network, increasing network capacity and reducing packet loss and delay. The paper presents the design and implementation of the proposed PARMA metric for proactive ad-hoc routing protocols, such as DSDV. DSDV modifications for incorporating the MAC/PHY aware metric into an ns-2 simulation model are given. Simulation results for typical multi-rate 802.11 ad-hoc network scenarios show that the proposed cross-layer PHY/MAC aware metric achieves significantly higher network throughput and decreases network congestion by selecting paths with high bit-rate links, while also avoiding areas of MAC congestion.
1394886
An approach for optimizing binding lifetime with mobile IPv6
In this paper an analytical model is presented in order to provide useful insight into the performance behaviour of mobile IPv6 in the context of a binding lifetime setting. By using this model, the optimal binding lifetime can be estimated in terms of a user mobility, traffic workload, and network structure. An algorithm for dynamically setting the binding lifetime in mobile IPv6 networks is proposed based on the analytical model. The numerical results of the system simulation are also demonstrated.
207751
PIDD: database for Protein Inter-atomic Distance Distributions
Protein Inter-atomic Distance Distributions (PIDD) is a dedicated database and structural bio-informatics system for distance based protein modeling. The database is developed to host and analyze the statistical data for protein inter-atomic distances based on their distributions in databases of known protein structures such as in the Protein Data Bank (PDB). PIDD is capable of generating, caching, and displaying the statistical distributions of the distances of various types and ranges. The collected information can be used to extract geometric restraints or mean-force potentials for protein structure determination including nuclear magnetic resonance structure determination and comparative model refinement. PIDD is supported with a friendly designed web interface so that users can easily specify the distance types and ranges, and retrieve, visualize or download the distributions of the distances as they desire. PIDD is freely accessible at
12670883
On Hadamard-Type Output Coding in Multiclass Learning
The error-correcting output coding (ECOC) method reduces the multiclass learning problem into a series of binary classifiers. In this paper, we consider the dense ECOC methods, combining an economical number of base learners. Under the criteria of row separation and column diversity, we suggest the use of Hadamard matrices to design output codes and show them better than other codes of the same size. Comparative experiments based on the support vector machines are made for some real datasets from the UCI machine learning repository.