id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0704.3405 | Estimation Diversity and Energy Efficiency in Distributed Sensing | cs.IT math.IT | Distributed estimation based on measurements from multiple wireless sensors
is investigated. It is assumed that a group of sensors observe the same
quantity in independent additive observation noises with possibly different
variances. The observations are transmitted using amplify-and-forward (analog)
transmissions o... |
0704.3408 | The Trade-off between Processing Gains of an Impulse Radio UWB System in
the Presence of Timing Jitter | cs.IT math.IT | In time hopping impulse radio, $N_f$ pulses of duration $T_c$ are transmitted
for each information symbol. This gives rise to two types of processing gain:
(i) pulse combining gain, which is a factor $N_f$, and (ii) pulse spreading
gain, which is $N_c=T_f/T_c$, where $T_f$ is the mean interval between two
subsequent ... |
0704.3433 | Bayesian approach to rough set | cs.AI | This paper proposes an approach to training rough set models using Bayesian
framework trained using Markov Chain Monte Carlo (MCMC) method. The prior
probabilities are constructed from the prior knowledge that good rough set
models have fewer rules. Markov Chain Monte Carlo sampling is conducted through
sampling in t... |
0704.3434 | On sensing capacity of sensor networks for the class of linear
observation, fixed SNR models | cs.IT math.IT | In this paper we address the problem of finding the sensing capacity of
sensor networks for a class of linear observation models and a fixed SNR
regime. Sensing capacity is defined as the maximum number of signal dimensions
reliably identified per sensor observation. In this context sparsity of the
phenomena is a key... |
0704.3453 | An Adaptive Strategy for the Classification of G-Protein Coupled
Receptors | cs.AI q-bio.QM | One of the major problems in computational biology is the inability of
existing classification models to incorporate expanding and new domain
knowledge. This problem of static classification models is addressed in this
paper by the introduction of incremental learning for problems in
bioinformatics. Many machine lear... |
0704.3500 | Une plate-forme dynamique pour l'\'evaluation des performances des bases
de donn\'ees \`a objets | cs.DB | In object-oriented or object-relational databases such as multimedia
databases or most XML databases, access patterns are not static, i.e.,
applications do not always access the same objects in the same order
repeatedly. However, this has been the way these databases and associated
optimisation techniques such as clu... |
0704.3501 | Conception d'un banc d'essais d\'ecisionnel | cs.DB | We present in this paper a new benchmark for evaluating the performances of
data warehouses. Benchmarking is useful either to system users for comparing
the performances of different systems, or to system engineers for testing the
effect of various design choices. While the TPC (Transaction Processing
Performance Cou... |
0704.3504 | Smooth R\'enyi Entropy of Ergodic Quantum Information Sources | quant-ph cs.IT math.IT | We prove that the average smooth Renyi entropy rate will approach the entropy
rate of a stationary, ergodic information source, which is equal to the Shannon
entropy rate for a classical information source and the von Neumann entropy
rate for a quantum information source.
|
0704.3515 | Comparing Robustness of Pairwise and Multiclass Neural-Network Systems
for Face Recognition | cs.AI | Noise, corruptions and variations in face images can seriously hurt the
performance of face recognition systems. To make such systems robust,
multiclass neuralnetwork classifiers capable of learning from noisy data have
been suggested. However on large face data sets such systems cannot provide the
robustness at a hi... |
0704.3520 | Vers l'auto-administration des entrep\^ots de donn\'ees | cs.DB | With the wide development of databases in general and data warehouses in
particular, it is important to reduce the tasks that a database administrator
must perform manually. The idea of using data mining techniques to extract
useful knowledge for administration from the data themselves has existed for
some years. How... |
0704.3536 | $\delta$-sequences and Evaluation Codes defined by Plane Valuations at
Infinity | cs.IT math.IT | We introduce the concept of $\delta$-sequence. A $\delta$-sequence $\Delta$
generates a well-ordered semigroup $S$ in $\mathbb{Z}^2$ or $\mathbb{R}$. We
show how to construct (and compute parameters) for the dual code of any
evaluation code associated with a weight function defined by $\Delta$ from the
polynomial rin... |
0704.3588 | On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control
and Routing for Ad Hoc Networks | cs.IT math.IT | In this paper, a hierarchical cross-layer design approach is proposed to
increase energy efficiency in ad hoc networks through joint adaptation of
nodes' transmitting powers and route selection. The design maintains the
advantages of the classic OSI model, while accounting for the cross-coupling
between layers, throu... |
0704.3591 | Capacity of a Class of Modulo-Sum Relay Channels | cs.IT math.IT | This paper characterizes the capacity of a class of modulo additive noise
relay channels, in which the relay observes a corrupted version of the noise
and has a separate channel to the destination. The capacity is shown to be
strictly below the cut-set bound in general and achievable using a
quantize-and-forward stra... |
0704.3635 | Rough Sets Computations to Impute Missing Data | cs.CV cs.IR | Many techniques for handling missing data have been proposed in the
literature. Most of these techniques are overly complex. This paper explores an
imputation technique based on rough set computations. In this paper,
characteristic relations are introduced to describe incompletely specified
decision tables.It is show... |
0704.3644 | Capacity Gain from Two-Transmitter and Two-Receiver Cooperation | cs.IT math.IT | Capacity improvement from transmitter and receiver cooperation is
investigated in a two-transmitter, two-receiver network with phase fading and
full channel state information available at all terminals. The transmitters
cooperate by first exchanging messages over an orthogonal transmitter
cooperation channel, then en... |
0704.3662 | An Automated Evaluation Metric for Chinese Text Entry | cs.HC cs.CL | In this paper, we propose an automated evaluation metric for text entry. We
also consider possible improvements to existing text entry evaluation metrics,
such as the minimum string distance error rate, keystrokes per character, cost
per correction, and a unified approach proposed by MacKenzie, so they can
accommodat... |
0704.3665 | On the Development of Text Input Method - Lessons Learned | cs.CL cs.HC | Intelligent Input Methods (IM) are essential for making text entries in many
East Asian scripts, but their application to other languages has not been fully
explored. This paper discusses how such tools can contribute to the development
of computer processing of other oriental languages. We propose a design
philosoph... |
0704.3708 | Network statistics on early English Syntax: Structural criteria | cs.CL | This paper includes a reflection on the role of networks in the study of
English language acquisition, as well as a collection of practical criteria to
annotate free-speech corpora from children utterances. At the theoretical
level, the main claim of this paper is that syntactic networks should be
interpreted as the ... |
0704.3780 | Stochastic Optimization Algorithms | cs.NE | When looking for a solution, deterministic methods have the enormous
advantage that they do find global optima. Unfortunately, they are very
CPU-intensive, and are useless on untractable NP-hard problems that would
require thousands of years for cutting-edge computers to explore. In order to
get a result, one needs t... |
0704.3878 | A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA
Networks with Delay Constraints | cs.IT cs.GT math.IT | A game-theoretic framework is used to study the effect of constellation size
on the energy efficiency of wireless networks for M-QAM modulation. A
non-cooperative game is proposed in which each user seeks to choose its
transmit power (and possibly transmit symbol rate) as well as the constellation
size in order to ma... |
0704.3880 | Energy-Efficient Resource Allocation in Wireless Networks with
Quality-of-Service Constraints | cs.IT math.IT | A game-theoretic model is proposed to study the cross-layer problem of joint
power and rate control with quality of service (QoS) constraints in
multiple-access networks. In the proposed game, each user seeks to choose its
transmit power and rate in a distributed manner in order to maximize its own
utility while sati... |
0704.3881 | A Unified Approach to Energy-Efficient Power Control in Large CDMA
Systems | cs.IT math.IT | A unified approach to energy-efficient power control is proposed for
code-division multiple access (CDMA) networks. The approach is applicable to a
large family of multiuser receivers including the matched filter, the
decorrelator, the linear minimum mean-square error (MMSE) receiver, and the
(nonlinear) optimal dete... |
0704.3886 | A Note on Ontology and Ordinary Language | cs.AI cs.CL | We argue for a compositional semantics grounded in a strongly typed ontology
that reflects our commonsense view of the world and the way we talk about it.
Assuming such a structure we show that the semantics of various natural
language phenomena may become nearly trivial.
|
0704.3905 | Ensemble Learning for Free with Evolutionary Algorithms ? | cs.AI | Evolutionary Learning proceeds by evolving a population of classifiers, from
which it generally returns (with some notable exceptions) the single
best-of-run classifier as final result. In the meanwhile, Ensemble Learning,
one of the most efficient approaches in supervised Machine Learning for the
last decade, procee... |
0704.3969 | Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward | cs.IT math.IT | In this two-part paper, we consider the multiantenna multihop relay channels
in which the source signal arrives at the destination through N independent
relaying hops in series. The main concern of this work is to design relaying
strategies that utilize efficiently the relays in such a way that the diversity
is maxim... |
0705.0025 | Can the Internet cope with stress? | cs.HC cs.AI | When will the Internet become aware of itself? In this note the problem is
approached by asking an alternative question: Can the Internet cope with
stress? By extrapolating the psychological difference between coping and
defense mechanisms a distributed software experiment is outlined which could
reject the hypothesi... |
0705.0043 | Joint Detection and Identification of an Unobservable Change in the
Distribution of a Random Sequence | cs.IT math.IT | This paper examines the joint problem of detection and identification of a
sudden and unobservable change in the probability distribution function (pdf)
of a sequence of independent and identically distributed (i.i.d.) random
variables to one of finitely many alternative pdf's. The objective is quick
detection of the... |
0705.0044 | Reliable Memories Built from Unreliable Components Based on Expander
Graphs | cs.IT math.IT | In this paper, memories built from components subject to transient faults are
considered. A fault-tolerant memory architecture based on low-density
parity-check codes is proposed and the existence of reliable memories for the
adversarial failure model is proved. The proof relies on the expansion property
of the under... |
0705.0081 | Constructions of q-Ary Constant-Weight Codes | cs.IT math.IT | This paper introduces a new combinatorial construction for q-ary
constant-weight codes which yields several families of optimal codes and
asymptotically optimal codes. The construction reveals intimate connection
between q-ary constant-weight codes and sets of pairwise disjoint combinatorial
designs of various types.... |
0705.0085 | An efficient centralized binary multicast network coding algorithm for
any cyclic network | cs.IT math.IT | We give an algorithm for finding network encoding and decoding equations for
error-free multicasting networks with multiple sources and sinks. The algorithm
given is efficient (polynomial complexity) and works on any kind of network
(acyclic, link cyclic, flow cyclic, or even in the presence of knots). The key
idea w... |
0705.0123 | An Energy Efficiency Perspective on Training for Fading Channels | cs.IT math.IT | In this paper, the bit energy requirements of training-based transmission
over block Rayleigh fading channels are studied. Pilot signals are employed to
obtain the minimum mean-square-error (MMSE) estimate of the channel fading
coefficients. Energy efficiency is analyzed in the worst case scenario where
the channel e... |
0705.0124 | On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision
Detection | cs.IT math.IT | The low-snr capacity of M-ary PSK transmission over both the additive white
Gaussian noise (AWGN) and fading channels is analyzed when hard-decision
detection is employed at the receiver. Closed-form expressions for the first
and second derivatives of the capacity at zero snr are obtained. The
spectral-efficiency/bit... |
0705.0128 | Training Optimization for Gauss-Markov Rayleigh Fading Channels | cs.IT math.IT | In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading
channels is considered. A simple scenario, where a single pilot signal is
transmitted every T symbols and T-1 data symbols are transmitted in between the
pilots, is studied. First, it is assumed that binary phase-shift keying (BPSK)
modulati... |
0705.0130 | Performance Analysis for Multichannel Reception of OOFSK Signaling | cs.IT math.IT | In this paper, the error performance of on-off frequency shift keying (OOFSK)
modulation over fading channels is analyzed when the receiver is equipped with
multiple antennas. The analysis is conducted in two cases: the coherent
scenario where the fading is perfectly known at the receiver, and the
noncoherent scenari... |
0705.0132 | Error Probability Analysis of Peaky Signaling over Fading Channels | cs.IT math.IT | In this paper, the performance of signaling strategies with high
peak-to-average power ratio is analyzed in both coherent and noncoherent fading
channels. Two recently proposed modulation schemes, namely on-off binary
phase-shift keying and on-off quaternary phase-shift keying, are considered.
For these modulation fo... |
0705.0150 | Comparison of Discrete and Continuous Wavelet Transforms | cs.CE | In this paper we outline several points of view on the interplay between
discrete and continuous wavelet transforms; stressing both pure and applied
aspects of both. We outline some new links between the two transform
technologies based on the theory of representations of generators and
relations. By this we mean a f... |
0705.0197 | Fault Classification in Cylinders Using Multilayer Perceptrons, Support
Vector Machines and Guassian Mixture Models | cs.AI | Gaussian mixture models (GMM) and support vector machines (SVM) are
introduced to classify faults in a population of cylindrical shells. The
proposed procedures are tested on a population of 20 cylindrical shells and
their performance is compared to the procedure, which uses multi-layer
perceptrons (MLP). The modal p... |
0705.0199 | The Parameter-Less Self-Organizing Map algorithm | cs.NE cs.AI cs.CV | The Parameter-Less Self-Organizing Map (PLSOM) is a new neural network
algorithm based on the Self-Organizing Map (SOM). It eliminates the need for a
learning rate and annealing schemes for learning rate and neighbourhood size.
We discuss the relative performance of the PLSOM and the SOM and demonstrate
some tasks in... |
0705.0214 | Riemannian level-set methods for tensor-valued data | cs.CV | We present a novel approach for the derivation of PDE modeling
curvature-driven flows for matrix-valued data. This approach is based on the
Riemannian geometry of the manifold of Symmetric Positive Definite Matrices
Pos(n).
|
0705.0252 | Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels | cs.IT math.IT | We consider power allocation algorithms for fixed-rate transmission over
Nakagami-m non-ergodic block-fading channels with perfect transmitter and
receiver channel state information and discrete input signal constellations
under both short- and long-term power constraints. Optimal power allocation
schemes are shown t... |
0705.0253 | More Efficient Algorithms and Analyses for Unequal Letter Cost
Prefix-Free Coding | cs.IT cs.DS math.IT | There is a large literature devoted to the problem of finding an optimal
(min-cost) prefix-free code with an unequal letter-cost encoding alphabet of
size. While there is no known polynomial time algorithm for solving it
optimally there are many good heuristics that all provide additive errors to
optimal. The additiv... |
0705.0281 | Dynamic Clustering in Object-Oriented Databases: An Advocacy for
Simplicity | cs.DB | We present in this paper three dynamic clustering techniques for
Object-Oriented Databases (OODBs). The first two, Dynamic, Statistical &
Tunable Clustering (DSTC) and StatClust, exploit both comprehensive usage
statistics and the inter-object reference graph. They are quite elaborate.
However, they are also complex ... |
0705.0286 | Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for
Algebraic-Geometric Codes | cs.IT math.IT | This paper proposes a novel algorithm for finding error-locators of
algebraic-geometric codes that can eliminate the division-calculations of
finite fields from the Berlekamp-Massey-Sakata algorithm. This inverse-free
algorithm provides full performance in correcting a certain class of errors,
generic errors, which i... |
0705.0326 | Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid
Random Walk and One-Dimensional Mobility Models | cs.NI cs.IT math.IT | Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models
have been established in [23], where we showed that the optimal trade-offs can
be achieved using rate-less codes when the required delay guarantees are
sufficient large. In this paper, we extend the results to other mobility models
includin... |
0705.0423 | Encoding for the Blackwell Channel with Reinforced Belief Propagation | cs.IT math.IT | A key idea in coding for the broadcast channel (BC) is binning, in which the
transmitter encode information by selecting a codeword from an appropriate bin
(the messages are thus the bin indexes). This selection is normally done by
solving an appropriate (possibly difficult) combinatorial problem. Recently it
has bee... |
0705.0449 | Multiresolution Approximation of Polygonal Curves in Linear Complexity | cs.CV | We propose a new algorithm to the problem of polygonal curve approximation
based on a multiresolution approach. This algorithm is suboptimal but still
maintains some optimality between successive levels of resolution using dynamic
programming. We show theoretically and experimentally that this algorithm has a
linear ... |
0705.0450 | VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the
Performances of OODBs | cs.DB | Performance of object-oriented database systems (OODBs) is still an issue to
both designers and users nowadays. The aim of this paper is to propose a
generic discrete-event random simulation model, called VOODB, in order to
evaluate the performances of OODBs in general, and the performances of
optimization methods li... |
0705.0453 | OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented
Database Systems | cs.DB | We present in this paper a generic object-oriented benchmark (the Object
Clustering Benchmark) that has been designed to evaluate the performances of
clustering policies in object-oriented databases. OCB is generic because its
sample database may be customized to fit the databases introduced by the main
existing benc... |
0705.0454 | Performance Evaluation for Clustering Algorithms in Object-Oriented
Database Systems | cs.DB | It is widely acknowledged that good object clustering is critical to the
performance of object-oriented databases. However, object clustering always
involves some kind of overhead for the system. The aim of this paper is to
propose a modelling methodology in order to evaluate the performances of
different clustering ... |
0705.0462 | Resource modalities in game semantics | math.CT cs.CL | The description of resources in game semantics has never achieved the
simplicity and precision of linear logic, because of a misleading conception:
the belief that linear logic is more primitive than game semantics. We advocate
instead the contrary: that game semantics is conceptually more primitive than
linear logic... |
0705.0543 | The Design of Efficiently-Encodable Rate-Compatible LDPC Codes | cs.IT math.IT | We present a new class of irregular low-density parity-check (LDPC) codes for
moderate block lengths (up to a few thousand bits) that are well-suited for
rate-compatible puncturing. The proposed codes show good performance under
puncturing over a wide range of rates and are suitable for usage in incremental
redundanc... |
0705.0552 | Succinct Indexable Dictionaries with Applications to Encoding $k$-ary
Trees, Prefix Sums and Multisets | cs.DS cs.DM cs.IT math.IT | We consider the {\it indexable dictionary} problem, which consists of storing
a set $S \subseteq \{0,...,m-1\}$ for some integer $m$, while supporting the
operations of $\Rank(x)$, which returns the number of elements in $S$ that are
less than $x$ if $x \in S$, and -1 otherwise; and $\Select(i)$ which returns
the $i$... |
0705.0564 | Rate Bounds for MIMO Relay Channels | cs.IT math.IT | This paper considers the multi-input multi-output (MIMO) relay channel where
multiple antennas are employed by each terminal. Compared to single-input
single-output (SISO) relay channels, MIMO relay channels introduce additional
degrees of freedom, making the design and analysis of optimal cooperative
strategies more... |
0705.0588 | Clustering Co-occurrence of Maximal Frequent Patterns in Streams | cs.AI cs.DS | One way of getting a better view of data is using frequent patterns. In this
paper frequent patterns are subsets that occur a minimal number of times in a
stream of itemsets. However, the discovery of frequent patterns in streams has
always been problematic. Because streams are potentially endless it is in
principle ... |
0705.0593 | Clustering with Lattices in the Analysis of Graph Patterns | cs.AI cs.DS | Mining frequent subgraphs is an area of research where we have a given set of
graphs (each graph can be seen as a transaction), and we search for (connected)
subgraphs contained in many of these graphs. In this work we will discuss
techniques used in our framework Lattice2SAR for mining and analysing frequent
subgrap... |
0705.0602 | Risk Assessment Algorithms Based On Recursive Neural Networks | cs.NE | The assessment of highly-risky situations at road intersections have been
recently revealed as an important research topic within the context of the
automotive industry. In this paper we shall introduce a novel approach to
compute risk functions by using a combination of a highly non-linear processing
model in conjun... |
0705.0693 | Learning to Bluff | cs.AI | The act of bluffing confounds game designers to this day. The very nature of
bluffing is even open for debate, adding further complication to the process of
creating intelligent virtual players that can bluff, and hence play,
realistically. Through the use of intelligent, learning agents, and carefully
designed agent... |
0705.0734 | Soft constraint abstraction based on semiring homomorphism | cs.AI | The semiring-based constraint satisfaction problems (semiring CSPs), proposed
by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of
soft constraints. In this paper we propose an abstraction scheme for soft
constraints that uses semiring homomorphism. To find optimal solutions of the
concrete... |
0705.0738 | The Optimization of a Novel Prismatic Drive | cs.RO | The design of a mechanical transmission taking into account the transmitted
forces is reported in this paper. This transmission is based on Slide-o-Cam, a
cam mechanism with multiple rollers mounted on a common translating follower.
The design of Slide-o-Cam, a transmission intended to produce a sliding motion
from a... |
0705.0751 | Approximate textual retrieval | cs.IR cs.DL | An approximate textual retrieval algorithm for searching sources with high
levels of defects is presented. It considers splitting the words in a query
into two overlapping segments and subsequently building composite regular
expressions from interlacing subsets of the segments. This procedure reduces
the probability ... |
0705.0760 | Equivalence of LP Relaxation and Max-Product for Weighted Matching in
General Graphs | cs.IT cs.AI cs.LG cs.NI math.IT | Max-product belief propagation is a local, iterative algorithm to find the
mode/MAP estimate of a probability distribution. While it has been successfully
employed in a wide variety of applications, there are relatively few
theoretical guarantees of convergence and correctness for general loopy graphs
that may have m... |
0705.0761 | Bayesian Approach to Neuro-Rough Models | cs.AI | This paper proposes a neuro-rough model based on multi-layered perceptron and
rough set. The neuro-rough model is then tested on modelling the risk of HIV
from demographic data. The model is formulated using Bayesian framework and
trained using Monte Carlo method and Metropolis criterion. When the model was
tested to... |
0705.0781 | Medical Image Segmentation and Localization using Deformable Templates | cs.CV | This paper presents deformable templates as a tool for segmentation and
localization of biological structures in medical images. Structures are
represented by a prototype template, combined with a parametric warp mapping
used to deform the original shape. The localization procedure is achieved using
a multi-stage, mu... |
0705.0783 | Non-cooperative games for spreading code optimization, power control and
receiver design in wireless data networks | cs.IT cs.GT math.IT | This paper focuses on the issue of energy efficiency in wireless data
networks through a game theoretic approach. The case considered is that in
which each user is allowed to vary its transmit power, spreading code, and
uplink receiver in order to maximize its own utility, which is here defined as
the ratio of data t... |
0705.0828 | Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field
Annealing | cs.CV | Nuclear medicine (NM) images inherently suffer from large amounts of noise
and blur. The purpose of this research is to reduce the noise and blur while
maintaining image integrity for improved diagnosis. The proposed solution is to
increase image quality after the standard pre- and post-processing undertaken
by a gam... |
0705.0856 | The Multiobjective Optimization of a Prismatic Drive | cs.RO | The multiobjective optimization of Slide-o-Cam is reported in this paper.
Slide-o-Cam is a cam mechanism with multiple rollers mounted on a common
translating follower. This transmission provides pure-rolling motion, thereby
reducing the friction of rack-and-pinions and linear drives. A Pareto frontier
is obtained by... |
0705.0909 | Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks | cs.GT cs.IT math.IT | In this paper, a game-theoretic model for studying power control for wireless
data networks in frequency-selective multipath environments is analyzed. The
uplink of an impulse-radio ultrawideband system is considered. The effects of
self-interference and multiple-access interference on the performance of Rake
receive... |
0705.0932 | Variable-Rate Distributed Source Coding in the Presence of Byzantine
Sensors | cs.IT math.IT | The distributed source coding problem is considered when the sensors, or
encoders, are under Byzantine attack; that is, an unknown number of sensors
have been reprogrammed by a malicious intruder to undermine the reconstruction
at the fusion center. Three different forms of the problem are considered. The
first is a ... |
0705.0936 | Performance Comparison of Energy-Efficient Power Control for CDMA and
Multiuser UWB Networks | cs.GT cs.IT math.IT | This paper studies the performance of a wireless data network using
energy-efficient power control techniques when different multiple access
schemes, namely direct-sequence code division multiple access (DS-CDMA) and
impulse-radio ultrawideband (IR-UWB), are considered. Due to the large
bandwidth of the system, the m... |
0705.0952 | An Independent Evaluation of Subspace Face Recognition Algorithms | cs.CV | This paper explores a comparative study of both the linear and kernel
implementations of three of the most popular Appearance-based Face Recognition
projection classes, these being the methodologies of Principal Component
Analysis, Linear Discriminant Analysis and Independent Component Analysis. The
experimental proc... |
0705.0956 | On Isotropic Sets of Points in the Plane. Application to the Design of
Robot Archirectures | cs.RO | Various performance indices are used for the design of serial manipulators.
One method of optimization relies on the condition number of the Jacobian
matrix. The minimization of the condition number leads, under certain
conditions, to isotropic configurations, for which the roundoff-error
amplification is lowest. In ... |
0705.0959 | The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar
Parallel Manipulator | cs.RO | Presented in this paper is the kinematic analysis of a symmetrical
three-degree-of-freedom planar parallel manipulator. In opposite to serial
manipulators, parallel manipulators can admit not only multiple inverse
kinematic solutions, but also multiple direct kinematic solutions. This
property produces more complicat... |
0705.0960 | Uniqueness Domains in the Workspace of Parallel Manipulators | cs.RO | This work investigates new kinematic features of parallel manipulators. It is
well known that parallel manipulators admit generally several direct kinematic
solutions for a given set of input joint values. The aim of this paper is to
characterize the uniqueness domains in the workspace of parallel manipulators,
as we... |
0705.0961 | The Kinematic design of a 3-dof Hybrid Manipulator | cs.RO | This paper focuses on the kinematic properties of a new
three-degree-of-freedom hybrid manipulator. This manipulator is obtained by
adding in series to a five-bar planar mechanism (similar to the one studied by
Bajpai and Roth) a third revolute passing through the line of centers of the
two actuated revolute joints o... |
0705.0962 | Definition sets for the Direct Kinematics of Parallel Manipulators | cs.RO | The aim of this paper is to characterize the uniqueness domains in the
workspace of parallel manipulators, as well as their image in the joint space.
The notion of aspect introduced for serial manipulators in [Borrel 86] is
redefined for such parallel manipulators. Then, it is shown that it is possible
to link severa... |
0705.0969 | Artificial Neural Networks and Support Vector Machines for Water Demand
Time Series Forecasting | cs.AI | Water plays a pivotal role in many physical processes, and most importantly
in sustaining human life, animal life and plant life. Water supply entities
therefore have the responsibility to supply clean and safe water at the rate
required by the consumer. It is therefore necessary to implement mechanisms and
systems t... |
0705.0982 | A New Three-DOF Parallel Mechanism: Milling Machine Applications | cs.RO | This paper describes a new parallel kinematic architecture for machining
applications, namely, the orthoglide. This machine features three fixed
parallel linear joints which are mounted orthogonally and a mobile platform
which moves in the Cartesian x-y-z space with fixed orientation. The main
interest of the orthogl... |
0705.0999 | Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and
Cooperative Base-Stations | cs.IT math.IT | In this paper the benefits provided by multi-cell processing of signals
transmitted by mobile terminals which are received via dedicated relay
terminals (RTs) are assessed. Unlike previous works, each RT is assumed here to
be capable of full-duplex operation and receives the transmission of adjacent
relay terminals. ... |
0705.1031 | Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs
with Missing Values | cs.AI | An ensemble based approach for dealing with missing data, without predicting
or imputing the missing values is proposed. This technique is suitable for
online operations of neural networks and as a result, is used for online
condition monitoring. The proposed technique is tested in both classification
and regression ... |
0705.1033 | Optimal Cache-Oblivious Mesh Layouts | cs.DS cs.CE cs.MS cs.NA | A mesh is a graph that divides physical space into regularly-shaped regions.
Meshes computations form the basis of many applications, e.g. finite-element
methods, image rendering, and collision detection. In one important mesh
primitive, called a mesh update, each mesh vertex stores a value and repeatedly
updates thi... |
0705.1036 | Strategies for the Design of a Slide-o-Cam Transmission | cs.RO | The optimization of the pressure angle in a cam-follower transmission is
reported in this paper. This transmission is based on Slide-o-Cam, a cam
mechanism with multiple rollers mounted on a common translating follower. The
design of Slide-o-Cam, a transmission intended to produce a sliding motion from
a turning driv... |
0705.1037 | Regions of Feasible Point-to-Point Trajectories in the Cartesian
Workspace of Fully-Parallel Manipulators | cs.RO | The goal of this paper is to define the n-connected regions in the Cartesian
workspace of fully-parallel manipulators, i.e. the maximal regions where it is
possible to execute point-to-point motions. The manipulators considered in this
study may have multiple direct and inverse kinematic solutions. The N-connected
re... |
0705.1038 | The Design of Parallel Kinematic Machine Tools Using Kinetostatic
Performance Criteria | cs.RO | Most industrial machine tools have a serial kinematic architecture, which
means that each axis has to carry the following one, including its actuators
and joints. High Speed Machining highlights some drawbacks of such
architectures: heavy moving parts require from the machine structure high
stiffness to limit bending... |
0705.1110 | Mining Patterns with a Balanced Interval | cs.AI cs.DB | In many applications it will be useful to know those patterns that occur with
a balanced interval, e.g., a certain combination of phone numbers are called
almost every Friday or a group of products are sold a lot on Tuesday and
Thursday.
In previous work we proposed a new measure of support (the number of
occurrenc... |
0705.1148 | S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et
Inverse pour les Manipulateurs Pleinement Parall\`eles | cs.RO | This article provides a formalism making it possible to manage the solutions
of the direct and inverse kinematic models of the fully parallel manipulators.
We introduce the concept of working modes to separate the solutions from the
opposite geometrical model. Then, we define, for each working mode, the aspects
of th... |
0705.1150 | On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators | cs.RO | Proposed in this paper is a kinetostatic performance index for the optimum
dimensioning of planar manipulators of the serial type. The index is based on
the concept of distance of the underlying Jacobian matrix to a given isotropic
matrix that is used as a reference model for purposes of performance
evaluation. Appli... |
0705.1151 | Achievable Rates and Optimal Resource Allocation for Imperfectly-Known
Fading Relay Channels | cs.IT math.IT | In this paper, achievable rates of imperfectly-known fading relay channels
are studied. It is assumed that communication starts with the network training
phase in which the receivers estimate the fading coefficients of their
respective channels. In the data transmission phase, amplify-and-forward and
decode-and-forwa... |
0705.1159 | Ordering Finite-State Markov Channels by Mutual Information | cs.IT math.IT | In previous work, an ordering result was given for the symbolwise probability
of error using general Markov channels, under iterative decoding of LDPC codes.
In this paper, the ordering result is extended to mutual information, under the
assumption of an iid input distribution. For certain channels, in which the
capa... |
0705.1161 | IDF revisited: A simple new derivation within the Robertson-Sp\"arck
Jones probabilistic model | cs.IR cs.CL | There have been a number of prior attempts to theoretically justify the
effectiveness of the inverse document frequency (IDF). Those that take as their
starting point Robertson and Sparck Jones's probabilistic model are based on
strong or complex assumptions. We show that a more intuitively plausible
assumption suffi... |
0705.1183 | Multiple Antenna Secure Broadcast over Wireless Networks | cs.IT math.IT | In wireless data networks, communication is particularly susceptible to
eavesdropping due to its broadcast nature. Security and privacy systems have
become critical for wireless providers and enterprise networks. This paper
considers the problem of secret communication over the Gaussian broadcast
channel, where a mul... |
0705.1187 | Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave
Behavior and Applications | cs.IT math.IT | Convexity/concavity properties of symbol error rates (SER) of the maximum
likelihood detector operating in the AWGN channel (non-fading and fading) are
studied. Generic conditions are identified under which the SER is a
convex/concave function of the SNR. Universal bounds for the SER 1st and 2nd
derivatives are obtai... |
0705.1209 | Artificial Intelligence for Conflict Management | cs.AI | Militarised conflict is one of the risks that have a significant impact on
society. Militarised Interstate Dispute (MID) is defined as an outcome of
interstate interactions, which result on either peace or conflict. Effective
prediction of the possibility of conflict between states is an important
decision support to... |
0705.1214 | Control of Complex Systems Using Bayesian Networks and Genetic Algorithm | cs.CE cs.NE | A method based on Bayesian neural networks and genetic algorithm is proposed
to control the fermentation process. The relationship between input and output
variables is modelled using Bayesian neural network that is trained using
hybrid Monte Carlo method. A feedback loop based on genetic algorithm is used
to change ... |
0705.1215 | Kinematic Calibration of the Orthoglide-Type Mechanisms | cs.RO | The paper proposes a novel calibration approach for the Orthoglide-type
mechanisms based on observations of the manipulator leg parallelism during
motions between the prespecified test postures. It employs a low-cost measuring
system composed of standard comparator indicators attached to the universal
magnetic stands... |
0705.1217 | The Design of a Novel Prismatic Drive for a Three-DOF
Parallel-Kinematics Machine | cs.RO | The design of a novel prismatic drive is reported in this paper. This
transmission is based on Slide-O-Cam, a cam mechanism with multiple rollers
mounted on a common translating follower. The design of Slide-O-Cam was
reported elsewhere. This drive thus provides pure-rolling motion, thereby
reducing the friction of r... |
0705.1218 | Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide | cs.RO | The paper proposes a novel approach for the geometrical model calibration of
quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is
based on the observations of the manipulator leg parallelism during motions
between the specific test postures and employs a low-cost measuring system
composed of ... |
0705.1227 | Rate Adaptation for Cognitive Radio under Interference from Primary
Spectrum User | cs.IT cs.NI math.IT | A cognitive radio can operate as a secondary system in a given spectrum. This
operation should use limited power in order not to disturb the communication by
primary spectrum user. Under such conditions, in this paper we investigate how
to maximize the spectral efficiency in the secondary system. A secondary
receiver... |
0705.1244 | Evolving Symbolic Controllers | cs.AI | The idea of symbolic controllers tries to bridge the gap between the top-down
manual design of the controller architecture, as advocated in Brooks'
subsumption architecture, and the bottom-up designer-free approach that is now
standard within the Evolutionary Robotics community. The designer provides a
set of element... |
0705.1271 | Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The
Orthoglide | cs.RO | The Orthoglide project aims at designing a new 3-axis machine tool for High
Speed Machining. Basis kinematics is a 3 degree-of-freedom translational
parallel mechanism. This basis was submitted to isotropic and manipulability
constraints that allowed the optmization of its kinematic architecture and legs
architecture... |
0705.1272 | The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators | cs.RO | The subject of this paper is a special class of parallel manipulators. First,
we analyze a family of three-degree-of-freedom manipulators. Two Jacobian
matrices appear in the kinematic relations between the joint-rate and the
Cartesian-velocity vectors, which are called the "inverse kinematics" and the
"direct kinema... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.