In this paper we find a characterization type result for (η1,η2)-convex functions. The Fejér integral inequality related to (η1,η2)-convex functions is obtained as a generalization of Fejér inequality related to the preinvex and η-convex functions. Also some Fejér trapezoid and midpoint type inequalities are given in the case that the absolute value of the derivative of considered function is (...

BACKGROUND AND PURPOSE Open-wedge osteotomies of the distal radius create a void that is usually filled with either iliac crest bone graft or bone substitute. Previous studies have suggested that this is unnecessary. We investigated the safety of omitting the filling procedure. PATIENTS AND METHODS We included 15 patients with a dorsal malunion of a distal radius fracture. A palmar approach a...

In this paper, we establish some generalizations of weighted trapezoid inequality for mappings of bounded variation, and give several applications for r − moment, the expectation of a continuous random variable and the Beta mapping.

An approximation of the Stieltjes integral of bounded integrals and continuous integrators via the Darst-Pollard inequality is given. Applications for the generalised trapezoid formula and the Ostrowski inequality for functions of bounded variation are also provided.

Utilising the Beesack version of the Darst-Pollard inequality, some error bounds for approximating the Riemann-Stieltjes integral are given. Some applications related to the trapezoid and mid-point quadrature rules are provided.

Some generalizations and refinements of Hermite-Hadamard type inequalities related to [Formula: see text]-convex functions are investigated. Also applications for trapezoid and mid-point type inequalities are given.

Generalizations of the classical and perturbed trapezoid inequalities are developed using a new mean value theorem for the remainder in Taylor’s formula. The resulting inequalities for N -times differentiable mappings are sharp.

The greatest impediment to practical adoption of iterative methods for X-ray CT is the computation burden of cone-beam forward and back-projectors. Moreover, forward and back-projector accuracy is also crucial to iterative reconstruction methods. We previously described a computationally efficient projector that approximates the voxel footprint functions by the 2D separable products of trapezoi...