IEEE papers 2017-2018 clustering in wsn
abdelhakim2016.pdf |
bahbahani2017.pdf |
cenedese2016.pdf |
distributed_k-means_algorithm_and_fuzzy_c-means.pdf |
improved_clustering_algorithm_based_on.pdf |
|
|
The Design and Implementation of FFTW3.pdf |
Effects of Data Center Vibration on Compute System Performance.pdf |
31i9-design-and-implementation.pdf |
HIGH-PERFORMANCE ALGORITHMS AND APPLICATIONS FOR SMP CLUSTERS.pdf |
The MicroGrid: a Scientific Tool for Modeling Computational Grids.pdf |
gridMonSteer: Generic Architecture for Monitoring and Steering Legacy Applications in Grid Environments.pdf |
Evaluation of Cache-based Superscalar and Cacheless Vector Architectures for Scientific Computations.pdf |
ipdps07.pdf |
Achieving Maximum Throughput and Service Differentiation by Enhancing the IEEE 802.11 MAC Protocol.pdf |
Achieving Maximum Throughput and Service
Differentiation by Enhancing the IEEE 802.11 MAC
Protocol
Abstract.
To satisfy various needs and priorities of different users and
applications, Wireless LANs are currently evolving to support service differentiation. Work is in progress to define a standard enhanced version of the IEEE 802.11 Distributed Coordination Function (DCF), capable of supporting QoS for multimedia traffic at the MAC layer. This paper focuses onto one of the building blocks of this enhancement, i.e., differentiating the minimum
contention window size according to the priority of different traffic categories. The novel contribution is the analysis of the optimal operation point where the maximum throughput can be achieved. The second contribution is the proposal of simple adaptive schemes which can lead the system to operate under the optimal operation point and, at the same time, achieve the target service differentiation between different traffic flows. Results obtained in the paper are relevant for both theoretical research and implementations of real systems.
Adequacy and Complete Axiomatization for Timed Modal Logic.pdf |
Adequacy and Complete Axiomatization for Timed Modal Logic
Abstract
In this paper we develop the metatheory for Timed Modal Logic (TML), which is the modal logic used for
the analysis of timed transition systems (TTSs). We solve a series of long-standing open problems related to
TML. Firstly, we prove that TML enjoys the Hennessy-Milner property and solve one of the open questions
in the field. Secondly, we prove that the set of validities are not recursively enumerable. Nevertheless,
we develop a strongly-complete proof system for TML. Since the logic is not compact, the proof system
contains infinitary rules, but only with countable sets of instances. Thus, we can involve topological results
regarding Stone spaces, such as the Rasiowa-Sikorski lemma, to complete the proofs
Abstract
In this paper we develop the metatheory for Timed Modal Logic (TML), which is the modal logic used for
the analysis of timed transition systems (TTSs). We solve a series of long-standing open problems related to
TML. Firstly, we prove that TML enjoys the Hennessy-Milner property and solve one of the open questions
in the field. Secondly, we prove that the set of validities are not recursively enumerable. Nevertheless,
we develop a strongly-complete proof system for TML. Since the logic is not compact, the proof system
contains infinitary rules, but only with countable sets of instances. Thus, we can involve topological results
regarding Stone spaces, such as the Rasiowa-Sikorski lemma, to complete the proofs