id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1004.1158 | New MDS Self-Dual Codes over Large Finite Fields | cs.IT math.IT | We construct MDS Euclidean and Hermitian self-dual codes over large finite
fields of odd and even characteristics. Our codes arise from cyclic and
negacyclic duadic codes.
|
1004.1184 | Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and
Construction of Quasi-Cyclic LDPC Codes | cs.IT math.IT | This paper consists of three parts. The first part presents a large class of
new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose
parity-check matrices are constructed based on cyclic subgroups of finite
fields. Experimental results show that the codes constructed perform well over
the binary-input ... |
1004.1195 | Ergodic Capacity Analysis in Cognitive Radio Systems under Channel
Uncertainty | cs.IT math.IT | In this paper, pilot-symbol-assisted transmission in cognitive radio systems
over time selective flat fading channels is studied. It is assumed that causal
and noncausal Wiener filter estimators are used at the secondary receiver with
the aid of training symbols to obtain the channel side information (CSI) under
an i... |
1004.1198 | Structured LDPC Codes from Permutation Matrices Free of Small Trapping
Sets | cs.IT math.IT | This paper introduces a class of structured lowdensity parity-check (LDPC)
codes whose parity check matrices are arrays of permutation matrices. The
permutation matrices are obtained from Latin squares and form a finite field
under some matrix operations. They are chosen so that the Tanner graphs do not
contain subgr... |
1004.1215 | Regularized Richardson-Lucy Algorithm for Sparse Reconstruction of
Poissonian Images | cs.CV | Restoration of digital images from their degraded measurements has always
been a problem of great theoretical and practical importance in numerous
applications of imaging sciences. A specific solution to the problem of image
restoration is generally determined by the nature of degradation phenomenon as
well as by the... |
1004.1218 | The Noise-Sensitivity Phase Transition in Compressed Sensing | math.ST cs.IT math.IT stat.TH | Consider the noisy underdetermined system of linear equations: y=Ax0 + z0,
with n x N measurement matrix A, n < N, and Gaussian white noise z0 ~
N(0,\sigma^2 I). Both y and A are known, both x0 and z0 are unknown, and we
seek an approximation to x0. When x0 has few nonzeros, useful approximations
are obtained by l1-p... |
1004.1227 | Signature Recognition using Multi Scale Fourier Descriptor And Wavelet
Transform | cs.CV | This paper present a novel off-line signature recognition method based on
multi scale Fourier Descriptor and wavelet transform . The main steps of
constructing a signature recognition system are discussed and experiments on
real data sets show that the average error rate can reach 1%. Finally we
compare 8 distance me... |
1004.1229 | Feature-Based Adaptive Tolerance Tree (FATT): An Efficient Indexing
Technique for Content-Based Image Retrieval Using Wavelet Transform | cs.MM cs.DB | This paper introduces a novel indexing and access method, called Feature-
Based Adaptive Tolerance Tree (FATT), using wavelet transform is proposed to
organize large image data sets efficiently and to support popular image access
mechanisms like Content Based Image Retrieval (CBIR).Conventional database
systems are d... |
1004.1230 | Ontology-supported processing of clinical text using medical knowledge
integration for multi-label classification of diagnosis coding | cs.LG cs.AI | This paper discusses the knowledge integration of clinical information
extracted from distributed medical ontology in order to ameliorate a machine
learning-based multi-label coding assignment system. The proposed approach is
implemented using a decision tree based cascade hierarchical technique on the
university hos... |
1004.1236 | On Describing the Routing Capacity Regions of Networks | math.OC cs.IT cs.NI math.IT | The routing capacity region of networks with multiple unicast sessions can be
characterized using Farkas' lemma as an infinite set of linear inequalities. In
this paper this result is sharpened by exploiting properties of the solution
satisfied by each rate-tuple on the boundary of the capacity region, and a
finite d... |
1004.1249 | Semi-Automatic Index Tuning: Keeping DBAs in the Loop | cs.DB | To obtain good system performance, a DBA must choose a set of indices that is
appropriate for the workload. The system can aid in this challenging task by
providing recommendations for the index configuration. We propose a new index
recommendation technique, termed semi-automatic tuning, that keeps the DBA "in
the lo... |
1004.1257 | A Survey on Preprocessing Methods for Web Usage Data | cs.IR | World Wide Web is a huge repository of web pages and links. It provides
abundance of information for the Internet users. The growth of web is
tremendous as approximately one million pages are added daily. Users' accesses
are recorded in web logs. Because of the tremendous usage of web, the web log
files are growing a... |
1004.1277 | Closed-Form Expressions for Relay Selection with Secrecy Constraints | cs.IT math.IT | An opportunistic relay selection based on instantaneous knowledge of channels
is considered to increase security against eavesdroppers. The closed-form
expressions are derived for the average secrecy rates and the outage
probability when the cooperative networks use Decode-and-Forward (DF) or
Amplify-and-Forward (AF)... |
1004.1379 | Index coding via linear programming | cs.IT math.CO math.IT | Index Coding has received considerable attention recently motivated in part
by real-world applications and in part by its connection to Network Coding. The
basic setting of Index Coding encodes the problem input as an undirected graph
and the fundamental parameter is the broadcast rate $\beta$, the average
communicat... |
1004.1399 | A note on the entropy of repetitive sequences of symmetry group
permutations | cs.IT math.IT | The paper makes the observation that all orders of information entropy are
equal in signals composed of repeating units of distinct symbols where the
units can be classified as a member of a symmetry group. This leads to an
improved metric for measuring the information content of higher order entropies
in data such a... |
1004.1423 | Strong Secrecy and Reliable Byzantine Detection in the Presence of an
Untrusted Relay | cs.IT math.IT | We consider a Gaussian two-hop network where the source and the destination
can communicate only via a relay node who is both an eavesdropper and a
Byzantine adversary. Both the source and the destination nodes are allowed to
transmit, and the relay receives a superposition of their transmitted signals.
We propose a ... |
1004.1447 | The Total s-Energy of a Multiagent System | nlin.AO cs.MA math.OC | We introduce the "total s-energy" of a multiagent system with time-dependent
links. This provides a new analytical lens on bidirectional agreement dynamics,
which we use to bound the convergence rates of dynamical systems for
synchronization, flocking, opinion dynamics, and social epistemology.
|
1004.1503 | A New Construction for Constant Weight Codes | cs.IT math.IT | A new construction for constant weight codes is presented. The codes are
constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These
subspaces form a constant dimension code in the Grassmannian space
$\cG_q(n,k)$. Some of the constructed codes are optimal constant weight codes
with parameters not k... |
1004.1511 | Bounds for codes for a non-symmetric ternary channel | cs.IT math.IT | We provide bounds for codes for a non-symmetric channel or, equivalently, for
ternary codes with the Manhattan distance.
|
1004.1540 | Importance of Sources using the Repeated Fusion Method and the
Proportional Conflict Redistribution Rules #5 and #6 | cs.AI | We present in this paper some examples of how to compute by hand the PCR5
fusion rule for three sources, so the reader will better understand its
mechanism. We also take into consideration the importance of sources, which is
different from the classical discounting of sources.
|
1004.1564 | Polymatroids with Network Coding | cs.IT math.IT | The problem of network coding for multicasting a single source to multiple
sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which
they have established the celebrated max-flow mini-cut theorem on non-physical
information flow over a network of independent channels. On the other hand, in
1980, H... |
1004.1569 | A Streaming Approximation Algorithm for Klee's Measure Problem | cs.DS cs.DB | The efficient estimation of frequency moments of a data stream in one-pass
using limited space and time per item is one of the most fundamental problem in
data stream processing. An especially important estimation is to find the
number of distinct elements in a data stream, which is generally referred to as
the zerot... |
1004.1586 | Belief Propagation for Min-cost Network Flow: Convergence and
Correctness | cs.DM cs.AI | Message passing type algorithms such as the so-called Belief Propagation
algorithm have recently gained a lot of attention in the statistics, signal
processing and machine learning communities as attractive algorithms for
solving a variety of optimization and inference problems. As a decentralized,
easy to implement ... |
1004.1614 | PROBER: Ad-Hoc Debugging of Extraction and Integration Pipelines | cs.DB | Complex information extraction (IE) pipelines assembled by plumbing together
off-the-shelf operators, specially customized operators, and operators re-used
from other text processing pipelines are becoming an integral component of most
text processing frameworks. A critical task faced by the IE pipeline user is to
ru... |
1004.1675 | Fuzzy Logic of Speed and Steering Control System for Three Dimensional
Line Following of an Autonomous Vehicle | cs.RO | ... This paper is to describe exploratory research on the design of a modular
autonomous mobile robot controller. The controller incorporates a fuzzy logic
[8] [9] approach for steering and speed control [37], a FL approach for
ultrasound sensing and an overall expert system for guidance. The advantages of
a modular ... |
1004.1677 | Mining The Data From Distributed Database Using An Improved Mining
Algorithm | cs.DB | Association rule mining is an active data mining research area and most ARM
algorithms cater to a centralized environment. Centralized data mining to
discover useful patterns in distributed databases isn't always feasible because
merging data sets from different sites incurs huge network communication costs.
In this ... |
1004.1679 | A Robust Fuzzy Clustering Technique with Spatial Neighborhood
Information for Effective Medical Image Segmentation | cs.CV | Medical image segmentation demands an efficient and robust segmentation
algorithm against noise. The conventional fuzzy c-means algorithm is an
efficient clustering algorithm that is used in medical image segmentation. But
FCM is highly vulnerable to noise since it uses only intensity values for
clustering the images... |
1004.1686 | New Clustering Algorithm for Vector Quantization using Rotation of Error
Vector | cs.CV cs.IT math.IT | The paper presents new clustering algorithm. The proposed algorithm gives
less distortion as compared to well known Linde Buzo Gray (LBG) algorithm and
Kekre's Proportionate Error (KPE) Algorithm. Constant error is added every time
to split the clusters in LBG, resulting in formation of cluster in one
direction which... |
1004.1707 | A Survey on Space-Time Turbo Codes | cs.IT math.IT | As wireless communication systems look intently to compose the transition
from voice communication to interactive Internet data, achieving higher bit
rates becomes both increasingly desirable and challenging. Space-time coding
(STC) is a communications technique for wireless systems that inhabit multiple
transmit ant... |
1004.1729 | On the bias of BFS | cs.DM cs.DS cs.NI cs.SI stat.ME | Breadth First Search (BFS) and other graph traversal techniques are widely
used for measuring large unknown graphs, such as online social networks. It has
been empirically observed that an incomplete BFS is biased toward high degree
nodes. In contrast to more studied sampling techniques, such as random walks,
the pre... |
1004.1743 | An Analytical Study on Behavior of Clusters Using K Means, EM and K*
Means Algorithm | cs.LG cs.IR | Clustering is an unsupervised learning method that constitutes a cornerstone
of an intelligent data analysis process. It is used for the exploration of
inter-relationships among a collection of patterns, by organizing them into
homogeneous clusters. Clustering has been dynamically applied to a variety of
tasks in the... |
1004.1747 | Mobile Database System: Role of Mobility on the Query Processing | cs.DB | The rapidly expanding technology of mobile communication will give mobile
users capability of accessing information from anywhere and any time. The
wireless technology has made it possible to achieve continuous connectivity in
mobile environment. When the query is specified as continuous, the requesting
mobile user c... |
1004.1749 | Capacity Achieving Low Density Parity Check Lattices | cs.IT math.IT | The concept and existence of sphere-bound-achieving and capacity-achieving
lattices has been explained on AWGN channels by Forney. LDPC lattices,
introduced by Sadeghi, perform very well under iterative decoding algorithm. In
this work, we focus on an ensemble of regular LDPC lattices. We produce and
investigate an e... |
1004.1752 | Improved Two-Point Codes on Hermitian Curves | cs.IT math.AG math.IT math.NT | One-point codes on the Hermitian curve produce long codes with excellent
parameters. Feng and Rao introduced a modified construction that improves the
parameters while still using one-point divisors. A separate improvement of the
parameters was introduced by Matthews considering the classical construction
but with tw... |
1004.1768 | A New Approach to Lung Image Segmentation using Fuzzy Possibilistic
C-Means Algorithm | cs.CV | Image segmentation is a vital part of image processing. Segmentation has its
application widespread in the field of medical images in order to diagnose
curious diseases. The same medical images can be segmented manually. But the
accuracy of image segmentation using the segmentation algorithms is more when
compared wi... |
1004.1772 | Terrorism Event Classification Using Fuzzy Inference Systems | cs.AI | Terrorism has led to many problems in Thai societies, not only property
damage but also civilian casualties. Predicting terrorism activities in advance
can help prepare and manage risk from sabotage by these activities. This paper
proposes a framework focusing on event classification in terrorism domain using
fuzzy i... |
1004.1789 | SAR Image Segmentation using Vector Quantization Technique on Entropy
Images | cs.MM cs.CV | The development and application of various remote sensing platforms result in
the production of huge amounts of satellite image data. Therefore, there is an
increasing need for effective querying and browsing in these image databases.
In order to take advantage and make good use of satellite images data, we must
be a... |
1004.1794 | Probabilistic Semantic Web Mining Using Artificial Neural Analysis | cs.AI | Most of the web user's requirements are search or navigation time and getting
correctly matched result. These constrains can be satisfied with some
additional modules attached to the existing search engines and web servers.
This paper proposes that powerful architecture for search engines with the
title of Probabilis... |
1004.1796 | Document Clustering using Sequential Information Bottleneck Method | cs.IR | This paper illustrates the Principal Direction Divisive Partitioning (PDDP)
algorithm and describes its drawbacks and introduces a combinatorial framework
of the Principal Direction Divisive Partitioning (PDDP) algorithm, then
describes the simplified version of the EM algorithm called the spherical
Gaussian EM (sGEM... |
1004.1821 | Phase Transitions for Greedy Sparse Approximation Algorithms | cs.IT math.IT | A major enterprise in compressed sensing and sparse approximation is the
design and analysis of computationally tractable algorithms for recovering
sparse, exact or approximate, solutions of underdetermined linear systems of
equations. Many such algorithms have now been proven to have optimal-order
uniform recovery g... |
1004.1854 | Contribution Games in Social Networks | cs.GT cs.DS cs.MA | We consider network contribution games, where each agent in a social network
has a budget of effort that he can contribute to different collaborative
projects or relationships. Depending on the contribution of the involved agents
a relationship will flourish or drown, and to measure the success we use a
reward functi... |
1004.1886 | Feature Level Fusion of Face and Palmprint Biometrics by Isomorphic
Graph-based Improved K-Medoids Partitioning | cs.CV | This paper presents a feature level fusion approach which uses the improved
K-medoids clustering algorithm and isomorphic graph for face and palmprint
biometrics. Partitioning around medoids (PAM) algorithm is used to partition
the set of n invariant feature points of the face and palmprint images into k
clusters. By... |
1004.1887 | Maximized Posteriori Attributes Selection from Facial Salient Landmarks
for Face Recognition | cs.CV | This paper presents a robust and dynamic face recognition technique based on
the extraction and matching of devised probabilistic graphs drawn on SIFT
features related to independent face areas. The face matching strategy is based
on matching individual salient facial graph characterized by SIFT features as
connected... |
1004.1938 | On Optimal Anticodes over Permutations with the Infinity Norm | cs.IT math.IT | Motivated by the set-antiset method for codes over permutations under the
infinity norm, we study anticodes under this metric. For half of the parameter
range we classify all the optimal anticodes, which is equivalent to finding the
maximum permanent of certain $(0,1)$-matrices. For the rest of the cases we
show cons... |
1004.1955 | An Achievable Rate for the MIMO Individual Channel | cs.IT math.IT | We consider the problem of communicating over a multiple-input
multiple-output (MIMO) real valued channel for which no mathematical model is
specified, and achievable rates are given as a function of the channel input
and output sequences known a-posteriori. This paper extends previous results
regarding individual ch... |
1004.1982 | State-Space Dynamics Distance for Clustering Sequential Data | cs.LG | This paper proposes a novel similarity measure for clustering sequential
data. We first construct a common state-space by training a single
probabilistic model with all the sequences in order to get a unified
representation for the dataset. Then, distances are obtained attending to the
transition matrices induced by ... |
1004.1997 | An optimized recursive learning algorithm for three-layer feedforward
neural networks for mimo nonlinear system identifications | cs.NE cs.DC cs.LG | Back-propagation with gradient method is the most popular learning algorithm
for feed-forward neural networks. However, it is critical to determine a proper
fixed learning rate for the algorithm. In this paper, an optimized recursive
algorithm is presented for online learning based on matrix operation and
optimizatio... |
1004.1999 | Towards a mathematical theory of meaningful communication | cs.IT math.IT nlin.AO q-bio.OT | Despite its obvious relevance, meaning has been outside most theoretical
approaches to information in biology. As a consequence, functional responses
based on an appropriate interpretation of signals has been replaced by a
probabilistic description of correlations between emitted and received symbols.
This assumption... |
1004.2003 | The Socceral Force | cs.AI cs.SE | We have an audacious dream, we would like to develop a simulation and virtual
reality system to support the decision making in European football (soccer). In
this review, we summarize the efforts that we have made to fulfil this dream
until recently. In addition, an introductory version of FerSML (Footballer and
Foot... |
1004.2008 | Matrix Coherence and the Nystrom Method | cs.AI | The Nystrom method is an efficient technique to speed up large-scale learning
applications by generating low-rank approximations. Crucial to the performance
of this technique is the assumption that a matrix can be well approximated by
working exclusively with a subset of its columns. In this work we relate this
assum... |
1004.2027 | Dynamic Policy Programming | cs.LG cs.AI cs.SY math.OC stat.ML | In this paper, we propose a novel policy iteration method, called dynamic
policy programming (DPP), to estimate the optimal policy in the
infinite-horizon Markov decision processes. We prove the finite-iteration and
asymptotic l\infty-norm performance-loss bounds for DPP in the presence of
approximation/estimation er... |
1004.2079 | Bargaining dynamics in exchange networks | cs.GT cs.MA | We consider a one-sided assignment market or exchange network with
transferable utility and propose a model for the dynamics of bargaining in such
a market. Our dynamical model is local, involving iterative updates of 'offers'
based on estimated best alternative matches, in the spirit of pairwise Nash
bargaining. We ... |
1004.2102 | Distributed anonymous discrete function computation | math.OC cs.DC cs.SY | We propose a model for deterministic distributed function computation by a
network of identical and anonymous nodes. In this model, each node has bounded
computation and storage capabilities that do not grow with the network size.
Furthermore, each node only knows its neighbors, not the entire graph. Our goal
is to c... |
1004.2104 | Sum Capacity of K User Gaussian Degraded Interference Channels | cs.IT math.IT | This paper studies a family of genie-MAC (multiple access channel) outer
bounds for K-user Gaussian interference channels. This family is inspired by
existing genie-aided bounding mechanisms, but differs from current approaches
in its optimization problem formulation and application. The fundamental idea
behind these... |
1004.2131 | A New Full-diversity Criterion and Low-complexity STBCs with Partial
Interference Cancellation Decoding | cs.IT math.IT | Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full
diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with
Successive Interference Cancellation) decoder is used at the receiver. In this
paper, we give alternative conditions for an STBC to achieve full diversity
with P... |
1004.2155 | Constraint-based Query Distribution Framework for an Integrated Global
Schema | cs.DB cs.DC cs.IR | Distributed heterogeneous data sources need to be queried uniformly using
global schema. Query on global schema is reformulated so that it can be
executed on local data sources. Constraints in global schema and mappings are
used for source selection, query optimization,and querying partitioned and
replicated data sou... |
1004.2222 | What a Difference a Tag Cloud Makes: Effects of Tasks and Cognitive
Abilities on Search Results Interface Use | cs.HC cs.IR | The goal of this study is to expand our understanding of the relationships
between selected tasks, cognitive abilities and search result interfaces. The
underlying objective is to understand how to select search results presentation
for tasks and user contexts. Twenty three participants conducted four search
tasks of... |
1004.2242 | Group Leaders Optimization Algorithm | cs.NE math.OC | We present a new global optimization algorithm in which the influence of the
leaders in social groups is used as an inspiration for the evolutionary
technique which is designed into a group architecture. To demonstrate the
efficiency of the method, a standard suite of single and multidimensional
optimization function... |
1004.2280 | XOR at a Single Vertex -- Artificial Dendrites | cs.NE q-bio.NC | New to neuroscience with implications for AI, the exclusive OR, or any other
Boolean gate may be biologically accomplished within a single region where
active dendrites merge. This is demonstrated below using dynamic circuit
analysis. Medical knowledge aside, this observation points to the possibility
of specially co... |
1004.2285 | A Majorization-Minimization Approach to Design of Power Transmission
Networks | math.OC cs.CE | We propose an optimization approach to design cost-effective electrical power
transmission networks. That is, we aim to select both the network structure and
the line conductances (line sizes) so as to optimize the trade-off between
network efficiency (low power dissipation within the transmission network) and
the co... |
1004.2299 | An Optimal Coding Strategy for the Binary Multi-Way Relay Channel | cs.IT math.IT | We derive the capacity of the binary multi-way relay channel, in which
multiple users exchange messages at a common rate through a relay. The capacity
is achieved using a novel functional-decode-forward coding strategy. In the
functional-decode-forward coding strategy, the relay decodes functions of the
users' messag... |
1004.2300 | Capacity Theorems for the AWGN Multi-Way Relay Channel | cs.IT math.IT | The L-user additive white Gaussian noise multi-way relay channel is
considered, where multiple users exchange information through a single relay at
a common rate. Existing coding strategies, i.e., complete-decode-forward and
compress-forward are shown to be bounded away from the cut-set upper bound at
high signal-to-... |
1004.2303 | The Binary-Symmetric Parallel-Relay Network | cs.IT math.IT | We present capacity results of the binary-symmetric parallel-relay network,
where there is one source, one destination, and K relays in parallel. We show
that forwarding relays, where the relays merely transmit their received
signals, achieve the capacity in two ways: with coded transmission at the
source and a finit... |
1004.2304 | Spatio-Temporal Graphical Model Selection | stat.ML cs.AI | We consider the problem of estimating the topology of spatial interactions in
a discrete state, discrete time spatio-temporal graphical model where the
interactions affect the temporal evolution of each agent in a network. Among
other models, the susceptible, infected, recovered ($SIR$) model for
interaction events f... |
1004.2316 | Asymptotic Equivalence of Bayes Cross Validation and Widely Applicable
Information Criterion in Singular Learning Theory | cs.LG | In regular statistical models, the leave-one-out cross-validation is
asymptotically equivalent to the Akaike information criterion. However, since
many learning machines are singular statistical models, the asymptotic behavior
of the cross-validation remains unknown. In previous studies, we established
the singular l... |
1004.2342 | Mean field for Markov Decision Processes: from Discrete to Continuous
Optimization | cs.AI cs.PF cs.SY math.OC math.PR | We study the convergence of Markov Decision Processes made of a large number
of objects to optimization problems on ordinary differential equations (ODE).
We show that the optimal reward of such a Markov Decision Process, satisfying a
Bellman equation, converges to the solution of a continuous
Hamilton-Jacobi-Bellman... |
1004.2372 | Learning Deterministic Regular Expressions for the Inference of Schemas
from XML Data | cs.DB cs.FL | Inferring an appropriate DTD or XML Schema Definition (XSD) for a given
collection of XML documents essentially reduces to learning deterministic
regular expressions from sets of positive example words. Unfortunately, there
is no algorithm capable of learning the complete class of deterministic regular
expressions fr... |
1004.2392 | On the optimal stacking of noisy observations | cs.IT math.IT | Observations where additive noise is present can for many models be grouped
into a compound observation matrix, adhering to the same type of model. There
are many ways the observations can be stacked, for instance vertically,
horizontally, or quadratically. An estimator for the spectrum of the underlying
model can be... |
1004.2425 | Bounds on Thresholds Related to Maximum Satisfiability of Regular Random
Formulas | cs.IT cs.CC cs.DM math.IT | We consider the regular balanced model of formula generation in conjunctive
normal form (CNF) introduced by Boufkhad, Dubois, Interian, and Selman. We say
that a formula is $p$-satisfying if there is a truth assignment satisfying
$1-2^{-k}+p 2^{-k}$ fraction of clauses. Using the first moment method we
determine uppe... |
1004.2434 | The Multi-way Relay Channel | cs.IT math.IT | The multiuser communication channel, in which multiple users exchange
information with the help of a relay terminal, termed the multi-way relay
channel (mRC), is introduced. In this model, multiple interfering clusters of
users communicate simultaneously, where the users within the same cluster wish
to exchange messa... |
1004.2484 | Duality, Polite Water-filling, and Optimization for MIMO B-MAC
Interference Networks and iTree Networks | cs.IT math.IT | This paper gives the long sought network version of water-filling named as
polite water-filling. Unlike in single-user MIMO channels, where no one uses
general purpose optimization algorithms in place of the simple and optimal
water-filling for transmitter optimization, the traditional water-filling is
generally far ... |
1004.2515 | Nonnegative Decomposition of Multivariate Information | cs.IT math-ph math.IT math.MP physics.bio-ph physics.data-an q-bio.NC q-bio.QM | Of the various attempts to generalize information theory to multiple
variables, the most widely utilized, interaction information, suffers from the
problem that it is sometimes negative. Here we reconsider from first principles
the general structure of the information that a set of sources provides about a
given vari... |
1004.2519 | Robust State Space Filtering under Incremental Model Perturbations
Subject to a Relative Entropy Tolerance | math.OC cs.IT cs.SY math.IT | This paper considers robust filtering for a nominal Gaussian state-space
model, when a relative entropy tolerance is applied to each time increment of a
dynamical model. The problem is formulated as a dynamic minimax game where the
maximizer adopts a myopic strategy. This game is shown to admit a saddle point
whose s... |
1004.2523 | How Much Multiuser Diversity is Required for Energy Limited Multiuser
Systems? | cs.IT math.IT | Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU)
systems. In particular, MUDiv allows for scheduling among users in order to
eliminate the negative effects of unfavorable channel fading conditions of some
users on the system performance. Scheduling, however, consumes energy (e.g.,
for maki... |
1004.2542 | Relay-Assisted Partial Packet Recovery with IDMA Method in CDMA Wireless
Network | cs.IT math.IT | Automatic Repeat Request (ARQ) is an effective technique for reliable
transmission of packets in wireless networks. In ARQ, however, only a few
erroneous bits in a packet will cause the entire packet to be discarded at the
receiver. In this case, it's wasteful to retransmit the correct bit in the
received packet. The... |
1004.2616 | Achievable Rate Regions for Dirty Tape Channels and "Joint Writing on
Dirty Paper and Dirty Tape" | cs.IT math.IT | We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an
additive Gaussian interference known causally to the transmitter. The general
expression [max]\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented for the capacity of
this channel. For linear assignment to f(.), i.e. X=U-{\beta}S, this expression
leads t... |
1004.2624 | Symmetry within Solutions | cs.AI | We define the concept of an internal symmetry. This is a symmety within a
solution of a constraint satisfaction problem. We compare this to solution
symmetry, which is a mapping between different solutions of the same problem.
We argue that we may be able to exploit both types of symmetry when finding
solutions. We i... |
1004.2626 | Propagating Conjunctions of AllDifferent Constraints | cs.AI | We study propagation algorithms for the conjunction of two AllDifferent
constraints. Solutions of an AllDifferent constraint can be seen as perfect
matchings on the variable/value bipartite graph. Therefore, we investigate the
problem of finding simultaneous bipartite matchings. We present an extension of
the famous ... |
1004.2628 | Lossy Source Compression of Non-Uniform Binary Sources Using GQ-LDGM
Codes | cs.IT math.IT | In this paper, we study the use of GF(q)-quantized LDGM codes for binary
source coding. By employing quantization, it is possible to obtain binary
codewords with a non-uniform distribution. The obtained statistics is hence
suitable for optimal, direct quantization of non-uniform Bernoulli sources. We
employ a message... |
1004.2648 | Optimality and Approximate Optimality of Source-Channel Separation in
Networks | cs.IT math.IT | We consider the source-channel separation architecture for lossy source
coding in communication networks. It is shown that the separation approach is
optimal in two general scenarios, and is approximately optimal in a third
scenario. The two scenarios for which separation is optimal complement each
other: the first i... |
1004.2683 | Error Rates of Capacity-Achieving Codes Are Convex | cs.IT math.IT | Motivated by a wide-spread use of convex optimization techniques, convexity
properties of bit error rate of the maximum likelihood detector operating in
the AWGN channel are studied for arbitrary constellations and bit mappings,
which also includes coding under maximum-likelihood decoding. Under this
generic setting,... |
1004.2719 | Is This a Good Title? | cs.IR | Missing web pages, URIs that return the 404 "Page Not Found" error or the
HTTP response code 200 but dereference unexpected content, are ubiquitous in
today's browsing experience. We use Internet search engines to relocate such
missing pages and provide means that help automate the rediscovery process. We
propose que... |
1004.2757 | Multi-User Cooperative Diversity through Network Coding Based on
Classical Coding Theory | cs.IT math.IT | In this work, we propose and analyze a generalized construction of
distributed network codes for a network consisting of $M$ users sending
different information to a common base station through independent block fading
channels. The aim is to increase the diversity order of the system without
reducing its throughput.... |
1004.2773 | High-Rate and Full-Diversity Space-Time Block Codes with Low Complexity
Partial Interference Cancellation Group Decoding | cs.IT math.IT | In this paper, we propose a systematic design of space-time block codes
(STBC) which can achieve high rate and full diversity when the partial
interference cancellation (PIC) group decoding is used at receivers. The
proposed codes can be applied to any number of transmit antennas and admit a
low decoding complexity w... |
1004.2795 | An extension of Massey scheme for secret sharing | cs.IT cs.CR math.IT | We consider an extension of Massey's construction of secret sharing schemes
using linear codes. We describe the access structure of the scheme and show its
connection to the dual code. We use the $g$-fold weight enumerator and
invariant theory to study the access structure.
|
1004.2844 | Minimizing the Complexity of Fast Sphere Decoding of STBCs | cs.IT math.IT | Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD)
is well known. A fast-version of the SD known as fast sphere decoding (FSD) has
been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a
vector space spanned by its defining weight matrices over the real number
field, w... |
1004.2854 | Experimenting with Innate Immunity | cs.AI cs.NE | In a previous paper the authors argued the case for incorporating ideas from
innate immunity into artificial immune systems (AISs) and presented an outline
for a conceptual framework for such systems. A number of key general properties
observed in the biological innate and adaptive immune systems were highlighted,
an... |
1004.2860 | Behavioural Correlation for Detecting P2P Bots | cs.AI cs.CR cs.NE | In the past few years, IRC bots, malicious programs which are remotely
controlled by the attacker through IRC servers, have become a major threat to
the Internet and users. These bots can be used in different malicious ways such
as issuing distributed denial of services attacks to shutdown other networks
and services... |
1004.2868 | Inference with minimal Gibbs free energy in information field theory | astro-ph.IM cs.IT hep-th math.IT physics.data-an stat.ME | Non-linear and non-Gaussian signal inference problems are difficult to
tackle. Renormalization techniques permit us to construct good estimators for
the posterior signal mean within information field theory (IFT), but the
approximations and assumptions made are not very obvious. Here we introduce the
simple concept o... |
1004.2870 | Nurse Rostering with Genetic Algorithms | cs.AI cs.NE | In recent years genetic algorithms have emerged as a useful tool for the
heuristic solution of complex discrete optimisation problems. In particular
there has been considerable interest in their use in tackling problems arising
in the areas of scheduling and timetabling. However, the classical genetic
algorithm parad... |
1004.2880 | GRASP for the Coalition Structure Formation Problem | cs.AI cs.MA | The coalition structure formation problem represents an active research area
in multi-agent systems. A coalition structure is defined as a partition of the
agents involved in a system into disjoint coalitions. The problem of finding
the optimal coalition structure is NP-complete. In order to find the optimal
solution... |
1004.2926 | Sparse Reconstruction via The Reed-Muller Sieve | cs.IT math.IT | This paper introduces the Reed Muller Sieve, a deterministic measurement
matrix for compressed sensing. The columns of this matrix are obtained by
exponentiating codewords in the quaternary second order Reed Muller code of
length $N$. For $k=O(N)$, the Reed Muller Sieve improves upon prior methods for
identifying the... |
1004.3006 | Microlocal Analysis of the Geometric Separation Problem | math.FA cs.IT math.IT math.NA | Image data are often composed of two or more geometrically distinct
constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike
structures (galaxy superclusters) and curvelike structures (filaments). It
would be ideal to process a single image and extract two geometrically `pure'
images, each one ... |
1004.3040 | Online Sparse System Identification and Signal Reconstruction using
Projections onto Weighted $\ell_1$ Balls | cs.IT math.IT | This paper presents a novel projection-based adaptive algorithm for sparse
signal and system identification. The sequentially observed data are used to
generate an equivalent sequence of closed convex sets, namely hyperslabs. Each
hyperslab is the geometric equivalent of a cost criterion, that quantifies
"data mismat... |
1004.3071 | Subspace Methods for Joint Sparse Recovery | cs.IT math.IT | We propose robust and efficient algorithms for the joint sparse recovery
problem in compressed sensing, which simultaneously recover the supports of
jointly sparse signals from their multiple measurement vectors obtained through
a common sensing matrix. In a favorable situation, the unknown matrix, which
consists of ... |
1004.3085 | Universal Coding of Ergodic Sources for Multiple Decoders with Side
Information | cs.IT math.IT | A multiterminal lossy coding problem, which includes various problems such as
the Wyner-Ziv problem and the complementary delivery problem as special cases,
is considered. It is shown that any point in the achievable rate-distortion
region can be attained even if the source statistics are not known.
|
1004.3147 | Genetic Algorithms for Multiple-Choice Problems | cs.NE cs.AI cs.CE | This thesis investigates the use of problem-specific knowledge to enhance a
genetic algorithm approach to multiple-choice optimisation problems.It shows
that such information can significantly enhance performance, but that the
choice of information and the way it is included are important factors for
success.Two mult... |
1004.3165 | The space complexity of recognizing well-parenthesized expressions in
the streaming model: the Index function revisited | cs.CC cs.IT math.IT quant-ph | We show an Omega(sqrt{n}/T) lower bound for the space required by any
unidirectional constant-error randomized T-pass streaming algorithm that
recognizes whether an expression over two types of parenthesis is
well-parenthesized. This proves a conjecture due to Magniez, Mathieu, and Nayak
(2009) and rigorously establi... |
1004.3183 | Statistical Physics for Natural Language Processing | cs.CL cond-mat.stat-mech cs.IR | This paper has been withdrawn by the author.
|
1004.3196 | Introducing Dendritic Cells as a Novel Immune-Inspired Algorithm for
Anomoly Detection | cs.AI cs.NE | Dendritic cells are antigen presenting cells that provide a vital link
between the innate and adaptive immune system. Research into this family of
cells has revealed that they perform the role of coordinating T-cell based
immune responses, both reactive and for generating tolerance. We have derived
an algorithm based... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.