id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0801.0139 | Principles of the Concept-Oriented Data Model | cs.DB | In the paper a new approach to data representation and manipulation is
described, which is called the concept-oriented data model (CODM). It is
supposed that items represent data units, which are stored in concepts. A
concept is a combination of superconcepts, which determine the concept's
dimensionality or propertie... |
0801.0184 | The Existence of Strongly-MDS Convolutional Codes | math.OC cs.IT math.IT | It is known that maximum distance separable and maximum distance profile
convolutional codes exist over large enough finite fields of any characteristic
for all parameters $(n,k,\delta)$. It has been conjectured that the same is
true for convolutional codes that are strongly maximum distance separable.
Using methods ... |
0801.0209 | Effective symbolic dynamics, random points, statistical behavior,
complexity and entropy | math.DS cs.IT math.IT math.PR | We consider the dynamical behavior of Martin-L\"of random points in dynamical
systems over metric spaces with a computable dynamics and a computable
invariant measure. We use computable partitions to define a sort of effective
symbolic model for the dynamics. Through this construction we prove that such
points have t... |
0801.0232 | Does intelligence imply contradiction? | cs.AI cs.LO | Contradiction is often seen as a defect of intelligent systems and a
dangerous limitation on efficiency. In this paper we raise the question of
whether, on the contrary, it could be considered a key tool in increasing
intelligence in biological structures. A possible way of answering this
question in a mathematical c... |
0801.0249 | A mathematical formalism for agent-based modeling | cs.MA cs.DM math.CO | Many complex systems can be modeled as multiagent systems in which the
constituent entities (agents) interact with each other. The global dynamics of
such a system is determined by the nature of the local interactions among the
agents. Since it is difficult to formally analyze complex multiagent systems,
they are oft... |
0801.0253 | Toward a statistical mechanics of four letter words | q-bio.NC cs.CL physics.data-an physics.soc-ph | We consider words as a network of interacting letters, and approximate the
probability distribution of states taken on by this network. Despite the
intuition that the rules of English spelling are highly combinatorial (and
arbitrary), we find that maximum entropy models consistent with pairwise
correlations among let... |
0801.0275 | Estimating Signals with Finite Rate of Innovation from Noisy Samples: A
Stochastic Algorithm | stat.AP cs.IT math.IT | As an example of the recently-introduced concept of rate of innovation,
signals that are linear combinations of a finite number of Diracs per unit time
can be acquired by linear filtering followed by uniform sampling. However, in
reality, samples are rarely noiseless. In this paper, we introduce a novel
stochastic al... |
0801.0340 | Sum Rate Maximization using Linear Precoding and Decoding in the
Multiuser MIMO Downlink | cs.IT math.IT | We propose an algorithm to maximize the instantaneous sum data rate
transmitted by a base station in the downlink of a multiuser multiple-input,
multiple-output system. The transmitter and the receivers may each be equipped
with multiple antennas and each user may receive more than one data stream. We
show that maxim... |
0801.0341 | Exactness of Belief Propagation for Some Graphical Models with Loops | cond-mat.stat-mech cond-mat.other cs.AI cs.IT math.IT | It is well known that an arbitrary graphical model of statistical inference
defined on a tree, i.e. on a graph without loops, is solved exactly and
efficiently by an iterative Belief Propagation (BP) algorithm convergent to
unique minimum of the so-called Bethe free energy functional. For a general
graphical model on... |
0801.0352 | The price of certainty: "waterslide curves" and the gap to capacity | cs.IT math.IT | The classical problem of reliable point-to-point digital communication is to
achieve a low probability of error while keeping the rate high and the total
power consumption small. Traditional information-theoretic analysis uses
`waterfall' curves to convey the revolutionary idea that unboundedly low
probabilities of b... |
0801.0354 | Kolmogorov complexity in perspective | math.LO cs.CC cs.IT math.IT | We survey the diverse approaches to the notion of information content: from
Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov
complexity are presented namely, the mathematical notion of randomness (which
goes back to the 60's with the work of Martin-Lof, Schnorr, Chaitin, Levin),
and class... |
0801.0386 | Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch
h-index Robust to Scientospam | cs.DL cs.IR | What is the 'level of excellence' of a scientist and the real impact of
his/her work upon the scientific thinking and practising? How can we design a
fair, an unbiased metric -- and most importantly -- a metric robust to
manipulation?
|
0801.0390 | Staring at Economic Aggregators through Information Lenses | cs.IT cs.LG math.IT math.OC | It is hard to exaggerate the role of economic aggregators -- functions that
summarize numerous and / or heterogeneous data -- in economic models since the
early XX$^{th}$ century. In many cases, as witnessed by the pioneering works of
Cobb and Douglas, these functions were information quantities tailored to
economic ... |
0801.0426 | On the Relationship between Transmission Power and Capacity of an
Underwater Acoustic Communication Channel | cs.IT math.IT | The underwater acoustic channel is characterized by a path loss that depends
not only on the transmission distance, but also on the signal frequency. As a
consequence, transmission bandwidth depends on the transmission distance, a
feature that distinguishes an underwater acoustic system from a terrestrial
radio syste... |
0801.0452 | Sum Capacity of the Gaussian Interference Channel in the Low
Interference Regime | cs.IT math.IT | New upper bounds on the sum capacity of the two-user Gaussian interference
channel are derived. Using these bounds, it is shown that treating interference
as noise achieves the sum capacity if the interference levels are below certain
thresholds.
|
0801.0540 | Blind decoding of Linear Gaussian channels with ISI, capacity, error
exponent, universality | cs.IT math.IT | A new straightforward universal blind detection algorithm for linear Gaussian
channel with ISI is given. A new error exponent is derived, which is better
than Gallager's random coding error exponent.
|
0801.0581 | Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading
Channels at Low SNR | cs.IT math.IT | The capacity of a discrete-time memoryless channel, in which successive
symbols fade independently, and where the channel state information (CSI) is
neither available at the transmitter nor at the receiver, is considered at low
SNR. We derive a closed form expression of the optimal capacity-achieving input
distributi... |
0801.0597 | Distributed Power Allocation Strategies for Parallel Relay Networks | cs.IT math.IT | We consider a source-destination pair assisted by parallel regenerative
decode-and-forward relays operating in orthogonal channels. We investigate
distributed power allocation strategies for this system with limited channel
state information at the source and the relay nodes. We first propose a
distributed decision m... |
0801.0672 | On Multipath Fading Channels at High SNR | cs.IT math.IT | This paper studies the capacity of discrete-time multipath fading channels.
It is assumed that the number of paths is finite, i.e., that the channel output
is influenced by the present and by the L previous channel inputs. A
noncoherent channel model is considered where neither transmitter nor receiver
are cognizant ... |
0801.0678 | Implementation of perception and action at nanoscale | cs.RO cs.HC | Real time combination of nanosensors and nanoactuators with virtual reality
environment and multisensorial interfaces enable us to efficiently act and
perceive at nanoscale. Advanced manipulation of nanoobjects and new strategies
for scientific education are the key motivations. We have no existing intuitive
represen... |
0801.0701 | Adversarial Models and Resilient Schemes for Network Coding | cs.IT cs.DC cs.NI math.IT | In a recent paper, Jaggi et al. (INFOCOM 2007), presented a distributed
polynomial-time rate-optimal network-coding scheme that works in the presence
of Byzantine faults. We revisit their adversarial models and augment them with
three, arguably realistic, models. In each of the models, we present a
distributed scheme... |
0801.0714 | Regular Expression Subtyping for XML Query and Update Languages | cs.PL cs.DB | XML database query languages such as XQuery employ regular expression types
with structural subtyping. Subtyping systems typically have two presentations,
which should be equivalent: a declarative version in which the subsumption rule
may be used anywhere, and an algorithmic version in which the use of
subsumption is... |
0801.0756 | Distributed Source Coding for Interactive Function Computation | cs.IT math.IT | A two-terminal interactive distributed source coding problem with alternating
messages for function computation at both locations is studied. For any number
of messages, a computable characterization of the rate region is provided in
terms of single-letter information measures. While interaction is useless in
terms o... |
0801.0815 | Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation | cs.IT math.IT | The combination of source coding with decoder side-information (Wyner-Ziv
problem) and channel coding with encoder side-information (Gel'fand-Pinsker
problem) can be optimally solved using the separation principle. In this work
we show an alternative scheme for the quadratic-Gaussian case, which merges
source and cha... |
0801.0821 | Unified Quantum Convolutional Coding | quant-ph cs.IT math.IT | We outline a quantum convolutional coding technique for protecting a stream
of classical bits and qubits. Our goal is to provide a framework for designing
codes that approach the ``grandfather'' capacity of an entanglement-assisted
quantum channel for sending classical and quantum information simultaneously.
Our meth... |
0801.0830 | Evolution of central pattern generators for the control of a five-link
bipedal walking mechanism | cs.NE cs.RO | Central pattern generators (CPGs), with a basis is neurophysiological
studies, are a type of neural network for the generation of rhythmic motion.
While CPGs are being increasingly used in robot control, most applications are
hand-tuned for a specific task and it is acknowledged in the field that generic
methods and ... |
0801.0841 | Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number
Inequality | 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 and broadcast channels, under the presumption
of two minimum o... |
0801.0857 | Period-Different $m$-Sequences With At Most A Four-Valued Cross
Correlation | cs.IT cs.DM math.IT | In this paper, we follow the recent work of Helleseth, Kholosha, Johanssen
and Ness to study the cross correlation between an $m$-sequence of period
$2^m-1$ and the $d$-decimation of an $m$-sequence of shorter period $2^{n}-1$
for an even number $m=2n$. Assuming that $d$ satisfies $d(2^l+1)=2^i({\rm mod}
2^n-1)$ for ... |
0801.0931 | The Asymptotic Bit Error Probability of LDPC Codes for the Binary
Erasure Channel with Finite Iteration Number | cs.IT math.IT | We consider communication over the binary erasure channel (BEC) using
low-density parity-check (LDPC) code and belief propagation (BP) decoding. The
bit error probability for infinite block length is known by density evolution
and it is well known that a difference between the bit error probability at
finite iteratio... |
0801.0938 | Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network | cs.IT math.IT | We study two distinct, but overlapping, networks that operate at the same
time, space, and frequency. The first network consists of $n$ randomly
distributed \emph{primary users}, which form either an ad hoc network, or an
infrastructure-supported ad hoc network with $l$ additional base stations. The
second network co... |
0801.0969 | Pareto and Boltzmann-Gibbs behaviors in a deterministic multi-agent
system | q-fin.GN cond-mat.stat-mech cs.MA nlin.AO nlin.CD physics.comp-ph physics.soc-ph | A deterministic system of interacting agents is considered as a model for
economic dynamics. The dynamics of the system is described by a coupled map
lattice with near neighbor interactions. The evolution of each agent results
from the competition between two factors: the agent's own tendency to grow and
the environm... |
0801.1002 | Capacity Bounds for Peak-Constrained Multiantenna Wideband Channels | cs.IT math.IT | We derive bounds on the noncoherent capacity of a very general class of
multiple-input multiple-output channels that allow for selectivity in time and
frequency as well as for spatial correlation. The bounds apply to
peak-constrained inputs; they are explicit in the channel's scattering
function, are useful for a lar... |
0801.1060 | On the Period of a Periodic-Finite-Type Shift | cs.IT math.IT | Periodic-finite-type shifts (PFT's) form a class of sofic shifts that
strictly contains the class of shifts of finite type (SFT's). In this paper, we
investigate how the notion of "period" inherent in the definition of a PFT
causes it to differ from an SFT, and how the period influences the properties
of a PFT.
|
0801.1063 | Modeling Online Reviews with Multi-grain Topic Models | cs.IR cs.DB | In this paper we present a novel framework for extracting the ratable aspects
of objects from online user reviews. Extracting such aspects is an important
challenge in automatically mining product opinions from the web and in
generating opinion-based summaries of user reviews. Our models are based on
extensions to st... |
0801.1067 | The lowest-possible BER and FER for any discrete memoryless channel with
given capacity | cs.IT math.IT | We investigate properties of a channel coding scheme leading to the
minimum-possible frame error ratio when transmitting over a memoryless channel
with rate R>C. The results are compared to the well-known properties of a
channel coding scheme leading to minimum bit error ratio. It is concluded that
these two optimiza... |
0801.1126 | Concave Programming Upper Bounds on the Capacity of 2-D Constraints | cs.IT math.IT | The capacity of 1-D constraints is given by the entropy of a corresponding
stationary maxentropic Markov chain. Namely, the entropy is maximized over a
set of probability distributions, which is defined by some linear requirements.
In this paper, certain aspects of this characterization are extended to 2-D
constraint... |
0801.1136 | A Constrained Channel Coding Approach to Joint Communication and Channel
Estimation | cs.IT math.IT | A joint communication and channel state estimation problem is investigated,
in which reliable information transmission over a noisy channel, and
high-fidelity estimation of the channel state, are simultaneously sought. The
tradeoff between the achievable information rate and the estimation distortion
is quantified by... |
0801.1138 | An Addendum to "How Good is PSK for Peak-Limited Fading Channels in the
Low-SNR Regime?" | cs.IT math.IT | A proof is provided of the operational achievability of $R_\mathrm{rt}$ by
the recursive training scheme in \cite{zhang07:it}, for general wide-sense
stationary and ergodic Rayleigh fading processes.
|
0801.1141 | Coding Strategies for Noise-Free Relay Cascades with Half-Duplex
Constraint | cs.IT math.IT | Two types of noise-free relay cascades are investigated. Networks where a
source communicates with a distant receiver via a cascade of half-duplex
constrained relays, and networks where not only the source but also a single
relay node intends to transmit information to the same destination. We
introduce two relay cha... |
0801.1179 | Corpus sp{\'e}cialis{\'e} et ressource de sp{\'e}cialit{\'e} | cs.IR cs.CL | "Semantic Atlas" is a mathematic and statistic model to visualise word senses
according to relations between words. The model, that has been applied to
proximity relations from a corpus, has shown its ability to distinguish word
senses as the corpus' contributors comprehend them. We propose to use the model
and a spe... |
0801.1185 | Capacity of the Discrete-Time AWGN Channel Under Output Quantization | cs.IT math.IT | We investigate the limits of communication over the discrete-time Additive
White Gaussian Noise (AWGN) channel, when the channel output is quantized using
a small number of bits. We first provide a proof of our recent conjecture on
the optimality of a discrete input distribution in this scenario. Specifically,
we sho... |
0801.1208 | Hybrid Decoding of Finite Geometry LDPC Codes | cs.IT math.IT | For finite geometry low-density parity-check codes, heavy row and column
weights in their parity check matrix make the decoding with even Min-Sum (MS)
variants computationally expensive. To alleviate it, we present a class of
hybrid schemes by concatenating a parallel bit flipping (BF) variant with an
Min-Sum (MS) va... |
0801.1275 | Le terme et le concept : fondements d'une ontoterminologie | cs.AI | Most definitions of ontology, viewed as a "specification of a
conceptualization", agree on the fact that if an ontology can take different
forms, it necessarily includes a vocabulary of terms and some specification of
their meaning in relation to the domain's conceptualization. And as domain
knowledge is mainly conve... |
0801.1276 | On the guaranteed error correction capability of LDPC codes | cs.IT math.IT | We investigate the relation between the girth and the guaranteed error
correction capability of $\gamma$-left regular LDPC codes when decoded using
the bit flipping (serial and parallel) algorithms. A lower bound on the number
of variable nodes which expand by a factor of at least $3 \gamma/4$ is found
based on the M... |
0801.1282 | LDPC Codes Which Can Correct Three Errors Under Iterative Decoding | cs.IT math.IT | In this paper, we provide necessary and sufficient conditions for a
column-weight-three LDPC code to correct three errors when decoded using
Gallager A algorithm. We then provide a construction technique which results in
a code satisfying the above conditions. We also provide numerical assessment of
code performance ... |
0801.1306 | Capacity Bounds for the Gaussian Interference Channel | cs.IT math.IT | The capacity region of the two-user Gaussian Interference Channel (IC) is
studied. Three classes of channels are considered: weak, one-sided, and mixed
Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region
is obtained that outperforms previously known outer bounds. The sum capacity
for a cer... |
0801.1336 | Stream Computing | cs.AI | Stream computing is the use of multiple autonomic and parallel modules
together with integrative processors at a higher level of abstraction to embody
"intelligent" processing. The biological basis of this computing is sketched
and the matter of learning is examined.
|
0801.1364 | An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$ | cs.IT math.IT | The lattice $A_n^*$ is an important lattice because of its covering
properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an
algorithm to compute the nearest lattice point in $A_n^*$ that requires
$O(n\log{n})$ arithmetic operations. In this paper, we describe a new
algorithm. While the complexi... |
0801.1415 | The emerging field of language dynamics | cs.CL physics.soc-ph | A simple review by a linguist, citing many articles by physicists:
Quantitative methods, agent-based computer simulations, language dynamics,
language typology, historical linguistics
|
0801.1630 | Computational Solutions for Today's Navy | cs.MA cs.GL | New methods are being employed to meet the Navy's changing
software-development environment.
|
0801.1658 | Computational approach to the emergence and evolution of language -
evolutionary naming game model | physics.soc-ph cs.CL cs.MA | Computational modelling with multi-agent systems is becoming an important
technique of studying language evolution. We present a brief introduction into
this rapidly developing field, as well as our own contributions that include an
analysis of the evolutionary naming-game model. In this model communicating
agents, t... |
0801.1703 | The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated
Distortions | cs.IT math.IT | We characterize the rate-distortion function for zero-mean stationary
Gaussian sources under the MSE fidelity criterion and subject to the additional
constraint that the distortion is uncorrelated to the input. The solution is
given by two equations coupled through a single scalar parameter. This has a
structure simi... |
0801.1715 | On Breaching Enterprise Data Privacy Through Adversarial Information
Fusion | cs.DB cs.CR cs.OH | Data privacy is one of the key challenges faced by enterprises today.
Anonymization techniques address this problem by sanitizing sensitive data such
that individual privacy is preserved while allowing enterprises to maintain and
share sensitive data. However, existing work on this problem make inherent
assumptions a... |
0801.1718 | Achieving the Quadratic Gaussian Rate-Distortion Function for Source
Uncorrelated Distortions | cs.IT math.IT | We prove achievability of the recently characterized quadratic Gaussian
rate-distortion function (RDF) subject to the constraint that the distortion is
uncorrelated to the source. This result is based on shaped dithered lattice
quantization in the limit as the lattice dimension tends to infinity and holds
for all pos... |
0801.1736 | A Central Limit Theorem for the SNR at the Wiener Filter Output for
Large Dimensional Signals | cs.IT math.IT | Consider the quadratic form $\beta = {\bf y}^* ({\bf YY}^* + \rho {\bf
I})^{-1} {\bf y}$ where $\rho$ is a positive number, where ${\bf y}$ is a
random vector and ${\bf Y}$ is a $N \times K$ random matrix both having
independent elements with different variances, and where ${\bf y}$ and ${\bf
Y}$ are independent. Suc... |
0801.1883 | D-optimal Bayesian Interrogation for Parameter and Noise Identification
of Recurrent Neural Networks | cs.NE cs.IT math.IT | We introduce a novel online Bayesian method for the identification of a
family of noisy recurrent neural networks (RNNs). We develop Bayesian active
learning technique in order to optimize the interrogating stimuli given past
experiences. In particular, we consider the unknown parameters as stochastic
variables and u... |
0801.1988 | Online variants of the cross-entropy method | cs.LG | The cross-entropy method is a simple but efficient method for global
optimization. In this paper we provide two online variants of the basic CEM,
together with a proof of convergence.
|
0801.2034 | On the Boundedness of the Support of Optimal Input Measures for Rayleigh
Fading Channels | cs.IT math.IT | We consider transmission over a wireless multiple antenna communication
system operating in a Rayleigh flat fading environment with no channel state
information at the receiver and the transmitter with coherence time T=1. We
show that, subject to the average power constraint, the support of the capacity
achieving inp... |
0801.2069 | Factored Value Iteration Converges | cs.AI cs.LG | In this paper we propose a novel algorithm, factored value iteration (FVI),
for the approximate solution of factored Markov decision processes (fMDPs). The
traditional approximate value iteration algorithm is modified in two ways. For
one, the least-squares projection operator is modified so that it does not
increase... |
0801.2088 | Persistence of Wandering Intervals in Self-Similar Affine Interval
Exchange Transformations | math.DS cs.IT math.IT | In this article we prove that given a self-similar interval exchange
transformation T, whose associated matrix verifies a quite general algebraic
condition, there exists an affine interval exchange transformation with
wandering intervals that is semi-conjugated to it. That is, in this context the
existence of Denjoy ... |
0801.2144 | Non-Additive Quantum Codes from Goethals and Preparata Codes | quant-ph cs.IT math.IT | We extend the stabilizer formalism to a class of non-additive quantum codes
which are constructed from non-linear classical codes. As an example, we
present infinite families of non-additive codes which are derived from Goethals
and Preparata codes.
|
0801.2150 | Quantum Goethals-Preparata Codes | quant-ph cs.IT math.IT | We present a family of non-additive quantum codes based on Goethals and
Preparata codes with parameters ((2^m,2^{2^m-5m+1},8)). The dimension of these
codes is eight times higher than the dimension of the best known additive
quantum codes of equal length and minimum distance.
|
0801.2185 | New Outer Bounds on the Capacity Region of Gaussian Interference
Channels | cs.IT math.IT | Recent outer bounds on the capacity region of Gaussian interference channels
are generalized to $m$-user channels with $m>2$ and asymmetric powers and
crosstalk coefficients. The bounds are again shown to give the sum-rate
capacity for Gaussian interference channels with low powers and crosstalk
coefficients. The cap... |
0801.2233 | Analysis of Non-binary Hybrid LDPC Codes | cs.IT math.IT | In this paper, we analyse asymptotically a new class of LDPC codes called
Non-binary Hybrid LDPC codes, which has been recently introduced. We use
density evolution techniques to derive a stability condition for hybrid LDPC
codes, and prove their threshold behavior. We study this stability condition to
conclude on as... |
0801.2242 | Information Spectrum Approach to Second-Order Coding Rate in Channel
Coding | cs.IT math.IT | Second-order coding rate of channel coding is discussed for general sequence
of channels. The optimum second-order transmission rate with a constant error
constraint $\epsilon$ is obtained by using the information spectrum method. We
apply this result to the discrete memoryless case, the discrete memoryless case
with... |
0801.2323 | Decentralized Two-Hop Opportunistic Relaying With Limited Channel State
Information | cs.IT math.IT | A network consisting of $n$ source-destination pairs and $m$ relays is
considered. Focusing on the large system limit (large $n$), the throughput
scaling laws of two-hop relaying protocols are studied for Rayleigh fading
channels. It is shown that, under the practical constraints of single-user
encoding-decoding sche... |
0801.2378 | String algorithms and data structures | cs.DS cs.IR | The string-matching field has grown at a such complicated stage that various
issues come into play when studying it: data structure and algorithmic design,
database principles, compression techniques, architectural features, cache and
prefetching policies. The expertise nowadays required to design good string
data st... |
0801.2398 | Removing the Stiffness of Elastic Force from the Immersed Boundary
Method for the 2D Stokes Equations | cs.CE cs.NA math.NA | The Immersed Boundary method has evolved into one of the most useful
computational methods in studying fluid structure interaction. On the other
hand, the Immersed Boundary method is also known to suffer from a severe
timestep stability restriction when using an explicit time discretization. In
this paper, we propose... |
0801.2423 | Design and Analysis of LDGM-Based Codes for MSE Quantization | cs.IT math.IT | Approaching the 1.5329-dB shaping (granular) gain limit in mean-squared error
(MSE) quantization of R^n is important in a number of problems, notably
dirty-paper coding. For this purpose, we start with a binary low-density
generator-matrix (LDGM) code, and construct the quantization codebook by
periodically repeating... |
0801.2480 | Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective
Interference Channels | cs.IT cs.GT math.IT | This paper considers the maximization of information rates for the Gaussian
frequency-selective interference channel, subject to power and spectral mask
constraints on each link. To derive decentralized solutions that do not require
any cooperation among the users, the optimization problem is formulated as a
static n... |
0801.2510 | A Comparison of natural (english) and artificial (esperanto) languages.
A Multifractal method based analysis | cs.CL physics.data-an | We present a comparison of two english texts, written by Lewis Carroll, one
(Alice in wonderland) and the other (Through a looking glass), the former
translated into esperanto, in order to observe whether natural and artificial
languages significantly differ from each other. We construct one dimensional
time series l... |
0801.2588 | Coding and Decoding for the Dynamic Decode and Forward Relay Protocol | cs.IT math.IT | We study the Dynamic Decode and Forward (DDF) protocol for a single
half-duplex relay, single-antenna channel with quasi-static fading. The DDF
protocol is well-known and has been analyzed in terms of the
Diversity-Multiplexing Tradeoff (DMT) in the infinite block length limit. We
characterize the finite block length... |
0801.2618 | Survey of Technologies for Web Application Development | cs.SE cs.IR cs.NI | Web-based application developers face a dizzying array of platforms,
languages, frameworks and technical artifacts to choose from. We survey,
classify, and compare technologies supporting Web application development. The
classification is based on (1) foundational technologies; (2)integration with
other information s... |
0801.3024 | Construction of Z4-linear Reed-Muller codes | cs.IT math.IT | New quaternary Plotkin constructions are given and are used to obtain new
families of quaternary codes. The parameters of the obtained codes, such as the
length, the dimension and the minimum distance are studied. Using these
constructions new families of quaternary Reed-Muller codes are built with the
peculiarity th... |
0801.3042 | Performance Analysis of a Cross-layer Collaborative Beamforming Approach
in the Presence of Channel and Phase Errors | cs.IT math.IT | Collaborative beamforming enables nodes in a wireless network to transmit a
common message over long distances in an energy efficient fashion. However, the
process of making available the same message to all collaborating nodes
introduces delays. The authors recently proposed a MAC-PHY cross-layer scheme
that enables... |
0801.3046 | A model for reactive porous transport during re-wetting of hardened
concrete | cs.CE physics.flu-dyn | A mathematical model is developed that captures the transport of liquid water
in hardened concrete, as well as the chemical reactions that occur between the
imbibed water and the residual calcium silicate compounds residing in the
porous concrete matrix. The main hypothesis in this model is that the reaction
product ... |
0801.3048 | Human Heuristics for Autonomous Agents | cs.MA cs.HC cs.NI | We investigate the problem of autonomous agents processing pieces of
information that may be corrupted (tainted). Agents have the option of
contacting a central database for a reliable check of the status of the
message, but this procedure is costly and therefore should be used with
parsimony. Agents have to evaluate... |
0801.3049 | Spatial-Spectral Joint Detection for Wideband Spectrum Sensing in
Cognitive Radio Networks | cs.IT math.IT | Spectrum sensing is an essential functionality that enables cognitive radios
to detect spectral holes and opportunistically use under-utilized frequency
bands without causing harmful interference to primary networks. Since
individual cognitive radios might not be able to reliably detect weak primary
signals due to ch... |
0801.3073 | Large Deviations Analysis for the Detection of 2D Hidden Gauss-Markov
Random Fields Using Sensor Networks | cs.IT math.IT | The detection of hidden two-dimensional Gauss-Markov random fields using
sensor networks is considered. Under a conditional autoregressive model, the
error exponent for the Neyman-Pearson detector satisfying a fixed level
constraint is obtained using the large deviations principle. For a symmetric
first order autoreg... |
0801.3097 | Auction-based Resource Allocation for Multi-relay Asynchronous
Cooperative Networks | cs.IT math.IT | Resource allocation is considered for cooperative transmissions in
multiple-relay wireless networks. Two auction mechanisms, SNR auctions and
power auctions, are proposed to distributively coordinate the allocation of
power among multiple relays. In the SNR auction, a user chooses the relay with
the lowest weighted p... |
0801.3102 | Balancing transparency, efficiency and security in pervasive systems | cs.HC cs.IR | This chapter will survey pervasive computing with a look at how its
constraint for transparency affects issues of resource management and security.
The goal of pervasive computing is to render computing transparent, such that
computing resources are ubiquitously offered to the user and services are
proactively perfor... |
0801.3111 | Analysis of Estimation of Distribution Algorithms and Genetic Algorithms
on NK Landscapes | cs.NE cs.AI | This study analyzes performance of several genetic and evolutionary
algorithms on randomly generated NK fitness landscapes with various values of n
and k. A large number of NK problem instances are first generated for each n
and k, and the global optimum of each instance is obtained using the
branch-and-bound algorit... |
0801.3112 | The Two User Gaussian Compound Interference Channel | cs.IT math.IT | We introduce the two user finite state compound Gaussian interference channel
and characterize its capacity region to within one bit. The main contributions
involve both novel inner and outer bounds. The inner bound is multilevel
superposition coding, but the decoding of the levels is opportunistic,
depending on the ... |
0801.3113 | iBOA: The Incremental Bayesian Optimization Algorithm | cs.NE cs.AI | This paper proposes the incremental Bayesian optimization algorithm (iBOA),
which modifies standard BOA by removing the population of solutions and using
incremental updates of the Bayesian network. iBOA is shown to be able to learn
and exploit unrestricted Bayesian networks using incremental techniques for
updating ... |
0801.3147 | From k-SAT to k-CSP: Two Generalized Algorithms | cs.DS cs.AI cs.CC | Constraint satisfaction problems (CSPs) models many important intractable
NP-hard problems such as propositional satisfiability problem (SAT). Algorithms
with non-trivial upper bounds on running time for restricted SAT with bounded
clause length k (k-SAT) can be classified into three styles: DPLL-like,
PPSZ-like and ... |
0801.3199 | Descent methods for Nonnegative Matrix Factorization | cs.NA cs.IR math.OC | In this paper, we present several descent methods that can be applied to
nonnegative matrix factorization and we analyze a recently developped fast
block coordinate method called Rank-one Residue Iteration (RRI). We also give a
comparison of these different methods and show that the new block coordinate
method has be... |
0801.3209 | A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering
Strategies for Scheduling Problems | cs.NE cs.CE | This paper combines the idea of a hierarchical distributed genetic algorithm
with different inter-agent partnering strategies. Cascading clusters of
sub-populations are built from bottom up, with higher-level sub-populations
optimising larger parts of the problem. Hence higher-level sub-populations
search a larger se... |
0801.3239 | Online-concordance "Perekhresni stezhky" ("The Cross-Paths"), a novel by
Ivan Franko | cs.CL cs.DL | In the article, theoretical principles and practical realization for the
compilation of the concordance to "Perekhresni stezhky" ("The Cross-Paths"), a
novel by Ivan Franko, are described. Two forms for the context presentation are
proposed. The electronic version of this lexicographic work is available
online.
|
0801.3272 | Nonregenerative MIMO Relaying with Optimal Transmit Antenna Selection | cs.IT math.IT | We derive optimal SNR-based transmit antenna selection rules at the source
and relay for the nonregenerative half duplex MIMO relay channel. While antenna
selection is a suboptimal form of beamforming, it has the advantage that the
optimization is tractable and can be implemented with only a few bits of
feedback from... |
0801.3289 | Optimal Medium Access Control in Cognitive Radios: A Sequential Design
Approach | cs.IT cs.NI math.IT | The design of medium access control protocols for a cognitive user wishing to
opportunistically exploit frequency bands within parts of the radio spectrum
having multiple bands is considered. In the scenario under consideration, the
availability probability of each channel is unknown a priori to the cognitive
user. H... |
0801.3511 | Deterministic Design of Low-Density Parity-Check Codes for Binary
Erasure Channels | cs.IT math.IT | We propose a deterministic method to design irregular Low-Density
Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the
existing methods, which are based on the application of asymptomatic analysis
tools such as density evolution or Extrinsic Information Transfer (EXIT) charts
in an optimizatio... |
0801.3521 | Capacity of Sparse Wideband Channels with Partial Channel Feedback | cs.IT math.IT | This paper studies the ergodic capacity of wideband multipath channels with
limited feedback. Our work builds on recent results that have established the
possibility of significant capacity gains in the wideband/low-SNR regime when
there is perfect channel state information (CSI) at the transmitter.
Furthermore, the ... |
0801.3526 | Quantized Multimode Precoding in Spatially Correlated Multi-Antenna
Channels | cs.IT math.IT | Multimode precoding, where the number of independent data-streams is adapted
optimally, can be used to maximize the achievable throughput in multi-antenna
communication systems. Motivated by standardization efforts embraced by the
industry, the focus of this work is on systematic precoder design with
realistic assump... |
0801.3539 | On the Effects of Idiotypic Interactions for Recommendation Communities
in Artificial Immune Systems | cs.NE cs.AI | It has previously been shown that a recommender based on immune system
idiotypic principles can out perform one based on correlation alone. This paper
reports the results of work in progress, where we undertake some investigations
into the nature of this beneficial effect. The initial findings are that the
immune sys... |
0801.3547 | A Recommender System based on the Immune Network | cs.NE cs.AI | The immune system is a complex biological system with a highly distributed,
adaptive and self-organising nature. This paper presents an artificial immune
system (AIS) that exploits some of these characteristics and is applied to the
task of film recommendation by collaborative filtering (CF). Natural evolution
and in... |
0801.3549 | The Danger Theory and Its Application to Artificial Immune Systems | cs.NE cs.AI cs.CR | Over the last decade, a new idea challenging the classical self-non-self
viewpoint has become popular amongst immunologists. It is called the Danger
Theory. In this conceptual paper, we look at this theory from the perspective
of Artificial Immune System practitioners. An overview of the Danger Theory is
presented wi... |
0801.3550 | Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary
Algorithm | cs.NE cs.AI | This paper combines the idea of a hierarchical distributed genetic algorithm
with different inter-agent partnering strategies. Cascading clusters of
sub-populations are built from bottom up, with higher-level sub-populations
optimising larger parts of the problem. Hence higher-level sub-populations
search a larger se... |
0801.3640 | Energy Efficiency in Multi-Hop CDMA Networks: a Game Theoretic Analysis
Considering Operating Costs | cs.IT math.IT | A game-theoretic analysis is used to study the effects of receiver choice and
transmit power on the energy efficiency of multi-hop networks in which the
nodes communicate using Direct-Sequence Code Division Multiple Access
(DS-CDMA). A Nash equilibrium of the game in which the network nodes can choose
their receivers... |
0801.3654 | A path following algorithm for the graph matching problem | cs.CV cs.DM | We propose a convex-concave programming approach for the labeled weighted
graph matching problem. The convex-concave programming formulation is obtained
by rewriting the weighted graph matching problem as a least-square problem on
the set of permutation matrices and relaxing it to two different optimization
problems:... |
0801.3702 | Joint source and channel coding for MIMO systems: Is it better to be
robust or quick? | cs.IT math.IT | We develop a framework to optimize the tradeoff between diversity,
multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We
first focus on the diversity-multiplexing tradeoff in MIMO systems, and develop
analytical results to minimize distortion of a vector quantizer concatenated
with a space-tim... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.