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.
12401745
On splitting public keys for the public key infrastructure
Certificates and the public key infrastructure (PKI) play an vital role in electronic commerce. The framework of splitting the public key in the PKI is presented in this paper. Aimed to enhance the security level from both the perspectives of certificate issuing and certificate revocation, the framework splits the public key into multiple parts, and generates a certificate for each part. The framework is designed to be flexible to allow various levels of security depending on the requirements, while minimising changes to the existing e-commerce system and PKI. The key-split system maintains CA independence and allows for either smaller certificates or the size of key to be increased.
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.
11140869
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the major RDBMSs have provided full-text search capabilities, they still require users to have knowledge of the database schemas and use a structured query language to search information. This search model is complicated for most ordinary users. Inspired by the big success of information retrieval (IR) style keyword search on the web, keyword search in relational databases has recently emerged as a new research topic. The differences between text databases and relational databases result in three new challenges: (1) Answers needed by users are not limited to individual tuples, but results assembled from joining tuples from multiple tables are used to form answers in the form of tuple trees. (2) A single score for each answer (i.e. a tuple tree) is needed to estimate its relevance to a given query. These scores are used to rank the most relevant answers as high as possible. (3) Relational databases have much richer structures than text databases. Existing IR strategies to rank relational outputs are not adequate. In this paper, we propose a novel IR ranking strategy for effective keyword search. We are the first that conducts comprehensive experiments on search effectiveness using a real world database and a set of keyword queries collected by a major search company. Experimental results show that our strategy is significantly better than existing strategies. Our approach can be used both at the application level and be incorporated into a RDBMS to support keyword-based search in relational databases.
11582687
Web service enablement of communication services
In this paper, we introduce Web service application session services, WS-session, for Web service based application session management in communication. A two-way Web service framework is described. It supports the use of Web service in the situation of telecommunication where the communication endpoint can be both a client and a peer-to-peer server. We describe the interface design in two-way Web service interaction based on the concept of tightly coupled interface and loosely coupled interface solutions. The proposed approach provides full support of asynchronous outbound operations and event notifications in communication services. It is implemented in a research prototype system that provides both standard based (ECMA-348) services and Avaya service extensions. In addition, we investigated the integration of our proposed approach with BPEL4WS. It allows the user to create new services through a drag-n-drop based service creation environment (ECLIPSE/BPEL4WS). It leads to a paradigm of service creation through Web service composition. More sophisticated telecommunication services are created from composing the basic services.
8017889
An architecture of wireless Web and dialogue system convergence for multimodal service interaction over converged networks
This paper presents the software architecture for a new paradigm of wireless Web and dialogue system convergence and its corresponding approach to deliver multimodal multimedia enterprise communication services in the wireless environment. It uses an event-triggered service delivery method that separates service interaction and wireless web-based service delivery. A customized content presentation approach is adopted to transform the content of the service into a format suitable for presentation on the target devices. The system also contains a service delivery monitoring and backup mechanism, which is capable of sending the service content using other communication channels according to the user's preference and the channel conditions. A prototype system was implemented based on the proposed approach, which demonstrates the performance advantage of our method in the enterprise service application.
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.