id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0910.1871 | MIMO Wireless Communications under Statistical Queueing Constraints | cs.IT math.IT | The performance of multiple-input multiple-output wireless systems is
investigated in the presence of statistical queueing constraints. Queuing
constraints are imposed as limitations on buffer violation probabilities. The
performance under such constraints is captured through the effective capacity
formulation. A det... |
0910.1879 | Recovering low-rank matrices from few coefficients in any basis | cs.IT cs.NA math.IT math.NA quant-ph | We present novel techniques for analyzing the problem of low-rank matrix
recovery. The methods are both considerably simpler and more general than
previous approaches. It is shown that an unknown (n x n) matrix of rank r can
be efficiently reconstructed from only O(n r nu log^2 n) randomly sampled
expansion coefficie... |
0910.1922 | Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes | cs.IT math.IT | In this paper, we first introduce the extended binary representation of
non-binary codes, which corresponds to a covering graph of the bipartite graph
associated with the non-binary code. Then we show that non-binary codewords
correspond to binary codewords of the extended representation that further
satisfy some sim... |
0910.1938 | Information Retrieval via Truncated Hilbert-Space Expansions | cs.IR | In addition to the frequency of terms in a document collection, the
distribution of terms plays an important role in determining the relevance of
documents. In this paper, a new approach for representing term positions in
documents is presented. The approach allows an efficient evaluation of
term-positional informati... |
0910.1943 | Construction of a Large Class of Deterministic Sensing Matrices that
Satisfy a Statistical Isometry Property | cs.IT math.IT math.PR | Compressed Sensing aims to capture attributes of $k$-sparse signals using
very few measurements. In the standard Compressed Sensing paradigm, the
$\m\times \n$ measurement matrix $\A$ is required to act as a near isometry on
the set of all $k$-sparse signals (Restricted Isometry Property or RIP).
Although it is known... |
0910.1954 | Multi-channel Opportunistic Access: A Case of Restless Bandits with
Multiple Plays | cs.IT cs.DM math.IT math.OC | This paper considers the following stochastic control problem that arises in
opportunistic spectrum access: a system consists of n channels (Gilbert-Elliot
channels)where the state (good or bad) of each channel evolves as independent
and identically distributed Markov processes. A user can select exactly k
channels t... |
0910.1955 | Microstructure reconstruction using entropic descriptors | cond-mat.stat-mech cs.CV | A multi-scale approach to the inverse reconstruction of a pattern's
microstructure is reported. Instead of a correlation function, a pair of
entropic descriptors (EDs) is proposed for stochastic optimization method. The
first of them measures a spatial inhomogeneity, for a binary pattern, or
compositional one, for a ... |
0910.2005 | Modulation Codes for Flash Memory Based on Load-Balancing Theory | cs.IT math.IT | In this paper, we consider modulation codes for practical multilevel flash
memory storage systems with cell levels. Instead of maximizing the lifetime of
the device [Ajiang-isit07-01, Ajiang-isit07-02,
Yaakobi_verdy_siegel_wolf_allerton08, Finucane_Liu_Mitzenmacher_aller08], we
maximize the average amount of informat... |
0910.2029 | A Framework For Intelligent Multi Agent System Based Neural Network
Classification Model | cs.NE cs.MA | TIntelligent multi agent systems have great potentials to use in different
purposes and research areas. One of the important issues to apply intelligent
multi agent systems in real world and virtual environment is to develop a
framework that support machine learning model to reflect the whole complexity
of the real w... |
0910.2034 | Strategies for online inference of model-based clustering in large and
growing networks | stat.AP cs.LG | In this paper we adapt online estimation strategies to perform model-based
clustering on large networks. Our work focuses on two algorithms, the first
based on the SAEM algorithm, and the second on variational methods. These two
strategies are compared with existing approaches on simulated and real data. We
use the m... |
0910.2039 | Higher coordination with less control - A result of information
maximization in the sensorimotor loop | cs.AI cs.IT cs.RO math.IT | This work presents a novel learning method in the context of embodied
artificial intelligence and self-organization, which has as few assumptions and
restrictions as possible about the world and the underlying model. The learning
rule is derived from the principle of maximizing the predictive information in
the senso... |
0910.2042 | Minimax rates of estimation for high-dimensional linear regression over
$\ell_q$-balls | math.ST cs.IT math.IT stat.TH | Consider the standard linear regression model $\y = \Xmat \betastar + w$,
where $\y \in \real^\numobs$ is an observation vector, $\Xmat \in
\real^{\numobs \times \pdim}$ is a design matrix, $\betastar \in \real^\pdim$
is the unknown regression vector, and $w \sim \mathcal{N}(0, \sigma^2 I)$ is
additive Gaussian noise... |
0910.2065 | Distributed Learning in Multi-Armed Bandit with Multiple Players | math.OC cs.LG math.PR | We formulate and study a decentralized multi-armed bandit (MAB) problem.
There are M distributed players competing for N independent arms. Each arm,
when played, offers i.i.d. reward according to a distribution with an unknown
parameter. At each time, each player chooses one arm to play without exchanging
observation... |
0910.2066 | A Lossless Fuzzy Binary AND/OR Compressor | cs.IT math.IT | In this report, a new fuzzy 2bit-AND parallel-to-OR, or simply, a fuzzy
binary AND/OR (FBAR) text data compression model as an algorithm is suggested
for bettering spatial locality limits on nodes during database transactions.
The current model incorporates a four-layer application technique:
string-to-AND/OR pairwis... |
0910.2099 | Generalizations of Wei's Duality Theorem | cs.IT math.IT | Wei's celebrated Duality Theorem is generalized in several ways, expressed as
duality theorems for linear codes over division rings and, more generally,
duality theorems for matroids. These results are further generalized, resulting
in two Wei-type duality theorems for new combinatorial structures that are
introduced... |
0910.2173 | Distributed Turbo-Like Codes for Multi-User Cooperative Relay Networks | cs.IT math.IT | In this paper, a distributed turbo-like coding scheme for wireless networks
with relays is proposed. We consider a scenario where multiple sources
communicate with a single destination with the help of a relay. The proposed
scheme can be regarded as of the decode-and-forward type. The relay decodes the
information fr... |
0910.2187 | Computing abstractions of nonlinear systems | math.OC cs.SY math.DS | Sufficiently accurate finite state models, also called symbolic models or
discrete abstractions, allow one to apply fully automated methods, originally
developed for purely discrete systems, to formally reason about continuous and
hybrid systems, and to design finite state controllers that provably enforce
predefined... |
0910.2217 | Finite element model selection using Particle Swarm Optimization | cs.AI | This paper proposes the application of particle swarm optimization (PSO) to
the problem of finite element model (FEM) selection. This problem arises when a
choice of the best model for a system has to be made from set of competing
models, each developed a priori from engineering judgment. PSO is a
population-based st... |
0910.2240 | Repeated Auctions with Learning for Spectrum Access in Cognitive Radio
Networks | cs.IT cs.LG math.IT math.OC | In this paper, spectrum access in cognitive radio networks is modeled as a
repeated auction game subject to monitoring and entry costs. For secondary
users, sensing costs are incurred as the result of primary users' activity.
Furthermore, each secondary user pays the cost of transmissions upon successful
bidding for ... |
0910.2245 | Searching for Minimum Storage Regenerating Codes | cs.IT math.IT | Regenerating codes allow distributed storage systems to recover from the loss
of a storage node while transmitting the minimum possible amount of data across
the network. We present a systematic computer search for optimal systematic
regenerating codes. To search the space of potential codes, we reduce the
potential ... |
0910.2263 | Minimum cost mirror sites using network coding: Replication vs. coding
at the source nodes | cs.IT math.IT | Content distribution over networks is often achieved by using mirror sites
that hold copies of files or portions thereof to avoid congestion and delay
issues arising from excessive demands to a single location. Accordingly, there
are distributed storage solutions that divide the file into pieces and place
copies of t... |
0910.2276 | State of the Art Review for Applying Computational Intelligence and
Machine Learning Techniques to Portfolio Optimisation | cs.CE cs.AI | Computational techniques have shown much promise in the field of Finance,
owing to their ability to extract sense out of dauntingly complex systems. This
paper reviews the most promising of these techniques, from traditional
computational intelligence methods to their machine learning siblings, with
particular view t... |
0910.2279 | Positive Semidefinite Metric Learning with Boosting | cs.CV cs.LG | The learning of appropriate distance metrics is a critical problem in image
classification and retrieval. In this work, we propose a boosting-based
technique, termed \BoostMetric, for learning a Mahalanobis distance metric. One
of the primary difficulties in learning such a metric is to ensure that the
Mahalanobis ma... |
0910.2304 | Cooperative Multi-Cell Block Diagonalization with Per-Base-Station Power
Constraints | cs.IT math.IT | Block diagonalization (BD) is a practical linear precoding technique that
eliminates the inter-user interference in downlink multiuser multiple-input
multiple-output (MIMO) systems. In this paper, we apply BD to the downlink
transmission in a cooperative multi-cell MIMO system, where the signals from
different base s... |
0910.2350 | Quantum control theory and applications: A survey | quant-ph cs.SY math-ph math.MP | This paper presents a survey on quantum control theory and applications from
a control systems perspective. Some of the basic concepts and main developments
(including open-loop control and closed-loop control) in quantum control theory
are reviewed. In the area of open-loop quantum control, the paper surveys the
not... |
0910.2381 | Fractional differentiation based image processing | cs.CV | There are many resources useful for processing images, most of them freely
available and quite friendly to use. In spite of this abundance of tools, a
study of the processing methods is still worthy of efforts. Here, we want to
discuss the possibilities arising from the use of fractional differential
calculus. This c... |
0910.2405 | Generating Concise and Readable Summaries of XML Documents | cs.IR cs.DB | XML has become the de-facto standard for data representation and exchange,
resulting in large scale repositories and warehouses of XML data. In order for
users to understand and explore these large collections, a summarized, bird's
eye view of the available data is a necessity. In this paper, we are interested
in sem... |
0910.2486 | A Construction of Systematic MDS Codes with Minimum Repair Bandwidth | cs.IT math.IT | In a distributed storage system based on erasure coding, an important problem
is the \emph{repair problem}: If a node storing a coded piece fails, in order
to maintain the same level of reliability, we need to create a new encoded
piece and store it at a new node. This paper presents a construction of
systematic $(n,... |
0910.2502 | Interference Channels with Strong Secrecy | cs.IT math.IT | It is known that given the real sum of two independent uniformly distributed
lattice points from the same nested lattice codebook, the eavesdropper can
obtain at most 1 bit of information per channel regarding the value of one of
the lattice points. In this work, we study the effect of this 1 bit information
on the e... |
0910.2525 | Utility of Beamforming Strategies for Secrecy in Multiuser MIMO Wiretap
Channels | cs.IT math.IT | This paper examines linear beamforming methods for secure communications in a
multiuser wiretap channel with a single transmitter, multiple legitimate
receivers, and a single eavesdropper, where all nodes are equipped with
multiple antennas. No information regarding the eavesdropper is presumed at the
transmitter, an... |
0910.2534 | Optimal Multiplexing Gain of K-user Line-of-Sight Interference Channels
with Polarization | cs.IT math.IT | We consider the multiplexing gain (MUXG) of the fully connected K-user
line-of-sight (LOS) interference channels (ICs). A polarimetric antenna
composed of 3 orthogonal electric dipoles and 3 orthogonal magnetic dipoles is
considered where all 6 dipoles are co-located. In case of K-user IC with single
polarization, th... |
0910.2540 | Effectiveness and Limitations of Statistical Spam Filters | cs.LG | In this paper we discuss the techniques involved in the design of the famous
statistical spam filters that include Naive Bayes, Term Frequency-Inverse
Document Frequency, K-Nearest Neighbor, Support Vector Machine, and Bayes
Additive Regression Tree. We compare these techniques with each other in terms
of accuracy, r... |
0910.2586 | Degeneracy: a link between evolvability, robustness and complexity in
biological systems | nlin.AO cs.NE | A full accounting of biological robustness remains elusive; both in terms of
the mechanisms by which robustness is achieved and the forces that have caused
robustness to grow over evolutionary time. Although its importance to topics
such as ecosystem services and resilience is well recognized, the broader
relationshi... |
0910.2593 | A Component Based Heuristic Search Method with Evolutionary Eliminations | cs.AI cs.NE | Nurse rostering is a complex scheduling problem that affects hospital
personnel on a daily basis all over the world. This paper presents a new
component-based approach with evolutionary eliminations, for a nurse scheduling
problem arising at a major UK hospital. The main idea behind this technique is
to decompose a s... |
0910.2718 | Two-hop Secure Communication Using an Untrusted Relay | cs.IT math.IT | We consider a source-destination pair that can only communicate through an
untrusted intermediate relay node. The intermediate node is willing to employ a
designated relaying scheme to facilitate reliable communication between the
source and the destination. Yet, the information it relays needs to be kept
secret from... |
0910.2743 | DILAND: An Algorithm for Distributed Sensor Localization with Noisy
Distance Measurements | cs.DC cs.IT math.IT | In this correspondence, we present an algorithm for distributed sensor
localization with noisy distance measurements (DILAND) that extends and makes
the DLRE more robust. DLRE is a distributed sensor localization algorithm in
$\mathbb{R}^m$ $(m\geq1)$ introduced in \cite{usman_loctsp:08}. DILAND operates
when (i) the... |
0910.2771 | Cooperative Interference Management with MISO Beamforming | cs.IT math.IT | This correspondence studies the downlink transmission in a multi-cell system,
where multiple base stations (BSs) each with multiple antennas cooperatively
design their respective transmit beamforming vectors to optimize the overall
system performance. For simplicity, it is assumed that all mobile stations
(MSs) are e... |
0910.2832 | Expectation Maximization as Message Passing - Part I: Principles and
Gaussian Messages | cs.IT math.IT | It is shown how expectation maximization (EM) may be viewed as a message
passing algorithm in factor graphs. In particular, a general EM message
computation rule is identified. As a factor graph tool, EM may be used to break
cycles in a factor graph, and tractable messages may in some cases be obtained
where the sum-... |
0910.2874 | An Agent Based Classification Model | cs.AI cs.MA | The major function of this model is to access the UCI Wisconsin Breast Can-
cer data-set[1] and classify the data items into two categories, which are
normal and anomalous. This kind of classifi cation can be referred as anomaly
detection, which discriminates anomalous behaviour from normal behaviour in
computer syst... |
0910.2917 | Behavior Subtraction | cs.CV | Background subtraction has been a driving engine for many computer vision and
video analytics tasks. Although its many variants exist, they all share the
underlying assumption that photometric scene properties are either static or
exhibit temporal stationarity. While this works in some applications, the model
fails w... |
0910.2961 | Isotropic MIMO Interference Channels without CSIT: The Loss of Degrees
of Freedom | cs.IT math.IT | This paper studies two-user MIMO interference channel with isotropic fading.
We assume that users are equipped with arbitrary number of antennas and the
channel state information (CSI) is available at receivers only. An outer bound
is obtained for the degree of freedom region, which suggests the loss of
degrees of fr... |
0910.3028 | State of the cognitive interference channel: a new unified inner bound | cs.IT math.IT | The capacity region of the interference channel in which one transmitter
non-causally knows the message of the other, termed the cognitive interference
channel, has remained open since its inception in 2005. A number of subtly
differing achievable rate regions and outer bounds have been derived, some of
which are tig... |
0910.3033 | Degraded Compound Multi-receiver Wiretap Channels | cs.IT math.IT | In this paper, we study the degraded compound multi-receiver wiretap channel.
The degraded compound multi-receiver wiretap channel consists of two groups of
users and a group of eavesdroppers, where, if we pick an arbitrary user from
each group of users and an arbitrary eavesdropper, they satisfy a certain
Markov cha... |
0910.3068 | An Evolutionary Squeaky Wheel Optimisation Approach to Personnel
Scheduling | cs.AI cs.CE cs.NE | The quest for robust heuristics that are able to solve more than one problem
is ongoing. In this paper, we present, discuss and analyse a technique called
Evolutionary Squeaky Wheel Optimisation and apply it to two different personnel
scheduling problems. Evolutionary Squeaky Wheel Optimisation improves the
original ... |
0910.3084 | Self-Dual Codes over Z_2xZ_4 | cs.IT math.IT | Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha
\times\Z_4^\beta$ that are equal to their orthogonal under an inner-product
that relates to the binary Hamming scheme. Three types of self-dual codes are
defined. For each type, the possible values $\alpha,\beta$ such that there
exist a code $\C\subs... |
0910.3113 | Which Digraphs with Ring Structure are Essentially Cyclic? | math.CO cs.DM cs.MA math.SP | We say that a digraph is essentially cyclic if its Laplacian spectrum is not
completely real. The essential cyclicity implies the presence of directed
cycles, but not vice versa. The problem of characterizing essential cyclicity
in terms of graph topology is difficult and yet unsolved. Its solution is
important for s... |
0910.3115 | An Idiotypic Immune Network as a Short Term Learning Architecture for
Mobile Robots | 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 real
and simulated environments. The LTL consists of rapid simulations that use a
Genetic Algorithm to derive diverse sets of behaviours. These sets are then
transferr... |
0910.3117 | An Immune Inspired Approach to Anomaly Detection | cs.AI cs.CR cs.NE | The immune system provides a rich metaphor for computer security: anomaly
detection that works in nature should work for machines. However, early
artificial immune system approaches for computer security had only limited
success. Arguably, this was due to these artificial systems being based on too
simplistic a view ... |
0910.3119 | FFT-based Network Coding For Peer-To-Peer Content Delivery | cs.IT math.IT | In this paper, we propose a structured peer-to-peer (P2P) distribution scheme
based on Fast Fourier Transform (FFT) graphs. We build a peer-to-peer network
that reproduces the FFT graph initially designed for hardware FFT codecs. This
topology allows content delivery with a maximum diversity level for a minimum
globa... |
0910.3124 | An Immune Inspired Network Intrusion Detection System Utilising
Correlation Context | cs.AI cs.CR cs.NE | Network Intrusion Detection Systems (NIDS) are computer systems which monitor
a network with the aim of discerning malicious from benign activity on that
network. While a wide range of approaches have met varying levels of success,
most IDSs rely on having access to a database of known attack signatures which
are wri... |
0910.3148 | Parameterized Complexity of the k-anonymity Problem | cs.DS cs.DB cs.DM | The problem of publishing personal data without giving up privacy is becoming
increasingly important. An interesting formalization that has been recently
proposed is the $k$-anonymity. This approach requires that the rows of a table
are partitioned in clusters of size at least $k$ and that all the rows in a
cluster b... |
0910.3275 | Degrees of Freedom of Multi-Source Relay Networks | cs.IT math.IT | We study a multi-source Gaussian relay network consisting of $K$
source--destination pairs having $K$ unicast sessions. We assume $M$ layers of
relays between the sources and the destinations. We find achievable degrees of
freedom of the network. Our schemes are based on interference alignment at the
transmitters and... |
0910.3301 | Faster Algorithms for Max-Product Message-Passing | cs.AI cs.DS | Maximum A Posteriori inference in graphical models is often solved via
message-passing algorithms, such as the junction-tree algorithm, or loopy
belief-propagation. The exact solution to this problem is well known to be
exponential in the size of the model's maximal cliques after it is
triangulated, while approximate... |
0910.3348 | Algorithms for Image Analysis and Combination of Pattern Classifiers
with Application to Medical Diagnosis | cs.CV cs.AI cs.GT cs.NE | Medical Informatics and the application of modern signal processing in the
assistance of the diagnostic process in medical imaging is one of the more
recent and active research areas today. This thesis addresses a variety of
issues related to the general problem of medical image analysis, specifically
in mammography,... |
0910.3349 | b-Bit Minwise Hashing | cs.DS cs.DB cs.IR | This paper establishes the theoretical framework of b-bit minwise hashing.
The original minwise hashing method has become a standard technique for
estimating set similarity (e.g., resemblance) with applications in information
retrieval, data management, social networks and computational advertising.
By only storing... |
0910.3372 | Composition and Inversion of Schema Mappings | cs.DB | In the recent years, a lot of attention has been paid to the development of
solid foundations for the composition and inversion of schema mappings. In this
paper, we review the proposals for the semantics of these crucial operators.
For each of these proposals, we concentrate on the three following problems:
the defi... |
0910.3485 | A Fuzzy Petri Nets Model for Computing With Words | cs.AI | Motivated by Zadeh's paradigm of computing with words rather than numbers,
several formal models of computing with words have recently been proposed.
These models are based on automata and thus are not well-suited for concurrent
computing. In this paper, we incorporate the well-known model of concurrent
computing, Pe... |
0910.3490 | Adaptive model for recommendation of news | cs.IR cs.DL physics.soc-ph | Most news recommender systems try to identify users' interests and news'
attributes and use them to obtain recommendations. Here we propose an adaptive
model which combines similarities in users' rating patterns with epidemic-like
spreading of news on an evolving network. We study the model by computer
agent-based si... |
0910.3494 | Sum-capacity of Interference Channels with a Local View: Impact of
Distributed Decisions | cs.IT math.IT | Due to the large size of wireless networks, it is often impractical for nodes
to track changes in the complete network state. As a result, nodes have to make
distributed decisions about their transmission and reception parameters based
on their local view of the network. In this paper, we characterize the impact
of d... |
0910.3509 | Slepian-Wolf Coding Over Cooperative Relay Networks | cs.IT math.IT | This paper deals with the problem of multicasting a set of discrete
memoryless correlated sources (DMCS) over a cooperative relay network.
Necessary conditions with cut-set interpretation are presented. A \emph{Joint
source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which
decoding at each rece... |
0910.3580 | Set-Rationalizable Choice and Self-Stability | cs.MA | A common assumption in modern microeconomic theory is that choice should be
rationalizable via a binary preference relation, which \citeauthor{Sen71a}
showed to be equivalent to two consistency conditions, namely $\alpha$
(contraction) and $\gamma$ (expansion). Within the context of \emph{social}
choice, however, rat... |
0910.3603 | A complete solution to Blackwell's unique ergodicity problem for hidden
Markov chains | math.PR cs.IT math.IT | We develop necessary and sufficient conditions for uniqueness of the
invariant measure of the filtering process associated to an ergodic hidden
Markov model in a finite or countable state space. These results provide a
complete solution to a problem posed by Blackwell (1957), and subsume earlier
partial results due t... |
0910.3658 | Secrecy Rate Region of the Broadcast Channel with an Eavesdropper | cs.IT math.IT | In this paper, we consider a scenario where a source node wishes to broadcast
two confidential messages to two receivers, while a wire-tapper also receives
the transmitted signal. This model is motivated by wireless communications,
where individual secure messages are broadcast over open media and can be
received by ... |
0910.3713 | On Learning Finite-State Quantum Sources | quant-ph cs.LG | We examine the complexity of learning the distributions produced by
finite-state quantum sources. We show how prior techniques for learning hidden
Markov models can be adapted to the quantum generator model to find that the
analogous state of affairs holds: information-theoretically, a polynomial
number of samples su... |
0910.3768 | On the transmit strategy for the interference MIMO relay channel in the
low power regime | cs.IT math.IT | This paper studies the interference channel with two transmitters and two
receivers in the presence of a MIMO relay in the low transmit power regime. A
communication scheme combining block Markov encoding, beamforming, and Willems'
backward decoding is used. With this scheme, we get an interference channel
with chann... |
0910.3811 | Dynamics of the Orthoglide parallel robot | cs.RO | Recursive matrix relations for kinematics and dynamics of the Orthoglide
parallel robot having three concurrent prismatic actuators are established in
this paper. These are arranged according to the Cartesian coordinate system
with fixed orientation, which means that the actuating directions are normal to
each other.... |
0910.3840 | Distributed Universally Optimal Strategies for Interference Channels
with Partial Message Passing | cs.IT math.IT | In distributed wireless networks, nodes often do not know the topology
(network size, connectivity and the channel gains) of the network. Thus, they
have to compute their transmission and reception parameters in a distributed
fashion. In this paper, we consider that each of the transmitter know the
channel gains of a... |
0910.3848 | Equivalence Classes of Optimal Structures in HP Protein Models Including
Side Chains | cs.CE q-bio.BM | Lattice protein models, as the Hydrophobic-Polar (HP) model, are a common
abstraction to enable exhaustive studies on structure, function, or evolution
of proteins. A main issue is the high number of optimal structures, resulting
from the hydrophobicity-based energy function applied. We introduce an
equivalence relat... |
0910.3880 | Constraint-based Local Move Definitions for Lattice Protein Models
Including Side Chains | cs.CE q-bio.BM | The simulation of a protein's folding process is often done via stochastic
local search, which requires a procedure to apply structural changes onto a
given conformation. Here, we introduce a constraint-based approach to enumerate
lattice protein structures according to k-local moves in arbitrary lattices.
Our declar... |
0910.3883 | Variance Analysis of Randomized Consensus in Switching Directed Networks | cs.MA cs.DC cs.NI | In this paper, 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
Erdos-Renyi random graphs, where each agent can communicate with any other
agent wit... |
0910.3913 | How to Complete an Interactive Configuration Process? | cs.SE cs.AI cs.LO | When configuring customizable software, it is useful to provide interactive
tool-support that ensures that the configuration does not breach given
constraints.
But, when is a configuration complete and how can the tool help the user to
complete it?
We formalize this problem and relate it to concepts from non-mono... |
0910.3928 | Preamble-Based Channel Estimation for CP-OFDM and OFDM/OQAM Systems: A
Comparative Study | cs.IT math.IT | In this paper, preamble-based least squares (LS) channel estimation in OFDM
systems of the QAM and offset QAM (OQAM) types is considered, in both the
frequency and the time domains. The construction of optimal (in the mean
squared error (MSE) sense) preambles is investigated, for both the cases of
full (all tones car... |
0910.3973 | On the Delay-Throughput Tradeoff in Distributed Wireless Networks | cs.IT math.IT | This paper deals with the delay-throughput analysis of a single-hop wireless
network with $n$ transmitter/receiver pairs. All channels are assumed to be
block Rayleigh fading with shadowing, described by parameters
$(\alpha,\varpi)$, where $\alpha$ denotes the probability of shadowing and
$\varpi$ represents the aver... |
0910.3975 | On the Delay of Network Coding over Line Networks | cs.IT math.IT | We analyze a simple network where a source and a receiver are connected by a
line of erasure channels of different reliabilities. Recent prior work has
shown that random linear network coding can achieve the min-cut capacity and
therefore the asymptotic rate is determined by the worst link of the line
network. In thi... |
0910.4000 | Path placement optimization of manipulators based on energy consumption:
application to the orthoglide 3-axis | cs.RO | This paper deals with the optimal path placement for a manipulator based on
energy consumption. It proposes a methodology to determine the optimal location
of a given test path within the workspace of a manipulator with minimal
electric energy used by the actuators while taking into account the geometric,
kinematic a... |
0910.4012 | Singularity Analysis of Lower-Mobility Parallel Manipulators Using
Grassmann-Cayley Algebra | cs.RO | This paper introduces a methodology to analyze geometrically the
singularities of manipulators, of which legs apply both actuation forces and
constraint moments to their moving platform. Lower-mobility parallel
manipulators and parallel manipulators, of which some legs do not have any
spherical joint, are such manipu... |
0910.4033 | Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions | cs.CR cs.IT cs.LO cs.PL math.IT | When studying the information leakage in programs or protocols, a natural
question arises: "what is the worst case scenario?". This problem of
identifying the maximal leakage can be seen as a channel capacity problem in
the information theoretical sense. In this paper, by combining two powerful
theories: Information ... |
0910.4116 | Swarm Intelligence | cs.NE cs.AI | Biologically inspired computing is an area of computer science which uses the
advantageous properties of biological systems. It is the amalgamation of
computational intelligence and collective intelligence. Biologically inspired
mechanisms have already proved successful in achieving major advances in a wide
range of ... |
0910.4128 | Secure Communication in the Low-SNR Regime | cs.IT math.IT | Secrecy capacity of a multiple-antenna wiretap channel is studied in the low
signal-to-noise ratio (SNR) regime. Expressions for the first and second
derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.
Transmission strategies required to achieve these derivatives are identified.
In particu... |
0910.4130 | On the Achievable Throughput Region of Multiple-Access Fading Channels
with QoS Constraints | cs.IT math.IT | Effective capacity, which provides the maximum constant arrival rate that a
given service process can support while satisfying statistical delay
constraints, is analyzed in a multiuser scenario. In particular, we study the
achievable effective capacity region of the users in multiaccess fading
channels (MAC) in the p... |
0910.4132 | Collaborative Relay Beamforming for Secrecy | cs.IT math.IT | In this paper, collaborative use of relays to form a beamforming system with
the aid of perfect channel state information (CSI) and to provide
physical-layer security is investigated. In particular, a
decode-and-forward-based relay beamforming design subject to total and
individual relay power constraints is studied ... |
0910.4214 | Congestion games with resource reuse and applications in spectrum
sharing | cs.GT cs.MA | In this paper we consider an extension to the classical definition of
congestion games (CG) in which multiple users share the same set of resources
and their payoff for using any resource is a function of the total number of
users sharing it. The classical congestion games enjoy some very appealing
properties, includ... |
0910.4336 | Minimal realizations of linear systems: The "shortest basis" approach | cs.IT cs.SY math.IT math.OC | Given a controllable discrete-time linear system C, a shortest basis for C is
a set of linearly independent generators for C with the least possible lengths.
A basis B is a shortest basis if and only if it has the predictable span
property (i.e., has the predictable delay and degree properties, and is
non-catastrophi... |
0910.4353 | Nonapproximablity of the Normalized Information Distance | cs.CC cs.IT math.IT | Normalized information distance (NID) uses the theoretical notion of
Kolmogorov complexity, which for practical purposes is approximated by the
length of the compressed version of the file involved, using a real-world
compression program. This practical application is called `normalized
compression distance' and it i... |
0910.4397 | The Geometry of Generalized Binary Search | stat.ML cs.IT math.IT math.ST stat.TH | This paper investigates the problem of determining a binary-valued function
through a sequence of strategically selected queries. The focus is an algorithm
called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm
for determining a binary-valued function through a sequence of strategically
selected... |
0910.4613 | Fading Cognitive Multiple-Access Channels With Confidential Messages | cs.IT cs.CR math.IT | The fading cognitive multiple-access channel with confidential messages
(CMAC-CM) is investigated, in which two users attempt to transmit common
information to a destination and user 1 also has confidential information
intended for the destination. User 1 views user 2 as an eavesdropper and wishes
to keep its confide... |
0910.4624 | Convolution operations arising from Vandermonde matrices | cs.IT math.IT | Different types of convolution operations involving large Vandermonde
matrices are considered. The convolutions parallel those of large Gaussian
matrices and additive and multiplicative free convolution. First additive and
multiplicative convolution of Vandermonde matrices and deterministic diagonal
matrices are cons... |
0910.4627 | Self-concordant analysis for logistic regression | cs.LG math.ST stat.TH | Most of the non-asymptotic theoretical work in regression is carried out for
the square loss, where estimators can be obtained through closed-form
expressions. In this paper, we use and extend tools from the convex
optimization literature, namely self-concordant functions, to provide simple
extensions of theoretical ... |
0910.4632 | Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions | cs.CR cs.IT math.IT | Algebraic and fast algebraic attacks are power tools to analyze stream
ciphers. A class of symmetric Boolean functions with maximum algebraic immunity
were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the
notion of AAR (algebraic attack resistant) functions was introduced as a
unified measure... |
0910.4667 | Time Delay Estimation in Cognitive Radio Systems | cs.IT math.IT | In cognitive radio systems, secondary users can utilize multiple dispersed
bands that are not used by primary users. In this paper, time delay estimation
of signals that occupy multiple dispersed bands is studied. First, theoretical
limits on time delay estimation are reviewed. Then, two-step time delay
estimators th... |
0910.4683 | Competing with Gaussian linear experts | cs.LG | We study the problem of online regression. We prove a theoretical bound on
the square loss of Ridge Regression. We do not make any assumptions about input
vectors or outcomes. We also show that Bayesian Ridge Regression can be thought
of as an online algorithm competing with all the Gaussian linear experts.
|
0910.4686 | Moderate Deviations of the Random Riccati Equation | math.PR cs.IT math.DS math.IT math.OC | We characterize the invariant filtering measures resulting from Kalman
filtering with intermittent observations (\cite{Bruno}), where the observation
arrival is modeled as a Bernoulli process. In \cite{Riccati-weakconv}, it was
shown that there exists a $\overline{\gamma}^{\{\scriptsize{sb}}}>0$ such that
for every o... |
0910.4688 | Quickest detection in coupled systems | cs.IT math.IT | This work considers the problem of quickest detection of signals in a coupled
system of N sensors, which receive continuous sequential observations from the
environment. It is assumed that the signals, which are modeled a general Ito
processes, are coupled across sensors, but that their onset times may differ
from se... |
0910.4699 | Sum of Us: Strategyproof Selection from the Selectors | cs.GT cs.AI | We consider directed graphs over a set of n agents, where an edge (i,j) is
taken to mean that agent i supports or trusts agent j. Given such a graph and
an integer k\leq n, we wish to select a subset of k agents that maximizes the
sum of indegrees, i.e., a subset of k most popular or most trusted agents. At
the same ... |
0910.4711 | Parallelization of the LBG Vector Quantization Algorithm for Shared
Memory Systems | cs.CV cs.DC | This paper proposes a parallel approach for the Vector Quantization (VQ)
problem in image processing. VQ deals with codebook generation from the input
training data set and replacement of any arbitrary data with the nearest
codevector. Most of the efforts in VQ have been directed towards designing
parallel search alg... |
0910.4738 | On the connections between PCTL and Dynamic Programming | math.OC cs.SY | Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which
has become a standard for expressing temporal properties of finite-state Markov
chains in the context of automated model checking. In this paper, we give a
definition of PCTL for noncountable-space Markov chains, and we show that there
is a... |
0910.4769 | Enrichissement des contenus par la r\'eindexation des usagers : un
\'etat de l'art sur la probl\'ematique | cs.IR | Information retrieval (IR) is a user approach to obtain relevant information
which meets needs with the help of a IR system (IRS). However, the IRS shows
certain differences between user relevance and system relevance. These gaps are
essentially related to the imperfection of the indexing process (as approach
related... |
0910.4839 | A $p$-adic RanSaC algorithm for stereo vision using Hensel lifting | cs.CV | A $p$-adic variation of the Ran(dom) Sa(mple) C(onsensus) method for solving
the relative pose problem in stereo vision is developped. From two 2-adically
encoded images a random sample of five pairs of corresponding points is taken,
and the equations for the essential matrix are solved by lifting solutions
modulo 2 ... |
0910.4874 | K-User Fading Interference Channels: The Ergodic Very Strong Case | cs.IT math.IT | Sufficient conditions required to achieve the interference-free capacity
region of ergodic fading K-user interference channels (IFCs) are obtained. In
particular, this capacity region is shown to be achieved when every receiver
decodes all K transmitted messages such that the channel statistics and the
waterfilling p... |
0910.4899 | Artificial Immune Systems | cs.AI cs.NE | The biological immune system is a robust, complex, adaptive system that
defends the body from foreign pathogens. It is able to categorize all cells (or
molecules) within the body as self-cells or non-self cells. It does this with
the help of a distributed task force that has the intelligence to take action
from a loc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.