id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0202016 | Linear Programming helps solving large multi-unit combinatorial auctions | cs.GT cs.AI | Previous works suggested the use of Branch and Bound techniques for finding
the optimal allocation in (multi-unit) combinatorial auctions. They remarked
that Linear Programming could provide a good upper-bound to the optimal
allocation, but they went on using lighter and less tight upper-bound
heuristics, on the grou... |
cs/0202018 | Nonmonotonic Logics and Semantics | cs.AI cs.LO math.LO | Tarski gave a general semantics for deductive reasoning: a formula a may be
deduced from a set A of formulas iff a holds in all models in which each of the
elements of A holds. A more liberal semantics has been considered: a formula a
may be deduced from a set A of formulas iff a holds in all of the "preferred"
model... |
cs/0202019 | Hypernets -- Good (G)news for Gnutella | cs.PF cs.DC cs.IR cs.NI | Criticism of Gnutella network scalability has rested on the bandwidth
attributes of the original interconnection topology: a Cayley tree. Trees, in
general, are known to have lower aggregate bandwidth than higher dimensional
topologies e.g., hypercubes, meshes and tori. Gnutella was intended to support
thousands to m... |
cs/0202020 | The Mysterious Optimality of Naive Bayes: Estimation of the Probability
in the System of "Classifiers" | cs.CV cs.AI | Bayes Classifiers are widely used currently for recognition, identification
and knowledge discovery. The fields of application are, for example, image
processing, medicine, chemistry (QSAR). But by mysterious way the Naive Bayes
Classifier usually gives a very nice and good presentation of a recognition. It
can not b... |
cs/0202021 | Nonmonotonic Reasoning, Preferential Models and Cumulative Logics | cs.AI | Many systems that exhibit nonmonotonic behavior have been described and
studied already in the literature. The general notion of nonmonotonic
reasoning, though, has almost always been described only negatively, by the
property it does not enjoy, i.e. monotonicity. We study here general patterns
of nonmonotonic reason... |
cs/0202022 | What does a conditional knowledge base entail? | cs.AI | This paper presents a logical approach to nonmonotonic reasoning based on the
notion of a nonmonotonic consequence relation. A conditional knowledge base,
consisting of a set of conditional assertions of the type "if ... then ...",
represents the explicit defeasible knowledge an agent has about the way the
world gene... |
cs/0202024 | A note on Darwiche and Pearl | cs.AI | It is shown that Darwiche and Pearl's postulates imply an interesting
property, not noticed by the authors.
|
cs/0202025 | Distance Semantics for Belief Revision | cs.AI | A vast and interesting family of natural semantics for belief revision is
defined. Suppose one is given a distance d between any two models. One may then
define the revision of a theory K by a formula a as the theory defined by the
set of all those models of a that are closest, by d, to the set of models of K.
This f... |
cs/0202026 | Preferred History Semantics for Iterated Updates | cs.AI | We give a semantics to iterated update by a preference relation on possible
developments. An iterated update is a sequence of formulas, giving (incomplete)
information about successive states of the world. A development is a sequence
of models, describing a possible trajectory through time. We assume a principle
of i... |
cs/0202027 | BSML: A Binding Schema Markup Language for Data Interchange in Problem
Solving Environments (PSEs) | cs.CE cs.SE | We describe a binding schema markup language (BSML) for describing data
interchange between scientific codes. Such a facility is an important
constituent of scientific problem solving environments (PSEs). BSML is designed
to integrate with a PSE or application composition system that views model
specification and exe... |
cs/0202030 | Generalized Qualitative Probability: Savage revisited | cs.GT cs.AI | Preferences among acts are analyzed in the style of L. Savage, but as
partially ordered. The rationality postulates considered are weaker than
Savage's on three counts. The Sure Thing Principle is derived in this setting.
The postulates are shown to lead to a characterization of generalized
qualitative probability th... |
cs/0202031 | Nonmonotonic inference operations | cs.AI | A. Tarski proposed the study of infinitary consequence operations as the
central topic of mathematical logic. He considered monotonicity to be a
property of all such operations. In this paper, we weaken the monotonicity
requirement and consider more general operations, inference operations. These
operations describe ... |
cs/0202032 | Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and
Bound Heuristics | cs.GT cs.AI | Finding optimal solutions for multi-unit combinatorial auctions is a hard
problem and finding approximations to the optimal solution is also hard. We
investigate the use of Branch-and-Bound techniques: they require both a way to
bound from above the value of the best allocation and a good criterion to
decide which bi... |
cs/0202033 | The logical meaning of Expansion | cs.AI | The Expansion property considered by researchers in Social Choice is shown to
correspond to a logical property of nonmonotonic consequence relations that is
the {\em pure}, i.e., not involving connectives, version of a previously known
weak rationality condition. The assumption that the union of two definable sets
of... |
cs/0202034 | Covariance Plasticity and Regulated Criticality | cs.NE cs.AI nlin.AO q-bio | We propose that a regulation mechanism based on Hebbian covariance plasticity
may cause the brain to operate near criticality. We analyze the effect of such
a regulation on the dynamics of a network with excitatory and inhibitory
neurons and uniform connectivity within and across the two populations. We show
that, un... |
cs/0202035 | Sprinkling Selections over Join DAGs for Efficient Query Optimization | cs.DB | In optimizing queries, solutions based on AND/OR DAG can generate all
possible join orderings and select placements before searching for optimal
query execution strategy. But as the number of joins and selection conditions
increase, the space and time complexity to generate optimal query plan
increases exponentially.... |
cs/0202037 | Towards practical meta-querying | cs.DB | We describe a meta-querying system for databases containing queries in
addition to ordinary data. In the context of such databases, a meta-query is a
query about queries. Representing stored queries in XML, and using the standard
XML manipulation language XSLT as a sublanguage, we show that just a few
features need t... |
cs/0202038 | The efficient generation of unstructured control volumes in 2D and 3D | cs.CG cs.CE cs.NA math.NA physics.comp-ph | Many problems in engineering, chemistry and physics require the
representation of solutions in complex geometries. In the paper we deal with a
problem of unstructured mesh generation for the control volume method. We
propose an algorithm which bases on the spheres generation in central points of
the control volumes.
|
cs/0203002 | Another perspective on Default Reasoning | cs.AI | The lexicographic closure of any given finite set D of normal defaults is
defined. A conditional assertion "if a then b" is in this lexicographic closure
if, given the defaults D and the fact a, one would conclude b. The
lexicographic closure is essentially a rational extension of D, and of its
rational closure, defi... |
cs/0203003 | Deductive Nonmonotonic Inference Operations: Antitonic Representations | cs.AI | We provide a characterization of those nonmonotonic inference operations C
for which C(X) may be described as the set of all logical consequences of X
together with some set of additional assumptions S(X) that depends
anti-monotonically on X (i.e., X is a subset of Y implies that S(Y) is a subset
of S(X)). The operat... |
cs/0203004 | Stereotypical Reasoning: Logical Properties | cs.AI | Stereotypical reasoning assumes that the situation at hand is one of a kind
and that it enjoys the properties generally associated with that kind of
situation. It is one of the most basic forms of nonmonotonic reasoning. A
formal model for stereotypical reasoning is proposed and the logical properties
of this form of... |
cs/0203005 | A Framework for Compiling Preferences in Logic Programs | cs.AI | We introduce a methodology and framework for expressing general preference
information in logic programming under the answer set semantics. An ordered
logic program is an extended logic program in which rules are named by unique
terms, and in which preferences among rules are given by a set of atoms of form
s < t whe... |
cs/0203007 | Two results for proiritized logic programming | cs.AI | Prioritized default reasoning has illustrated its rich expressiveness and
flexibility in knowledge representation and reasoning. However, many important
aspects of prioritized default reasoning have yet to be thoroughly explored. In
this paper, we investigate two properties of prioritized logic programs in the
contex... |
cs/0203010 | On Learning by Exchanging Advice | cs.LG cs.MA | One of the main questions concerning learning in Multi-Agent Systems is:
(How) can agents benefit from mutual interaction during the learning process?.
This paper describes the study of an interactive advice-exchange mechanism as a
possible way to improve agents' learning performance. The advice-exchange
technique, d... |
cs/0203011 | Capturing Knowledge of User Preferences: ontologies on recommender
systems | cs.LG cs.MA | Tools for filtering the World Wide Web exist, but they are hampered by the
difficulty of capturing user preferences in such a dynamic environment. We
explore the acquisition of user profiles by unobtrusive monitoring of browsing
behaviour and application of supervised machine-learning techniques coupled
with an ontol... |
cs/0203012 | Interface agents: A review of the field | cs.MA cs.LG | This paper reviews the origins of interface agents, discusses challenges that
exist within the interface agent field and presents a survey of current
attempts to find solutions to these challenges. A history of agent systems from
their birth in the 1960's to the current day is described, along with the
issues they tr... |
cs/0203013 | Representing and Aggregating Conflicting Beliefs | cs.AI cs.LO | We consider the two-fold problem of representing collective beliefs and
aggregating these beliefs. We propose modular, transitive relations for
collective beliefs. They allow us to represent conflicting opinions and they
have a clear semantics. We compare them with the quasi-transitive relations
often used in Social ... |
cs/0203021 | NetNeg: A Connectionist-Agent Integrated System for Representing Musical
Knowledge | cs.AI cs.MA | The system presented here shows the feasibility of modeling the knowledge
involved in a complex musical activity by integrating sub-symbolic and symbolic
processes. This research focuses on the question of whether there is any
advantage in integrating a neural network together with a distributed
artificial intelligen... |
cs/0203023 | Agent trade servers in financial exchange systems | cs.CE | New services based on the best-effort paradigm could complement the current
deterministic services of an electronic financial exchange. Four crucial
aspects of such systems would benefit from a hybrid stance: proper use of
processing resources, bandwidth management, fault tolerance, and exception
handling. We argue t... |
cs/0203024 | The structure of broad topics on the Web | cs.IR cs.DL | The Web graph is a giant social network whose properties have been measured
and modeled extensively in recent years. Most such studies concentrate on the
graph structure alone, and do not consider textual properties of the nodes.
Consequently, Web communities have been characterized purely in terms of graph
structure... |
cs/0203027 | The Algorithms of Updating Sequential Patterns | cs.DB cs.AI | Because the data being mined in the temporal database will evolve with time,
many researchers have focused on the incremental mining of frequent sequences
in temporal database. In this paper, we propose an algorithm called IUS, using
the frequent and negative border sequences in the original database for
incremental ... |
cs/0203028 | When to Update the sequential patterns of stream data? | cs.DB cs.AI | In this paper, we first define a difference measure between the old and new
sequential patterns of stream data, which is proved to be a distance. Then we
propose an experimental method, called TPD (Tradeoff between Performance and
Difference), to decide when to update the sequential patterns of stream data by
making ... |
cs/0204001 | A steady state model for graph power laws | cs.DM cond-mat.dis-nn cs.SI | Power law distribution seems to be an important characteristic of web graphs.
Several existing web graph models generate power law graphs by adding new
vertices and non-uniform edge connectivities to existing graphs. Researchers
have conjectured that preferential connectivity and incremental growth are both
required ... |
cs/0204003 | Blind Normalization of Speech From Different Channels and Speakers | cs.CL | This paper describes representations of time-dependent signals that are
invariant under any invertible time-independent transformation of the signal
time series. Such a representation is created by rescaling the signal in a
non-linear dynamic manner that is determined by recently encountered signal
levels. This techn... |
cs/0204004 | Models and Tools for Collaborative Annotation | cs.CL cs.SD | The Annotation Graph Toolkit (AGTK) is a collection of software which
facilitates development of linguistic annotation tools. AGTK provides a
database interface which allows applications to use a database server for
persistent storage. This paper discusses various modes of collaborative
annotation and how they can be... |
cs/0204005 | Creating Annotation Tools with the Annotation Graph Toolkit | cs.CL cs.SD | The Annotation Graph Toolkit is a collection of software supporting the
development of annotation tools based on the annotation graph model. The
toolkit includes application programming interfaces for manipulating annotation
graph data and for importing data from other formats. There are interfaces for
the scripting ... |
cs/0204006 | TableTrans, MultiTrans, InterTrans and TreeTrans: Diverse Tools Built on
the Annotation Graph Toolkit | cs.CL cs.SD | Four diverse tools built on the Annotation Graph Toolkit are described. Each
tool associates linguistic codes and structures with time-series data. All are
based on the same software library and tool architecture. TableTrans is for
observational coding, using a spreadsheet whose rows are aligned to a signal.
MultiTra... |
cs/0204007 | An Integrated Framework for Treebanks and Multilayer Annotations | cs.CL | Treebank formats and associated software tools are proliferating rapidly,
with little consideration for interoperability. We survey a wide variety of
treebank structures and operations, and show how they can be mapped onto the
annotation graph model, and leading to an integrated framework encompassing
tree and non-tr... |
cs/0204008 | The tip-of-the-tongue phenomenon: Irrelevant neural network localization
or disruption of its interneuron links ? | cs.CL cs.AI q-bio.NC q-bio.QM | On the base of recently proposed three-stage quantitative neural network
model of the tip-of-the-tongue (TOT) phenomenon a possibility to occur of TOT
states coursed by neural network interneuron links' disruption has been
studied. Using a numerical example it was found that TOTs coursed by interneron
links' disrupti... |
cs/0204010 | On the Computational Complexity of Consistent Query Answers | cs.DB | We consider here the problem of obtaining reliable, consistent information
from inconsistent databases -- databases that do not have to satisfy given
integrity constraints. We use the notion of consistent query answer -- a query
answer which is true in every (minimal) repair of the database. We provide a
complete cla... |
cs/0204012 | Exploiting Synergy Between Ontologies and Recommender Systems | cs.LG cs.MA | Recommender systems learn about user preferences over time, automatically
finding things of similar interest. This reduces the burden of creating
explicit queries. Recommender systems do, however, suffer from cold-start
problems where no initial information is available early on upon which to base
recommendations. Se... |
cs/0204019 | Fast Universalization of Investment Strategies with Provably Good
Relative Returns | cs.CE cs.DS | A universalization of a parameterized investment strategy is an online
algorithm whose average daily performance approaches that of the strategy
operating with the optimal parameters determined offline in hindsight. We
present a general framework for universalizing investment strategies and
discuss conditions under w... |
cs/0204020 | Seven Dimensions of Portability for Language Documentation and
Description | cs.CL cs.DL | The process of documenting and describing the world's languages is undergoing
radical transformation with the rapid uptake of new digital technologies for
capture, storage, annotation and dissemination. However, uncritical adoption of
new tools and technologies is leading to resources that are difficult to reuse
and ... |
cs/0204022 | Annotation Graphs and Servers and Multi-Modal Resources: Infrastructure
for Interdisciplinary Education, Research and Development | cs.CL | Annotation graphs and annotation servers offer infrastructure to support the
analysis of human language resources in the form of time-series data such as
text, audio and video. This paper outlines areas of common need among empirical
linguists and computational linguists. After reviewing examples of data and
tools us... |
cs/0204023 | Computational Phonology | cs.CL | Phonology, as it is practiced, is deeply computational. Phonological analysis
is data-intensive and the resulting models are nothing other than specialized
data structures and algorithms. In the past, phonological computation -
managing data and developing analyses - was done manually with pencil and
paper. Increasin... |
cs/0204025 | Phonology | cs.CL | Phonology is the systematic study of the sounds used in language, their
internal structure, and their composition into syllables, words and phrases.
Computational phonology is the application of formal and computational
techniques to the representation and processing of phonological information.
This chapter will pre... |
cs/0204026 | Querying Databases of Annotated Speech | cs.CL cs.DB | Annotated speech corpora are databases consisting of signal data along with
time-aligned symbolic `transcriptions'. Such databases are typically
multidimensional, heterogeneous and dynamic. These properties present a number
of tough challenges for representation and query. The temporal nature of the
data adds an addi... |
cs/0204027 | Integrating selectional preferences in WordNet | cs.CL | Selectional preference learning methods have usually focused on word-to-class
relations, e.g., a verb selects as its subject a given nominal class. This
paper extends previous statistical models to class-to-class preferences, and
presents a model that learns selectional preferences for classes of verbs,
together with... |
cs/0204028 | Decision Lists for English and Basque | cs.CL | In this paper we describe the systems we developed for the English (lexical
and all-words) and Basque tasks. They were all supervised systems based on
Yarowsky's Decision Lists. We used Semcor for training in the English all-words
task. We defined different feature sets for each language. For Basque, in order
to extr... |
cs/0204029 | The Basque task: did systems perform in the upperbound? | cs.CL | In this paper we describe the Senseval 2 Basque lexical-sample task. The task
comprised 40 words (15 nouns, 15 verbs and 10 adjectives) selected from Euskal
Hiztegia, the main Basque dictionary. Most examples were taken from the
Egunkaria newspaper. The method used to hand-tag the examples produced low
inter-tagger a... |
cs/0204030 | Fast Hands-free Writing by Gaze Direction | cs.HC cs.AI | We describe a method for text entry based on inverse arithmetic coding that
relies on gaze direction and which is faster and more accurate than using an
on-screen keyboard.
These benefits are derived from two innovations: the writing task is matched
to the capabilities of the eye, and a language model is used to ma... |
cs/0204032 | Belief Revision and Rational Inference | cs.AI | The (extended) AGM postulates for belief revision seem to deal with the
revision of a given theory K by an arbitrary formula, but not to constrain the
revisions of two different theories by the same formula. A new postulate is
proposed and compared with other similar postulates that have been proposed in
the literatu... |
cs/0204038 | Technology For Information Engineering (TIE): A New Way of Storing,
Retrieving and Analyzing Information | cs.DB cs.IR | The theoretical foundations of a new model and paradigm (called TIE) for data
storage and access are introduced. Associations between data elements are
stored in a single Matrix table, which is usually kept entirely in RAM for
quick access. The model ties together a very intuitive "guided" GUI to the
Matrix structure... |
cs/0204040 | Self-Optimizing and Pareto-Optimal Policies in General Environments
based on Bayes-Mixtures | cs.AI cs.LG math.OC math.PR | The problem of making sequential decisions in unknown probabilistic
environments is studied. In cycle $t$ action $y_t$ results in perception $x_t$
and reward $r_t$, where all quantities in general may depend on the complete
history. The perception $x_t$ and reward $r_t$ are sampled from the (reactive)
environmental p... |
cs/0204041 | Trust Brokerage Systems for the Internet | cs.CR cs.GT cs.NE | This thesis addresses the problem of providing trusted individuals with
confidential information about other individuals, in particular, granting
access to databases of personal records using the World-Wide Web. It proposes
an access rights management system for distributed databases which aims to
create and implemen... |
cs/0204043 | Learning from Scarce Experience | cs.AI cs.LG cs.NE cs.RO | Searching the space of policies directly for the optimal policy has been one
popular method for solving partially observable reinforcement learning
problems. Typically, with each change of the target policy, its value is
estimated from the results of following that very policy. This requires a large
number of interac... |
cs/0204044 | Robust Global Localization Using Clustered Particle Filtering | cs.RO cs.AI | Global mobile robot localization is the problem of determining a robot's pose
in an environment, using sensor data, when the starting position is unknown. A
family of probabilistic algorithms known as Monte Carlo Localization (MCL) is
currently among the most popular methods for solving this problem. MCL
algorithms r... |
cs/0204046 | Optimal Aggregation Algorithms for Middleware | cs.DB cs.DS | Let D be a database of N objects where each object has m fields. The objects
are given in m sorted lists (where the ith list is sorted according to the ith
field). Our goal is to find the top k objects according to a monotone
aggregation function t, while minimizing access to the lists. The problem
arises in several ... |
cs/0204047 | Sampling Strategies for Mining in Data-Scarce Domains | cs.CE cs.AI | Data mining has traditionally focused on the task of drawing inferences from
large datasets. However, many scientific and engineering domains, such as fluid
dynamics and aircraft design, are characterized by scarce data, due to the
expense and complexity of associated experiments and simulations. In such
data-scarce ... |
cs/0204049 | Memory-Based Shallow Parsing | cs.CL | We present memory-based learning approaches to shallow parsing and apply
these to five tasks: base noun phrase identification, arbitrary base phrase
recognition, clause detection, noun phrase parsing and full parsing. We use
feature selection techniques and system combination methods for improving the
performance of ... |
cs/0204051 | Parrondo Strategies for Artificial Traders | cs.CE | On markets with receding prices, artificial noise traders may consider
alternatives to buy-and-hold. By simulating variations of the Parrondo
strategy, using real data from the Swedish stock market, we produce first
indications of a buy-low-sell-random Parrondo variation outperforming
buy-and-hold. Subject to our ass... |
cs/0204052 | Required sample size for learning sparse Bayesian networks with many
variables | cs.LG math.PR | Learning joint probability distributions on n random variables requires
exponential sample size in the generic case. Here we consider the case that a
temporal (or causal) order of the variables is known and that the (unknown)
graph of causal dependencies has bounded in-degree Delta. Then the joint
measure is uniquely... |
cs/0204053 | Qualitative Analysis of Correspondence for Experimental Algorithmics | cs.AI cs.CE | Correspondence identifies relationships among objects via similarities among
their components; it is ubiquitous in the analysis of spatial datasets,
including images, weather maps, and computational simulations. This paper
develops a novel multi-level mechanism for qualitative analysis of
correspondence. Operators le... |
cs/0204054 | Navigating the Small World Web by Textual Cues | cs.IR cs.NI | Can a Web crawler efficiently locate an unknown relevant page? While this
question is receiving much empirical attention due to its considerable
commercial value in the search engine community
[Cho98,Chakrabarti99,Menczer00,Menczer01], theoretical efforts to bound the
performance of focused navigation have only explo... |
cs/0204055 | Intelligent Search of Correlated Alarms for GSM Networks with
Model-based Constraints | cs.NI cs.AI | In order to control the process of data mining and focus on the things of
interest to us, many kinds of constraints have been added into the algorithms
of data mining. However, discovering the correlated alarms in the alarm
database needs deep domain constraints. Because the correlated alarms greatly
depend on the lo... |
cs/0204056 | Trading Agents for Roaming Users | cs.CE | Some roaming users need services to manipulate autonomous processes. Trading
agents running on agent trade servers are used as a case in point. We present a
solution that provides the agent owners with means to upkeeping their desktop
environment, and maintaining their agent trade server processes, via a
briefcase se... |
cs/0205006 | Unsupervised discovery of morphologically related words based on
orthographic and semantic similarity | cs.CL | We present an algorithm that takes an unannotated corpus as its input, and
returns a ranked list of probable morphologically related pairs as its output.
The algorithm tries to discover morphologically related pairs by looking for
pairs that are both orthographically and semantically similar, where
orthographic simil... |
cs/0205009 | Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences | cs.CL | Given the lack of word delimiters in written Japanese, word segmentation is
generally considered a crucial first step in processing Japanese texts. Typical
Japanese segmentation algorithms rely either on a lexicon and syntactic
analysis or on pre-segmented data; but these are labor-intensive, and the
lexico-syntactic... |
cs/0205013 | Computing stable models: worst-case performance estimates | cs.LO cs.AI | We study algorithms for computing stable models of propositional logic
programs and derive estimates on their worst-case performance that are
asymptotically better than the trivial bound of O(m 2^n), where m is the size
of an input program and n is the number of its atoms. For instance, for
programs, whose clauses co... |
cs/0205014 | Ultimate approximations in nonmonotonic knowledge representation systems | cs.AI | We study fixpoints of operators on lattices. To this end we introduce the
notion of an approximation of an operator. We order approximations by means of
a precision ordering. We show that each lattice operator O has a unique most
precise or ultimate approximation. We demonstrate that fixpoints of this
ultimate approx... |
cs/0205015 | Instabilities of Robot Motion | cs.RO cs.CG math.AT | Instabilities of robot motion are caused by topological reasons. In this
paper we find a relation between the topological properties of a configuration
space (the structure of its cohomology algebra) and the character of
instabilities, which are unavoidable in any motion planning algorithm. More
specifically, let $X$... |
cs/0205016 | From Alife Agents to a Kingdom of N Queens | cs.AI cs.DS cs.MA | This paper presents a new approach to solving N-queen problems, which
involves a model of distributed autonomous agents with artificial life (ALife)
and a method of representing N-queen constraints in an agent environment. The
distributed agents locally interact with their living environment, i.e., a
chessboard, and ... |
cs/0205017 | Ellogon: A New Text Engineering Platform | cs.CL | This paper presents Ellogon, a multi-lingual, cross-platform, general-purpose
text engineering environment. Ellogon was designed in order to aid both
researchers in natural language processing, as well as companies that produce
language engineering systems for the end-user. Ellogon provides a powerful
TIPSTER-based i... |
cs/0205019 | Distance function wavelets - Part I: Helmholtz and convection-diffusion
transforms and series | cs.CE cs.NA | This report aims to present my research updates on distance function wavelets
(DFW) based on the fundamental solutions and the general solutions of the
Helmholtz, modified Helmholtz, and convection-diffusion equations, which
include the isotropic Helmholtz-Fourier (HF) transform and series, the
Helmholtz-Laplace (HL)... |
cs/0205020 | A quasi-RBF technique for numerical discretization of PDE's | cs.CE cs.CG | Atkinson developed a strategy which splits solution of a PDE system into
homogeneous and particular solutions, where the former have to satisfy the
boundary and governing equation, while the latter only need to satisfy the
governing equation without concerning geometry. Since the particular solution
can be solved irr... |
cs/0205022 | The Traits of the Personable | cs.AI cs.IR | Information personalization is fertile ground for application of AI
techniques. In this article I relate personalization to the ability to capture
partial information in an information-seeking interaction. The specific focus
is on personalizing interactions at web sites. Using ideas from partial
evaluation and explan... |
cs/0205025 | Bootstrapping Structure into Language: Alignment-Based Learning | cs.LG cs.CL | This thesis introduces a new unsupervised learning framework, called
Alignment-Based Learning, which is based on the alignment of sentences and
Harris's (1951) notion of substitutability. Instances of the framework can be
applied to an untagged, unstructured corpus of natural language sentences,
resulting in a labell... |
cs/0205026 | Monads for natural language semantics | cs.CL cs.PL | Accounts of semantic phenomena often involve extending types of meanings and
revising composition rules at the same time. The concept of monads allows many
such accounts -- for intensionality, variable binding, quantification and focus
-- to be stated uniformly and compositionally.
|
cs/0205027 | A variable-free dynamic semantics | cs.CL | I propose a variable-free treatment of dynamic semantics. By "dynamic
semantics" I mean analyses of donkey sentences ("Every farmer who owns a donkey
beats it") and other binding and anaphora phenomena in natural language where
meanings of constituents are updates to information states, for instance as
proposed by Gr... |
cs/0205028 | NLTK: The Natural Language Toolkit | cs.CL | NLTK, the Natural Language Toolkit, is a suite of open source program
modules, tutorials and problem sets, providing ready-to-use computational
linguistics courseware. NLTK covers symbolic and statistical natural language
processing, and is interfaced to annotated corpora. Students augment and
replace existing compon... |
cs/0205034 | Data-Collection for the Sloan Digital Sky Survey: a Network-Flow
Heuristic | cs.DS cs.CE | The goal of the Sloan Digital Sky Survey is ``to map in detail one-quarter of
the entire sky, determining the positions and absolute brightnesses of more
than 100 million celestial objects''. The survey will be performed by taking
``snapshots'' through a large telescope. Each snapshot can capture up to 600
objects fr... |
cs/0205057 | Unsupervised Discovery of Morphemes | cs.CL | We present two methods for unsupervised segmentation of words into
morpheme-like units. The model utilized is especially suited for languages with
a rich morphology, such as Finnish. The first method is based on the Minimum
Description Length (MDL) principle and works online. In the second method,
Maximum Likelihood ... |
cs/0205059 | A Connection-Centric Survey of Recommender Systems Research | cs.IR cs.HC | Recommender systems attempt to reduce information overload and retain
customers by selecting a subset of items from a universal set based on user
preferences. While research in recommender systems grew out of information
retrieval and filtering, the topic has steadily advanced into a legitimate and
challenging resear... |
cs/0205060 | Optimizing Queries Using a Meta-level Database | cs.DB | Graph simulation (using graph schemata or data guides) has been successfully
proposed as a technique for adding structure to semistructured data. Design
patterns for description (such as meta-classes and homomorphisms between schema
layers), which are prominent in the object-oriented programming community,
constitute... |
cs/0205061 | Aging, double helix and small world property in genetic algorithms | cs.NE cs.DS physics.data-an | Over a quarter of century after the invention of genetic algorithms and
miriads of their modifications, as well as successful implementations, we are
still lacking many essential details of thorough analysis of it's inner
working. One of such fundamental questions is: how many generations do we need
to solve the opti... |
cs/0205063 | Distance function wavelets - Part II: Extended results and conjectures | cs.CE cs.CG | Report II is concerned with the extended results of distance function
wavelets (DFW). The fractional DFW transforms are first addressed relating to
the fractal geometry and fractional derivative, and then, the discrete
Helmholtz-Fourier transform is briefly presented. The Green second identity may
be an alternative d... |
cs/0205065 | Bootstrapping Lexical Choice via Multiple-Sequence Alignment | cs.CL | An important component of any generation system is the mapping dictionary, a
lexicon of elementary semantic expressions and corresponding natural language
realizations. Typically, labor-intensive knowledge-based methods are used to
construct the dictionary. We instead propose to acquire it automatically via a
novel m... |
cs/0205066 | Effectiveness of Preference Elicitation in Combinatorial Auctions | cs.GT cs.MA | Combinatorial auctions where agents can bid on bundles of items are desirable
because they allow the agents to express complementarity and substitutability
between the items. However, expressing one's preferences can require bidding on
all bundles. Selective incremental preference elicitation by the auctioneer was
re... |
cs/0205067 | Evaluating the Effectiveness of Ensembles of Decision Trees in
Disambiguating Senseval Lexical Samples | cs.CL | This paper presents an evaluation of an ensemble--based system that
participated in the English and Spanish lexical sample tasks of Senseval-2. The
system combines decision trees of unigrams, bigrams, and co--occurrences into a
single classifier. The analysis is extended to include the Senseval-1 data.
|
cs/0205068 | Assessing System Agreement and Instance Difficulty in the Lexical Sample
Tasks of Senseval-2 | cs.CL | This paper presents a comparative evaluation among the systems that
participated in the Spanish and English lexical sample tasks of Senseval-2. The
focus is on pairwise comparisons among systems to assess the degree to which
they agree, and on measuring the difficulty of the test instances included in
these tasks.
|
cs/0205069 | Machine Learning with Lexical Features: The Duluth Approach to
Senseval-2 | cs.CL | This paper describes the sixteen Duluth entries in the Senseval-2 comparative
exercise among word sense disambiguation systems. There were eight pairs of
Duluth systems entered in the Spanish and English lexical sample tasks. These
are all based on standard machine learning algorithms that induce classifiers
from sen... |
cs/0205070 | Thumbs up? Sentiment Classification using Machine Learning Techniques | cs.CL cs.LG | We consider the problem of classifying documents not by topic, but by overall
sentiment, e.g., determining whether a review is positive or negative. Using
movie reviews as data, we find that standard machine learning techniques
definitively outperform human-produced baselines. However, the three machine
learning meth... |
cs/0205071 | A Scalable Architecture for Harvest-Based Digital Libraries - The
ODU/Southampton Experiments | cs.DL cs.IR | This paper discusses the requirements of current and emerging applications
based on the Open Archives Initiative (OAI) and emphasizes the need for a
common infrastructure to support them. Inspired by HTTP proxy, cache, gateway
and web service concepts, a design for a scalable and reliable infrastructure
that aims at ... |
cs/0205072 | Unsupervised Learning of Morphology without Morphemes | cs.CL cs.LG | The first morphological learner based upon the theory of Whole Word
Morphology Ford et al. (1997) is outlined, and preliminary evaluation results
are presented. The program, Whole Word Morphologizer, takes a POS-tagged
lexicon as input, induces morphological relationships without attempting to
discover or identify mo... |
cs/0205073 | Vote Elicitation: Complexity and Strategy-Proofness | cs.GT cs.CC cs.MA | Preference elicitation is a central problem in AI, and has received
significant attention in single-agent settings. It is also a key problem in
multiagent systems, but has received little attention here so far. In this
setting, the agents may have different preferences that often must be
aggregated using voting. This... |
cs/0205074 | Complexity Results about Nash Equilibria | cs.GT cs.CC cs.MA | Noncooperative game theory provides a normative framework for analyzing
strategic interactions. However, for the toolbox to be operational, the
solutions it defines will have to be computed. In this paper, we provide a
single reduction that 1) demonstrates NP-hardness of determining whether Nash
equilibria with certa... |
cs/0205075 | Complexity of Mechanism Design | cs.GT cs.CC cs.MA | The aggregation of conflicting preferences is a central problem in multiagent
systems. The key difficulty is that the agents may report their preferences
insincerely. Mechanism design is the art of designing the rules of the game so
that the agents are motivated to report their preferences truthfully and a
(socially)... |
cs/0205078 | A Spectrum of Applications of Automated Reasoning | cs.AI cs.LO | The likelihood of an automated reasoning program being of substantial
assistance for a wide spectrum of applications rests with the nature of the
options and parameters it offers on which to base needed strategies and
methodologies. This article focuses on such a spectrum, featuring W. McCune's
program OTTER, discuss... |
cs/0205079 | Connectives in Quantum and other Cumulative Logics | cs.AI math.LO | Cumulative logics are studied in an abstract setting, i.e., without
connectives, very much in the spirit of Makinson's early work. A powerful
representation theorem characterizes those logics by choice functions that
satisfy a weakening of Sen's property alpha, in the spirit of the author's
"Nonmonotonic Logics and S... |
cs/0205080 | Transforming the World Wide Web into a Complexity-Based Semantic Network | cs.NI cs.IR | The aim of this paper is to introduce the idea of the Semantic Web to the
Complexity community and set a basic ground for a project resulting in creation
of Internet-based semantic network of Complexity-related information providers.
Implementation of the Semantic Web technology would be of mutual benefit to
both the... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.