id
stringlengths
9
16
title
stringlengths
4
278
categories
listlengths
1
13
abstract
stringlengths
3
4.08k
filtered_category_membership
dict
1108.4940
Quantum rate distortion, reverse Shannon theorems, and source-channel separation
[ "quant-ph", "cs.IT", "math.IT" ]
We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data compression, and the source-channel separation theorem implies that a two-stage protocol ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.4942
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems
[ "cs.AI" ]
Dung's famous abstract argumentation frameworks represent the core formalism for many problems and applications in the field of argumentation which significantly evolved within the last decade. Recent work in the field has thus focused on implementations for these frameworks, whereby one of the main approaches is to us...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.4961
Non-trivial two-armed partial-monitoring games are bandits
[ "cs.LG" ]
We consider online learning in partial-monitoring games against an oblivious adversary. We show that when the number of actions available to the learner is two and the game is nontrivial then it is reducible to a bandit-like game and thus the minimax regret is $\Theta(\sqrt{T})$.
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.4973
Learning from Complex Systems: On the Roles of Entropy and Fisher Information in Pairwise Isotropic Gaussian Markov Random Fields
[ "cs.IT", "cs.AI", "cs.CV", "math.IT", "stat.CO" ]
Markov Random Field models are powerful tools for the study of complex systems. However, little is known about how the interactions between the elements of such systems are encoded, especially from an information-theoretic perspective. In this paper, our goal is to enlight the connection between Fisher information, Sha...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 1, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.4982
Synthesis of anisotropic suboptimal controllers by convex optimization
[ "cs.SY", "math.OC" ]
This paper considers a disturbance attenuation problem for a linear discrete time invariant system under random disturbances with imprecisely known probability distributions. The statistical uncertainty is measured in terms of relative entropy using the mean anisotropy functional. The disturbance attenuation capabiliti...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5002
Verbal Characterization of Probabilistic Clusters using Minimal Discriminative Propositions
[ "cs.AI" ]
In a knowledge discovery process, interpretation and evaluation of the mined results are indispensable in practice. In the case of data clustering, however, it is often difficult to see in what aspect each cluster has been formed. This paper proposes a method for automatic and objective characterization or "verbalizati...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5016
Une analyse bas\'ee sur la S-DRT pour la mod\'elisation de dialogues pathologiques
[ "cs.CL", "cs.AI" ]
In this article, we present a corpus of dialogues between a schizophrenic speaker and an interlocutor who drives the dialogue. We had identified specific discontinuities for paranoid schizophrenics. We propose a modeling of these discontinuities with S-DRT (its pragmatic part)
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5017
Event in Compositional Dynamic Semantics
[ "cs.CL", "cs.AI", "cs.LO" ]
We present a framework which constructs an event-style dis- course semantics. The discourse dynamics are encoded in continuation semantics and various rhetorical relations are embedded in the resulting interpretation of the framework. We assume discourse and sentence are distinct semantic objects, that play different r...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5019
Prescribing the motion of a set of particles in a 3D perfect fluid
[ "math.AP", "cs.SY", "math.OC" ]
We establish a result concerning the so-called Lagrangian controllability of the Euler equation for incompressible perfect fluids in dimension 3. More precisely we consider a connected bounded domain of R^3 and two smooth contractible sets of fluid particles, surrounding the same volume. We prove that given any initial...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5025
Robust Stackelberg game in communication systems
[ "cs.IT", "cs.GT", "math.IT" ]
This paper studies multi-user communication systems with two groups of users: leaders which possess system information, and followers which have no system information using the formulation of Stackelberg games. In such games, the leaders play and choose their actions based on their information about the system and the ...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5027
Encoding Phases using Commutativity and Non-commutativity in a Logical Framework
[ "cs.CL", "cs.AI", "cs.LO" ]
This article presents an extension of Minimalist Categorial Gram- mars (MCG) to encode Chomsky's phases. These grammars are based on Par- tially Commutative Logic (PCL) and encode properties of Minimalist Grammars (MG) of Stabler. The first implementation of MCG were using both non- commutative properties (to respect t...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5037
Orthonormal Expansion l1-Minimization Algorithms for Compressed Sensing
[ "cs.IT", "cs.SY", "math.IT", "math.OC" ]
Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is presented to reformulate the basis pursuit problem for noiseless compressed sensing...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5052
On the Quality of Wireless Network Connectivity
[ "cs.NI", "cs.IT", "math.IT" ]
Despite intensive research in the area of network connectivity, there is an important category of problems that remain unsolved: how to measure the quality of connectivity of a wireless multi-hop network which has a realistic number of nodes, not necessarily large enough to warrant the use of asymptotic analysis, and h...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5095
RBO Protocol: Broadcasting Huge Databases for Tiny Receivers
[ "cs.DS", "cs.DB", "cs.DC", "cs.DM", "cs.NI" ]
We propose a protocol (called RBO) for broadcasting long streams of single-packet messages over radio channel for tiny, battery powered, receivers. The messages are labeled by the keys from some linearly ordered set. The sender repeatedly broadcasts a sequence of many (possibly millions) of messages, while each receive...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5096
Minimalist Grammars and Minimalist Categorial Grammars, definitions toward inclusion of generated languages
[ "cs.CL" ]
Stabler proposes an implementation of the Chomskyan Minimalist Program, Chomsky 95 with Minimalist Grammars - MG, Stabler 97. This framework inherits a long linguistic tradition. But the semantic calculus is more easily added if one uses the Curry-Howard isomorphism. Minimalist Categorial Grammars - MCG, based on an ex...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5104
Improved Linear Programming Bounds on Sizes of Constant-Weight Codes
[ "cs.IT", "math.IT" ]
Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes li...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5128
Digital Self Triggered Robust Control of Nonlinear Systems
[ "math.OC", "cs.SY" ]
In this paper we develop novel results on self triggering control of nonlinear systems, subject to perturbations and actuation delays. First, considering an unperturbed nonlinear system with bounded actuation delays, we provide conditions that guarantee the existence of a self triggering control strategy stabilizing th...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5140
A convex formulation of strict anisotropic norm bounded real lemma
[ "cs.SY", "math.OC" ]
This paper is aimed at extending the H-infinity Bounded Real Lemma to stochastic systems under random disturbances with imprecisely known probability distributions. The statistical uncertainty is measured in entropy theoretic terms using the mean anisotropy functional. The disturbance attenuation capabilities of the sy...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5147
To Switch or Not To Switch: Understanding Social Influence in Recommender Systems
[ "cs.CY", "cs.HC", "cs.SI", "physics.soc-ph" ]
We designed and ran an experiment to test how often people's choices are reversed by others' recommendations when facing different levels of confirmation and conformity pressures. In our experiment participants were first asked to provide their preferences between pairs of items. They were then asked to make second cho...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 1, "cs.DB": 0, "cs.HC": 1, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5192
Positivity of the English language
[ "physics.soc-ph", "cs.CL" ]
Over the last million years, human language has emerged and evolved as a fundamental instrument of social communication and semiotic representation. People use language in part to convey emotional information, leading to the central and contingent questions: (1) What is the emotional spectrum of natural language? and (...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5212
Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood
[ "cs.IT", "math.IT" ]
We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The deinterleaver has access to a sample of the resulting interleaved process, but no knowledge of the number or structure of the component Mar...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5217
An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search
[ "q-bio.QM", "cs.CE", "q-bio.GN" ]
Extracting meaningful patterns from voluminous amount of biological data is a very big challenge. Motifs are biological patterns of great interest to biologists. Many different versions of the motif finding problem have been identified by researchers. Examples include the Planted $(l, d)$ Motif version, those based on ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 1, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5248
Optimal Coalition Structures in Cooperative Graph Games
[ "cs.GT", "cs.MA" ]
Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inherent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is computationally to optimize and solve such games. One prominent such language is the simple ...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 1, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5250
Single-trial EEG Discrimination between Wrist and Finger Movement Imagery and Execution in a Sensorimotor BCI
[ "cs.AI" ]
A brain-computer interface (BCI) may be used to control a prosthetic or orthotic hand using neural activity from the brain. The core of this sensorimotor BCI lies in the interpretation of the neural information extracted from electroencephalogram (EEG). It is desired to improve on the interpretation of EEG to allow peo...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5253
A Frequent Closed Itemsets Lattice-based Approach for Mining Minimal Non-Redundant Association Rules
[ "cs.DB" ]
There are many algorithms developed for improvement the time of mining frequent itemsets (FI) or frequent closed itemsets (FCI). However, the algorithms which deal with the time of generating association rules were not put in deep research. In reality, in case of a database containing many FI/FCI (from ten thousands up...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5316
Link Failure Detection in Multi-hop Control Networks
[ "math.OC", "cs.NI", "cs.SY" ]
A Multi-hop Control Network (MCN) consists of a plant where the communication between sensors, actuators and computational unit is supported by a wireless multi-hop communication network, and data flow is performed using scheduling and routing of sensing and actuation data. We characterize the problem of detecting the ...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5355
A tale of many cities: universal patterns in human urban mobility
[ "physics.soc-ph", "cs.SI" ]
The advent of geographic online social networks such as Foursquare, where users voluntarily signal their current location, opens the door to powerful studies on human movement. In particular the fine granularity of the location data, with GPS accuracy down to 10 meters, and the worldwide scale of Foursquare adoption ar...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5359
Solving Principal Component Pursuit in Linear Time via $l_1$ Filtering
[ "cs.NA", "cs.CV" ]
In the past decades, exactly recovering the intrinsic data structure from corrupted observations, which is known as robust principal component analysis (RPCA), has attracted tremendous interests and found many applications in computer vision. Recently, this problem has been formulated as recovering a low-rank component...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 1, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5387
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas
[ "cs.CC", "cs.IT", "math.IT" ]
It is discussed and surveyed a numerical method proposed before, that alternative to the usual compression method, provides an approximation to the algorithmic (Kolmogorov) complexity, particularly useful for short strings for which compression methods simply fail. The method shows to be stable enough and useful to con...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5395
Noise Covariance Properties in Dual-Tree Wavelet Decompositions
[ "math.ST", "cs.CV", "stat.TH" ]
Dual-tree wavelet decompositions have recently gained much popularity, mainly due to their ability to provide an accurate directional analysis of images combined with a reduced redundancy. When the decomposition of a random process is performed -- which occurs in particular when an additive noise is corrupting the sign...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 1, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5397
Prediction of peptide bonding affinity: kernel methods for nonlinear modeling
[ "stat.ML", "cs.LG", "q-bio.QM" ]
This paper presents regression models obtained from a process of blind prediction of peptide binding affinity from provided descriptors for several distinct datasets as part of the 2006 Comparative Evaluation of Prediction Algorithms (COEPRA) contest. This paper finds that kernel partial least squares, a nonlinear part...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5431
Providing information can be a stable non-cooperative evolutionary strategy
[ "q-bio.PE", "cs.NE" ]
Human language is still an embarrassment for evolutionary theory, as the speaker's benefit remains unclear. The willingness to communicate information is shown here to be an evolutionary stable strategy (ESS), even if acquiring original information from the environment involves significant cost and communicating it pro...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 1, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5450
Deterministic multidimensional growth model for small-world networks
[ "physics.data-an", "cs.SI" ]
We proposed a deterministic multidimensional growth model for small-world networks. The model can characterize the distinguishing properties of many real-life networks with geometric space structure. Our results show the model possesses small-world effect: larger clustering coefficient and smaller characteristic path l...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5451
A Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases
[ "cs.DB" ]
Within the research area of deductive databases three different database tasks have been deeply investigated: query evaluation, update propagation and view updating. Over the last thirty years various inference mechanisms have been proposed for realizing these main functionalities of a rule-based system. However, these...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5460
Personalized Web Services for Web Information Extraction
[ "cs.IR" ]
The field of information extraction from the Web emerged with the growth of the Web and the multiplication of online data sources. This paper is an analysis of information extraction methods. It presents a service oriented approach for web information extraction considering both web data management and extraction servi...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5475
The Dimension of Subcode-Subfields of Shortened Generalized Reed Solomon Codes
[ "cs.IT", "math.IT" ]
Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is static, the appropriate length can be obtained by an RS code by shortening or punc...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5491
Improving Ranking Using Quantum Probability
[ "cs.IR", "cs.ET", "cs.LG", "physics.data-an" ]
The paper shows that ranking information units by quantum probability differs from ranking them by classical probability provided the same data used for parameter estimation. As probability of detection (also known as recall or power) and probability of false alarm (also known as fallout or size) measure the quality of...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5505
Event-triggered and self-triggered stabilization of distributed networked control systems
[ "math.OC", "cs.SY" ]
Event-triggered and self-triggered control have recently been proposed as implementation strategies that considerably reduce the resources required for control. Although most of the work so far has focused on closing a single control loop, some researchers have started to investigate how these new implementation strate...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5514
Strategic Learning and Robust Protocol Design for Online Communities with Selfish Users
[ "cs.LG", "cs.GT", "cs.SI" ]
This paper focuses on analyzing the free-riding behavior of self-interested users in online communities. Hence, traditional optimization methods for communities composed of compliant users such as network utility maximization cannot be applied here. In our prior work, we show how social reciprocation protocols can be d...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5515
Robustness of a Tree-like Network of Interdependent Networks
[ "physics.data-an", "cs.SI", "physics.soc-ph" ]
In reality, many real-world networks interact with and depend on other networks. We develop an analytical framework for studying interacting networks and present an exact percolation law for a network of $n$ interdependent networks (NON). We present a general framework to study the dynamics of the cascading failures pr...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5520
A sentiment analysis of Singapore Presidential Election 2011 using Twitter data with census correction
[ "stat.AP", "cs.CL", "cs.SI" ]
Sentiment analysis is a new area in text analytics where it focuses on the analysis and understanding of the emotions from the text patterns. This new form of analysis has been widely adopted in customer relation management especially in the context of complaint management. With increasing level of interest in this tec...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5533
A Remark on the Lasso and the Dantzig Selector
[ "math.ST", "cs.IT", "math.FA", "math.IT", "stat.TH" ]
This article investigates a new parameter for the high-dimensional regression with noise: the distortion. This latter has attracted a lot of attention recently with the appearance of new deterministic constructions of 'almost'-Euclidean sections of the L1-ball. It measures how far is the intersection between the kernel...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5543
Multi-Robot Organisms: State of the Art
[ "cs.RO", "cs.NE", "cs.SY" ]
This paper represents the state of the art development on the field of artificial multi-robot organisms. It briefly considers mechatronic development, sensor and computational equipment, software framework and introduces one of the Grand Challenges for swarm and reconfigurable robotics.
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 1, "cs.RO": 1, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5547
Instantons causing iterative decoding to cycle
[ "cs.IT", "math.IT" ]
It is speculated that the most probable channel noise realizations (instantons) that cause the iterative decoding of low-density parity-check codes to fail make the decoding not to converge. The Wiberg's formula is generalized for the case when the part of a computational tree that contributes to the output at its cent...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5567
Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report
[ "cs.AI", "cs.CL" ]
Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In this work we propose and implement a new approach to CCG parsing that relies on ...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5575
Getting Beyond the State of the Art of Information Retrieval with Quantum Theory
[ "cs.IR", "cs.LG", "physics.data-an" ]
According to the probability ranking principle, the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key point of this principle is the separation of the document set into two subsets with ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5586
FdConfig: A Constraint-Based Interactive Product Configurator
[ "cs.AI" ]
We present a constraint-based approach to interactive product configuration. Our configurator tool FdConfig is based on feature models for the representation of the product domain. Such models can be directly mapped into constraint satisfaction problems and dealt with by appropriate constraint solvers. During the inter...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5592
A Performance Study of Data Mining Techniques: Multiple Linear Regression vs. Factor Analysis
[ "cs.DB" ]
The growing volume of data usually creates an interesting challenge for the need of data analysis tools that discover regularities in these data. Data mining has emerged as disciplines that contribute tools for data analysis, discovery of hidden knowledge, and autonomous decision making in many application domains. The...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5593
Unsteady Hydromagnetic Flow of Viscoelastic Fluid down an Open Inclined Channel
[ "physics.flu-dyn", "cs.CE" ]
In this paper, we study the unsteady hydromagnetic flow of a Walter's fluid (Model B') down an open inclined channel of width 2a and depth d under gravity, the walls of the channel being normal to the surface of the bottom under the influence of a uniform transverse magnetic field. A uniform tangential stress is applie...
{ "Other": 0, "cs.AI": 0, "cs.CE": 1, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5619
Modification of GTD from Flat File Format to OLAP for Data Mining
[ "cs.DB" ]
This document is part of original research work by the authors in a bid to explore new fields for applying Data Mining Techniques. The sample data is part of a large data set from University of Maryland (UMD) and outlines how more meaningful patterns can be discovered by preprocessing the data in the form of OLAP cubes...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5622
Optimization of Lyapunov Invariants in Verification of Software Systems (Extended Version)
[ "cs.SY", "cs.SE", "math.OC" ]
The paper proposes a control-theoretic framework for verification of numerical software systems, and puts forward software verification as an important application of control and systems theory. The idea is to transfer Lyapunov functions and the associated computational techniques from control systems analysis and conv...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5624
Multi-Robot Searching Algorithm Using Levy Flight and Artificial Potential Field
[ "cs.RO", "cs.SY" ]
An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 1, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5626
Nested HEX-Programs
[ "cs.AI" ]
Answer-Set Programming (ASP) is an established declarative programming paradigm. However, classical ASP lacks subprogram calls as in procedural programming, and access to external computations (like remote procedure calls) in general. The feature is desired for increasing modularity and---assuming proper access in plac...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5643
Collective Adaptive Systems: Challenges Beyond Evolvability
[ "cs.ET", "cs.CY", "cs.NE" ]
This position paper overviews several challenges of collective adaptive systems, which are beyond the research objectives of current top-projects in ICT, and especially in FET, initiatives. The attention is paid not only to challenges and new research topics, but also to their impact and potential breakthroughs in info...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 1, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 1, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5667
A prototype of a knowledge-based programming environment
[ "cs.AI", "cs.LO" ]
In this paper we present a proposal for a knowledge-based programming environment. In such an environment, declarative background knowledge, procedures, and concrete data are represented in suitable languages and combined in a flexible manner. This leads to a highly declarative programming style. We illustrate our appr...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5668
Datum-Wise Classification: A Sequential Approach to Sparsity
[ "cs.AI", "cs.LG" ]
We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation ...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5703
Web Pages Clustering: A New Approach
[ "cs.IR" ]
The rapid growth of web has resulted in vast volume of information. Information availability at a rapid speed to the user is vital. English language (or any for that matter) has lot of ambiguity in the usage of words. So there is no guarantee that a keyword based search engine will provide the required results. This pa...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5710
Generalized Fast Approximate Energy Minimization via Graph Cuts: Alpha-Expansion Beta-Shrink Moves
[ "cs.CV", "cs.AI" ]
We present alpha-expansion beta-shrink moves, a simple generalization of the widely-used alpha-beta swap and alpha-expansion algorithms for approximate energy minimization. We show that in a certain sense, these moves dominate both alpha-beta-swap and alpha-expansion moves, but unlike previous generalizations the new m...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 1, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5717
Structure Selection from Streaming Relational Data
[ "cs.AI" ]
Statistical relational learning techniques have been successfully applied in a wide range of relational domains. In most of these applications, the human designers capitalized on their background knowledge by following a trial-and-error trajectory, where relational features are manually defined by a human engineer, par...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5719
Computational topology for configuration spaces of hard disks
[ "math.AT", "cs.RO", "math-ph", "math.MP" ]
We explore the topology of configuration spaces of hard disks experimentally, and show that several changes in the topology can already be observed with a small number of particles. The results illustrate a theorem of Baryshnikov, Bubenik, and Kahle that critical points correspond to configurations of disks with balanc...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 1, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5720
Conjugate Variables as a Resource in Signal and Image Processing
[ "cs.CV", "physics.data-an", "quant-ph" ]
In this paper we develop a new technique to model joint distributions of signals. Our technique is based on quantum mechanical conjugate variables. We show that the transition probability of quantum states leads to a distance function on the signals. This distance function obeys the triangle inequality on all quantum s...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 1, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5724
On the Stability of Linear Discrete-Time Fuzzy Systems
[ "cs.SY", "math.OC" ]
In this paper the linear and stationary Discrete-time systems with state variables and dynamic coefficients represented by fuzzy numbers are studied, providing some stability criteria, and characterizing the bounds of the set of solutions in the case of positive systems.
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5756
Sensitivity And Out-Of-Sample Error in Continuous Time Data Assimilation
[ "physics.ao-ph", "cs.SY", "math.OC" ]
Data assimilation refers to the problem of finding trajectories of a prescribed dynamical model in such a way that the output of the model (usually some function of the model states) follows a given time series of observations. Typically though, these two requirements cannot both be met at the same time--tracking the o...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5781
Phase Transition in Distance-Based Phylogeny Reconstruction
[ "math.PR", "cs.CE", "cs.DS", "math.ST", "q-bio.PE", "stat.TH" ]
We introduce a new distance-based phylogeny reconstruction technique which provably achieves, at sufficiently short branch lengths, a logarithmic sequence-length requirement---improving significantly over previous polynomial bounds for distance-based methods and matching existing results for general methods. The techni...
{ "Other": 1, "cs.AI": 0, "cs.CE": 1, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5784
Probability Ranking in Vector Spaces
[ "cs.IR", "cs.LG" ]
The Probability Ranking Principle states that the document set with the highest values of probability of relevance optimizes information retrieval effectiveness given the probabilities are estimated as accurately as possible. The key point of the principle is the separation of the document set into two subsets with a g...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5794
A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions
[ "cs.AI" ]
In order to give appropriate semantics to qualitative conditionals of the form "if A then normally B", ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be used. An OCF accepting all conditionals of a knowledge base R can be characterized as the solution of a...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5825
Confidentiality-Preserving Data Publishing for Credulous Users by Extended Abduction
[ "cs.AI" ]
Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study a problem of confidentiality in extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how credulous non-monotonic reasoning affec...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5837
Translating Answer-Set Programs into Bit-Vector Logic
[ "cs.AI", "cs.LO" ]
Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The satisfiability modulo theories (SMT) framework follows a similar modelling philosophy but th...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5838
Off-grid Direction of Arrival Estimation Using Sparse Bayesian Inference
[ "stat.AP", "cs.IT", "math.IT", "stat.ML" ]
Direction of arrival (DOA) estimation is a classical problem in signal processing with many practical applications. Its research has recently been advanced owing to the development of methods based on sparse signal reconstruction. While these methods have shown advantages over conventional ones, there are still difficu...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5860
Linear Operator Inequality and Null Controllability with Vanishing Energy for unbounded control systems
[ "math.OC", "cs.SY", "math.AP" ]
We consider linear systems on a separable Hilbert space $H$, which are null controllable at some time $T_0>0$ under the action of a point or boundary control. Parabolic and hyperbolic control systems usually studied in applications are special cases. To every initial state $ y_0 \in H$ we associate the minimal "energy"...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.5881
Spread Decoding in Extension Fields
[ "cs.IT", "math.IT" ]
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a new representation of spread codes with a minimum distance decoding a...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5890
Coordinating Interfering Transmissions in Cooperative Wireless LANs
[ "cs.NI", "cs.IT", "math.IT" ]
In this paper we present a cooperative medium access control (MAC) protocol that is designed for a physical layer that can decode interfering transmissions in distributed wireless networks. The proposed protocol pro-actively enforces two independent packet transmissions to interfere in a controlled and cooperative mann...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5934
The Sznajd model with limited persuasion: competition between high-reputation and hesitant agents
[ "physics.soc-ph", "cond-mat.stat-mech", "cs.SI" ]
In this work we study a modified version of the two-dimensional Sznajd sociophysics model. In particular, we consider the effects of agents' reputations in the persuasion rules. In other words, a high-reputation group with a common opinion may convince their neighbors with probability $p$, which induces an increase of ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.5935
The Rabin cryptosystem revisited
[ "math.NT", "cs.CR", "cs.IT", "math.IT" ]
The Rabin public-key cryptosystem is revisited with a focus on the problem of identifying the encrypted message unambiguously for any pair of primes. In particular, a deterministic scheme using quartic reciprocity is described that works for primes congruent 5 modulo 8, a case that was still open. Both theoretical and ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 1, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5943
Proof System for Plan Verification under 0-Approximation Semantics
[ "cs.AI", "cs.LO" ]
In this paper a proof system is developed for plan verification problems $\{X\}c\{Y\}$ and $\{X\}c\{KW p\}$ under 0-approximation semantics for ${\mathcal A}_K$. Here, for a plan $c$, two sets $X,Y$ of fluent literals, and a literal $p$, $\{X\}c\{Y\}$ (resp. $\{X\}c\{KW p\}$) means that all literals of $Y$ become true ...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.5974
Emotional Analysis of Blogs and Forums Data
[ "cs.CL", "physics.data-an", "physics.soc-ph" ]
We perform a statistical analysis of emotionally annotated comments in two large online datasets, examining chains of consecutive posts in the discussions. Using comparisons with randomised data we show that there is a high level of correlation for the emotional content of messages.
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 1, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6003
Characterization and exploitation of community structure in cover song networks
[ "cs.IR", "cs.MM", "cs.SI", "physics.data-an", "stat.ML" ]
The use of community detection algorithms is explored within the framework of cover song identification, i.e. the automatic detection of different audio renditions of the same underlying musical piece. Until now, this task has been posed as a typical query-by-example task, where one submits a query song and the system ...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.6007
Domain-specific Languages in a Finite Domain Constraint Programming System
[ "cs.AI" ]
In this paper, we present domain-specific languages (DSLs) that we devised for their use in the implementation of a finite domain constraint programming system, available as library(clpfd) in SWI-Prolog and YAP-Prolog. These DSLs are used in propagator selection and constraint reification. In these areas, they lead to ...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6016
Improving Entity Resolution with Global Constraints
[ "cs.DB", "cs.IR" ]
Some of the greatest advances in web search have come from leveraging socio-economic properties of online user behavior. Past advances include PageRank, anchor text, hubs-authorities, and TF-IDF. In this paper, we investigate another socio-economic property that, to our knowledge, has not yet been exploited: sites that...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6031
Robust Adaptive Geometric Tracking Controls on SO(3) with an Application to the Attitude Dynamics of a Quadrotor UAV
[ "math.OC", "cs.SY" ]
This paper provides new results for a robust adaptive tracking control of the attitude dynamics of a rigid body. Both of the attitude dynamics and the proposed control system are globally expressed on the special orthogonal group, to avoid complexities and ambiguities associated with other attitude representations such...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.6046
Optimal Deterministic Polynomial-Time Data Exchange for Omniscience
[ "cs.IT", "cs.CR", "math.IT" ]
We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a common file but each has only partial knowledge about it as side-information. Assuming that the collective information among all the users is ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 1, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6088
No Internal Regret via Neighborhood Watch
[ "cs.LG", "cs.GT" ]
We present an algorithm which attains O(\sqrt{T}) internal (and thus external) regret for finite games with partial monitoring under the local observability condition. Recently, this condition has been shown by (Bartok, Pal, and Szepesvari, 2011) to imply the O(\sqrt{T}) rate for partial monitoring games against an i.i...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6113
A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks
[ "physics.soc-ph", "cs.DM", "cs.SI", "math.DS", "q-bio.MN" ]
It is well-known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient and applicable to ...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.6114
Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters
[ "cs.IT", "math.IT" ]
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the proje...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6121
The Value of Feedback in Decentralized Detection
[ "cs.IT", "math.IT", "stat.AP" ]
We consider the decentralized binary hypothesis testing problem in networks with feedback, where some or all of the sensors have access to compressed summaries of other sensors' observations. We study certain two-message feedback architectures, in which every sensor sends two messages to a fusion center, with the secon...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6132
Distributed MAC Protocol Supporting Physical-Layer Network Coding
[ "cs.NI", "cs.DC", "cs.IT", "math.IT" ]
Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified medium access control (MAC) protocols, which are not applicable to general multi-...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6146
Use of a speed equation for numerical simulation of hydraulic fractures
[ "physics.flu-dyn", "cs.CE" ]
The paper treats the propagation of a hydraulically driven crack. We explicitly write the local speed equation, which facilitates using the theory of propagating interfaces. It is shown that when neglecting the lag between the liquid front and the crack tip, the lubrication PDE yields that a solution satisfies the spee...
{ "Other": 0, "cs.AI": 0, "cs.CE": 1, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6150
A unified formulation of Gaussian vs. sparse stochastic processes - Part I: Continuous-domain theory
[ "cs.IT", "math.IT", "math.PR" ]
We introduce a general distributional framework that results in a unifying description and characterization of a rich variety of continuous-time stochastic processes. The cornerstone of our approach is an innovation model that is driven by some generalized white noise process, which may be Gaussian or not (e.g., Laplac...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6152
A unified formulation of Gaussian vs. sparse stochastic processes - Part II: Discrete-domain theory
[ "cs.IT", "math.IT", "math.PR" ]
This paper is devoted to the characterization of an extended family of CARMA (continuous-time autoregressive moving average) processes that are solutions of stochastic differential equations driven by white Levy innovations. These are completely specified by: (1) a set of poles and zeros that fixes their correlation st...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6175
Adaptive Locomotion of Multibody Snake-like Robot
[ "cs.RO", "cs.SY" ]
This paper represents an adaptive rhythmic control for a snake-like robot with 25 degrees of freedom. The adaptive gait control is implemented in algorithmic way in simulation and on a real robot. We investigated behavioral and energetic properties of this control and a dynamics of different body segments. It turned ou...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 1, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.6185
Weighted Reed-Muller codes revisited
[ "cs.IT", "math.IT" ]
We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio $|S_1|/|S_2|$ on the minimum distance. In conclusion the weighted Reed-Muller code const...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6197
Two-Level Fingerprinting Codes: Non-Trivial Constructions
[ "cs.IT", "math.IT" ]
We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes, to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the firs...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6198
Decision Support for e-Governance: A Text Mining Approach
[ "cs.DB", "cs.IR" ]
Information and communication technology has the capability to improve the process by which governments involve citizens in formulating public policy and public projects. Even though much of government regulations may now be in digital form (and often available online), due to their complexity and diversity, identifyin...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 1, "cs.HC": 0, "cs.IR": 1, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6208
Coprocessor - a Standalone SAT Preprocessor
[ "cs.AI" ]
In this work a stand-alone preprocessor for SAT is presented that is able to perform most of the known preprocessing techniques. Preprocessing a formula in SAT is important for performance since redundancy can be removed. The preprocessor is part of the SAT solver riss and is called Coprocessor. Not only riss, but also...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6211
Transfer from Multiple MDPs
[ "cs.AI", "cs.LG" ]
Transfer reinforcement learning (RL) methods leverage on the experience collected on a set of source tasks to speed-up RL algorithms. A simple and effective approach is to transfer samples from source tasks and include them into the training set used to solve a given target task. In this paper, we investigate the theor...
{ "Other": 0, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 1, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6214
Likelihood Consensus and Its Application to Distributed Particle Filtering
[ "stat.AP", "cs.IT", "math.IT" ]
We consider distributed state estimation in a wireless sensor network without a fusion center. Each sensor performs a global estimation task---based on the past and current measurements of all sensors---using only local processing and local communications with its neighbors. In this estimation task, the joint (all-sens...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6223
Towards Configuration of applied Web-based information system
[ "cs.SE", "cs.AI", "cs.DM", "cs.NI", "cs.SY", "math.OC" ]
In the paper, combinatorial synthesis of structure for applied Web-based systems is described. The problem is considered as a combination of selected design alternatives for system parts/components into a resultant composite decision (i.e., system configuration design). The solving framework is based on Hierarchical Mo...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 1 }
1108.6239
Efficient data compression from statistical physics of codes over finite fields
[ "cs.IT", "cond-mat.stat-mech", "math.IT" ]
In this paper we discuss a novel data compression technique for binary symmetric sources based on the cavity method over a Galois Field of order q (GF(q)). We present a scheme of low complexity and near optimal empirical performance. The compression step is based on a reduction of sparse low density parity check codes ...
{ "Other": 0, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }
1108.6260
Structural Routability of n-Pairs Information Networks
[ "cs.IT", "cs.NI", "cs.SI", "math.IT" ]
Information does not generally behave like a conservative fluid flow in communication networks with multiple sources and sinks. However, it is often conceptually and practically useful to be able to associate separate data streams with each source-sink pair, with only routing and no coding performed at the network node...
{ "Other": 1, "cs.AI": 0, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 1, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 1, "cs.SY": 0 }
1108.6274
Every Formula-Based Logic Program Has a Least Infinite-Valued Model
[ "cs.LO", "cs.AI" ]
Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering "set-inclusion". In the case of normal logic programs there do not exist least models in general. However, according to a recent approach by Rondogiannis and Wadge, who consider infinite-valued models...
{ "Other": 1, "cs.AI": 1, "cs.CE": 0, "cs.CL": 0, "cs.CR": 0, "cs.CV": 0, "cs.CY": 0, "cs.DB": 0, "cs.HC": 0, "cs.IR": 0, "cs.IT": 0, "cs.LG": 0, "cs.MA": 0, "cs.NE": 0, "cs.RO": 0, "cs.SD": 0, "cs.SI": 0, "cs.SY": 0 }