Frequency-resolved optical gating (FROG), a technique for measuring ultrashort laser pulses, involves producing a spectrogram of the pulse and then retrieving the pulse intensity and phase with an iterative algorithm. We study how several types of noise—multiplicative, additive, and quantization—affect pulse retrieval. We define a convergence criterion and find that the algorithm converges to a...

We study automata-theoretic properties of distances and quasi-distances between words. We show that every additive distance is nite. We also show that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. As an application we present a simple algorithm that constructs a metric ...

 A step-by-step algorithm for enhancement of periodic signals that are highly corrupted by additive uncorrelated white gausian noise is proposed. In each adaptation step a new parallel second-order section is added to the previous filters. Every section has only one adjustable parameter, i.e., the center frequency of the self-tuning filter. The bandwidth and the convergence factor of each secti...

In active noise control (ANC) systems, the online secondary path modeling (OSPM) methods that use additive random noise are often applied. The additive random noise, however, contributes to the residual noise, and thus deteriorates the noise control performance of ANC systems. This paper proposes a new OSPMmethod with power scheduling of additive random noise. Here the OSPM filter is adapted us...

This paper investigates incomplete interval fuzzy preference relations. An additive consistency property of fuzzy preference relations proposed by Herrera-Viedma et al. (2004) is first extended to a more general case. This property is then generalized to interval fuzzy preference relations (IFPRs) based on additive transitivity. Subsequently, we examine how to characterize additive consistent I...

We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that additive noise speeds up the average convergence of the EM algorithm to a local maximum of the likelihood surface if a positivity condition holds. Corollary...

We present an approximation algorithm for the all pairs shortest paths (APSP) problem in weighed graphs. Our algorithm solves the APSP problem for weighted directed graphs, with real (positive or negative) weights, up to an additive error of . For any pair of vertices u, v, the algorithm finds a path whose length is at most δ(u, v) + . The algorithm is randomized and runs in Õ(n) < O(n) time, w...

In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...