In this study, the performance of the algorithms of whale, Differential evolutionary, crow search, and Gray Wolf optimization were evaluated to operate the Golestan Dam reservoir with the objective function of meeting downstream water needs. Also, after defining the objective function and its constraints, the convergence degree of the algorithms was compared with each other and with the absolut...

Robin Thomas asked whether for every proper minor-closed class G, there exists a polynomial-time algorithm approximating the chromatic number of graphs from G up to a constant additive error independent on the class G. We show this is not the case: unless P = NP, for every integer k ≥ 1, there is no polynomial-time algorithm to color a K4k+1-minor-free graph G using at most χ(G) + k − 1 colors....

We introduce the Binary Matrix Guessing Problem and provide two algorithms to solve this problem. The first algorithm we introduce is Elementwise Probing Algorithm (EPA) which is very fast under a score which utilizes Frobenius Distance. The second algorithm is Additive Reinforcement Learning Algorithm which combines ideas from perceptron algorithm and reinforcement learning algorithm. This alg...

A notion of additive dilogarithm for a field k is introduced, based on the K-theory and higher Chow groups of the affine line relative to 2(0). Analogues of the K2-regulator, the polylogarithm Lie algebra, and the `-adic realization of the dilogarithm motive are discussed. The higher Chow groups of 0-cycles in this theory are identified with the Kähler differential forms Ωk. It is hoped that th...

A new algorithm is presented for adaptive comb filtering and parametric spectral estimation of harmonic signals with additive white noise. The algorithm is composed of two cascaded parts. The first estimates the fundamental frequency and enhances the harmonic component in the input, and the second estimates the harmonic amplitudes and phases. Performance analysis provides new results for the as...

A least-squares linear fixed-interval smoothing algorithm is derived to estimate signals from uncertain observations perturbed by additive white noise. It is assumed that the Bernoulli variables describing the uncertainty are only correlated at consecutive time instants. The marginal distribution of each of these variables, specified by the probability that the signal exists at each observation...

The main goal of this paper is to study and to compare the performance of different adaptive filter algorithms for noise cancellation. Adaptive noise cancellation method is used for estimating a speech signal which is corrupted by an additive noise. The reference input containing noise is adaptively filtered and subtracted from the primary input signal to obtain the de-noised signal. The desire...

In this paper, a variant of the well known algorithm FastICA is proposed to be used for blind source separation in off-line (block processing) setup and a noisy environment. The algorithm combines a symmetric FastICA with test of saddle points to achieve fast global convergence and a one-unit refinement to obtain high noise rejection ability. A novel test of saddle points is designed for separa...

The standard tool to estimate the phase of a sequence of phase-shifted interferograms is the Phase Shifting Algorithm (PSA). The performance of PSAs to a sequence of interferograms corrupted by non-white additive noise has not been reported before. In this paper we use the Frequency Transfer Function (FTF) of a PSA to generalize previous white additive noise analysis to non-white additive noisy...

While the additive model is a popular nonparametric regression method, many of its theoretical properties are not well understood, especially when the back tting algorithm is used for computation of the the estimators. This article explores those properties when the additive model is tted by local polynomial regression. Su cient conditions guaranteeing the asymptotic existence of unique estimat...