id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1003.4830 | Limits of Commutativity on Abstract Data Types | cs.DB | We present some formal properties of (symmetrical) commutativity, the major
criterion used in transactional systems, which allow us to fully understand its
advantages and disadvantages. The main result is that commutativity is subject
to the same limitation as compatibility for arbitrary objects. However,
commutativi... |
1003.4831 | Ball on a beam: stabilization under saturated input control with large
basin of attraction | cs.RO cs.SY physics.med-ph | This article is devoted to the stabilization of two underactuated planar
systems, the well-known straight beam-and-ball system and an original circular
beam-and-ball system. The feedback control for each system is designed, using
the Jordan form of its model, linearized near the unstable equilibrium. The
limits on th... |
1003.4836 | Automating Fine Concurrency Control in Object-Oriented Databases | cs.DB | Several propositions were done to provide adapted concurrency control to
object-oriented databases. However, most of these proposals miss the fact that
considering solely read and write access modes on instances may lead to less
parallelism than in relational databases! This paper cope with that issue, and
advantages... |
1003.4852 | Product Perfect Z2Z4-linear codes in Steganography | cs.IT math.IT | Product perfect codes have been proven to enhance the performance of the F5
steganographic method, whereas perfect Z2Z4-linear codes have been recently
introduced as an efficient way to embed data, conforming to the
+/-1-steganography. In this paper, we present two steganographic methods. On
the one hand, a generaliz... |
1003.4879 | Large Constant Dimension Codes and Lexicodes | cs.IT math.IT | Constant dimension codes, with a prescribed minimum distance, have found
recently an application in network coding. All the codewords in such a code are
subspaces of $\F_q^n$ with a given dimension. A computer search for large
constant dimension codes is usually inefficient since the search space domain
is extremely ... |
1003.4894 | La repr\'esentation formelle des concepts spatiaux dans la langue | cs.CL | In this chapter, we assume that systematically studying spatial markers
semantics in language provides a means to reveal fundamental properties and
concepts characterizing conceptual representations of space. We propose a
formal system accounting for the properties highlighted by the linguistic
analysis, and we use t... |
1003.4898 | Les entit\'es spatiales dans la langue : \'etude descriptive, formelle
et exp\'erimentale de la cat\'egorisation | cs.CL | While previous linguistic and psycholinguistic research on space has mainly
analyzed spatial relations, the studies reported in this paper focus on how
language distinguishes among spatial entities. Descriptive and experimental
studies first propose a classification of entities, which accounts for both
static and dyn... |
1003.4944 | Incorporating Side Information in Probabilistic Matrix Factorization
with Gaussian Processes | stat.ML cs.LG | Probabilistic matrix factorization (PMF) is a powerful method for modeling
data associated with pairwise relationships, finding use in collaborative
filtering, computational biology, and document analysis, among other areas. In
many domains, there is additional information that can assist in prediction.
For example, ... |
1003.4972 | Quickest Time Herding and Detection for Optimal Social Learning | cs.IT math.IT math.OC physics.soc-ph | This paper considers social learning amongst rational agents (for example,
sensors in a network). We consider three models of social learning in
increasing order of sophistication. In the first model, based on its private
observation of a noisy underlying state process, each agent selfishly optimizes
its local utilit... |
1003.4994 | Weak Decoupling Duality and Quantum Identification | quant-ph cs.IT math.IT | If a quantum system is subject to noise, it is possible to perform quantum
error correction reversing the action of the noise if and only if no
information about the system's quantum state leaks to the environment. In this
article, we develop an analogous duality in the case that the environment
approximately forgets... |
1003.5042 | Local Popularity based Page Link Analysis | cs.IR | In this paper we introduce the concept of dynamic link pages. A web site/page
contains a number of links to other pages. All the links are not equally
important. Few links are more frequently visited and few rarely visited. In
this scenario, identifying the frequently used links and placing them in the
top left corne... |
1003.5056 | Cubes convexes | cs.DB | In various approaches, data cubes are pre-computed in order to answer
efficiently OLAP queries. The notion of data cube has been declined in various
ways: iceberg cubes, range cubes or differential cubes. In this paper, we
introduce the concept of convex cube which captures all the tuples of a
datacube satisfying a c... |
1003.5080 | Transparent Anonymization: Thwarting Adversaries Who Know the Algorithm | cs.DB | Numerous generalization techniques have been proposed for privacy preserving
data publishing. Most existing techniques, however, implicitly assume that the
adversary knows little about the anonymization algorithm adopted by the data
publisher. Consequently, they cannot guard against privacy attacks that exploit
vario... |
1003.5097 | Power Loading in Parallel Diversity Channels Based on Statistical
Channel Information | cs.IT math.IT | In this paper, we show that there exists an arbitrary number of power
allocation schemes that achieve capacity in systems operating in parallel
channels comprised of single-input multiple-output (SIMO) Nakagami-m fading
subchannels when the number of degrees of freedom L (e.g., the number of
receive antennas) tends t... |
1003.5173 | LEXSYS: Architecture and Implication for Intelligent Agent systems | cs.AI | LEXSYS, (Legume Expert System) was a project conceived at IITA (International
Institute of Tropical Agriculture) Ibadan Nigeria. It was initiated by the
COMBS (Collaborative Group on Maize-Based Systems Research in the 1990. It was
meant for a general framework for characterizing on-farm testing for technology
design... |
1003.5212 | Diversity-Multiplexing Tradeoff of Cooperative Communication with Linear
Network Coded Relays | cs.IT math.IT | Network coding and cooperative communication have received considerable
attention from the research community recently in order to mitigate the adverse
effects of fading in wireless transmissions and at the same time to achieve
high throughput and better spectral efficiency. In this work, we analyze a
network coding ... |
1003.5249 | Active Testing for Face Detection and Localization | cs.CV | We provide a novel search technique, which uses a hierarchical model and a
mutual information gain heuristic to efficiently prune the search space when
localizing faces in images. We show exponential gains in computation over
traditional sliding window approaches, while keeping similar performance
levels.
|
1003.5305 | Rational Value of Information Estimation for Measurement Selection | cs.AI | Computing value of information (VOI) is a crucial task in various aspects of
decision-making under uncertainty, such as in meta-reasoning for search; in
selecting measurements to make, prior to choosing a course of action; and in
managing the exploration vs. exploitation tradeoff. Since such applications
typically re... |
1003.5309 | Gossip Algorithms for Distributed Signal Processing | cs.DC cs.IT cs.NI math.IT | Gossip algorithms are attractive for in-network processing in sensor networks
because they do not require any specialized routing, there is no bottleneck or
single point of failure, and they are robust to unreliable wireless network
conditions. Recently, there has been a surge of activity in the computer
science, con... |
1003.5320 | The Video Genome | cs.CV | Fast evolution of Internet technologies has led to an explosive growth of
video data available in the public domain and created unprecedented challenges
in the analysis, organization, management, and control of such content. The
problems encountered in video analysis such as identifying a video in a large
database (e... |
1003.5325 | What's in a Session: Tracking Individual Behavior on the Web | cs.HC cs.MA physics.soc-ph | We examine the properties of all HTTP requests generated by a thousand
undergraduates over a span of two months. Preserving user identity in the data
set allows us to discover novel properties of Web traffic that directly affect
models of hypertext navigation. We find that the popularity of Web sites -- the
number of... |
1003.5327 | Agents, Bookmarks and Clicks: A topical model of Web traffic | cs.NI cs.IR cs.MA physics.soc-ph | Analysis of aggregate and individual Web traffic has shown that PageRank is a
poor model of how people navigate the Web. Using the empirical traffic patterns
generated by a thousand users, we characterize several properties of Web
traffic that cannot be reproduced by Markovian models. We examine both
aggregate statis... |
1003.5345 | Bounds for the Sum Capacity of Binary CDMA Systems in Presence of
Near-Far Effect | cs.IT math.IT | In this paper we are going to estimate the sum capacity of a binary CDMA
system in presence of the near-far effect. We model the near-far effect as a
random variable that is multiplied by the users binary data before entering the
noisy channel. We will find a lower bound and a conjectured upper bound for the
sum capa... |
1003.5350 | An Improved Algorithm for Generating Database Transactions from
Relational Algebra Specifications | cs.DB cs.LO cs.PL | Alloy is a lightweight modeling formalism based on relational algebra. In
prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have
presented a tool, Alchemy, that compiles Alloy specifications into
implementations that execute against persistent databases. The foundation of
Alchemy is an algorithm for ... |
1003.5372 | Learning Recursive Segments for Discourse Parsing | cs.CL | Automatically detecting discourse segments is an important preliminary step
towards full discourse parsing. Previous research on discourse segmentation
have relied on the assumption that elementary discourse units (EDUs) in a
document always form a linear sequence (i.e., they can never be nested).
Unfortunately, this... |
1003.5435 | Image Compression and Watermarking scheme using Scalar Quantization | cs.CV cs.MM | This paper presents a new compression technique and image watermarking
algorithm based on Contourlet Transform (CT). For image compression, an energy
based quantization is used. Scalar quantization is explored for image
watermarking. Double filter bank structure is used in CT. The Laplacian Pyramid
(LP) is used to ca... |
1003.5455 | Towards physical laws for software architecture | cs.SE cs.IR physics.data-an physics.soc-ph | Starting from the pioneering works on software architecture precious
guidelines have emerged to indicate how computer programs should be organized.
For example the "separation of concerns" suggests to split a program into
modules that overlap in functionality as little as possible. However these
recommendations are m... |
1003.5623 | Spoken Language Identification Using Hybrid Feature Extraction Methods | cs.SD cs.LG | This paper introduces and motivates the use of hybrid robust feature
extraction technique for spoken language identification (LID) system. The
speech recognizers use a parametric form of a signal to get the most important
distinguishable features of speech signal for recognition task. In this paper
Mel-frequency ceps... |
1003.5627 | Wavelet-Based Mel-Frequency Cepstral Coefficients for Speaker
Identification using Hidden Markov Models | cs.SD cs.LG | To improve the performance of speaker identification systems, an effective
and robust method is proposed to extract speech features, capable of operating
in noisy environment. Based on the time-frequency multi-resolution property of
wavelet transform, the input speech signal is decomposed into various frequency
chann... |
1003.5648 | The Error-Pattern-Correcting Turbo Equalizer | cs.IT math.IT | The error-pattern correcting code (EPCC) is incorporated in the design of a
turbo equalizer (TE) with aim to correct dominant error events of the
inter-symbol interference (ISI) channel at the output of its matching Viterbi
detector. By targeting the low Hamming-weight interleaved errors of the outer
convolutional co... |
1003.5693 | An Iteratively Decodable Tensor Product Code with Application to Data
Storage | cs.IT math.IT | The error pattern correcting code (EPCC) can be constructed to provide a
syndrome decoding table targeting the dominant error events of an inter-symbol
interference channel at the output of the Viterbi detector. For the size of the
syndrome table to be manageable and the list of possible error events to be
reasonable... |
1003.5749 | Etiqueter un corpus oral par apprentissage automatique \`a l'aide de
connaissances linguistiques | cs.LG cs.CL | Thanks to the Eslo1 ("Enqu\^ete sociolinguistique d'Orl\'eans", i.e.
"Sociolinguistic Inquiery of Orl\'eans") campain, a large oral corpus has been
gathered and transcribed in a textual format. The purpose of the work presented
here is to associate a morpho-syntactic label to each unit of this corpus. To
this aim, we... |
1003.5771 | Analysis of a CSMA-Based Wireless Network: Feasible Throughput Region
and Power Consumption | cs.GT cs.IT math.IT | We analytically study a carrier sense multiple access (CSMA)-based network.
In the network, the nodes have their own average throughput demands for
transmission to a common base station. The CSMA is based on the request-to-send
(RTS)/clear-to-send (CTS) handshake mechanism. Each node individually chooses
its probabil... |
1003.5821 | Tuning CLD Maps | cs.CV | The Coherence Length Diagram and the related maps have been shown to
represent a useful tool for image analysis. Setting threshold parameters is one
of the most important issues when dealing with such applications, as they
affect both the computability, which is outlined by the support map, and the
appearance of the ... |
1003.5861 | Robust multi-camera view face recognition | cs.CV | This paper presents multi-appearance fusion of Principal Component Analysis
(PCA) and generalization of Linear Discriminant Analysis (LDA) for multi-camera
view offline face recognition (verification) system. The generalization of LDA
has been extended to establish correlations between the face classes in the
transfo... |
1003.5865 | Offline Signature Identification by Fusion of Multiple Classifiers using
Statistical Learning Theory | cs.CV cs.LG | This paper uses Support Vector Machines (SVM) to fuse multiple classifiers
for an offline signature system. From the signature images, global and local
features are extracted and the signatures are verified with the help of
Gaussian empirical rule, Euclidean and Mahalanobis distance based classifiers.
SVM is used to ... |
1003.5886 | Development of a multi-user handwriting recognition system using
Tesseract open source OCR engine | cs.CV | The objective of the paper is to recognize handwritten samples of lower case
Roman script using Tesseract open source Optical Character Recognition (OCR)
engine under Apache License 2.0. Handwritten data samples containing isolated
and free-flow text were collected from different users. Tesseract is trained
with user... |
1003.5891 | Recognition of Handwritten Roman Script Using Tesseract Open source OCR
Engine | cs.CV | In the present work, we have used Tesseract 2.01 open source Optical
Character Recognition (OCR) Engine under Apache License 2.0 for recognition of
handwriting samples of lower case Roman script. Handwritten isolated and
free-flow text samples were collected from multiple users. Tesseract is trained
to recognize user... |
1003.5893 | Recognition of Handwritten Textual Annotations using Tesseract Open
Source OCR Engine for information Just In Time (iJIT) | cs.CV | Objective of the current work is to develop an Optical Character Recognition
(OCR) engine for information Just In Time (iJIT) system that can be used for
recognition of handwritten textual annotations of lower case Roman script.
Tesseract open source OCR engine under Apache License 2.0 is used to develop
user-specifi... |
1003.5897 | Development of a Multi-User Recognition Engine for Handwritten Bangla
Basic Characters and Digits | cs.CV | The objective of the paper is to recognize handwritten samples of basic
Bangla characters using Tesseract open source Optical Character Recognition
(OCR) engine under Apache License 2.0. Handwritten data samples containing
isolated Bangla basic characters and digits were collected from different
users. Tesseract is t... |
1003.5898 | Recognition of handwritten Roman Numerals using Tesseract open source
OCR engine | cs.CV | The objective of the paper is to recognize handwritten samples of Roman
numerals using Tesseract open source Optical Character Recognition (OCR)
engine. Tesseract is trained with data samples of different persons to generate
one user-independent language model, representing the handwritten Roman
digit-set. The system... |
1003.5899 | Geometric Algebra Model of Distributed Representations | cs.AI | Formalism based on GA is an alternative to distributed representation models
developed so far --- Smolensky's tensor product, Holographic Reduced
Representations (HRR) and Binary Spatter Code (BSC). Convolutions are replaced
by geometric products, interpretable in terms of geometry which seems to be the
most natural ... |
1003.5956 | Unbiased Offline Evaluation of Contextual-bandit-based News Article
Recommendation Algorithms | cs.LG cs.AI cs.RO stat.ML | Contextual bandit algorithms have become popular for online recommendation
systems such as Digg, Yahoo! Buzz, and news recommendation in general.
\emph{Offline} evaluation of the effectiveness of new algorithms in these
applications is critical for protecting online user experiences but very
challenging due to their ... |
1003.5966 | Integer-Forcing Linear Receivers | cs.IT math.IT | Linear receivers are often used to reduce the implementation complexity of
multiple-antenna systems. In a traditional linear receiver architecture, the
receive antennas are used to separate out the codewords sent by each transmit
antenna, which can then be decoded individually. Although easy to implement,
this approa... |
1003.5993 | A Triple-Error-Correcting Cyclic Code from the Gold and Kasami-Welch APN
Power Functions | cs.DM cs.IT math.IT | Based on a sufficient condition proposed by Hollmann and Xiang for
constructing triple-error-correcting codes, the minimum distance of a binary
cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $\alpha$, $\alpha^3$, and
$\alpha^{13}$ of length $2^m-1$ and the weight divisibility of its dual code
are studied, where ... |
1003.5998 | A New Mechanism for Maintaining Diversity of Pareto Archive in
Multiobjective Optimization | math.OC cs.NE | The article introduces a new mechanism for selecting individuals to a Pareto
archive. It was combined with a micro-genetic algorithm and tested on several
problems. The ability of this approach to produce individuals uniformly
distributed along the Pareto set without negative impact on convergence is
demonstrated on ... |
1003.6052 | Development of an automated Red Light Violation Detection System (RLVDS)
for Indian vehicles | cs.CV | Integrated Traffic Management Systems (ITMS) are now implemented in different
cities in India to primarily address the concerns of road-safety and security.
An automated Red Light Violation Detection System (RLVDS) is an integral part
of the ITMS. In our present work we have designed and developed a complete
system f... |
1003.6059 | A novel scheme for binarization of vehicle images using hierarchical
histogram equalization technique | cs.CV | Automatic License Plate Recognition system is a challenging area of research
now-a-days and binarization is an integral and most important part of it. In
case of a real life scenario, most of existing methods fail to properly
binarize the image of a vehicle in a congested road, captured through a CCD
camera. In the c... |
1003.6082 | Coding Schemes and Asymptotic Capacity of the Gaussian Broadcast and
Interference Channels with Feedback | cs.IT math.IT | A coding scheme is proposed for the memoryless Gaussian broadcast channel
with correlated noises and feedback. For all noise correlations other than -1,
the gap between the sum-rate the scheme achieves and the full-cooperation bound
vanishes as the signal-to-noise ratio tends to infinity. When the correlation
coeffic... |
1003.6091 | Calculation of Mutual Information for Partially Coherent Gaussian
Channels with Applications to Fiber Optics | cs.IT math.IT | The mutual information between a complex-valued channel input and its
complex-valued output is decomposed into four parts based on polar coordinates:
an amplitude term, a phase term, and two mixed terms. Numerical results for the
additive white Gaussian noise (AWGN) channel with various inputs show that, at
high sign... |
1004.0027 | Interference in Lattice Networks | cs.IT math.IT | Lattices are important as models for the node locations in wireless networks
for two main reasons: (1) When network designers have control over the
placement of the nodes, they often prefer a regular arrangement in a lattice
for coverage and interference reasons. (2) If nodes are randomly distributed or
mobile, good ... |
1004.0048 | Anonimos: An LP based Approach for Anonymizing Weighted Social Network
Graphs | cs.DB | The increasing popularity of social networks has initiated a fertile research
area in information extraction and data mining. Anonymization of these social
graphs is important to facilitate publishing these data sets for analysis by
external entities. Prior work has concentrated mostly on node identity
anonymization ... |
1004.0085 | A stochastic model of human visual attention with a dynamic Bayesian
network | cs.CV cs.MM cs.NE stat.ML | Recent studies in the field of human vision science suggest that the human
responses to the stimuli on a visual display are non-deterministic. People may
attend to different locations on the same visual input at the same time. Based
on this knowledge, we propose a new stochastic model of visual attention by
introduci... |
1004.0092 | Maximal Intersection Queries in Randomized Input Models | cs.IR | Consider a family of sets and a single set, called the query set. How can one
quickly find a member of the family which has a maximal intersection with the
query set? Time constraints on the query and on a possible preprocessing of the
set family make this problem challenging. Such maximal intersection queries
arise ... |
1004.0180 | Precoded Turbo Equalizer for Power Line Communication Systems | cs.IT math.IT | Power line communication continues to draw increasing interest by promising a
wide range of applications including cost-free last-mile communication
solution. However, signal transmitted through the power lines deteriorates
badly due to the presence of severe inter-symbol interference (ISI) and harsh
random pulse noi... |
1004.0208 | Delay-rate tradeoff in ergodic interference alignment | cs.IT math.IT math.PR | Ergodic interference alignment, as introduced by Nazer et al (NGJV), is a
technique that allows high-rate communication in n-user interference networks
with fast fading. It works by splitting communication across a pair of fading
matrices. However, it comes with the overhead of a long time delay until
matchable matri... |
1004.0258 | Trends and Techniques in Visual Gaze Analysis | cs.HC cs.CV cs.GR cs.MM | Visualizing gaze data is an effective way for the quick interpretation of eye
tracking results. This paper presents a study investigation benefits and
limitations of visual gaze analysis among eye tracking professionals and
researchers. The results were used to create a tool for visual gaze analysis
within a Master's... |
1004.0269 | The Degraded Poisson Wiretap Channel | cs.IT math.IT | Providing security guarantees for wireless communication is critically
important for today's applications. While previous work in this area has
concentrated on radio frequency (RF) channels, providing security guarantees
for RF channels is inherently difficult because they are prone to rapid
variations due small scal... |
1004.0346 | Network Code Design for Orthogonal Two-hop Network with Broadcasting
Relay: A Joint Source-Channel-Network Coding Approach | cs.IT math.IT | This paper addresses network code design for robust transmission of sources
over an orthogonal two-hop wireless network with a broadcasting relay. The
network consists of multiple sources and destinations in which each
destination, benefiting the relay signal, intends to decode a subset of the
sources. Two special in... |
1004.0366 | Dense Error-Correcting Codes in the Lee Metric | cs.IT math.IT | Several new applications and a number of new mathematical techniques have
increased the research on error-correcting codes in the Lee metric in the last
decade. In this work we consider several coding problems and constructions of
error-correcting codes in the Lee metric. First, we consider constructions of
dense err... |
1004.0378 | Facial Expression Representation and Recognition Using 2DHLDA, Gabor
Wavelets, and Ensemble Learning | cs.CV cs.LG | In this paper, a novel method for representation and recognition of the
facial expressions in two-dimensional image sequences is presented. We apply a
variation of two-dimensional heteroscedastic linear discriminant analysis
(2DHLDA) algorithm, as an efficient dimensionality reduction technique, to
Gabor representati... |
1004.0381 | Gossip and Distributed Kalman Filtering: Weak Consensus under Weak
Detectability | cs.IT math.DS math.IT math.OC math.PR | The paper presents the gossip interactive Kalman filter (GIKF) for
distributed Kalman filtering for networked systems and sensor networks, where
inter-sensor communication and observations occur at the same time-scale. The
communication among sensors is random; each sensor occasionally exchanges its
filtering state i... |
1004.0382 | Multigrid preconditioning of linear systems for interior point methods
applied to a class of box-constrained optimal control problems | math.NA cs.SY math.OC | In this article we construct and analyze multigrid preconditioners for
discretizations of operators of the form D+K* K, where D is the multiplication
with a relatively smooth positive function and K is a compact linear operator.
These systems arise when applying interior point methods to the minimization
problem min_... |
1004.0383 | Multiuser Diversity Gain in Cognitive Networks | cs.IT math.IT | Dynamic allocation of resources to the \emph{best} link in large multiuser
networks offers considerable improvement in spectral efficiency. This gain,
often referred to as \emph{multiuser diversity gain}, can be cast as
double-logarithmic growth of the network throughput with the number of users.
In this paper we con... |
1004.0393 | Object-image correspondence for curves under finite and affine cameras | cs.CV math.AG | We provide criteria for deciding whether a given planar curve is an image of
a given spatial curve, obtained by a central or a parallel projection with
unknown parameters. These criteria reduce the projection problem to a certain
modification of the equivalence problem of planar curves under affine and
projective tra... |
1004.0400 | A new bound for the capacity of the deletion channel with high deletion
probabilities | cs.IT math.IT | Let $C(d)$ be the capacity of the binary deletion channel with deletion
probability $d$. It was proved by Drinea and Mitzenmacher that, for all $d$,
$C(d)/(1-d)\geq 0.1185 $. Fertonani and Duman recently showed that
$\limsup_{d\to 1}C(d)/(1-d)\leq 0.49$. In this paper, it is proved that
$\lim_{d\to 1}C(d)/(1-d)$ exis... |
1004.0402 | Improved Sparse Recovery Thresholds with Two-Step Reweighted $\ell_1$
Minimization | cs.IT math.IT | It is well known that $\ell_1$ minimization can be used to recover
sufficiently sparse unknown signals from compressed linear measurements. In
fact, exact thresholds on the sparsity, as a function of the ratio between the
system dimensions, so that with high probability almost all sparse signals can
be recovered from... |
1004.0456 | Exploratory Analysis of Functional Data via Clustering and Optimal
Segmentation | stat.ML cs.LG | We propose in this paper an exploratory analysis algorithm for functional
data. The method partitions a set of functions into $K$ clusters and represents
each cluster by a simple prototype (e.g., piecewise constant). The total number
of segments in the prototypes, $P$, is chosen by the user and optimally
distributed ... |
1004.0458 | The quantum dynamic capacity formula of a quantum channel | quant-ph cs.IT math.IT | The dynamic capacity theorem characterizes the reliable communication rates
of a quantum channel when combined with the noiseless resources of classical
communication, quantum communication, and entanglement. In prior work, we
proved the converse part of this theorem by making contact with many previous
results in th... |
1004.0477 | Decentralized event-triggered control over wireless sensor/actuator
networks | math.OC cs.SY | In recent years we have witnessed a move of the major industrial automation
providers into the wireless domain. While most of these companies already offer
wireless products for measurement and monitoring purposes, the ultimate goal is
to be able to close feedback loops over wireless networks interconnecting
sensors,... |
1004.0512 | Analysis, Interpretation, and Recognition of Facial Action Units and
Expressions Using Neuro-Fuzzy Modeling | cs.CV | In this paper an accurate real-time sequence-based system for representation,
recognition, interpretation, and analysis of the facial action units (AUs) and
expressions is presented. Our system has the following characteristics: 1)
employing adaptive-network-based fuzzy inference systems (ANFIS) and temporal
informat... |
1004.0514 | Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard
Walks | cs.NE | This paper extends the analogies employed in the development of
quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard
walks, called QHW. A novel quantum-inspired evolutionary algorithm, called
HQEA, for solving combinatorial optimization problems, is also proposed. The
novelty of HQEA lies i... |
1004.0515 | Recognizing Combinations of Facial Action Units with Different Intensity
Using a Mixture of Hidden Markov Models and Neural Network | cs.CV cs.LG | Facial Action Coding System consists of 44 action units (AUs) and more than
7000 combinations. Hidden Markov models (HMMs) classifier has been used
successfully to recognize facial action units (AUs) and expressions due to its
ability to deal with AU dynamics. However, a separate HMM is necessary for each
single AU a... |
1004.0517 | Multilinear Biased Discriminant Analysis: A Novel Method for Facial
Action Unit Representation | cs.CV cs.LG | In this paper a novel efficient method for representation of facial action
units by encoding an image sequence as a fourth-order tensor is presented. The
multilinear tensor-based extension of the biased discriminant analysis (BDA)
algorithm, called multilinear biased discriminant analysis (MBDA), is first
proposed. T... |
1004.0534 | Impact of Connection Admission Process on the Direct Retry Load
Balancing Algorithm in Cellular Network | cs.NI cs.IT cs.PF math.IT | We present an analytical framework for modeling a priority-based load
balancing scheme in cellular networks based on a new algorithm called direct
retry with truncated offloading channel resource pool (DR$_{K}$). The model,
developed for a baseline case of two cell network, differs in many respects
from previous work... |
1004.0542 | Cognitive Interference Management in Retransmission-Based Wireless
Networks | cs.IT math.IT | Cognitive radio methodologies have the potential to dramatically increase the
throughput of wireless systems. Herein, control strategies which enable the
superposition in time and frequency of primary and secondary user transmissions
are explored in contrast to more traditional sensing approaches which only
allow the... |
1004.0557 | Applications of Lindeberg Principle in Communications and Statistical
Learning | cs.IT math.IT | We use a generalization of the Lindeberg principle developed by Sourav
Chatterjee to prove universality properties for various problems in
communications, statistical learning and random matrix theory. We also show
that these systems can be viewed as the limiting case of a properly defined
sparse system. The latter r... |
1004.0567 | Using Rough Set and Support Vector Machine for Network Intrusion
Detection | cs.LG cs.CR cs.NI | The main function of IDS (Intrusion Detection System) is to protect the
system, analyze and predict the behaviors of users. Then these behaviors will
be considered an attack or a normal behavior. Though IDS has been developed for
many years, the large number of return alert messages makes managers maintain
system ine... |
1004.0574 | A Comparison between Memetic algorithm and Genetic algorithm for the
cryptanalysis of Simplified Data Encryption Standard algorithm | cs.CR cs.NE | Genetic algorithms are a population-based Meta heuristics. They have been
successfully applied to many optimization problems. However, premature
convergence is an inherent characteristic of such classical genetic algorithms
that makes them incapable of searching numerous solutions of the problem
domain. A memetic alg... |
1004.0658 | A new representation of Chaitin \Omega number based on compressible
strings | cs.IT cs.CC math.IT | In 1975 Chaitin introduced his \Omega number as a concrete example of random
real. The real \Omega is defined based on the set of all halting inputs for an
optimal prefix-free machine U, which is a universal decoding algorithm used to
define the notion of program-size complexity. Chaitin showed \Omega to be
random by... |
1004.0727 | Scalar-linear Solvability of Matroidal Networks Associated with
Representable Matroids | cs.IT math.IT | We study matroidal networks introduced by Dougherty et al. We prove the
converse of the following theorem: If a network is scalar-linearly solvable
over some finite field, then the network is a matroidal network associated with
a representable matroid over a finite field. It follows that a network is
scalar-linearly ... |
1004.0755 | Extended Two-Dimensional PCA for Efficient Face Representation and
Recognition | cs.CV cs.LG | In this paper a novel method called Extended Two-Dimensional PCA (E2DPCA) is
proposed which is an extension to the original 2DPCA. We state that the
covariance matrix of 2DPCA is equivalent to the average of the main diagonal of
the covariance matrix of PCA. This implies that 2DPCA eliminates some
covariance informat... |
1004.0763 | Symbolic Approximate Time-Optimal Control | math.OC cs.SY | There is an increasing demand for controller design techniques capable of
addressing the complex requirements of todays embedded applications. This
demand has sparked the interest in symbolic control where lower complexity
models of control systems are used to cater for complex specifications given by
temporal logics... |
1004.0785 | Cost-Bandwidth Tradeoff In Distributed Storage Systems | cs.IT cs.NI math.IT | Distributed storage systems are mainly justified due to the limited amount of
storage capacity and improving the reliability through distributing data over
multiple storage nodes. On the other hand, it may happen the data is stored in
unreliable nodes, while it is desired the end user to have a reliable access to
the... |
1004.0798 | Generalized Secure Distributed Source Coding with Side Information | cs.IT math.IT | In this paper, new inner and outer bounds on the achievable
compression-equivocation rate region for generalized secure data compression
with side information are given that do not match in general. In this setup,
two senders, Alice and Charlie intend to transmit information to Bob via
channels with limited capacity ... |
1004.0799 | Rate Regions of Secret Key Sharing in a New Source Model | cs.IT math.IT | A source model for secret key generation between terminals is considered. Two
users, namely users 1 and 2, at one side communicate with another user, namely
user 3, at the other side via a public channel where three users can observe
i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a
secre... |
1004.0816 | Nepotistic Relationships in Twitter and their Impact on Rank Prestige
Algorithms | cs.IR | Micro-blogging services such as Twitter allow anyone to publish anything,
anytime. Needless to say, many of the available contents can be diminished as
babble or spam. However, given the number and diversity of users, some valuable
pieces of information should arise from the stream of tweets. Thus, such
services can ... |
1004.0891 | Secure Communication over Fading Channels with Statistical QoS
Constraints | cs.IT math.IT | In this paper, the secure transmission of information over an ergodic fading
channel is investigated in the presence of statistical quality of service (QoS)
constraints. We employ effective capacity, which provides the maximum constant
arrival rate that a given process can support while satisfying statistical
delay c... |
1004.0892 | Secure Broadcasting over Fading Channels with Statistical QoS
Constraints | cs.IT math.IT | In this paper, the fading broadcast channel with confidential messages is
studied in the presence of statistical quality of service (QoS) constraints in
the form of limitations on the buffer length. We employ the effective capacity
formulation to measure the throughput of the confidential and common messages.
We assu... |
1004.0897 | Energy Efficiency Analysis in Amplify-and-Forward and Decode-and-Forward
Cooperative Networks | cs.IT math.IT | In this paper, we have studied the energy efficiency of cooperative networks
operating in either the fixed Amplifyand- Forward (AF) or the selective
Decode-and-Forward (DF) mode. We consider the optimization of the M-ary
quadrature amplitude modulation (MQAM) constellation size to minimize the bit
energy consumption ... |
1004.0899 | Relay Beamforming Strategies for Physical-Layer Security | cs.IT math.IT | In this paper, collaborative use of relays to form a beamforming system and
provide physical-layer security is investigated. In particular,
amplify-and-forward (AF) relay beamforming designs under total and individual
relay power constraints are studied with the goal of maximizing the secrecy
rates when perfect chann... |
1004.0902 | On building minimal automaton for subset matching queries | cs.FL cs.DS cs.IR | We address the problem of building an index for a set $D$ of $n$ strings,
where each string location is a subset of some finite integer alphabet of size
$\sigma$, so that we can answer efficiently if a given simple query string
(where each string location is a single symbol) $p$ occurs in the set. That is,
we need to... |
1004.0907 | QoS Analysis of Cognitive Radio Channels with Perfect CSI at both
Receiver and Transmitter | cs.IT math.IT | In this paper, cognitive transmission under quality of service (QoS)
constraints is studied. In the cognitive radio channel model, it is assumed
that both the secondary receiver and the secondary transmitter know the channel
fading coefficients perfectly and optimize the power adaptation policy under
given constraint... |
1004.0914 | Collaborative Relay Beamforming for Secure Broadcasting | cs.IT math.IT | In this paper, collaborative use of relays to form a beamforming system with
the aid of perfect channel state information (CSI) and to provide communication
in physicallayer security between a transmitter and two receivers is
investigated. In particular, we describe decode-and-forward based null space
beamforming sch... |
1004.1001 | The Graph Traversal Pattern | cs.DS cs.DB | A graph is a structure composed of a set of vertices (i.e.nodes, dots)
connected to one another by a set of edges (i.e.links, lines). The concept of a
graph has been around since the late 19$^\text{th}$ century, however, only in
recent decades has there been a strong resurgence in both theoretical and
applied graph r... |
1004.1003 | Message-Passing Inference on a Factor Graph for Collaborative Filtering | cs.IT cs.LG math.IT | This paper introduces a novel message-passing (MP) framework for the
collaborative filtering (CF) problem associated with recommender systems. We
model the movie-rating prediction problem popularized by the Netflix Prize,
using a probabilistic factor graph model and study the model by deriving
generalization error bo... |
1004.1045 | Double-Directional Information Azimuth Spectrum and Relay Network
Tomography for a Decentralized Wireless Relay Network | cs.IT math.IT | A novel channel representation for a two-hop decentralized wireless relay
network (DWRN) is proposed, where the relays operate in a completely
distributive fashion. The modeling paradigm applies an analogous approach to
the description method for a double-directional multipath propagation channel,
and takes into acco... |
1004.1061 | On Tsallis Entropy Bias and Generalized Maximum Entropy Models | cs.LG cond-mat.stat-mech cs.AI cs.IT math.IT | In density estimation task, maximum entropy model (Maxent) can effectively
use reliable prior information via certain constraints, i.e., linear
constraints without empirical parameters. However, reliable prior information
is often insufficient, and the selection of uncertain constraints becomes
necessary but poses co... |
1004.1086 | Grassmannian Fusion Frames | cs.IT math.IT | Transmitted data may be corrupted by both noise and data loss. Grassmannian
frames are in some sense optimal representations of data transmitted over a
noisy channel that may lose some of the transmitted coefficients. Fusion frame
(or frame of subspaces) theory is a new area that has potential to be applied
to proble... |
1004.1155 | Optimal sequential transmission over broadcast channel with nested
feedback | cs.IT math.IT math.OC | We consider the optimal design of sequential transmission over broadcast
channel with nested feedback. Nested feedback means that the channel output of
the outer channel is also available at the decoder of the inner channel. We
model the communication system as a decentralized team with three decision
makers---the en... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.