Reliability for Beta Models

In the area of stress-strength models there has been a large amount of work as regards estimation of the reliability R = Pr(X2 < X1 ) when X1 and X2 are independent random variables belonging to the same univariate family of distributions. The algebraic form for R = Pr(X2 < X1 ) has been worked out for the majority of the well-known distributions including Normal, uniform, exponential, gamma, weibull and pareto. However, there are still many other distributions for which the form of R is not known. We have identified at least some 30 distributions with no known form for R. In this paper we consider some of these distributions and derive the corresponding forms for the reliability R. The calculations involve the use of various special functions.

Nearly Coconvex Approximation

* Part of this work was done while the second author was on a visit at Tel Aviv University in March 2001

Approximation Classes for Adaptive Methods

* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army Research Office Contract Nr. DAAD 19-02-1-0028, the National Science Foundation grants DMS-0221642 and DMS-0200665, the Deutsche Forschungsgemeinschaft grant SFB 401, the IHP Network “Breaking Complexity” funded by the European Commission and the Alexan- der von Humboldt Foundation.

Quadratic Mean Radius of a Polynomial in C(Z)

* Dedicated to the memory of Prof. N. Obreshkoff

New Upper Bounds for Some Spherical Codes

The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A(n, s). We use two methods for obtaining new upper bounds on A(n, s) for some values of n and s. We find new linear programming bounds by suitable polynomials of degrees which are higher than the degrees of the previously known good polynomials due to Levenshtein [11, 12]. Also we investigate the possibilities for attaining the Levenshtein bounds [11, 12]. In such cases we find the distance distributions of the corresponding feasible maximal spherical codes. Usually this leads to a contradiction showing that such codes do not exist.

"AVO-Polynom" Recognition Algorithm

Estimates Calculating Algorithms have a long story of application to recognition problems. Furthermore they have formed a basis for algebraic recognition theory. Yet use of ECA polynomials was limited to theoretical reasoning because of complexity of their construction and optimization. The new recognition method “AVO- polynom” based upon ECA polynomial of simple structure is described.

On the Riemann-Liouville Fractional q-Integral Operator Involving a Basic Analogue of Fox H-Function

2000 Mathematics Subject Classification: 33D60, 26A33, 33C60

On Two Saigo’s Fractional Integral Operators in the Class of Univalent Functions

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

Polynomial Expansions for Solutions of Higher-Order Bessel Heat Equation in Quantum Calculus

Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90

Algorithms for Evaluation of the Wright Function for the Real Arguments’ Values

2000 Math. Subject Classification: 33E12, 65D20, 33F05, 30E15

On q-Laplace Transforms of the q-Bessel Functions

Mathematics Subject Classification: 33D15, 44A10, 44A20

On the Generalized Associated Legendre Functions

Mathematics Subject Classification: 33C60, 33C20, 44A15

A Brief Story about the Operators of the Generalized Fractional Calculus

2000 Mathematics Subject Classification: 26A33, 33C60, 44A20

Fractional Integration and Fractional Differentiation of the M-Series

Mathematics Subject Classification: 26A33, 33C60, 44A15

Splines in Numerical Integration

AMS Subj. Classification: 65D07, 65D30.