UNITARY POLE APPROXIMATION FOR THE COULOMB-PLUS-YAMAGUCHI POTENTIAL AND APPLICATION TO A 3-BODY BOUND-STATE CALCULATION

The unitary pole approximation is used to construct a separable representation for a potential U which consists of a Coulomb repulsion plus an attractive potential of the Yamaguchi type. The exact bound-state wave function is employed. U is chosen as the potential which binds the proton in the 1d5/2 single-particle orbit in F-17. Using the separable representation derived for U, and assuming a separable Yamaguchi potential to describe the 1d5/2 neutron in O-17, the energies and wave functions of the ground state (1+) and the lowest 0+ state of F-18 are calculated in the Gore-plus-two-nucleons model solving the Faddeev equations.

ON THE INDEPENDENT-PARTICLE APPROXIMATION OF GAUGE-THEORIES - A SIMPLE EXAMPLE

In this work the independent particle model formulation is studied as a mean-field approximation of gauge theories using the path integral approach in the framework of quantum electrodynamics in 1 + 1 dimensions. It is shown how a mean-field approximation scheme can be applied to fit an effective potential to an independent particle model, building a straightforward relation between the model and the associated gauge field theory. An example is made considering the problem of massive Dirac fermions on a line, the so called massive Schwinger model. An interesting result is found, indicating a behaviour of screening of the charges in the relativistic limit of strong coupling. A forthcoming application of the method developed to confining potentials in independent quark models for QCD is in view and is briefly discussed.

Ps-H scattering using the three-state positronium close-coupling approximation

Positronium scattering off a hydrogen target has been studied employing a three-state positronium model close-coupling approximation (CCA) with and without electron exchange. Elastic, excitation and quenching cross sections are reported at low and medium energies. The effect of electron exchange is found to be significant at low energies. The ratio of quenching to the total cross section (the conversion ratio) approaches the value of 0.25 with increase of energy, as expected.

Chebyshev-Laurent polynomials and weighted approximation

Let (a, b) subset of (0, infinity) and for any positive integer n, let S-n be the Chebyshev space in [a, b] defined by S-n:= span{x(-n/2+k),k= 0,...,n}. The unique (up to a constant factor) function tau(n) is an element of S-n, which satisfies the orthogonality relation S(a)(b)tau(n)(x)q(x) (x(b - x)(x - a))(-1/2) dx = 0 for any q is an element of Sn-1, is said to be the orthogonal Chebyshev S-n-polynomials. This paper is an attempt to exibit some interesting properties of the orthogonal Chebyshev S-n-polynomials and to demonstrate their importance to the problem of approximation by S-n-polynomials. A simple proof of a Jackson-type theorem is given and the Lagrange interpolation problem by functions from S-n is discussed. It is shown also that tau(n) obeys an extremal property in L-q, 1 less than or equal to q less than or equal to infinity. Natural analogues of some inequalities for algebraic polynomials, which we expect to hold for the S-n-pelynomials, are conjectured.

Integrable approximation to the overlap of resonances

We study the interaction of resonances with the same order in families of integrable Hamiltonian systems. This can occur when the unperturbed Hamiltonian is at least cubic in the actions. An integrable perturbation coupling the action-angle variables leads to the disappearance of an island through the coalescence of stable and unstable periodic orbits and originates a complex orbit plus an isolated cubic resonance. The chaotic layer that appears when a general term is added to the Hamiltonian survives even after the disappearance of the unstable periodic orbit. © 1992.

Interaction potential between vortex lines for uniaxial superconductors in the London approximation

Two distinct expressions of the interaction potential between arbitrarily oriented curved vortex lines with respect to the crystal c axis are derived within the London approximation. One of these expressions is used to compute the eigenvalues of the elasticity matrix. We examine the elastic properties of the vortex chain lattice, recently proposed, concerning shearing deformation.

Nonforward parton distributions of the pion within an effective single instanton approximation

We develop a relativistic quark model for pion structure, which incorporates the nontrivial structure of the vacuum of quantum chromodynamics as modelled by instantons. Pions are bound states of quarks and the strong quark-pion vertex is determined from an instanton induced effective Lagrangian. The interaction of the constituents of the pion with the external electromagnetic field is introduced in gauge invariant form. The parameters of the model, i.e., effective instanton radius and constituent quark mass, are obtained from the vacuum expectation values of the lowest dimensional quark and gluon operators and the low-energy observables of the pion. We apply the formalism to the calculation of the pion form factor by means of the isovector nonforward parton distributions and find agreement with the experimental data. © 2000 Elsevier Science B.V.

Off-Diagonal Quark Distributions in Pions in the Effective Single-Instanton Approximation

Nonperturbative functions that parametrize off-diagonal hadronic matrix elements of the light-cone leading-twist quark operators are considered. These functions are calculated within the proposed relativistic quark model allowing for the nontrivial structure of the QCD vacuum, special attention being given to gauge invariance. Hadrons are treated as bound states of quarks; strong-interaction quark-pion vertices are described by effective interaction Lagrangians generated by instantons. The parameters of the instanton vacuum, such as the effective radius of the instanton and the quark mass, are related to the vacuum expectation values of the quark-gluon operators of the lowest dimension and to low-energy pion observables. © 2000 MAIK Nauka/Interperiodica.

Approximation of hyperbolic tangent activation function using hybrid methods

Artificial Neural Networks are widely used in various applications in engineering, as such solutions of nonlinear problems. The implementation of this technique in reconfigurable devices is a great challenge to researchers by several factors, such as floating point precision, nonlinear activation function, performance and area used in FPGA. The contribution of this work is the approximation of a nonlinear function used in ANN, the popular hyperbolic tangent activation function. The system architecture is composed of several scenarios that provide a tradeoff of performance, precision and area used in FPGA. The results are compared in different scenarios and with current literature on error analysis, area and system performance. © 2013 IEEE.

Wave equation depth migration using complex Padé approximation

Propomos um novo método de migração em profundidade baseado na solução da equação da onda com densidade constante no domínio da freqüência. Uma aproximação de Padé complexa é usada para aproximar o operador de evolução aplicado na extrapolação do campo de ondas. Esse método reduz as imprecisões e instabilidades devido às ondas evanescentes e produz imagens com menos ruídos numéricos que aquelas obtidas usando-se a aproximação de Padé real para o operador exponencial, principalmente em meios com fortes variações de velocidades. Testes em dados de afastamento nulo do modelo de sal SEG/EAGE e nos dados de tiro comum 2-D Marmousi foram realizados. Os resultados obtidos mostram que o método de migração proposto consegue lidar com fortes variações laterais e também tem uma boa resposta para refletores com mergulhos íngremes. Os resultados foram comparados àqueles resultados obtidos com os métodos split-step Fourier (SSF), phase shift plus interpolarion (PSPI) e Fourier diferenças-finitas (FFD).

Chemical and mineralogical characterization of portuguese ceramic tiles in the historic center of São Luís do Maranhão (Brazil): an approximation of the mineralogy and firing temperature of the raw materials

Nesse trabalho, foram caracterizados, pela primeira vez, azulejos históricos portugueses do Centro Histórico de São Luís (CHSL) do Maranhão. A caracterização foi realizada através dos ensaios de microscopia ótica, difração de raios X (DRX) e análise química, visando ao uso dessa informação para a determinação das possíveis matérias-primas utilizadas na sua fabricação, bem como a provável temperatura de queima desses materiais. Os resultados mostraram que a microestrutura desses materiais é constituída por poros de tamanhos variados, apresentando incrustações de calcita e grãos de quartzo de tamanhos inferiores a 500 µm, distribuídos numa matriz de cor rosa-amarelo, onde foram identificadas, por DRX, as fases minerais calcita, gelhenita, wollastonita, quartzo e amorfo. A partir da informação obtida, é possível inferir que as matérias-primas originais estiveram constituídas, provavelmente, por mistura de argilas caoliníticas (Al₂O₃•2SiO,₂•2H₂O), ricas em carbonatos de cálcio e quartzo ou misturas de argilas caoliniticas, quartzo e calcita. Essas matérias-primas originais não atingiram a temperatura de cocção de 950ºC.

Pareto Frontier for the time-energy cost vector to an Earth-Moon transfer orbit using the patched-conic approximation

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

A radial basis function network (RBFN) for function approximation

A radial basis function network (RBFN) circuit for function approximation is presented. Simulation and experimental results show that the network has good approximation capabilities. The RBFN was a squared hyperbolic secant with three adjustable parameters amplitude, width and center. To test the network a sinusoidal and sine function,vas approximated.

Comparative study between powers of sigmoid functions, MLP-backpropagation and polynomials in function approximation problems

Function approximation is a very important task in environments where the computation has to be based on extracting information from data samples in real world processes. So, the development of new mathematical model is a very important activity to guarantee the evolution of the function approximation area. In this sense, we will present the Polynomials Powers of Sigmoid (PPS) as a linear neural network. In this paper, we will introduce one series of practical results for the Polynomials Powers of Sigmoid, where we will show some advantages of the use of the powers of sigmiod functions in relationship the traditional MLP-Backpropagation and Polynomials in functions approximation problems.

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.