id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0710.3561 | Stationary probability density of stochastic search processes in global
optimization | cs.AI cond-mat.stat-mech cs.NE | A method for the construction of approximate analytical expressions for the
stationary marginal densities of general stochastic search processes is
proposed. By the marginal densities, regions of the search space that with high
probability contain the global optima can be readily defined. The density
estimation proce... |
0710.3621 | Numerical removal of water-vapor effects from THz-TDS measurements | cs.CE physics.comp-ph | One source of disturbance in a pulsed T-ray signal is attributed to ambient
water vapor. Water molecules in the gas phase selectively absorb T-rays at
discrete frequencies corresponding to their molecular rotational transitions.
This results in prominent resonances spread over the T-ray spectrum, and in the
time doma... |
0710.3757 | Inferring the conditional mean | math.PR cs.IT math.IT | Consider a stationary real-valued time series $\{X_n\}_{n=0}^{\infty}$ with a
priori unknown distribution. The goal is to estimate the conditional
expectation $E(X_{n+1}|X_0,..., X_n)$ based on the observations $(X_0,...,
X_n)$ in a pointwise consistent way. It is well known that this is not possible
at all values of... |
0710.3760 | Guessing the output of a stationary binary time series | math.PR cs.IT math.IT | The forward prediction problem for a binary time series
$\{X_n\}_{n=0}^{\infty}$ is to estimate the probability that $X_{n+1}=1$ based
on the observations $X_i$, $0\le i\le n$ without prior knowledge of the
distribution of the process $\{X_n\}$. It is known that this is not possible if
one estimates at all values of ... |
0710.3773 | Limitations on intermittent forecasting | math.PR cs.IT math.IT | Bailey showed that the general pointwise forecasting for stationary and
ergodic time series has a negative solution. However, it is known that for
Markov chains the problem can be solved. Morvai showed that there is a stopping
time sequence $\{\lambda_n\}$ such that
$P(X_{\lambda_n+1}=1|X_0,...,X_{\lambda_n}) $ can b... |
0710.3775 | On classifying processes | math.PR cs.IT math.IT | We prove several results concerning classifications, based on successive
observations $(X_1,..., X_n)$ of an unknown stationary and ergodic process, for
membership in a given class of processes, such as the class of all finite order
Markov chains.
|
0710.3777 | A Deterministic Approach to Wireless Relay Networks | cs.IT cs.DM math.IT math.PR | We present a deterministic channel model which captures several key features
of multiuser wireless communication. We consider a model for a wireless network
with nodes connected by such deterministic channels, and present an exact
characterization of the end-to-end capacity when there is a single source and a
single ... |
0710.3781 | Wireless Network Information Flow | cs.IT cs.DM math.IT math.PR | We present an achievable rate for general deterministic relay networks, with
broadcasting at the transmitters and interference at the receivers. In
particular we show that if the optimizing distribution for the
information-theoretic cut-set bound is a product distribution, then we have a
complete characterization of ... |
0710.3802 | A Posteriori Equivalence: A New Perspective for Design of Optimal
Channel Shortening Equalizers | cs.IT math.IT | The problem of channel shortening equalization for optimal detection in ISI
channels is considered. The problem is to choose a linear equalizer and a
partial response target filter such that the combination produces the best
detection performance. Instead of using the traditional approach of MMSE
equalization, we dir... |
0710.3817 | A Note on Comparison of Error Correction Codes | cs.IT math.IT math.ST stat.TH | Use of an error correction code in a given transmission channel can be
regarded as the statistical experiment. Therefore, powerful results from the
theory of comparison of experiments can be applied to compare the performances
of different error correction codes. We present results on the comparison of
block error co... |
0710.3861 | Optimal encoding on discrete lattice with translational invariant
constrains using statistical algorithms | cs.IT math.IT | In this paper will be presented methodology of encoding information in
valuations of discrete lattice with some translational invariant constrains in
asymptotically optimal way. The method is based on finding statistical
description of such valuations and changing it into statistical algorithm,
which allows to constr... |
0710.3888 | Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and
Inter-Users Links | cs.IT math.IT | Cooperative technology is expected to have a great impact on the performance
of cellular or, more generally, infrastructure networks. Both multicell
processing (cooperation among base stations) and relaying (cooperation at the
user level) are currently being investigated. In this presentation, recent
results regardin... |
0710.3974 | Distributed source coding in dense sensor networks | cs.IT math.IT | We study the problem of the reconstruction of a Gaussian field defined in
[0,1] using N sensors deployed at regular intervals. The goal is to quantify
the total data rate required for the reconstruction of the field with a given
mean square distortion. We consider a class of two-stage mechanisms which a)
send informa... |
0710.4046 | Bit-interleaved coded modulation in the wideband regime | cs.IT math.IT | The wideband regime of bit-interleaved coded modulation (BICM) in Gaussian
channels is studied. The Taylor expansion of the coded modulation capacity for
generic signal constellations at low signal-to-noise ratio (SNR) is derived and
used to determine the corresponding expansion for the BICM capacity. Simple
formulas... |
0710.4051 | On the capacity achieving covariance matrix for Rician MIMO channels: an
asymptotic approach | math.PR cs.IT math.IT | The capacity-achieving input covariance matrices for coherent block-fading
correlated MIMO Rician channels are determined. In this case, no closed-form
expressions for the eigenvectors of the optimum input covariance matrix are
available. An approximation of the average mutual information is evaluated in
this paper i... |
0710.4076 | Some information-theoretic computations related to the distribution of
prime numbers | cs.IT math.IT math.NT math.PR | We illustrate how elementary information-theoretic ideas may be employed to
provide proofs for well-known, nontrivial results in number theory.
Specifically, we give an elementary and fairly short proof of the following
asymptotic result: The sum of (log p)/p, taken over all primes p not exceeding
n, is asymptotic to... |
0710.4105 | A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel | cs.IT math.IT | Recently, the secrecy capacity of the multi-antenna wiretap channel was
characterized by Khisti and Wornell [1] using a Sato-like argument. This note
presents an alternative characterization using a channel enhancement argument.
This characterization relies on an extremal entropy inequality recently proved
in the con... |
0710.4117 | From the entropy to the statistical structure of spike trains | q-bio.NC cs.IT math.IT math.PR stat.AP | We use statistical estimates of the entropy rate of spike train data in order
to make inferences about the underlying structure of the spike train itself. We
first examine a number of different parametric and nonparametric estimators
(some known and some new), including the ``plug-in'' method, several versions
of Lem... |
0710.4180 | A quick search method for audio signals based on a piecewise linear
representation of feature trajectories | cs.MM cs.DB | This paper presents a new method for a quick similarity-based search through
long unlabeled audio streams to detect and locate audio clips provided by
users. The method involves feature-dimension reduction based on a piecewise
linear representation of a sequential feature trajectory extracted from a long
audio stream... |
0710.4182 | Beyond Feedforward Models Trained by Backpropagation: a Practical
Training Tool for a More Efficient Universal Approximator | cs.NE | Cellular Simultaneous Recurrent Neural Network (SRN) has been shown to be a
function approximator more powerful than the MLP. This means that the
complexity of MLP would be prohibitively large for some problems while SRN
could realize the desired mapping with acceptable computational constraints.
The speed of trainin... |
0710.4187 | Universal coding for correlated sources with complementary delivery | cs.IT math.IT | This paper deals with a universal coding problem for a certain kind of
multiterminal source coding system that we call the complementary delivery
coding system. In this system, messages from two correlated sources are jointly
encoded, and each decoder has access to one of the two messages to enable it to
reproduce th... |
0710.4231 | Analyzing covert social network foundation behind terrorism disaster | cs.AI | This paper addresses a method to analyze the covert social network foundation
hidden behind the terrorism disaster. It is to solve a node discovery problem,
which means to discover a node, which functions relevantly in a social network,
but escaped from monitoring on the presence and mutual relationship of nodes.
The... |
0710.4255 | Analysis of a Mixed Strategy for Multiple Relay Networks | cs.IT math.IT | In their landmark paper Cover and El Gamal proposed different coding
strategies for the relay channel with a single relay supporting a communication
pair. These strategies are the decode-and-forward and compress-and-forward
approach, as well as a general lower bound on the capacity of a relay network
which relies on ... |
0710.4486 | Non-linear estimation is easy | cs.CE cs.NA cs.PF math.AC math.NA math.OC | Non-linear state estimation and some related topics, like parametric
estimation, fault diagnosis, and perturbation attenuation, are tackled here via
a new methodology in numerical differentiation. The corresponding basic system
theoretic definitions and properties are presented within the framework of
differential al... |
0710.4516 | The predictability of letters in written english | physics.soc-ph cs.CL stat.ML | We show that the predictability of letters in written English texts depends
strongly on their position in the word. The first letters are usually the least
easy to predict. This agrees with the intuitive notion that words are well
defined subunits in written languages, with much weaker correlations across
these units... |
0710.4680 | Energy Bounds for Fault-Tolerant Nanoscale Designs | cs.CC cs.IT math.IT | The problem of determining lower bounds for the energy cost of a given
nanoscale design is addressed via a complexity theory-based approach. This
paper provides a theoretical framework that is able to assess the trade-offs
existing in nanoscale designs between the amount of redundancy needed for a
given level of resi... |
0710.4725 | Fault-Trajectory Approach for Fault Diagnosis on Analog Circuits | cs.NE | This issue discusses the fault-trajectory approach suitability for fault
diagnosis on analog networks. Recent works have shown promising results
concerning a method based on this concept for ATPG for diagnosing faults on
analog networks. Such method relies on evolutionary techniques, where a generic
algorithm (GA) is... |
0710.4734 | Computational Intelligence Characterization Method of Semiconductor
Device | cs.AI cs.NE | Characterization of semiconductor devices is used to gather as much data
about the device as possible to determine weaknesses in design or trends in the
manufacturing process. In this paper, we propose a novel multiple trip point
characterization concept to overcome the constraint of single trip point
concept in devi... |
0710.4750 | On the Analysis of Reed Solomon Coding for Resilience to
Transient/Permanent Faults in Highly Reliable Memories | cs.IT math.IT | Single Event Upsets (SEU) as well as permanent faults can significantly
affect the correct on-line operation of digital systems, such as memories and
microprocessors; a memory can be made resilient to permanent and transient
faults by using modular redundancy and coding. In this paper, different memory
systems are co... |
0710.4780 | Querying XML Documents in Logic Programming | cs.PL cs.DB | Extensible Markup Language (XML) is a simple, very flexible text format
derived from SGML. Originally designed to meet the challenges of large-scale
electronic publishing, XML is also playing an increasingly important role in
the exchange of a wide variety of data on the Web and elsewhere. XPath language
is the resul... |
0710.4847 | Bayesian sequential change diagnosis | math.PR cs.IT math.IT math.ST stat.TH | Sequential change diagnosis is the joint problem of detection and
identification of a sudden and unobservable change in the distribution of a
random sequence. In this problem, the common probability law of a sequence of
i.i.d. random variables suddenly changes at some disorder time to one of
finitely many alternative... |
0710.4903 | Anonymous Networking amidst Eavesdroppers | cs.IT math.IT | The problem of security against timing based traffic analysis in wireless
networks is considered in this work. An analytical measure of anonymity in
eavesdropped networks is proposed using the information theoretic concept of
equivocation. For a physical layer with orthogonal transmitter directed
signaling, schedulin... |
0710.4905 | Distributed Source Coding in the Presence of Byzantine Sensors | cs.IT math.IT | The distributed source coding problem is considered when the sensors, or
encoders, are under Byzantine attack; that is, an unknown group of sensors have
been reprogrammed by a malicious intruder to undermine the reconstruction at
the fusion center. Three different forms of the problem are considered. The
first is a v... |
0710.4975 | Node discovery problem for a social network | cs.AI | Methods to solve a node discovery problem for a social network are presented.
Covert nodes refer to the nodes which are not observable directly. They
transmit the influence and affect the resulting collaborative activities among
the persons in a social network, but do not appear in the surveillance logs
which record ... |
0710.4982 | First to Market is not Everything: an Analysis of Preferential
Attachment with Fitness | math.PR cs.SI | In this paper, we provide a rigorous analysis of preferential attachment with
fitness, a random graph model introduced by Bianconi and Barabasi. Depending on
the shape of the fitness distribution, we observe three distinct phases: a
first-mover-advantage phase, a fit-get-richer phase and an innovation-pays-off
phase.... |
0710.4987 | Universal source coding over generalized complementary delivery networks | cs.IT math.IT | This paper deals with a universal coding problem for a certain kind of
multiterminal source coding network called a generalized complementary delivery
network. In this network, messages from multiple correlated sources are jointly
encoded, and each decoder has access to some of the messages to enable it to
reproduce ... |
0710.5002 | The entropy of keys derived from laser speckle | cs.CR cs.CV | Laser speckle has been proposed in a number of papers as a high-entropy
source of unpredictable bits for use in security applications. Bit strings
derived from speckle can be used for a variety of security purposes such as
identification, authentication, anti-counterfeiting, secure key storage, random
number generati... |
0710.5116 | Combining haplotypers | cs.LG cs.CE q-bio.QM | Statistically resolving the underlying haplotype pair for a genotype
measurement is an important intermediate step in gene mapping studies, and has
received much attention recently. Consequently, a variety of methods for this
problem have been developed. Different methods employ different statistical
models, and thus... |
0710.5144 | Forecasting for stationary binary time series | math.PR cs.IT math.IT | The forecasting problem for a stationary and ergodic binary time series
$\{X_n\}_{n=0}^{\infty}$ is to estimate the probability that $X_{n+1}=1$ based
on the observations $X_i$, $0\le i\le n$ without prior knowledge of the
distribution of the process $\{X_n\}$. It is known that this is not possible if
one estimates a... |
0710.5161 | Decomposable Subspaces, Linear Sections of Grassmann Varieties, and
Higher Weights of Grassmann Codes | math.AG cs.IT math.IT | Given a homogeneous component of an exterior algebra, we characterize those
subspaces in which every nonzero element is decomposable. In geometric terms,
this corresponds to characterizing the projective linear subvarieties of the
Grassmann variety with its Plucker embedding. When the base field is finite, we
conside... |
0710.5190 | Identifying statistical dependence in genomic sequences via mutual
information estimates | q-bio.GN cs.IT math.IT | Questions of understanding and quantifying the representation and amount of
information in organisms have become a central part of biological research, as
they potentially hold the key to fundamental advances. In this paper, we
demonstrate the use of information-theoretic tools for the task of identifying
segments of... |
0710.5194 | Rate-Constrained Wireless Networks with Fading Channels:
Interference-Limited and Noise-Limited Regimes | cs.IT math.IT | A network of $n$ wireless communication links is considered in a Rayleigh
fading environment. It is assumed that each link can be active and transmit
with a constant power $P$ or remain silent. The objective is to maximize the
number of active links such that each active link can transmit with a constant
rate $\lambd... |
0710.5230 | Generalized reliability-based syndrome decoding for LDPC codes | cs.IT math.IT | Aiming at bridging the gap between the maximum likelihood decoding (MLD) and
the suboptimal iterative decodings for short or medium length LDPC codes, we
present a generalized ordered statistic decoding (OSD) in the form of syndrome
decoding, to cascade with the belief propagation (BP) or enhanced min-sum
decoding. T... |
0710.5241 | Connection Between System Parameters and Localization Probability in
Network of Randomly Distributed Nodes | cs.NI cs.DM cs.IT math.IT | This article deals with localization probability in a network of randomly
distributed communication nodes contained in a bounded domain. A fraction of
the nodes denoted as L-nodes are assumed to have localization information while
the rest of the nodes denoted as NL nodes do not. The basic model assumes each
node has... |
0710.5333 | Neutrosophic Relational Data Model | cs.DB | In this paper, we present a generalization of the relational data model based
on interval neutrosophic set. 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 each relation ar... |
0710.5340 | Bounds on the Network Coding Capacity for Wireless Random Networks | cs.IT cs.NI math.IT | Recently, it has been shown that the max flow capacity can be achieved in a
multicast network using network coding. In this paper, we propose and analyze a
more realistic model for wireless random networks. We prove that the capacity
of network coding for this model is concentrated around the expected value of
its mi... |
0710.5376 | Broadcasting Correlated Gaussians | cs.IT math.IT | We consider the transmission of a memoryless bivariate Gaussian source over
an average-power-constrained one-to-two Gaussian broadcast channel. The
transmitter observes the source and describes it to the two receivers by means
of an average-power-constrained signal. Each receiver observes the transmitted
signal corru... |
0710.5382 | Some Reflections on the Task of Content Determination in the Context of
Multi-Document Summarization of Evolving Events | cs.CL | Despite its importance, the task of summarizing evolving events has received
small attention by researchers in the field of multi-document summariztion. In
a previous paper (Afantenos et al. 2007) we have presented a methodology for
the automatic summarization of documents, emitted by multiple sources, which
describe... |
0710.5386 | Acquisition of Information is Achieved by the Measurement Process in
Classical and Quantum Physics | quant-ph cs.IT hep-th math.IT | No consensus seems to exist as to what constitutes a measurement which is
still considered somewhat mysterious in many respects in quantum mechanics. At
successive stages mathematical theory of measure, metrology and measurement
theory tried to systematize this field but significant questions remain open
about the na... |
0710.5501 | Discriminated Belief Propagation | cs.IT cs.AI math.IT | Near optimal decoding of good error control codes is generally a difficult
task. However, for a certain type of (sufficiently) good codes an efficient
decoding algorithm with near optimal performance exists. These codes are
defined via a combination of constituent codes with low complexity trellis
representations. Th... |
0710.5512 | Risk Minimization and Optimal Derivative Design in a Principal Agent
Game | cs.CE | We consider the problem of Adverse Selection and optimal derivative design
within a Principal-Agent framework. The principal's income is exposed to
non-hedgeable risk factors arising, for instance, from weather or climate
phenomena. She evaluates her risk using a coherent and law invariant risk
measure and tries mini... |
0710.5547 | Code Similarity on High Level Programs | cs.CV cs.DS | This paper presents a new approach for code similarity on High Level
programs. Our technique is based on Fast Dynamic Time Warping, that builds a
warp path or points relation with local restrictions. The source code is
represented into Time Series using the operators inside programming languages
that makes possible t... |
0710.5640 | LDPC-Based Iterative Algorithm for Compression of Correlated Sources at
Rates Approaching the Slepian-Wolf Bound | cs.IT math.IT | This article proposes a novel iterative algorithm based on Low Density Parity
Check (LDPC) codes for compression of correlated sources at rates approaching
the Slepian-Wolf bound. The setup considered in the article looks at the
problem of compressing one source at a rate determined based on the knowledge
of the mean... |
0710.5666 | The Entropy Photon-Number Inequality and its Consequences | quant-ph cs.IT math.IT | Determining the ultimate classical information carrying capacity of
electromagnetic waves requires quantum-mechanical analysis to properly account
for the bosonic nature of these waves. Recent work has established capacity
theorems for bosonic single-user, broadcast, and wiretap channels, under the
presumption of two... |
0710.5758 | Grassmannian Beamforming for MIMO Amplify-and-Forward Relaying | cs.IT math.IT | In this paper, we derive the optimal transmitter/ receiver beamforming
vectors and relay weighting matrix for the multiple-input multiple-output
amplify-and-forward relay channel. The analysis is accomplished in two steps.
In the first step, the direct link between the transmitter (Tx) and receiver
(Rx) is ignored an... |
0710.5893 | Codes from Zero-divisors and Units in Group Rings | cs.IT math.IT | We describe and present a new construction method for codes using encodings
from group rings. They consist primarily of two types: zero-divisor and
unit-derived codes. Previous codes from group rings focused on ideals; for
example cyclic codes are ideals in the group ring over a cyclic group. The
fresh focus is on th... |
0711.0189 | A Tutorial on Spectral Clustering | cs.DS cs.LG | In recent years, spectral clustering has become one of the most popular
modern clustering algorithms. It is simple to implement, can be solved
efficiently by standard linear algebra software, and very often outperforms
traditional clustering algorithms such as the k-means algorithm. On the first
glance spectral clust... |
0711.0237 | Zero-rate feedback can achieve the empirical capacity | cs.IT math.IT | The utility of limited feedback for coding over an individual sequence of
DMCs is investigated. This study complements recent results showing how limited
or noisy feedback can boost the reliability of communication. A strategy with
fixed input distribution $P$ is given that asymptotically achieves rates
arbitrarily c... |
0711.0261 | Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes | cs.IT math.IT | A novel class of bit-flipping (BF) algorithms for decoding low-density
parity-check (LDPC) codes is presented. The proposed algorithms, which are
called gradient descent bit flipping (GDBF) algorithms, can be regarded as
simplified gradient descent algorithms. Based on gradient descent formulation,
the proposed algor... |
0711.0277 | Bandwidth Partitioning in Decentralized Wireless Networks | cs.IT math.IT | This paper addresses the following question, which is of interest in the
design of a multiuser decentralized network. Given a total system bandwidth of
W Hz and a fixed data rate constraint of R bps for each transmission, how many
frequency slots N of size W/N should the band be partitioned into in order to
maximize ... |
0711.0350 | Intermittent estimation of stationary time series | math.PR cs.IT math.IT | Let $\{X_n\}_{n=0}^{\infty}$ be a stationary real-valued time series with
unknown distribution. Our goal is to estimate the conditional expectation of
$X_{n+1}$ based on the observations $X_i$, $0\le i\le n$ in a strongly
consistent way. Bailey and Ryabko proved that this is not possible even for
ergodic binary time ... |
0711.0351 | Noise threshold for universality of 2-input gates | cs.IT cs.CC math.IT | Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are
universal for arbitrary computation (i.e. can compute any function with bounded
error), if all gates fail independently with probability epsilon and
epsilon<theta, where theta is roughly 8.856%.
We show that formulas built from gates with 2 input... |
0711.0366 | Shannon Theoretic Limits on Noisy Compressive Sampling | cs.IT math.IT | In this paper, we study the number of measurements required to recover a
sparse signal in ${\mathbb C}^M$ with $L$ non-zero coefficients from compressed
samples in the presence of noise. For a number of different recovery criteria,
we prove that $O(L)$ (an asymptotically linear multiple of $L$) measurements
are neces... |
0711.0367 | Nonparametric inference for ergodic, stationary time series | math.PR cs.IT math.IT | The setting is a stationary, ergodic time series. The challenge is to
construct a sequence of functions, each based on only finite segments of the
past, which together provide a strongly consistent estimator for the
conditional probability of the next observation, given the infinite past.
Ornstein gave such a constru... |
0711.0471 | Prediction for discrete time series | math.PR cs.IT math.IT | Let $\{X_n\}$ be a stationary and ergodic time series taking values from a
finite or countably infinite set ${\cal X}$. Assume that the distribution of
the process is otherwise unknown. We propose a sequence of stopping times
$\lambda_n$ along which we will be able to estimate the conditional probability
$P(X_{\lambd... |
0711.0472 | Order estimation of Markov chains | math.PR cs.IT math.IT | We describe estimators $\chi_n(X_0,X_1,...,X_n)$, which when applied to an
unknown stationary process taking values from a countable alphabet ${\cal X}$,
converge almost surely to $k$ in case the process is a $k$-th order Markov
chain and to infinity otherwise.
|
0711.0557 | Kerdock Codes for Limited Feedback Precoded MIMO Systems | cs.IT math.IT | A codebook based limited feedback strategy is a practical way to obtain
partial channel state information at the transmitter in a precoded
multiple-input multiple-output (MIMO) wireless system. Conventional codebook
designs use Grassmannian packing, equiangular frames, vector quantization, or
Fourier based constructi... |
0711.0574 | Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel
manipulators | cs.RO | This paper investigates the singular curves in the joint space of a family of
planar parallel manipulators. It focuses on special points, referred to as cusp
points, which may appear on these curves. Cusp points play an important role in
the kinematic behavior of parallel manipulators since they make possible a
nonsi... |
0711.0666 | Discriminative Phoneme Sequences Extraction for Non-Native Speaker's
Origin Classification | cs.CL | In this paper we present an automated method for the classification of the
origin of non-native speakers. The origin of non-native speakers could be
identified by a human listener based on the detection of typical pronunciations
for each nationality. Thus we suppose the existence of several phoneme
sequences that mig... |
0711.0694 | Performance Bounds for Lambda Policy Iteration and Application to the
Game of Tetris | cs.AI cs.RO | We consider the discrete-time infinite-horizon optimal control problem
formalized by Markov Decision Processes. We revisit the work of Bertsekas and
Ioffe, that introduced $\lambda$ Policy Iteration, a family of algorithms
parameterized by $\lambda$ that generalizes the standard algorithms Value
Iteration and Policy ... |
0711.0705 | Feedback Capacity of the Compound Channel | cs.IT math.IT | In this work we find the capacity of a compound finite-state channel with
time-invariant deterministic feedback. The model we consider involves the use
of fixed length block codes. Our achievability result includes a proof of the
existence of a universal decoder for the family of finite-state channels with
feedback. ... |
0711.0708 | A Rank-Metric Approach to Error Control in Random Network Coding | cs.IT math.IT | The problem of error control in random linear network coding is addressed
from a matrix perspective that is closely related to the subspace perspective
of K\"otter and Kschischang. A large class of constant-dimension subspace codes
is investigated. It is shown that codes in this class can be easily constructed
from r... |
0711.0711 | Information-Theoretic Security in Wireless Networks | cs.IT cs.CR math.IT | This paper summarizes recent contributions of the authors and their
co-workers in the area of information-theoretic security.
|
0711.0784 | Addendum to Research MMMCV; A Man/Microbio/Megabio/Computer Vision | cs.CV cs.CE | In October 2007, a Research Proposal for the University of Sydney, Australia,
the author suggested that biovie-physical phenomenon as `electrodynamic
dependant biological vision', is governed by relativistic quantum laws and
biovision. The phenomenon on the basis of `biovielectroluminescence', satisfies
man/microbio/... |
0711.0811 | Combined Acoustic and Pronunciation Modelling for Non-Native Speech
Recognition | cs.CL | In this paper, we present several adaptation methods for non-native speech
recognition. We have tested pronunciation modelling, MLLR and MAP non-native
pronunciation adaptation and HMM models retraining on the HIWIRE foreign
accented English speech database. The ``phonetic confusion'' scheme we have
developed consist... |
0711.1038 | Am\'elioration des Performances des Syst\`emes Automatiques de
Reconnaissance de la Parole pour la Parole Non Native | cs.CL | In this article, we present an approach for non native automatic speech
recognition (ASR). We propose two methods to adapt existing ASR systems to the
non-native accents. The first method is based on the modification of acoustic
models through integration of acoustic models from the mother tong. The
phonemes of the t... |
0711.1056 | Bounds on the Number of Iterations for Turbo-Like Ensembles over the
Binary Erasure Channe | cs.IT math.IT | This paper provides simple lower bounds on the number of iterations which is
required for successful message-passing decoding of some important families of
graph-based code ensembles (including low-density parity-check codes and
variations of repeat-accumulate codes). The transmission of the code ensembles
is assumed... |
0711.1161 | Joint Source-Channel Codes for MIMO Block Fading Channels | cs.IT math.IT | We consider transmission of a continuous amplitude source over an L-block
Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state
information is only available at the receiver. Since the channel is not
ergodic, Shannon's source-channel separation theorem becomes obsolete and the
optimal performance requi... |
0711.1295 | On the performance of Golden space-time trellis coded modulation over
MIMO block fading channels | cs.IT math.IT | The Golden space-time trellis coded modulation (GST-TCM) scheme was proposed
in \cite{Hong06} for a high rate $2\times 2$ multiple-input multiple-output
(MIMO) system over slow fading channels. In this letter, we present the
performance analysis of GST-TCM over block fading channels, where the channel
matrix is const... |
0711.1360 | Analytical approach to bit-string models of language evolution | physics.soc-ph cs.CL | A formulation of bit-string models of language evolution, based on
differential equations for the population speaking each language, is introduced
and preliminarily studied. Connections with replicator dynamics and diffusion
processes are pointed out. The stability of the dominance state, where most of
the population... |
0711.1383 | On Minimal Tree Realizations of Linear Codes | cs.IT math.IT | A tree decomposition of the coordinates of a code is a mapping from the
coordinate set to the set of vertices of a tree. A tree decomposition can be
extended to a tree realization, i.e., a cycle-free realization of the code on
the underlying tree, by specifying a state space at each edge of the tree, and
a local cons... |
0711.1401 | Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm | cs.NE cs.AI | The pace of progress in the fields of Evolutionary Computation and Machine
Learning is currently limited -- in the former field, by the improbability of
making advantageous extensions to evolutionary algorithms when their capacity
for adaptation is poorly understood, and in the latter by the difficulty of
finding eff... |
0711.1466 | Predicting relevant empty spots in social interaction | cs.AI | An empty spot refers to an empty hard-to-fill space which can be found in the
records of the social interaction, and is the clue to the persons in the
underlying social network who do not appear in the records. This contribution
addresses a problem to predict relevant empty spots in social interaction.
Homogeneous an... |
0711.1478 | A constructive Borel-Cantelli Lemma. Constructing orbits with required
statistical properties | math.CA cs.IT math.DS math.IT math.PR math.ST stat.TH | In the general context of computable metric spaces and computable measures we
prove a kind of constructive Borel-Cantelli lemma: given a sequence
(constructive in some way) of sets $A_{i}$ with effectively summable measures,
there are computable points which are not contained in infinitely many $A_{i}$.
As a conseq... |
0711.1565 | Channel Code Design with Causal Side Information at the Encoder | cs.IT math.IT | The problem of channel code design for the $M$-ary input AWGN channel with
additive $Q$-ary interference where the sequence of i.i.d. interference symbols
is known causally at the encoder is considered. The code design criterion at
high SNR is derived by defining a new distance measure between the input
symbols of th... |
0711.1573 | Outage-Efficient Downlink Transmission Without Transmit Channel State
Information | cs.IT math.IT | This paper investigates downlink transmission over a quasi-static fading
Gaussian broadcast channel (BC), to model delay-sensitive applications over
slowly time-varying fading channels. System performance is characterized by
outage achievable rate regions. In contrast to most previous work, here the
problem is studie... |
0711.1605 | Asymptotic Capacity of Wireless Ad Hoc Networks with Realistic Links
under a Honey Comb Topology | cs.IT math.IT | We consider the effects of Rayleigh fading and lognormal shadowing in the
physical interference model for all the successful transmissions of traffic
across the network. New bounds are derived for the capacity of a given random
ad hoc wireless network that reflect packet drop or capture probability of the
transmissio... |
0711.1765 | Kinematic calibration of orthoglide-type mechanisms | cs.RO | The paper proposes a novel calibration approach for the Orthoglide-type
mechanisms based on observations of the manipulator leg parallelism during
mo-tions between the prespecified test postures. It employs a low-cost
measuring system composed of standard comparator indicators attached to the
universal magnetic stand... |
0711.1766 | Achieving the Gaussian Rate-Distortion Function by Prediction | cs.IT math.IT | The "water-filling" solution for the quadratic rate-distortion function of a
stationary Gaussian source is given in terms of its power spectrum. This
formula naturally lends itself to a frequency domain "test-channel"
realization. We provide an alternative time-domain realization for the
rate-distortion function, bas... |
0711.1814 | Building Rules on Top of Ontologies for the Semantic Web with Inductive
Logic Programming | cs.AI cs.LG | Building rules on top of ontologies is the ultimate goal of the logical layer
of the Semantic Web. To this aim an ad-hoc mark-up language for this layer is
currently under discussion. It is intended to follow the tradition of hybrid
knowledge representation and reasoning systems such as $\mathcal{AL}$-log that
integr... |
0711.1890 | A Geometric Interpretation of Fading in Wireless Networks: Theory and
Applications | cs.IT math.IT | In wireless networks with random node distribution, the underlying point
process model and the channel fading process are usually considered separately.
A unified framework is introduced that permits the geometric characterization
of fading by incorporating the fading process into the point process model.
Concretely,... |
0711.1986 | Performance bounds and codes design criteria for channel decoding with
a-priori information | cs.IT math.IT | In this article we focus on the problem of channel decoding in presence of
a-priori information. In particular, assuming that the a-priori information
reliability is not perfectly estimated at the receiver, we derive a novel
analytical framework for evaluating the decoder's performance. It is derived
the important re... |
0711.2023 | Empirical Evaluation of Four Tensor Decomposition Algorithms | cs.LG cs.CL cs.IR | Higher-order tensor decompositions are analogous to the familiar Singular
Value Decomposition (SVD), but they transcend the limitations of matrices
(second-order tensors). SVD is a powerful tool that has achieved impressive
results in information retrieval, collaborative filtering, computational
linguistics, computat... |
0711.2050 | Two Families of Quantum Codes Derived from Cyclic Codes | cs.IT math.IT | We characterize the affine-invariant maximal extended cyclic codes. Then by
the CSS construction, we derive from these codes a family of pure quantum
codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes
is derived from the classical duadic codes. This answer an open problem asked
by Aly et ... |
0711.2058 | Computer Model of a "Sense of Humour". I. General Algorithm | q-bio.NC cs.AI | A computer model of a "sense of humour" is proposed. The humorous effect is
interpreted as a specific malfunction in the course of information processing
due to the need for the rapid deletion of the false version transmitted into
consciousness. The biological function of a sense of humour consists in
speeding up the... |
0711.2061 | Computer Model of a "Sense of Humour". II. Realization in Neural
Networks | q-bio.NC cs.AI | The computer realization of a "sense of humour" requires the creation of an
algorithm for solving the "linguistic problem", i.e. the problem of recognizing
a continuous sequence of polysemantic images. Such algorithm may be realized in
the Hopfield model of a neural network after its proper modification.
|
0711.2087 | Query Evaluation and Optimization in the Semantic Web | cs.DB cs.LO | We address the problem of answering Web ontology queries efficiently. An
ontology is formalized as a Deductive Ontology Base (DOB), a deductive database
that comprises the ontology's inference axioms and facts. A cost-based query
optimization technique for DOB is presented. A hybrid cost model is proposed to
estimate... |
0711.2102 | Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for
Some Distributions | cs.IT math.IT | A pattern of a sequence is a sequence of integer indices with each index
describing the order of first occurrence of the respective symbol in the
original sequence. In a recent paper, tight general bounds on the block entropy
of patterns of sequences generated by independent and identically distributed
(i.i.d.) sourc... |
0711.2104 | On the Information Rates of the Plenoptic Function | cs.IT cs.CV math.IT math.PR | The {\it plenoptic function} (Adelson and Bergen, 91) describes the visual
information available to an observer at any point in space and time. Samples of
the plenoptic function (POF) are seen in video and in general visual content,
and represent large amounts of information. In this paper we propose a
stochastic mod... |
0711.2116 | A numerical approach for 3D manufacturing tolerances synthesis | cs.CE | Making a product conform to the functional requirements indicated by the
customer suppose to be able to manage the manufacturing process chosen to
realise the parts. A simulation step is generally performed to verify that the
expected generated deviations fit with these requirements. It is then necessary
to assess th... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.