id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0806.4648 | An Algebraic Approach for the MIMO Control of Small Scale Helicopter | cs.RO | The control of small-scale helicopter is a MIMO problem. To use of classical
control approach to formally solve a MIMO problem, one needs to come up with
multidimensional Root Locus diagram to tune the control parameters. The problem
with the required dimension of the RL diagram for MIMO design has forced the
design ... |
0806.4650 | Structural Damage Detection Using Randomized Trained Neural Networks | cs.NE | A computationally method on damage detection problems in structures was
conducted using neural networks. The problem that is considered in this works
consists of estimating the existence, location and extent of stiffness
reduction in structure which is indicated by the changes of the structural
static parameters such... |
0806.4652 | A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF
Satisfiability | cs.DS cs.AI cs.CC | We study random instances of the weighted $d$-CNF satisfiability problem
(WEIGHTED $d$-SAT), a generic W[1]-complete problem. A random instance of the
problem consists of a fixed parameter $k$ and a random $d$-CNF formula
$\weicnf{n}{p}{k, d}$ generated as follows: for each subset of $d$ variables
and with probabilit... |
0806.4667 | Overlaid Cellular and Mobile Ad Hoc Networks | cs.IT math.IT | In cellular systems using frequency division duplex, growing Internet
services cause unbalance of uplink and downlink traffic, resulting in poor
uplink spectrum utilization. Addressing this issue, this paper considers
overlaying an ad hoc network onto a cellular uplink network for improving
spectrum utilization and s... |
0806.4686 | Sparse Online Learning via Truncated Gradient | cs.LG cs.AI | We propose a general method called truncated gradient to induce sparsity in
the weights of online learning algorithms with convex loss functions. This
method has several essential properties: The degree of sparsity is continuous
-- a parameter controls the rate of sparsification from no sparsification to
total sparsi... |
0806.4703 | Challenging More Updates: Towards Anonymous Re-publication of Fully
Dynamic Datasets | cs.DB | Most existing anonymization work has been done on static datasets, which have
no update and need only one-time publication. Recent studies consider
anonymizing dynamic datasets with external updates: the datasets are updated
with record insertions and/or deletions. This paper addresses a new problem:
anonymous re-pub... |
0806.4722 | Malleable Coding: Compressed Palimpsests | cs.IT math.IT | A malleable coding scheme considers not only compression efficiency but also
the ease of alteration, thus encouraging some form of recycling of an old
compressed version in the formation of a new one. Malleability cost is the
difficulty of synchronizing compressed versions, and malleable codes are of
particular inter... |
0806.4737 | On the Multiplexing Gain of K-user Partially Connected Interference
Channel | cs.IT math.IT | The multiplexing gain (MUXG) of $K$-user interference channel (IC) with
partially connected interfering links is analyzed. The motivation for the
partially connected IC comes from the fact that not all interferences are
equally strong in practice. The MUXG is characterized as a function of the
number ($K$) of users a... |
0806.4749 | Nested Ordered Sets and their Use for Data Modelling | cs.DB | In this paper we present a new approach to data modelling, called the
concept-oriented model (CoM), and describe its main features and
characteristics including data semantics and operations. The distinguishing
feature of this model is that it is based on the formalism of nested ordered
sets where any element partici... |
0806.4773 | Signal Codes | cs.IT math.IT | Motivated by signal processing, we present a new class of channel codes,
called signal codes, for continuous-alphabet channels. Signal codes are lattice
codes whose encoding is done by convolving an integer information sequence with
a fixed filter pattern. Decoding is based on the bidirectional sequential stack
decod... |
0806.4787 | Locality and Bounding-Box Quality of Two-Dimensional Space-Filling
Curves | cs.CG cs.DB | Space-filling curves can be used to organise points in the plane into
bounding-box hierarchies (such as R-trees). We develop measures of the
bounding-box quality of space-filling curves that express how effective
different space-filling curves are for this purpose. We give general lower
bounds on the bounding-box qua... |
0806.4802 | A new Hedging algorithm and its application to inferring latent random
variables | cs.GT cs.AI | We present a new online learning algorithm for cumulative discounted gain.
This learning algorithm does not use exponential weights on the experts.
Instead, it uses a weighting scheme that depends on the regret of the master
algorithm relative to the experts. In particular, experts whose discounted
cumulative gain is... |
0806.4874 | Myopic Coding in Multiterminal Networks | cs.IT math.IT | This paper investigates the interplay between cooperation and achievable
rates in multi-terminal networks. Cooperation refers to the process of nodes
working together to relay data toward the destination. There is an inherent
tradeoff between achievable information transmission rates and the level of
cooperation, whi... |
0806.4899 | A Dynamic Programming Approach To Length-Limited Huffman Coding | cs.DS cs.IT math.IT | The ``state-of-the-art'' in Length Limited Huffman Coding algorithms is the
$\Theta(ND)$-time, $\Theta(N)$-space one of Hirschberg and Larmore, where $D\le
N$ is the length restriction on the code. This is a very clever, very problem
specific, technique. In this note we show that there is a simple
Dynamic-Programming... |
0806.4920 | Conception et Evaluation de XQuery dans une architecture de m\'ediation
"Tout-XML" | cs.DB | XML has emerged as the leading language for representing and exchanging data
not only on the Web, but also in general in the enterprise. XQuery is emerging
as the standard query language for XML. Thus, tools are required to mediate
between XML queries and heterogeneous data sources to integrate data in XML.
This pape... |
0806.4921 | Interpr\'etation vague des contraintes structurelles pour la RI dans des
corpus de documents XML - \'Evaluation d'une m\'ethode approch\'ee de RI
structur\'ee | cs.IR | We propose specific data structures designed to the indexing and retrieval of
information elements in heterogeneous XML data bases. The indexing scheme is
well suited to the management of various contextual searches, expressed either
at a structural level or at an information content level. The approximate
search mec... |
0806.4958 | Deterministic Designs with Deterministic Guarantees: Toeplitz Compressed
Sensing Matrices, Sequence Designs and System Identification | cs.IT math.IT | In this paper we present a new family of discrete sequences having "random
like" uniformly decaying auto-correlation properties. The new class of infinite
length sequences are higher order chirps constructed using irrational numbers.
Exploiting results from the theory of continued fractions and diophantine
approximat... |
0806.4979 | Bounds on Codes Based on Graph Theory | cs.IT math.IT | Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a
$q$-ary code of length $n$ and Hamming distance at least $d$. And let
$A(n,d,w)$ that of a binary code of constant weight $w$. Building on results
from algebraic graph theory and Erd\H{o}s-ko-Rado like theorems in extremal
combinatorics, we show h... |
0807.0023 | Automatic Metadata Generation using Associative Networks | cs.IR cs.DL | In spite of its tremendous value, metadata is generally sparse and
incomplete, thereby hampering the effectiveness of digital information
services. Many of the existing mechanisms for the automated creation of
metadata rely primarily on content analysis which can be costly and
inefficient. The automatic metadata gene... |
0807.0042 | A Simple Converse Proof and a Unified Capacity Formula for Channels with
Input Constraints | cs.IT math.IT | Given the single-letter capacity formula and the converse proof of a channel
without constraints, we provide a simple approach to extend the results for the
same channel but with constraints. The resulting capacity formula is the
minimum of a Lagrange dual function. It gives an unified formula in the sense
that it wo... |
0807.0070 | Quantitative Paradigm of Software Reliability as Content Relevance | cs.SE cs.IR | This paper presents a quantitative approach to software reliability and
content relevance definitions validated by the systems' potential reliability
law.Thus it is argued for the unified math nature or quantitative paradigm of
software reliability and content relevance.
|
0807.0087 | Path lengths in tree-child time consistent hybridization networks | q-bio.PE cs.CE cs.DM q-bio.QM | Hybridization networks are representations of evolutionary histories that
allow for the inclusion of reticulate events like recombinations,
hybridizations, or lateral gene transfers. The recent growth in the number of
hybridization network reconstruction algorithms has led to an increasing
interest in the definition ... |
0807.0093 | Graph Kernels | cs.LG | We present a unified framework to study graph kernels, special cases of which
include the random walk graph kernel \citep{GaeFlaWro03,BorOngSchVisetal05},
marginalized graph kernel \citep{KasTsuIno03,KasTsuIno04,MahUedAkuPeretal04},
and geometric kernel on graphs \citep{Gaertner02}. Through extensions of linear
algeb... |
0807.0199 | Quadratic Forms and Space-Time Block Codes from Generalized Quaternion
and Biquaternion Algebras | cs.IT math.IT | In the context of space-time block codes (STBCs), the theory of generalized
quaternion and biquaternion algebras (i.e., tensor products of two quaternion
algebras) over arbitrary base fields is presented, as well as quadratic form
theoretic criteria to check if such algebras are division algebras. For base
fields rel... |
0807.0204 | Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay
Networks | cs.IT math.IT | The assumption of nodes in a cooperative communication relay network
operating in synchronous fashion is often unrealistic. In the present paper, we
consider two different models of asynchronous operation in
cooperative-diversity networks experiencing slow fading and examine the
corresponding diversity-multiplexing t... |
0807.0245 | Full Diversity Codes for MISO Systems Equipped with Linear or ML
Detectors | cs.IT math.IT | In this paper, a general criterion for space time block codes (STBC) to
achieve full-diversity with a linear receiver is proposed for a wireless
communication system having multiple transmitter and single receiver antennas
(MISO). Particularly, the STBC with Toeplitz structure satisfies this criterion
and therefore, ... |
0807.0311 | About the creation of a parallel bilingual corpora of web-publications | cs.CL | The algorithm of the creation texts parallel corpora was presented. The
algorithm is based on the use of "key words" in text documents, and on the
means of their automated translation. Key words were singled out by means of
using Russian and Ukrainian morphological dictionaries, as well as dictionaries
of the transla... |
0807.0337 | Unveiling the mystery of visual information processing in human brain | cs.AI cs.IR cs.IT math.IT q-bio.NC | It is generally accepted that human vision is an extremely powerful
information processing system that facilitates our interaction with the
surrounding world. However, despite extended and extensive research efforts,
which encompass many exploration fields, the underlying fundamentals and
operational principles of vi... |
0807.0517 | Modeling belief systems with scale-free networks | cs.AI physics.soc-ph | Evolution of belief systems has always been in focus of cognitive research.
In this paper we delineate a new model describing belief systems as a network
of statements considered true. Testing the model a small number of parameters
enabled us to reproduce a variety of well-known mechanisms ranging from opinion
change... |
0807.0564 | Linear-Programming Receivers | cs.IT math.IT | It is shown that any communication system which admits a sum-product (SP)
receiver also admits a corresponding linear-programming (LP) receiver. The two
receivers have a relationship defined by the local structure of the underlying
graphical model, and are inhibited by the same phenomenon, which we call
'pseudoconfig... |
0807.0565 | Music, Complexity, Information | physics.soc-ph cs.CL | These are the preparatory notes for a Science & Music essay, "Playing by
numbers", appeared in Nature 453 (2008) 988-989.
|
0807.0595 | Nonstandard linear recurring sequence subgroups in finite fields and
automorphisms of cyclic codes | cs.IT cs.DM math.CO math.IT | Let $q=p^r$ be a prime power, and let $f(x)=x^m-\gs_{m-1}x^{m-1}-
>...-\gs_1x-\gs_0$ be an irreducible polynomial over the finite field $\GF(q)$
of size $q$. A zero $\xi$ of $f$ is called {\em nonstandard (of degree $m$)
over $\GF(q)$} if the recurrence relation $u_m=\gs_{m-1}u_{m-1} + ... +
\gs_1u_1+\gs_0u_0$ with c... |
0807.0627 | Belief decision support and reject for textured images characterization | cs.AI | The textured images' classification assumes to consider the images in terms
of area with the same texture. In uncertain environment, it could be better to
take an imprecise decision or to reject the area corresponding to an unlearning
class. Moreover, on the areas that are the classification units, we can have
more t... |
0807.0672 | Algorithmic Problem Complexity | cs.CC cs.IT math.IT | People solve different problems and know that some of them are simple, some
are complex and some insoluble. The main goal of this work is to develop a
mathematical theory of algorithmic complexity for problems. This theory is
aimed at determination of computer abilities in solving different problems and
estimation of... |
0807.0821 | On Wiretap Networks II | cs.IT math.IT | We consider the problem of securing a multicast network against a wiretapper
that can intercept the packets on a limited number of arbitrary network links
of his choice. We assume that the network implements network coding techniques
to simultaneously deliver all the packets available at the source to all the
destina... |
0807.0868 | On the Capacity of Pairwise Collaborative Networks | cs.IT math.IT | We derive expressions for the achievable rate region of a collaborative
coding scheme in a two-transmitter, two-receiver Pairwise Collaborative Network
(PCN) where one transmitter and receiver pair, namely relay pair, assists the
other pair, namely the source pair, by partially decoding and forwarding the
transmitted... |
0807.0908 | The Correspondence Analysis Platform for Uncovering Deep Structure in
Data and Information | cs.AI | We study two aspects of information semantics: (i) the collection of all
relationships, (ii) tracking and spotting anomaly and change. The first is
implemented by endowing all relevant information spaces with a Euclidean metric
in a common projected space. The second is modelled by an induced ultrametric.
A very gene... |
0807.0942 | Secrecy via Sources and Channels | cs.IT math.IT | Alice and Bob want to share a secret key and to communicate an independent
message, both of which they desire to be kept secret from an eavesdropper Eve.
We study this problem of secret communication and secret key generation when
two resources are available -- correlated sources at Alice, Bob, and Eve, and a
noisy b... |
0807.1005 | Catching Up Faster by Switching Sooner: A Prequential Solution to the
AIC-BIC Dilemma | math.ST cs.IT cs.LG math.IT stat.ME stat.ML stat.TH | Bayesian model averaging, model selection and its approximations such as BIC
are generally statistically consistent, but sometimes achieve slower rates og
convergence than other methods such as AIC and leave-one-out cross-validation.
On the other hand, these other methods can br inconsistent. We identify the
"catch-u... |
0807.1158 | Path Gain Algebraic Formulation for the Scalar Linear Network Coding
Problem | cs.IT math.IT | In the algebraic view, the solution to a network coding problem is seen as a
variety specified by a system of polynomial equations typically derived by
using edge-to-edge gains as variables. The output from each sink is equated to
its demand to obtain polynomial equations. In this work, we propose a method to
derive ... |
0807.1211 | Flux: FunctionaL Updates for XML (extended report) | cs.PL cs.DB | XML database query languages have been studied extensively, but XML database
updates have received relatively little attention, and pose many challenges to
language design. We are developing an XML update language called Flux, which
stands for FunctionaL Updates for XML, drawing upon ideas from functional
programming... |
0807.1253 | Informed Traders | q-fin.TR cs.IT math.IT math.PR | An asymmetric information model is introduced for the situation in which
there is a small agent who is more susceptible to the flow of information in
the market than the general market participant, and who tries to implement
strategies based on the additional information. In this model market
participants have access... |
0807.1267 | Optimal Direct Sum and Privacy Trade-off Results for Quantum and
Classical Communication Complexity | cs.DC cs.IT math.IT | We show optimal Direct Sum result for the one-way entanglement-assisted
quantum communication complexity for any relation f subset of X x Y x Z. We
show: Q^{1,pub}(f^m) = Omega(m Q^{1,pub}(f)), where Q^{1,pub}(f), represents
the one-way entanglement-assisted quantum communication complexity of f with
error at most 1/... |
0807.1313 | On the Tradeoffs of Implementing Randomized Network Coding in Multicast
Networks | cs.IT math.IT | Randomized network coding (RNC) greatly reduces the complexity of
implementing network coding in large-scale, heterogeneous networks. This paper
examines two tradeoffs in applying RNC: The first studies how the performance
of RNC varies with a node's randomizing capabilities. Specifically, a limited
randomized networ... |
0807.1372 | Communication over Finite-Field Matrix Channels | cs.IT math.IT | This paper is motivated by the problem of error control in network coding
when errors are introduced in a random fashion (rather than chosen by an
adversary). An additive-multiplicative matrix channel is considered as a model
for random network coding. The model assumes that n packets of length m are
transmitted over... |
0807.1475 | Simulations of Large-scale WiFi-based Wireless Networks:
Interdisciplinary Challenges and Applications | cs.CE cs.DC | Wireless Fidelity (WiFi) is the fastest growing wireless technology to date.
In addition to providing wire-free connectivity to the Internet WiFi technology
also enables mobile devices to connect directly to each other and form highly
dynamic wireless adhoc networks. Such distributed networks can be used to
perform c... |
0807.1494 | Algorithm Selection as a Bandit Problem with Unbounded Losses | cs.AI cs.GT cs.LG | Algorithm selection is typically based on models of algorithm performance,
learned during a separate offline training sequence, which can be prohibitively
expensive. In recent work, we adopted an online approach, in which a
performance model is iteratively updated and used to guide selection on a
sequence of problem ... |
0807.1513 | A First-Order Non-Homogeneous Markov Model for the Response of Spiking
Neurons Stimulated by Small Phase-Continuous Signals | q-bio.NC cs.NE | We present a first-order non-homogeneous Markov model for the
interspike-interval density of a continuously stimulated spiking neuron. The
model allows the conditional interspike-interval density and the stationary
interspike-interval density to be expressed as products of two separate
functions, one of which describ... |
0807.1543 | On the Capacity of MIMO Interference Channels | cs.IT math.IT | The capacity region of a multiple-input-multiple-output interference channel
(MIMO IC) where the channel matrices are square and invertible is studied. The
capacity region for strong interference is established where the definition of
strong interference parallels that of scalar channels. Moreover, the sum-rate
capac... |
0807.1550 | Discernment of Hubs and Clusters in Socioeconomic Networks | physics.soc-ph cs.SI physics.data-an stat.AP | Interest in the analysis of networks has grown rapidly in the new millennium.
Consequently, we promote renewed attention to a certain methodological approach
introduced in 1974. Over the succeeding decade, this
two-stage--double-standardization and hierarchical clustering
(single-linkage-like)--procedure was applied ... |
0807.1560 | Scientific Paper Summarization Using Citation Summary Networks | cs.IR cs.CL | Quickly moving to a new area of research is painful for researchers due to
the vast amount of scientific literature in each field of study. One possible
way to overcome this problem is to summarize a scientific topic. In this paper,
we propose a model of summarizing a single article, which can be further used
to summ... |
0807.1734 | Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower
Bound | cs.DB | The Dynamic Time Warping (DTW) is a popular similarity measure between time
series. The DTW fails to satisfy the triangle inequality and its computation
requires quadratic time. Hence, to find closest neighbors quickly, we use
bounding techniques. We can avoid most DTW computations with an inexpensive
lower bound (LB... |
0807.1773 | Spatial Interference Cancellation for Multi-Antenna Mobile Ad Hoc
Networks | cs.IT math.IT | Interference between nodes is a critical impairment in mobile ad hoc networks
(MANETs). This paper studies the role of multiple antennas in mitigating such
interference. Specifically, a network is studied in which receivers apply
zero-forcing beamforming to cancel the strongest interferers. Assuming a
network with Po... |
0807.1906 | Extension of Inagaki General Weighted Operators and A New Fusion Rule
Class of Proportional Redistribution of Intersection Masses | cs.AI | In this paper we extend Inagaki Weighted Operators fusion rule (WO) in
information fusion by doing redistribution of not only the conflicting mass,
but also of masses of non-empty intersections, that we call Double Weighted
Operators (DWO). Then we propose a new fusion rule Class of Proportional
Redistribution of Int... |
0807.1997 | Multi-Instance Learning by Treating Instances As Non-I.I.D. Samples | cs.LG cs.AI | Multi-instance learning attempts to learn from a training set consisting of
labeled bags each containing many unlabeled instances. Previous studies
typically treat the instances in the bags as independently and identically
distributed. However, the instances in a bag are rarely independent, and
therefore a better per... |
0807.2028 | On Krause's multi-agent consensus model with state-dependent
connectivity (Extended version) | cs.MA | We study a model of opinion dynamics introduced by Krause: each agent has an
opinion represented by a real number, and updates its opinion by averaging all
agent opinions that differ from its own by less than 1. We give a new proof of
convergence into clusters of agents, with all agents in the same cluster
holding th... |
0807.2043 | Intrusion Detection Using Cost-Sensitive Classification | cs.CR cs.CV cs.NI | Intrusion Detection is an invaluable part of computer networks defense. An
important consideration is the fact that raising false alarms carries a
significantly lower cost than not detecting at- tacks. For this reason, we
examine how cost-sensitive classification methods can be used in Intrusion
Detection systems. Th... |
0807.2047 | The Five Points Pose Problem : A New and Accurate Solution Adapted to
any Geometric Configuration | cs.CV | The goal of this paper is to estimate directly the rotation and translation
between two stereoscopic images with the help of five homologous points. The
methodology presented does not mix the rotation and translation parameters,
which is comparably an important advantage over the methods using the
well-known essentia... |
0807.2108 | On dual Schur domain decomposition method for linear first-order
transient problems | cs.NA cs.CE | This paper addresses some numerical and theoretical aspects of dual Schur
domain decomposition methods for linear first-order transient partial
differential equations. In this work, we consider the trapezoidal family of
schemes for integrating the ordinary differential equations (ODEs) for each
subdomain and present ... |
0807.2158 | Universally-composable privacy amplification from causality constraints | quant-ph cs.CR cs.IT math.IT | We consider schemes for secret key distribution which use as a resource
correlations that violate Bell inequalities. We provide the first security
proof for such schemes, according to the strongest notion of security, the so
called universally-composable security. Our security proof does not rely on the
validity of q... |
0807.2268 | Multihop Diversity in Wideband OFDM Systems: The Impact of Spatial Reuse
and Frequency Selectivity | cs.IT math.IT | The goal of this paper is to establish which practical routing schemes for
wireless networks are most suitable for wideband systems in the power-limited
regime, which is, for example, a practically relevant mode of operation for the
analysis of ultrawideband (UWB) mesh networks. For this purpose, we study the
tradeof... |
0807.2282 | Hardware/Software Co-Design for Spike Based Recognition | cs.NE cs.AI cs.CE | The practical applications based on recurrent spiking neurons are limited due
to their non-trivial learning algorithms. The temporal nature of spiking
neurons is more favorable for hardware implementation where signals can be
represented in binary form and communication can be done through the use of
spikes. This wor... |
0807.2292 | Rate and power allocation under the pairwise distributed source coding
constraint | cs.IT math.IT | We consider the problem of rate and power allocation for a sensor network
under the pairwise distributed source coding constraint. For noiseless
source-terminal channels, we show that the minimum sum rate assignment can be
found by finding a minimum weight arborescence in an appropriately defined
directed graph. For ... |
0807.2358 | Polygon Exploration with Time-Discrete Vision | cs.CG cs.RO | With the advent of autonomous robots with two- and three-dimensional scanning
capabilities, classical visibility-based exploration methods from computational
geometry have gained in practical importance. However, real-life laser scanning
of useful accuracy does not allow the robot to scan continuously while in
motion... |
0807.2383 | CPBVP: A Constraint-Programming Framework for Bounded Program
Verification | cs.SE cs.AI cs.LO | This paper studies how to verify the conformity of a program with its
specification and proposes a novel constraint-programming framework for bounded
program verification (CPBPV). The CPBPV framework uses constraint stores to
represent the specification and the program and explores execution paths
nondeterministicall... |
0807.2440 | Construction of Error-Correcting Codes for Random Network Coding | cs.IT math.IT | In this work we present error-correcting codes for random network coding
based on rank- metric codes, Ferrers diagrams, and puncturing. For most
parameters, the constructed codes are larger than all previously known codes.
|
0807.2464 | On "Bit-Interleaved Coded Multiple Beamforming" | cs.IT math.IT | The interleaver design criteria described in [1] should take into account all
error patterns of interest.
|
0807.2471 | An ESPRIT-based approach for Initial Ranging in OFDMA systems | cs.IT math.IT | This work presents a novel Initial Ranging scheme for orthogonal
frequency-division multiple-access networks. Users that intend to establish a
communication link with the base station (BS) are normally misaligned both in
time and frequency and the goal is to jointly estimate their timing errors and
carrier frequency ... |
0807.2475 | Opportunistic Collaborative Beamforming with One-Bit Feedback | cs.IT math.IT | An energy-efficient opportunistic collaborative beamformer with one-bit
feedback is proposed for ad hoc sensor networks over Rayleigh fading channels.
In contrast to conventional collaborative beamforming schemes in which each
source node uses channel state information to correct its local carrier offset
and channel ... |
0807.2496 | Hybrid Keyword Search Auctions | cs.GT cs.DS cs.IR | Search auctions have become a dominant source of revenue generation on the
Internet. Such auctions have typically used per-click bidding and pricing. We
propose the use of hybrid auctions where an advertiser can make a
per-impression as well as a per-click bid, and the auctioneer then chooses one
of the two as the pr... |
0807.2569 | Text Data Mining: Theory and Methods | stat.ML cs.IR stat.CO | This paper provides the reader with a very brief introduction to some of the
theory and methods of text data mining. The intent of this article is to
introduce the reader to some of the current methodologies that are employed
within this discipline area while at the same time making the reader aware of
some of the in... |
0807.2648 | On Endogenous Reconfiguration in Mobile Robotic Networks | cs.RO | In this paper, our focus is on certain applications for mobile robotic
networks, where reconfiguration is driven by factors intrinsic to the network
rather than changes in the external environment. In particular, we study a
version of the coverage problem useful for surveillance applications, where the
objective is t... |
0807.2666 | Source and Channel Coding for Correlated Sources Over Multiuser Channels | cs.IT math.IT | Source and channel coding over multiuser channels in which receivers have
access to correlated source side information is considered. For several
multiuser channel models necessary and sufficient conditions for optimal
separation of the source and channel codes are obtained. In particular, the
multiple access channel... |
0807.2677 | Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio | cs.NI cs.LG | We study the problem of dynamic spectrum sensing and access in cognitive
radio systems as a partially observed Markov decision process (POMDP). A group
of cognitive users cooperatively tries to exploit vacancies in primary
(licensed) channels whose occupancies follow a Markovian evolution. We first
consider the scena... |
0807.2678 | Eigenfactor : Does the Principle of Repeated Improvement Result in
Better Journal Impact Estimates than Raw Citation Counts? | cs.DL cs.DB | Eigenfactor.org, a journal evaluation tool which uses an iterative algorithm
to weight citations (similar to the PageRank algorithm used for Google) has
been proposed as a more valid method for calculating the impact of journals.
The purpose of this brief communication is to investigate whether the principle
of repea... |
0807.2680 | Group Divisible Codes and Their Application in the Construction of
Optimal Constant-Composition Codes of Weight Three | cs.IT cs.DM math.CO math.IT | The concept of group divisible codes, a generalization of group divisible
designs with constant block size, is introduced in this paper. This new class
of codes is shown to be useful in recursive constructions for constant-weight
and constant-composition codes. Large classes of group divisible codes are
constructed w... |
0807.2701 | A Cutting Plane Method based on Redundant Rows for Improving Fractional
Distance | cs.IT math.IT | In this paper, an idea of the cutting plane method is employed to improve the
fractional distance of a given binary parity check matrix. The fractional
distance is the minimum weight (with respect to l1-distance) of vertices of the
fundamental polytope. The cutting polytope is defined based on redundant rows
of the p... |
0807.2724 | An Asymptotic Analysis of the MIMO BC under Linear Filtering | cs.IT math.IT | We investigate the MIMO broadcast channel in the high SNR regime when linear
filtering is applied instead of dirty paper coding. Using a user-wise rate
duality where the streams of every single user are not treated as
self-interference as in the hitherto existing stream-wise rate dualities for
linear filtering, we so... |
0807.2728 | Iterative ('Turbo') Multiuser Detectors For Impulse Radio Systems | cs.IT math.IT | In recent years, there has been a growing interest in multiple access
communication systems that spread their transmitted energy over very large
bandwidths. These systems, which are referred to as ultra wide-band (UWB)
systems, have various advantages over narrow-band and conventional wide-band
systems. The importanc... |
0807.2730 | Position Estimation via Ultra-Wideband Signals | cs.IT math.IT | The high time resolution of ultra-wideband (UWB) signals facilitates very
precise position estimation in many scenarios, which makes a variety
applications possible. This paper reviews the problem of position estimation in
UWB systems, beginning with an overview of the basic structure of UWB signals
and their positio... |
0807.2844 | On the Performance of Selection Relaying | cs.IT math.IT | Interest in selection relaying is growing. The recent developments in this
area have largely focused on information theoretic analyses such as outage
performance. Some of these analyses are accurate only at high SNR regimes. In
this paper error rate analyses that are sufficiently accurate over a wide range
of SNR reg... |
0807.2859 | The Transport Capacity of a Wireless Network is a Subadditive Euclidean
Functional | cs.IT math.IT | The transport capacity of a dense ad hoc network with n nodes scales like
\sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a
non-random limit with probability one when the nodes are i.i.d. distributed on
the unit square. We prove that the transport capacity under the protocol model
is a su... |
0807.2928 | Visual Grouping by Neural Oscillators | cs.CV cs.NE | Distributed synchronization is known to occur at several scales in the brain,
and has been suggested as playing a key functional role in perceptual grouping.
State-of-the-art visual grouping algorithms, however, seem to give
comparatively little attention to neural synchronization analogies. Based on
the framework of... |
0807.2972 | DescribeX: A Framework for Exploring and Querying XML Web Collections | cs.DB | This thesis introduces DescribeX, a powerful framework that is capable of
describing arbitrarily complex XML summaries of web collections, providing
support for more efficient evaluation of XPath workloads. DescribeX permits the
declarative description of document structure using all axes and language
constructs in X... |
0807.2983 | On Probability Distributions for Trees: Representations, Inference and
Learning | cs.LG | We study probability distributions over free algebras of trees. Probability
distributions can be seen as particular (formal power) tree series [Berstel et
al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely
studied class of tree series is the class of rational (or recognizable) tree
series whic... |
0807.3006 | The rank convergence of HITS can be slow | cs.DS cs.IR | We prove that HITS, to "get right" h of the top k ranked nodes of an N>=2k
node graph, can require h^(Omega(N h/k)) iterations (i.e. a substantial Omega(N
h log(h)/k) matrix multiplications even with a "squaring trick"). Our proof
requires no algebraic tools and is entirely self-contained.
|
0807.3050 | Dimensionally Distributed Learning: Models and Algorithm | cs.IT math.IT | This paper introduces a framework for regression with dimensionally
distributed data with a fusion center. A cooperative learning algorithm, the
iterative conditional expectation algorithm (ICEA), is designed within this
framework. The algorithm can effectively discover linear combinations of
individual estimators tr... |
0807.3065 | Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes | cs.IT math.IT | Consider communication over a binary-input memoryless output-symmetric
channel with low density parity check (LDPC) codes and maximum a posteriori
(MAP) decoding. The replica method of spin glass theory allows to conjecture an
analytic formula for the average input-output conditional entropy per bit in
the infinite b... |
0807.3094 | Energy-Efficient Resource Allocation in Multiuser MIMO Systems: A
Game-Theoretic Framework | cs.IT cs.GT math.IT | This paper focuses on the cross-layer issue of resource allocation for energy
efficiency in the uplink of a multiuser MIMO wireless communication system.
Assuming that all of the transmitters and the uplink receiver are equipped with
multiple antennas, the situation considered is that in which each terminal is
allowe... |
0807.3096 | Stochastic Maximum Principle for a PDEs with noise and control on the
boundary | math.PR cs.SY math.OC | In this paper we prove necessary conditions for optimality of a stochastic
control problem for a class of stochastic partial differential equations that
is controlled through the boundary. This kind of problems can be interpreted as
a stochastic control problem for an evolution system in an Hilbert space. The
regular... |
0807.3097 | Energy-Efficient Power Control in Multipath CDMA Channels via Large
System Analysis | cs.IT cs.GT math.IT | This paper is focused on the design and analysis of power control procedures
for the uplink of multipath code-division-multiple-access (CDMA) channels based
on the large system analysis (LSA). Using the tools of LSA, a new decentralized
power control algorithm aimed at energy efficiency maximization and requiring
ver... |
0807.3156 | Algorithmic randomness and splitting of supermartingales | cs.IT math.IT | Randomness in the sense of Martin-L\"of can be defined in terms of lower
semicomputable supermartingales. We show that such a supermartingale cannot be
replaced by a pair of supermartingales that bet only on the even bits (the
first one) and on the odd bits (the second one) knowing all preceding bits.
|
0807.3198 | On algebras admitting a complete set of near weights, evaluation codes
and Goppa codes | cs.IT math.IT | In 1998 Hoholdt, van Lint and Pellikaan introduced the concept of a ``weight
function'' defined on a F_q-algebra and used it to construct linear codes,
obtaining among them the algebraic-geometric (AG) codes supported on one point.
Later it was proved by Matsumoto that all codes produced using a weight
function are a... |
0807.3212 | Construction of Large Constant Dimension Codes With a Prescribed Minimum
Distance | cs.IT cs.DM math.CO math.IT | In this paper we construct constant dimension space codes with prescribed
minimum distance. There is an increased interest in space codes since a paper
by Koetter and Kschischang were they gave an application in network coding.
There is also a connection to the theory of designs over finite fields. We will
modify a m... |
0807.3222 | The two-user Gaussian interference channel: a deterministic view | cs.IT math.IT | This paper explores the two-user Gaussian interference channel through the
lens of a natural deterministic channel model. The main result is that the
deterministic channel uniformly approximates the Gaussian channel, the capacity
regions differing by a universal constant. The problem of finding the capacity
of the Ga... |
0807.3223 | The NAO humanoid: a combination of performance and affordability | cs.RO | This article presents the design of the autonomous humanoid robot called NAO
that is built by the French company Aldebaran-Robotics. With its height of 0.57
m and its weight about 4.5 kg, this innovative robot is lightweight and
compact. It distinguishes itself from its existing Japanese, American, and
other counterp... |
0807.3225 | Exploiting Bird Locomotion Kinematics Data for Robotics Modeling | cs.RO | We present here the results of an analysis carried out by biologists and
roboticists with the aim of modeling bird locomotion kinematics for robotics
purposes. The aim was to develop a bio-inspired kinematic model of the bird leg
from biological data. We first acquired and processed kinematic data for
sagittal and to... |
0807.3287 | Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal
Concept Analysis Methods | q-bio.MN cs.AI math.LO | Our aim is to build a set of rules, such that reasoning over temporal
dependencies within gene regulatory networks is possible. The underlying
transitions may be obtained by discretizing observed time series, or they are
generated based on existing knowledge, e.g. by Boolean networks or their
nondeterministic general... |
0807.3332 | Energy-efficient Scheduling of Delay Constrained Traffic over Fading
Channels | cs.IT math.IT | A delay-constrained scheduling problem for point-to-point communication is
considered: a packet of $B$ bits must be transmitted by a hard deadline of $T$
slots over a time-varying channel. The transmitter/scheduler must determine how
many bits to transmit, or equivalently how much energy to transmit with, during
each... |
0807.3337 | Algebraic constructions of LDPC codes with no short cycles | math.RA cs.IT math.IT | An algebraic group ring method for constructing codes with no short cycles in
the check matrix is derived. It is shown that the matrix of a group ring
element has no short cycles if and only if the collection of group differences
of this element has no repeats. When applied to elements in the group ring with
small su... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.