id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1008.3169 | Don't 'have a clue'? Unsupervised co-learning of downward-entailing
operators | cs.CL | Researchers in textual entailment have begun to consider inferences involving
'downward-entailing operators', an interesting and important class of lexical
items that change the way inferences are made. Recent work proposed a method
for learning English downward-entailing operators that requires access to a
high-qual... |
1008.3187 | Polynomial-Time Approximation Schemes for Knapsack and Related Counting
Problems using Branching Programs | cs.DS cs.CC cs.LG | We give a deterministic, polynomial-time algorithm for approximately counting
the number of {0,1}-solutions to any instance of the knapsack problem. On an
instance of length n with total weight W and accuracy parameter eps, our
algorithm produces a (1 + eps)-multiplicative approximation in time poly(n,log
W,1/eps). W... |
1008.3196 | Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot
Symbols | cs.IT math.IT | In this paper, we describe direct-sequence code-division multiple-access
(DS-CDMA) systems with quadriphase-shift keying in which channel estimation,
coherent demodulation, and decoding are iteratively performed without the use
of any training or pilot symbols. An expectation-maximization
channel-estimation algorithm... |
1008.3199 | General Auction-Theoretic Strategies for Distributed Partner Selection
in Cooperative Wireless Networks | cs.IT math.IT | It is unrealistic to assume that all nodes in an ad hoc wireless network
would be willing to participate in cooperative communication, especially if
their desired Quality-of- Service (QoS) is achievable via direct transmission.
An incentivebased auction mechanism is presented to induce cooperative behavior
in wireles... |
1008.3222 | Proofs for an Abstraction of Continuous Dynamical Systems Utilizing
Lyapunov Functions | cs.SY | In this report proofs are presented for a method for abstracting continuous
dynamical systems by timed automata. The method is based on partitioning the
state space of dynamical systems with invariant sets, which form cells
representing locations of the timed automata.
To enable verification of the dynamical system... |
1008.3282 | Modeling Spammer Behavior: Na\"ive Bayes vs. Artificial Neural Networks | cs.IR cs.AI | Addressing the problem of spam emails in the Internet, this paper presents a
comparative study on Na\"ive Bayes and Artificial Neural Networks (ANN) based
modeling of spammer behavior. Keyword-based spam email filtering techniques
fall short to model spammer behavior as the spammer constantly changes tactics
to circu... |
1008.3289 | Analyzing the Social Structure and Dynamics of E-mail and Spam in
Massive Backbone Internet Traffic | cs.SI | E-mail is probably the most popular application on the Internet, with
everyday business and personal communications dependent on it. Spam or
unsolicited e-mail has been estimated to cost businesses significant amounts of
money. However, our understanding of the network-level behavior of legitimate
e-mail traffic and ... |
1008.3295 | Optimal relay location and power allocation for low SNR broadcast relay
channels | cs.IT cs.NI math.IT | We consider the broadcast relay channel (BRC), where a single source
transmits to multiple destinations with the help of a relay, in the limit of a
large bandwidth. We address the problem of optimal relay positioning and power
allocations at source and relay, to maximize the multicast rate from source to
all destinat... |
1008.3301 | Modelling the Dynamics of an Aedes albopictus Population | cs.CE cs.FL q-bio.PE | We present a methodology for modelling population dynamics with formal means
of computer science. This allows unambiguous description of systems and
application of analysis tools such as simulators and model checkers. In
particular, the dynamics of a population of Aedes albopictus (a species of
mosquito) and its mode... |
1008.3303 | An Individual-based Probabilistic Model for Fish Stock Simulation | cs.FL cs.MA q-bio.PE | We define an individual-based probabilistic model of a sole (Solea solea)
behaviour. The individual model is given in terms of an Extended Probabilistic
Discrete Timed Automaton (EPDTA), a new formalism that is introduced in the
paper and that is shown to be interpretable as a Markov decision process. A
given EPDTA m... |
1008.3304 | An Analysis on the Influence of Network Topologies on Local and Global
Dynamics of Metapopulation Systems | cs.CE q-bio.PE | Metapopulations are models of ecological systems, describing the interactions
and the behavior of populations that live in fragmented habitats. In this
paper, we present a model of metapopulations based on the multivolume
simulation algorithm tau-DPP, a stochastic class of membrane systems, that we
utilize to investi... |
1008.3305 | Celer: an Efficient Program for Genotype Elimination | cs.DS cs.CE | This paper presents an efficient program for checking Mendelian consistency
in a pedigree. Since pedigrees may contain incomplete and/or erroneous
information, geneticists need to pre-process them before performing linkage
analysis. Removing superfluous genotypes that do not respect the Mendelian
inheritance laws can... |
1008.3306 | Modelling of Multi-Agent Systems: Experiences with Membrane Computing
and Future Challenges | cs.MA cs.FL | Formal modelling of Multi-Agent Systems (MAS) is a challenging task due to
high complexity, interaction, parallelism and continuous change of roles and
organisation between agents. In this paper we record our research experience on
formal modelling of MAS. We review our research throughout the last decade, by
describ... |
1008.3314 | Maximum entropy models and subjective interestingness: an application to
tiles in binary databases | cs.AI | Recent research has highlighted the practical benefits of subjective
interestingness measures, which quantify the novelty or unexpectedness of a
pattern when contrasted with any prior information of the data miner
(Silberschatz and Tuzhilin, 1995; Geng and Hamilton, 2006). A key challenge
here is the formalization of... |
1008.3346 | A Miniature-Based Image Retrieval System | cs.CV | Due to the rapid development of World Wide Web (WWW) and imaging technology,
more and more images are available in the Internet and stored in databases.
Searching the related images by the querying image is becoming tedious and
difficult. Most of the images on the web are compressed by methods based on
discrete cosin... |
1008.3402 | Modeling Corporate Epidemiology | cs.CY cs.SI | Corporate responses to illness is currently an ad-hoc, subjective process
that has little basis in data on how disease actually spreads at the workplace.
Additionally, many studies have shown that productivity is not an individual
factor but a social one: in any study on epidemic responses this social factor
has to b... |
1008.3408 | Good Random Matrices over Finite Fields | cs.IT math.CO math.IT | The random matrix uniformly distributed over the set of all m-by-n matrices
over a finite field plays an important role in many branches of information
theory. In this paper a generalization of this random matrix, called k-good
random matrices, is studied. It is shown that a k-good random m-by-n matrix
with a distrib... |
1008.3437 | Rate Region Frontiers for n-user Interference Channel with Interference
as Noise | cs.IT math.IT | This paper presents the achievable rate region frontiers for the n-user
interference channel when there is no cooperation at the transmit nor at the
receive side. The receiver is assumed to treat the interference as additive
thermal noise and does not employ multiuser detection. In this case, the rate
region frontier... |
1008.3443 | On weakly optimal partitions in modular networks | cs.SI cond-mat.stat-mech physics.soc-ph | Modularity was introduced as a measure of goodness for the community
structure induced by a partition of the set of vertices in a graph. Then, it
also became an objective function used to find good partitions, with high
success. Nevertheless, some works have shown a scaling limit and certain
instabilities when findin... |
1008.3450 | Bottleneck of using single memristor as a synapse and its solution | cs.NE | It is now widely accepted that memristive devices are perfect candidates for
the emulation of biological synapses in neuromorphic systems. This is mainly
because of the fact that like the strength of synapse, memristance of the
memristive device can be tuned actively (e.g., by the application of volt- age
or current)... |
1008.3551 | Inventory Allocation for Online Graphical Display Advertising | cs.CE | We discuss a multi-objective/goal programming model for the allocation of
inventory of graphical advertisements. The model considers two types of
campaigns: guaranteed delivery (GD), which are sold months in advance, and
non-guaranteed delivery (NGD), which are sold using real-time auctions. We
investigate various ad... |
1008.3585 | Ultrametric and Generalized Ultrametric in Computational Logic and in
Data Analysis | cs.LO cs.LG stat.ML | Following a review of metric, ultrametric and generalized ultrametric, we
review their application in data analysis. We show how they allow us to explore
both geometry and topology of information, starting with measured data. Some
themes are then developed based on the use of metric, ultrametric and
generalized ultra... |
1008.3597 | Quantization of Discrete Probability Distributions | cs.IT math.IT | We study the problem of quantization of discrete probability distributions,
arising in universal coding, as well as other applications. We show, that in
many situations this problem can be reduced to the covering problem for the
unit simplex. This setting yields precise asymptotic characterization in the
high-rate re... |
1008.3608 | Crystallized Rates Region of the Interference Channel via Correlated
Equilibrium with Interference as Noise | cs.IT math.IT | Treating the interference as noise in the n-user interference channel, the
paper describes a novel approach to the rates region, composed by the
time-sharing convex hull of 2^n-1 corner points achieved through On/Off binary
power control. The resulting rates region is denoted crystallized rates region.
By treating th... |
1008.3614 | Control and Optimization Meet the Smart Power Grid - Scheduling of Power
Demands for Optimal Energy Management | cs.NI cs.SY | The smart power grid aims at harnessing information and communication
technologies to enhance reliability and enforce sensible use of energy. Its
realization is geared by the fundamental goal of effective management of demand
load. In this work, we envision a scenario with real-time communication between
the operator... |
1008.3618 | Bayesian Hypothesis Testing for Sparse Representation | cs.IT math.IT | In this paper, we propose a Bayesian Hypothesis Testing Algorithm (BHTA) for
sparse representation. It uses the Bayesian framework to determine active atoms
in sparse representation of a signal.
The Bayesian hypothesis testing based on three assumptions, determines the
active atoms from the correlations and leads t... |
1008.3629 | Combining Clustering techniques and Formal Concept Analysis to
characterize Interestingness Measures | cs.IT math.IT | Formal Concept Analysis "FCA" is a data analysis method which enables to
discover hidden knowledge existing in data. A kind of hidden knowledge
extracted from data is association rules. Different quality measures were
reported in the literature to extract only relevant association rules. Given a
dataset, the choice o... |
1008.3641 | Capacity Limits of Multiuser Multiantenna Cognitive Networks | cs.IT math.IT | Unlike point-to-point cognitive radio, where the constraint imposed by the
primary rigidly curbs the secondary throughput, multiple secondary users have
the potential to more efficiently harvest the spectrum and share it among
themselves. This paper analyzes the sum throughput of a multiuser cognitive
radio system wi... |
1008.3651 | Accuracy guarantees for L1-recovery | math.ST cs.SY math.OC stat.TH | We discuss two new methods of recovery of sparse signals from noisy
observation based on $\ell_1$- minimization. They are closely related to the
well-known techniques such as Lasso and Dantzig Selector. However, these
estimators come with efficiently verifiable guaranties of performance. By
optimizing these bounds wi... |
1008.3654 | Minimax-optimal rates for sparse additive models over kernel classes via
convex programming | math.ST cs.IT math.IT stat.TH | Sparse additive models are families of $d$-variate functions that have the
additive decomposition $f^* = \sum_{j \in S} f^*_j$, where $S$ is an unknown
subset of cardinality $s \ll d$. In this paper, we consider the case where each
univariate component function $f^*_j$ lies in a reproducing kernel Hilbert
space (RKHS... |
1008.3667 | Pattern Classification In Symbolic Streams via Semantic Annihilation of
Information | cs.SC cs.CL cs.IT math.IT | We propose a technique for pattern classification in symbolic streams via
selective erasure of observed symbols, in cases where the patterns of interest
are represented as Probabilistic Finite State Automata (PFSA). We define an
additive abelian group for a slightly restricted subset of probabilistic finite
state aut... |
1008.3705 | Techniques for Enhanced Physical-Layer Security | cs.NI cs.IT math.IT | Information-theoretic security--widely accepted as the strictest notion of
security--relies on channel coding techniques that exploit the inherent
randomness of propagation channels to strengthen the security of communications
systems. Within this paradigm, we explore strategies to improve secure
connectivity in a wi... |
1008.3730 | Poisoned Feedback: The Impact of Malicious Users in Closed-Loop
Multiuser MIMO Systems | cs.IT math.IT | Accurate channel state information (CSI) at the transmitter is critical for
maximizing spectral efficiency on the downlink of multi-antenna networks. In
this work we analyze a novel form of physical layer attacks on such closed-loop
wireless networks. Specifically, this paper considers the impact of
deliberately inac... |
1008.3742 | Optimally Training a Cascade Classifier | cs.CV | Cascade classifiers are widely used in real-time object detection. Different
from conventional classifiers that are designed for a low overall
classification error rate, a classifier in each node of the cascade is required
to achieve an extremely high detection rate and moderate false positive rate.
Although there ar... |
1008.3743 | Data Cleaning and Query Answering with Matching Dependencies and
Matching Functions | cs.DB | Matching dependencies were recently introduced as declarative rules for data
cleaning and entity resolution. Enforcing a matching dependency on a database
instance identifies the values of some attributes for two tuples, provided that
the values of some other attributes are sufficiently similar. Assuming the
existenc... |
1008.3746 | Belief Propagation Algorithm for Portfolio Optimization Problems | q-fin.PM cond-mat.stat-mech cs.LG math.OC q-fin.RM | The typical behavior of optimal solutions to portfolio optimization problems
with absolute deviation and expected shortfall models using replica analysis
was pioneeringly estimated by S. Ciliberti and M. M\'ezard [Eur. Phys. B. 57,
175 (2007)]; however, they have not yet developed an approximate derivation
method for... |
1008.3751 | ElasTraS: An Elastic Transactional Data Store in the Cloud | cs.DB | Over the last couple of years, "Cloud Computing" or "Elastic Computing" has
emerged as a compelling and successful paradigm for internet scale computing.
One of the major contributing factors to this success is the elasticity of
resources. In spite of the elasticity provided by the infrastructure and the
scalable des... |
1008.3760 | Formal-language-theoretic Optimal Path Planning For Accommodation of
Amortized Uncertainties and Dynamic Effects | cs.RO cs.SY math.OC | We report a globally-optimal approach to robotic path planning under
uncertainty, based on the theory of quantitative measures of formal languages.
A significant generalization to the language-measure-theoretic path planning
algorithm $\nustar$ is presented that explicitly accounts for average dynamic
uncertainties a... |
1008.3776 | Green Modulations in Energy-Constrained Wireless Sensor Networks | cs.IT math.IT | Due to the unique characteristics of sensor devices, finding the
energy-efficient modulation with a low-complexity implementation (refereed to
as green modulation) poses significant challenges in the physical layer design
of Wireless Sensor Networks (WSNs). Toward this goal, we present an in-depth
analysis on the ene... |
1008.3788 | Doubly Exponential Solution for Randomized Load Balancing Models with
General Service Times | cs.DM cs.IT cs.NI cs.PF math.IT | In this paper, we provide a novel and simple approach to study the
supermarket model with general service times. This approach is based on the
supplementary variable method used in analyzing stochastic models extensively.
We organize an infinite-size system of integral-differential equations by means
of the density d... |
1008.3795 | Machine Science in Biomedicine: Practicalities, Pitfalls and Potential | cs.IR cs.CE physics.data-an physics.med-ph | Machine Science, or Data-driven Research, is a new and interesting scientific
methodology that uses advanced computational techniques to identify, retrieve,
classify and analyse data in order to generate hypotheses and develop models.
In this paper we describe three recent biomedical Machine Science studies, and
use ... |
1008.3798 | Proliferating cell nuclear antigen (PCNA) allows the automatic
identification of follicles in microscopic images of human ovarian tissue | cs.CV | Human ovarian reserve is defined by the population of nongrowing follicles
(NGFs) in the ovary. Direct estimation of ovarian reserve involves the
identification of NGFs in prepared ovarian tissue. Previous studies involving
human tissue have used hematoxylin and eosin (HE) stain, with NGF populations
estimated by hum... |
1008.3800 | Network Complexity of Foodwebs | nlin.AO cs.IT cs.SI math.IT | In previous work, I have developed an information theoretic complexity
measure of networks. When applied to several real world food webs, there is a
distinct difference in complexity between the real food web, and randomised
control networks obtained by shuffling the network links. One hypothesis is
that this complex... |
1008.3813 | The Approximate Capacity of the Gaussian N-Relay Diamond Network | cs.IT math.IT | We consider the Gaussian "diamond" or parallel relay network, in which a
source node transmits a message to a destination node with the help of N
relays. Even for the symmetric setting, in which the channel gains to the
relays are identical and the channel gains from the relays are identical, the
capacity of this cha... |
1008.3829 | Approximate Judgement Aggregation | cs.GT cs.AI cs.LG | In this paper we analyze judgement aggregation problems in which a group of
agents independently votes on a set of complex propositions that has some
interdependency constraint between them(e.g., transitivity when describing
preferences). We consider the issue of judgement aggregation from the
perspective of approxim... |
1008.3879 | A formalism for causal explanations with an Answer Set Programming
translation | cs.AI | We examine the practicality for a user of using Answer Set Programming (ASP)
for representing logical formalisms. Our example is a formalism aiming at
capturing causal explanations from causal information. We show the naturalness
and relative efficiency of this translation job. We are interested in the ease
for writi... |
1008.3926 | Stochastic blockmodels and community structure in networks | physics.soc-ph cond-mat.stat-mech cs.SI physics.data-an | Stochastic blockmodels have been proposed as a tool for detecting community
structure in networks as well as for generating synthetic networks for use as
benchmarks. Most blockmodels, however, ignore variation in vertex degree,
making them unsuitable for applications to real-world networks, which typically
display br... |
1008.3932 | Multiple Timescale Dispatch and Scheduling for Stochastic Reliability in
Smart Grids with Wind Generation Integration | cs.SY cs.PF | Integrating volatile renewable energy resources into the bulk power grid is
challenging, due to the reliability requirement that at each instant the load
and generation in the system remain balanced. In this study, we tackle this
challenge for smart grid with integrated wind generation, by leveraging
multi-timescale ... |
1008.3977 | Collaborative Structuring of Knowledge by Experts and the Public | cs.DL cs.SI | There is much debate on how public participation and expertise can be brought
together in collaborative knowledge environments. One of the experiments
addressing the issue directly is Citizendium. In seeking to harvest the
strengths (and avoiding the major pitfalls) of both user-generated wiki
projects and traditiona... |
1008.3998 | Cognitive Radio Transmission Strategies for Primary Erasure Channels | cs.IT math.IT | A fundamental problem in cognitive radio systems is that the cognitive radio
is ignorant of the primary channel state and the interference it inflicts on
the primary license holder. In this paper we assume that the primary
transmitter sends packets across an erasure channel and the primary receiver
employs ACK/NAK fe... |
1008.4000 | NESVM: a Fast Gradient Method for Support Vector Machines | cs.LG stat.ML | Support vector machines (SVMs) are invaluable tools for many practical
applications in artificial intelligence, e.g., classification and event
recognition. However, popular SVM solvers are not sufficiently efficient for
applications with a great deal of samples as well as a large number of
features. In this paper, th... |
1008.4049 | Discriminating between Nasal and Mouth Breathing | cs.NE | The recommendation to change breathing patterns from the mouth to the nose
can have a significantly positive impact upon the general well being of the
individual. We classify nasal and mouth breathing by using an acoustic sensor
and intelligent signal processing techniques. The overall purpose is to
investigate the p... |
1008.4063 | Nonlinear Quality of Life Index | cs.NE stat.AP | We present details of the analysis of the nonlinear quality of life index for
171 countries. This index is based on four indicators: GDP per capita by
Purchasing Power Parities, Life expectancy at birth, Infant mortality rate, and
Tuberculosis incidence. We analyze the structure of the data in order to find
the optim... |
1008.4071 | Hybrid tractability of soft constraint problems | cs.AI cs.DS | The constraint satisfaction problem (CSP) is a central generic problem in
computer science and artificial intelligence: it provides a common framework
for many theoretical problems as well as for many real-life applications. Soft
constraint problems are a generalisation of the CSP which allow the user to
model optimi... |
1008.4115 | Noise in Naming Games, partial synchronization and community detection
in social networks | cs.MA cs.SI | The Naming Games (NG) are agent-based models for agreement dynamics, peer
pressure and herding in social networks, and protocol selection in autonomous
ad-hoc sensor networks. By introducing a small noise term to the NG, the
resulting Markov Chain model called Noisy Naming Games (NNG) are ergodic, in
which all partia... |
1008.4135 | Interpreting quantum discord through quantum state merging | quant-ph cs.IT math.IT | We present an operational interpretation of quantum discord based on the
quantum state merging protocol. Quantum discord is the markup in the cost of
quantum communication in the process of quantum state merging, if one discards
relevant prior information. Our interpretation has an intuitive explanation
based on the ... |
1008.4153 | Improvement of the Han-Kobayashi Rate Region for General Interference
Channel | cs.IT math.IT | Allowing the input auxiliary random variables to be correlated and using the
binning scheme, the Han- Kobayashi (HK) rate region for general interference
channel is improved. The obtained new achievable rate region (i) is shown to
encompass the HK region and its simplified description, i.e., Chong-Motani-Garg
(CMG) r... |
1008.4157 | A New Achievable Rate Region for the Cognitive Radio Channel | cs.IT math.IT | Considering a general input distribution, using Gel'fand-Pinsker full binning
scheme and the Han- Kobayashi (HK) jointly decoding strategy, we obtain a new
achievable rate region for the cognitive radio channel (CRC) and then derive a
simplified description for the region, by a combination of Cover superposition
codi... |
1008.4161 | Percolation and Connectivity in the Intrinsically Secure Communications
Graph | cs.IT cs.NI math.IT | The ability to exchange secret information is critical to many commercial,
governmental, and military networks. The intrinsically secure communications
graph (iS-graph) is a random graph which describes the connections that can be
securely established over a large-scale network, by exploiting the physical
properties ... |
1008.4177 | LDPC Codes from Latin Squares Free of Small Trapping Sets | cs.IT math.IT | This paper is concerned with the construction of low-density parity-check
(LDPC) codes with low error floors. Two main contributions are made. First, a
new class of structured LDPC codes is introduced. The parity check matrices of
these codes are arrays of permutation matrices which are obtained from Latin
squares an... |
1008.4182 | Exact Synchronization for Finite-State Sources | nlin.CD cs.IT math.DS math.IT stat.ML | We analyze how an observer synchronizes to the internal state of a
finite-state information source, using the epsilon-machine causal
representation. Here, we treat the case of exact synchronization, when it is
possible for the observer to synchronize completely after a finite number of
observations. The more difficul... |
1008.4184 | Direct Data Domain STAP using Sparse Representation of Clutter Spectrum | cs.IT math.IT | Space-time adaptive processing (STAP) is an effective tool for detecting a
moving target in the airborne radar system. Due to the fast-changing clutter
scenario and/or non side-looking configuration, the stationarity of the
training data is destroyed such that the statistical-based methods suffer
performance degradat... |
1008.4185 | Airborne Radar STAP using Sparse Recovery of Clutter Spectrum | cs.IT math.IT | Space-time adaptive processing (STAP) is an effective tool for detecting a
moving target in spaceborne or airborne radar systems. Statistical-based STAP
methods generally need sufficient statistically independent and identically
distributed (IID) training data to estimate the clutter characteristics.
However, most ac... |
1008.4206 | Comparative Study of Statistical Skin Detection Algorithms for
Sub-Continental Human Images | cs.CV | Object detection has been a focus of research in human-computer interaction.
Skin area detection has been a key to different recognitions like face
recognition, human motion detection, pornographic and nude image prediction,
etc. Most of the research done in the fields of skin detection has been trained
and tested on... |
1008.4220 | Structured sparsity-inducing norms through submodular functions | cs.LG math.OC stat.ML | Sparse methods for supervised learning aim at finding good linear predictors
from as few variables as possible, i.e., with small cardinality of their
supports. This combinatorial selection problem is often turned into a convex
optimization problem by replacing the cardinality function by its convex
envelope (tightest... |
1008.4221 | Performance of Optimum and Suboptimum Combining Diversity Reception for
Binary DPSK over Independent, Nonidentical Rayleigh Fading Channels | cs.IT math.IT | This paper is concerned with the error performance analysis of binary
differential phase shift keying with differential detection over the
nonselective, Rayleigh fading channel with combining diversity reception. Space
antenna diversity reception is assumed. The diversity branches are independent,
but have nonidentic... |
1008.4232 | Online Learning in Case of Unbounded Losses Using the Follow Perturbed
Leader Algorithm | cs.LG | In this paper the sequential prediction problem with expert advice is
considered for the case where losses of experts suffered at each step cannot be
bounded in advance. We present some modification of Kalai and Vempala algorithm
of following the perturbed leader where weights depend on past losses of the
experts. Ne... |
1008.4249 | Machine Learning Approaches for Modeling Spammer Behavior | cs.IR cs.AI | Spam is commonly known as unsolicited or unwanted email messages in the
Internet causing potential threat to Internet Security. Users spend a valuable
amount of time deleting spam emails. More importantly, ever increasing spam
emails occupy server storage space and consume network bandwidth. Keyword-based
spam email ... |
1008.4257 | Learning from Profession Knowledge: Application on Knitting | cs.AI | Knowledge Management is a global process in companies. It includes all the
processes that allow capitalization, sharing and evolution of the Knowledge
Capital of the firm, generally recognized as a critical resource of the
organization. Several approaches have been defined to capitalize knowledge but
few of them stud... |
1008.4264 | Network Protection Design Using Network Coding | cs.IT cs.NI math.IT | Link and node failures are two common fundamental problems that affect
operational networks. Protection of communication networks against such
failures is essential for maintaining network reliability and performance.
Network protection codes (NPC) are proposed to protect operational networks
against link and node fa... |
1008.4268 | An Influence Diagram-Based Approach for Estimating Staff Training in
Software Industry | cs.SE cs.AI | The successful completion of a software development process depends on the
analytical capability and foresightedness of the project manager. For the
project manager, the main intriguing task is to manage the risk factors as they
adversely influence the completion deadline. One such key risk factor is staff
training. ... |
1008.4296 | Uncertainty Principles and Balian-Low type Theorems in Principal
Shift-Invariant Spaces | math.FA cs.IT math.IT | In this paper, we consider the time-frequency localization of the generator
of a principal shift-invariant space on the real line which has additional
shift-invariance. We prove that if a principal shift-invariant space on the
real line is translation-invariant then any of its orthonormal (or Riesz)
generators is non... |
1008.4310 | Mod\'elisation d'une analyse pragma-linguistique d'un forum de
discussion | cs.AI cs.IR | We present in this paper, a modelling of an expertise in pragmatics. We
follow knowledge engineering techniques and observe the expert when he analyses
a social discussion forum. Then a number of models are defined. These models
emphasises the process followed by the expert and a number of criteria used in
his analys... |
1008.4326 | Machine learning for constraint solver design -- A case study for the
alldifferent constraint | cs.AI | Constraint solvers are complex pieces of software which require many design
decisions to be made by the implementer based on limited information. These
decisions affect the performance of the finished solver significantly. Once a
design decision has been made, it cannot easily be reversed, although a
different decisi... |
1008.4328 | Distributed solving through model splitting | cs.AI | Constraint problems can be trivially solved in parallel by exploring
different branches of the search tree concurrently. Previous approaches have
focused on implementing this functionality in the solver, more or less
transparently to the user. We propose a new approach, which modifies the
constraint model of the prob... |
1008.4348 | Collaborative Spectrum Sensing from Sparse Observations in Cognitive
Radio Networks | cs.IT math.IT | Spectrum sensing, which aims at detecting spectrum holes, is the precondition
for the implementation of cognitive radio (CR). Collaborative spectrum sensing
among the cognitive radio nodes is expected to improve the ability of checking
complete spectrum usage. Due to hardware limitations, each cognitive radio node
ca... |
1008.4370 | Fourier Domain Decoding Algorithm of Non-Binary LDPC codes for Parallel
Implementation | cs.IT cs.AR math.IT | For decoding non-binary low-density parity check (LDPC) codes,
logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing
quantization effects of SP algorithm in conjunction with FFT. Since FFT is not
applicable in the logarithm domain, the computations required at check nodes in
the Log-SP algorithm... |
1008.4406 | Structural Solutions to Dynamic Scheduling for Multimedia Transmission
in Unknown Wireless Environments | cs.MM cs.LG cs.SY | In this paper, we propose a systematic solution to the problem of scheduling
delay-sensitive media data for transmission over time-varying wireless
channels. We first formulate the dynamic scheduling problem as a Markov
decision process (MDP) that explicitly considers the users' heterogeneous
multimedia data characte... |
1008.4416 | Registration-based Compensation using Sparse Representation in
Conformal-array STAP | cs.IT math.IT | Space-time adaptive processing (STAP) is a well-known technique in detecting
slow-moving targets in the presence of a clutter-spreading environment. When
considering the STAP system deployed with conformal radar array (CFA), the
training data are range-dependent, which results in poor detection performance
of traditi... |
1008.4474 | An Algebraic View to Gradient Descent Decoding | cs.IT math.CO math.IT | There are two gradient descent decoding procedures for binary codes proposed
independently by Liebler and by Ashikhmin and Barg. Liebler in his paper
mentions that both algorithms have the same philosophy but in fact they are
rather different. The purpose of this communication is to show that both
algorithms can be s... |
1008.4532 | Switching between Hidden Markov Models using Fixed Share | cs.LG | In prediction with expert advice the goal is to design online prediction
algorithms that achieve small regret (additional loss on the whole data)
compared to a reference scheme. In the simplest such scheme one compares to the
loss of the best expert in hindsight. A more ambitious goal is to split the
data into segmen... |
1008.4535 | Explicit constructions of RIP matrices and related problems | math.NT cs.IT math.IT | We give a new explicit construction of $n\times N$ matrices satisfying the
Restricted Isometry Property (RIP). Namely, for some c>0, large N and any n
satisfying N^{1-c} < n < N, we construct RIP matrices of order k^{1/2+c}. This
overcomes the natural barrier k=O(n^{1/2}) for proofs based on small coherence,
which ar... |
1008.4564 | Study on some interconnecting bilayer networks | physics.soc-ph cs.SI | We present a model, in which some nodes (called interconnecting nodes) in two
networks merge and play the roles in both the networks. The model analytic and
simulation discussions show a monotonically increasing dependence of
interconnecting node topological position difference and a monotonically
decreasing dependen... |
1008.4565 | On the Transmission-Computation-Energy Tradeoff in Wireless and Fixed
Networks | cs.IT math.IT | In this paper, a framework for the analysis of the
transmission-computation-energy tradeoff in wireless and fixed networks is
introduced. The analysis of this tradeoff considers both the transmission
energy as well as the energy consumed at the receiver to process the received
signal. While previous work considers li... |
1008.4627 | Matching Dependencies with Arbitrary Attribute Values: Semantics, Query
Answering and Integrity Constraints | cs.DB | Matching dependencies (MDs) were introduced to specify the identification or
matching of certain attribute values in pairs of database tuples when some
similarity conditions are satisfied. Their enforcement can be seen as a natural
generalization of entity resolution. In what we call the "pure case" of MDs,
any value... |
1008.4654 | Freezing and Sleeping: Tracking Experts that Learn by Evolving Past
Posteriors | cs.LG | A problem posed by Freund is how to efficiently track a small pool of experts
out of a much larger set. This problem was solved when Bousquet and Warmuth
introduced their mixing past posteriors (MPP) algorithm in 2001.
In Freund's problem the experts would normally be considered black boxes.
However, in this paper ... |
1008.4658 | A high speed unsupervised speaker retrieval using vector quantization
and second-order statistics | cs.IR cs.SD | This paper describes an effective unsupervised method for query-by-example
speaker retrieval. We suppose that only one speaker is in each audio file or in
audio segment. The audio data are modeled using a common universal codebook.
The codebook is based on bag-of-frames (BOF). The features corresponding to the
audio ... |
1008.4662 | Automated Acanthamoeba polyphaga detection and computation of Salmonella
typhimurium concentration in spatio-temporal images | q-bio.QM cs.CV q-bio.PE | Interactions between bacteria and protozoa is an increasing area of interest,
however there are a few systems that allow extensive observation of the
interactions. We examined a surface system consisting of non nutrient agar with
a uniform bacterial lawn that extended over the agar surface, and a spatially
localised ... |
1008.4669 | An Architecture of Active Learning SVMs with Relevance Feedback for
Classifying E-mail | cs.IR cs.LG | In this paper, we have proposed an architecture of active learning SVMs with
relevance feedback (RF)for classifying e-mail. This architecture combines both
active learning strategies where instead of using a randomly selected training
set, the learner has access to a pool of unlabeled instances and can request
the la... |
1008.4705 | Trust and Partner Selection in Social Networks: An Experimentally
Grounded Model | physics.soc-ph cs.SI | This paper presents an experimentally grounded model on the relevance of
partner selection for the emergence of trust and cooperation among individuals.
By combining experimental evidence and network simulation, our model
investigates the link of interaction outcome and social structure formation and
shows that dynam... |
1008.4733 | Gelfand-Pinsker coding achieves the interference-free capacity | cs.IT math.IT | For a discrete memoryless channel with non-causal state information available
only at the encoder, it is well-known that Gelfand-Pinsker coding achieves its
capacity. In this paper, we analyze Gelfand-Pinsker coding scheme and capacity
to bring out further understandings. We show that Gelfand-Pinsker capacity is
equa... |
1008.4747 | Entanglement-assisted quantum low-density parity-check codes | cs.IT math.CO math.IT quant-ph | This paper develops a general method for constructing entanglement-assisted
quantum low-density parity-check (LDPC) codes, which is based on combinatorial
design theory. Explicit constructions are given for entanglement-assisted
quantum error-correcting codes (EAQECCs) with many desirable properties. These
properties... |
1008.4815 | Recommender Systems by means of Information Retrieval | cs.IR | In this paper we present a method for reformulating the Recommender Systems
problem in an Information Retrieval one. In our tests we have a dataset of
users who give ratings for some movies; we hide some values from the dataset,
and we try to predict them again using its remaining portion (the so-called
"leave-n-out ... |
1008.4831 | Foundations of Inference | math.PR cs.AI math.LO math.ST physics.data-an stat.TH | We present a simple and clear foundation for finite inference that unites and
significantly extends the approaches of Kolmogorov and Cox. Our approach is
based on quantifying lattices of logical statements in a way that satisfies
general lattice symmetries. With other applications such as measure theory in
mind, our ... |
1008.4870 | On Euclidean Norm Approximations | cs.NA cs.CV | Euclidean norm calculations arise frequently in scientific and engineering
applications. Several approximations for this norm with differing complexity
and accuracy have been proposed in the literature. Earlier approaches were
based on minimizing the maximum error. Recently, Seol and Cheun proposed an
approximation b... |
1008.4873 | Spiking Neurons with ASNN Based-Methods for the Neural Block Cipher | cs.CR cs.NE | Problem statement: This paper examines Artificial Spiking Neural Network
(ASNN) which inter-connects group of artificial neurons that uses a
mathematical model with the aid of block cipher. The aim of undertaken this
research is to come up with a block cipher where by the keys are randomly
generated by ASNN which can... |
1008.4895 | LIFO-Backpressure Achieves Near Optimal Utility-Delay Tradeoff | math.OC cs.SY | There has been considerable recent work developing a new stochastic network
utility maximization framework using Backpressure algorithms, also known as
MaxWeight. A key open problem has been the development of utility-optimal
algorithms that are also delay efficient. In this paper, we show that the
Backpressure algor... |
1008.4896 | Optimal Routing with Mutual Information Accumulation in Wireless
Networks | math.OC cs.IT cs.NI math.IT | We investigate optimal routing and scheduling strategies for multi-hop
wireless networks with rateless codes. Rateless codes allow each node of the
network to accumulate mutual information from every packet transmission. This
enables a significant performance gain over conventional shortest path routing.
Further, it ... |
1008.4916 | Random road networks: the quadtree model | cs.DM cs.SI | What does a typical road network look like? Existing generative models tend
to focus on one aspect to the exclusion of others. We introduce the
general-purpose \emph{quadtree model} and analyze its shortest paths and
maximum flow.
|
1008.4941 | Pairwise Optimal Discrete Coverage Control for Gossiping Robots | cs.RO math.OC | We propose distributed algorithms to automatically deploy a group of robotic
agents and provide coverage of a discretized environment represented by a
graph. The classic Lloyd approach to coverage optimization involves separate
centering and partitioning steps and converges to the set of centroidal Voronoi
partitions... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.