id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1001.1374 | Distance bounds for algebraic geometric codes | cs.IT math.AG math.IT | Various methods have been used to obtain improvements of the Goppa lower
bound for the minimum distance of an algebraic geometric code. The main methods
divide into two categories and all but a few of the known bounds are special
cases of either the Lundell-McCullough floor bound or the Beelen order bound.
The except... |
1001.1386 | On the List-Decodability of Random Linear Codes | cs.IT math.CO math.IT | For every fixed finite field $\F_q$, $p \in (0,1-1/q)$ and $\epsilon > 0$, we
prove that with high probability a random subspace $C$ of $\F_q^n$ of dimension
$(1-H_q(p)-\epsilon)n$ has the property that every Hamming ball of radius $pn$
has at most $O(1/\epsilon)$ codewords.
This answers a basic open question conce... |
1001.1389 | Optimal Cooperative Relaying Schemes for Improving Wireless Physical
Layer Security | cs.IT math.IT | We consider a cooperative wireless network in the presence of one of more
eavesdroppers, and exploit node cooperation for achieving physical (PHY) layer
based security. Two different cooperation schemes are considered. In the first
scheme, cooperating nodes retransmit a weighted version of the source signal in
a deco... |
1001.1401 | Incorporating characteristics of human creativity into an evolutionary
art algorithm | cs.AI cs.NE q-bio.NC | A perceived limitation of evolutionary art and design algorithms is that they
rely on human intervention; the artist selects the most aesthetically pleasing
variants of one generation to produce the next. This paper discusses how
computer generated art and design can become more creatively human-like with
respect to ... |
1001.1445 | Graph-Constrained Group Testing | cs.DM cs.IT math.IT | Non-adaptive group testing involves grouping arbitrary subsets of $n$ items
into different pools. Each pool is then tested and defective items are
identified. A fundamental question involves minimizing the number of pools
required to identify at most $d$ defective items. Motivated by applications in
network tomograph... |
1001.1446 | Using Financial Ratios to Identify Romanian Distressed Companies | q-fin.PM cs.CE q-bio.GN | In the context of the current financial crisis, when more companies are
facing bankruptcy or insolvency, the paper aims to find methods to identify
distressed firms by using financial ratios. The study will focus on identifying
a group of Romanian listed companies, for which financial data for the year
2008 were avai... |
1001.1454 | Multidimensional Data Structures and Techniques for Efficient Decision
Making | cs.CG cs.DB cs.DS | In this paper we present several novel efficient techniques and
multidimensional data structures which can improve the decision making process
in many domains. We consider online range aggregation, range selection and
range weighted median queries; for most of them, the presented data structures
and techniques can pr... |
1001.1468 | An information inequality and evaluation of Marton's inner bound for
binary input broadcast channels | cs.IT math.IT | We establish an information inequality that is intimately connected to the
evaluation of the sum rate given by Marton's inner bound for two receiver
broadcast channels with a binary input alphabet. This generalizes a recent
result where the inequality was established for a particular channel, the
binary skew-symmetri... |
1001.1478 | Ergodic and Outage Performance of Fading Broadcast Channels with 1-Bit
Feedback | cs.IT math.IT | In this paper, the ergodic sum-rate and outage probability of a downlink
single-antenna channel with K users are analyzed in the presence of Rayleigh
flat fading, where limited channel state information (CSI) feedback is assumed.
Specifically, only 1-bit feedback per fading block per user is available at the
base sta... |
1001.1482 | Performance of Optimum Combining in a Poisson Field of Interferers and
Rayleigh Fading Channels | cs.IT math.IT | This paper studies the performance of antenna array processing in distributed
multiple access networks without power control. The interference is represented
as a Poisson point process. Desired and interfering signals are subject to both
path-loss fading (with an exponent greater than 2) and to independent Rayleigh
f... |
1001.1597 | The Berlekamp-Massey Algorithm via Minimal Polynomials | cs.IT cs.SC math.IT | We present a recursive minimal polynomial theorem for finite sequences over a
commutative integral domain $D$. This theorem is relative to any element of
$D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a
recursive 'index function' and simple mathematical induction. Taking
reciprocals gives a... |
1001.1603 | Soft Decision Decoding of the Orthogonal Complex MIMO Codes for Three
and Four Transmit Antennas | cs.IT math.IT | Orthogonality is a much desired property for MIMO coding. It enables
symbol-wise decoding, where the errors in other symbol estimates do not affect
the result, thus providing an optimality that is worth pursuing. Another
beneficial property is a low complexity soft decision decoder, which for
orthogonal complex MIMO ... |
1001.1625 | Augmented Lattice Reduction for MIMO decoding | cs.IT math.IT | Lattice reduction algorithms, such as the LLL algorithm, have been proposed
as preprocessing tools in order to enhance the performance of suboptimal
receivers in MIMO communications. In this paper we introduce a new kind of
lattice reduction-aided decoding technique, called augmented lattice reduction,
which recovers... |
1001.1653 | A betting interpretation for probabilities and Dempster-Shafer degrees
of belief | math.ST cs.AI stat.TH | There are at least two ways to interpret numerical degrees of belief in terms
of betting: (1) you can offer to bet at the odds defined by the degrees of
belief, or (2) you can judge that a strategy for taking advantage of such
betting offers will not multiply the capital it risks by a large factor. Both
interpretatio... |
1001.1658 | On the Capacity of Non-Coherent Network Coding | cs.IT math.IT | We consider the problem of multicasting information from a source to a set of
receivers over a network where intermediate network nodes perform randomized
network coding operations on the source packets. We propose a channel model for
the non-coherent network coding introduced by Koetter and Kschischang in [6],
that ... |
1001.1679 | Cascade and Triangular Source Coding with Side Information at the First
Two Nodes | cs.IT math.IT | We consider the cascade and triangular rate-distortion problem where side
information is known to the source encoder and to the first user but not to the
second user. We characterize the rate-distortion region for these problems. For
the quadratic Gaussian case, we show that it is sufficient to consider jointly
Gauss... |
1001.1685 | Assessing Cognitive Load on Web Search Tasks | cs.HC cs.IR | Assessing cognitive load on web search is useful for characterizing search
system features and search tasks with respect to their demands on the
searcher's mental effort. It is also helpful for examining how individual
differences among searchers (e.g. cognitive abilities) affect the search
process. We examined cogni... |
1001.1705 | On the Pseudocodeword Redundancy | cs.IT math.IT | We define the AWGNC, BSC, and max-fractional pseudocodeword redundancy of a
code as the smallest number of rows in a parity-check matrix such that the
corresponding minimum pseudoweight is equal to the minimum Hamming distance. We
show that most codes do not have a finite pseudocodeword redundancy. We also
provide bo... |
1001.1730 | Divide & Concur and Difference-Map BP Decoders for LDPC Codes | cs.IT cs.DS math.IT | The "Divide and Concur'' (DC) algorithm, recently introduced by Gravel and
Elser, can be considered a competitor to the belief propagation (BP) algorithm,
in that both algorithms can be applied to a wide variety of constraint
satisfaction, optimization, and probabilistic inference problems. We show that
DC can be int... |
1001.1732 | Trade-off capacities of the quantum Hadamard channels | quant-ph cs.IT math.IT | Coding theorems in quantum Shannon theory express the ultimate rates at which
a sender can transmit information over a noisy quantum channel. More often than
not, the known formulas expressing these transmission rates are intractable,
requiring an optimization over an infinite number of uses of the channel.
Researche... |
1001.1763 | Infinite-message Interactive Function Computation in Collocated Networks | cs.IT math.IT | An interactive function computation problem in a collocated network is
studied in a distributed block source coding framework. With the goal of
computing a desired function at the sink, the source nodes exchange messages
through a sequence of error-free broadcasts. The infinite-message minimum
sum-rate is viewed as a... |
1001.1768 | On the Secure DoF of the Single-Antenna MAC | cs.IT math.IT | A new achievability rate region for the secure discrete memoryless
Multiple-Access-Channel (MAC) is presented. Thereafter, a novel secure coding
scheme is proposed to achieve a positive Secure Degrees-of-Freedom (S-DoF) in
the single-antenna MAC. This scheme converts the single-antenna system into a
multiple-dimensio... |
1001.1781 | Two Theorems in List Decoding | cs.IT math.IT | We prove the following results concerning the list decoding of
error-correcting codes:
(i) We show that for \textit{any} code with a relative distance of $\delta$
(over a large enough alphabet), the following result holds for \textit{random
errors}: With high probability, for a $\rho\le \delta -\eps$ fraction of ra... |
1001.1798 | Fountain Codes with Varying Probability Distributions | cs.IT math.CO math.IT | Fountain codes are rateless erasure-correcting codes, i.e., an essentially
infinite stream of encoded packets can be generated from a finite set of data
packets. Several fountain codes have been proposed recently to minimize
overhead, many of which involve modifications of the Luby transform (LT) code.
These fountain... |
1001.1799 | The capacity region of a class of broadcast channels with a sequence of
less noisy receivers | cs.IT math.IT | The capacity region of a broadcast channel consisting of k-receivers that lie
in a less noisy sequence is an open problem, when k >= 3. We solve this problem
for the case k=3. We prove that superposition coding is optimal for a class of
broadcast channels with a sequence of less noisy receivers. T
|
1001.1806 | An Exposition of a Result in "Conjugate Codes for Secure and Reliable
Information Transmission" | cs.IT math.IT | An elementary proof of the attainability of random coding exponent with
linear codes for additive channels is presented. The result and proof are from
Hamada (Proc. ITW, Chendu, China, 2006), and the present material explains the
proof in detail for those unfamiliar with elementary calculations on
probabilities relat... |
1001.1808 | Performance Analysis for Data Compression Based Signal Classification
Methods | cs.IT math.IT | In this paper, we present an information theoretic analysis of the blind
signal classification algorithm. We show that the algorithm is equivalent to a
Maximum A Posteriori (MAP) estimator based on estimated parametric probability
models. We prove a lower bound on the error exponents of the parametric model
estimatio... |
1001.1826 | Threshold Saturation via Spatial Coupling: Why Convolutional LDPC
Ensembles Perform so well over the BEC | cs.IT math.IT | Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have
excellent thresholds and these thresholds are rapidly increasing as a function
of the average degree. Several variations on the basic theme have been proposed
to date, all of which share the good performance characteristics of
convolutional LDP... |
1001.1836 | Web-Based Expert System for Civil Service Regulations: RCSES | cs.AI | Internet and expert systems have offered new ways of sharing and distributing
knowledge, but there is a lack of researches in the area of web based expert
systems. This paper introduces a development of a web-based expert system for
the regulations of civil service in the Kingdom of Saudi Arabia named as RCSES.
It is... |
1001.1872 | Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna
Systems | cs.IT math.IT | For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$
system), a {\it{full-rate}} space time block code (STBC) transmits
$min(n_t,n_r)$ complex symbols per channel use. In this paper, a scheme to
obtain a full-rate STBC for 4 transmit antennas and any $n_r$, with reduced
ML-decoding complexity is pres... |
1001.1873 | Optimal incorporation of sparsity information by weighted $\ell_1$
optimization | cs.IT math.IT | Compressed sensing of sparse sources can be improved by incorporating prior
knowledge of the source. In this paper we demonstrate a method for optimal
selection of weights in weighted $L_1$ norm minimization for a noiseless
reconstruction model, and show the improvements in compression that can be
achieved.
|
1001.1889 | Cheating for Problem Solving: A Genetic Algorithm with Social
Interactions | cs.NE cs.AI cs.GT | We propose a variation of the standard genetic algorithm that incorporates
social interaction between the individuals in the population. Our goal is to
understand the evolutionary role of social systems and its possible application
as a non-genetic new step in evolutionary algorithms. In biological
populations, ie an... |
1001.1896 | Generalized Degrees of Freedom of the Interference Channel with a Signal
Cognitive Relay | cs.IT math.IT | We study the interference channel with a signal cognitive relay. A signal
cognitive relay knows the transmit signals (but not the messages) of the
sources non-causally, and tries to help them communicating with their
respective destinations. We derive upper bounds and provide achievable schemes
for this channel. Thes... |
1001.1912 | M\'ethode du point proximal: principe et applications aux algorithmes
it\'eratifs | cs.IT math.IT | This paper recalls the proximal point method. We study two iterative
algorithms: the Blahut-Arimoto algorithm for computing the capacity of
arbitrary discrete memoryless channels, as an example of an iterative algorithm
working with probability density estimates and the iterative decoding of the
Bit Interleaved Coded... |
1001.1915 | Geometrical interpretation and improvements of the Blahut-Arimoto's
algorithm | cs.IT math.IT | The paper first recalls the Blahut Arimoto algorithm for computing the
capacity of arbitrary discrete memoryless channels, as an example of an
iterative algorithm working with probability density estimates. Then, a
geometrical interpretation of this algorithm based on projections onto linear
and exponential families ... |
1001.1917 | New Criteria for Iterative Decoding | cs.IT math.IT | Iterative decoding was not originally introduced as the solution to an
optimization problem rendering the analysis of its convergence very difficult.
In this paper, we investigate the link between iterative decoding and classical
optimization techniques. We first show that iterative decoding can be rephrased
as two e... |
1001.1948 | Collision Helps - Algebraic Collision Recovery for Wireless Erasure
Networks | cs.IT cs.NI math.IT | Current medium access control mechanisms are based on collision avoidance and
collided packets are discarded. The recent work on ZigZag decoding departs from
this approach by recovering the original packets from multiple collisions. In
this paper, we present an algebraic representation of collisions which allows
us t... |
1001.1966 | A New Method to Extract Dorsal Hand Vein Pattern using Quadratic
Inference Function | cs.CV cs.CR | Among all biometric, dorsal hand vein pattern is attracting the attention of
researchers, of late. Extensive research is being carried out on various
techniques in the hope of finding an efficient one which can be applied on
dorsal hand vein pattern to improve its accuracy and matching time. One of the
crucial step i... |
1001.1968 | A Topological derivative based image segmentation for sign language
recognition system using isotropic filter | cs.CV | The need of sign language is increasing radically especially to hearing
impaired community. Only few research groups try to automatically recognize
sign language from video, colored gloves and etc. Their approach requires a
valid segmentation of the data that is used for training and of the data that
is used to be re... |
1001.1972 | A New Image Steganography Based On First Component Alteration Technique | cs.MM cs.CV | In this paper, A new image steganography scheme is proposed which is a kind
of spatial domain technique. In order to hide secret data in cover-image, the
first component alteration technique is used. Techniques used so far focuses
only on the two or four bits of a pixel in a image (at the most five bits at
the edge o... |
1001.1979 | ICD 10 Based Medical Expert System Using Fuzzy Temporal Logic | cs.AI cs.LO | Medical diagnosis process involves many levels and considerable amount of
time and money are invariably spent for the first level of diagnosis usually
made by the physician for all the patients every time. Hence there is a need
for a computer based system which not only asks relevant questions to the
patients but als... |
1001.1984 | DNA-MATRIX a tool for DNA motif discovery and weight matrix construction | q-bio.GN cs.CE | In computational molecular biology, gene regulatory binding sites prediction
in whole genome remains a challenge for the researchers. Now a days, the genome
wide regulatory binding site prediction tools required either direct pattern
sequence or weight matrix. Although there are known transcription factor
binding sit... |
1001.1985 | Multiprocessor Scheduling For Tasks With Priority Using GA | cs.NE cs.DC | Multiprocessors have emerged as a powerful computing means for running
realtime applications, especially where a uniprocessor system would not be
sufficient enough to execute all the tasks. The high performance and
reliability of multiprocessors have made them a powerful computing resource.
Such computing environment... |
1001.1988 | An Improved Image Mining Technique For Brain Tumour Classification Using
Efficient Classifier | cs.CV cs.IR | An improved image mining technique for brain tumor classification using
pruned association rule with MARI algorithm is presented in this paper. The
method proposed makes use of association rule mining technique to classify the
CT scan brain images into three categories namely normal, benign and malign. It
combines th... |
1001.1991 | Mining Spatial Gene Expression Data Using Negative Association Rules | cs.DB cs.CE q-bio.GN | Over the years, data mining has attracted most of the attention from the
research community. The researchers attempt to develop faster, more scalable
algorithms to navigate over the ever increasing volumes of spatial gene
expression data in search of meaningful patterns. Association rules are a data
mining technique ... |
1001.2024 | Wireless Networks with Asynchronous Users | cs.IT math.IT | This paper addresses an interference channel consisting of $\mathbf{n}$
active users sharing $u$ frequency sub-bands. Users are asynchronous meaning
there exists a mutual delay between their transmitted codes. A stationary model
for interference is considered by assuming the starting point of an
interferer's data is ... |
1001.2038 | Collaborative Spectrum Sensing from Sparse Observations Using Matrix
Completion for Cognitive Radio Networks | cs.IT math.IT | In cognitive radio, spectrum sensing is a key component to detect spectrum
holes (i.e., channels not used by any primary users). Collaborative spectrum
sensing among the cognitive radio nodes is expected to improve the ability of
checking complete spectrum usage states. Unfortunately, due to power limitation
and chan... |
1001.2050 | Scheduling in Wireless Networks under Uncertainties: A Greedy
Primal-Dual Approach | cs.IT cs.NI math.IT math.OC | This paper proposes a dynamic primal-dual type algorithm to solve the optimal
scheduling problem in wireless networks subject to uncertain parameters, which
are generated by stochastic network processes such as random packet arrivals,
channel fading, and node mobilities. The algorithm is a generalization of the
well-... |
1001.2059 | Multishot Codes for Network Coding using Rank-Metric Codes | cs.IT math.IT | The multiplicative-additive finite-field matrix channel arises as an adequate
model for linear network coding systems when links are subject to errors and
erasures, and both the network topology and the network code are unknown. In a
previous work we proposed a general construction of multishot codes for this
channel... |
1001.2062 | On broadcast channels with binary inputs and symmetric outputs | cs.IT math.IT | We study the capacity regions of broadcast channels with binary inputs and
symmetric outputs. We study the partial order induced by the more capable
ordering of broadcast channels for channels belonging to this class. This study
leads to some surprising connections regarding various notions of dominance of
receivers.... |
1001.2067 | Refined rate of channel polarization | cs.IT math.IT | A rate-dependent upper bound of the best achievable block error probability
of polar codes with successive-cancellation decoding is derived.
|
1001.2076 | Fast-Group-Decodable STBCs via Codes over GF(4) | cs.IT math.IT | In this paper we construct low decoding complexity STBCs by using the Pauli
matrices as linear dispersion matrices. In this case the Hurwitz-Radon
orthogonality condition is shown to be easily checked by transferring the
problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding
complexity STBCs is sh... |
1001.2077 | On Random Linear Network Coding for Butterfly Network | cs.IT math.IT | Random linear network coding is a feasible encoding tool for network coding,
specially for the non-coherent network, and its performance is important in
theory and application. In this letter, we study the performance of random
linear network coding for the well-known butterfly network by analyzing the
failure probab... |
1001.2097 | Predictability of PV power grid performance on insular sites without
weather stations: use of artificial neural networks | cs.NE | The official meteorological network is poor on the island of Corsica: only
three sites being about 50 km apart are equipped with pyranometers which enable
measurements by hourly and daily step. These sites are Ajaccio (41\degree 55'N
and 8\degree 48'E, seaside), Bastia (42\degree 33'N, 9\degree 29'E, seaside)
and Cor... |
1001.2112 | Outage Capacity of Bursty Amplify-and-Forward with Incremental Relaying | cs.IT math.IT | We derive the outage capacity of a bursty version of the amplify-and-forward
(BAF) protocol for small signal-to-noise ratios when incremental relaying is
used. We show that the ratio between the outage capacities of BAF and the
cut-set bound is independent of the relay position and that BAF is outage
optimal for cert... |
1001.2117 | On Outage Capacity for Incremental Relaying with Imperfect Feedback | cs.IT math.IT | We investigate the effect of imperfect feedback on the \epsilon-outage
capacity of incremental relaying in the low signal-to-noise ratio (SNR) regime.
We show that imperfect feedback leads to a rescaling of the pre-log factor
(comparable to the multiplexing gain for networks operating in the high SNR
regime) and thus... |
1001.2155 | Cooperative Automated Worm Response and Detection Immune Algorithm | cs.AI cs.CR cs.NE | The role of T-cells within the immune system is to confirm and assess
anomalous situations and then either respond to or tolerate the source of the
effect. To illustrate how these mechanisms can be harnessed to solve real-world
problems, we present the blueprint of a T-cell inspired algorithm for computer
security wo... |
1001.2164 | The Capacity of a Class of Linear Deterministic Networks | cs.IT math.IT | In this paper, we investigate optimal coding strategies for a class of linear
deterministic relay networks. The network under study is a relay network, with
one source, one destination, and two relay nodes. Additionally, there is a
disturbing source of signals that causes interference with the information
signals rec... |
1001.2170 | Comparing Simulation Output Accuracy of Discrete Event and Agent Based
Models: A Quantitive Approach | cs.AI cs.MA | In our research we investigate the output accuracy of discrete event
simulation models and agent based simulation models when studying human centric
complex systems. In this paper we focus on human reactive behaviour as it is
possible in both modelling approaches to implement human reactive behaviour in
the model by ... |
1001.2186 | Building reputation systems for better ranking | cs.IR cs.DB | How to rank web pages, scientists and online resources has recently attracted
increasing attention from both physicists and computer scientists. In this
paper, we study the ranking problem of rating systems where users vote objects
by discrete ratings. We propose an algorithm that can simultaneously evaluate
the user... |
1001.2190 | Characterizations of generalized entropy functions by functional
equations | cs.IT math.IT | We shall show that a two-parameter extended entropy function is characterized
by a functional equation. As a corollary of this result, we obtain that the
Tsallis entropy function is characterized by a functional equation, which is a
different form used in \cite{ST} i.e., in Proposition \ref{prop01} in the
present pap... |
1001.2195 | DCA for Bot Detection | cs.AI cs.CR cs.NE | Ensuring the security of computers is a non-trivial task, with many
techniques used by malicious users to compromise these systems. In recent years
a new threat has emerged in the form of networks of hijacked zombie machines
used to perform complex distributed attacks such as denial of service and to
obtain sensitive... |
1001.2198 | Performance of Interference Alignment in Clustered Wireless Ad Hoc
Networks | cs.IT math.IT | Spatial interference alignment among a finite number of users is proposed as
a technique to increase the probability of successful transmission in an
interference limited clustered wireless ad hoc network. Using techniques from
stochastic geometry, we build on the work of Ganti and Haenggi dealing with
Poisson cluste... |
1001.2205 | Deriving the Probabilistic Capacity of General Run-Length Sets Using
Generating Functions | cs.IT cs.FL math.CO math.IT | In "Reliable Communication in the Absence of a Common Clock" (Yeung et al.,
2009), the authors introduce general run-length sets, which form a class of
constrained systems that permit run-lengths from a countably infinite set. For
a particular definition of probabilistic capacity, they show that probabilistic
capacit... |
1001.2208 | Biological Inspiration for Artificial Immune Systems | cs.AI cs.NE | Artificial immune systems (AISs) to date have generally been inspired by
naive biological metaphors. This has limited the effectiveness of these
systems. In this position paper two ways in which AISs could be made more
biologically realistic are discussed. We propose that AISs should draw their
inspiration from organ... |
1001.2218 | Bounds on the Capacity of the Relay Channel with Noncausal State
Information at Source | cs.IT math.IT | We consider a three-terminal state-dependent relay channel with the channel
state available non-causally at only the source. Such a model may be of
interest for node cooperation in the framework of cognition, i.e.,
collaborative signal transmission involving cognitive and non-cognitive radios.
We study the capacity o... |
1001.2228 | Estimation with Random Linear Mixing, Belief Propagation and Compressed
Sensing | cs.IT math.IT | We apply Guo and Wang's relaxed belief propagation (BP) method to the
estimation of a random vector from linear measurements followed by a
componentwise probabilistic measurement channel. Relaxed BP uses a Gaussian
approximation in standard BP to obtain significant computational savings for
dense measurement matrices... |
1001.2263 | Syllable Analysis to Build a Dictation System in Telugu language | cs.CL cs.HC | In recent decades, Speech interactive systems gained increasing importance.
To develop Dictation System like Dragon for Indian languages it is most
important to adapt the system to a speaker with minimum training. In this paper
we focus on the importance of creating speech database at syllable units and
identifying m... |
1001.2267 | Speech Recognition by Machine, A Review | cs.CL | This paper presents a brief survey on Automatic Speech Recognition and
discusses the major themes and advances made in the past 60 years of research,
so as to provide a technological perspective and an appreciation of the
fundamental progress that has been accomplished in this important area of
speech communication. ... |
1001.2270 | An Improved Approach to High Level Privacy Preserving Itemset Mining | cs.DB cs.IR | Privacy preserving association rule mining has triggered the development of
many privacy preserving data mining techniques. A large fraction of them use
randomized data distortion techniques to mask the data for preserving. This
paper proposes a new transaction randomization method which is a combination of
the fake ... |
1001.2274 | Network Capacity Region of Multi-Queue Multi-Server Queueing System with
Time Varying Connectivities | cs.IT cs.NI math.IT math.OC | Network capacity region of multi-queue multi-server queueing system with
random ON-OFF connectivities and stationary arrival processes is derived in
this paper. Specifically, the necessary and sufficient conditions for the
stability of the system are derived under general arrival processes with finite
first and secon... |
1001.2275 | Efficient Candidacy Reduction For Frequent Pattern Mining | cs.DB | Certainly, nowadays knowledge discovery or extracting knowledge from large
amount of data is a desirable task in competitive businesses. Data mining is a
main step in knowledge discovery process. Meanwhile frequent patterns play
central role in data mining tasks such as clustering, classification, and
association ana... |
1001.2277 | Application of a Fuzzy Programming Technique to Production Planning in
the Textile Industry | cs.AI | Many engineering optimization problems can be considered as linear
programming problems where all or some of the parameters involved are
linguistic in nature. These can only be quantified using fuzzy sets. The aim of
this paper is to solve a fuzzy linear programming problem in which the
parameters involved are fuzzy ... |
1001.2279 | The Application of Mamdani Fuzzy Model for Auto Zoom Function of a
Digital Camera | cs.AI | Mamdani Fuzzy Model is an important technique in Computational Intelligence
(CI) study. This paper presents an implementation of a supervised learning
method based on membership function training in the context of Mamdani fuzzy
models. Specifically, auto zoom function of a digital camera is modelled using
Mamdani tec... |
1001.2283 | Mutual Information of IID Complex Gaussian Signals on Block
Rayleigh-faded Channels | cs.IT math.IT | We present a method to compute, quickly and efficiently, the mutual
information achieved by an IID (independent identically distributed) complex
Gaussian input on a block Rayleigh-faded channel without side information at
the receiver. The method accommodates both scalar and MIMO (multiple-input
multiple-output) sett... |
1001.2284 | An Efficient Approach Toward the Asymptotic Analysis of Node-Based
Recovery Algorithms in Compressed Sensing | cs.IT math.IT | In this paper, we propose a general framework for the asymptotic analysis of
node-based verification-based algorithms. In our analysis we tend the signal
length $n$ to infinity. We also let the number of non-zero elements of the
signal $k$ scale linearly with $n$. Using the proposed framework, we study the
asymptotic... |
1001.2298 | Turbo Receiver Design for Phase Noise Mitigation in OFDM Systems | cs.IT math.IT | This paper addresses the issue of phase noise in OFDM systems. Phase noise
(PHN) is a transceiver impairment resulting from the non-idealities of the
local oscillator. We present a case for designing a turbo receiver for systems
corrupted by phase noise by taking a closer look at the effects of the common
phase error... |
1001.2307 | Tranceiver Design using Linear Precoding in a Multiuser MIMO System with
Limited Feedback | cs.IT math.IT | We investigate quantization and feedback of channel state information in a
multiuser (MU) multiple input multiple output (MIMO) system. Each user may
receive multiple data streams. Our design minimizes the sum mean squared error
(SMSE) while accounting for the imperfections in channel state information
(CSI) at the t... |
1001.2327 | Wiretap Channel with Causal State Information | cs.IT math.IT | A lower bound on the secrecy capacity of the wiretap channel with state
information available causally at both the encoder and decoder is established.
The lower bound is shown to be strictly larger than that for the noncausal case
by Liu and Chen. Achievability is proved using block Markov coding, Shannon
strategy, a... |
1001.2331 | Information Theoretic Bounds for Low-Rank Matrix Completion | cs.IT cs.CC math.IT math.PR | This paper studies the low-rank matrix completion problem from an information
theoretic perspective. The completion problem is rephrased as a communication
problem of an (uncoded) low-rank matrix source over an erasure channel. The
paper then uses achievability and converse arguments to present order-wise
optimal bou... |
1001.2334 | Network-Level Cooperative Protocols for Wireless Multicasting: Stable
Throughput Analysis and Use of Network Coding | cs.IT math.IT | In this paper, we investigate the impact of network coding at the relay node
on the stable throughput rate in multicasting cooperative wireless networks.
The proposed protocol adopts Network-level cooperation in contrast to the
traditional physical layer cooperative protocols and in addition uses random
linear networ... |
1001.2356 | Multi-Error-Correcting Amplitude Damping Codes | quant-ph cs.IT math.IT | We construct new families of multi-error-correcting quantum codes for the
amplitude damping channel. Our key observation is that, with proper encoding,
two uses of the amplitude damping channel simulate a quantum erasure channel.
This allows us to use concatenated codes with quantum erasure-correcting codes
as outer ... |
1001.2362 | Dense Error Correction for Low-Rank Matrices via Principal Component
Pursuit | cs.IT math.IT | We consider the problem of recovering a low-rank matrix when some of its
entries, whose locations are not known a priori, are corrupted by errors of
arbitrarily large magnitude. It has recently been shown that this problem can
be solved efficiently and effectively by a convex program named Principal
Component Pursuit... |
1001.2363 | Stable Principal Component Pursuit | cs.IT math.IT | In this paper, we study the problem of recovering a low-rank matrix (the
principal components) from a high-dimensional data matrix despite both small
entry-wise noise and gross sparse errors. Recently, it has been shown that a
convex program, named Principal Component Pursuit (PCP), can recover the
low-rank matrix wh... |
1001.2376 | A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM
Signals | cs.IT math.IT | Low-complexity near-optimal detection of large-MIMO signals has attracted
recent research. Recently, we proposed a local neighborhood search algorithm,
namely `reactive tabu search' (RTS) algorithm, as well as a factor-graph based
`belief propagation' (BP) algorithm for low-complexity large-MIMO detection.
The motiva... |
1001.2391 | A Little More, a Lot Better: Improving Path Quality by a Simple Path
Merging Algorithm | cs.RO cs.AI | Sampling-based motion planners are an effective means for generating
collision-free motion paths. However, the quality of these motion paths (with
respect to quality measures such as path length, clearance, smoothness or
energy) is often notoriously low, especially in high-dimensional configuration
spaces. We introdu... |
1001.2405 | Dendritic Cells for Real-Time Anomaly Detection | cs.AI cs.NE | Dendritic Cells (DCs) are innate immune system cells which have the power to
activate or suppress the immune system. The behaviour of human of human DCs is
abstracted to form an algorithm suitable for anomaly detection. We test this
algorithm on the real-time problem of port scan detection. Our results show a
signifi... |
1001.2410 | On the Secrecy Degress of Freedom of the Multi-Antenna Block Fading
Wiretap Channels | cs.IT math.IT | We consider the multi-antenna wiretap channel in which the transmitter wishes
to send a confidential message to its receiver while keeping it secret to the
eavesdropper. It has been known that the secrecy capacity of such a channel
does not increase with signal-to-noise ratio when the transmitter has no
channel state... |
1001.2411 | Dendritic Cells for Anomaly Detection | cs.AI cs.NE | Artificial immune systems, more specifically the negative selection
algorithm, have previously been applied to intrusion detection. The aim of this
research is to develop an intrusion detection system based on a novel concept
in immunology, the Danger Theory. Dendritic Cells (DCs) are antigen presenting
cells and key... |
1001.2421 | Outage Efficient Strategies for Network MIMO with Partial CSIT | cs.IT math.IT | We consider a multi-cell MIMO downlink (network MIMO) where $B$ base-stations
(BS) with $M$ antennas connected to a central station (CS) serve $K$
single-antenna user terminals (UT). Although many works have shown the
potential benefits of network MIMO, the conclusion critically depends on the
underlying assumptions ... |
1001.2447 | PPM demodulation: On approaching fundamental limits of optical
communications | quant-ph cs.IT math.IT | We consider the problem of demodulating M-ary optical PPM (pulse-position
modulation) waveforms, and propose a structured receiver whose mean probability
of symbol error is smaller than all known receivers, and approaches the quantum
limit. The receiver uses photodetection coupled with optimized phase-coherent
optica... |
1001.2463 | On the Threshold of Maximum-Distance Separable Codes | cs.IT cs.DM math.IT | Starting from a practical use of Reed-Solomon codes in a cryptographic scheme
published in Indocrypt'09, this paper deals with the threshold of linear
$q$-ary error-correcting codes. The security of this scheme is based on the
intractability of polynomial reconstruction when there is too much noise in the
vector. Our... |
1001.2464 | Linear Finite-Field Deterministic Networks With Many Sources and One
Destination | cs.IT math.IT | We find the capacity region of linear finite-field deterministic networks
with many sources and one destination. Nodes in the network are subject to
interference and broadcast constraints, specified by the linear finite-field
deterministic model. Each node can inject its own information as well as relay
other nodes' ... |
1001.2488 | A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel
Coding Scheme | cs.IT math.IT | An analog source is to be transmitted across a Gaussian channel in more than
one channel use per source symbol. This paper derives a lower bound on the
asymptotic mean squared error for a strategy that consists of repeatedly
quantizing the source, transmitting the quantizer outputs in the first channel
uses, and send... |
1001.2503 | Check Reliability Based Bit-Flipping Decoding Algorithms for LDPC Codes | cs.IT math.IT | We introduce new reliability definitions for bit and check nodes. Maximizing
global reliability, which is the sum reliability of all bit nodes, is shown to
be equivalent to minimizing a decoding metric which is closely related to the
maximum likelihood decoding metric. We then propose novel bit-flipping (BF)
decoding... |
1001.2545 | Concatenated Polar Codes | cs.IT math.IT | Polar codes have attracted much recent attention as the first codes with low
computational complexity that provably achieve optimal rate-regions for a large
class of information-theoretic problems. One significant drawback, however, is
that for current constructions the probability of error decays
sub-exponentially i... |
1001.2547 | On Zero-Error Source Coding with Feedback | cs.IT math.IT | We consider the problem of zero error source coding with limited feedback
when side information is present at the receiver. First, we derive an
achievable rate region for arbitrary joint distributions on the source and the
side information. When all source pairs of source and side information symbols
are observable w... |
1001.2554 | A new proof of Delsarte, Goethals and Mac Williams theorem on minimal
weight codewords of generalized Reed-Muller code | cs.IT math.IT | We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal
weight codewords of generalized Reed-Muller codes published in 1970. To prove
this theorem, we consider intersection of support of minimal weight codewords
with affine hyperplanes and we proceed by recursion.
|
1001.2566 | On Achievable Rates for Non-Linear Deterministic Interference Channels | cs.IT math.IT | This paper extends the literature on interference alignment to more general
classes of deterministic channels which incorporate non-linear input-output
relationships. It is found that the concept of alignment extends naturally to
these deterministic interference channels, and in many cases, the achieved
degrees of fr... |
1001.2582 | Delay-rate tradeoff for ergodic interference alignment in the Gaussian
case | cs.IT math.IT | In interference alignment, users sharing a wireless channel are each able to
achieve data rates of up to half of the non-interfering channel capacity, no
matter the number of users. In an ergodic setting, this is achieved by pairing
complementary channel realizations in order to amplify signals and cancel
interferenc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.