The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

In-time motion adjustment in laser cladding manufacturing process for improving dimensional accuracy and surface finish of the formed part

This paper presents in-time motion adjustment in laser cladding manufacturing process as a means to improve dimensional accuracy and surface finish of the built part. Defects occurring during laser cladding degrade the part quality such as dimensional accuracy and surface finish. In this paper, in-time motion adjustment strategy was presented to remedy and eliminate defects occurring during laser cladding to improve the dimensional accuracy and surface finish. Based on the relationship between the motion of laser head relative to the growing part and other parameters in effects on clad profile, the laser traverse speed, stand-off distance and laser approach orientation to the existing clad layer were adjusted by instructions from a close-loop control system in real time to remedy and eliminate defects. The results of the experiments verified the effects of in-time motion adjustment on dimensional accuracy and surface finish.     

High-precision sub-pixel interpolation in particle image velocimetry image processing

The task of image interpolation and re-sampling for particle image velocimetry (PIV) is investigated, which is used for window shifting with sub-pixel accuracy and image or window deformation. A new interpolation scheme based on a Gaussian filter is introduced and compared with commonly used and widely accepted interpolation techniques in terms of the achievable root mean square deviation of the displacement estimates.     

ON THE GENERALIZATIONS OF KALANDIA＇S LEMMA

Based on Bernstein＇s Theorem, Kalandia＇s Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia＇s Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?     

Identification of micro-scale calorimetric devices II

The miniaturized calorimetric devices furnish a reduced working flat surface and permits measurements with extremely low-mass quantities. The experimental sensitivity shows relevant position dependence with x-y surface coordinates and with z-distance. The device identification is realized via a 2-D model based in Fourier general equation. Using the Marquardt method the experimental flat surface device can be identified and the fitted parameters used to simulate the behavior of the experimental system. From the model, the effects of several dissipation configurations can be evaluated. Also, via the RC-analogy, a way to 3-D experimental devices is roughly described. This revised version was published online in July 2006 with corrections to the Cover Date.