Search results for " protocol"
showing 10 items of 1320 documents
The pharmacological and non-pharmacological treatment of attention deficit hyperactivity disorder in children and adolescents: protocol for a systema…
2015
[Background] Attention deficit hyperactivity disorder (ADHD) is one of the most common neurodevelopmental disorders of children and adolescents, with a significant impact on health services and the community in terms of economic and social burdens. The objective of this systematic review will be to evaluate the comparative efficacy and safety of pharmacological and non-pharmacological treatments in children and adolescents with ADHD.
Codification schemes and finite automata
2000
This paper is a note on how Information Theory and Codification Theory are helpful in the computational design both of communication protocols and strategy sets in the framework of finitely repeated games played by boundedly rational agents. More precisely, we show the usefulness of both theories to improve the existing automata bounds of Neyman¿s (1998) work on finitely repeated games played by finite automata.
Refinements on IEEE 802.11 Distributed Coordination Function Modeling Approaches
2010
With the popularity of the IEEE 802.11 standards, many analytical saturation throughput studies for the distributed coordination function (DCF) have been reported. In this paper, we outline a number of issues and criticalities raised by previously proposed models. In particular, a careful look at backoff counter decrement rules allows us to conclude that, under saturation conditions, the slot immediately following a successful transmission can be accessed only by the station (STA) that has successfully transmitted in the previous channel access. Moreover, due to the specific acknowledgment (ACK) timeout setting adopted in the standard, the slot immediately following a collision cannot be ac…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
A new Media Access Control layer Quality of Service multicast scheme for IEEE 802.11s based wireless mesh networks
2014
Inderscience Publishers; International audience; We propose a new Media Access Control (MAC) layer enabling Quality of Service (QoS) multicast scheme for IEEE 802.11s networks, where a unicast routing protocol called HWMP (Hybrid Wireless Mesh Protocol) is defined. The HWMP protocol is more adapted for best effort traffic, that's why its usage is not suitable for real time multimedia applications. The goal of our proposed mechanism is to take into account multicast communication under QoS constraints for the IEEE 802.11s mesh networks where no QoS multicasting has been defined. Our multicasting scheme handles QoS guarantee for real time applications. Indeed, our scheme is based on finding t…
Computational Complexity and Communication: Coordination in Two-Player Games
2002
The main contribution of this paper is the development and application of cryptographic techniques to the design of strategic communication mechanisms. One of the main assumptions in cryptography is the limitation of the computational power available to agents. We introduce the concept of limited computational complexity, and by borrowing results from cryptography, we construct a communication protocol to establish that every correlated equilibrium of a two-person game with rational payoffs can be achieved by means of computationally restricted unmediated communication. This result provides an example in game theory where limitations of computational abilities of players are helpful in solv…
Lazy consensus for networks with unknown but bounded disturbances
2007
We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the isin-consensus problem, where the states are required to converge in a tube of ray isin asymptotically or in finite time.
PyDSC: a simple tool to treat differential scanning calorimetry data
2020
AbstractHerein, we describe an open-source, Python-based, script to treat the output of differential scanning calorimetry (DSC) experiments, called pyDSC, available free of charge for download at https://github.com/leonardo-chiappisi/pyDSC under a GNU General Public License v3.0. The main aim of this program is to provide the community with a simple program to analyze raw DSC data. Key features include the correction from spurious signals, and, most importantly, the baseline is computed with a robust, physically consistent approach. We also show that the baseline correction routine implemented in the script is significantly more reproducible than different standard ones proposed by propriet…
Out-of-Band Signaling Scheme for High Speed Wireless LANs
2007
In recent years, the physical layer data rate provided by 802.11 Wireless LANs has dramatically increased thanks to significant advances in the modulation and coding techniques employed. However, previous studies show that the 802.11 MAC operation, namely the distributed coordination function (DCF), represents a limiting factor: the throughput efficiency drops as the channel bit rate increases, and a throughput upper limit does indeed exist when the channel bit rate goes to infinite high. These findings indicate that the performance of the DCF protocol will not be efficiently improved by merely increasing the channel bit rate. This paper shows that the DCF performance may significantly bene…
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network
2009
International audience; We propose an efficient way of constructing the wireless mesh structure associated with Molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted Weakly Connected Dominating Set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation algorithm that maximizes the sum of radio link capacities in the molecular structure. Finally, we extend this protocol so that it can operate in a distributed way still providing the same guarantee. This distributed protocol is self-stabilizing thus robust to topology…