id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0707.0978 | When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc
Network | cs.IT math.IT | We develop and analyze new cooperative strategies for ad hoc networks that
are more spectrally efficient than classical DF cooperative protocols. Using
analog network coding, our strategies preserve the practical half-duplex
assumption but relax the orthogonality constraint. The introduction of
interference due to no... |
0707.1008 | On Cognitive Interference Networks | cs.IT math.IT | We study the high-power asymptotic behavior of the sum-rate capacity of
multi-user interference networks with an equal number of transmitters and
receivers. We assume that each transmitter is cognizant of the message it
wishes to convey to its corresponding receiver and also of the messages that a
subset of the other... |
0707.1025 | The star trellis decoding of Reed-Solomon codes | cs.IT math.IT | The new method for Reed-Solomon codes decoding is introduced. The method is
based on the star trellis decoding of the binary image of Reed-Solomon codes.
|
0707.1063 | High-resolution distributed sampling of bandlimited fields with
low-precision sensors | cs.IT math.IT | The problem of sampling a discrete-time sequence of spatially bandlimited
fields with a bounded dynamic range, in a distributed,
communication-constrained, processing environment is addressed. A central unit,
having access to the data gathered by a dense network of fixed-precision
sensors, operating under stringent i... |
0707.1064 | The Effect of Noise Correlation in AF Relay Networks | cs.IT math.IT | In wireless relay networks, noise at the relays can be correlated possibly
due to common interference or noise propagation from preceding hops. In this
work we consider a parallel relay network with noise correlation. For the relay
strategy of amplify-and-forward (AF), we determine the optimal rate maximizing
relay g... |
0707.1083 | Delayed Correlations in Inter-Domain Network Traffic | cs.NI cs.IR | To observe the evolution of network traffic correlations we analyze the
eigenvalue spectra and eigenvectors statistics of delayed correlation matrices
of network traffic counts time series. Delayed correlation matrix D is composed
of the correlations between one variable in the multivariable time series and
another a... |
0707.1099 | Worst-Case Interactive Communication and Enhancing Sensor Network
Lifetime | cs.IT math.IT | We are concerned with the problem of maximizing the worst-case lifetime of a
data-gathering wireless sensor network consisting of a set of sensor nodes
directly communicating with a base-station.We propose to solve this problem by
modeling sensor node and base-station communication as the interactive
communication be... |
0707.1193 | Singular curves and cusp points in the joint space of 3-RPR parallel
manipulators | cs.RO | This paper investigates the singular curves in two-dimensional slices of the
joint space of a family of planar parallel manipulators. It focuses on special
points, referred to as cusp points, which may appear on these curves. Cusp
points play an important role in the kinematic behavior of parallel
manipulators since ... |
0707.1241 | Graph-Based Decoding in the Presence of ISI | cs.IT math.IT | We propose an approximation of maximum-likelihood detection in ISI channels
based on linear programming or message passing. We convert the detection
problem into a binary decoding problem, which can be easily combined with LDPC
decoding. We show that, for a certain class of channels and in the absence of
coding, the ... |
0707.1288 | Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la
visualisation | cs.DB | In decision-support systems, the visual component is important for On Line
Analysis Processing (OLAP). In this paper, we propose a new approach that faces
the visualization problem due to data sparsity. We use the results of a
Multiple Correspondence Analysis (MCA) to reduce the negative effect of
sparsity by organiz... |
0707.1295 | Efficient supervised learning in networks with binary synapses | q-bio.NC cond-mat.stat-mech cs.NE q-bio.QM | Recent experimental studies indicate that synaptic changes induced by
neuronal activity are discrete jumps between a small number of stable states.
Learning in systems with discrete synapses is known to be a computationally
hard problem. Here, we study a neurobiologically plausible on-line learning
algorithm that der... |
0707.1304 | Un index de jointure pour les entrep\^ots de donn\'ees XML | cs.DB | XML data warehouses form an interesting basis for decision-support
applications that exploit heterogeneous data from multiple sources. However,
XML-native database systems currently bear limited performances and it is
necessary to research ways to optimize them. In this paper, we propose a new
index that is specifica... |
0707.1306 | S\'election simultan\'ee d'index et de vues mat\'erialis\'ees | cs.DB | Indices and materialized views are physical structures that accelerate data
access in data warehouses. However, these data structures generate some
maintenance overhead. They also share the same storage space. The existing
studies about index and materialized view selection consider these structures
separately. In th... |
0707.1452 | Clusters, Graphs, and Networks for Analysing Internet-Web-Supported
Communication within a Virtual Community | cs.AI cs.LG | The proposal is to use clusters, graphs and networks as models in order to
analyse the Web structure. Clusters, graphs and networks provide knowledge
representation and organization. Clusters were generated by co-site analysis.
The sample is a set of academic Web sites from the countries belonging to the
European Uni... |
0707.1470 | Secrecy Capacity Region of Fading Broadcast Channels | cs.IT math.IT | The fading broadcast channel with confidential messages (BCC) is
investigated, where a source node has common information for two receivers
(receivers 1 and 2), and has confidential information intended only for
receiver 1. The confidential information needs to be kept as secret as possible
from receiver 2. The chann... |
0707.1534 | An Architecture Framework for Complex Data Warehouses | cs.DB | Nowadays, many decision support applications need to exploit data that are
not only numerical or symbolic, but also multimedia, multistructure,
multisource, multimodal, and/or multiversion. We term such data complex data.
Managing and analyzing complex data involves a lot of different issues
regarding their structure... |
0707.1548 | Data Mining-based Materialized View and Index Selection in Data
Warehouses | cs.DB | Materialized views and indexes are physical structures for accelerating data
access that are casually used in data warehouses. However, these data
structures generate some maintenance overhead. They also share the same storage
space. Most existing studies about materialized view and index selection
consider these str... |
0707.1558 | Autonomy with regard to an Attribute | cs.MA | This paper presents a model of autonomy called autonomy with regard to an
attribute applicable to cognitive and not cognitive artificial agents. Three
criteria (global / partial, social / nonsocial, absolute / relative) are
defined and used to describe the main characteristics of this type of autonomy.
A software age... |
0707.1588 | A Tight Lower Bound to the Outage Probability of Discrete-Input
Block-Fading Channels | cs.IT math.IT | In this correspondence, we propose a tight lower bound to the outage
probability of discrete-input Nakagami-m block-fading channels. The approach
permits an efficient method for numerical evaluation of the bound, providing an
additional tool for system design. The optimal rate-diversity trade-off for the
Nakagami-m b... |
0707.1644 | Fast and Simple Relational Processing of Uncertain Data | cs.DB cs.PF | This paper introduces U-relations, a succinct and purely relational
representation system for uncertain databases. U-relations support
attribute-level uncertainty using vertical partitioning. If we consider
positive relational algebra extended by an operation for computing possible
answers, a query on the logical lev... |
0707.1739 | On slow-fading non-separable correlation MIMO systems | cs.IT math.IT | In a frequency selective slow-fading channel in a MIMO system, the channel
matrix is of the form of a block matrix. We propose a method to calculate the
limit of the eigenvalue distribution of block matrices if the size of the
blocks tends to infinity. We will also calculate the asymptotic eigenvalue
distribution of ... |
0707.1824 | The Kinematics of Manipulators Built From Closed Planar Mechanisms | cs.RO | The paper discusses the kinematics of manipulators builts of planar closed
kinematic chains. A special kinematic scheme is extracted from the array of
these mechanisms that looks the most promising for the creation of different
types of robotic manipulators. The structural features of this manipulator
determine a num... |
0707.1859 | On the Degrees of Freedom in Cognitive Radio Channels | cs.IT math.IT | After receiving useful peer comments, we would like to withdraw this paper.
|
0707.1912 | Throughput Scaling Laws for Wireless Networks with Fading Channels | cs.IT math.IT | A network of n communication links, operating over a shared wireless channel,
is considered. Fading is assumed to be the dominant factor affecting the
strength of the channels between transmitter and receiver terminals. It is
assumed that each link can be active and transmit with a constant power P or
remain silent. ... |
0707.1913 | Removing Manually-Generated Boilerplate from Electronic Texts:
Experiments with Project Gutenberg e-Books | cs.DL cs.CL | Collaborative work on unstructured or semi-structured documents, such as in
literature corpora or source code, often involves agreed upon templates
containing metadata. These templates are not consistent across users and over
time. Rule-based parsing of these templates is expensive to maintain and tends
to fail as ne... |
0707.1957 | Moveability and Collision Analysis for Fully-Parallel Manipulators | cs.RO | The aim of this paper is to characterize the moveability of fully-parallel
manipulators in the presence of obstacles. Fully parallel manipulators are used
in applications where accuracy, stiffness or high speeds and accelerations are
required \cite{Merlet:97}. However, one of its main drawbacks is a relatively
small ... |
0707.2006 | Working Modes and Aspects in Fully-Parallel Manipulator | cs.RO | The aim of this paper is to characterize the notion of aspect in the
workspace and in the joint space for parallel manipulators. In opposite to the
serial manipulators, the parallel manipulators can admit not only multiple
inverse kinematic solutions, but also multiple direct kinematic solutions. The
notion of aspect... |
0707.2014 | On the error exponent of variable-length block-coding schemes over
finite-state Markov channels with feedback | cs.IT math.IT | The error exponent of Markov channels with feedback is studied in the
variable-length block-coding setting. Burnashev's classic result is extended
and a single letter characterization for the reliability function of
finite-state Markov channels is presented, under the assumption that the
channel state is causally obs... |
0707.2017 | The Isoconditioning Loci of A Class of Closed-Chain Manipulators | cs.RO | The subject of this paper is a special class of closed-chain manipulators.
First, we analyze a family of two-degree-of-freedom (dof) five-bar planar
linkages. Two Jacobian matrices appear in the kinematic relations between the
joint-rate and the Cartesian-velocity vectors, which are called the ``inverse
kinematics" a... |
0707.2027 | Workspace and Assembly modes in Fully-Parallel Manipulators : A
Descriptive Study | cs.RO | The goal of this paper is to explain, using a typical example, the
distribution of the different assembly modes in the workspace and their
effective role in the execution of trajectories. The singular and non-singular
changes of assembly mode are described and compared to each other. The
non-singular change of assemb... |
0707.2034 | Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a
L'Usinage | cs.RO | The aim of this paper is the isotropic design of a hybrid morphology
dedicated to 3-axis machining applications. It is necessary to ensure the
feasibility of continuous, singularity-free trajectories, as well as a good
manipulability in position and velocity. We want to propose an alternative
design to conventional s... |
0707.2042 | A distributed Approach for Access and Visibility Task under Ergonomic
Constraints with a Manikin in a Virtual Reality Environment | cs.RO | This paper presents a new method, based on a multi-agent system and on
digital mock-up technology, to assess an efficient path planner for a manikin
for access and visibility task under ergonomic constraints. In order to solve
this problem, the human operator is integrated in the process optimization to
contribute to... |
0707.2090 | A Training based Distributed Non-Coherent Space-Time Coding Strategy | cs.IT math.IT | Unitary space-time modulation is known to be an efficient means to
communicate over non-coherent Multiple Input Multiple Output (MIMO) channels.
In this letter, differential unitary space-time coding and non-coherent
space-time coding for the training based approach of Kim and Tarokh are
addressed. For this approach,... |
0707.2176 | Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO
Channels with Partial CSI | cs.IT math.IT | This paper re-examines the well-known fundamental tradeoffs between rate and
reliability for the multi-antenna, block Rayleigh fading channel in the high
signal to noise ratio (SNR) regime when (i) the transmitter has access to
(noiseless) one bit per coherence-interval of causal channel state information
(CSI) and (... |
0707.2185 | Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide | cs.RO | In this article, we propose a method for calculation of the inverse and
direct dynamic models of the Orthoglide, a parallel robot with threedegrees of
freedom in translation. These models are calculated starting from the elements
of the dynamic model of the kinematic chain structure and equations of
Newton-Euler appl... |
0707.2191 | Word statistics in Blogs and RSS feeds: Towards empirical universal
evidence | cs.IT math.IT | We focus on the statistics of word occurrences and of the waiting times
between such occurrences in Blogs. Due to the heterogeneity of words'
frequencies, the empirical analysis is performed by studying classes of
"frequently-equivalent" words, i.e. by grouping words depending on their
frequencies. Two limiting cases... |
0707.2227 | Degeneracy study of the forward kinematics of planar 3-RPR parallel
manipulators | cs.RO | This paper investigates two situations in which the forward kinematics of
planar 3-RPR parallel manipulators degenerates. These situations have not been
addressed before. The first degeneracy arises when the three input joint
variables r1, r2 and r3 satisfy a certain relationship. This degeneracy yields
a double root... |
0707.2228 | Kinematic Analysis of a Family of 3R Manipulators | cs.RO | The workspace topologies of a family of 3-revolute (3R) positioning
manipulators are enumerated. The workspace is characterized in a half-cross
section by the singular curves. The workspace topology is defined by the number
of cusps that appear on these singular curves. The design parameters space is
shown to be divi... |
0707.2229 | The Computation of All 4R Serial Spherical Wrists With an Isotropic
Architecture | cs.RO | A spherical wrist of the serial type with n revolute (R) joints is said to be
isotropic if it can attain a posture whereby the singular values of its
Jacobian matrix are all equal to sqrt(n/3). What isotropy brings about is
robustness to manufacturing, assembly, and measurement errors, thereby
guaranteeing a maximum ... |
0707.2238 | A design oriented study for 3R Orthogonal Manipulators With Geometric
Simplifications | cs.RO | This paper proposes a method to calculate the largest Regular Dextrous
Workspace (RDW) of some types of three-revolute orthogonal manipulators that
have at least one of their DH parameters equal to zero. Then a new performance
index based on the RDW is introduced, the isocontours of this index are plotted
in the para... |
0707.2265 | Separable convex optimization problems with linear ascending constraints | cs.IT math.IT math.OC | Separable convex optimization problems with linear ascending inequality and
equality constraints are addressed in this paper. Under an ordering condition
on the slopes of the functions at the origin, an algorithm that determines the
optimum point in a finite number of steps is described. The optimum value is
shown to... |
0707.2270 | Design of a Spherical Wrist with Parallel Architecture: Application to
Vertebrae of an Eel Robot | cs.RO | The design of a spherical wrist with parallel architecture is the object of
this article. This study is part of a larger project, which aims to design and
to build an eel robot for inspection of immersed piping. The kinematic analysis
of the mechanism is presented first to characterize the singular configurations
as ... |
0707.2275 | Passive Control Architecture for Virtual Humans | cs.RO | In the present paper, we introduce a new control architecture aimed at
driving virtual humans in interaction with virtual environments, by motion
capture. It brings decoupling of functionalities, and also of stability thanks
to passivity. We show projections can break passivity, and thus must be used
carefully. Our c... |
0707.2376 | Tripartitions do not always discriminate phylogenetic networks | q-bio.PE cs.CE cs.DM | Phylogenetic networks are a generalization of phylogenetic trees that allow
for the representation of non-treelike evolutionary events, like recombination,
hybridization, or lateral gene transfer. In a recent series of papers devoted
to the study of reconstructibility of phylogenetic networks, Moret, Nakhleh,
Warnow ... |
0707.2432 | Pricing Asian Options for Jump Diffusions | cs.CE | We construct a sequence of functions that uniformly converge (on compact
sets) to the price of Asian option, which is written on a stock whose dynamics
follows a jump diffusion, exponentially fast. Each of the element in this
sequence solves a parabolic partial differen- tial equation (not an
integro-differential equ... |
0707.2482 | Multiple-Description Lattice Vector Quantization | cs.IT math.IT | In this thesis, we construct and analyze multiple-description codes based on
lattice vector quantization.
|
0707.2506 | Mixed Integer Linear Programming For Exact Finite-Horizon Planning In
Decentralized Pomdps | cs.AI | We consider the problem of finding an n-agent joint-policy for the optimal
finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem
of very high complexity (NEXP-hard in n >= 2). In this paper, we propose a new
mathematical programming approach for the problem. Our approach is based on two
ideas... |
0707.2527 | Rate and Power Allocation for Discrete-Rate Link Adaptation | cs.IT math.IT | Link adaptation, in particular adaptive coded modulation (ACM), is a
promising tool for bandwidth-efficient transmission in a fading environment.
The main motivation behind employing ACM schemes is to improve the spectral
efficiency of wireless communication systems. In this paper, using a finite
number of capacity a... |
0707.2718 | Animation of virtual mannequins, robot-like simulation or motion
captures | cs.RO | In order to optimize the costs and time of design of the new products while
improving their quality, concurrent engineering is based on the digital model
of these products, the numerical model. However, in order to be able to avoid
definitively physical model, old support of the design, without loss of
information, n... |
0707.2721 | A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic
Feedback | cs.RO | The kinematic properties of mechanisms are well known by the researchers and
teachers. The theory based on the study of Jacobian matrices allows us to
explain, for example, the singular configuration. However, in many cases, the
physical sense of such properties is difficult to explain to students. The aim
of this ar... |
0707.2780 | On the ergodic sum-rate performance of CDD in multi-user systems | cs.IT math.IT | The main focus of space-time coding design and analysis for MIMO systems has
been so far focused on single-user systems. For single-user systems, transmit
diversity schemes suffer a loss in spectral efficiency if the receiver is
equipped with more than one antenna, making them unsuitable for high rate
transmission. O... |
0707.2792 | Distributed Compression and Multiparty Squashed Entanglement | quant-ph cs.IT math.IT | We study a protocol in which many parties use quantum communication to
transfer a shared state to a receiver without communicating with each other.
This protocol is a multiparty version of the fully quantum Slepian-Wolf
protocol for two senders and arises through the repeated application of the
two-sender protocol. W... |
0707.2833 | A Comparative Study between Two Three-DOF Parallel Kinematic Machines
using Kinetostatic Criteria and Interval Analysis | cs.RO | This paper addresses the workspace analysis of two 3-DOF translational
parallel mechanisms designed for machining applications. The two machines
features three fixed linear joints. The joint axes of the first machine are
orthogonal whereas these of the second are parallel. In both cases, the mobile
platform moves in ... |
0707.2836 | Multimedia Capacity Analysis of the IEEE 802.11e Contention-based
Infrastructure Basic Service Set | cs.IT cs.MM math.IT | We first propose a simple mathematical analysis framework for the Enhanced
Distributed Channel Access (EDCA) function of the recently ratified IEEE
802.11e standard. Our analysis considers the fact that the distributed random
access systems exhibit cyclic behavior. The proposed model is valid for
arbitrary assignment... |
0707.2841 | The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and
Future Trends | cs.RO | The research area "Virtual Manufacturing (VM)'' is the use of information
technology and computer simulation to model real world manufacturing processes
for the purpose of analysing and understanding them. As automation technologies
such as CAD/CAM have substantially shortened the time required to design
products, Vi... |
0707.2842 | A Classification of 3R Orthogonal Manipulators by the Topology of their
Workspace | cs.RO | A classification of a family of 3-revolute (3R) positining manipulators is
established. This classification is based on the topology of their workspace.
The workspace is characterized in a half-cross section by the singular curves.
The workspace topology is defined by the number of cusps and nodes that appear
on thes... |
0707.2926 | Robust Hypothesis Testing with a Relative Entropy Tolerance | cs.IT math.IT | This paper considers the design of a minimax test for two hypotheses where
the actual probability densities of the observations are located in
neighborhoods obtained by placing a bound on the relative entropy between
actual and nominal densities. The minimax problem admits a saddle point which
is characterized. The r... |
0707.2998 | Building a Cooperative Communications System | cs.IT math.IT | In this paper, we present the results from over-the-air experiments of a
complete implementation of an amplify and forward cooperative communications
system. Our custom OFDM-based physical layer uses a distributed version of the
Alamouti block code, where the relay sends one branch of Alamouti encoded
symbols. First ... |
0707.3030 | Optimal Design of Ad Hoc Injection Networks by Using Genetic Algorithms | cs.NE cs.AI cs.NI | This work aims at optimizing injection networks, which consist in adding a
set of long-range links (called bypass links) in mobile multi-hop ad hoc
networks so as to improve connectivity and overcome network partitioning. To
this end, we rely on small-world network properties, that comprise a high
clustering coeffici... |
0707.3043 | p-Adic Modelling of the Genome and the Genetic Code | q-bio.OT cs.IT math.IT physics.bio-ph | The present paper is devoted to foundations of p-adic modelling in genomics.
Considering nucleotides, codons, DNA and RNA sequences, amino acids, and
proteins as information systems, we have formulated the corresponding p-adic
formalisms for their investigations. Each of these systems has its
characteristic prime num... |
0707.3087 | Universal Reinforcement Learning | cs.IT cs.LG math.IT | We consider an agent interacting with an unmodeled environment. At each time,
the agent makes an observation, takes an action, and incurs a cost. Its actions
can influence future observations and costs. The goal is to minimize the
long-term average cost. We propose a novel algorithm, known as the active LZ
algorithm,... |
0707.3095 | Channel Capacity Estimation using Free Probability Theory | cs.IT math.IT | In many channel measurement applications, one needs to estimate some
characteristics of the channels based on a limited set of measurements. This is
mainly due to the highly time varying characteristics of the channel. In this
contribution, it will be shown how free probability can be used for channel
capacity estima... |
0707.3175 | Stacked OSTBC: Error Performance and Rate Analysis | cs.IT math.IT | It is well known, that the Alamouti scheme is the only space-time code from
orthogonal design achieving the capacity of a multiple-input multiple-output
(MIMO) wireless communication system with n_T=2 transmit antennas and n_R=1
receive antenna. In this work, we propose the n-times stacked Alamouti scheme
for n_T=2n ... |
0707.3186 | Kinematic and stiffness analysis of the Orthoglide, a PKM with simple,
regular workspace and homogeneous performances | cs.RO | The Orthoglide is a Delta-type PKM dedicated to 3-axis rapid machining
applications that was originally developed at IRCCyN in 2000-2001 to meet the
advantages of both serial 3-axis machines (regular workspace and homogeneous
performances) and parallel kinematic architectures (good dynamic performances
and stiffness)... |
0707.3205 | Neutrality and Many-Valued Logics | cs.LO cs.AI | In this book, we consider various many-valued logics: standard, linear,
hyperbolic, parabolic, non-Archimedean, p-adic, interval, neutrosophic, etc. We
survey also results which show the tree different proof-theoretic frameworks
for many-valued logics, e.g. frameworks of the following deductive calculi:
Hilbert's sty... |
0707.3248 | Decentralized sequential change detection using physical layer fusion | cs.IT math.IT | The problem of decentralized sequential detection with conditionally
independent observations is studied. The sensors form a star topology with a
central node called fusion center as the hub. The sensors make noisy
observations of a parameter that changes from an initial state to a final state
at a random time where ... |
0707.3263 | Autonomous tools for Grid management, monitoring and optimization | cs.DC cs.CE hep-ex | We outline design and lines of development of autonomous tools for the
computing Grid management, monitoring and optimization. The management is
proposed to be based on the notion of utility. Grid optimization is considered
to be application-oriented. A generic Grid simulator is proposed as an
optimization tool for G... |
0707.3269 | International Standard for a Linguistic Annotation Framework | cs.CL | This paper describes the Linguistic Annotation Framework under development
within ISO TC37 SC4 WG1. The Linguistic Annotation Framework is intended to
serve as a basis for harmonizing existing language resources as well as
developing new ones.
|
0707.3270 | A Formal Model of Dictionary Structure and Content | cs.CL | We show that a general model of lexical information conforms to an abstract
model that reflects the hierarchy of information found in a typical dictionary
entry. We show that this model can be mapped into a well-formed XML document,
and how the XSL transformation language can be used to implement a semantics
defined ... |
0707.3336 | Statistical mechanical analysis of the linear vector channel in digital
communication | cs.IT cond-mat.dis-nn cond-mat.stat-mech math.IT | A statistical mechanical framework to analyze linear vector channel models in
digital wireless communication is proposed for a large system. The framework is
a generalization of that proposed for code-division multiple-access systems in
Europhys. Lett. 76 (2006) 1193 and enables the analysis of the system in which
th... |
0707.3390 | Consistency of the group Lasso and multiple kernel learning | cs.LG | We consider the least-square regression problem with regularization by a
block 1-norm, i.e., a sum of Euclidean norms over spaces of dimensions larger
than one. This problem, referred to as the group Lasso, extends the usual
regularization by the 1-norm where all spaces have dimension one, where it is
commonly referr... |
0707.3409 | Faster exon assembly by sparse spliced alignment | cs.DS cs.CC cs.CE q-bio.QM | Assembling a gene from candidate exons is an important problem in
computational biology. Among the most successful approaches to this problem is
\emph{spliced alignment}, proposed by Gelfand et al., which scores different
candidate exon chains within a DNA sequence of length $m$ by comparing them to
a known related g... |
0707.3457 | A Generalized Information Formula as the Bridge between Shannon and
Popper | cs.IT cs.AI math.IT | A generalized information formula related to logical probability and fuzzy
set is deduced from the classical information formula. The new information
measure accords with to Popper's criterion for knowledge evolution very much.
In comparison with square error criterion, the information criterion does not
only reflect... |
0707.3461 | Lattices for Distributed Source Coding: Jointly Gaussian Sources and
Reconstruction of a Linear Function | cs.IT math.IT | Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders
observe the two components and communicate compressed versions of their
observations to a common decoder. The decoder is interested in reconstructing a
linear combination of X1 and X2 to within a mean-square distortion of D. We
obtain an in... |
0707.3479 | Quantum Algorithms for Learning and Testing Juntas | quant-ph cs.LG | In this article we develop quantum algorithms for learning and testing
juntas, i.e. Boolean functions which depend only on an unknown set of k out of
n input variables. Our aim is to develop efficient algorithms:
- whose sample complexity has no dependence on n, the dimension of the domain
the Boolean functions are... |
0707.3482 | A Bayesian Framework for Combining Valuation Estimates | q-fin.ST cs.CE nlin.AO nlin.CD nlin.SI physics.pop-ph physics.soc-ph stat.AP | Obtaining more accurate equity value estimates is the starting point for
stock selection, value-based indexing in a noisy market, and beating benchmark
indices through tactical style rotation. Unfortunately, discounted cash flow,
method of comparables, and fundamental analysis typically yield discrepant
valuation est... |
0707.3507 | Workspace and Kinematic Analysis of the VERNE machine | cs.RO | This paper describes the workspace and the inverse and direct kinematic
analysis of the VERNE machine, a serial/parallel 5-axis machine tool designed
by Fatronik for IRCCyN. This machine is composed of a three-degree-of-freedom
(DOF) parallel module and a two-DOF serial tilting table. The parallel module
consists of ... |
0707.3509 | Upper bound of loss probability in an OFDMA system with randomly located
users | math.PR cs.IT cs.NI math.IT | For OFDMA systems, we find a rough but easily computed upper bound for the
probability of loosing communications by insufficient number of sub-channels on
downlink. We consider as random the positions of receiving users in the system
as well as the number of sub-channels dedicated to each one. We use recent
results o... |
0707.3531 | e-Science initiatives in Venezuela | cs.CE cs.DC | Within the context of the nascent e-Science infrastructure in Venezuela, we
describe several web-based scientific applications developed at the Centro
Nacional de Calculo Cientifico Universidad de Los Andes (CeCalCULA), Merida,
and at the Instituto Venezolano de Investigaciones Cientificas (IVIC), Caracas.
The differ... |
0707.3534 | The Kinetostatic 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... |
0707.3550 | A Six Degree-Of-Freedom Haptic Device Based On The Orthoglide And A
Hybrid Agile Eye | cs.RO | This paper is devoted to the kinematic design of a new six degree-of-freedom
haptic device using two parallel mechanisms. The first one, called orthoglide,
provides the translation motions and the second one, called agile eye, produces
the rotational motions. These two motions are decoupled to simplify the direct
and... |
0707.3552 | Analyse Comparative des Manipulateurs 3R \`a Axes Orthogonaux | cs.RO | A family of 3R orthogonal manipulators without offset on the third body can
be divided into exactly nine workspace topologies. The workspace is
characterized in a half-cross section by the singular curves. The workspace
topology is defined by the number of cusps and nodes that appear on these
singular curves. Based o... |
0707.3553 | An Exhaustive Study of the Workspace Topologies of all 3R Orthogonal
Manipulators with Geometric Simplifications | cs.RO | This paper analyses the workspace of the three-revolute orthogonal
manipulators that have at least one of their DH parameters equal to zero. These
manipulators are classified into different groups with similar kinematic
properties. The classification criteria are based on the topology of the
workspace. Each group is ... |
0707.3559 | Practical Approach to Knowledge-based Question Answering with Natural
Language Understanding and Advanced Reasoning | cs.CL cs.AI cs.HC cs.IR | This research hypothesized that a practical approach in the form of a
solution framework known as Natural Language Understanding and Reasoning for
Intelligence (NaLURI), which combines full-discourse natural language
understanding, powerful representation formalism capable of exploiting
ontological information and re... |
0707.3560 | Integration of a Balanced Virtual Manikin in a Virtual Reality Platform
aimed at Virtual Prototyping | cs.RO | The work presented here is aimed at introducing a virtual human controller in
a virtual prototyping framework. After a brief introduction describing the
problem solved in the paper, we describe the interest as for digital humans in
the context of concurrent engineering. This leads us to draw a control
architecture en... |
0707.3562 | Balanced Virtual Humans Interacting with their Environment | cs.RO | The animation of human avatars seems very successful; the computer graphics
industry shows outstanding results in films everyday, the game industry
achieves exploits... Nevertheless, the animation and control processes of such
manikins are very painful. It takes days to a specialist to build such animated
sequences, ... |
0707.3563 | Virtual reality: A human centered tool for improving Manufacturing | cs.RO | Manufacturing is using Virtual Reality tools to enhance the product life
cycle. Their definitions are still in flux and it is necessary to define their
connections. Thus, firstly, we will introduce more closely some definitions
where we will find that, if the Virtual manufacturing concepts originate from
machining op... |
0707.3564 | A New Six Degree-of-Freedom Haptic Device based on the Orthoglide and
the Agile Eye | cs.RO | The aim of this paper is to present a new six degree-of-freedom (dof) haptic
device using two parallel mechanisms. The first one, called orthoglide,
provides the translation motions and the second one produces the rotational
motions. These two motions are decoupled to simplify the direct and inverse
kinematics, as it... |
0707.3574 | L'orthoglide : une machine-outil rapide d'architecture parall\`ele
isotrope | cs.RO | This article presents the Orthoglide project. The purpose of this project is
the realization of a prototype of machine tool to three degrees of translation.
The characteristic of this machine is a parallel kinematic architecture
optimized to obtain a compact workspace with homogeneous performance. For that,
the princ... |
0707.3575 | An exploratory study of Google Scholar | cs.DL cs.IR | The paper discusses and analyzes the scientific search service Google Scholar
(GS). The focus is on an exploratory study which investigates the coverage of
scientific serials in GS. The study shows deficiencies in the coverage and
up-to-dateness of the GS index. Furthermore, the study points up which Web
servers are ... |
0707.3584 | The effect of fading, channel inversion, and threshold scheduling on ad
hoc networks | cs.IT math.IT | This paper addresses three issues in the field of ad hoc network capacity:
the impact of i)channel fading, ii) channel inversion power control, and iii)
threshold-based scheduling on capacity. Channel inversion and threshold
scheduling may be viewed as simple ways to exploit channel state information
(CSI) without re... |
0707.3665 | A Comparative Study of Parallel Kinematic Architectures for Machining
Applications | cs.RO | Parallel kinematic mechanisms are interesting alternative designs for
machining applications. Three 2-DOF parallel mechanism architectures dedicated
to machining applications are studied in this paper. The three mechanisms have
two constant length struts gliding along fixed linear actuated joints with
different relat... |
0707.3666 | Kinematic Analysis of a New Parallel Machine Tool: the Orthoglide | cs.RO | This paper describes a new parallel kinematic architecture for machining
applications: 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
orthoglide is t... |
0707.3673 | The Computation of All 4R Serial Spherical Wrists With an Isotropic
Architecture | cs.RO | A spherical wrist of the serial type is said to be isotropic if it can attain
a posture whereby the singular values of its Jacobian matrix are all identical
and nonzero. What isotropy brings about is robustness to manufacturing,
assembly, and measurement errors, thereby guaranteeing a maximum orientation
accuracy. In... |
0707.3781 | Bijective Faithful Translations among Default Logics | cs.AI cs.LO | In this article, we study translations between variants of defaults logics
such that the extensions of the theories that are the input and the output of
the translation are in a bijective correspondence. We assume that a translation
can introduce new variables and that the result of translating a theory can
either be... |
0707.3878 | Plotkin construction: rank and kernel | cs.IT math.IT | Given two binary codes of length n, using Plotkin construction we obtain a
code of length 2n. The construction works for linear and nonlinear codes. For
the linear case, it is straightforward to see that the dimension of the final
code is the sum of the dimensions of the starting codes. For nonlinear codes,
the rank ... |
0707.3925 | Use of a $d$-Constraint During LDPC Decoding in a Bliss Scheme | cs.IT math.IT | Bliss schemes of a run length limited (RLL) codec in combination with an LDPC
codec, generate LDPC parity bits over a systematic sequence of RLL channel bits
that are inherently redundant as they satisfy e.g. a $d=1$ minimum run length
constraint. That is the subsequences consisting of runs of length $d=1$, viz.
$...... |
0707.3959 | Four-Group Decodable Space-Time Block Codes | cs.IT math.IT | Two new rate-one full-diversity space-time block codes (STBC) are proposed.
They are characterized by the \emph{lowest decoding complexity} among the known
rate-one STBC, arising due to the complete separability of the transmitted
symbols into four groups for maximum likelihood detection. The first and the
second cod... |
0707.3972 | Learning Probabilistic Models of Word Sense Disambiguation | cs.CL cs.AI | This dissertation presents several new methods of supervised and unsupervised
learning of word sense disambiguation models. The supervised methods focus on
performing model searches through a space of probabilistic models, and the
unsupervised methods rely on the use of Gibbs Sampling and the Expectation
Maximization... |
0707.3979 | Clifford Algebra of the Vector Space of Conics for decision boundary
Hyperplanes in m-Euclidean Space | cs.NE cs.CG | In this paper we embed $m$-dimensional Euclidean space in the geometric
algebra $Cl_m $ to extend the operators of incidence in ${R^m}$ to operators of
incidence in the geometric algebra to generalize the notion of separator to a
decision boundary hyperconic in the Clifford algebra of hyperconic sections
denoted as $... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.