id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0909.5460 | Iterative Shrinkage Approach to Restoration of Optical Imagery | cs.CV | The problem of reconstruction of digital images from their degraded
measurements is regarded as a problem of central importance in various fields
of engineering and imaging sciences. In such cases, the degradation is
typically caused by the resolution limitations of an imaging device in use
and/or by the destructive ... |
0909.5507 | Fast Algorithm for Finding Unicast Capacity of Linear Deterministic
Wireless Relay Networks | cs.IT math.IT | The deterministic channel model for wireless relay networks proposed by
Avestimehr, Diggavi and Tse `07 has captured the broadcast and inference nature
of wireless communications and has been widely used in approximating the
capacity of wireless relay networks. The authors generalized the max-flow
min-cut theorem to ... |
0909.5530 | Differential Privacy via Wavelet Transforms | cs.DB | Privacy preserving data publishing has attracted considerable research
interest in recent years. Among the existing solutions, {\em
$\epsilon$-differential privacy} provides one of the strongest privacy
guarantees. Existing data publishing methods that achieve
$\epsilon$-differential privacy, however, offer little da... |
0909.5583 | Two-Phase Flow Complexity in Heterogeneous Media | cs.CE physics.flu-dyn | In this study, we investigate the appeared complexity of two-phase flow
(air/water) in a heterogeneous soil where the supposed porous media is
non-deformable media which is under the timedependent gas pressure. After
obtaining of governing equations and considering the capillary
pressuresaturation and permeability fu... |
0909.5656 | Improvements of the 3D images captured with Time-of-Flight cameras | cs.CV cs.CG | 3D Time-of-Flight camera's images are affected by errors due to the diffuse
(indirect) light and to the flare light. The presented method improves the 3D
image reducing the distance's errors to dark surface objects. This is achieved
by placing one or two contrast tags in the scene at different distances from
the ToF ... |
0909.5669 | Some combinatorial aspects of constructing bipartite-graph codes | math.CO cs.IT math.IT | We propose geometrical methods for constructing square 01-matrices with the
same number n of units in every row and column, and such that any two rows of
the matrix contain at most one unit in common. These matrices are equivalent to
n-regular bipartite graphs without 4-cycles, and therefore can be used for the
const... |
0910.0013 | Algorithms for finding dispensable variables | cs.DS cs.AI cs.LO | This short note reviews briefly three algorithms for finding the set of
dispensable variables of a boolean formula. The presentation is light on proofs
and heavy on intuitions.
|
0910.0045 | Acceptable Complexity Measures of Theorems | cs.LO cs.IT math.IT | In 1931, G\"odel presented in K\"onigsberg his famous Incompleteness Theorem,
stating that some true mathematical statements are unprovable. Yet, this result
gives us no idea about those independent (that is, true and unprovable)
statements, about their frequency, the reason they are unprovable, and so on.
Calude and... |
0910.0097 | Scalable Database Access Technologies for ATLAS Distributed Computing | physics.ins-det cs.DB cs.DC hep-ex | ATLAS event data processing requires access to non-event data (detector
conditions, calibrations, etc.) stored in relational databases. The
database-resident data are crucial for the event data reconstruction processing
steps and often required for user analysis. A main focus of ATLAS database
operations is on the wo... |
0910.0112 | Finding Associations and Computing Similarity via Biased Pair Sampling | cs.DS cs.DB cs.LG | This version is ***superseded*** by a full version that can be found at
http://www.itu.dk/people/pagh/papers/mining-jour.pdf, which contains stronger
theoretical results and fixes a mistake in the reporting of experiments.
Abstract: Sampling-based methods have previously been proposed for the
problem of finding int... |
0910.0211 | Searching the (really) real general solution of 2D Laplace differential
equation | math.AP cs.CE physics.flu-dyn | This is not a new result. Purpose of this work is to describe a method to
search the analytical expression of the general real solution of the
two-dimensional Laplace differential equation. This thing is not easy to find
in scientific literature and, if present, often it is justified with the
assertion that an arbitr... |
0910.0239 | Compressed Blind De-convolution | cs.IT cs.LG math.IT | Suppose the signal x is realized by driving a k-sparse signal u through an
arbitrary unknown stable discrete-linear time invariant system H. These types
of processes arise naturally in Reflection Seismology. In this paper we are
interested in several problems: (a) Blind-Deconvolution: Can we recover both
the filter $... |
0910.0284 | Linear rank inequalities on five or more variables | cs.IT math.IT | Ranks of subspaces of vector spaces satisfy all linear inequalities satisfied
by entropies (including the standard Shannon inequalities) and an additional
inequality due to Ingleton. It is known that the Shannon and Ingleton
inequalities generate all such linear rank inequalities on up to four
variables, but it has b... |
0910.0320 | Convergence of Fundamental Limitations in Feedback Communication,
Estimation, and Feedback Control over Gaussian Channels | cs.IT math.IT | In this paper, we establish the connections of the fundamental limitations in
feedback communication, estimation, and feedback control over Gaussian
channels, from a unifying perspective for information, estimation, and control.
The optimal feedback communication system over a Gaussian necessarily employs
the Kalman ... |
0910.0349 | Post-Processing of Discovered Association Rules Using Ontologies | cs.LG | In Data Mining, the usefulness of association rules is strongly limited by
the huge amount of delivered rules. In this paper we propose a new approach to
prune and filter discovered rules. Using Domain Ontologies, we strengthen the
integration of user knowledge in the post-processing task. Furthermore, an
interactive... |
0910.0413 | Accurate low-rank matrix recovery from a small number of linear
measurements | cs.IT math.IT | We consider the problem of recovering a lowrank matrix M from a small number
of random linear measurements. A popular and useful example of this problem is
matrix completion, in which the measurements reveal the values of a subset of
the entries, and we wish to fill in the missing entries (this is the famous
Netflix ... |
0910.0456 | Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery | cs.IT math.IT | Consider the $n$-dimensional vector $y=X\be+\e$, where $\be \in \R^p$ has
only $k$ nonzero entries and $\e \in \R^n$ is a Gaussian noise. This can be
viewed as a linear system with sparsity constraints, corrupted by noise. We
find a non-asymptotic upper bound on the probability that the optimal decoder
for $\beta$ de... |
0910.0483 | Statistical Decision Making for Authentication and Intrusion Detection | stat.ML cs.LG stat.AP | User authentication and intrusion detection differ from standard
classification problems in that while we have data generated from legitimate
users, impostor or intrusion data is scarce or non-existent. We review existing
techniques for dealing with this problem and propose a novel alternative based
on a principled s... |
0910.0537 | A Note On Higher Order Grammar | cs.CL | Both syntax-phonology and syntax-semantics interfaces in Higher Order Grammar
(HOG) are expressed as axiomatic theories in higher-order logic (HOL), i.e. a
language is defined entirely in terms of provability in the single logical
system. An important implication of this elegant architecture is that the
meaning of a ... |
0910.0542 | Pre-processing in AI based Prediction of QSARs | cs.AI cs.NE q-bio.QM | Machine learning, data mining and artificial intelligence (AI) based methods
have been used to determine the relations between chemical structure and
biological activity, called quantitative structure activity relationships
(QSARs) for the compounds. Pre-processing of the dataset, which includes the
mapping from a la... |
0910.0555 | Exploiting Channel Correlations - Simple Interference Alignment Schemes
with no CSIT | cs.IT math.IT | We explore 5 network communication problems where the possibility of
interference alignment, and consequently the total number of degrees of freedom
(DoF) with channel uncertainty at the transmitters are unknown. These problems
share the common property that in each case the best known outer bounds are
essentially ro... |
0910.0575 | A Note on Functional Averages over Gaussian Ensembles | math.PR cs.IT math.IT math.OA | In this work we find a new formula for matrix averages over the Gaussian
ensemble. Let ${\bf H}$ be an $n\times n$ Gaussian random matrix with complex,
independent, and identically distributed entries of zero mean and unit
variance. Given an $n\times n$ positive definite matrix ${\bf A}$, and a
continuous function $f... |
0910.0610 | Regularization Techniques for Learning with Matrices | cs.LG stat.ML | There is growing body of learning problems for which it is natural to
organize the parameters into matrix, so as to appropriately regularize the
parameters under some matrix norm (in order to impose some more sophisticated
prior knowledge). This work describes and analyzes a systematic method for
constructing such ma... |
0910.0641 | Optimal Testing of Reed-Muller Codes | math.CO cs.CC cs.IT math.IT | We consider the problem of testing if a given function f : F_2^n -> F_2 is
close to any degree d polynomial in n variables, also known as the Reed-Muller
testing problem. The Gowers norm is based on a natural 2^{d+1}-query test for
this property. Alon et al. [AKKLR05] rediscovered this test and showed that it
accepts... |
0910.0646 | Digital Business Ecosystems: Natural Science Paradigms | cs.NE | A primary motivation for research in Digital Ecosystems is the desire to
exploit the self-organising properties of natural ecosystems. Ecosystems arc
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. However, the biological processes that contribute to
these properti... |
0910.0650 | Capacity Region of a State Dependent Degraded Broadcast Channel with
Noncausal Transmitter CSI | cs.IT math.IT | This paper has been withdrawn due to a mistake in the previous version.
|
0910.0651 | A Simpler Approach to Matrix Completion | cs.IT cs.NA math.IT math.OC | This paper provides the best bounds to date on the number of randomly sampled
entries required to reconstruct an unknown low rank matrix. These results
improve on prior work by Candes and Recht, Candes and Tao, and Keshavan,
Montanari, and Oh. The reconstruction is accomplished by minimizing the nuclear
norm, or sum ... |
0910.0653 | The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the
Reliability Function | cs.IT math.IT | We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and
provide a strong converse for its capacity. The strong converse is then used to
obtain an upper bound on the reliability function. Instrumental in our proofs
is a new technical lemma which provides an upper bound for the rate of codes
with code... |
0910.0663 | Transmission line inspires a new distributed algorithm to solve linear
system of circuit | cs.CE cs.DC cs.MS cs.NA | Transmission line, or wire, is always troublesome to integrated circuits
designers, but it could be helpful to parallel computing researchers. This
paper proposes the Virtual Transmission Method (VTM), which is a new
distributed and stationary iterative algorithm to solve the linear system
extracted from circuit. It ... |
0910.0668 | Variable sigma Gaussian processes: An expectation propagation
perspective | cs.LG | Gaussian processes (GPs) provide a probabilistic nonparametric representation
of functions in regression, classification, and other problems. Unfortunately,
exact learning with GPs is intractable for large datasets. A variety of
approximate GP methods have been proposed that essentially map the large
dataset into a s... |
0910.0674 | Computing of Applied Digital Ecosystems | cs.NE cs.MA | A primary motivation for our research in digital ecosystems is the desire to
exploit the self-organising properties of biological ecosystems. Ecosystems are
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. However, the computing technologies that contribute
to these... |
0910.0695 | Statistics on Graphs, Exponential Formula and Combinatorial Physics | cs.DM cs.CE math.CO quant-ph | The concern of this paper is a famous combinatorial formula known under the
name "exponential formula". It occurs quite naturally in many contexts
(physics, mathematics, computer science). Roughly speaking, it expresses that
the exponential generating function of a whole structure is equal to the
exponential of those... |
0910.0820 | Prediction of Zoonosis Incidence in Human using Seasonal Auto Regressive
Integrated Moving Average (SARIMA) | cs.LG q-bio.QM | Zoonosis refers to the transmission of infectious diseases from animal to
human. The increasing number of zoonosis incidence makes the great losses to
lives, including humans and animals, and also the impact in social economic. It
motivates development of a system that can predict the future number of
zoonosis occurr... |
0910.0827 | Performance of Statistical Tests for Single Source Detection using
Random Matrix Theory | math.PR cs.IT math.IT math.ST stat.TH | This paper introduces a unified framework for the detection of a source with
a sensor array in the context where the noise variance and the channel between
the source and the sensors are unknown at the receiver. The Generalized Maximum
Likelihood Test is studied and yields the analysis of the ratio between the
maximu... |
0910.0880 | Bidding for Representative Allocations for Display Advertising | cs.MA cs.GT | Display advertising has traditionally been sold via guaranteed contracts -- a
guaranteed contract is a deal between a publisher and an advertiser to allocate
a certain number of impressions over a certain period, for a pre-specified
price per impression. However, as spot markets for display ads, such as the
RightMedi... |
0910.0881 | When Watchdog Meets Coding | cs.CR cs.IT cs.NI math.IT | In this work we study the problem of misbehavior detection in wireless
networks. A commonly adopted approach is to utilize the broadcasting nature of
the wireless medium and have nodes monitor their neighborhood. We call such
nodes the Watchdogs. In this paper, we first show that even if a watchdog can
overhear all p... |
0910.0886 | Step-Frequency Radar with Compressive Sampling (SFR-CS) | cs.IT math.IT | Step-frequency radar (SFR) is a high resolution radar approach, where
multiple pulses are transmitted at different frequencies, covering a wide
spectrum. The obtained resolution directly depends on the total bandwidth used,
or equivalently, the number of transmitted pulses. This paper proposes a novel
SFR system, nam... |
0910.0887 | Green Modulation in Proactive Wireless Sensor Networks | cs.IT math.IT | Due to unique characteristics of sensor nodes, choosing energy-efficient
modulation scheme with low-complexity implementation (refereed to as green
modulation) is a critical factor in the physical layer of Wireless Sensor
Networks (WSNs). This paper presents (to the best of our knowledge) the first
in-depth analysis ... |
0910.0899 | Interference Channels with One Cognitive Transmitter | cs.IT math.IT | This paper studies the problem of interference channels with one cognitive
transmitter (ICOCT) where "cognitive" is defined from both the noncausal and
causal perspectives. For the noncausal ICOCT, referred to as interference
channels with degraded message sets (IC-DMS), we propose a new achievable rate
region that g... |
0910.0902 | Reduced-Rank Hidden Markov Models | cs.LG cs.AI | We introduce the Reduced-Rank Hidden Markov Model (RR-HMM), a generalization
of HMMs that can model smooth state evolution as in Linear Dynamical Systems
(LDSs) as well as non-log-concave predictive distributions as in
continuous-observation HMMs. RR-HMMs assume an m-dimensional latent state and n
discrete observatio... |
0910.0906 | A maximum entropy theorem with applications to the measurement of
biodiversity | cs.IT math.IT q-bio.PE q-bio.QM | This is a preliminary article stating and proving a new maximum entropy
theorem. The entropies that we consider can be used as measures of
biodiversity. In that context, the question is: for a given collection of
species, which frequency distribution(s) maximize the diversity? The theorem
provides the answer. The chi... |
0910.0918 | A Random Dynamical Systems Approach to Filtering in Large-scale Networks | cs.IT cs.MA math.IT math.OC math.PR | The paper studies the problem of filtering a discrete-time linear system
observed by a network of sensors. The sensors share a common communication
medium to the estimator and transmission is bit and power budgeted. Under the
assumption of conditional Gaussianity of the signal process at the estimator
(which may be e... |
0910.0921 | Low-rank Matrix Completion with Noisy Observations: a Quantitative
Comparison | cs.LG cs.NA | We consider a problem of significant practical importance, namely, the
reconstruction of a low-rank data matrix from a small subset of its entries.
This problem appears in many areas such as collaborative filtering, computer
vision and wireless sensor networks. In this paper, we focus on the matrix
completion problem... |
0910.0928 | BioDiVinE: A Framework for Parallel Analysis of Biological Models | cs.CE cs.DC q-bio.QM | In this paper a novel tool BioDiVinEfor parallel analysis of biological
models is presented. The tool allows analysis of biological models specified in
terms of a set of chemical reactions. Chemical reactions are transformed into a
system of multi-affine differential equations. BioDiVinE employs techniques for
finite... |
0910.0983 | On Metric Skyline Processing by PM-tree | cs.DB cs.DL cs.MM cs.PF | The task of similarity search in multimedia databases is usually accomplished
by range or k nearest neighbor queries. However, the expressing power of these
"single-example" queries fails when the user's delicate query intent is not
available as a single example. Recently, the well-known skyline operator was
reused i... |
0910.1014 | Building upon Fast Multipole Methods to Detect and Model Organizations | cs.AI | Many models in natural and social sciences are comprised of sets of
inter-acting entities whose intensity of interaction decreases with distance.
This often leads to structures of interest in these models composed of dense
packs of entities. Fast Multipole Methods are a family of methods developed to
help with the ca... |
0910.1026 | A multiagent urban traffic simulation. Part II: dealing with the
extraordinary | cs.AI | In Probabilistic Risk Management, risk is characterized by two quantities:
the magnitude (or severity) of the adverse consequences that can potentially
result from the given activity or action, and by the likelihood of occurrence
of the given adverse consequences. But a risk seldom exists in isolation: chain
of conse... |
0910.1121 | LP Decoding meets LP Decoding: A Connection between Channel Coding and
Compressed Sensing | cs.IT math.IT | This is a tale of two linear programming decoders, namely channel coding
linear programming decoding (CC-LPD) and compressed sensing linear programming
decoding (CS-LPD). So far, they have evolved quite independently. The aim of
the present paper is to show that there is a tight connection between, on the
one hand, C... |
0910.1123 | Can Iterative Decoding for Erasure Correlated Sources be Universal? | cs.IT math.IT | In this paper, we consider a few iterative decoding schemes for the joint
source-channel coding of correlated sources. Specifically, we consider the
joint source-channel coding of two erasure correlated sources with transmission
over different erasure channels. Our main interest is in determining whether or
not vario... |
0910.1145 | Design of network-coding based multi-edge type LDPC codes for
multi-source relaying systems | cs.IT math.IT | In this paper we investigate a multi-source LDPC scheme for a Gaussian relay
system, where M sources communicate with the destination under the help of a
single relay (M-1-1 system). Since various distributed LDPC schemes in the
cooperative single-source system, e.g. bilayer LDPC and bilayer multi-edge type
LDPC (BME... |
0910.1151 | Delay-Limited Cooperative Communication with Reliability Constraints in
Wireless Networks | cs.IT math.IT math.OC | We investigate optimal resource allocation for delay-limited cooperative
communication in time varying wireless networks. Motivated by real-time
applications that have stringent delay constraints, we develop a dynamic
cooperation strategy that makes optimal use of network resources to achieve a
target outage probabil... |
0910.1219 | On the Interpretation of Delays in Delay Stochastic Simulation of
Biological Systems | q-bio.QM cs.CE | Delays in biological systems may be used to model events for which the
underlying dynamics cannot be precisely observed. Mathematical modeling of
biological systems with delays is usually based on Delay Differential Equations
(DDEs), a kind of differential equations in which the derivative of the unknown
function at ... |
0910.1238 | A Local Search Modeling for Constrained Optimum Paths Problems (Extended
Abstract) | cs.AI | Constrained Optimum Path (COP) problems appear in many real-life
applications, especially on communication networks. Some of these problems have
been considered and solved by specific techniques which are usually difficult
to extend. In this paper, we introduce a novel local search modeling for
solving some COPs by l... |
0910.1239 | Dynamic Demand-Capacity Balancing for Air Traffic Management Using
Constraint-Based Local Search: First Results | cs.AI | Using constraint-based local search, we effectively model and efficiently
solve the problem of balancing the traffic demands on portions of the European
airspace while ensuring that their capacity constraints are satisfied. The
traffic demand of a portion of airspace is the hourly number of flights planned
to enter i... |
0910.1244 | On Improving Local Search for Unsatisfiability | cs.AI | Stochastic local search (SLS) has been an active field of research in the
last few years, with new techniques and procedures being developed at an
astonishing rate. SLS has been traditionally associated with satisfiability
solving, that is, finding a solution for a given problem instance, as its
intrinsic nature does... |
0910.1247 | Integrating Conflict Driven Clause Learning to Local Search | cs.AI | This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach
for propositional satisfiability. It combines local search and conflict driven
clause learning (CDCL) scheme. Each time the local search part reaches a local
minimum, the CDCL is launched. For SAT problems it behaves like a tabu list,
whereas... |
0910.1253 | A Constraint-directed Local Search Approach to Nurse Rostering Problems | cs.AI | In this paper, we investigate the hybridization of constraint programming and
local search techniques within a large neighbourhood search scheme for solving
highly constrained nurse rostering problems. As identified by the research, a
crucial part of the large neighbourhood search is the selection of the fragment
(ne... |
0910.1255 | Sonet Network Design Problems | cs.AI | This paper presents a new method and a constraint-based objective function to
solve two problems related to the design of optical telecommunication networks,
namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the
Intra-ring Synchronous Optical Network Design Problem (IDP). These network
topolog... |
0910.1264 | Parallel local search for solving Constraint Problems on the Cell
Broadband Engine (Preliminary Results) | cs.AI | We explore the use of the Cell Broadband Engine (Cell/BE for short) for
combinatorial optimization applications: we present a parallel version of a
constraint-based local search algorithm that has been implemented on a
multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16
SPUs per blade). This ... |
0910.1266 | Toward an automaton Constraint for Local Search | cs.AI | We explore the idea of using finite automata to implement new constraints for
local search (this is already a successful technique in constraint-based global
search). We show how it is possible to maintain incrementally the violations of
a constraint and its decision variables from an automaton that describes a
groun... |
0910.1273 | Adaboost with "Keypoint Presence Features" for Real-Time Vehicle Visual
Detection | cs.CV cs.LG | We present promising results for real-time vehicle visual detection, obtained
with adaBoost using new original ?keypoints presence features?. These
weak-classifiers produce a boolean response based on presence or absence in the
tested image of a ?keypoint? (~ a SURF interest point) with a descriptor
sufficiently simi... |
0910.1293 | Introducing New AdaBoost Features for Real-Time Vehicle Detection | cs.CV cs.LG | This paper shows how to improve the real-time object detection in complex
robotics applications, by exploring new visual features as AdaBoost weak
classifiers. These new features are symmetric Haar filters (enforcing global
horizontal and vertical symmetry) and N-connexity control points. Experimental
evaluation on a... |
0910.1294 | Visual object categorization with new keypoint-based adaBoost features | cs.CV cs.LG | We present promising results for visual object categorization, obtained with
adaBoost using new original ?keypoints-based features?. These weak-classifiers
produce a boolean response based on presence or absence in the tested image of
a ?keypoint? (a kind of SURF interest point) with a descriptor sufficiently
similar... |
0910.1295 | Modular Traffic Sign Recognition applied to on-vehicle real-time visual
detection of American and European speed limit signs | cs.CV | We present a new modular traffic signs recognition system, successfully
applied to both American and European speed limit signs. Our sign detection
step is based only on shape-detection (rectangles or circles). This enables it
to work on grayscale images, contrary to most European competitors, which eases
robustness ... |
0910.1300 | D-MG Tradeoff of DF and AF Relaying Protocols over Asynchronous PAM
Cooperative Networks | cs.IT math.IT | The diversity multiplexing tradeoff of a general two-hop asynchronous
cooperative network is examined for various relaying protocols such as
non-orthogonal selection decode-and-forward (NSDF), orthogonal selection
decode-and-forward (OSDF), non-orthogonal amplify-and-forward (NAF), and
orthogonal amplify-and-forward ... |
0910.1335 | Violating the Ingleton Inequality with Finite Groups | cs.IT math.IT | It is well known that there is a one-to-one correspondence between the
entropy vector of a collection of n random variables and a certain
group-characterizable vector obtained from a finite group and n of its
subgroups. However, if one restricts attention to abelian groups then not all
entropy vectors can be obtained... |
0910.1403 | On the Sample Complexity of Compressed Counting | cs.DS cs.IT math.IT | Compressed Counting (CC), based on maximally skewed stable random
projections, was recently proposed for estimating the p-th frequency moments of
data streams. The case p->1 is extremely useful for estimating Shannon entropy
of data streams. In this study, we provide a very simple algorithm based on the
sample minimu... |
0910.1404 | Proceedings 6th International Workshop on Local Search Techniques in
Constraint Satisfaction | cs.AI | LSCS is a satellite workshop of the international conference on principles
and practice of Constraint Programming (CP), since 2004. It is devoted to local
search techniques in constraint satisfaction, and focuses on all aspects of
local search techniques, including: design and implementation of new
algorithms, hybrid... |
0910.1407 | 3-Receiver Broadcast Channels with Common and Confidential Messages | cs.IT math.IT | This paper establishes inner bounds on the secrecy capacity regions for the
general 3-receiver broadcast channel with one common and one confidential
message sets. We consider two setups. The first is when the confidential
message is to be sent to two receivers and kept secret from the third receiver.
Achievability i... |
0910.1410 | Quantifying the implicit process flow abstraction in SBGN-PD diagrams
with Bio-PEPA | cs.PL cs.CE q-bio.QM | For a long time biologists have used visual representations of biochemical
networks to gain a quick overview of important structural properties. Recently
SBGN, the Systems Biology Graphical Notation, has been developed to standardise
the way in which such graphical maps are drawn in order to facilitate the
exchange o... |
0910.1412 | Dynamical and Structural Modularity of Discrete Regulatory Networks | cs.DM cs.CE q-bio.MN | A biological regulatory network can be modeled as a discrete function that
contains all available information on network component interactions. From this
function we can derive a graph representation of the network structure as well
as of the dynamics of the system. In this paper we introduce a method to
identify mo... |
0910.1415 | A study on the combined interplay between stochastic fluctuations and
the number of flagella in bacterial chemotaxis | q-bio.MN cs.CE | The chemotactic pathway allows bacteria to respond and adapt to environmental
changes, by tuning the tumbling and running motions that are due to clockwise
and counterclockwise rotations of their flagella. The pathway is tightly
regulated by feedback mechanisms governed by the phosphorylation and
methylation of sever... |
0910.1418 | Modelling an Ammonium Transporter with SCLS | q-bio.QM cs.CE q-bio.CB | The Stochastic Calculus of Looping Sequences (SCLS) is a recently proposed
modelling language for the representation and simulation of biological systems
behaviour. It has been designed with the aim of combining the simplicity of
notation of rewrite systems with the advantage of compositionality. It also
allows a rat... |
0910.1433 | Tracking object's type changes with fuzzy based fusion rule | cs.AI | In this paper the behavior of three combinational rules for
temporal/sequential attribute data fusion for target type estimation are
analyzed. The comparative analysis is based on: Dempster's fusion rule proposed
in Dempster-Shafer Theory; Proportional Conflict Redistribution rule no. 5
(PCR5), proposed in Dezert-Sma... |
0910.1463 | Near-Optimal Detection in MIMO Systems using Gibbs Sampling | cs.IT math.IT | In this paper we study a Markov Chain Monte Carlo (MCMC) Gibbs sampler for
solving the integer least-squares problem. In digital communication the problem
is equivalent to performing Maximum Likelihood (ML) detection in Multiple-Input
Multiple-Output (MIMO) systems. While the use of MCMC methods for such problems
has... |
0910.1484 | Ludics and its Applications to natural Language Semantics | cs.CL | Proofs, in Ludics, have an interpretation provided by their counter-proofs,
that is the objects they interact with. We follow the same idea by proposing
that sentence meanings are given by the counter-meanings they are opposed to in
a dialectical interaction. The conception is at the intersection of a
proof-theoretic... |
0910.1495 | Estimating Entropy of Data Streams Using Compressed Counting | cs.DS cs.DB | The Shannon entropy is a widely used summary statistic, for example, network
traffic measurement, anomaly detection, neural computations, spike trains, etc.
This study focuses on estimating Shannon entropy of data streams. It is known
that Shannon entropy can be approximated by Reenyi entropy or Tsallis entropy,
whic... |
0910.1511 | Cooperation with an Untrusted Relay: A Secrecy Perspective | cs.IT math.IT | We consider the communication scenario where a source-destination pair wishes
to keep the information secret from a relay node despite wanting to enlist its
help. For this scenario, an interesting question is whether the relay node
should be deployed at all. That is, whether cooperation with an untrusted relay
node c... |
0910.1532 | Capacity Bounds for Two-Hop Interference Networks | cs.IT math.IT | This paper considers a two-hop interference network, where two users transmit
independent messages to their respective receivers with the help of two relay
nodes. The transmitters do not have direct links to the receivers; instead, two
relay nodes serve as intermediaries between the transmitters and receivers.
Each h... |
0910.1536 | An algebraic framework for information theory: Classical Information | cs.IT math.IT | This work proposes a complete algebraic model for classical information
theory. As a precursor the essential probabilistic concepts have been defined
and analyzed in the algebraic setting. Examples from probability and
information theory demonstrate that in addition to theoretical insights
provided by the algebraic m... |
0910.1605 | Proceedings Second International Workshop on Computational Models for
Cell Processes | cs.CE cs.LO | The second international workshop on Computational Models for Cell Processes
(ComProc 2009) took place on November 3, 2009 at the Eindhoven University of
Technology, in conjunction with Formal Methods 2009. The workshop was jointly
organized with the EC-MOAN project. This volume contains the final versions of
all con... |
0910.1623 | Modified Basis Pursuit Denoising(MODIFIED-BPDN) for Noisy Compressive
Sensing with Partially Known Support | cs.IT math.IT | In this work, we study the problem of reconstructing a sparse signal from a
limited number of linear 'incoherent' noisy measurements, when a part of its
support is known. The known part of the support may be available from prior
knowledge or from the previous time instant (in applications requiring
recursive reconstr... |
0910.1639 | On the Fundamental Limits of Interweaved Cognitive Radios | cs.IT math.IT | This paper considers the problem of channel sensing in cognitive radios. The
system model considered is a set of N parallel (dis-similar) channels, where
each channel at any given time is either available or occupied by a legitimate
user. The cognitive radio is permitted to sense channels to determine each of
their s... |
0910.1650 | Local and global approaches of affinity propagation clustering for large
scale data | cs.LG cs.CV | Recently a new clustering algorithm called 'affinity propagation' (AP) has
been proposed, which efficiently clustered sparsely related data by passing
messages between data points. However, we want to cluster large scale data
where the similarities are not sparse in many cases. This paper presents two
variants of AP ... |
0910.1688 | Balancing Egoism and Altruism on MIMO Interference Channel | cs.IT math.IT | This paper considers the so-called multiple-input-multiple-output
interference channel (MIMO-IC) which has relevance in applications such as
multi-cell coordination in cellular networks as well as spectrum sharing in
cognitive radio networks among others. We consider a beamforming design
framework based on striking a... |
0910.1691 | Justifying additive-noise-model based causal discovery via algorithmic
information theory | cs.IT math.IT | A recent method for causal discovery is in many cases able to infer whether X
causes Y or Y causes X for just two observed variables X and Y. It is based on
the observation that there exist (non-Gaussian) joint distributions P(X,Y) for
which Y may be written as a function of X up to an additive noise term that is
ind... |
0910.1757 | Decomposition of forging die for high speed machining | cs.RO | Today's forging die manufacturing process must be adapted to several
evolutions in machining process generation: CAD/CAM models, CAM software
solutions and High Speed Machining (HSM). In this context, the adequacy between
die shape and HSM process is in the core of machining preparation and process
planning approache... |
0910.1758 | Circular tests for HSM machine tools: Bore machining application | cs.RO | Today's High-Speed Machining (HSM) machine tool combines productivity and
part quality. The difficulty inherent in HSM operations lies in understanding
the impact of machine tool behaviour on machining time and part quality.
Analysis of some of the relevant ISO standards (230-1998, 10791-1998) and a
complementary pro... |
0910.1760 | Machining strategy choice: performance VIEWER | cs.RO | Nowadays high speed machining (HSM) machine tool combines productivity and
part quality. So mould and die maker invested in HSM. Die and mould features
are more and more complex shaped. Thus, it is difficult to choose the best
machining strategy according to part shape. Geometrical analysis of machining
features is n... |
0910.1761 | Decomposition of forging dies for machining planning | cs.RO | This paper will provide a method to decompose forging dies for machining
planning in the case of high speed machining finishing operations. This method
lies on a machining feature approach model presented in the following paper.
The two main decomposition phases, called Basic Machining Features Extraction
and Process... |
0910.1762 | D\'efinition d'une pi\`ece test pour la caract\'erisation d'une machine
UGV | cs.RO | In several fields like aeronautics, die and automotive, the machining of the
parts is done more and more on high speed machines tools. Today, the offer for
purchasing these machine tools is very wide. This situation poses the problem
of the judicious and objective choice meeting industrial needs that must be
necessar... |
0910.1800 | Scaling Analysis of Affinity Propagation | cs.AI cond-mat.stat-mech | We analyze and exploit some scaling properties of the Affinity Propagation
(AP) clustering algorithm proposed by Frey and Dueck (2007). First we observe
that a divide and conquer strategy, used on a large data set hierarchically
reduces the complexity ${\cal O}(N^2)$ to ${\cal O}(N^{(h+2)/(h+1)})$, for a
data-set of ... |
0910.1838 | Password Based a Generalize Robust Security System Design Using Neural
Network | cs.CR cs.NE | Among the various means of available resource protection including
biometrics, password based system is most simple, user friendly, cost effective
and commonly used. But this method having high sensitivity with attacks. Most
of the advanced methods for authentication based on password encrypt the
contents of password... |
0910.1844 | 3D/2D Registration of Mapping Catheter Images for Arrhythmia
Interventional Assistance | cs.CV | Radiofrequency (RF) catheter ablation has transformed treatment for
tachyarrhythmias and has become first-line therapy for some tachycardias. The
precise localization of the arrhythmogenic site and the positioning of the RF
catheter over that site are problematic: they can impair the efficiency of the
procedure and a... |
0910.1849 | Color Image Clustering using Block Truncation Algorithm | cs.CV | With the advancement in image capturing device, the image data been generated
at high volume. If images are analyzed properly, they can reveal useful
information to the human users. Content based image retrieval address the
problem of retrieving images relevant to the user needs from image databases on
the basis of l... |
0910.1857 | Distributed Object Medical Imaging Model | cs.SE cs.CV | Digital medical informatics and images are commonly used in hospitals today,.
Because of the interrelatedness of the radiology department and other
departments, especially the intensive care unit and emergency department, the
transmission and sharing of medical images has become a critical issue. Our
research group h... |
0910.1863 | Computational Complexity of Decoding Orthogonal Space-Time Block Codes | cs.IT math.IT | The computational complexity of optimum decoding for an orthogonal space-time
block code G satisfying the orthogonality property that the Hermitian transpose
of G multiplied by G is equal to a constant c times the sum of the squared
symbols of the code times an identity matrix, where c is a positive integer is
quanti... |
0910.1865 | Towards Participatory Design of Multi-agent Approach to Transport
Demands | cs.MA | The design of multi-agent based simulations (MABS) is up to now mainly done
in laboratories and based on designers' understanding of the activities to be
simulated. Domain experts have little chance to directly validate agent
behaviors. To fill this gap, we are investigating participatory methods of
design, which all... |
0910.1868 | Evaluation of Hindi to Punjabi Machine Translation System | cs.CL | Machine Translation in India is relatively young. The earliest efforts date
from the late 80s and early 90s. The success of every system is judged from its
evaluation experimental results. Number of machine translation systems has been
started for development but to the best of author knowledge, no high quality
syste... |
0910.1869 | Management Of Volatile Information In Incremental Web Crawler | cs.IR | Paper has been withdrawn.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.