Nowadays, a variety of information related to the distance between two wireless devices can be easily obtained. This paper presents a hybrid localization scheme that combines received signal strength (RSS) and round-trip time (RTT) information with the aim of improving the previous localization schemes. The hybrid localization scheme is based on an RSS ranging technique that uses RTT ranging es...

In this paper, the comparison between Hybrid Image Compressions methods and Fuzzy logic based image Compression is discussed. The Hybrid Comparison Method is a combination of both the DCT and DWT Image Compression method. When more than one compression technique are applied to compressed one image for high value of PSNR (peak signal to noise ratio) and CR (compression ratio) this process is cal...

in this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. the algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. the hybrid approach tested in a simulation environment and the results show that hybrid algorit...

We present an industrial case study in automotive control of significant complexity: the new common rail fuel injection system for Diesel engines, currently under production by Magneti Marelli Powertrain. In this system, a flow–rate valve, introduced before the High Pressure (HP) pump, regulates the fuel flow that supplies the common rail according to the engine operating point. The standard ap...

By employing invariant relation between the mean value of the first (n − 1) pixels and the last one pixel (also called the remaining pixel) for every image block containing n pixels, a new reversible watermark scheme capable of mostly carrying 2n−3 bits into one n-sized image block in a single embedding process is presented in this paper. First, the mean value of the first (n − 1) pixel is calc...

The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.