id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0510015 | Word sense disambiguation criteria: a systematic study | cs.CL | This article describes the results of a systematic in-depth study of the
criteria used for word sense disambiguation. Our study is based on 60 target
words: 20 nouns, 20 adjectives and 20 verbs. Our results are not always in line
with some practices in the field. For example, we show that omitting
non-content words d... |
cs/0510016 | From finite-system entropy to entropy rate for a Hidden Markov Process | cs.IT math-ph math.IT math.MP | A recent result presented the expansion for the entropy rate of a Hidden
Markov Process (HMP) as a power series in the noise variable $\eps$. The
coefficients of the expansion around the noiseless ($\eps = 0$) limit were
calculated up to 11th order, using a conjecture that relates the entropy rate
of a HMP to the ent... |
cs/0510020 | Sur le statut r\'{e}f\'{e}rentiel des entit\'{e}s nomm\'{e}es | cs.AI cs.IR | We show in this paper that, on the one hand, named entities can be designated
using different denominations and that, on the second hand, names denoting
named entities are polysemous. The analysis cannot be limited to reference
resolution but should take into account naming strategies, which are mainly
based on two l... |
cs/0510021 | A Unified Power Control Algorithm for Multiuser Detectors in Large
Systems: Convergence and Performance | cs.IT math.IT | A unified approach to energy-efficient power control, applicable to a large
family of receivers including the matched filter, the decorrelator, the
(linear) minimum-mean-square-error detector (MMSE), and the individually and
jointly optimal multiuser detectors, has recently been proposed for
code-division-multiple-ac... |
cs/0510023 | On the capacity of mobile ad hoc networks with delay constraints | cs.IT cs.NI math.IT | Previous work on ad hoc network capacity has focused primarily on
source-destination throughput requirements for different models and
transmission scenarios, with an emphasis on delay tolerant applications. In
such problems, network capacity enhancement is achieved as a tradeoff with
transmission delay. In this paper... |
cs/0510025 | Practical Semantic Analysis of Web Sites and Documents | cs.IR | As Web sites are now ordinary products, it is necessary to explicit the
notion of quality of a Web site. The quality of a site may be linked to the
easiness of accessibility and also to other criteria such as the fact that the
site is up to date and coherent. This last quality is difficult to insure
because sites may... |
cs/0510026 | A decision support system for ship identification based on the curvature
scale space representation | cs.CV | In this paper, a decision support system for ship identification is
presented. The system receives as input a silhouette of the vessel to be
identified, previously extracted from a side view of the object. This view
could have been acquired with imaging sensors operating at different spectral
ranges (CCD, FLIR, image... |
cs/0510027 | A Market Test for the Positivity of Arrow-Debreu Prices | cs.CE | We derive tractable necessary and sufficient conditions for the absence of
buy-and-hold arbitrage opportunities in a perfectly liquid, one period market.
We formulate the positivity of Arrow-Debreu prices as a generalized moment
problem to show that this no arbitrage condition is equivalent to the positive
semidefini... |
cs/0510029 | Conditionally independent random variables | cs.IT math.IT | In this paper we investigate the notion of conditional independence and prove
several information inequalities for conditionally independent random
variables.
|
cs/0510030 | A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on
Semi-Definite Programming | cs.IT math.IT | In Multi-Input Multi-Output (MIMO) systems, Maximum-Likelihood (ML) decoding
is equivalent to finding the closest lattice point in an N-dimensional complex
space. In general, this problem is known to be NP hard. In this paper, we
propose a quasi-maximum likelihood algorithm based on Semi-Definite Programming
(SDP). W... |
cs/0510032 | Polar Polytopes and Recovery of Sparse Representations | cs.IT math.IT | Suppose we have a signal y which we wish to represent using a linear
combination of a number of basis atoms a_i, y=sum_i x_i a_i = Ax. The problem
of finding the minimum L0 norm representation for y is a hard problem. The
Basis Pursuit (BP) approach proposes to find the minimum L1 norm representation
instead, which c... |
cs/0510033 | Coding for the Optical Channel: the Ghost-Pulse Constraint | cs.IT cs.DM math.IT | We consider a number of constrained coding techniques that can be used to
mitigate a nonlinear effect in the optical fiber channel that causes the
formation of spurious pulses, called ``ghost pulses.'' Specifically, if $b_1
b_2 ... b_{n}$ is a sequence of bits sent across an optical channel, such that
$b_k=b_l=b_m=1$... |
cs/0510034 | COMODI: On the Graphical User Interface | cs.HC cs.CE cs.MS | We propose a series of features for the graphical user interface (GUI) of the
COmputational MOdule Integrator (COMODI) \cite{Synasc05a}\cite{COMODI}. In view
of the special requirements that a COMODI type of framework for scientific
computing imposes and inspiring from existing solutions that provide advanced
graphic... |
cs/0510035 | Design and Performance Analysis of a New Class of Rate Compatible Serial
Concatenated Convolutional Codes | cs.IT math.IT | In this paper, we provide a performance analysis of a new class of serial
concatenated convolutional codes (SCCC) where the inner encoder can be
punctured beyond the unitary rate. The puncturing of the inner encoder is not
limited to inner coded bits, but extended to systematic bits. Moreover, it is
split into two di... |
cs/0510036 | Semantic Optimization Techniques for Preference Queries | cs.DB cs.AI cs.LO | Preference queries are relational algebra or SQL queries that contain
occurrences of the winnow operator ("find the most preferred tuples in a given
relation"). Such queries are parameterized by specific preference relations.
Semantic optimization techniques make use of integrity constraints holding in
the database. ... |
cs/0510037 | Hi\'{e}rarchisation des r\`{e}gles d'association en fouille de textes | cs.IR cs.AI | Extraction of association rules is widely used as a data mining method.
However, one of the limit of this approach comes from the large number of
extracted rules and the difficulty for a human expert to deal with the totality
of these rules. We propose to solve this problem by structuring the set of
rules into hierar... |
cs/0510038 | Learning Unions of $\omega(1)$-Dimensional Rectangles | cs.LG | We consider the problem of learning unions of rectangles over the domain
$[b]^n$, in the uniform distribution membership query learning setting, where
both b and n are "large". We obtain poly$(n, \log b)$-time algorithms for the
following classes:
- poly$(n \log b)$-way Majority of $O(\frac{\log(n \log b)} {\log \l... |
cs/0510040 | The "...system of constraints" | cs.IT math.IT | This paper proposes that the mathematical relationship between an entropy
distribution and its limit offers some new insight into system performance.
This relationship is used to quantify variation among the entities of a system,
where variation is defined as tolerance, option, specification or
implementation variati... |
cs/0510043 | On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes | cs.IT cs.DM math.IT | We would like to better understand the fundamental cone of Tanner graphs
derived from finite projective planes. Towards this goal, we discuss bounds on
the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner
graphs, on one hand, and study the structure of minimal pseudo-codewords, on
the other.
|
cs/0510044 | Belief Propagation Based Multi--User Detection | cs.IT math.IT | We apply belief propagation (BP) to multi--user detection in a spread
spectrum system, under the assumption of Gaussian symbols. We prove that BP is
both convergent and allows to estimate the correct conditional expectation of
the input symbols. It is therefore an optimal --minimum mean square error--
detection algor... |
cs/0510045 | Why We Can Not Surpass Capacity: The Matching Condition | cs.IT math.IT | We show that iterative coding systems can not surpass capacity using only
quantities which naturally appear in density evolution. Although the result in
itself is trivial, the method which we apply shows that in order to achieve
capacity the various components in an iterative coding system have to be
perfectly matche... |
cs/0510047 | Geometrical relations between space time block code designs and
complexity reduction | cs.IT math.IT | In this work, the geometric relation between space time block code design for
the coherent channel and its non-coherent counterpart is exploited to get an
analogue of the information theoretic inequality $I(X;S)\le I((X,H);S)$ in
terms of diversity. It provides a lower bound on the performance of
non-coherent codes w... |
cs/0510049 | Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective
Geometry Codes | cs.IT cs.DM math.IT | In this paper we focus our attention on a family of finite geometry codes,
called type-I projective geometry low-density parity-check (PG-LDPC) codes,
that are constructed based on the projective planes PG{2,q). In particular, we
study their minimal codewords and pseudo-codewords, as it is known that these
vectors ch... |
cs/0510050 | Integration of the DOLCE top-level ontology into the OntoSpec
methodology | cs.AI | This report describes a new version of the OntoSpec methodology for ontology
building. Defined by the LaRIA Knowledge Engineering Team (University of
Picardie Jules Verne, Amiens, France), OntoSpec aims at helping builders to
model ontological knowledge (upstream of formal representation). The
methodology relies on a... |
cs/0510054 | The Nature of Novelty Detection | cs.IR cs.CL | Sentence level novelty detection aims at reducing redundant sentences from a
sentence list. In the task, sentences appearing later in the list with no new
meanings are eliminated. Aiming at a better accuracy for detecting redundancy,
this paper reveals the nature of the novelty detection task currently
overlooked by ... |
cs/0510055 | Degrees of Freedom in Multiuser MIMO | cs.IT math.IT | We explore the available degrees of freedom for various multiuser MIMO
communication scenarios such as the multiple access, broadcast, interference,
relay, X and Z channels. For the two user MIMO interference channel, we find a
general inner bound and a genie-aided outer bound that give us the exact number
of degrees... |
cs/0510056 | First-Order Modeling and Stability Analysis of Illusory Contours | cs.CV cs.AI | In visual cognition, illusions help elucidate certain intriguing latent
perceptual functions of the human vision system, and their proper mathematical
modeling and computational simulation are therefore deeply beneficial to both
biological and computer vision. Inspired by existent prior works, the current
paper propo... |
cs/0510058 | Precoding for 2x2 Doubly-Dispersive WSSUS Channels | cs.IT math.IT | Optimal link adaption to the scattering function of wide sense stationary
uncorrelated scattering (WSSUS) mobile communication channels is still an
unsolved problem despite its importance for next-generation system design. In
multicarrier transmission such link adaption is performed by pulse shaping
which in turn is ... |
cs/0510059 | Cybercars : Past, Present and Future of the Technology | cs.RO | Automobile has become the dominant transport mode in the world in the last
century. In order to meet a continuously growing demand for transport, one
solution is to change the control approach for vehicle to full driving
automation, which removes the driver from the control loop to improve
efficiency and reduce accid... |
cs/0510060 | Optimal Transmit Covariance for Ergodic MIMO Channels | cs.IT math.IT | In this paper we consider the computation of channel capacity for ergodic
multiple-input multiple-output channels with additive white Gaussian noise. Two
scenarios are considered. Firstly, a time-varying channel is considered in
which both the transmitter and the receiver have knowledge of the channel
realization. Th... |
cs/0510062 | Using Interval Particle Filtering for Marker less 3D Human Motion
Capture | cs.AI | In this paper we present a new approach for marker less human motion capture
from conventional camera feeds. The aim of our study is to recover 3D positions
of key points of the body that can serve for gait analysis. Our approach is
based on foreground segmentation, an articulated body model and particle
filters. In ... |
cs/0510063 | Markerless Human Motion Capture for Gait Analysis | cs.AI | The aim of our study is to detect balance disorders and a tendency towards
the falls in the elderly, knowing gait parameters. In this paper we present a
new tool for gait analysis based on markerless human motion capture, from
camera feeds. The system introduced here, recovers the 3D positions of several
key points o... |
cs/0510067 | On the Spread of Random Interleaver | cs.IT math.IT | For a given blocklength we determine the number of interleavers which have
spread equal to two. Using this, we find out the probability that a randomly
chosen interleaver has spread two. We show that as blocklength increases, this
probability increases but very quickly converges to the value $1-e^{-2} \approx
0.8647$... |
cs/0510068 | Ultra Wideband Impulse Radio Systems with Multiple Pulse Types | cs.IT math.IT | In an ultra wideband (UWB) impulse radio (IR) system, a number of pulses,
each transmitted in an interval called a "frame", is employed to represent one
information symbol. Conventionally, a single type of UWB pulse is used in all
frames of all users. In this paper, IR systems with multiple types of UWB
pulses are co... |
cs/0510070 | On Coding for Reliable Communication over Packet Networks | cs.IT cs.NI math.IT | We present a capacity-achieving coding scheme for unicast or multicast over
lossy packet networks. In the scheme, intermediate nodes perform additional
coding yet do not decode nor even wait for a block of packets before sending
out coded packets. Rather, whenever they have a transmission opportunity, they
send out c... |
cs/0510071 | A Simple Cooperative Diversity Method Based on Network Path Selection | cs.IT math.IT | Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is m... |
cs/0510072 | On Interleaving Techniques for MIMO Channels and Limitations of Bit
Interleaved Coded Modulation | cs.IT math.IT | It is shown that while the mutual information curves for coded modulation
(CM) and bit interleaved coded modulation (BICM) overlap in the case of a
single input single output channel, the same is not true in multiple input
multiple output (MIMO) channels. A method for mitigating fading in the presence
of multiple tra... |
cs/0510075 | On-Off Frequency-Shift-Keying for Wideband Fading Channels | cs.IT math.IT | M-ary On-Off Frequency-Shift-Keying (OOFSK) is a digital modulation format in
which M-ary FSK signaling is overlaid on On/Off keying. This paper investigates
the potential of this modulation format in the context of wideband fading
channels. First it is assumed that the receiver uses energy detection for the
receptio... |
cs/0510076 | Applying Evolutionary Optimisation to Robot Obstacle Avoidance | cs.AI cs.RO | This paper presents an artificial evolutionbased method for stereo image
analysis and its application to real-time obstacle detection and avoidance for
a mobile robot. It uses the Parisian approach, which consists here in splitting
the representation of the robot's environment into a large number of simple
primitives... |
cs/0510077 | Connection state overhead in a dynamic linear network | cs.IT cs.NI math.IT | We consider a dynamical linear network where nearest neighbours communicate
via links whose states form binary (open/closed) valued independent and
identically distributed Markov processes. Our main result is the tight
information-theoretic lower bound on the network traffic required by the
connection state overhead,... |
cs/0510078 | Vector Gaussian Multiple Description with Individual and Central
Receivers | cs.IT math.IT | L multiple descriptions of a vector Gaussian source for individual and
central receivers are investigated. The sum rate of the descriptions with
covariance distortion measure constraints, in a positive semidefinite ordering,
is exactly characterized. For two descriptions, the entire rate region is
characterized. Join... |
cs/0510079 | Evidence with Uncertain Likelihoods | cs.AI | An agent often has a number of hypotheses, and must choose among them based
on observations, or outcomes of experiments. Each of these observations can be
viewed as providing evidence for or against various hypotheses. All the
attempts to formalize this intuition up to now have assumed that associated
with each hypot... |
cs/0510080 | When Ignorance is Bliss | cs.AI cs.LG | It is commonly-accepted wisdom that more information is better, and that
information should never be ignored. Here we argue, using both a Bayesian and a
non-Bayesian analysis, that in some situations you are better off ignoring
information if your uncertainty is represented by a set of probability
measures. These inc... |
cs/0510083 | Neuronal Spectral Analysis of EEG and Expert Knowledge Integration for
Automatic Classification of Sleep Stages | cs.AI | Being able to analyze and interpret signal coming from electroencephalogram
(EEG) recording can be of high interest for many applications including medical
diagnosis and Brain-Computer Interfaces. Indeed, human experts are today able
to extract from this signal many hints related to physiological as well as
cognitive... |
cs/0510084 | R\'{e}flexions sur la question fr\'{e}quentielle en traitement du signal | cs.CE cs.IR math-ph math.MP math.SP | New definitions are suggested for frequencies which may be instantaneous or
not. The Heisenberg-Gabor inequality and the Shannon sampling theorem are
briefly discussed.
|
cs/0510085 | Canonical time-frequency, time-scale, and frequency-scale
representations of time-varying channels | cs.IT math.IT | Mobile communication channels are often modeled as linear time-varying
filters or, equivalently, as time-frequency integral operators with finite
support in time and frequency. Such a characterization inherently assumes the
signals are narrowband and may not be appropriate for wideband signals. In this
paper time-sca... |
cs/0510089 | Automata-based adaptive behavior for economic modeling using game theory | cs.MA cs.DM | In this paper, we deal with some specific domains of applications to game
theory. This is one of the major class of models in the new approaches of
modelling in the economic domain. For that, we use genetic automata which allow
to buid adaptive strategies for the players. We explain how the automata-based
formalism p... |
cs/0510091 | An efficient memetic, permutation-based evolutionary algorithm for
real-world train timetabling | cs.AI | Train timetabling is a difficult and very tightly constrained combinatorial
problem that deals with the construction of train schedules. We focus on the
particular problem of local reconstruction of the schedule following a small
perturbation, seeking minimisation of the total accumulated delay by adapting
times of d... |
cs/0510095 | Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem | cs.IT math.IT | We determine the rate region of the quadratic Gaussian two-encoder
source-coding problem. This rate region is achieved by a simple architecture
that separates the analog and digital aspects of the compression. Furthermore,
this architecture requires higher rates to send a Gaussian source than it does
to send any othe... |
cs/0511001 | Capacity with Causal and Non-Causal Side Information - A Unified View | cs.IT math.IT | We identify the common underlying form of the capacity expression that is
applicable to both cases where causal or non-causal side information is made
available to the transmitter. Using this common form we find that for the
single user channel, the multiple access channel, the degraded broadcast
channel, and the deg... |
cs/0511002 | Bibliographic Classification using the ADS Databases | cs.IR cs.DL | We discuss two techniques used to characterize bibliographic records based on
their similarity to and relationship with the contents of the NASA Astrophysics
Data System (ADS) databases. The first method has been used to classify input
text as being relevant to one or more subject areas based on an analysis of the
fr... |
cs/0511003 | Optimal Prefix Codes for Infinite Alphabets with Nonlinear Costs | cs.IT cs.DS math.IT | Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set
of nonnegative integers. Although the countable number of inputs prevents usage
of the Huffman algorithm, there are nontrivial $P$ for which known methods find
a source code that is optimal in the sense of minimizing expected codeword
lengt... |
cs/0511004 | Evolutionary Computing | cs.AI | Evolutionary computing (EC) is an exciting development in Computer Science.
It amounts to building, applying and studying algorithms based on the Darwinian
principles of natural selection. In this paper we briefly introduce the main
concepts behind evolutionary computing. We present the main components all
evolutiona... |
cs/0511005 | The egalitarian effect of search engines | cs.CY cs.IR physics.soc-ph | Search engines have become key media for our scientific, economic, and social
activities by enabling people to access information on the Web in spite of its
size and complexity. On the down side, search engines bias the traffic of users
according to their page-ranking strategies, and some have argued that they
create... |
cs/0511008 | Analysis of Stochastic Service Guarantees in Communication Networks: A
Basic Calculus | cs.PF cs.IT cs.NI math.IT | A basic calculus is presented for stochastic service guarantee analysis in
communication networks. Central to the calculus are two definitions,
maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and
stochastic service curve, which respectively generalize arrival curve and
service curve in the determin... |
cs/0511009 | Mismatched codebooks and the role of entropy-coding in lossy data
compression | cs.IT math.IT math.PR | We introduce a universal quantization scheme based on random coding, and we
analyze its performance. This scheme consists of a source-independent random
codebook (typically_mismatched_ to the source distribution), followed by
optimal entropy-coding that is_matched_ to the quantized codeword distribution.
A single-let... |
cs/0511011 | The Impact of Social Networks on Multi-Agent Recommender Systems | cs.LG cs.CC cs.MA | Awerbuch et al.'s approach to distributed recommender systems (DRSs) is to
have agents sample products at random while randomly querying one another for
the best item they have found; we improve upon this by adding a communication
network. Agents can only communicate with their immediate neighbors in the
network, but... |
cs/0511012 | Parameters Affecting the Resilience of Scale-Free Networks to Random
Failures | cs.NI cs.AR cs.MA | It is commonly believed that scale-free networks are robust to massive
numbers of random node deletions. For example, Cohen et al. study scale-free
networks including some which approximate the measured degree distribution of
the Internet. Their results suggest that if each node in this network failed
independently w... |
cs/0511013 | K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical
Data | cs.AI cs.DB | Clustering categorical data is an integral part of data mining and has
attracted much attention recently. In this paper, we present k-ANMI, a new
efficient algorithm for clustering categorical data. The k-ANMI algorithm works
in a way that is similar to the popular k-means algorithm, and the goodness of
clustering in... |
cs/0511015 | Towards a Hierarchical Model of Consciousness, Intelligence, Mind and
Body | cs.AI | This article is taken out.
|
cs/0511016 | How to make the top ten: Approximating PageRank from in-degree | cs.IR physics.soc-ph | PageRank has become a key element in the success of search engines, allowing
to rank the most important hits in the top screen of results. One key aspect
that distinguishes PageRank from other prestige measures such as in-degree is
its global nature. From the information provider perspective, this makes it
difficult ... |
cs/0511019 | A Counterexample to Cover's 2P Conjecture on Gaussian Feedback Capacity | cs.IT math.IT | We provide a counterexample to Cover's conjecture that the feedback capacity
$C_\textrm{FB}$ of an additive Gaussian noise channel under power constraint
$P$ be no greater than the nonfeedback capacity $C$ of the same channel under
power constraint $2P$, i.e., $C_\textrm{FB}(P) \le C(2P)$.
|
cs/0511022 | Does a Plane Imitate a Bird? Does Computer Vision Have to Follow
Biological Paradigms? | cs.NE | We posit a new paradigm for image information processing. For the last 25
years, this task was usually approached in the frame of Treisman's two-stage
paradigm [1]. The latter supposes an unsupervised, bottom-up directed process
of preliminary information pieces gathering at the lower processing stages and
a supervis... |
cs/0511024 | Heat kernel expansion for a family of stochastic volatility models :
delta-geometry | cs.CE | In this paper, we study a family of stochastic volatility processes; this
family features a mean reversion term for the volatility and a double CEV-like
exponent that generalizes SABR and Heston's models. We derive approximated
closed form formulas for the digital prices, the local and implied
volatilities. Our formu... |
cs/0511026 | A Decision Theoretic Framework for Real-Time Communication | cs.IT math.IT | We consider a communication system in which the outputs of a Markov source
are encoded and decoded in \emph{real-time} by a finite memory receiver, and
the distortion measure does not tolerate delays. The objective is to choose
designs, i.e. real-time encoding, decoding and memory update strategies that
minimize a to... |
cs/0511027 | Discrete Network Dynamics. Part 1: Operator Theory | cs.NE | An operator algebra implementation of Markov chain Monte Carlo algorithms for
simulating Markov random fields is proposed. It allows the dynamics of networks
whose nodes have discrete state spaces to be specified by the action of an
update operator that is composed of creation and annihilation operators. This
formula... |
cs/0511028 | MIMO Diversity in the Presence of Double Scattering | cs.IT math.IT | The potential benefits of multiple-antenna systems may be limited by two
types of channel degradations rank deficiency and spatial fading correlation of
the channel. In this paper, we assess the effects of these degradations on the
diversity performance of multiple-input multiple-output (MIMO) systems, with an
emphas... |
cs/0511029 | Non-coherent Rayleigh fading MIMO channels: Capacity Supremum | cs.IT math.IT | This paper investigates the limits of information transfer over a fast
Rayleigh fading MIMO channel, where neither the transmitter nor the receiver
has the knowledge of the channel state information (CSI) except the fading
statistics. We develop a scalar channel model due to absence of the phase
information in non-co... |
cs/0511032 | Spatiotemporal sensistivity and visual attention for efficient rendering
of dynamic environments | cs.GR cs.CV | We present a method to accelerate global illumination computation in dynamic
environments by taking advantage of limitations of the human visual system. A
model of visual attention is used to locate regions of interest in a scene and
to modulate spatiotemporal sensitivity. The method is applied in the form of a
spati... |
cs/0511036 | A Capacity Achieving and Low Complexity Multilevel Coding Scheme for ISI
Channels | cs.IT math.IT | We propose a computationally efficient multilevel coding scheme to achieve
the capacity of an ISI channel using layers of binary inputs. The transmitter
employs multilevel coding with linear mapping. The receiver uses multistage
decoding where each stage performs a separate linear minimum mean square error
(LMMSE) eq... |
cs/0511037 | Trellis Pruning for Peak-to-Average Power Ratio Reduction | cs.IT math.IT | This paper introduces a new trellis pruning method which uses nonlinear
convolutional coding for peak-to-average power ratio (PAPR) reduction of
filtered QPSK and 16-QAM modulations. The Nyquist filter is viewed as a
convolutional encoder that controls the analog waveforms of the filter output
directly. Pruning some ... |
cs/0511038 | Towards a unified theory of logic programming semantics: Level mapping
characterizations of selector generated models | cs.AI cs.LO | Currently, the variety of expressive extensions and different semantics
created for logic programs with negation is diverse and heterogeneous, and
there is a lack of comprehensive comparative studies which map out the
multitude of perspectives in a uniform way. Most recently, however, new
methodologies have been prop... |
cs/0511039 | The Generalized Area Theorem and Some of its Consequences | cs.IT math.IT | There is a fundamental relationship between belief propagation and maximum a
posteriori decoding. The case of transmission over the binary erasure channel
was investigated in detail in a companion paper. This paper investigates the
extension to general memoryless channels (paying special attention to the
binary case)... |
cs/0511040 | Design and Analysis of Nonbinary LDPC Codes for Arbitrary
Discrete-Memoryless Channels | cs.IT math.IT | We present an analysis, under iterative decoding, of coset LDPC codes over
GF(q), designed for use over arbitrary discrete-memoryless channels
(particularly nonbinary and asymmetric channels). We use a random-coset
analysis to produce an effect that is similar to output-symmetry with binary
channels. We show that the... |
cs/0511042 | Dimensions of Neural-symbolic Integration - A Structured Survey | cs.AI cs.LO cs.NE | Research on integrated neural-symbolic systems has made significant progress
in the recent past. In particular the understanding of ways to deal with
symbolic knowledge within connectionist systems (also called artificial neural
networks) has reached a critical mass which enables the community to strive for
applicabl... |
cs/0511046 | Generalized Kasami Sequences: The Large Set | cs.IT cs.CR math.IT | In this paper new binary sequence families $\mathcal{F}^k$ of period $2^n-1$
are constructed for even $n$ and any $k$ with ${\rm gcd}(k,n)=2$ if $n/2$ is
odd or ${\rm gcd}(k,n)=1$ if $n/2$ is even. The distribution of their
correlation values is completely determined. These families have maximum
correlation $2^{n/2+1... |
cs/0511047 | The Secret Key-Private Key Capacity Region for Three Terminals | cs.IT math.IT | We consider a model for secrecy generation, with three terminals, by means of
public interterminal communication, and examine the problem of characterizing
all the rates at which all three terminals can generate a ``secret key,'' and
-- simultaneously -- two designated terminals can generate a ``private key''
which i... |
cs/0511048 | Joint Network-Source Coding: An Achievable Region with Diversity Routing | cs.IT math.IT | We are interested in how to best communicate a (usually real valued) source
to a number of destinations (sinks) over a network with capacity constraints in
a collective fidelity metric over all the sinks, a problem which we call joint
network-source coding. Unlike the lossless network coding problem, lossy
reconstruc... |
cs/0511050 | Secret Key and Private Key Constructions for Simple Multiterminal Source
Models | cs.IT cs.CR math.IT | This work is motivated by recent results of Csiszar and Narayan (IEEE Trans.
on Inform. Theory, Dec. 2004), which highlight innate connections between
secrecy generation by multiple terminals and multiterminal Slepian-Wolf
near-lossless data compression (sans secrecy restrictions). We propose a new
approach for const... |
cs/0511051 | The Private Key Capacity Region for Three Terminals | cs.IT cs.CR math.IT | We consider a model with three terminals and examine the problem of
characterizing the largest rates at which two pairs of terminals can
simultaneously generate private keys, each of which is effectively concealed
from the remaining terminal.
|
cs/0511052 | Mining Cellular Automata DataBases throug PCA Models | cs.DM cs.DB | Cellular Automata are discrete dynamical systems that evolve following simple
and local rules. Despite of its local simplicity, knowledge discovery in CA is
a NP problem. This is the main motivation for using data mining techniques for
CA study. The Principal Component Analysis (PCA) is a useful tool for data
mining ... |
cs/0511054 | Eigenvalue Distributions of Sums and Products of Large Random Matrices
via Incremental Matrix Expansions | cs.IT math.IT | This paper uses an incremental matrix expansion approach to derive asymptotic
eigenvalue distributions (a.e.d.'s) of sums and products of large random
matrices. We show that the result can be derived directly as a consequence of
two common assumptions, and matches the results obtained from using R- and
S-transforms i... |
cs/0511056 | Improved Upper Bounds on Stopping Redundancy | cs.IT cs.DM math.IT | Let C be a linear code with length n and minimum distance d. The stopping
redundancy of C is defined as the minimum number of rows in a parity-check
matrix for C such that the smallest stopping sets in the corresponding Tanner
graph have size d. We derive new upper bounds on the stopping redundancy of
linear codes in... |
cs/0511057 | Quantized Indexing: Beyond Arithmetic Coding | cs.IT cs.DM math.CO math.IT | Quantized Indexing is a fast and space-efficient form of enumerative
(combinatorial) coding, the strongest among asymptotically optimal universal
entropy coding algorithms. The present advance in enumerative coding is similar
to that made by arithmetic coding with respect to its unlimited precision
predecessor, Elias... |
cs/0511058 | On-line regression competitive with reproducing kernel Hilbert spaces | cs.LG | We consider the problem of on-line prediction of real-valued labels, assumed
bounded in absolute value by a known constant, of new objects from known
labeled objects. The prediction algorithm's performance is measured by the
squared deviation of the predictions from the actual labels. No stochastic
assumptions are ma... |
cs/0511060 | On Quadratic Inverses for Quadratic Permutation Polynomials over Integer
Rings | cs.IT math.IT | An interleaver is a critical component for the channel coding performance of
turbo codes. Algebraic constructions are of particular interest because they
admit analytical designs and simple, practical hardware implementation. Sun and
Takeshita have recently shown that the class of quadratic permutation
polynomials ov... |
cs/0511064 | The consistency principle for a digitization procedure. An algorithm for
building normal digital spaces of continuous n-dimensional objects | cs.CV cs.DM | This paper considers conditions, which allow to preserve important
topological and geometric properties in the process of digitization. For this
purpose, we introduce a triplet {C,M,D} consisting of a continuous object C, an
intermediate model M, which is a collection of subregions whose union is C, a
digital model D... |
cs/0511065 | Performance Analysis of MIMO-MRC in Double-Correlated Rayleigh
Environments | cs.IT math.IT | We consider multiple-input multiple-output (MIMO) transmit beamforming
systems with maximum ratio combining (MRC) receivers. The operating environment
is Rayleigh-fading with both transmit and receive spatial correlation. We
present exact expressions for the probability density function (p.d.f.) of the
output signal-... |
cs/0511067 | Effects of Initial Stance of Quadruped Trotting on Walking Stability | cs.RO | It is very important for quadruped walking machine to keep its stability in
high speed walking. It has been indicated that moment around the supporting
diagonal line of quadruped in trotting gait largely influences walking
stability. In this paper, moment around the supporting diagonal line of
quadruped in trotting g... |
cs/0511068 | An Agent-based Manufacturing Management System for Production and
Logistics within Cross-Company Regional and National Production Networks | cs.RO | The goal is the development of a simultaneous, dynamic, technological as well
as logistical real-time planning and an organizational control of the
production by the production units themselves, working in the production
network under the use of Multi-Agent-Technology. The design of the
multi-agent-based manufacturin... |
cs/0511069 | Nonlinear Receding-Horizon Control of Rigid Link Robot Manipulators | cs.RO | The approximate nonlinear receding-horizon control law is used to treat the
trajectory tracking control problem of rigid link robot manipulators. The
derived nonlinear predictive law uses a quadratic performance index of the
predicted tracking error and the predicted control effort. A key feature of
this control law ... |
cs/0511070 | A particle can carry more than one bit of information | cs.IT math.IT | It is believed that a particle cannot carry more than one bit of information.
It is pointed out that particle or single-particle quantum state can carry more
than one bit of information. It implies that minimum energy cost of
transmitting a bit will be less than the accepted limit KTlog2.
|
cs/0511072 | Explicit Codes Achieving List Decoding Capacity: Error-correction with
Optimal Redundancy | cs.IT math.IT | We present error-correcting codes that achieve the information-theoretically
best possible trade-off between the rate and error-correction radius.
Specifically, for every $0 < R < 1$ and $\eps> 0$, we present an explicit
construction of error-correcting codes of rate $R$ that can be list decoded in
polynomial time up... |
cs/0511073 | Stochastic Process Semantics for Dynamical Grammar Syntax: An Overview | cs.AI cs.LO nlin.AO | We define a class of probabilistic models in terms of an operator algebra of
stochastic processes, and a representation for this class in terms of
stochastic parameterized grammars. A syntactic specification of a grammar is
mapped to semantics given in terms of a ring of operators, so that grammatical
composition cor... |
cs/0511074 | Every Sequence is Decompressible from a Random One | cs.IT cs.CC math.IT | Kucera and Gacs independently showed that every infinite sequence is Turing
reducible to a Martin-Lof random sequence. This result is extended by showing
that every infinite sequence S is Turing reducible to a Martin-Lof random
sequence R such that the asymptotic number of bits of R needed to compute n
bits of S, div... |
cs/0511075 | Identifying Interaction Sites in "Recalcitrant" Proteins: Predicted
Protein and Rna Binding Sites in Rev Proteins of Hiv-1 and Eiav Agree with
Experimental Data | cs.LG cs.AI | Protein-protein and protein nucleic acid interactions are vitally important
for a wide range of biological processes, including regulation of gene
expression, protein synthesis, and replication and assembly of many viruses. We
have developed machine learning approaches for predicting which amino acids of
a protein pa... |
cs/0511076 | Using phonetic constraints in acoustic-to-articulatory inversion | cs.CL | The goal of this work is to recover articulatory information from the speech
signal by acoustic-to-articulatory inversion. One of the main difficulties with
inversion is that the problem is underdetermined and inversion methods
generally offer no guarantee on the phonetical realism of the inverse
solutions. A way to ... |
cs/0511078 | Uniqueness of Nonextensive entropy under Renyi's Recipe | cs.IT math.IT | By replacing linear averaging in Shannon entropy with Kolmogorov-Nagumo
average (KN-averages) or quasilinear mean and further imposing the additivity
constraint, R\'{e}nyi proposed the first formal generalization of Shannon
entropy. Using this recipe of R\'{e}nyi, one can prepare only two information
measures: Shanno... |
cs/0511079 | An elitist approach for extracting automatically well-realized speech
sounds with high confidence | cs.CL | This paper presents an "elitist approach" for extracting automatically
well-realized speech sounds with high confidence. The elitist approach uses a
speech recognition system based on Hidden Markov Models (HMM). The HMM are
trained on speech sounds which are systematically well-detected in an iterative
procedure. The... |
cs/0511081 | Writing on Fading Paper and Causal Transmitter CSI | cs.IT math.IT | A wideband fading channel is considered with causal channel state information
(CSI) at the transmitter and no receiver CSI. A simple orthogonal code with
energy detection rule at the receiver (similar to [6]) is shown to achieve the
capacity of this channel in the limit of large bandwidth. This code transmits
energy ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.