id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0906.5339 | Asymmetric Quantum Cyclic Codes | cs.IT cs.MS math.IT quant-ph | It is recently conjectured in quantum information processing that phase-shift
errors occur with high probability than qubit-flip errors, hence the former is
more disturbing to quantum information than the later one. This leads us to
construct asymmetric quantum error controlling codes to protect quantum
information o... |
0906.5394 | Wireless Network Information Flow: A Deterministic Approach | cs.IT math.IT | In a wireless network with a single source and a single destination and an
arbitrary number of relay nodes, what is the maximum rate of information flow
achievable? We make progress on this long standing problem through a two-step
approach. First we propose a deterministic channel model which captures the key
wireles... |
0906.5397 | Asymptotically Optimal Policies for Hard-deadline Scheduling over Fading
Channels | cs.IT math.IT | A hard-deadline, opportunistic scheduling problem in which $B$ bits must be
transmitted within $T$ time-slots over a time-varying channel is studied: the
transmitter must decide how many bits to serve in each slot based on knowledge
of the current channel but without knowledge of the channel in future slots,
with the... |
0906.5485 | Query Significance in Databases via Randomizations | cs.DB cs.AI | Many sorts of structured data are commonly stored in a multi-relational
format of interrelated tables. Under this relational model, exploratory data
analysis can be done by using relational queries. As an example, in the
Internet Movie Database (IMDb) a query can be used to check whether the average
rank of action mo... |
0906.5608 | Loading Arbitrary Knowledge Bases in Matrix Browser | cs.IR cs.DB | This paper describes the work done on Matrix Browser, which is a recently
developed graphical user interface to explore and navigate complex networked
information spaces. This approach presents a new way of navigating information
nets in windows explorer like widget. The problem on hand was how to export
arbitrary kn... |
0907.0001 | On weight distributions of perfect colorings and completely regular
codes | math.CO cs.IT math.IT | A vertex coloring of a graph is called "perfect" if for any two colors $a$
and $b$, the number of the color-$b$ neighbors of a color-$a$ vertex $x$ does
not depend on the choice of $x$, that is, depends only on $a$ and $b$ (the
corresponding partition of the vertex set is known as "equitable"). A set of
vertices is c... |
0907.0002 | On the binary codes with parameters of doubly-shortened 1-perfect codes | math.CO cs.IT math.IT | We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an
equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube
with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the
possibility to lengthen the code $C_1$ to a 1-perfect code of length $n+2$ is
equivalent... |
0907.0049 | No More Perfect Codes: Classification of Perfect Quantum Codes | quant-ph cs.IT math.IT | We solve the problem of the classification of perfect quantum codes. We prove
that the only nontrivial perfect quantum codes are those with the parameters .
There exist no other nontrivial perfect quantum codes.
|
0907.0067 | A Novel Two-Staged Decision Support based Threat Evaluation and Weapon
Assignment Algorithm, Asset-based Dynamic Weapon Scheduling using Artificial
Intelligence Techinques | cs.AI | Surveillance control and reporting (SCR) system for air threats play an
important role in the defense of a country. SCR system corresponds to air and
ground situation management/processing along with information fusion,
communication, coordination, simulation and other critical defense oriented
tasks. Threat Evaluati... |
0907.0075 | XDANNG: XML based Distributed Artificial Neural Network with Globus
Toolkit | cs.NE | Artificial Neural Network is one of the most common AI application fields.
This field has direct and indirect usages most sciences. The main goal of ANN
is to imitate biological neural networks for solving scientific problems. But
the level of parallelism is the main problem of ANN systems in comparison with
biologic... |
0907.0204 | Multi-Label MRF Optimization via Least Squares s-t Cuts | cs.CV | There are many applications of graph cuts in computer vision, e.g.
segmentation. We present a novel method to reformulate the NP-hard, k-way graph
partitioning problem as an approximate minimal s-t graph cut problem, for which
a globally optimal solution is found in polynomial time. Each non-terminal
vertex in the or... |
0907.0229 | A new model of artificial neuron: cyberneuron and its use | cs.NE cs.LG | This article describes a new type of artificial neuron, called the authors
"cyberneuron". Unlike classical models of artificial neurons, this type of
neuron used table substitution instead of the operation of multiplication of
input values for the weights. This allowed to significantly increase the
information capaci... |
0907.0255 | A Cut-off Phenomenon in Location Based Random Access Games with
Imperfect Information | cs.IT cs.GT math.IT math.PR | This paper analyzes the behavior of selfish transmitters under imperfect
location information. The scenario considered is that of a wireless network
consisting of selfish nodes that are randomly distributed over the network
domain according to a known probability distribution, and that are interested
in communicating... |
0907.0288 | An Iterative Fingerprint Enhancement Algorithm Based on Accurate
Determination of Orientation Flow | cs.CV | We describe an algorithm to enhance and binarize a fingerprint image. The
algorithm is based on accurate determination of orientation flow of the ridges
of the fingerprint image by computing variance of the neighborhood pixels
around a pixel in different directions. We show that an iterative algorithm
which captures ... |
0907.0328 | Degenerate neutrality creates evolvable fitness landscapes | cs.NE cs.AI cs.MA | Understanding how systems can be designed to be evolvable is fundamental to
research in optimization, evolution, and complex systems science. Many
researchers have thus recognized the importance of evolvability, i.e. the
ability to find new variants of higher fitness, in the fields of biological
evolution and evoluti... |
0907.0329 | Evidence of coevolution in multi-objective evolutionary algorithms | cs.NE cs.AI | This paper demonstrates that simple yet important characteristics of
coevolution can occur in evolutionary algorithms when only a few conditions are
met. We find that interaction-based fitness measurements such as fitness
(linear) ranking allow for a form of coevolutionary dynamics that is observed
when 1) changes ar... |
0907.0332 | Survival of the flexible: explaining the recent dominance of
nature-inspired optimization within a rapidly evolving world | cs.NE cs.AI | Although researchers often comment on the rising popularity of
nature-inspired meta-heuristics (NIM), there has been a paucity of data to
directly support the claim that NIM are growing in prominence compared to other
optimization techniques. This study presents evidence that the use of NIM is
not only growing, but i... |
0907.0334 | The Self-Organization of Interaction Networks for Nature-Inspired
Optimization | cs.NE cs.AI | Over the last decade, significant progress has been made in understanding
complex biological systems, however there have been few attempts at
incorporating this knowledge into nature inspired optimization algorithms. In
this paper, we present a first attempt at incorporating some of the basic
structural properties of... |
0907.0340 | Strategic Positioning in Tactical Scenario Planning | cs.NE cs.AI | Capability planning problems are pervasive throughout many areas of human
interest with prominent examples found in defense and security. Planning
provides a unique context for optimization that has not been explored in great
detail and involves a number of interesting challenges which are distinct from
traditional o... |
0907.0418 | Bounding the Probability of Error for High Precision Recognition | cs.CV | We consider models for which it is important, early in processing, to
estimate some variables with high precision, but perhaps at relatively low
rates of recall. If some variables can be identified with near certainty, then
they can be conditioned upon, allowing further inference to be done
efficiently. Specifically,... |
0907.0453 | Random DFAs are Efficiently PAC Learnable | cs.LG | This paper has been withdrawn due to an error found by Dana Angluin and Lev
Reyzin.
|
0907.0472 | Capacity Regions and Sum-Rate Capacities of Vector Gaussian Interference
Channels | cs.IT math.IT | The capacity regions of vector, or multiple-input multiple-output, Gaussian
interference channels are established for very strong interference and aligned
strong interference. Furthermore, the sum-rate capacities are established for Z
interference, noisy interference, and mixed (aligned weak/intermediate and
aligned ... |
0907.0499 | Agent-Oriented Approach for Detecting and Managing Risks in Emergency
Situations | cs.AI cs.MA | This paper presents an agent-oriented approach to build a decision support
system aimed at helping emergency managers to detect and to manage risks. We
stress the flexibility and the adaptivity characteristics that are crucial to
build a robust and efficient system, able to resolve complex problems. The
system should... |
0907.0505 | Multi-User MISO Interference Channels with Single-User Detection:
Optimality of Beamforming and the Achievable Rate Region | cs.IT math.IT | For a multi-user interference channel with multi-antenna transmitters and
single-antenna receivers, by restricting each transmitter to Gaussian input and
each receiver to a single-user detector, computing the largest achievable rate
region amounts to solving a family of non-convex optimization problems.
Recognizing t... |
0907.0507 | Spontaneous organization leads to robustness in evolutionary algorithms | cs.NE cs.AI | The interaction networks of biological systems are known to take on several
non-random structural properties, some of which are believed to positively
influence system robustness. Researchers are only starting to understand how
these structural properties emerge, however suggested roles for component
fitness and comm... |
0907.0516 | Adaptation and Self-Organization in Evolutionary Algorithms | cs.NE | Abbreviated Abstract: The objective of Evolutionary Computation is to solve
practical problems (e.g. optimization, data mining) by simulating the
mechanisms of natural evolution. This thesis addresses several topics related
to adaptation and self-organization in evolving systems with the overall aims
of improving the... |
0907.0520 | Computational Scenario-based Capability Planning | cs.NE cs.AI | Scenarios are pen-pictures of plausible futures, used for strategic planning.
The aim of this investigation is to expand the horizon of scenario-based
planning through computational models that are able to aid the analyst in the
planning process. The investigation builds upon the advances of Information and
Communica... |
0907.0589 | Generalized Collective Inference with Symmetric Clique Potentials | cs.AI | Collective graphical models exploit inter-instance associative dependence to
output more accurate labelings. However existing models support very limited
kind of associativity which restricts accuracy gains. This paper makes two
major contributions. First, we propose a general collective inference framework
that bias... |
0907.0592 | Credit Assignment in Adaptive Evolutionary Algorithms | cs.NE cs.AI | In this paper, a new method for assigning credit to search operators is
presented. Starting with the principle of optimizing search bias, search
operators are selected based on an ability to create solutions that are
historically linked to future generations. Using a novel framework for defining
performance measureme... |
0907.0595 | Use of statistical outlier detection method in adaptive evolutionary
algorithms | cs.NE cs.AI | In this paper, the issue of adapting probabilities for Evolutionary Algorithm
(EA) search operators is revisited. A framework is devised for distinguishing
between measurements of performance and the interpretation of those
measurements for purposes of adaptation. Several examples of measurements and
statistical inte... |
0907.0597 | Network Topology and Time Criticality Effects in the Modularised Fleet
Mix Problem | cs.NE cs.AI | In this paper, we explore the interplay between network topology and time
criticality in a military logistics system. A general goal of this work (and
previous work) is to evaluate land transportation requirements or, more
specifically, how to design appropriate fleets of military general service
vehicles that are ta... |
0907.0598 | Robustness and Adaptiveness Analysis of Future Fleets | cs.NE cs.AI | Making decisions about the structure of a future military fleet is a
challenging task. Several issues need to be considered such as the existence of
multiple competing objectives and the complexity of the operating environment.
A particular challenge is posed by the various types of uncertainty that the
future might ... |
0907.0611 | A process planning system with feature based neural network search
strategy for aluminum extrusion die manufacturing | cs.NE | Aluminum extrusion die manufacturing is a critical task for productive
improvement and increasing potential of competition in aluminum extrusion
industry. It causes to meet the efficiency not only consistent quality but also
time and production cost reduction. Die manufacturing consists first of die
design and proces... |
0907.0725 | High-Rate Full-Diversity Space-Time Block Codes for Three and Four
Transmit Antennas | cs.IT math.IT | In this paper, we deal with the design of high-rate, full-diversity, low
maximum likelihood (ML) decoding complexity space-time block codes (STBCs) with
code rates of 2 and 1.5 complex symbols per channel use for multiple-input
multiple output (MIMO) systems employing three and four transmit antennas. We
fill the emp... |
0907.0746 | Open Problems in Universal Induction & Intelligence | cs.AI cs.IT cs.LG math.IT | Specialized intelligent systems can be found everywhere: finger print,
handwriting, speech, and face recognition, spam filtering, chess and other game
programs, robots, et al. This decade the first presumably complete mathematical
theory of artificial intelligence based on universal
induction-prediction-decision-acti... |
0907.0748 | Gossip consensus algorithms via quantized communication | math.OC cs.SY | This paper considers the average consensus problem on a network of digital
links, and proposes a set of algorithms based on pairwise ''gossip''
communications and updates. We study the convergence properties of such
algorithms with the goal of answering two design questions, arising from the
literature: whether the a... |
0907.0783 | Bayesian Multitask Learning with Latent Hierarchies | cs.LG | We learn multiple hypotheses for related tasks under a latent hierarchical
relationship between tasks. We exploit the intuition that for domain
adaptation, we wish to share classifier structure, but for multitask learning,
we wish to share covariance structure. Our hierarchical model is seen to
subsume several previo... |
0907.0784 | Cross-Task Knowledge-Constrained Self Training | cs.LG cs.CL | We present an algorithmic framework for learning multiple related tasks. Our
framework exploits a form of prior knowledge that relates the output spaces of
these tasks. We present PAC learning results that analyze the conditions under
which such learning is possible. We present results on learning a shallow
parser an... |
0907.0785 | A Bayesian Model for Discovering Typological Implications | cs.CL | A standard form of analysis for linguistic typology is the universal
implication. These implications state facts about the range of extant
languages, such as ``if objects come after verbs, then adjectives come after
nouns.'' Such implications are typically discovered by painstaking hand
analysis over a small sample o... |
0907.0786 | Search-based Structured Prediction | cs.LG cs.CL | We present Searn, an algorithm for integrating search and learning to solve
complex structured prediction problems such as those that occur in natural
language, speech, computational biology, and vision. Searn is a meta-algorithm
that transforms these complex problems into simple classification problems to
which any ... |
0907.0804 | Induction of Word and Phrase Alignments for Automatic Document
Summarization | cs.CL | Current research in automatic single document summarization is dominated by
two effective, yet naive approaches: summarization by sentence extraction, and
headline generation via bag-of-words models. While successful in some tasks,
neither of these models is able to adequately capture the large set of
linguistic devi... |
0907.0806 | A Noisy-Channel Model for Document Compression | cs.CL | We present a document compression system that uses a hierarchical
noisy-channel model of text production. Our compression system first
automatically derives the syntactic structure of each sentence and the overall
discourse structure of the text given as input. The system then uses a
statistical hierarchical model of... |
0907.0807 | A Large-Scale Exploration of Effective Global Features for a Joint
Entity Detection and Tracking Model | cs.CL | Entity detection and tracking (EDT) is the task of identifying textual
mentions of real-world entities in documents, extending the named entity
detection and coreference resolution task by considering mentions other than
names (pronouns, definite descriptions, etc.). Like NE tagging and coreference
resolution, most s... |
0907.0808 | A Bayesian Model for Supervised Clustering with the Dirichlet Process
Prior | cs.LG | We develop a Bayesian framework for tackling the supervised clustering
problem, the generic problem encountered in tasks such as reference matching,
coreference resolution, identity uncertainty and record linkage. Our clustering
model is based on the Dirichlet process prior, which enables us to define
distributions o... |
0907.0809 | Learning as Search Optimization: Approximate Large Margin Methods for
Structured Prediction | cs.LG cs.CL | Mappings to structured output spaces (strings, trees, partitions, etc.) are
typically learned using extensions of classification algorithms to simple
graphical structures (eg., linear chains) in which search and parameter
estimation can be performed exactly. Unfortunately, in many complex problems,
it is rare that ex... |
0907.0914 | A typical reconstruction limit of compressed sensing based on Lp-norm
minimization | cs.IT cond-mat.dis-nn math.IT math.ST stat.TH | We consider the problem of reconstructing an $N$-dimensional continuous
vector $\bx$ from $P$ constraints which are generated by its linear
transformation under the assumption that the number of non-zero elements of
$\bx$ is typically limited to $\rho N$ ($0\le \rho \le 1$). Problems of this
type can be solved by min... |
0907.0931 | Distributed Sensor Selection using a Truncated Newton Method | cs.IT math.IT | We propose a new distributed algorithm for computing a truncated Newton
method, where the main diagonal of the Hessian is computed using belief
propagation. As a case study for this approach, we examine the sensor selection
problem, a Boolean convex optimization problem. We form two distributed
algorithms. The first ... |
0907.0939 | The Soft Cumulative Constraint | cs.AI | This research report presents an extension of Cumulative of Choco constraint
solver, which is useful to encode over-constrained cumulative problems. This
new global constraint uses sweep and task interval violation-based algorithms.
|
0907.0944 | Spread spectrum for imaging techniques in radio interferometry | astro-ph.IM cs.IT math.IT | We consider the probe of astrophysical signals through radio interferometers
with small field of view and baselines with non-negligible and constant
component in the pointing direction. In this context, the visibilities measured
essentially identify with a noisy and incomplete Fourier coverage of the
product of the p... |
0907.1005 | A class of structured P2P systems supporting browsing | cs.IR cs.DC | Browsing is a way of finding documents in a large amount of data which is
complementary to querying and which is particularly suitable for multimedia
documents. Locating particular documents in a very large collection of
multimedia documents such as the ones available in peer to peer networks is a
difficult task. How... |
0907.1012 | Apply Local Clustering Method to Improve the Running Speed of Ant Colony
Optimization | cs.NE cs.AI | Ant Colony Optimization (ACO) has time complexity O(t*m*N*N), and its typical
application is to solve Traveling Salesman Problem (TSP), where t, m, and N
denotes the iteration number, number of ants, number of cities respectively.
Cutting down running time is one of study focuses, and one way is to decrease
parameter... |
0907.1054 | Learning Gaussian Mixtures with Arbitrary Separation | cs.LG cs.DS | In this paper we present a method for learning the parameters of a mixture of
$k$ identical spherical Gaussians in $n$-dimensional space with an arbitrarily
small separation between the components. Our algorithm is polynomial in all
parameters other than $k$. The algorithm is based on an appropriate grid search
over ... |
0907.1061 | Boolean Compressed Sensing and Noisy Group Testing | cs.IT math.IT | The fundamental task of group testing is to recover a small distinguished
subset of items from a large population while efficiently reducing the total
number of tests (measurements). The key contribution of this paper is in
adopting a new information-theoretic perspective on group testing problems. We
formulate the g... |
0907.1065 | Design of an Optimal Bayesian Incentive Compatible Broadcast Protocol
for Ad hoc Networks with Rational Nodes | cs.GT cs.AI cs.DC cs.NI | Nodes in an ad hoc wireless network incur certain costs for forwarding
packets since packet forwarding consumes the resources of the nodes. If the
nodes are rational, free packet forwarding by the nodes cannot be taken for
granted and incentive based protocols are required to stimulate cooperation
among the nodes. Ex... |
0907.1072 | Self-Assembling Systems are Distributed Systems | cs.FL cs.DC cs.RO | In 2004, Klavins et al. introduced the use of graph grammars to describe --
and to program -- systems of self-assembly. We show that these graph grammars
can be embedded in a graph rewriting characterization of distributed systems
that was proposed by Degano and Montanari over twenty years ago. We apply this
embeddin... |
0907.1099 | Multi-User Diversity vs. Accurate Channel State Information in MIMO
Downlink Channels | cs.IT math.IT | In a multiple transmit antenna, single antenna per receiver downlink channel
with limited channel state feedback, we consider the following question: given
a constraint on the total system-wide feedback load, is it preferable to get
low-rate/coarse channel feedback from a large number of receivers or
high-rate/high-q... |
0907.1201 | Generating Product Systems | math.DS cs.IT math.IT | Generalizing Krieger's finite generation theorem, we give conditions for an
ergodic system to be generated by a pair of partitions, each required to be
measurable with respect to a given sub-algebra, and also required to have a
fixed size.
|
0907.1224 | Effect of user tastes on personalized recommendation | physics.data-an cs.IR physics.soc-ph | In this paper, based on a weighted projection of the user-object bipartite
network, we study the effects of user tastes on the mass-diffusion-based
personalized recommendation algorithm, where a user's tastes or interests are
defined by the average degree of the objects he has collected. We argue that
the initial rec... |
0907.1228 | Degree correlation effect of bipartite network on personalized
recommendation | physics.data-an cs.IR physics.soc-ph | In this paper, by introducing a new user similarity index base on the
diffusion process, we propose a modified collaborative filtering (MCF)
algorithm, which has remarkably higher accuracy than the standard collaborative
filtering. In the proposed algorithm, the degree correlation between users and
objects is taken i... |
0907.1245 | How Controlled English can Improve Semantic Wikis | cs.HC cs.AI | The motivation of semantic wikis is to make acquisition, maintenance, and
mining of formal knowledge simpler, faster, and more flexible. However, most
existing semantic wikis have a very technical interface and are restricted to a
relatively low level of expressivity. In this paper, we explain how AceWiki
uses contro... |
0907.1255 | From Spectrum Pooling to Space Pooling: Opportunistic Interference
Alignment in MIMO Cognitive Networks | cs.IT math.IT | We describe a non-cooperative interference alignment (IA) technique which
allows an opportunistic multiple input multiple output (MIMO) link (secondary)
to harmlessly coexist with another MIMO link (primary) in the same frequency
band. Assuming perfect channel knowledge at the primary receiver and
transmitter, capaci... |
0907.1266 | Distributed Random Access Algorithm: Scheduling and Congesion Control | cs.IT cs.NI math.IT math.PR | This paper provides proofs of the rate stability, Harris recurrence, and
epsilon-optimality of CSMA algorithms where the backoff parameter of each node
is based on its backlog. These algorithms require only local information and
are easy to implement.
The setup is a network of wireless nodes with a fixed conflict g... |
0907.1413 | Privacy constraints in regularized convex optimization | cs.CR cs.DB cs.LG | This paper is withdrawn due to some errors, which are corrected in
arXiv:0912.0071v4 [cs.LG].
|
0907.1432 | Reciprocity in Linear Deterministic Networks under Linear Coding | cs.IT math.IT | The linear deterministic model has been used recently to get a first order
understanding of many wireless communication network problems. In many of these
cases, it has been pointed out that the capacity regions of the network and its
reciprocal (where the communication links are reversed and the roles of the
sources... |
0907.1523 | Theoretical Performance Analysis of Eigenvalue-based Detection | cs.IT math.IT | In this paper we develop a complete analytical framework based on Random
Matrix Theory for the performance evaluation of Eigenvalue-based Detection.
While, up to now, analysis was limited to false-alarm probability, we have
obtained an analytical expression also for the probability of missed detection,
by using the t... |
0907.1545 | Augmenting Light Field to model Wave Optics effects | cs.CV | The ray-based 4D light field representation cannot be directly used to
analyze diffractive or phase--sensitive optical elements. In this paper, we
exploit tools from wave optics and extend the light field representation via a
novel "light field transform". We introduce a key modification to the
ray--based model to su... |
0907.1558 | Towards the quantification of the semantic information encoded in
written language | physics.soc-ph cs.CL physics.data-an | Written language is a complex communication signal capable of conveying
information encoded in the form of ordered sequences of words. Beyond the local
order ruled by grammar, semantic and thematic structures affect long-range
patterns in word usage. Here, we show that a direct application of information
theory quant... |
0907.1597 | Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes | cs.IT cs.NE math.IT | We show how the necessary and sufficient conditions for the NFL to apply can
be reduced to the single requirement of the set of objective functions under
consideration being closed under permutation, and quantify the extent to which
a set of objectives not closed under permutation can give rise to a performance
diffe... |
0907.1632 | Incorporating Integrity Constraints in Uncertain Databases | cs.DB cs.IR | We develop an approach to incorporate additional knowledge, in the form of
general purpose integrity constraints (ICs), to reduce uncertainty in
probabilistic databases. While incorporating ICs improves data quality (and
hence quality of answers to a query), it significantly complicates query
processing. To overcome ... |
0907.1721 | Distributed Function Computation in Asymmetric Communication Scenarios | cs.IT math.IT | We consider the distributed function computation problem in asymmetric
communication scenarios, where the sink computes some deterministic function of
the data split among N correlated informants. The distributed function
computation problem is addressed as a generalization of distributed source
coding (DSC) problem.... |
0907.1723 | Worst-case Compressibility of Discrete and Finite Distributions | cs.IT math.IT | In the worst-case distributed source coding (DSC) problem of [1], the smaller
cardinality of the support-set describing the correlation in informant data,
may neither imply that fewer informant bits are required nor that fewer
informants need to be queried, to finish the data-gathering at the sink. It is
important to... |
0907.1728 | Role of Weak Ties in Link Prediction of Complex Networks | cs.IR | Plenty of algorithms for link prediction have been proposed and were applied
to various real networks. Among these works, the weights of links are rarely
taken into account. In this paper, we use local similarity indices to estimate
the likelihood of the existence of links in weighted networks, including Common
Neigh... |
0907.1737 | Throughput Improvement and Its Tradeoff with The Queuing Delay in the
Diamond Relay Networks | cs.IT math.IT | Diamond relay channel model, as a basic transmission model, has recently been
attracting considerable attention in wireless Ad Hoc networks. Node cooperation
and opportunistic scheduling scheme are two important techniques to improve the
performance in wireless scenarios. In the paper we consider such a problem how
t... |
0907.1739 | Efficient Signal-Time Coding Design and its Application in Wireless
Gaussian Relay Networks | cs.IT math.IT | Signal-time coding, which combines the traditional encoding/modulation mode
in the signal domain with signal pulse phase modulation in the time domain, was
proposed to improve the information flow rate in relay networks. In this paper,
we mainly focus on the efficient signal-time coding design. We first derive an
exp... |
0907.1788 | FNT-based Reed-Solomon Erasure Codes | cs.IT math.IT | This paper presents a new construction of Maximum-Distance Separable (MDS)
Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to
FNT, these codes support practical coding and decoding algorithms with
complexity O(n log n), where n is the number of symbols of a codeword. An
open-source implement... |
0907.1812 | Fast search for Dirichlet process mixture models | cs.LG | Dirichlet process (DP) mixture models provide a flexible Bayesian framework
for density estimation. Unfortunately, their flexibility comes at a cost:
inference in DP mixture models is computationally expensive, even when
conjugate distributions are used. In the common case when one seeks only a
maximum a posteriori a... |
0907.1814 | Bayesian Query-Focused Summarization | cs.CL cs.IR cs.LG | We present BayeSum (for ``Bayesian summarization''), a model for sentence
extraction in query-focused summarization. BayeSum leverages the common case in
which multiple documents are relevant to a single query. Using these documents
as reinforcement for query terms, BayeSum is not afflicted by the paucity of
informat... |
0907.1815 | Frustratingly Easy Domain Adaptation | cs.LG cs.CL | We describe an approach to domain adaptation that is appropriate exactly in
the case when one has enough ``target'' data to do slightly better than just
using only ``source'' data. Our approach is incredibly simple, easy to
implement as a preprocessing step (10 lines of Perl!) and outperforms
state-of-the-art approac... |
0907.1839 | An Evolved Neural Controller for Bipdedal Walking with Dynamic Balance | cs.NE cs.RO | We successfully evolved a neural network controller that produces dynamic
walking in a simulated bipedal robot with compliant actuators, a difficult
control problem. The evolutionary evaluation uses a detailed software
simulation of a physical robot. We describe: 1) a novel theoretical method to
encourage populations... |
0907.1888 | Compressive Sensing for Feedback Reduction in MIMO Broadcast Channels | cs.IT math.IT | We propose a generalized feedback model and compressive sensing based
opportunistic feedback schemes for feedback resource reduction in MIMO
Broadcast Channels under the assumption that both uplink and downlink channels
undergo block Rayleigh fading. Feedback resources are shared and are
opportunistically accessed by... |
0907.1916 | Learning Equilibria in Games by Stochastic Distributed Algorithms | cs.GT cs.LG | We consider a class of fully stochastic and fully distributed algorithms,
that we prove to learn equilibria in games.
Indeed, we consider a family of stochastic distributed dynamics that we prove
to converge weakly (in the sense of weak convergence for probabilistic
processes) towards their mean-field limit, i.e an... |
0907.1925 | Modeling self-organizing traffic lights with elementary cellular
automata | nlin.CG cond-mat.stat-mech cs.AI nlin.AO | There have been several highway traffic models proposed based on cellular
automata. The simplest one is elementary cellular automaton rule 184. We extend
this model to city traffic with cellular automata coupled at intersections
using only rules 184, 252, and 136. The simplicity of the model offers a clear
understand... |
0907.1956 | Zero-error feedback capacity via dynamic programming | cs.IT math.IT | In this paper, we study the zero-error capacity for finite state channels
with feedback when channel state information is known to both the transmitter
and the receiver. We prove that the zero-error capacity in this case can be
obtained through the solution of a dynamic programming problem. Each iteration
of the dyna... |
0907.1975 | On semifast Fourier transform algorithms | cs.IT math.IT | We consider the relations between well-known Fourier transform algorithms.
|
0907.1978 | BPDMN: A Conservative Extension of BPMN with Enhanced Data
Representation Capabilities | cs.SE cs.DB | The design of business processes involves the usage of modeling languages,
tools and methodologies. In this paper we highlight and address a relevant
limitation of the Business Process Modeling Notation (BPMN): its weak data
representation capabilities. In particular, we extend it with data-specific
constructs derive... |
0907.1990 | Automated Protein Structure Classification: A Survey | cs.CE q-bio.BM | Classification of proteins based on their structure provides a valuable
resource for studying protein structure, function and evolutionary
relationships. With the rapidly increasing number of known protein structures,
manual and semi-automatic classification is becoming ever more difficult and
prohibitively slow. The... |
0907.1992 | Spectrum sensing by cognitive radios at very low SNR | cs.IT math.IT | Spectrum sensing is one of the enabling functionalities for cognitive radio
(CR) systems to operate in the spectrum white space. To protect the primary
incumbent users from interference, the CR is required to detect incumbent
signals at very low signal-to-noise ratio (SNR). In this paper, we present a
spectrum sensin... |
0907.2049 | Strategyproof Approximation Mechanisms for Location on Networks | cs.GT cs.MA | We consider the problem of locating a facility on a network, represented by a
graph. A set of strategic agents have different ideal locations for the
facility; the cost of an agent is the distance between its ideal location and
the facility. A mechanism maps the locations reported by the agents to the
location of the... |
0907.2075 | Multiresolution Elastic Medical Image Registration in Standard Intensity
Scale | cs.CV | Medical image registration is a difficult problem. Not only a registration
algorithm needs to capture both large and small scale image deformations, it
also has to deal with global and local image intensity variations. In this
paper we describe a new multiresolution elastic image registration method that
challenges t... |
0907.2079 | An Augmented Lagrangian Approach for Sparse Principal Component Analysis | math.OC cs.LG math.ST stat.AP stat.CO stat.ME stat.ML stat.TH | Principal component analysis (PCA) is a widely used technique for data
analysis and dimension reduction with numerous applications in science and
engineering. However, the standard PCA suffers from the fact that the principal
components (PCs) are usually linear combinations of all the original variables,
and it is th... |
0907.2089 | Fast In-Memory XPath Search over Compressed Text and Tree Indexes | cs.DB cs.IR | A large fraction of an XML document typically consists of text data. The
XPath query language allows text search via the equal, contains, and
starts-with predicates. Such predicates can efficiently be implemented using a
compressed self-index of the document's text nodes. Most queries, however,
contain some parts of ... |
0907.2090 | Some bounds on the capacity of communicating the sum of sources | cs.IT math.IT | We consider directed acyclic networks with multiple sources and multiple
terminals where each source generates one i.i.d. random process over an abelian
group and all the terminals want to recover the sum of these random processes.
The different source processes are assumed to be independent. The solvability
of such ... |
0907.2093 | Distributed Opportunistic Scheduling With Two-Level Probing | cs.IT math.IT | Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc
networks in which many links contend for the channel using random access before
data transmissions. Simply put, DOS involves a process of joint channel probing
and distributed scheduling for ad-hoc (peer-to-peer) communications. Since, in
pract... |
0907.2209 | Related terms search based on WordNet / Wiktionary and its application
in Ontology Matching | cs.IR | A set of ontology matching algorithms (for finding correspondences between
concepts) is based on a thesaurus that provides the source data for the
semantic distance calculations. In this wiki era, new resources may spring up
and improve this kind of semantic search. In the paper a solution of this task
based on Russi... |
0907.2210 | On the philosophy of Cram\'er-Rao-Bhattacharya Inequalities in Quantum
Statistics | math.PR cs.IT math.IT math.ST stat.TH | To any parametric family of states of a finite level quantum system we
associate a space of Fisher maps and introduce the natural notions of
Cram\'er-Rao-Bhattacharya tensor and Fisher information form. This leads us to
an abstract Cram\'er-Rao-Bhattacharya lower bound for the covariance matrix of
any finite number o... |
0907.2222 | Network-aware Adaptation with Real-Time Channel Statistics for Wireless
LAN Multimedia Transmissions in the Digital Home | cs.NI cs.LG | This paper suggests the use of intelligent network-aware processing agents in
wireless local area network drivers to generate metrics for bandwidth
estimation based on real-time channel statistics to enable wireless multimedia
application adaptation. Various configurations in the wireless digital home are
studied and... |
0907.2268 | Evaluating Methods to Rediscover Missing Web Pages from the Web
Infrastructure | cs.IR cs.DL | Missing web pages (pages that return the 404 "Page Not Found" error) are part
of the browsing experience. The manual use of search engines to rediscover
missing pages can be frustrating and unsuccessful. We compare four automated
methods for rediscovering web pages. We extract the page's title, generate the
page's le... |
0907.2309 | Protocols and Performance Limits for Half-Duplex Relay Networks | cs.IT math.IT | In this paper, protocols for the half-duplex relay channel are introduced and
performance limits are analyzed. Relay nodes underly an orthogonality
constraint, which prohibits simultaneous receiving and transmitting on the same
time-frequency resource. Based upon this practical consideration, different
protocols are ... |
0907.2315 | Hard Fault Analysis of Trivium | cs.CR cs.IT math.IT | Fault analysis is a powerful attack to stream ciphers. Up to now, the major
idea of fault analysis is to simplify the cipher system by injecting some soft
faults. We call it soft fault analysis. As a hardware-oriented stream cipher,
Trivium is weak under soft fault analysis.
In this paper we consider another type o... |
0907.2391 | Optimal Diversity-Multiplexing Tradeoff in Selective-Fading MIMO
Channels | cs.IT math.IT | We establish the optimal diversity-multiplexing (DM) tradeoff of coherent
time, frequency, and time-frequency selective-fading multiple-input
multiple-output (MIMO) channels and provide a code design criterion for DM
tradeoff optimality. Our results are based on the new concept of the "Jensen
channel" associated to a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.