(1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.

https://link.springer.com/content/pdf/10.1057%2Fjors.1987.184.pdf

Applied Probability and Queues

Adaptive vector median filtering

From the Publisher:
Image Processing Handbook covers methods for two different purposes:
Improving the visual appearance of images to a human viewerPreparing images for measurement of the features and structures present.

The handbook presents an extensive collection of image processing tools, enabling the user of computer-based system to understand those methods provided in packaged software and to program additions needed for particular applications. Comparisons are presented of different algorithms that may be used for similar purposes, including a selection of representative pictures from light and electron microscopes as well as macroscopic, satellite, and astronomical images.
Image Processing Handbook examines the rapid, powerful developments in graphic information, covering the array of concepts and techniques in high-end imaging software. With balanced, complete descriptions, the text outlines frequency space methods with extensive mathematical presentation and spatial domain processing. This handbook teaches by example -- by seeing what various operations do to representative images, the reader will discover how and why to use them. The text encourages the reader to use its information with a real source of images and a computer-based system as well as to freely experiment with different methods to determine the most appropriate for his or her particular needs.To facilitate the learning process, Reindeer Games in Charlotte, North Carolina, offers The Image Processing Tool Kit, a CD-ROM containing more than 150 images and more than 150 Photoshop-compatible plug-ins that implement the algorithms discussed. This revision of the established standard acts as a singular resource for professionals in the medical, biological, and materials sciences as well as a range of engineering venues, including electrical and computer engineering, optical engineering, telecommunications, and artificial intelligence.

Image Processing Handbook, Fourth Edition

Security, privacy & efficiency of sustainable Cloud Computing for Big Data & IoT

Wireless sensor networks are one of the most promising emerging technologies, providing the opportunity for real-time monitoring of geographical regions (remote and hostile) that are prone to disasters. With a focus on landslide detection, this work reaffirms the capability of wireless sensor networks for disaster mitigation. A complete functional system consisting of 50 geological sensors and 20 wireless sensor nodes was deployed in Idukki, a district in the southwestern region of Kerala State, India, a highly landslide prone area. The wireless sensor network system has, for the past three years, gathered vast amounts of data such as correlated sensor data values on rainfall, moisture, pore pressure and movement, along with other geological, hydrological and soil properties, helping to provide a better understanding of the landslide scenario. Using the wireless sensor networks, system was developed an innovative three level landslide warning system (Early, Intermediate and Imminent). This system has proven its validity by delivering a real warning to the local community during heavy rains in the July 2009 monsoon season. The implementation of this system uses novel data aggregation methods for power optimization in the field deployment. A report on unanticipated challenges that were faced in the field deployment of the wireless sensor networks and the novel solutions devised to overcome them are presented here.

Design, development, and deployment of a wireless sensor network for detection of landslides

When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the distribution of the buffer overflow period in a constant service time queue are presented. In particular, they include formulas for distribution functions, probability density functions, expected values, limiting distributions for a large buffer. The queueing models supporting single and batch arrivals are considered.

http://www.wseas.us/e-library/conferences/2006istanbul/papers/520-138.pdf

Buffer overflow period in a constant service rate queue

We perform a comprehensive analysis of packet losses occurring at an AQM buffer in which the packet deletion probability is relative to the size of the queue. Several characteristics of the loss process are derived: the number of deletions in an interval of length t, the temporary intensity of deletions at arbitrary time, the steady-state loss ratio, and the number of losses if there is no service. All of them are obtained for a general deletion probability function and an advanced model of the arrival process, which incorporates, among other things, the autocorrelation of traffic. Analytical results are accompanied by examples in which numerical values are obtained for several configurations of the system. Using these examples, the dependence of the loss process on the initial system state, deletion probability function, and traffic autocorrelation are discussed.

Andrzej Chydzinski

Papers

Buffer overflow period in a constant service rate queue

Loss Process at an AQM Buffer