Ab initio study of MF2 (M=Mn, Fe, Co, Ni) rutile-type compounds using the periodic unrestricted Hartree-Fock approach

The ab initio periodic unrestricted Hartree-Fock method has been applied in the investigation of the ground-state structural, electronic, and magnetic properties of the rutile-type compounds MF2 (M=Mn, Fe, Co, and Ni). All electron Gaussian basis sets have been used. The systems turn out to be large band-gap antiferromagnetic insulators; the optimized geometrical parameters are in good agreement with experiment. The calculated most stable electronic state shows an antiferromagnetic order in agreement with that resulting from neutron scattering experiments. The magnetic coupling constants between nearest-neighbor magnetic ions along the [001], [111], and [100] (or [010]) directions have been calculated using several supercells. The resulting ab initio magnetic coupling constants are reasonably satisfactory when compared with available experimental data. The importance of the Jahn-Teller effect in FeF2 and CoF2 is also discussed.

Comparing Support Vector Machines with Gaussian Kernels to Radial Basis Function Classifiers

The Support Vector (SV) machine is a novel type of learning machine, based on statistical learning theory, which contains polynomial classifiers, neural networks, and radial basis function (RBF) networks as special cases. In the RBF case, the SV algorithm automatically determines centers, weights and threshold such as to minimize an upper bound on the expected test error. The present study is devoted to an experimental comparison of these machines with a classical approach, where the centers are determined by $k$--means clustering and the weights are found using error backpropagation. We consider three machines, namely a classical RBF machine, an SV machine with Gaussian kernel, and a hybrid system with the centers determined by the SV method and the weights trained by error backpropagation. Our results show that on the US postal service database of handwritten digits, the SV machine achieves the highest test accuracy, followed by the hybrid approach. The SV approach is thus not only theoretically well--founded, but also superior in a practical application.

An analytical relation between entropy production and quantum Lyapunov exponents for Gaussian bipartite systems

We study and compare the information loss of a large class of Gaussian bipartite systems. It includes the usual Caldeira-Leggett-type model as well as Anosov models ( parametric oscillators, the inverted oscillator environment, etc), which exhibit instability, one of the most important characteristics of chaotic systems. We establish a rigorous connection between the quantum Lyapunov exponents and coherence loss, and show that in the case of unstable environments coherence loss is completely determined by the upper quantum Lyapunov exponent, a behavior which is more universal than that of the Caldeira-Leggett-type model.

Approximations for the generalized temperature integral: a method based on quadrature rules

The generalized temperature integral I(m, x) appears in non-isothermal kinetic analysis when the frequency factor depends on the temperature. A procedure based on Gaussian quadrature to obtain analytical approximations for the integral I(m, x) was proposed. The results showed good agreement between the obtained approximation values and those obtained by numerical integration. Unless other approximations found in literature, the methodology presented in this paper can be easily generalized in order to obtain approximations with the maximum of accurate.

ANOTHER QUADRATURE RULE OF HIGHEST ALGEBRAIC DEGREE OF PRECISION

We consider certain quadrature rules of highest algebraic degree of precision that involve strong Stieltjes distributions (i.e., strong distributions on the positive real axis). The behavior of the parameters of these quadrature rules, when the distributions are strong c-inversive Stieltjes distributions, is given. A quadrature rule whose parameters have explicit expressions for their determination is presented. An application of this quadrature rule for the evaluation of a certain type of integrals is also given.

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.

Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

Migração 3-D Kirchhoff-Gaussian-Beam (KGB) pré-empilhamento no domínio da profundidade

O Feixe Gaussiano (FG) é uma solução assintótica da equação da elastodinâmica na vizinhança paraxial de um raio central, a qual se aproxima melhor do campo de ondas do que a aproximação de ordem zero da Teoria do Raio. A regularidade do FG na descrição do campo de ondas, assim como a sua elevada precisão em algumas regiões singulares do meio de propagação, proporciona uma forte alternativa na solução de problemas de modelagem e imageamento sísmicos. Nesta Tese, apresenta-se um novo procedimento de migração sísmica pré-empilhamento em profundidade com amplitudes verdadeiras, que combina a flexibilidade da migração tipo Kirchhoff e a robustez da migração baseada na utilização de Feixes Gaussianos para a representação do campo de ondas. O algoritmo de migração proposto é constituído por dois processos de empilhamento: o primeiro é o empilhamento de feixes (“beam stack”) aplicado a subconjuntos de dados sísmicos multiplicados por uma função peso definida de modo que o operador de empilhamento tenha a mesma forma da integral de superposição de Feixes Gaussianos; o segundo empilhamento corresponde à migração Kirchhoff tendo como entrada os dados resultantes do primeiro empilhamento. Pelo exposto justifica-se a denominação migração Kirchhoff-Gaussian-Beam (KGB). As principais características que diferenciam a migração KGB, durante a realização do primeiro empilhamento, de outros métodos de migração que também utilizam a teoria dos Feixes Gaussianos, são o uso da primeira zona de Fresnel projetada para limitar a largura do feixe e a utilização, no empilhamento do feixe, de uma aproximação de segunda ordem do tempo de trânsito de reflexão. Como exemplos são apresentadas aplicações a dados sintéticos para modelos bidimensionais (2-D) e tridimensionais (3-D), correspondentes aos modelos Marmousi e domo de sal da SEG/EAGE, respectivamente.

Análise do efeito da discretização do modelo de velocidades nas migrações Kirchhoff e Kirchhoff-Gaussian- Beam 2D pré-empilhamento em profundidade

O Feixe Gaussiano (FG) é uma solução assintótica da equação da elastodinâmica na vizinhança paraxial de um raio central, a qual se aproxima melhor do campo de ondas do que a aproximação de ordem zero da Teoria do Raio. A regularidade do FG na descrição do campo de ondas, assim como a sua elevada precisão em algumas regiões singulares do meio de propagação, proporciona uma forte alternativa no imageamento sísmicos. Nesta dissertação, apresenta-se um novo procedimento de migração sísmica pré-empilhamento em profundidade com amplitudes verdadeiras, que combina a flexibilidade da migração tipo Kirchhoff e a robustez da migração baseada na utilização de Feixes Gaussianos para a representação do campo de ondas. O algoritmo de migração proposto é constituído por dois processos de empilhamento: o primeiro é o empilhamento de feixes (“beam stack”) aplicado a subconjuntos de dados sísmicos multiplicados por uma função peso definida de modo que o operador de empilhamento tenha a mesma forma da integral de superposição de Feixes Gaussianos; o segundo empilhamento corresponde à migração Kirchhoff tendo como entrada os dados resultantes do primeiro empilhamento. Pelo exposto justifica-se a denominação migração Kirchhoff-Gaussian-Beam (KGB).Afim de comparar os métodos Kirchhoff e KGB com respeito à sensibilidade em relação ao comprimento da discretização, aplicamos no conjunto de dados conhecido como Marmousi 2-D quatro grids de velocidade, ou seja, 60m, 80m 100m e 150m. Como resultado, temos que ambos os métodos apresentam uma imagem muito melhor para o menor intervalo de discretização da malha de velocidade. O espectro de amplitude das seções migradas nos fornece o conteúdo de frequência espacial das seções das imagens obtidas.

Generalized Differential Quadrature Finite Element Method applied to Advanced Structural Mechanics

Over the years the Differential Quadrature (DQ) method has distinguished because of its high accuracy, straightforward implementation and general ap- plication to a variety of problems. There has been an increase in this topic by several researchers who experienced significant development in the last years. DQ is essentially a generalization of the popular Gaussian Quadrature (GQ) used for numerical integration functions. GQ approximates a finite in- tegral as a weighted sum of integrand values at selected points in a problem domain whereas DQ approximate the derivatives of a smooth function at a point as a weighted sum of function values at selected nodes. A direct appli- cation of this elegant methodology is to solve ordinary and partial differential equations. Furthermore in recent years the DQ formulation has been gener- alized in the weighting coefficients computations to let the approach to be more flexible and accurate. As a result it has been indicated as Generalized Differential Quadrature (GDQ) method. However the applicability of GDQ in its original form is still limited. It has been proven to fail for problems with strong material discontinuities as well as problems involving singularities and irregularities. On the other hand the very well-known Finite Element (FE) method could overcome these issues because it subdivides the computational domain into a certain number of elements in which the solution is calculated. Recently, some researchers have been studying a numerical technique which could use the advantages of the GDQ method and the advantages of FE method. This methodology has got different names among each research group, it will be indicated here as Generalized Differential Quadrature Finite Element Method (GDQFEM).

Remarks on methods for the computation of boundary-element integrals by co-ordinate transformation

It is well known that the evaluation of the influence matrices in the boundary-element method requires the computation of singular integrals. Quadrature formulae exist which are especially tailored to the specific nature of the singularity, i.e. log(*- x0)9 Ijx- JC0), etc. Clearly the nodes and weights of these formulae vary with the location Xo of the singular point. A drawback of this approach is that a given problem usually includes different types of singularities, and therefore a general-purpose code would have to include many alternative formulae to cater for all possible cases. Recently, several authors1"3 have suggested a type independent alternative technique based on the combination of standard Gaussian rules with non-linear co-ordinate transformations. The transformation approach is particularly appealing in connection with the p.adaptive version, where the location of the collocation points varies at each step of the refinement process. The purpose of this paper is to analyse the technique in eference 3. We show that this technique is asymptotically correct as the number of Gauss points increases. However, the method possesses a 'hidden' source of error that is analysed and can easily be removed.

A bound on the error in a general quadrature formula with equidistant ordinates /

"October 20, 1954"

Finite-size effects and error-free communication in Gaussian channels

The efficacy of a specially constructed Gallager-type error-correcting code to communication in a Gaussian channel is examined. The construction is based on the introduction of complex matrices, used in both encoding and decoding, which comprise sub-matrices of cascading connection values. The finite-size effects are estimated for comparing the results with the bounds set by Shannon. The critical noise level achieved for certain code rates and infinitely large systems nearly saturates the bounds set by Shannon even when the connectivity used is low.

Non-Gaussian distribution of collective operators in quantum spin chains

We numerically analyse the behavior of the full distribution of collective observables in quantum spin chains. While most of previous studies of quantum critical phenomena are limited to the first moments, here we demonstrate how quantum fluctuations at criticality lead to highly non-Gaussian distributions. Interestingly, we show that the distributions for different system sizes collapse on thesame curve after scaling for a wide range of transitions: first and second order quantum transitions and transitions of the Berezinskii–Kosterlitz–Thouless type. We propose and analyse the feasibility of an experimental reconstruction of the distribution using light–matter interfaces for atoms in optical lattices or in optical resonators.

Mucopolysaccharidosis Type Ii: Identification Of 30 Novel Mutations Among Latin American Patients.

In this study, 103 unrelated South-American patients with mucopolysaccharidosis type II (MPS II) were investigated aiming at the identification of iduronate-2-sulfatase (IDS) disease causing mutations and the possibility of some insights on the genotype-phenotype correlation The strategy used for genotyping involved the identification of the previously reported inversion/disruption of the IDS gene by PCR and screening for other mutations by PCR/SSCP. The exons with altered mobility on SSCP were sequenced, as well as all the exons of patients with no SSCP alteration. By using this strategy, we were able to find the pathogenic mutation in all patients. Alterations such as inversion/disruption and partial/total deletions of the IDS gene were found in 20/103 (19%) patients. Small insertions/deletions/indels (<22 bp) and point mutations were identified in 83/103 (88%) patients, including 30 novel mutations; except for a higher frequency of small duplications in relation to small deletions, the frequencies of major and minor alterations found in our sample are in accordance with those described in the literature.