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.
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.
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.
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.
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.