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.

Fatores de correção do perímetro escrotal para efeitos de idade e peso ao sobreano de tourinhos nelore

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

Relação do perímetro escrotal com a média de peso do grupo contemporâneo para estimação de um modelo de ajuste

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

Higher order turän inequalities

The celebrated Turân inequalities P 2 n(x)-P n-x(x)P n+1(x) ≥ 0, x ε[-1,1], n ≥ 1, where P n(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ 2 n - γ n-1γ n+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the Laguerre-Pölya class, ψ(x) = ∑ ∞ n=0 γ nx n / n!. ©1998 American Mathematical Society.

Efeitos Ambientais sobre Ganho de Peso no Período do Nascimento ao Desmame em Bovinos da Raça Nelore

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Fatores de Correção para Ganho de Peso Médio Diário no Período do Nascimento ao Desmame em Bovinos da Raça Nelore

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Inversely symmetric interpolatory quadrature rules

We consider interpolatory quadrature rules with nodes and weights satisfying symmetric properties in terms of the division operator. Information concerning these quadrature rules is obtained using a transformation that exists between these rules and classical symmetric interpolatory quadrature rules. In particular, we study those interpolatory quadrature rules with two fixed nodes. We obtain specific examples of such quadrature rules.

Variational studies and replica symmetry breaking in the generalization problem of the binary perceptron

We analyze the average performance of a general class of learning algorithms for the nondeterministic polynomial time complete problem of rule extraction by a binary perceptron. The examples are generated by a rule implemented by a teacher network of similar architecture. A variational approach is used in trying to identify the potential energy that leads to the largest generalization in the thermodynamic limit. We restrict our search to algorithms that always satisfy the binary constraints. A replica symmetric ansatz leads to a learning algorithm which presents a phase transition in violation of an information theoretical bound. Stability analysis shows that this is due to a failure of the replica symmetric ansatz and the first step of replica symmetry breaking (RSB) is studied. The variational method does not determine a unique potential but it allows construction of a class with a unique minimum within each first order valley. Members of this class improve on the performance of Gibbs algorithm but fail to reach the Bayesian limit in the low generalization phase. They even fail to reach the performance of the best binary, an optimal clipping of the barycenter of version space. We find a trade-off between a good low performance and early onset of perfect generalization. Although the RSB may be locally stable we discuss the possibility that it fails to be the correct saddle point globally. ©2000 The American Physical Society.

Lamé differential equations and electrostatics

The problem of existence and uniqueness of polynomial solutions of the Lamé differential equation A(x)y″ + 2B(x)y′ + C(x)y = 0, where A(x),B(x) and C(x) are polynomials of degree p + 1,p and p - 1, is under discussion. We concentrate on the case when A(x) has only real zeros aj and, in contrast to a classical result of Heine and Stieltjes which concerns the case of positive coefficients rj in the partial fraction decomposition B(x)/A(x) = ∑j p=0 rj/(x - aj), we allow the presence of both positive and negative coefficients rj. The corresponding electrostatic interpretation of the zeros of the solution y(x) as points of equilibrium in an electrostatic field generated by charges rj at aj is given. As an application we prove that the zeros of the Gegenbauer-Laurent polynomials are the points of unique equilibrium in a field generated by two positive and two negative charges. © 2000 American Mathematical Society.

Analytical functions for the calculation of hyperspherical potential curves of atomic systems

We present angular basis functions for the Schrödinger equation of two-electron systems in hyperspherical coordinates. By using the hyperspherical adiabatic approach, the wave functions of two-electron systems are expanded in analytical functions, which generalizes the Jacobi polynomials. We show that these functions, obtained by selecting the diagonal terms of the angular equation, allow efficient diagonalization of the Hamiltonian for all values of the hyperspherical radius. The method is applied to the determination of the 1S e energy levels of the Li + and we show that the precision can be improved in a systematic and controllable way. ©2000 The American Physical Society.

Gaussian extended cubature formulae for polyharmonic functions

The purpose of this paper is to show certain links between univariate interpolation by algebraic polynomials and the representation of polyharmonic functions. This allows us to construct cubature formulae for multivariate functions having highest order of precision with respect to the class of polyharmonic functions. We obtain a Gauss type cubature formula that uses ℳ values of linear functional (integrals over hyperspheres) and is exact for all 2ℳ-harmonic functions, and consequently, for all algebraic polynomials of n variables of degree 4ℳ - 1.