id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0310011 | Re-Finding Found Things: An Exploratory Study of How Users Re-Find
Information | cs.HC cs.IR | The problem of how people find information is studied extensively; however,
the problem of how people organize, re-use, and re-find information that they
have found is not as well understood. Recently, several projects have conducted
in-situ studies to explore how people re-find and re-use information. Here, we
prese... |
cs/0310012 | A Formal Comparison of Visual Web Wrapper Generators | cs.DB | We study the core fragment of the Elog wrapping language used in the Lixto
system (a visual wrapper generator) and formally compare Elog to other wrapping
languages proposed in the literature.
|
cs/0310013 | WebTeach in practice: the entrance test to the Engineering faculty in
Florence | cs.HC cs.IR | We present the WebTeach project, formed by a web interface to database for
test management, a wiki site for the diffusion of teaching material and student
forums, and a suite for the generation of multiple-choice mathematical quiz
with automatic elaboration of forms. This system has been massively tested for
the entr... |
cs/0310014 | Effective XML Representation for Spoken Language in Organisations | cs.CL | Spoken Language can be used to provide insights into organisational
processes, unfortunately transcription and coding stages are very time
consuming and expensive. The concept of partial transcription and coding is
proposed in which spoken language is indexed prior to any subsequent
processing. The functional linguis... |
cs/0310018 | The Study of the Application of a Keywords-based Chatbot System on the
Teaching of Foreign Languages | cs.CY cs.CL | This paper reports the findings of a study conducted on the application of an
on-line human-computer dialog system with natural language (chatbot) on the
teaching of foreign languages. A keywords-based human-computer dialog system
makes it possible that the user could chat with the computer using a natural
language, ... |
cs/0310021 | Fuzzy Relational Modeling of Cost and Affordability for Advanced
Technology Manufacturing Environment | cs.CE cs.AI math.OC | Relational representation of knowledge makes it possible to perform all the
computations and decision making in a uniform relational way by means of
special relational compositions called triangle and square products. In this
paper some applications in manufacturing related to cost analysis are
described. Testing fuz... |
cs/0310023 | Application of Kullback-Leibler Metric to Speech Recognition | cs.AI | Article discusses the application of Kullback-Leibler divergence to the
recognition of speech signals and suggests three algorithms implementing this
divergence criterion: correlation algorithm, spectral algorithm and filter
algorithm. Discussion covers an approach to the problem of speech variability
and is illustra... |
cs/0310028 | Providing Diversity in K-Nearest Neighbor Query Results | cs.DB | Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN)
queries return the K closest answers according to given distance metric in the
database with respect to Q. In this scenario, it is possible that a majority of
the answers may be very similar to some other, especially when the data has
clusters... |
cs/0310035 | Supporting Exploratory Queries in Database Centric Web Applications | cs.DB | Users of database-centric Web applications, especially in the e-commerce
domain, often resort to exploratory ``trial-and-error'' queries since the
underlying data space is huge and unfamiliar, and there are several
alternatives for search attributes in this space. For example, scouting for
cheap airfares typically in... |
cs/0310038 | On Addressing Efficiency Concerns in Privacy Preserving Data Mining | cs.DB | Data mining services require accurate input data for their results to be
meaningful, but privacy concerns may influence users to provide spurious
information. To encourage users to provide correct inputs, we recently proposed
a data distortion scheme for association rule mining that simultaneously
provides both priva... |
cs/0310041 | A Dynamic Programming Algorithm for the Segmentation of Greek Texts | cs.CL cs.DL | In this paper we introduce a dynamic programming algorithm to perform linear
text segmentation by global minimization of a segmentation cost function which
consists of: (a) within-segment word similarity and (b) prior information about
segment length. The evaluation of the segmentation accuracy of the algorithm on
a ... |
cs/0310043 | Value-at-Risk and Expected Shortfall for Quadratic portfolio of
securities with mixture of elliptic Distributed Risk Factors | cs.CE math.CA | Generally, in the financial literature, the notion of quadratic VaR is
implicitly confused with the Delta-Gamma VaR, because more authors dealt with
portfolios that contains derivatives instruments.
In this paper, we postpone to estimate the Value-at-Risk of a quadratic
portfolio of securities (i.e equities) withou... |
cs/0310044 | The Algebra of Utility Inference | cs.AI | Richard Cox [1] set the axiomatic foundations of probable inference and the
algebra of propositions. He showed that consistency within these axioms
requires certain rules for updating belief. In this paper we use the analogy
between probability and utility introduced in [2] to propose an axiomatic
foundation for util... |
cs/0310045 | An information theory for preferences | cs.AI | Recent literature in the last Maximum Entropy workshop introduced an analogy
between cumulative probability distributions and normalized utility functions.
Based on this analogy, a utility density function can de defined as the
derivative of a normalized utility function. A utility density function is
non-negative an... |
cs/0310047 | Abductive Logic Programs with Penalization: Semantics, Complexity and
Implementation | cs.AI | Abduction, first proposed in the setting of classical logics, has been
studied with growing interest in the logic programming area during the last
years.
In this paper we study abduction with penalization in the logic programming
framework. This form of abductive reasoning, which has not been previously
analyzed in... |
cs/0310048 | Managing Evolving Business Workflows through the Capture of Descriptive
Information | cs.SE cs.DB | Business systems these days need to be agile to address the needs of a
changing world. In particular the discipline of Enterprise Application
Integration requires business process management to be highly reconfigurable
with the ability to support dynamic workflows, inter-application integration
and process reconfigur... |
cs/0310050 | Feedforward Neural Networks with Diffused Nonlinear Weight Functions | cs.NE | In this paper, feedforward neural networks are presented that have nonlinear
weight functions based on look--up tables, that are specially smoothed in a
regularization called the diffusion. The idea of such a type of networks is
based on the hypothesis that the greater number of adaptive parameters per a
weight funct... |
cs/0310058 | Application Architecture for Spoken Language Resources in Organisational
Settings | cs.CL | Special technologies need to be used to take advantage of, and overcome, the
challenges associated with acquiring, transforming, storing, processing, and
distributing spoken language resources in organisations. This paper introduces
an application architecture consisting of tools and supporting utilities for
indexing... |
cs/0310061 | Local-search techniques for propositional logic extended with
cardinality constraints | cs.AI | We study local-search satisfiability solvers for propositional logic extended
with cardinality atoms, that is, expressions that provide explicit ways to
model constraints on cardinalities of sets. Adding cardinality atoms to the
language of propositional logic facilitates modeling search problems and often
results in... |
cs/0310062 | WSAT(cc) - a fast local-search ASP solver | cs.AI | We describe WSAT(cc), a local-search solver for computing models of theories
in the language of propositional logic extended by cardinality atoms. WSAT(cc)
is a processing back-end for the logic PS+, a recently proposed formalism for
answer-set programming.
|
cs/0311001 | Modeling State in Software Debugging of VHDL-RTL Designs -- A
Model-Based Diagnosis Approach | cs.AI cs.SE | In this paper we outline an approach of applying model-based diagnosis to the
field of automatic software debugging of hardware designs. We present our
value-level model for debugging VHDL-RTL designs and show how to localize the
erroneous component responsible for an observed misbehavior. Furthermore, we
discuss an ... |
cs/0311003 | Enhancing a Search Algorithm to Perform Intelligent Backtracking | cs.AI cs.LO | This paper illustrates how a Prolog program, using chronological backtracking
to find a solution in some search space, can be enhanced to perform intelligent
backtracking. The enhancement crucially relies on the impurity of Prolog that
allows a program to store information when a dead end is reached. To illustrate
th... |
cs/0311004 | Utility-Probability Duality | cs.AI | This paper presents duality between probability distributions and utility
functions.
|
cs/0311007 | Parametric Connectives in Disjunctive Logic Programming | cs.AI | Disjunctive Logic Programming (\DLP) is an advanced formalism for Knowledge
Representation and Reasoning (KRR). \DLP is very expressive in a precise
mathematical sense: it allows to express every property of finite structures
that is decidable in the complexity class $\SigmaP{2}$ ($\NP^{\NP}$).
Importantly, the \DLP ... |
cs/0311008 | A Parameterised Hierarchy of Argumentation Semantics for Extended Logic
Programming and its Application to the Well-founded Semantics | cs.LO cs.AI | Argumentation has proved a useful tool in defining formal semantics for
assumption-based reasoning by viewing a proof as a process in which proponents
and opponents attack each others arguments by undercuts (attack to an
argument's premise) and rebuts (attack to an argument's conclusion). In this
paper, we formulate ... |
cs/0311011 | On an explicit finite difference method for fractional diffusion
equations | cs.NA cond-mat.stat-mech cs.CE physics.comp-ph | A numerical method to solve the fractional diffusion equation, which could
also be easily extended to many other fractional dynamics equations, is
considered. These fractional equations have been proposed in order to describe
anomalous transport characterized by non-Markovian kinetics and the breakdown
of Fick's law.... |
cs/0311012 | A rigorous definition of axial lines: ridges on isovist fields | cs.CV cs.CG | We suggest that 'axial lines' defined by (Hillier and Hanson, 1984) as lines
of uninterrupted movement within urban streetscapes or buildings, appear as
ridges in isovist fields (Benedikt, 1979). These are formed from the maximum
diametric lengths of the individual isovists, sometimes called viewsheds, that
make up t... |
cs/0311014 | Optimality of Universal Bayesian Sequence Prediction for General Loss
and Alphabet | cs.LG cs.AI math.PR | Various optimality properties of universal sequence predictors based on
Bayes-mixtures in general, and Solomonoff's prediction scheme in particular,
will be studied. The probability of observing $x_t$ at time $t$, given past
observations $x_1...x_{t-1}$ can be computed with the chain rule if the true
generating distr... |
cs/0311015 | Make search become the internal function of Internet | cs.IR cs.DL cs.NI | Domain Resource Integrated System (DRIS) is introduced in this paper. DRIS is
a distributed information retrieval system, which will solve problems like poor
coverage, long update interval in current web search system. The most distinct
character of DRIS is that it's a public opening system, and acts as an internal
c... |
cs/0311019 | Replay Debugging of Complex Real-Time Systems: Experiences from Two
Industrial Case Studies | cs.RO | Deterministic replay is a method for allowing complex multitasking real-time
systems to be debugged using standard interactive debuggers. Even though
several replay techniques have been proposed for parallel, multi-tasking and
real-time systems, the solutions have so far lingered on a prototype academic
level, with v... |
cs/0311024 | Logic-Based Specification Languages for Intelligent Software Agents | cs.AI | The research field of Agent-Oriented Software Engineering (AOSE) aims to find
abstractions, languages, methodologies and toolkits for modeling, verifying,
validating and prototyping complex applications conceptualized as Multiagent
Systems (MASs). A very lively research sub-field studies how formal methods can
be use... |
cs/0311026 | Great Expectations. Part I: On the Customizability of Generalized
Expected Utility | cs.AI | We propose a generalization of expected utility that we call generalized EU
(GEU), where a decision maker's beliefs are represented by plausibility
measures, and the decision maker's tastes are represented by general (i.e.,not
necessarily real-valued) utility functions. We show that every agent,
``rational'' or not, ... |
cs/0311027 | Great Expectations. Part II: Generalized Expected Utility as a Universal
Decision Rule | cs.AI | Many different rules for decision making have been introduced in the
literature. We show that a notion of generalized expected utility proposed in
Part I of this paper is a universal decision rule, in the sense that it can
represent essentially all other decision rules.
|
cs/0311028 | Using Counterfactuals in Knowledge-Based Programming | cs.DC cs.AI | This paper adds counterfactuals to the framework of knowledge-based programs
of Fagin, Halpern, Moses, and Vardi. The use of counterfactuals is illustrated
by designing a protocol in which an agent stops sending messages once it knows
that it is safe to do so. Such behavior is difficult to capture in the original
fra... |
cs/0311029 | Staging Transformations for Multimodal Web Interaction Management | cs.IR cs.PL | Multimodal interfaces are becoming increasingly ubiquitous with the advent of
mobile devices, accessibility considerations, and novel software technologies
that combine diverse interaction media. In addition to improving access and
delivery capabilities, such interfaces enable flexible and personalized dialogs
with w... |
cs/0311031 | Towards an Intelligent Database System Founded on the SP Theory of
Computing and Cognition | cs.DB cs.AI | The SP theory of computing and cognition, described in previous publications,
is an attractive model for intelligent databases because it provides a simple
but versatile format for different kinds of knowledge, it has capabilities in
artificial intelligence, and it can also function like established database
models w... |
cs/0311033 | The Rank-Frequency Analysis for the Functional Style Corpora in the
Ukrainian Language | cs.CL | We use the rank-frequency analysis for the estimation of Kernel Vocabulary
size within specific corpora of Ukrainian. The extrapolation of high-rank
behaviour is utilized for estimation of the total vocabulary size.
|
cs/0311036 | Measuring the Functional Load of Phonological Contrasts | cs.CL | Frequency counts are a measure of how much use a language makes of a
linguistic unit, such as a phoneme or word. However, what is often important is
not the units themselves, but the contrasts between them. A measure is
therefore needed for how much use a language makes of a contrast, i.e. the
functional load (FL) of... |
cs/0311038 | XPath-Logic and XPathLog: A Logic-Programming Style XML Data
Manipulation Language | cs.DB | We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a
clear, declarative language for querying and manipulating XML whose
perspectives are especially in XML data integration. In our characterization,
the formal semantics is defined wrt. an edge-labeled graph-based model which
covers the XML da... |
cs/0311041 | S-ToPSS: Semantic Toronto Publish/Subscribe System | cs.DC cs.DB | The increase in the amount of data on the Internet has led to the development
of a new generation of applications based on selective information
dissemination where, data is distributed only to interested clients. Such
applications require a new middleware architecture that can efficiently match
user interests with a... |
cs/0311042 | Toward Attribute Efficient Learning Algorithms | cs.LG | We make progress on two important problems regarding attribute efficient
learnability.
First, we give an algorithm for learning decision lists of length $k$ over
$n$ variables using $2^{\tilde{O}(k^{1/3})} \log n$ examples and time
$n^{\tilde{O}(k^{1/3})}$. This is the first algorithm for learning decision
lists th... |
cs/0311045 | Unsupervised Grammar Induction in a Framework of Information Compression
by Multiple Alignment, Unification and Search | cs.AI | This paper describes a novel approach to grammar induction that has been
developed within a framework designed to integrate learning with other aspects
of computing, AI, mathematics and logic. This framework, called "information
compression by multiple alignment, unification and search" (ICMAUS), is founded
on princi... |
cs/0311047 | I know what you mean: semantic issues in Internet-scale
publish/subscribe systems | cs.DC cs.DB | In recent years, the amount of information on the Internet has increased
exponentially developing great interest in selective information dissemination
systems. The publish/subscribe paradigm is particularly suited for designing
systems for routing information and requests according to their content
throughout wide-a... |
cs/0311048 | Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions | cs.CE cs.AI | We present an unusual algorithm involving classification trees where two
trees are grown in opposite directions so that they are matched at their
leaves. This approach finds application in a new data mining task we formulate,
called "redescription mining". A redescription is a shift-of-vocabulary, or a
different way ... |
cs/0311050 | Data mining and Privacy in Public Sector using Intelligent Agents
(discussion paper) | cs.CY cs.AI cs.IR cs.MA | The public sector comprises government agencies, ministries, education
institutions, health providers and other types of government, commercial and
not-for-profit organisations. Unlike commercial enterprises, this environment
is highly heterogeneous in all aspects. This forms a complex network which is
not always opt... |
cs/0311051 | Integrating existing cone-shaped and projection-based cardinal direction
relations and a TCSP-like decidable generalisation | cs.AI | We consider the integration of existing cone-shaped and projection-based
calculi of cardinal direction relations, well-known in QSR. The more general,
integrating language we consider is based on convex constraints of the
qualitative form $r(x,y)$, $r$ being a cone-shaped or projection-based cardinal
direction atomic... |
cs/0311052 | A Situation Calculus-based Approach To Model Ubiquitous Information
Services | cs.AI cs.HC | This paper presents an augmented situation calculus-based approach to model
autonomous computing paradigm in ubiquitous information services. To make it
practical for commercial development and easier to support autonomous paradigm
imposed by ubiquitous information services, we made improvements based on
Reiter's sta... |
cs/0312003 | Hybrid LQG-Neural Controller for Inverted Pendulum System | cs.NE cs.LG | The paper presents a hybrid system controller, incorporating a neural and an
LQG controller. The neural controller has been optimized by genetic algorithms
directly on the inverted pendulum system. The failure free optimization process
stipulated a relatively small region of the asymptotic stability of the neural
con... |
cs/0312004 | Improving spam filtering by combining Naive Bayes with simple k-nearest
neighbor searches | cs.LG | Using naive Bayes for email classification has become very popular within the
last few months. They are quite easy to implement and very efficient. In this
paper we want to present empirical results of email classification using a
combination of naive Bayes and k-nearest neighbor searches. Using this
technique we sho... |
cs/0312008 | Embedding Web-based Statistical Translation Models in Cross-Language
Information Retrieval | cs.CL cs.IR | Although more and more language pairs are covered by machine translation
services, there are still many pairs that lack translation resources.
Cross-language information retrieval (CLIR) is an application which needs
translation functionality of a relatively low level of sophistication since
current models for inform... |
cs/0312009 | Failure-Free Genetic Algorithm Optimization of a System Controller Using
SAFE/LEARNING Controllers in Tandem | cs.NE cs.LG | The paper presents a method for failure free genetic algorithm optimization
of a system controller. Genetic algorithms present a powerful tool that
facilitates producing near-optimal system controllers. Applied to such methods
of computational intelligence as neural networks or fuzzy logic, these methods
are capable ... |
cs/0312016 | Taking the Initiative with Extempore: Exploring Out-of-Turn Interactions
with Websites | cs.HC cs.IR | We present the first study to explore the use of out-of-turn interaction in
websites. Out-of-turn interaction is a technique which empowers the user to
supply unsolicited information while browsing. This approach helps flexibly
bridge any mental mismatch between the user and the website, in a manner
fundamentally dif... |
cs/0312018 | Mapping Subsets of Scholarly Information | cs.IR cs.LG | We illustrate the use of machine learning techniques to analyze, structure,
maintain, and evolve a large online corpus of academic literature. An emerging
field of research can be identified as part of an existing corpus, permitting
the implementation of a more coherent community structure for its
practitioners.
|
cs/0312020 | Modeling Object Oriented Constraint Programs in Z | cs.AI | Object oriented constraint programs (OOCPs) emerge as a leading evolution of
constraint programming and artificial intelligence, first applied to a range of
industrial applications called configuration problems. The rich variety of
technical approaches to solving configuration problems (CLP(FD), CC(FD), DCSP,
Termino... |
cs/0312024 | Evolution: Google vs. DRIS | cs.DL cs.IR cs.NI | This paper gives an absolute new search system that builds the information
retrieval infrastructure for Internet. Now most search engine companies are
mainly concerned with how to make profit from company users by advertisement
and ranking prominence, but never consider what its real customers will feel.
Few web sear... |
cs/0312025 | Soft Constraint Programming to Analysing Security Protocols | cs.CR cs.AI | Security protocols stipulate how the remote principals of a computer network
should interact in order to obtain specific security goals. The crucial goals
of confidentiality and authentication may be achieved in various forms, each of
different strength. Using soft (rather than crisp) constraints, we develop a
unifor... |
cs/0312026 | Speedup of Logic Programs by Binarization and Partial Deduction | cs.PL cs.AI | Binary logic programs can be obtained from ordinary logic programs by a
binarizing transformation. In most cases, binary programs obtained this way are
less efficient than the original programs. (Demoen, 1992) showed an interesting
example of a logic program whose computational behaviour was improved when it
was tran... |
cs/0312028 | Minimal founded semantics for disjunctive logic programs and deductive
databases | cs.LO cs.AI | In this paper, we propose a variant of stable model semantics for disjunctive
logic programming and deductive databases. The semantics, called minimal
founded, generalizes stable model semantics for normal (i.e. non disjunctive)
programs but differs from disjunctive stable model semantics (the extension of
stable mod... |
cs/0312029 | Strong Equivalence Made Easy: Nested Expressions and Weight Constraints | cs.LO cs.AI | Logic programs P and Q are strongly equivalent if, given any program R,
programs P union R and Q union R are equivalent (that is, have the same answer
sets). Strong equivalence is convenient for the study of equivalent
transformations of logic programs: one can prove that a local change is correct
without considering... |
cs/0312033 | Using sensors in the web crawling process | cs.IR cs.DL | This paper offers a short description of an Internet information field
monitoring system, which places a special module-sensor on the side of the
Web-server to detect changes in information resources and subsequently
reindexes only the resources signalized by the corresponding sensor. Concise
results of simulation re... |
cs/0312036 | What Causes a System to Satisfy a Specification? | cs.LO cs.AI | Even when a system is proven to be correct with respect to a specification,
there is still a question of how complete the specification is, and whether it
really covers all the behaviors of the system. Coverage metrics attempt to
check which parts of a system are actually relevant for the verification
process to succ... |
cs/0312037 | Characterizing and Reasoning about Probabilistic and Non-Probabilistic
Expectation | cs.AI cs.LO | Expectation is a central notion in probability theory. The notion of
expectation also makes sense for other notions of uncertainty. We introduce a
propositional logic for reasoning about expectation, where the semantics
depends on the underlying representation of uncertainty. We give sound and
complete axiomatization... |
cs/0312038 | Responsibility and blame: a structural-model approach | cs.AI cs.LO | Causality is typically treated an all-or-nothing concept; either A is a cause
of B or it is not. We extend the definition of causality introduced by Halpern
and Pearl [2001] to take into account the degree of responsibility of A for B.
For example, if someone wins an election 11--0, then each person who votes for
him... |
cs/0312040 | Diagnostic reasoning with A-Prolog | cs.AI | In this paper we suggest an architecture for a software agent which operates
a physical device and is capable of making observations and of testing and
repairing the device's components. We present simplified definitions of the
notions of symptom, candidate diagnosis, and diagnosis which are based on the
theory of ac... |
cs/0312041 | Greedy Algorithms in Datalog | cs.DB cs.AI | In the design of algorithms, the greedy paradigm provides a powerful tool for
solving efficiently classical computational problems, within the framework of
procedural languages. However, expressing these algorithms within the
declarative framework of logic-based languages has proven a difficult research
challenge. In... |
cs/0312042 | Declarative Semantics for Active Rules | cs.DB | In this paper we analyze declarative deterministic and non-deterministic
semantics for active rules. In particular we consider several (partial) stable
model semantics, previously defined for deductive rules, such as well-founded,
max deterministic, unique total stable model, total stable model, and maximal
stable mo... |
cs/0312043 | On A Theory of Probabilistic Deductive Databases | cs.DB | We propose a framework for modeling uncertainty where both belief and doubt
can be given independent, first-class status. We adopt probability theory as
the mathematical formalism for manipulating uncertainty. An agent can express
the uncertainty in her knowledge about a piece of information in the form of a
confiden... |
cs/0312044 | Clustering by compression | cs.CV cond-mat.stat-mech cs.AI physics.data-an q-bio.GN q-bio.QM | We present a new method for clustering based on compression. The method
doesn't use subject-specific features or background knowledge, and works as
follows: First, we determine a universal similarity distance, the normalized
compression distance or NCD, computed from the lengths of compressed data files
(singly and i... |
cs/0312045 | Weight Constraints as Nested Expressions | cs.AI | We compare two recent extensions of the answer set (stable model) semantics
of logic programs. One of them, due to Lifschitz, Tang and Turner, allows the
bodies and heads of rules to contain nested expressions. The other, due to
Niemela and Simons, uses weight constraints. We show that there is a simple,
modular tran... |
cs/0312046 | On the Abductive or Deductive Nature of Database Schema Validation and
Update Processing Problems | cs.DB cs.LO | We show that database schema validation and update processing problems such
as view updating, materialized view maintenance, integrity constraint checking,
integrity constraint maintenance or condition monitoring can be classified as
problems of either abductive or deductive nature, according to the reasoning
paradig... |
cs/0312047 | Mapping weblog communities | cs.NE | Websites of a particular class form increasingly complex networks, and new
tools are needed to map and understand them. A way of visualizing this complex
network is by mapping it. A map highlights which members of the community have
similar interests, and reveals the underlying social network. In this paper, we
will ... |
cs/0312048 | Representation Dependence in Probabilistic Inference | cs.AI cs.LO | Non-deductive reasoning systems are often {\em representation dependent}:
representing the same situation in two different ways may cause such a system
to return two different answers. Some have viewed this as a significant
problem. For example, the principle of maximum entropy has been subjected to
much criticism du... |
cs/0312050 | A Flexible Pragmatics-driven Language Generator for Animated Agents | cs.CL cs.MM | This paper describes the NECA MNLG; a fully implemented Multimodal Natural
Language Generation module. The MNLG is deployed as part of the NECA system
which generates dialogues between animated agents. The generation module
supports the seamless integration of full grammar rules, templates and canned
text. The genera... |
cs/0312051 | Towards Automated Generation of Scripted Dialogue: Some Time-Honoured
Strategies | cs.CL cs.AI | The main aim of this paper is to introduce automated generation of scripted
dialogue as a worthwhile topic of investigation. In particular the fact that
scripted dialogue involves two layers of communication, i.e., uni-directional
communication between the author and the audience of a scripted dialogue and
bi-directi... |
cs/0312052 | Dialogue as Discourse: Controlling Global Properties of Scripted
Dialogue | cs.CL cs.AI | This paper explains why scripted dialogue shares some crucial properties with
discourse. In particular, when scripted dialogues are generated by a Natural
Language Generation system, the generator can apply revision strategies that
cannot normally be used when the dialogue results from an interaction between
autonomo... |
cs/0312053 | On the Expressibility of Stable Logic Programming | cs.AI | (We apologize for pidgin LaTeX) Schlipf \cite{sch91} proved that Stable Logic
Programming (SLP) solves all $\mathit{NP}$ decision problems. We extend
Schlipf's result to prove that SLP solves all search problems in the class
$\mathit{NP}$. Moreover, we do this in a uniform way as defined in \cite{mt99}.
Specifically,... |
cs/0312057 | Abduction in Well-Founded Semantics and Generalized Stable Models | cs.LO cs.AI | Abductive logic programming offers a formalism to declaratively express and
solve problems in areas such as diagnosis, planning, belief revision and
hypothetical reasoning. Tabled logic programming offers a computational
mechanism that provides a level of declarativity superior to that of Prolog,
and which has suppor... |
cs/0312058 | Acquiring Lexical Paraphrases from a Single Corpus | cs.CL cs.AI cs.IR cs.LG | This paper studies the potential of identifying lexical paraphrases within a
single corpus, focusing on the extraction of verb paraphrases. Most previous
approaches detect individual paraphrase instances within a pair (or set) of
comparable corpora, each of them containing roughly the same information, and
rely on th... |
cs/0312059 | Polyhierarchical Classifications Induced by Criteria Polyhierarchies,
and Taxonomy Algebra | cs.AI cs.IR | A new approach to the construction of general persistent polyhierarchical
classifications is proposed. It is based on implicit description of category
polyhierarchy by a generating polyhierarchy of classification criteria.
Similarly to existing approaches, the classification categories are defined by
logical function... |
cs/0312060 | Part-of-Speech Tagging with Minimal Lexicalization | cs.CL cs.LG | We use a Dynamic Bayesian Network to represent compactly a variety of
sublexical and contextual features relevant to Part-of-Speech (PoS) tagging.
The outcome is a flexible tagger (LegoTag) with state-of-the-art performance
(3.6% error on a benchmark corpus). We explore the effect of eliminating
redundancy and radica... |
cs/0401004 | Cyborg Systems as Platforms for Computer-Vision Algorithm-Development
for Astrobiology | cs.CV astro-ph cs.AI | Employing the allegorical imagery from the film "The Matrix", we motivate and
discuss our `Cyborg Astrobiologist' research program. In this research program,
we are using a wearable computer and video camcorder in order to test and train
a computer-vision system to be a field-geologist and field-astrobiologist.
|
cs/0401005 | About Unitary Rating Score Constructing | cs.LG | It is offered to pool test points of different subjects and different aspects
of the same subject together in order to get the unitary rating score, by the
way of nonlinear transformation of indicator points in accordance with Zipf's
distribution. It is proposed to use the well-studied distribution of
Intellectuality... |
cs/0401009 | Unifying Computing and Cognition: The SP Theory and its Applications | cs.AI | This book develops the conjecture that all kinds of information processing in
computers and in brains may usefully be understood as "information compression
by multiple alignment, unification and search". This "SP theory", which has
been under development since 1987, provides a unified view of such things as
the work... |
cs/0401014 | Nested Intervals with Farey Fractions | cs.DB | Relational Databases are universally conceived as an advance over their
predecessors Network and Hierarchical models. Superior in every querying
respect, they turned out to be surprisingly incomplete when modeling transitive
dependencies. Almost every couple of months a question how to model a tree in
the database su... |
cs/0401015 | Query Answering in Peer-to-Peer Data Exchange Systems | cs.DB cs.LO | The problem of answering queries posed to a peer who is a member of a
peer-to-peer data exchange system is studied. The answers have to be consistent
wrt to both the local semantic constraints and the data exchange constraints
with other peers; and must also respect certain trust relationships between
peers. A semant... |
cs/0401017 | Better Foreground Segmentation Through Graph Cuts | cs.CV | For many tracking and surveillance applications, background subtraction
provides an effective means of segmenting objects moving in front of a static
background. Researchers have traditionally used combinations of morphological
operations to remove the noise inherent in the background-subtracted result.
Such techniqu... |
cs/0401018 | Factor Temporal Prognosis of Tick-Borne Encephalitis Foci Functioning on
the South of Russian Far East | cs.CV | A method of temporal factor prognosis of TE (tick-borne encephalitis)
infection has been developed. The high precision of the prognosis results for a
number of geographical regions of Primorsky Krai has been achieved. The method
can be applied not only to epidemiological research but also to others.
|
cs/0401020 | Presynaptic modulation as fast synaptic switching: state-dependent
modulation of task performance | cs.NE q-bio.NC | Neuromodulatory receptors in presynaptic position have the ability to
suppress synaptic transmission for seconds to minutes when fully engaged. This
effectively alters the synaptic strength of a connection. Much work on
neuromodulation has rested on the assumption that these effects are uniform at
every neuron. Howev... |
cs/0401025 | Running C++ models undet the Swarm environment | cs.MA | Objective-C is still the language of choice if users want to run their
simulation efficiently under the Swarm environment since the Swarm environment
itself was written in Objective-C. The language is a fast, object-oriented and
easy to learn. However, the language is less well known than, less expressive
than, and l... |
cs/0401026 | EcoLab: Agent Based Modeling for C++ programmers | cs.MA | \EcoLab{} is an agent based modeling system for C++ programmers, strongly
influenced by the design of Swarm. This paper is just a brief outline of
\EcoLab's features, more details can be found in other published articles,
documentation and source code from the \EcoLab{} website.
|
cs/0402001 | Mobile Re-Finding of Web Information Using a Voice Interface | cs.HC cs.IR | Mobile access to information is a considerable problem for many users,
especially to information found on the Web. In this paper, we explore how a
voice-controlled service, accessible by telephone, could support mobile users'
needs for refinding specific information previously found on the Web. We
outline challenges ... |
cs/0402003 | Semantic Optimization of Preference Queries | cs.DB | The notion of preference is becoming more and more ubiquitous in present-day
information systems. Preferences are primarily used to filter and personalize
the information reaching the users of such systems. In database systems,
preferences are usually captured as preference relations that are used to build
preference... |
cs/0402007 | An Integrated Approach for Extraction of Objects from XML and
Transformation to Heterogeneous Object Oriented Databases | cs.DB cs.SE | CERN's (European Organization for Nuclear Research) WISDOM project uses XML
for the replication of data between different data repositories in a
heterogeneous operating system environment. For exchanging data from
Web-resident databases, the data needs to be transformed into XML and back to
the database format. Many ... |
cs/0402008 | A Use-Case Driven Approach in Requirements Engineering : The Mammogrid
Project | cs.DB cs.SE | We report on the application of the use-case modeling technique to identify
and specify the user requirements of the MammoGrid project in an incremental
and controlled iterative approach. Modeling has been carried out in close
collaboration with clinicians and radiologists with no prior experience of use
cases. The s... |
cs/0402009 | Resolving Clinicians Queries Across a Grids Infrastructure | cs.DB cs.SE | The past decade has witnessed order of magnitude increases in computing
power, data storage capacity and network speed, giving birth to applications
which may handle large data volumes of increased complexity, distributed over
the Internet. Grids computing promises to resolve many of the difficulties in
facilitating ... |
cs/0402013 | Corollaries on the fixpoint completion: studying the stable semantics by
means of the Clark completion | cs.AI cs.LO | The fixpoint completion fix(P) of a normal logic program P is a program
transformation such that the stable models of P are exactly the models of the
Clark completion of fix(P). This is well-known and was studied by Dung and
Kanchanasut (1989). The correspondence, however, goes much further: The
Gelfond-Lifschitz ope... |
cs/0402014 | Self-Organising Networks for Classification: developing Applications to
Science Analysis for Astroparticle Physics | cs.NE astro-ph cs.AI | Physics analysis in astroparticle experiments requires the capability of
recognizing new phenomena; in order to establish what is new, it is important
to develop tools for automatic classification, able to compare the final result
with data from different detectors. A typical example is the problem of Gamma
Ray Burst... |
cs/0402016 | Perspects in astrophysical databases | cs.DB astro-ph | Astrophysics has become a domain extremely rich of scientific data. Data
mining tools are needed for information extraction from such large datasets.
This asks for an approach to data management emphasizing the efficiency and
simplicity of data access; efficiency is obtained using multidimensional access
methods and ... |
cs/0402019 | The Munich Rent Advisor: A Success for Logic Programming on the Internet | cs.AI cs.DS | Most cities in Germany regularly publish a booklet called the {\em
Mietspiegel}. It basically contains a verbal description of an expert system.
It allows the calculation of the estimated fair rent for a flat. By hand, one
may need a weekend to do so. With our computerized version, the {\em Munich
Rent Advisor}, the ... |
cs/0402020 | Geometrical Complexity of Classification Problems | cs.CV | Despite encouraging recent progresses in ensemble approaches, classification
methods seem to have reached a plateau in development. Further advances depend
on a better understanding of geometrical and topological characteristics of
point sets in high-dimensional spaces, the preservation of such characteristics
under ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.