<p style='text-indent:20px;'>In the present paper, we introduce a new type of Bernstein-Durrmeyer operators preserving linear functions in movable interval. The approximation rate for continuous and Voronovskaja's asymptotic estimate are obtained.</p>

In this paper we study a one-parameter family of attractive reversible nearest particle system on a finite interval. As the length of the interval increases, the time that the nearest particle system first hits the empty set increases in different order, from logarithmic to exponential, according to the intensity of interaction. In particular, at the critical case, the first hitting time increa...

This paper presents an interval type-2 fuzzy Knearest neighbor (NN) algorithm that is an extension of the type1 fuzzy K-NN algorithm proposed in [l]. In our proposed method, the membership values for each vector are 'extended as interval type-2 fuzzy memberships by assigning uncertainty to the type-1 memberships. By doing so, the classification result obtained by the interval type-2 fuzzy K-NN ...

A new synchrony index for neural activity is defined in this paper. The method is able to measure synchrony dynamics in low firing rate scenarios. It is based on the computation of the time intervals between nearest spikes of two given spike trains. Generalized additive models are proposed for the synchrony profiles obtained by this method. Two hypothesis tests are proposed to assess for differ...

Purpose This paper aims to discuss the classification of targets based on their radar cross-section (RCS). The wavelength, dimensions and distance from antenna are in order 1 mm, m 10 m, respectively. Design/methodology/approach near-field RCS is considered, physical optics approximation used for its numerical calculation. To model real scenarios, authors assume that incident angle a random var...

The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ F2 and a linear space L ⊆ F2 of dimension k NCP asks to find a point l ∈ L that minimizes the (Hamming) distance from v. It is well-known that the nearest codeword problem is NP-hard. Therefore approximation algorithms are of interest. The best efficient approximation al...