Ranked set sampling is applicable whenever ranking of a set of sampling units can be done easily by a judgement method or based on the measurement of an auxiliary variable on the units selected. In this work, we consider ranked set sampling, in which ranking of units are done based on measurements made on an easily and exactly measurable auxiliary variable X which is correlated with the study v...

Recently, there has been a great deal of research focusing on the development of sampling algorithms for networks with small-world and/or power-law structure. The peerto-peer research community (e.g., [7]) have used sampling to quickly explore and obtain a good representative sample of the network topology, as these networks are hard to explore completely and have significant amounts of churn i...

Mobile sensing has been recently proposed for sampling spatial fields, where mobile sensors record the field along various paths for reconstruction. Classical and contemporary sampling typically assumes that the sampling locations are approximately known. This work explores multiple sampling strategies along random paths to sample and reconstruct a two dimensional bandlimited field. Extensive s...

In this work, we consider the problem of channel estimation by using the recently developed theory for sampling of signals with a finite rate of innovation [1]. We show a framework which allows for lower than Nyquist rate sampling applicable for timing and channel estimation of both narrowband and wideband channels. In certain cases we demonstrate performance exceeding that of algorithms using ...

During the 2015-2016 academic year, I conducted research about Spark, BlinkDB and various sampling techniques. This research helped the team have a better understanding of the capabilities and properties of Spark, BlinkDB system and different sampling technologies. Additionally, I benchmarked and implemented various Machine learning and sampling methods on the top of both Spark and BlinkDB. The...

Close-form representations for the permissible sampling rates on the first-order sampling of two-band bandpass signals are presented in this paper. It is shown that the new sampling rates are much lower than the Nyquist rate for signals with scattered passbands. A fast algorithm is developed for the symbolic operations on intervals, which makes the proposed sampling scheme more applicable. Key-...

In this work, we consider the problem of channel estimation by using the recently developed theory for sampling of signals with a finite rate of innovation [1]. We show a framework which allows for lower than Nyquist rate sampling applicable for timing and channel estimation of both narrowband and wideband channels. In certain cases we demonstrate performance exceeding that of algorithms using ...

Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today’s fastest machines and simulators takes several weeks. A practical solution to the simulation problem is sampling. Sampled simulation selects a number of sampling units out of a complete program execution and only simulat...

This article outlines the issues that need to be considered when planning water sampling for chemical monitoring and provides guidance on the work required. In addition, it considers the limitations associated with current monitoring practices based on spot sampling and presents some existing technologies that may used to complement standard spot sampling. a 2007 Elsevier Ltd. All rights reserved.