A finite element model of magnetization of superconducting bulks using a solid-state flux pump

Superconductors have a bright future; they are able to carry very high current densities, switch rapidly in electronic circuits, detect extremely small perturbations in magnetic fields, and sustain very high magnetic fields. Of most interest to large-scale electrical engineering applications are the ability to carry large currents and to provide large magnetic fields. There are many projects that use the first property, and these have concentrated on power generation, transmission, and utilization; however, there are relatively few, which are currently exploiting the ability to sustain high magnetic fields. The main reason for this is that high field wound magnets can and have been made from both BSCCO and YBCO, but currently, their cost is much higher than the alternative provided by low-Tc materials such as Nb3Sn and NbTi. An alternative form of the material is the bulk form, which can be magnetized to high fields. This paper explains the mechanism, which allows superconductors to be magnetized without the need for high field magnets to perform magnetization. A finite-element model is presented, which is based on the E-J current law. Results from this model show how magnetization of the superconductor builds up cycle upon cycle when a traveling magnetic wave is induced above the superconductor. © 2011 IEEE.

Aromaticity on the fly: cyclic transition state stabilization at finite temperature.

We study the transition state of pericyclic reactions at elevated temperature with unbiased ab initio molecular dynamics. We find that the transition state of the intramolecular rearrangements for barbaralane and bullvalene remains aromatic at high temperature despite the significant thermal atomic motions. Structural, magnetic, and electronic properties of the dynamical transition state show the concertedness and aromatic character. Free-energy calculations also support the validity of the transition state theory for the present rearrangement reactions. The calculations demonstrate that cyclic delocalization represents a strong force to synchronize the thermal atomic motions even at high temperatures.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

Hot Nuclear Matter Equation of State and Finite Temperature Kaon Condensation

We perform a systematic calculation of the equation of state of asymmetric nuclear matter at finite temperature within the framework of the Brueckner-Hartree-Fock approach with a microscopic three-body force. When applying it to the study of hotka on condensed matter, we find that the thermal effect is more profound in comparison with normal matter, in particular around the threshold density. Also, the increase of temperature makes the equation of state slightly stiffer through suppression of kaon condensation.

Ergodicity and Mixing Rate of One-Dimensional Cellular Automata

One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. The latter either have large noise probability ε or belong to the small family of two-state nearest-neighbor monotonic rules which includes local majority voting. For a certain simple automaton L called the soldiers rule, this problem has intrigued researchers for the last two decades since L is clearly more robust than local voting: in the absence of noise, L eliminates any finite island of perturbation from an initial configuration of all 0's or all 1's. The same holds for a 4-state monotonic variant of L, K, called two-line voting. We will prove that the probabilistic cellular automata Kε and Lε asymptotically lose all information about their initial state when subject to small, strongly biased noise. The mixing property trivially implies that the systems are ergodic. The finite-time information-retaining quality of a mixing system can be represented by its relaxation time Relax(⋅), which measures the time before the onset of significant information loss. This is known to grow as (1/ε)^c for noisy local voting. The impressive error-correction ability of L has prompted some researchers to conjecture that Relax(Lε) = 2^(c/ε). We prove the tight bound 2^(c1log^21/ε) ＜ Relax(Lε) ＜ 2^(c2log^21/ε) for a biased error model. The same holds for Kε. Moreover, the lower bound is independent of the bias assumption. The strong bias assumption makes it possible to apply sparsity/renormalization techniques, the main tools of our investigation, used earlier in the opposite context of proving fault-tolerance.

Finite groups and geometries: a view on the present state and on the future

The model: groups of Lie-Chevalley type and buildingsThis paper is not the presentation of a completed theory but rather a report on a search progressing as in the natural sciences in order to better understand the relationship between groups and incidence geometry, in some future sought-after theory Τ. The search is based on assumptions and on wishes some of which are time-dependent, variations being forced, in particular, by the search itself.A major historical reference for this subject is, needless to say, Klein's Erlangen Programme. Klein's views were raised to a powerful theory thanks to the geometric interpretation of the simple Lie groups due to Tits (see for instance), particularly his theory of buildings and of groups with a BN-pair (or Tits systems). Let us briefly recall some striking features of this.Let G be a group of Lie-Chevalley type of rank r, denned over GF(q), q = pn, p prime. Let Xr denote the Dynkin diagram of G. To these data corresponds a unique thick building B(G) of rank r over the Coxeter diagram Xr (assuming we forget arrows provided by the Dynkin diagram). It turns out that B(G) can be constructed in a uniform way for all G, from a fixed p-Sylow subgroup U of G, its normalizer NG(U) and the r maximal subgroups of G containing NG(U).

Effect of the crown design and interface lute parameters on the stress-state of a machined crown-tooth system: A finite element analysis

The effect of preparation design and the physical properties of the interface lute on the restored machined ceramic crown-tooth complex are poorly understood. The aim of this work was to determine, by means of three-dimensional finite element analysis (3D FEA) the effect of the tooth preparation design and the elastic modulus of the cement on the stress state of the cemented machined ceramic crown-tooth complex. The three-dimensional structure of human premolar teeth, restored with adhesively cemented machined ceramic crowns, was digitized with a micro-CT scanner. An accurate, high resolution, digital replica model of a restored tooth was created. Two preparation designs, with different occlusal morphologies, were modeled with cements of 3 different elastic moduli. Interactive medical image processing software (mimics and professional CAD modeling software) was used to create sophisticated digital models that included the supporting structures; periodontal ligament and alveolar bone. The generated models were imported into an FEA software program (hypermesh version 10.0, Altair Engineering Inc.) with all degrees of freedom constrained at the outer surface of the supporting cortical bone of the crown-tooth complex. Five different elastic moduli values were given to the adhesive cement interface 1.8 GPa, 4 GPa, 8 GPa, 18.3 GPa and 40 GPa; the four lower values are representative of currently used cementing lutes and 40 GPa is set as an extreme high value. The stress distribution under simulated applied loads was determined. The preparation design demonstrated an effect on the stress state of the restored tooth system. The cement elastic modulus affected the stress state in the cement and dentin structures but not in the crown, the pulp, the periodontal ligament or the cancellous and cortical bone. The results of this study suggest that both the choice of the preparation design and the cement elastic modulus can affect the stress state within the restored crown-tooth complex.

Average ground-state energy of finite Fermi systems

Semiclassical theories such as the Thomas-Fermi and Wigner-Kirkwood methods give a good description of the smooth average part of the total energy of a Fermi gas in some external potential when the chemical potential is varied. However, in systems with a fixed number of particles N, these methods overbind the actual average of the quantum energy as N is varied. We describe a theory that accounts for this effect. Numerical illustrations are discussed for fermions trapped in a harmonic oscillator potential and in a hard-wall cavity, and for self-consistent calculations of atomic nuclei. In the latter case, the influence of deformations on the average behavior of the energy is also considered.

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.