id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0805.3217 | Statistical region-based active contours with exponential family
observations | cs.CV | In this paper, we focus on statistical region-based active contour models
where image features (e.g. intensity) are random variables whose distribution
belongs to some parametric family (e.g. exponential) rather than confining
ourselves to the special Gaussian case. Using shape derivation tools, our
effort focuses on... |
0805.3218 | Region-based active contour with noise and shape priors | cs.CV | In this paper, we propose to combine formally noise and shape priors in
region-based active contours. On the one hand, we use the general framework of
exponential family as a prior model for noise. On the other hand, translation
and scale invariant Legendre moments are considered to incorporate the shape
prior (e.g. ... |
0805.3267 | Compressing Binary Decision Diagrams | cs.AI cs.DC | The paper introduces a new technique for compressing Binary Decision Diagrams
in those cases where random access is not required. Using this technique,
compression and decompression can be done in linear time in the size of the BDD
and compression will in many cases reduce the size of the BDD to 1-2 bits per
node. Em... |
0805.3339 | Tri de la table de faits et compression des index bitmaps avec
alignement sur les mots | cs.DB | Bitmap indexes are frequently used to index multidimensional data. They rely
mostly on sequential input/output. Bitmaps can be compressed to reduce
input/output costs and minimize CPU usage. The most efficient compression
techniques are based on run-length encoding (RLE), such as Word-Aligned Hybrid
(WAH) compression... |
0805.3366 | Computational Representation of Linguistic Structures using
Domain-Specific Languages | cs.CL | We describe a modular system for generating sentences from formal definitions
of underlying linguistic structures using domain-specific languages. The system
uses Java in general, Prolog for lexical entries and custom domain-specific
languages based on Functional Grammar and Functional Discourse Grammar
notation, imp... |
0805.3390 | Design of Attitude Stability System for Prolate Dual-spin Satellite in
Its Inclined Elliptical Orbit | cs.RO | In general, most of communication satellites were designed to be operated in
geostationary orbit. And many of them were designed in prolate dual-spin
configuration. As a prolate dual-spin vehicle, they have to be stabilized
against their internal energy dissipation effect. Several countries that
located in southern h... |
0805.3406 | Performance Analysis of Signal Detection using Quantized Received
Signals of Linear Vector Channel | cs.IT math.IT | Performance analysis of optimal signal detection using quantized received
signals of a linear vector channel, which is an extension of code-division
multiple-access (CDMA) or multiple-input multiple-output (MIMO) channels, in
the large system limit, is presented in this paper. Here the dimensions of
channel input and... |
0805.3410 | Exploring a type-theoretic approach to accessibility constraint
modelling | cs.CL | The type-theoretic modelling of DRT that [degroote06] proposed features
continuations for the management of the context in which a clause has to be
interpreted. This approach, while keeping the standard definitions of
quantifier scope, translates the rules of the accessibility constraints of
discourse referents insid... |
0805.3484 | A MacWilliams Identity for Convolutional Codes: The General Case | cs.IT math.IT math.OC | A MacWilliams Identity for convolutional codes will be established. It makes
use of the weight adjacency matrices of the code and its dual, based on state
space realizations (the controller canonical form) of the codes in question.
The MacWilliams Identity applies to various notions of duality appearing in the
litera... |
0805.3518 | Logic programming with social features | cs.AI | In everyday life it happens that a person has to reason about what other
people think and how they behave, in order to achieve his goals. In other
words, an individual may be required to adapt his behaviour by reasoning about
the others' mental state. In this paper we focus on a knowledge representation
language deri... |
0805.3521 | Towards applied theories based on computability logic | cs.LO cs.AI math.LO math.NT | Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a
recently launched program for redeveloping logic as a formal theory of
computability, as opposed to the formal theory of truth that logic has more
traditionally been. Formulas in it represent computational problems, "truth"
means existence o... |
0805.3528 | Coding Theory and Projective Spaces | cs.IT math.IT | The projective space of order $n$ over a finite field $\F_q$ is a set of all
subspaces of the vector space $\F_q^{n}$. In this work, we consider
error-correcting codes in the projective space, focusing mainly on constant
dimension codes. We start with the different representations of subspaces in
the projective space... |
0805.3569 | Joint Cooperation and Multi-Hopping Increase the Capacity of Wireless
Networks | cs.NI cs.IT math.IT | The problem of communication among nodes in an \emph{extended network} is
considered, where radio power decay and interference are limiting factors. It
has been shown previously that, with simple multi-hopping, the achievable total
communication rate in such a network is at most $\Theta(\sqrt{N})$. In this
work, we s... |
0805.3605 | Success Exponent of Wiretapper: A Tradeoff between Secrecy and
Reliability | cs.IT cs.CR math.IT math.PR | Equivocation rate has been widely used as an information-theoretic measure of
security after Shannon[10]. It simplifies problems by removing the effect of
atypical behavior from the system. In [9], however, Merhav and Arikan
considered the alternative of using guessing exponent to analyze the Shannon's
cipher system.... |
0805.3638 | Sequential detection of Markov targets with trajectory estimation | cs.IT math.IT | The problem of detection and possible estimation of a signal generated by a
dynamic system when a variable number of noisy measurements can be taken is
here considered. Assuming a Markov evolution of the system (in particular, the
pair signal-observation forms a hidden Markov model), a sequential procedure is
propose... |
0805.3643 | Overlay Cognitive Radio in Wireless Mesh Networks | cs.IT cs.NI math.IT | In this paper we apply the concept of overlay cognitive radio to the
communication between nodes in a wireless mesh network. Based on the overlay
cognitive radio model, it is possible to have two concurrent transmissions in a
given interference region, where usually only one communication takes place at
a given time.... |
0805.3747 | Constructing Folksonomies from User-specified Relations on Flickr | cs.AI | Many social Web sites allow users to publish content and annotate with
descriptive metadata. In addition to flat tags, some social Web sites have
recently began to allow users to organize their content and metadata
hierarchically. The social photosharing site Flickr, for example, allows users
to group related photos ... |
0805.3799 | The Structure of Narrative: the Case of Film Scripts | cs.AI | We analyze the style and structure of story narrative using the case of film
scripts. The practical importance of this is noted, especially the need to have
support tools for television movie writing. We use the Casablanca film script,
and scripts from six episodes of CSI (Crime Scene Investigation). For analysis
of ... |
0805.3800 | An Evolutionary-Based Approach to Learning Multiple Decision Models from
Underrepresented Data | cs.AI cs.NE | The use of multiple Decision Models (DMs) enables to enhance the accuracy in
decisions and at the same time allows users to evaluate the confidence in
decision making. In this paper we explore the ability of multiple DMs to learn
from a small amount of verified data. This becomes important when data samples
are diffi... |
0805.3802 | Feature Selection for Bayesian Evaluation of Trauma Death Risk | cs.AI | In the last year more than 70,000 people have been brought to the UK
hospitals with serious injuries. Each time a clinician has to urgently take a
patient through a screening procedure to make a reliable decision on the trauma
treatment. Typically, such procedure comprises around 20 tests; however the
condition of a ... |
0805.3824 | On Metrics for Error Correction in Network Coding | cs.IT math.IT | The problem of error correction in both coherent and noncoherent network
coding is considered under an adversarial model. For coherent network coding,
where knowledge of the network topology and network code is assumed at the
source and destination nodes, the error correction capability of an (outer)
code is succinct... |
0805.3935 | Fusion for Evaluation of Image Classification in Uncertain Environments | cs.AI | We present in this article a new evaluation method for classification and
segmentation of textured images in uncertain environments. In uncertain
environments, real classes and boundaries are known with only a partial
certainty given by the experts. Most of the time, in many presented papers,
only classification or o... |
0805.3939 | Decision Support with Belief Functions Theory for Seabed
Characterization | cs.AI cs.IT math.IT | The seabed characterization from sonar images is a very hard task because of
the produced data and the unknown environment, even for an human expert. In
this work we propose an original approach in order to combine binary
classifiers arising from different kinds of strategies such as one-versus-one
or one-versus-rest... |
0805.3964 | DimReduction - Interactive Graphic Environment for Dimensionality
Reduction | cs.CV | Feature selection is a pattern recognition approach to choose important
variables according to some criteria to distinguish or explain certain
phenomena. There are many genomic and proteomic applications which rely on
feature selection to answer questions such as: selecting signature genes which
are informative about... |
0805.3972 | Intuitive visualization of the intelligence for the run-down of
terrorist wire-pullers | cs.AI | The investigation of the terrorist attack is a time-critical task. The
investigators have a limited time window to diagnose the organizational
background of the terrorists, to run down and arrest the wire-pullers, and to
take an action to prevent or eradicate the terrorist attack. The intuitive
interface to visualize... |
0805.4023 | Robust Joint Source-Channel Coding for Delay-Limited Applications | cs.IT math.IT | In this paper, we consider the problem of robust joint source-channel coding
over an additive white Gaussian noise channel. We propose a new scheme which
achieves the optimal slope of the signal-to-distortion (SDR) curve (unlike the
previously known coding schemes). Also, we propose a family of robust codes
which tog... |
0805.4053 | Source Coding for a Simple Network with Receiver Side Information | cs.IT math.IT | We consider the problem of source coding with receiver side information for
the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a
transmitter must reliably transport the output of two correlated information
sources to two receivers using three noiseless channels: a public channel which
conne... |
0805.4059 | Menger's Paths with Minimum Mergings | cs.IT math.CO math.IT | For an acyclic directed graph with multiple sources and multiple sinks, we
prove that one can choose the Merger's paths between the sources and the sinks
such that the number of mergings between these paths is upper bounded by a
constant depending only on the min-cuts between the sources and the sinks,
regardless of ... |
0805.4081 | Dynamics of thematic information flows | cs.IT math.IT | The studies of the dynamics of topical dataflow of new information in the
framework of a logistic model were suggested. The condition of topic balance,
when the number of publications on all topics is proportional to the
information space and time, was presented. General time dependence of the
publication intensity i... |
0805.4085 | Peculiarities of the Correlation between Local and Global News
Popularity of Electronic Mass Media | cs.IT math.IT | One of the approaches to the solution of the navigation problem in current
information flows is ranking the documents according to their popularity level.
The definition of local and global news popularity which is based on the number
of similar-in-content documents, published within local and global time
interval, w... |
0805.4101 | Goal-oriented Dialog as a Collaborative Subordinated Activity involving
Collective Acceptance | cs.AI cs.CL | Modeling dialog as a collaborative activity consists notably in specifying
the content of the Conversational Common Ground and the kind of social mental
state involved. In previous work (Saget, 2006), we claim that Collective
Acceptance is the proper social attitude for modeling Conversational Common
Ground in the pa... |
0805.4107 | Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P
Networks | cs.NI cs.DB | We introduce a decentralized replication strategy for peer-to-peer file
exchange based on exhaustive exploration of the neighborhood of any node in the
network. The replication scheme lets the replicas evenly populate the network
mesh, while regulating the total number of replicas at the same time. This is
achieved b... |
0805.4112 | On the entropy and log-concavity of compound Poisson measures | cs.IT math.IT math.PR | Motivated, in part, by the desire to develop an information-theoretic
foundation for compound Poisson approximation limit theorems (analogous to the
corresponding developments for the central limit theorem and for simple Poisson
approximation), this work examines sufficient conditions under which the
compound Poisson... |
0805.4134 | Design and Implementation Aspects of a novel Java P2P Simulator with GUI | cs.NI cs.DB cs.DC | Peer-to-peer networks consist of thousands or millions of nodes that might
join and leave arbitrarily. The evaluation of new protocols in real
environments is many times practically impossible, especially at design and
testing stages. The purpose of this paper is to describe the implementation
aspects of a new Java b... |
0805.4247 | Neural network learning of optimal Kalman prediction and control | cs.NE | Although there are many neural network (NN) algorithms for prediction and for
control, and although methods for optimal estimation (including filtering and
prediction) and for optimal control in linear systems were provided by Kalman
in 1960 (with nonlinear extensions since then), there has been, to my
knowledge, no ... |
0805.4248 | On the Capacity of Wireless Multicast Networks | cs.IT math.IT | The problem of maximizing the average rate in a multicast network subject to
a coverage constraint (minimum quality of service) is studied. Assuming the
channel state information is available only at the receiver side and single
antenna nodes, the highest expected rate achievable by a random user in the
network, call... |
0805.4249 | Coalition Games with Cooperative Transmission: A Cure for the Curse of
Boundary Nodes in Selfish Packet-Forwarding Wireless Networks | cs.IT cs.GT math.IT | In wireless packet-forwarding networks with selfish nodes, application of a
repeated game can induce the nodes to forward each others' packets, so that the
network performance can be improved. However, the nodes on the boundary of such
networks cannot benefit from this strategy, as the other nodes do not depend on
th... |
0805.4290 | From Data Topology to a Modular Classifier | cs.LG | This article describes an approach to designing a distributed and modular
neural classifier. This approach introduces a new hierarchical clustering that
enables one to determine reliable regions in the representation space by
exploiting supervised information. A multilayer perceptron is then associated
with each of t... |
0805.4338 | Quantization of Prior Probabilities for Hypothesis Testing | cs.IT math.IT math.ST stat.TH | Bayesian hypothesis testing is investigated when the prior probabilities of
the hypotheses, taken as a random vector, are quantized. Nearest neighbor and
centroid conditions are derived using mean Bayes risk error as a distortion
measure for quantization. A high-resolution approximation to the
distortion-rate functio... |
0805.4369 | A semantic space for modeling children's semantic memory | cs.CL | The goal of this paper is to present a model of children's semantic memory,
which is based on a corpus reproducing the kinds of texts children are exposed
to. After presenting the literature in the development of the semantic memory,
a preliminary French corpus of 3.2 million words is described. Similarities in
the r... |
0805.4374 | Capacity Bounds for Broadcast Channels with Confidential Messages | cs.IT math.IT | In this paper, we study capacity bounds for discrete memoryless broadcast
channels with confidential messages. Two private messages as well as a common
message are transmitted; the common message is to be decoded by both receivers,
while each private message is only for its intended receiver. In addition, each
privat... |
0805.4425 | Low-Complexity Structured Precoding for Spatially Correlated MIMO
Channels | cs.IT math.IT | The focus of this paper is on spatial precoding in correlated multi-antenna
channels, where the number of independent data-streams is adapted to trade-off
the data-rate with the transmitter complexity. Towards the goal of a
low-complexity implementation, a structured precoder is proposed, where the
precoder matrix ev... |
0805.4440 | Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size | cs.IT math.IT | An erasure channel with a fixed alphabet size $q$, where $q \gg 1$, is
studied. It is proved that over any erasure channel (with or without memory),
Maximum Distance Separable (MDS) codes achieve the minimum probability of error
(assuming maximum likelihood decoding). Assuming a memoryless erasure channel,
the error ... |
0805.4471 | Exact Matrix Completion via Convex Optimization | cs.IT math.IT | We consider a problem of considerable practical interest: the recovery of a
data matrix from a sampling of its entries. Suppose that we observe m entries
selected uniformly at random from a matrix M. Can we complete the matrix and
recover the entries that we have not seen?
We show that one can perfectly recover mos... |
0805.4502 | Golden Space-Time Block Coded Modulation | cs.IT math.IT | In this paper we present a block coded modulation scheme for a 2 x 2 MIMO
system over slow fading channels, where the inner code is the Golden Code. The
scheme is based on a set partitioning of the Golden Code using two-sided ideals
whose norm is a power of two. In this case, a lower bound for the minimum
determinant... |
0805.4508 | Modeling Loosely Annotated Images with Imagined Annotations | cs.IR cs.AI | In this paper, we present an approach to learning latent semantic analysis
models from loosely annotated images for automatic image annotation and
indexing. The given annotation in training images is loose due to: (1)
ambiguous correspondences between visual features and annotated keywords; (2)
incomplete lists of an... |
0805.4521 | Textual Entailment Recognizing by Theorem Proving Approach | cs.CL | In this paper we present two original methods for recognizing textual
inference. First one is a modified resolution method such that some linguistic
considerations are introduced in the unification of two atoms. The approach is
possible due to the recent methods of transforming texts in logic formulas.
Second one is ... |
0805.4560 | Rock mechanics modeling based on soft granulation theory | cs.AI | This paper describes application of information granulation theory, on the
design of rock engineering flowcharts. Firstly, an overall flowchart, based on
information granulation theory has been highlighted. Information granulation
theory, in crisp (non-fuzzy) or fuzzy format, can take into account engineering
experie... |
0805.4583 | Channels that Heat Up | cs.IT math.IT | This work considers an additive noise channel where the time-k noise variance
is a weighted sum of the channel input powers prior to time k. This channel is
motivated by point-to-point communication between two terminals that are
embedded in the same chip. Transmission heats up the entire chip and hence
increases the... |
0805.4620 | Uplink Macro Diversity of Limited Backhaul Cellular Network | cs.IT math.IT | In this work new achievable rates are derived, for the uplink channel of a
cellular network with joint multicell processing, where unlike previous
results, the ideal backhaul network has finite capacity per-cell. Namely, the
cell sites are linked to the central joint processor via lossless links with
finite capacity.... |
0805.4722 | La fiabilit\'e des informations sur le web | cs.IR cs.CL cs.CY | Online IR tools have to take into account new phenomena linked to the
appearance of blogs, wiki and other collaborative publications. Among these
collaborative sites, Wikipedia represents a crucial source of information.
However, the quality of this information has been recently questionned. A
better knowledge of the... |
0805.4748 | New Construction of 2-Generator Quasi-Twisted Codes | cs.IT math.IT | Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes.
Based on consta-cyclic simplex codes, a new explicit construction of a family
of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also
shown that many codes in the family meet the Griesmer bound and therefore are
length-optim... |
0805.4754 | Managing conflicts between users in Wikipedia | cs.IR cs.CL cs.CY cs.HC | Wikipedia is nowadays a widely used encyclopedia, and one of the most visible
sites on the Internet. Its strong principle of collaborative work and free
editing sometimes generates disputes due to disagreements between users. In
this article we study how the wikipedian community resolves the conflicts and
which roles... |
0806.0036 | On the Design of Universal LDPC Codes | cs.IT math.IT | Low-density parity-check (LDPC) coding for a multitude of equal-capacity
channels is studied. First, based on numerous observations, a conjecture is
stated that when the belief propagation decoder converges on a set of
equal-capacity channels, it would also converge on any convex combination of
those channels. Then, ... |
0806.0075 | An Experimental Investigation of XML Compression Tools | cs.DB | This paper presents an extensive experimental study of the state-of-the-art
of XML compression tools. The study reports the behavior of nine XML
compressors using a large corpus of XML documents which covers the different
natures and scales of XML documents. In addition to assessing and comparing the
performance char... |
0806.0080 | Outer Bounds for Multiple Access Channels with Feedback using Dependence
Balance | cs.IT math.IT | We use the idea of dependence balance to obtain a new outer bound for the
capacity region of the discrete memoryless multiple access channel with
noiseless feedback (MAC-FB). We consider a binary additive noisy MAC-FB whose
feedback capacity is not known. The binary additive noisy MAC considered in
this paper can be ... |
0806.0142 | Regularization of Invers Problem for M-Ary Channel | cs.IT math.IT | The problem of computation of parameters of m-ary channel is considered. It
is demonstrated that although the problem is ill-posed, it is possible turning
of the parameters of the system and transform the problem to well-posed one.
|
0806.0250 | Checking the Quality of Clinical Guidelines using Automated Reasoning
Tools | cs.AI cs.LO cs.SC | Requirements about the quality of clinical guidelines can be represented by
schemata borrowed from the theory of abductive diagnosis, using temporal logic
to model the time-oriented aspects expressed in a guideline. Previously, we
have shown that these requirements can be verified using interactive theorem
proving te... |
0806.0283 | Model of information diffusion | cs.IT math.IT | The system of cellular automata, which expresses the process of dissemination
and publication of the news among separate information resources, has been
described. A bell-shaped dependence of news diffusion on internet-sources
(web-sites) coheres well with a real behavior of thematic data flows, and at
local time spa... |
0806.0473 | Kinematic Analysis of the vertebra of an eel like robot | cs.RO physics.class-ph | The kinematic analysis of a spherical wrist with parallel architecture is the
object of this article. This study is part of a larger French project, which
aims to design and to build an eel like robot to imitate the eel swimming. To
implement direct and inverse kinematics on the control law of the prototype, we
need ... |
0806.0526 | An Ontology-based Knowledge Management System for Industry Clusters | cs.AI | Knowledge-based economy forces companies in the nation to group together as a
cluster in order to maintain their competitiveness in the world market. The
cluster development relies on two key success factors which are knowledge
sharing and collaboration between the actors in the cluster. Thus, our study
tries to prop... |
0806.0535 | Sincere-Strategy Preference-Based Approval Voting Fully Resists
Constructive Control and Broadly Resists Destructive Control | cs.GT cs.CC cs.MA | We study sincere-strategy preference-based approval voting (SP-AV), a system
proposed by Brams and Sanver [Electoral Studies, 25(2):287-305, 2006], and here
adjusted so as to coerce admissibility of the votes (rather than excluding
inadmissible votes a priori), with respect to procedural control. In such
control scen... |
0806.0562 | Universal Coding on Infinite Alphabets: Exponentially Decreasing
Envelopes | cs.IT math.IT | This paper deals with the problem of universal lossless coding on a countable
infinite alphabet. It focuses on some classes of sources defined by an envelope
condition on the marginal distribution, namely exponentially decreasing
envelope classes with exponent $\alpha$. The minimax redundancy of
exponentially decreas... |
0806.0576 | Steganographic Routing in Multi Agent System Environment | cs.CR cs.MA | In this paper we present an idea of trusted communication platform for
Multi-Agent Systems (MAS) called TrustMAS. Based on analysis of routing
protocols suitable for MAS we have designed a new proactive hidden routing.
Proposed steg-agents discovery procedure, as well as further routes updates and
hidden communicatio... |
0806.0579 | Multirate Synchronous Sampling of Sparse Multiband Signals | cs.IT math.IT | Recent advances in optical systems make them ideal for undersampling
multiband signals that have high bandwidths. In this paper we propose a new
scheme for reconstructing multiband sparse signals using a small number of
sampling channels. The scheme, which we call synchronous multirate sampling
(SMRS), entails gather... |
0806.0604 | Information-theoretic limits on sparse signal recovery: Dense versus
sparse measurement matrices | math.ST cs.IT math.IT stat.TH | We study the information-theoretic limits of exactly recovering the support
of a sparse signal using noisy projections defined by various classes of
measurement matrices. Our analysis is high-dimensional in nature, in which the
number of observations $n$, the ambient signal dimension $p$, and the signal
sparsity $k$ ... |
0806.0676 | On Peak versus Average Interference Power Constraints for Protecting
Primary Users in Cognitive Radio Networks | cs.IT math.IT | This paper considers spectrum sharing for wireless communication between a
cognitive radio (CR) link and a primary radio (PR) link. It is assumed that the
CR protects the PR transmission by applying the so-called
interference-temperature constraint, whereby the CR is allowed to transmit
regardless of the PR's on/off ... |
0806.0689 | Directional Cross Diamond Search Algorithm for Fast Block Motion
Estimation | cs.CV | In block-matching motion estimation (BMME), the search patterns have a
significant impact on the algorithm's performance, both the search speed and
the search quality. The search pattern should be designed to fit the motion
vector probability (MVP) distribution characteristics of the real-world
sequences. In this pap... |
0806.0740 | Modeling And Simulation Of Prolate Dual-Spin Satellite Dynamics In An
Inclined Elliptical Orbit: Case Study Of Palapa B2R Satellite | cs.RO | In response to the interest to re-use Palapa B2R satellite nearing its End of
Life (EOL) time, an idea to incline the satellite orbit in order to cover a new
region has emerged in the recent years. As a prolate dual-spin vehicle, Palapa
B2R has to be stabilized against its internal energy dissipation effect. This
wor... |
0806.0743 | Onboard Multivariable Controller Design for a Small Scale Helicopter
Using Coefficient Diagram Method | cs.RO | A mini scale helicopter exhibits not only increased sensitivity to control
inputs and disturbances, but also higher bandwidth of its dynamics. These
properties make model helicopters, as a flying robot, more difficult to
control. The dynamics model accuracy will determine the performance of the
designed controller. I... |
0806.0784 | Collaborative model of interaction and Unmanned Vehicle Systems'
interface | cs.AI cs.HC cs.MA | The interface for the next generation of Unmanned Vehicle Systems should be
an interface with multi-modal displays and input controls. Then, the role of
the interface will not be restricted to be a support of the interactions
between the ground operator and vehicles. Interface must take part in the
interaction manage... |
0806.0837 | Upper and Lower Bounds on Black-Box Steganography | cs.CR cs.CC cs.IT math.IT | We study the limitations of steganography when the sender is not using any
properties of the underlying channel beyond its entropy and the ability to
sample from it. On the negative side, we show that the number of samples the
sender must obtain from the channel is exponential in the rate of the
stegosystem. On the p... |
0806.0838 | Performance Analysis of Multiple Antenna Multi-User Detection | cs.IT math.IT | We derive the diversity order of some multiple antenna multi-user
cancellation and detection schemes. The common property of these detection
methods is the usage of Alamouti and quasi-orthogonal space-time block codes.
For detecting $J$ users each having $N$ transmit antennas, these schemes
require only $J$ antennas ... |
0806.0870 | The Euler-Poincare theory of Metamorphosis | cs.CV nlin.CD | In the pattern matching approach to imaging science, the process of
``metamorphosis'' is template matching with dynamical templates. Here, we
recast the metamorphosis equations of into the Euler-Poincare variational
framework of and show that the metamorphosis equations contain the equations
for a perfect complex flu... |
0806.0899 | A Nonparametric Approach to 3D Shape Analysis from Digital Camera Images
- I. in Memory of W.P. Dayawansa | stat.ME cs.CV math.ST stat.TH | In this article, for the first time, one develops a nonparametric methodology
for an analysis of shapes of configurations of landmarks on real 3D objects
from regular camera photographs, thus making 3D shape analysis very accessible.
A fundamental result in computer vision by Faugeras (1992), Hartley, Gupta and
Chang... |
0806.0903 | On the Capacity of Gaussian Relay Channels | cs.IT math.IT | This paper has been withdrawn due to that the same conclusion has been
proposed before.
|
0806.0905 | Channel Capacity Limits of Cognitive Radio in Asymmetric Fading
Environments | cs.IT math.IT | Cognitive radio technology is an innovative radio design concept which aims
to increase spectrum utilization by exploiting unused spectrum in dynamically
changing environments. By extending previous results, we investigate the
capacity gains achievable with this dynamic spectrum approach in asymmetric
fading channels... |
0806.0909 | Outage and Local Throughput and Capacity of Random Wireless Networks | cs.IT cs.NI math.IT | Outage probabilities and single-hop throughput are two important performance
metrics that have been evaluated for certain specific types of wireless
networks. However, there is a lack of comprehensive results for larger classes
of networks, and there is no systematic approach that permits the convenient
comparison of... |
0806.1006 | The VO-Neural project: recent developments and some applications | astro-ph cs.CE | VO-Neural is the natural evolution of the Astroneural project which was
started in 1994 with the aim to implement a suite of neural tools for data
mining in astronomical massive data sets. At a difference with its ancestor,
which was implemented under Matlab, VO-Neural is written in C++, object
oriented, and it is sp... |
0806.1062 | Capacity of Block-Memoryless Channels with Causal Channel Side
Information | cs.IT math.IT | The capacity of a time-varying block-memoryless channel in which the
transmitter and the receiver have access to (possibly different) noisy causal
channel side information (CSI) is obtained. It is shown that the capacity
formula obtained in this correspondence reduces to the capacity formula
reported in \cite{Gold07}... |
0806.1071 | Histograms and Wavelets on Probabilistic Data | cs.DB | There is a growing realization that uncertain information is a first-class
citizen in modern database management. As such, we need techniques to correctly
and efficiently process uncertain data in database systems. In particular, data
reduction techniques that can produce concise, accurate synopses of large
probabili... |
0806.1144 | GRID-Launcher v.1.0 | astro-ph cs.CE | GRID-launcher-1.0 was built within the VO-Tech framework, as a software
interface between the UK-ASTROGRID and a generic GRID infrastructures in order
to allow any ASTROGRID user to launch on the GRID computing intensive tasks
from the ASTROGRID Workbench or Desktop. Even though of general application, so
far the Gri... |
0806.1156 | Utilisation des grammaires probabilistes dans les t\^aches de
segmentation et d'annotation prosodique | cs.LG | Nous pr\'esentons dans cette contribution une approche \`a la fois symbolique
et probabiliste permettant d'extraire l'information sur la segmentation du
signal de parole \`a partir d'information prosodique. Nous utilisons pour ce
faire des grammaires probabilistes poss\'edant une structure hi\'erarchique
minimale. La... |
0806.1199 | Belief Propagation and Beyond for Particle Tracking | cs.IT cond-mat.stat-mech cs.AI cs.LG math.IT physics.flu-dyn | We describe a novel approach to statistical learning from particles tracked
while moving in a random environment. The problem consists in inferring
properties of the environment from recorded snapshots. We consider here the
case of a fluid seeded with identical passive particles that diffuse and are
advected by a flo... |
0806.1215 | Performance of LDPC Codes Under Faulty Iterative Decoding | cs.IT math.IT | Departing from traditional communication theory where decoding algorithms are
assumed to perform without error, a system where noise perturbs both
computational devices and communication channels is considered here. This paper
studies limits in processing noisy signals with noisy circuits by investigating
the effect ... |
0806.1231 | Improving Classical Authentication with Quantum Communication | cs.IT cs.CR math.IT | We propose a quantum-enhanced protocol to authenticate classical messages,
with improved security with respect to the classical scheme introduced by
Brassard in 1983. In that protocol, the shared key is the seed of a
pseudo-random generator (PRG) and a hash function is used to create the
authentication tag of a publi... |
0806.1280 | The Role of Artificial Intelligence Technologies in Crisis Response | cs.AI | Crisis response poses many of the most difficult information technology in
crisis management. It requires information and communication-intensive efforts,
utilized for reducing uncertainty, calculating and comparing costs and
benefits, and managing resources in a fashion beyond those regularly available
to handle rou... |
0806.1316 | The end of Sleeping Beauty's nightmare | cs.AI math.PR | The way a rational agent changes her belief in certain
propositions/hypotheses in the light of new evidence lies at the heart of
Bayesian inference. The basic natural assumption, as summarized in van
Fraassen's Reflection Principle ([1984]), would be that in the absence of new
evidence the belief should not change. Y... |
0806.1343 | Temporized Equilibria | cs.GT cs.AI | This paper has been withdrawn by the author due to a crucial error in the
submission action.
|
0806.1372 | Robust Cognitive Beamforming With Partial Channel State Information | cs.IT math.IT | This paper considers a spectrum sharing based cognitive radio (CR)
communication system, which consists of a secondary user (SU) having multiple
transmit antennas and a single receive antenna and a primary user (PU) having a
single receive antenna. The channel state information (CSI) on the link of the
SU is assumed ... |
0806.1397 | The Improvement of the Bound on Hash Family | cs.IT math.IT | In this paper, we study the bound on three kinds of hash family using the
Singleton bound. To $\epsilon-U(N; n, m)$ hash family, in the caes of $n>m^2>1$
and $1\geq\epsilon\geq \epsilon_1(n, m)$, we get that the new bound is better.
To $\epsilon-\bigtriangleup U(N; n, m)$ hash family, in the case of $n>m>1$ and
$1\ge... |
0806.1439 | Dynamic Network of Concepts from Web-Publications | cs.IT math.IT | The network, the nodes of which are concepts (people's names, companies'
names, etc.), extracted from web-publications, is considered. A working
algorithm of extracting such concepts is presented. Edges of the network under
consideration refer to the reference frequency which depends on the fact how
many times the co... |
0806.1446 | Fast Wavelet-Based Visual Classification | cs.CV | We investigate a biologically motivated approach to fast visual
classification, directly inspired by the recent work of Serre et al.
Specifically, trading-off biological accuracy for computational efficiency, we
explore using wavelet and grouplet-like transforms to parallel the tuning of
visual cortex V1 and V2 cells... |
0806.1549 | Bits through ARQs | cs.IT math.IT | A fundamental problem in dynamic frequency reuse is that the cognitive radio
is ignorant of the amount of interference it inflicts on the primary license
holder. A model for such a situation is proposed and analyzed. The primary
sends packets across an erasure channel and employs simple ACK/NAK feedback
(ARQs) to ret... |
0806.1565 | Competitive Design of Multiuser MIMO Systems based on Game Theory: A
Unified View | cs.IT cs.GT math.IT math.OC | This paper considers the noncooperative maximization of mutual information in
the Gaussian interference channel in a fully distributed fashion via game
theory. This problem has been studied in a number of papers during the past
decade for the case of frequency-selective channels. A variety of conditions
guaranteeing ... |
0806.1577 | Co-ordinate Interleaved Distributed Space-Time Coding for
Two-Antenna-Relays Networks | cs.IT math.IT | Distributed space time coding for wireless relay networks when the source,
the destination and the relays have multiple antennas have been studied by Jing
and Hassibi. In this set-up, the transmit and the receive signals at different
antennas of the same relay are processed and designed independently, even
though the... |
0806.1636 | Data-Complexity of the Two-Variable Fragment with Counting Quantifiers | cs.LO cs.AI cs.CC | The data-complexity of both satisfiability and finite satisfiability for the
two-variable fragment with counting is NP-complete; the data-complexity of both
query-answering and finite query-answering for the two-variable guarded
fragment with counting is co-NP-complete.
|
0806.1640 | Toward a combination rule to deal with partial conflict and specificity
in belief functions theory | cs.AI | We present and discuss a mixed conjunctive and disjunctive rule, a
generalization of conflict repartition rules, and a combination of these two
rules. In the belief functions theory one of the major problem is the conflict
repartition enlightened by the famous Zadeh's example. To date, many
combination rules have bee... |
0806.1659 | Bounds on the Sum Capacity of Synchronous Binary CDMA Channels | cs.IT math.IT | In this paper, we obtain a family of lower bounds for the sum capacity of
Code Division Multiple Access (CDMA) channels assuming binary inputs and binary
signature codes in the presence of additive noise with an arbitrary
distribution. The envelope of this family gives a relatively tight lower bound
in terms of the n... |
0806.1796 | Evaluation for Uncertain Image Classification and Segmentation | cs.CV cs.AI | Each year, numerous segmentation and classification algorithms are invented
or reused to solve problems where machine vision is needed. Generally, the
efficiency of these algorithms is compared against the results given by one or
many human experts. However, in many situations, the location of the real
boundaries of ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.