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.
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.
39140575
GOPT-Resolution in Web Information Derivation
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.
598798
(k, m)-Catalan numbers and hook length polynomials for plane trees
Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is C"k","m(n)=1mn+1(mn+1)kn, which we call the (k,m)-Catalan number. For proving the hook length formulas, we also introduce a combinatorial family, (k,m)-ary trees, which are counted by the (k,m)-Catalan numbers.
27655175
A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs
In this paper we propose and analyze a localized convex-hull based algorithm to connect a maximal independent set. The cardinality of the resultant connected dominating set is at most 76 · opt +19, where opt is the size of a minimum connected dominating set. To our knowledge, this is a dramatic improvement compared to the best published results in the same context [1,6] . Our algorithm plays an important rule in efficiently constructing a virtual backbone for ad hoc and sensor networks.
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.
1165057
An Extensible Three-tier XML Dialogue System Architecture for Multimodal Interaction and Automated Agent Services
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.