id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1007.3896 | The State-Dependent Multiple-Access Channel with States Available at a
Cribbing Encoder | cs.IT math.IT | The two-user discrete memoryless state-dependent multiple-access channel
(MAC) models a scenario in which two encoders transmit independent messages to
a single receiver via a MAC whose channel law is governed by the pair of
encoders' inputs and by an i.i.d. state random variable. In the cooperative
state-dependent M... |
1007.3906 | A colorful origin for the genetic code: Information theory, statistical
mechanics and the emergence of molecular codes | q-bio.GN cond-mat.stat-mech cs.IT math.IT physics.bio-ph q-bio.MN q-bio.PE | The genetic code maps the sixty-four nucleotide triplets (codons) to twenty
amino-acids. While the biochemical details of this code were unraveled long
ago, its origin is still obscure. We review information-theoretic approaches to
the problem of the code's origin and discuss the results of a recent work that
treats ... |
1007.3926 | Ear Identification by Fusion of Segmented Slice Regions using Invariant
Features: An Experimental Manifold with Dual Fusion Approach | cs.CV | This paper proposes a robust ear identification system which is developed by
fusing SIFT features of color segmented slice regions of an ear. The proposed
ear identification method makes use of Gaussian mixture model (GMM) to build
ear model with mixture of Gaussian using vector quantization algorithm and K-L
diverge... |
1007.3934 | Distributed Detection over Random Networks: Large Deviations Analysis | cs.IT math.IT | We show by large deviations theory that the performance of running consensus
is asymptotically equivalent to the performance of the (asymptotically) optimal
centralized detector. Running consensus is a stochastic approximation type
algorithm for distributed detection in sensor networks, recently proposed. At
each tim... |
1007.4002 | Continuum Percolation in the Intrinsically Secure Communications Graph | cs.IT cs.NI math.IT | The intrinsically secure communications graph (iS-graph) is a random graph
which captures the connections that can be securely established over a
large-scale network, in the presence of eavesdroppers. It is based on
principles of information-theoretic security, widely accepted as the strictest
notion of security. In ... |
1007.4040 | Loop Formulas for Description Logic Programs | cs.AI cs.LO | Description Logic Programs (dl-programs) proposed by Eiter et al. constitute
an elegant yet powerful formalism for the integration of answer set programming
with description logics, for the Semantic Web. In this paper, we generalize the
notions of completion and loop formulas of logic programs to description logic
pr... |
1007.4053 | AstroGrid-D: Grid Technology for Astronomical Science | cs.DC astro-ph.IM cs.DB cs.NI | We present status and results of AstroGrid-D, a joint effort of
astrophysicists and computer scientists to employ grid technology for
scientific applications. AstroGrid-D provides access to a network of
distributed machines with a set of commands as well as software interfaces. It
allows simple use of computer and st... |
1007.4112 | Interference Alignment for Clustered Multicell Joint Decoding | cs.IT math.IT | Multicell joint processing has been proven to be very efficient in overcoming
the interference-limited nature of the cellular paradigm. However, for reasons
of practical implementation global multicell joint decoding is not feasible and
thus clusters of cooperating Base Stations have to be considered. In this
context... |
1007.4122 | A model for the emergence of the genetic code as a transition in a noisy
information channel | q-bio.QM cond-mat.stat-mech cs.IT math.IT physics.bio-ph | The genetic code maps the sixty-four nucleotide triplets (codons) to twenty
amino-acids. Some argue that the specific form of the code with its twenty
amino-acids might be a 'frozen accident' because of the overwhelming effects of
any further change. Others see it as a consequence of primordial biochemical
pathways a... |
1007.4124 | A simple model for the evolution of molecular codes driven by the
interplay of accuracy, diversity and cost | q-bio.QM cs.IT math.IT physics.bio-ph | Molecular codes translate information written in one type of molecules into
another molecular language. We introduce a simple model that treats molecular
codes as noisy information channels. An optimal code is a channel that conveys
information accurately and efficiently while keeping down the impact of errors.
The e... |
1007.4149 | A rate-distortion scenario for the emergence and evolution of noisy
molecular codes | q-bio.MN cond-mat.stat-mech cs.IT math.IT physics.bio-ph | We discuss, in terms of rate-distortion theory, the fitness of molecular
codes as the problem of designing an optimal information channel. The fitness
is governed by an interplay between the cost and quality of the channel, which
induces smoothness in the code. By incorporating this code fitness into
population dynam... |
1007.4221 | Building Blocks Propagation in Quantum-Inspired Genetic Algorithm | cs.NE | This paper presents an analysis of building blocks propagation in
Quantum-Inspired Genetic Algorithm, which belongs to a new class of
metaheuristics drawing their inspiration from both biological evolution and
unitary evolution of quantum systems. The expected number of quantum
chromosomes matching a schema has been ... |
1007.4236 | Sorting of Permutations by Cost-Constrained Transpositions | cs.IT math.IT | We address the problem of finding the minimum decomposition of a permutation
in terms of transpositions with non-uniform cost. For arbitrary non-negative
cost functions, we describe polynomial-time, constant-approximation
decomposition algorithms. For metric-path costs, we describe exact
polynomial-time decomposition... |
1007.4286 | Queue Length Asymptotics for Generalized Max-Weight Scheduling in the
presence of Heavy-Tailed Traffic | cs.NI cs.IT math.IT math.PR | We investigate the asymptotic behavior of the steady-state queue length
distribution under generalized max-weight scheduling in the presence of
heavy-tailed traffic. We consider a system consisting of two parallel queues,
served by a single server. One of the queues receives heavy-tailed traffic, and
the other receiv... |
1007.4294 | Properties of optimal prefix-free machines as instantaneous codes | cs.IT math.IT math.LO | The optimal prefix-free machine U is a universal decoding algorithm used to
define the notion of program-size complexity H(s) for a finite binary string s.
Since the set of all halting inputs for U is chosen to form a prefix-free set,
the optimal prefix-free machine U can be regarded as an instantaneous code for
nois... |
1007.4324 | Clustering Unstructured Data (Flat Files) - An Implementation in Text
Mining Tool | cs.IR | With the advancement of technology and reduced storage costs, individuals and
organizations are tending towards the usage of electronic media for storing
textual information and documents. It is time consuming for readers to retrieve
relevant information from unstructured document collection. It is easier and
less ti... |
1007.4371 | Improving the Sphere-Packing Bound for Binary Codes over Memoryless
Symmetric Channels | cs.IT math.IT | A lower bound on the minimum required code length of binary codes is
obtained. The bound is obtained based on observing a close relation between the
Ulam's liar game and channel coding. In fact, Spencer's optimal solution to the
game is used to derive this new bound which improves the famous Sphere-Packing
Bound.
|
1007.4418 | Distributed Source Coding of Correlated Gaussian Sources | cs.IT math.IT | We consider the distributed source coding system of $L$ correlated Gaussian
sources $Y_i,i=1,2,...,L$ which are noisy observations of correlated Gaussian
remote sources $X_k, k=1,2,...,K$. We assume that $Y^{L}={}^{\rm t}(Y_1,Y_2,$
$..., Y_L)$ is an observation of the source vector $X^K={}^{\rm t}(X_1,X_2,...,
X_K)$,... |
1007.4440 | Modeling correlated human dynamics | physics.soc-ph cs.SI | We empirically study the activity patterns of individual blog-posting and
find significant memory effects. The memory coefficient first decays in a power
law and then turns to an exponential form. Moreover, the inter-event time
distribution displays a heavy-tailed nature with power-law exponent dependent
on the activ... |
1007.4467 | Molecular Recognition as an Information Channel: The Role of
Conformational Changes | q-bio.BM cs.IT math.IT physics.bio-ph | Molecular recognition, which is essential in processing information in
biological systems, takes place in a crowded noisy biochemical environment and
requires the recognition of a specific target within a background of various
similar competing molecules. We consider molecular recognition as a
transmission of informa... |
1007.4471 | The physical language of molecular codes: A rate-distortion approach to
the evolution and emergence of biological codes | q-bio.BM cs.IT math.IT physics.bio-ph | The function of the organism hinges on the performance of its
information-processing networks, which convey information via molecular
recognition. Many paths within these networks utilize molecular codebooks, such
as the genetic code, to translate information written in one class of molecules
into another molecular "... |
1007.4523 | A Hybrid Model for Disease Spread and an Application to the SARS
Pandemic | cs.MA q-bio.OT | Pandemics can cause immense disruption and damage to communities and
societies. Thus far, modeling of pandemics has focused on either large-scale
difference equation models like the SIR and the SEIR models, or detailed
micro-level simulations, which are harder to apply at a global scale. This
paper introduces a hybri... |
1007.4527 | Optimal Design of a Molecular Recognizer: Molecular Recognition as a
Bayesian Signal Detection Problem | q-bio.MN cs.IT math.IT physics.bio-ph | Numerous biological functions-such as enzymatic catalysis, the immune
response system, and the DNA-protein regulatory network-rely on the ability of
molecules to specifically recognize target molecules within a large pool of
similar competitors in a noisy biochemical environment. Using the basic
framework of signal d... |
1007.4531 | Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision
Problems | cs.CV cs.DM math.CO math.OC | Rapid advances in image acquisition and storage technology underline the need
for algorithms that are capable of solving large scale image processing and
computer-vision problems. The minimum cut problem plays an important role in
processing many of these imaging problems such as, image and video
segmentation, stereo... |
1007.4540 | Broadcast Approach and Oblivious Cooperative Strategies for the Wireless
Relay Channel - Part I: Sequential Decode-and-Forward (SDF) | cs.IT math.IT | In this two part paper we consider a wireless network in which a source
terminal communicates with a destination and a relay terminal is occasionally
present in close proximity to the source without source's knowledge, suggesting
oblivious protocols. The source-relay channel is assumed to be a fixed gain
AWGN due to ... |
1007.4542 | Broadcast Approach and Oblivious Cooperative Strategies for the Wireless
Relay Channel - Part II: Block-Markov Decode-and-Forward (BMDF) | cs.IT math.IT | This is the second in a two part series of papers on incorporation of the
broadcast approach into oblivious protocols for the relay channel where the
source and the relay are collocated. Part I described the broadcast approach
and its benefits in terms of achievable rates when used with the sequential
decode- and-for... |
1007.4591 | Biomolecular electrostatics using a fast multipole BEM on up to 512 GPUs
and a billion unknowns | cs.CE physics.chem-ph physics.comp-ph | We present teraflop-scale calculations of biomolecular electrostatics enabled
by the combination of algorithmic and hardware acceleration. The algorithmic
acceleration is achieved with the fast multipole method (FMM) in conjunction
with a boundary element method (BEM) formulation of the continuum electrostatic
model,... |
1007.4604 | Concavity of Mutual Information Rate for Input-Restricted Finite-State
Memoryless Channels at High SNR | cs.IT math.IT | We consider a finite-state memoryless channel with i.i.d. channel state and
the input Markov process supported on a mixing finite-type constraint. We
discuss the asymptotic behavior of entropy rate of the output hidden Markov
chain and deduce that the mutual information rate of such a channel is concave
with respect ... |
1007.4636 | Computational Complexity Analysis of Simple Genetic Programming On Two
Problems Modeling Isolated Program Semantics | cs.NE cs.CC cs.DS | Analyzing the computational complexity of evolutionary algorithms for binary
search spaces has significantly increased their theoretical understanding. With
this paper, we start the computational complexity analysis of genetic
programming. We set up several simplified genetic programming algorithms and
analyze them o... |
1007.4707 | Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean
Functions | cs.NE | With this paper, we contribute to the understanding of ant colony
optimization (ACO) algorithms by formally analyzing their runtime behavior. We
study simple MAX-MIN ant systems on the class of linear pseudo-Boolean
functions defined on binary strings of length 'n'. Our investigations point out
how the progress accor... |
1007.4748 | Detecting influenza outbreaks by analyzing Twitter messages | cs.IR cs.CL | We analyze over 500 million Twitter messages from an eight month period and
find that tracking a small number of flu-related keywords allows us to forecast
future influenza rates with high accuracy, obtaining a 95% correlation with
national health statistics. We then analyze the robustness of this approach to
spuriou... |
1007.4767 | Formalization of Psychological Knowledge in Answer Set Programming and
its Application | cs.AI cs.LO | In this paper we explore the use of Answer Set Programming (ASP) to
formalize, and reason about, psychological knowledge. In the field of
psychology, a considerable amount of knowledge is still expressed using only
natural language. This lack of a formalization complicates accurate studies,
comparisons, and verificat... |
1007.4801 | MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel
States | cs.IT math.IT | In this work, a class of information theoretic secrecy problems is addressed
where the eavesdropper channel states are completely unknown to the legitimate
parties. In particular, MIMO wiretap channel models are considered where the
channel of the eavesdropper is arbitrarily varying over time. Assuming that the
numbe... |
1007.4840 | Greedy Maximal Scheduling in Wireless Networks | cs.IT cs.NI math.IT | In this paper we consider greedy scheduling algorithms in wireless networks,
i.e., the schedules are computed by adding links greedily based on some
priority vector. Two special cases are considered: 1) Longest Queue First (LQF)
scheduling, where the priorities are computed using queue lengths, and 2)
Static Priority... |
1007.4868 | Predicting Suicide Attacks: A Fuzzy Soft Set Approach | cs.AI | This paper models a decision support system to predict the occurance of
suicide attack in a given collection of cities. The system comprises two parts.
First part analyzes and identifies the factors which affect the prediction.
Admitting incomplete information and use of linguistic terms by experts, as two
characteri... |
1007.4872 | Asynchronous Capacity per Unit Cost | cs.IT math.IT | The capacity per unit cost, or equivalently minimum cost to transmit one bit,
is a well-studied quantity. It has been studied under the assumption of full
synchrony between the transmitter and the receiver. In many applications, such
as sensor networks, transmissions are very bursty, with small amounts of bits
arrivi... |
1007.4955 | Decentralized Dynamic Hop Selection and Power Control in Cognitive
Multi-hop Relay Systems | cs.IT math.IT | In this paper, we consider a cognitive multi-hop relay secondary user (SU)
system sharing the spectrum with some primary users (PU). The transmit power as
well as the hop selection of the cognitive relays can be dynamically adapted
according to the local (and causal) knowledge of the instantaneous channel
state infor... |
1007.5004 | A Repeated Game Formulation of Energy-Efficient Decentralized Power
Control | math-ph cs.GT cs.IT math.IT math.MP | Decentralized multiple access channels where each transmitter wants to
selfishly maximize his transmission energy-efficiency are considered.
Transmitters are assumed to choose freely their power control policy and
interact (through multiuser interference) several times. It is shown that the
corresponding conflict of ... |
1007.5024 | A Program-Level Approach to Revising Logic Programs under the Answer Set
Semantics | cs.AI | An approach to the revision of logic programs under the answer set semantics
is presented. For programs P and Q, the goal is to determine the answer sets
that correspond to the revision of P by Q, denoted P * Q. A fundamental
principle of classical (AGM) revision, and the one that guides the approach
here, is the suc... |
1007.5030 | Analysis of a Splitting Estimator for Rare Event Probabilities in
Jackson Networks | math.PR cs.CE stat.CO | We consider a standard splitting algorithm for the rare-event simulation of
overflow probabilities in any subset of stations in a Jackson network at level
n, starting at a fixed initial position. It was shown in DeanDup09 that a
subsolution to the Isaacs equation guarantees that a subexponential number of
function ev... |
1007.5044 | Symmetric Allocations for Distributed Storage | cs.IT math.IT | We consider the problem of optimally allocating a given total storage budget
in a distributed storage system. A source has a data object which it can code
and store over a set of storage nodes; it is allowed to store any amount of
coded data in each node, as long as the total amount of storage used does not
exceed th... |
1007.5080 | Analysis Framework for Opportunistic Spectrum OFDMA and its Application
to the IEEE 802.22 Standard | cs.NI cs.IT cs.PF math.IT | We present an analytical model that enables throughput evaluation of
Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA)
networks. The core feature of the model, based on a discrete time Markov chain,
is the consideration of different channel and subchannel allocation strategies
under diff... |
1007.5104 | An Empirical Study of Borda Manipulation | cs.AI | We study the problem of coalitional manipulation in elections using the
unweighted Borda rule. We provide empirical evidence of the manipulability of
Borda elections in the form of two new greedy manipulation algorithms based on
intuitions from the bin-packing and multiprocessor scheduling domains. Although
we have n... |
1007.5110 | Fully Dynamic Data Structure for Top-k Queries on Uncertain Data | cs.DB cs.DS | Top-$k$ queries allow end-users to focus on the most important (top-$k$)
answers amongst those which satisfy the query. In traditional databases, a user
defined score function assigns a score value to each tuple and a top-$k$ query
returns $k$ tuples with the highest score. In uncertain database, top-$k$
answer depen... |
1007.5114 | Where are the hard manipulation problems? | cs.AI cs.CC cs.GT cs.MA | One possible escape from the Gibbard-Satterthwaite theorem is computational
complexity. For example, it is NP-hard to compute if the STV rule can be
manipulated. However, there is increasing concern that such results may not re
ect the difficulty of manipulation in practice. In this tutorial, I survey
recent results ... |
1007.5120 | Stable marriage problems with quantitative preferences | cs.AI cs.GT cs.MA | The stable marriage problem is a well-known problem of matching men to women
so that no man and woman, who are not married to each other, both prefer each
other. Such a problem has a wide variety of practical applications, ranging
from matching resident doctors to hospitals, to matching students to schools or
more ge... |
1007.5129 | An Efficient Automatic Mass Classification Method In Digitized
Mammograms Using Artificial Neural Network | cs.CV | In this paper we present an efficient computer aided mass classification
method in digitized mammograms using Artificial Neural Network (ANN), which
performs benign-malignant classification on region of interest (ROI) that
contains mass. One of the major mammographic characteristics for mass
classification is texture... |
1007.5130 | Resource-Optimal Planning For An Autonomous Planetary Vehicle | cs.AI | Autonomous planetary vehicles, also known as rovers, are small autonomous
vehicles equipped with a variety of sensors used to perform exploration and
experiments on a planet's surface. Rovers work in a partially unknown
environment, with narrow energy/time/movement constraints and, typically, small
computational reso... |
1007.5133 | Comparison of Support Vector Machine and Back Propagation Neural Network
in Evaluating the Enterprise Financial Distress | cs.LG | Recently, applying the novel data mining techniques for evaluating enterprise
financial distress has received much research alternation. Support Vector
Machine (SVM) and back propagation neural (BPN) network has been applied
successfully in many areas with excellent generalization results, such as rule
extraction, cl... |
1007.5137 | Comparison Of Modified Dual Ternary Indexing And Multi-Key Hashing
Algorithms For Music Information Retrieval | cs.IR | In this work we have compared two indexing algorithms that have been used to
index and retrieve Carnatic music songs. We have compared a modified algorithm
of the Dual ternary indexing algorithm for music indexing and retrieval with
the multi-key hashing indexing algorithm proposed by us. The modification in
the dual... |
1007.5180 | CLP-based protein fragment assembly | cs.AI cs.CE cs.PL q-bio.QM | The paper investigates a novel approach, based on Constraint Logic
Programming (CLP), to predict the 3D conformation of a protein via fragments
assembly. The fragments are extracted by a preprocessor-also developed for this
work- from a database of known protein structures that clusters and classifies
the fragments a... |
1007.5282 | Noise-based deterministic logic and computing: a brief survey | physics.data-an cs.IT math.IT physics.gen-ph | A short survey is provided about our recent explorations of the young topic
of noise-based logic. After outlining the motivation behind noise-based
computation schemes, we present a short summary of our ongoing efforts in the
introduction, development and design of several noise-based deterministic
multivalued logic ... |
1007.5336 | The Value of Staying Current when Beamforming | cs.IT math.IT | Beamforming is a widely used method of provisioning high quality wireless
channels that leads to high data rates and simple decoding structures. It
requires feedback of Channel State Information (CSI) from receiver to
transmitter, and the accuracy of this information is limited by rate
constraints on the feedback cha... |
1007.5354 | Synchronization and Control in Intrinsic and Designed Computation: An
Information-Theoretic Analysis of Competing Models of Stochastic Computation | cond-mat.stat-mech cs.IT math.IT nlin.CD stat.ML | We adapt tools from information theory to analyze how an observer comes to
synchronize with the hidden states of a finitary, stationary stochastic
process. We show that synchronization is determined by both the process's
internal organization and by an observer's model of it. We analyze these
components using the con... |
1007.5408 | A Lower Bound to the Receiver Operating Characteristic of a Cognitive
Radio Network | cs.IT math.IT | Cooperative cognitive radio networks are investigated by using an
information-theoretic approach. This approach consists of interpreting the
decision process carried out at the fusion center as a binary (asymmetric)
channel, whose input is the presence of a primary signal and output is the
fusion center decision itse... |
1007.5421 | Inference with Constrained Hidden Markov Models in PRISM | cs.AI cs.LO cs.PL | A Hidden Markov Model (HMM) is a common statistical model which is widely
used for analysis of biological sequence data and other sequential phenomena.
In the present paper we show how HMMs can be extended with side-constraints and
present constraint solving techniques for efficient inference. Defining HMMs
with side... |
1007.5476 | Degree of Separation in Social Networks | cs.SI physics.soc-ph | According to the small-world concept, the entire world is connected through
short chains of acquaintances. In popular imagination this is captured in the
phrase six degrees of separation, implying that any two individuals are, at
most, six handshakes away. Social network analysis is the understanding of
concepts and ... |
1007.5514 | Distributed Beamforming in Wireless Multiuser Relay-Interference
Networks with Quantized Feedback | cs.IT math.IT | We study quantized beamforming in wireless amplify-and-forward
relay-interference networks with any number of transmitters, relays, and
receivers. We design the quantizer of the channel state information to minimize
the probability that at least one receiver incorrectly decodes its desired
symbol(s). Correspondingly,... |
1008.0042 | Weblog patterns and human dynamics with decreasing interest | cs.SI physics.soc-ph | Weblog is the fourth way of network exchange after Email, BBS and MSN. Most
bloggers begin to write blogs with great interest, and then their interests
gradually achieve a balance with the passage of time. In order to describe the
phenomenon that people's interest in something gradually decreases until it
reaches a b... |
1008.0044 | Network Control: A Rate-Distortion Perspective | cs.IT math.IT | Today's networks are controlled assuming pre-compressed and packetized data.
For video, this assumption of data packets abstracts out one of the key aspects
- the lossy compression problem. Therefore, first, this paper develops a
framework for network control that incorporates both source-rate and
source-distortion. ... |
1008.0045 | Universal and Robust Distributed Network Codes | cs.IT math.IT | Random linear network codes can be designed and implemented in a distributed
manner, with low computational complexity. However, these codes are classically
implemented over finite fields whose size depends on some global network
parameters (size of the network, the number of sinks) that may not be known
prior to cod... |
1008.0047 | A Scalable Limited Feedback Design for Network MIMO using Per-Cell
Product Codebook | cs.IT math.IT | In network MIMO systems, channel state information is required at the
transmitter side to multiplex users in the spatial domain. Since perfect
channel knowledge is difficult to obtain in practice, \emph{limited feedback}
is a widely accepted solution. The {\em dynamic number of cooperating BSs} and
{\em heterogeneous... |
1008.0063 | Evolutionary Approach to Test Generation for Functional BIST | cs.NE | In the paper, an evolutionary approach to test generation for functional BIST
is considered. The aim of the proposed scheme is to minimize the test data
volume by allowing the device's microprogram to test its logic, providing an
observation structure to the system, and generating appropriate test data for
the given ... |
1008.0140 | The Characteristics of the Factors That Govern the Preferred Force in
the Social Force Model of Pedestrian Movement | cs.IT math.IT | The social force model which belongs to the microscopic pedestrian studies
has been considered as the supremacy by many researchers and due to the main
feature of reproducing the self-organized phenomena resulted from pedestrian
dynamic. The Preferred Force which is a measurement of pedestrian's motivation
to adapt h... |
1008.0147 | Intervention Mechanism Design for Networks With Selfish Users | cs.GT cs.MA | We consider a multi-user network where a network manager and selfish users
interact. The network manager monitors the behavior of users and intervenes in
the interaction among users if necessary, while users make decisions
independently to optimize their individual objectives. In this paper, we
develop a framework of... |
1008.0170 | Symmetric categorial grammar: residuation and Galois connections | cs.CL | The Lambek-Grishin calculus is a symmetric extension of the Lambek calculus:
in addition to the residuated family of product, left and right division
operations of Lambek's original calculus, one also considers a family of
coproduct, right and left difference operations, related to the former by an
arrow-reversing du... |
1008.0178 | Dictionary for Sparse Representation of Chirp Echo in Broadband Radar | cs.IT math.IT | A new dictionary for sparse representation of chirp echo in broadband radar
is put forward in this paper. Different with chirplet decomposition which
decomposes echo in time-frequency plane, the dictionary transforms the sparsity
of target observed by radar in distance range to the sparsity in frequency
domain by str... |
1008.0212 | An FPTAS for Bargaining Networks with Unequal Bargaining Powers | cs.GT cs.MA | Bargaining networks model social or economic situations in which agents seek
to form the most lucrative partnership with another agent from among several
alternatives. There has been a flurry of recent research studying Nash
bargaining solutions (also called 'balanced outcomes') in bargaining networks,
so that we now... |
1008.0223 | Secure Joint Source-Channel Coding With Side Information | cs.IT math.IT | In this work, the problem of transmitting an i.i.d Gaussian source over an
i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is
considered. The intended receiver is assumed to have a certain minimum SNR and
the eavesdropper is assumed to have a strictly lower SNR compared to the
intended receiver... |
1008.0235 | Network Coding for Multiple Unicasts: An Interference Alignment Approach | cs.IT math.IT | This paper considers the problem of network coding for multiple unicast
connections in networks represented by directed acyclic graphs. The concept of
interference alignment, traditionally used in interference networks, is
extended to analyze the performance of linear network coding in this setup and
to provide a sys... |
1008.0273 | Threat assessment of a possible Vehicle-Born Improvised Explosive Device
using DSmT | cs.AI | This paper presents the solution about the threat of a VBIED (Vehicle-Born
Improvised Explosive Device) obtained with the DSmT (Dezert-Smarandache
Theory). This problem has been proposed recently to the authors by Simon
Maskell and John Lavery as a typical illustrative example to try to compare the
different approach... |
1008.0285 | On optimizing low SNR wireless networks using network coding | cs.IT cs.NI math.IT | The rate optimization for wireless networks with low SNR is investigated.
While the capacity in the limit of disappearing SNR is known to be linear for
fading and non-fading channels, we study the problem of operating in low SNR
wireless network with given node locations that use network coding over flows.
The model ... |
1008.0322 | Co-evolution is Incompatible with the Markov Assumption in Phylogenetics | q-bio.PE cs.AI cs.CE | Markov models are extensively used in the analysis of molecular evolution. A
recent line of research suggests that pairs of proteins with functional and
physical interactions co-evolve with each other. Here, by analyzing hundreds of
orthologous sets of three fungi and their co-evolutionary relations, we
demonstrate t... |
1008.0327 | Skew Constacyclic Codes over Finite Chain Rings | cs.IT math.IT math.RA | Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings
([8]) have been used to study codes. In this paper, we extend this concept to
finite chain rings. Properties of skew constacyclic codes generated by monic
right divisors of $x^n-\lambda$, where $\lambda$ is a unit element, are
exhibited. Wh... |
1008.0336 | Close Clustering Based Automated Color Image Annotation | cs.LG | Most image-search approaches today are based on the text based tags
associated with the images which are mostly human generated and are subject to
various kinds of errors. The results of a query to the image database thus can
often be misleading and may not satisfy the requirements of the user. In this
work we propos... |
1008.0420 | Modeling Network Coded TCP Throughput: A Simple Model and its Validation | cs.IT cs.NI math.IT | We analyze the performance of TCP and TCP with network coding (TCP/NC) in
lossy wireless networks. We build upon the simple framework introduced by
Padhye et al. and characterize the throughput behavior of classical TCP as well
as TCP/NC as a function of erasure rate, round-trip time, maximum window size,
and duratio... |
1008.0425 | Quantum Steganography and Quantum Error-Correction | quant-ph cs.IT math.IT | In the current thesis we first talk about the six-qubit quantum
error-correcting code and show its connections to entanglement-assisted
error-correcting coding theory and then to subsystem codes. This code bridges
the gap between the five-qubit (perfect) and Steane codes. We discuss two
methods to encode one qubit in... |
1008.0441 | An Optimal Trade-off between Content Freshness and Refresh Cost | cs.IR | Caching is an effective mechanism for reducing bandwidth usage and
alleviating server load. However, the use of caching entails a compromise
between content freshness and refresh cost. An excessive refresh allows a high
degree of content freshness at a greater cost of system resource. Conversely, a
deficient refresh ... |
1008.0502 | Fully automatic extraction of salient objects from videos in near
real-time | cs.CV cs.GR cs.MM | Automatic video segmentation plays an important role in a wide range of
computer vision and image processing applications. Recently, various methods
have been proposed for this purpose. The problem is that most of these methods
are far from real-time processing even for low-resolution videos due to the
complex proced... |
1008.0528 | Bounded Coordinate-Descent for Biological Sequence Classification in
High Dimensional Predictor Space | cs.LG | We present a framework for discriminative sequence classification where the
learner works directly in the high dimensional predictor space of all
subsequences in the training set. This is possible by employing a new
coordinate-descent algorithm coupled with bounding the magnitude of the
gradient for selecting discrim... |
1008.0539 | Assessing coupling dynamics from an ensemble of time series | cs.IT math.IT | Finding interdependency relations between (possibly multivariate) time series
provides valuable knowledge about the processes that generate the signals.
Information theory sets a natural framework for non-parametric measures of
several classes of statistical dependencies. However, a reliable estimation
from informati... |
1008.0548 | Image sequence interpolation using optimal control | cs.CV math.AP math.OC | The problem of the generation of an intermediate image between two given
images in an image sequence is considered. The problem is formulated as an
optimal control problem governed by a transport equation. This approach bears
similarities with the Horn \& Schunck method for optical flow calculation but
in fact the mo... |
1008.0557 | LiquidXML: Adaptive XML Content Redistribution | cs.DB | We propose to demonstrate LiquidXML, a platform for managing large corpora of
XML documents in large-scale P2P networks. All LiquidXML peers may publish XML
documents to be shared with all the network peers. The challenge then is to
efficiently (re-)distribute the published content in the network, possibly in
overlap... |
1008.0602 | A Framework for Partial Secrecy | cs.IT math.IT | We consider theoretical limits of partial secrecy in a setting where an
eavesdropper attempts to causally reconstruct an information sequence with low
distortion based on an intercepted transmission and the past of the sequence.
The transmitter and receiver have limited secret key at their disposal but not
enough to ... |
1008.0659 | Evaluating and Improving Modern Variable and Revision Ordering
Strategies in CSPs | cs.AI | A key factor that can dramatically reduce the search space during constraint
solving is the criterion under which the variable to be instantiated next is
selected. For this purpose numerous heuristics have been proposed. Some of the
best of such heuristics exploit information about failures gathered throughout
search... |
1008.0660 | Adaptive Branching for Constraint Satisfaction Problems | cs.AI | The two standard branching schemes for CSPs are d-way and 2-way branching.
Although it has been shown that in theory the latter can be exponentially more
effective than the former, there is a lack of empirical evidence showing such
differences. To investigate this, we initially make an experimental comparison
of the ... |
1008.0706 | Algorithmic Detection of Computer Generated Text | stat.ML cs.CL | Computer generated academic papers have been used to expose a lack of
thorough human review at several computer science conferences. We assess the
problem of classifying such documents. After identifying and evaluating several
quantifiable features of academic papers, we apply methods from machine
learning to build a... |
1008.0716 | Cross-Lingual Adaptation using Structural Correspondence Learning | cs.IR | Cross-lingual adaptation, a special case of domain adaptation, refers to the
transfer of classification knowledge between two languages. In this article we
describe an extension of Structural Correspondence Learning (SCL), a recently
proposed algorithm for domain adaptation, for cross-lingual adaptation. The
proposed... |
1008.0728 | Blind Spectrum Sensing by Information Theoretic Criteria for Cognitive
Radios | cs.IT math.IT | Spectrum sensing is a fundamental and critical issue for opportunistic
spectrum access in cognitive radio networks. Among the many spectrum sensing
methods, the information theoretic criteria (ITC) based method is a promising
blind method which can reliably detect the primary users while requiring little
prior inform... |
1008.0730 | A New SLNR-based Linear Precoding for Downlink Multi-User Multi-Stream
MIMO Systems | cs.IT math.IT | Signal-to-leakage-and-noise ratio (SLNR) is a promising criterion for linear
precoder design in multi-user (MU) multiple-input multiple-output (MIMO)
systems. It decouples the precoder design problem and makes closed-form
solution available. In this letter, we present a new linear precoding scheme by
slightly relaxin... |
1008.0735 | Superimposed XOR: Approaching Capacity Bounds of the Two-Way Relay
Channels | cs.IT math.IT | In two-way relay channels, bitwise XOR and symbol-level superposition coding
are two popular network-coding based relaying schemes. However, neither of them
can approach the capacity bound when the channels in the broadcast phase are
asymmetric. In this paper, we present a new physical layer network coding
(PLNC) sch... |
1008.0758 | A Chaotic Approach to Market Dynamics | nlin.CD cs.CE q-fin.TR | Economy is demanding new models, able to understand and predict the evolution
of markets. To this respect, Econophysics is offering models of markets as
complex systems, such as the gas-like model, able to predict money
distributions observed in real economies. However, this model reveals some
technical hitches to ex... |
1008.0775 | Systems Theoretic Techniques for Modeling, Control, and Decision Support
in Complex Dynamic Systems | cs.SY cs.AI cs.MA math.OC | We discuss the problems of modeling, control, and decision support in complex
dynamic systems from a general system theoretic point of view. The main
characteristics of complex systems and of system approach to complex system
study are considered. We provide an overview and analysis of known existing
paradigms and me... |
1008.0821 | Randomness extraction and asymptotic Hamming distance | math.LO cs.CC cs.IT cs.LO math.IT | We obtain a non-implication result in the Medvedev degrees by studying
sequences that are close to Martin-L\"of random in asymptotic Hamming distance.
Our result is that the class of stochastically bi-immune sets is not Medvedev
reducible to the class of sets having complex packing dimension 1.
|
1008.0823 | A Homogeneous Reaction Rule Language for Complex Event Processing | cs.AI | Event-driven automation of reactive functionalities for complex event
processing is an urgent need in today's distributed service-oriented
architectures and Web-based event-driven environments. An important problem to
be addressed is how to correctly and efficiently capture and process the
event-based behavioral, rea... |
1008.0826 | The Emerging Scholarly Brain | physics.soc-ph astro-ph.IM cs.DL cs.IR | It is now a commonplace observation that human society is becoming a coherent
super-organism, and that the information infrastructure forms its emerging
brain. Perhaps, as the underlying technologies are likely to become billions of
times more powerful than those we have today, we could say that we are now
building t... |
1008.0838 | Associative control processor with a rigid structure | cs.AR cs.AI | The approach of applying associative processor for decision making problem
was proposed. It focuses on hardware implementations of fuzzy processing
systems, associativity as effective management basis of fuzzy processor. The
structural approach is being developed resulting in a quite simple and compact
parallel assoc... |
1008.0851 | Identification of Parametric Underspread Linear Systems and
Super-Resolution Radar | cs.IT math.IT | Identification of time-varying linear systems, which introduce both
time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task
in many engineering applications. This paper studies the problem of
identification of underspread linear systems (ULSs), whose responses lie within
a unit-area region in th... |
1008.0885 | Deterministic Construction of Partial Fourier Compressed Sensing
Matrices Via Cyclic Difference Sets | cs.IT math.IT | Compressed sensing is a novel technique where one can recover sparse signals
from the undersampled measurements. This paper studies a $K \times N$ partial
Fourier measurement matrix for compressed sensing which is deterministically
constructed via cyclic difference sets (CDS). Precisely, the matrix is
constructed by ... |
1008.0919 | Compressive Sensing over Graphs | cs.IT cs.NI math.IT | In this paper, motivated by network inference and tomography applications, we
study the problem of compressive sensing for sparse signal vectors over graphs.
In particular, we are interested in recovering sparse vectors representing the
properties of the edges from a graph. Unlike existing compressive sensing
results... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.