Pulsar test of a violation of discrete symmetries in gravitation

We determine an improved limit on C and P violation to the extended gravitational potential of Leitner and Okubo using the millisecond pulsar PSR 1937+214 data. © 1989.

Toda and Volterra lattice equations from discrete symmetries of KP hierarchies

The discrete models of the Toda and Volterra chains are being constructed out of the continuum two-boson KP hierarchies. The main tool is the discrete symmetry preserving the Hamiltonian structure of the continuum models. The two-boson currents of KP hierarchy are being associated with sites of the corresponding chain by successive actions of discrete symmetry.

On discrete symmetries of the multi-boson KP hierarchies

We show that the multi-boson KP hierarchies possess a class of discrete symmetries linking them to discrete Toda systems. These discrete symmetries are generated by the similarity transformation of the corresponding Lax operator. This establishes a canonical nature of the discrete transformations. The spectral equation, which defines both the lattice system and the corresponding Lax operator, plays a key role in determining pertinent symmetry structure. We also introduce the concept of the square root lattice leading to a family of new pseudo-differential operators with covariance under additional Bäcklund transformations.

Symmetries and time evolution in discrete phase spaces: a soluble model calculation

Using the flexibility and constructive definition of the Schwinger bases, we developed different mapping procedures to enhance different aspects of the dynamics and of the symmetries of an extended version of the two-level Lipkin model. The classical limits of the dynamics are discussed in connection with the different mappings. Discrete Wigner functions are also calculated. © 1995.

Toda lattice field theories, discrete W algebras, Toda lattice hierarchies and quantum groups

In analogy with the Liouville case we study the sl3 Toda theory on the lattice and define the relevant quadratic algebra and out of it we recover the discrete W3 algebra. We define an integrable system with respect to the latter and establish the relation with the Toda lattice hierarchy. We compute the relevant continuum limits. Finally we find the quantum version of the quadratic algebra.

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.

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)

Discrete generator coordinate: Symmetry restoration in finite-dimensional spaces

Group theoretical-based techniques and fundamental results from number theory are used in order to allow for the construction of exact projectors in finite-dimensional spaces. These operators are shown to make use only of discrete variables, which play the role of discrete generator coordinates, and their application in the number symmetry restoration is carried out in a nuclear BCS wave function which explicitly violates that symmetry. © 1999 Published by Elsevier Science B.V. All rights reserved.

H2 and/or H∞-norm model reduction of uncertain discrete-time systems

This paper addresses the problem of model reduction for uncertain discrete-time systems with convex bounded (polytope type) uncertainty. A reduced order precisely known model is obtained in such a way that the H2 and/or the H∞ guaranteed norm of the error between the original (uncertain) system and the reduced one is minimized. The optimization problems are formulated in terms of coupled (non-convex) LMIs - Linear Matrix Inequalities, being solved through iterative algorithms. Examples illustrate the results.

An extremal nonnegative sine polynomial

For any positive integer n, the sine polynomials that are nonnegative in [0, π] and which have the maximal derivative at the origin are determined in an explicit form. Associated cosine polynomials Kn (θ) are constructed in such a way that {Kn(θ)} is a summability kernel. Thus, for each Pi 1 ≤ P ≤ ∞ and for any 27π-periodic function f ∈ Lp [-π, π], the sequence of convolutions Kn * f is proved to converge to f in Lp[-ππ]. The pointwise and almost everywhere convergences are also consequences of our construction.

Landau and Kolmogoroff type polynomial inequalities II

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any distribution associated with the Jacobi, Laguerre or Bessel orthogonal polynomials. In particular we characterize completely the positive constants A and B, for which the Landau weighted polynomial inequalities ∥f′∥ 2 ≤ A∥f″∥2 + B∥f∥ 2 hold. © Dynamic Publishers, Inc.

Higher-dimensional twistor transforms using pure spinors

Hughston has shown that projective pure spinors can be used to construct massless solutions in higher dimensions, generalizing the four-dimensional twistor transform of Penrose. In any even (euclidean) dimension d = 2n, projective pure spinors parameterize the coset space SO(2n)/U(n), which is the space of all complex structures on ℝ2n. For d = 4 and d = 6, these spaces are ℂℙ1 and ℂℙ3 and the appropriate twistor transforms can easily be constructed. In this paper, we show how to construct the twistor transform for d > 6 when the pure spinor satisfies nonlinear constraints, and present explicit formulas for solutions of the massless field equations. © SISSA/ISAS 2005.

Fractional polynomial response surface models

Second-order polynomial models have been used extensively to approximate the relationship between a response variable and several continuous factors. However, sometimes polynomial models do not adequately describe the important features of the response surface. This article describes the use of fractional polynomial models. It is shown how the models can be fitted, an appropriate model selected, and inference conducted. Polynomial and fractional polynomial models are fitted to two published datasets, illustrating that sometimes the fractional polynomial can give as good a fit to the data and much more plausible behavior between the design points than the polynomial model. © 2005 American Statistical Association and the International Biometric Society.

Linear quadratic Gaussian control of discrete-time Markov jump linear systems with horizon defined by stopping times

The linear quadratic Gaussian control of discrete-time Markov jump linear systems is addressed in this paper, first for state feedback, and also for dynamic output feedback using state estimation. in the model studied, the problem horizon is defined by a stopping time τ which represents either, the occurrence of a fix number N of failures or repairs (T N), or the occurrence of a crucial failure event (τ δ), after which the system paralyzed. From the constructive method used here a separation principle holds, and the solutions are given in terms of a Kalman filter and a state feedback sequence of controls. The control gains are obtained by recursions from a set of algebraic Riccati equations for the former case or by a coupled set of algebraic Riccati equation for the latter case. Copyright © 2005 IFAC.

Discrete-time sliding mode control of input-delay systems applied on a power generation system

This paper presents two discrete sliding mode control (SMC) design. The first one is a discrete-time SMC design that doesn't take into account the time-delay. The second one is a discrete-time SMC design, which takes in consideration the time-delay. The proposed techniques aim at the accomplishment simplicity and robustness for an uncertainty class. Simulations results are shown and the effectiveness of the used techniques is analyzed. © 2006 IEEE.