A procedure for detecting outliers in regression problems is proposed. It is based on information provided by boosting regression trees. The key idea is to select the most frequently resampled observation along the boosting iterations and reiterate after removing it. The selection criterion is based on Tchebychev’s inequality applied to the maximum over the boosting iterations of ...

the computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. it is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of new-ton's method, but previous researchers have mentioned that some...

Program slicing is an analysis that answers questions such as \Which statements might aaect the computation of variable v at statement s?" or \Which statements depend on the value of v computed in statement s?". The answers computed by program slicing are generally a set of statements. We introduce the idea of iteration spacing slicing: we reene program slicing to ask questions such as \Which i...

in this paper a modification of he's variational iteration method (vim) has been employed to solve dung and riccati equations. sometimes, it is not easy or even impossible, to obtain the first few iterations of vim, therefore, we suggest to approximate the integrand by using suitable expansions such as taylor or chebyshev expansions.

Objective(s): We evaluated edge artifacts in relation to phantom diameter and reconstruction parameters in point spread function (PSF)-based positron emission tomography (PET) image reconstruction.Methods: PET data were acquired from an original cone-shaped phantom filled with 18F solution (21.9 kBq/mL) for 10 min using a Biograph mCT scanner. The images were reconstructed using the baseline or...

We shall show that if the restricted isometry constant (RIC) δs+1(A) of the measurement matrix A satisfies δs+1(A) < 1 √ s+ 1 , then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed. That is, OMP can recover every s-sparse signal x in s iterations from b = Ax. Moreover, we shall show the upper bound of RIC is sharp in the following sense. For any given s ∈ N, we shall construc...

It is proved that among the rational iterations locally converging with order s > 1 to the sign function, the Padé iterations and their reciprocals are the unique rationals with the lowest sum of the degrees of numerator and denominator.

We deal with the problem of preserving various versions of completeness in (< κ)–support iterations of forcing notions, generalizing the case “S–complete proper is preserved by CS iterations for a stationary costationary S ⊆ ω1”. We give applications to Uniformization and the Whitehead problem. In particular, for a strongly inaccessible cardinal κ and a stationary set S ⊆ κ with fat complement ...