3,053 research outputs found
Cooperative inter-vehicle communication protocol with low cost differential GPS
This paper describes a cooperative MANET protocol dedicated to intelligent transport systems, named CIVIC (Communication Inter Véhicule Intelligente et Coopérative). The CIVIC protocol is an auto-configuration inter-vehicle communication protocol, which supports adhoc and infrastructure networks, contains reactive and proactive routing components, and adapts different wireless standards. It is a context-aware protocol reacting to vehicle status, road traffic, and geographic environment. It supports location-based communication. To improve the accuracy of GPS, it integrates a localization solution called LCD-GPS (Low Cost Differential GPS). It has been implemented and experimented on the LiveNode sensor developed by our lab. At the end of this paper, an application project MobiPlus is introduced
Multiplex PI-Control for Consensus in Networks of Heterogeneous Linear Agents
In this paper, we propose a multiplex proportional-integral approach, for
solving consensus problems in networks of heterogeneous nodes dynamics affected
by constant disturbances. The proportional and integral actions are deployed on
two different layers across the network, each with its own topology. Sufficient
conditions for convergence are derived that depend upon the structure of the
network, the parameters characterizing the control layers and the node
dynamics. The effectiveness of the theoretical results is illustrated using a
power network model as a representative example.Comment: 13 pages, 6 Figures, Preprint submitted to Automatic
Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications
We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches
Calculating Three Loop Ladder and V-Topologies for Massive Operator Matrix Elements by Computer Algebra
Three loop ladder and -topology diagrams contributing to the massive
operator matrix element are calculated. The corresponding objects can
all be expressed in terms of nested sums and recurrences depending on the
Mellin variable and the dimensional parameter . Given these
representations, the desired Laurent series expansions in can be
obtained with the help of our computer algebra toolbox. Here we rely on
generalized hypergeometric functions and Mellin-Barnes representations, on
difference ring algorithms for symbolic summation, on an optimized version of
the multivariate Almkvist-Zeilberger algorithm for symbolic integration, and on
new methods to calculate Laurent series solutions of coupled systems of
differential equations. The solutions can be computed for general coefficient
matrices directly for any basis also performing the expansion in the
dimensional parameter in case it is expressible in terms of indefinite nested
product-sum expressions. This structural result is based on new results of our
difference ring theory. In the cases discussed we deal with iterative sum- and
integral-solutions over general alphabets. The final results are expressed in
terms of special sums, forming quasi-shuffle algebras, such as nested harmonic
sums, generalized harmonic sums, and nested binomially weighted (cyclotomic)
sums. Analytic continuations to complex values of are possible through the
recursion relations obeyed by these quantities and their analytic asymptotic
expansions. The latter lead to a host of new constants beyond the multiple zeta
values, the infinite generalized harmonic and cyclotomic sums in the case of
-topologies.Comment: 110 pages Latex, 4 Figure
Lewis meets Brouwer: constructive strict implication
C. I. Lewis invented modern modal logic as a theory of "strict implication".
Over the classical propositional calculus one can as well work with the unary
box connective. Intuitionistically, however, the strict implication has greater
expressive power than the box and allows to make distinctions invisible in the
ordinary syntax. In particular, the logic determined by the most popular
semantics of intuitionistic K becomes a proper extension of the minimal normal
logic of the binary connective. Even an extension of this minimal logic with
the "strength" axiom, classically near-trivial, preserves the distinction
between the binary and the unary setting. In fact, this distinction and the
strong constructive strict implication itself has been also discovered by the
functional programming community in their study of "arrows" as contrasted with
"idioms". Our particular focus is on arithmetical interpretations of the
intuitionistic strict implication in terms of preservativity in extensions of
Heyting's Arithmetic.Comment: Our invited contribution to the collection "L.E.J. Brouwer, 50 years
later
Combining Spatial and Temporal Logics: Expressiveness vs. Complexity
In this paper, we construct and investigate a hierarchy of spatio-temporal
formalisms that result from various combinations of propositional spatial and
temporal logics such as the propositional temporal logic PTL, the spatial
logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a
clear picture of the trade-off between expressiveness and computational
realisability within the hierarchy. We demonstrate how different combining
principles as well as spatial and temporal primitives can produce NP-, PSPACE-,
EXPSPACE-, 2EXPSPACE-complete, and even undecidable spatio-temporal logics out
of components that are at most NP- or PSPACE-complete
- âŠ