id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0206001 | Neural Net Model for Featured Word Extraction | cs.NE cs.NI | Search engines perform the task of retrieving information related to the
user-supplied query words. This task has two parts; one is finding "featured
words" which describe an article best and the other is finding a match among
these words to user-defined search terms. There are two main independent
approaches to achi... |
cs/0206003 | Handling Defeasibilities in Action Domains | cs.AI | Representing defeasibility is an important issue in common sense reasoning.
In reasoning about action and change, this issue becomes more difficult because
domain and action related defeasible information may conflict with general
inertia rules. Furthermore, different types of defeasible information may also
interfer... |
cs/0206004 | Mining All Non-Derivable Frequent Itemsets | cs.DB cs.AI | Recent studies on frequent itemset mining algorithms resulted in significant
performance improvements. However, if the minimal support threshold is set too
low, or the data is highly correlated, the number of frequent itemsets itself
can be prohibitively large. To overcome this problem, recently several
proposals hav... |
cs/0206006 | Robust Feature Selection by Mutual Information Distributions | cs.AI cs.LG | Mutual information is widely used in artificial intelligence, in a
descriptive way, to measure the stochastic dependence of discrete random
variables. In order to address questions such as the reliability of the
empirical value, one must consider sample-to-population inferential approaches.
This paper deals with the ... |
cs/0206007 | Using the Annotated Bibliography as a Resource for Indicative
Summarization | cs.CL cs.DL | We report on a language resource consisting of 2000 annotated bibliography
entries, which is being analyzed as part of our research on indicative document
summarization. We show how annotated bibliographies cover certain aspects of
summarization that have not been well-covered by other summary corpora, and
motivate w... |
cs/0206008 | Computer modeling of feelings and emotions: a quantitative neural
network model of the feeling-of-knowing | cs.AI cs.NE q-bio.NC q-bio.QM | The first quantitative neural network model of feelings and emotions is
proposed on the base of available data on their neuroscience and evolutionary
biology nature, and on a neural network human memory model which admits
distinct description of conscious and unconscious mental processes in a time
dependent manner. A... |
cs/0206013 | High-order fundamental and general solutions of convection-diffusion
equation and their applications with boundary particle method | cs.CE cs.CG | In this study, we presented the high-order fundamental solutions and general
solutions of convection-diffusion equation. To demonstrate their efficacy, we
applied the high-order general solutions to the boundary particle method (BPM)
for the solution of some inhomogeneous convection-diffusion problems, where the
BPM ... |
cs/0206014 | A Method for Open-Vocabulary Speech-Driven Text Retrieval | cs.CL | While recent retrieval techniques do not limit the number of index terms,
out-of-vocabulary (OOV) words are crucial in speech recognition. Aiming at
retrieving information with spoken queries, we fill the gap between speech
recognition and text retrieval in terms of the vocabulary size. Given a spoken
query, we gener... |
cs/0206015 | Japanese/English Cross-Language Information Retrieval: Exploration of
Query Translation and Transliteration | cs.CL | Cross-language information retrieval (CLIR), where queries and documents are
in different languages, has of late become one of the major topics within the
information retrieval community. This paper proposes a Japanese/English CLIR
system, where we combine a query translation and retrieval modules. We
currently targe... |
cs/0206016 | Distance function wavelets - Part III: "Exotic" transforms and series | cs.CE cs.CG | Part III of the reports consists of various unconventional distance function
wavelets (DFW). The dimension and the order of partial differential equation
(PDE) are first used as a substitute of the scale parameter in the DFW
transforms and series, especially with the space and time-space potential
problems. It is not... |
cs/0206017 | The Prioritized Inductive Logic Programs | cs.AI cs.LG | The limit behavior of inductive logic programs has not been explored, but
when considering incremental or online inductive learning algorithms which
usually run ongoingly, such behavior of the programs should be taken into
account. An example is given to show that some inductive learning algorithm may
not be correct ... |
cs/0206023 | Relational Association Rules: getting WARMeR | cs.DB cs.AI | In recent years, the problem of association rule mining in transactional data
has been well studied. We propose to extend the discovery of classical
association rules to the discovery of association rules of conjunctive queries
in arbitrary relational data, inspired by the WARMR algorithm, developed by
Dehaspe and To... |
cs/0206026 | Interleaved semantic interpretation in environment-based parsing | cs.CL cs.HC | This paper extends a polynomial-time parsing algorithm that resolves
structural ambiguity in input to a speech-based user interface by calculating
and comparing the denotations of rival constituents, given some model of the
interfaced application environment (Schuler 2001). The algorithm is extended to
incorporate a ... |
cs/0206027 | Behaviour-based Knowledge Systems: An Epigenetic Path from Behaviour to
Knowledge | cs.AI cs.AR cs.NE | In this paper we expose the theoretical background underlying our current
research. This consists in the development of behaviour-based knowledge
systems, for closing the gaps between behaviour-based and knowledge-based
systems, and also between the understandings of the phenomena they model. We
expose the requiremen... |
cs/0206028 | Knowledge management for enterprises (Wissensmanagement fuer
Unternehmen) | cs.IR cs.AI | Although knowledge is one of the most valuable resource of enterprises and an
important production and competition factor, this intellectual potential is
often used (or maintained) only inadequate by the enterprises. Therefore, in a
globalised and growing market the optimal usage of existing knowledge
represents a ke... |
cs/0206030 | A Probabilistic Method for Analyzing Japanese Anaphora Integrating Zero
Pronoun Detection and Resolution | cs.CL | This paper proposes a method to analyze Japanese anaphora, in which zero
pronouns (omitted obligatory cases) are used to refer to preceding entities
(antecedents). Unlike the case of general coreference resolution, zero pronouns
have to be detected prior to resolution because they are not expressed in
discourse. Our ... |
cs/0206034 | Applying a Hybrid Query Translation Method to Japanese/English
Cross-Language Patent Retrieval | cs.CL | This paper applies an existing query translation method to cross-language
patent retrieval. In our method, multiple dictionaries are used to derive all
possible translations for an input query, and collocational statistics are used
to resolve translation ambiguity. We used Japanese/English parallel patent
abstracts t... |
cs/0206035 | PRIME: A System for Multi-lingual Patent Retrieval | cs.CL | Given the growing number of patents filed in multiple countries, users are
interested in retrieving patents across languages. We propose a multi-lingual
patent retrieval system, which translates a user query into the target
language, searches a multilingual database for patents relevant to the query,
and improves the... |
cs/0206036 | Language Modeling for Multi-Domain Speech-Driven Text Retrieval | cs.CL | We report experimental results associated with speech-driven text retrieval,
which facilitates retrieving information in multiple domains with spoken
queries. Since users speak contents related to a target collection, we produce
language models used for speech recognition based on the target collection, so
as to impr... |
cs/0206037 | Speech-Driven Text Retrieval: Using Target IR Collections for
Statistical Language Model Adaptation in Speech Recognition | cs.CL | Speech recognition has of late become a practical technology for real world
applications. Aiming at speech-driven text retrieval, which facilitates
retrieving information with spoken queries, we propose a method to integrate
speech recognition and retrieval methods. Since users speak contents related to
a target coll... |
cs/0206039 | Hidden Markov model segmentation of hydrological and enviromental time
series | cs.CE cs.NA math.NA nlin.CD physics.data-an | Motivated by Hubert's segmentation procedure we discuss the application of
hidden Markov models (HMM) to the segmentation of hydrological and enviromental
time series. We use a HMM algorithm which segments time series of several
hundred terms in a few seconds and is computationally feasible for even longer
time serie... |
cs/0206041 | Anticipatory Guidance of Plot | cs.AI | An anticipatory system for guiding plot development in interactive narratives
is described. The executable model is a finite automaton that provides the
implemented system with a look-ahead. The identification of undesirable future
states in the model is used to guide the player, in a transparent manner. In
this way,... |
cs/0207001 | National Infrastructure Contingencies: Survey of Wireless Technology
Support | cs.DC cs.CE | In modern society, the flow of information has become the lifeblood of
commerce and social interaction. This movement of data supports most aspects of
the United States economy in particular, as well as, serving as the vehicle
upon which governmental agencies react to social conditions. In addition, it is
understood ... |
cs/0207002 | Using eigenvectors of the bigram graph to infer morpheme identity | cs.CL | This paper describes the results of some experiments exploring statistical
methods to infer syntactic behavior of words and morphemes from a raw corpus in
an unsupervised fashion. It shares certain points in common with Brown et al
(1992) and work that has grown out of that: it employs statistical techniques
to analy... |
cs/0207003 | Analysis of Titles and Readers For Title Generation Centered on the
Readers | cs.CL | The title of a document has two roles, to give a compact summary and to lead
the reader to read the document. Conventional title generation focuses on
finding key expressions from the author's wording in the document to give a
compact summary and pays little attention to the reader's interest. To make the
title play ... |
cs/0207005 | Efficient Deep Processing of Japanese | cs.CL | We present a broad coverage Japanese grammar written in the HPSG formalism
with MRS semantics. The grammar is created for use in real world applications,
such that robustness and performance issues play an important role. It is
connected to a POS tagging and word segmentation tool. This grammar is being
developed in ... |
cs/0207008 | Agent Programming with Declarative Goals | cs.AI cs.PL | A long and lasting problem in agent research has been to close the gap
between agent logics and agent programming frameworks. The main reason for this
problem of establishing a link between agent logics and agent programming
frameworks is identified and explained by the fact that agent programming
frameworks have not... |
cs/0207010 | Symmetric boundary knot method | cs.CE cs.CG | The boundary knot method (BKM) is a recent boundary-type radial basis
function (RBF) collocation scheme for general PDEs. Like the method of
fundamental solution (MFS), the RBF is employed to approximate the
inhomogeneous terms via the dual reciprocity principle. Unlike the MFS, the
method uses a nonsingular general ... |
cs/0207011 | Improving Web Database Access Using Decision Diagrams | cs.LO cs.DB | In some areas of management and commerce, especially in Electronic commerce
(E-commerce), that are accelerated by advances in Web technologies, it is
essential to support the decision making process using formal methods. Among
the problems of E-commerce applications: reducing the time of data access so
that huge data... |
cs/0207015 | New advances in dual reciprocity and boundary-only RBF methods | cs.CE cs.CG | This paper made some significant advances in the dual reciprocity and
boundary-only RBF techniques. The proposed boundary knot method (BKM) is
different from the standard boundary element method in a number of important
aspects. Namely, it is truly meshless, exponential convergence,
integration-free (of course, no si... |
cs/0207016 | Relationship between boundary integral equation and radial basis
function | cs.CE cs.CG | This paper aims to survey our recent work relating to the radial basis
function (RBF) from some new views of points. In the first part, we established
the RBF on numerical integration analysis based on an intrinsic relationship
between the Green's boundary integral representation and RBF. It is found that
the kernel ... |
cs/0207017 | New Insights in Boundary-only and Domain-type RBF Methods | cs.CE cs.CG | This paper has made some significant advances in the boundary-only and
domain-type RBF techniques. The proposed boundary knot method (BKM) is
different from the standard boundary element method in a number of important
aspects. Namely, it is truly meshless, exponential convergence,
integration-free (of course, no sin... |
cs/0207018 | Definitions of distance function in radial basis function approach | cs.CE cs.CG | Very few studies involve how to construct the efficient RBFs by means of
problem features. Recently the present author presented general solution RBF
(GS-RBF) methodology to create operator-dependent RBFs successfully [1]. On the
other hand, the normal radial basis function (RBF) is defined via Euclidean
space distan... |
cs/0207021 | Abduction, ASP and Open Logic Programs | cs.AI | Open logic programs and open entailment have been recently proposed as an
abstract framework for the verification of incomplete specifications based upon
normal logic programs and the stable model semantics. There are obvious
analogies between open predicates and abducible predicates. However, despite
superficial sim... |
cs/0207022 | What is a Joint Goal? Games with Beliefs and Defeasible Desires | cs.MA cs.GT | In this paper we introduce a qualitative decision and game theory based on
belief (B) and desire (D) rules. We show that a group of agents acts as if it
is maximizing achieved joint goals.
|
cs/0207023 | Domain-Dependent Knowledge in Answer Set Planning | cs.AI | In this paper we consider three different kinds of domain-dependent control
knowledge (temporal, procedural and HTN-based) that are useful in planning. Our
approach is declarative and relies on the language of logic programming with
answer set semantics (AnsProlog*). AnsProlog* is designed to plan without
control kno... |
cs/0207024 | On Concise Encodings of Preferred Extensions | cs.AI cs.CC cs.DS | Much work on argument systems has focussed on preferred extensions which
define the maximal collectively defensible subsets. Identification and
enumeration of these subsets is (under the usual assumptions) computationally
demanding. We consider approaches to deciding if a subset S is a preferred
extension which query... |
cs/0207025 | "Minimal defence": a refinement of the preferred semantics for
argumentation frameworks | cs.AI | Dung's abstract framework for argumentation enables a study of the
interactions between arguments based solely on an ``attack'' binary relation on
the set of arguments. Various ways to solve conflicts between contradictory
pieces of information have been proposed in the context of argumentation,
nonmonotonic reasonin... |
cs/0207029 | Two Representations for Iterative Non-prioritized Change | cs.AI | We address a general representation problem for belief change, and describe
two interrelated representations for iterative non-prioritized change: a
logical representation in terms of persistent epistemic states, and a
constructive representation in terms of flocks of bases.
|
cs/0207030 | Collective Argumentation | cs.AI | An extension of an abstract argumentation framework, called collective
argumentation, is introduced in which the attack relation is defined directly
among sets of arguments. The extension turns out to be suitable, in particular,
for representing semantics of disjunctive logic programs. Two special kinds of
collective... |
cs/0207031 | Intuitions and the modelling of defeasible reasoning: some case studies | cs.AI cs.LO | The purpose of this paper is to address some criticisms recently raised by
John Horty in two articles against the validity of two commonly accepted
defeasible reasoning patterns, viz. reinstatement and floating conclusions. I
shall argue that Horty's counterexamples, although they significantly raise our
understandin... |
cs/0207032 | Alternative Characterizations for Strong Equivalence of Logic Programs | cs.AI cs.LO | In this work we present additional results related to the property of strong
equivalence of logic programs. This property asserts that two programs share
the same set of stable models, even under the addition of new rules. As shown
in a recent work by Lifschitz, Pearce and Valverde, strong equivalence can be
simply r... |
cs/0207033 | Reducing the Computational Requirements of the Differential Quadrature
Method | cs.CE cs.CG | This paper shows that the weighting coefficient matrices of the differential
quadrature method (DQM) are centrosymmetric or skew-centrosymmetric if the grid
spacings are symmetric irrespective of whether they are equal or unequal. A new
skew centrosymmetric matrix is also discussed. The application of the
properties ... |
cs/0207035 | A Lyapunov Formulation for Efficient Solution of the Poisson and
Convection-Diffusion Equations by the Differential Quadrature Method | cs.CE cs.CG | Civan and Sliepcevich [1, 2] suggested that special matrix solver should be
developed to further reduce the computing effort in applying the differential
quadrature (DQ) method for the Poisson and convection-diffusion equations.
Therefore, the purpose of the present communication is to introduce and apply
the Lyapuno... |
cs/0207037 | Some logics of belief and disbelief | cs.AI cs.LO | The introduction of explicit notions of rejection, or disbelief, into logics
for knowledge representation can be justified in a number of ways. Motivations
range from the need for versions of negation weaker than classical negation, to
the explicit recording of classic belief contraction operations in the area of
bel... |
cs/0207038 | Iterated revision and the axiom of recovery: a unified treatment via
epistemic states | cs.AI cs.LO | The axiom of recovery, while capturing a central intuition regarding belief
change, has been the source of much controversy. We argue briefly against
putative counterexamples to the axiom--while agreeing that some of their
insight deserves to be preserved--and present additional recovery-like axioms
in a framework th... |
cs/0207039 | Dual reciprocity BEM and dynamic programming filter for inverse
elastodynamic problems | cs.CE cs.CG | This paper presents the first coupling application of the dual reciprocity
BEM (DRBEM) and dynamic programming filter to inverse elastodynamic problem.
The DRBEM is the only BEM method, which does not require domain discretization
for general linear and nonlinear dynamic problems. Since the size of numerical
discreti... |
cs/0207040 | Well-Founded Argumentation Semantics for Extended Logic Programming | cs.LO cs.AI | This paper defines an argumentation semantics for extended logic programming
and shows its equivalence to the well-founded semantics with explicit negation.
We set up a general framework in which we extensively compare this semantics to
other argumentation semantics, including those of Dung, and Prakken and Sartor.
W... |
cs/0207041 | RBF-based meshless boundary knot method and boundary particle method | cs.CE cs.CG | This paper is concerned with the two new boundary-type radial basis function
collocation schemes, boundary knot method (BKM) and boundary particle method
(BPM). The BKM is developed based on the dual reciprocity theorem, while the
BPM employs the multiple reciprocity technique. Unlike the method of
fundamental soluti... |
cs/0207042 | Logic Programming with Ordered Disjunction | cs.AI | Logic programs with ordered disjunction (LPODs) combine ideas underlying
Qualitative Choice Logic (Brewka et al. KR 2002) and answer set programming.
Logic programming under answer set semantics is extended with a new connective
called ordered disjunction. The new connective allows us to represent
alternative, ranked... |
cs/0207043 | A meshless, integration-free, and boundary-only RBF technique | cs.CE cs.CG | Based on the radial basis function (RBF), non-singular general solution and
dual reciprocity method (DRM), this paper presents an inherently meshless,
integration-free, boundary-only RBF collocation techniques for numerical
solution of various partial differential equation systems. The basic ideas
behind this methodo... |
cs/0207045 | Compilation of Propositional Weighted Bases | cs.AI | In this paper, we investigate the extent to which knowledge compilation can
be used to improve inference from propositional weighted bases. We present a
general notion of compilation of a weighted base that is parametrized by any
equivalence--preserving compilation function. Both negative and positive
results are pre... |
cs/0207055 | The Rise and Fall of the Church-Turing Thesis | cs.CC cs.AI | The essay consists of three parts. In the first part, it is explained how
theory of algorithms and computations evaluates the contemporary situation with
computers and global networks. In the second part, it is demonstrated what new
perspectives this theory opens through its new direction that is called theory
of sup... |
cs/0207056 | Modeling Complex Domains of Actions and Change | cs.AI | This paper studies the problem of modeling complex domains of actions and
change within high-level action description languages. We investigate two main
issues of concern: (a) can we represent complex domains that capture together
different problems such as ramifications, non-determinism and concurrency of
actions, a... |
cs/0207058 | Question Answering over Unstructured Data without Domain Restrictions | cs.CL cs.IR | Information needs are naturally represented as questions. Automatic
Natural-Language Question Answering (NLQA) has only recently become a practical
task on a larger scale and without domain constraints.
This paper gives a brief introduction to the field, its history and the
impact of systematic evaluation competiti... |
cs/0207059 | Value Based Argumentation Frameworks | cs.AI | This paper introduces the notion of value-based argumentation frameworks, an
extension of the standard argumentation frameworks proposed by Dung, which are
able toshow how rational decision is possible in cases where arguments derive
their force from the social values their acceptance would promote.
|
cs/0207060 | Preferred well-founded semantics for logic programming by alternating
fixpoints: Preliminary report | cs.AI | We analyze the problem of defining well-founded semantics for ordered logic
programs within a general framework based on alternating fixpoint theory. We
start by showing that generalizations of existing answer set approaches to
preference are too weak in the setting of well-founded semantics. We then
specify some inf... |
cs/0207062 | Some addenda on distance function wavelets | cs.NA cs.CE | This report will add some supplements to the recently finished report series
on the distance function wavelets (DFW). First, we define the general distance
in terms of the Riesz potential, and then, the distance function Abel wavelets
are derived via the fractional integral and Laplacian. Second, the DFW Weyl
transfo... |
cs/0207064 | Interpolation Theorems for Nonmonotonic Reasoning Systems | cs.AI cs.LO | Craig's interpolation theorem (Craig 1957) is an important theorem known for
propositional logic and first-order logic. It says that if a logical formula
$\beta$ logically follows from a formula $\alpha$, then there is a formula
$\gamma$, including only symbols that appear in both $\alpha,\beta$, such that
$\beta$ lo... |
cs/0207065 | Embedding Default Logic in Propositional Argumentation Systems | cs.AI | In this paper we present a transformation of finite propositional default
theories into so-called propositional argumentation systems. This
transformation allows to characterize all notions of Reiter's default logic in
the framework of argumentation systems. As a consequence, computing extensions,
or determining weth... |
cs/0207067 | On the existence and multiplicity of extensions in dialectical
argumentation | cs.AI | In the present paper, the existence and multiplicity problems of extensions
are addressed. The focus is on extension of the stable type. The main result of
the paper is an elegant characterization of the existence and multiplicity of
extensions in terms of the notion of dialectical justification, a close cousin
of th... |
cs/0207070 | A continuation semantics of interrogatives that accounts for Baker's
ambiguity | cs.CL cs.PL | Wh-phrases in English can appear both raised and in-situ. However, only
in-situ wh-phrases can take semantic scope beyond the immediately enclosing
clause. I present a denotational semantics of interrogatives that naturally
accounts for these two properties. It neither invokes movement or economy, nor
posits lexical ... |
cs/0207071 | A Polynomial Translation of Logic Programs with Nested Expressions into
Disjunctive Logic Programs: Preliminary Report | cs.AI cs.LO | Nested logic programs have recently been introduced in order to allow for
arbitrarily nested formulas in the heads and the bodies of logic program rules
under the answer sets semantics. Nested expressions can be formed using
conjunction, disjunction, as well as the negation as failure operator in an
unrestricted fash... |
cs/0207072 | Complexity of Nested Circumscription and Nested Abnormality Theories | cs.AI cs.CC cs.LO | The need for a circumscriptive formalism that allows for simple yet elegant
modular problem representation has led Lifschitz (AIJ, 1995) to introduce
nested abnormality theories (NATs) as a tool for modular knowledge
representation, tailored for applying circumscription to minimize exceptional
circumstances. Abstract... |
cs/0207073 | Reinforcing Reachable Routes | cs.NI cs.AI | This paper studies the evaluation of routing algorithms from the perspective
of reachability routing, where the goal is to determine all paths between a
sender and a receiver. Reachability routing is becoming relevant with the
changing dynamics of the Internet and the emergence of low-bandwidth
wireless/ad-hoc networ... |
cs/0207075 | Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic
Logic and Probabilistic Logic under Coherence | cs.AI | Recently, it has been shown that probabilistic entailment under coherence is
weaker than model-theoretic probabilistic entailment. Moreover, probabilistic
entailment under coherence is a generalization of default entailment in System
P. In this paper, we continue this line of research by presenting probabilistic
gene... |
cs/0207076 | Introducing Dynamic Behavior in Amalgamated Knowledge Bases | cs.PL cs.DB cs.LO | The problem of integrating knowledge from multiple and heterogeneous sources
is a fundamental issue in current information systems. In order to cope with
this problem, the concept of mediator has been introduced as a software
component providing intermediate services, linking data resources and
application programs, ... |
cs/0207083 | Evaluating Defaults | cs.AI | We seek to find normative criteria of adequacy for nonmonotonic logic similar
to the criterion of validity for deductive logic. Rather than stipulating that
the conclusion of an inference be true in all models in which the premises are
true, we require that the conclusion of a nonmonotonic inference be true in
``almo... |
cs/0207085 | Repairing Inconsistent Databases: A Model-Theoretic Approach and
Abductive Reasoning | cs.LO cs.DB | In this paper we consider two points of views to the problem of coherent
integration of distributed data. First we give a pure model-theoretic analysis
of the possible ways to `repair' a database. We do so by characterizing the
possibilities to `recover' consistent data from an inconsistent database in
terms of those... |
cs/0207088 | A Paraconsistent Higher Order Logic | cs.LO cs.AI | Classical logic predicts that everything (thus nothing useful at all) follows
from inconsistency. A paraconsistent logic is a logic where an inconsistency
does not lead to such an explosion, and since in practice consistency is
difficult to achieve there are many potential applications of paraconsistent
logics in kno... |
cs/0207093 | Preference Queries | cs.DB | The handling of user preferences is becoming an increasingly important issue
in present-day information systems. Among others, preferences are used for
information filtering and extraction to reduce the volume of data presented to
the user. They are also used to keep track of user profiles and formulate
policies to i... |
cs/0207094 | Answer Sets for Consistent Query Answering in Inconsistent Databases | cs.DB | A relational database is inconsistent if it does not satisfy a given set of
integrity constraints. Nevertheless, it is likely that most of the data in it
is consistent with the constraints. In this paper we apply logic programming
based on answer sets to the problem of retrieving consistent information from a
possibl... |
cs/0207097 | Optimal Ordered Problem Solver | cs.AI cs.CC cs.LG | We present a novel, general, optimally fast, incremental way of searching for
a universal algorithm that solves each task in a sequence of tasks. The Optimal
Ordered Problem Solver (OOPS) continually organizes and exploits previously
found solutions to earlier tasks, efficiently searching not only the space of
domain... |
cs/0208005 | Probabilistic Search for Object Segmentation and Recognition | cs.CV | The problem of searching for a model-based scene interpretation is analyzed
within a probabilistic framework. Object models are formulated as generative
models for range data of the scene. A new statistical criterion, the truncated
object probability, is introduced to infer an optimal sequence of object
hypotheses to... |
cs/0208008 | Soft Concurrent Constraint Programming | cs.PL cs.AI | Soft constraints extend classical constraints to represent multiple
consistency levels, and thus provide a way to express preferences, fuzziness,
and uncertainty. While there are many soft constraint solving formalisms, even
distributed ones, by now there seems to be no concurrent programming framework
where soft con... |
cs/0208009 | Offline Specialisation in Prolog Using a Hand-Written Compiler Generator | cs.PL cs.AI | The so called ``cogen approach'' to program specialisation, writing a
compiler generator instead of a specialiser, has been used with considerable
success in partial evaluation of both functional and imperative languages. This
paper demonstrates that the cogen approach is also applicable to the
specialisation of logi... |
cs/0208010 | TerraService.NET: An Introduction to Web Services | cs.DL cs.DB | This article explores the design and construction of a geo-spatial Internet
web service application from the host web site perspective and from the
perspective of an application using the web service. The TerraService.NET web
service was added to the popular TerraServer database and web site with no
major structural ... |
cs/0208013 | Petabyte Scale Data Mining: Dream or Reality? | cs.DB cs.CE | Science is becoming very data intensive1. Today's astronomy datasets with
tens of millions of galaxies already present substantial challenges for data
mining. In less than 10 years the catalogs are expected to grow to billions of
objects, and image archives will reach Petabytes. Imagine having a 100GB
database in 199... |
cs/0208015 | Spatial Clustering of Galaxies in Large Datasets | cs.DB cs.DS | Datasets with tens of millions of galaxies present new challenges for the
analysis of spatial clustering. We have built a framework that integrates a
database of object catalogs, tools for creating masks of bad regions, and a
fast (NlogN) correlation code. This system has enabled unprecedented efficiency
in carrying ... |
cs/0208016 | A note on fractional derivative modeling of broadband
frequency-dependent absorption: Model III | cs.CE cs.CC | By far, the fractional derivative model is mainly related to the modelling of
complicated solid viscoelastic material. In this study, we try to build the
fractional derivative PDE model for broadband ultrasound propagation through
human tissues.
|
cs/0208017 | Linking Makinson and Kraus-Lehmann-Magidor preferential entailments | cs.AI | About ten years ago, various notions of preferential entailment have been
introduced. The main reference is a paper by Kraus, Lehmann and Magidor (KLM),
one of the main competitor being a more general version defined by Makinson
(MAK). These two versions have already been compared, but it is time to revisit
these com... |
cs/0208019 | Knowledge Representation | cs.AI | This work analyses main features that should be present in knowledge
representation. It suggests a model for representation and a way to implement
this model in software. Representation takes care of both low-level sensor
information and high-level concepts.
|
cs/0208020 | Using the DIFF Command for Natural Language Processing | cs.CL | Diff is a software program that detects differences between two data sets and
is useful in natural language processing. This paper shows several examples of
the application of diff. They include the detection of differences between two
different datasets, extraction of rewriting rules, merging of two different
datase... |
cs/0208022 | Symbolic Methodology in Numeric Data Mining: Relational Techniques for
Financial Applications | cs.CE | Currently statistical and artificial neural network methods dominate in
financial data mining. Alternative relational (symbolic) data mining methods
have shown their effectiveness in robotics, drug design and other applications.
Traditionally symbolic methods prevail in the areas with significant
non-numeric (symboli... |
cs/0208030 | A direct time-domain FEM modeling of broadband frequency-dependent
absorption with the presence of matrix fractional power: Model I | cs.CE cs.CG | The frequency-dependent attenuation of broadband acoustics is often
confronted in many different areas. However, the related time domain simulation
is rarely found in literature due to enormous technical difficulty. The
currently popular relaxation models with the presence of convolution operation
require some materi... |
cs/0208033 | Complete Axiomatizations for Reasoning About Knowledge and Time | cs.LO cs.AI | Sound and complete axiomatizations are provided for a number of different
logics involving modalities for knowledge and time. These logics arise from
different choices for various parameters. All the logics considered involve the
discrete time linear temporal logic operators `next' and `until' and an
operator for the... |
cs/0208034 | Causes and Explanations: A Structural-Model Approach. Part II:
Explanations | cs.AI | We propose new definitions of (causal) explanation, using structural
equations to model counterfactuals. The definition is based on the notion of
actual cause, as defined and motivated in a companion paper. Essentially, an
explanation is a fact that is not known for certain but, if found to be true,
would constitute ... |
cs/0208035 | Evaluation of Coreference Rules on Complex Narrative Texts | cs.CL | This article studies the problem of assessing relevance to each of the rules
of a reference resolution system. The reference solver described here stems
from a formal model of reference and is integrated in a reference processing
workbench. Evaluation of the reference resolution is essential, as it enables
differenti... |
cs/0208036 | Three New Methods for Evaluating Reference Resolution | cs.CL | Reference resolution on extended texts (several thousand references) cannot
be evaluated manually. An evaluation algorithm has been proposed for the MUC
tests, using equivalence classes for the coreference relation. However, we show
here that this algorithm is too indulgent, yielding good scores even for poor
resolut... |
cs/0208037 | Cooperation between Pronoun and Reference Resolution for Unrestricted
Texts | cs.CL | Anaphora resolution is envisaged in this paper as part of the reference
resolution process. A general open architecture is proposed, which can be
particularized and configured in order to simulate some classic anaphora
resolution methods. With the aim of improving pronoun resolution, the system
takes advantage of ele... |
cs/0208038 | Reference Resolution Beyond Coreference: a Conceptual Frame and its
Application | cs.CL | A model for reference use in communication is proposed, from a
representationist point of view. Both the sender and the receiver of a message
handle representations of their common environment, including mental
representations of objects. Reference resolution by a computer is viewed as the
construction of object repr... |
cs/0208040 | Using Hierarchical Data Mining to Characterize Performance of Wireless
System Configurations | cs.CE | This paper presents a statistical framework for assessing wireless systems
performance using hierarchical data mining techniques. We consider WCDMA
(wideband code division multiple access) systems with two-branch STTD (space
time transmit diversity) and 1/2 rate convolutional coding (forward error
correction codes). ... |
cs/0209001 | A Novel Statistical Diagnosis of Clinical Data | cs.CE cs.CC | In this paper, we present a diagnosis method of diseases from clinical data.
The data are routine test such as urine test, hematology, chemistries etc.
Though those tests have been done for people who check in medical institutes,
how each item of the data interacts each other and which combination of them
cause a dis... |
cs/0209002 | A Chart-Parsing Algorithm for Efficient Semantic Analysis | cs.CL | In some contexts, well-formed natural language cannot be expected as input to
information or communication systems. In these contexts, the use of
grammar-independent input (sequences of uninflected semantic units like e.g.
language-independent icons) can be an answer to the users' needs. A semantic
analysis can be pe... |
cs/0209003 | Rerendering Semantic Ontologies: Automatic Extensions to UMLS through
Corpus Analytics | cs.CL | In this paper, we discuss the utility and deficiencies of existing ontology
resources for a number of language processing applications. We describe a
technique for increasing the semantic type coverage of a specific ontology, the
National Library of Medicine's UMLS, with the use of robust finite state
methods used in... |
cs/0209008 | The partition semantics of questions, syntactically | cs.CL cs.AI cs.LO | Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically
attractive theory of the semantics of natural language questions, commonly
referred to as the partition theory. Two central notions in this theory are
entailment between questions and answerhood. For example, the question "Who is
going to the ... |
cs/0209009 | Question answering: from partitions to Prolog | cs.CL cs.AI cs.LO | We implement Groenendijk and Stokhof's partition semantics of questions in a
simple question answering algorithm. The algorithm is sound, complete, and
based on tableau theorem proving. The algorithm relies on a syntactic
characterization of answerhood: Any answer to a question is equivalent to some
formula built up ... |
cs/0209010 | Introduction to the CoNLL-2002 Shared Task: Language-Independent Named
Entity Recognition | cs.CL | We describe the CoNLL-2002 shared task: language-independent named entity
recognition. We give background information on the data sets and the evaluation
method, present a general overview of the systems that have taken part in the
task and discuss their performance.
|
cs/0209019 | Reasoning about Evolving Nonmonotonic Knowledge Bases | cs.AI | Recently, several approaches to updating knowledge bases modeled as extended
logic programs have been introduced, ranging from basic methods to incorporate
(sequences of) sets of rules into a logic program, to more elaborate methods
which use an update policy for specifying how updates must be incorporated. In
this p... |
cs/0209020 | A new definition of the fractional Laplacian | cs.NA cs.CE | It is noted that the standard definition of the fractional Laplacian leads to
a hyper-singular convolution integral and is also obscure about how to
implement the boundary conditions. This purpose of this note is to introduce a
new definition of the fractional Laplacian to overcome these major drawbacks.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.