id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0302036 | Constraint-based analysis of composite solvers | cs.AI | Cooperative constraint solving is an area of constraint programming that
studies the interaction between constraint solvers with the aim of discovering
the interaction patterns that amplify the positive qualities of individual
solvers. Automatisation and formalisation of such studies is an important issue
of cooperat... |
cs/0302038 | Tight Logic Programs | cs.AI cs.LO | This note is about the relationship between two theories of negation as
failure -- one based on program completion, the other based on stable models,
or answer sets. Francois Fages showed that if a logic program satisfies a
certain syntactic condition, which is now called ``tightness,'' then its stable
models can be ... |
cs/0302039 | Kalman-filtering using local interactions | cs.AI | There is a growing interest in using Kalman-filter models for brain
modelling. In turn, it is of considerable importance to represent Kalman-filter
in connectionist forms with local Hebbian learning rules. To our best
knowledge, Kalman-filter has not been given such local representation. It seems
that the main obstac... |
cs/0303002 | About compression of vocabulary in computer oriented languages | cs.CL | The author uses the entropy of the ideal Bose-Einstein gas to minimize losses
in computer-oriented languages.
|
cs/0303006 | On the Notion of Cognition | cs.AI | We discuss philosophical issues concerning the notion of cognition basing
ourselves in experimental results in cognitive sciences, especially in computer
simulations of cognitive systems. There have been debates on the "proper"
approach for studying cognition, but we have realized that all approaches can
be in theory... |
cs/0303007 | Glottochronology and problems of protolanguage reconstruction | cs.CL | A method of languages genealogical trees construction is proposed.
|
cs/0303009 | Unfolding Partiality and Disjunctions in Stable Model Semantics | cs.AI | The paper studies an implementation methodology for partial and disjunctive
stable models where partiality and disjunctions are unfolded from a logic
program so that an implementation of stable models for normal
(disjunction-free) programs can be used as the core inference engine. The
unfolding is done in two separat... |
cs/0303015 | Statistical efficiency of curve fitting algorithms | cs.CV | We study the problem of fitting parametrized curves to noisy data. Under
certain assumptions (known as Cartesian and radial functional models), we
derive asymptotic expressions for the bias and the covariance matrix of the
parameter estimates. We also extend Kanatani's version of the Cramer-Rao lower
bound, which he ... |
cs/0303017 | A Neural Network Assembly Memory Model with Maximum-Likelihood Recall
and Recognition Properties | cs.AI cs.IR cs.NE q-bio.NC q-bio.QM | It has been shown that a neural network model recently proposed to describe
basic memory performance is based on a ternary/binary coding/decoding algorithm
which leads to a new neural network assembly memory model (NNAMM) providing
maximum-likelihood recall/recognition properties and implying a new memory unit
archit... |
cs/0303018 | Multi-target particle filtering for the probability hypothesis density | cs.AI | When tracking a large number of targets, it is often computationally
expensive to represent the full joint distribution over target states. In cases
where the targets move independently, each target can instead be tracked with a
separate filter. However, this leads to a model-data association problem.
Another approac... |
cs/0303022 | Probabilistic behavior of hash tables | cs.DS cs.DB | We extend a result of Goldreich and Ron about estimating the collision
probability of a hash function. Their estimate has a polynomial tail. We prove
that when the load factor is greater than a certain constant, the estimator has
a gaussian tail. As an application we find an estimate of an upper bound for
the average... |
cs/0303023 | Conferences with Internet Web-Casting as Binding Events in a Global
Brain: Example Data From Complexity Digest | cs.NI cs.AI | There is likeness of the Internet to human brains which has led to the
metaphor of the world-wide computer network as a `Global Brain'. We consider
conferences as 'binding events' in the Global Brain that can lead to
metacognitive structures on a global scale. One of the critical factors for
that phenomenon to happen... |
cs/0303024 | Differential Methods in Catadioptric Sensor Design with Applications to
Panoramic Imaging | cs.CV cs.RO | We discuss design techniques for catadioptric sensors that realize given
projections. In general, these problems do not have solutions, but approximate
solutions may often be found that are visually acceptable. There are several
methods to approach this problem, but here we focus on what we call the
``vector field ap... |
cs/0303025 | Algorithmic Clustering of Music | cs.SD cs.LG physics.data-an | We present a fully automatic method for music classification, based only on
compression of strings that represent the music pieces. The method uses no
background knowledge about music whatsoever: it is completely general and can,
without change, be used in different areas like linguistic classification and
genomics. ... |
cs/0303031 | A Bird's eye view of Matrix Distributed Processing | cs.DC cs.CE cs.DM cs.MS hep-lat physics.comp-ph | We present Matrix Distributed Processing, a C++ library for fast development
of efficient parallel algorithms. MDP is based on MPI and consists of a
collection of C++ classes and functions such as lattice, site and field. Once
an algorithm is written using these components the algorithm is automatically
parallel and ... |
cs/0303032 | Recent Results on No-Free-Lunch Theorems for Optimization | cs.NE math.OC nlin.AO | The sharpened No-Free-Lunch-theorem (NFL-theorem) states that the performance
of all optimization algorithms averaged over any finite set F of functions is
equal if and only if F is closed under permutation (c.u.p.) and each target
function in F is equally likely. In this paper, we first summarize some
consequences o... |
cs/0304006 | Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence
Alignment | cs.CL | We address the text-to-text generation problem of sentence-level paraphrasing
-- a phenomenon distinct from and more difficult than word- or phrase-level
paraphrasing. Our approach applies multiple-sequence alignment to sentences
gathered from unannotated comparable corpora: it learns a set of paraphrasing
patterns r... |
cs/0304007 | A Method for Clustering Web Attacks Using Edit Distance | cs.IR cs.AI cs.CR | Cluster analysis often serves as the initial step in the process of data
classification. In this paper, the problem of clustering different length input
data is considered. The edit distance as the minimum number of elementary edit
operations needed to transform one vector into another is used. A heuristic for
cluste... |
cs/0304009 | Stochastic Volatility in a Quantitative Model of Stock Market Returns | cs.CE | Standard quantitative models of the stock market predict a log-normal
distribution for stock returns (Bachelier 1900, Osborne 1959), but it is
recognised (Fama 1965) that empirical data, in comparison with a Gaussian,
exhibit leptokurtosis (it has more probability mass in its tails and centre)
and fat tails (probabil... |
cs/0304019 | Blind Normalization of Speech From Different Channels | cs.CL | We show how to construct a channel-independent representation of speech that
has propagated through a noisy reverberant channel. This is done by blindly
rescaling the cepstral time series by a non-linear function, with the form of
this scale function being determined by previously encountered cepstra from
that channe... |
cs/0304022 | Self-Replicating Machines in Continuous Space with Virtual Physics | cs.NE cs.CE q-bio.PE | JohnnyVon is an implementation of self-replicating machines in continuous
two-dimensional space. Two types of particles drift about in a virtual liquid.
The particles are automata with discrete internal states but continuous
external relationships. Their internal states are governed by finite state
machines but their... |
cs/0304024 | Glottochronologic Retrognostic of Language System | cs.CL | A glottochronologic retrognostic of language system is proposed
|
cs/0304027 | "I'm sorry Dave, I'm afraid I can't do that": Linguistics, Statistics,
and Natural Language Processing circa 2001 | cs.CL | A brief, general-audience overview of the history of natural language
processing, focusing on data-driven approaches.Topics include "Ambiguity and
language analysis", "Firth things first", "A 'C' change", and "The empiricists
strike back".
|
cs/0304028 | Grid-Enabling Natural Language Engineering By Stealth | cs.DC cs.CL | We describe a proposal for an extensible, component-based software
architecture for natural language engineering applications. Our model leverages
existing linguistic resource description and discovery mechanisms based on
extended Dublin Core metadata. In addition, the application design is flexible,
allowing dispara... |
cs/0304029 | An XML based Document Suite | cs.CL | We report about the current state of development of a document suite and its
applications. This collection of tools for the flexible and robust processing
of documents in German is based on the use of XML as unifying formalism for
encoding input and output data as well as process information. It is organized
in modul... |
cs/0304035 | Exploiting Sublanguage and Domain Characteristics in a Bootstrapping
Approach to Lexicon and Ontology Creation | cs.CL | It is very costly to build up lexical resources and domain ontologies.
Especially when confronted with a new application domain lexical gaps and a
poor coverage of domain concepts are a problem for the successful exploitation
of natural language document analysis systems that need and exploit such
knowledge sources. ... |
cs/0304036 | An Approach for Resource Sharing in Multilingual NLP | cs.CL | In this paper we describe an approach for the analysis of documents in German
and English with a shared pool of resources. For the analysis of German
documents we use a document suite, which supports the user in tasks like
information retrieval and information extraction. The core of the document
suite is based on ou... |
cs/0305001 | A Framework for Searching AND/OR Graphs with Cycles | cs.AI | Search in cyclic AND/OR graphs was traditionally known to be an unsolved
problem. In the recent past several important studies have been reported in
this domain. In this paper, we have taken a fresh look at the problem. First, a
new and comprehensive theoretical framework for cyclic AND/OR graphs has been
presented, ... |
cs/0305004 | Approximate Grammar for Information Extraction | cs.CL cs.AI | In this paper, we present the concept of Approximate grammar and how it can
be used to extract information from a documemt. As the structure of
informational strings cannot be defined well in a document, we cannot use the
conventional grammar rules to represent the information. Hence, the need arises
to design an app... |
cs/0305012 | Time-scales, Meaning, and Availability of Information in a Global Brain | cs.AI cs.CY cs.NI | We note the importance of time-scales, meaning, and availability of
information for the emergence of novel information meta-structures at a global
scale. We discuss previous work in this area and develop future perspectives.
We focus on the transmission of scientific articles and the integration of
traditional confer... |
cs/0305013 | On Nonspecific Evidence | cs.AI cs.NE | When simultaneously reasoning with evidences about several different events
it is necessary to separate the evidence according to event. These events
should then be handled independently. However, when propositions of evidences
are weakly specified in the sense that it may not be certain to which event
they are refer... |
cs/0305014 | Dempster's Rule for Evidence Ordered in a Complete Directed Acyclic
Graph | cs.AI cs.DM | For the case of evidence ordered in a complete directed acyclic graph this
paper presents a new algorithm with lower computational complexity for
Dempster's rule than that of step-by-step application of Dempster's rule. In
this problem, every original pair of evidences, has a corresponding evidence
against the simult... |
cs/0305015 | Finding a Posterior Domain Probability Distribution by Specifying
Nonspecific Evidence | cs.AI cs.NE | This article is an extension of the results of two earlier articles. In [J.
Schubert, On nonspecific evidence, Int. J. Intell. Syst. 8 (1993) 711-725] we
established within Dempster-Shafer theory a criterion function called the
metaconflict function. With this criterion we can partition into subsets a set
of several ... |
cs/0305017 | Cluster-based Specification Techniques in Dempster-Shafer Theory | cs.AI cs.NE | When reasoning with uncertainty there are many situations where evidences are
not only uncertain but their propositions may also be weakly specified in the
sense that it may not be certain to which event a proposition is referring. It
is then crucial not to combine such evidences in the mistaken belief that they
are ... |
cs/0305018 | Cluster-based Specification Techniques in Dempster-Shafer Theory for an
Evidential Intelligence Analysis of MultipleTarget Tracks (Thesis Abstract) | cs.AI cs.NE | In Intelligence Analysis it is of vital importance to manage uncertainty.
Intelligence data is almost always uncertain and incomplete, making it
necessary to reason and taking decisions under uncertainty. One way to manage
the uncertainty in Intelligence Analysis is Dempster-Shafer Theory. This thesis
contains five r... |
cs/0305019 | On rho in a Decision-Theoretic Apparatus of Dempster-Shafer Theory | cs.AI | Thomas M. Strat has developed a decision-theoretic apparatus for
Dempster-Shafer theory (Decision analysis using belief functions, Intern. J.
Approx. Reason. 4(5/6), 391-417, 1990). In this apparatus, expected utility
intervals are constructed for different choices. The choice with the highest
expected utility is pre... |
cs/0305020 | Specifying nonspecific evidence | cs.AI cs.NE | In an earlier article [J. Schubert, On nonspecific evidence, Int. J. Intell.
Syst. 8(6), 711-725 (1993)] we established within Dempster-Shafer theory a
criterion function called the metaconflict function. With this criterion we can
partition into subsets a set of several pieces of evidence with propositions
that are ... |
cs/0305021 | Creating Prototypes for Fast Classification in Dempster-Shafer
Clustering | cs.AI cs.NE | We develop a classification method for incoming pieces of evidence in
Dempster-Shafer theory. This methodology is based on previous work with
clustering and specification of originally nonspecific evidence. This
methodology is here put in order for fast classification of future incoming
pieces of evidence by comparin... |
cs/0305022 | Applying Data Mining and Machine Learning Techniques to Submarine
Intelligence Analysis | cs.AI cs.DB cs.NE | We describe how specialized database technology and data analysis methods
were applied by the Swedish defense to help deal with the violation of Swedish
marine territory by foreign submarine intruders during the Eighties and early
Nineties. Among several approaches tried some yielded interesting information,
although... |
cs/0305023 | Fast Dempster-Shafer clustering using a neural network structure | cs.AI cs.NE | In this paper we study a problem within Dempster-Shafer theory where 2**n - 1
pieces of evidence are clustered by a neural structure into n clusters. The
clustering is done by minimizing a metaconflict function. Previously we
developed a method based on iterative optimization. However, for large scale
problems we nee... |
cs/0305024 | A neural network and iterative optimization hybrid for Dempster-Shafer
clustering | cs.AI cs.NE | In this paper we extend an earlier result within Dempster-Shafer theory
["Fast Dempster-Shafer Clustering Using a Neural Network Structure," in Proc.
Seventh Int. Conf. Information Processing and Management of Uncertainty in
Knowledge-Based Systems (IPMU 98)] where a large number of pieces of evidence
are clustered i... |
cs/0305025 | Simultaneous Dempster-Shafer clustering and gradual determination of
number of clusters using a neural network structure | cs.AI cs.NE | In this paper we extend an earlier result within Dempster-Shafer theory
["Fast Dempster-Shafer Clustering Using a Neural Network Structure," in Proc.
Seventh Int. Conf. Information Processing and Management of Uncertainty in
Knowledge-Based Systems (IPMU'98)] where several pieces of evidence were
clustered into a fix... |
cs/0305026 | Fast Dempster-Shafer clustering using a neural network structure | cs.AI cs.NE | In this article we study a problem within Dempster-Shafer theory where 2**n -
1 pieces of evidence are clustered by a neural structure into n clusters. The
clustering is done by minimizing a metaconflict function. Previously we
developed a method based on iterative optimization. However, for large scale
problems we n... |
cs/0305027 | Managing Inconsistent Intelligence | cs.AI cs.NE | In this paper we demonstrate that it is possible to manage intelligence in
constant time as a pre-process to information fusion through a series of
processes dealing with issues such as clustering reports, ranking reports with
respect to importance, extraction of prototypes from clusters and immediate
classification ... |
cs/0305028 | Dempster-Shafer clustering using Potts spin mean field theory | cs.AI cs.NE | In this article we investigate a problem within Dempster-Shafer theory where
2**q - 1 pieces of evidence are clustered into q clusters by minimizing a
metaconflict function, or equivalently, by minimizing the sum of weight of
conflict over all clusters. Previously one of us developed a method based on a
Hopfield and ... |
cs/0305029 | Conflict-based Force Aggregation | cs.AI cs.NE | In this paper we present an application where we put together two methods for
clustering and classification into a force aggregation method. Both methods are
based on conflicts between elements. These methods work with different type of
elements (intelligence reports, vehicles, military units) on different
hierarchic... |
cs/0305030 | Reliable Force Aggregation Using a Refined Evidence Specification from
Dempster-Shafer Clustering | cs.AI cs.NE | In this paper we develop methods for selection of templates and use these
templates to recluster an already performed Dempster-Shafer clustering taking
into account intelligence to template fit during the reclustering phase. By
this process the risk of erroneous force aggregation based on some misplace
pieces of evid... |
cs/0305031 | Clustering belief functions based on attracting and conflicting
metalevel evidence | cs.AI cs.NE | In this paper we develop a method for clustering belief functions based on
attracting and conflicting metalevel evidence. Such clustering is done when the
belief functions concern multiple events, and all belief functions are mixed
up. The clustering process is used as the means for separating the belief
functions in... |
cs/0305032 | Robust Report Level Cluster-to-Track Fusion | cs.AI cs.NE | In this paper we develop a method for report level tracking based on
Dempster-Shafer clustering using Potts spin neural networks where clusters of
incoming reports are gradually fused into existing tracks, one cluster for each
track. Incoming reports are put into a cluster and continuous reclustering of
older reports... |
cs/0305033 | Beslutst\"odssystemet Dezzy - en \"oversikt | cs.AI cs.DB | Within the scope of the three-year ANTI-SUBMARINE WARFARE project of the
National Defence Research Establishment, the INFORMATION SYSTEMS subproject has
developed the demonstration prototype Dezzy for handling and analysis of
intelligence reports concerning foreign underwater activities.
-----
Inom ramen f\"or FO... |
cs/0305036 | Using Dynamic Simulation in the Development of Construction Machinery | cs.CE | As in the car industry for quite some time, dynamic simulation of complete
vehicles is being practiced more and more in the development of off-road
machinery. However, specific questions arise due not only to company structure
and size, but especially to the type of product. Tightly coupled, non-linear
subsystems of ... |
cs/0305038 | The Evolution of the Computerized Database | cs.DB | Databases, collections of related data, are as old as the written word. A
database can be anything from a homemaker's metal recipe file to a
sophisticated data warehouse. Yet today, when we think of a database we
invariably think of computerized data and their DBMSs (database management
systems). How did we go from o... |
cs/0305040 | Bounded LTL Model Checking with Stable Models | cs.LO cs.AI | In this paper bounded model checking of asynchronous concurrent systems is
introduced as a promising application area for answer set programming. As the
model of asynchronous systems a generalisation of communicating automata,
1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a
requirement on the be... |
cs/0305041 | Factorization of Language Models through Backing-Off Lattices | cs.CL | Factorization of statistical language models is the task that we resolve the
most discriminative model into factored models and determine a new model by
combining them so as to provide better estimate. Most of previous works mainly
focus on factorizing models of sequential events, each of which allows only one
factor... |
cs/0305044 | Updating beliefs with incomplete observations | cs.AI | Currently, there is renewed interest in the problem, raised by Shafer in
1985, of updating probabilities when observations are incomplete. This is a
fundamental problem in general, and of particular interest for Bayesian
networks. Recently, Grunwald and Halpern have shown that commonly used updating
strategies fail i... |
cs/0305048 | 2D Electrophoresis Gel Image and Diagnosis of a Disease | cs.CC cs.CV q-bio.QM | The process of diagnosing a disease from the 2D gel electrophoresis image is
a challenging problem. This is due to technical difficulties of generating
reproducible images with a normalized form and the effect of negative stain. In
this paper, we will discuss a new concept of interpreting the 2D images and
overcoming... |
cs/0305052 | On the Existence and Convergence Computable Universal Priors | cs.LG cs.AI cs.CC math.ST stat.TH | Solomonoff unified Occam's razor and Epicurus' principle of multiple
explanations to one elegant, formal, universal theory of inductive inference,
which initiated the field of algorithmic information theory. His central result
is that the posterior of his universal semimeasure M converges rapidly to the
true sequence... |
cs/0305053 | Developing Open Data Models for Linguistic Field Data | cs.DL cs.CL | The UQ Flint Archive houses the field notes and elicitation recordings made
by Elwyn Flint in the 1950's and 1960's during extensive linguistic survey work
across Queensland, Australia.
The process of digitizing the contents of the UQ Flint Archive provides a
number of interesting challenges in the context of EMELD... |
cs/0305055 | Goodness-of-fit of the Heston model | cs.CE | An analytical formula for the probability distribution of stock-market
returns, derived from the Heston model assuming a mean-reverting stochastic
volatility, was recently proposed by Dragulescu and Yakovenko in Quantitative
Finance 2002. While replicating their results, we found two significant
weaknesses in their m... |
cs/0305056 | Configuration Database for BaBar On-line | cs.DB cs.IR | The configuration database is one of the vital systems in the BaBar on-line
system. It provides services for the different parts of the data acquisition
system and control system, which require run-time parameters. The original
design and implementation of the configuration database played a significant
role in the s... |
cs/0306006 | Experience with the Open Source based implementation for ATLAS
Conditions Data Management System | cs.DB | Conditions Data in high energy physics experiments is frequently seen as
every data needed for reconstruction besides the event data itself. This
includes all sorts of slowly evolving data like detector alignment, calibration
and robustness, and data from detector control system. Also, every Conditions
Data Object is... |
cs/0306013 | Transparent Persistence with Java Data Objects | cs.DB | Flexible and performant Persistency Service is a necessary component of any
HEP Software Framework. The building of a modular, non-intrusive and performant
persistency component have been shown to be very difficult task. In the past,
it was very often necessary to sacrifice modularity to achieve acceptable
performanc... |
cs/0306016 | Modelling Biochemical Operations on RNA Secondary Structures | cs.CE q-bio | In this paper we model several simple biochemical operations on RNA molecules
that modify their secondary structure by means of a suitable variation of
Gro\ss e-Rhode's Algebra Transformation Systems.
|
cs/0306017 | Minimum Model Semantics for Logic Programs with Negation-as-Failure | cs.LO cs.AI cs.PL | We give a purely model-theoretic characterization of the semantics of logic
programs with negation-as-failure allowed in clause bodies. In our semantics
the meaning of a program is, as in the classical case, the unique minimum model
in a program-independent ordering. We use an expanded truth domain that has an
uncoun... |
cs/0306019 | Relational databases for data management in PHENIX | cs.DB | PHENIX is one of the two large experiments at the Relativistic Heavy Ion
Collider (RHIC) at Brookhaven National Laboratory (BNL) and archives roughly
100TB of experimental data per year. In addition, large volumes of simulated
data are produced at multiple off-site computing centers. For any file catalog
to play a ce... |
cs/0306020 | On the Verge of One Petabyte - the Story Behind the BaBar Database
System | cs.DB | The BaBar database has pioneered the use of a commercial ODBMS within the HEP
community. The unique object-oriented architecture of Objectivity/DB has made
it possible to manage over 700 terabytes of production data generated since
May'99, making the BaBar database the world's largest known database. The
ongoing deve... |
cs/0306021 | Visualization for Periodic Population Movement between Distinct
Localities | cs.IR | We present a new visualization method to summarize and present periodic
population movement between distinct locations, such as floors, buildings,
cities, or the like. In the specific case of this paper, we have chosen to
focus on student movement between college dormitories on the Columbia
University campus. The vis... |
cs/0306022 | Techniques for effective vocabulary selection | cs.CL cs.AI | The vocabulary of a continuous speech recognition (CSR) system is a
significant factor in determining its performance. In this paper, we present
three principled approaches to select the target vocabulary for a particular
domain by trading off between the target out-of-vocabulary (OOV) rate and
vocabulary size. We ev... |
cs/0306023 | The Redesigned BaBar Event Store: Believe the Hype | cs.DB cs.DS | As the BaBar experiment progresses, it produces new and unforeseen
requirements and increasing demands on capacity and feature base. The current
system is being utilized well beyond its original design specifications, and
has scaled appropriately, maintaining data consistency and durability. The
persistent event stor... |
cs/0306026 | BdbServer++: A User Driven Data Location and Retrieval Tool | cs.IR | The adoption of Grid technology has the potential to greatly aid the BaBar
experiment. BdbServer was originally designed to extract copies of data from
the Objectivity/DB database at SLAC and IN2P3. With data now stored in multiple
locations in a variety of data formats, we are enhancing this tool. This will
enable u... |
cs/0306034 | A ROOT/IO Based Software Framework for CMS | cs.DB | The implementation of persistency in the Compact Muon Solenoid (CMS) Software
Framework uses the core I/O functionality of ROOT. We will discuss the current
ROOT/IO implementation, its evolution from the prior Objectivity/DB
implementation, and the plans and ongoing work for the conversion to "POOL",
provided by the ... |
cs/0306036 | Sequence Prediction based on Monotone Complexity | cs.AI cs.IT cs.LG math.IT math.ST stat.TH | This paper studies sequence prediction based on the monotone Kolmogorov
complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is
extremely close to Solomonoff's prior M, the latter being an excellent
predictor in deterministic as well as probabilistic environments, where
performance is measured ... |
cs/0306039 | Bayesian Information Extraction Network | cs.CL cs.AI cs.IR | Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various
aspects of language in one model. Many existing algorithms developed for
learning and inference in DBNs are applicable to probabilistic language
modeling. To demonstrate the potential of DBNs for natural language processing,
we employ a DBN in... |
cs/0306040 | The Open Language Archives Community: An infrastructure for distributed
archiving of language resources | cs.CL cs.DL | New ways of documenting and describing language via electronic media coupled
with new ways of distributing the results via the World-Wide Web offer a degree
of access to language resources that is unparalleled in history. At the same
time, the proliferation of approaches to using these new technologies is
causing ser... |
cs/0306049 | Hyperdense Coding Modulo 6 with Filter-Machines | cs.CC cs.DB | We show how one can encode $n$ bits with $n^{o(1)}$ ``wave-bits'' using still
hypothetical filter-machines (here $o(1)$ denotes a positive quantity which
goes to 0 as $n$ goes to infity). Our present result - in a completely
different computational model - significantly improves on the quantum
superdense-coding break... |
cs/0306050 | Introduction to the CoNLL-2003 Shared Task: Language-Independent Named
Entity Recognition | cs.CL | We describe the CoNLL-2003 shared task: language-independent named entity
recognition. We give background information on the data sets (English and
German) and the evaluation method, present a general overview of the systems
that have taken part in the task and discuss their performance.
|
cs/0306056 | Twelve Ways to Build CMS Crossings from ROOT Files | cs.DB | The simulation of CMS raw data requires the random selection of one hundred
and fifty pileup events from a very large set of files, to be superimposed in
memory to the signal event. The use of ROOT I/O for that purpose is quite
unusual: the events are not read sequentially but pseudo-randomly, they are not
processed ... |
cs/0306061 | Operational Aspects of Dealing with the Large BaBar Data Set | cs.DB cs.DC | To date, the BaBar experiment has stored over 0.7PB of data in an
Objectivity/DB database. Approximately half this data-set comprises simulated
data of which more than 70% has been produced at more than 20 collaborating
institutes outside of SLAC. The operational aspects of managing such a large
data set and providin... |
cs/0306062 | Learning to Order Facts for Discourse Planning in Natural Language
Generation | cs.CL | This paper presents a machine learning approach to discourse planning in
natural language generation. More specifically, we address the problem of
learning the most natural ordering of facts in discourse plans for a specific
domain. We discuss our methodology and how it was instantiated using two
different machine le... |
cs/0306065 | POOL File Catalog, Collection and Metadata Components | cs.DB | The POOL project is the common persistency framework for the LHC experiments
to store petabytes of experiment data and metadata in a distributed and grid
enabled way. POOL is a hybrid event store consisting of a data streaming layer
and a relational layer. This paper describes the design of file catalog,
collection a... |
cs/0306066 | The COMPASS Event Store in 2002 | cs.DB | COMPASS, the fixed-target experiment at CERN studying the structure of the
nucleon and spectroscopy, collected over 260 TB during summer 2002 run. All
these data, together with reconstructed events information, were put from the
beginning in a database infrastructure based on Objectivity/DB and on the
hierarchical st... |
cs/0306077 | The TESLA Requirements Database | cs.DB | In preparation for the planned linear collider TESLA, DESY is designing the
required buildings and facilities. The accelerator and infrastructure
components have to be allocated to buildings, and their required areas for
installation, operation and maintenance have to be determined.
Interdisciplinary working groups s... |
cs/0306079 | Integrated Information Management for TESLA | cs.DB | Next-generation projects in High Energy Physics will reach again a new
dimension of complexity. Information management has to ensure an efficient and
economic information flow within the collaborations, offering world-wide
up-to-date information access to the collaborators as one condition for
successful projects. DE... |
cs/0306081 | An on-line Integrated Bookkeeping: electronic run log book and Meta-Data
Repository for ATLAS | cs.DB | In the context of the ATLAS experiment there is growing evidence of the
importance of different kinds of Meta-data including all the important details
of the detector and data acquisition that are vital for the analysis of the
acquired data. The Online BookKeeper (OBK) is a component of ATLAS online
software that sto... |
cs/0306086 | GMA Instrumentation of the Athena Framework using NetLogger | cs.DC cs.IR | Grid applications are, by their nature, wide-area distributed applications.
This WAN aspect of Grid applications makes the use of conventional monitoring
and instrumentation tools (such as top, gprof, LSF Monitor, etc) impractical
for verification that the application is running correctly and efficiently. To
be effec... |
cs/0306091 | Universal Sequential Decisions in Unknown Environments | cs.AI cs.CC cs.LG | We give a brief introduction to the AIXI model, which unifies and overcomes
the limitations of sequential decision theory and universal Solomonoff
induction. While the former theory is suited for active agents in known
environments, the latter is suited for passive prediction of unknown
environments.
|
cs/0306094 | BaBar - A Community Web Site in an Organizational Setting | cs.IR | The BABAR Web site was established in 1993 at the Stanford Linear Accelerator
Center (SLAC) to support the BABAR experiment, to report its results, and to
facilitate communication among its scientific and engineering collaborators,
currently numbering about 600 individuals from 75 collaborating institutions in
10 cou... |
cs/0306095 | The MammoGrid Project Grids Architecture | cs.DC cs.DB | The aim of the recently EU-funded MammoGrid project is, in the light of
emerging Grid technology, to develop a European-wide database of mammograms
that will be used to develop a set of important healthcare applications and
investigate the potential of this Grid to support effective co-working between
healthcare prof... |
cs/0306097 | A family of metrics on contact structures based on edge ideals | cs.DM cs.CE q-bio | The measurement of the similarity of RNA secondary structures, and in general
of contact structures, of a fixed length has several specific applications. For
instance, it is used in the analysis of the ensemble of suboptimal secondary
structures generated by a given algorithm on a given RNA sequence, and in the
compa... |
cs/0306099 | An Improved k-Nearest Neighbor Algorithm for Text Categorization | cs.CL | k is the most important parameter in a text categorization system based on
k-Nearest Neighbor algorithm (kNN).In the classification process, k nearest
documents to the test one in the training set are determined firstly. Then, the
predication can be made according to the category distribution among these k
nearest ne... |
cs/0306102 | Prototyping Virtual Data Technologies in ATLAS Data Challenge 1
Production | cs.DC cs.DB | For efficiency of the large production tasks distributed worldwide, it is
essential to provide shared production management tools comprised of
integratable and interoperable services. To enhance the ATLAS DC1 production
toolkit, we introduced and tested a Virtual Data services component. For each
major data transform... |
cs/0306103 | Primary Numbers Database for ATLAS Detector Description Parameters | cs.DB cs.HC | We present the design and the status of the database for detector description
parameters in ATLAS experiment. The ATLAS Primary Numbers are the parameters
defining the detector geometry and digitization in simulations, as well as
certain reconstruction parameters. Since the detailed ATLAS detector
description needs m... |
cs/0306105 | Design, implementation and deployment of the Saclay muon reconstruction
algorithms (Muonbox/y) in the Athena software framework of the ATLAS
experiment | cs.CE | This paper gives an overview of a reconstruction algorithm for muon events in
ATLAS experiment at CERN. After a short introduction on ATLAS Muon
Spectrometer, we will describe the procedure performed by the algorithms
Muonbox and Muonboy (last version) in order to achieve correctly the
reconstruction task. These algo... |
cs/0306106 | Lexicographic probability, conditional probability, and nonstandard
probability | cs.GT cs.AI | The relationship between Popper spaces (conditional probability spaces that
satisfy some regularity conditions), lexicographic probability systems (LPS's),
and nonstandard probability spaces (NPS's) is considered. If countable
additivity is assumed, Popper spaces and a subclass of LPS's are equivalent;
without the as... |
cs/0306109 | Distributed Heterogeneous Relational Data Warehouse In A Grid
Environment | cs.DC cs.DB | This paper examines how a "Distributed Heterogeneous Relational Data
Warehouse" can be integrated in a Grid environment that will provide physicists
with efficient access to large and small object collections drawn from
databases at multiple sites. This paper investigates the requirements of
Grid-enabling such a ware... |
cs/0306114 | D0 Data Handling Operational Experience | cs.DC cs.AI | We report on the production experience of the D0 experiment at the Fermilab
Tevatron, using the SAM data handling system with a variety of computing
hardware configurations, batch systems, and mass storage strategies. We have
stored more than 300 TB of data in the Fermilab Enstore mass storage system. We
deliver data... |
cs/0306119 | A Method for Solving Distributed Service Allocation Problems | cs.MA | We present a method for solving service allocation problems in which a set of
services must be allocated to a set of agents so as to maximize a global
utility. The method is completely distributed so it can scale to any number of
services without degradation. We first formalize the service allocation problem
and then... |
cs/0306120 | Reinforcement Learning with Linear Function Approximation and LQ control
Converges | cs.LG cs.AI | Reinforcement learning is commonly used with function approximation. However,
very few positive results are known about the convergence of function
approximation based RL control algorithms. In this paper we show that TD(0) and
Sarsa(0) with linear function approximation is convergent for a simple class of
problems, ... |
cs/0306122 | The Best Trail Algorithm for Assisted Navigation of Web Sites | cs.DS cs.IR | We present an algorithm called the Best Trail Algorithm, which helps solve
the hypertext navigation problem by automating the construction of memex-like
trails through the corpus. The algorithm performs a probabilistic best-first
expansion of a set of navigation trees to find relevant and compact trails. We
describe ... |
cs/0306124 | Updating Probabilities | cs.AI | As examples such as the Monty Hall puzzle show, applying conditioning to
update a probability distribution on a ``naive space'', which does not take
into account the protocol used, can often lead to counterintuitive results.
Here we examine why. A criterion known as CAR (``coarsening at random'') in the
statistical l... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.