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.
18318137
Automatically Detecting Boolean Operations Supported by Search Engines, Towards Search Engine Query Language Discovery
Each Web search engine provides query language through which it can communicate with its users and retrieve corresponding results to user queries. Supporting Boolean operations is a major characteristic of the query language. In this paper, we propose a novel, fully automatic, query probing based approach to identify what Boolean operations that are supported by a search engines and their corresponding syntaxes. Experiments show high effectiveness and efficiency. Along with this, we also provide a Web application called SE-BOSS (Search Engine Boolean Operation Scanning System) for interested users.
19018721
Estimating Size of Search Engines in an Uncooperative Environment
The number of documents that are indexed by a search engine is referred to as the size of the search engine. The information about the size of each underlying search engine is essential for any metasearch engine to conduct search engine selection, result merging and a few other processes. Thus, effectively estimating the size of search engines is important for a metasearch engine that incorporates multiple autonomous search engines. In this paper, we propose an algorithm that achieves better accuracy compared to the other existing methods for estimating the size of search engines, without losing efficiency. Compared to the Sample-Resample approach, which is the best-known approach in literature, our technique also shows much better tolerance to unfavorable environments.
957553
A highly scalable and effective method for metasearch
A metasearch engine is a system that supports unified access to multiple local search engines. Database selection is one of the main challenges in building a large-scale metasearch engine. The problem is to efficiently and accurately determine a small number of potentially useful local search engines to invoke for each user query. In order to enable accurate selection, metadata that reflect the contents of each search engine need to be collected and used. This article proposes a highly scalable and accurate database selection method. This method has several novel features. First, the metadata for representing the contents of all search engines are organized into a single integrated representative. Such a representative yields both computational efficiency and storage efficiency. Second, the new selection method is based on a theory for ranking search engines optimally. Experimental results indicate that this new method is very effective. An operational prototype system has been built based on the proposed approach.
10943355
Constructing Interface Schemas for Search Interfaces of Web Databases
Many databases have become Web-accessible through form-based search interfaces (i.e., search forms) that allow users to specify complex and precise queries to access the underlying databases. In general, such a Web search interface can be considered as containing an interface schema with multiple attributes and rich semantic/meta information; however, the schema is not formally defined on the search interface. Many Web applications, such as Web database integration and deep Web crawling, require the construction of the schemas. In this paper, we introduce a schema model for complex search interfaces, and present a tool (WISE-iExtractor) for automatically extracting and deriving all the needed information to construct the schemas. Our experimental results on real search interfaces indicate that this tool is highly effective.
6001645
Towards a highly-scalable and effective metasearch engine
A metasearch engine is a system that supports uni ed access to multiple local search engines. Database selection is one of the main challenges in building a large-scale metasearch engine. The problem is to eAEciently and accurately determine a small number of potentially useful local search engines to invoke for each user query. In order to enable accurate selection, metadata that re ect the contents of each search engine need to be collected and used. In this paper, we propose a highly scalable and accurate database selection method. This method has several novel features. First, the metadata for representing the contents of all search engines are organized into a single integrated representative. Such a representative yields both computation eAEciency and storage eAEciency. Second, our selection method is based on a theory for ranking search engines optimally. Experimental results indicate that this new method is very e ective. An operational prototype system has been built based on the proposed approach.
9180158
Protocol Design of MPEG-4 Media Delivery with Active Networks
Traditionally, the Internet supports best effort service. The quality of service available to real time applications such as the delivery of video and audio is therefore difficult to predict and control. Two new technologies have emerged recently, namely the MPEG-4 standard and active network, for media data compression and data networking, respectively. MPEG-4 uses a content or object-based representation. It supports object-based scalability and, in particular, it allows the modification or editing of objects without having to first decode them. Active network allows program code to be loaded dynamically into network nodes. In this paper, we describe a system for real-time media delivery that exploits the strengths of MPEG-4 media encoding and active networks. It is based on a best-effort transport service. Our system performs congestion avoidance, error concealment, and media scalability.
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.
26994753
Efficient Scheduling for Reducing Load in the IMS Presence Service
9838468
A Semi-supervised SVM for Manifold Learning
Many classification tasks benefit from integrating manifold learning with semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel objective function that combines the manifold consistency of whole dataset with the hinge loss of class label prediction. This formulation results in a SVM-alike task operating on the kernel derived from the graph Laplacian, and is capable of capturing the intrinsic manifold structure of the whole dataset and maximizing the margin separating labelled examples. Results on face and handwritten digit recognition tasks show significant performance gain. The performance gain is particularly impressive when only a small training set is available, which is often the true scenario of many real-world problems
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.