id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0704.0046 | A limit relation for entropy and channel capacity per unit cost | quant-ph cs.IT math.IT | In a quantum mechanical model, Diosi, Feldmann and Kosloff arrived at a
conjecture stating that the limit of the entropy of certain mixtures is the
relative entropy as system size goes to infinity. The conjecture is proven in
this paper for density matrices. The first proof is analytic and uses the
quantum law of lar... |
0704.0047 | Intelligent location of simultaneously active acoustic emission sources:
Part I | cs.NE cs.AI | The intelligent acoustic emission locator is described in Part I, while Part
II discusses blind source separation, time delay estimation and location of two
simultaneously active continuous acoustic emission sources.
The location of acoustic emission on complicated aircraft frame structures is
a difficult problem o... |
0704.0050 | Intelligent location of simultaneously active acoustic emission sources:
Part II | cs.NE cs.AI | Part I describes an intelligent acoustic emission locator, while Part II
discusses blind source separation, time delay estimation and location of two
continuous acoustic emission sources.
Acoustic emission (AE) analysis is used for characterization and location of
developing defects in materials. AE sources often g... |
0704.0090 | Real Options for Project Schedules (ROPS) | cs.CE cond-mat.stat-mech cs.MS cs.NA physics.data-an | Real Options for Project Schedules (ROPS) has three recursive
sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA)
optimization shell optimizes parameters of strategic Plans containing multiple
Projects containing ordered Tasks. A middle shell samples probability
distributions of durations of Tas... |
0704.0098 | Sparsely-spread CDMA - a statistical mechanics based analysis | cs.IT math.IT | Sparse Code Division Multiple Access (CDMA), a variation on the standard CDMA
method in which the spreading (signature) matrix contains only a relatively
small number of non-zero elements, is presented and analysed using methods of
statistical physics. The analysis provides results on the performance of
maximum likel... |
0704.0217 | Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding
Matrix | cs.IT math.IT | Given a multiple-input multiple-output (MIMO) channel, feedback from the
receiver can be used to specify a transmit precoding matrix, which selectively
activates the strongest channel modes. Here we analyze the performance of
Random Vector Quantization (RVQ), in which the precoding matrix is selected
from a random co... |
0704.0282 | On Punctured Pragmatic Space-Time Codes in Block Fading Channel | cs.IT cs.CC math.IT | This paper considers the use of punctured convolutional codes to obtain
pragmatic space-time trellis codes over block-fading channel. We show that good
performance can be achieved even when puncturation is adopted and that we can
still employ the same Viterbi decoder of the convolutional mother code by using
approxim... |
0704.0304 | The World as Evolving Information | cs.IT cs.AI math.IT q-bio.PE | This paper discusses the benefits of describing the world as information,
especially in the study of the evolution of life and cognition. Traditional
studies encounter problems because it is difficult to describe life and
cognition in terms of matter and energy, since their laws are valid only at the
physical scale. ... |
0704.0361 | Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo
Codes | cs.IT math.IT | It has been observed that particular rate-1/2 partially systematic parallel
concatenated convolutional codes (PCCCs) can achieve a lower error floor than
that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can
only be identified by means of an exhaustive search, whilst convergence towards
low ... |
0704.0499 | Optimal Routing for Decode-and-Forward based Cooperation in Wireless
Networks | cs.IT math.IT | We investigate cooperative wireless relay networks in which the nodes can
help each other in data transmission. We study different coding strategies in
the single-source single-destination network with many relay nodes. Given the
myriad of ways in which nodes can cooperate, there is a natural routing
problem, i.e., d... |
0704.0528 | Many-to-One Throughput Capacity of IEEE 802.11 Multi-hop Wireless
Networks | cs.NI cs.IT math.IT | This paper investigates the many-to-one throughput capacity (and by symmetry,
one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has
generally been assumed in prior studies that the many-to-one throughput
capacity is upper-bounded by the link capacity L. Throughput capacity L is not
achievable und... |
0704.0540 | On the Achievable Rate Regions for Interference Channels with Degraded
Message Sets | cs.IT math.IT | The interference channel with degraded message sets (IC-DMS) refers to a
communication model in which two senders attempt to communicate with their
respective receivers simultaneously through a common medium, and one of the
senders has complete and a priori (non-causal) knowledge about the message
being transmitted b... |
0704.0590 | A Low Complexity Algorithm and Architecture for Systematic Encoding of
Hermitian Codes | cs.IT math.IT | We present an algorithm for systematic encoding of Hermitian codes. For a
Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time
complexity of O(q^2) and is suitable for VLSI implementation. The encoder
architecture uses as main blocks q varying-rate Reed-Solomon encoders and
achieves a space... |
0704.0671 | Learning from compressed observations | cs.IT cs.LG math.IT | The problem of statistical learning is to construct a predictor of a random
variable $Y$ as a function of a related random variable $X$ on the basis of an
i.i.d. training sample from the joint distribution of $(X,Y)$. Allowable
predictors are drawn from some specified class, and the goal is to approach
asymptotically... |
0704.0802 | Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection | cs.IT math.IT | This paper develops a contention-based opportunistic feedback technique
towards relay selection in a dense wireless network. This technique enables the
forwarding of additional parity information from the selected relay to the
destination. For a given network, the effects of varying key parameters such as
the feedbac... |
0704.0805 | Opportunistic Relay Selection with Limited Feedback | cs.IT math.IT | It has been shown that a decentralized relay selection protocol based on
opportunistic feedback from the relays yields good throughput performance in
dense wireless networks. This selection strategy supports a hybrid-ARQ
transmission approach where relays forward parity information to the
destination in the event of ... |
0704.0831 | On packet lengths and overhead for random linear coding over the erasure
channel | cs.IT math.IT | We assess the practicality of random network coding by illuminating the issue
of overhead and considering it in conjunction with increasingly long packets
sent over the erasure channel. We show that the transmission of increasingly
long packets, consisting of either of an increasing number of symbols per
packet or an... |
0704.0838 | Universal Source Coding for Monotonic and Fast Decaying Monotonic
Distributions | cs.IT math.IT | We study universal compression of sequences generated by monotonic
distributions. We show that for a monotonic distribution over an alphabet of
size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bits,
where $n$ is the coded sequence length, as long as $k = o(n^{1/3})$. Otherwise,
for $k = O(n)$... |
0704.0954 | Sensor Networks with Random Links: Topology Design for Distributed
Consensus | cs.IT cs.LG math.IT | In a sensor network, in practice, the communication among sensors is subject
to:(1) errors or failures at random times; (3) costs; and(2) constraints since
sensors and networks operate under scarce resources, such as power, data rate,
or communication. The signal-to-noise ratio (SNR) is usually a main factor in
deter... |
0704.0967 | Cross-Layer Optimization of MIMO-Based Mesh Networks with Gaussian
Vector Broadcast Channels | cs.IT cs.AR math.IT | MIMO technology is one of the most significant advances in the past decade to
increase channel capacity and has a great potential to improve network capacity
for mesh networks. In a MIMO-based mesh network, the links outgoing from each
node sharing the common communication spectrum can be modeled as a Gaussian
vector... |
0704.0985 | Architecture for Pseudo Acausal Evolvable Embedded Systems | cs.NE cs.AI | Advances in semiconductor technology are contributing to the increasing
complexity in the design of embedded systems. Architectures with novel
techniques such as evolvable nature and autonomous behavior have engrossed lot
of attention. This paper demonstrates conceptually evolvable embedded systems
can be characteriz... |
0704.1020 | The on-line shortest path problem under partial monitoring | cs.LG cs.SC | The on-line shortest path problem is considered under various models of
partial monitoring. Given a weighted directed acyclic graph whose edge weights
can change in an arbitrary (adversarial) way, a decision maker has to choose in
each round of a game a path between two distinguished vertices such that the
loss of th... |
0704.1028 | A neural network approach to ordinal regression | cs.LG cs.AI cs.NE | Ordinal regression is an important type of learning, which has properties of
both classification and regression. Here we describe a simple and effective
approach to adapt a traditional neural network to learn ordinal categories. Our
approach is a generalization of the perceptron method for ordinal regression.
On seve... |
0704.1043 | On the Kolmogorov-Chaitin Complexity for short sequences | cs.CC cs.IT math.IT | A drawback of Kolmogorov-Chaitin complexity (K) as a function from s to the
shortest program producing s is its noncomputability which limits its range of
applicability. Moreover, when strings are short, the dependence of K on a
particular universal Turing machine U can be arbitrary. In practice one can
approximate i... |
0704.1070 | Differential Diversity Reception of MDPSK over Independent Rayleigh
Channels with Nonidentical Branch Statistics and Asymmetric Fading Spectrum | cs.IT cs.PF math.IT | This paper is concerned with optimum diversity receiver structure and its
performance analysis of differential phase shift keying (DPSK) with
differential detection over nonselective, independent, nonidentically
distributed, Rayleigh fading channels. The fading process in each branch is
assumed to have an arbitrary D... |
0704.1158 | Novelty and Collective Attention | cs.CY cs.IR physics.soc-ph | The subject of collective attention is central to an information age where
millions of people are inundated with daily messages. It is thus of interest to
understand how attention to novel items propagates and eventually fades among
large populations. We have analyzed the dynamics of collective attention among
one mi... |
0704.1196 | Novel algorithm to calculate hypervolume indicator of Pareto
approximation set | cs.CG cs.NE | Hypervolume indicator is a commonly accepted quality measure for comparing
Pareto approximation set generated by multi-objective optimizers. The best
known algorithm to calculate it for $n$ points in $d$-dimensional space has a
run time of $O(n^{d/2})$ with special data structures. This paper presents a
recursive, ve... |
0704.1198 | A Doubly Distributed Genetic Algorithm for Network Coding | cs.NE cs.NI | We present a genetic algorithm which is distributed in two novel ways: along
genotype and temporal axes. Our algorithm first distributes, for every member
of the population, a subset of the genotype to each network node, rather than a
subset of the population to each. This genotype distribution is shown to offer
a si... |
0704.1267 | Text Line Segmentation of Historical Documents: a Survey | cs.CV | There is a huge amount of historical documents in libraries and in various
National Archives that have not been exploited electronically. Although
automatic reading of complete pages remains, in most cases, a long-term
objective, tasks such as word spotting, text/image alignment, authentication
and extraction of spec... |
0704.1274 | Parametric Learning and Monte Carlo Optimization | cs.LG | This paper uncovers and explores the close relationship between Monte Carlo
Optimization of a parametrized integral (MCO), Parametric machine-Learning
(PL), and `blackbox' or `oracle'-based optimization (BO). We make four
contributions. First, we prove that MCO is mathematically identical to a broad
class of PL probl... |
0704.1308 | Antenna Combining for the MIMO Downlink Channel | cs.IT math.IT | A multiple antenna downlink channel where limited channel feedback is
available to the transmitter is considered. In a vector downlink channel
(single antenna at each receiver), the transmit antenna array can be used to
transmit separate data streams to multiple receivers only if the transmitter
has very accurate cha... |
0704.1317 | Low Density Lattice Codes | cs.IT math.IT | Low density lattice codes (LDLC) are novel lattice codes that can be decoded
efficiently and approach the capacity of the additive white Gaussian noise
(AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional
Euclidean space as a linear transformation of a corresponding integer message
vector b... |
0704.1353 | Supporting Knowledge and Expertise Finding within Australia's Defence
Science and Technology Organisation | cs.OH cs.DB cs.DL cs.HC | This paper reports on work aimed at supporting knowledge and expertise
finding within a large Research and Development (R&D) organisation. The paper
first discusses the nature of knowledge important to R&D organisations and
presents a prototype information system developed to support knowledge and
expertise finding. ... |
0704.1358 | Distance preserving mappings from ternary vectors to permutations | cs.DM cs.IT math.IT | Distance-preserving mappings (DPMs) are mappings from the set of all q-ary
vectors of a fixed length to the set of permutations of the same or longer
length such that every two distinct vectors are mapped to permutations with the
same or even larger Hamming distance than that of the vectors. In this paper,
we propose... |
0704.1394 | Calculating Valid Domains for BDD-Based Interactive Configuration | cs.AI | In these notes we formally describe the functionality of Calculating Valid
Domains from the BDD representing the solution space of valid configurations.
The formalization is largely based on the CLab configuration framework.
|
0704.1409 | Preconditioned Temporal Difference Learning | cs.LG cs.AI | This paper has been withdrawn by the author. This draft is withdrawn for its
poor quality in english, unfortunately produced by the author when he was just
starting his science route. Look at the ICML version instead:
http://icml2008.cs.helsinki.fi/papers/111.pdf
|
0704.1411 | Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary
Codes | cs.IT math.IT | Most design approaches for trellis-coded quantization take advantage of the
duality of trellis-coded quantization with trellis-coded modulation, and use
the same empirically-found convolutional codes to label the trellis branches.
This letter presents an alternative approach that instead takes advantage of
maximum-Ha... |
0704.1455 | A Better Good-Turing Estimator for Sequence Probabilities | cs.IT math.IT | We consider the problem of estimating the probability of an observed string
drawn i.i.d. from an unknown distribution. The key feature of our study is that
the length of the observed string is assumed to be of the same order as the
size of the underlying alphabet. In this setting, many letters are unseen and
the empi... |
0704.1524 | GLRT-Optimal Noncoherent Lattice Decoding | cs.IT math.IT | This paper presents new low-complexity lattice-decoding algorithms for
noncoherent block detection of QAM and PAM signals over complex-valued fading
channels. The algorithms are optimal in terms of the generalized likelihood
ratio test (GLRT). The computational complexity is polynomial in the block
length; making GLR... |
0704.1675 | Exploiting Social Annotation for Automatic Resource Discovery | cs.AI cs.CY cs.DL | Information integration applications, such as mediators or mashups, that
require access to information resources currently rely on users manually
discovering and integrating them in the application. Manual resource discovery
is a slow process, requiring the user to sift through results obtained via
keyword-based sear... |
0704.1676 | Personalizing Image Search Results on Flickr | cs.IR cs.AI cs.CY cs.DL cs.HC | The social media site Flickr allows users to upload their photos, annotate
them with tags, submit them to groups, and also to form social networks by
adding other users as contacts. Flickr offers multiple ways of browsing or
searching it. One option is tag search, which returns all images tagged with a
specific keywo... |
0704.1709 | Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen | stat.AP cs.NE | Nous montrons comment il est possible d'utiliser l'algorithme d'auto
organisation de Kohonen pour traiter des donn\'ees avec valeurs manquantes et
estimer ces derni\`eres. Apr\`es un rappel m\'ethodologique, nous illustrons
notre propos \`a partir de trois applications \`a des donn\'ees r\'eelles.
-----
We show h... |
0704.1751 | Information Theoretic Proofs of Entropy Power Inequalities | cs.IT math.IT | While most useful information theoretic inequalities can be deduced from the
basic properties of entropy or mutual information, up to now Shannon's entropy
power inequality (EPI) is an exception: Existing information theoretic proofs
of the EPI hinge on representations of differential entropy using either Fisher
info... |
0704.1768 | Assessment and Propagation of Input Uncertainty in Tree-based Option
Pricing Models | cs.CE cs.GT | This paper aims to provide a practical example on the assessment and
propagation of input uncertainty for option pricing when using tree-based
methods. Input uncertainty is propagated into output uncertainty, reflecting
that option prices are as unknown as the inputs they are based on. Option
pricing formulas are too... |
0704.1783 | Unicast and Multicast Qos Routing with Soft Constraint Logic Programming | cs.LO cs.AI cs.NI | We present a formal model to represent and solve the unicast/multicast
routing problem in networks with Quality of Service (QoS) requirements. To
attain this, first we translate the network adapting it to a weighted graph
(unicast) or and-or graph (multicast), where the weight on a connector
corresponds to the multid... |
0704.1818 | Low-density graph codes that are optimal for source/channel coding and
binning | cs.IT math.IT | We describe and analyze the joint source/channel coding properties of a class
of sparse graphical codes based on compounding a low-density generator matrix
(LDGM) code with a low-density parity check (LDPC) code. Our first pair of
theorems establish that there exist codes from this ensemble, with all degrees
remainin... |
0704.1873 | An Achievable Rate Region for Interference Channels with Conferencing | cs.IT math.IT | In this paper, we propose an achievable rate region for discrete memoryless
interference channels with conferencing at the transmitter side. We employ
superposition block Markov encoding, combined with simultaneous superposition
coding, dirty paper coding, and random binning to obtain the achievable rate
region. We s... |
0704.1925 | Blind Identification of Distributed Antenna Systems with Multiple
Carrier Frequency Offsets | cs.IT math.IT | In spatially distributed multiuser antenna systems, the received signal
contains multiple carrier-frequency offsets (CFOs) arising from mismatch
between the oscillators of transmitters and receivers. This results in a
time-varying rotation of the data constellation, which needs to be compensated
at the receiver befor... |
0704.2010 | A study of structural properties on profiles HMMs | cs.AI | Motivation: Profile hidden Markov Models (pHMMs) are a popular and very
useful tool in the detection of the remote homologue protein families.
Unfortunately, their performance is not always satisfactory when proteins are
in the 'twilight zone'. We present HMMER-STRUCT, a model construction algorithm
and tool that tri... |
0704.2014 | Extensive Games with Possibly Unaware Players | cs.GT cs.MA | Standard game theory assumes that the structure of the game is common
knowledge among players. We relax this assumption by considering extensive
games where agents may be unaware of the complete structure of the game. In
particular, they may not be aware of moves that they and other agents can make.
We show how such ... |
0704.2017 | Large System Analysis of Game-Theoretic Power Control in UWB Wireless
Networks with Rake Receivers | cs.IT cs.GT math.IT | This paper studies the performance of partial-Rake (PRake) receivers in
impulse-radio ultrawideband wireless networks when an energy-efficient power
control scheme is adopted. Due to the large bandwidth of the system, the
multipath channel is assumed to be frequency-selective. By using noncooperative
game-theoretic m... |
0704.2083 | Introduction to Arabic Speech Recognition Using CMUSphinx System | cs.CL cs.AI | In this paper Arabic was investigated from the speech recognition problem
point of view. We propose a novel approach to build an Arabic Automated Speech
Recognition System (ASR). This system is based on the open source CMU Sphinx-4,
from the Carnegie Mellon University. CMU Sphinx is a large-vocabulary;
speaker-indepe... |
0704.2092 | A Note on the Inapproximability of Correlation Clustering | cs.LG cs.DS | We consider inapproximability of the correlation clustering problem defined
as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+"
(similar) or "-" (dissimilar), correlation clustering seeks to partition the
vertices into clusters so that the number of pairs correctly (resp.
incorrectly) classifi... |
0704.2201 | Arabic Speech Recognition System using CMU-Sphinx4 | cs.CL cs.AI | In this paper we present the creation of an Arabic version of Automated
Speech Recognition System (ASR). This system is based on the open source
Sphinx-4, from the Carnegie Mellon University. Which is a speech recognition
system based on discrete hidden Markov models (HMMs). We investigate the
changes that must be ma... |
0704.2258 | On the Hardness of Approximating Stopping and Trapping Sets in LDPC
Codes | cs.IT math.IT | We prove that approximating the size of stopping and trapping sets in Tanner
graphs of linear block codes, and more restrictively, the class of low-density
parity-check (LDPC) codes, is NP-hard. The ramifications of our findings are
that methods used for estimating the height of the error-floor of moderate- and
long-... |
0704.2259 | The Wiretap Channel with Feedback: Encryption over the Channel | cs.IT cs.CR math.IT | In this work, the critical role of noisy feedback in enhancing the secrecy
capacity of the wiretap channel is established. Unlike previous works, where a
noiseless public discussion channel is used for feedback, the feed-forward and
feedback signals share the same noisy channel in the present model. Quite
interesting... |
0704.2353 | Scaling Laws of Cognitive Networks | cs.IT math.IT | We consider a cognitive network consisting of n random pairs of cognitive
transmitters and receivers communicating simultaneously in the presence of
multiple primary users. Of interest is how the maximum throughput achieved by
the cognitive users scales with n. Furthermore, how far these users must be
from a primary ... |
0704.2375 | Power control algorithms for CDMA networks based on large system
analysis | cs.IT math.IT | Power control is a fundamental task accomplished in any wireless cellular
network; its aim is to set the transmit power of any mobile terminal, so that
each user is able to achieve its own target SINR. While conventional power
control algorithms require knowledge of a number of parameters of the signal of
interest an... |
0704.2383 | Power control and receiver design for energy efficiency in multipath
CDMA channels with bandlimited waveforms | cs.IT math.IT | This paper is focused on the cross-layer design problem of joint multiuser
detection and power control for energy-efficiency optimization in a wireless
data network through a game-theoretic approach. Building on work of Meshkati,
et al., wherein the tools of game-theory are used in order to achieve
energy-efficiency ... |
0704.2386 | Bounded Pushdown dimension vs Lempel Ziv information density | cs.CC cs.IT math.IT | In this paper we introduce a variant of pushdown dimension called bounded
pushdown (BPD) dimension, that measures the density of information contained in
a sequence, relative to a BPD automata, i.e. a finite state machine equipped
with an extra infinite memory stack, with the additional requirement that every
input s... |
0704.2452 | Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels | cs.IT math.IT | On a fading channel with no channel state information at the receiver,
calculating true log-likelihood ratios (LLR) is complicated. Existing work
assume that the power of the additive noise is known and use the expected value
of the fading gain in a linear function of the channel output to find
approximate LLRs. In t... |
0704.2475 | Physical Layer Network Coding | cs.IT math.IT | A main distinguishing feature of a wireless network compared with a wired
network is its broadcast nature, in which the signal transmitted by a node may
reach several other nodes, and a node may receive signals from several other
nodes simultaneously. Rather than a blessing, this feature is treated more as
an interfe... |
0704.2505 | Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity | cs.IT cs.DM math.IT | "Extended Clifford algebras" are introduced as a means to obtain low ML
decoding complexity space-time block codes. Using left regular matrix
representations of two specific classes of extended Clifford algebras, two
systematic algebraic constructions of full diversity Distributed Space-Time
Codes (DSTCs) are provide... |
0704.2507 | STBCs from Representation of Extended Clifford Algebras | cs.IT cs.DM math.IT | A set of sufficient conditions to construct $\lambda$-real symbol Maximum
Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al.
STBCs satisfying these sufficient conditions were named as Clifford Unitary
Weight (CUW) codes. In this paper, the maximal rate (as measured in complex
symbols per c... |
0704.2509 | Signal Set Design for Full-Diversity Low-Decoding-Complexity
Differential Scaled-Unitary STBCs | cs.IT math.IT | The problem of designing high rate, full diversity noncoherent space-time
block codes (STBCs) with low encoding and decoding complexity is addressed.
First, the notion of $g$-group encodable and $g$-group decodable linear STBCs
is introduced. Then for a known class of rate-1 linear designs, an explicit
construction o... |
0704.2511 | Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay
Networks | cs.IT math.IT | The differential encoding/decoding setup introduced by Kiran et al, Oggier et
al and Jing et al for wireless relay networks that use codebooks consisting of
unitary matrices is extended to allow codebooks consisting of scaled unitary
matrices. For such codebooks to be used in the Jing-Hassibi protocol for
cooperative... |
0704.2544 | Existence Proofs of Some EXIT Like Functions | cs.IT math.IT | The Extended BP (EBP) Generalized EXIT (GEXIT) function introduced in
\cite{MMRU05} plays a fundamental role in the asymptotic analysis of sparse
graph codes. For transmission over the binary erasure channel (BEC) the
analytic properties of the EBP GEXIT function are relatively simple and well
understood. The general... |
0704.2596 | Computing Extensions of Linear Codes | cs.IT cs.DM math.IT | This paper deals with the problem of increasing the minimum distance of a
linear code by adding one or more columns to the generator matrix. Several
methods to compute extensions of linear codes are presented. Many codes
improving the previously known lower bounds on the minimum distance have been
found.
|
0704.2644 | Joint universal lossy coding and identification of stationary mixing
sources | cs.IT cs.LG math.IT | The problem of joint universal source coding and modeling, treated in the
context of lossless codes by Rissanen, was recently generalized to fixed-rate
lossy coding of finitely parametrized continuous-alphabet i.i.d. sources. We
extend these results to variable-rate lossy block coding of stationary ergodic
sources an... |
0704.2651 | Opportunistic Communications in an Orthogonal Multiaccess Relay Channel | cs.IT math.IT | The problem of resource allocation is studied for a two-user fading
orthogonal multiaccess relay channel (MARC) where both users (sources)
communicate with a destination in the presence of a relay. A half-duplex relay
is considered that transmits on a channel orthogonal to that used by the
sources. The instantaneous ... |
0704.2659 | Minimum Expected Distortion in Gaussian Layered Broadcast Coding with
Successive Refinement | cs.IT math.IT | A transmitter without channel state information (CSI) wishes to send a
delay-limited Gaussian source over a slowly fading channel. The source is coded
in superimposed layers, with each layer successively refining the description
in the previous one. The receiver decodes the layers that are supported by the
channel re... |
0704.2668 | Supervised Feature Selection via Dependence Estimation | cs.LG | We introduce a framework for filtering features that employs the
Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence
between the features and the labels. The key idea is that good features should
maximise such dependence. Feature selection for various supervised learning
problems (including class... |
0704.2680 | A Channel that Heats Up | cs.IT math.IT | Motivated by on-chip communication, a channel model is proposed where the
variance of the additive noise depends on the weighted sum of the past channel
input powers. For this channel, an expression for the capacity per unit cost is
derived, and it is shown that the expression holds also in the presence of
feedback.
|
0704.2725 | Exploiting Heavy Tails in Training Times of Multilayer Perceptrons: A
Case Study with the UCI Thyroid Disease Database | cs.NE | The random initialization of weights of a multilayer perceptron makes it
possible to model its training process as a Las Vegas algorithm, i.e. a
randomized algorithm which stops when some required training error is obtained,
and whose execution time is a random variable. This modeling is used to perform
a case study ... |
0704.2778 | Random Access Broadcast: Stability and Throughput Analysis | cs.IT math.IT | A wireless network in which packets are broadcast to a group of receivers
through use of a random access protocol is considered in this work. The
relation to previous work on networks of interacting queues is discussed and
subsequently, the stability and throughput regions of the system are analyzed
and presented. A ... |
0704.2786 | Writing on Dirty Paper with Resizing and its Application to Quasi-Static
Fading Broadcast Channels | cs.IT math.IT | This paper studies a variant of the classical problem of ``writing on dirty
paper'' in which the sum of the input and the interference, or dirt, is
multiplied by a random variable that models resizing, known to the decoder but
not to the encoder. The achievable rate of Costa's dirty paper coding (DPC)
scheme is calcu... |
0704.2808 | Minimum cost distributed source coding over a network | cs.IT cs.NI math.IT | This work considers the problem of transmitting multiple compressible sources
over a network at minimum cost. The aim is to find the optimal rates at which
the sources should be compressed and the network flows using which they should
be transmitted so that the cost of the transmission is minimal. We consider
network... |
0704.2811 | On Algebraic Decoding of $q$-ary Reed-Muller and Product-Reed-Solomon
Codes | cs.IT cs.DM math.IT | We consider a list decoding algorithm recently proposed by Pellikaan-Wu
\cite{PW2005} for $q$-ary Reed-Muller codes $\mathcal{RM}_q(\ell, m, n)$ of
length $n \leq q^m$ when $\ell \leq q$. A simple and easily accessible
correctness proof is given which shows that this algorithm achieves a relative
error-correction rad... |
0704.2841 | A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc
Networks | cs.IT math.IT | In wireless ad hoc networks, distributed nodes can collaboratively form an
antenna array for long-distance communications to achieve high energy
efficiency. In recent work, Ochiai, et al., have shown that such collaborative
beamforming can achieve a statistically nice beampattern with a narrow main
lobe and low sidel... |
0704.2857 | Modern Coding Theory: The Statistical Mechanics and Computer Science
Point of View | cs.IT cond-mat.stat-mech math.IT | These are the notes for a set of lectures delivered by the two authors at the
Les Houches Summer School on `Complex Systems' in July 2006. They provide an
introduction to the basic concepts in modern (probabilistic) coding theory,
highlighting connections with statistical mechanics. We also stress common
concepts wit... |
0704.2902 | Recommending Related Papers Based on Digital Library Access Records | cs.DL cs.IR | An important goal for digital libraries is to enable researchers to more
easily explore related work. While citation data is often used as an indicator
of relatedness, in this paper we demonstrate that digital access records (e.g.
http-server logs) can be used as indicators as well. In particular, we show
that measur... |
0704.2926 | Optimal Routing for the Gaussian Multiple-Relay Channel with
Decode-and-Forward | cs.IT math.IT | In this paper, we study a routing problem on the Gaussian multiple relay
channel, in which nodes employ a decode-and-forward coding strategy. We are
interested in routes for the information flow through the relays that achieve
the highest DF rate. We first construct an algorithm that provably finds
optimal DF routes.... |
0704.2963 | Using Access Data for Paper Recommendations on ArXiv.org | cs.DL cs.IR | This thesis investigates in the use of access log data as a source of
information for identifying related scientific papers. This is done for
arXiv.org, the authority for publication of e-prints in several fields of
physics.
Compared to citation information, access logs have the advantage of being
immediately avail... |
0704.3019 | Arbitrary Rate Permutation Modulation for the Gaussian Channel | cs.IT math.IT | In this paper non-group permutation modulated sequences for the Gaussian
channel are considered. Without the restriction to group codes rather than
subsets of group codes, arbitrary rates are achievable. The code construction
utilizes the known optimal group constellations to ensure at least the same
performance but ... |
0704.3035 | Achievable Rates for Two-Way Wire-Tap Channels | cs.IT cs.CR math.IT | We consider two-way wire-tap channels, where two users are communicating with
each other in the presence of an eavesdropper, who has access to the
communications through a multiple-access channel. We find achievable rates for
two different scenarios, the Gaussian two-way wire-tap channel, (GTW-WT), and
the binary add... |
0704.3094 | Detection of two-sided alternatives in a Brownian motion model | cs.IT math.IT | This work examines the problem of sequential detection of a change in the
drift of a Brownian motion in the case of two-sided alternatives. Applications
to real life situations in which two-sided changes can occur are discussed.
Traditionally, 2-CUSUM stopping rules have been used for this problem due to
their asympt... |
0704.3120 | Space Time Codes from Permutation Codes | cs.IT math.IT | A new class of space time codes with high performance is presented. The code
design utilizes tailor-made permutation codes, which are known to have large
minimal distances as spherical codes. A geometric connection between spherical
and space time codes has been used to translate them into the final space time
codes.... |
0704.3157 | Experimenting with recursive queries in database and logic programming
systems | cs.AI cs.DB | This paper considers the problem of reasoning on massive amounts of (possibly
distributed) data. Presently, existing proposals show some limitations: {\em
(i)} the quantity of data that can be handled contemporarily is limited, due to
the fact that reasoning is generally carried out in main-memory; {\em (ii)} the
int... |
0704.3199 | Generalized Stability Condition for Generalized and Doubly-Generalized
LDPC Codes | cs.IT math.IT | In this paper, the stability condition for low-density parity-check (LDPC)
codes on the binary erasure channel (BEC) is extended to generalized LDPC
(GLDPC) codes and doublygeneralized LDPC (D-GLDPC) codes. It is proved that, in
both cases, the stability condition only involves the component codes with
minimum distan... |
0704.3241 | Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach | cs.IT math.IT | We examine the problem of determining which nodes are neighbors of a given
one in a wireless network. We consider an unsupervised network operating on a
frequency-flat Gaussian channel, where $K+1$ nodes associate their identities
to nonorthogonal signatures, transmitted at random times, synchronously, and
independen... |
0704.3268 | 2D Path Solutions from a Single Layer Excitable CNN Model | cs.RO cs.NE | An easily implementable path solution algorithm for 2D spatial problems,
based on excitable/programmable characteristics of a specific cellular
nonlinear network (CNN) model is presented and numerically investigated. The
network is a single layer bioinspired model which was also implemented in CMOS
technology. It exh... |
0704.3287 | Sample size cognizant detection of signals in white noise | cs.IT math.IT | The detection and estimation of signals in noisy, limited data is a problem
of interest to many scientific and engineering communities. We present a
computationally simple, sample eigenvalue based procedure for estimating the
number of high-dimensional signals in white noise when there are relatively few
samples. We ... |
0704.3292 | Coalition Games with Cooperative Transmission: A Cure for the Curse of
Boundary Nodes in Selfish Packet-Forwarding Wireless Networks | cs.IT math.IT | In wireless packet-forwarding networks with selfish nodes, applications of a
repeated game can induce the nodes to forward each others' packets, so that the
network performance can be improved. However, the nodes on the boundary of such
networks cannot benefit from this strategy, as the other nodes do not depend on
t... |
0704.3316 | Vocabulary growth in collaborative tagging systems | cs.IR cond-mat.stat-mech cs.CY physics.data-an | We analyze a large-scale snapshot of del.icio.us and investigate how the
number of different tags in the system grows as a function of a suitably
defined notion of time. We study the temporal evolution of the global
vocabulary size, i.e. the number of distinct tags in the entire system, as well
as the evolution of lo... |
0704.3359 | Direct Optimization of Ranking Measures | cs.IR cs.AI | Web page ranking and collaborative filtering require the optimization of
sophisticated performance measures. Current Support Vector approaches are
unable to optimize them directly and focus on pairwise comparisons instead. We
present a new approach which allows direct optimization of the relevant loss
functions. This... |
0704.3391 | Lifetime Improvement in Wireless Sensor Networks via Collaborative
Beamforming and Cooperative Transmission | cs.IT math.IT | Collaborative beamforming (CB) and cooperative transmission (CT) have
recently emerged as communication techniques that can make effective use of
collaborative/cooperative nodes to create a virtual
multiple-input/multiple-output (MIMO) system. Extending the lifetime of
networks composed of battery-operated nodes is a... |
0704.3395 | General-Purpose Computing on a Semantic Network Substrate | cs.AI cs.PL | This article presents a model of general-purpose computing on a semantic
network substrate. The concepts presented are applicable to any semantic
network representation. However, due to the standards and technological
infrastructure devoted to the Semantic Web effort, this article is presented
from this point of view... |
0704.3396 | Lifetime Improvement of Wireless Sensor Networks by Collaborative
Beamforming and Cooperative Transmission | cs.IT math.IT | Extending network lifetime of battery-operated devices is a key design issue
that allows uninterrupted information exchange among distributive nodes in
wireless sensor networks. Collaborative beamforming (CB) and cooperative
transmission (CT) have recently emerged as new communication techniques that
enable and lever... |
0704.3399 | Cooperative Transmission Protocols with High Spectral Efficiency and
High Diversity Order Using Multiuser Detection and Network Coding | cs.IT math.IT | Cooperative transmission is an emerging communication technique that takes
advantages of the broadcast nature of wireless channels. However, due to low
spectral efficiency and the requirement of orthogonal channels, its potential
for use in future wireless networks is limited. In this paper, by making use of
multiuse... |
0704.3402 | Diversity-Multiplexing Tradeoff in Selective-Fading MIMO Channels | cs.IT math.IT | We establish the optimal diversity-multiplexing (DM) tradeoff of coherent
time, frequency and time-frequency selective-fading MIMO channels and provide a
code design criterion for DM-tradeoff optimality. Our results are based on the
analysis of the "Jensen channel" associated to a given selective-fading MIMO
channel.... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6