id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0904.4358 | Adaptive sampling for linear state estimation | math.OC cs.SY math.PR math.ST stat.TH | When a sensor has continuous measurements but sends limited messages over a
data network to a supervisor which estimates the state, the available packet
rate fixes the achievable quality of state estimation. When such rate limits
turn stringent, the sensor's messaging policy should be designed anew. What are
the good... |
0904.4449 | DNA-Inspired Information Concealing | cs.IT cs.CR math.IT | Protection of the sensitive content is crucial for extensive information
sharing. We present a technique of information concealing, based on
introduction and maintenance of families of repeats. Repeats in DNA constitute
a basic obstacle for its reconstruction by hybridization.
|
0904.4458 | Learning Character Strings via Mastermind Queries, with a Case Study
Involving mtDNA | cs.DS cs.CR cs.IT math.IT | We study the degree to which a character string, $Q$, leaks details about
itself any time it engages in comparison protocols with a strings provided by a
querier, Bob, even if those protocols are cryptographically guaranteed to
produce no additional information other than the scores that assess the degree
to which $Q... |
0904.4525 | Number of Measurements in Sparse Signal Recovery | cs.IT math.IT | We analyze the asymptotic performance of sparse signal recovery from noisy
measurements. In particular, we generalize some of the existing results for the
Gaussian case to subgaussian and other ensembles. An achievable result is
presented for the linear sparsity regime. A converse on the number of required
measuremen... |
0904.4526 | Feasibility Conditions for Interference Alignment | cs.IT cs.AR math.IT | The degrees of freedom of MIMO interference networks with constant channel
coefficients are not known in general. Determining the feasibility of a linear
interference alignment solution is a key step toward solving this open problem.
Our approach in this paper is to view the alignment problem as a system of
bilinear ... |
0904.4527 | Limits of Learning about a Categorical Latent Variable under Prior
Near-Ignorance | cs.LG | In this paper, we consider the coherent theory of (epistemic) uncertainty of
Walley, in which beliefs are represented through sets of probability
distributions, and we focus on the problem of modeling prior ignorance about a
categorical random variable. In this setting, it is a known result that a state
of prior igno... |
0904.4530 | Online Maximizing Weighted Throughput In A Fading Channel | cs.IT cs.DS math.IT | We consider online scheduling weighted packets with time constraints over a
fading channel. Packets arrive at the transmitter in an online manner. Each
packet has a value and a deadline by which it should be sent. The fade state of
the channel determines the throughput obtained per unit of time and the
channel's qual... |
0904.4541 | Evaluation of Marton's Inner Bound for the General Broadcast Channel | cs.IT math.IT | The best known inner bound on the two-receiver general broadcast channel
without a common message is due to Marton [3]. This result was subsequently
generalized in [p. 391, Problem 10(c) 2] and [4] to broadcast channels with a
common message. However the latter region is not computable (except in certain
special case... |
0904.4542 | A Generalized Cut-Set Bound | cs.IT math.IT | In this paper, we generalize the well known cut-set bound to the problem of
lossy transmission of functions of arbitrarily correlated sources over a
discrete memoryless multiterminal network.
|
0904.4587 | Adaptive Learning with Binary Neurons | cs.AI cs.NE | A efficient incremental learning algorithm for classification tasks, called
NetLines, well adapted for both binary and real-valued input patterns is
presented. It generates small compact feedforward neural networks with one
hidden layer of binary units and binary output units. A convergence theorem
ensures that solut... |
0904.4608 | Temporal data mining for root-cause analysis of machine faults in
automotive assembly lines | cs.LG | Engine assembly is a complex and heavily automated distributed-control
process, with large amounts of faults data logged everyday. We describe an
application of temporal data mining for analyzing fault logs in an engine
assembly plant. Frequent episode discovery framework is a model-free method
that can be used to de... |
0904.4708 | Quality Classifiers for Open Source Software Repositories | cs.SE cs.AI | Open Source Software (OSS) often relies on large repositories, like
SourceForge, for initial incubation. The OSS repositories offer a large variety
of meta-data providing interesting information about projects and their
success. In this paper we propose a data mining approach for training
classifiers on the OSS meta-... |
0904.4717 | Continuous Strategy Replicator Dynamics for Multi--Agent Learning | cs.LG cs.AI cs.GT nlin.AO | The problem of multi-agent learning and adaptation has attracted a great deal
of attention in recent years. It has been suggested that the dynamics of multi
agent learning can be studied using replicator equations from population
biology. Most existing studies so far have been limited to discrete strategy
spaces with... |
0904.4727 | Characterizations of Stable Model Semantics for Logic Programs with
Arbitrary Constraint Atoms | cs.AI cs.LO cs.PL | This paper studies the stable model semantics of logic programs with
(abstract) constraint atoms and their properties. We introduce a succinct
abstract representation of these constraint atoms in which a constraint atom is
represented compactly. We show two applications. First, under this
representation of constraint... |
0904.4735 | The Secrecy Capacity Region of the Degraded Vector Gaussian Broadcast
Channel | cs.IT math.IT | In this paper, we consider a scenario where a source node wishes to broadcast
two confidential messages for two respective receivers via a Gaussian MIMO
broadcast channel. A wire-tapper also receives the transmitted signal via
another MIMO channel. It is assumed that the channels are degraded and the
wire-tapper has ... |
0904.4741 | Belief-Propagation Decoding of Lattices Using Gaussian Mixtures | cs.IT math.IT | A belief-propagation decoder for low-density lattice codes is given which
represents messages explicitly as a mixture of Gaussians functions. The key
component is an algorithm for approximating a mixture of several Gaussians with
another mixture with a smaller number of Gaussians. This Gaussian mixture
reduction algo... |
0904.4774 | Dictionary Identification - Sparse Matrix-Factorisation via
$\ell_1$-Minimisation | cs.IT cs.LG math.IT | This article treats the problem of learning a dictionary providing sparse
representations for a given signal class, via $\ell_1$-minimisation. The
problem can also be seen as factorising a $\ddim \times \nsig$ matrix $Y=(y_1
>... y_\nsig), y_n\in \R^\ddim$ of training signals into a $\ddim \times
\natoms$ dictionary ... |
0904.4789 | Frequency Domain Hybrid-ARQ Chase Combining for Broadband MIMO CDMA
Systems | cs.IT math.IT | In this paper, we consider high-speed wireless packet access using code
division multiple access (CDMA) and multiple-input multiple-output (MIMO).
Current wireless standards, such as high speed packet access (HSPA), have
adopted multi-code transmission and hybrid-automatic repeat request (ARQ) as
major technologies f... |
0904.4836 | FaceBots: Steps Towards Enhanced Long-Term Human-Robot Interaction by
Utilizing and Publishing Online Social Information | cs.RO cs.AI cs.CV | Our project aims at supporting the creation of sustainable and meaningful
longer-term human-robot relationships through the creation of embodied robots
with face recognition and natural language dialogue capabilities, which exploit
and publish social information available on the web (Facebook). Our main
underlying ex... |
0904.4863 | A two-stage algorithm for extracting the multiscale backbone of complex
weighted networks | physics.soc-ph cs.SI physics.data-an stat.AP | The central problem of concern to Serrano, Boguna and Vespignani ("Extracting
the multiscale backbone of complex weighted networks", Proc Natl Acad Sci
106:6483-6488 [2009]) can be effectively and elegantly addressed using a
well-established two-stage algorithm that has been applied to internal
migration flows for nu... |
0904.4900 | On optimal precoding in linear vector Gaussian channels with arbitrary
input distribution | cs.IT math.IT | The design of the precoder the maximizes the mutual information in linear
vector Gaussian channels with an arbitrary input distribution is studied.
Precisely, the precoder optimal left singular vectors and singular values are
derived. The characterization of the right singular vectors is left, in
general, as an open ... |
0904.4921 | Renormalization and computation I: motivation and background | math.QA cs.IT math.IT | In this paper I argue that infinities in the classical computation theory
such as the unsolvability of the Halting Problem can be addressed in the same
way as Feynman divergences in Quantum Field Theory, and that meaningful
versions of renormalization in this context can be devised. Connections with
quantum computati... |
0904.4926 | Variable-Rate M-PSK Communications without Channel Amplitude Estimation | cs.IT math.IT | Channel estimation at the receiver side is essential to adaptive modulation
schemes, prohibiting low complexity systems from using variable rate and/or
variable power transmissions. Towards providing a solution to this problem, we
introduce a variable-rate (VR) M-PSK modulation scheme, for communications over
fading ... |
0905.0024 | Theoretical Analysis of Cyclic Frequency Domain Noise and Feature
Detection for Cognitive Radio Systems | cs.IT math.IT | In cognitive radio systems, cyclostationary feature detection plays an
important role in spectrum sensing, especially in low SNR cases. To configure
the detection threshold under a certain noise level and a pre-set miss
detection probability Pf, it's important to derive the theoretical distribution
of the observation... |
0905.0036 | On the Secrecy Rate Region for the Interference Channel | cs.IT math.IT | This paper studies interference channels with security constraints. The
existence of an external eavesdropper in a two-user interference channel is
assumed, where the network users would like to secure their messages from the
external eavesdropper. The cooperative binning and channel prefixing scheme is
proposed for ... |
0905.0044 | ADMiRA: Atomic Decomposition for Minimum Rank Approximation | math.NA cs.IT math.IT | We address the inverse problem that arises in compressed sensing of a
low-rank matrix. Our approach is to pose the inverse problem as an
approximation problem with a specified target rank of the solution. A simple
search over the target rank then provides the minimum rank solution satisfying
a prescribed data approxi... |
0905.0079 | Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes | cs.IT math.IT | We introduce a new method for decoding short and moderate length linear block
codes with dense parity-check matrix representations of cyclic form, termed
multiple-bases belief-propagation (MBBP). The proposed iterative scheme makes
use of the fact that a code has many structurally diverse parity-check
matrices, capab... |
0905.0192 | Fuzzy Mnesors | cs.AI | A fuzzy mnesor space is a semimodule over the positive real numbers. It can
be used as theoretical framework for fuzzy sets. Hence we can prove a great
number of properties for fuzzy sets without refering to the membership
functions.
|
0905.0197 | An Application of Proof-Theory in Answer Set Programming | cs.AI | We apply proof-theoretic techniques in answer Set Programming. The main
results include: 1. A characterization of continuity properties of
Gelfond-Lifschitz operator for logic program. 2. A propositional
characterization of stable models of logic programs (without referring to loop
formulas.
|
0905.0233 | Robust Principal Component Analysis: Exact Recovery of Corrupted
Low-Rank Matrices | cs.IT math.IT | This paper has been withdrawn due to a critical error near equation (71).
This error causes the entire argument of the paper to collapse.
Emmanuel Candes of Stanford discovered the error, and has suggested a correct
analysis, which will be reported in a separate publication.
|
0905.0266 | Gaussian Belief with dynamic data and in dynamic network | cs.AI cond-mat.stat-mech cs.IT math.IT physics.soc-ph | In this paper we analyse Belief Propagation over a Gaussian model in a
dynamic environment. Recently, this has been proposed as a method to average
local measurement values by a distributed protocol ("Consensus Propagation",
Moallemi & Van Roy, 2006), where the average is available for read-out at every
single node. ... |
0905.0374 | Interference Alignment with Limited Feedback | cs.IT math.IT | We consider single-antenna interference networks where M sources, each with
an average transmit power of P/M, communicate with M destinations over
frequency-selective channels (with L taps each) and each destination has
perfect knowledge of its channels from each of the sources. Assuming that there
exist error-free n... |
0905.0385 | Diversity-Multiplexing tradeoff of the Two-User Interference Channel | cs.IT math.IT | Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of
the fundamental tradeoff between data rate and reliability in a slow fading
channel. In this paper, we characterize the fundamental DMT of the two user
single antenna Gaussian interference channel. We show that the class of
multilevel superpo... |
0905.0397 | A representation of non-uniformly sampled deterministic and random
signals and their reconstruction using sample values and derivatives | cs.IT math.IT | Shannon in his 1949 paper suggested the use of derivatives to increase the
W*T product of the sampled signal. Use of derivatives enables improved
reconstruction particularly in the case of non-uniformly sampled signals. An
FM-AM representation for Lagrange/Hermite type interpolation and a
reconstruction technique are... |
0905.0417 | Two-Level Fingerprinting Codes | cs.IT cs.CR math.IT | We introduce the notion of two-level fingerprinting and traceability codes.
In this setting, the users are organized in a hierarchical manner by
classifying them into various groups; for instance, by dividing the
distribution area into several geographic regions, and collecting users from
the same region into one gro... |
0905.0440 | Tandem Coding and Cryptography on Wiretap Channels: EXIT Chart Analysis | cs.IT cs.CR math.IT | Traditional cryptography assumes an eavesdropper receives an error-free copy
of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at
the physical layer both the intended receiver and the passive eavesdropper
inevitably receive an error-prone version of the transmitted message which must
be cor... |
0905.0541 | Design and Analysis of Successive Decoding with Finite Levels for the
Markov Channel | cs.IT math.IT | This paper proposes a practical successive decoding scheme with finite levels
for the finite-state Markov channels where there is no a priori state
information at the transmitter or the receiver. The design employs either a
random interleaver or a deterministic interleaver with an irregular pattern and
an optional it... |
0905.0564 | Selective Cooperative Relaying over Time-Varying Channels | cs.IT math.IT | In selective cooperative relaying only a single relay out of the set of
available relays is activated, hence the available power and bandwidth
resources are efficiently utilized. However, implementing selective cooperative
relaying in time-varying channels may cause frequent relay switchings that
deteriorate the over... |
0905.0586 | WinBioinfTools: Bioinformatics Tools for Windows High Performance
Computing Server 2008 | cs.MS cs.CE q-bio.QM | Open source bioinformatics tools running under MS Windows are rare to find,
and those running under Windows HPC cluster are almost non-existing. This is
despite the fact that the Windows is the most popular operating system used
among life scientists. Therefore, we introduce in this initiative
WinBioinfTools, a toolk... |
0905.0606 | Quantization for Soft-Output Demodulators in Bit-Interleaved Coded
Modulation Systems | cs.IT math.IT | We study quantization of log-likelihood ratios (LLR) in bit-interleaved coded
modulation (BICM) systems in terms of an equivalent discrete channel. We
propose to design the quantizer such that the quantizer outputs become
equiprobable. We investigate semi-analytically and numerically the ergodic and
outage capacity o... |
0905.0619 | On the Sensitivity of Noncoherent Capacity to the Channel Model | cs.IT math.IT | The noncoherent capacity of stationary discrete-time fading channels is known
to be very sensitive to the fine details of the channel model. More
specifically, the measure of the set of harmonics where the power spectral
density of the fading process is nonzero determines if capacity grows
logarithmically in SNR or s... |
0905.0642 | Simultaneous support recovery in high dimensions: Benefits and perils of
block $\ell_1/\ell_\infty$-regularization | math.ST cs.IT math.IT stat.TH | Consider the use of $\ell_{1}/\ell_{\infty}$-regularized regression for joint
estimation of a $\pdim \times \numreg$ matrix of regression coefficients. We
analyze the high-dimensional scaling of $\ell_1/\ell_\infty$-regularized
quadratic programming, considering both consistency in $\ell_\infty$-norm, and
variable se... |
0905.0677 | Feasibility of random basis function approximators for modeling and
control | cs.NE cs.AI | We discuss the role of random basis function approximators in modeling and
control. We analyze the published work on random basis function approximators
and demonstrate that their favorable error rate of convergence O(1/n) is
guaranteed only with very substantial computational resources. We also discuss
implications ... |
0905.0721 | Diversity-Multiplexing Tradeoff in Fading Interference Channels | cs.IT math.IT | We analyze two-user single-antenna fading interference channels with perfect
receive channel state information (CSI) and no transmit CSI. We compute the
diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and
Kobayashi (HK)-type superposition coding scheme and provide design criteria for
the corre... |
0905.0740 | A FORTRAN coded regular expression Compiler for IBM 1130 Computing
System | cs.CL cs.PL | REC (Regular Expression Compiler) is a concise programming language which
allows students to write programs without knowledge of the complicated syntax
of languages like FORTRAN and ALGOL. The language is recursive and contains
only four elements for control. This paper describes an interpreter of REC
written in FORT... |
0905.0747 | Self-stabilizing Determinsitic Gathering | cs.MA | In this paper, we investigate the possibility to deterministically solve the
gathering problem (GP) with weak robots (anonymous, autonomous, disoriented,
deaf and dumb, and oblivious). We introduce strong multiplicity detection as
the ability for the robots to detect the exact number of robots located at a
given posi... |
0905.0749 | Soft Motion Trajectory Planner for Service Manipulator Robot | cs.RO | Human interaction introduces two main constraints: Safety and Comfort.
Therefore service robot manipulator can't be controlled like industrial robotic
manipulator where personnel is isolated from the robot's work envelope. In this
paper, we present a soft motion trajectory planner to try to ensure that these
constrai... |
0905.0794 | Constructions of Almost Optimal Resilient Boolean Functions on Large
Even Number of Variables | cs.IT cs.CR math.IT | In this paper, a technique on constructing nonlinear resilient Boolean
functions is described. By using several sets of disjoint spectra functions on
a small number of variables, an almost optimal resilient function on a large
even number of variables can be constructed. It is shown that given any $m$,
one can constr... |
0905.0838 | What is the Value of Joint Processing of Pilots and Data in Block-Fading
Channels? | cs.IT math.IT | The spectral efficiency achievable with joint processing of pilot and data
symbol observations is compared with that achievable through the conventional
(separate) approach of first estimating the channel on the basis of the pilot
symbols alone, and subsequently detecting the data symbols. Studied on the
basis of a m... |
0905.0940 | A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov
Tree Structures | stat.ML cs.IT math.IT | The problem of maximum-likelihood (ML) estimation of discrete tree-structured
distributions is considered. Chow and Liu established that ML-estimation
reduces to the construction of a maximum-weight spanning tree using the
empirical mutual information quantities as the edge weights. Using the theory
of large-deviatio... |
0905.1056 | Bringing Toric Codes to the next dimension | math.AG cs.IT math.IT | This paper is concerned with the minimum distance computation for higher
dimensional toric codes defined by lattice polytopes. We show that the minimum
distance is multiplicative with respect to taking the product of polytopes, and
behaves in a simple way when one builds a k-dilate of a pyramid over a
polytope. This ... |
0905.1130 | Statistical Automatic Summarization in Organic Chemistry | cs.IR cs.CL | We present an oriented numerical summarizer algorithm, applied to producing
automatic summaries of scientific documents in Organic Chemistry. We present
its implementation named Yachs (Yet Another Chemistry Summarizer) that combines
a specific document pre-processing with a sentence scoring method relying on
the stat... |
0905.1187 | The Residual Method for Regularizing Ill-Posed Problems | math.OC cs.SY | Although the \emph{residual method}, or \emph{constrained regularization}, is
frequently used in applications, a detailed study of its properties is still
missing. This sharply contrasts the progress of the theory of Tikhonov
regularization, where a series of new results for regularization in Banach
spaces has been p... |
0905.1215 | Tail Behavior of Sphere-Decoding Complexity in Random Lattices | cs.IT cs.CC math.IT math.ST stat.TH | We analyze the (computational) complexity distribution of sphere-decoding
(SD) for random infinite lattices. In particular, we show that under fairly
general assumptions on the statistics of the lattice basis matrix, the tail
behavior of the SD complexity distribution is solely determined by the inverse
volume of a f... |
0905.1235 | The Modular Audio Recognition Framework (MARF) and its Applications:
Scientific and Software Engineering Notes | cs.SD cs.CL cs.CV cs.MM cs.NE | MARF is an open-source research platform and a collection of
voice/sound/speech/text and natural language processing (NLP) algorithms
written in Java and arranged into a modular and extensible framework
facilitating addition of new algorithms. MARF can run distributively over the
network and may act as a library in a... |
0905.1305 | On the Distribution of the Sum of Gamma-Gamma Variates and Applications
in RF and Optical Wireless Communications | cs.IT math.IT | The Gamma-Gamma (GG) distribution has recently attracted the interest within
the research community due to its involvement in various communication systems.
In the context of RF wireless communications, GG distribution accurately models
the power statistics in composite shadowing/fading channels as well as in
cascade... |
0905.1375 | Saddle-point Solution of the Fingerprinting Capacity Game Under the
Marking Assumption | cs.IT cs.CR math.IT | We study a fingerprinting game in which the collusion channel is unknown. The
encoder embeds fingerprints into a host sequence and provides the decoder with
the capability to trace back pirated copies to the colluders.
Fingerprinting capacity has recently been derived as the limit value of a
sequence of maxmin game... |
0905.1386 | Selective-Fading Multiple-Access MIMO Channels: Diversity-Multiplexing
Tradeoff and Dominant Outage Event Regions | cs.IT math.IT | We establish the optimal diversity-multiplexing (DM) tradeoff for coherent
selective-fading multiple-access MIMO channels and provide corresponding code
design criteria. As a byproduct, on the conceptual level, we find an
interesting relation between the DM tradeoff framework and the notion of
dominant error event re... |
0905.1424 | Concept Stability for Constructing Taxonomies of Web-site Users | cs.CY cs.AI cs.SI stat.ML | Owners of a web-site are often interested in analysis of groups of users of
their site. Information on these groups can help optimizing the structure and
contents of the site. In this paper we use an approach based on formal concepts
for constructing taxonomies of user groups. For decreasing the huge amount of
concep... |
0905.1460 | Design of Learning Based MIMO Cognitive Radio Systems | cs.IT math.IT | This paper addresses the design issues of the multi-antenna-based cognitive
radio (CR) system that is able to operate concurrently with the licensed
primary radio (PR) system. We propose a practical CR transmission strategy
consisting of three major stages: environment learning, channel training, and
data transmissio... |
0905.1512 | A Nearly Optimal Construction of Flash Codes | cs.IT math.IT | Flash memory is a non-volatile computer memory comprised of blocks of cells,
wherein each cell can take on q different values or levels. While increasing
the cell level is easy, reducing the level of a cell can be accomplished only
by erasing an entire block. Since block erasures are highly undesirable, coding
scheme... |
0905.1537 | On the Separability of Parallel Gaussian Interference Channels | cs.IT math.IT | The separability in parallel Gaussian interference channels (PGICs) is
studied in this paper. We generalize the separability results in one-sided
PGICs (OPGICs) by Sung \emph{et al.} to two-sided PGICs (TPGICs). Specifically,
for strong and mixed TPGICs, we show necessary and sufficient conditions for
the separabilit... |
0905.1543 | Sum capacity of multi-source linear finite-field relay networks with
fading | cs.IT math.IT | We study a fading linear finite-field relay network having multiple
source-destination pairs. Because of the interference created by different
unicast sessions, the problem of finding its capacity region is in general
difficult. We observe that, since channels are time-varying, relays can deliver
their received signa... |
0905.1546 | Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit | cs.IT cs.LG math.IT | Motivated by the philosophy and phenomenal success of compressed sensing, the
problem of reconstructing a matrix from a sampling of its entries has attracted
much attention recently. Such a problem can be viewed as an
information-theoretic variant of the well-studied matrix completion problem,
and the main objective ... |
0905.1594 | A Recommender System to Support the Scholarly Communication Process | cs.DL cs.IR | The number of researchers, articles, journals, conferences, funding
opportunities, and other such scholarly resources continues to grow every year
and at an increasing rate. Many services have emerged to support scholars in
navigating particular aspects of this resource-rich environment. Some
commercial publishers pr... |
0905.1609 | Acquisition of morphological families and derivational series from a
machine readable dictionary | cs.CL | The paper presents a linguistic and computational model aiming at making the
morphological structure of the lexicon emerge from the formal and semantic
regularities of the words it contains. The model is word-based. The proposed
morphological structure consists of (1) binary relations that connect each
headword with ... |
0905.1643 | Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization | math.OC cs.IT math.IT | The linearly constrained matrix rank minimization problem is widely
applicable in many fields such as control, signal processing and system
identification. The tightest convex relaxation of this problem is the linearly
constrained nuclear norm minimization. Although the latter can be cast as a
semidefinite programmin... |
0905.1745 | Capacity of a Class of Symmetric SIMO Gaussian Interference Channels
within O(1) | cs.IT math.IT | The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference
channel where each transmitter has a single antenna and each receiver has N
antennas is studied. The symmetric capacity within O(1) is characterized for
the symmetric case where all direct links have the same signal-to-noise ratio
(SNR) and... |
0905.1751 | Experiment Study of Entropy Convergence of Ant Colony Optimization | cs.NE cs.AI | Ant colony optimization (ACO) has been applied to the field of combinatorial
optimization widely. But the study of convergence theory of ACO is rare under
general condition. In this paper, the authors try to find the evidence to prove
that entropy is related to the convergence of ACO, especially to the estimation
of ... |
0905.1755 | Can the Utility of Anonymized Data be used for Privacy Breaches? | cs.DB | Group based anonymization is the most widely studied approach for privacy
preserving data publishing. This includes k-anonymity, l-diversity, and
t-closeness, to name a few. The goal of this paper is to raise a fundamental
issue on the privacy exposure of the current group based approach. This has
been overlooked in ... |
0905.1778 | Encoding of Network Protection Codes Against Link and Node Failures Over
Finite Fields | cs.IT cs.CR cs.NI math.IT | Link and node failures are common two fundamental problems that affect
operational networks. Hence, protection of communication networks is essential
to increase their reliability, performance, and operations. Much research work
has been done to protect against link and node failures, and to provide
reliable solution... |
0905.1883 | Cascade multiterminal source coding | cs.IT math.IT | We investigate distributed source coding of two correlated sources X and Y
where messages are passed to a decoder in a cascade fashion. The encoder of X
sends a message at rate R_1 to the encoder of Y. The encoder of Y then sends a
message to the decoder at rate R_2 based both on Y and on the message it
received abou... |
0905.1906 | Improved Adaptive Group Testing Algorithms with Applications to Multiple
Access Channels and Dead Sensor Diagnosis | cs.DS cs.IT math.IT | We study group-testing algorithms for resolving broadcast conflicts on a
multiple access channel (MAC) and for identifying the dead sensors in a mobile
ad hoc wireless network. In group-testing algorithms, we are asked to identify
all the defective items in a set of items when we can test arbitrary subsets of
items. ... |
0905.1964 | On Models of Multi-user Gaussian Channels with Fading | cs.IT math.IT | An analytically tractable model for Gaussian multiuser channels with fading
is studied, and the capacity region of this model is found to be a good
approximation of the capacity region of the original Gaussian network. This
work extends the existing body of work on deterministic models for Gaussian
multiuser channels... |
0905.1990 | Sparse Linear Representation | cs.IT math.IT | This paper studies the question of how well a signal can be reprsented by a
sparse linear combination of reference signals from an overcomplete dictionary.
When the dictionary size is exponential in the dimension of signal, then the
exact characterization of the optimal distortion is given as a function of the
dictio... |
0905.2004 | Termination Prediction for General Logic Programs | cs.PL cs.AI cs.LO | We present a heuristic framework for attacking the undecidable termination
problem of logic programs, as an alternative to current
termination/non-termination proof approaches. We introduce an idea of
termination prediction, which predicts termination of a logic program in case
that neither a termination nor a non-te... |
0905.2098 | End-to-End Joint Antenna Selection Strategy and Distributed Compress and
Forward Strategy for Relay Channels | cs.IT math.IT | Multi-hop relay channels use multiple relay stages, each with multiple relay
nodes, to facilitate communication between a source and destination.
Previously, distributed space-time codes were proposed to maximize the
achievable diversity-multiplexing tradeoff, however, they fail to achieve all
the points of the optim... |
0905.2125 | Experience-driven formation of parts-based representations in a model of
layered visual memory | q-bio.NC cs.LG nlin.AO | Growing neuropsychological and neurophysiological evidence suggests that the
visual cortex uses parts-based representations to encode, store and retrieve
relevant objects. In such a scheme, objects are represented as a set of
spatially distributed local features, or parts, arranged in stereotypical
fashion. To encode... |
0905.2159 | On the Secrecy Rate of Interference Networks using structured codes | cs.IT math.IT | This paper shows that structured transmission schemes are a good choice for
secret communication over interference networks with an eavesdropper.
Structured transmission is shown to exploit channel asymmetries and thus
perform better than randomly generated codebooks for such channels. For a class
of interference cha... |
0905.2200 | Towards Chip-on-Chip Neuroscience: Fast Mining of Frequent Episodes
Using Graphics Processors | cs.DC cs.DB | Computational neuroscience is being revolutionized with the advent of
multi-electrode arrays that provide real-time, dynamic, perspectives into brain
function. Mining event streams from these chips is critical to understanding
the firing patterns of neurons and to gaining insight into the underlying
cellular activity... |
0905.2203 | Accelerator-Oriented Algorithm Transformation for Temporal Data Mining | cs.DC cs.DB | Temporal data mining algorithms are becoming increasingly important in many
application domains including computational neuroscience, especially the
analysis of spike train data. While application scientists have been able to
readily gather multi-neuronal datasets, analysis capabilities have lagged
behind, due to bot... |
0905.2248 | Protection against link errors and failures using network coding | cs.IT cs.NI math.IT | We propose a network-coding based scheme to protect multiple bidirectional
unicast connections against adversarial errors and failures in a network. The
network consists of a set of bidirectional primary path connections that carry
the uncoded traffic. The end nodes of the bidirectional connections are
connected by a... |
0905.2297 | On Optimal Distributed Joint Source-Channel Coding for Correlated
Gaussian Sources over Gaussian Channels | cs.IT math.IT | We consider the problem of distributed joint source-channel coding of
correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC).
There may be side information at the decoder and/or at the encoders. First we
specialize a general result (for transmission of correlated sources over a MAC
with side infor... |
0905.2311 | Residus de 2-formes differentielles sur les surfaces algebriques et
applications aux codes correcteurs d'erreurs | math.AG cs.IT math.IT | The theory of algebraic-geometric codes has been developed in the beginning
of the 80's after a paper of V.D. Goppa. Given a smooth projective algebraic
curve X over a finite field, there are two different constructions of
error-correcting codes. The first one, called "functional", uses some rational
functions on X a... |
0905.2341 | Differential approach for the study of duals of algebraic-geometric
codes on surfaces | math.AG cs.IT math.IT math.NT | The purpose of the present article is the study of duals of functional codes
on algebraic surfaces. We give a direct geometrical description of them, using
differentials. Even if this geometrical description is less trivial, it can be
regarded as a natural extension to surfaces of the result asserting that the
dual o... |
0905.2345 | The dual minimum distance of arbitrary dimensional algebraic--geometric
codes | math.AG cs.IT math.IT | In this article, the minimum distance of the dual $C^{\bot}$ of a functional
code $C$ on an arbitrary dimensional variety $X$ over a finite field $\F_q$ is
studied. The approach consists in finding minimal configurations of points on
$X$ which are not in "general position". If $X$ is a curve, the result improves
in s... |
0905.2347 | Combining Supervised and Unsupervised Learning for GIS Classification | cs.LG | This paper presents a new hybrid learning algorithm for unsupervised
classification tasks. We combined Fuzzy c-means learning algorithm and a
supervised version of Minimerror to develop a hybrid incremental strategy
allowing unsupervised classifications. We applied this new approach to a
real-world database in order ... |
0905.2386 | Combinatorial information distance | cs.DM cs.IT math.IT | Let $|A|$ denote the cardinality of a finite set $A$. For any real number $x$
define $t(x)=x$ if $x\geq1$ and 1 otherwise. For any finite sets $A,B$ let
$\delta(A,B)$ $=$ $\log_{2}(t(|B\cap\bar{A}||A|))$. We define {This appears as
Technical Report # arXiv:0905.2386v4. A shorter version appears in the {Proc.
of Mini-... |
0905.2392 | On Channel Output Feedback in Deterministic Interference Channels | cs.IT math.IT | In this paper, we study the effect of channel output feedback on the sum
capacity in a two-user symmetric deterministic interference channel. We find
that having a single feedback link from one of the receivers to its own
transmitter results in the same sum capacity as having a total of 4 feedback
links from both the... |
0905.2413 | Outage Capacity and Optimal Transmission for Dying Channels | cs.IT math.IT | In wireless networks, communication links may be subject to random fatal
impacts: for example, sensor networks under sudden power losses or cognitive
radio networks with unpredictable primary user spectrum occupancy. Under such
circumstances, it is critical to quantify how fast and reliably the information
can be col... |
0905.2416 | Identifying Influential Bloggers: Time Does Matter | cs.IR cs.DL | Blogs have recently become one of the most favored services on the Web. Many
users maintain a blog and write posts to express their opinion, experience and
knowledge about a product, an event and every subject of general or specific
interest. More users visit blogs to read these posts and comment them. This
"particip... |
0905.2422 | Multilevel Coding over Two-Hop Single-User Networks | cs.IT math.IT | In this paper, a two-hop network in which information is transmitted from a
source via a relay to a destination is considered. It is assumed that the
channels are static fading with additive white Gaussian noise. All nodes are
equipped with a single antenna and the Channel State Information (CSI) of each
hop is not a... |
0905.2423 | Bounds on sets with few distances | math.CO cs.IT math.IT math.MG | We derive a new estimate of the size of finite sets of points in metric
spaces with few distances. The following applications are considered:
(1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform
intersecting families of subsets;
(2) we refine the bound of Delsarte-Goethals-Seidel on the maximum s... |
0905.2429 | Time Delay Estimation from Low Rate Samples: A Union of Subspaces
Approach | cs.IT math.IT | Time delay estimation arises in many applications in which a multipath medium
has to be identified from pulses transmitted through the channel. Various
approaches have been proposed in the literature to identify time delays
introduced by multipath environments. However, these methods either operate on
the analog rece... |
0905.2435 | Quantified Multimodal Logics in Simple Type Theory | cs.AI cs.LO | We present a straightforward embedding of quantified multimodal logic in
simple type theory and prove its soundness and completeness. Modal operators
are replaced by quantification over a type of possible worlds. We present
simple experiments, using existing higher-order theorem provers, to demonstrate
that the embed... |
0905.2447 | The Diversity Multiplexing Tradeoff for Interference Networks | cs.IT math.IT | The diversity-multiplexing tradeoff (DMT) for interference networks, such as
the interference channel, the X channel, the Z interference channel and the Z
channel, is analyzed. In particular, we investigate the impact of
rate-splitting and channel knowledge at the transmitters. We also use the DMT
of the Z channel an... |
0905.2449 | The Role of Self-Forensics in Vehicle Crash Investigations and Event
Reconstruction | cs.CY cs.AI cs.CR cs.OH | This paper further introduces and formalizes a novel concept of
self-forensics for automotive vehicles, specified in the Forensic Lucid
language. We argue that self-forensics, with the forensics taken out of the
cybercrime domain, is applicable to "self-dissection" of intelligent vehicles
and hardware systems for aut... |
0905.2459 | On Design and Implementation of the Distributed Modular Audio
Recognition Framework: Requirements and Specification Design Document | cs.CV cs.DC cs.MM cs.NE cs.SD | We present the requirements and design specification of the open-source
Distributed Modular Audio Recognition Framework (DMARF), a distributed
extension of MARF. The distributed version aggregates a number of distributed
technologies (e.g. Java RMI, CORBA, Web Services) in a pluggable and modular
model along with the... |
0905.2463 | Generalized Kernel-based Visual Tracking | cs.CV cs.MM | In this work we generalize the plain MS trackers and attempt to overcome
standard mean shift trackers' two limitations.
It is well known that modeling and maintaining a representation of a target
object is an important component of a successful visual tracker.
However, little work has been done on building a robu... |
0905.2473 | On the Workings of Genetic Algorithms: The Genoclique Fixing Hypothesis | cs.NE cs.AI | We recently reported that the simple genetic algorithm (SGA) is capable of
performing a remarkable form of sublinear computation which has a
straightforward connection with the general problem of interacting attributes
in data-mining. In this paper we explain how the SGA can leverage this
computational proficiency to... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.