id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0911.4414 | Designing fuzzy rule based classifier using self-organizing feature map
for analysis of multispectral satellite images | cs.CV cs.NE | We propose a novel scheme for designing fuzzy rule based classifier. An SOFM
based method is used for generating a set of prototypes which is used to
generate a set of fuzzy rules. Each rule represents a region in the feature
space that we call the context of the rule. The rules are tuned with respect to
their contex... |
0911.4416 | Land cover classification using fuzzy rules and aggregation of
contextual information through evidence theory | cs.CV cs.NE | Land cover classification using multispectral satellite image is a very
challenging task with numerous practical applications. We propose a multi-stage
classifier that involves fuzzy rule extraction from the training data and then
generation of a possibilistic label vector for each pixel using the fuzzy rule
base. To... |
0911.4432 | The Role of Feedback in Two-way Secure Communications | cs.IT math.IT | Most practical communication links are bi-directional. In these models, since
the source node also receives signals, its encoder has the option of computing
its output based on the signals it received in the past. On the other hand,
from a practical point of view, it would also be desirable to identify the
cases wher... |
0911.4507 | On Feasibility of Interference Alignment in MIMO Interference Networks | cs.IT math.IT | We explore the feasibility of interference alignment in signal vector space
-- based only on beamforming -- for K-user MIMO interference channels. Our main
contribution is to relate the feasibility issue to the problem of determining
the solvability of a multivariate polynomial system, considered extensively in
algeb... |
0911.4510 | Bigraphical models for protein and membrane interactions | cs.CE cs.LO q-bio.MN q-bio.QM | We present a bigraphical framework suited for modeling biological systems
both at protein level and at membrane level. We characterize formally bigraphs
corresponding to biologically meaningful systems, and bigraphic rewriting rules
representing biologically admissible interactions. At the protein level, these
bigrap... |
0911.4511 | Group-based Query Learning for rapid diagnosis in time-critical
situations | stat.ML cs.IT math.IT | In query learning, the goal is to identify an unknown object while minimizing
the number of "yes or no" questions (queries) posed about that object. We
consider three extensions of this fundamental problem that are motivated by
practical considerations in real-world, time-critical identification tasks such
as emergen... |
0911.4513 | A framework for protein and membrane interactions | cs.CE cs.LO q-bio.MN q-bio.QM | We introduce the BioBeta Framework, a meta-model for both protein-level and
membrane-level interactions of living cells. This formalism aims to provide a
formal setting where to encode, compare and merge models at different
abstraction levels; in particular, higher-level (e.g. membrane) activities can
be given a form... |
0911.4521 | On the equivalence between minimal sufficient statistics, minimal
typical models and initial segments of the Halting sequence | cs.CC cs.IT math.IT | It is shown that the length of the algorithmic minimal sufficient statistic
of a binary string x, either in a representation of a finite set, computable
semimeasure, or a computable function, has a length larger than the
computational depth of x, and can solve the Halting problem for all programs
with length shorter ... |
0911.4522 | On the Number of Errors Correctable with Codes on Graphs | cs.IT cs.DM math.IT | We study ensembles of codes on graphs (generalized low-density parity-check,
or LDPC codes) constructed from random graphs and fixed local constrained
codes, and their extension to codes on hypergraphs. It is known that the
average minimum distance of codes in these ensembles grows linearly with the
code length. We s... |
0911.4530 | MIMO Z-Interference Channels: Capacity Under Strong and Noisy
Interference | cs.IT math.IT | The capacity regions of multiple-input multiple-output Gaussian
Z-interference channels are established for the very strong interference and
aligned strong interference cases. The sum-rate capacity of such channels is
established under noisy interference. These results generalize known results
for scalar Gaussian Z-i... |
0911.4640 | Near-ML Signal Detection in Large-Dimension Linear Vector Channels Using
Reactive Tabu Search | cs.IT math.IT | Low-complexity near-optimal signal detection in large dimensional
communication systems is a challenge. In this paper, we present a reactive tabu
search (RTS) algorithm, a heuristic based combinatorial optimization technique,
to achieve low-complexity near-maximum likelihood (ML) signal detection in
linear vector cha... |
0911.4650 | CanICA: Model-based extraction of reproducible group-level ICA patterns
from fMRI time series | cs.CV stat.AP | Spatial Independent Component Analysis (ICA) is an increasingly used
data-driven method to analyze functional Magnetic Resonance Imaging (fMRI)
data. To date, it has been used to extract meaningful patterns without prior
information. However, ICA is not robust to mild data variation and remains a
parameter-sensitive ... |
0911.4704 | Cooperative Relaying with State Available Non-Causally at the Relay | cs.IT math.IT | We consider a three-terminal state-dependent relay channel with the channel
state noncausally available at only the relay. Such a model may be useful for
designing cooperative wireless networks with some terminals equipped with
cognition capabilities, i.e., the relay in our setup. In the discrete
memoryless (DM) case... |
0911.4727 | Exchangeability and sets of desirable gambles | math.PR cs.AI math.ST stat.TH | Sets of desirable gambles constitute a quite general type of uncertainty
model with an interesting geometrical interpretation. We give a general
discussion of such models and their rationality criteria. We study
exchangeability assessments for them, and prove counterparts of de Finetti's
finite and infinite represent... |
0911.4752 | MIMO Radar Using Compressive Sampling | cs.IT math.IT | A MIMO radar system is proposed for obtaining angle and Doppler information
on potential targets. Transmitters and receivers are nodes of a small scale
wireless network and are assumed to be randomly scattered on a disk. The
transmit nodes transmit uncorrelated waveforms. Each receive node applies
compressive samplin... |
0911.4854 | A Process Calculus for Molecular Interaction Maps | cs.CE cs.LO q-bio.MN | We present the MIM calculus, a modeling formalism with a strong biological
basis, which provides biologically-meaningful operators for representing the
interaction capabilities of molecular species. The operators of the calculus
are inspired by the reaction symbols used in Molecular Interaction Maps (MIMs),
a diagram... |
0911.4863 | Statistical exponential families: A digest with flash cards | cs.LG | This document describes concisely the ubiquitous class of exponential family
distributions met in statistics. The first part recalls definitions and
summarizes main properties and duality with Bregman divergences (all proofs are
skipped). The second part lists decompositions and related formula of common
exponential ... |
0911.4874 | Non-photorealistic image processing: an Impressionist rendering | cs.CV | The paper describes an image processing for a non-photorealistic rendering.
The algorithm is based on a random choice of a set of pixels from those ot the
original image and substitution of them with colour spots. An iterative
procedure is applied to cover, at a desired level, the canvas. The resulting
effect mimics ... |
0911.4880 | An Estimation Theoretic Approach for Sparsity Pattern Recovery in the
Noisy Setting | cs.IT math.IT | Compressed sensing deals with the reconstruction of sparse signals using a
small number of linear measurements. One of the main challenges in compressed
sensing is to find the support of a sparse signal. In the literature, several
bounds on the scaling law of the number of measurements for successful support
recovery... |
0911.4896 | Diversity Order in ISI Channels with Single-Carrier Frequency-Domain
Equalizers | cs.IT math.IT | This paper analyzes the diversity gain achieved by single-carrier
frequency-domain equalizer (SC-FDE) in frequency selective channels, and
uncovers the interplay between diversity gain $d$, channel memory length $\nu$,
transmission block length $L$, and the spectral efficiency $R$. We specifically
show that for the c... |
0911.4910 | Adaptive information filtering for dynamic recommender systems | cs.IR cs.IT math.IT | The dynamic environment in the real world calls for the adaptive techniques
for information filtering, namely to provide real-time responses to the changes
of system data. Where many incremental algorithms are designed for this
purpose, they are usually challenged by the worse and worse performance
resulted from the ... |
0911.4983 | Modelling Cell Cycle using Different Levels of Representation | cs.CE cs.LO q-bio.CB q-bio.QM | Understanding the behaviour of biological systems requires a complex setting
of in vitro and in vivo experiments, which attracts high costs in terms of time
and resources. The use of mathematical models allows researchers to perform
computerised simulations of biological systems, which are called in silico
experiment... |
0911.4984 | A compartmental model of the cAMP/PKA/MAPK pathway in Bio-PEPA | cs.CE cs.LO q-bio.MN q-bio.QM | The vast majority of biochemical systems involve the exchange of information
between different compartments, either in the form of transportation or via the
intervention of membrane proteins which are able to transmit stimuli between
bordering compartments. The correct quantitative handling of compartments is,
theref... |
0911.4986 | New Solutions to the Firing Squad Synchronization Problems for Neural
and Hyperdag P Systems | cs.CE cs.DC cs.NE | We propose two uniform solutions to an open question: the Firing Squad
Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems,
with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively,
where e_c is the eccentricity of the commander cell of the dag or digraph
underlying these ... |
0911.4987 | Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P
systems | cs.CE | The operations drip and mate considered in (mem)brane computing resemble the
operations cut and recombination well known from DNA computing. We here
consider sets of vesicles with multisets of objects on their outside membrane
interacting by drip and mate in two different setups: in test tube systems, the
vesicles ma... |
0911.4988 | Abstract Interpretation for Probabilistic Termination of Biological
Systems | cs.LO cs.CE cs.FL q-bio.QM | In a previous paper the authors applied the Abstract Interpretation approach
for approximating the probabilistic semantics of biological systems, modeled
specifically using the Chemical Ground Form calculus. The methodology is based
on the idea of representing a set of experiments, which differ only for the
initial c... |
0911.4989 | Dependencies and Simultaneity in Membrane Systems | cs.CE cs.DC cs.LO | Membrane system computations proceed in a synchronous fashion: at each step
all the applicable rules are actually applied. Hence each step depends on the
previous one. This coarse view can be refined by looking at the dependencies
among rule occurrences, by recording, for an object, which was the a rule that
produced... |
0911.5043 | A Semantic Similarity Measure for Expressive Description Logics | cs.AI cs.LO | A totally semantic measure is presented which is able to calculate a
similarity value between concept descriptions and also between concept
description and individual or between individuals expressed in an expressive
description logic. It is applicable on symbolic descriptions although it uses a
numeric approach for ... |
0911.5046 | Integrating the Probabilistic Models BM25/BM25F into Lucene | cs.IR | This document describes the BM25 and BM25F implementation using the Lucene
Java Framework. Both models have stood out at TREC by their performance and are
considered as state-of-the-art in the IR community. BM25 is applied to
retrieval on plain text documents, that is for documents that do not contain
fields, while B... |
0911.5067 | Asynchronous CDMA Systems with Random Spreading-Part II: Design Criteria | cs.IT math.IT math.PR | Totally asynchronous code-division multiple-access (CDMA) systems are
addressed. In Part I, the fundamental limits of asynchronous CDMA systems are
analyzed in terms of spectral efficiency and SINR at the output of the optimum
linear detector. The focus of Part II is the design of low-complexity
implementations of li... |
0911.5104 | A Bayesian Rule for Adaptive Control based on Causal Interventions | cs.AI cs.LG | Explaining adaptive behavior is a central problem in artificial intelligence
research. Here we formalize adaptive agents as mixture distributions over
sequences of inputs and outputs (I/O). Each distribution of the mixture
constitutes a `possible world', but the agent does not know which of the
possible worlds it is ... |
0911.5106 | A conversion between utility and information | cs.AI cs.IT math.IT | Rewards typically express desirabilities or preferences over a set of
alternatives. Here we propose that rewards can be defined for any probability
distribution based on three desiderata, namely that rewards should be
real-valued, additive and order-preserving, where the latter implies that more
probable events shoul... |
0911.5116 | Standardization of the formal representation of lexical information for
NLP | cs.CL | A survey of dictionary models and formats is presented as well as a
presentation of corresponding recent standardisation activities.
|
0911.5242 | The ILIUM forward modelling algorithm for multivariate parameter
estimation and its application to derive stellar parameters from Gaia
spectrophotometry | astro-ph.IM astro-ph.GA astro-ph.SR cs.NE stat.ML | I introduce an algorithm for estimating parameters from multidimensional data
based on forward modelling. In contrast to many machine learning approaches it
avoids fitting an inverse model and the problems associated with this. The
algorithm makes explicit use of the sensitivities of the data to the
parameters, with ... |
0911.5300 | Improving zero-error classical communication with entanglement | quant-ph cs.IT math.IT | Given one or more uses of a classical channel, only a certain number of
messages can be transmitted with zero probability of error. The study of this
number and its asymptotic behaviour constitutes the field of classical
zero-error information theory, the quantum generalisation of which has started
to develop recentl... |
0911.5372 | Maximin affinity learning of image segmentation | cs.CV cs.AI cs.LG cs.NE | Images can be segmented by first using a classifier to predict an affinity
graph that reflects the degree to which image pixels must be grouped together
and then partitioning the graph to yield a segmentation. Machine learning has
been applied to the affinity classifier to produce affinity graphs that are
good in the... |
0911.5378 | De la recherche sociale d'information \`a la recherche collaborative
d'information | cs.IR | In this paper, we explain social information retrieval (SIR) and
collaborative information retrieval (CIR). We see SIR as a way of knowing who
to collaborate with in resolving an information problem while CIR entails the
process of mutual understanding and solving of an information problem among
collaborators. We are... |
0911.5385 | Asynchronous CDMA Systems with Random Spreading-Part I: Fundamental
Limits | cs.IT math.IT math.PR | Spectral efficiency for asynchronous code division multiple access (CDMA)
with random spreading is calculated in the large system limit allowing for
arbitrary chip waveforms and frequency-flat fading. Signal to interference and
noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean
square erro... |
0911.5394 | Covering rough sets based on neighborhoods: An approach without using
neighborhoods | cs.AI | Rough set theory, a mathematical tool to deal with inexact or uncertain
knowledge in information systems, has originally described the indiscernibility
of elements by equivalence relations. Covering rough sets are a natural
extension of classical rough sets by relaxing the partitions arising from
equivalence relation... |
0911.5395 | An axiomatic approach to the roughness measure of rough sets | cs.AI | In Pawlak's rough set theory, a set is approximated by a pair of lower and
upper approximations. To measure numerically the roughness of an approximation,
Pawlak introduced a quantitative measure of roughness by using the ratio of the
cardinalities of the lower and upper approximations. Although the roughness
measure... |
0911.5404 | Laser Actuated Presentation System | cs.HC cs.CV | We present here a pattern sensitive PowerPoint presentation scheme. The
presentation is actuated by simple patterns drawn on the presentation screen by
a laser pointer. A specific pattern corresponds to a particular command
required to operate the presentation. Laser spot on the screen is captured by a
RGB webcam wit... |
0911.5459 | Shortest Two-way Linear Recurrences | cs.IT cs.SC math.IT | Let $s$ be a finite sequence over a field of length $n$. It is well-known
that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant
term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with
coefficients in reverse order). A recent article of A. Salagean proposed an
algorithm to ... |
0911.5462 | Pigment Melanin: Pattern for Iris Recognition | cs.CV | Recognition of iris based on Visible Light (VL) imaging is a difficult
problem because of the light reflection from the cornea. Nonetheless, pigment
melanin provides a rich feature source in VL, unavailable in Near-Infrared
(NIR) imaging. This is due to biological spectroscopy of eumelanin, a chemical
not stimulated ... |
0911.5487 | Strong Spatial Mixing for Binary Markov Random Fields | cs.IT cs.DM math.IT | Gibbs distribution of binary Markov random fields on a sparse on average
graph is considered in this paper. The strong spatial mixing is proved under
the condition that the `external field' is uniformly large or small. Such
condition on `external field' is meaningful in physics.
|
0911.5508 | Codes on graphs: Duality and MacWilliams identities | cs.IT math.IT | A conceptual framework involving partition functions of normal factor graphs
is introduced, paralleling a similar recent development by Al-Bashabsheh and
Mao. The partition functions of dual normal factor graphs are shown to be a
Fourier transform pair, whether or not the graphs have cycles. The original
normal graph... |
0911.5509 | Interference Alignment Under Limited Feedback for MIMO Interference
Channels | cs.IT math.IT | While interference alignment schemes have been employed to realize the full
multiplexing gain of $K$-user interference channels, the analyses performed so
far have predominantly focused on the case when global channel knowledge is
available at each node of the network. This paper considers the problem where
each rece... |
0911.5515 | Finite Dimensional Statistical Inference | cs.IT math.IT | In this paper, we derive the explicit series expansion of the eigenvalue
distribution of various models, namely the case of non-central Wishart
distributions, as well as correlated zero mean Wishart distributions. The tools
used extend those of the free probability framework, which have been quite
successful for high... |
0911.5524 | LS-CS-residual (LS-CS): Compressive Sensing on Least Squares Residual | cs.IT math.IT | We consider the problem of recursively and causally reconstructing time
sequences of sparse signals (with unknown and time-varying sparsity patterns)
from a limited number of noisy linear measurements. The sparsity pattern is
assumed to change slowly with time. The idea of our proposed solution,
LS-CS-residual (LS-CS... |
0911.5527 | A model for randomized resource allocation in decentralized wireless
networks | cs.IT math.IT | In this paper, we consider a decentralized wireless communication network
with a fixed number $u$ of frequency sub-bands to be shared among $N$
transmitter-receiver pairs. It is assumed that the number of active users is a
random variable with a given probability mass function. Moreover, users are
unaware of each oth... |
0911.5548 | A Decision-Optimization Approach to Quantum Mechanics and Game Theory | cs.GT cs.AI | The fundamental laws of quantum world upsets the logical foundation of
classic physics. They are completely counter-intuitive with many bizarre
behaviors. However, this paper shows that they may make sense from the
perspective of a general decision-optimization principle for cooperation. This
principle also offers a ... |
0911.5553 | Randomized vs. orthogonal spectrum allocation in decentralized networks:
Outage Analysis | cs.IT math.IT | We address a decentralized wireless communication network with a fixed number
$u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs.
It is assumed that the number of users $N$ is a random variable with a given
distribution and the channel gains are quasi-static Rayleigh fading. The
transmitters... |
0911.5568 | Acquisition d'informations lexicales \`a partir de corpus C\'edric
Messiant et Thierry Poibeau | cs.CL cs.AI | This paper is about automatic acquisition of lexical information from
corpora, especially subcategorization acquisition.
|
0911.5667 | End-to-End Algebraic Network Coding for Wireless TCP/IP Networks | cs.IT cs.NI math.IT | The Transmission Control Protocol (TCP) was designed to provide reliable
transport services in wired networks. In such networks, packet losses mainly
occur due to congestion. Hence, TCP was designed to apply congestion avoidance
techniques to cope with packet losses. Nowadays, TCP is also utilized in
wireless network... |
0911.5703 | Hierarchies in Dictionary Definition Space | cs.CL cs.LG | A dictionary defines words in terms of other words. Definitions can tell you
the meanings of words you don't know, but only if you know the meanings of the
defining words. How many words do you need to know (and which ones) in order to
be able to learn all the rest from definitions? We reduced dictionaries to
their "... |
0911.5708 | Learning in a Large Function Space: Privacy-Preserving Mechanisms for
SVM Learning | cs.LG cs.CR cs.DB | Several recent studies in privacy-preserving learning have considered the
trade-off between utility or risk and the level of differential privacy
guaranteed by mechanisms for statistical query processing. In this paper we
study this trade-off in private Support Vector Machine (SVM) learning. We
present two efficient ... |
0912.0034 | Proceedings Third Workshop on Membrane Computing and Biologically
Inspired Process Calculi 2009 | cs.CE cs.DC cs.FL cs.LO | This volume contains the accepted papers at the third Workshop on Membrane
Computing and Biologically Inspired Process Calculi, held in Bologna on 5th
September 2009. The papers are devoted to both membrane computing and
biologically inspired process calculi, as well as to other related formalisms.
The papers of this... |
0912.0071 | Differentially Private Empirical Risk Minimization | cs.LG cs.AI cs.CR cs.DB | Privacy-preserving machine learning algorithms are crucial for the
increasingly common setting in which personal data, such as medical or
financial records, are analyzed. We provide general techniques to produce
privacy-preserving approximations of classifiers learned via (regularized)
empirical risk minimization (ER... |
0912.0086 | Learning Mixtures of Gaussians using the k-means Algorithm | cs.LG | One of the most popular algorithms for clustering in Euclidean space is the
$k$-means algorithm; $k$-means is difficult to analyze mathematically, and few
theoretical guarantees are known about it, particularly when the data is {\em
well-clustered}. In this paper, we attempt to fill this gap in the literature
by anal... |
0912.0132 | Opportunistic Adaptation Knowledge Discovery | cs.AI | Adaptation has long been considered as the Achilles' heel of case-based
reasoning since it requires some domain-specific knowledge that is difficult to
acquire. In this paper, two strategies are combined in order to reduce the
knowledge engineering cost induced by the adaptation knowledge (CA) acquisition
task: CA is... |
0912.0224 | A Multi-stage Probabilistic Algorithm for Dynamic Path-Planning | cs.AI cs.RO | Probabilistic sampling methods have become very popular to solve single-shot
path planning problems. Rapidly-exploring Random Trees (RRTs) in particular
have been shown to be efficient in solving high dimensional problems. Even
though several RRT variants have been proposed for dynamic replanning, these
methods only ... |
0912.0229 | Approximate Sparse Recovery: Optimizing Time and Measurements | cs.DS cs.IT math.IT | An approximate sparse recovery system consists of parameters $k,N$, an
$m$-by-$N$ measurement matrix, $\Phi$, and a decoding algorithm, $\mathcal{D}$.
Given a vector, $x$, the system approximates $x$ by $\widehat x
=\mathcal{D}(\Phi x)$, which must satisfy $\| \widehat x - x\|_2\le C \|x -
x_k\|_2$, where $x_k$ denot... |
0912.0238 | Spectral Ranking | cs.IR cs.SI physics.soc-ph | We sketch the history of spectral ranking, a general umbrella name for
techniques that apply the theory of linear maps (in particular, eigenvalues and
eigenvectors) to matrices that do not represent geometric transformations, but
rather some kind of relationship between entities. Albeit recently made famous
by the am... |
0912.0265 | Mapping the spatiotemporal dynamics of calcium signaling in cellular
neural networks using optical flow | cs.CE cs.CV q-bio.NC | An optical flow gradient algorithm was applied to spontaneously forming net-
works of neurons and glia in culture imaged by fluorescence optical microscopy
in order to map functional calcium signaling with single pixel resolution.
Optical flow estimates the direction and speed of motion of objects in an image
between... |
0912.0266 | Combining a Probabilistic Sampling Technique and Simple Heuristics to
solve the Dynamic Path Planning Problem | cs.AI cs.RO | Probabilistic sampling methods have become very popular to solve single-shot
path planning problems. Rapidly-exploring Random Trees (RRTs) in particular
have been shown to be very efficient in solving high dimensional problems. Even
though several RRT variants have been proposed to tackle the dynamic replanning
probl... |
0912.0270 | Single-Agent On-line Path Planning in Continuous, Unpredictable and
Highly Dynamic Environments | cs.AI cs.RO | This document is a thesis on the subject of single-agent on-line path
planning in continuous,unpredictable and highly dynamic environments. The
problem is finding and traversing a collision-free path for a holonomic robot,
without kinodynamic restrictions, moving in an environment with several
unpredictably moving ob... |
0912.0312 | The minimal polynomial of sequence obtained from componentwise linear
transformation of linear recurring sequence | cs.IT math.IT | Let $S=(s_1,s_2,...,s_m,...)$ be a linear recurring sequence with terms in
$GF(q^n)$ and $T$ be a linear transformation of $GF(q^n)$ over $GF(q)$. Denote
$T(S)=(T(s_1),T(s_2),...,T(s_m),...)$. In this paper, we first present counter
examples to show the main result in [A.M. Youssef and G. Gong, On linear
complexity o... |
0912.0433 | On the issues of building Information Warehouses | cs.HC cs.IR cs.SE | While performing knowledge-intensive tasks of professional nature, the
knowledge workers need to access and process large volume of information. Apart
from the quantity, they also require that the information received is of high
quality in terms of authenticity and details. This, in turn, requires that the
informatio... |
0912.0549 | Modular Workflow Engine for Distributed Services using Lightweight Java
Clients | cs.SE cs.CE | In this article we introduce the concept and the first implementation of a
lightweight client-server-framework as middleware for distributed computing. On
the client side an installation without administrative rights or privileged
ports can turn any computer into a worker node. Only a Java runtime environment
and the... |
0912.0572 | Isometric Multi-Manifolds Learning | cs.LG cs.CV | Isometric feature mapping (Isomap) is a promising manifold learning method.
However, Isomap fails to work on data which distribute on clusters in a single
manifold or manifolds. Many works have been done on extending Isomap to
multi-manifolds learning. In this paper, we first proposed a new
multi-manifolds learning a... |
0912.0579 | A Multidatabase System as 4-Tiered Client-Server Distributed
Heterogeneous Database System | cs.DB | In this paper, we describe a multidatabase system as 4tiered Client-Server
DBMS architectures. We discuss their functional components and provide an
overview of their performance characteristics. The first component of this
proposed system is a web based interface or Graphical User Interface, which
resides on top of ... |
0912.0581 | Log-concavity, ultra-log-concavity, and a maximum entropy property of
discrete compound Poisson measures | math.CO cs.IT math.IT math.PR | Sufficient conditions are developed, under which the compound Poisson
distribution has maximal entropy within a natural class of probability measures
on the nonnegative integers. Recently, one of the authors [O. Johnson, {\em
Stoch. Proc. Appl.}, 2007] used a semigroup approach to show that the Poisson
has maximal en... |
0912.0597 | Constructing Optimal Authentication Codes with Perfect Multi-fold
Secrecy | cs.CR cs.IT math.IT | We establish a construction of optimal authentication codes achieving perfect
multi-fold secrecy by means of combinatorial designs. This continues the
author's work (ISIT 2009) and answers an open question posed therein. As an
application, we present the first infinite class of optimal codes that provide
two-fold sec... |
0912.0599 | Conceptual Model for Communication | cs.NI cs.IT math.IT | A variety of idealized models of communication systems exist, and all may
have something in common. Starting with Shannons communication model and ending
with the OSI model, this paper presents progressively more advanced forms of
modeling of communication systems by tying communication models together based
on the n... |
0912.0600 | Sequential Clustering based Facial Feature Extraction Method for
Automatic Creation of Facial Models from Orthogonal Views | cs.CV | Multiview 3D face modeling has attracted increasing attention recently and
has become one of the potential avenues in future video systems. We aim to make
more reliable and robust automatic feature extraction and natural 3D feature
construction from 2D features detected on a pair of frontal and profile view
face imag... |
0912.0603 | Object Oriented Approach for Integration of Heterogeneous Databases in a
Multidatabase System and Local Schemas Modifications Propagation | cs.DB | One of the challenging problems in the multidatabase systems is to find the
most viable solution to the problem of interoperability of distributed
heterogeneous autonomous local component databases. This has resulted in the
creation of a global schema over set of these local component database schemas
to provide a un... |
0912.0607 | Reversible Image Authentication with Tamper Localization Based on
Integer Wavelet Transform | cs.CR cs.CV | In this paper, a new reversible image authentication technique with tamper
localization based on watermarking in integer wavelet transform is proposed. If
the image authenticity is verified, then the distortion due to embedding the
watermark can be completely removed from the watermarked image. If the image is
tamper... |
0912.0717 | Behavior and performance of the deep belief networks on image
classification | cs.NE cs.CV | We apply deep belief networks of restricted Boltzmann machines to bags of
words of sift features obtained from databases of 13 Scenes, 15 Scenes and
Caltech 256 and study experimentally their behavior and performance. We find
that the final performance in the supervised phase is reached much faster if
the system is p... |
0912.0756 | Beamforming in MISO Systems: Empirical Results and EVM-based Analysis | cs.IT math.IT | We present an analytical, simulation, and experimental-based study of
beamforming Multiple Input Single Output (MISO) systems. We analyze the
performance of beamforming MISO systems taking into account implementation
complexity and effects of imperfect channel estimate, delayed feedback, real
Radio Frequency (RF) har... |
0912.0758 | Comparison of Performance Metrics for QPSK and OQPSK Transmission Using
Root Raised Cosine and Raised Cosine Pulse shaping Filters for Applications
in Mobile Communication | cs.IT math.IT | Quadrature Phase Shift Keying (QPSK) and Offset Quadrature Phase Shift Keying
(OQPSK) are two well accepted modulation techniques used in Code Division
Multiple Access (CDMA) system. The Pulse Shaping Filters play an important role
in digital transmission. The type of Pulse Shaping Filter used, and its
behavior would... |
0912.0765 | On the Energy Efficiency of LT Codes in Proactive Wireless Sensor
Networks | cs.IT math.IT | This paper presents the first in-depth analysis on the energy efficiency of
LT codes with Non Coherent M-ary Frequency Shift Keying (NC-MFSK), known as
green modulation [1], in a proactive Wireless Sensor Network (WSN) over
Rayleigh flat-fading channels with path-loss. We describe the proactive system
model according... |
0912.0779 | Training a Large Scale Classifier with the Quantum Adiabatic Algorithm | quant-ph cs.LG | In a previous publication we proposed discrete global optimization as a
method to train a strong binary classifier constructed as a thresholded sum
over weak classifiers. Our motivation was to cast the training of a classifier
into a format amenable to solution by the quantum adiabatic algorithm. Applying
adiabatic q... |
0912.0797 | On Syndrome Decoding for Slepian-Wolf Coding Based on Convolutional and
Turbo Codes | cs.IT math.IT | In source coding, either with or without side information at the decoder, the
ultimate performance can be achieved by means of random binning. Structured
binning into cosets of performing channel codes has been successfully employed
in practical applications. In this letter it is formally shown that various
convoluti... |
0912.0821 | Lexical evolution rates by automated stability measure | cs.CL physics.soc-ph | Phylogenetic trees can be reconstructed from the matrix which contains the
distances between all pairs of languages in a family. Recently, we proposed a
new method which uses normalized Levenshtein distances among words with same
meaning and averages on all the items of a given list. Decisions about the
number of ite... |
0912.0840 | Applying an XML Warehouse to Social Network Analysis, Lessons from the
WebStand Project | cs.DB cs.CY | In this paper we present the state of advancement of the French ANR WebStand
project. The objective of this project is to construct a customizable XML based
warehouse platform to acquire, transform, analyze, store, query and export data
from the web, in particular mailing lists, with the final intension of using
this... |
0912.0868 | Interference Alignment in Dense Wireless Networks | cs.IT math.IT | We consider arbitrary dense wireless networks, in which $n$ nodes are placed
in an arbitrary (deterministic) manner on a square region of unit area and
communicate with each other over Gaussian fading channels. We provide inner and
outer bounds for the $n\times n$-dimensional unicast and the $n\times
2^n$-dimensional... |
0912.0884 | Measures of lexical distance between languages | cs.CL physics.soc-ph | The idea of measuring distance between languages seems to have its roots in
the work of the French explorer Dumont D'Urville \cite{Urv}. He collected
comparative words lists of various languages during his voyages aboard the
Astrolabe from 1826 to 1829 and, in his work about the geographical division of
the Pacific, ... |
0912.0893 | Performance Analysis on Molecular Dynamics Simulation of Protein Using
GROMACS | cs.CE q-bio.BM | Development of computer technology in chemistry, bring many application of
chemistry. Not only the application to visualize the structure of molecule but
also to molecular dynamics simulation. One of them is Gromacs. Gromacs is an
example of molecular dynamics application developed by Groningen University.
This appli... |
0912.0913 | Search for overlapped communities by parallel genetic algorithms | cs.IR cs.GL physics.soc-ph | In the last decade the broad scope of complex networks has led to a rapid
progress. In this area a particular interest has the study of community
structures. The analysis of this type of structure requires the formalization
of the intuitive concept of community and the definition of indices of goodness
for the obtain... |
0912.0936 | Neural-estimator for the surface emission rate of atmospheric gases | cs.NE | The emission rate of minority atmospheric gases is inferred by a new approach
based on neural networks. The neural network applied is the multi-layer
perceptron with backpropagation algorithm for learning. The identification of
these surface fluxes is an inverse problem. A comparison between the new
neural-inversion ... |
0912.0950 | Fingerprint Verification based on Gabor Filter Enhancement | cs.CR cs.CV | Human fingerprints are reliable characteristics for personnel identification
as it is unique and persistence. A fingerprint pattern consists of ridges,
valleys and minutiae. In this paper we propose Fingerprint Verification based
on Gabor Filter Enhancement (FVGFE) algorithm for minutiae feature extraction
and post p... |
0912.0955 | Robust Multi biometric Recognition Using Face and Ear Images | cs.CR cs.CV | This study investigates the use of ear as a biometric for authentication and
shows experimental results obtained on a newly created dataset of 420 images.
Images are passed to a quality module in order to reduce False Rejection Rate.
The Principal Component Analysis (eigen ear) approach was used, obtaining 90.7
perce... |
0912.0962 | Adaptive Limited Feedback for Sum-Rate Maximizing Beamforming in
Cooperative Multicell Systems | cs.IT math.IT | Base station cooperation improves the sum-rates that can be achieved in
cellular systems. Conventional cooperation techniques require sharing large
amounts of information over finite-capacity backhaul links and assume that base
stations have full channel state information (CSI) of all the active users in
the system. ... |
0912.0965 | Explicit Capacity-achieving Codes for Worst-Case Additive Errors | cs.IT cs.CC math.CO math.IT | For every p in (0,1/2), we give an explicit construction of binary codes of
rate approaching "capacity" 1-H(p) that enable reliable communication in the
presence of worst-case additive errors}, caused by a channel oblivious to the
codeword (but not necessarily the message). Formally, we give an efficient
"stochastic"... |
0912.0986 | Fish recognition based on the combination between robust feature
selection, image segmentation and geometrical parameter techniques using
Artificial Neural Network and Decision Tree | cs.CV cs.NE | We presents in this paper a novel fish classification methodology based on a
combination between robust feature selection, image segmentation and
geometrical parameter techniques using Artificial Neural Network and Decision
Tree. Unlike existing works for fish classification, which propose descriptors
and do not anal... |
0912.1005 | Performance analysis of Non Linear Filtering Algorithms for underwater
images | cs.MM cs.CV cs.IR | Image filtering algorithms are applied on images to remove the different
types of noise that are either present in the image during capturing or
injected in to the image during transmission. Underwater images when captured
usually have Gaussian noise, speckle noise and salt and pepper noise. In this
work, five differ... |
0912.1007 | Designing Kernel Scheme for Classifiers Fusion | cs.LG cs.NE | In this paper, we propose a special fusion method for combining ensembles of
base classifiers utilizing new neural networks in order to improve overall
efficiency of classification. While ensembles are designed such that each
classifier is trained independently while the decision fusion is performed as a
final proced... |
0912.1009 | Biogeography based Satellite Image Classification | cs.CV cs.LG | Biogeography is the study of the geographical distribution of biological
organisms. The mindset of the engineer is that we can learn from nature.
Biogeography Based Optimization is a burgeoning nature inspired technique to
find the optimal solution of the problem. Satellite image classification is an
important task b... |
0912.1010 | Web Document Analysis for Companies Listed in Bursa Malaysia | cs.IR | This paper discusses a research on web document analysis for companies listed
on Bursa Malaysia which is the forerunner of financial and investment center in
Malaysia. Data set used in this research are from the company web documents
listed in the Main Board and Second Board on Bursa Malaysia. This research has
used ... |
0912.1014 | An ensemble approach for feature selection of Cyber Attack Dataset | cs.CR cs.LG | Feature selection is an indispensable preprocessing step when mining huge
datasets that can significantly improve the overall system performance.
Therefore in this paper we focus on a hybrid approach of feature selection.
This method falls into two phases. The filter phase select the features with
highest information... |
0912.1015 | Short Term Load Forecasting Using Multi Parameter Regression | cs.NE cs.CE | Short Term Load forecasting in this paper uses input data dependent on
parameters such as load for current hour and previous two hours, temperature
for current hour and previous two hours, wind for current hour and previous two
hours, cloud for current hour and previous two hours. Forecasting will be of
load demand f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.