2,909 research outputs found

    Game Theory Models for the Verification of the Collective Behaviour of Autonomous Cars

    Get PDF
    The collective of autonomous cars is expected to generate almost optimal traffic. In this position paper we discuss the multi-agent models and the verification results of the collective behaviour of autonomous cars. We argue that non-cooperative autonomous adaptation cannot guarantee optimal behaviour. The conjecture is that intention aware adaptation with a constraint on simultaneous decision making has the potential to avoid unwanted behaviour. The online routing game model is expected to be the basis to formally prove this conjecture.Comment: In Proceedings FVAV 2017, arXiv:1709.0212

    Reliable and timely event notification for publish/subscribe services over the internet

    Get PDF
    The publish/subscribe paradigm is gaining attention for the development of several applications in wide area networks (WANs) due to its intrinsic time, space, and synchronization decoupling properties that meet the scalability and asynchrony requirements of those applications. However, while the communication in a WAN may be affected by the unpredictable behavior of the network, with messages that can be dropped or delayed, existing publish/subscribe solutions pay just a little attention to addressing these issues. On the contrary, applications such as business intelligence, critical infrastructures, and financial services require delivery guarantees with strict temporal deadlines. In this paper, we propose a framework that enforces both reliability and timeliness for publish/subscribe services over WAN. Specifically, we combine two different approaches: gossiping, to retrieve missing packets in case of incomplete information, and network coding, to reduce the number of retransmissions and, consequently, the latency. We provide an analytical model that describes the information recovery capabilities of our algorithm and a simulation-based study, taking into account a real workload from the Air Traffic Control domain, which evidences how the proposed solution is able to ensure reliable event notification over a WAN within a reasonable bounded time window. © 2013 IEEE

    Katakan tidak pada rasuah

    Get PDF
    Isu atau masalah rasuah menjadi topik utama sama ada di peringkat antarabangsa mahupun di peringkat dalam negara. Pertubuhan Bangsa- bangsa Bersatu menegaskan komitmen komuniti antarabangsa bertegas untuk mencegah dan mengawal rasuah melalui buku bertajuk United Nations Convention against Corruption. Hal yang sama berlaku di Malaysia. Melalui pernyataan visi oleh mantan Perdana Menteri Malaysia, Tun Dr. Mahathir bin Mohamed memberikan indikasi bahawa kerajaan Malaysia komited untuk mencapai aspirasi agar Malaysia dikenali kerana integriti dan bukannya rasuah. Justeru, tujuan penulisan bab ini adalah untuk membincangkan rasuah dari beberapa sudut termasuk perbincangan dari sudut agama Islam, faktor-faktor berlakunya gejala rasuah, dan usaha-usaha yang dijalankan di Malaysia untuk membanteras gejala rasuah. Perkara ini penting bagi mengenalpasti penjawat awam menanamkan keyakinan dalam melaksanakan tanggungjawab dengan menghindari diri daripada rasuah agar mereka sentiasa peka mengutamakan kepentingan awam

    Equational Reasonings in Wireless Network Gossip Protocols

    Get PDF
    Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip protocols expressed in a simple probabilistic timed process calculus for wireless sensor networks. We equip the calculus with a simulation theory to compare probabilistic protocols that have similar behaviour up to a certain tolerance. The theory is used to prove a number of algebraic laws which revealed to be very effective to estimate the performances of gossip networks, with and without communication collisions, and randomised gossip networks. Our simulation theory is an asymmetric variant of the weak bisimulation metric that maintains most of the properties of the original definition. However, our asymmetric version is particularly suitable to reason on protocols in which the systems under consideration are not approximately equivalent, as in the case of gossip protocols

    Optimal configuration of active and backup servers for augmented reality cooperative games

    Get PDF
    Interactive applications as online games and mobile devices have become more and more popular in recent years. From their combination, new and interesting cooperative services could be generated. For instance, gamers endowed with Augmented Reality (AR) visors connected as wireless nodes in an ad-hoc network, can interact with each other while immersed in the game. To enable this vision, we discuss here a hybrid architecture enabling game play in ad-hoc mode instead of the traditional client-server setting. In our architecture, one of the player nodes also acts as the server of the game, whereas other backup server nodes are ready to become active servers in case of disconnection of the network i.e. due to low energy level of the currently active server. This allows to have a longer gaming session before incurring in disconnections or energy exhaustion. In this context, the server election strategy with the aim of maximizing network lifetime is not so straightforward. To this end, we have hence analyzed this issue through a Mixed Integer Linear Programming (MILP) model and both numerical and simulation-based analysis shows that the backup servers solution fulfills its design objective
    • …
    corecore