Survey Optimization via the Haphazard Intentional Sampling Method

In previously published articles, our research group has developed the Haphazard Intentional Sampling method and compared it to the Rerandomization method proposed by K.Morgan and D.Rubin. In this article, we compare both methods to the pure randomization method used for the Epicovid19 survey, conducted to estimate SARS-CoV-2 prevalence in 133 Brazilian Municipalities. We show that Haphazard intentional sampling can either substantially reduce operating costs to achieve the same estimation errors or, the other way around, substantially improve estimation precision using the same sample sizes.

The Influence of Power Network Disturbances on Short Delayed Estimation of Fundamental Frequency Based on IpDFT Method with GMSD Windows

This paper presents an application of the IpDFT spectrum interpolation method to estimate the fundamental frequency of a power waveform. Zero-crossing method (ZC) with signal prefiltering was used as a reference method. Test models of disturbances were applied, based on real disturbances recorded in power networks, including voltage harmonics and interharmonics, transient overvoltages, frequency spikes, dips and noise. It was determined that the IpDFT method is characterized by much better dynamic parameters with better estimation precision. In an example, in the presence of interharmonics, the frequency estimation error was three times larger for the reference method than that for the IpDFT method. Furthermore, during the occurrence of fast transient overvoltages, the IpDFT method reached its original accuracy about three times faster than the ZC method. Finally, using IpDFT, it was possible to identify the type of disturbances: impulsive, step changes of frequency or voltage dips.

Application of Adaptive Robust CKF in SINS/GPS Initial Alignment with Large Azimuth Misalignment Angle

When the strapdown inertial navigation system does not perform coarse alignment, the misalignment angle is generally a large angle, and a nonlinear error model and a nonlinear filtering method are required. For large azimuth misalignment, the initial alignment technology with a large azimuth misalignment angle is researched in this paper. The initial alignment technology with a large azimuth misalignment angle is researched in this paper. First, the SINS/GPS nonlinear error model is established. Secondly, in the view of observation gross errors and inaccurate noise statistical characteristics, an adaptive robust CKF algorithm is proposed. Finally, according to the simulation analysis and experiment, the adaptive robust CKF algorithm can augment the stability and improve the filter estimation precision and convergence rate.

The value of additional data for public transport origin–destination matrix estimation

Passenger origin–destination data is an important input for public transport planning. In recent years, new data sources have become increasingly common through the use of the automatic collection of entry counts, exit counts and link flows. However, collecting such data can be sometimes costly. The value of additional data collection hence has to be weighed against its costs. We study the value of additional data for estimating time-dependent origin–destination matrices, using a case study from the London Piccadilly underground line. Our focus is on how the precision of the estimated matrix increases when additional data on link flow, destination count and/or average travel distance is added, starting from origin counts only. We concentrate on the precision of the most policy-relevant estimation outputs, namely, link flows and station exit flows. Our results suggest that link flows are harder to estimate than exit flows, and only using entry and exit data is far from enough to estimate link flows with any precision. Information about the average trip distance adds greatly to the estimation precision. The marginal value of additional destination counts decreases only slowly, so a relatively large number of exit station measurement points seem warranted. Link flow data for a subset of links hardly add to the precision, especially if other data have already been added.

Drift correction in localization microscopy using entropy minimization

Localization microscopy offers resolutions down to a single nanometer, but currently requires additional dedicated hardware or fiducial markers to reduce resolution loss from drift of the sample. Drift estimation without fiducial markers is typically implemented using redundant cross correlation (RCC). We show that RCC has sub-optimal precision and bias, which leaves room for improvement. Here, we minimize a bound on the entropy of the obtained localizations to efficiently compute a precise drift estimate. Within practical compute-time constraints, simulations show a 5x improvement in drift estimation precision over the widely used RCC algorithm. The algorithm operates directly on fluorophore localizations and is tested on simulated and experimental datasets in 2D and 3D. An open source implementation is provided, implemented in Python and C++, and can utilize a GPU if available.