id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1009.1166 | Functorial Data Migration | cs.DB math.CT | In this paper we present a simple database definition language: that of
categories and functors. A database schema is a small category and an instance
is a set-valued functor on it. We show that morphisms of schemas induce three
"data migration functors", which translate instances from one schema to the
other in cano... |
1009.1174 | Parameterized Complexity Results in Symmetry Breaking | cs.AI cs.CC | Symmetry is a common feature of many combinatorial problems. Unfortunately
eliminating all symmetry from a problem is often computationally intractable.
This paper argues that recent parameterized complexity results provide insight
into that intractability and help identify special cases in which symmetry can
be deal... |
1009.1193 | Coarse Network Coding: A Simple Relay Strategy to Resolve Interference | cs.IT math.IT | Reminiscent of the parity function in network coding for the butterfly
network, it is shown that forwarding an even/odd indicator bit for a scalar
quantization of a relay observation recovers 1 bit of information at the two
destinations in a noiseless interference channel where interference is treated
as noise. Based... |
1009.1225 | A family of sequences with large size and good correlation property
arising from $M$-ary Sidelnikov sequences of period $q^d-1$ | cs.IT math.IT | Let $q$ be any prime power and let $d$ be a positive integer greater than 1.
In this paper, we construct a family of $M$-ary sequences of period $q-1$ from
a given $M$-ary, with $M|q-1$, Sidelikov sequence of period $q^d-1$. Under mild
restrictions on $d$, we show that the maximum correlation magnitude of the
family ... |
1009.1254 | Multiuser broadcast erasure channel with feedback - capacity and
algorithms | cs.IT cs.DM math.IT | We consider the $N$-user broadcast erasure channel with $N$ unicast sessions
(one for each user) where receiver feedback is regularly sent to the
transmitter in the form of ACK/NACK messages. We first provide a generic outer
bound to the capacity of this system; we then propose a virtual-queue-based
inter-session mix... |
1009.1305 | Wideband Spectrum Sensing at Sub-Nyquist Rates | cs.AR cs.IT math.IT | We present a mixed analog-digital spectrum sensing method that is especially
suited to the typical wideband setting of cognitive radio (CR). The advantages
of our system with respect to current architectures are threefold. First, our
analog front-end is fixed and does not involve scanning hardware. Second, both
the a... |
1009.1362 | Approximate Lesion Localization in Dermoscopy Images | cs.CV | Background: Dermoscopy is one of the major imaging modalities used in the
diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty
and subjectivity of human interpretation, automated analysis of dermoscopy
images has become an important research area. Border detection is often the
first step in t... |
1009.1446 | Comparing Prediction Market Structures, With an Application to Market
Making | q-fin.TR cs.AI cs.CE | Ensuring sufficient liquidity is one of the key challenges for designers of
prediction markets. Various market making algorithms have been proposed in the
literature and deployed in practice, but there has been little effort to
evaluate their benefits and disadvantages in a systematic manner. We introduce
a novel exp... |
1009.1460 | Two-Way Transmission Capacity of Wireless Ad-hoc Networks | cs.IT math.IT | The transmission capacity of an ad-hoc network is the maximum density of
active transmitters per unit area, given an outage constraint at each receiver
for a fixed rate of transmission. Most prior work on finding the transmission
capacity of ad-hoc networks has focused only on one-way communication where a
source com... |
1009.1498 | A Statistical Measure of Complexity | nlin.AO cs.IT math.IT physics.data-an | In this chapter, a statistical measure of complexity is introduced and some
of its properties are discussed. Also, some straightforward applications are
shown.
|
1009.1512 | Applications of semidefinite programming to coding theory | cs.IT math.IT | We survey recent generalizations and improvements of the linear programming
method that involve semidefinite programming. A general framework using group
representations and tools from graph theory is provided.
|
1009.1513 | Artificial Neural Networks, Symmetries and Differential Evolution | cs.NE | Neuroevolution is an active and growing research field, especially in times
of increasingly parallel computing architectures. Learning methods for
Artificial Neural Networks (ANN) can be divided into two groups. Neuroevolution
is mainly based on Monte-Carlo techniques and belongs to the group of global
search methods... |
1009.1533 | Sensing Matrix Optimization for Block-Sparse Decoding | cs.IT math.IT | Recent work has demonstrated that using a carefully designed sensing matrix
rather than a random one, can improve the performance of compressed sensing. In
particular, a well-designed sensing matrix can reduce the coherence between the
atoms of the equivalent dictionary, and as a consequence, reduce the
reconstructio... |
1009.1686 | Statistical Behavior of Embeddedness and Communities of Overlapping
Cliques in Online Social Networks | cs.SI physics.soc-ph | Degree distribution of nodes, especially a power law degree distribution, has
been regarded as one of the most significant structural characteristics of
social and information networks. Node degree, however, only discloses the
first-order structure of a network. Higher-order structures such as the edge
embeddedness a... |
1009.1690 | Probabilistic Models over Ordered Partitions with Application in
Learning to Rank | cs.IR stat.ML | This paper addresses the general problem of modelling and learning rank data
with ties. We propose a probabilistic generative model, that models the process
as permutations over partitions. This results in super-exponential
combinatorial state space with unknown numbers of partitions and unknown
ordering among them. ... |
1009.1691 | Multi-scale turbulence modeling and maximum information principle. Part
1 | physics.flu-dyn cs.IT math.IT | We discuss averaged turbulence modeling of multi-scales of length for an
incompressible Newtonian fluid, with the help of the maximum information
principle. We suppose that there exists a function basis to decompose the
turbulent fluctuations in a flow of our concern into the components associated
with various spatia... |
1009.1720 | Is there a physically universal cellular automaton or Hamiltonian? | quant-ph cs.AI | It is known that both quantum and classical cellular automata (CA) exist that
are computationally universal in the sense that they can simulate, after
appropriate initialization, any quantum or classical computation, respectively.
Here we introduce a different notion of universality: a CA is called physically
univers... |
1009.1731 | Identifying the Community Structure of the International-Trade Multi
Network | physics.soc-ph cs.SI | We study the community structure of the multi-network of commodity-specific
trade relations among world countries over the 1992-2003 period. We compare
structures across commodities and time by means of the normalized mutual
information index (NMI). We also compare them with exogenous community
structures induced by ... |
1009.1759 | On Compression of Data Encrypted with Block Ciphers | cs.IT cs.CR math.IT | This paper investigates compression of data encrypted with block ciphers,
such as the Advanced Encryption Standard (AES). It is shown that such data can
be feasibly compressed without knowledge of the secret key. Block ciphers
operating in various chaining modes are considered and it is shown how
compression can be a... |
1009.1889 | Spatially regularized compressed sensing of diffusion MRI data | cs.IT math.IT physics.med-ph | The present paper introduces a method for substantial reduction of the number
of diffusion encoding gradients required for reliable reconstruction of HARDI
signals. The method exploits the theory of compressed sensing (CS), which
establishes conditions on which a signal of interest can be recovered from its
under-sam... |
1009.1983 | Evolutionary Computational Method of Facial Expression Analysis for
Content-based Video Retrieval using 2-Dimensional Cellular Automata | cs.CV | In this paper, Deterministic Cellular Automata (DCA) based video shot
classification and retrieval is proposed. The deterministic 2D Cellular
automata model captures the human facial expressions, both spontaneous and
posed. The determinism stems from the fact that the facial muscle actions are
standardized by the enc... |
1009.1990 | Complexity of Non-Monotonic Logics | cs.CC cs.AI cs.LO | Over the past few decades, non-monotonic reasoning has developed to be one of
the most important topics in computational logic and artificial intelligence.
Different ways to introduce non-monotonic aspects to classical logic have been
considered, e.g., extension with default rules, extension with modal belief
operato... |
1009.2003 | AI 3D Cybug Gaming | cs.AI | In this short paper I briefly discuss 3D war Game based on artificial
intelligence concepts called AI WAR. Going in to the details, I present the
importance of CAICL language and how this language is used in AI WAR. Moreover
I also present a designed and implemented 3D War Cybug for AI WAR using CAICL
and discus the ... |
1009.2009 | Hierarchical Semi-Markov Conditional Random Fields for Recursive
Sequential Data | stat.ML cs.AI | Inspired by the hierarchical hidden Markov models (HHMM), we present the
hierarchical semi-Markov conditional random field (HSCRF), a generalisation of
embedded undirectedMarkov chains tomodel complex hierarchical, nestedMarkov
processes. It is parameterised in a discriminative framework and has polynomial
time algor... |
1009.2021 | The Complexity of Causality and Responsibility for Query Answers and
non-Answers | cs.DB cs.AI | An answer to a query has a well-defined lineage expression (alternatively
called how-provenance) that explains how the answer was derived. Recent work
has also shown how to compute the lineage of a non-answer to a query. However,
the cause of an answer or non-answer is a more subtle notion and consists, in
general, o... |
1009.2032 | Feedback stabilisation of switched systems via iterative approximate
eigenvector assignment | cs.SY math.OC | This paper presents and implements an iterative feedback design algorithm for
stabilisation of discrete-time switched systems under arbitrary switching
regimes. The algorithm seeks state feedback gains so that the closed-loop
switching system admits a common quadratic Lyapunov function (CQLF) and hence
is uniformly g... |
1009.2041 | Multi-Agent Only-Knowing Revisited | cs.AI | Levesque introduced the notion of only-knowing to precisely capture the
beliefs of a knowledge base. He also showed how only-knowing can be used to
formalize non-monotonic behavior within a monotonic logic. Despite its appeal,
all attempts to extend only-knowing to the many agent case have undesirable
properties. A b... |
1009.2054 | Multiplex Structures: Patterns of Complexity in Real-World Networks | cs.SI cs.AI physics.soc-ph | Complex network theory aims to model and analyze complex systems that consist
of multiple and interdependent components. Among all studies on complex
networks, topological structure analysis is of the most fundamental importance,
as it represents a natural route to understand the dynamics, as well as to
synthesize or... |
1009.2077 | A new sufficient condition for sum-rate tightness in quadratic Gaussian
multiterminal source coding | cs.IT math.IT | This work considers the quadratic Gaussian multiterminal (MT) source coding
problem and provides a new sufficient condition for the Berger-Tung sum-rate
bound to be tight. The converse proof utilizes a set of virtual remote sources
given which the MT sources are block independent with a maximum block size of
two. The... |
1009.2084 | Ontology Temporal Evolution for Multi-Entity Bayesian Networks under
Exogenous and Endogenous Semantic Updating | cs.AI cs.LO | It is a challenge for any Knowledge Base reasoning to manage ubiquitous
uncertain ontology as well as uncertain updating times, while achieving
acceptable service levels at minimum computational cost. This paper proposes an
application-independent merging ontologies for any open interaction system. A
solution that us... |
1009.2118 | Restricted strong convexity and weighted matrix completion: Optimal
bounds with noise | cs.IT math.IT math.ST stat.TH | We consider the matrix completion problem under a form of row/column weighted
entrywise sampling, including the case of uniform entrywise sampling as a
special case. We analyze the associated random observation operator, and prove
that with high probability, it satisfies a form of restricted strong convexity
with res... |
1009.2221 | Performance Bounds and Design Criteria for Estimating Finite Rate of
Innovation Signals | cs.IT math.IT | In this paper, we consider the problem of estimating finite rate of
innovation (FRI) signals from noisy measurements, and specifically analyze the
interaction between FRI techniques and the underlying sampling methods. We
first obtain a fundamental limit on the estimation accuracy attainable
regardless of the samplin... |
1009.2270 | Active Integrity Constraints and Revision Programming | cs.DB | We study active integrity constraints and revision programming, two
formalisms designed to describe integrity constraints on databases and to
specify policies on preferred ways to enforce them. Unlike other more commonly
accepted approaches, these two formalisms attempt to provide a declarative
solution to the proble... |
1009.2274 | Robust Beamforming for Security in MIMO Wiretap Channels with Imperfect
CSI | cs.IT math.IT | In this paper, we investigate methods for reducing the likelihood that a
message transmitted between two multiantenna nodes is intercepted by an
undetected eavesdropper. In particular, we focus on the judicious transmission
of artificial interference to mask the desired signal at the time it is
broadcast. Unlike prev... |
1009.2275 | PhishDef: URL Names Say It All | cs.CR cs.LG cs.NI | Phishing is an increasingly sophisticated method to steal personal user
information using sites that pretend to be legitimate. In this paper, we take
the following steps to identify phishing URLs. First, we carefully select
lexical features of the URLs that are resistant to obfuscation techniques used
by attackers. S... |
1009.2305 | Message Error Analysis of Loopy Belief Propagation for the Sum-Product
Algorithm | cs.IT math.IT | Belief propagation is known to perform extremely well in many practical
statistical inference and learning problems using graphical models, even in the
presence of multiple loops. The iterative use of belief propagation algorithm
on loopy graphs is referred to as Loopy Belief Propagation (LBP). Various
sufficient con... |
1009.2370 | Optimized IR-HARQ Schemes Based on Punctured LDPC Codes over the BEC | cs.IT math.IT | We study incremental redundancy hybrid ARQ (IR-HARQ) schemes based on
punctured, finite-length, LDPC codes. The transmission is assumed to take place
over time varying binary erasure channels, such as mobile wireless channels at
the applications layer. We analyze and optimize the throughput and delay
performance of t... |
1009.2443 | Delay-Optimal User Scheduling and Inter-Cell Interference Management in
Cellular Network via Distributive Stochastic Learning | cs.IT math.IT | In this paper, we propose a distributive queueaware intra-cell user
scheduling and inter-cell interference (ICI) management control design for a
delay-optimal celluar downlink system with M base stations (BSs), and K users
in each cell. Each BS has K downlink queues for K users respectively with
heterogeneous arrival... |
1009.2464 | Various virtual structures on single file system | cs.IT math.IT | The article provides a new approach to creating hierarchical structure of
file system. First, it gives overview of the existing ways of storing files in
current operating systems. Second, it describes the new way of building
structures of a file system. This approach allows creating various structures
by different at... |
1009.2528 | Is Witsenhausen's counterexample a relevant toy? | cs.IT cs.SY math.IT | This paper answers a question raised by Doyle on the relevance of the
Witsenhausen counterexample as a toy decentralized control problem. The
question has two sides, the first of which focuses on the lack of an external
channel in the counterexample. Using existing results, we argue that the core
difficulty in the co... |
1009.2556 | Securing Dynamic Distributed Storage Systems against Eavesdropping and
Adversarial Attacks | cs.IT cs.CR math.IT | We address the problem of securing distributed storage systems against
eavesdropping and adversarial attacks. An important aspect of these systems is
node failures over time, necessitating, thus, a repair mechanism in order to
maintain a desired high system reliability. In such dynamic settings, an
important security... |
1009.2566 | Reinforcement Learning by Comparing Immediate Reward | cs.LG | This paper introduces an approach to Reinforcement Learning Algorithm by
comparing their immediate rewards using a variation of Q-Learning algorithm.
Unlike the conventional Q-Learning, the proposed algorithm compares current
reward with immediate reward of past move and work accordingly. Relative reward
based Q-lear... |
1009.2602 | Joint Channel Probing and Proportional Fair Scheduling in Wireless
Networks | cs.IT math.IT | The design of a scheduling scheme is crucial for the efficiency and
user-fairness of wireless networks. Assuming that the quality of all user
channels is available to a central controller, a simple scheme which maximizes
the utility function defined as the sum logarithm throughput of all users has
been shown to guara... |
1009.2631 | Google matrix of business process management | cs.CY cs.IR physics.soc-ph q-fin.GN | Development of efficient business process models and determination of their
characteristic properties are subject of intense interdisciplinary research.
Here, we consider a business process model as a directed graph. Its nodes
correspond to the units identified by the modeler and the link direction
indicates the caus... |
1009.2651 | Left-Inverses of Fractional Laplacian and Sparse Stochastic Processes | cs.IT math.IT math.ST stat.TH | The fractional Laplacian $(-\triangle)^{\gamma/2}$ commutes with the primary
coordination transformations in the Euclidean space $\RR^d$: dilation,
translation and rotation, and has tight link to splines, fractals and stable
Levy processes. For $0<\gamma<d$, its inverse is the classical Riesz potential
$I_\gamma$ whi... |
1009.2653 | Opinion fluctuations and disagreement in social networks | cs.SI cs.SY math.OC math.PR | We study a tractable opinion dynamics model that generates long-run
disagreements and persistent opinion fluctuations. Our model involves an
inhomogeneous stochastic gossip process of continuous opinion dynamics in a
society consisting of two types of agents: regular agents, who update their
beliefs according to info... |
1009.2706 | Minimization Strategies for Maximally Parallel Multiset Rewriting
Systems | cs.FL cs.CC cs.CL cs.DM | Maximally parallel multiset rewriting systems (MPMRS) give a convenient way
to express relations between unstructured objects. The functioning of various
computational devices may be expressed in terms of MPMRS (e.g., register
machines and many variants of P systems). In particular, this means that MPMRS
are computat... |
1009.2722 | Learning Latent Tree Graphical Models | stat.ML cs.IT math.IT | We study the problem of learning a latent tree graphical model where samples
are available only from a subset of variables. We propose two consistent and
computationally efficient algorithms for learning minimal latent trees, that
is, trees without any redundant hidden nodes. Unlike many existing methods, the
observe... |
1009.2764 | A Blink Tree latch method and protocol to support synchronous node
deletion | cs.DB | A Blink Tree latch method and protocol supports synchronous node deletion in
a high concurrency environment. Full source code is available.
|
1009.2913 | Information filtering in complex weighted networks | physics.soc-ph cond-mat.dis-nn cond-mat.stat-mech cs.IR | Many systems in nature, society and technology can be described as networks,
where the vertices are the system's elements and edges between vertices
indicate the interactions between the corresponding elements. Edges may be
weighted if the interaction strength is measurable. However, the full network
information is o... |
1009.2927 | Underlay Cognitive Radio with Full or Partial Channel Quality
Information | cs.IT math.IT | Underlay cognitive radios (UCRs) allow a secondary user to enter a primary
user's spectrum through intelligent utilization of multiuser channel quality
information (CQI) and sharing of codebook. The aim of this work is to study
two-user Gaussian UCR systems by assuming the full or partial knowledge of
multiuser CQI. ... |
1009.2955 | Throughput Analysis of Buffer-Constrained Wireless Systems in the Finite
Blocklength Regime | cs.IT math.IT | In this paper, wireless systems operating under queueing constraints in the
form of limitations on the buffer violation probabilities are considered. The
throughput under such constraints is captured by the effective capacity
formulation. It is assumed that finite blocklength codes are employed for
transmission. Unde... |
1009.2997 | Sensor Scheduling for Energy-Efficient Target Tracking in Sensor
Networks | cs.MA | In this paper we study the problem of tracking an object moving randomly
through a network of wireless sensors. Our objective is to devise strategies
for scheduling the sensors to optimize the tradeoff between tracking
performance and energy consumption. We cast the scheduling problem as a
Partially Observable Markov... |
1009.3029 | Invariant Spectral Hashing of Image Saliency Graph | cs.CV | Image hashing is the process of associating a short vector of bits to an
image. The resulting summaries are useful in many applications including image
indexing, image authentication and pattern recognition. These hashes need to be
invariant under transformations of the image that result in similar visual
content, bu... |
1009.3041 | Secret Sharing LDPC Codes for the BPSK-constrained Gaussian Wiretap
Channel | cs.IT cs.CR math.IT | The problem of secret sharing over the Gaussian wiretap channel is
considered. A source and a destination intend to share secret information over
a Gaussian channel in the presence of a wiretapper who observes the
transmission through another Gaussian channel. Two constraints are imposed on
the source-to-destination ... |
1009.3052 | Secret-key Agreement with Channel State Information at the Transmitter | cs.IT math.IT | We study the capacity of secret-key agreement over a wiretap channel with
state parameters. The transmitter communicates to the legitimate receiver and
the eavesdropper over a discrete memoryless wiretap channel with a memoryless
state sequence. The transmitter and the legitimate receiver generate a shared
secret key... |
1009.3078 | Asymmetric Totally-corrective Boosting for Real-time Object Detection | cs.CV | Real-time object detection is one of the core problems in computer vision.
The cascade boosting framework proposed by Viola and Jones has become the
standard for this problem. In this framework, the learning goal for each node
is asymmetric, which is required to achieve a high detection rate and a
moderate false posi... |
1009.3083 | The Capacity of the Semi-Deterministic Cognitive Interference Channel
and its Application to Constant Gap Results for the Gaussian Channel | cs.IT math.IT | The cognitive interference channel (C-IFC) consists of a classical two-user
interference channel in which the message of one user (the "primary" user) is
non-causally available at the transmitter of the other user (the "cognitive"
user). We obtain the capacity of the semi-deterministic C-IFC: a discrete
memoryless C-... |
1009.3090 | Open-Loop Spatial Multiplexing and Diversity Communications in Ad Hoc
Networks | cs.IT math.IT | This paper investigates the performance of open-loop multi-antenna
point-to-point links in ad hoc networks with slotted ALOHA medium access
control (MAC). We consider spatial multiplexing transmission with linear
maximum ratio combining and zero forcing receivers, as well as orthogonal space
time block coded transmis... |
1009.3130 | Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth
LDPC Codes | cs.IT math.IT | For an arbitrary degree distribution pair (DDP), we construct a sequence of
low-density parity-check (LDPC) code ensembles with girth growing
logarithmically in block-length using Ramanujan graphs. When the DDP has
minimum left degree at least three, we show using density evolution analysis
that the expected bit-erro... |
1009.3145 | Universal Rate-Efficient Scalar Quantization | cs.IT math.IT | Scalar quantization is the most practical and straightforward approach to
signal quantization. However, it has been shown that scalar quantization of
oversampled or Compressively Sensed signals can be inefficient in terms of the
rate-distortion trade-off, especially as the oversampling rate or the sparsity
of the sig... |
1009.3186 | Group Testing with Probabilistic Tests: Theory, Design and Application | cs.IT math.IT | Identification of defective members of large populations has been widely
studied in the statistics community under the name of group testing. It
involves grouping subsets of items into different pools and detecting defective
members based on the set of test results obtained for each pool.
In a classical noiseless g... |
1009.3238 | Tableaux for the Lambek-Grishin calculus | cs.CL | Categorial type logics, pioneered by Lambek, seek a proof-theoretic
understanding of natural language syntax by identifying categories with
formulas and derivations with proofs. We typically observe an intuitionistic
bias: a structural configuration of hypotheses (a constituent) derives a single
conclusion (the categ... |
1009.3240 | A Unified View of Regularized Dual Averaging and Mirror Descent with
Implicit Updates | cs.LG | We study three families of online convex optimization algorithms:
follow-the-proximally-regularized-leader (FTRL-Proximal), regularized dual
averaging (RDA), and composite-objective mirror descent. We first prove
equivalence theorems that show all of these algorithms are instantiations of a
general FTRL update. This ... |
1009.3243 | The "Unfriending" Problem: The Consequences of Homophily in Friendship
Retention for Causal Estimates of Social Influence | stat.AP cs.SI physics.data-an physics.soc-ph | An increasing number of scholars are using longitudinal social network data
to try to obtain estimates of peer or social influence effects. These data may
provide additional statistical leverage, but they can introduce new inferential
problems. In particular, while the confounding effects of homophily in
friendship f... |
1009.3253 | Transmission Strategies in Multiple Access Fading Channels with
Statistical 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, the effective
capacity region of fading multiple access channels (MAC) in the presence of
quality of service... |
1009.3291 | Rebuilding for Array Codes in Distributed Storage Systems | cs.IT cs.DC cs.NI math.IT | In distributed storage systems that use coding, the issue of minimizing the
communication required to rebuild a storage node after a failure arises. We
consider the problem of repairing an erased node in a distributed storage
system that uses an EVENODD code. EVENODD codes are maximum distance separable
(MDS) array c... |
1009.3321 | Niche as a determinant of word fate in online groups | cs.CL cond-mat.dis-nn nlin.AO physics.soc-ph q-bio.PE | Patterns of word use both reflect and influence a myriad of human activities
and interactions. Like other entities that are reproduced and evolve, words
rise or decline depending upon a complex interplay between {their intrinsic
properties and the environments in which they function}. Using Internet
discussion commun... |
1009.3345 | Cooperative Feedback for MIMO Interference Channels | cs.IT math.IT | Multi-antenna precoding effectively mitigates the interference in wireless
networks. However, the precoding efficiency can be significantly degraded by
the overhead due to the required feedback of channel state information (CSI).
This paper addresses such an issue by proposing a systematic method of
designing precode... |
1009.3346 | Conditional Random Fields and Support Vector Machines: A Hybrid Approach | cs.LG | We propose a novel hybrid loss for multiclass and structured prediction
problems that is a convex combination of log loss for Conditional Random Fields
(CRFs) and a multiclass hinge loss for Support Vector Machines (SVMs). We
provide a sufficient condition for when the hybrid loss is Fisher consistent
for classificat... |
1009.3353 | A Lower Bound on the Estimator Variance for the Sparse Linear Model | math.ST cs.IT math.IT stat.TH | We study the performance of estimators of a sparse nonrandom vector based on
an observation which is linearly transformed and corrupted by additive white
Gaussian noise. Using the reproducing kernel Hilbert space framework, we derive
a new lower bound on the estimator variance for a given differentiable bias
function... |
1009.3354 | Direct vs. Two-Step Approach for Unique Word Generation in UW-OFDM | cs.IT math.IT | Unique word OFDM is a novel technique for constructing OFDM symbols, that has
many advantages over cyclic prefix OFDM. In this paper we investigate two
different approaches for the generation of an OFDM symbol containing a unique
word in its time domain representation. The two-step and the direct approach
seem very s... |
1009.3387 | Distributed STBCs with Full-diversity Partial Interference Cancellation
Decoding | cs.IT math.IT | Recently, Guo and Xia introduced low complexity decoders called Partial
Interference Cancellation (PIC) and PIC with Successive Interference
Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC
receivers as special cases, for point-to-point MIMO channels. In this paper, we
show that PIC and PIC-SIC ... |
1009.3396 | Collaborative Decoding of Interleaved Reed-Solomon Codes using Gaussian
Elimination | cs.IT math.IT | We propose an alternative method for collaborative decoding of interleaved
Reed-Solomon codes. Simulation results for a concatenated coding scheme using
polar codes as inner codes are included.
|
1009.3455 | A control-theoretical methodology for the scheduling problem | cs.SY | This paper presents a novel methodology to develop scheduling algorithms. The
scheduling problem is phrased as a control problem, and control-theoretical
techniques are used to design a scheduling algorithm that meets specific
requirements. Unlike most approaches to feedback scheduling, where a controller
integrates ... |
1009.3481 | Linear Transceiver Design for Interference Alignment: Complexity and
Computation | cs.IT math.IT | Consider a MIMO interference channel whereby each transmitter and receiver
are equipped with multiple antennas. The basic problem is to design optimal
linear transceivers (or beamformers) that can maximize system throughput. The
recent work [1] suggests that optimal beamformers should maximize the total
degrees of fr... |
1009.3499 | Multiplicative Attribute Graph Model of Real-World Networks | cs.SI physics.soc-ph | Large scale real-world network data such as social and information networks
are ubiquitous. The study of such social and information networks seeks to find
patterns and explain their emergence through tractable models. In most
networks, and especially in social networks, nodes have a rich set of
attributes (e.g., age... |
1009.3514 | Reduced Complexity Decoding for Bit-Interleaved Coded Multiple
Beamforming with Constellation Precoding | cs.IT math.IT | Multiple beamforming is realized by singular value decomposition of the
channel matrix which is assumed to be known to both the transmitter and the
receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full
diversity as long as the code rate Rc and the number of employed subchannels S
satisfy the c... |
1009.3515 | Safe Feature Elimination in Sparse Supervised Learning | cs.LG math.OC | We investigate fast methods that allow to quickly eliminate variables
(features) in supervised learning problems involving a convex loss function and
a $l_1$-norm penalty, leading to a potentially substantial reduction in the
number of variables prior to running the supervised learning algorithm. The
methods are not ... |
1009.3520 | Bit-Interleaved Coded Multiple Beamforming with Perfect Coding | cs.IT math.IT | When the Channel State Information (CSI) is known by both the transmitter and
the receiver, beamforming techniques employing Singular Value Decomposition
(SVD) are commonly used in Multiple-Input Multiple-Output (MIMO) systems.
Without channel coding, there is a trade-off between full diversity and full
multiplexing.... |
1009.3525 | Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery with
Nonuniform Sparse Models\footnote{The results of this paper were presented in
part at the International Symposium on Information Theory, ISIT 2009} | cs.IT math.IT | In this paper we introduce a nonuniform sparsity model and analyze the
performance of an optimized weighted $\ell_1$ minimization over that sparsity
model. In particular, we focus on a model where the entries of the unknown
vector fall into two sets, with entries of each set having a specific
probability of being non... |
1009.3567 | Mobile Testbeds with an Attitude | cs.NI cs.RO cs.SI | There have been significant recent advances in mobile networks, specifically
in multi-hop wireless networks including DTNs and sensor networks. It is
critical to have a testing environment to realistically evaluate such networks
and their protocols and services. Towards this goal, we propose a novel, mobile
testbed o... |
1009.3589 | Deep Self-Taught Learning for Handwritten Character Recognition | cs.LG cs.CV cs.NE | Recent theoretical and empirical work in statistical machine learning has
demonstrated the importance of learning algorithms for deep architectures,
i.e., function classes obtained by composing multiple non-linear
transformations. Self-taught learning (exploiting unlabeled examples or
examples from other distribution... |
1009.3593 | Retrospective Interference Alignment | cs.IT math.IT | We explore similarities and differences in recent works on blind interference
alignment under different models such as staggered block fading model and the
delayed CSIT model. In particular we explore the possibility of achieving
interference alignment with delayed CSIT when the transmitters are distributed.
Our main... |
1009.3602 | Construction of Frequency Hopping Sequence Set Based upon Generalized
Cyclotomy | cs.IT math.IT | Frequency hopping (FH) sequences play a key role in frequency hopping spread
spectrum communication systems. It is important to find FH sequences which have
simultaneously good Hamming correlation, large family size and large period. In
this paper, a new set of FH sequences with large period is proposed, and the
Hamm... |
1009.3604 | Geometric Decision Tree | cs.LG | In this paper we present a new algorithm for learning oblique decision trees.
Most of the current decision tree algorithms rely on impurity measures to
assess the goodness of hyperplanes at each node while learning a decision tree
in a top-down fashion. These impurity measures do not properly capture the
geometric st... |
1009.3613 | On the Doubt about Margin Explanation of Boosting | cs.LG | Margin theory provides one of the most popular explanations to the success of
\texttt{AdaBoost}, where the central point lies in the recognition that
\textit{margin} is the key for characterizing the performance of
\texttt{AdaBoost}. This theory has been very influential, e.g., it has been
used to argue that \texttt{... |
1009.3642 | MIMO Identical Eigenmode Transmission System (IETS) - A Channel
Decomposition Perspective | cs.IT cs.NI math.IT | In the past few years considerable attention has been given to the design of
Multiple-Input Multiple-Output (MIMO) Eigenmode Transmission Systems (EMTS).
This paper presents an in-depth analysis of a new MIMO eigenmode transmission
strategy. The non-linear decomposition technique called Geometric Mean
Decomposition (... |
1009.3657 | On Bounded Weight Codes | cs.IT math.IT | The maximum size of a binary code is studied as a function of its length N,
minimum distance D, and minimum codeword weight W. This function B(N,D,W) is
first characterized in terms of its exponential growth rate in the limit as N
tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of
B(N,D,W) is... |
1009.3663 | Optimally Sparse Frames | math.NA cs.IT math.FA math.IT | Frames have established themselves as a means to derive redundant, yet stable
decompositions of a signal for analysis or transmission, while also promoting
sparse expansions. However, when the signal dimension is large, the computation
of the frame measurements of a signal typically requires a large number of
additio... |
1009.3665 | A Dynamic Data Middleware Cache for Rapidly-growing Scientific
Repositories | cs.DC cs.DB | Modern scientific repositories are growing rapidly in size. Scientists are
increasingly interested in viewing the latest data as part of query results.
Current scientific middleware cache systems, however, assume repositories are
static. Thus, they cannot answer scientific queries with the latest data. The
queries, i... |
1009.3702 | Totally Corrective Multiclass Boosting with Binary Weak Learners | cs.LG | In this work, we propose a new optimization framework for multiclass boosting
learning. In the literature, AdaBoost.MO and AdaBoost.ECC are the two
successful multiclass boosting algorithms, which can use binary weak learners.
We explicitly derive these two algorithms' Lagrange dual problems based on
their regularize... |
1009.3711 | Structural Learning of Attack Vectors for Generating Mutated XSS Attacks | cs.SE cs.CR cs.LG | Web applications suffer from cross-site scripting (XSS) attacks that
resulting from incomplete or incorrect input sanitization. Learning the
structure of attack vectors could enrich the variety of manifestations in
generated XSS attacks. In this study, we focus on generating more threatening
XSS attacks for the state... |
1009.3712 | Preventing SQL Injection through Automatic Query Sanitization with
ASSIST | cs.SE cs.DB | Web applications are becoming an essential part of our everyday lives. Many
of our activities are dependent on the functionality and security of these
applications. As the scale of these applications grows, injection
vulnerabilities such as SQL injection are major security challenges for
developers today. This paper ... |
1009.3713 | Relational Constraint Driven Test Case Synthesis for Web Applications | cs.SE cs.DB | This paper proposes a relational constraint driven technique that synthesizes
test cases automatically for web applications. Using a static analysis,
servlets can be modeled as relational transducers, which manipulate backend
databases. We present a synthesis algorithm that generates a sequence of HTTP
requests for s... |
1009.3728 | Network-Error Correcting Codes using Small Fields | cs.IT math.IT | Existing construction algorithms of block network-error correcting codes
require a rather large field size, which grows with the size of the network and
the number of sinks, and thereby can be prohibitive in large networks. In this
work, we give an algorithm which, starting from a given network-error
correcting code,... |
1009.3751 | Matching Dyadic Distributions to Channels | cs.IT math.IT math.PR | Many communication channels with discrete input have non-uniform capacity
achieving probability mass functions (PMF). By parsing a stream of independent
and equiprobable bits according to a full prefix-free code, a modu-lator can
generate dyadic PMFs at the channel input. In this work, we show that for
discrete memor... |
1009.3771 | An extensible web interface for databases and its application to storing
biochemical data | cs.PL cs.CE | This paper presents a generic web-based database interface implemented in
Prolog. We discuss the advantages of the implementation platform and
demonstrate the system's applicability in providing access to integrated
biochemical data. Our system exploits two libraries of SWI-Prolog to create a
schema-transparent inter... |
1009.3802 | Robust Low-Rank Subspace Segmentation with Semidefinite Guarantees | cs.CV cs.IT cs.LG math.IT | Recently there is a line of research work proposing to employ Spectral
Clustering (SC) to segment (group){Throughout the paper, we use segmentation,
clustering, and grouping, and their verb forms, interchangeably.}
high-dimensional structural data such as those (approximately) lying on
subspaces {We follow {liu2010ro... |
1009.3824 | Optimization and Convergence of Observation Channels in Stochastic
Control | math.OC cs.IT math.IT | This paper studies the optimization of observation channels (stochastic
kernels) in partially observed stochastic control problems. In particular,
existence and continuity properties are investigated mostly (but not
exclusively) concentrating on the single-stage case. Continuity properties of
the optimal cost in chan... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.