id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1001.4181 | Improved Upper Bounds to the Causal Quadratic Rate-Distortion Function
for Gaussian Stationary Sources | cs.IT math.IT | We improve the existing achievable rate regions for causal and for zero-delay
source coding of stationary Gaussian sources under an average mean squared
error (MSE) distortion measure. To begin with, we find a closed-form expression
for the information-theoretic causal rate-distortion function (RDF) under such
distor... |
1001.4189 | Detection and Demarcation of Tumor using Vector Quantization in MRI
images | cs.CV | Segmenting a MRI images into homogeneous texture regions representing
disparate tissue types is often a useful preprocessing step in the
computer-assisted detection of breast cancer. That is why we proposed new
algorithm to detect cancer in mammogram breast cancer images. In this paper we
proposed segmentation using ... |
1001.4251 | A Decidable Class of Nested Iterated Schemata (extended version) | cs.LO cs.AI | Many problems can be specified by patterns of propositional formulae
depending on a parameter, e.g. the specification of a circuit usually depends
on the number of bits of its input. We define a logic whose formulae, called
"iterated schemata", allow to express such patterns. Schemata extend
propositional logic with ... |
1001.4267 | Thermodynamic properties of finite binary strings | cs.IT math.IT | Thermodynamic properties such as temperature, pressure, and internal energy
have been defined for finite binary strings from equilibrium distribution of a
chosen computable measure. It is demonstrated a binary string can be associated
with one-dimensional gas of quasi-particles of certain mass, momentum, and
energy.
|
1001.4271 | Divide-and-conquer: Approaching the capacity of the two-pair
bidirectional Gaussian relay network | cs.IT math.IT | The capacity region of multi-pair bidirectional relay networks, in which a
relay node facilitates the communication between multiple pairs of users, is
studied. This problem is first examined in the context of the linear shift
deterministic channel model. The capacity region of this network when the relay
is operatin... |
1001.4273 | Sentence Simplification Aids Protein-Protein Interaction Extraction | cs.CL | Accurate systems for extracting Protein-Protein Interactions (PPIs)
automatically from biomedical articles can help accelerate biomedical research.
Biomedical Informatics researchers are collaborating to provide metaservices
and advance the state-of-art in PPI extraction. One problem often neglected by
current Natura... |
1001.4277 | Towards Effective Sentence Simplification for Automatic Processing of
Biomedical Text | cs.CL | The complexity of sentences characteristic to biomedical articles poses a
challenge to natural language parsers, which are typically trained on
large-scale corpora of non-technical text. We propose a text simplification
process, bioSimplify, that seeks to reduce the complexity of sentences in
biomedical abstracts in ... |
1001.4278 | Weight Optimization for Distributed Average Consensus Algorithm in
Symmetric, CCS & KCS Star Networks | cs.IT cs.DC math.CO math.IT | This paper addresses weight optimization problem in distributed consensus
averaging algorithm over networks with symmetric star topology. We have
determined optimal weights and convergence rate of the network in terms of its
topological parameters. In addition, two alternative topologies with more rapid
convergence r... |
1001.4295 | "Compressed" Compressed Sensing | cs.IT math.IT | The field of compressed sensing has shown that a sparse but otherwise
arbitrary vector can be recovered exactly from a small number of randomly
constructed linear projections (or samples). The question addressed in this
paper is whether an even smaller number of samples is sufficient when there
exists prior knowledge... |
1001.4297 | Multi-camera Realtime 3D Tracking of Multiple Flying Animals | cs.CV | Automated tracking of animal movement allows analyses that would not
otherwise be possible by providing great quantities of data. The additional
capability of tracking in realtime - with minimal latency - opens up the
experimental possibility of manipulating sensory feedback, thus allowing
detailed explorations of th... |
1001.4298 | Statistical Mechanical Analysis of a Typical Reconstruction Limit of
Compressed Sensing | cs.IT cond-mat.dis-nn math.IT | We use the replica method of statistical mechanics to examine a typical
performance of correctly reconstructing $N$-dimensional sparse vector
$bx=(x_i)$ from its linear transformation $by=bF bx$ of $P$ dimensions on the
basis of minimization of the $L_p$-norm $||bx||_p= lim_{epsilon to +0}
sum_{i=1}^N |x_i|^{p+epsilo... |
1001.4301 | Probabilistic Approach to Neural Networks Computation Based on Quantum
Probability Model Probabilistic Principal Subspace Analysis Example | cs.NE cs.LG | In this paper, we introduce elements of probabilistic model that is suitable
for modeling of learning algorithms in biologically plausible artificial neural
networks framework. Model is based on two of the main concepts in quantum
physics - a density matrix and the Born rule. As an example, we will show that
proposed... |
1001.4305 | On Exponential Sums, Nowton identities and Dickson Polynomials over
Finite Fields | cs.IT math.IT | Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of
$\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$
with $\gcd(n,q)=1$. We present a recursive formula for evaluating the
exponential sum $\sum_{c\in \mathbb{F}_{q^s}}\chi^{(s)}(f(x))$. Let $a$ and $b$
be two element... |
1001.4334 | An Enumerative Method for Encoding Spectrum Shaped Binary Run-Length
Constrained Sequences | cs.IT math.IT | A method for encoding and decoding spectrum shaped binary run-length
constrained sequences is described. The binary sequences with predefined range
of exponential sums are introduced. On the base of Cover's enumerative scheme,
recurrence relations for calculating the number of these sequences are derived.
Implementat... |
1001.4361 | Statistical Mechanical Analysis of Compressed Sensing Utilizing
Correlated Compression Matrix | cs.IT cond-mat.dis-nn math.IT | We investigate a reconstruction limit of compressed sensing for a
reconstruction scheme based on the L1-norm minimization utilizing a correlated
compression matrix with a statistical mechanics method. We focus on the
compression matrix modeled as the Kronecker-type random matrix studied in
research on multi-input mul... |
1001.4368 | Implicit media frames: Automated analysis of public debate on artificial
sweeteners | cs.IR cs.CL | The framing of issues in the mass media plays a crucial role in the public
understanding of science and technology. This article contributes to research
concerned with diachronic analysis of media frames by making an analytical
distinction between implicit and explicit media frames, and by introducing an
automated me... |
1001.4382 | Training Over Sparse Multipath Channels in the Low SNR Regime | cs.IT math.IT | Training over sparse multipath channels is explored. The energy allocation
and the optimal shape of training signals that enable error free communications
over unknown channels are characterized as a function of the channels'
statistics. The performance of training is evaluated by the reduction of the
mean square err... |
1001.4387 | Convex Feasibility Methods for Compressed Sensing | cs.IT math.IT | We present a computationally-efficient method for recovering sparse signals
from a series of noisy observations, known as the problem of compressed sensing
(CS). CS theory requires solving a convex constrained minimization problem. We
propose to transform this optimization problem into a convex feasibility
problem (C... |
1001.4405 | A Formal Framework of Virtual Organisations as Agent Societies | cs.LO cs.AI cs.MA | We propose a formal framework that supports a model of agent-based Virtual
Organisations (VOs) for service grids and provides an associated operational
model for the creation of VOs. The framework is intended to be used for
describing different service grid applications based on multiple agents and, as
a result, it a... |
1001.4413 | Structure and Behaviour of Virtual Organisation Breeding Environments | cs.SE cs.MA | This paper provides an outline of a formal approach that we are developing
for modelling Virtual Organisations (VOs) and their Breeding Environments
(VBEs). We propose different levels of representation for the functional
structures and processes that VBEs and VOs involve, which are independent of
the specificities o... |
1001.4419 | A Framework to Manage the Complex Organisation of Collaborating: Its
Application to Autonomous Systems | cs.MA | In this paper we present an analysis of the complexities of large group
collaboration and its application to develop detailed requirements for
collaboration schema for Autonomous Systems (AS). These requirements flow from
our development of a framework for collaboration that provides a basis for
designing, supporting... |
1001.4423 | A New Decoding Scheme for Errorless Codes for Overloaded CDMA with
Active User Detection | cs.IT math.IT | Recently, a new class of binary codes for overloaded CDMA systems are
proposed that not only has the ability of errorless communication but also
suitable for detecting active users. These codes are called COWDA [1]. In [1],
a Maximum Likelihood (ML) decoder is proposed for this class of codes. Although
the proposed s... |
1001.4431 | Algebraic Network Coding Approach to Deterministic Wireless Relay
Networks | cs.IT cs.NI math.IT | The deterministic wireless relay network model, introduced by Avestimehr et
al., has been proposed for approximating Gaussian relay networks. This model,
known as the ADT network model, takes into account the broadcast nature of
wireless medium and interference. Avestimehr et al. showed that the Min-cut
Max-flow theo... |
1001.4432 | Joint Range of f-divergences | cs.IT math.IT math.ST stat.TH | We provide a general method for evaluation of the joint range of
f-divergences for two different functions f. Via topological arguments we prove
that the joint range for general distributions equals the convex hull of the
joint range achieved by the distributions on a two-element set. The joint range
technique provid... |
1001.4448 | R\'enyi Divergence and Majorization | cs.IT math.IT | R\'enyi divergence is related to R\'enyi entropy much like information
divergence (also called Kullback-Leibler divergence or relative entropy) is
related to Shannon's entropy, and comes up in many settings. It was introduced
by R\'enyi as a measure of information that satisfies almost the same axioms as
information ... |
1001.4462 | Not Every Domain of a Plain Decompressor Contains the Domain of a
Prefix-Free One | cs.IT cs.CC math.IT math.LO | C.Calude, A.Nies, L.Staiger, and F.Stephan posed the following question about
the relation between plain and prefix Kolmogorov complexities (see their paper
in DLT 2008 conference proceedings): does the domain of every optimal
decompressor contain the domain of some optimal prefix-free decompressor? In
this paper we ... |
1001.4475 | X-Armed Bandits | cs.LG cs.SY math.OC math.ST stat.TH | We consider a generalization of stochastic bandits where the set of arms,
$\cX$, is allowed to be a generic measurable space and the mean-payoff function
is "locally Lipschitz" with respect to a dissimilarity function that is known
to the decision maker. Under this condition we construct an arm selection
policy, call... |
1001.4519 | Communication in a Poisson Field of Interferers -- Part I: Interference
Distribution and Error Probability | cs.IT cs.NI math.IT | We present a mathematical model for communication subject to both network
interference and noise. We introduce a framework where the interferers are
scattered according to a spatial Poisson process, and are operating
asynchronously in a wireless environment subject to path loss, shadowing, and
multipath fading. We co... |
1001.4520 | Communication in a Poisson Field of Interferers -- Part II: Channel
Capacity and Interference Spectrum | cs.IT cs.NI math.IT | In Part I of this paper, we presented a mathematical model for communication
subject to both network interference and noise, where the interferers are
scattered according to a spatial Poisson process, and are operating
asynchronously in a wireless environment subject to path loss, shadowing, and
multipath fading. We ... |
1001.4521 | On the BICM Capacity | cs.IT math.IT | Optimal binary labelings, input distributions, and input alphabets are
analyzed for the so-called bit-interleaved coded modulation (BICM) capacity,
paying special attention to the low signal-to-noise ratio (SNR) regime. For
8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded
binary code results... |
1001.4548 | On the BICM Capacity | cs.IT math.IT | Optimal binary labelings, input distributions, and input alphabets are
analyzed for the so-called bit-interleaved coded modulation (BICM) capacity,
paying special attention to the low signal-to-noise ratio (SNR) regime. For
8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded
binary code results... |
1001.4588 | Interference Decoding for Deterministic Channels | cs.IT math.IT | An inner bound to the capacity region of a class of deterministic
interference channels with three user pairs is presented. The key idea is to
simultaneously decode the combined interference signal and the intended message
at each receiver. It is shown that this interference-decoding inner bound is
tight under certai... |
1001.4597 | Learning to Blend by Relevance | cs.IR | Emergence of various vertical search engines highlights the fact that a
single ranking technology cannot deal with the complexity and scale of search
problems. For example, technology behind video and image search is very
different from general web search. Their ranking functions share few features.
Question answerin... |
1001.4689 | Balancing Egoism and Altruism on the Interference Channel: The MIMO case | cs.IT math.IT | This paper considers the so-called MIMO interference channel. This situation
has relevance in applications such as multi-cell coordination in cellular
networks as well as spectrum sharing in cognitive radio networks among others.
We address the design of precoding (i.e. beamforming) vectors at each sender
with the ai... |
1001.4703 | Neyman-Pearson Detection of a Gaussian Source using Dumb Wireless
Sensors | cs.IT math.IT | We investigate the performance of the Neyman-Pearson detection of a
stationary Gaussian process in noise, using a large wireless sensor network
(WSN). In our model, each sensor compresses its observation sequence using a
linear precoder. The final decision is taken by a fusion center (FC) based on
the compressed info... |
1001.4737 | Optimization of Planck/LFI on--board data handling | astro-ph.IM astro-ph.CO cs.IT math.IT | To asses stability against 1/f noise, the Low Frequency Instrument (LFI)
onboard the Planck mission will acquire data at a rate much higher than the
data rate allowed by its telemetry bandwith of 35.5 kbps. The data are
processed by an onboard pipeline, followed onground by a reversing step. This
paper illustrates th... |
1001.4739 | Rate Region of the Gaussian Scalar-Help-Vector Source-Coding Problem | cs.IT math.IT | We determine the rate region of the Gaussian scalar-help-vector source-coding
problem under a covariance matrix distortion constraint. The rate region is
achieved by a Gaussian achievable scheme. We introduce a novel outer bounding
technique to establish the converse of the main result. Our approach is based
on lower... |
1001.4880 | The WebContent XML Store | cs.DB | In this article, we describe the XML storage system used in the WebContent
project. We begin by advocating the use of an XML database in order to store
WebContent documents, and we present two different ways of storing and querying
these documents : the use of a centralized XML database and the use of a P2P
XML datab... |
1001.4892 | Janus: Automatic Ontology Builder from XSD Files | cs.DB cs.AI | The construction of a reference ontology for a large domain still remains an
hard human task. The process is sometimes assisted by software tools that
facilitate the information extraction from a textual corpus. Despite of the
great use of XML Schema files on the internet and especially in the B2B domain,
tools that ... |
1001.4901 | Deriving Ontologies from XML Schema | cs.PL cs.DB | In this paper, we present a method and a tool for deriving a skeleton of an
ontology from XML schema files. We first recall what an is ontology and its
relationships with XML schemas. Next, we focus on ontology building methodology
and associated tool requirements. Then, we introduce Janus, a tool for building
an ont... |
1001.4919 | Johnson-Lindenstrauss lemma for circulant matrices | math.FA cs.IT math.IT | We prove a variant of a Johnson-Lindenstrauss lemma for matrices with
circulant structure. This approach allows to minimise the randomness used, is
easy to implement and provides good running times. The price to be paid is the
higher dimension of the target space $k=O(\epsilon^{-2}\log^3n)$ instead of the
classical b... |
1001.5007 | Trajectory Clustering and an Application to Airspace Monitoring | cs.LG | This paper presents a framework aimed at monitoring the behavior of aircraft
in a given airspace. Nominal trajectories are determined and learned using data
driven methods. Standard procedures are used by air traffic controllers (ATC)
to guide aircraft, ensure the safety of the airspace, and to maximize the
runway oc... |
1001.5016 | Mapping the Geography of Science: Distribution Patterns and Networks of
Relations among Cities and Institutes | cs.DL cs.IR physics.soc-ph | Using Google Earth, Google Maps and/or network visualization programs such as
Pajek, one can overlay the network of relations among addresses in scientific
publications on the geographic map. We discuss the pros en cons of the various
options, and provide software (freeware) for bridging existing gaps between the
Sci... |
1001.5073 | Sparse Recovery using Smoothed $\ell^0$ (SL0): Convergence Analysis | cs.IT math.IT | Finding the sparse solution of an underdetermined system of linear equations
has many applications, especially, it is used in Compressed Sensing (CS),
Sparse Component Analysis (SCA), and sparse decomposition of signals on
overcomplete dictionaries. We have recently proposed a fast algorithm, called
Smoothed $\ell^0$... |
1001.5074 | Computing coset leaders of binary codes | cs.IT math.IT | We present an algorithm for computing the set of all coset leaders of a
binary code $\mathcal C \subset \mathbb{F}_2^n$. The method is adapted from
some of the techniques related to the computation of Gr\"obner representations
associated with codes. The algorithm provides a Gr\"obner representation of the
binary code... |
1001.5079 | An Optimal Family of Exponentially Accurate One-Bit Sigma-Delta
Quantization Schemes | cs.IT math.CA math.IT | Sigma-Delta modulation is a popular method for analog-to-digital conversion
of bandlimited signals that employs coarse quantization coupled with
oversampling. The standard mathematical model for the error analysis of the
method measures the performance of a given scheme by the rate at which the
associated reconstruct... |
1001.5100 | On Exponential Sums, Nowton identities and Dickson Polynomials over
Finite Fields | cs.IT math.IT | Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of
$\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$
with $\gcd(n,q)=1$. We present a recursive formula for evaluating the
exponential sum $\sum_{c\in \mathbb{F}_{q^s}}\chi^{(s)}(f(x))$. Let $a$ and $b$
be two element... |
1001.5113 | Worst Configurations (Instantons) for Compressed Sensing over Reals: a
Channel Coding Approach | cs.IT math.IT | We consider the Linear Programming (LP) solution of the Compressed Sensing
(CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The
BasP allows interpretation as a channel-coding problem, and it guarantees
error-free reconstruction with a properly chosen measurement matrix and
sufficiently spars... |
1001.5130 | BOOST: A fast approach to detecting gene-gene interactions in
genome-wide case-control studies | q-bio.GN cs.CE q-bio.QM | Gene-gene interactions have long been recognized to be fundamentally
important to understand genetic causes of complex disease traits. At present,
identifying gene-gene interactions from genome-wide case-control studies is
computationally and methodologically challenging. In this paper, we introduce a
simple but powe... |
1001.5135 | An efficient CDMA decoder for correlated information sources | cs.IT cond-mat.stat-mech math.IT | We consider the detection of correlated information sources in the ubiquitous
Code-Division Multiple-Access (CDMA) scheme. We propose a message-passing based
scheme for detecting correlated sources directly, with no need for source
coding. The detection is done simultaneously over a block of transmitted binary
symbol... |
1001.5178 | A Matroid Framework for Noncoherent Random Network Communications | cs.IT cs.NI math.CO math.IT | Models for noncoherent error control in random linear network coding (RLNC)
and store and forward (SAF) have been recently proposed. In this paper, we
model different types of random network communications as the transmission of
flats of matroids. This novel framework encompasses RLNC and SAF and allows us
to introdu... |
1001.5244 | Computing Networks: A General Framework to Contrast Neural and Swarm
Cognitions | cs.NE cs.AI nlin.AO | This paper presents the Computing Networks (CNs) framework. CNs are used to
generalize neural and swarm architectures. Artificial neural networks, ant
colony optimization, particle swarm optimization, and realistic biological
models are used as examples of instantiations of CNs. The description of these
architectures... |
1001.5275 | An Agent-Based Modeling for Pandemic Influenza in Egypt | cs.MA cs.CY | Pandemic influenza has great potential to cause large and rapid increases in
deaths and serious illness. The objective of this paper is to develop an
agent-based model to simulate the spread of pandemic influenza (novel H1N1) in
Egypt. The proposed multi-agent model is based on the modeling of individuals'
interactio... |
1001.5311 | Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation | math.ST cs.IT math.IT stat.ML stat.TH | Adaptive sampling results in dramatic improvements in the recovery of sparse
signals in white Gaussian noise. A sequential adaptive sampling-and-refinement
procedure called Distilled Sensing (DS) is proposed and analyzed. DS is a form
of multi-stage experimental design and testing. Because of the adaptive nature
of t... |
1001.5319 | Communicating the sum of sources over a network | cs.IT cs.NI math.IT | We consider the network communication scenario, over directed acyclic
networks with unit capacity edges in which a number of sources $s_i$ each
holding independent unit-entropy information $X_i$ wish to communicate the sum
$\sum{X_i}$ to a set of terminals $t_j$. We show that in the case in which
there are only two s... |
1001.5336 | Asymptotic Capacity of Large Fading Relay Networks with Random Node
Failures | cs.IT math.IT | To understand the network response to large-scale physical attacks, we
investigate the asymptotic capacity of a half-duplex fading relay network with
random node failures when the number of relays $N$ is infinitely large. In this
paper, a simplified independent attack model is assumed where each relay node
fails with... |
1001.5348 | Performance Comparisons of PSO based Clustering | cs.NE cs.LG | In this paper we have investigated the performance of PSO Particle Swarm
Optimization based clustering on few real world data sets and one artificial
data set. The performances are measured by two metric namely quantization error
and inter-cluster distance. The K means clustering algorithm is first
implemented for al... |
1001.5352 | Kannada Character Recognition System A Review | cs.CV | Intensive research has been done on optical character recognition ocr and a
large number of articles have been published on this topic during the last few
decades. Many commercial OCR systems are now available in the market, but most
of these systems work for Roman, Chinese, Japanese and Arabic characters. There
are ... |
1001.5359 | Threshold Based Indexing of Commercial Shoe Print to Create Reference
and Recovery Images | cs.CV | One of the important evidence in a crime scene that is normally overlooked
but very important evidence is shoe print as the criminal is normally unaware
of the mask for this. In this paper we use image processing technique to
process reference shoe images to make it index-able for a search from the
database the shoe ... |
1001.5364 | MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation | cs.IT math.IT | This paper proposes a new detection algorithm for MIMO communication systems
employing high order QAM constellations. The factor graph that corresponds to
this problem is very loopy; in fact, it is a complete graph. Hence, a
straightforward application of the Belief Propagation (BP) algorithm yields
very poor results... |
1001.5421 | A note on evolutionary stochastic portfolio optimization and
probabilistic constraints | q-fin.PM cs.CE cs.NE | In this note, we extend an evolutionary stochastic portfolio optimization
framework to include probabilistic constraints. Both the stochastic
programming-based modeling environment as well as the evolutionary optimization
environment are ideally suited for an integration of various types of
probabilistic constraints.... |
1001.5454 | Non-Equilibrium Statistical Physics of Currents in Queuing Networks | cond-mat.stat-mech cond-mat.dis-nn cs.IT math.IT math.PR | We consider a stable open queuing network as a steady non-equilibrium system
of interacting particles. The network is completely specified by its underlying
graphical structure, type of interaction at each node, and the Markovian
transition rates between nodes. For such systems, we ask the question ``What is
the most... |
1002.0007 | Curvature based triangulation of metric measure spaces | math.DG cs.IT math.CV math.IT | We prove that a Ricci curvature based method of triangulation of compact
Riemannian manifolds, due to Grove and Petersen, extends to the context of
weighted Riemannian manifolds and more general metric measure spaces. In both
cases the role of the lower bound on Ricci curvature is replaced by the
curvature-dimension ... |
1002.0019 | Regularized Modified BPDN for Noisy Sparse Reconstruction with Partial
Erroneous Support and Signal Value Knowledge | cs.IT math.IT | We study the problem of sparse reconstruction from noisy undersampled
measurements when the following two things are available. (1) We are given
partial, and partly erroneous, knowledge of the signal's support, denoted by
$T$. (2) We are also given an erroneous estimate of the signal values on $T$,
denoted by $(\hat{... |
1002.0026 | Perfect Z2Z4-linear codes in Steganography | cs.IT cs.CR math.IT | Steganography is an information hiding application which aims to hide secret
data imperceptibly into a commonly used media. Unfortunately, the theoretical
hiding asymptotical capacity of steganographic systems is not attained by
algorithms developed so far. In this paper, we describe a novel coding method
based on Z2... |
1002.0043 | A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for
Reed-Solomon Codes | cs.IT math.IT | Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes
have recently attracted new attention. Choosing decoding candidates based on
rate-distortion (R-D) theory, as proposed previously by the authors, currently
provides the best performance-versus-complexity trade-off. In this paper, an
analysis ba... |
1002.0097 | On the Construction of Prefix-Free and Fix-Free Codes with Specified
Codeword Compositions | cs.IT math.IT | We investigate the construction of prefix-free and fix-free codes with
specified codeword compositions. We present a polynomial time algorithm which
constructs a fix-free code with the same codeword compositions as a given code
for a special class of codes called distinct codes. We consider the
construction of optima... |
1002.0102 | $\alpha$-Discounting Multi-Criteria Decision Making ($\alpha$-D MCDM) | cs.AI | In this book we introduce a new procedure called \alpha-Discounting Method
for Multi-Criteria Decision Making (\alpha-D MCDM), which is as an alternative
and extension of Saaty Analytical Hierarchy Process (AHP). It works for any
number of preferences that can be transformed into a system of homogeneous
linear equati... |
1002.0108 | Genetic algorithm for robotic telescope scheduling | cs.AI astro-ph.IM | This work was inspired by author experiences with a telescope scheduling.
Author long time goal is to develop and further extend software for an
autonomous observatory. The software shall provide users with all the
facilities they need to take scientific images of the night sky, cooperate with
other autonomous observ... |
1002.0110 | On Unbiased Estimation of Sparse Vectors Corrupted by Gaussian Noise | cs.IT math.IT | We consider the estimation of a sparse parameter vector from measurements
corrupted by white Gaussian noise. Our focus is on unbiased estimation as a
setting under which the difficulty of the problem can be quantified
analytically. We show that there are infinitely many unbiased estimators but
none of them has unifor... |
1002.0123 | Achievable rate regions and outer bounds for a multi-pair bi-directional
relay network | cs.IT math.IT | In a bi-directional relay channel, a pair of nodes wish to exchange
independent messages over a shared wireless half-duplex channel with the help
of relays. Recent work has mostly considered information theoretic limits of
the bi-directional relay channel with two terminal nodes (or end users) and one
relay. In this ... |
1002.0134 | Constraint solvers: An empirical evaluation of design decisions | cs.AI cs.PF | This paper presents an evaluation of the design decisions made in four
state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To
assess the impact of design decisions, instances of the five problem classes
n-Queens, Golomb Ruler, Magic Square, Social Golfers, and Balanced Incomplete
Block Design are... |
1002.0136 | Dominion -- A constraint solver generator | cs.AI | This paper proposes a design for a system to generate constraint solvers that
are specialised for specific problem models. It describes the design in detail
and gives preliminary experimental results showing the feasibility and
effectiveness of the approach.
|
1002.0139 | Extraction of Flat and Nested Data Records from Web Pages | cs.DB | This paper studies the problem of identification and extraction of flat and
nested data records from a given web page. With the explosive growth of
information sources available on the World Wide Web, it has become increasingly
difficult to identify the relevant pieces of information, since web pages are
often clutte... |
1002.0169 | Moment-Based Analysis of Synchronization in Small-World Networks of
Oscillators | cs.MA cs.CE cs.DM nlin.AO | In this paper, we investigate synchronization in a small-world network of
coupled nonlinear oscillators. This network is constructed by introducing
random shortcuts in a nearest-neighbors ring. The local stability of the
synchronous state is closely related with the support of the eigenvalue
distribution of the Lapla... |
1002.0170 | Spectral Analysis of Virus Spreading in Random Geometric Networks | cs.MA cs.CE cs.DM nlin.AO | In this paper, we study the dynamics of a viral spreading process in random
geometric graphs (RGG). The spreading of the viral process we consider in this
paper is closely related with the eigenvalues of the adjacency matrix of the
graph. We deduce new explicit expressions for all the moments of the eigenvalue
distri... |
1002.0177 | Logical Evaluation of Consciousness: For Incorporating Consciousness
into Machine Architecture | cs.AI | Machine Consciousness is the study of consciousness in a biological,
philosophical, mathematical and physical perspective and designing a model that
can fit into a programmable system architecture. Prime objective of the study
is to make the system architecture behave consciously like a biological model
does. Present... |
1002.0179 | B\'{e}zout Identities Associated to a Finite Sequence | cs.IT cs.SC math.IT | We consider finite sequences $s\in D^n$ where $D$ is a commutative, unital,
integral domain. We prove three sets of identities (possibly with repetitions),
each involving $2n$ polynomials associated to $s$. The right-hand side of these
identities is a recursively-defined (non-zero) 'product-of-discrepancies'.
There a... |
1002.0182 | Sobolev Duals for Random Frames and Sigma-Delta Quantization of
Compressed Sensing Measurements | cs.IT math.IT | Quantization of compressed sensing measurements is typically justified by the
robust recovery results of Cand\`es, Romberg and Tao, and of Donoho. These
results guarantee that if a uniform quantizer of step size $\delta$ is used to
quantize $m$ measurements $y = \Phi x$ of a $k$-sparse signal $x \in \R^N$,
where $\Ph... |
1002.0184 | Some considerations on how the human brain must be arranged in order to
make its replication in a thinking machine possible | cs.AI q-bio.NC | For the most of my life, I have earned my living as a computer vision
professional busy with image processing tasks and problems. In the computer
vision community there is a widespread belief that artificial vision systems
faithfully replicate human vision abilities or at least very closely mimic
them. It was a great... |
1002.0205 | On the Generality of $1+\mathbf{i}$ as a Non-Norm Element | cs.IT math.IT | Full-rate space-time block codes with nonvanishing determinants have been
extensively designed with cyclic division algebras. For these designs, smaller
pairwise error probabilities of maximum likelihood detections require larger
normalized diversity products, which can be obtained by choosing integer
non-norm elemen... |
1002.0215 | Extraction de termes, reconnaissance et labellisation de relations dans
un th\'esaurus | cs.IR | Within the documentary system domain, the integration of thesauri for
indexing and retrieval information steps is usual. In libraries, documents own
rich descriptive information made by librarians, under descriptive notice based
on Rameau thesaurus. We exploit two kinds of information in order to create a
first seman... |
1002.0235 | Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using
Interference Alignment | cs.IT math.IT | We consider a dense n-user Gaussian interference network formed by paired
transmitters and receivers placed independently at random in Euclidean space.
Under natural conditions on the node position distributions and signal
attenuation, we prove convergence in probability of the average per-user
capacity C_Sigma/n to ... |
1002.0239 | Construction et enrichissement automatique d'ontologie \`a partir de
ressources externes | cs.IR | Automatic construction of ontologies from text is generally based on
retrieving text content. For a much more rich ontology we extend these
approaches by taking into account the document structure and some external
resources (like thesaurus of indexing terms of near domain). In this paper we
describe how these extern... |
1002.0276 | Dendritic Cells for SYN Scan Detection | cs.AI cs.CR cs.NE | Artificial immune systems have previously been applied to the problem of
intrusion detection. The aim of this research is to develop an intrusion
detection system based on the function of Dendritic Cells (DCs). DCs are
antigen presenting cells and key to activation of the human immune system,
behaviour which has been... |
1002.0295 | On lifting perfect codes | cs.IT cs.DM math.CO math.IT | In this paper we consider completely regular codes, obtained from perfect
(Hamming) codes by lifting the ground field. More exactly, for a given perfect
code C of length n=(q^m-1)/(q-1) over F_q with a parity check matrix H_m, we
define a new code C_{(m,r)} of length n over F_{q^r}, r > 1, with this parity
check matr... |
1002.0378 | A Grey-Box Approach to Automated Mechanism Design | cs.GT cs.AI cs.MA | Auctions play an important role in electronic commerce, and have been used to
solve problems in distributed computing. Automated approaches to designing
effective auction mechanisms are helpful in reducing the burden of traditional
game theoretic, analytic approaches and in searching through the large space of
possib... |
1002.0382 | Face Recognition by Fusion of Local and Global Matching Scores using DS
Theory: An Evaluation with Uni-classifier and Multi-classifier Paradigm | cs.CV cs.AI | Faces are highly deformable objects which may easily change their appearance
over time. Not all face areas are subject to the same variability. Therefore
decoupling the information from independent areas of the face is of paramount
importance to improve the robustness of any face recognition technique. This
paper pre... |
1002.0383 | Feature Level Clustering of Large Biometric Database | cs.CV cs.DB cs.LG | This paper proposes an efficient technique for partitioning large biometric
database during identification. In this technique feature vector which
comprises of global and local descriptors extracted from offline signature are
used by fuzzy clustering technique to partition the database. As biometric
features posses n... |
1002.0406 | MIMO Transmission with Residual Transmit-RF Impairments | cs.IT math.IT | Physical transceiver implementations for multiple-input multiple-output
(MIMO) wireless communication systems suffer from transmit-RF (Tx-RF)
impairments. In this paper, we study the effect on channel capacity and
error-rate performance of residual Tx-RF impairments that defy proper
compensation. In particular, we de... |
1002.0411 | Face Identification by SIFT-based Complete Graph Topology | cs.CV cs.AI | This paper presents a new face identification system based on Graph Matching
Technique on SIFT features extracted from face images. Although SIFT features
have been successfully used for general object detection and recognition, only
recently they were applied to face recognition. This paper further investigates
the ... |
1002.0412 | SIFT-based Ear Recognition by Fusion of Detected Keypoints from Color
Similarity Slice Regions | cs.CV cs.AI | Ear biometric is considered as one of the most reliable and invariant
biometrics characteristics in line with iris and fingerprint characteristics.
In many cases, ear biometrics can be compared with face biometrics regarding
many physiological and texture characteristics. In this paper, a robust and
efficient ear rec... |
1002.0414 | Feature Level Fusion of Biometrics Cues: Human Identification with
Doddingtons Caricature | cs.CV cs.AI | This paper presents a multimodal biometric system of fingerprint and ear
biometrics. Scale Invariant Feature Transform (SIFT) descriptor based feature
sets extracted from fingerprint and ear are fused. The fused set is encoded by
K-medoids partitioning approach with less number of feature points in the set.
K-medoids... |
1002.0416 | Fusion of Multiple Matchers using SVM for Offline Signature
Identification | cs.CV cs.LG | This paper uses Support Vector Machines (SVM) to fuse multiple classifiers
for an offline signature system. From the signature images, global and local
features are extracted and the signatures are verified with the help of
Gaussian empirical rule, Euclidean and Mahalanobis distance based classifiers.
SVM is used to ... |
1002.0424 | Cooperative Algorithms for MIMO Interference Channels | cs.IT math.IT | Interference alignment is a transmission technique for exploiting all
available degrees of freedom in the interference channel with an arbitrary
number of users. Most prior work on interference alignment, however, neglects
interference from other nodes in the network not participating in the alignment
operation. This... |
1002.0432 | Detecting Motifs in System Call Sequences | cs.AI cs.CR cs.NE | The search for patterns or motifs in data represents an area of key interest
to many researchers. In this paper we present the Motif Tracking Algorithm, a
novel immune inspired pattern identification tool that is able to identify
unknown motifs which repeat within time series data. The power of the algorithm
is deriv... |
1002.0449 | Some improved results on communication between information systems | cs.AI | To study the communication between information systems, Wang et al. [C. Wang,
C. Wu, D. Chen, Q. Hu, and C. Wu, Communicating between information systems,
Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and
type-2 consistent functions. Some properties of such functions and induced
relation ... |
1002.0478 | \'Etude et traitement automatique de l'anglais du XVIIe si\`ecle :
outils morphosyntaxiques et dictionnaires | cs.CL | In this article, we record the main linguistic differences or singularities
of 17th century English, analyse them morphologically and syntactically and
propose equivalent forms in contemporary English. We show how 17th century
texts may be transcribed into modern English, combining the use of electronic
dictionaries ... |
1002.0479 | "Mind your p's and q's": or the peregrinations of an apostrophe in 17th
Century English | cs.CL | If the use of the apostrophe in contemporary English often marks the Saxon
genitive, it may also indicate the omission of one or more let-ters. Some
writers (wrongly?) use it to mark the plural in symbols or abbreviations,
visual-ised thanks to the isolation of the morpheme "s". This punctuation mark
was imported fro... |
1002.0481 | Recognition and translation Arabic-French of Named Entities: case of the
Sport places | cs.CL | The recognition of Arabic Named Entities (NE) is a problem in different
domains of Natural Language Processing (NLP) like automatic translation.
Indeed, NE translation allows the access to multilingual in-formation. This
translation doesn't always lead to expected result especially when NE contains
a person name. For... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.