id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0411034 | Generating Conditional Probabilities for Bayesian Networks: Easing the
Knowledge Acquisition Problem | cs.AI | The number of probability distributions required to populate a conditional
probability table (CPT) in a Bayesian network, grows exponentially with the
number of parent-nodes associated with that table. If the table is to be
populated through knowledge elicited from a domain expert then the sheer
magnitude of the task... |
cs/0411035 | A FP-Tree Based Approach for Mining All Strongly Correlated Pairs
without Candidate Generation | cs.DB cs.AI | Given a user-specified minimum correlation threshold and a transaction
database, the problem of mining all-strong correlated pairs is to find all item
pairs with Pearson's correlation coefficients above the threshold . Despite the
use of upper bound based pruning technique in the Taper algorithm [1], when the
number ... |
cs/0411036 | Feedback Capacity of the First-Order Moving Average Gaussian Channel | cs.IT math.IT | The feedback capacity of the stationary Gaussian additive noise channel has
been open, except for the case where the noise is white. Here we find the
feedback capacity of the stationary first-order moving average additive
Gaussian noise channel in closed form. Specifically, the channel is given by
$Y_i = X_i + Z_i,$ ... |
cs/0411052 | Spontaneous Dynamics of Asymmetric Random Recurrent Spiking Neural
Networks | cs.NE math.PR | We study in this paper the effect of an unique initial stimulation on random
recurrent networks of leaky integrate and fire neurons. Indeed given a
stochastic connectivity this so-called spontaneous mode exhibits various non
trivial dynamics. This study brings forward a mathematical formalism that
allows us to examin... |
cs/0411069 | CDN: Content Distribution Network | cs.NI cs.IR | Internet evolves and operates largely without a central coordination, the
lack of which was and is critically important to the rapid growth and evolution
of Internet. However, the lack of management in turn makes it very difficult to
guarantee proper performance and to deal systematically with performance
problems. M... |
cs/0411071 | Comparing Multi-Target Trackers on Different Force Unit Levels | cs.AI | Consider the problem of tracking a set of moving targets. Apart from the
tracking result, it is often important to know where the tracking fails, either
to steer sensors to that part of the state-space, or to inform a human operator
about the status and quality of the obtained information. An intuitive quality
measur... |
cs/0411072 | Extremal optimization for sensor report pre-processing | cs.AI | We describe the recently introduced extremal optimization algorithm and apply
it to target detection and association problems arising in pre-processing for
multi-target tracking.
Here we consider the problem of pre-processing for multiple target tracking
when the number of sensor reports received is very large and ... |
cs/0411073 | Geographic Routing with Limited Information in Sensor Networks | cs.IT math.IT | Geographic routing with greedy relaying strategies have been widely studied
as a routing scheme in sensor networks. These schemes assume that the nodes
have perfect information about the location of the destination. When the
distance between the source and destination is normalized to unity, the
asymptotic routing de... |
cs/0411074 | Building Chinese Lexicons from Scratch by Unsupervised Short Document
Self-Segmentation | cs.CL cs.IR | Chinese text segmentation is a well-known and difficult problem. On one side,
there is not a simple notion of "word" in Chinese language making really hard
to implement rule-based systems to segment written texts, thus lexicons and
statistical information are usually employed to achieve such a task. On the
other side... |
cs/0411098 | On the High-SNR Capacity of Non-Coherent Networks | cs.IT math.IT | We obtain the first term in the high signal-to-noise ratio (SNR) expansion of
the capacity of fading networks where the transmitters and receivers--while
fully cognizant of the fading \emph{law}--have no access to the fading
\emph{realization}. This term is an integer multiple of $\log \log
\textnormal{SNR}$ with the... |
cs/0411099 | A Note on the PAC Bayesian Theorem | cs.LG cs.AI | We prove general exponential moment inequalities for averages of [0,1]-valued
iid random variables and use them to tighten the PAC Bayesian Theorem. The
logarithmic dependence on the sample count in the enumerator of the PAC
Bayesian bound is halved.
|
cs/0412002 | Ranking Pages by Topology and Popularity within Web Sites | cs.AI cs.IR | We compare two link analysis ranking methods of web pages in a site. The
first, called Site Rank, is an adaptation of PageRank to the granularity of a
web site and the second, called Popularity Rank, is based on the frequencies of
user clicks on the outlinks in a page that are captured by navigation sessions
of users... |
cs/0412003 | Mining Heterogeneous Multivariate Time-Series for Learning Meaningful
Patterns: Application to Home Health Telecare | cs.LG | For the last years, time-series mining has become a challenging issue for
researchers. An important application lies in most monitoring purposes, which
require analyzing large sets of time-series for learning usual patterns. Any
deviation from this learned profile is then considered as an unexpected
situation. Moreov... |
cs/0412015 | A Tutorial on the Expectation-Maximization Algorithm Including
Maximum-Likelihood Estimation and EM Training of Probabilistic Context-Free
Grammars | cs.CL | The paper gives a brief review of the expectation-maximization algorithm
(Dempster 1977) in the comprehensible framework of discrete mathematics. In
Section 2, two prominent estimation methods, the relative-frequency estimation
and the maximum-likelihood estimation are presented. Section 3 is dedicated to
the expecta... |
cs/0412016 | Inside-Outside Estimation Meets Dynamic EM | cs.CL | We briefly review the inside-outside and EM algorithm for probabilistic
context-free grammars. As a result, we formally prove that inside-outside
estimation is a dynamic-programming variant of EM. This is interesting in its
own right, but even more when considered in a theoretical context since the
well-known converg... |
cs/0412018 | Modeling Complex Higher Order Patterns | cs.DB cs.AI | The goal of this paper is to show that generalizing the notion of frequent
patterns can be useful in extending association analysis to more complex higher
order patterns. To that end, we describe a general framework for modeling a
complex pattern based on evaluating the interestingness of its sub-patterns. A
key goal... |
cs/0412019 | A Link Clustering Based Approach for Clustering Categorical Data | cs.DL cs.AI | Categorical data clustering (CDC) and link clustering (LC) have been
considered as separate research and application areas. The main focus of this
paper is to investigate the commonalities between these two problems and the
uses of these commonalities for the creation of new clustering algorithms for
categorical data... |
cs/0412021 | Finite Domain Bounds Consistency Revisited | cs.AI cs.LO | A widely adopted approach to solving constraint satisfaction problems
combines systematic tree search with constraint propagation for pruning the
search space. Constraint propagation is performed by propagators implementing a
certain notion of consistency. Bounds consistency is the method of choice for
building propa... |
cs/0412023 | Multidimensional data classification with artificial neural networks | cs.NE cs.AI | Multi-dimensional data classification is an important and challenging problem
in many astro-particle experiments. Neural networks have proved to be versatile
and robust in multi-dimensional data classification. In this article we shall
study the classification of gamma from the hadrons for the MAGIC Experiment.
Two n... |
cs/0412024 | Human-Level Performance on Word Analogy Questions by Latent Relational
Analysis | cs.CL cs.IR cs.LG | This paper introduces Latent Relational Analysis (LRA), a method for
measuring relational similarity. LRA has potential applications in many areas,
including information extraction, word sense disambiguation, machine
translation, and information retrieval. Relational similarity is correspondence
between relations, in... |
cs/0412026 | Removing Propagation Redundant Constraints in Redundant Modeling | cs.LO cs.AI | A widely adopted approach to solving constraint satisfaction problems
combines systematic tree search with various degrees of constraint propagation
for pruning the search space. One common technique to improve the execution
efficiency is to add redundant constraints, which are constraints logically
implied by others... |
cs/0412029 | The modular technology of development of the CAD expansions: profiles of
outside networks of water supply and water drain | cs.CE cs.DS | The modular technology of development of the problem-oriented CAD expansions
is applied to a task of designing of profiles of outside networks of water
supply and water drain with realization in program system TechnoCAD GlassX. The
unity of structure of this profiles is revealed, the system model of the
drawings of p... |
cs/0412030 | The modular technology of development of the CAD expansions: protection
of the buildings from the lightning | cs.CE cs.DS | The modular technology of development of the problem-oriented CAD expansions
is applied to a task of designing of protection of the buildings from the
lightning with realization in program system TechnoCAD GlassX. The system model
of the drawings of lightning protection is developed including the structured
parametri... |
cs/0412031 | The Features of the Complex CAD system of Reconstruction of the
Industrial Plants | cs.CE | The features of designing of reconstruction of the acting plant by its design
department are considered: the results of work are drawings corresponding with
the national standards; large number of the small projects for different acting
objects; variety of the types of the drawings in one project; large paper
archive... |
cs/0412032 | The methods of support of the requirements of the Russian standards at
development of a CAD of industrial objects | cs.CE cs.DS | The methods of support of the requirements of the Russian standards in a CAD
of industrial objects are explained, which were implemented in the CAD system
TechnoCAD GlassX with an own graphics core and own structures of data storage.
It is rotined, that the binding of storage structures and program code of a CAD
to t... |
cs/0412033 | The modelling of the build constructions in a CAD of the renovation of
the enterprises by means of units in the drawings | cs.CE | The parametric model of build constructions and features of design operations
are described for making drawings, which are the common component of the
different parts of the projects of renovation of enterprises. The key moment of
the deep design automation is the using of so-called units in the drawings,
which are j... |
cs/0412034 | The informatization of design works at industry firm during its
renovation | cs.CE | The characteristic of design works on firm at its renovation and of the
common directions of their informatization is given. The implantation of a CAD
is selected as the key direction, and the requirements to a complex CAD-system
are stated. The methods of such a CAD-system development are featured, and the
connected... |
cs/0412035 | Deployment of a Grid-based Medical Imaging Application | cs.DC cs.DB | The MammoGrid project has deployed its Service-Oriented Architecture
(SOA)-based Grid application in a real environment comprising actual
participating hospitals. The resultant setup is currently being exploited to
conduct rigorous in-house tests in the first phase before handing over the
setup to the actual clinicia... |
cs/0412036 | Reverse Engineering Ontology to Conceptual Data Models | cs.DC cs.DB | Ontologies facilitate the integration of heterogeneous data sources by
resolving semantic heterogeneity between them. This research aims to study the
possibility of generating a domain conceptual model from a given ontology with
the vision to grow this generated conceptual data model into a global
conceptual model in... |
cs/0412041 | An Efficient and Flexible Engine for Computing Fixed Points | cs.PL cs.AI cs.LO | An efficient and flexible engine for computing fixed points is critical for
many practical applications. In this paper, we firstly present a goal-directed
fixed point computation strategy in the logic programming paradigm. The
strategy adopts a tabled resolution (or memorized resolution) to mimic the
efficient semi-n... |
cs/0412049 | Neural Networks in Mobile Robot Motion | cs.RO cs.AI | This paper deals with a path planning and intelligent control of an
autonomous robot which should move safely in partially structured environment.
This environment may involve any number of obstacles of arbitrary shape and
size; some of them are allowed to move. We describe our approach to solving the
motion-planning... |
cs/0412050 | Gyroscopically Stabilized Robot: Balance and Tracking | cs.RO | The single wheel, gyroscopically stabilized robot - Gyrover, is a dynamically
stable but statically unstable, underactuated system. In this paper, based on
the dynamic model of the robot, we investigate two classes of nonholonomic
constraints associated with the system. Then, based on the backstepping
technology, we ... |
cs/0412051 | Dynamic replanning in uncertain environments for a sewer inspection
robot | cs.RO | The sewer inspection robot MAKRO is an autonomous multi-segment robot with
worm-like shape driven by wheels. It is currently under development in the
project MAKRO-PLUS. The robot has to navigate autonomously within sewer
systems. Its first tasks will be to take water probes, analyze it onboard, and
measure positions... |
cs/0412052 | WebotsTM: Professional Mobile Robot Simulation | cs.RO | Cyberbotics Ltd. develops WebotsTM, a mobile robotics simulation software
that provides you with a rapid prototyping environment for modelling,
programming and simulating mobile robots. The provided robot libraries enable
you to transfer your control programs to several commercially available real
mobile robots. Webo... |
cs/0412053 | Dynamic simulation of task constrained of a rigid-flexible manipulator | cs.RO | A rigid-flexible manipulator may be assigned tasks in a moving environment
where the winds or vibrations affect the position and/or orientation of surface
of operation. Consequently, losses of the contact and perhaps degradation of
the performance may occur as references are changed. When the environment is
moving, k... |
cs/0412054 | Assembly and Disassembly Planning by using Fuzzy Logic & Genetic
Algorithms | cs.RO | The authors propose the implementation of hybrid Fuzzy Logic-Genetic
Algorithm (FL-GA) methodology to plan the automatic assembly and disassembly
sequence of products. The GA-Fuzzy Logic approach is implemented onto two
levels. The first level of hybridization consists of the development of a Fuzzy
controller for the... |
cs/0412055 | Robotic Applications in Cardiac Surgery | cs.RO | Traditionally, cardiac surgery has been performed through a median
sternotomy, which allows the surgeon generous access to the heart and
surrounding great vessels. As a paradigm shift in the size and location of
incisions occurs in cardiac surgery, new methods have been developed to allow
the surgeon the same amount ... |
cs/0412056 | One-Chip Solution to Intelligent Robot Control: Implementing Hexapod
Subsumption Architecture Using a Contemporary Microprocessor | cs.RO | This paper introduces a six-legged autonomous robot managed by a single
controller and a software core modeled on subsumption architecture. We begin by
discussing the features and capabilities of IsoPod, a new processor for
robotics which has enabled a streamlined implementation of our project. We
argue that this pro... |
cs/0412057 | How to achieve various gait patterns from single nominal | cs.RO | In this paper is presented an approach to achieving on-line modification of
nominal biped gait without recomputing entire dynamics when steady motion is
performed. Straight, dynamically balanced walk was used as a nominal gait, and
applied modifications were speed-up and slow-down walk and turning left and
right. It ... |
cs/0412058 | Clustering Categorical Data Streams | cs.DB cs.AI | The data stream model has been defined for new classes of applications
involving massive data being generated at a fast pace. Web click stream
analysis and detection of network intrusions are two examples. Cluster analysis
on data streams becomes more difficult, because the data objects in a data
stream must be acces... |
cs/0412059 | Vector Symbolic Architectures answer Jackendoff's challenges for
cognitive neuroscience | cs.NE cs.AI | Jackendoff (2002) posed four challenges that linguistic combinatoriality and
rules of language present to theories of brain function. The essence of these
problems is the question of how to neurally instantiate the rapid construction
and transformation of the compositional structures that are typically taken to
be th... |
cs/0412060 | Monotonicity Results for Coherent MIMO Rician Channels | cs.IT math.IT | The dependence of the Gaussian input information rate on the line-of-sight
(LOS) matrix in multiple-input multiple-output coherent Rician fading channels
is explored. It is proved that the outage probability and the mutual
information induced by a multivariate circularly symmetric Gaussian input with
any covariance m... |
cs/0412065 | A Framework for Creating Natural Language User Interfaces for
Action-Based Applications | cs.CL cs.HC | In this paper we present a framework for creating natural language interfaces
to action-based applications. Our framework uses a number of reusable
application-independent components, in order to reduce the effort of creating a
natural language interface for a given application. Using a type-logical
grammar, we first... |
cs/0412066 | From Feature Extraction to Classification: A multidisciplinary Approach
applied to Portuguese Granites | cs.AI cs.CV | The purpose of this paper is to present a complete methodology based on a
multidisciplinary approach, that goes from the extraction of features till the
classification of a set of different portuguese granites. The set of tools to
extract the features that characterise polished surfaces of the granites is
mainly base... |
cs/0412067 | Complete Characterization of the Equivalent MIMO Channel for
Quasi-Orthogonal Space-Time Codes | cs.IT math.IT | Recently, a quasi-orthogonal space-time block code (QSTBC) capable of
achieving a significant fraction of the outage mutual information of a
multiple-input-multiple output (MIMO) wireless communication system for the
case of four transmit and one receive antennas was proposed. We generalize
these results to $n_T=2^n$... |
cs/0412068 | ANTIDS: Self-Organized Ant-based Clustering Model for Intrusion
Detection System | cs.CR cs.AI | Security of computers and the networks that connect them is increasingly
becoming of great significance. Computer security is defined as the protection
of computing systems against threats to confidentiality, integrity, and
availability. There are two types of intruders: the external intruders who are
unauthorized us... |
cs/0412069 | Swarming around Shellfish Larvae | cs.AI cs.CV | The collection of wild larvae seed as a source of raw material is a major sub
industry of shellfish aquaculture. To predict when, where and in what
quantities wild seed will be available, it is necessary to track the appearance
and growth of planktonic larvae. One of the most difficult groups to identify,
particularl... |
cs/0412070 | Less is More - Genetic Optimisation of Nearest Neighbour Classifiers | cs.AI cs.CV | The present paper deals with optimisation of Nearest Neighbour rule
Classifiers via Genetic Algorithms. The methodology consists on implement a
Genetic Algorithm capable of search the input feature space used by the NNR
classifier. Results show that is adequate to perform feature reduction and
simultaneous improve th... |
cs/0412071 | Web Usage Mining Using Artificial Ant Colony Clustering and Genetic
Programming | cs.AI cs.NE | The rapid e-commerce growth has made both business community and customers
face a new situation. Due to intense competition on one hand and the customer's
option to choose from several alternatives business community has realized the
necessity of intelligent marketing strategies and relationship management. Web
usage... |
cs/0412072 | Swarms on Continuous Data | cs.AI cs.NE | While being it extremely important, many Exploratory Data Analysis (EDA)
systems have the inhability to perform classification and visualization in a
continuous basis or to self-organize new data-items into the older ones
(evenmore into new labels if necessary), which can be crucial in KDD -
Knowledge Discovery, Retr... |
cs/0412073 | Self-Organizing the Abstract: Canvas as a Swarm Habitat for Collective
Memory, Perception and Cooperative Distributed Creativity | cs.MM cs.AI | Past experiences under the designation of "Swarm Paintings" conducted in
2001, not only confirmed the possibility of realizing an artificial art (thus
non-human), as introduced into the process the questioning of creative
migration, specifically from the computer monitors to the canvas via a robotic
harm. In more rec... |
cs/0412075 | Self-Organized Stigmergic Document Maps: Environment as a Mechanism for
Context Learning | cs.AI cs.DC | Social insect societies and more specifically ant colonies, are distributed
systems that, in spite of the simplicity of their individuals, present a highly
structured social organization. As a result of this organization, ant colonies
can accomplish complex tasks that in some cases exceed the individual
capabilities ... |
cs/0412076 | Clustering Techniques for Marbles Classification | cs.AI cs.CV | Automatic marbles classification based on their visual appearance is an
important industrial issue. However, there is no definitive solution to the
problem mainly due to the presence of randomly distributed high number of
different colours and its subjective evaluation by the human expert. In this
paper we present a ... |
cs/0412077 | On the Implicit and on the Artificial - Morphogenesis and Emergent
Aesthetics in Autonomous Collective Systems | cs.AI cs.MM | Imagine a "machine" where there is no pre-commitment to any particular
representational scheme: the desired behaviour is distributed and roughly
specified simultaneously among many parts, but there is minimal specification
of the mechanism required to generate that behaviour, i.e. the global behaviour
evolves from th... |
cs/0412079 | The MC2 Project [Machines of Collective Conscience]: A possible walk, up
to Life-like Complexity and Behaviour, from bottom, basic and simple
bio-inspired heuristics - a walk, up into the morphogenesis of information | cs.AI cs.MM | Synergy (from the Greek word synergos), broadly defined, refers to combined
or co-operative effects produced by two or more elements (parts or
individuals). The definition is often associated with the holistic conviction
quote that "the whole is greater than the sum of its parts" (Aristotle, in
Metaphysics), or the w... |
cs/0412080 | The Biological Concept of Neoteny in Evolutionary Colour Image
Segmentation - Simple Experiments in Simple Non-Memetic Genetic Algorithms | cs.AI cs.NE | Neoteny, also spelled Paedomorphosis, can be defined in biological terms as
the retention by an organism of juvenile or even larval traits into later life.
In some species, all morphological development is retarded; the organism is
juvenilized but sexually mature. Such shifts of reproductive capability would
appear t... |
cs/0412081 | Artificial Neoteny in Evolutionary Image Segmentation | cs.AI cs.NE | Neoteny, also spelled Paedomorphosis, can be defined in biological terms as
the retention by an organism of juvenile or even larval traits into later life.
In some species, all morphological development is retarded; the organism is
juvenilized but sexually mature. Such shifts of reproductive capability would
appear t... |
cs/0412083 | Line and Word Matching in Old Documents | cs.AI cs.CV | This paper is concerned with the problem of establishing an index based on
word matching. It is assumed that the book was digitised as better as possible
and some pre-processing techniques were already applied as line orientation
correction and some noise removal. However two main factor are responsible for
being not... |
cs/0412084 | Map Segmentation by Colour Cube Genetic K-Mean Clustering | cs.AI cs.NE | Segmentation of a colour image composed of different kinds of texture regions
can be a hard problem, namely to compute for an exact texture fields and a
decision of the optimum number of segmentation areas in an image when it
contains similar and/or unstationary texture fields. In this work, a method is
described for... |
cs/0412085 | A class of one-dimensional MDS convolutional codes | cs.IT math.IT math.RA | A class of one-dimensional convolutional codes will be presented. They are
all MDS codes, i. e., have the largest distance among all one-dimensional codes
of the same length n and overall constraint length delta. Furthermore, their
extended row distances are computed, and they increase with slope n-delta. In
certain ... |
cs/0412086 | Artificial Ant Colonies in Digital Image Habitats - A Mass Behaviour
Effect Study on Pattern Recognition | cs.AI cs.CV | Some recent studies have pointed that, the self-organization of neurons into
brain-like structures, and the self-organization of ants into a swarm are
similar in many respects. If possible to implement, these features could lead
to important developments in pattern recognition systems, where perceptive
capabilities c... |
cs/0412087 | Image Colour Segmentation by Genetic Algorithms | cs.AI cs.CV | Segmentation of a colour image composed of different kinds of texture regions
can be a hard problem, namely to compute for an exact texture fields and a
decision of the optimum number of segmentation areas in an image when it
contains similar and/or unstationary texture fields. In this work, a method is
described for... |
cs/0412088 | On Image Filtering, Noise and Morphological Size Intensity Diagrams | cs.CV cs.AI | In the absence of a pure noise-free image it is hard to define what noise is,
in any original noisy image, and as a consequence also where it is, and in what
amount. In fact, the definition of noise depends largely on our own aim in the
whole image analysis process, and (perhaps more important) in our
self-perception... |
cs/0412091 | The Combination of Paradoxical, Uncertain, and Imprecise Sources of
Information based on DSmT and Neutro-Fuzzy Inference | cs.AI | The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this chapter, we
present a survey o... |
cs/0412098 | The Google Similarity Distance | cs.CL cs.AI cs.DB cs.IR cs.LG | Words and phrases acquire meaning from the way they are used in society, from
their relative semantics to other words and phrases. For computers the
equivalent of `society' is `database,' and the equivalent of `use' is `way to
search the database.' We present a new theory of similarity between words and
phrases based... |
cs/0412103 | Chosen-Plaintext Cryptanalysis of a Clipped-Neural-Network-Based Chaotic
Cipher | cs.CR cs.NE nlin.CD | In ISNN'04, a novel symmetric cipher was proposed, by combining a chaotic
signal and a clipped neural network (CNN) for encryption. The present paper
analyzes the security of this chaotic cipher against chosen-plaintext attacks,
and points out that this cipher can be broken by a chosen-plaintext attack.
Experimental ... |
cs/0412104 | Negotiating over Bundles and Prices Using Aggregate Knowledge | cs.MA cs.GT | Combining two or more items and selling them as one good, a practice called
bundling, can be a very effective strategy for reducing the costs of producing,
marketing, and selling goods. In this paper, we consider a form of multi-issue
negotiation where a shop negotiates both the contents and the price of bundles
of g... |
cs/0412105 | On the existence of stable models of non-stratified logic programs | cs.AI cs.LO | This paper introduces a fundamental result, which is relevant for Answer Set
programming, and planning. For the first time since the definition of the
stable model semantics, the class of logic programs for which a stable model
exists is given a syntactic characterization. This condition may have a
practical importan... |
cs/0412106 | Online Learning of Aggregate Knowledge about Non-linear Preferences
Applied to Negotiating Prices and Bundles | cs.MA cs.GT cs.LG | In this paper, we consider a form of multi-issue negotiation where a shop
negotiates both the contents and the price of bundles of goods with his
customers. We present some key insights about, as well as a procedure for,
locating mutually beneficial alternatives to the bundle currently under
negotiation. The essence ... |
cs/0412108 | Mutual Information and Minimum Mean-square Error in Gaussian Channels | cs.IT math.IT | This paper deals with arbitrarily distributed finite-power input signals
observed through an additive Gaussian noise channel. It shows a new formula
that connects the input-output mutual information and the minimum mean-square
error (MMSE) achievable by optimal estimation of the input given the output.
That is, the d... |
cs/0412109 | Global minimization of a quadratic functional: neural network approach | cs.NE cs.DM | The problem of finding out the global minimum of a multiextremal functional
is discussed. One frequently faces with such a functional in various
applications. We propose a procedure, which depends on the dimensionality of
the problem polynomially. In our approach we use the eigenvalues and
eigenvectors of the connect... |
cs/0412110 | Q-valued neural network as a system of fast identification and pattern
recognition | cs.NE cs.CV | An effective neural network algorithm of the perceptron type is proposed. The
algorithm allows us to identify strongly distorted input vector reliably. It is
shown that its reliability and processing speed are orders of magnitude higher
than that of full connected neural networks. The processing speed of our
algorith... |
cs/0412111 | On the asymptotic accuracy of the union bound | cs.IT math.IT | A new lower bound on the error probability of maximum likelihood decoding of
a binary code on a binary symmetric channel was proved in Barg and McGregor
(2004, cs.IT/0407011). It was observed in that paper that this bound leads to a
new region of code rates in which the random coding exponent is asymptotically
tight,... |
cs/0412112 | Source Coding With Encoder Side Information | cs.IT math.IT | We introduce the idea of distortion side information, which does not directly
depend on the source but instead affects the distortion measure. We show that
such distortion side information is not only useful at the encoder, but that
under certain conditions, knowing it at only the encoder is as good as knowing
it at ... |
cs/0412113 | Source-Channel Diversity for Parallel Channels | cs.IT math.IT | We consider transmitting a source across a pair of independent, non-ergodic
channels with random states (e.g., slow fading channels) so as to minimize the
average distortion. The general problem is unsolved. Hence, we focus on
comparing two commonly used source and channel encoding systems which
correspond to exploit... |
cs/0412114 | State of the Art, Evaluation and Recommendations regarding "Document
Processing and Visualization Techniques" | cs.CL | Several Networks of Excellence have been set up in the framework of the
European FP5 research program. Among these Networks of Excellence, the NEMIS
project focuses on the field of Text Mining.
Within this field, document processing and visualization was identified as
one of the key topics and the WG1 working group... |
cs/0412117 | Thematic Annotation: extracting concepts out of documents | cs.CL | Contrarily to standard approaches to topic annotation, the technique used in
this work does not centrally rely on some sort of -- possibly statistical --
keyword extraction. In fact, the proposed annotation algorithm uses a large
scale semantic database -- the EDR Electronic Dictionary -- that provides a
concept hier... |
cs/0501005 | Portfolio selection using neural networks | cs.NE | In this paper we apply a heuristic method based on artificial neural networks
in order to trace out the efficient frontier associated to the portfolio
selection problem. We consider a generalization of the standard Markowitz
mean-variance model which includes cardinality and bounding constraints. These
constraints en... |
cs/0501006 | Formal Languages and Algorithms for Similarity based Retrieval from
Sequence Databases | cs.LO cs.DB | The paper considers various formalisms based on Automata, Temporal Logic and
Regular Expressions for specifying queries over sequences. Unlike traditional
binary semantics, the paper presents a similarity based semantics for thse
formalisms. More specifically, a distance measure in the range [0,1] is
associated with ... |
cs/0501008 | Multipartite Secret Correlations and Bound Information | cs.CR cs.IT math.IT quant-ph | We consider the problem of secret key extraction when $n$ honest parties and
an eavesdropper share correlated information. We present a family of
probability distributions and give the full characterization of its
distillation properties. This formalism allows us to design a rich variety of
cryptographic scenarios. I... |
cs/0501011 | A simple algorithm for decoding Reed-Solomon codes and its relation to
the Welch-Berlekamp algorithm | cs.IT math.IT | A simple and natural Gao algorithm for decoding algebraic codes is described.
Its relation to the Welch-Berlekamp and Euclidean algorithms is given.
|
cs/0501015 | Application of Generating Functions and Partial Differential Equations
in Coding Theory | cs.IT math.IT | In this work we have considered formal power series and partial differential
equations, and their relationship with Coding Theory. We have obtained the
nature of solutions for the partial differential equations for Cycle Poisson
Case. The coefficients for this case have been simulated, and the high tendency
of growth... |
cs/0501016 | On the weight distribution of convolutional codes | cs.IT math.IT math.OC | Detailed information about the weight distribution of a convolutional code is
given by the adjacency matrix of the state diagram associated with a controller
canonical form of the code. We will show that this matrix is an invariant of
the code. Moreover, it will be proven that codes with the same adjacency matrix
hav... |
cs/0501017 | Public Key Cryptography based on Semigroup Actions | cs.CR cs.IT math.IT | A generalization of the original Diffie-Hellman key exchange in $(\Z/p\Z)^*$
found a new depth when Miller and Koblitz suggested that such a protocol could
be used with the group over an elliptic curve. In this paper, we propose a
further vast generalization where abelian semigroups act on finite sets. We
define a Di... |
cs/0501018 | Combining Independent Modules in Lexical Multiple-Choice Problems | cs.LG cs.CL cs.IR | Existing statistical approaches to natural language problems are very coarse
approximations to the true complexity of language processing. As such, no
single technique will be best for all problem instances. Many researchers are
examining ensemble methods that combine the output of multiple modules to
create more acc... |
cs/0501019 | Clustering SPIRES with EqRank | cs.DL cs.IR | SPIRES is the largest database of scientific papers in the subject field of
high energy and nuclear physics. It contains information on the citation graph
of more than half a million of papers (vertexes of the citation graph). We
outline the EqRank algorithm designed to cluster vertexes of directed graphs,
and presen... |
cs/0501023 | No-cloning principal can alone provide security | cs.IT math.IT | Existing quantum key distribution schemes need the support of classical
authentication scheme to ensure security. This is a conceptual drawback of
quantum cryptography. It is pointed out that quantum cryptosystem does not need
any support of classical cryptosystem to ensure security. No-cloning principal
can alone pr... |
cs/0501025 | A Logic for Non-Monotone Inductive Definitions | cs.AI cs.LO | Well-known principles of induction include monotone induction and different
sorts of non-monotone induction such as inflationary induction, induction over
well-founded sets and iterated induction. In this work, we define a logic
formalizing induction over well-founded sets and monotone and iterated
induction. Just as... |
cs/0501028 | An Empirical Study of MDL Model Selection with Infinite Parametric
Complexity | cs.LG cs.IT math.IT | Parametric complexity is a central concept in MDL model selection. In
practice it often turns out to be infinite, even for quite simple models such
as the Poisson and Geometric families. In such cases, MDL model selection as
based on NML and Bayesian inference based on Jeffreys' prior can not be used.
Several ways to... |
cs/0501029 | Estimating Range Queries using Aggregate Data with Integrity
Constraints: a Probabilistic Approach | cs.DB | The problem of recovering (count and sum) range queries over multidimensional
data only on the basis of aggregate information on such data is addressed. This
problem can be formalized as follows. Suppose that a transformation T producing
a summary from a multidimensional data set is used. Now, given a data set D, a
s... |
cs/0501031 | From truth to computability II | cs.LO cs.AI math.LO | Computability logic is a formal theory of computational tasks and resources.
Formulas in it represent interactive computational problems, and "truth" is
understood as algorithmic solvability. Interactive computational problems, in
turn, are defined as a certain sort games between a machine and its
environment, with l... |
cs/0501036 | Enabling Agents to Dynamically Select Protocols for Interactions | cs.MA cs.SE | in this paper we describe a method which allows agents to dynamically select
protocols and roles when they need to execute collaborative tasks
|
cs/0501042 | Maintaining Consistency of Data on the Web | cs.DB cs.DS | Increasingly more data is becoming available on the Web, estimates speaking
of 1 billion documents in 2002. Most of the documents are Web pages whose data
is considered to be in XML format, expecting it to eventually replace HTML.
A common problem in designing and maintaining a Web site is that data on a
Web page o... |
cs/0501044 | Augmented Segmentation and Visualization for Presentation Videos | cs.MM cs.IR | We investigate methods of segmenting, visualizing, and indexing presentation
videos by separately considering audio and visual data. The audio track is
segmented by speaker, and augmented with key phrases which are extracted using
an Automatic Speech Recognizer (ASR). The video track is segmented by visual
dissimilar... |
cs/0501046 | Thermodynamics of used punched tape: A weak and a strong equivalence
principle | cs.IT math.IT | We study the repeated use of a monotonic recording medium--such as punched
tape or photographic plate--where marks can be added at any time but never
erased. (For practical purposes, also the electromagnetic "ether" falls into
this class.) Our emphasis is on the case where the successive users act
independently and s... |
cs/0501047 | Impact of Channel Estimation Errors on Multiuser Detection via the
Replica Method | cs.IT math.IT | For practical wireless DS-CDMA systems, channel estimation is imperfect due
to noise and interference. In this paper, the impact of channel estimation
errors on multiuser detection (MUD) is analyzed under the framework of the
replica method. System performance is obtained in the large system limit for
optimal MUD, li... |
cs/0501048 | Low Complexity Joint Iterative Equalization and Multiuser Detection in
Dispersive DS-CDMA Channels | cs.IT math.IT | Communications in dispersive direct-sequence code-division multiple-access
(DS-CDMA) channels suffer from intersymbol and multiple-access interference,
which can significantly impair performance. Joint maximum \textit{a posteriori}
probability (MAP) equalization and multiuser detection with error control
decoding can... |
cs/0501049 | Performance Evaluation of Impulse Radio UWB Systems with Pulse-Based
Polarity Randomization | cs.IT math.IT | In this paper, the performance of a binary phase shift keyed random
time-hopping impulse radio system with pulse-based polarity randomization is
analyzed. Transmission over frequency-selective channels is considered and the
effects of inter-frame interference and multiple access interference on the
performance of a g... |
cs/0501050 | Energy-Efficient Joint Estimation in Sensor Networks: Analog vs. Digital | cs.IT math.IT | Sensor networks in which energy is a limited resource so that energy
consumption must be minimized for the intended application are considered. In
this context, an energy-efficient method for the joint estimation of an unknown
analog source under a given distortion constraint is proposed. The approach is
purely analo... |
cs/0501051 | On the Capacity of Multiple Antenna Systems in Rician Fading | cs.IT math.IT | The effect of Rician-ness on the capacity of multiple antenna systems is
investigated under the assumption that channel state information (CSI) is
available only at the receiver. The average-power-constrained capacity of such
systems is considered under two different assumptions on the knowledge about
the fading avai... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.