id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1004.3257 | Offline Handwriting Recognition using Genetic Algorithm | cs.CV | Handwriting Recognition enables a person to scribble something on a piece of
paper and then convert it into text. If we look into the practical reality
there are enumerable styles in which a character may be written. These styles
can be self combined to generate more styles. Even if a small child knows the
basic styl... |
1004.3260 | Decision Support Systems (DSS) in Construction Tendering Processes | cs.AI | The successful execution of a construction project is heavily impacted by
making the right decision during tendering processes. Managing tender
procedures is very complex and uncertain involving coordination of many tasks
and individuals with different priorities and objectives. Bias and inconsistent
decision are ine... |
1004.3272 | Database Reverse Engineering based on Association Rule Mining | cs.DB | Maintaining a legacy database is a difficult task especially when system
documentation is poor written or even missing. Database reverse engineering is
an attempt to recover high-level conceptual design from the existing database
instances. In this paper, we propose a technique to discover conceptual schema
using the... |
1004.3273 | Sampling and Recovery of Pulse Streams | cs.IT math.IT | Compressive Sensing (CS) is a new technique for the efficient acquisition of
signals, images, and other data that have a sparse representation in some
basis, frame, or dictionary. By sparse we mean that the N-dimensional basis
representation has just K<<N significant coefficients; in this case, the CS
theory maintain... |
1004.3274 | A New Approach to Keyphrase Extraction Using Neural Networks | cs.IR | Keyphrases provide a simple way of describing a document, giving the reader
some clues about its contents. Keyphrases can be useful in a various
applications such as retrieval engines, browsing interfaces, thesaurus
construction, text mining etc.. There are also other tasks for which keyphrases
are useful, as we disc... |
1004.3276 | Color Image Compression Based On Wavelet Packet Best Tree | cs.CV | In Image Compression, the researchers' aim is to reduce the number of bits
required to represent an image by removing the spatial and spectral
redundancies. Recently discrete wavelet transform and wavelet packet has
emerged as popular techniques for image compression. The wavelet transform is
one of the major process... |
1004.3282 | Wireless Network Code Design and Performance Analysis using
Diversity-Multiplexing Tradeoff | cs.IT math.IT | Network coding and cooperative communication have received considerable
attention from the research community recently in order to mitigate the adverse
effects of fading in wireless transmissions and at the same time to achieve
high throughput and better spectral efficiency. In this work, we design and
analyze determ... |
1004.3332 | Estimation in Gaussian Noise: Properties of the Minimum Mean-Square
Error | cs.IT math.IT | Consider the minimum mean-square error (MMSE) of estimating an arbitrary
random variable from its observation contaminated by Gaussian noise. The MMSE
can be regarded as a function of the signal-to-noise ratio (SNR) as well as a
functional of the input distribution (of the random variable to be estimated).
It is show... |
1004.3334 | Generation and Interpretation of Temporal Decision Rules | cs.LG | We present a solution to the problem of understanding a system that produces
a sequence of temporally ordered observations. Our solution is based on
generating and interpreting a set of temporal decision rules. A temporal
decision rule is a decision rule that can be used to predict or retrodict the
value of a decisio... |
1004.3361 | From open quantum systems to open quantum maps | math.AP cs.LG math-ph math.DS math.MP nlin.CD | For a class of quantized open chaotic systems satisfying a natural dynamical
assumption, we show that the study of the resolvent, and hence of scattering
and resonances, can be reduced to the study of a family of open quantum maps,
that is of finite dimensional operators obtained by quantizing the Poincar\'e
map asso... |
1004.3371 | Improving Update Summarization by Revisiting the MMR Criterion | cs.IR | This paper describes a method for multi-document update summarization that
relies on a double maximization criterion. A Maximal Marginal Relevance like
criterion, modified and so called Smmr, is used to select sentences that are
close to the topic and at the same time, distant from sentences used in already
read docu... |
1004.3372 | Adaptive Single-Trial Error/Erasure Decoding for Binary Codes | cs.IT math.IT | We investigate adaptive single-trial error/erasure decoding of binary codes
whose decoder is able to correct e errors and t erasures if le+t<=d-1. Thereby,
d is the minimum Hamming distance of the code and 1<l<=2 is the tradeoff
parameter between errors and erasures. The error/erasure decoder allows to
exploit soft i... |
1004.3390 | Publishing Math Lecture Notes as Linked Data | cs.DL cs.AI math.HO | We mark up a corpus of LaTeX lecture notes semantically and expose them as
Linked Data in XHTML+MathML+RDFa. Our application makes the resulting documents
interactively browsable for students. Our ontology helps to answer queries from
students and lecturers, and paves the path towards an integration of our corpus
wit... |
1004.3408 | An Energy Efficient Scheme for Data Gathering in Wireless Sensor
Networks Using Particle Swarm Optimization | cs.NI cs.DC cs.NE | This paper has been withdrawn by the author due to a crucial sign error in
equation 1
|
1004.3427 | An Achievability Scheme for the Compound Channel with State Noncausally
Available at the Encoder | cs.IT math.IT | A new achievability scheme for the compound channel with discrete memoryless
(DM) state noncausally available at the encoder is established. Achievability
is proved using superposition coding, Marton coding, joint typicality encoding,
and indirect decoding. The scheme is shown to achieve strictly higher rate than
the... |
1004.3460 | PCA 4 DCA: The Application Of Principal Component Analysis To The
Dendritic Cell Algorithm | cs.AI cs.NE | As one of the newest members in the field of artificial immune systems (AIS),
the Dendritic Cell Algorithm (DCA) is based on behavioural models of natural
dendritic cells (DCs). Unlike other AIS, the DCA does not rely on training
data, instead domain or expert knowledge is required to predetermine the
mapping between... |
1004.3478 | Learning Better Context Characterizations: An Intelligent Information
Retrieval Approach | cs.IR cs.AI | This paper proposes an incremental method that can be used by an intelligent
system to learn better descriptions of a thematic context. The method starts
with a small number of terms selected from a simple description of the topic
under analysis and uses this description as the initial search context. Using
these ter... |
1004.3517 | Lower bounds for the error decay incurred by coarse quantization schemes | cs.IT math.IT | Several analog-to-digital conversion methods for bandlimited signals used in
applications, such as Sigma Delta quantization schemes, employ coarse
quantization coupled with oversampling. The standard mathematical model for the
error accrued from such methods measures the performance of a given scheme by
the rate at w... |
1004.3524 | From Local Measurements to Network Spectral Properties: Beyond Degree
Distributions | math.OC cs.DM cs.MA | It is well-known that the behavior of many dynamical processes running on
networks is intimately related to the eigenvalue spectrum of the network. In
this paper, we address the problem of inferring global information regarding
the eigenvalue spectrum of a network from a set of local samples of its
structure. In part... |
1004.3527 | On Asymptotic Consensus Value in Directed Random Networks | cs.MA math.OC | We study the asymptotic properties of distributed consensus algorithms over
switching directed random networks. More specifically, we focus on consensus
algorithms over independent and identically distributed, directed random
graphs, where each agent can communicate with any other agent with some
exogenously specifie... |
1004.3549 | Signature Region of Interest using Auto cropping | cs.CV | A new approach for signature region of interest pre-processing was presented.
It used new auto cropping preparation on the basis of the image content, where
the intensity value of pixel is the source of cropping. This approach provides
both the possibility of improving the performance of security systems based on
sig... |
1004.3557 | Neuroevolutionary optimization | cs.NE | This paper presents an application of evolutionary search procedures to
artificial neural networks. Here, we can distinguish among three kinds of
evolution in artificial neural networks, i.e. the evolution of connection
weights, of architectures, and of learning rules. We review each kind of
evolution in detail and a... |
1004.3565 | An Optimized Weighted Association Rule Mining On Dynamic Content | cs.DB | Association rule mining aims to explore large transaction databases for
association rules. Classical Association Rule Mining (ARM) model assumes that
all items have the same significance without taking their weight into account.
It also ignores the difference between the transactions and importance of each
and every ... |
1004.3568 | Integrating User's Domain Knowledge with Association Rule Mining | cs.DB cs.AI | This paper presents a variation of Apriori algorithm that includes the role
of domain expert to guide and speed up the overall knowledge discovery task.
Usually, the user is interested in finding relationships between certain
attributes instead of the whole dataset. Moreover, he can help the mining
algorithm to selec... |
1004.3571 | Computer Aided Design Modeling for Heterogeneous Objects | cs.CE | Heterogeneous object design is an active research area in recent years. The
conventional CAD modeling approaches only provide geometry and topology of the
object, but do not contain any information with regard to the materials of the
object and so can not be used for the fabrication of heterogeneous objects (HO)
thro... |
1004.3629 | Simultaneous Bayesian inference of motion velocity fields and
probabilistic models in successive video-frames described by spatio-temporal
MRFs | cs.CV | We numerically investigate a mean-field Bayesian approach with the assistance
of the Markov chain Monte Carlo method to estimate motion velocity fields and
probabilistic models simultaneously in consecutive digital images described by
spatio-temporal Markov random fields. Preliminary to construction of our
procedure,... |
1004.3692 | Compound Poisson Approximation via Information Functionals | math.PR cs.IT math.IT | An information-theoretic development is given for the problem of compound
Poisson approximation, which parallels earlier treatments for Gaussian and
Poisson approximation. Let $P_{S_n}$ be the distribution of a sum $S_n=\Sumn
Y_i$ of independent integer-valued random variables $Y_i$. Nonasymptotic bounds
are derived ... |
1004.3708 | Parcellation of fMRI Datasets with ICA and PLS-A Data Driven Approach | cs.CV cs.AI cs.NE | Inter-subject parcellation of functional Magnetic Resonance Imaging (fMRI)
data based on a standard General Linear Model (GLM)and spectral clustering was
recently proposed as a means to alleviate the issues associated with spatial
normalization in fMRI. However, for all its appeal, a GLM-based parcellation
approach i... |
1004.3714 | An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing
Selection | cs.IT math.IT | This paper develops upper bounds on the end-to-end transmission capacity of
multi-hop wireless networks. Potential source-destination paths are dynamically
selected from a pool of randomly located relays, from which a closed-form lower
bound on the outage probability is derived in terms of the expected number of
pote... |
1004.3725 | A Gibbs distribution that learns from GA dynamics | cs.NE | A general procedure of average-case performance evaluation for population
dynamics such as genetic algorithms (GAs) is proposed and its validity is
numerically examined. We introduce a learning algorithm of Gibbs distributions
from training sets which are gene configurations (strings) generated by GA in
order to figu... |
1004.3732 | Solving the Cold-Start Problem in Recommender Systems with Social Tags | cs.IR physics.soc-ph | In this paper, based on the user-tag-object tripartite graphs, we propose a
recommendation algorithm, which considers social tags as an important role for
information retrieval. Besides its low cost of computational time, the
experiment results of two real-world data sets, \emph{Del.icio.us} and
\emph{MovieLens}, sho... |
1004.3742 | Threshold Saturation on BMS Channels via Spatial Coupling | cs.IT math.IT | We consider spatially coupled code ensembles. A particular instance are
convolutional LDPC ensembles. It was recently shown that, for transmission over
the binary erasure channel, this coupling increases the belief propagation
threshold of the ensemble to the maximum a-priori threshold of the underlying
component ens... |
1004.3745 | An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles | cs.IT cs.NI math.IT | In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1
edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd
graceful if and only if m even, she proved the cycle graph is not graceful if m
odd. In this paper, firstly, we studied the graph C_m $\cup$ P_m when m = 4,
6,8,1... |
1004.3755 | The SIMO Pre-Log Can Be Larger Than the SISO Pre-Log | cs.IT math.IT | We establish a lower bound on the noncoherent capacity pre-log of a
temporally correlated Rayleigh block-fading single-input multiple-output (SIMO)
channel. Surprisingly, when the covariance matrix of the channel satisfies a
certain technical condition related to the cardinality of its smallest set of
linearly depend... |
1004.3774 | Incidence structures from the blown-up plane and LDPC codes | cs.IT math.AG math.CO math.IT | In this article, new regular incidence structures are presented. They arise
from sets of conics in the affine plane blown-up at its rational points. The
LDPC codes given by these incidence matrices are studied. These sparse
incidence matrices turn out to be redundant, which means that their number of
rows exceeds the... |
1004.3806 | Information Theory and Quadrature Rules | cs.IT math.IT math.NA | Quadrature rules estimate the value of an integral when the function is given
by a table of values. Every binary string defines a quadrature rule by choosing
which endpoint of each interval represents the interval. The standard rules,
such as Simpson's Rule, correspond to strings of low Kolmogorov complexity,
making ... |
1004.3807 | Interference Cancellation at the Relay for Multi-User Wireless
Cooperative Networks | cs.IT math.IT | We study multi-user transmission and detection schemes for a multi-access
relay network (MARN) with linear constraints at all nodes. In a $(J, J_a, R_a,
M)$ MARN, $J$ sources, each equipped with $J_a$ antennas, communicate to one
$M$-antenna destination through one $R_a$-antenna relay. A new protocol called
IC-Relay-... |
1004.3809 | Artificial Immune Systems Metaphor for Agent Based Modeling of Crisis
Response Operations | cs.MA cs.AI cs.CY | Crisis response requires information intensive efforts utilized for reducing
uncertainty, calculating and comparing costs and benefits, and managing
resources in a fashion beyond those regularly available to handle routine
problems. This paper presents an Artificial Immune Systems (AIS) metaphor for
agent based model... |
1004.3811 | Resolving the Complexity of Some Data Privacy Problems | cs.CC cs.DB | We formally study two methods for data sanitation that have been used
extensively in the database community: k-anonymity and l-diversity. We settle
several open problems concerning the difficulty of applying these methods
optimally, proving both positive and negative results:
1. 2-anonymity is in P.
2. The proble... |
1004.3814 | Bregman Distance to L1 Regularized Logistic Regression | cs.LG | In this work we investigate the relationship between Bregman distances and
regularized Logistic Regression model. We present a detailed study of Bregman
Distance minimization, a family of generalized entropy measures associated with
convex functions. We convert the L1-regularized logistic regression into this
more ge... |
1004.3833 | Normal Factor Graphs and Holographic Transformations | cs.IT math.IT | This paper stands at the intersection of two distinct lines of research. One
line is "holographic algorithms," a powerful approach introduced by Valiant for
solving various counting problems in computer science; the other is "normal
factor graphs," an elegant framework proposed by Forney for representing codes
define... |
1004.3878 | Where is Randomness Needed to Break the Square-Root Bottleneck? | cs.IT math.IT | As shown by Tropp, 2008, for the concatenation of two orthonormal bases
(ONBs), breaking the square-root bottleneck in compressed sensing does not
require randomization over all the positions of the nonzero entries of the
sparse coefficient vector. Rather the positions corresponding to one of the two
ONBs can be chos... |
1004.3884 | Oil Price Trackers Inspired by Immune Memory | cs.AI cs.NE | We outline initial concepts for an immune inspired algorithm to evaluate and
predict oil price time series data. The proposed solution evolves a short term
pool of trackers dynamically, with each member attempting to map trends and
anticipate future price movements. Successful trackers feed into a long term
memory po... |
1004.3887 | Motif Detection Inspired by Immune Memory | cs.AI cs.NE q-bio.QM | 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
variable length unknown motifs which repeat within time series data. The
algorithm searc... |
1004.3919 | Performance Evaluation of DCA and SRC on a Single Bot Detection | cs.AI cs.CR cs.NE | Malicious users try to compromise systems using new techniques. One of the
recent techniques used by the attacker is to perform complex distributed
attacks such as denial of service and to obtain sensitive data such as password
information. These compromised machines are said to be infected with malicious
software te... |
1004.3932 | Modelling Immunological Memory | cs.AI cs.NE q-bio.CB | Accurate immunological models offer the possibility of performing
highthroughput experiments in silico that can predict, or at least suggest, in
vivo phenomena. In this chapter, we compare various models of immunological
memory. We first validate an experimental immunological simulator, developed by
the authors, by s... |
1004.3939 | Price Trackers Inspired by Immune Memory | cs.AI cs.NE physics.data-an q-fin.PM | In this paper we outline initial concepts for an immune inspired algorithm to
evaluate price time series data. The proposed solution evolves a short term
pool of trackers dynamically through a process of proliferation and mutation,
with each member attempting to map to trends in price movements. Successful
trackers f... |
1004.3966 | A Message-Passing Algorithm for Counting Short Cycles in a Graph | cs.IT math.IT | A message-passing algorithm for counting short cycles in a graph is
presented. For bipartite graphs, which are of particular interest in coding,
the algorithm is capable of counting cycles of length g, g +2,..., 2g - 2,
where g is the girth of the graph. For a general (non-bipartite) graph, cycles
of length g; g + 1,... |
1004.3980 | Hashing Image Patches for Zooming | cs.CV | In this paper we present a Bayesian image zooming/super-resolution algorithm
based on a patch based representation. We work on a patch based model with
overlap and employ a Locally Linear Embedding (LLE) based approach as our data
fidelity term in the Bayesian inference. The image prior imposes continuity
constraints... |
1004.4017 | Optimal-Rate Code Constructions for Computationally Simple Channels | cs.IT cs.CC math.IT | We consider coding schemes for computationally bounded channels, which can
introduce an arbitrary set of errors as long as (a) the fraction of errors is
bounded with high probability by a parameter $p$ and (b) the process which adds
the errors can be described by a sufficiently simple circuit. Codes for such
channel ... |
1004.4020 | Analysis and Design of Binary Message-Passing Decoders | cs.IT math.IT | Binary message-passing decoders for low-density parity-check (LDPC) codes are
studied by using extrinsic information transfer (EXIT) charts. The channel
delivers hard or soft decisions and the variable node decoder performs all
computations in the L-value domain. A hard decision channel results in the
well-know Galla... |
1004.4022 | Database Security: A Historical Perspective | cs.DB | The importance of security in database research has greatly increased over
the years as most of critical functionality of the business and military
enterprises became digitized. Database is an integral part of any information
system and they often hold sensitive data. The security of the data depends on
physical secu... |
1004.4044 | Sparsity Pattern Recovery in Bernoulli-Gaussian Signal Model | cs.IT math.IT | In compressive sensing, sparse signals are recovered from underdetermined
noisy linear observations. One of the interesting problems which attracted a
lot of attention in recent times is the support recovery or sparsity pattern
recovery problem. The aim is to identify the non-zero elements in the original
sparse sign... |
1004.4063 | On two variations of identifying codes | cs.DM cs.IT math.CO math.IT | Identifying codes have been introduced in 1998 to model fault-detection in
multiprocessor systems. In this paper, we introduce two variations of
identifying codes: weak codes and light codes. They correspond to
fault-detection by successive rounds. We give exact bounds for those two
definitions for the family of cycl... |
1004.4070 | Constructions of Optical Queues With a Limited Number of
Recirculations--Part I: Greedy Constructions | cs.IT math.IT math.NT | In this two-part paper, we consider SDL constructions of optical queues with
a limited number of recirculations through the optical switches and the fiber
delay lines. We show that the constructions of certain types of optical queues,
including linear compressors, linear decompressors, and 2-to-1 FIFO
multiplexers, u... |
1004.4075 | Secrecy Gain: a Wiretap Lattice Code Design | cs.IT cs.CR math.IT | We propose the notion of secrecy gain as a code design criterion for wiretap
lattice codes to be used over an additive white Gaussian noise channel. Our
analysis relies on the error probabilites of both the legitimate user and the
eavesdropper. We focus on geometrical properties of lattices, described by
their theta ... |
1004.4089 | Real-Time Alert Correlation with Type Graphs | cs.AI cs.CR | The premise of automated alert correlation is to accept that false alerts
from a low level intrusion detection system are inevitable and use attack
models to explain the output in an understandable way. Several algorithms exist
for this purpose which use attack graphs to model the ways in which attacks can
be combine... |
1004.4095 | STORM - A Novel Information Fusion and Cluster Interpretation Technique | cs.AI cs.NE | Analysis of data without labels is commonly subject to scrutiny by
unsupervised machine learning techniques. Such techniques provide more
meaningful representations, useful for better understanding of a problem at
hand, than by looking only at the data itself. Although abundant expert
knowledge exists in many areas w... |
1004.4170 | A New Metaheuristic Bat-Inspired Algorithm | math.OC cs.NE physics.bio-ph physics.comp-ph | Metaheuristic algorithms such as particle swarm optimization, firefly
algorithm and harmony search are now becoming powerful methods for solving many
tough optimization problems. In this paper, we propose a new metaheuristic
method, the Bat Algorithm, based on the echolocation behaviour of bats. We also
intend to com... |
1004.4181 | Displacement Calculus | cs.CL | The Lambek calculus provides a foundation for categorial grammar in the form
of a logic of concatenation. But natural language is characterized by
dependencies which may also be discontinuous. In this paper we introduce the
displacement calculus, a generalization of Lambek calculus, which preserves its
good proof-the... |
1004.4216 | Symmetric M-tree | cs.DB cs.DS | The M-tree is a paged, dynamically balanced metric access method that
responds gracefully to the insertion of new objects. To date, no algorithm has
been published for the corresponding Delete operation. We believe this to be
non-trivial because of the design of the M-tree's Insert algorithm. We propose
a modificatio... |
1004.4222 | Performance Analysis of Sparse Recovery Based on Constrained Minimal
Singular Values | cs.IT math.IT | The stability of sparse signal reconstruction is investigated in this paper.
We design efficient algorithms to verify the sufficient condition for unique
$\ell_1$ sparse recovery. One of our algorithm produces comparable results with
the state-of-the-art technique and performs orders of magnitude faster. We show
that... |
1004.4223 | Settling the Polynomial Learnability of Mixtures of Gaussians | cs.LG cs.DS | Given data drawn from a mixture of multivariate Gaussians, a basic problem is
to accurately estimate the mixture parameters. We give an algorithm for this
problem that has a running time, and data requirement polynomial in the
dimension and the inverse of the desired accuracy, with provably minimal
assumptions on the... |
1004.4277 | Constructions of Optical Queues With a Limited Number of
Recirculations--Part II: Optimal Constructions | cs.IT math.IT math.NT | One of the main problems in all-optical packet-switched networks is the lack
of optical buffers, and one feasible technology for the constructions of
optical buffers is to use optical crossbar Switches and fiber Delay Lines
(SDL). In this two-part paper, we consider SDL constructions of optical queues
with a limited ... |
1004.4299 | Distributed Data Storage with Minimum Storage Regenerating Codes - Exact
and Functional Repair are Asymptotically Equally Efficient | cs.IT math.IT | We consider a set up where a file of size M is stored in n distributed
storage nodes, using an (n,k) minimum storage regenerating (MSR) code, i.e., a
maximum distance separable (MDS) code that also allows efficient exact-repair
of any failed node. The problem of interest in this paper is to minimize the
repair bandwi... |
1004.4308 | Segmented compressed sampling for analog-to-information conversion:
Method and performance analysis | cs.IT math.IT stat.AP | A new segmented compressed sampling method for analog-to-information
conversion (AIC) is proposed. An analog signal measured by a number of parallel
branches of mixers and integrators (BMIs), each characterized by a specific
random sampling waveform, is first segmented in time into $M$ segments. Then
the sub-samples ... |
1004.4334 | New Results on Secret Key Establishment over a Pair of Broadcast
Channels | cs.IT cs.CR math.IT | The problem of Secret Key Establishment (SKE) over a pair of independent
Discrete Memoryless Broadcast Channels (DMBCs) has already been studied in
\cite{Ah10}, where we provided lower and upper bounds on the secret-key
capacity. In this paper, we study the above setup under each of the following
two cases: (1) the D... |
1004.4342 | Towards Closed World Reasoning in Dynamic Open Worlds (Extended Version) | cs.AI | The need for integration of ontologies with nonmonotonic rules has been
gaining importance in a number of areas, such as the Semantic Web. A number of
researchers addressed this problem by proposing a unified semantics for hybrid
knowledge bases composed of both an ontology (expressed in a fragment of
first-order log... |
1004.4361 | Reduction of behavior of additive cellular automata on groups | nlin.CG cs.NE | A class of additive cellular automata (ACA) on a finite group is defined by
an index-group $\m g$ and a finite field $\m F_p$ for a prime modulus $p$
\cite{Bul_arch_1}. This paper deals mainly with ACA on infinite commutative
groups and direct products of them with some non commutative $p$-groups. It
appears that for... |
1004.4373 | Spatially-Adaptive Reconstruction in Computed Tomography Based on
Statistical Learning | cs.CV | We propose a direct reconstruction algorithm for Computed Tomography, based
on a local fusion of a few preliminary image estimates by means of a non-linear
fusion rule. One such rule is based on a signal denoising technique which is
spatially adaptive to the unknown local smoothness. Another, more powerful
fusion rul... |
1004.4398 | Compressive MUSIC: A Missing Link Between Compressive Sensing and Array
Signal Processing | cs.IT math.IT | The multiple measurement vector (MMV) problem addresses the identification of
unknown input vectors that share common sparse support. Even though MMV
problems had been traditionally addressed within the context of sensor array
signal processing, the recent trend is to apply compressive sensing (CS) due to
its capabil... |
1004.4421 | Efficient Learning with Partially Observed Attributes | cs.LG | We describe and analyze efficient algorithms for learning a linear predictor
from examples when the learner can only view a few attributes of each training
example. This is the case, for instance, in medical research, where each
patient participating in the experiment is only willing to go through a small
number of t... |
1004.4432 | Throughput-Delay-Reliability Tradeoff with ARQ in Wireless Ad Hoc
Networks | cs.IT math.IT | Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs
in an ad hoc network are derived for single hop and multi-hop transmission with
automatic repeat request (ARQ) on each hop. The delay constraint is modeled by
assuming that each packet is allowed at most $D$ retransmissions end-to-end,
and th... |
1004.4438 | A Survey on Network Codes for Distributed Storage | cs.IT cs.DC cs.NI math.IT | Distributed storage systems often introduce redundancy to increase
reliability. When coding is used, the repair problem arises: if a node storing
encoded information fails, in order to maintain the same level of reliability
we need to create encoded information at a new node. This amounts to a partial
recovery of the... |
1004.4448 | Deblured Gaussian Blurred Images | cs.CV | This paper attempts to undertake the study of Restored Gaussian Blurred
Images. by using four types of techniques of deblurring image as Wiener filter,
Regularized filter, Lucy Richardson deconvlutin algorithm and Blind
deconvlution algorithm with an information of the Point Spread Function (PSF)
corrupted blurred im... |
1004.4450 | Improving Supply Chain Coordination by Linking Dynamic Procurement
Decision to Multi-Agent System | cs.MA | The Internet has changed the way business is conducted in many ways. For
example, in the field of procurement, the possibility to directly interact with
a trading partner has given rise to new mechanisms in the supply chain
management. One such interactive dynamic procurement, which lets both buyer and
seller softwar... |
1004.4454 | Crowd simulation influenced by agent's socio-psychological state | cs.MA | The aim our work is to create virtual humans as intelligent entities, which
includes approximate the maximum as possible the virtual agent animation to the
natural human behavior. In order to accomplish this task, our agent must be
capable to interact with the environment, interacting with objects and other
agents. T... |
1004.4460 | Handling Overload Conditions In High Performance Trustworthy Information
Retrieval Systems | cs.IR | Web search engines retrieve a vast amount of information for a given search
query. But the user needs only trustworthy and high-quality information from
this vast retrieved data. The response time of the search engine must be a
minimum value in order to satisfy the user. An optimum level of response time
should be ma... |
1004.4462 | BiLingual Information Retrieval System for English and Tamil | cs.IR | This paper addresses the design and implementation of BiLingual Information
Retrieval system on the domain, Festivals. A generic platform is built for
BiLingual Information retrieval which can be extended to any foreign or Indian
language working with the same efficiency. Search for the solution of the query
is not d... |
1004.4464 | Audio enabled information extraction system for cricket and hockey
domains | cs.IR cs.MM cs.SD | The proposed system aims at the retrieval of the summarized information from
the documents collected from web based search engine as per the user query
related to cricket and hockey domain. The system is designed in a manner that
it takes the voice commands as keywords for search. The parts of speech in the
query are... |
1004.4467 | An Efficient Watermarking Algorithm to Improve Payload and Robustness
without Affecting Image Perceptual Quality | cs.CV | Capacity, Robustness, & Perceptual quality of watermark data are very
important issues to be considered. A lot of research is going on to increase
these parameters for watermarking of the digital images, as there is always a
tradeoff among them. . In this paper an efficient watermarking algorithm to
improve payload a... |
1004.4488 | Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check
codes$\,$" | cs.IT math.IT | In our recent paper entitled "Quantum Quasi-Cyclic Low-Density Parity-Check
codes" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can
be constructed via the CSS encoding/decoding approach with various lengths and
rates. However, the further investigation shows that the proposed construction
may st... |
1004.4489 | MIREX: MapReduce Information Retrieval Experiments | cs.IR | We propose to use MapReduce to quickly test new retrieval approaches on a
cluster of machines by sequentially scanning all documents. We present a small
case study in which we use a cluster of 15 low cost ma- chines to search a web
crawl of 0.5 billion pages showing that sequential scanning is a viable
approach to ru... |
1004.4490 | On MMSE Properties and I-MMSE Implications in Parallel MIMO Gaussian
Channels | cs.IT math.IT | This paper extends the "single crossing point" property of the scalar MMSE
function, derived by Guo, Shamai and Verd\'u (first presented in ISIT 2008), to
the parallel degraded MIMO scenario. It is shown that the matrix Q(t), which is
the difference between the MMSE assuming a Gaussian input and the MMSE assuming
an ... |
1004.4492 | Optimal Beamforming in Interference Networks with Perfect Local Channel
Information | cs.IT math.IT | We consider settings in which T multi-antenna transmitters and K
single-antenna receivers concurrently utilize the available communication
resources. Each transmitter sends useful information only to its intended
receivers and can degrade the performance of unintended systems. Here, we
assume the performance measures... |
1004.4520 | Non-Systematic Codes for Physical Layer Security | cs.IT math.IT | This paper is a first study on the topic of achieving physical layer security
by exploiting non-systematic channel codes. The chance of implementing
transmission security at the physical layer is known since many years in
information theory, but it is now gaining an increasing interest due to its
many possible applic... |
1004.4529 | Rank Awareness in Joint Sparse Recovery | cs.IT math.IT | In this paper we revisit the sparse multiple measurement vector (MMV) problem
where the aim is to recover a set of jointly sparse multichannel vectors from
incomplete measurements. This problem has received increasing interest as an
extension of the single channel sparse recovery problem which lies at the heart
of th... |
1004.4530 | Coding Theorems for a (2,2)-Threshold Scheme with Detectability of
Impersonation Attacks | cs.IT cs.CR math.IT | In this paper, we discuss coding theorems on a $(2, 2)$--threshold scheme in
the presence of an opponent who impersonates one of the two shareholders in an
asymptotic setup. We consider a situation where $n$ secrets $S^n$ from a
memoryless source is blockwisely encoded to two shares and the two shares are
decoded to ... |
1004.4590 | Concatenated Coding for the AWGN Channel with Noisy Feedback | cs.IT math.IT | The use of open-loop coding can be easily extended to a closed-loop
concatenated code if the channel has access to feedback. This can be done by
introducing a feedback transmission scheme as an inner code. In this paper,
this process is investigated for the case when a linear feedback scheme is
implemented as an inne... |
1004.4601 | Data Stream Algorithms for Codeword Testing | cs.IT math.IT | Motivated by applications in storage systems and property testing, we study
data stream algorithms for local testing and tolerant testing of codes.
Ideally, we would like to know whether there exist asymptotically good codes
that can be local/tolerant tested with one-pass, poly-log space data stream
algorithms. We sh... |
1004.4610 | Mobility Prediction in Wireless Ad Hoc Networks using Neural Networks | cs.NE | Mobility prediction allows estimating the stability of paths in a mobile
wireless Ad Hoc networks. Identifying stable paths helps to improve routing by
reducing the overhead and the number of connection interruptions. In this
paper, we introduce a neural network based method for mobility prediction in Ad
Hoc networks... |
1004.4663 | On the Existence of Optimal Exact-Repair MDS Codes for Distributed
Storage | cs.IT math.IT | The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes
has recently motivated a new class of codes, called Regenerating Codes, that
optimally trade off storage cost for repair bandwidth. In this paper, we
address bandwidth-optimal (n,k,d) Exact-Repair MDS codes, which allow for any
failed node t... |
1004.4668 | Evolutionary Inference for Function-valued Traits: Gaussian Process
Regression on Phylogenies | q-bio.QM cs.LG physics.data-an stat.ML | Biological data objects often have both of the following features: (i) they
are functions rather than single numbers or vectors, and (ii) they are
correlated due to phylogenetic relationships. In this paper we give a flexible
statistical model for such data, by combining assumptions from phylogenetics
with Gaussian p... |
1004.4689 | Quantum Location Verification in Noisy Channels | quant-ph cs.IT math.IT | Recently it has been shown how the use of quantum entanglement can lead to
the creation of real-time communication channels whose viability can be made
location dependent. Such functionality leads to new security paradigms that are
not possible in classical communication networks. Key to these new security
paradigms ... |
1004.4704 | Homophily and Contagion Are Generically Confounded in Observational
Social Network Studies | stat.AP cs.SI physics.data-an physics.soc-ph | We consider processes on social networks that can potentially involve three
factors: homophily, or the formation of social ties due to matching individual
traits; social contagion, also known as social influence; and the causal effect
of an individual's covariates on their behavior or other measurable responses.
We s... |
1004.4713 | Construction of Short Protocol Sequences with Worst-Case Throughput
Guarantee | cs.IT cs.DM math.IT | Protocol sequences are used in channel access for the multiple-access
collision channel without feedback. A new construction of protocol sequences
with a guarantee of worst-case system throughput is proposed. The construction
is based on Chinese remainder theorem. The Hamming crosscorrelation is proved
to be concentr... |
1004.4718 | A Data Cleansing Method for Clustering Large-scale Transaction Databases | cs.DB | In this paper, we emphasize the need for data cleansing when clustering
large-scale transaction databases and propose a new data cleansing method that
improves clustering quality and performance. We evaluate our data cleansing
method through a series of experiments. As a result, the clustering quality and
performance... |
1004.4729 | On the Complexity of the $k$-Anonymization Problem | cs.CC cs.DB | We study the problem of anonymizing tables containing personal information
before releasing them for public use. One of the formulations considered in
this context is the $k$-anonymization problem: given a table, suppress a
minimum number of cells so that in the transformed table, each row is identical
to atleast $k-... |
1004.4732 | Minimum energy required to copy one bit of information | cs.IT math.IT | In this paper, we calculate energy required to copy one bit of useful
information in the presence of thermal noise. For this purpose, we consider a
quantum system capable of storing one bit of classical information, which is
initially in a mixed state corresponding to temperature T. We calculate how
many of these sys... |
1004.4734 | On the comparison of plans: Proposition of an instability measure for
dynamic machine scheduling | cs.AI | On the basis of an analysis of previous research, we present a generalized
approach for measuring the difference of plans with an exemplary application to
machine scheduling. Our work is motivated by the need for such measures, which
are used in dynamic scheduling and planning situations. In this context,
quantitativ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.