id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1001.2596 | On Optimum End-to-End Distortion in Wideband MIMO Systems | cs.IT math.IT | This paper presents the impact of frequency diversity on the optimum expected
end-to-end distortion (EED) in an outage-free wideband multiple-input
multiple-output (MIMO) system. We provide the closed-form expression of optimum
asymptotic expected EED comprised of the optimum distortion exponent and the
multiplicativ... |
1001.2605 | An Explicit Nonlinear Mapping for Manifold Learning | cs.CV cs.LG | Manifold learning is a hot research topic in the field of computer science
and has many applications in the real world. A main drawback of manifold
learning methods is, however, that there is no explicit mappings from the input
data manifold to the output embedding. This prohibits the application of
manifold learning... |
1001.2612 | On distributed convex optimization under inequality and equality
constraints via primal-dual subgradient methods | math.OC cs.SY | We consider a general multi-agent convex optimization problem where the
agents are to collectively minimize a global objective function subject to a
global inequality constraint, a global equality constraint, and a global
constraint set. The objective function is defined by a sum of local objective
functions, while t... |
1001.2620 | Discontinuities and hysteresis in quantized average consensus | math.OC cs.SY | We consider continuous-time average consensus dynamics in which the agents'
states are communicated through uniform quantizers. Solutions to the resulting
system are defined in the Krasowskii sense and are proven to converge to
conditions of "practical consensus". To cope with undesired chattering
phenomena we introd... |
1001.2623 | A Steganography Based on CT-CDMA Communication Scheme Using Complete
Complementary Codes | cs.IT cs.CR math.IT | It has been shown that complete complementary codes can be applied into some
communication systems like approximately synchronized CDMA systems because of
its good correlation properties. CT-CDMA is one of the communication systems
based on complete complementary codes. In this system, the information data of
the mul... |
1001.2625 | Finding top-k similar pairs of objects annotated with terms from an
ontology | cs.DB | With the growing focus on semantic searches and interpretations, an
increasing number of standardized vocabularies and ontologies are being
designed and used to describe data. We investigate the querying of objects
described by a tree-structured ontology. Specifically, we consider the case of
finding the top-k best p... |
1001.2636 | Analytical shape determination of fiber-like objects with Virtual Image
Correlation | cs.CV physics.comp-ph | This paper reports a method allowing for the determination of the shape of
deformed fiber-like objects. Compared to existing methods, it provides
analytical results including the local slope and curvature which are of first
importance, for instance, in beam mechanics. The presented VIC (Virtual Image
Correlation) met... |
1001.2647 | A General Euclidean Geometric Representation for the Classical Detection
Theory | cs.IT math.IT | We propose an Euclidean geometric representation for the classical detection
theory. The proposed representation is so generic that can be employed to
almost all communication problems. The hypotheses and observations are mapped
into R^N in such a way that a posteriori probability of an hypothesis given an
observatio... |
1001.2662 | Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary
Kernels | cs.IT math.IT | A method of channel polarization, proposed by Arikan, allows us to construct
efficient capacity-achieving channel codes. In the original work, binary input
discrete memoryless channels are considered. A special case of $q$-ary channel
polarization is considered by Sasoglu, Telatar, and Arikan. In this paper, we
consi... |
1001.2665 | Detecting Botnets Through Log Correlation | cs.AI cs.CR | Botnets, which consist of thousands of compromised machines, can cause
significant threats to other systems by launching Distributed Denial of Service
(SSoS) attacks, keylogging, and backdoors. In response to these threats, new
effective techniques are needed to detect the presence of botnets. In this
paper, we have ... |
1001.2686 | Effective complexity of stationary process realizations | cs.IT math.IT | The concept of effective complexity of an object as the minimal description
length of its regularities has been initiated by Gell-Mann and Lloyd. The
regularities are modeled by means of ensembles, that is probability
distributions on finite binary strings. In our previous paper we propose a
definition of effective c... |
1001.2709 | Kernel machines with two layers and multiple kernel learning | cs.LG cs.AI | In this paper, the framework of kernel machines with two layers is
introduced, generalizing classical kernel methods. The new learning methodology
provide a formal connection between computational architectures with multiple
layers and the theme of kernel learning in standard regularization methods.
First, a represen... |
1001.2735 | Stochastic Budget Optimization in Internet Advertising | cs.CC cs.GT cs.SI | Internet advertising is a sophisticated game in which the many advertisers
"play" to optimize their return on investment. There are many "targets" for the
advertisements, and each "target" has a collection of games with a potentially
different set of players involved. In this paper, we study the problem of how
advert... |
1001.2738 | Note on sampling without replacing from a finite collection of matrices | cs.IT math.IT quant-ph | This technical note supplies an affirmative answer to a question raised in a
recent pre-print [arXiv:0910.1879] in the context of a "matrix recovery"
problem. Assume one samples m Hermitian matrices X_1, ..., X_m with replacement
from a finite collection. The deviation of the sum X_1+...+X_m from its
expected value i... |
1001.2766 | On the scaling of Polar codes: I. The behavior of polarized channels | cs.IT math.IT | We consider the asymptotic behavior of the polarization process for polar
codes when the blocklength tends to infinity. In particular, we study the
problem of asymptotic analysis of the cumulative distribution $\mathbb{P}(Z_n
\leq z)$, where $Z_n=Z(W_n)$ is the Bhattacharyya process, and its dependence
to the rate of... |
1001.2767 | Universally Optimal Privacy Mechanisms for Minimax Agents | cs.CR cs.DB cs.DS | A scheme that publishes aggregate information about sensitive data must
resolve the trade-off between utility to information consumers and privacy of
the database participants. Differential privacy is a well-established
definition of privacy--this is a universal guarantee against all attackers,
whatever their side-in... |
1001.2781 | Interaction Strictly Improves the Wyner-Ziv Rate-distortion function | cs.IT math.IT | In 1985 Kaspi provided a single-letter characterization of the
sum-rate-distortion function for a two-way lossy source coding problem in which
two terminals send multiple messages back and forth with the goal of
reproducing each other's sources. Yet, the question remained whether more
messages can strictly improve th... |
1001.2786 | A General Coding Scheme for Two-User Fading Interference Channels | cs.IT math.IT | A Han-Kobayashi based achievable scheme is presented for ergodic fading
two-user Gaussian interference channels (IFCs) with perfect channel state
information at all nodes and Gaussian codebooks with no time-sharing. Using
max-min optimization techniques, it is shown that jointly coding across all
states performs at l... |
1001.2805 | Source Coding With Side Information Using List Decoding | cs.IT math.IT | The problem of source coding with side information (SCSI) is closely related
to channel coding. Therefore, existing literature focuses on using the most
successful channel codes namely, LDPC codes, turbo codes, and their variants,
to solve this problem assuming classical unique decoding of the underlying
channel code... |
1001.2806 | MIMO Gaussian Broadcast Channels with Confidential and Common Messages | cs.IT cs.CR math.IT | This paper considers the problem of secret communication over a two-receiver
multiple-input multiple-output (MIMO) Gaussian broadcast channel. The
transmitter has two independent, confidential messages and a common message.
Each of the confidential messages is intended for one of the receivers but
needs to be kept pe... |
1001.2813 | A Monte Carlo Algorithm for Universally Optimal Bayesian Sequence
Prediction and Planning | nlin.AO cond-mat.dis-nn cs.AI cs.LG stat.ML | The aim of this work is to address the question of whether we can in
principle design rational decision-making agents or artificial intelligences
embedded in computable physics such that their decisions are optimal in
reasonable mathematical senses. Recent developments in rare event probability
estimation, recursive ... |
1001.2892 | On the Capacity of Causal Cognitive Interference Channel With Delay | cs.IT math.IT | In this paper, we introduce the Causal Cognitive Interference Channel With
Delay (CC-IFC-WD) in which the cognitive user transmission can depend on $L$
future received symbols as well as the past ones. Taking the effect of the link
delays into account, CC-IFC-WD fills the gap between the genie-aided and causal
1cogni... |
1001.2897 | Sharp Bounds on the Entropy of the Poisson Law and Related Quantities | cs.IT math.IT math.ST stat.TH | One of the difficulties in calculating the capacity of certain Poisson
channels is that H(lambda), the entropy of the Poisson distribution with mean
lambda, is not available in a simple form. In this work we derive upper and
lower bounds for H(lambda) that are asymptotically tight and easy to compute.
The derivation ... |
1001.2900 | A digital interface for Gaussian relay networks: lifting codes from the
discrete superposition model to Gaussian relay networks | cs.IT math.IT | For every Gaussian relay network with a single source-destination pair, it is
known that there exists a corresponding deterministic network called the
discrete superposition network that approximates its capacity uniformly over
all SNR's to within a bounded number of bits. The next step in this program of
rigorous ap... |
1001.2938 | Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay
Channels | cs.IT math.IT | Transmit signal and bandwidth optimization is considered in multiple-antenna
relay channels. Assuming all terminals have channel state information, the
cut-set capacity upper bound and decode-and-forward rate under full-duplex
relaying are evaluated by formulating them as convex optimization problems. For
half-duplex... |
1001.2947 | Design and Analysis of Multi-User SDMA Systems with Noisy Limited CSIT
Feedback | cs.IT math.IT | In this paper, we consider spatial-division multiple-access (SDMA) systems
with one base station with multiple antennae and a number of single antenna
mobiles under noisy limited CSIT feedback. We propose a robust noisy limited
feedback design for SDMA systems. The solution consists of a real-time robust
SDMA precodi... |
1001.2957 | Asymptotic Learning Curve and Renormalizable Condition in Statistical
Learning Theory | cs.LG | Bayes statistics and statistical physics have the common mathematical
structure, where the log likelihood function corresponds to the random
Hamiltonian. Recently, it was discovered that the asymptotic learning curves in
Bayes estimation are subject to a universal law, even if the log likelihood
function can not be a... |
1001.3036 | Shaping Bits | cs.IT math.IT | The performance of bit-interleaved coded modulation (BICM) with bit shaping
(i.e., non-equiprobable bit probabilities in the underlying binary code) is
studied. For the Gaussian channel, the rates achievable with BICM and bit
shaping are practically identical to those of coded modulation or multilevel
coding. This id... |
1001.3053 | On some upper bounds on the fractional chromatic number of weighted
graphs | cs.IT math.CO math.IT | Given a weighted graph $G_\bx$, where $(x(v): v \in V)$ is a non-negative,
real-valued weight assigned to the vertices of G, let $B(G_\bx)$ be an upper
bound on the fractional chromatic number of the weighted graph $G_\bx$; so
$\chi_f(G_\bx) \le B(G_\bx)$. To investigate the worst-case performance of the
upper bound ... |
1001.3087 | Source Polarization | cs.IT math.IT | The notion of source polarization is introduced and investigated. This
complements the earlier work on channel polarization. An application to
Slepian-Wolf coding is also considered. The paper is restricted to the case of
binary alphabets. Extension of results to non-binary alphabets is discussed
briefly.
|
1001.3090 | Feature Extraction for Universal Hypothesis Testing via Rank-constrained
Optimization | cs.IT cs.LG math.IT math.ST stat.TH | This paper concerns the construction of tests for universal hypothesis
testing problems, in which the alternate hypothesis is poorly modeled and the
observation space is large. The mismatched universal test is a feature-based
technique for this purpose. In prior work it is shown that its
finite-observation performanc... |
1001.3102 | On the Capacity Achieving Covariance Matrix for Frequency Selective MIMO
Channels Using the Asymptotic Approach | cs.IT math.IT | In this contribution, an algorithm for evaluating the capacity-achieving
input covariance matrices for frequency selective Rayleigh MIMO channels is
proposed. In contrast with the flat fading Rayleigh cases, no closed-form
expressions for the eigenvectors of the optimum input covariance matrix are
available. Classica... |
1001.3107 | A Practical Dirty Paper Coding Applicable for Broadcast Channel | cs.IT math.IT | In this paper, we present a practical dirty paper coding scheme using trellis
coded modulation for the dirty paper channel $Y=X+S+W,$ $\mathbb{E}\{X^2\} \leq
P$, where $W$ is white Gaussian noise with power $\sigma_w ^2$, $P$ is the
average transmit power and $S$ is the Gaussian interference with power
$\sigma_s ^2$ ... |
1001.3113 | An Immuno-Inspired Approach to Misbehavior Detection in Ad Hoc Wireless
Networks | cs.NI cs.AI cs.NE | We propose and evaluate an immuno-inspired approach to misbehavior detection
in ad hoc wireless networks. Node misbehavior can be the result of an
intrusion, or a software or hardware failure. Our approach is motivated by
co-stimulatory signals present in the Biological immune system. The results
show that co-stimula... |
1001.3118 | Energy Optimization across Training and Data for Multiuser Minimum
Sum-MSE Linear Precoding | cs.IT math.IT | This paper considers minimum sum mean-squared error (sum-MSE) linear
transceiver designs in multiuser downlink systems with imperfect channel state
information. Specifically, we derive the optimal energy allocations for
training and data phases for such a system. Under MMSE estimation of
uncorrelated Rayleigh block f... |
1001.3122 | Erasure entropies and Gibbs measures | math-ph cs.IT math.IT math.MP math.PR | Recently Verdu and Weissman introduced erasure entropies, which are meant to
measure the information carried by one or more symbols given all of the
remaining symbols in the realization of the random process or field. A natural
relation to Gibbs measures has also been observed. In his short note we study
this relatio... |
1001.3159 | Memory Allocation in Distributed Storage Networks | cs.IT math.IT | We consider the problem of distributing a file in a network of storage nodes
whose storage budget is limited but at least equals to the size file. We first
generate $T$ encoded symbols (from the file) which are then distributed among
the nodes. We investigate the optimal allocation of $T$ encoded packets to the
stora... |
1001.3171 | Optimal Reverse Carpooling Over Wireless Networks - A Distributed
Optimization Approach | cs.NI cs.MA | We focus on a particular form of network coding, reverse carpooling, in a
wireless network where the potentially coded transmitted messages are to be
decoded immediately upon reception. The network is fixed and known, and the
system performance is measured in terms of the number of wireless broadcasts
required to mee... |
1001.3173 | Distributed Detection over Fading MACs with Multiple Antennas at the
Fusion Center | cs.IT math.IT | A distributed detection problem over fading Gaussian multiple-access channels
is considered. Sensors observe a phenomenon and transmit their observations to
a fusion center using the amplify and forward scheme. The fusion center has
multiple antennas with different channel models considered between the sensors
and th... |
1001.3178 | A performance analysis of multi-hop ad hoc networks with adaptive
antenna array systems | cs.IT math.IT | Based on a stochastic geometry framework, we establish an analysis of the
multi-hop spatial reuse aloha protocol (MSR-Aloha) in ad hoc networks. We
compare MSR-Aloha to a simple routing strategy, where a node selects the next
relay of the treated packet as to be its nearest receiver with a forward
progress toward the... |
1001.3181 | Weak ties: Subtle role of information diffusion in online social
networks | cs.SI cond-mat.stat-mech physics.soc-ph | As a social media, online social networks play a vital role in the social
information diffusion. However, due to its unique complexity, the mechanism of
the diffusion in online social networks is different from the ones in other
types of networks and remains unclear to us. Meanwhile, few works have been
done to revea... |
1001.3187 | Dynamic Resource Allocation in Cognitive Radio Networks: A Convex
Optimization Perspective | cs.IT math.IT | This article provides an overview of the state-of-art results on
communication resource allocation over space, time, and frequency for emerging
cognitive radio (CR) wireless networks. Focusing on the
interference-power/interference-temperature (IT) constraint approach for CRs to
protect primary radio transmissions, m... |
1001.3193 | Sidelobe Control in Collaborative Beamforming via Node Selection | cs.IT math.IT | Collaborative beamforming (CB) is a power efficient method for data
communications in wireless sensor networks (WSNs) which aims at increasing the
transmission range in the network by radiating the power from a cluster of
sensor nodes in the directions of the intended base station(s) or access
point(s) (BSs/APs). The... |
1001.3199 | Local Popularity Based Collaborative Filters | cs.IT math.IT | Motivated by applications such as recommendation systems, we consider the
estimation of a binary random field X obtained by row and column permutations
of a block constant random matrix. The estimation of X is based on observations
Y, which are obtained by passing entries of X through a binary symmetric
channel (BSC)... |
1001.3206 | A New Class of TAST Codes With A Simplified Tree Structure | cs.IT cs.CR math.IT math.NT | We consider in this paper the design of full diversity and high rate
space-time codes with moderate decoding complexity for arbitrary number of
transmit and receive antennas and arbitrary input alphabets. We focus our
attention to codes from the threaded algebraic space-time (TAST) framework
since the latter includes... |
1001.3213 | Using Premia and Nsp for Constructing a Risk Management Benchmark for
Testing Parallel Architecture | cs.CE cs.DC cs.MS cs.NA q-fin.CP q-fin.PR | Financial institutions have massive computations to carry out overnight which
are very demanding in terms of the consumed CPU. The challenge is to price many
different products on a cluster-like architecture. We have used the Premia
software to valuate the financial derivatives. In this work, we explain how
Premia ca... |
1001.3246 | Salience-Affected Neural Networks | cs.NE q-bio.NC | We present a simple neural network model which combines a locally-connected
feedforward structure, as is traditionally used to model inter-neuron
connectivity, with a layer of undifferentiated connections which model the
diffuse projections from the human limbic system to the cortex. This new layer
makes it possible ... |
1001.3265 | Bounds for Algebraic Gossip on Graphs | cs.IT cs.NI math.IT math.PR | We study the stopping times of gossip algorithms for network coding. We
analyze algebraic gossip (i.e., random linear coding) and consider three gossip
algorithms for information spreading Pull, Push, and Exchange. The stopping
time of algebraic gossip is known to be linear for the complete graph, but the
question of... |
1001.3277 | On Utilization and Importance of Perl Status Reporter (SRr) in Text
Mining | cs.IR | In Bioinformatics, text mining and text data mining sometimes interchangeably
used is a process to derive high-quality information from text. Perl Status
Reporter (SRr) is a data fetching tool from a flat text file and in this
research paper we illustrate the use of SRr in text or data mining. SRr needs a
flat text i... |
1001.3297 | Gaussian MIMO Broadcast Channels with Common and Confidential Messages | cs.IT math.IT | We study the two-user Gaussian multiple-input multiple-output (MIMO)
broadcast channel with common and confidential messages. In this channel, the
transmitter sends a common message to both users, and a confidential message to
each user which is kept perfectly secret from the other user. We obtain the
entire capacity... |
1001.3365 | Asymptotic Scheduling Gains in Point-to-Multipoint Cognitive Networks | cs.IT math.IT | We consider collocated primary and secondary networks that have simultaneous
access to the same frequency bands. Particularly, we examine three different
levels at which primary and secondary networks may coexist: pure interference,
asymmetric co-existence, and symmetric co-existence. At the asymmetric
co-existence l... |
1001.3387 | Universal Secure Error-Correcting Schemes for Network Coding | cs.IT cs.CR math.IT | This paper considers the problem of securing a linear network coding system
against an adversary that is both an eavesdropper and a jammer. The network is
assumed to transport n packets from source to each receiver, and the adversary
is allowed to eavesdrop on \mu arbitrarily chosen links and also to inject up
to t e... |
1001.3403 | Real Interference Alignment | cs.IT math.IT math.NT | In this paper, we show that the total Degrees-Of-Freedoms (DOF) of the
$K$-user Gaussian Interference Channel (GIC) can be achieved by incorporating a
new alignment technique known as \emph{real interference alignment}. This
technique compared to its ancestor \emph{vector interference alignment}
performs on a single ... |
1001.3404 | Lecture Notes on Network Information Theory | cs.IT cs.NI math.IT math.ST stat.TH | These lecture notes have been converted to a book titled Network Information
Theory published recently by Cambridge University Press. This book provides a
significantly expanded exposition of the material in the lecture notes as well
as problems and bibliographic notes at the end of each chapter. The authors are
curr... |
1001.3421 | Multilevel Decoders Surpassing Belief Propagation on the Binary
Symmetric Channel | cs.IT math.IT | In this paper, we propose a new class of quantized message-passing decoders
for LDPC codes over the BSC. The messages take values (or levels) from a finite
set. The update rules do not mimic belief propagation but instead are derived
using the knowledge of trapping sets. We show that the update rules can be
derived t... |
1001.3448 | The dynamics of message passing on dense graphs, with applications to
compressed sensing | cs.IT cs.LG math.IT math.ST stat.TH | Approximate message passing algorithms proved to be extremely effective in
reconstructing sparse signals from a small number of incoherent linear
measurements. Extensive numerical experiments further showed that their
dynamics is accurately tracked by a simple one-dimensional iteration termed
state evolution. In this... |
1001.3460 | Execution and Result Integration Scheme in FPU Farms for Co-ordinated
Performance | cs.IT math.IT | - The main goal of this research is to develop the concept of an innovative
processor system called Functional Processor System. The particular work
carried out in this paper focuses on the execution of functions in the
heterogeneous functional processor units(FPU) and integration of functions to
bring net results. A... |
1001.3475 | Relay Assisted Cooperative OSTBC Communication with SNR Imbalance and
Channel Estimation Errors | cs.IT math.IT | In this paper, a two-hop relay assisted cooperative Orthogonal Space-Time
Block Codes (OSTBC) transmission scheme is considered for the downlink
communication of a cellular system, where the base station (BS) and the relay
station (RS) cooperate and transmit data to the user equipment (UE) in a
distributed fashion. W... |
1001.3476 | Dirty Paper Coding using Sign-bit Shaping and LDPC Codes | cs.IT math.IT | Dirty paper coding (DPC) refers to methods for pre-subtraction of known
interference at the transmitter of a multiuser communication system. There are
numerous applications for DPC, including coding for broadcast channels.
Recently, lattice-based coding techniques have provided several designs for
DPC. In lattice-bas... |
1001.3478 | Role of Interestingness Measures in CAR Rule Ordering for Associative
Classifier: An Empirical Approach | cs.LG | Associative Classifier is a novel technique which is the integration of
Association Rule Mining and Classification. The difficult task in building
Associative Classifier model is the selection of relevant rules from a large
number of class association rules (CARs). A very popular method of ordering
rules for selectio... |
1001.3480 | On the inference of large phylogenies with long branches: How long is
too long? | math.PR cs.CE cs.DS math.ST q-bio.PE stat.TH | Recent work has highlighted deep connections between sequence-length
requirements for high-probability phylogeny reconstruction and the related
problem of the estimation of ancestral sequences. In [Daskalakis et al.'09],
building on the work of [Mossel'04], a tight sequence-length requirement was
obtained for the CFN... |
1001.3486 | A Symbolic Dynamical System Approach to Lossy Source Coding with
Feedforward | cs.IT math.IT | It is known that modeling an information source via a symbolic dynamical
system evolving over the unit interval, leads to a natural lossless compression
scheme attaining the entropy rate of the source, under general conditions. We
extend this notion to the lossy compression regime assuming a feedforward link
is avail... |
1001.3487 | Features Based Text Similarity Detection | cs.CV | As the Internet help us cross cultural border by providing different
information, plagiarism issue is bound to arise. As a result, plagiarism
detection becomes more demanding in overcoming this issue. Different plagiarism
detection tools have been developed based on various detection techniques.
Nowadays, fingerprint... |
1001.3488 | A Model for Mining Multilevel Fuzzy Association Rule in Database | cs.DB | The problem of developing models and algorithms for multilevel association
mining pose for new challenges for mathematics and computer science. These
problems become more challenging, when some form of uncertainty like fuzziness
is present in data or relationships in data. This paper proposes a multilevel
fuzzy assoc... |
1001.3491 | Particle Swarm Optimization Based Reactive Power Optimization | cs.NE | Reactive power plays an important role in supporting the real power transfer
by maintaining voltage stability and system reliability. It is a critical
element for a transmission operator to ensure the reliability of an electric
system while minimizing the cost associated with it. The traditional objectives
of reactiv... |
1001.3494 | Proposing a New Method for Query Processing Adaption in DataBase | cs.DB | This paper proposes a multi agent system by compiling two technologies, query
processing optimization and agents which contains features of personalized
queries and adaption with changing of requirements. This system uses a new
algorithm based on modeling of users' long-term requirements and also GA to
gather users' ... |
1001.3495 | Expert System Models in the Companies' Financial and Accounting Domain | cs.CE | The present paper is based on studying, analyzing and implementing the expert
systems in the financial and accounting domain of the companies, describing the
use method of the informational systems that can be used in the multi-national
companies, public interest institutions, and medium and small dimension
economica... |
1001.3498 | Interestingness Measure for Mining Spatial Gene Expression Data using
Association Rule | cs.DB q-bio.GN q-bio.QM | The search for interesting association rules is an important topic in
knowledge discovery in spatial gene expression databases. The set of admissible
rules for the selected support and confidence thresholds can easily be
extracted by algorithms based on support and confidence, such as Apriori.
However, they may produ... |
1001.3500 | Mathematical Modeling to Study the Dynamics of A Diatomic Molecule N2 in
Water | cs.CE physics.comp-ph | In the present work an attempt has been made to study the dynamics of a
diatomic molecule N2 in water. The proposed model consists of Langevin
stochastic differential equation whose solution is obtained through Euler's
method. The proposed work has been concluded by studying the behavior of
statistical parameters lik... |
1001.3502 | 3D Skull Recognition Using 3D Matching Technique | cs.CV | Biometrics has become a "hot" area. Governments are funding research programs
focused on biometrics. In this paper the problem of person recognition and
verification based on a different biometric application has been addressed. The
system is based on the 3DSkull recognition using 3D matching technique, in fact
this ... |
1001.3503 | Hybrid Medical Image Classification Using Association Rule Mining with
Decision Tree Algorithm | cs.CV | The main focus of image mining in the proposed method is concerned with the
classification of brain tumor in the CT scan brain images. The major steps
involved in the system are: pre-processing, feature extraction, association
rule mining and hybrid classifier. The pre-processing step has been done using
the median f... |
1001.3550 | Deconvolution of linear systems with quantized input: an information
theoretic viewpoint | cs.IT math.DS math.IT | In spite of the huge literature on deconvolution problems, very little is
done for hybrid contexts where signals are quantized. In this paper we
undertake an information theoretic approach to the deconvolution problem of a
simple integrator with quantized binary input and sampled noisy output. We
recast it into a dec... |
1001.3697 | Secure Communication in Stochastic Wireless Networks | cs.IT cs.CR math.IT math.PR | Information-theoretic security -- widely accepted as the strictest notion of
security -- relies on channel coding techniques that exploit the inherent
randomness of the propagation channels to significantly strengthen the security
of digital communications systems. Motivated by recent developments in the
field, this ... |
1001.3705 | Secret Key Agreement from Correlated Gaussian Sources by Rate Limited
Public Communication | cs.IT math.IT | We investigate the secret key agreement from correlated Gaussian sources in
which the legitimate parties can use the public communication with limited
rate. For the class of protocols with the one-way public communication, we show
a closed form expression of the optimal trade-off between the rate of key
generation an... |
1001.3708 | Capacity Bounds and Lattice Coding for the Star Relay Network | cs.IT math.IT | A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3
receivers, and a central relay is considered. The transmitters wish to send
information to their corresponding receivers via a two phase communication
protocol. The receivers decode their desired messages by using side information
and the signa... |
1001.3717 | Multistage Relaying Using Interference Networks | cs.IT math.IT | Wireless networks with multiple nodes that relay information from a source to
a destination are expected to be deployed in many applications. Therefore,
understanding their design and performance under practical constraints is
important. In this work, we propose and study three multihopping decode and
forward (MDF) p... |
1001.3720 | Page-Differential Logging: An Efficient and DBMS-independent Approach
for Storing Data into Flash Memory | cs.DB | Flash memory is widely used as the secondary storage in lightweight computing
devices due to its outstanding advantages over magnetic disks. Flash memory has
many access characteristics different from those of magnetic disks, and how to
take advantage of them is becoming an important research issue. There are two
exi... |
1001.3735 | Gradient Based Seeded Region Grow method for CT Angiographic Image
Segmentation | cs.CV | Segmentation of medical images using seeded region growing technique is
increasingly becoming a popular method because of its ability to involve
high-level knowledge of anatomical structures in seed selection process. Region
based segmentation of medical images are widely used in varied clinical
applications like vis... |
1001.3741 | Application of Artificial Neural Networks in Aircraft Maintenance,
Repair and Overhaul Solutions | cs.NE | This paper reviews application of Artificial Neural Networks in Aircraft
Maintenance, Repair and Overhaul (MRO). MRO solutions are designed to
facilitate the authoring and delivery of maintenance and repair information to
the line maintenance technicians who need to improve aircraft repair turn
around time, optimize ... |
1001.3745 | The effect of discrete vs. continuous-valued ratings on reputation and
ranking systems | cs.IR cs.AI cs.DB physics.soc-ph | When users rate objects, a sophisticated algorithm that takes into account
ability or reputation may produce a fairer or more accurate aggregation of
ratings than the straightforward arithmetic average. Recently a number of
authors have proposed different co-determination algorithms where estimates of
user and object... |
1001.3760 | Range-Free Localization with the Radical Line | cs.IT math.IT | Due to hardware and computational constraints, wireless sensor networks
(WSNs) normally do not take measurements of time-of-arrival or
time-difference-of-arrival for rangebased localization. Instead, WSNs in some
applications use rangefree localization for simple but less accurate
determination of sensor positions. A... |
1001.3765 | Doped Fountain Coding for Minimum Delay Data Collection in Circular
Networks | cs.IT math.IT | This paper studies decentralized, Fountain and network-coding based
strategies for facilitating data collection in circular wireless sensor
networks, which rely on the stochastic diversity of data storage. The goal is
to allow for a reduced delay collection by a data collector who accesses the
network at a random pos... |
1001.3780 | Combinatorial Bounds and Characterizations of Splitting Authentication
Codes | cs.CR cs.IT math.IT | We present several generalizations of results for splitting authentication
codes by studying the aspect of multi-fold security. As the two primary
results, we prove a combinatorial lower bound on the number of encoding rules
and a combinatorial characterization of optimal splitting authentication codes
that are multi... |
1001.3790 | Vector Precoding for Gaussian MIMO Broadcast Channels: Impact of Replica
Symmetry Breaking | cs.IT math.IT | The so-called "replica method" of statistical physics is employed for the
large system analysis of vector precoding for the Gaussian multiple-input
multiple-output (MIMO) broadcast channel. The transmitter is assumed to
comprise a linear front-end combined with nonlinear precoding, that minimizes
the front-end impose... |
1001.3885 | Improved Source Coding Exponents via Witsenhausen's Rate | cs.IT math.IT | We provide a novel upper-bound on Witsenhausen's rate, the rate required in
the zero-error analogue of the Slepian-Wolf problem; our bound is given in
terms of a new information-theoretic functional defined on a certain graph. We
then use the functional to give a single letter lower-bound on the error
exponent for th... |
1001.3908 | Secret Key Establishment over a Pair of Independent Broadcast Channels | cs.IT cs.CR math.IT | This paper considers the problem of information-theoretic Secret Key
Establishment (SKE) in the presence of a passive adversary, Eve, when Alice and
Bob are connected by a pair of independent discrete memoryless broadcast
channels in opposite directions. We refer to this setup as 2DMBC. We define the
secret-key capac... |
1001.3911 | Computing Lower Bounds on the Information Rate of Intersymbol
Interference Channels | cs.IT math.IT | Provable lower bounds are presented for the information rate I(X; X+S+N)
where X is the symbol drawn from a fixed, finite-size alphabet, S a
discrete-valued random variable (RV) and N a Gaussian RV. The information rate
I(X; X+S+N) serves as a tight lower bound for capacity of intersymbol
interference (ISI) channels ... |
1001.3916 | Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths | cs.IT math.IT | A method to construct girth-12 (3,L) quasi-cyclic low-density parity-check
(QC-LDPC) codes with all lengths larger than a certain given number is
proposed, via a given girth-12 code subjected to some constraints. The lengths
of these codes can be arbitrary integers of the form LP, provided that P is
larger than a tig... |
1001.3920 | Comparison of Genetic Algorithm and Simulated Annealing Technique for
Optimal Path Selection In Network Routing | cs.NE cs.NI | This paper addresses the path selection problem from a known sender to the
receiver. The proposed work shows path selection using genetic algorithm(GA)and
simulated annealing (SA) approaches. In genetic algorithm approach, the multi
point crossover and mutation helps in determining the optimal path and also
alternate... |
1001.3934 | Eigen-Inference for Energy Estimation of Multiple Sources | cs.IT math.IT | In this paper, a new method is introduced to blindly estimate the transmit
power of multiple signal sources in multi-antenna fading channels, when the
number of sensing devices and the number of available samples are sufficiently
large compared to the number of sources. Recent advances in the field of large
dimension... |
1001.3974 | Modelacion y Visualizacion Tridimensional Interactiva de Variables
Electricas en Celdas de Electro-Obtencion con Electrodos Bipolares | cs.GR cs.CE | The use of floating bipolar electrodes in electrowinning cells of copper
constitutes a nonconventional technology that promises economic and operational
impacts. This paper presents a computational tool for the simulation and
analysis of such electrochemical cells. A new model is developed for floating
electrodes and... |
1001.4002 | Aplicacion Grafica para el estudio de un Modelo de Celda Electrolitica
usando Tecnicas de Visualizacion de Campos Vectoriales | cs.GR cs.CE | The use of floating bipolar electrodes in electrowinning cells of copper
constitutes a nonconventional technology that promises economic and operational
impacts. This thesis presents a computational tool for the simulation and
analysis of such electrochemical cells. A new model is developed for floating
electrodes an... |
1001.4072 | Hamming Code for Multiple Sources | cs.IT math.IT | We consider Slepian-Wolf (SW) coding of multiple sources and extend the
packing bound and the notion of perfect code from conventional channel coding
to SW coding with more than two sources. We then introduce Hamming Codes for
Multiple Sources (HCMSs) as a potential solution of perfect SW coding for
arbitrary number ... |
1001.4099 | Ant Colony Algorithm for the Weighted Item Layout Optimization Problem | cs.NE cs.CG | This paper discusses the problem of placing weighted items in a circular
container in two-dimensional space. This problem is of great practical
significance in various mechanical engineering domains, such as the design of
communication satellites. Two constructive heuristics are proposed, one for
packing circular ite... |
1001.4110 | A Simple Message-Passing Algorithm for Compressed Sensing | cs.IT math.IT | We consider the recovery of a nonnegative vector x from measurements y = Ax,
where A is an m-by-n matrix whos entries are in {0, 1}. We establish that when
A corresponds to the adjacency matrix of a bipartite graph with sufficient
expansion, a simple message-passing algorithm produces an estimate \hat{x} of x
satisfy... |
1001.4120 | Sum-Capacity and the Unique Separability of the Parallel Gaussian
MAC-Z-BC Network | cs.IT math.IT | It is known that the capacity of parallel (e.g., multi-carrier) Gaussian
point-to-point, multiple access and broadcast channels can be achieved by
separate encoding for each subchannel (carrier) subject to a power allocation
across carriers. Recent results have shown that parallel interference channels
are not separa... |
1001.4122 | Distributed Control of the Laplacian Spectral Moments of a Network | cs.MA cs.CE | It is well-known that the eigenvalue spectrum of the Laplacian matrix of a
network contains valuable information about the network structure and the
behavior of many dynamical processes run on it. In this paper, we propose a
fully decentralized algorithm that iteratively modifies the structure of a
network of agents ... |
1001.4136 | Authentication and Authorization in Server Systems for Bio-Informatics | cs.CR cs.IR | Authentication and authorization are two tightly coupled and interrelated
concepts which are used to keep transactions secure and help in protecting
confidential information. This paper proposes to evaluate the current
techniques used for authentication and authorization also compares them with
the best practices and... |
1001.4137 | On the solvability of 3-source 3-terminal sum-networks | cs.IT math.IT | We consider a directed acyclic network with three sources and three terminals
such that each source independently generates one symbol from a given field $F$
and each terminal wants to receive the sum (over $F$) of the source symbols.
Each link in the network is considered to be error-free and delay-free and can
carr... |
1001.4140 | SVM-based Multiview Face Recognition by Generalization of Discriminant
Analysis | cs.CV cs.LG | Identity verification of authentic persons by their multiview faces is a real
valued problem in machine vision. Multiview faces are having difficulties due
to non-linear representation in the feature space. This paper illustrates the
usability of the generalization of LDA in the form of canonical covariate for
face r... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.