id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1007.0904 | Secure rate-adaptive reconciliation | cs.IT math.IT | We consider in this paper the problem of information reconciliation in the
context of secret key agreement between two legitimate parties, Alice and Bob.
Beginning the discussion with the secret key agreement model introduced by
Ahlswede and Csisz\'ar, the channel-type model with wiretapper, we study a
protocol based... |
1007.0931 | LDPC Code Design for Transmission of Correlated Sources Across Noisy
Channels Without CSIT | cs.IT math.IT | We consider the problem of transmitting correlated data after independent
encoding to a central receiver through orthogonal channels. We assume that the
channel state information is not known at the transmitter. The receiver has
access to both the source correlation and the channel state information. We
provide a gen... |
1007.0936 | Linguistic complexity: English vs. Polish, text vs. corpus | cs.CL physics.soc-ph | We analyze the rank-frequency distributions of words in selected English and
Polish texts. We show that for the lemmatized (basic) word forms the
scale-invariant regime breaks after about two decades, while it might be
consistent for the whole range of ranks for the inflected word forms. We also
find that for a corpu... |
1007.0940 | An axiomatic formalization of bounded rationality based on a
utility-information equivalence | cs.AI cs.GT | Classic decision-theory is based on the maximum expected utility (MEU)
principle, but crucially ignores the resource costs incurred when determining
optimal decisions. Here we propose an axiomatic framework for bounded
decision-making that considers resource costs. Agents are formalized as
probability measures over i... |
1007.0945 | Human activity as the decision-based queueing process: statistical data
analysis of waiting times in scientific journals | physics.data-an cs.IR | We consider the editorial processing of papers in scientific journals as a
human activity process based on the decision making. A functional form of the
probability distributions of random variables describing a human dynamics is
studied using classical approaches of mass service systems theory, physics of
critical p... |
1007.0982 | MIMO B-MAC Interference Network Optimization under Rate Constraints by
Polite Water-filling and Duality | cs.IT math.IT | We take two new approaches to design efficient algorithms for transmitter
optimization under rate constraints, to guarantee the Quality of Service in
general MIMO interference networks, which is a combination of multiple
interfering broadcast channels (BC) and multiaccess channels (MAC) and is named
B-MAC Networks. T... |
1007.1016 | Bilateral filters: what they can and cannot do | cs.CV | Nonlinear bilateral filters (BF) deliver a fine blend of computational
simplicity and blur-free denoising. However, little is known about their
nature, noise-suppressing properties, and optimal choices of filter parameters.
Our study is meant to fill this gap-explaining the underlying mechanism of
bilateral filtering... |
1007.1024 | Model Counting in Product Configuration | cs.AI cs.LO cs.SC | We describe how to use propositional model counting for a quantitative
analysis of product configuration data. Our approach computes valuable meta
information such as the total number of valid configurations or the relative
frequency of components. This information can be used to assess the severity of
documentation ... |
1007.1025 | Inflection system of a language as a complex network | cs.CL nlin.AO | We investigate inflection structure of a synthetic language using Latin as an
example. We construct a bipartite graph in which one group of vertices
correspond to dictionary headwords and the other group to inflected forms
encountered in a given text. Each inflected form is connected to its
corresponding headword, wh... |
1007.1033 | A Theory of Network Equivalence, Parts I and II | cs.IT math.IT | A family of equivalence tools for bounding network capacities is introduced.
Part I treats networks of point-to-point channels. The main result is roughly
as follows. Given a network of noisy, independent, memoryless point-to-point
channels, a collection of communication demands can be met on the given network
if and... |
1007.1048 | Registration of Brain Images using Fast Walsh Hadamard Transform | cs.CV | A lot of image registration techniques have been developed with great
significance for data analysis in medicine, astrophotography, satellite imaging
and few other areas. This work proposes a method for medical image registration
using Fast Walsh Hadamard transform. This algorithm registers images of the
same or diff... |
1007.1069 | On the instantaneous frequency of Gaussian stochastic processes | cs.IT math.IT math.PR | This paper concerns the instantaneous frequency (IF) of continuous-time,
zero-mean, complex-valued, proper, mean-square differentiable nonstationary
Gaussian stochastic processes. We compute the probability density function for
the IF for fixed time, which extends a result known for wide-sense stationary
processes to... |
1007.1079 | Intelligent data analysis based on the complex network theory methods: a
case study | cs.IR physics.data-an | The development of modern information technologies permits to collect and to
analyze huge amounts of statistical data in different spheres of life. The main
problem is not to only to collect but to process all relevant information. The
purpose of our work is to show the example of intelligent data analysis in such
co... |
1007.1087 | Competition of Wireless Providers for Atomic Users | cs.IT cs.GT math.IT | We study a problem where wireless service providers compete for heterogenous
wireless users. The users differ in their utility functions as well as in the
perceived quality of service of individual providers. We model the interaction
of an arbitrary number of providers and users as a two-stage
multi-leader-follower g... |
1007.1174 | Group Based Interference Alignment | cs.IT math.IT | In the $K$-user single-input single-output (SISO) frequency-selective fading
interference channel, it is shown that the maximal achievable multiplexing gain
is almost surely $K/2$ by using interference alignment (IA). However, when the
signaling dimensions are limited, allocating all the resources to all users
simult... |
1007.1209 | Prime Factor Cyclotomic Fourier Transforms with Reduced Complexity over
Finite Fields | cs.IT math.IT | Discrete Fourier transforms~(DFTs) over finite fields have widespread
applications in error correction coding. Hence, reducing the computational
complexities of DFTs is of great significance, especially for long DFTs as
increasingly longer error control codes are chosen for digital communication
and storage systems. ... |
1007.1213 | Composite Cyclotomic Fourier Transforms with Reduced Complexities | cs.IT math.IT | Discrete Fourier transforms~(DFTs) over finite fields have widespread
applications in digital communication and storage systems. Hence, reducing the
computational complexities of DFTs is of great significance. Recently proposed
cyclotomic fast Fourier transforms (CFFTs) are promising due to their low
multiplicative c... |
1007.1234 | Stochastic stability of continuous time consensus protocols | math.OC cs.SY nlin.AO q-bio.NC | A unified approach to studying convergence and stochastic stability of
continuous time consensus protocols (CPs) is presented in this work. Our method
applies to networks with directed information flow; both cooperative and
noncooperative interactions; networks under weak stochastic forcing; and those
whose topology ... |
1007.1243 | New Results on the Capacity of the Gaussian Cognitive Interference
Channel | cs.IT math.IT | The capacity of the two-user Gaussian cognitive interference channel, a
variation of the classical interference channel where one of the transmitters
has knowledge of both messages, is known in several parameter regimes but
remains unknown in general. In this paper, we consider the following achievable
scheme: the co... |
1007.1253 | Efficient Sketches for the Set Query Problem | cs.DS cs.IT math.IT | We develop an algorithm for estimating the values of a vector x in R^n over a
support S of size k from a randomized sparse binary linear sketch Ax of size
O(k). Given Ax and S, we can recover x' with ||x' - x_S||_2 <= eps ||x -
x_S||_2 with probability at least 1 - k^{-\Omega(1)}. The recovery takes O(k)
time.
Whil... |
1007.1255 | Queue-Architecture and Stability Analysis in Cooperative Relay Networks | cs.NI cs.IT math.IT | An abstraction of the physical layer coding using bit pipes that are coupled
through data-rates is insufficient to capture notions such as node cooperation
in cooperative relay networks. Consequently, network-stability analyses based
on such abstractions are valid for non-cooperative schemes alone and
meaningless for... |
1007.1268 | Application of Data Mining to Network Intrusion Detection: Classifier
Selection Model | cs.NI cs.AI | As network attacks have increased in number and severity over the past few
years, intrusion detection system (IDS) is increasingly becoming a critical
component to secure the network. Due to large volumes of security audit data as
well as complex and dynamic properties of intrusion behaviors, optimizing
performance o... |
1007.1270 | How to Maximize User Satisfaction Degree in Multi-service IP Networks | cs.NI cs.AI | Bandwidth allocation is a fundamental problem in communication networks. With
current network moving towards the Future Internet model, the problem is
further intensified as network traffic demanding far from exceeds network
bandwidth capability. Maintaining a certain user satisfaction degree therefore
becomes a chal... |
1007.1272 | Binary is Good: A Binary Inference Framework for Primary User Separation
in Cognitive Radio Networks | cs.NI cs.IT math.IT | Primary users (PU) separation concerns with the issues of distinguishing and
characterizing primary users in cognitive radio (CR) networks. We argue the
need for PU separation in the context of collaborative spectrum sensing and
monitor selection. In this paper, we model the observations of monitors as
boolean OR mix... |
1007.1282 | A note on sample complexity of learning binary output neural networks
under fixed input distributions | cs.LG | We show that the learning sample complexity of a sigmoidal neural network
constructed by Sontag (1992) required to achieve a given misclassification
error under a fixed purely atomic distribution can grow arbitrarily fast: for
any prescribed rate of growth there is an input distribution having this rate
as the sample... |
1007.1361 | Top-K Color Queries for Document Retrieval | cs.DS cs.IR | In this paper we describe a new efficient (in fact optimal) data structure
for the {\em top-$K$ color problem}. Each element of an array $A$ is assigned a
color $c$ with priority $p(c)$. For a query range $[a,b]$ and a value $K$, we
have to report $K$ colors with the highest priorities among all colors that
occur in ... |
1007.1368 | Low Complexity Linear Programming Decoding of Nonbinary Linear Codes | cs.IT math.IT | Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has
attracted much attention in the research community in the past few years. The
aim of LP decoding is to develop an algorithm which has error-correcting
performance similar to that of the Sum-Product (SP) decoding algorithm, while
at the same... |
1007.1398 | Multi-environment model estimation for motility analysis of
Caenorhabditis Elegans | cs.CV | The nematode Caenorhabditis elegans is a well-known model organism used to
investigate fundamental questions in biology. Motility assays of this small
roundworm are designed to study the relationships between genes and behavior.
Commonly, motility analysis is used to classify nematode movements and
characterize them ... |
1007.1407 | Parallel Bit Interleaved Coded Modulation | cs.IT math.IT | A new variant of bit interleaved coded modulation (BICM) is proposed. In the
new scheme, called Parallel BICM, L identical binary codes are used in parallel
using a mapper, a newly proposed finite-length interleaver and a binary dither
signal. As opposed to previous approaches, the scheme does not rely on any
assumpt... |
1007.1432 | Improved RANSAC performance using simple, iterative minimal-set solvers | cs.CV | RANSAC is a popular technique for estimating model parameters in the presence
of outliers. The best speed is achieved when the minimum possible number of
points is used to estimate hypotheses for the model. Many useful problems can
be represented using polynomial constraints (for instance, the determinant of a
fundam... |
1007.1483 | On Inequalities Relating the Characteristic Function and Fisher
Information | cs.IT math.IT | A relationship between the Fisher information and the characteristic function
is established with the help of two inequalities. A necessary and sufficient
condition for equality is found. These results are used to determine the
asymptotic efficiency of a distributed estimation algorithm that uses constant
modulus tra... |
1007.1697 | Quantum Cyclic Code | cs.IT math.IT | In this paper, we define and study \emph{quantum cyclic codes}, a
generalisation of cyclic codes to the quantum setting. Previously studied
examples of quantum cyclic codes were all quantum codes obtained from classical
cyclic codes via the CSS construction. However, the codes that we study are
much more general. In ... |
1007.1708 | A Study on the Effectiveness of Different Patch Size and Shape for Eyes
and Mouth Detection | cs.CV | Template matching is one of the simplest methods used for eyes and mouth
detection. However, it can be modified and extended to become a powerful tool.
Since the patch itself plays a significant role in optimizing detection
performance, a study on the influence of patch size and shape is carried out.
The optimum patc... |
1007.1735 | Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and
Optimality | cs.IT cs.NI math.IT | Streaming erasure codes encode a source stream to guarantee that each source
packet is recovered within a fixed delay at the receiver over a burst-erasure
channel. This paper introduces diversity embedded streaming erasure codes
(DE-SCo), that provide a flexible tradeoff between the channel quality and
receiver delay... |
1007.1756 | Shannon Meets Nash on the Interference Channel | cs.IT cs.GT math.IT | The interference channel is the simplest communication scenario where
multiple autonomous users compete for shared resources. We combine game theory
and information theory to define a notion of a Nash equilibrium region of the
interference channel. The notion is game theoretic: it captures the selfish
behavior of eac... |
1007.1766 | An svm multiclassifier approach to land cover mapping | cs.AI | From the advent of the application of satellite imagery to land cover
mapping, one of the growing areas of research interest has been in the area of
image classification. Image classifiers are algorithms used to extract land
cover information from satellite imagery. Most of the initial research has
focussed on the de... |
1007.1768 | StochKit-FF: Efficient Systems Biology on Multicore Architectures | cs.CE q-bio.QM | The stochastic modelling of biological systems is an informative, and in some
cases, very adequate technique, which may however result in being more
expensive than other modelling approaches, such as differential equations. We
present StochKit-FF, a parallel version of StochKit, a reference toolkit for
stochastic sim... |
1007.1778 | Quantum Error Correction beyond the Bounded Distance Decoding Limit | cs.IT math.IT quant-ph | In this paper, we consider quantum error correction over depolarizing
channels with non-binary low-density parity-check codes defined over Galois
field of size $2^p$ . The proposed quantum error correcting codes are based on
the binary quasi-cyclic CSS (Calderbank, Shor and Steane) codes. The resulting
quantum codes ... |
1007.1799 | Discrete denoising of heterogenous two-dimensional data | cs.IT math.IT | We consider discrete denoising of two-dimensional data with characteristics
that may be varying abruptly between regions.
Using a quadtree decomposition technique and space-filling curves, we extend
the recently developed S-DUDE (Shifting Discrete Universal DEnoiser), which was
tailored to one-dimensional data, to ... |
1007.1800 | Multimode Control Attacks on Elections | cs.GT cs.CC cs.DS cs.MA | In 1992, Bartholdi, Tovey, and Trick opened the study of control attacks on
elections---attempts to improve the election outcome by such actions as
adding/deleting candidates or voters. That work has led to many results on how
algorithms can be used to find attacks on elections and how
complexity-theoretic hardness r... |
1007.1811 | On the Capacity of a Class of Cognitive Z-interference Channels | cs.IT math.IT | We study a special class of the cognitive radio channel in which the receiver
of the cognitive pair does not suffer interference from the primary user.
Previously developed general encoding schemes for this channel are complex as
they attempt to cope with arbitrary channel conditions, which leads to rate
regions that... |
1007.1819 | Rewritable Codes for Flash Memories Based Upon Lattices, and an Example
Using the E8 Lattice | cs.IT math.IT | A rewriting code construction for flash memories based upon lattices is
described. The values stored in flash cells correspond to lattice points. This
construction encodes information to lattice points in such a way that data can
be written to the memory multiple times without decreasing the cell values. The
construc... |
1007.1852 | A Generalized Sampling Theorem for Stable Reconstructions in Arbitrary
Bases | math.NA cs.IT math.IT | We introduce a generalized framework for sampling and reconstruction in
separable Hilbert spaces. Specifically, we establish that it is always possible
to stably reconstruct a vector in an arbitrary Riesz basis from sufficiently
many of its samples in any other Riesz basis. This framework can be viewed as
an extensio... |
1007.1938 | Affine equivalence of cubic homogeneous rotation symmetric Boolean
functions | cs.IT math.IT math.NT | Homogeneous rotation symmetric Boolean functions have been extensively
studied in recent years because of their applications in cryptography. Little
is known about the basic question of when two such functions are affine
equivalent. The simplest case of quadratic rotation symmetric functions which
are generated by cy... |
1007.1944 | LHC Databases on the Grid: Achievements and Open Issues | cs.DB cs.DC hep-ex physics.data-an | To extract physics results from the recorded data, the LHC experiments are
using Grid computing infrastructure. The event data processing on the Grid
requires scalable access to non-event data (detector conditions, calibrations,
etc.) stored in relational databases. The database-resident data are critical
for the eve... |
1007.1986 | Achievable Error Exponents in the Gaussian Channel with Rate-Limited
Feedback | cs.IT math.IT | We investigate the achievable error probability in communication over an AWGN
discrete time memoryless channel with noiseless delay-less rate-limited
feedback. For the case where the feedback rate R_FB is lower than the data rate
R transmitted over the forward channel, we show that the decay of the
probability of err... |
1007.2049 | Reinforcement Learning via AIXI Approximation | cs.LG | This paper introduces a principled approach for the design of a scalable
general reinforcement learning agent. This approach is based on a direct
approximation of AIXI, a Bayesian optimality notion for general reinforcement
learning agents. Previously, it has been unclear whether the theory of AIXI
could motivate the... |
1007.2071 | Independent Component Analysis Over Galois Fields | cs.IT math.IT physics.data-an | We consider the framework of Independent Component Analysis (ICA) for the
case where the independent sources and their linear mixtures all reside in a
Galois field of prime order P. Similarities and differences from the classical
ICA framework (over the Real field) are explored. We show that a necessary and
sufficien... |
1007.2075 | Consistency of Feature Markov Processes | cs.LG cs.IT math.IT | We are studying long term sequence prediction (forecasting). We approach this
by investigating criteria for choosing a compact useful state representation.
The state is supposed to summarize useful information from the history. We want
a method that is asymptotically consistent in the sense it will provably
eventuall... |
1007.2088 | A Multi-hop Multi-source Algebraic Watchdog | cs.CR cs.IT math.IT | In our previous work "An Algebraic Watchdog for Wireless Network Coding", we
proposed a new scheme in which nodes can detect malicious behaviors
probabilistically, police their downstream neighbors locally using overheard
messages; thus, provide a secure global "self-checking network". As the first
building block of ... |
1007.2119 | Free Probability based Capacity Calculation of Multiantenna Gaussian
Fading Channels with Cochannel Interference | cs.IT math.IT | During the last decade, it has been well understood that communication over
multiple antennas can increase linearly the multiplexing capacity gain and
provide large spectral efficiency improvements. However, the majority of
studies in this area were carried out ignoring cochannel interference. Only a
small number of ... |
1007.2212 | Optimal Path Planning under Temporal Logic Constraints | cs.RO | In this paper we present a method for automatically generating optimal robot
trajectories satisfying high level mission specifications. The motion of the
robot in the environment is modeled as a general transition system, enhanced
with weighted transitions. The mission is specified by a general linear
temporal logic ... |
1007.2238 | Online Algorithms for the Multi-Armed Bandit Problem with Markovian
Rewards | math.OC cs.LG | We consider the classical multi-armed bandit problem with Markovian rewards.
When played an arm changes its state in a Markovian fashion while it remains
frozen when not played. The player receives a state-dependent reward each time
it plays an arm. The number of states and the state transition probabilities of
an ar... |
1007.2315 | On extracting common random bits from correlated sources | cs.IT math.IT | Suppose Alice and Bob receive strings of unbiased independent but noisy bits
from some random source. They wish to use their respective strings to extract a
common sequence of random bits with high probability but without communicating.
How many such bits can they extract? The trivial strategy of outputting the
first... |
1007.2354 | Nonuniform Sparse Recovery with Subgaussian Matrices | cs.IT math.IT math.PR | Compressive sensing predicts that sufficiently sparse vectors can be
recovered from highly incomplete information. Efficient recovery methods such
as $\ell_1$-minimization find the sparsest solution to certain systems of
equations. Random matrices have become a popular choice for the measurement
matrix. Indeed, near-... |
1007.2364 | A Note on Semantic Web Services Specification and Composition in
Constructive Description Logics | cs.AI cs.LO | The idea of the Semantic Web is to annotate Web content and services with
computer interpretable descriptions with the aim to automatize many tasks
currently performed by human users. In the context of Web services, one of the
most interesting tasks is their composition. In this paper we formalize this
problem in the... |
1007.2377 | Performance bounds for expander-based compressed sensing in Poisson
noise | cs.IT math.IT | This paper provides performance bounds for compressed sensing in the presence
of Poisson noise using expander graphs. The Poisson noise model is appropriate
for a variety of applications, including low-light imaging and digital
streaming, where the signal-independent and/or bounded noise models used in the
compressed... |
1007.2401 | Double Circulant Minimum Storage Regenerating Codes | cs.DC cs.IT cs.NI math.IT | A newer version will appear soon
|
1007.2442 | Neural Network Based Reconstruction of a 3D Object from a 2D Wireframe | cs.CV | We propose a new approach for constructing a 3D representation from a 2D
wireframe drawing. A drawing is simply a parallel projection of a 3D object
onto a 2D surface; humans are able to recreate mental 3D models from 2D
representations very easily, yet the process is very difficult to emulate
computationally. We hyp... |
1007.2449 | A Brief Introduction to Temporality and Causality | cs.LG cs.AI | Causality is a non-obvious concept that is often considered to be related to
temporality. In this paper we present a number of past and present approaches
to the definition of temporality and causality from philosophical, physical,
and computational points of view. We note that time is an important ingredient
in many... |
1007.2534 | A general method for deciding about logically constrained issues | cs.AI | A general method is given for revising degrees of belief and arriving at
consistent decisions about a system of logically constrained issues. In
contrast to other works about belief revision, here the constraints are assumed
to be fixed. The method has two variants, dual of each other, whose revised
degrees of belief... |
1007.2738 | Consensus Computation in Unreliable Networks: A System Theoretic
Approach | math.OC cs.SY | This work addresses the problem of ensuring trustworthy computation in a
linear consensus network. A solution to this problem is relevant for several
tasks in multi-agent systems including motion coordination, clock
synchronization, and cooperative estimation. In a linear consensus network, we
allow for the presence ... |
1007.2814 | A Unifying Framework for Local Throughput in Wireless Networks | cs.NI cs.IT math.IT | With the increased competition for the electromagnetic spectrum, it is
important to characterize the impact of interference in the performance of a
wireless network, which is traditionally measured by its throughput. This paper
presents a unifying framework for characterizing the local throughput in
wireless networks... |
1007.2827 | Data processing theorems and the second law of thermodynamics | cs.IT cond-mat.stat-mech math.IT | We draw relationships between the generalized data processing theorems of
Zakai and Ziv (1973 and 1975) and the dynamical version of the second law of
thermodynamics, a.k.a. the Boltzmann H-Theorem, which asserts that the Shannon
entropy, $H(X_t)$, pertaining to a finite--state Markov process $\{X_t\}$, is
monotonica... |
1007.2855 | Quantum Channel Capacities | cs.IT math.IT quant-ph | A quantum communication channel can be put to many uses: it can transmit
classical information, private classical information, or quantum information.
It can be used alone, with shared entanglement, or together with other
channels. For each of these settings there is a capacity that quantifies a
channel's potential f... |
1007.2876 | The Spread of Evidence-Poor Medicine via Flawed Social-Network Analysis | stat.ME cs.SI physics.soc-ph | The chronic widespread misuse of statistics is usually inadvertent, not
intentional. We find cautionary examples in a series of recent papers by
Christakis and Fowler that advance statistical arguments for the transmission
via social networks of various personal characteristics, including obesity,
smoking cessation, ... |
1007.2928 | Encoding Complexity of Network Coding with Two Simple Multicast Sessions | cs.IT math.IT | The encoding complexity of network coding for single multicast networks has
been intensively studied from several aspects: e.g., the time complexity, the
required number of encoding links, and the required field size for a linear
code solution. However, these issues as well as the solvability are less
understood for ... |
1007.2945 | When is a Function Securely Computable? | cs.IT math.IT | A subset of a set of terminals that observe correlated signals seek to
compute a given function of the signals using public communication. It is
required that the value of the function be kept secret from an eavesdropper
with access to the communication. We show that the function is securely
computable if and only if... |
1007.2958 | A Machine Learning Approach to Recovery of Scene Geometry from Images | cs.CV cs.LG | Recovering the 3D structure of the scene from images yields useful
information for tasks such as shape and scene recognition, object detection, or
motion planning and object grasping in robotics. In this thesis, we introduce a
general machine learning approach called unsupervised CRF learning based on
maximizing the ... |
1007.2980 | Publishing and Discovery of Mobile Web Services in Peer to Peer Networks | cs.IR cs.NI | It is now feasible to host Web Services on a mobile device due to the
advances in cellular devices and mobile communication technologies. However,
the reliability, usability and responsiveness of the Mobile Hosts depend on
various factors including the characteristics of available network,
computational resources, an... |
1007.3075 | Resolving the Connectivity-Throughput Trade-Off in Random Networks | cs.IT math.IT | The discrepancy between the upper bound on throughput in wireless networks
and the throughput scaling in random networks which is also known as the
connectivity-throughput trade-off is analyzed. In a random network with
$\lambda$ nodes per unit area, throughput is found to scale by a factor of
$\sqrt{\log{\lambda}}$ ... |
1007.3105 | A Selection Region Based Routing Protocol for Random Mobile ad hoc
Networks | cs.IT math.IT | We propose a selection region based multi-hop routing protocol for random
mobile ad hoc networks, where the selection region is defined by two
parameters: a reference distance and a selection angle. At each hop, a relay is
chosen as the nearest node to the transmitter that is located within the
selection region. By a... |
1007.3108 | Second-Order Weight Distributions | cs.IT math.IT | A fundamental property of codes, the second-order weight distribution, is
proposed to solve the problems such as computing second moments of weight
distributions of linear code ensembles. A series of results, parallel to those
for weight distributions, is established for second-order weight distributions.
In particul... |
1007.3159 | Logic-Based Decision Support for Strategic Environmental Assessment | cs.AI | Strategic Environmental Assessment is a procedure aimed at introducing
systematic assessment of the environmental effects of plans and programs. This
procedure is based on the so-called coaxial matrices that define dependencies
between plan activities (infrastructures, plants, resource extractions,
buildings, etc.) a... |
1007.3208 | Link Graph Analysis for Adult Images Classification | cs.IR | In order to protect an image search engine's users from undesirable results
adult images' classifier should be built. The information about links from
websites to images is employed to create such a classifier. These links are
represented as a bipartite website-image graph. Each vertex is equipped with
scores of adul... |
1007.3223 | Testing and Debugging Techniques for Answer Set Solver Development | cs.AI cs.SE | This paper develops automated testing and debugging techniques for answer set
solver development. We describe a flexible grammar-based black-box ASP fuzz
testing tool which is able to reveal various defects such as unsound and
incomplete behavior, i.e. invalid answer sets and inability to find existing
solutions, in ... |
1007.3254 | Distinguishing Fact from Fiction: Pattern Recognition in Texts Using
Complex Networks | cs.CL cond-mat.stat-mech physics.soc-ph | We establish concrete mathematical criteria to distinguish between different
kinds of written storytelling, fictional and non-fictional. Specifically, we
constructed a semantic network from both novels and news stories, with $N$
independent words as vertices or nodes, and edges or links allotted to words
occurring wi... |
1007.3275 | An Algorithmic Structuration of a Type System for an Orthogonal
Object/Relational Model | cs.DB | Date and Darwen have proposed a theory of types, the latter forms the basis
of a detailed presentation of a panoply of simple and complex types. However,
this proposal has not been structured in a formal system. Specifically, Date
and Darwen haven't indicated the formalism of the type system that corresponds
to the t... |
1007.3315 | Multi-Source Transmission for Wireless Relay Networks with Linear
Complexity | cs.IT math.IT | This paper considers transmission schemes in multi-access relay networks
(MARNs) where $J$ single-antenna sources send independent information to one
$N$-antenna destination through one $M$-antenna relay. For complexity
considerations, we propose a linear framework, where the relay linearly
transforms its received si... |
1007.3384 | Relative entropy via non-sequential recursive pair substitutions | cs.IT cond-mat.stat-mech math.IT | The entropy of an ergodic source is the limit of properly rescaled 1-block
entropies of sources obtained applying successive non-sequential recursive
pairs substitutions (see P. Grassberger 2002 ArXiv:physics/0207023 and D.
Benedetto, E. Caglioti and D. Gabrielli 2006 Jour. Stat. Mech. Theo. Exp. 09
doi:10.1088/1742.... |
1007.3424 | Bacterial Community Reconstruction Using A Single Sequencing Reaction | q-bio.GN cs.IT math.IT q-bio.QM stat.AP stat.CO | Bacteria are the unseen majority on our planet, with millions of species and
comprising most of the living protoplasm. While current methods enable in-depth
study of a small number of communities, a simple tool for breadth studies of
bacterial population composition in a large number of samples is lacking. We
propose... |
1007.3515 | Query-driven Procedures for Hybrid MKNF Knowledge Bases | cs.AI | Hybrid MKNF knowledge bases are one of the most prominent tightly integrated
combinations of open-world ontology languages with closed-world (non-monotonic)
rule paradigms. The definition of Hybrid MKNF is parametric on the description
logic (DL) underlying the ontology language, in the sense that non-monotonic
rules... |
1007.3518 | Secret Key Generation for a Pairwise Independent Network Model | cs.IT math.IT | We consider secret key generation for a "pairwise independent network" model
in which every pair of terminals observes correlated sources that are
independent of sources observed by all other pairs of terminals. The terminals
are then allowed to communicate publicly with all such communication being
observed by all t... |
1007.3564 | Manifold Elastic Net: A Unified Framework for Sparse Dimension Reduction | cs.LG stat.ML | It is difficult to find the optimal sparse solution of a manifold learning
based dimensionality reduction algorithm. The lasso or the elastic net
penalized manifold learning based dimensionality reduction is not directly a
lasso penalized least square problem and thus the least angle regression (LARS)
(Efron et al. \... |
1007.3568 | Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes | cs.IT cs.CR math.IT | Suppose Alice wishes to send messages to Bob through a communication channel
C_1, but her transmissions also reach an eavesdropper Eve through another
channel C_2. The goal is to design a coding scheme that makes it possible for
Alice to communicate both reliably and securely. Reliability is measured in
terms of Bob'... |
1007.3588 | Improved construction of irregular progressive edge-growth Tanner graphs | cs.IT math.IT | The progressive edge-growth algorithm is a well-known procedure to construct
regular and irregular low-density parity-check codes. In this paper, we propose
a modification of the original algorithm that improves the performance of these
codes in the waterfall region when constructing codes complying with both,
check ... |
1007.3622 | A generalized risk approach to path inference based on hidden Markov
models | stat.ML cs.LG stat.CO | Motivated by the unceasing interest in hidden Markov models (HMMs), this
paper re-examines hidden path inference in these models, using primarily a
risk-based framework. While the most common maximum a posteriori (MAP), or
Viterbi, path estimator and the minimum error, or Posterior Decoder (PD), have
long been around... |
1007.3661 | Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry
Codes | cs.IT math.IT | Polar codes, introduced by Arikan, achieve symmetric capacity of any discrete
memoryless channels under low encoding and decoding complexity. Recently,
non-binary polar codes have been investigated. In this paper, we calculate
error probability of non-binary polar codes constructed on the basis of
Reed-Solomon matric... |
1007.3663 | A decidable subclass of finitary programs | cs.AI | Answer set programming - the most popular problem solving paradigm based on
logic programs - has been recently extended to support uninterpreted function
symbols. All of these approaches have some limitation. In this paper we propose
a class of programs called FP2 that enjoys a different trade-off between
expressiven... |
1007.3676 | (n,K)-user Interference Channels: Degrees of Freedom | cs.IT math.IT | We analyze the gains of opportunistic communication in multiuser interference
channels. Consider a fully connected $n$-user Gaussian interference channel. At
each time instance only $K\leq n$ transmitters are allowed to be communicating
with their respective receivers and the remaining $(n-K)$ transmitter-receiver
pa... |
1007.3700 | Logic Programming for Finding Models in the Logics of Knowledge and its
Applications: A Case Study | cs.AI cs.LO | The logics of knowledge are modal logics that have been shown to be effective
in representing and reasoning about knowledge in multi-agent domains.
Relatively few computational frameworks for dealing with computation of models
and useful transformations in logics of knowledge (e.g., to support multi-agent
planning wi... |
1007.3706 | Cooperative Convex Optimization in Networked Systems: Augmented
Lagrangian Algorithms with Directed Gossip Communication | cs.IT math.IT | We study distributed optimization in networked systems, where nodes cooperate
to find the optimal quantity of common interest, x=x^\star. The objective
function of the corresponding optimization problem is the sum of private (known
only by a node,) convex, nodes' objectives and each node imposes a private
convex cons... |
1007.3753 | Fast L1-Minimization Algorithms For Robust Face Recognition | cs.CV cs.NA | L1-minimization refers to finding the minimum L1-norm solution to an
underdetermined linear system b=Ax. Under certain conditions as described in
compressive sensing theory, the minimum L1-norm solution is also the sparsest
solution. In this paper, our study addresses the speed and scalability of its
algorithms. In p... |
1007.3772 | Video Event Recognition for Surveillance Applications (VERSA) | cs.CV | VERSA provides a general-purpose framework for defining and recognizing
events in live or recorded surveillance video streams. The approach for event
recognition in VERSA is using a declarative logic language to define the
spatial and temporal relationships that characterize a given event or activity.
Doing so requir... |
1007.3781 | Multiresolution Cube Estimators for Sensor Network Aggregate Queries | cs.DB | In this work we present in-network techniques to improve the efficiency of
spatial aggregate queries. Such queries are very common in a sensornet setting,
demanding more targeted techniques for their handling. Our approach constructs
and maintains multi-resolution cube hierarchies inside the network, which can
be con... |
1007.3799 | Adapting to the Shifting Intent of Search Queries | cs.LG | Search engines today present results that are often oblivious to abrupt
shifts in intent. For example, the query `independence day' usually refers to a
US holiday, but the intent of this query abruptly changed during the release of
a major film by that name. While no studies exactly quantify the magnitude of
intent-s... |
1007.3808 | Characterization of Graph-cover Pseudocodewords of Codes over $F_3$ | cs.IT math.IT | Linear-programming pseudocodewords play a pivotal role in our understanding
of the linear-programming decoding algorithms. These pseudocodewords are known
to be equivalent to the graph-cover pseudocodewords. The latter
pseudocodewords, when viewed as points in the multidimensional Euclidean space,
lie inside a fundam... |
1007.3858 | CHR(PRISM)-based Probabilistic Logic Learning | cs.PL cs.AI cs.LG cs.LO | PRISM is an extension of Prolog with probabilistic predicates and built-in
support for expectation-maximization learning. Constraint Handling Rules (CHR)
is a high-level programming language based on multi-headed multiset rewrite
rules.
In this paper, we introduce a new probabilistic logic formalism, called
CHRiSM,... |
1007.3881 | Orthogonal multifilters image processing of astronomical images from
scanned photographic plates | cs.CV cs.NA | In this paper orthogonal multifilters for astronomical image processing are
presented. We obtained new orthogonal multifilters based on the orthogonal
wavelet of Haar and Daubechies. Recently, multiwavelets have been introduced as
a more powerful multiscale analysis tool. It adds several degrees of freedom in
multifi... |
1007.3884 | New Results for the MAP Problem in Bayesian Networks | cs.AI cs.CC stat.ML | This paper presents new results for the (partial) maximum a posteriori (MAP)
problem in Bayesian networks, which is the problem of querying the most
probable state configuration of some of the network variables given evidence.
First, it is demonstrated that the problem remains hard even in networks with
very simple t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.