id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1006.1407 | Begin, After, and Later: a Maximal Decidable Interval Temporal Logic | cs.LO cs.AI | Interval temporal logics (ITLs) are logics for reasoning about temporal
statements expressed over intervals, i.e., periods of time. The most famous ITL
studied so far is Halpern and Shoham's HS, which is the logic of the thirteen
Allen's interval relations. Unfortunately, HS and most of its fragments have an
undecida... |
1006.1414 | Model-Checking an Alternating-time Temporal Logic with Knowledge,
Imperfect Information, Perfect Recall and Communicating Coalitions | cs.LO cs.MA | We present a variant of ATL with distributed knowledge operators based on a
synchronous and perfect recall semantics. The coalition modalities in this
logic are based on partial observation of the full history, and incorporate a
form of cooperation between members of the coalition in which agents issue
their actions ... |
1006.1420 | Landauer's principle in the quantum domain | quant-ph cs.IT math.IT | Recent papers discussing thermodynamic processes in strongly coupled quantum
systems claim a violation of Landauer's principle and imply a violation of the
second law of thermodynamics. If true, this would have powerful consequences.
Perpetuum mobiles could be build as long as the operating temperature is
brought clo... |
1006.1422 | Engineering Long Range Distance Independent Entanglement through Kondo
Impurities in Spin Chains | quant-ph cs.IT math.IT | We investigate the entanglement properties of the Kondo spin chain when it is
prepared in its ground state as well as its dynamics following a single bond
quench. We show that a true measure of entanglement such as negativity enables
to characterize the unique features of the gapless Kondo regime. We determine
the sp... |
1006.1426 | Classification of delocalization power of global unitary operations in
terms of LOCC one-piece relocalization | quant-ph cs.IT math.IT | We study how two pieces of localized quantum information can be delocalized
across a composite Hilbert space when a global unitary operation is applied. We
classify the delocalization power of global unitary operations on quantum
information by investigating the possibility of relocalizing one piece of the
quantum in... |
1006.1429 | Causality and the Semantics of Provenance | cs.LO cs.DB | Provenance, or information about the sources, derivation, custody or history
of data, has been studied recently in a number of contexts, including
databases, scientific workflows and the Semantic Web. Many provenance
mechanisms have been developed, motivated by informal notions such as
influence, dependence, explanat... |
1006.1434 | Computing by Means of Physics-Based Optical Neural Networks | cs.NE cs.AI | We report recent research on computing with biology-based neural network
models by means of physics-based opto-electronic hardware. New technology
provides opportunities for very-high-speed computation and uncovers problems
obstructing the wide-spread use of this new capability. The Computation
Modeling community may... |
1006.1435 | Distortion Outage Probability in MIMO Block-Fading Channels | cs.IT math.IT | We study analogue source transmission over MIMO block-fading channels with
receiver-only channel state information. Unlike previous work which considers
the end-to-end expected distortion as a figure of merit, we study the
distortion outage probability. We first consider the well known transmitter
informed bound, whi... |
1006.1450 | Separating Agent-Functioning and Inter-Agent Coordination by Activated
Modules: The DECOMAS Architecture | cs.MA | The embedding of self-organizing inter-agent processes in distributed
software applications enables the decentralized coordination system elements,
solely based on concerted, localized interactions. The separation and
encapsulation of the activities that are conceptually related to the
coordination, is a crucial conc... |
1006.1512 | The Deterministic Dendritic Cell Algorithm | cs.AI cs.NE | The Dendritic Cell Algorithm is an immune-inspired algorithm orig- inally
based on the function of natural dendritic cells. The original instantiation of
the algorithm is a highly stochastic algorithm. While the performance of the
algorithm is good when applied to large real-time datasets, it is difficult to
anal- ys... |
1006.1518 | The DCA:SOMe Comparison A comparative study between two
biologically-inspired algorithms | cs.AI cs.CR cs.NE | The Dendritic Cell Algorithm (DCA) is an immune-inspired algorithm, developed
for the purpose of anomaly detection. The algorithm performs multi-sensor data
fusion and correlation which results in a 'context aware' detection system.
Previous applications of the DCA have included the detection of potentially
malicious... |
1006.1526 | The Motif Tracking Algorithm | cs.AI cs.CE cs.NE | The search for patterns or motifs in data represents a problem area of key
interest to finance and economic researchers. In this paper we introduce the
Motif Tracking Algorithm, a novel immune inspired pattern identification tool
that is able to identify unknown motifs of a non specified length which repeat
within ti... |
1006.1535 | Tree-structure Expectation Propagation for Decoding LDPC codes over
Binary Erasure Channels | cs.IT math.IT | Expectation Propagation is a generalization to Belief Propagation (BP) in two
ways. First, it can be used with any exponential family distribution over the
cliques in the graph. Second, it can impose additional constraints on the
marginal distributions. We use this second property to impose pair-wise
marginal distrib... |
1006.1537 | New worst upper bound for #SAT | cs.AI cs.CC | The rigorous theoretical analyses of algorithms for #SAT have been proposed
in the literature. As we know, previous algorithms for solving #SAT have been
analyzed only regarding the number of variables as the parameter. However, the
time complexity for solving #SAT instances depends not only on the number of
variable... |
1006.1543 | Efficient Discovery of Large Synchronous Events in Neural Spike Streams | cs.NE | We address the problem of finding patterns from multi-neuronal spike trains
that give us insights into the multi-neuronal codes used in the brain and help
us design better brain computer interfaces. We focus on the synchronous firings
of groups of neurons as these have been shown to play a major role in coding
and co... |
1006.1548 | On Communication over Unknown Sparse Frequency-Selective Block-Fading
Channels | cs.IT math.IT | This paper considers the problem of reliable communication over discrete-time
channels whose impulse responses have length $L$ and exactly $S\leq L$ non-zero
coefficients, and whose support and coefficients remain fixed over blocks of
$N>L$ channel uses but change independently from block to block. Here, it is
assume... |
1006.1563 | ToLeRating UR-STD | cs.AI cs.CR cs.NE | A new emerging paradigm of Uncertain Risk of Suspicion, Threat and Danger,
observed across the field of information security, is described. Based on this
paradigm a novel approach to anomaly detection is presented. Our approach is
based on a simple yet powerful analogy from the innate part of the human immune
system,... |
1006.1565 | Information Theory and Statistical Physics - Lecture Notes | cs.IT cond-mat.dis-nn cond-mat.stat-mech math.IT | This document consists of lecture notes for a graduate course, which focuses
on the relations between Information Theory and Statistical Physics. The course
is aimed at EE graduate students in the area of Communications and Information
Theory, as well as to graduate students in Physics who have basic background in
In... |
1006.1568 | Towards a Conceptual Framework for Innate Immunity | cs.AI cs.NE | Innate immunity now occupies a central role in immunology. However,
artificial immune system models have largely been inspired by adaptive not
innate immunity. This paper reviews the biological principles and properties of
innate immunity and, adopting a conceptual framework, asks how these can be
incorporated into a... |
1006.1592 | Information-theoretic Capacity of Clustered Random Networks | cs.IT math.IT | We analyze the capacity scaling laws of clustered ad hoc networks in which
nodes are distributed according to a doubly stochastic shot-noise Cox process.
We identify five different operational regimes, and for each regime we devise a
communication strategy that allows to achieve a throughput to within a
poly-logarith... |
1006.1658 | A Link between Guruswami--Sudan's List--Decoding and Decoding of
Interleaved Reed--Solomon Codes | cs.IT math.IT | The Welch--Berlekamp approach for Reed--Solomon (RS) codes forms a bridge
between classical syndrome--based decoding algorithms and interpolation--based
list--decoding procedures for list size l=1. It returns the univariate
error--locator polynomial and the evaluation polynomial of the RS code as a
y-root. In this pa... |
1006.1661 | Variants of the LLL Algorithm in Digital Communications: Complexity
Analysis and Fixed-Complexity Implementation | cs.IT math.IT | The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the most practical lattice
reduction algorithm in digital communications. In this paper, several variants
of the LLL algorithm with either lower theoretic complexity or fixed-complexity
implementation are proposed and/or analyzed. Firstly, the $O(n^4\log n)$
theoretic a... |
1006.1663 | Tata Kelola Database Perguruan Tinggi Yang Optimal Dengan Data Warehouse | cs.DB | The emergence of new higher education institutions has created the
competition in higher education market, and data warehouse can be used as an
effective technology tools for increasing competitiveness in the higher
education market. Data warehouse produce reliable reports for the institution's
high-level management ... |
1006.1666 | On the Proximity Factors of Lattice Reduction-Aided Decoding | cs.IT math.IT | Lattice reduction-aided decoding features reduced decoding complexity and
near-optimum performance in multi-input multi-output communications. In this
paper, a quantitative analysis of lattice reduction-aided decoding is
presented. To this aim, the proximity factors are defined to measure the
worst-case losses in dis... |
1006.1667 | Interference Channel with Generalized Feedback (a.k.a. with source
cooperation). Part I: Achievable Region | cs.IT math.IT | An Interference Channel with Generalized Feedback (IFC-GF) is a model for a
wireless network where several source-destination pairs compete for the same
channel resources, and where the sources have the ability to sense the current
channel activity. The signal overheard from the channel provides information
about the... |
1006.1669 | On the Universality of Sequential Slotted Amplify and Forward Strategy
in Cooperative Communications | cs.IT math.IT | While cooperative communication has many benefits and is expected to play an
important role in future wireless networks, many challenges are still unsolved.
Previous research has developed different relaying strategies for cooperative
multiple access channels (CMA), cooperative multiple relay channels (CMR) and
coope... |
1006.1678 | The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis | cs.IT math.AP math.IT physics.data-an | The MUSIC algorithm, with its extension for imaging sparse {\em extended}
objects, is analyzed by compressed sensing (CS) techniques. The notion of
restricted isometry property (RIP) and an upper bound on the restricted
isometry constant (RIC) are employed to establish sufficient conditions for the
exact localization... |
1006.1681 | Towards the Design of Heuristics by Means of Self-Assembly | cs.AI cs.NE | The current investigations on hyper-heuristics design have sprung up in two
different flavours: heuristics that choose heuristics and heuristics that
generate heuristics. In the latter, the goal is to develop a problem-domain
independent strategy to automatically generate a good performing heuristic for
the problem a... |
1006.1690 | Full-Duplex Relay based on Zero-Forcing Beamforming | cs.IT math.IT | In this paper, we propose a full-duplex relay (FDR) based on a zero-forcing
beamforming (ZFBF) for a multiuser MIMO relay system. The ZFBF is employed at
the base station to suppress both the self-interference of the relay and the
multiuser interference at the same time. Numerical results show that the
proposed FDR c... |
1006.1692 | Measuring interesting rules in Characteristic rule | cs.DB cs.AI | Finding interesting rule in the sixth strategy step about threshold control
on generalized relations in attribute oriented induction, there is possibility
to select candidate attribute for further generalization and merging of
identical tuples until the number of tuples is no greater than the threshold
value, as impl... |
1006.1694 | Pure Asymmetric Quantum MDS Codes from CSS Construction: A Complete
Characterization | cs.IT math.IT | Using the Calderbank-Shor-Steane (CSS) construction, pure $q$-ary asymmetric
quantum error-correcting codes attaining the quantum Singleton bound are
constructed. Such codes are called pure CSS asymmetric quantum maximum distance
separable (AQMDS) codes. Assuming the validity of the classical MDS Conjecture,
pure CSS... |
1006.1695 | Attribute Oriented Induction with simple select SQL statement | cs.DB | Searching learning or rules in relational database for data mining purposes
with characteristic or classification/discriminant rule in attribute oriented
induction technique can be quicker, easy, and simple with simple SQL statement.
With just only one simple SQL statement, characteristic and classification rule
can ... |
1006.1699 | Multidimensional Datawarehouse with Combination Formula | cs.DB | Multidimensional in data warehouse is a compulsion and become the most
important for information delivery, without multidimensional Multidimensional
in data warehouse is a compulsion and become the most important for information
delivery, without multidimensional datawarehouse is incomplete.
Multidimensional give abi... |
1006.1701 | Virtual information system on working area | cs.AI | In order to get strategic positioning for competition in business
organization, the information system must be ahead in this information age
where the information as one of the weapons to win the competition and in the
right hand the information will become a right bullet. The information system
with the information ... |
1006.1703 | Indonesian Earthquake Decision Support System | cs.AI | Earthquake DSS is an information technology environment which can be used by
government to sharpen, make faster and better the earthquake mitigation
decision. Earthquake DSS can be delivered as E-government which is not only for
government itself but in order to guarantee each citizen's rights for
education, training... |
1006.1727 | Distributed Consensus with Finite Message Passing | cs.IT math.IT | Inspired by distributed resource allocation problems in dynamic topology
networks, we initiate the study of distributed consensus with finite messaging
passing. We first find a sufficient condition on the network graph for which no
distributed protocol can guarantee a conflict-free allocation after $R$ rounds
of mess... |
1006.1735 | Algebraic Attack on the Alternating Step(r,s)Generator | cs.CR cs.IT math.IT | The Alternating Step(r,s) Generator, ASG(r,s), is a clock-controlled sequence
generator which is recently proposed by A. Kanso. It consists of three
registers of length l, m and n bits. The first register controls the clocking
of the two others. The two other registers are clocked r times (or not clocked)
(resp. s ti... |
1006.1743 | A Basis for all Solutions of the Key Equation for Gabidulin Codes | cs.IT math.IT | We present and prove the correctness of an efficient algorithm that provides
a basis for all solutions of a key equation in order to decode Gabidulin (G-)
codes up to a given radius tau. This algorithm is based on a symbolic
equivalent of the Euclidean Algorithm (EA) and can be applied for decoding of
G-codes beyond ... |
1006.1746 | Calibration and Internal no-Regret with Partial Monitoring | cs.GT cs.LG stat.ML | Calibrated strategies can be obtained by performing strategies that have no
internal regret in some auxiliary game. Such strategies can be constructed
explicitly with the use of Blackwell's approachability theorem, in an other
auxiliary game. We establish the converse: a strategy that approaches a convex
$B$-set can ... |
1006.1749 | Converse Lyapunov Theorems for Switched Systems in Banach and Hilbert
Spaces | math.OC cs.SY | We consider switched systems on Banach and Hilbert spaces governed by
strongly continuous one-parameter semigroups of linear evolution operators. We
provide necessary and sufficient conditions for their global exponential
stability, uniform with respect to the switching signal, in terms of the
existence of a Lyapunov... |
1006.1772 | Analysis of a Collaborative Filter Based on Popularity Amongst Neighbors | cs.IT math.IT | In this paper, we analyze a collaborative filter that answers the simple
question: What is popular amongst your friends? While this basic principle
seems to be prevalent in many practical implementations, there does not appear
to be much theoretical analysis of its performance. In this paper, we partly
fill this gap.... |
1006.1786 | Measuring Meaning on the World-Wide Web | cs.AI cs.CL | We introduce the notion of the 'meaning bound' of a word with respect to
another word by making use of the World-Wide Web as a conceptual environment
for meaning. The meaning of a word with respect to another word is established
by multiplying the product of the number of webpages containing both words by
the total n... |
1006.1828 | Landau Theory of Adaptive Integration in Computational Intelligence | stat.ML cs.AI nlin.AO q-bio.NC q-bio.PE | Computational Intelligence (CI) is a sub-branch of Artificial Intelligence
paradigm focusing on the study of adaptive mechanisms to enable or facilitate
intelligent behavior in complex and changing environments. There are several
paradigms of CI [like artificial neural networks, evolutionary computations,
swarm intel... |
1006.1890 | Optimal Power Allocation for GSVD-Based Beamforming in the MIMO Wiretap
Channel | cs.IT math.IT | This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap
channel model, where there exists a transmitter, a legitimate receiver and an
eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved
when the transmitter and the legitimate receiver can communicate at some
positive ... |
1006.1916 | Building Computer Network Attacks | cs.CR cs.AI | In this work we start walking the path to a new perspective for viewing
cyberwarfare scenarios, by introducing conceptual tools (a formal model) to
evaluate the costs of an attack, to describe the theater of operations,
targets, missions, actions, plans and assets involved in cyberwarfare attacks.
We also describe tw... |
1006.1918 | Using Neural Networks to improve classical Operating System
Fingerprinting techniques | cs.CR cs.NE | We present remote Operating System detection as an inference problem: given a
set of observations (the target host responses to a set of tests), we want to
infer the OS type which most probably generated these observations. Classical
techniques used to perform this analysis present several limitations. To
improve the... |
1006.1930 | The Pet-Fish problem on the World-Wide Web | cs.AI cs.CL | We identify the presence of Pet-Fish problem situations and the corresponding
Guppy effect of concept theory on the World-Wide Web. For this purpose, we
introduce absolute weights for words expressing concepts and relative weights
between words expressing concepts, and the notion of 'meaning bound' between
two words ... |
1006.1956 | A Semi-distributed Reputation Based Intrusion Detection System for
Mobile Adhoc Networks | cs.NI cs.MA | A Mobile Adhoc Network (MANET) is a cooperative engagement of a collection of
mobile nodes without any centralized access point or infrastructure to
coordinate among the peers. The underlying concept of coordination among nodes
in a cooperative MANET has induced in them a vulnerability to attacks due to
issues like l... |
1006.2002 | Colored-Gaussian Multiple Descriptions: Spectral and Time-Domain Forms | cs.IT math.IT | It is well known that Shannon's rate-distortion function (RDF) in the colored
quadratic Gaussian (QG) case can be parametrized via a single Lagrangian
variable (the "water level" in the reverse water filling solution). In this
work, we show that the symmetric colored QG multiple-description (MD) RDF in
the case of tw... |
1006.2004 | Throughput, Bit-Cost, Network State Information: Tradeoffs in
Cooperative CSMA Protocols | cs.IT math.IT | In wireless local area networks, spatially varying channel conditions result
in a severe performance discrepancy between different nodes in the uplink,
depending on their position. Both throughput and energy expense are affected.
Cooperative protocols were proposed to mitigate these discrepancies. However,
additional... |
1006.2006 | An entropy inequality for q-ary random variables and its application to
channel polarization | cs.IT math.IT | It is shown that given two copies of a q-ary input channel $W$, where q is
prime, it is possible to create two channels $W^-$ and $W^+$ whose symmetric
capacities satisfy $I(W^-)\le I(W)\le I(W^+)$, where the inequalities are
strict except in trivial cases. This leads to a simple proof of channel
polarization in the ... |
1006.2022 | Message and state cooperation in multiple access channels | cs.IT math.IT | We investigate the capacity of a multiple access channel with cooperating
encoders where partial state information is known to each encoder and full
state information is known to the decoder. The cooperation between the encoders
has a two-fold purpose: to generate empirical state coordination between the
encoders, an... |
1006.2055 | Enhanced Compressive Wideband Frequency Spectrum Sensing for Dynamic
Spectrum Access | cs.IT math.IT | Wideband spectrum sensing detects the unused spectrum holes for dynamic
spectrum access (DSA). Too high sampling rate is the main problem. Compressive
sensing (CS) can reconstruct sparse signal with much fewer randomized samples
than Nyquist sampling with high probability. Since survey shows that the
monitored signal... |
1006.2077 | Multidimensi Pada Data Warehouse Dengan Menggunakan Rumus Kombinasi | cs.DB | Multidimensional in data warehouse is a compulsion and become the most
important for information delivery, without multidimensional data warehouse is
incomplete. Multidimensional give the able to analyze business measurement in
many different ways. Multidimensional is also synonymous with online analytical
processing... |
1006.2086 | A Geometric Approach to Low-Rank Matrix Completion | cs.IT math.IT math.NA | The low-rank matrix completion problem can be succinctly stated as follows:
given a subset of the entries of a matrix, find a low-rank matrix consistent
with the observations. While several low-complexity algorithms for matrix
completion have been proposed so far, it remains an open problem to devise
search procedure... |
1006.2088 | Classification rule with simple select SQL statement | cs.DB | A simple sql statement can be used to search learning or rule in relational
database for data mining purposes particularly for classification rule. With
just only one simple sql statement, characteristic and classification rule can
be created simultaneously. Collaboration sql statement with any other
application soft... |
1006.2125 | Small But Slow World: How Network Topology and Burstiness Slow Down
Spreading | physics.soc-ph cs.SI nlin.AO physics.bio-ph | Communication networks show the small-world property of short paths, but the
spreading dynamics in them turns out slow. We follow the time evolution of
information propagation through communication networks by using the SI model
with empirical data on contact sequences. We introduce null models where the
sequences ar... |
1006.2156 | Dyadic Prediction Using a Latent Feature Log-Linear Model | cs.LG | In dyadic prediction, labels must be predicted for pairs (dyads) whose
members possess unique identifiers and, sometimes, additional features called
side-information. Special cases of this problem include collaborative filtering
and link prediction. We present the first model for dyadic prediction that
satisfies seve... |
1006.2162 | Multi-Cell MIMO Downlink with Cell Cooperation and Fair Scheduling: a
Large-System Limit Analysis | cs.IT math.IT | We consider the downlink of a cellular network with multiple cells and
multi-antenna base stations, including a realistic distance-dependent pathloss
model, clusters of cooperating cells, and general "fairness" requirements.
Beyond Monte Carlo simulation, no efficient computation method to evaluate the
ergodic throug... |
1006.2165 | A Probabilistic Perspective on Gaussian Filtering and Smoothing | stat.ME cs.AI cs.RO cs.SY math.OC stat.ML | We present a general probabilistic perspective on Gaussian filtering and
smoothing. This allows us to show that common approaches to Gaussian
filtering/smoothing can be distinguished solely by their methods of
computing/approximating the means and covariances of joint probabilities. This
implies that novel filters an... |
1006.2195 | Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion | cs.IT math.IT | We describe a new algorithm, termed subspace evolution and transfer (SET),
for solving low-rank matrix completion problems. The algorithm takes as its
input a subset of entries of a low-rank matrix, and outputs one low-rank matrix
consistent with the given observations. The completion task is accomplished by
searchin... |
1006.2204 | MDPs with Unawareness | cs.AI | Markov decision processes (MDPs) are widely used for modeling decision-making
problems in robotics, automated control, and economics. Traditional MDPs assume
that the decision maker (DM) knows all states and actions. However, this may
not be true in many situations of interest. We define a new framework, MDPs
with un... |
1006.2221 | Deterministic Sampling of Sparse Trigonometric Polynomials | math.NA cs.IT math.IT | One can recover sparse multivariate trigonometric polynomials from few
randomly taken samples with high probability (as shown by Kunis and Rauhut). We
give a deterministic sampling of multivariate trigonometric polynomials
inspired by Weil's exponential sum. Our sampling can produce a deterministic
matrix satisfying ... |
1006.2289 | Unification in the Description Logic EL | cs.AI cs.LO | The Description Logic EL has recently drawn considerable attention since, on
the one hand, important inference problems such as the subsumption problem are
polynomial. On the other hand, EL is used to define large biomedical
ontologies. Unification in Description Logics has been proposed as a novel
inference service ... |
1006.2322 | Discovery of a missing disease spreader | cs.AI cs.SI physics.bio-ph physics.soc-ph q-bio.PE | This study presents a method to discover an outbreak of an infectious disease
in a region for which data are missing, but which is at work as a disease
spreader. Node discovery for the spread of an infectious disease is defined as
discriminating between the nodes which are neighboring to a missing disease
spreader no... |
1006.2348 | Space-time block codes from nonassociative division algebras | cs.IT math.IT | Associative division algebras are a rich source of fully diverse space-time
block codes (STBCs). In this paper the systematic construction of fully diverse
STBCs from nonassociative algebras is discussed. As examples, families of fully
diverse $2\times 2$, $2\times 4$ multiblock and $4\x 4$ STBCs are designed,
employ... |
1006.2368 | L2-optimal image interpolation and its applications to medical imaging | cs.CV cs.GR | Digital medical images are always displayed scaled to fit particular view.
Interpolation is responsible for this scaling, and if not done properly, can
significantly degrade diagnostic image quality. However, theoretically-optimal
interpolation algorithms may also be the most time-consuming and impractical.
We propos... |
1006.2380 | Opportunistic Interference Mitigation Achieves Optimal
Degrees-of-Freedom in Wireless Multi-cell Uplink Networks | cs.IT math.IT | We introduce an opportunistic interference mitigation (OIM) protocol, where a
user scheduling strategy is utilized in $K$-cell uplink networks with
time-invariant channel coefficients and base stations (BSs) having $M$
antennas. Each BS opportunistically selects a set of users who generate the
minimum interference to... |
1006.2403 | On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure
Channel | cs.IT math.IT | This paper considers the queueing performance of a system that transmits
coded data over a time-varying erasure channel. In our model, the queue length
and channel state together form a Markov chain that depends on the system
parameters. This gives a framework that allows a rigorous analysis of the queue
as a functio... |
1006.2422 | Complexity of Multi-Value Byzantine Agreement | cs.DC cs.IT cs.NI math.IT | In this paper, we consider the problem of maximizing the throughput of
Byzantine agreement, given that the sum capacity of all links in between nodes
in the system is finite. We have proposed a highly efficient Byzantine
agreement algorithm on values of length l>1 bits. This algorithm uses error
detecting network cod... |
1006.2495 | Mirrored Language Structure and Innate Logic of the Human Brain as a
Computable Model of the Oracle Turing Machine | cs.LO cs.AI | We wish to present a mirrored language structure (MLS) and four logic rules
determined by this structure for the model of a computable Oracle Turing
machine. MLS has novel features that are of considerable biological and
computational significance. It suggests an algorithm of relation learning and
recognition (RLR) t... |
1006.2498 | On the Deterministic Code Capacity Region of an Arbitrarily Varying
Multiple-Access Channel Under List Decoding | cs.IT math.IT | We study the capacity region $C_L$ of an arbitrarily varying multiple-access
channel (AVMAC) for deterministic codes with decoding into a list of a fixed
size $L$ and for the average error probability criterion. Motivated by known
results in the study of fixed size list decoding for a point-to-point
arbitrarily varyi... |
1006.2513 | On the Achievability of Cram\'er-Rao Bound In Noisy Compressed Sensing | cs.IT cs.LG math.IT | Recently, it has been proved in Babadi et al. that in noisy compressed
sensing, a joint typical estimator can asymptotically achieve the Cramer-Rao
lower bound of the problem.To prove this result, this paper used a lemma,which
is provided in Akcakaya et al,that comprises the main building block of the
proof. This lem... |
1006.2523 | Asymptotic Equipartition Properties for simple hierarchical and
networked structures | cs.IT math.IT math.PR | We prove asymptotic equipartition properties for simple hierarchical
structures (modelled as multitype Galton-Watson trees) and networked structures
(modelled as randomly coloured random graphs). For example, for large $n$, a
networked data structure consisting of $n$ units connected by an average number
of links of ... |
1006.2565 | State-Dependent Relay Channel with Private Messages with Partial Causal
and Non-Causal Channel State Information | cs.IT math.IT | In this paper, we introduce a discrete memoryless State-Dependent Relay
Channel with Private Messages (SD-RCPM) as a generalization of the
state-dependent relay channel. We investigate two main cases: SD-RCPM with
non-causal Channel State Information (CSI), and SD-RCPM with causal CSI. In
each case, it is assumed tha... |
1006.2588 | Agnostic Active Learning Without Constraints | cs.LG | We present and analyze an agnostic active learning algorithm that works
without keeping a version space. This is unlike all previous approaches where a
restricted set of candidate hypotheses is maintained throughout learning, and
only hypotheses from this set are ever returned. By avoiding this version space
approach... |
1006.2592 | Outlier Detection Using Nonconvex Penalized Regression | stat.ME cs.LG stat.CO | This paper studies the outlier detection problem from the point of view of
penalized regressions. Our regression model adds one mean shift parameter for
each of the $n$ data points. We then apply a regularization favoring a sparse
vector of mean shift parameters. The usual $L_1$ penalty yields a convex
criterion, but... |
1006.2610 | Functions which are PN on infiitely many extensions of Fp, p odd | math.NT cs.IT math.IT | Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is
perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only
if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities
of $f(x,y)=\frac{(x+1)^m-x^m-(y+1)^m+y^m}{x-y}$ and we use Bezout theorem to
show ... |
1006.2660 | Rate Compatible Protocol for Information Reconciliation: An application
to QKD | cs.IT math.IT | Information Reconciliation is a mechanism that allows to weed out the
discrepancies between two correlated variables. It is an essential component in
every key agreement protocol where the key has to be transmitted through a
noisy channel. The typical case is in the satellite scenario described by
Maurer in the early... |
1006.2700 | Image Segmentation Using Weak Shape Priors | cs.CV | The problem of image segmentation is known to become particularly challenging
in the case of partial occlusion of the object(s) of interest, background
clutter, and the presence of strong noise. To overcome this problem, the
present paper introduces a novel approach segmentation through the use of
"weak" shape priors... |
1006.2718 | From RESTful Services to RDF: Connecting the Web and the Semantic Web | cs.AI cs.DL | RESTful services on the Web expose information through retrievable resource
representations that represent self-describing descriptions of resources, and
through the way how these resources are interlinked through the hyperlinks that
can be found in those representations. This basic design of RESTful services
means t... |
1006.2734 | Penalized K-Nearest-Neighbor-Graph Based Metrics for Clustering | cs.CV | A difficult problem in clustering is how to handle data with a manifold
structure, i.e. data that is not shaped in the form of compact clouds of
points, forming arbitrary shapes or paths embedded in a high-dimensional space.
In this work we introduce the Penalized k-Nearest-Neighbor-Graph (PKNNG) based
metric, a new ... |
1006.2743 | Global Optimization for Value Function Approximation | cs.AI | Existing value function approximation methods have been successfully used in
many applications, but they often lack useful a priori error bounds. We propose
a new approximate bilinear programming formulation of value function
approximation, which employs global optimization. The formulation provides
strong a priori g... |
1006.2758 | Eigen-Based Transceivers for the MIMO Broadcast Channel with
Semi-Orthogonal User Selection | cs.IT math.IT | This paper studies the sum rate performance of two low complexity
eigenmode-based transmission techniques for the MIMO broadcast channel,
employing greedy semi-orthogonal user selection (SUS). The first approach,
termed ZFDPC-SUS, is based on zero-forcing dirty paper coding; the second
approach, termed ZFBF-SUS, is b... |
1006.2769 | Achievable Rate Regions for Discrete Memoryless Interference Channel
with State Information | cs.IT math.IT | In this paper, we study the state-dependent two-user interference channel,
where the state information is non-causally known at both transmitters but
unknown to either of the receivers. We propose two coding schemes for the
discrete memoryless case: simultaneous encoding for the sub-messages in the
first one and supe... |
1006.2804 | An Effective Fingerprint Verification Technique | cs.CV | This paper presents an effective method for fingerprint verification based on
a data mining technique called minutiae clustering and a graph-theoretic
approach to analyze the process of fingerprint comparison to give a feature
space representation of minutiae and to produce a lower bound on the number of
detectably d... |
1006.2805 | Robust PI Control Design Using Particle Swarm Optimization | cs.CE | This paper presents a set of robust PI tuning formulae for a first order plus
dead time process using particle swarm optimization. Also, tuning formulae for
an integrating process with dead time, which is a special case of a first order
plus dead time process, is given. The design problem considers three essential
re... |
1006.2806 | A Metaheuristic Approach for IT Projects Portfolio Optimization | cs.CE | Optimal selection of interdependent IT Projects for implementation in multi
periods has been challenging in the framework of real option valuation. This
paper presents a mathematical optimization model for multi-stage portfolio of
IT projects. The model optimizes the value of the portfolio within a given
budgetary an... |
1006.2809 | Offline Arabic Handwriting Recognition Using Artificial Neural Network | cs.CL | The ambition of a character recognition system is to transform a text
document typed on paper into a digital format that can be manipulated by word
processor software Unlike other languages, Arabic has unique features, while
other language doesn't have, from this language these are seven or eight
language such as ord... |
1006.2813 | Algorithm for Predicting Protein Secondary Structure | cs.CE q-bio.BM | Predicting protein structure from amino acid sequence is one of the most
important unsolved problems of molecular biology and biophysics.Not only would
a successful prediction algorithm be a tremendous advance in the understanding
of the biochemical mechanisms of proteins, but, since such an algorithm could
conceivab... |
1006.2835 | Fuzzy Modeling and Natural Language Processing for Panini's Sanskrit
Grammar | cs.CL | Indian languages have long history in World Natural languages. Panini was the
first to define Grammar for Sanskrit language with about 4000 rules in fifth
century. These rules contain uncertainty information. It is not possible to
Computer processing of Sanskrit language with uncertain information. In this
paper, fuz... |
1006.2844 | Outrepasser les limites des techniques classiques de Prise d'Empreintes
grace aux Reseaux de Neurones | cs.CR cs.AI cs.NE | We present an application of Artificial Intelligence techniques to the field
of Information Security. The problem of remote Operating System (OS) Detection,
also called OS Fingerprinting, is a crucial step of the penetration testing
process, since the attacker (hacker or security professional) needs to know the
OS of... |
1006.2860 | The Euclidean Algorithm for Generalized Minimum Distance Decoding of
Reed-Solomon Codes | cs.IT math.IT | This paper presents a method to merge Generalized Minimum Distance decoding
of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean
that the steps taken to perform the Generalized Minimum Distance decoding are
similar to those performed by the extended Euclidean algorithm. The resulting
algorit... |
1006.2880 | Fast Incremental and Personalized PageRank | cs.DS cs.DB cs.IR | In this paper, we analyze the efficiency of Monte Carlo methods for
incremental computation of PageRank, personalized PageRank, and similar random
walk based methods (with focus on SALSA), on large-scale dynamically evolving
social networks. We assume that the graph of friendships is stored in
distributed shared memo... |
1006.2883 | The entropy per coordinate of a random vector is highly constrained
under convexity conditions | cs.IT math.FA math.IT math.PR | The entropy per coordinate in a log-concave random vector of any dimension
with given density at the mode is shown to have a range of just 1. Uniform
distributions on convex bodies are at the lower end of this range, the
distribution with i.i.d. exponentially distributed coordinates is at the upper
end, and the norma... |
1006.2884 | Fractional generalizations of Young and Brunn-Minkowski inequalities | math.FA cs.IT math.IT math.PR | A generalization of Young's inequality for convolution with sharp constant is
conjectured for scenarios where more than two functions are being convolved,
and it is proven for certain parameter ranges. The conjecture would provide a
unified proof of recent entropy power inequalities of Barron and Madiman, as
well as ... |
1006.2899 | Approximated Structured Prediction for Learning Large Scale Graphical
Models | cs.LG cs.AI | This manuscripts contains the proofs for "A Primal-Dual Message-Passing
Algorithm for Approximated Large Scale Structured Prediction".
|
1006.2945 | Two-Timescale Learning Using Idiotypic Behaviour Mediation For A
Navigating Mobile Robot | cs.AI cs.NE cs.RO | A combined Short-Term Learning (STL) and Long-Term Learning (LTL) approach to
solving mobile-robot navigation problems is presented and tested in both the
real and virtual domains. The LTL phase consists of rapid simulations that use
a Genetic Algorithm to derive diverse sets of behaviours, encoded as variable
sets o... |
1006.2977 | Algebraic Constructions of Graph-Based Nested Codes from Protographs | cs.IT math.IT | Nested codes have been employed in a large number of communication
applications as a specific case of superposition codes, for example to
implement binning schemes in the presence of noise, in joint network-channel
coding, or in physical-layer secrecy. Whereas nested lattice codes have been
proposed recently for cont... |
1006.2996 | Bounding the Rate Region of Vector Gaussian Multiple Descriptions with
Individual and Central Receivers | cs.IT math.IT | In this work, the rate region of the vector Gaussian multiple description
problem with individual and central quadratic distortion constraints is
studied. In particular, an outer bound to the rate region of the L-description
problem is derived. The bound is obtained by lower bounding a weighted sum rate
for each supp... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.