2900457
Database selection in intranet mediators for natural language queries
7227804
Personalized web search by mapping user queries to categories
Current web search engines are built to serve all users, independent of the needs of any individual user. Personalization of web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to map a user query to a set of categories, which represent the user's search intention. This set of categories can serve as a context to disambiguate the words in the user's query. A user profile and a general profile are learned from the user's search history and a category hierarchy respectively. These two profiles are combined to map a user query into a set of categories. Several learning and combining algorithms are evaluated and found to be effective. Among the algorithms to learn a user profile, we choose the Rocchio-based method for its simplicity, efficiency and its ability to be adaptive. Experimental results indicate that our technique to personalize web search is both effective and efficient.
18981738
Dynamic Range Query in Spatial Network Environments
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solutions assume an open space environment, which are either not applicable to spatial network environment or require non-trivial extensions. In this paper, we consider a new class of query called Dynamic Range Query. A dynamic range query is a moving range query in a network environment, which retrieves the moving objects within a specified network distance of the moving query point. As this query point moves in the network, the footprint (or shape) of the query range changes accordingly to reflect the new relevant query area. Our execution strategy leverages computing power of the moving objects to reduce server load and communication costs. This scheme is particularly desirable for many practical applications such as vehicles in a street environment, where mobile energy is not an issue. We describe the design details and present our simulation study. The performance results indicate that our solution is almost two magnitudes better than a query index method in terms of server load, and requires similar number of messages when compared to a query-blind optimal scheme.
17825087
Feature Matrix Models for Information Extraction
To extract useful information which really contribute to the target issue from huge amounts of data or text description is an important task towards a number of research fields (e.g., genomics study and text mining). In this paper, a general feature matrix model (FMM) is proposed aiming to provide partial answer to this task. Specifically, one instantiation of FMM is used for identifying feature genes based on microarray data, and the other for extracting information according to case description.
43661392
Web Service for Communication Service Management
33837332
An object-oriented approach on Web information representation and derivation
A framework on Web information representation, extraction and derivation utilising the object-oriented approach is proposed. We define a structure which is similar to a class in object-oriented design and programming, and name it as an extended class (eclass). An eclass contains data attributes, member functions/methods, inference rules and presentations, and therefore, facilities information derivation and Web presentation. As an object-oriented approach, the framework also supports encapsulation, polymorphism, composition and inheritance. It can be implemented as an extension of an existing object-oriented programming language. An eclass can be extremely effective in content-dependent entity description. It describes a value under its context, consequently, the search engine not only searches the value, but also understands the meaning of the value in the context. We argue that information in any form or complexity can always be represented by instances of eclasses.
6044006
Making assumptions in the automated derivation
This paper proposes a mechanism to integrate conditional proof, which is an important proof technique in deductive logic, into logic programming to enhance the power of deduction. Concentrating on two existing resolution strategies--SLD-resolution and PT-resolution, it analyses the necessity and feasibility of the integration, and formulates the procedure.