Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

K-bi-Lipschitz equivalence of real function-germs

In this paper we prove that the set of equivalence classes of germs of real polynomials of degree less than or equal to k, with respect to K-bi-Lipschitz equivalence, is finite.

Conjectures and theorems in the theory of entire functions

Motivated by the recent solution of Karlin's conjecture, properties of functions in the Laguerre-Polya class are investigated. The main result of this paper establishes new moment inequalities fur a class of entire functions represented by Fourier transforms. The paper concludes with several conjectures and open problems involving the Laguerre-Polya class and the Riemann xi -function.

SOME CONSEQUENCES OF A SYMMETRY IN STRONG DISTRIBUTIONS

Some polynomials and interpolatory quadrature rules associated with strong Stieltjes distributions are considered, especially when the distributions satisfy a Certain symmetric property. (C) 1995 Academic Press, Inc.

Integration of polyharmonic functions

The results in this paper are motivated by two analogies. First, m-harmonic functions in R(n) are extensions of the univariate algebraic polynomials of odd degree 2m-1. Second, Gauss' and Pizzetti's mean value formulae are natural multivariate analogues of the rectangular and Taylor's quadrature formulae, respectively. This point of view suggests that some theorems concerning quadrature rules could be generalized to results about integration of polyharmonic functions. This is done for the Tchakaloff-Obrechkoff quadrature formula and for the Gaussian quadrature with two nodes.

The Yang-Lee zeros of the 1D Blume-Capel model on connected and non-connected rings

We carry out a numerical and analytic analysis of the Yang-Lee zeros of the ID Blume-Capel model with periodic boundary conditions and its generalization on Feynman diagrams for which we include sums over all connected and nonconnected rings for a given number of spins. In both cases, for a specific range of the parameters, the zeros originally on the unit circle are shown to depart from it as we increase the temperature beyond some limit. The curve of zeros can bifurcate- and become two disjoint arcs as in the 2D case. We also show that in the thermodynamic limit the zeros of both Blume-Capel models on the static (connected ring) and on the dynamical (Feynman diagrams) lattice tend to overlap. In the special case of the 1D Ising model on Feynman diagrams we can prove for arbitrary number of spins that the Yang-Lee zeros must be on the unit circle. The proof is based on a property of the zeros of Legendre polynomials.

Third body perturbation using a single averaged model considering elliptic orbits for the disturbing body

In the present work, we expanded the study done by Solorzanol(1) including the eccentricity of the perturbing body. The assumptions used to develop the single-averaged analytical model are the same ones of the restricted elliptic three-body problem. The disturbing function was expanded in Legendre polynomials up to fourth-order. After that, the equations of motion are obtained from the planetary equations and we performed a set of numerical simulations. Different initial eccentricities for the perturbing and perturbed body are considered. The results obtained perform an analysis of the stability of a near-circular orbits and investigate under which conditions this orbit remain near-circular.

Optimum-Path Forest Classifier for Large Scale Biometric Applications

This paper addresses biometric identification using large databases, in particular, iris databases. In such applications, it is critical to have low response time, while maintaining an acceptable recognition rate. Thus, the trade-off between speed and accuracy must be evaluated for processing and recognition parts of an identification system. In this paper, a graph-based framework for pattern recognition, called Optimum-Path Forest (OPF), is utilized as a classifier in a pre-developed iris recognition system. The aim of this paper is to verify the effectiveness of OPF in the field of iris recognition, and its performance for various scale iris databases. The existing Gauss-Laguerre Wavelet based coding scheme is used for iris encoding. The performance of the OPF and two other - Hamming and Bayesian - classifiers, is compared using small, medium, and large-scale databases. Such a comparison shows that the OPF has faster response for large-scale databases, thus performing better than the more accurate, but slower, classifiers.

On the Milnor fibre and L numbers of semi-weighted homogeneous arrangements

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A Fast Large Scale Iris Database Classification with Optimum-Path Forest Technique: A Case Study

Majority of biometric researchers focus on the accuracy of matching using biometrics databases, including iris databases, while the scalability and speed issues have been neglected. In the applications such as identification in airports and borders, it is critical for the identification system to have low-time response. In this paper, a graph-based framework for pattern recognition, called Optimum-Path Forest (OPF), is utilized as a classifier in a pre-developed iris recognition system. The aim of this paper is to verify the effectiveness of OPF in the field of iris recognition, and its performance for various scale iris databases. This paper investigates several classifiers, which are widely used in iris recognition papers, and the response time along with accuracy. The existing Gauss-Laguerre Wavelet based iris coding scheme, which shows perfect discrimination with rotary Hamming distance classifier, is used for iris coding. The performance of classifiers is compared using small, medium, and large scale databases. Such comparison shows that OPF has faster response for large scale database, thus performing better than more accurate but slower Bayesian classifier.

Associated symmetric quadrature rules

We prove a relation between two different types of symmetric quadrature rules, where one of the types is the classical symmetric interpolatory quadrature rules. Some applications of a new quadrature rule which was obtained through this relation are also considered.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Closed expressions for Lie algebra invariants and finite transformations

A simple procedure to obtain complete, closed expressions for Lie algebra invariants is presented. The invariants are ultimately polynomials in the group parameters. The construction of finite group elements requires the use of projectors, whose coefficients are invariant polynomials. The detailed general forms of these projectors are given. Closed expressions for finite Lorentz transformations, both homogeneous and inhomogeneous, as well as for Galilei transformations, are found as examples.

Activation function study for wavelet network

The main purpose of this paper is to investigate theoretically and experimentally the use of family of Polynomial Powers of the Sigmoid (PPS) Function Networks applied in speech signal representation and function approximation. This paper carries out practical investigations in terms of approximation fitness (LSE), time consuming (CPU Time), computational complexity (FLOP) and representation power (Number of Activation Function) for different PPS activation functions. We expected that different activation functions can provide performance variations and further investigations will guide us towards a class of mappings associating the best activation function to solve a class of problems under certain criteria.

Quantal information entropies for atoms

The polynomials occurring in the wave functions of hydrogenic excited states are found to present difficulties for a straightforward analytical approach to the study of associated information entropies. A method is suggested to deal with them. It is then applied to calculate the information entropy for the Jacobi polynomial. A model calculation is presented to examine the effect of screening on the entropy sum. It is seen that the sum does not depend on the choice of screening.