3121075
Parameterized Compilability
Compilability is a measure of how effectively compilation (or preprocessing) can be applied to knowledge bases specified in a particular knowledge representation formalism; the aim of compilation is to allow for efficient, on-line query processing. A theory of compilability has been established for organizing knowledge representation formalisms according to a scheme of "compilability classes", and bears strong analogies to the classical theory of complexity, which permits the organization of computational problems according to complexity classes. We develop a novel theory of compilability, called parameterized compilability, which incorporates the notion of parameterization as used in parameterized complexity and permits for refined analysis of compilability.
27175112
Learnability of Relatively Quantified Generalized Formulas
In this paper we study the learning complexity of a vast class of quantifed formulas called Relatively Quantified Generalized Formulas. This class of formulas is parameterized by a set of predicates, called a basis. We give a complete classification theorem, showing that every basis gives rise to quantified formulas that are either polynomially learnable with equivalence queries, or not polynomially predictable with membership queries under some cryptographic assumption. We also provide a simple criteria distinguishing the learnable cases from the non-learnable cases.
9351295
Looking Algebraically at Tractable Quantified Boolean Formulas
We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were given by Kleine Buning, Subramani, and Zhao, and described proof-theoretically.
39653431
A Coalgebraic Approach to Kleene Algebra with Tests
Abstract Kleene Algebra with Tests is an extension of Kleene Algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene Algebra with Tests, along the lines of the coalgebraic theory of regular expressions based on deterministic automata. Since the known automata-theoretic presentation of Kleene Algebra with Tests does not lend itself to a coalgebraic theory, we define a new interpretation of Kleene Algebra with Tests expressions and a corresponding automata-theoretic presentation. One outcome of the theory is a coinductive proof principle, that can be used to establish equivalence of our Kleene Algebra with Tests expressions.
36722179
Inverse NP Problems
One characterization of the class NP is as the class of all languages for which there exists a polynomial-time verifier with the following properties: for every member of the language, there exists a polynomially-sized proof causing the verifier to accept; and, for every non-member, there is no proof causing the verifier to accept. Relative to a particular verifier, every member x of the language induces a set of proofs, namely, the set of proofs causing the verifier to accept x.
958592
Inverse Circumscription
Inverse (or identification) problems involve deciding whether or not an explicitly given set of data points have an implicit description, for instance, in the form of a constraint network. Such problems provide insight into the relationships among various representations of knowledge, which may have differing computational properties. This paper formalizes and studies the inverse circumscription problem, which (roughly speaking) is to decide, given a set of models, if there exists a formula whose circumscription describes the input set.
1381399
A Context-Aware HTML/XML Document Transmission Process for Mobile Wireless Clients
Delivery and rendering of HTML/XML documents has been a core task in many contemporary networking applications. In mobile wireless networks, efficient handling of these types of documents is necessary due to the frequent disconnections, packet loss, and high bit error rate. One approach to address the challenge is the ability to process and reuse the partial data. Current application protocols like HTTP cannot support this approach due to the following constraints: TCP's in-order data uploading to the applications and tag matching. We propose a context-aware transmission process (CATP) to run on top of UDP. This protocol does not transmit HTML/XML files in-order. Instead, it reorganizes the files and transmit tags first before transporting their enclosed data. Conforming browsers receive the file structures and fill in with subsequent data packets in whatever sequence they arrive. As a result, lost and delayed packets do not hinder rendering of those that are logically behind but have already arrived at the client sides. Thus the retransmission of the lost frames can be concealed and overall user perceived performance improved. The user-perceivable performance is quantified in terms of silent time during which no activity is observed at the browser display. The protocol also facilitates partial content caching, amortizing network transmission overhead, and non-interactive applications of Web services. We validated this protocol through prototype implementation and compared the performance with TCP and in-order delivery UDP schemes. Our protocol provides better user-perceivable performance under various loss rates and document sizes.
15293705
Design and evaluation of a multi-agent collaborative Web mining system
Most existing Web search tools work only with individual users and do not help a user benefit from previous search experiences of others. In this paper, we present the Collaborative Spider, a multi-agent system designed to provide post-retrieval analysis and enable across-user collaboration in Web search and mining. This system allows the user to annotate search sessions and share them with other users. We also report a user study designed to evaluate the effectiveness of this system. Our experimental findings show that subjects' search performance was degraded, compared to individual search scenarios in which users had no access to previous searches, when they had access to a limited number (e.g., 1 or 2) of earlier search sessions done by other users. However, search performance improved significantly when subjects had access to more search sessions. This indicates that gain from collaboration through collaborative Web searching and analysis does not outweigh the overhead of browsing and comprehending other users' past searches until a certain number of shared sessions have been reached. In this paper, we also catalog and analyze several different types of user collaboration behavior observed in the context of Web mining.
35410760
Collaborative Workflow Management for Interagency Crime Analysis
To strengthen homeland security, there is a critical need for new tools that can facilitate real time collaboration among various law enforcement agencies. Through a field study, we find that law enforcement work is knowledge intensive and involves complex collaborative processes interrelating a large number of disparate units in a loosely defined virtual organization. To support knowledge intensive collaboration, we propose a new workflow centric framework to seamlessly integrate previously separate techniques from the fields of information retrieval and workflow management. Specifically, we develop a collaborative workflow management framework for interagency crime analysis. The key contribution of our research is that by integrating various state-of-the-art techniques innovatively, the proposed system can support real time collaboration processes in a virtual organization that evolves dynamically.
21787077
Information Visualization for Collaborative Computing
Information technology continues to generate increasing amounts of data, most of which is useless without scalable methods to collect, analyze, process, and understand it. Visualization is a promising approach to such systemization because it lets users see underlying processes and guide process simulations interactively. However, visualization must be combined with some way to make repositories of text documents more manageable, providing users with a flexible, interactive environment in which to access them. The article describes a prototype tool that addresses these problems for GroupSystems, an electronic meeting system developed at the University of Arizona and installed at more than 1,500 business, government, and university settings. The tool automatically categorizes information, statistically clusters similar documents, and displays the organized document set graphically, providing more at-a-glance information than a typical text based display. Users can thus more easily browse document collections. The tool uses text analysis techniques that aim to identify descriptors and develop an unambiguous internal representation of a document.
34921454
Cognitive process as a basis for intelligent retrieval systems design
Abstract Two studies were conducted to investigate the cognitive processes involved in online document-based information retrieval. These studies led to the development of five computational models of online document retrieval. These models were then incorporated into the design of an “intelligent” document-based retrieval system. Following a discussion of this system, we discuss the broader implications of our research for the design of information retrieval systems.