(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

In a queueing system with the dropping function the arriving customer can be denied service (dropped) with the probability that is a function of the queue length at the time of arrival of this customer. The potential applicability of such mechanism is very wide due to the fact that by choosing the shape of this function one can easily manipulate several performance characteristics of the queueing system. In this paper we carry out analysis of the queueing system with the dropping function and a very general model of arrival process--the model which includes batch arrivals and the interarrival time autocorrelation, and allows for fitting the actual shape of the interarrival time distribution and its moments. For such a system we obtain formulas for the distribution of the queue length and the overall customer loss ratio. The analytical results are accompanied with numerical examples computed for several dropping functions.

Queues with Dropping Functions and General Arrival Processes.

In this paper oscillating queueing system is studied. Oscillating queueing systems are interesting practical objects and researches in this subject are a natural continuation of previous studies on oscillating stochastic processes. It is shown a powerful method for finding characteristic quantities of queuing systems (potential method). Using this method the steady-state distribution of the length of the queue in the M/G-G/1 oscillating system is found and presented in explicit formula. In addition, a numerical example is given.

The M/G-G/1 Oscillating Queueing System

Duration of the buffer overflow period in a batch arrival queue

The paper presents an analysis of the queue size distribution in a finite-buffer queue fed by a BMAP (Batch Markovian Arrival Process) In particular, the time-dependent and steady-state solutions are given as closed-form formulas In addition, computational issues are discussed and a numerical example based on IP traffic is presented

Queue size in a BMAP queue with finite buffer

We present a novel approach to the problem of impulsive noise reduction for colorimages. The new image-filtering
technique is based on the maximization of the similarities
between pixels in the filtering window. Themethod is able to
remove the noise component, while adapting itself to the local
image structure. In this way, the proposed algorithm eliminates
impulsive noise while preserving edges and fine image details.
Since the algorithm can be considered as a modification of the
vector median filter driven by fuzzy membership functions, it is
fast, computationally efficient, and easy to implement.
Experimental results indicate that the new method is superior, in
terms of performance, to algorithms commonly used for impulsive
noise reduction.

https://downloads.hindawi.com/journals/mpe/2004/545162.pdf

Andrzej Chydzinski

Papers

Queues with Dropping Functions and General Arrival Processes.

The M/G-G/1 Oscillating Queueing System

Duration of the buffer overflow period in a batch arrival queue

Queue size in a BMAP queue with finite buffer

New filtering technique for the impulsive noise reduction in color images