A new approach to the electronic structure of two dimensional disordered alloys

We propose a novel method to calculate the electronic Density of States (DOS) of a two dimensional disordered binary alloy. The method is highly reliable and numerically efficient, and Short Range Order (SRO) correlations can be included with no extra computational cost. The approach devised rests on one dimensional calculations and is applied to very long stripes of finite width, the bulk regime being achieved with a relatively small number of chains in the disordered case. Our approach is exact for the pure case and predicts the correct DOS structure in important limits, such as the segregated, random, and ordered alloy regimes. We also suggest important extensions of the present work. © 1995.

Caos e termalização na teoria de Yang-Mills-Higgs em uma rede espacial

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

Perfil de aptidão cardiorrespiratória em corredores jovens pela cinética do VO2 em testes progressivos e retangulares

Pós-graduação em Desenvolvimento Humano e Tecnologias - IBRC

Complex modal analysis of a vertical rotor through finite element method

Natural frequencies were analyzed (axial, torsional and flexural) and frequency response of a vertical rotor with a hard disk at the edge through the classical and complex modal analysis. The mathematical modeling was based on the theory of Euler-Bernoulli beam. The equation that rules the movement was obtained through the Lagrangian formulation. The model considered the effects of bending, torsion and axial deformation of the shaft, besides the gravitational and gyroscopic effects. The finite element method was used to discretize the structure into hollow cylindrical elements with 12 degrees of freedom. Mass, stiffness and gyroscopic matrices were explained consistently. This type of tool, based on the use of complex coordinates to describe the dynamic behavior of rotating shaft, allows the decomposition of the system in two submodes, backward and forward. Thus, it is possible to clearly visualize that the orbit and direction of the precessional motion around the line of the rotating shaft is not deformed. A finite element program was developed using Matlab ®, and numerical simulations were performed to validate this model.

Correntes críticas e comportamento dinâmico dos vórtices em fitas supercondutoras do tipo II com arranjos conformes de centros de aprisionamento

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A Comparison of Induction Motor Starting Methods Being Powered by a Diesel-Generator Set

Starting induction motors on isolated or weak systems is a highly dynamic process that can cause motor and load damage as well as electrical network fluctuations. Mechanical damage is associated with the high starting current drawn by a ramping induction motor. In order to compensate the load increase, the voltage of the electrical system decreases. Different starting methods can be applied to the electrical system to reduce these and other starting method issues. The purpose of this thesis is to build accurate and usable simulation models that can aid the designer in making the choice of an appropriate motor starting method. The specific case addressed is the situation where a diesel-generator set is used as the electrical supplied source to the induction motor. The most commonly used starting methods equivalent models are simulated and compared to each other. The main contributions of this thesis is that motor dynamic impedance is continuously calculated and fed back to the generator model to simulate the coupling of the electrical system. The comparative analysis given by the simulations has shown reasonably similar characteristics to other comparative studies. The diesel-generator and induction motor simulations have shown good results, and can adequately demonstrate the dynamics for testing and comparing the starting methods. Further work is suggested to refine the equivalent impedance presented in this thesis.

Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.

Generalizing the dynamic field theory of spatial cognition across real and developmental time scales

Within cognitive neuroscience, computational models are designed to provide insights into the organization of behavior while adhering to neural principles. These models should provide sufficient specificity to generate novel predictions while maintaining the generality needed to capture behavior across tasks and/or time scales. This paper presents one such model, the Dynamic Field Theory (DFT) of spatial cognition, showing new simulations that provide a demonstration proof that the theory generalizes across developmental changes in performance in four tasks—the Piagetian A-not-B task, a sandbox version of the A-not-B task, a canonical spatial recall task, and a position discrimination task. Model simulations demonstrate that the DFT can accomplish both specificity—generating novel, testable predictions—and generality—spanning multiple tasks across development with a relatively simple developmental hypothesis. Critically, the DFT achieves generality across tasks and time scales with no modification to its basic structure and with a strong commitment to neural principles. The only change necessary to capture development in the model was an increase in the precision of the tuning of receptive fields as well as an increase in the precision of local excitatory interactions among neurons in the model. These small quantitative changes were sufficient to move the model through a set of quantitative and qualitative behavioral changes that span the age range from 8 months to 6 years and into adulthood. We conclude by considering how the DFT is positioned in the literature, the challenges on the horizon for our framework, and how a dynamic field approach can yield new insights into development from a computational cognitive neuroscience perspective.

Correntes críticas e comportamento dinâmico dos vórtices em fitas supercondutoras do tipo II com arranjos conformes de centros de aprisionamento

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A note on permutation regularity

The existence of a small partition of a combinatorial structure into random-like subparts, a so-called regular partition, has proven to be very useful in the study of extremal problems, and has deep algorithmic consequences. The main result in this direction is the Szemeredi Regularity Lemma in graph theory. In this note, we are concerned with regularity in permutations: we show that every permutation of a sufficiently large set has a regular partition into a small number of intervals. This refines the partition given by Cooper (2006) [10], which required an additional non-interval exceptional class. We also introduce a distance between permutations that plays an important role in the study of convergence of a permutation sequence. (C) 2011 Elsevier B.V. All rights reserved.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.

A complex networks approach for data clustering

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate. (C) 2012 Elsevier B.V. All rights reserved.

Solvability near the characteristic set for a special class of complex vector fields

This work deals with the solvability near the characteristic set Sigma = {0} x S-1 of operators of the form L = partial derivative/partial derivative t+(x(n) a(x)+ ix(m) b(x))partial derivative/partial derivative x, b not equivalent to 0 and a(0) not equal 0, defined on Omega(epsilon) = (-epsilon, epsilon) x S-1, epsilon > 0, where a and b are real-valued smooth functions in (-epsilon, epsilon) and m >= 2n. It is shown that given f belonging to a subspace of finite codimension of C-infinity (Omega(epsilon)) there is a solution u is an element of L-infinity of the equation Lu = f in a neighborhood of Sigma; moreover, the L-infinity regularity is sharp.

Partially Observed Markov Random Fields Are Variable Neighborhood Random Fields

The present paper has two goals. First to present a natural example of a new class of random fields which are the variable neighborhood random fields. The example we consider is a partially observed nearest neighbor binary Markov random field. The second goal is to establish sufficient conditions ensuring that the variable neighborhoods are almost surely finite. We discuss the relationship between the almost sure finiteness of the interaction neighborhoods and the presence/absence of phase transition of the underlying Markov random field. In the case where the underlying random field has no phase transition we show that the finiteness of neighborhoods depends on a specific relation between the noise level and the minimum values of the one-point specification of the Markov random field. The case in which there is phase transition is addressed in the frame of the ferromagnetic Ising model. We prove that the existence of infinite interaction neighborhoods depends on the phase.

Anderson-like Transition for a Class of Random Sparse Models in d >= 2 Dimensions

We show that the Kronecker sum of d >= 2 copies of a random one-dimensional sparse model displays a spectral transition of the type predicted by Anderson, from absolutely continuous around the center of the band to pure point around the boundaries. Possible applications to physics and open problems are discussed briefly.