An algorithm for the computation of error bounds for the zeros of a polynomial is described. This algorithm is derived by applying Rouch6's theorem to a Newton-like interpolation formula for the polynomial, and so it is suitable in the case where the approximations to the zeros of the polynomial are computed successively using deflation. Confluent and clustered approximations are handled easily...

On the basis of order statistics, Baker (2008) proposed a method for constructing multivariate distributions with fixed marginals. This is another representation of the Bernstein copula. According to the construction of Baker’s distribution, the Bernstein copula can be regarded as a finite mixture distribution. In this paper, we propose expectationmaximization (EM) algorithms to estimate the Be...

We introduce a new category of fuzzy neural networks with multiple-output based on fuzzy clustering algorithm, especially, fuzzy c-means clustering algorithm (FCM-based FNNm) for pattern classification in this paper. The premise part of the rules of the proposed networks is realized with the aid of the scatter partition of input space generated by FCM clustering algorithm. The partitioned local...

In this paper we continue our earlier research [4] aimed at developing efficient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm. As an improvement to the pure polynomial local approximation method used in [5], a hybrid polynomial/radial basis scheme was considered in [4], where the local knot locations for the RBF terms w...

Predicting future behavior of chaotic time series system is a challenging area in the literature of nonlinear systems. The prediction's accuracy of chaotic time series is extremely dependent on the model and the learning algorithm. On the other hand the cyclic solar activity as one of the natural chaotic systems has significant effects on earth, climate, satellites and space missions. Several m...

This paper presents an algorithm for a dense computation of the diierence in blur between two images. The two images are acquired by varying the intrinsic parameters of the camera. The image formation system is assumed to be passive. Estimation of depth from the blur diierence is straightforward. The algorithm is based on a local image decomposition technique using the Hermite polynomial basis....

in this research, the spatial distribution of electrical conductivity and ph of springs, ghanats and the base flow concentration places on the streams of central and south-west and central parts of the hamedan-bahar plain were evaluated. using different geostatistical methods such as kriging, minimum curvature, inverse distance, natural neighbor, local polynomial and radial basis functions, 108...

to investigate the effect of preprocessing techniques including contrast enhancement and illumination correction on retinal imagequality, a comparative study was carried out. we studied and implemented a few illumination correction and contrast enhancementtechniques on color retinal images to find out the best technique for optimum image enhancement. to compare and choose thebest illumination c...

As columns age and differ between systems, retention times for comprehensive two-dimensional gas chromatography (GCxGC) may vary between runs. To properly analyze GCxGC chromatograms, it often is desirable to align the retention times of chromatographic features, such as analyte peaks, between chromatograms. Previous work by the authors has shown that global, low-degree polynomial transformatio...