id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/9809028 | Separating Dependency from Constituency in a Tree Rewriting System | cs.CL | In this paper we present a new tree-rewriting formalism called Link-Sharing
Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using
LSTAG we define an approach towards coordination where linguistic dependency is
distinguished from the notion of constituency. Such an approach towards
coordination ... |
cs/9809029 | Incremental Parser Generation for Tree Adjoining Grammars | cs.CL | This paper describes the incremental generation of parse tables for the
LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented
handles modifications to the input grammar by updating the parser generated so
far. In this paper, a lazy generation of LR-type parsers for TALs is defined in
which parse... |
cs/9809032 | Stable models and an alternative logic programming paradigm | cs.LO cs.AI | In this paper we reexamine the place and role of stable model semantics in
logic programming and contrast it with a least Herbrand model approach to Horn
programs. We demonstrate that inherent features of stable model semantics
naturally lead to a logic programming system that offers an interesting
alternative to mor... |
cs/9809033 | Efficient Retrieval of Similar Time Sequences Using DFT | cs.DB | We propose an improvement of the known DFT-based indexing technique for fast
retrieval of similar time sequences. We use the last few Fourier coefficients
in the distance computation without storing them in the index since every
coefficient at the end is the complex conjugate of a coefficient at the
beginning and as ... |
cs/9809034 | Semantics and Conversations for an Agent Communication Language | cs.MA cs.AI | We address the issues of semantics and conversations for agent communication
languages and the Knowledge Query Manipulation Language (KQML) in particular.
Based on ideas from speech act theory, we present a semantic description for
KQML that associates ``cognitive'' states of the agent with the use of the
language's ... |
cs/9809036 | Document Archiving, Replication and Migration Container for Mobile Web
Users | cs.MA cs.MM | With the increasing use of mobile workstations for a wide variety of tasks
and associated information needs, and with many variations of available
networks, access to data becomes a prime consideration. This paper discusses
issues of workstation mobility and proposes a solution wherein the data
structures are accesse... |
cs/9809049 | Aspects of Evolutionary Design by Computers | cs.NE | This paper examines the four main types of Evolutionary Design by computers:
Evolutionary Design Optimisation, Evolutionary Art, Evolutionary Artificial
Life Forms and Creative Evolutionary Design. Definitions for all four areas are
provided. A review of current work in each of these areas is given, with
examples of ... |
cs/9809050 | A Freely Available Morphological Analyzer, Disambiguator and Context
Sensitive Lemmatizer for German | cs.CL | In this paper we present Morphy, an integrated tool for German morphology,
part-of-speech tagging and context-sensitive lemmatization. Its large lexicon
of more than 320,000 word forms plus its ability to process German compound
nouns guarantee a wide morphological coverage. Syntactic ambiguities can be
resolved with... |
cs/9809051 | Spoken Language Dialogue Systems and Components: Best practice in
development and evaluation (DISC 24823) - Periodic Progress Report 1: Basic
Details of the Action | cs.CL cs.SE | The DISC project aims to (a) build an in-depth understanding of the
state-of-the-art in spoken language dialogue systems (SLDSs) and components
development and evaluation with the purpose of (b) developing a first best
practice methodology in the field. The methodology will be accompanied by (c) a
series of developme... |
cs/9809106 | Processing Unknown Words in HPSG | cs.CL | The lexical acquisition system presented in this paper incrementally updates
linguistic properties of unknown words inferred from their surrounding context
by parsing sentences with an HPSG grammar for German. We employ a gradual,
information-based concept of ``unknownness'' providing a uniform treatment for
the rang... |
cs/9809107 | Computing Declarative Prosodic Morphology | cs.CL | This paper describes a computational, declarative approach to prosodic
morphology that uses inviolable constraints to denote small finite candidate
sets which are filtered by a restrictive incremental optimization mechanism.
The new approach is illustrated with an implemented fragment of Modern Hebrew
verbs couched i... |
cs/9809108 | Learning Nested Agent Models in an Information Economy | cs.MA cs.AI | We present our approach to the problem of how an agent, within an economic
Multi-Agent System, can determine when it should behave strategically (i.e.
learn and use models of other agents), and when it should act as a simple
price-taker. We provide a framework for the incremental implementation of
modeling capabiliti... |
cs/9809110 | Similarity-Based Models of Word Cooccurrence Probabilities | cs.CL cs.AI cs.LG | In many applications of natural language processing (NLP) it is necessary to
determine the likelihood of a given word combination. For example, a speech
recognizer may need to determine which of the two word combinations ``eat a
peach'' and ``eat a beach'' is more likely. Statistical NLP methods determine
the likelih... |
cs/9809111 | Evolution of Neural Networks to Play the Game of Dots-and-Boxes | cs.NE cs.LG | Dots-and-Boxes is a child's game which remains analytically unsolved. We
implement and evolve artificial neural networks to play this game, evaluating
them against simple heuristic players. Our networks do not evaluate or predict
the final outcome of the game, but rather recommend moves at each stage.
Superior genera... |
cs/9809112 | On the Evaluation and Comparison of Taggers: The Effect of Noise in
Testing Corpora | cs.CL | This paper addresses the issue of {\sc pos} tagger evaluation. Such
evaluation is usually performed by comparing the tagger output with a reference
test corpus, which is assumed to be error-free. Currently used corpora contain
noise which causes the obtained performance to be a distortion of the real
value. We analyz... |
cs/9809113 | Improving Tagging Performance by Using Voting Taggers | cs.CL | We present a bootstrapping method to develop an annotated corpus, which is
specially useful for languages with few available resources. The method is
being applied to develop a corpus of Spanish of over 5Mw. The method consists
on taking advantage of the collaboration of two different POS taggers. The
cases in which ... |
cs/9809121 | Using Local Optimality Criteria for Efficient Information Retrieval with
Redundant Information Filters | cs.IR cs.AI | We consider information retrieval when the data, for instance multimedia, is
coputationally expensive to fetch. Our approach uses "information filters" to
considerably narrow the universe of possiblities before retrieval. We are
especially interested in redundant information filters that save time over more
general b... |
cs/9809122 | Practical algorithms for on-line sampling | cs.LG cs.DS | One of the core applications of machine learning to knowledge discovery
consists on building a function (a hypothesis) from a given amount of data (for
instance a decision tree or a neural network) such that we can use it
afterwards to predict new instances of the data. In this paper, we focus on a
particular situati... |
cs/9809123 | A role of constraint in self-organization | cs.NE cs.CG | In this paper we introduce a neural network model of self-organization. This
model uses a variation of Hebb rule for updating its synaptic weights, and
surely converges to the equilibrium status. The key point of the convergence is
the update rule that constrains the total synaptic weight and this seems to
make the m... |
cs/9810002 | Pre-fetching tree-structured data in distributed memory | cs.DC cs.DB | A distributed heap storage manager has been implemented on the Fujitsu AP1000
multicomputer. The performance of various pre-fetching strategies is
experimentally compared. Subjective programming benefits and objective
performance benefits of up to 10% in pre-fetching are found for certain
applications, but not for al... |
cs/9810003 | A Linear Shift Invariant Multiscale Transform | cs.CV | This paper presents a multiscale decomposition algorithm. Unlike standard
wavelet transforms, the proposed operator is both linear and shift invariant.
The central idea is to obtain shift invariance by averaging the aligned wavelet
transform projections over all circular shifts of the signal. It is shown how
the same... |
cs/9810005 | Anytime Coalition Structure Generation with Worst Case Guarantees | cs.MA cs.AI | Coalition formation is a key topic in multiagent systems. One would prefer a
coalition structure that maximizes the sum of the values of the coalitions, but
often the number of coalition structures is too large to allow exhaustive
search for the optimal one. But then, can the coalition structure found via a
partial s... |
cs/9810012 | Ultrametric Distance in Syntax | cs.CL q-bio.NC | Phrase structure trees have a hierarchical structure. In many subjects, most
notably in Taxonomy such tree structures have been studied using ultrametrics.
Here syntactical hierarchical phrase trees are subject to a similar analysis,
which is much siompler as the branching structure is more readily discernible
and sw... |
cs/9810014 | Resources for Evaluation of Summarization Techniques | cs.CL | We report on two corpora to be used in the evaluation of component systems
for the tasks of (1) linear segmentation of text and (2) summary-directed
sentence extraction. We present characteristics of the corpora, methods used in
the collection of user judgments, and an overview of the application of the
corpora to ev... |
cs/9810015 | Restrictions on Tree Adjoining Languages | cs.CL | Several methods are known for parsing languages generated by Tree Adjoining
Grammars (TAGs) in O(n^6) worst case running time. In this paper we investigate
which restrictions on TAGs and TAG derivations are needed in order to lower
this O(n^6) time complexity, without introducing large runtime constants, and
without ... |
cs/9810016 | SYNERGY: A Linear Planner Based on Genetic Programming | cs.AI | In this paper we describe SYNERGY, which is a highly parallelizable, linear
planning system that is based on the genetic programming paradigm. Rather than
reasoning about the world it is planning for, SYNERGY uses artificial
selection, recombination and fitness measure to generate linear plans that
solve conjunctive ... |
cs/9810017 | General Theory of Image Normalization | cs.CV | We give a systematic, abstract formulation of the image normalization method
as applied to a general group of image transformations, and then illustrate the
abstract analysis by applying it to the hierarchy of viewing transformations of
a planar object.
|
cs/9810018 | A Proof Theoretic View of Constraint Programming | cs.AI cs.PL | We provide here a proof theoretic account of constraint programming that
attempts to capture the essential ingredients of this programming style. We
exemplify it by presenting proof rules for linear constraints over interval
domains, and illustrate their use by analyzing the constraint propagation
process for the {\t... |
cs/9810020 | Computational Geometry Column 33 | cs.CG cs.AI cs.GR | Several recent SIGGRAPH papers on surface simplification are described.
|
cs/9811003 | A Winnow-Based Approach to Context-Sensitive Spelling Correction | cs.LG cs.CL | A large class of machine-learning problems in natural language require the
characterization of linguistic context. Two characteristic properties of such
problems are that their feature space is of very high dimensionality, and their
target concepts refer to only a small subset of the features in the space.
Under such... |
cs/9811004 | Does Meaning Evolve? | cs.CL q-bio.PE | A common method of making a theory more understandable, is by comparing it to
another theory which has been better developed. Radical interpretation is a
theory which attempts to explain how communication has meaning. Radical
interpretation is treated as another time-dependent theory and compared to the
time dependen... |
cs/9811006 | Machine Learning of Generic and User-Focused Summarization | cs.CL cs.LG | A key problem in text summarization is finding a salience function which
determines what information in the source should be included in the summary.
This paper describes the use of machine learning on a training corpus of
documents and their abstracts to discover salience functions which describe
what combination of... |
cs/9811008 | Translating near-synonyms: Possibilities and preferences in the
interlingua | cs.CL | This paper argues that an interlingual representation must explicitly
represent some parts of the meaning of a situation as possibilities (or
preferences), not as necessary or definite components of meaning (or
constraints). Possibilities enable the analysis and generation of nuance,
something required for faithful t... |
cs/9811009 | Choosing the Word Most Typical in Context Using a Lexical Co-occurrence
Network | cs.CL | This paper presents a partial solution to a component of the problem of
lexical choice: choosing the synonym most typical, or expected, in context. We
apply a new statistical approach to representing the context of a word through
lexical co-occurrence networks. The implementation was trained and evaluated on
a large ... |
cs/9811010 | Learning to Resolve Natural Language Ambiguities: A Unified Approach | cs.CL cs.LG | We analyze a few of the commonly used statistics based and machine learning
algorithms for natural language disambiguation tasks and observe that they can
be re-cast as learning linear separators in the feature space. Each of the
methods makes a priori assumptions, which it employs, given the data, when
searching for... |
cs/9811013 | The Asilomar Report on Database Research | cs.DB cs.DL | The database research community is rightly proud of success in basic
research, and its remarkable record of technology transfer. Now the field needs
to radically broaden its research focus to attack the issues of capturing,
storing, analyzing, and presenting the vast array of online data. The database
research commun... |
cs/9811016 | Comparing a statistical and a rule-based tagger for German | cs.CL | In this paper we present the results of comparing a statistical tagger for
German based on decision trees and a rule-based Brill-Tagger for German. We
used the same training corpus (and therefore the same tag-set) to train both
taggers. We then applied the taggers to the same test corpus and compared their
respective... |
cs/9811018 | P-model Alternative to the T-model | cs.CL q-bio.NC | Standard linguistic analysis of syntax uses the T-model. This model requires
the ordering: D-structure $>$ S-structure $>$ LF. Between each of these
representations there is movement which alters the order of the constituent
words; movement is achieved using the principles and parameters of syntactic
theory. Psycholo... |
cs/9811019 | Locked and Unlocked Polygonal Chains in 3D | cs.CG cs.DS cs.RO | In this paper, we study movements of simple polygonal chains in 3D. We say
that an open, simple polygonal chain can be straightened if it can be
continuously reconfigured to a straight sequence of segments in such a manner
that both the length of each link and the simplicity of the chain are
maintained throughout the... |
cs/9811022 | Expoiting Syntactic Structure for Language Modeling | cs.CL | The paper presents a language model that develops syntactic structure and
uses it to extract meaningful information from the word history, thus enabling
the use of long distance dependencies. The model assigns probability to every
joint sequence of words--binary-parse-structure with headword annotation and
operates i... |
cs/9811024 | The Essence of Constraint Propagation | cs.AI | We show that several constraint propagation algorithms (also called (local)
consistency, consistency enforcing, Waltz, filtering or narrowing algorithms)
are instances of algorithms that deal with chaotic iteration. To this end we
propose a simple abstract framework that allows us to classify and compare
these algori... |
cs/9811025 | A Structured Language Model | cs.CL | The paper presents a language model that develops syntactic structure and
uses it to extract meaningful information from the word history, thus enabling
the use of long distance dependencies. The model assigns probability to every
joint sequence of words - binary-parse-structure with headword annotation. The
model, i... |
cs/9811029 | A Human - machine interface for teleoperation of arm manipulators in a
complex environment | cs.RO cs.AI | This paper discusses the feasibility of using configuration space (C-space)
as a means of visualization and control in operator-guided real-time motion of
a robot arm manipulator. The motivation is to improve performance of the human
operator in tasks involving the manipulator motion in an environment with
obstacles.... |
cs/9811030 | Generating Segment Durations in a Text-To-Speech System: A Hybrid
Rule-Based/Neural Network Approach | cs.NE cs.HC | A combination of a neural network with rule firing information from a
rule-based system is used to generate segment durations for a text-to-speech
system. The system shows a slight improvement in performance over a neural
network system without the rule firing information. Synthesized speech using
segment durations w... |
cs/9811031 | Speech Synthesis with Neural Networks | cs.NE cs.HC | Text-to-speech conversion has traditionally been performed either by
concatenating short samples of speech or by using rule-based systems to convert
a phonetic representation of speech into an acoustic representation, which is
then converted into speech. This paper describes a system that uses a
time-delay neural net... |
cs/9811032 | Text-To-Speech Conversion with Neural Networks: A Recurrent TDNN
Approach | cs.NE cs.HC | This paper describes the design of a neural network that performs the
phonetic-to-acoustic mapping in a speech synthesis system. The use of a
time-domain neural network architecture limits discontinuities that occur at
phone boundaries. Recurrent data input also helps smooth the output parameter
tracks. Independent t... |
cs/9812001 | A Probabilistic Approach to Lexical Semantic Knowledge Acquisition and S
tructural Disambiguation | cs.CL | In this thesis, I address the problem of automatically acquiring lexical
semantic knowledge, especially that of case frame patterns, from large corpus
data and using the acquired knowledge in structural disambiguation. The
approach I adopt has the following characteristics: (1) dividing the problem
into three subprob... |
cs/9812002 | Training Reinforcement Neurocontrollers Using the Polytope Algorithm | cs.NE | A new training algorithm is presented for delayed reinforcement learning
problems that does not assume the existence of a critic model and employs the
polytope optimization algorithm to adjust the weights of the action network so
that a simple direct measure of the training performance is maximized.
Experimental resu... |
cs/9812003 | Neural Network Methods for Boundary Value Problems Defined in
Arbitrarily Shaped Domains | cs.NE cond-mat.dis-nn cs.NA math-ph math.MP math.NA physics.comp-ph | Partial differential equations (PDEs) with Dirichlet boundary conditions
defined on boundaries with simple geometry have been succesfuly treated using
sigmoidal multilayer perceptrons in previous works. This article deals with the
case of complex boundary geometry, where the boundary is determined by a number
of poin... |
cs/9812004 | Name Strategy: Its Existence and Implications | cs.CL cs.AI math.HO | It is argued that colour name strategy, object name strategy, and chunking
strategy in memory are all aspects of the same general phenomena, called
stereotyping. It is pointed out that the Berlin-Kay universal partial ordering
of colours and the frequency of traffic accidents classified by colour are
surprisingly sim... |
cs/9812005 | Optimal Multi-Paragraph Text Segmentation by Dynamic Programming | cs.CL | There exist several methods of calculating a similarity curve, or a sequence
of similarity values, representing the lexical cohesion of successive text
constituents, e.g., paragraphs. Methods for deciding the locations of fragment
boundaries are, however, scarce. We propose a fragmentation method based on
dynamic pro... |
cs/9812006 | A High Quality Text-To-Speech System Composed of Multiple Neural
Networks | cs.NE cs.HC | While neural networks have been employed to handle several different
text-to-speech tasks, ours is the first system to use neural networks
throughout, for both linguistic and acoustic processing. We divide the
text-to-speech task into three subtasks, a linguistic module mapping from text
to a linguistic representatio... |
cs/9812010 | Towards a computational theory of human daydreaming | cs.AI | This paper examines the phenomenon of daydreaming: spontaneously recalling or
imagining personal or vicarious experiences in the past or future. The
following important roles of daydreaming in human cognition are postulated:
plan preparation and rehearsal, learning from failures and successes, support
for processes o... |
cs/9812013 | The Self-Organizing Symbiotic Agent | cs.NE cs.CC | In [N. A. Baas, Emergence, Hierarchies, and Hyper-structures, in C.G. Langton
ed., Artificial Life III, Addison Wesley, 1994.] a general framework for the
study of Emergence and hyper-structure was presented. This approach is mostly
concerned with the description of such systems. In this paper we will try to
bring fo... |
cs/9812014 | An Adaptive Agent Oriented Software Architecture | cs.DC cs.MA | A new approach to software design based on an agent-oriented architecture is
presented. Unlike current research, we consider software to be designed and
implemented with this methodology in mind. In this approach agents are
considered adaptively communicating concurrent modules which are divided into a
white box modu... |
cs/9812017 | A reusable iterative optimization software library to solve
combinatorial problems with approximate reasoning | cs.AI | Real world combinatorial optimization problems such as scheduling are
typically too complex to solve with exact methods. Additionally, the problems
often have to observe vaguely specified constraints of different importance,
the available data may be uncertain, and compromises between antagonistic
criteria may be nec... |
cs/9812018 | A Flexible Shallow Approach to Text Generation | cs.CL | In order to support the efficient development of NL generation systems, two
orthogonal methods are currently pursued with emphasis: (1) reusable, general,
and linguistically motivated surface realization components, and (2) simple,
task-oriented template-based techniques. In this paper we argue that, from an
applicat... |
cs/9812021 | Forgetting Exceptions is Harmful in Language Learning | cs.CL cs.LG | We show that in language learning, contrary to received wisdom, keeping
exceptional training instances in memory can be beneficial for generalization
accuracy. We investigate this phenomenon empirically on a selection of
benchmark natural language processing tasks: grapheme-to-phoneme conversion,
part-of-speech taggi... |
cs/9812022 | Hypertree Decompositions and Tractable Queries | cs.DB cs.AI | Several important decision problems on conjunctive queries (CQs) are
NP-complete in general but become tractable, and actually highly
parallelizable, if restricted to acyclic or nearly acyclic queries. Examples
are the evaluation of Boolean CQs and query containment. These problems were
shown tractable for conjunctiv... |
cs/9901001 | TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree
Search | cs.LG cs.AI | In this paper we present TDLeaf(lambda), a variation on the TD(lambda)
algorithm that enables it to be used in conjunction with minimax search. We
present some experiments in both chess and backgammon which demonstrate its
utility and provide comparisons with TD(lambda) and another less radical
variant, TD-directed(l... |
cs/9901002 | KnightCap: A chess program that learns by combining TD(lambda) with
game-tree search | cs.LG cs.AI | In this paper we present TDLeaf(lambda), a variation on the TD(lambda)
algorithm that enables it to be used in conjunction with game-tree search. We
present some experiments in which our chess program ``KnightCap'' used
TDLeaf(lambda) to learn its evaluation function while playing on the Free
Internet Chess Server (F... |
cs/9901003 | Fixpoint 3-valued semantics for autoepistemic logic | cs.LO cs.AI | The paper presents a constructive fixpoint semantics for autoepistemic logic
(AEL). This fixpoint characterizes a unique but possibly three-valued belief
set of an autoepistemic theory. It may be three-valued in the sense that for a
subclass of formulas F, the fixpoint may not specify whether F is believed or
not. Th... |
cs/9901004 | On the geometry of similarity search: dimensionality curse and
concentration of measure | cs.IR cs.CG cs.DB cs.DS | We suggest that the curse of dimensionality affecting the similarity-based
search in large datasets is a manifestation of the phenomenon of concentration
of measure on high-dimensional structures. We prove that, under certain
geometric assumptions on the query domain $\Omega$ and the dataset $X$, if
$\Omega$ satisfie... |
cs/9901005 | An Empirical Approach to Temporal Reference Resolution (journal version) | cs.CL | Scheduling dialogs, during which people negotiate the times of appointments,
are common in everyday life. This paper reports the results of an in-depth
empirical investigation of resolving explicit temporal references in scheduling
dialogs. There are four phases of this work: data annotation and evaluation,
model dev... |
cs/9901008 | Fast Computational Algorithms for the Discrete Wavelet Transform and
Applications of Localized Orthonormal Bases in Signal Classification | cs.MS cs.CE | We construct an algorithm for implementing the discrete wavelet transform by
means of matrices in SO_2(R) for orthonormal compactly supported wavelets and
matrices in SL_m(R), m > = 2, for compactly supported biorthogonal wavelets. We
show that in 1 dimension the total operation count using this algorithm can be
redu... |
cs/9901012 | Extremal problems in logic programming and stable model computation | cs.LO cs.AI | We study the following problem: given a class of logic programs C, determine
the maximum number of stable models of a program from C. We establish the
maximum for the class of all logic programs with at most n clauses, and for the
class of all logic programs of size at most n. We also characterize the
programs for wh... |
cs/9901014 | Minimum Description Length Induction, Bayesianism, and Kolmogorov
Complexity | cs.LG cs.AI cs.CC cs.IT cs.LO math.IT math.PR physics.data-an | The relationship between the Bayesian approach and the minimum description
length approach is established. We sharpen and clarify the general modeling
principles MDL and MML, abstracted as the ideal MDL principle and defined from
Bayes's rule by means of Kolmogorov complexity. The basic condition under which
the idea... |
cs/9901016 | Representation Theory for Default Logic | cs.LO cs.AI | Default logic can be regarded as a mechanism to represent families of belief
sets of a reasoning agent. As such, it is inherently second-order. In this
paper, we study the problem of representability of a family of theories as the
set of extensions of a default theory. We give a complete solution to the
representabil... |
cs/9902001 | Compacting the Penn Treebank Grammar | cs.CL | Treebanks, such as the Penn Treebank (PTB), offer a simple approach to
obtaining a broad coverage grammar: one can simply read the grammar off the
parse trees in the treebank. While such a grammar is easy to obtain, a
square-root rate of growth of the rule set with corpus size suggests that the
derived grammar is far... |
cs/9902002 | Automatic Identification of Subjects for Textual Documents in Digital
Libraries | cs.DL cs.CL | The amount of electronic documents in the Internet grows very quickly. How to
effectively identify subjects for documents becomes an important issue. In
past, the researches focus on the behavior of nouns in documents. Although
subjects are composed of nouns, the constituents that determine which nouns are
subjects a... |
cs/9902005 | Mutual Search | cs.DS cs.CC cs.DB cs.DC cs.DM cs.IR | We introduce a search problem called ``mutual search'' where $k$ \agents,
arbitrarily distributed over $n$ sites, are required to locate one another by
posing queries of the form ``Anybody at site $i$?''. We ask for the least
number of queries that is necessary and sufficient. For the case of two \agents
using determ... |
cs/9902006 | A Discipline of Evolutionary Programming | cs.NE cs.AI cs.CC cs.DS cs.LG cs.MA | Genetic fitness optimization using small populations or small population
updates across generations generally suffers from randomly diverging
evolutions. We propose a notion of highly probable fitness optimization through
feasible evolutionary computing runs on small size populations. Based on
rapidly mixing Markov c... |
cs/9902015 | Resource Discovery in Trilogy | cs.DL cs.AI cs.MA | Trilogy is a collaborative project whose key aim is the development of an
integrated virtual laboratory to support research training within each
institution and collaborative projects between the partners. In this paper, the
architecture and underpinning platform of the system is described with
particular emphasis be... |
cs/9902017 | Not Available | cs.DL cs.DB | withdrawn by author
|
cs/9902018 | ZBroker: A Query Routing Broker for Z39.50 Databases | cs.DL cs.DB | A query routing broker is a software agent that determines from a large set
of accessing information sources the ones most relevant to a user's information
need. As the number of information sources on the Internet increases
dramatically, future users will have to rely on query routing brokers to decide
a small numbe... |
cs/9902021 | Visualization of Retrieved Documents using a Presentation Server | cs.DL cs.IR | In any search-based digital library (DL) systems dealing with a non-trivial
number of documents, users are often required to go through a long list of
short document descriptions in order to identify what they are looking for. To
tackle the problem, a variety of document organization algorithms and/or
visualization t... |
cs/9902024 | Algorithms of Two-Level Parallelization for DSMC of Unsteady Flows in
Molecular Gasdynamics | cs.CE cs.PF | The general scheme of two-level parallelization (TLP) for direct simulation
Monte Carlo of unsteady gas flows on shared memory multiprocessor computers has
been described. The high efficient algorithm of parallel independent runs is
used on the first level. The data parallelization is employed for the second
one. Two... |
cs/9902025 | An Efficient Mean Field Approach to the Set Covering Problem | cs.NE | A mean field feedback artificial neural network algorithm is developed and
explored for the set covering problem. A convenient encoding of the inequality
constraints is achieved by means of a multilinear penalty function. An
approximate energy minimum is obtained by iterating a set of mean field
equations, in combina... |
cs/9902026 | Probabilistic Inductive Inference:a Survey | cs.LG cs.CC cs.LO math.LO | Inductive inference is a recursion-theoretic theory of learning, first
developed by E. M. Gold (1967). This paper surveys developments in
probabilistic inductive inference. We mainly focus on finite inference of
recursive functions, since this simple paradigm has produced the most
interesting (and most complex) resul... |
cs/9902027 | Autocatalytic Theory of Meaning | cs.CL adap-org nlin.AO | Recently it has been argued that autocatalytic theory could be applied to the
origin of culture. Here possible application to a theory of meaning in the
philosophy of language, called radical interpretation, is commented upon and
compared to previous applications.
|
cs/9902028 | A Scrollbar-based Visualization for Document Navigation | cs.IR cs.HC | We are interested in questions of improving user control in best-match
text-retrieval systems, specifically questions as to whether simple
visualizations that nonetheless go beyond the minimal ones generally available
can significantly help users. Recently, we have been investigating ways to help
users decide-given a... |
cs/9902029 | The "Fodor"-FODOR fallacy bites back | cs.CL | The paper argues that Fodor and Lepore are misguided in their attack on
Pustejovsky's Generative Lexicon, largely because their argument rests on a
traditional, but implausible and discredited, view of the lexicon on which it
is effectively empty of content, a view that stands in the long line of
explaining word mean... |
cs/9902030 | Is Word Sense Disambiguation just one more NLP task? | cs.CL | This paper compares the tasks of part-of-speech (POS) tagging and
word-sense-tagging or disambiguation (WSD), and argues that the tasks are not
related by fineness of grain or anything like that, but are quite different
kinds of task, particularly becuase there is nothing in POS corresponding to
sense novelty. The pa... |
cs/9903002 | An Algebraic Programming Style for Numerical Software and its
Optimization | cs.SE cs.AI cs.CE cs.MS | The abstract mathematical theory of partial differential equations (PDEs) is
formulated in terms of manifolds, scalar fields, tensors, and the like, but
these algebraic structures are hardly recognizable in actual PDE solvers. The
general aim of the Sophus programming style is to bridge the gap between theory
and pra... |
cs/9903003 | A Formal Framework for Linguistic Annotation | cs.CL | `Linguistic annotation' covers any descriptive or analytic notations applied
to raw language data. The basic data may be in the form of time functions --
audio, video and/or physiological recordings -- or it may be textual. The added
notations may include transcriptions of all sorts (from phonetic features to
discour... |
cs/9903007 | Some Remarks on the Geometry of Grammar | cs.CL cs.LO | This paper, following (Dymetman:1998), presents an approach to grammar
description and processing based on the geometry of cancellation diagrams, a
concept which plays a central role in combinatorial group theory
(Lyndon-Schuppe:1977). The focus here is on the geometric intuitions and on
relating group-theoretical di... |
cs/9903008 | Empirically Evaluating an Adaptable Spoken Dialogue System | cs.CL | Recent technological advances have made it possible to build real-time,
interactive spoken dialogue systems for a wide variety of applications.
However, when users do not respect the limitations of such systems, performance
typically degrades. Although users differ with respect to their knowledge of
system limitation... |
cs/9903011 | A complete anytime algorithm for balanced number partitioning | cs.DS cond-mat.dis-nn cs.AI | Given a set of numbers, the balanced partioning problem is to divide them
into two subsets, so that the sum of the numbers in each subset are as nearly
equal as possible, subject to the constraint that the cardinalities of the
subsets be within one of each other. We combine the balanced largest
differencing method (B... |
cs/9903016 | Modeling Belief in Dynamic Systems, Part II: Revision and Update | cs.AI | The study of belief change has been an active area in philosophy and AI. In
recent years two special cases of belief change, belief revision and belief
update, have been studied in detail. In a companion paper (Friedman & Halpern,
1997), we introduce a new framework to model belief change. This framework
combines tem... |
cs/9903017 | SIMMUNE, a tool for simulating and analyzing immune system behavior | cs.MA q-bio | We present a new approach to the simulation and analysis of immune system
behavior. The simulations that can be done with our software package called
SIMMUNE are based on immunological data that describe the behavior of immune
system agents (cells, molecules) on a microscopial (i.e. agent-agent
interaction) scale by ... |
cs/9904001 | A Proposal for the Establishment of Review Boards - a flexible approach
to the selection of academic knowledge | cs.CY cs.DL cs.IR | Paper journals use a small number of trusted academics to select information
on behalf of all their readers. This inflexibility in the selection was
justified due to the expense of publishing. The advent of cheap distribution
via the internet allows a new trade-off between time and expense and the
flexibility of the ... |
cs/9904002 | A geometric framework for modelling similarity search | cs.IR cs.DB cs.DS | The aim of this paper is to propose a geometric framework for modelling
similarity search in large and multidimensional data spaces of general nature,
which seems to be flexible enough to address such issues as analysis of
complexity, indexability, and the `curse of dimensionality.' Such a framework
is provided by th... |
cs/9904003 | The Structure of Weighting Coefficient Matrices of Harmonic Differential
Quadrature and Its Applications | cs.CE cs.NA math.NA | The structure of weighting coefficient matrices of Harmonic Differential
Quadrature (HDQ) is found to be either centrosymmetric or skew centrosymmetric
depending on the order of the corresponding derivatives. The properties of both
matrices are briefly discussed in this paper. It is noted that the
computational effor... |
cs/9904004 | Mixing Metaphors | cs.CL cs.AI | Mixed metaphors have been neglected in recent metaphor research. This paper
suggests that such neglect is short-sighted. Though mixing is a more complex
phenomenon than straight metaphors, the same kinds of reasoning and knowledge
structures are required. This paper provides an analysis of both parallel and
serial mi... |
cs/9904006 | Jacobian matrix: a bridge between linear and nonlinear polynomial-only
problems | cs.CE cs.NA math.NA | By using the Hadamard matrix product concept, this paper introduces two
generalized matrix formulation forms of numerical analogue of nonlinear
differential operators. The SJT matrix-vector product approach is found to be a
simple, efficient and accurate technique in the calculation of the Jacobian
matrix of the nonl... |
cs/9904007 | The Study on the Nonlinear Computations of the DQ and DC Methods | cs.CE cs.NA math.NA | This paper points out that the differential quadrature (DQ) and differential
cubature (DC) methods due to their global domain property are more efficient
for nonlinear problems than the traditional numerical techniques such as finite
element and finite difference methods. By introducing the Hadamard product of
matric... |
cs/9904008 | Transducers from Rewrite Rules with Backreferences | cs.CL | Context sensitive rewrite rules have been widely used in several areas of
natural language processing, including syntax, morphology, phonology and speech
processing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given various
algorithms to compile such rewrite rules into finite-state transducers. The
present pap... |
cs/9904009 | An ascription-based approach to speech acts | cs.CL | The two principal areas of natural language processing research in pragmatics
are belief modelling and speech act processing. Belief modelling is the
development of techniques to represent the mental attitudes of a dialogue
participant. The latter approach, speech act processing, based on speech act
theory, involves ... |
cs/9904018 | A Computational Memory and Processing Model for Processing for Prosody | cs.CL | This paper links prosody to the information in a text and how it is processed
by the speaker. It describes the operation and output of LOQ, a text-to-speech
implementation that includes a model of limited attention and working memory.
Attentional limitations are key. Varying the attentional parameter in the
simulatio... |
cs/9904021 | Hadamard product nonlinear formulation of Galerkin and finite element
methods | cs.CE cs.NA math.NA | A novel nonlinear formulation of the finite element and Galerkin methods is
presented here, which leads to the Hadamard product expression of the resultant
nonlinear algebraic analogue. The presented formulation attains the advantages
of weak formulation in the standard finite element and Galerkin schemes and
avoids ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.