id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0408031 | There Goes the Neighborhood: Relational Algebra for Spatial Data Search | cs.DB | We explored ways of doing spatial search within a relational database: (1)
hierarchical triangular mesh (a tessellation of the sphere), (2) a zoned
bucketing system, and (3) representing areas as disjunctive-normal form
constraints. Each of these approaches has merits. They all allow efficient
point-in-region queries... |
cs/0408036 | Consensus on Transaction Commit | cs.DC cs.DB | The distributed transaction commit problem requires reaching agreement on
whether a transaction is committed or aborted. The classic Two-Phase Commit
protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms
also reach agreement, but do not block whenever any majority of the processes
are working.... |
cs/0408037 | Multi-dimensional Type Theory: Rules, Categories, and Combinators for
Syntax and Semantics | cs.CL cs.AI cs.LO | We investigate the possibility of modelling the syntax and semantics of
natural language by constraints, or rules, imposed by the multi-dimensional
type theory Nabla. The only multiplicity we explicitly consider is two, namely
one dimension for the syntax and one dimension for the semantics, but the
general perspecti... |
cs/0408038 | The Dynamics of Group Codes: Dual Abelian Group Codes and Systems | cs.IT math.IT | Fundamental results concerning the dynamics of abelian group codes
(behaviors) and their duals are developed. Duals of sequence spaces over
locally compact abelian groups may be defined via Pontryagin duality; dual
group codes are orthogonal subgroups of dual sequence spaces. The dual of a
complete code or system is ... |
cs/0408039 | Medians and Beyond: New Aggregation Techniques for Sensor Networks | cs.DC cs.DB cs.DS | Wireless sensor networks offer the potential to span and monitor large
geographical areas inexpensively. Sensors, however, have significant power
constraint (battery life), making communication very expensive. Another
important issue in the context of sensor-based information systems is that
individual sensor reading... |
cs/0408041 | Fractal geometry of literature: first attempt to Shakespeare's works | cs.CL cs.CC | It was demonstrated that there is a geometrical order in the structure of
literature. Fractal geometry as a modern mathematical approach and a new
geometrical viewpoint on natural objects including both processes and
structures was employed for analysis of literature. As the first study, the
works of William Shakespe... |
cs/0408044 | FLUX: A Logic Programming Method for Reasoning Agents | cs.AI | FLUX is a programming method for the design of agents that reason logically
about their actions and sensor information in the presence of incomplete
knowledge. The core of FLUX is a system of Constraint Handling Rules, which
enables agents to maintain an internal model of their environment by which they
control their... |
cs/0408047 | Pervasive Service Architecture for a Digital Business Ecosystem | cs.CE cs.NI | In this paper we present ideas and architectural principles upon which we are
basing the development of a distributed, open-source infrastructure that, in
turn, will support the expression of business models, the dynamic composition
of software services, and the optimisation of service chains through automatic
self-o... |
cs/0408048 | Journal of New Democratic Methods: An Introduction | cs.CY cs.LG | This paper describes a new breed of academic journals that use statistical
machine learning techniques to make them more democratic. In particular, not
only can anyone submit an article, but anyone can also become a reviewer.
Machine learning is used to decide which reviewers accurately represent the
views of the jou... |
cs/0408049 | Using Stochastic Encoders to Discover Structure in Data | cs.NE cs.CV | In this paper a stochastic generalisation of the standard Linde-Buzo-Gray
(LBG) approach to vector quantiser (VQ) design is presented, in which the
encoder is implemented as the sampling of a vector of code indices from a
probability distribution derived from the input vector, and the decoder is
implemented as a supe... |
cs/0408050 | Invariant Stochastic Encoders | cs.NE cs.CV | The theory of stochastic vector quantisers (SVQ) has been extended to allow
the quantiser to develop invariances, so that only "large" degrees of freedom
in the input vector are represented in the code. This has been applied to the
problem of encoding data vectors which are a superposition of a "large" jammer
and a "... |
cs/0408051 | Scalable XSLT Evaluation | cs.DB | XSLT is an increasingly popular language for processing XML data. It is
widely supported by application platform software. However, little optimization
effort has been made inside the current XSLT processing engines. Evaluating a
very simple XSLT program on a large XML document with a simple schema may
result in exte... |
cs/0408052 | Application of the Double Metaphone Algorithm to Amharic Orthography | cs.CL | The Metaphone algorithm applies the phonetic encoding of orthographic
sequences to simplify words prior to comparison. While Metaphone has been
highly successful for the English language, for which it was designed, it may
not be applied directly to Ethiopian languages. The paper details how the
principles of Metaphon... |
cs/0408054 | Providing Authentic Long-term Archival Access to Complex Relational Data | cs.DL cs.DB | We discuss long-term preservation of and access to relational databases. The
focus is on national archives and science data archives which have to ingest
and integrate data from a broad spectrum of vendor-specific relational database
management systems (RDBMS). Furthermore, we present our solution SIARD which
analyze... |
cs/0408055 | Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection
Scheme in Evolutionary Algorithms | cs.AI | Boltzmann selection is an important selection mechanism in evolutionary
algorithms as it has theoretical properties which help in theoretical analysis.
However, Boltzmann selection is not used in practice because a good annealing
schedule for the `inverse temperature' parameter is lacking. In this paper we
propose a ... |
cs/0408056 | A CHR-based Implementation of Known Arc-Consistency | cs.LO cs.AI | In classical CLP(FD) systems, domains of variables are completely known at
the beginning of the constraint propagation process. However, in systems
interacting with an external environment, acquiring the whole domains of
variables before the beginning of constraint propagation may cause waste of
computation time, or ... |
cs/0408057 | The role of robust semantic analysis in spoken language dialogue systems | cs.CL cs.AI cs.HC | In this paper we summarized a framework for designing grammar-based procedure
for the automatic extraction of the semantic content from spoken queries.
Starting with a case study and following an approach which combines the notions
of fuzziness and robustness in sentence parsing, we showed we built practical
domain-d... |
cs/0408058 | Non-negative matrix factorization with sparseness constraints | cs.LG cs.NE | Non-negative matrix factorization (NMF) is a recently developed technique for
finding parts-based, linear representations of non-negative data. Although it
has successfully been applied in several applications, it does not always
result in parts-based representations. In this paper, we show how explicitly
incorporati... |
cs/0408059 | Proofing Tools Technology at Neurosoft S.A. | cs.CL | The aim of this paper is to present the R&D activities carried out at
Neurosoft S.A. regarding the development of proofing tools for Modern Greek.
Firstly, we focus on infrastructure issues that we faced during our initial
steps. Subsequently, we describe the most important insights of three proofing
tools developed ... |
cs/0408060 | Verbal chunk extraction in French using limited resources | cs.CL | A way of extracting French verbal chunks, inflected and infinitive, is
explored and tested on effective corpus. Declarative morphological and local
grammar rules specifying chunks and some simple contextual structures are used,
relying on limited lexical information and some simple heuristic/statistic
properties obta... |
cs/0408061 | An electronic dictionary as a basis for NLP tools: The Greek case | cs.CL | The existence of a Dictionary in electronic form for Modern Greek (MG) is
mandatory if one is to process MG at the morphological and syntactic levels
since MG is a highly inflectional language with marked stress and a spelling
system with many characteristics carried over from Ancient Greek. Moreover,
such a tool bec... |
cs/0408062 | Source Coding With Distortion Side Information At The Encoder | cs.IT math.IT | We consider lossy source coding when side information affecting the
distortion measure may be available at the encoder, decoder, both, or neither.
For example, such distortion side information can model reliabilities for noisy
measurements, sensor calibration information, or perceptual effects like
masking and sensit... |
cs/0408063 | Analysis and Visualization of Index Words from Audio Transcripts of
Instructional Videos | cs.IR cs.MM | We introduce new techniques for extracting, analyzing, and visualizing
textual contents from instructional videos of low production quality. Using
Automatic Speech Recognition, approximate transcripts (H75% Word Error Rate)
are obtained from the originally highly compressed videos of university
courses, each comprisi... |
cs/0408064 | Proportional Conflict Redistribution Rules for Information Fusion | cs.AI | In this paper we propose five versions of a Proportional Conflict
Redistribution rule (PCR) for information fusion together with several
examples. From PCR1 to PCR2, PCR3, PCR4, PCR5 one increases the complexity of
the rules and also the exactitude of the redistribution of conflicting masses.
PCR1 restricted from the... |
cs/0408066 | Robust Locally Testable Codes and Products of Codes | cs.IT cs.CC math.IT | We continue the investigation of locally testable codes, i.e.,
error-correcting codes for whom membership of a given word in the code can be
tested probabilistically by examining it in very few locations. We give two
general results on local testability: First, motivated by the recently proposed
notion of {\em robust... |
cs/0408069 | The Integration of Connectionism and First-Order Knowledge
Representation and Reasoning as a Challenge for Artificial Intelligence | cs.AI cs.LO cs.NE | Intelligent systems based on first-order logic on the one hand, and on
artificial neural networks (also called connectionist systems) on the other,
differ substantially. It would be very desirable to combine the robust neural
networking machinery with symbolic knowledge representation and reasoning
paradigms like log... |
cs/0409002 | Default reasoning over domains and concept hierarchies | cs.AI cs.LO | W.C. Rounds and G.-Q. Zhang (2001) have proposed to study a form of
disjunctive logic programming generalized to algebraic domains. This system
allows reasoning with information which is hierarchically structured and forms
a (suitable) domain. We extend this framework to include reasoning with default
negation, givin... |
cs/0409003 | ScheduleNanny: Using GPS to Learn the User's Significant Locations,
Travel Times and Schedule | cs.AI cs.CV cs.HC | As computing technology becomes more pervasive, personal devices such as the
PDA, cell-phone, and notebook should use context to determine how to act.
Location is one form of context that can be used in many ways. We present a
multiple-device system that collects and clusters GPS data into significant
locations. Thes... |
cs/0409007 | The Generalized Pignistic Transformation | cs.AI | This paper presents in detail the generalized pignistic transformation (GPT)
succinctly developed in the Dezert-Smarandache Theory (DSmT) framework as a
tool for decision process. The GPT allows to provide a subjective probability
measure from any generalized basic belief assignment given by any corpus of
evidence. W... |
cs/0409008 | A Model for Fine-Grained Alignment of Multilingual Texts | cs.CL | While alignment of texts on the sentential level is often seen as being too
coarse, and word alignment as being too fine-grained, bi- or multilingual texts
which are aligned on a level in-between are a useful resource for many
purposes. Starting from a number of examples of non-literal translations, which
tend to mak... |
cs/0409010 | Distance properties of expander codes | cs.IT cs.DM math.IT | We study the minimum distance of codes defined on bipartite graphs. Weight
spectrum and the minimum distance of a random ensemble of such codes are
computed. It is shown that if the vertex codes have minimum distance $\ge 3$,
the overall code is asymptotically good, and sometimes meets the
Gilbert-Varshamov bound.
... |
cs/0409011 | Shannon meets Wiener II: On MMSE estimation in successive decoding
schemes | cs.IT math.IT | We continue to discuss why MMSE estimation arises in coding schemes that
approach the capacity of linear Gaussian channels. Here we consider schemes
that involve successive decoding, such as decision-feedback equalization or
successive cancellation.
|
cs/0409019 | Outlier Detection by Logic Programming | cs.AI cs.LO | The development of effective knowledge discovery techniques has become in the
recent few years a very active research area due to the important impact it has
in several relevant application areas. One interesting task thereof is that of
singling out anomalous individuals from a given population, e.g., to detect
rare ... |
cs/0409020 | A Generalized Disjunctive Paraconsistent Data Model for Negative and
Disjunctive Information | cs.DB | This paper presents a generalization of the disjunctive paraconsistent
relational data model in which disjunctive positive and negative information
can be represented explicitly and manipulated. There are situations where the
closed world assumption to infer negative facts is not valid or undesirable and
there is a n... |
cs/0409026 | Capacity-achieving ensembles for the binary erasure channel with bounded
complexity | cs.IT math.IT | We present two sequences of ensembles of non-systematic irregular
repeat-accumulate codes which asymptotically (as their block length tends to
infinity) achieve capacity on the binary erasure channel (BEC) with bounded
complexity per information bit. This is in contrast to all previous
constructions of capacity-achie... |
cs/0409027 | Bounds on the decoding complexity of punctured codes on graphs | cs.IT math.IT | We present two sequences of ensembles of non-systematic irregular
repeat-accumulate codes which asymptotically (as their block length tends to
infinity) achieve capacity on the binary erasure channel (BEC) with bounded
complexity per information bit. This is in contrast to all previous
constructions of capacity-achie... |
cs/0409031 | Field Geology with a Wearable Computer: First Results of the Cyborg
Astrobiologist System | cs.CV astro-ph cs.RO | We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist. The Cyborg
Astrobiologi... |
cs/0409035 | Parallel Computing Environments and Methods for Power Distribution
System Simulation | cs.DC cs.CE cs.MA cs.PF | The development of cost-effective highperformance parallel computing on
multi-processor supercomputers makes it attractive to port excessively time
consuming simulation software from personal computers (PC) to super computes.
The power distribution system simulator (PDSS) takes a bottom-up approach and
simulates load... |
cs/0409040 | Unification of Fusion Theories | cs.AI | Since no fusion theory neither rule fully satisfy all needed applications,
the author proposes a Unification of Fusion Theories and a combination of
fusion rules in solving problems/applications. For each particular application,
one selects the most appropriate model, rule(s), and algorithm of
implementation. We are ... |
cs/0409042 | A new architecture for making highly scalable applications | cs.HC cs.CL | An application is a logical image of the world on a computer. A scalable
application is an application that allows one to update that logical image at
run time. To put it in operational terms: an application is scalable if a
client can change between time T1 and time T2 - the logic of the application as
expressed by ... |
cs/0409044 | Some Applications of Coding Theory in Computational Complexity | cs.CC cs.IT math.IT | Error-correcting codes and related combinatorial constructs play an important
role in several recent (and old) results in computational complexity theory. In
this paper we survey results on locally-testable and locally-decodable
error-correcting codes, and their applications to complexity theory and to
cryptography.
... |
cs/0409045 | Augmenting ALC(D) (atemporal) roles and (aspatial) concrete domain with
temporal roles and a spatial concrete domain -first results | cs.AI cs.LO | We consider the well-known family ALC(D) of description logics with a
concrete domain, and provide first results on a framework obtained by
augmenting ALC(D) atemporal roles and aspatial concrete domain with temporal
roles and a spatial concrete domain.
|
cs/0409046 | A TCSP-like decidable constraint language generalising existing cardinal
direction relations | cs.AI cs.LO | We define a quantitative constraint language subsuming two calculi well-known
in QSR (Qualitative Spatial Reasoning): Frank's cone-shaped and
projection-based calculi of cardinal direction relations. We show how to solve
a CSP (Constraint Satisfaction Problem) expressed in the language.
|
cs/0409047 | An ALC(D)-based combination of temporal constraints and spatial
constraints suitable for continuous (spatial) change | cs.AI cs.LO | We present a family of spatio-temporal theories suitable for continuous
spatial change in general, and for continuous motion of spatial scenes in
particular. The family is obtained by spatio-temporalising the well-known
ALC(D) family of Description Logics (DLs) with a concrete domain D, as follows,
where TCSPs denote... |
cs/0409053 | On the role of MMSE estimation in approaching the information-theoretic
limits of linear Gaussian channels: Shannon meets Wiener | cs.IT math.IT | We discuss why MMSE estimation arises in lattice-based schemes for
approaching the capacity of linear Gaussian channels, and comment on its
properties.
|
cs/0409056 | Using sparse matrices and splines-based interpolation in computational
fluid dynamics simulations | cs.NA cs.CE physics.comp-ph | In this relation I present a technique of construction and fast evaluation of
a family of cubic polynomials for analytic smoothing and graphical rendering of
particles trajectories for flows in a generic geometry. The principal result of
the work was implementation and test of a method for interpolating 3D points by
... |
cs/0409058 | A Sentimental Education: Sentiment Analysis Using Subjectivity
Summarization Based on Minimum Cuts | cs.CL | Sentiment analysis seeks to identify the viewpoint(s) underlying a text span;
an example application is classifying a movie review as "thumbs up" or "thumbs
down". To determine this sentiment polarity, we propose a novel
machine-learning method that applies text-categorization techniques to just the
subjective portio... |
cs/0410001 | The Infati Data | cs.DB | The ability to perform meaningful empirical studies is of essence in research
in spatio-temporal query processing. Such studies are often necessary to gain
detailed insight into the functional and performance characteristics of
proposals for new query processing techniques.
We present a collection of spatio-tempora... |
cs/0410002 | Shannon Information and Kolmogorov Complexity | cs.IT math.IT | We compare the elementary theories of Shannon information and Kolmogorov
complexity, the extent to which they have a common purpose, and where they are
fundamentally different. We discuss and relate the basic notions of both
theories: Shannon entropy versus Kolmogorov complexity, the relation of both to
universal cod... |
cs/0410003 | Capacity and Random-Coding Exponents for Channel Coding with Side
Information | cs.IT math.IT | Capacity formulas and random-coding exponents are derived for a generalized
family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic
upper bounds on the achievable log probability of error. In our model,
information is to be reliably transmitted through a noisy channel with finite
input and output... |
cs/0410004 | Applying Policy Iteration for Training Recurrent Neural Networks | cs.AI cs.LG cs.NE | Recurrent neural networks are often used for learning time-series data. Based
on a few assumptions we model this learning task as a minimization problem of a
nonlinear least-squares cost function. The special structure of the cost
function allows us to build a connection to reinforcement learning. We exploit
this con... |
cs/0410005 | A dynamical model of a GRID market | cs.MA cond-mat.other cs.CE | We discuss potential market mechanisms for the GRID. A complete dynamical
model of a GRID market is defined with three types of agents. Providers,
middlemen and users exchange universal GRID computing units (GCUs) at varying
prices. Providers and middlemen have strategies aimed at maximizing profit
while users are 's... |
cs/0410008 | Source Coding with Fixed Lag Side Information | cs.IT math.IT | We consider source coding with fixed lag side information at the decoder. We
focus on the special case of perfect side information with unit lag
corresponding to source coding with feedforward (the dual of channel coding
with feedback) introduced by Pradhan. We use this duality to develop a linear
complexity algorith... |
cs/0410014 | Normal forms for Answer Sets Programming | cs.AI | Normal forms for logic programs under stable/answer set semantics are
introduced. We argue that these forms can simplify the study of program
properties, mainly consistency. The first normal form, called the {\em kernel}
of the program, is useful for studying existence and number of answer sets. A
kernel program is c... |
cs/0410015 | L1 regularization is better than L2 for learning and predicting chaotic
systems | cs.LG cs.AI | Emergent behaviors are in the focus of recent research interest. It is then
of considerable importance to investigate what optimizations suit the learning
and prediction of chaotic systems, the putative candidates for emergence. We
have compared L1 and L2 regularizations on predicting chaotic time series using
linear... |
cs/0410017 | Automated Pattern Detection--An Algorithm for Constructing Optimally
Synchronizing Multi-Regular Language Filters | cs.CV cond-mat.stat-mech cs.CL cs.DS cs.IR cs.LG nlin.AO nlin.CG nlin.PS physics.comp-ph q-bio.GN | In the computational-mechanics structural analysis of one-dimensional
cellular automata the following automata-theoretic analogue of the
\emph{change-point problem} from time series analysis arises: \emph{Given a
string $\sigma$ and a collection $\{\mc{D}_i\}$ of finite automata, identify
the regions of $\sigma$ that... |
cs/0410019 | Finite-Length Scaling and Finite-Length Shift for Low-Density
Parity-Check Codes | cs.IT cond-mat.dis-nn math.IT | Consider communication over the binary erasure channel BEC using random
low-density parity-check codes with finite-blocklength n from `standard'
ensembles. We show that large error events is conveniently described within a
scaling theory, and explain how to estimate heuristically their effect. Among
other quantities,... |
cs/0410020 | Adaptive Cluster Expansion (ACE): A Hierarchical Bayesian Network | cs.NE cs.CV | Using the maximum entropy method, we derive the "adaptive cluster expansion"
(ACE), which can be trained to estimate probability density functions in high
dimensional spaces. The main advantage of ACE over other Bayesian networks is
its ability to capture high order statistics after short training times, which
it ach... |
cs/0410022 | RRL: A Rich Representation Language for the Description of Agent
Behaviour in NECA | cs.MM cs.MA | In this paper, we describe the Rich Representation Language (RRL) which is
used in the NECA system. The NECA system generates interactions between two or
more animated characters. The RRL is an XML compliant framework for
representing the information that is exchanged at the interfaces between the
various NECA system... |
cs/0410027 | Detecting User Engagement in Everyday Conversations | cs.SD cs.CL cs.HC | This paper presents a novel application of speech emotion recognition:
estimation of the level of conversational engagement between users of a voice
communication system. We begin by using machine learning techniques, such as
the support vector machine (SVM), to classify users' emotions as expressed in
individual utt... |
cs/0410028 | Life Above Threshold: From List Decoding to Area Theorem and MSE | cs.IT cond-mat.dis-nn math.IT | We consider communication over memoryless channels using low-density
parity-check code ensembles above the iterative (belief propagation) threshold.
What is the computational complexity of decoding (i.e., of reconstructing all
the typical input codewords for a given channel output) in this regime? We
define an algori... |
cs/0410033 | An In-Depth Look at Information Fusion Rules & the Unification of Fusion
Theories | cs.AI | This paper may look like a glossary of the fusion rules and we also introduce
new ones presenting their formulas and examples: Conjunctive, Disjunctive,
Exclusive Disjunctive, Mixed Conjunctive-Disjunctive rules, Conditional rule,
Dempster's, Yager's, Smets' TBM rule, Dubois-Prade's, Dezert-Smarandache
classical and ... |
cs/0410036 | Self-Organised Factorial Encoding of a Toroidal Manifold | cs.LG cs.CV | It is shown analytically how a neural network can be used optimally to encode
input data that is derived from a toroidal manifold. The case of a 2-layer
network is considered, where the output is assumed to be a set of discrete
neural firing events. The network objective function measures the average
Euclidean error ... |
cs/0410038 | Frequent Knot Discovery | cs.DB | We explore the possibility of applying the framework of frequent pattern
mining to a class of continuous objects appearing in nature, namely knots. We
introduce the frequent knot mining problem and present a solution. The key
observation is that a database consisting of knots can be transformed into a
transactional d... |
cs/0410040 | Two Methods for Decreasing the Computational Complexity of the MIMO ML
Decoder | cs.IT math.IT | We propose use of QR factorization with sort and Dijkstra's algorithm for
decreasing the computational complexity of the sphere decoder that is used for
ML detection of signals on the multi-antenna fading channel. QR factorization
with sort decreases the complexity of searching part of the decoder with small
increase... |
cs/0410041 | Maximum Mutual Information of Space-Time Block Codes with Symbolwise
Decodability | cs.IT math.IT | In this paper, we analyze the performance of space-time block codes which
enable symbolwise maximum likelihood decoding. We derive an upper bound of
maximum mutual information (MMI) on space-time block codes that enable
symbolwise maximum likelihood decoding for a frequency non-selective
quasi-static fading channel. ... |
cs/0410042 | Neural Architectures for Robot Intelligence | cs.RO cs.CV cs.HC cs.LG cs.NE q-bio.NC | We argue that the direct experimental approaches to elucidate the
architecture of higher brains may benefit from insights gained from exploring
the possibilities and limits of artificial control architectures for robot
systems. We present some of our recent work that has been motivated by that
view and that is center... |
cs/0410043 | Strategy in Ulam's Game and Tree Code Give Error-Resistant Protocols | cs.DC cs.IT math.IT | We present a new approach to construction of protocols which are proof
against communication errors. The construction is based on a generalization of
the well known Ulam's game. We show equivalence between winning strategies in
this game and robust protocols for multi-party computation. We do not give any
complete th... |
cs/0410049 | Intransitivity and Vagueness | cs.AI | There are many examples in the literature that suggest that
indistinguishability is intransitive, despite the fact that the
indistinguishability relation is typically taken to be an equivalence relation
(and thus transitive). It is shown that if the uncertainty perception and the
question of when an agent reports tha... |
cs/0410050 | Sleeping Beauty Reconsidered: Conditioning and Reflection in
Asynchronous Systems | cs.AI | A careful analysis of conditioning in the Sleeping Beauty problem is done,
using the formal model for reasoning about knowledge and probability developed
by Halpern and Tuttle. While the Sleeping Beauty problem has been viewed as
revealing problems with conditioning in the presence of imperfect recall, the
analysis d... |
cs/0410053 | An Extended Generalized Disjunctive Paraconsistent Data Model for
Disjunctive Information | cs.DB | This paper presents an extension of generalized disjunctive paraconsistent
relational data model in which pure disjunctive positive and negative
information as well as mixed disjunctive positive and negative information can
be represented explicitly and manipulated. We consider explicit mixed
disjunctive information ... |
cs/0410054 | Paraconsistent Intuitionistic Fuzzy Relational Data Model | cs.DB | In this paper, we present a generalization of the relational data model based
on paraconsistent intuitionistic fuzzy sets. Our data model is capable of
manipulating incomplete as well as inconsistent information. Fuzzy relation or
intuitionistic fuzzy relation can only handle incomplete information.
Associated with e... |
cs/0410055 | Mathematical knowledge management is needed | cs.IR | In this lecture I discuss some aspects of MKM, Mathematical Knowledge
Management, with particuar emphasis on information storage and information
retrieval.
|
cs/0410058 | Robust Dialogue Understanding in HERALD | cs.CL cs.AI cs.HC cs.MA cs.SE | We tackle the problem of robust dialogue processing from the perspective of
language engineering. We propose an agent-oriented architecture that allows us
a flexible way of composing robust processors. Our approach is based on
Shoham's Agent Oriented Programming (AOP) paradigm. We will show how the AOP
agent model ca... |
cs/0410059 | A knowledge-based approach to semi-automatic annotation of multimedia
documents via user adaptation | cs.DL cs.CL cs.IR | Current approaches to the annotation process focus on annotation schemas,
languages for annotation, or are very application driven. In this paper it is
proposed that a more flexible architecture for annotation requires a knowledge
component to allow for flexible search and navigation of the annotated
material. In par... |
cs/0410060 | Semantic filtering by inference on domain knowledge in spoken dialogue
systems | cs.CL cs.AI cs.HC cs.IR | General natural dialogue processing requires large amounts of domain
knowledge as well as linguistic knowledge in order to ensure acceptable
coverage and understanding. There are several ways of integrating lexical
resources (e.g. dictionaries, thesauri) and knowledge bases or ontologies at
different levels of dialog... |
cs/0410061 | An argumentative annotation schema for meeting discussions | cs.CL cs.DL cs.IR | In this article, we are interested in the annotation of transcriptions of
human-human dialogue taken from meeting records. We first propose a meeting
content model where conversational acts are interpreted with respect to their
argumentative force and their role in building the argumentative structure of
the meeting ... |
cs/0410062 | Automatic Keyword Extraction from Spoken Text. A Comparison of two
Lexical Resources: the EDR and WordNet | cs.CL cs.DL cs.IR | Lexical resources such as WordNet and the EDR electronic dictionary have been
used in several NLP tasks. Probably, partly due to the fact that the EDR is not
freely available, WordNet has been used far more often than the EDR. We have
used both resources on the same task in order to make a comparison possible.
The ta... |
cs/0410063 | INSPIRE: Evaluation of a Smart-Home System for Infotainment Management
and Device Control | cs.HC cs.CL | This paper gives an overview of the assessment and evaluation methods which
have been used to determine the quality of the INSPIRE smart home system. The
system allows different home appliances to be controlled via speech, and
consists of speech and speaker recognition, speech understanding, dialogue
management, and ... |
cs/0410064 | Intelligent Computer Numerical Control unit for machine tools | cs.CE | The paper describes a new CNC control unit for machining centres with
learning ability and automatic intelligent generating of NC programs on the
bases of a neural network, which is built-in into a CNC unit as special device.
The device performs intelligent and completely automatically the NC part
programs only on th... |
cs/0410068 | Analyzing and Improving Performance of a Class of Anomaly-based
Intrusion Detectors | cs.CR cs.AI | Anomaly-based intrusion detection (AID) techniques are useful for detecting
novel intrusions into computing resources. One of the most successful AID
detectors proposed to date is stide, which is based on analysis of system call
sequences. In this paper, we present a detailed formal framework to analyze,
understand a... |
cs/0410070 | Using image partitions in 4th Dimension | cs.DB | I have plotted an image by using mathematical functions in the Database "4th
Dimension". I'm going to show an alternative method to: detect which sector has
been clicked; highlight it and combine it with other sectors already
highlighted; store the graph information in an efficient way; load and splat
image layers to... |
cs/0410071 | The Cyborg Astrobiologist: First Field Experience | cs.CV astro-ph cs.AI cs.CE cs.HC cs.RO cs.SE q-bio.NC | We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist and
field-astrobiologist... |
cs/0410072 | Temporal logic with predicate abstraction | cs.LO cs.CL | A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but
with predicate abstraction mechanism and equality is considered. The models of
LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible
constants) moving over the elements of some (possibly infinite) domain. This
allows to use ... |
cs/0411003 | Applications of LDPC Codes to the Wiretap Channel | cs.IT cs.CR math.IT | With the advent of quantum key distribution (QKD) systems, perfect (i.e.
information-theoretic) security can now be achieved for distribution of a
cryptographic key. QKD systems and similar protocols use classical
error-correcting codes for both error correction (for the honest parties to
correct errors) and privacy ... |
cs/0411006 | Capacity Achieving Code Constructions for Two Classes of (d,k)
Constraints | cs.IT math.IT | In this paper, we present two low complexity algorithms that achieve capacity
for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not
prime. The first algorithm, called symbol sliding, is a generalized version of
the bit flipping algorithm introduced by Aviran et al. [1]. In addition to
achievin... |
cs/0411008 | Intuitionistic computability logic | cs.LO cs.AI math.LO | Computability logic (CL) is a systematic formal theory of computational tasks
and resources, which, in a sense, can be seen as a semantics-based alternative
to (the syntactically introduced) linear logic. With its expressive and
flexible language, where formulas represent computational problems and "truth"
is underst... |
cs/0411011 | Capacity Analysis for Continuous Alphabet Channels with Side
Information, Part I: A General Framework | cs.IT math.IT | Capacity analysis for channels with side information at the receiver has been
an active area of interest. This problem is well investigated for the case of
finite alphabet channels. However, the results are not easily generalizable to
the case of continuous alphabet channels due to analytic difficulties inherent
with... |
cs/0411012 | Capacity Analysis for Continuous Alphabet Channels with Side
Information, Part II: MIMO Channels | cs.IT math.IT | In this part, we consider the capacity analysis for wireless mobile systems
with multiple antenna architectures. We apply the results of the first part to
a commonly known baseband, discrete-time multiple antenna system where both the
transmitter and receiver know the channel's statistical law. We analyze the
capacit... |
cs/0411014 | Rate Distortion and Denoising of Individual Data Using Kolmogorov
complexity | cs.IT math.IT | We examine the structure of families of distortion balls from the perspective
of Kolmogorov complexity. Special attention is paid to the canonical
rate-distortion function of a source word which returns the minimal Kolmogorov
complexity of all distortion balls containing that word subject to a bound on
their cardinal... |
cs/0411015 | Bounded Input Bounded Predefined Control Bounded Output | cs.AI | The paper is an attempt to generalize a methodology, which is similar to the
bounded-input bounded-output method currently widely used for the system
stability studies. The presented earlier methodology allows decomposition of
input space into bounded subspaces and defining for each subspace its bounding
surface. It ... |
cs/0411016 | Intelligent search strategies based on adaptive Constraint Handling
Rules | cs.AI cs.PL | The most advanced implementation of adaptive constraint processing with
Constraint Handling Rules (CHR) allows the application of intelligent search
strategies to solve Constraint Satisfaction Problems (CSP). This presentation
compares an improved version of conflict-directed backjumping and two variants
of dynamic b... |
cs/0411018 | Artificial Intelligence and Systems Theory: Applied to Cooperative
Robots | cs.RO cs.AI | This paper describes an approach to the design of a population of cooperative
robots based on concepts borrowed from Systems Theory and Artificial
Intelligence. The research has been developed under the SocRob project, carried
out by the Intelligent Systems Laboratory at the Institute for Systems and
Robotics - Insti... |
cs/0411020 | Dynamic Modelling and Adaptive Traction Control for Mobile Robots | cs.RO | Mobile robots have received a great deal of research in recent years. A
significant amount of research has been published in many aspects related to
mobile robots. Most of the research is devoted to design and develop some
control techniques for robot motion and path planning. A large number of
researchers have used ... |
cs/0411021 | Coevolution Based Adaptive Monte Carlo Localization (CEAMCL) | cs.RO | An adaptive Monte Carlo localization algorithm based on coevolution mechanism
of ecological species is proposed. Samples are clustered into species, each of
which represents a hypothesis of the robots pose. Since the coevolution between
the species ensures that the multiple distinct hypotheses can be tracked
stably, ... |
cs/0411022 | Topological Navigation of Simulated Robots using Occupancy Grid | cs.RO cs.AI | Formerly I presented a metric navigation method in the Webots mobile robot
simulator. The navigating Khepera-like robot builds an occupancy grid of the
environment and explores the square-shaped room around with a value iteration
algorithm. Now I created a topological navigation procedure based on the
occupancy grid ... |
cs/0411023 | Design and Implementation of a General Decision-making Model in RoboCup
Simulation | cs.RO | The study of the collaboration, coordination and negotiation among different
agents in a multi-agent system (MAS) has always been the most challenging yet
popular in the research of distributed artificial intelligence. In this paper,
we will suggest for RoboCup simulation, a typical MAS, a general
decision-making mod... |
cs/0411024 | Space Robotics Part 2: Space-based Manipulators | cs.RO | In this second of three short papers, I introduce some of the basic concepts
of space robotics with an emphasis on some specific challenging areas of
research that are peculiar to the application of robotics to space
infrastructure development. The style of these short papers is pedagogical and
the concepts in this p... |
cs/0411025 | Bionic Humans Using EAP as Artificial Muscles Reality and Challenges | cs.RO cs.AI | For many years, the idea of a human with bionic muscles immediately conjures
up science fiction images of a TV series superhuman character that was
implanted with bionic muscles and portrayed with strength and speed far
superior to any normal human. As fantastic as this idea may seem, recent
developments in electroac... |
cs/0411026 | A Search Relevancy Tuning Method Using Expert Results Content Evaluation | cs.IR | The article presents an online relevancy tuning method using explicit user
feedback. The author developed and tested a method of words' weights
modification based on search result evaluation by user. User decides whether
the result is useful or not after inspecting the full result content. The
experiment proved that ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.