Validity of the minisuperspace approximation: An example from interacting quantum field theory
Sinha, S.; Hu, B.L. )
1991-08-15
We examine the question of the validity of the minisuperspace approximation using the example of an interacting ({lambda}{Phi}{sup 4}) scalar field in a closed Robertson-Walker universe, where the scale factor and the homogeneous mode of the scalar field model the minisuperspace degrees of freedom. We explicitly compute the back reaction of the inhomogeneous modes on the minisuperspace sector using a coarse-grained effective action and show that the minisuperspace approximation is valid only when this back reaction is small.
Minisuperspace models as infrared contributions
NASA Astrophysics Data System (ADS)
Bojowald, Martin; Brahma, Suddhasattwa
2016-06-01
A direct correspondence of quantum mechanics as a minisuperspace model for a self-interacting scalar quantum-field theory is established by computing, in several models, the infrared contributions to 1-loop effective potentials of Coleman-Weinberg type. A minisuperspace approximation rather than truncation is thereby obtained. By this approximation, the spatial averaging scale of minisuperspace models is identified with an infrared scale (but not a regulator or cutoff) delimiting the modes included in the minisuperspace model. Some versions of the models studied here have discrete space or modifications of the Hamiltonian expected from proposals of loop quantum gravity. They shed light on the question of how minisuperspace models of quantum cosmology can capture features of full quantum gravity. While it is shown that modifications of the Hamiltonian can be well described by minisuperspace truncations, some related phenomena such as signature change, confirmed and clarified here for modified scalar field theories, require at least a perturbative treatment of inhomogeneity beyond a strict minisuperspace model. The new methods suggest a systematic extension of minisuperspace models by a canonical effective formulation of perturbative inhomogeneity.
Geometry of minisuperspace in examples
NASA Astrophysics Data System (ADS)
Kerbrat, Yvan; Kerbrat-Lunc, Hélène; Śniatycki, Jȩdrzej
1992-04-01
Minisuperspace, interpreted as the configuration space for homogeneous cosmologies, has a naturally defined pseudo-Riemannian metric (supermetric) such that solutions of the ADM equations correspond to geodesics of the supermetric parametrized by arc-length (supertime). The supermetric is used to analyse the geometry of minisuperspace. In particular, if the supermetric is incomplete, its prolongations relate different components of minisuperspace. For Robertson-Walker universes with a homogeneous scalar field there exists a C1 prolongation of supermetric relating the positive and the negative curvature models. If the potential vanishes, then this prolongation is C∞. There is no prolongation of supermetric through generic boundary points between the Bianchi VIII and Bianchi IX models.
Anisotropic invariance in minisuperspace models
NASA Astrophysics Data System (ADS)
Chagoya, Javier; Sabido, Miguel
2016-06-01
In this paper we introduce invariance under anisotropic transformations to cosmology. This invariance is one of the key ingredients of the theory of quantum gravity at a Lifshitz point put forward by Hořava. We find that this new symmetry in the minisuperspace introduces characteristics to the model that can be relevant in the ultraviolet regime. For example, by canonical quantization we find a Schrödinger-type equation which avoids the problem of frozen time in quantum cosmology. For simple cases we obtain solutions to this quantum equation in a Kantowski-Sachs (KS) minisuperspace. At the classical level, we study KS and Friedmann-Robertson-Walker cosmologies, obtaining modifications to the solutions of general relativity that can be relevant in the early Universe.
Minisuperspace models of discrete systems
NASA Astrophysics Data System (ADS)
Baytaş, Bekir; Bojowald, Martin
2017-04-01
A discrete quantum spin system is presented in which several modern methods of canonical quantum gravity can be tested with promising results. In particular, features of interacting dynamics are analyzed with an emphasis on homogeneous configurations and the dynamical building-up and stability of long-range correlations. Different types of homogeneous minisuperspace models are introduced for the system, including one based on condensate states, and shown to capture different aspects of the discrete system. They are evaluated with effective methods and by means of continuum limits, showing good agreement with operator calculations whenever the latter are available. As a possibly quite general result, it is concluded that an analysis of the building-up of long-range correlations in discrete systems requires nonperturbative solutions of the dynamical equations. Some questions related to stability can be analyzed perturbatively but suggest that matter couplings may be relevant for this question in the context of quantum cosmology.
Tunneling in perfect-fluid (minisuperspace) quantum cosmology
Brown, J.D. )
1990-02-15
A minisuperspace model of general relativity with a positive cosmological constant coupled to a perfect isentropic fluid is presented. The classical equations of motion are solved for a tunneling solution that consists of a Euclidean instanton of the wormhole type, connected to Lorentzian Robertson-Walker universes. The path integral is then defined as a sum over Lorentzian geometries and it is shown that the tunneling solution dominates the semiclassical evaluation of the path integral.
Quantum simulation of gravitational-like waves in minisuperspace with an artificial qubit
NASA Astrophysics Data System (ADS)
Zhang, Ze-Lin; Chen, Ming-Feng; Wu, Huai-Zhi; Yang, Zhen-Biao
2017-02-01
On the background of the Born-Oppenheimer (adiabatic) approximation, we investigate the geometrical and topological structure in the theory of quantum gravity by using the path integral method and half-classical approximation. As we know, Berry curvature can be extracted from the linear response of a driven two-level system to nonadiabatic manipulations of its Hamiltonian. In parameter space of the Hamiltonian, magnetic monopoles can be artificially simulated. Ripples occur in Hilbert space when the monopole travels from inside to outside the surface of energy manifold spanned by system parameters. From this point of view, we set up the connection between the ripples characterized by the fidelity of quantum states in Hilbert space and gravitational-like waves in minisuperspace. This might open a window for the study of geometrical and topological properties of quantum gravity with the help of quantum physical systems.
BRST symmetry for Regge-Teitelboim-based minisuperspace models
NASA Astrophysics Data System (ADS)
Upadhyay, Sudhaker; Paul, Biswajit
2016-07-01
The Einstein-Hilbert action in the context of higher derivative theories is considered for finding their BRST symmetries. Being a constraint system, the model is transformed in the minisuperspace language with the FRLW background and the gauge symmetries are explored. Exploiting the first order formalism developed by Banerjee et al. the diffeomorphism symmetry is extracted. From the general form of the gauge transformations of the field, the analogous BRST transformations are calculated. The effective Lagrangian is constructed by considering two gauge-fixing conditions. Further, the BRST (conserved) charge is computed, which plays an important role in defining the physical states from the total Hilbert space of states. The finite field-dependent BRST formulation is also studied in this context where the Jacobian for the functional measure is illustrated specifically.
Minisuperspaces with conformally and minimally coupled scalar fields
NASA Astrophysics Data System (ADS)
Page, Don N.
1991-12-01
One may perform a local field redefinition to transform between gravity minimally coupled to a free scalar field and gravity conformally coupled. However, the allowed field values differ in the two cases. For a minisuperspace consisting of a Friedman-Robertson-Walker geometry and a homogeneous scalar field, the conformal coupling allows a more general class of solutions of the Wheeler-DeWitt equation than does the minimal coupling. Nevertheless, there is a one-to-one correspondence between the bounded solutions in the two cases for k=1. This correspondence exploits an isomorphism between harmonic oscillator wavefunctions and solutions of the massive Klein-Gordon equation in the 1+1 dimensional Rindler wedge.
SymPy: Symbolic computing in python
Muller, Richard P.; Meurer, Aaron; Certik, Ondrej; Moore, Jason K.; Bonazzi, Francesco; Vats, Shivam; Kumar, Amit; Gupta, Harsh; Fernando, Isuru; Saboo, Ashutosh; Singh, Sartaj; Johansson, Fredrik; Rathnayake, Thilina; Pedregosa, Fabian; Scopatz, Anthony; Granger, Brian E.; Cimrman, Robert
2016-05-01
Here, SymPy is a full featured computer algebra system (CAS) written in the Python programming language. It is open source, being licensed under the extremely permissive 3-clause BSD license. SymPy was started by Ondrej Certik in 2005, and it has since grown into a large open source project, with over 500 contributors.
SymPy: Symbolic computing in python
Meurer, Aaron; Smith, Christopher P.; Paprocki, Mateusz; ...
2017-01-02
Here, SymPy is a full featured computer algebra system (CAS) written in the Python programming language. It is open source, being licensed under the extremely permissive 3-clause BSD license. SymPy was started by Ondrej Certik in 2005, and it has since grown into a large open source project, with over 500 contributors.
SymPy: Symbolic computing in python
Muller, Richard P.; Meurer, Aaron; Certik, Ondrej; ...
Here, SymPy is a full featured computer algebra system (CAS) written in the Python programming language. It is open source, being licensed under the extremely permissive 3-clause BSD license. SymPy was started by Ondrej Certik in 2005, and it has since grown into a large open source project, with over 500 contributors.
NLO evolution of color dipoles in N=4 SYM
Chirilli, Giovanni A.; Balitsky, Ian
2009-07-04
Here, high-energy behavior of amplitudes in a gauge theory can be reformulated in terms of the evolution of Wilson-line operators. In the leading logarithmic approximation it is given by the conformally invariant BK equation for the evolution of color dipoles. In QCD, the next-to-leading order BK equation has both conformal and non-conformal parts, the latter providing the running of the coupling constant. To separate the conformally invariant effects from the running-coupling effects, we calculate the NLO evolution of the color dipoles in the conformal ${\\cal N}$=4 SYM theory. We define the "composite dipole operator" with the rapidity cutoff preserving conformal invariance.
Minisuperspace model of Machian resolution of Problem of Time. I. Isotropic case
NASA Astrophysics Data System (ADS)
Anderson, Edward
2014-05-01
A local resolution to the Problem of Time that is Machian and was previously demonstrated for relational mechanics models is here shown to work for a more widely studied quantum cosmological model. I.e., closed isotropic minisuperspace GR with minimally coupled scalar field matter. This resolution uses work firstly along the lines of Barbour's at the classical level. Secondly, it uses a Machianized version of the semiclassical approach to quantum cosmology (the resolution given is not more than semiclassical). Finally, it uses a Machianized version of a combined semiclassical histories timeless records scheme along the lines of Halliwell's work. This program's goal is the treatment of inhomogeneous perturbations about the present paper's model. This draws both from this paper's minisuperspace work and from qualitative parallels with relational particle mechanics, since both have nontrivial notions of inhomogeneity/structure (clumping) as well as nontrivial linear constraints.
Directed construction and analysis of a Sinorhizobium meliloti pSymA deletion mutant library.
Yurgel, Svetlana N; Mortimer, Michael W; Rice, Jennifer T; Humann, Jodi L; Kahn, Michael L
2013-03-01
Resources from the Sinorhizobium meliloti Rm1021 open reading frame (ORF) plasmid libraries were used in a medium-throughput method to construct a set of 50 overlapping deletion mutants covering all of the Rm1021 pSymA megaplasmid except the replicon region. Each resulting pSymA derivative carried a defined deletion of approximately 25 ORFs. Various phenotypes, including cytochrome c respiration activity, the ability of the mutants to grow on various carbon and nitrogen sources, and the symbiotic effectiveness of the mutants with alfalfa, were analyzed. This approach allowed us to systematically evaluate the potential impact of regions of Rm1021 pSymA for their free-living and symbiotic phenotypes.
Phase structure of mathcal{N} = 2* SYM on ellipsoids
NASA Astrophysics Data System (ADS)
Marmiroli, Daniele
2016-06-01
We analyse the phase structure of an mathcal{N} = 2 massive deformation of mathcal{N} = 4 SYM theory on a four-dimensional ellipsoid using recent results on supersymmetric localisation. Besides the 't Hooft coupling λ, the relevant parameters appearing in the theory and discriminating between the different phases are the hypermultiplet mass M and the deformation (or squashing) parameter Q. Geometric deformation manifests itself as an effective mass term, thus braking the conformal invariance of the theory with massless hypermultiplets. The structure of perturbative corrections around the spherical geometry is analysed in the details and a systematic computational procedure is given, together with the first few corrections. The master field approximation of the matrix model associated to the analytically continued theory in the regime Q 2 M and on the compact space is exactly solvable and does not display any phase transition, similarly to mathcal{N} = 2 SU ( N) SYM with 2 N massive hypermultiplets. In the strong coupling limit, equivalent in our settings to the decompactification of the four-dimensional ellipsoid, we find evidence that the theory undergoes an infinite number of phase transitions starting at finite coupling and accumulating at λ = 8. Quite interestingly, the threshold points at which transitions occur can be pushed towards the weak coupling region by drifting Q to the value 2 M.
Spacetime condensation in (2+1)-dimensional CDT from a Hořava-Lifshitz minisuperspace model
NASA Astrophysics Data System (ADS)
Benedetti, Dario; Henson, Joe
2015-11-01
A spacetime condensation phenomenon underlies the emergence of a macroscopic Universe in causal dynamical triangulations, where the time extension of the condensate is strictly smaller than the total time. It has been known for some time that the volumes of spatial slices in the bulk of the macroscopic Universe follow a time evolution which resembles that of a sphere, and their effective dynamics is well described by a minisuperspace reduction of the general relativistic action. More recently, it has been suggested that the same minusuperspace model can also provide an understanding of the condensation phenomenon itself, thus explaining the presence of an extended droplet of spacetime connected to a stalk of minimal spatial extension. We show here that a minisuperspace model based on the general relativistic action fails in that respect for the (2+1)-dimensional case, while a successful condensation is obtained from a minisuperspace model of Hořava-Lifshitz gravity.
Margolin, W; Long, S R
1993-01-01
A 4-kb fragment active as an autonomously replicating sequence (ARS) from the Rhizobium meliloti symbiotic megaplasmid pSym-b was isolated by selecting for sequences that allowed a normally nonreplicative pBR322 derivative to replicate in R. meliloti. The resulting Escherichia coli-R. meliloti shuttle plasmid (mini-pSym-b) containing the ARS also replicated in the closely related Agrobacterium tumefaciens, but only in strains carrying pSym-b, suggesting that a megaplasmid-encoded trans-acting factor is required. The copy number of mini-pSym-b was approximately the same as that of the resident megaplasmid, and mini-pSym-b was unstable in the absence of antibiotic selection. An 0.8-kb DNA subfragment was sufficient for replication in both R. meliloti and A. tumefaciens. The minimal ARS exhibited several sequence motifs common to other replication origins, such as an AT-rich region, three potential DnA binding sites, a potential 13-mer sequence, and several groups of short direct repeats. Hybridization experiments indicated that there may be a related ARS on the other megaplasmid, pSym-a. The pSym-b ARS was mapped near exoA, within a region nonessential for pSym-b replication. These results suggest that the R. meliloti megaplasmids share conserved replication origins and that pSym-b contains multiple replication origins. Since the mini-pSym-b shuttle vector can coexist with IncP-1 broad-host-range plasmids, it is also now possible to use two compatible plasmids for cloning and genetic manipulation in R. meliloti. Images PMID:8407832
NLO evolution of color dipoles in N=4 SYM
Chirilli, Giovanni A.; Balitsky, Ian
2009-07-04
Here, high-energy behavior of amplitudes in a gauge theory can be reformulated in terms of the evolution of Wilson-line operators. In the leading logarithmic approximation it is given by the conformally invariant BK equation for the evolution of color dipoles. In QCD, the next-to-leading order BK equation has both conformal and non-conformal parts, the latter providing the running of the coupling constant. To separate the conformally invariant effects from the running-coupling effects, we calculate the NLO evolution of the color dipoles in the conformalmore » $${\\cal N}$$=4 SYM theory. We define the "composite dipole operator" with the rapidity cutoff preserving conformal invariance.« less
NLO evolution of color dipoles in N=4 SYM
Balitsky, Ian; Chirilli, Giovanni
2009-01-01
High-energy behavior of amplitudes in a gauge theory can be reformulated in terms of the evolution of Wilson-line operators. In the leading logarithmic approximation it is given by the conformally invariant BK equation for the evolution of color dipoles. In QCD, the next-to-leading order BK equation has both conformal and non-conformal parts, the latter providing the running of the coupling constant. To separate the conformally invariant effects from the running-coupling effects, we calculate the NLO evolution of the color dipoles in the conformal ${\\cal N}$=4 SYM theory. We define the ``composite dipole operator' with the rapidity cutoff preserving conformal invariance. The resulting M\\"obius invariant kernel agrees with the forward NLO BFKL calculation of Ref. 1
Correlation functions of the chiral stress-tensor multiplet in SYM
NASA Astrophysics Data System (ADS)
Chicherin, Dmitry; Doobary, Reza; Eden, Burkhard; Heslop, Paul; Korchemsky, Gregory P.; Mason, Lionel; Sokatchev, Emery
2015-06-01
We give a new method for computing the correlation functions of the chiral part of the stress-tensor supermultiplet that relies on the reformulation of SYM in twistor space. It yields the correlation functions in the Born approximation as a sum of Feynman diagrams on twistor space that involve only propagators and no integration vertices. We use this unusual feature of the twistor Feynman rules to compute the correlation functions in terms of simple building blocks which we identify as a new class of off-shell superconformal invariants. Making use of the duality between correlation functions and planar scattering amplitudes, we demonstrate that these invariants represent an off-shell generalisation of the on-shell invariants defining tree-level scattering amplitudes in SYM.
Feng, Zimin; Sun, Qing-feng; Wan, Langhui; Guo, Hong
2011-10-19
We report the development and an application of a symbolic tool, called SymGF, for analytical derivations of quantum transport properties using the Keldysh nonequilibrium Green's function (NEGF) formalism. The inputs to SymGF are the device Hamiltonian in the second quantized form, the commutation relation of the operators and the truncation rules of the correlators. The outputs of SymGF are the desired NEGF that appear in the transport formula, in terms of the unperturbed Green's function of the device scattering region and its coupling to the device electrodes. For complicated transport analysis involving strong interactions and correlations, SymGF provides significant assistance in analytical derivations. Using this tool, we investigate coherent quantum transport in a double quantum dot system where strong on-site interaction exists in the side-coupled quantum dot. Results obtained by the higher-order approximation and Hartree-Fock approximation are compared. The higher-order approximation reveals Kondo resonance features in the density of states and conductances. Results are compared both qualitatively and quantitatively to the experimental data reported in the literature.
Chiral 2D "strange metals" from SYM
NASA Astrophysics Data System (ADS)
Berkooz, Micha; Narayan, Prithvi; Zait, Amir
2015-01-01
Familiar field theories may contain closed subsectors made out of only fermions, which can be used to explore new and unusual phases of matter in lower dimensions. We focus on the fermionic su(1, 1) sector in SYM and on its ground states, which are Fermi surface states/operators. By computing their spectrum to order ( g {YM/2} N)2, we argue that fluctuations around this Fermi surface, within the sector and in the limit k F → ∞, are governed by a chiral 1+1 dimensional sector of the "strange metal" coset SU( N ) N ⊗ SU( N ) N /SU( N )2 N . On the gravity side, the conjectured dual configuration is an S = 0 degeneration of a rotating black hole. On general grounds we expect that the near horizon excitations of ( S = 0, Ω = 1, J → ∞) degenerations of black holes will be governed by a chiral sector of a 1+1 CFT.
Enhancing pilot performance with a SymBodic system.
Karlen, Walter; Cardin, Sylvain; Thalmann, Daniel; Floreano, Dario
2010-01-01
Increased fatigue of pilots during long flights can place both humans and machine at high risk. In this paper, we describe our research on a SymBodic (SYMbiotic BODies) system designed to minimize pilot fatigue in a simulated 48 hour mission. The system detected the pilot's sleep breaks and used this information to plan future sleep breaks. When fatigue could not be prevented, the SymBodic system assisted the pilot by providing relevant flight information through a vibro-tactile vest. Experiments showed that it was difficult for the pilot to adapt to the suggested sleep schedule within the duration of the experiment, and fatigue was not avoided. However, during periods of severe sleep deprivation, the SymBodic system significantly improved piloting performance.
Observables in the Guarino-Jafferis-Varela/CS-SYM duality
NASA Astrophysics Data System (ADS)
Araujo, Thiago R.; Nastase, Horatiu
2017-07-01
We study various semiclassical observables in the duality proposed by Guarino, Jafferis and Varela, between a warped AdS 4× squashed S 6 gravitational solution and a 3 dimensional N=2 SYM-{CS}_k conformal gauge theory, deformed from the maximal SU( N) N=8SYM . Baryonverticescorrespondingtoparticle-likebraneshaveunusualbehaviour with N and k and present strong evidence for a certain level-rank duality. Wilson loops and the anomalous dimensions of operators of high spin scale like ( N/k)3/2. The entanglement entropy behaves like in a usual CFT. Giant magnon operators obey the same law as in 4 dimensional N=4 SYM , and giant gravitons are also sub-determinant operators.
Ivanova, Kira A; Tsyganova, Anna V; Brewin, Nicholas J; Tikhonovich, Igor A; Tsyganov, Viktor E
2015-11-01
Rhizobia are able to establish a beneficial interaction with legumes by forming a new organ, called the symbiotic root nodule, which is a unique ecological niche for rhizobial nitrogen fixation. Rhizobial infection has many similarities with pathogenic infection and induction of defence responses accompanies both interactions, but defence responses are induced to a lesser extent during rhizobial infection. However, strong defence responses may result from incompatible interactions between legumes and rhizobia due to a mutation in either macro- or microsymbiont. The aim of this research was to analyse different plant defence reactions in response to Rhizobium infection for several pea (Pisum sativum) mutants that result in ineffective symbiosis. Pea mutants were examined by histochemical and immunocytochemical analyses, light, fluorescence and transmission electron microscopy and quantitative real-time PCR gene expression analysis. It was observed that mutations in pea symbiotic genes sym33 (PsIPD3/PsCYCLOPS encoding a transcriptional factor) and sym40 (PsEFD encoding a putative negative regulator of the cytokinin response) led to suberin depositions in ineffective nodules, and in the sym42 there were callose depositions in infection thread (IT) and host cell walls. The increase in deposition of unesterified pectin in IT walls was observed for mutants in the sym33 and sym42; for mutant in the sym42, unesterified pectin was also found around degrading bacteroids. In mutants in the genes sym33 and sym40, an increase in the expression level of a gene encoding peroxidase was observed. In the genes sym40 and sym42, an increase in the expression levels of genes encoding a marker of hypersensitive reaction and PR10 protein was demonstrated. Thus, a range of plant defence responses like suberisation, callose and unesterified pectin deposition as well as activation of defence genes can be triggered by different pea single mutations that cause perception of an otherwise
The Sym2Int program: going from symmetries to interactions
NASA Astrophysics Data System (ADS)
Fonseca, Renato M.
2017-07-01
Model builders often need to find the most general Lagrangian which can be constructed from a given list of fields. These fields are actually representations of the Lorentz and gauge groups (and maybe of some discrete symmetry group as well). I will describe a simple program (Sym2Int) which helps to automate this task by listing all possible interactions between Lorentz/gauge group representations.
Applications of Subleading-Color Amplitudes in N = 4 SYM Theory
Naculich, Stephen G.; Nastase, Horatiu; Schnitzer, Howard J.
2011-01-01
A numore » mber of features and applications of subleading-color amplitudes of N = 4 SYM theory are reviewed. Particular attention is given to the IR divergences of the subleading-color amplitudes, the relationships of N = 4 SYM theory to N = 8 supergravity, and to geometric interpretations of one-loop subleading-color and N k MHV amplitudes of N = 4 SYM theory.« less
Ethylene Inhibitors Restore Nodulation to sym 5 Mutants of Pisum sativum L. cv Sparkle 12
Fearn, Jeffrey C.; LaRue, Thomas A.
1991-01-01
The sym 5 mutants of pea, Pisum sativum L. cv Sparkle, do not differ in growth habit from their normal parent and nodulate poorly at a root temperature of 20°C. If inhibitors of ethylene formation or action (Co2+, aminoethoxyvinylglycine, or Ag+) are added to the substrate, nodulation of the sym 5 mutants is increased. Similar treatments of four other mutant sym lines do not restore nodulation. When Ag+ is added to the substrate from 4 days before to 4 days after inoculation with rhizobia, nodulation of sym 5 mutants is increased. The roots of the mutant need only be exposed to Ag+ for 4 hours to significantly increase nodule numbers. The content of free 1-aminocyclopropane-1-carboxylic acid and the production of ethylene in the lateral roots of sym 5 mutants do not differ from Sparkle. PMID:16668158
A one-loop test for construction of 4D N = 4 SYM from 2D SYM via fuzzy-sphere geometry
NASA Astrophysics Data System (ADS)
Matsuura, So; Sugino, Fumihiko
2016-04-01
As a perturbative check of the construction of 4D N=4 supersymmetric Yang-Mills theory (SYM) from mass-deformed N=(8,8) SYM on the 2D lattice, the one-loop effective action for scalar kinetic terms is computed in N=4 U(k) SYM on R^2 × (fuzzy S^2), which is obtained by expanding 2D N=(8,8) U(N) SYM with mass deformation around its fuzzy-sphere classical solution. The radius of the fuzzy sphere is proportional to the inverse of the mass. We consider two successive limits: (1) decompactify the fuzzy sphere to a noncommutative (Moyal) plane and (2) turn off the noncommutativity of the Moyal plane. It is straightforward at the classical level to obtain the ordinary N=4 SYM on R^4 in the limits, while it is nontrivial at the quantum level. The one-loop effective action for the SU(k) sector of the gauge group U(k) coincides with that of the ordinary 4D N=4 SYM in the above limits. Although a "noncommutative anomaly" appears in the overall U(1) sector of the U(k) gauge group, this can be expected to be a gauge artifact not affecting gauge-invariant observables.
Symbolic Quantum Computation Simulation in SymPy
NASA Astrophysics Data System (ADS)
Cugini, Addison; Curry, Matt; Granger, Brian
2010-10-01
Quantum computing is an emerging field which aims to use quantum mechanics to solve difficult computational problems with greater efficiency than on a classical computer. There is a need to create software that i) helps newcomers to learn the field, ii) enables practitioners to design and simulate quantum circuits and iii) provides an open foundation for further research in the field. Towards these ends we have created a package, in the open-source symbolic computation library SymPy, that simulates the quantum circuit model of quantum computation using Dirac notation. This framework builds on the extant powerful symbolic capabilities of SymPy to preform its simulations in a fully symbolic manner. We use object oriented design to abstract circuits as ordered collections of quantum gate and qbit objects. The gate objects can either be applied directly to the qbit objects or be represented as matrices in different bases. The package is also capable of performing the quantum Fourier transform and Shor's algorithm. A notion of measurement is made possible through the use of a non-commutative gate object. In this talk, we describe the software and show examples of quantum circuits on single and multi qbit states that involve common algorithms, gates and measurements.
The exact Schur index of N=4 SYM
NASA Astrophysics Data System (ADS)
Bourdier, Jun; Drukker, Nadav; Felix, Jan
2015-11-01
The Witten index counts the difference in the number of bosonic and fermionic states of a quantum mechanical system. The Schur index, which can be defined for theories with at least N=2 supersymmetry in four dimensions is a particular refinement of the index, dependent on one parameter q serving as the fugacity for a particular set of charges which commute with the hamiltonian and some supersymmetry generators. This index has a known expression for all Lagrangian and some non-Lagrangian theories as a finite dimensional integral or a complicated infinite sum. In the case of N=2 SYM with gauge group U( N ) we rewrite this as the partition function of a gas of N non interacting and translationally invariant fermions on a circle. This allows us to perform the integrals and write down explicit expressions for fixed N as well as the exact all orders large N expansion.
High energy bounds on soft mathcal{N} = 4 SYM amplitudes from AdS/CFT
NASA Astrophysics Data System (ADS)
Giordano, M.; Peschanski, R.
2010-05-01
Using the AdS/CFT correspondence, we study the high-energy behavior of colorless dipole elastic scattering amplitudes in mathcal{N} = 4 SYM gauge theory through the Wilson loop correlator formalism and Euclidean to Minkowskian analytic continuation. The purely elastic behavior obtained at large impact-parameter L, through duality from disconnected AdS 5 minimal surfaces beyond the Gross-Ooguri transition point, is combined with unitarity and analyticity constraints in the central region. In this way we obtain an absolute bound on the high-energy behavior of the forward scattering amplitude due to the graviton interaction between minimal surfaces in the bulk. The dominant “Pomeron” intercept is bounded by α ≤ 11=7 using the AdS/CFT constraint of a weak gravitational field in the bulk. Assuming the elastic eikonal approximation in a larger impact-parameter range gives 4/3 ≤ α ≤ 11/7: The actual intercept becomes 4/3 if one assumes the elastic eikonal approximation within its maximally allowed range L ≳ exp Y/3; where Y is the total rapidity. Subleading AdS/CFT contributions at large impact-parameter due to the other d = 10 supergravity fields are obtained. A divergence in the real part of the tachyonic KK scalar is cured by analyticity but signals the need for a theoretical completion of the AdS/CFT scheme.
Hasan, Mehdi; Sensale-Rodriguez, Berardi
2015-09-15
In this paper, a two-dimensional (2-D) model for a graphene symmetric field effect transistor (SymFET), which considers (a) the intra-graphene layer potential distributions and (b) the internal current flows through the device, is presented and discussed. The local voltages along the graphene electrodes as well as the current-voltage characteristics of the device are numerically calculated based on a single-particle tunneling model. Our numerical results show that: (i) when the tunneling current is small, due to either a large tunneling thickness (≥ 2 atomic layers of BN) or a small coherence length, the voltage distributions along the graphene electrodes have almost zero variations upon including these distributed effects, (ii) when the tunnel current is large, due to either a small tunneling thickness (∼ 1 atomic layer of BN) or due to a large coherence length, the local voltage distributions along the graphene electrodes become appreciable and the device behavior deviates from that predicted by a 1-D approximation. These effects, which are not captured in one-dimensional SymFET models, can provide a better understanding about the electron dynamics in the device and might indicate potential novel applications for this proposed device.
Zhou, Weiyi; Fan, Guoliang; Jiang, Dongfeng
2004-11-01
A method for the determination of the residual epichlorohydrin and sym-dichloroisopropyl alcohol in cationic etherified reagent by gas chromatography has been established. Methyl benzoate, which has high extraction efficiency for the two components, was used as extractant. With an HP-5 capillary column, the two components were baseline separated and they eluted before the extractant. The linear ranges achieved were 5 - 590 mg/kg for epichlorohydrin and 21 - 480 mg/kg for sym-dichloroisopropyl alcohol. The limits of detection were 1.2 mg/kg for epichlorohydrin and 2.2 mg/kg for sym-dichloroisopropyl alcohol. Recoveries for epichlorohydrin were 95.93% - 103.42% with relative standard deviations of 2.4% - 10.6% and those for sym-dichloroisopropyl alcohol were 98.54% - 107.40% with relative standard deviations of 6.6% -11.1%. The method is simple, fast, and convenient.
Conformal kernel for NLO BFKL equation in ${\\cal N}$=4 SYM
Balitsky, Ian; Chirilli, Giovanni
2009-01-01
Using the requirement of M\\"{o}bius invariance of ${\\cal N}$=4 SYM amplitudes in the Regge limit we restore the conformal NLO BFKL kernel out of the eigenvalues known from the forward NLO BFKL result.
Isolation, phylogeny and evolution of the SymRK gene in the legume genus Lupinus L.
Mahé, Frédéric; Markova, Dragomira; Pasquet, Rémy; Misset, Marie-Thérèse; Aïnouche, Abdelkader
2011-07-01
SymRK is one of the key genes involved in initial steps of legume symbiotic association with fungi (mycorrhization) and nitrogen-fixing bacteria (nodulation). A large portion of the sequence encoding the extracellular domain of SYMRK was obtained for 38 lupine accessions and 2 outgroups in order to characterize this region, to evaluate its phylogenetic utility, and to examine whether its molecular evolutionary pattern is correlated with rhizobial diversity and specificity in Lupinus. The data suggested that, in Lupinus, SymRK is a single copy gene that shows good phylogenetic potential. Accordingly, SymRK provided additional support to previous molecular phylogenies, and shed additional light on relationships within the Old World group of Lupinus, especially among the African species. Similar to results of other studies, analyses of SymRK sequences were unable to resolve placement of the Florida unifoliolate lineage, whose relationship was weakly supported to either the Old or the New World lupines. Our data are consistent with strong purifying selection operating on SymRK in Lupinus, preserving rather than diversifying its function. Thus, although SymRK was demonstrated to be a vital gene in the early stages of the root-bacterial symbiotic associations, no evidence from present analyses indicate that this gene is involved in changes in rhizobial specificity in Lupinus. Copyright © 2011 Elsevier Inc. All rights reserved.
Prediction of Sym-H index by NARX neural network from IMF and solar wind data
NASA Astrophysics Data System (ADS)
Cai, L.; Ma, S.-Y.; Liu, R.-S.; Schlegel, K.; Zhou, Y.-L.; Luehr, H.
2009-04-01
Similar to Dst, the Sym-H index is also an indicator of magnetic storm intensity, but having distinct advantage of higher time-resolution. In this study an artificial neural network (ANN) of Nonlinear Auto Regressive with eXogenous inputs (NARX) has been developed to predict for the first time Sym-H index from solar wind and IMF parameters. In total 73 great storm events during 1998 to 2006 are used, out of which 67 are selected to train the network and the other 6 samples including 2 super-storms for test. The newly developed NARX model shows much better capability than usual BP and Elman network in Sym-H prediction. When using IMF Bz, By and total B with a history length of 90 minutes along with solar wind proton density Np and velocity Vsw as the original external inputs of the ANN to predict Sym-H index one hour later, the cross-correlation between NARX network predicted and Kyoto observed Sym-H is 0.95 for the 6 test storms as a whole, even as high as 0.95 and 0.98 respectively for the two super-storms. This excellent performance of the NARX model can mainly be attributed to a feedback from the output neuron with a suitable length of about 120 min. to the external input. It is such a feedback that makes the ring current status properly brought into effect in the prediction of storm-time Sym-H index by our NARX network. Furthermore, different parameter combinations with different history length (70 to 120 min.) for IMF and solar wind data as external inputs are examined along with different hidden neuron number. It is found that the NARX network with 10 hidden units and with 100 min. length of Bz, Np and Vsw as external inputs provides the best results in Sym-H prediction. Besides, efforts have also been made to predict Sym-H longer time ahead, showing that the NARX network can predict Sym-H index 180 min. ahead with correlation coefficient of 0.94 between predicted and observed Sym-H and RMSE less than 19 nT for the 6 test samples.
SrSymRK, a plant receptor essential for symbiosome formation.
Capoen, Ward; Goormachtig, Sofie; De Rycke, Riet; Schroeyers, Katrien; Holsters, Marcelle
2005-07-19
The symbiosis between legumes and rhizobia is essential for the nitrogen input into the life cycle on our planet. New root organs, the nodules, are established, which house N2-fixing bacteria internalized into the host cell cytoplasm as horizontally acquired organelles, the symbiosomes. The interaction is initiated by bacterial invasion via epidermal root hair curling and cell division in the cortex, both triggered by bacterial nodulation factors. Of the several genes involved in nodule initiation that have been identified, one encodes the leucine-rich repeat-type receptor kinase SymRK. In SymRK mutants of Lotus japonicus or its orthologs in Medicago sp. and Pisum sativum, nodule initiation is arrested at the level of the root hair interaction. Because of the epidermal block, the role of SymRK at later stages of nodule development remained enigmatic. To analyze the role of SymRK downstream of the epidermis, the water-tolerant legume Sesbania rostrata was used that has developed a nodulation strategy to circumvent root hair responses for bacterial invasion. Evidence is provided that SymRK plays an essential role during endosymbiotic uptake in plant cells.
amdSYM, a new dominant recyclable marker cassette for Saccharomyces cerevisiae
Solis-Escalante, Daniel; Kuijpers, Niels GA; Bongaerts, Nadine; Bolat, Irina; Bosman, Lizanne; Pronk, Jack T; Daran, Jean-Marc; Daran-Lapujade, Pascale
2013-01-01
Despite the large collection of selectable marker genes available for Saccharomyces cerevisiae, marker availability can still present a hurdle when dozens of genetic manipulations are required. Recyclable markers, counterselectable cassettes that can be removed from the targeted genome after use, are therefore valuable assets in ambitious metabolic engineering programs. In the present work, the new recyclable dominant marker cassette amdSYM, formed by the Ashbya gossypii TEF2 promoter and terminator and a codon-optimized acetamidase gene (Aspergillus nidulans amdS), is presented. The amdSYM cassette confers S. cerevisiae the ability to use acetamide as sole nitrogen source. Direct repeats flanking the amdS gene allow for its efficient recombinative excision. As previously demonstrated in filamentous fungi, loss of the amdS marker cassette from S. cerevisiae can be rapidly selected for by growth in the presence of fluoroacetamide. The amdSYM cassette can be used in different genetic backgrounds and represents the first counterselectable dominant marker gene cassette for use in S. cerevisiae. Furthermore, using astute cassette design, amdSYM excision can be performed without leaving a scar or heterologous sequences in the targeted genome. The present work therefore demonstrates that amdSYM is a useful addition to the genetic engineering toolbox for Saccharomyces laboratory, wild, and industrial strains. PMID:23253382
Abbott AxSYM Vancomycin II assay: multicenter evaluation and interference studies.
Azzazy, H M; Chou, P P; Tsushima, J H; Troxil, S; Gordon, M; Avers, R J; Chiappetta, E; Duh, S H; Christenson, R H
1998-04-01
The authors evaluated the performance characteristics of the Abbott AxSYM Vancomycin II immunoassay in sera of patients with (n = 93 samples) and without (n = 327 patients) renal dysfunction. Correlation of vancomycin measurements with the Abbott AxSYM Vancomycin, Abbott TDx/TDxFLx, Syva enzyme-multiplied immunoassay technique (EMIT), DuPont automated chemistry analyzer (ACA), and high-performance liquid chromatography methods showed acceptable correlation as indicated by: slope values >0.95, r-values >0.97, y-intercepts <1.7 microg/ml, and S(y/x) ranging from 9% to 15% of the average vancomycin value. The AxSYM Vancomycin II assay showed acceptable correlation with AxSYM vancomycin, TDx/TDxFLx, and high-performance liquid chromatography methods in 93 samples from patients with renal dysfunction. This monoclonal antibody-based assay showed no apparent interference from the presence of human antimouse antibody (HAMA) or the microbiologically inactive vancomycin crystalline degradation product (CDP). The authors conclude that the AxSYM Vancomycin II assay showed satisfactory agreement with other methods tested in this study.
Green, Kimberly A; Becker, Yvonne; Tanaka, Aiko; Takemoto, Daigo; Fitzsimons, Helen L; Seiler, Stephan; Lalucque, Hervé; Silar, Philippe; Scott, Barry
2017-02-01
Cell-cell fusion in fungi is required for colony formation, nutrient transfer and signal transduction. Disruption of genes required for hyphal fusion in Epichloë festucae, a mutualistic symbiont of Lolium grasses, severely disrupts the host interaction phenotype. They examined whether symB and symC, the E. festucae homologs of Podospora anserina self-signaling genes IDC2 and IDC3, are required for E. festucae hyphal fusion and host symbiosis. Deletion mutants of these genes were defective in hyphal cell fusion, formed intra-hyphal hyphae, and had enhanced conidiation. SymB-GFP and SymC-mRFP1 localize to plasma membrane, septa and points of hyphal cell fusion. Plants infected with ΔsymB and ΔsymC strains were severely stunted. Hyphae of the mutants colonized vascular bundles, were more abundant than wild type in the intercellular spaces and formed intra-hyphal hyphae. Although these phenotypes are identical to those previously observed for cell wall integrity MAP kinase mutants no difference was observed in the basal level of MpkA phosphorylation or its cellular localization in the mutant backgrounds. Both genes contain binding sites for the transcription factor ProA. Collectively these results show that SymB and SymC are key components of a conserved signaling network for E. festucae to maintain a mutualistic symbiotic interaction within L. perenne. © 2016 The Authors. Molecular Microbiology Published by John Wiley & Sons Ltd.
Entanglement temperature for the excitation of SYM theory in the (de)confinement phase
NASA Astrophysics Data System (ADS)
Ghoroku, Kazuo; Ishihara, Masafumi
2015-10-01
We study the holographic supersymmetric Yang-Mills (SYM) theory, which is living in a hyperbolic space, in terms of the entanglement entropy. The theory contains a parameter C corresponding to the excitation of the SYM theory, and it controls the dynamical properties of the theory. The entanglement temperature, Tent , is obtained by imposing the thermodynamic law for the relative entanglement entropy and the energy density of the excitation. This temperature is available at any value of the parameter C even in the region where the Hawking temperature disappears. With this new temperature, the dynamical properties of the excited SYM theory are examined in terms of the thermodynamic law. We could find the signatures of phase transitions of the theory.
Non-Abelian discrete flavor symmetries of 10D SYM theory with magnetized extra dimensions
NASA Astrophysics Data System (ADS)
Abe, Hiroyuki; Kobayashi, Tatsuo; Ohki, Hiroshi; Sumita, Keigo; Tatsuta, Yoshiyuki
2014-06-01
We study discrete flavor symmetries of the models based on a ten-dimensional supersymmetric Yang-Mills (10D SYM) theory compactified on magnetized tori. We assume non-vanishing non-factorizable fluxes as well as the orbifold projections. These setups allow model-building with more various flavor structures. Indeed, we show that there exist various classes of non-Abelian discrete flavor symmetries. In particular, we find that S 3 flavor symmetries can be realized in the framework of the magnetized 10D SYM theory for the first time.
Yao, Hong; Wei, Tai-Bao; Xu, Wei-Xia; Zhang, You-Ming
2006-09-01
The inclusion interaction of beta-cyclodextrin and sym-diphenyl-thiourea and sym-diphenyl-urea was studied by UV spectra. The stoichiometry ratio for the formation of the inclusion complexes was determined by Hildebrand-Benesi equation linear analysis and molar ratio method. The standard molar Gibbs energies, enthalpies, and entropies were derived for the inclusion process by Ks at different temperatrues. The result showed that the host:guest ratio of inclusion complex between the two diphenyl compounds and beta-CD is 2 : 1, the stability constant (Ks) of 2 : 1 inclusion complexes was higher than that of 1 : 1 inclusion complexes due to cooperative binding in the close two hydrophobic cyclodextrin cavities, and the association of the guest molecule with beta-CD was favored by enthalpy changes, proving that the Van der Waals interaction and the dipole-dipole interaction were main binding forces of cyclodextrin inclusion complex.
Indrasumunar, Arief; Wilde, Julia; Hayashi, Satomi; Li, Dongxue; Gresshoff, Peter M
2015-03-15
Association between legumes and rhizobia results in the formation of root nodules, where symbiotic nitrogen fixation occurs. The early stages of this association involve a complex of signalling events between the host and microsymbiont. Several genes dealing with early signal transduction have been cloned, and one of them encodes the leucine-rich repeat (LRR) receptor kinase (SymRK; also termed NORK). The Symbiosis Receptor Kinase gene is required by legumes to establish a root endosymbiosis with Rhizobium bacteria as well as mycorrhizal fungi. Using degenerate primer and BAC sequencing, we cloned duplicated SymRK homeologues in soybean called GmSymRKα and GmSymRKβ. These duplicated genes have high similarity of nucleotide (96%) and amino acid sequence (95%). Sequence analysis predicted a malectin-like domain within the extracellular domain of both genes. Several putative cis-acting elements were found in promoter regions of GmSymRKα and GmSymRKβ, suggesting a participation in lateral root development, cell division and peribacteroid membrane formation. The mutant of SymRK genes is not available in soybean; therefore, to know the functions of these genes, RNA interference (RNAi) of these duplicated genes was performed. For this purpose, RNAi construct of each gene was generated and introduced into the soybean genome by Agrobacterium rhizogenes-mediated hairy root transformation. RNAi of GmSymRKβ gene resulted in an increased reduction of nodulation and mycorrhizal infection than RNAi of GmSymRKα, suggesting it has the major activity of the duplicated gene pair. The results from the important crop legume soybean confirm the joint phenotypic action of GmSymRK genes in both mycorrhizal and rhizobial infection seen in model legumes.
Analysis of Rhizobium meliloti Sym Mutants Obtained by Heat Treatment †
Toro, Nicolas; Olivares, José
1986-01-01
Deletions in the pSym megaplasmid of Rhizobium meliloti were produced at a high frequency, and their lengths varied according to incubation temperature. Morphological differentiation into large and small colonies occurred after heat treatment. Small colonies elicited pseudonodules on alfalfa roots. Images PMID:16347063
Lotus japonicus symRK-14 uncouples the cortical and epidermal symbiotic program.
Kosuta, Sonja; Held, Mark; Hossain, Md Shakhawat; Morieri, Giulia; Macgillivary, Amanda; Johansen, Christopher; Antolín-Llovera, Meritxell; Parniske, Martin; Oldroyd, Giles E D; Downie, Allan J; Karas, Bogumil; Szczyglowski, Krzysztof
2011-09-01
SYMRK is a leucine-rich-repeat (LRR)-receptor kinase that mediates intracellular symbioses of legumes with rhizobia and arbuscular mycorrhizal fungi. It participates in signalling events that lead to epidermal calcium spiking, an early cellular response that is typically considered as central for intracellular accommodation and nodule organogenesis. Here, we describe the Lotus japonicus symRK-14 mutation that alters a conserved GDPC amino-acid sequence in the SYMRK extracellular domain. Normal infection of the epidermis by fungal or bacterial symbionts was aborted in symRK-14. Likewise, epidermal responses of symRK-14 to bacterial signalling, including calcium spiking, NIN gene expression and infection thread formation, were significantly reduced. In contrast, no major negative effects on the formation of nodule primordia and cortical infection were detected. Cumulatively, our data show that the symRK-14 mutation uncouples the epidermal and cortical symbiotic program, while indicating that the SYMRK extracellular domain participates in transduction of non-equivalent signalling events. The GDPC sequence was found to be highly conserved in LRR-receptor kinases in legumes and non-legumes, including the evolutionarily distant bryophytes. Conservation of the GDPC sequence in nearly one-fourth of LRR-receptor-like kinases in the genome of Arabidopsis thaliana suggests, however, that this sequence might also play an important non-symbiotic function in this plant.
Parallel-SymD: A Parallel Approach to Detect Internal Symmetry in Protein Domains
Jha, Ashwani; Flurchick, K. M.; Bikdash, Marwan
2016-01-01
Internally symmetric proteins are proteins that have a symmetrical structure in their monomeric single-chain form. Around 10–15% of the protein domains can be regarded as having some sort of internal symmetry. In this regard, we previously published SymD (symmetry detection), an algorithm that determines whether a given protein structure has internal symmetry by attempting to align the protein to its own copy after the copy is circularly permuted by all possible numbers of residues. SymD has proven to be a useful algorithm to detect symmetry. In this paper, we present a new parallelized algorithm called Parallel-SymD for detecting symmetry of proteins on clusters of computers. The achieved speedup of the new Parallel-SymD algorithm scales well with the number of computing processors. Scaling is better for proteins with a larger number of residues. For a protein of 509 residues, a speedup of 63 was achieved on a parallel system with 100 processors. PMID:27747230
A MAP Kinase Kinase Interacts with SymRK and Regulates Nodule Organogenesis in Lotus japonicus[C][W
Chen, Tao; Zhu, Hui; Ke, Danxia; Cai, Kai; Wang, Chao; Gou, Honglan; Hong, Zonglie; Zhang, Zhongming
2012-01-01
The symbiosis receptor kinase, SymRK, is required for root nodule development. A SymRK-interacting protein (SIP2) was found to form protein complex with SymRK in vitro and in planta. The interaction between SymRK and SIP2 is conserved in legumes. The SIP2 gene was expressed in all Lotus japonicus tissues examined. SIP2 represents a typical plant mitogen-activated protein kinase kinase (MAPKK) and exhibited autophosphorylation and transphosphorylation activities. Recombinant SIP2 protein could phosphorylate casein and the Arabidopsis thaliana MAP kinase MPK6. SymRK and SIP2 could not use one another as a substrate for phosphorylation. Instead, SymRK acted as an inhibitor of SIP2 kinase when MPK6 was used as a substrate, suggesting that SymRK may serve as a negative regulator of the SIP2 signaling pathway. Knockdown expression of SIP2 via RNA interference (RNAi) resulted in drastic reduction of nodules formed in transgenic hairy roots. A significant portion of SIP2 RNAi hairy roots failed to form a nodule. In these roots, the expression levels of SIP2 and three marker genes for infection thread and nodule primordium formation were downregulated drastically, while the expression of two other MAPKK genes were not altered. These observations demonstrate an essential role of SIP2 in the early symbiosis signaling and nodule organogenesis. PMID:22353370
High-Quality draft genome sequence of the Lotus spp. microsymbiont Mesorhizobium loti strain CJ3Sym
Reeve, Wayne; Sullivan, John; Ronson, Clive; ...
2015-08-14
Mesorhizobium loti strain CJ3Sym was isolated in 1998 following transfer of the integrative and conjugative element ICE Ml SymR7A , also known as the R7A symbiosis island, in a laboratory mating from the donor M. loti strain R7A to a nonsymbiotic recipient Mesorhizobium strain CJ3. Strain CJ3 was originally isolated from a field site in the Rocklands range in New Zealand in 1994. CJ3Sym is an aerobic, Gram-negative, non-spore-forming rod. This report reveals the genome of M. loti strain CJ3Sym currently comprises 70 scaffolds totaling 7,563,725 bp. In conclusion, the high-quality draft genome is arranged in 70 scaffolds of 71more » contigs, contains 7,331 protein-coding genes and 70 RNA-only encoding genes, and is part of the GEBA-RNB project proposal.« less
High-Quality draft genome sequence of the Lotus spp. microsymbiont Mesorhizobium loti strain CJ3Sym
Reeve, Wayne; Sullivan, John; Ronson, Clive; Tian, Rui; Munk, Christine; Han, Cliff; Reddy, T. B. K.; Seshadri, Rekha; Woyke, Tanja; Pati, Amrita; Markowitz, Victor; Ivanova, Natalia; Kyrpides, Nikos
2015-08-14
Mesorhizobium loti strain CJ3Sym was isolated in 1998 following transfer of the integrative and conjugative element ICE Ml Sym^{R7A} , also known as the R7A symbiosis island, in a laboratory mating from the donor M. loti strain R7A to a nonsymbiotic recipient Mesorhizobium strain CJ3. Strain CJ3 was originally isolated from a field site in the Rocklands range in New Zealand in 1994. CJ3Sym is an aerobic, Gram-negative, non-spore-forming rod. This report reveals the genome of M. loti strain CJ3Sym currently comprises 70 scaffolds totaling 7,563,725 bp. In conclusion, the high-quality draft genome is arranged in 70 scaffolds of 71 contigs, contains 7,331 protein-coding genes and 70 RNA-only encoding genes, and is part of the GEBA-RNB project proposal.
NASA Astrophysics Data System (ADS)
von Borczyskowski, C.
The lowest excited triplet state of sym-tetrachloropyrazine has been investigated at 1·5 K in single crystals of sym-tetramethylbenzene (TMB) and symtetrachlorobenzene (TCB). By analysis of the chlorine and nitrogen hyperfine interaction a 3ππ* state with B2u symmetry has been identified which is contrary to the B1u symmetry of TCB. The large difference between chlorine quadrupole resonance transitions in the singlet ground and excited triplet state of 2·75 MHz (TCB) and 3·3 MHz (TMB) suggests an out-of-plane position of chlorine nuclei in the triplet state. Analysis of the vibronic structure of the phosphorescence reveals that vibronic coupling to an energetically close lying 3nπ* state is, in comparison with other pyrazines, greatly reduced.
Anisotropic heavy quark potential in strongly-coupled N =4 SYM theory in a magnetic field
NASA Astrophysics Data System (ADS)
Rougemont, R.; Critelli, R.; Noronha, J.
2015-03-01
In this work we use the gauge/gravity duality to study the anisotropy in the heavy quark potential in strongly coupled N =4 super-Yang Mills (SYM) theory (both at zero and nonzero temperature) induced by a constant and uniform magnetic field B . At zero temperature, the inclusion of the magnetic field decreases the attractive force between heavy quarks with respect to its B =0 value and the force associated with the parallel potential is the least attractive force. We find that the same occurs at nonzero temperature and, thus, at least in the case of strongly coupled N =4 SYM, the presence of a magnetic field generally weakens the interaction between heavy quarks in the plasma.
Chiral 2d theories from N = 4 SYM with varying coupling
NASA Astrophysics Data System (ADS)
Lawrie, Craig; Schäfer-Nameki, Sakura; Weigand, Timo
2017-04-01
We study 2d chiral theories arising from 4d N = 4 Super-Yang Mills (SYM) with varying coupling τ . The 2d theory is obtained by dimensional reduction of N = 4 SYM on a complex curve with a partial topological twist that accounts for the non-constant τ. The resulting 2d theories can preserve (0 ,n) with n = 2 ,4 ,6 ,8 chiral supersymmetry, and have a natural realization in terms of strings from wrapped D3-branes in F-theory. We determine the twisted dimensional reduction, as well as the spectrum and anomaly polynomials of the resulting strings in various dimensions. We complement this by considering the dual M-theory configurations, which can either be realized in terms of M5-branes wrapped on complex surfaces, or M2-branes on curves that result in 1d supersymmetric quantum mechanics.
Niwa, Ryusuke; Hada, Kazumasa; Moliyama, Kouichi; Ohniwa, Ryosuke L.; Tan, Yi-Meng; Olsson-Carter, Katherine; Chi, Woo; Reinke, Valerie; Slack, Frank J.
2010-01-01
In the nematode Caenorhabditis elegans, the let-7 microRNA (miRNA) and its family members control the timing of key developmental events in part by directly regulating expression of hunchback-like-1 (hbl-1). C. elegans hbl-1 mutants display multiple developmental timing deficiencies, including cell cycle defects during larval development. While hbl-1 is predicted to encode a transcriptional regulator, downstream targets of HBL-1 have not been fully elucidated. Here we report using microarray analysis to uncover genes downstream of HBL-1. We established a transgenic strain that overexpresses hbl-1 under the control of a heat shock promoter. Heat shock-induced hbl-1 overexpression led to retarded hypodermal structures at the adult stage, opposite to the effect seen in loss of function (lf) hbl-1 mutants. The microarray screen identified numerous potential genes that are upregulated or downregulated by HBL-1, including sym-1, which encodes a leucine-rich repeat protein with a signal sequence. We found an increase in sym-1 transcription in the heat shock-induced hbl-1 overexpression strain, while loss of hbl-1 function caused a decrease in sym-1 expression levels. Furthermore, we found that sym-1(lf) modified the hypodermal abnormalities in hbl-1 mutants. Given that SYM-1 is a protein secreted from hypodermal cells to the surrounding cuticle, we propose that the adult-specific cuticular structures may be under the temporal control of HBL-1 through regulation of sym-1 transcription. PMID:19923914
Beyond cusp anomalous dimension from integrability in SYM{sub 4}
Fioravanti, Davide; Grinza, Paolo; Rossi, Marco
2011-07-15
We study the first sub-leading correction O((ln s){sup 0}) to the cusp anomalous dimension in the high spin expansion of finite twist operators in N = 4 SYM theory. This term is still governed by a linear integral equation which we study in the weak and strong coupling regimes. In the strong coupling regime we find agreement with the string theory computations.
Contributions of substorm injections to SYM-H depressions in the main phase of storms
NASA Astrophysics Data System (ADS)
He, Zhaohai; Dai, Lei; Wang, Chi; Duan, Suping; Zhang, Lingqian; Chen, Tao; Roth, I.
2016-12-01
Substorm injections bring energetic particles to the inner magnetosphere. But the role of the injected population in building up the storm time ring current is not well understood. By surveying Los Alamos National Laboratory geosynchronous data during 34 storm main phases, we show evidence that at least some substorm injections can contribute to substorm-time scale SYM-H/Dst depressions in the main phase of storms. For event studies, we analyze two typical events in which the main-phase SYM-H index exhibited stepwise depressions that are correlated with particle flux enhancement due to injections and with AL index. A statistical study is performed based on 95 storm time injection events. The flux increases of the injected population (50-400 keV) are found proportional to the sharp SYM-H depressions during the injection interval. By identifying dispersionless and dispersive injection signals, we estimate the azimuthal extent of the substorm injection. Statistical results show that the injection regions of these storm time substorms are characterized with an azimuthal extent larger than 06:00 magnetic local time. These results suggest that at least some substorm injections may mimic the large-scale enhanced convection and contribute to sharp decreases of Dst in the storm main phase.
NASA Astrophysics Data System (ADS)
Bondarenko, Sergey; Prygarin, Alex
2016-07-01
We discuss a residual freedom of the next-to-leading BFKL eigenvalue that originates from ambiguity in redistributing the next-to-leading (NLO) corrections between the adjoint BFKL eigenvalue and eigenfunctions in planar {N}=4 super-Yang-Mills (SYM) Theory. In terms of the remainder function of the Bern-Dixon-Smirnov (BDS) amplitude this freedom is translated to reshuffling correction between the eigenvalue and the impact factors in the multi-Regge kinematics (MRK) in the next-to-leading logarithm approximation (NLA). We show that the modified NLO BFKL eigenvalue suggested by the authors in ref. [1] can be introduced in the MRK expression for the remainder function by shifting the anomalous dimension in the impact factor in such a way that the two and three loop remainder function is left unchanged to the NLA accuracy.
Ritchie, J.P.
1986-01-01
Nitrobenzenes are a well known class of stable organic compounds. Nitro-sym-triazines are not known, although other substituted triazines are very well known. To investigate what properties the nitrotriazines might have, should they be synthesized, we performed molecular orbital calculations for nitrotriazine (NTZ), dinitrotriazine (DNTZ), and trinitrotriazine (TNTZ). Nitrobenzenes with analogous nitrogroup substitution were also studied to provide a check on the calculations. In particular, nitrobenzene (NB), 1,3-dinitrobenzene (DNB), and 1,3,5-trinitrobenzene (TNB) were studied. 17 figs., 5 tabs.
Refined counting of necklaces in one-loop N=4 SYM
NASA Astrophysics Data System (ADS)
Suzuki, Ryo
2017-06-01
We compute the grand partition function of N=4 SYM at one-loop in the SU(2) sector with general chemical potentials, extending the results of Pólya's theorem. We make use of finite group theory, applicable to all orders of perturbative 1 /N c expansion. We show that only the planar terms contribute to the grand partition function, which is therefore equal to the grand partition function of an ensemble of {XXX}_{1/2} spin chains. We discuss how Hagedorn temperature changes on the complex plane of chemical potentials.
2013-01-01
The bioactivities of two novel compounds (TAE-1 and TAE-2) that contain a sym-triazine scaffold with acetylcholine-like substitutions are examined as promising candidate agents against Alzheimer’s disease. Inhibition of amyloid-β fibril formation in the presence of Aβ1–42, evaluated by Thioflavin T fluorescence, demonstrated comparable or improved activity to a previously reported pentapeptide-based fibrillogenesis inhibitor, iAβ5p. Destabilization of Aβ1–42 assemblies by TAE-1 and TAE-2 was confirmed by scanning electron microscopy imaging. sym-Triazine inhibition of acetylcholinesterase (AChE) activity was observed in cytosol extracted from differentiated human SH-SY5Y neuronal cells and also using human erythrocyte AChE. The sym-triazine derivatives were well tolerated by these cells and promoted beneficial effects on human neurons, upregulating expression of synaptophysin, a synaptic marker protein, and MAP2, a neuronal differentiation marker. PMID:23472585
Prediction of SYM-H index during large storms by NARX neural network from IMF and solar wind data
NASA Astrophysics Data System (ADS)
Cai, L.; Ma, S. Y.; Zhou, Y. L.
2010-02-01
Similar to the Dst index, the SYM-H index may also serve as an indicator of magnetic storm intensity, but having distinct advantage of higher time-resolution. In this study the NARX neural network has been used for the first time to predict SYM-H index from solar wind (SW) and IMF parameters. In total 73 time intervals of great storm events with IMF/SW data available from ACE satellite during 1998 to 2006 are used to establish the ANN model. Out of them, 67 are used to train the network and the other 6 samples for test. Additionally, the NARX prediction model is also validated using IMF/SW data from WIND satellite for 7 great storms during 1995-1997 and 2005, as well as for the July 2000 Bastille day storm and November 2001 superstorm using Geotail and OMNI data at 1 AU, respectively. Five interplanetary parameters of IMF Bz, By and total B components along with proton density and velocity of solar wind are used as the original external inputs of the neural network to predict the SYM-H index about one hour ahead. For the 6 test storms registered by ACE including two super-storms of min. SYM-H<-200 nT, the correlation coefficient between observed and NARX network predicted SYM-H is 0.95 as a whole, even as high as 0.95 and 0.98 with average relative variance of 13.2% and 7.4%, respectively, for the two super-storms. The prediction for the 7 storms with WIND data is also satisfactory, showing averaged correlation coefficient about 0.91 and RMSE of 14.2 nT. The newly developed NARX model shows much better capability than Elman network for SYM-H prediction, which can partly be attributed to a key feedback to the input layer from the output neuron with a suitable length (about 120 min). This feedback means that nearly real information of the ring current status is effectively directed to take part in the prediction of SYM-H index by ANN. The proper history length of the output-feedback may mainly reflect on average the characteristic time of ring current decay which
Quantum inflationary minisuperspace cosmological models
Kim Sangpyo.
1991-01-01
The Wheeler-DeWitt equations for the Friedmann-Robertson-Walker cosmology conformally and minimally coupled to scalar fields with power-lay potential are expanded in the eigenstates of the scalar field parts. The gravitational parts become a diagonal matrix-valued differential equation for a conformal scalar field, and a coupled matrix-valued differential equation for a minimally coupled scalar field. The Cauchy initial value problem is defined with respect to the intrinsic timelike coordinate, and the wavefunctions incorporating initial data are constructed using the product integral formulation. The packetlike wavefunctions around classical turning points are shown possible in the product integral formulation, and the returning wavepackets near the returning point of the classical Friedmann-Robertson-Walker cosmology are constructed. The wavefunctions to the Wheeler-DeWitt equation minimally coupled to the scaler field are constructed by two differential methods, the master equation and the enlarged matrix equation. The spectrum for the wavefunctions regular at the infinite size of universe is found, and these are interpreted as the Hawking-Page spectrum of wormholes connecting two asymptotically Euclidean regions. The quantum Friedmann-Robertson-Walker cosmology is extended to the minimal scalar field with the inflationary potential having a first order phase transition. The Wheeler-DeWitt equation is expanded in the eigenstates of the scalar field, and the gravitational part becomes a coupled matrix-valued differential equation.
Schulz, Andreas S.; Shmoys, David B.; Williamson, David P.
1997-01-01
Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 106 separate “yes” or “no” decisions to be made. Although one could, in principle, try all 2106 possible solutions to find the optimal one, such a method would be impractically slow. Unfortunately, for most of these models, no algorithms are known that find optimal solutions with reasonable computation times. Typically, industry must rely on solutions of unguaranteed quality that are constructed in an ad hoc manner. Fortunately, for some of these models there are good approximation algorithms: algorithms that produce solutions quickly that are provably close to optimal. Over the past 6 years, there has been a sequence of major breakthroughs in our understanding of the design of approximation algorithms and of limits to obtaining such performance guarantees; this area has been one of the most flourishing areas of discrete mathematics and theoretical computer science. PMID:9370525
2012-01-01
Alzheimer’s disease (AD) is a complex neurodegenerative disorder marked by numerous causative factors of disease progression, termed pathologies. We report here the synthesis of a small library of novel sym-triazine compounds designed for targeted modulation of multiple pathologies related to AD, specifically human acetylcholinesterase (AChE), butyrylcholinesterase (BuChE), and Aβ aggregation. Rational targeting of AChE was achieved by the incorporation of acetylcholine substrate analogues into a sym-triazine core in either a mono-, di-, or trisubstituted regime. A subset of these derivatives demonstrated improved activity compared to several commercially available cholinesterase inhibitors. High AChE/BuChE selectivity was characteristic of all derivatives, and AChE steady-state kinetics indicated a mixed-type inhibition mechanism. Further integration of multiple hydrophobic phenyl units allowed for improved β-sheet intercalation into amyloid aggregates. Several highly effective structures exhibited fibril inhibition greater than the previously reported β-sheet-disrupting penta-peptide, iAβ5p, evaluated by thioflavin T fluorescence spectroscopy and transmission electron microscopy. Highly effective sym-triazines were shown to be well tolerated by differentiated human neuronal cells, as demonstrated by the absence of adverse effects on cellular viability at a wide range of concentrations. Parallel targeting of multiple pathologies using sym-triazines is presented here as an effective strategy to address the complex, multifactorial nature of AD progression. PMID:23421685
Gherbi, Hassen; Markmann, Katharina; Svistoonoff, Sergio; Estevan, Joan; Autran, Daphné; Giczey, Gabor; Auguy, Florence; Péret, Benjamin; Laplaze, Laurent; Franche, Claudine; Parniske, Martin; Bogusz, Didier
2008-01-01
Root endosymbioses vitally contribute to plant nutrition and fitness worldwide. Nitrogen-fixing root nodulation, confined to four plant orders, encompasses two distinct types of associations, the interaction of legumes (Fabales) with rhizobia bacteria and actinorhizal symbioses, where the bacterial symbionts are actinomycetes of the genus Frankia. Although several genetic components of the host–symbiont interaction have been identified in legumes, the genetic basis of actinorhiza formation is unknown. Here, we show that the receptor-like kinase gene SymRK, which is required for nodulation in legumes, is also necessary for actinorhiza formation in the tree Casuarina glauca. This indicates that both types of nodulation symbiosis share genetic components. Like several other legume genes involved in the interaction with rhizobia, SymRK is also required for the interaction with arbuscular mycorrhiza (AM) fungi. We show that SymRK is involved in AM formation in C. glauca as well and can restore both nodulation and AM symbioses in a Lotus japonicus symrk mutant. Taken together, our results demonstrate that SymRK functions as a vital component of the genetic basis for both plant–fungal and plant–bacterial endosymbioses and is conserved between legumes and actinorhiza-forming Fagales. PMID:18316735
Application of NARX neural network in storm-time SYM-H index prediction from IMF and solar wind data
NASA Astrophysics Data System (ADS)
Cai, Lei; Ma, S. Y.; Zhou, Yunliang; Cai, Hongtao
In this study the NARX neural network has been used for the first time to predict high-resolution magnetic storm index of SYM-H from solar wind (SW) and IMF parameters. In total 73 great storm events with IMF/SW data available from ACE satellite during 1998 to 2006 are used to establish the ANN model. Out of them, 67 are used to train the network and the other 6 samples for test. Additionally, the NARX prediction model is also validated using IMF/SW data from WIND satellite for 7 great storms during 1995-1997 and 2005, as well as for the July 2000 Bastille day storm and November 2001 superstorm using Geotail and OMNI data at 1AU. Five interplanetary parameters of IMF Bz, By and total B components along with proton density and velocity of solar wind are used as the original external inputs of the neural network to predict the SYM-H index about one hour or an even longer time ahead. For the 6 test storms registered by ACE including two super-storms with minimum SYM-H less than -200 nT, the correlation coefficient between observed and NARX network predicted SYM-H is 0.95 as a whole, even as high as 0.95 and 0.98 with average relative variance of 13.2 percent and 7.4 percent for the two super-storms, respectively. The prediction for the 7 storms with WIND data is also satisfactory, showing averaged correlation coefficient about 0.91 and RMSE of 14.2 nT. The newly developed NARX model shows much better capability than Elman network for SYM-H prediction, which can partly be attributed to a key feedback to the input layer from the output neuron with a suitable length (about 120 min). This feedback means that nearly real information of the ring current status is effectively brought to taking part in the prediction of SYM-H index by ANN. The proper history length of the output-feedback may mainly reflect on average the characteristic time of ring current decay which involves various decay mechanisms with ion lifetimes from tens of minutes to tens of hours. Besides, it is
Belarmino, Luis Carlos; Silva, Roberta Lane de Oliveira; Cavalcanti, Nina da Mota Soares; Krezdorn, Nicolas; Kido, Ederson Akio; Horres, Ralf; Winter, Peter; Kahl, Günter; Benko-Iseppon, Ana Maria
2013-01-01
The rationale for gathering information from plants procuring nitrogen through symbiotic interactions controlled by a common genetic program for a sustainable biofuel production is the high energy demanding application of synthetic nitrogen fertilizers. We curated sequence information publicly available for the biofuel plant sugarcane, performed an analysis of the common SYM pathway known to control symbiosis in other plants, and provide results, sequences and literature links as an online database. Sugarcane sequences and informations were downloaded from the nucEST database, cleaned and trimmed with seqclean, assembled with TGICL plus translating mapping method, and annotated. The annotation is based on BLAST searches against a local formatted plant Uniprot90 generated with CD-HIT for functional assignment, rpsBLAST to CDD database for conserved domain analysis, and BLAST search to sorghum's for Gene Ontology (GO) assignment. Gene expression was normalized according the Unigene standard, presented as ESTs/100 kb. Protein sequences known in the SYM pathway were used as queries to search the SymGRASS sequence database. Additionally, antimicrobial peptides described in the PhytAMP database served as queries to retrieve and generate expression profiles of these defense genes in the libraries compared to the libraries obtained under symbiotic interactions. We describe the SymGRASS, a database of sugarcane orthologous genes involved in arbuscular mycorrhiza (AM) and root nodule (RN) symbiosis. The database aggregates knowledge about sequences, tissues, organ, developmental stages and experimental conditions, and provides annotation and level of gene expression for sugarcane transcripts and SYM orthologous genes in sugarcane through a web interface. Several candidate genes were found for all nodes in the pathway, and interestingly a set of symbiosis specific genes was found. The knowledge integrated in SymGRASS may guide studies on molecular, cellular and physiological
Sánchez-Martín, Francisco J; Bellosillo, Beatriz; Gelabert-Baldrich, Mariona; Dalmases, Alba; Cañadas, Israel; Vidal, Joana; Martinez, Alejandro; Argilés, Guillem; Siravegna, Giulia; Arena, Sabrina; Koefoed, Klaus; Visa, Laura; Arpí, Oriol; Horak, Ivan David; Iglesias, Mar; Stroh, Christopher; Kragh, Michael; Rovira, Ana; Albanell, Joan; Tabernero, Josep; Bardelli, Alberto; Montagut, Clara
2016-07-01
Approved anti-EGFR antibodies cetuximab and panitumumab provide significant clinical benefit in patients with metastatic colorectal cancer (MCRC). However, patients ultimately develop disease progression, often driven by acquisition of mutations in the extracellular domain (ECD) of EGFR. Sym004 is a novel 1:1 mixture of two nonoverlapping anti-EGFR mAbs that recently showed promising clinical activity in a phase I trial in MCRC. Our aim was to determine the efficacy of Sym004 to circumvent cetuximab resistance driven by EGFR ECD mutations. Functional studies were performed to assess drug-receptor binding as well as ligand-dependent activation of individual EGFR mutants in the presence of cetuximab, panitumumab, and Sym004. Cell viability and molecular effects of the drugs were assayed in cetuximab-resistant cell lines and in tumor xenograft models. Efficacy of Sym004 was evaluated in patients progressing to cetuximab that harbored EGFR mutation in the post-cetuximab tumor sample. Contrary to cetuximab and panitumumab, Sym004 effectively bound and abrogated ligand-induced phosphorylation of all individual EGFR mutants. Cells resistant to cetuximab harboring mutations in EGFR maintained sensitivity to Sym004, which was consistent with an effective suppression of EGFR downstream signaling, translating into profound and sustained tumor regression in the xenograft model. As proof-of-principle, a patient with a tumor harboring an EGFR mutation (G465R) following cetuximab therapy benefited from Sym004 therapy. Sym004 is an active drug in MCRC resistant to cetuximab/panitumumab mediated by EGFR mutations. EGFR mutations are potential biomarkers of response to Sym004 to be evaluated in ongoing large clinical trials. Clin Cancer Res; 22(13); 3260-7. ©2016 AACR. ©2016 American Association for Cancer Research.
High-energy amplitudes in N = 4 SYM in the next-to-leading order
Chirilli, Giovanni; Balitsky, Ian
2010-03-16
In this study, the high-energy behavior of the N = 4 SYM amplitudes in the Regge limit can be calculated order by order in perturbation theory using the high-energy operator expansion in Wilson lines. At large $N_c$, a typical four-point amplitude is determined by a single BFKL pomeron. The conformal structure of the four-point amplitude is fixed in terms of two functions: pomeron intercept and the coefficient function in front of the pomeron (the product of two residues). The pomeron intercept is universal while the coefficient function depends on the correlator in question. The intercept is known in the first two orders in coupling constant: BFKL intercept and NLO BFKL intercept calculated in Ref. 1. As an example of using the Wilson-line OPE, we calculate the coefficient function in front of the pomeron for the correlator of four $Z^2$ currents in the first two orders in perturbation theory.
Performance Analysis for Wireless Networks: An Analytical Approach by Multifarious Sym Teredo
Punithavathani, D. Shalini; Radley, Sheryl
2014-01-01
IPv4-IPv6 transition rolls out numerous challenges to the world of Internet as the Internet is drifting from IPv4 to IPv6. IETF recommends few transition techniques which includes dual stack and translation and tunneling. By means of tunneling the IPv6 packets over IPv4 UDP, Teredo maintains IPv4/IPv6 dual stack node in isolated IPv4 networks behindhand network address translation (NAT). However, the proposed tunneling protocol works with the symmetric and asymmetric NATs. In order to make a Teredo support several symmetric NATs along with several asymmetric NATs, we propose multifarious Sym Teredo (MTS), which is an extension of Teredo with a capability of navigating through several symmetric NATs. The work preserves the Teredo architecture and also offers a backward compatibility with the original Teredo protocol. PMID:25506611
Ne matrix spectra of the sym-C6Br3F3+ radical cation
Bondybey, V.E.; Sears, T.J.; Miller, T.A.; Vaughn, C.; English, J.H.; Shiley, R.S.
1981-01-01
The electronic absorption and laser excited, wavelength resolved fluorescence spectra of the title cation have been observed in solid Ne matrix and vibrationally analysed. The vibrational structure of the excited B2A2??? state shows close similarity to the parent compound. The X2E??? ground state structure is strongly perturbed and irregular owing to a large Jahn-Teller distortion. The data are analysed in terms of a recently developed, sophisticated multimode Jahn-Teller theoretical model. We have generated the sym-C6Br3F3+ cations in solid Ne matrix and obtained their wavelength resolved emission and absorption spectra. T ground electronic X2E??? state exhibits an irregular and strongly perturbed vibrational structure, which can be successfully modeled using sophisticated multimode Jahn-Teller theory. ?? 1981.
Performance analysis for wireless networks: an analytical approach by multifarious Sym Teredo.
Punithavathani, D Shalini; Radley, Sheryl
2014-01-01
IPv4-IPv6 transition rolls out numerous challenges to the world of Internet as the Internet is drifting from IPv4 to IPv6. IETF recommends few transition techniques which includes dual stack and translation and tunneling. By means of tunneling the IPv6 packets over IPv4 UDP, Teredo maintains IPv4/IPv6 dual stack node in isolated IPv4 networks behindhand network address translation (NAT). However, the proposed tunneling protocol works with the symmetric and asymmetric NATs. In order to make a Teredo support several symmetric NATs along with several asymmetric NATs, we propose multifarious Sym Teredo (MTS), which is an extension of Teredo with a capability of navigating through several symmetric NATs. The work preserves the Teredo architecture and also offers a backward compatibility with the original Teredo protocol.
Twistor transform of all tree amplitudes in N=4 SYM theory
NASA Astrophysics Data System (ADS)
Korchemsky, G. P.; Sokatchev, E.
2010-04-01
We perform the twistor (half-Fourier) transform of all tree n-particle superamplitudes in N=4 SYM and show that it has a transparent geometric interpretation. We find that the NMHV amplitude is supported on a set of 2k+1 intersecting lines in twistor space and demonstrate that the corresponding line moduli form a lightlike (2k+1)-gon in moduli space. This polygon is triangulated into two kinds of lightlike triangles lying in different planes. We formulate simple graphical rules for constructing the triangulated polygons, from which the analytic expressions of the NMHV amplitudes follow directly, both in twistor and in momentum space. We also discuss the ordinary and dual conformal properties and the cancellation of spurious singularities in twistor space.
The complete one-loop dilatation operator of planar real β-deformed = 4 SYM theory
NASA Astrophysics Data System (ADS)
Fokken, Jan; Sieg, Christoph; Wilhelm, Matthias
2014-07-01
We determine the missing finite-size corrections to the asymptotic one-loop dilatation operator of the real β-deformed = 4 SYM theory for the gauge groups U( N) and SU( N) in the 't Hooft limit. In the SU( N) case, the absence of the U(1) field components leads to a new kind of finite-size effect, which we call prewrapping. We classify which states are potentially affected by prewrapping at generic loop orders and comment on the necessity to include it into the integrability-based description. As a further result, we identify classes of n-point correlation functions which at all loop orders in the planar theory are given by the values of their undeformed counterparts. Finally, we determine the superconformal multiplet structure and one-loop anomalous dimensions of all single-trace states with classical scaling dimension Δ0 ≤ 4.5.
SymPix: A Spherical Grid for Efficient Sampling of Rotationally Invariant Operators
NASA Astrophysics Data System (ADS)
Seljebotn, D. S.; Eriksen, H. K.
2016-02-01
We present SymPix, a special-purpose spherical grid optimized for efficiently sampling rotationally invariant linear operators. This grid is conceptually similar to the Gauss-Legendre (GL) grid, aligning sample points with iso-latitude rings located on Legendre polynomial zeros. Unlike the GL grid, however, the number of grid points per ring varies as a function of latitude, avoiding expensive oversampling near the poles and ensuring nearly equal sky area per grid point. The ratio between the number of grid points in two neighboring rings is required to be a low-order rational number (3, 2, 1, 4/3, 5/4, or 6/5) to maintain a high degree of symmetries. Our main motivation for this grid is to solve linear systems using multi-grid methods, and to construct efficient preconditioners through pixel-space sampling of the linear operator in question. As a benchmark and representative example, we compute a preconditioner for a linear system that involves the operator \\widehat{{\\boldsymbol{D}}}+{\\widehat{{\\boldsymbol{B}}}}T{{\\boldsymbol{N}}}-1\\widehat{{\\boldsymbol{B}}}, where \\widehat{{\\boldsymbol{B}}} and \\widehat{{\\boldsymbol{D}}} may be described as both local and rotationally invariant operators, and {\\boldsymbol{N}} is diagonal in the pixel domain. For a bandwidth limit of {{\\ell }}{max} = 3000, we find that our new SymPix implementation yields average speed-ups of 360 and 23 for {\\widehat{{\\boldsymbol{B}}}}T{{\\boldsymbol{N}}}-1\\widehat{{\\boldsymbol{B}}} and \\widehat{{\\boldsymbol{D}}}, respectively, compared with the previous state-of-the-art implementation.
Dienstmann, Rodrigo; Patnaik, Amita; Garcia-Carbonero, Rocio; Cervantes, Andrés; Benavent, Marta; Roselló, Susana; Tops, Bastiaan B J; van der Post, Rachel S; Argilés, Guillem; Skartved, Niels J Ø; Hansen, Ulla H; Hald, Rikke; Pedersen, Mikkel W; Kragh, Michael; Horak, Ivan D; Braun, Stephan; Van Cutsem, Eric; Tolcher, Anthony W; Tabernero, Josep
2015-06-01
Tumor growth in the context of EGFR inhibitor resistance may remain EGFR-dependent and is mediated by mechanisms including compensatory ligand upregulation and de novo gene alterations. Sym004 is a two-antibody mixture targeting nonoverlapping EGFR epitopes. In preclinical models, Sym004 causes significant EGFR internalization and degradation, which translates into superior growth inhibition in the presence of ligands. In this phase I trial, we observed grade 3 skin toxicity and hypomagnesemia as mechanism-based dose-limiting events during dose escalation. In dose-expansion cohorts of 9 and 12 mg/kg of Sym004 weekly, patients with metastatic colorectal cancer and acquired EGFR inhibitor resistance were enrolled; 17 of 39 patients (44%) had tumor shrinkage, with 5 patients (13%) achieving partial response. Pharmacodynamic studies confirmed marked Sym004-induced EGFR downmodulation. MET gene amplification emerged in 1 patient during Sym004 treatment, and a partial response was seen in a patient with EGFR(S492R) mutation that is predictive of cetuximab resistance. Potent EGFR downmodulation with Sym004 in patients with metastatic colorectal cancer and acquired resistance to cetuximab/panitumumab translates into significant antitumor activity and validates the preclinical hypothesis that a proportion of tumors remains dependent on EGFR signaling. Further clinical development and expanded correlative analyses of response patterns with secondary RAS/EGFR mutations are warranted. ©2015 American Association for Cancer Research.
On a discrete symmetry of the Bremsstrahlung function in {N} = 4 SYM
NASA Astrophysics Data System (ADS)
Beccaria, Matteo; Macorini, Guido
2013-07-01
We consider the quark anti-quark potential on the three sphere in planar {N} = 4 SYM and the associated vacuum potential in the near BPS limit with L units of R-charge. The associated Bremsstrahlung function B L has been recently computed analytically by means of the Thermodynamical Bethe Ansatz. We discuss it at strong coupling by computing it at large but finite L. We provide strong support to a special symmetry of the Bremsstrahlung function under the formal discrete {{{Z}}_2} symmetry L → -1 - L. In this context, it is the counterpart of the reciprocity invariance discovered in the past in the spectrum of various gauge invariant composite operators. The {{{Z}}_2} symmetry has remarkable consequences in the scaling limit where L is taken to be large with fixed ratio to the 't Hooft coupling. This limit organizes in inverse powers of the coupling and resembles the semiclassical expansion of the dual string theory which is indeed known to capture the leading classical term. We show that the various higher-order contributions to the Bremsstrahlung function obey several constraints and, in particular, the next-to-leading term, formally associated with the string one-loop correction, is completely determined by the classical contribution. The large L limit at strong coupling is also discussed.
High-energy amplitudes in N = 4 SYM in the next-to-leading order
Chirilli, Giovanni; Balitsky, Ian
2010-03-16
In this study, the high-energy behavior of the N = 4 SYM amplitudes in the Regge limit can be calculated order by order in perturbation theory using the high-energy operator expansion in Wilson lines. At largemore » $$N_c$$, a typical four-point amplitude is determined by a single BFKL pomeron. The conformal structure of the four-point amplitude is fixed in terms of two functions: pomeron intercept and the coefficient function in front of the pomeron (the product of two residues). The pomeron intercept is universal while the coefficient function depends on the correlator in question. The intercept is known in the first two orders in coupling constant: BFKL intercept and NLO BFKL intercept calculated in Ref. 1. As an example of using the Wilson-line OPE, we calculate the coefficient function in front of the pomeron for the correlator of four $Z^2$ currents in the first two orders in perturbation theory.« less
Multi-loop positivity of the planar N = 4 SYM six-point amplitude
NASA Astrophysics Data System (ADS)
Dixon, Lance J.; von Hippel, Matt; McLeod, Andrew J.; Trnka, Jaroslav
2017-02-01
We study the six-point NMHV ratio function in planar N = 4 SYM theory in the context of positive geometry. The Amplituhedron construction of the integrand for the amplitudes provides a kinematical region in which the integrand was observed to be positive. It is natural to conjecture that this property survives integration, i.e. that the final result for the ratio function is also positive in this region. Establishing such a result would imply that preserving positivity is a surprising property of the Minkowski contour of integration and it might indicate some deeper underlying structure. We find that the ratio function is positive everywhere we have tested it, including analytic results for special kinematical regions at one and two loops, as well as robust numerical evidence through five loops. There is also evidence for not just positivity, but monotonicity in a "radial" direction. We also investigate positivity of the MHV six-gluon amplitude. While the remainder function ceases to be positive at four loops, the BDS-like normalized MHV amplitude appears to be positive through five loops.
The low-energy N = 4 SYM effective action in diverse harmonic superspaces
NASA Astrophysics Data System (ADS)
Buchbinder, I. L.; Ivanov, E. A.; Samsonov, I. B.
2017-05-01
We review various superspace approaches to the description of the low-energy effective action in N = 4 super Yang-Mills (SYM) theory. We consider the four-derivative part of the low-energy effective action in the Coulomb branch. The typical components of this effective action are the gauge field F 4/ X 4 and the scalar field Wess-Zumino terms. We construct N = 4 supersymmetric completions of these terms in the framework of different harmonic superspaces supporting N = 2,3,4 supersymmetries. These approaches are complementary to each other in the sense that they make manifest different subgroups of the total SU(4) R-symmetry group. We show that the effective action acquires an extremely simple form in those superspaces which manifest the non-anomalous maximal subgroups of SU(4). The common characteristic feature of our construction is that we restore the superfield effective actions exclusively by employing the N = 4 supersymmetry and/or superconformal PSU(2, 2| 4) symmetry.
Multi-loop positivity of the planar $$ \\mathcal{N} $$ = 4 SYM six-point amplitude
Dixon, Lance J.; von Hippel, Matt; McLeod, Andrew J.; ...
2017-02-22
We study the six-point NMHV ratio function in planarmore » $$ \\mathcal{N} $$ = 4 SYM theory in the context of positive geometry. The Amplituhedron construction of the integrand for the amplitudes provides a kinematical region in which the integrand was observed to be positive. It is natural to conjecture that this property survives integration, i.e. that the final result for the ratio function is also positive in this region. Establishing such a result would imply that preserving positivity is a surprising property of the Minkowski contour of integration and it might indicate some deeper underlying structure. We find that the ratio function is positive everywhere we have tested it, including analytic results for special kinematical regions at one and two loops, as well as robust numerical evidence through five loops. There is also evidence for not just positivity, but monotonicity in a “radial” direction. We also investigate positivity of the MHV six-gluon amplitude. While the remainder function ceases to be positive at four loops, the BDS-like normalized MHV amplitude appears to be positive through five loops.« less
Quantum spectral curve at work: from small spin to strong coupling in = 4 SYM
NASA Astrophysics Data System (ADS)
Gromov, Nikolay; Levkovich-Maslyuk, Fedor; Sizov, Grigory; Valatka, Saulius
2014-07-01
We apply the recently proposed quantum spectral curve technique to the study of twist operators in planar = 4 SYM theory. We focus on the small spin expansion of anomalous dimensions in the sl(2) sector and compute its first two orders exactly for any value of the `t Hooft coupling. At leading order in the spin S we reproduced Basso's slope function. The next term of order S 2 structurally resembles the Beisert-Eden-Staudacher dressing phase and takes into account wrapping contributions. This expansion contains rich information about the spectrum of local operators at strong coupling. In particular, we found a new coefficient in the strong coupling expansion of the Konishi operator dimension and confirmed several previously known terms. We also obtained several new orders of the strong coupling expansion of the BFKL pomeron intercept. As a by-product we formulated a prescription for the correct analytical continuation in S which opens a way for deriving the BFKL regime of twist two anomalous dimensions from AdS/CFT integrability.
Apple, F S; Maturen, A J; Mullins, R E; Painter, P C; Pessin-Minsley, M S; Webster, R A; Spray Flores, J; DeCresce, R; Fink, D J; Buckley, P M; Marsh, J; Ricchiuti, V; Christenson, R H
1999-02-01
We evaluated the AxSYM troponin I (cTnI) immunoassay for assisting in the detection of acute myocardial infarction (AMI). At four sites, the total imprecision (CV) over 20 days was 6.3-10.2%. The minimum detectable concentration was 0.14 +/- 0.05 microgram/L. Comparison of cTnI measurements between the AxSYM and Stratus (n = 406) over the dynamic range of the AxSYM assay demonstrated good correlation, r = 0.881, with a proportional bias: AxSYM cTnI = 3.50(Stratus cTnI) - 1. 10. The confidence intervals (95%) for the slope and intercept were 3.39-3.64 and -1.32 to -0.95, respectively. The expected cTnI concentration in healthy individuals was SYM cTnI with the Stratus cTnI, OPUS cTnI, and Access cTnI were 95.3%, 95.1%, and 94.3%, respectively, from patients with suspected AMI. The AxSYM cTnI demonstrated excellent clinical specificity, >/=96%, in skeletal muscle injury, chronic renal disease, and same-day noncardiac surgery patients.
Li, Ronghui; Knox, Maggie R; Edwards, Anne; Hogg, Bridget; Ellis, T H Noel; Wei, Gehong; Downie, J Allan
2011-11-01
Rhizobium leguminosarum bv. viciae, which nodulates pea and vetch, makes a mixture of secreted nodulation signals (Nod factors) carrying either a C18:4 or a C18:1 N-linked acyl chain. Mutation of nodE blocks the formation of the C18:4 acyl chain, and nodE mutants, which produce only C18:1-containing Nod factors, are less efficient at nodulating pea. However, there is significant natural variation in the levels of nodulation of different pea cultivars by a nodE mutant of R. leguminosarum bv. viciae. Using recombinant inbred lines from two pea cultivars, one which nodulated relatively well and one very poorly by the nodE mutant, we mapped the nodE-dependent nodulation phenotype to a locus on pea linkage group I. This was close to Sym37 and PsK1, predicted to encode LysM-domain Nod-factor receptor-like proteins; the Sym2 locus that confers Nod-factor-specific nodulation is also in this region. We confirmed the map location using an introgression line carrying this region. Our data indicate that the nodE-dependent nodulation is not determined by the Sym2 locus. We identified several pea lines that are nodulated very poorly by the R. leguminosarum bv. viciae nodE mutant, sequenced the DNA of the predicted LysM-receptor domains of Sym37 and PsK1, and compared the sequences with those derived from pea cultivars that were relatively well nodulated by the nodE mutant. This revealed that one haplotype (encoding six conserved polymorphisms) of Sym37 is associated with very poor nodulation by the nodE mutant. There was no such correlation with polymorphisms at the PsK1 locus. We conclude that the natural variation in nodE-dependent nodulation in pea is most probably determined by the Sym37 haplotype.
Domínguez-Ferreras, Ana ; Pérez-Arnedo, Rebeca; Becker, Anke; Olivares, José; Soto, María J.; Sanjuán, Juan
2006-01-01
In this work, DNA microarrays were used to investigate genome-wide transcriptional responses of Sinorhizobium meliloti to a sudden increase in external osmolarity elicited by addition of either NaCl or sucrose to exponentially growing cultures. A time course of the response within the first 4 h after the osmotic shock was established. We found that there was a general redundancy in the differentially expressed genes after NaCl or sucrose addition. Both kinds of stress resulted in induction of a large number of genes having unknown functions and in repression of many genes coding for proteins with known functions. There was a strong replicon bias in the pattern of the osmotic stress response; whereas 64% of the upregulated genes had a plasmid localization, 85% of the downregulated genes were chromosomal. Among the pSymB osmoresponsive genes, 83% were upregulated, suggesting the importance of this plasmid for S. meliloti osmoadaptation. Indeed, we identified a 200-kb region in pSymB needed for adaptation to saline shock which has a high density of osmoregulated genes. PMID:16916894
Interpolation and Approximation Theory.
ERIC Educational Resources Information Center
Kaijser, Sten
1991-01-01
Introduced are the basic ideas of interpolation and approximation theory through a combination of theory and exercises written for extramural education at the university level. Topics treated are spline methods, Lagrange interpolation, trigonometric approximation, Fourier series, and polynomial approximation. (MDH)
NASA Technical Reports Server (NTRS)
Strauss, M. J.; Taylor, S. P. B.; Shindo, H.
1972-01-01
Interesting similarities have been shown between the reactions of sym-trinitrobenzene with cycloalkanones, and with phloroglucinol. Previously unsuspected common intermediates have been shown to intervene. The structurally similar products in each case are tricyclic nitropropene nitronates. Protonation of these yields the corresponding nitronic acids in certain instances.
USDA-ARS?s Scientific Manuscript database
A nitrogen-fixing alfalfa-nodulating microsymbiont, Sinorhizobium meliloti, has a genome consisting of a 3.5 Mbp circular chromosome and two megaplasmids totaling 3.0 Mbp, one a 1.3 Mbp pSymA carrying nonessential ‘accessory’ genes including nif, nod and others involved in plant interaction. Predict...
A piece of cake: the ground-state energies in γ i -deformed = 4 SYM theory at leading wrapping order
NASA Astrophysics Data System (ADS)
Fokken, Jan; Sieg, Christoph; Wilhelm, Matthias
2014-09-01
In the non-supersymmetric γi-deformed = 4 SYM theory, the scaling dimensions of the operators tr[ Z L ] composed of L scalar fields Z receive finite-size wrapping and prewrapping corrections in the 't Hooft limit. In this paper, we calculate these scaling dimensions to leading wrapping order directly from Feynman diagrams. For L ≥ 3, the result is proportional to the maximally transcendental `cake' integral. It matches with an earlier result obtained from the integrability-based Lüscher corrections, TBA and Y-system equations. At L = 2, where the integrability-based equations yield infinity, we find a finite rational result. This result is renormalization-scheme dependent due to the non-vanishing β-function of an induced quartic scalar double-trace coupling, on which we have reported earlier. This explicitly shows that conformal invariance is broken — even in the 't Hooft limit. [Figure not available: see fulltext.
Rasin, A.
1994-04-01
We discuss the idea of approximate flavor symmetries. Relations between approximate flavor symmetries and natural flavor conservation and democracy models is explored. Implications for neutrino physics are also discussed.
NASA Astrophysics Data System (ADS)
Niiniluoto, Ilkka
2014-03-01
Approximation of laws is an important theme in the philosophy of science. If we can make sense of the idea that two scientific laws are "close" to each other, then we can also analyze such methodological notions as approximate explanation of laws, approximate reduction of theories, approximate empirical success of theories, and approximate truth of laws. Proposals for measuring the distance between quantitative scientific laws were given in Niiniluoto (1982, 1987). In this paper, these definitions are reconsidered as a response to the interesting critical remarks by Liu (1999).
Approximate symmetries of Hamiltonians
NASA Astrophysics Data System (ADS)
Chubb, Christopher T.; Flammia, Steven T.
2017-08-01
We explore the relationship between approximate symmetries of a gapped Hamiltonian and the structure of its ground space. We start by considering approximate symmetry operators, defined as unitary operators whose commutators with the Hamiltonian have norms that are sufficiently small. We show that when approximate symmetry operators can be restricted to the ground space while approximately preserving certain mutual commutation relations. We generalize the Stone-von Neumann theorem to matrices that approximately satisfy the canonical (Heisenberg-Weyl-type) commutation relations and use this to show that approximate symmetry operators can certify the degeneracy of the ground space even though they only approximately form a group. Importantly, the notions of "approximate" and "small" are all independent of the dimension of the ambient Hilbert space and depend only on the degeneracy in the ground space. Our analysis additionally holds for any gapped band of sufficiently small width in the excited spectrum of the Hamiltonian, and we discuss applications of these ideas to topological quantum phases of matter and topological quantum error correcting codes. Finally, in our analysis, we also provide an exponential improvement upon bounds concerning the existence of shared approximate eigenvectors of approximately commuting operators under an added normality constraint, which may be of independent interest.
Tai, David; Fang, Jianwen
2012-08-27
The large sizes of today's chemical databases require efficient algorithms to perform similarity searches. It can be very time consuming to compare two large chemical databases. This paper seeks to build upon existing research efforts by describing a novel strategy for accelerating existing search algorithms for comparing large chemical collections. The quest for efficiency has focused on developing better indexing algorithms by creating heuristics for searching individual chemical against a chemical library by detecting and eliminating needless similarity calculations. For comparing two chemical collections, these algorithms simply execute searches for each chemical in the query set sequentially. The strategy presented in this paper achieves a speedup upon these algorithms by indexing the set of all query chemicals so redundant calculations that arise in the case of sequential searches are eliminated. We implement this novel algorithm by developing a similarity search program called Symmetric inDexing or SymDex. SymDex shows over a 232% maximum speedup compared to the state-of-the-art single query search algorithm over real data for various fingerprint lengths. Considerable speedup is even seen for batch searches where query set sizes are relatively small compared to typical database sizes. To the best of our knowledge, SymDex is the first search algorithm designed specifically for comparing chemical libraries. It can be adapted to most, if not all, existing indexing algorithms and shows potential for accelerating future similarity search algorithms for comparing chemical databases.
NASA Technical Reports Server (NTRS)
Dutta, Soumitra
1988-01-01
A model for approximate spatial reasoning using fuzzy logic to represent the uncertainty in the environment is presented. Algorithms are developed which can be used to reason about spatial information expressed in the form of approximate linguistic descriptions similar to the kind of spatial information processed by humans. Particular attention is given to static spatial reasoning.
NASA Technical Reports Server (NTRS)
Dutta, Soumitra
1988-01-01
A model for approximate spatial reasoning using fuzzy logic to represent the uncertainty in the environment is presented. Algorithms are developed which can be used to reason about spatial information expressed in the form of approximate linguistic descriptions similar to the kind of spatial information processed by humans. Particular attention is given to static spatial reasoning.
NASA Astrophysics Data System (ADS)
Barry, D. A.; Parlange, J.-Y.; Li, L.; Jeng, D.-S.; Crapper, M.
2005-10-01
The solution to the Green and Ampt infiltration equation is expressible in terms of the Lambert W-1 function. Approximations for Green and Ampt infiltration are thus derivable from approximations for the W-1 function and vice versa. An infinite family of asymptotic expansions to W-1 is presented. Although these expansions do not converge near the branch point of the W function (corresponds to Green-Ampt infiltration with immediate ponding), a method is presented for approximating W-1 that is exact at the branch point and asymptotically, with interpolation between these limits. Some existing and several new simple and compact yet robust approximations applicable to Green-Ampt infiltration and flux are presented, the most accurate of which has a maximum relative error of 5 × 10 -5%. This error is orders of magnitude lower than any existing analytical approximations.
Intrinsic Nilpotent Approximation.
1985-06-01
RD-A1II58 265 INTRINSIC NILPOTENT APPROXIMATION(U) MASSACHUSETTS INST 1/2 OF TECH CAMBRIDGE LAB FOR INFORMATION AND, DECISION UMCLRSSI SYSTEMS C...TYPE OF REPORT & PERIOD COVERED Intrinsic Nilpotent Approximation Technical Report 6. PERFORMING ORG. REPORT NUMBER LIDS-R-1482 7. AUTHOR(.) S...certain infinite-dimensional filtered Lie algebras L by (finite-dimensional) graded nilpotent Lie algebras or g . where x E M, (x,,Z) E T*M/O. It
Anomalous diffraction approximation limits
NASA Astrophysics Data System (ADS)
Videen, Gorden; Chýlek, Petr
It has been reported in a recent article [Liu, C., Jonas, P.R., Saunders, C.P.R., 1996. Accuracy of the anomalous diffraction approximation to light scattering by column-like ice crystals. Atmos. Res., 41, pp. 63-69] that the anomalous diffraction approximation (ADA) accuracy does not depend on particle refractive index, but instead is dependent on the particle size parameter. Since this is at odds with previous research, we thought these results warranted further discussion.
NASA Technical Reports Server (NTRS)
Dutta, Soumitra
1988-01-01
Much of human reasoning is approximate in nature. Formal models of reasoning traditionally try to be precise and reject the fuzziness of concepts in natural use and replace them with non-fuzzy scientific explicata by a process of precisiation. As an alternate to this approach, it has been suggested that rather than regard human reasoning processes as themselves approximating to some more refined and exact logical process that can be carried out with mathematical precision, the essence and power of human reasoning is in its capability to grasp and use inexact concepts directly. This view is supported by the widespread fuzziness of simple everyday terms (e.g., near tall) and the complexity of ordinary tasks (e.g., cleaning a room). Spatial reasoning is an area where humans consistently reason approximately with demonstrably good results. Consider the case of crossing a traffic intersection. We have only an approximate idea of the locations and speeds of various obstacles (e.g., persons and vehicles), but we nevertheless manage to cross such traffic intersections without any harm. The details of our mental processes which enable us to carry out such intricate tasks in such apparently simple manner are not well understood. However, it is that we try to incorporate such approximate reasoning techniques in our computer systems. Approximate spatial reasoning is very important for intelligent mobile agents (e.g., robots), specially for those operating in uncertain or unknown or dynamic domains.
Approximate kernel competitive learning.
Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang
2015-03-01
Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches.
Dyson-Schwinger equations and {N}=4 SYM in Landau gauge
NASA Astrophysics Data System (ADS)
Maas, Axel; Zitz, Stefan
2016-03-01
{N}=4 Super Yang-Mills theory is a highly constrained theory, and therefore a valuable tool to test the understanding of less constrained Yang-Mills theories. Our aim is to use it to test our understanding of both the Landau gauge beyond perturbation theory and the truncations of Dyson-Schwinger equations in ordinary Yang-Mills theories. We derive the corresponding equations within the usual one-loop truncation for the propagators after imposing the Landau gauge. We find a conformal solution in this approximation, which surprisingly resembles many aspects of ordinary Yang-Mills theories. We furthermore discuss which role the Gribov-Singer ambiguity in this context could play, should it exist in this theory.
On the cusp anomalous dimension in the ladder limit of mathcal{N}=4 SYM
NASA Astrophysics Data System (ADS)
Beccaria, Matteo; Fachechi, Alberto; Macorini, Guido
2016-06-01
We analyze the cusp anomalous dimension in the (leading) ladder limit of mathcal{N}=4 SYMandpresentnewresultsforitshigher-orderperturbativeexpansion. Westudy two different limits with respect to the cusp angle ϕ. The first is the light-like regime where x = e iϕ → 0. This limit is characterised by a non-trivial expansion of the cusp anomaly as a sum of powers of log x, where the maximum exponent increases with the loop order. The coefficients of this expansion have remarkable transcendentality features and can be expressed by products of single zeta values. We show that the whole logarithmic expansion is fully captured by a solvable Woods-Saxon like one-dimensional potential. From the exact solution, we extract generating functions for the cusp anomaly as well as for the various specific transcendental structures appearing therein. The second limit that we discuss is the regime of small cusp angle. In this somewhat simpler case, we show how to organise the quantum mechanical perturbation theory in a novel efficient way by means of a suitable all-order Ansatz for the ground state of the associated Schrödinger problem. Our perturbative setup allows to systematically derive higher-order perturbative corrections in powers of the cusp angle as explicit non-perturbative functions of the effective coupling. This series approximation is compared with the numerical solution of the Schrödinger equation to show that we can achieve very good accuracy over the whole range of coupling and cusp angle. Our results have been obtained by relatively simple techniques. Nevertheless, they provide several non-trivial tests useful to check the application of Quantum Spectral Curve methods to the ladder approximation at non zero ϕ, in the two limits we studied.
Covariant approximation averaging
NASA Astrophysics Data System (ADS)
Shintani, Eigo; Arthur, Rudy; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph
2015-06-01
We present a new class of statistical error reduction techniques for Monte Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in Nf=2 +1 lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte Carlo calculations over conventional methods for the same cost.
Approximate Bayesian Computation
NASA Astrophysics Data System (ADS)
Cisewski, Jessi
2015-08-01
Explicitly specifying a likelihood function is becoming increasingly difficult for many problems in astronomy. Astronomers often specify a simpler approximate likelihood - leaving out important aspects of a more realistic model. Approximate Bayesian computation (ABC) provides a framework for performing inference in cases where the likelihood is not available or intractable. I will introduce ABC and explain how it can be a useful tool for astronomers. In particular, I will focus on the eccentricity distribution for a sample of exoplanets with multiple sub-populations.
Pierre Curie et le rôle de la symétrie dans les lois physiques
NASA Astrophysics Data System (ADS)
de Gennes, P. G.
Pierre et Jacques Curie découvraient il y a cent ans le phénomène de piézoélectricité : comment un cristal, de suffisamment basse symétrie, développe une polarization lorsqu'il est soumis à une contrainte mécanique. Pierre Curie n'a alors que 21 ans ! Et pourtant ses notes lapidaires aux Comptes Rendus datées de 1880 et 1881 [1] portent en elles tout l'essentiel du phénomène : charges superficielles proportionnelles à la pression, indépendantes de l'épaisseur du cristal, etc. Lorsque quelques mois plus tard, Lippmann prédit l'effet inverse (déformation du crystal sous champ électrique), les frères Curie imaginent tout de suite un dispositif admirablement simple pour détecter ces très faibles déformations. Ils couplent mécaniquement le cristal étudié avec un deuxième cristal piézoélectrique qui joue le rôle d'un détecteur; ce dernier transforme le signal mécanique du premier cristal en un signal électrique mesuré a l'électromètre ! Les résultats confirment brillamment la prédiction de Lippmann. Et pourtant, les moyens engagés sont très modestes — les champs électriques, par exemple, sont calibrés par la longueur d'une décharge dans l'air…
Multicriteria approximation through decomposition
Burch, C.; Krumke, S.; Marathe, M.; Phillips, C.; Sundberg, E.
1998-06-01
The authors propose a general technique called solution decomposition to devise approximation algorithms with provable performance guarantees. The technique is applicable to a large class of combinatorial optimization problems that can be formulated as integer linear programs. Two key ingredients of their technique involve finding a decomposition of a fractional solution into a convex combination of feasible integral solutions and devising generic approximation algorithms based on calls to such decompositions as oracles. The technique is closely related to randomized rounding. Their method yields as corollaries unified solutions to a number of well studied problems and it provides the first approximation algorithms with provable guarantees for a number of new problems. The particular results obtained in this paper include the following: (1) the authors demonstrate how the technique can be used to provide more understanding of previous results and new algorithms for classical problems such as Multicriteria Spanning Trees, and Suitcase Packing; (2) they also show how the ideas can be extended to apply to multicriteria optimization problems, in which they wish to minimize a certain objective function subject to one or more budget constraints. As corollaries they obtain first non-trivial multicriteria approximation algorithms for problems including the k-Hurdle and the Network Inhibition problems.
Multicriteria approximation through decomposition
Burch, C. |; Krumke, S.; Marathe, M.; Phillips, C.; Sundberg, E. |
1997-12-01
The authors propose a general technique called solution decomposition to devise approximation algorithms with provable performance guarantees. The technique is applicable to a large class of combinatorial optimization problems that can be formulated as integer linear programs. Two key ingredients of the technique involve finding a decomposition of a fractional solution into a convex combination of feasible integral solutions and devising generic approximation algorithms based on calls to such decompositions as oracles. The technique is closely related to randomized rounding. The method yields as corollaries unified solutions to a number of well studied problems and it provides the first approximation algorithms with provable guarantees for a number of new problems. The particular results obtained in this paper include the following: (1) The authors demonstrate how the technique can be used to provide more understanding of previous results and new algorithms for classical problems such as Multicriteria Spanning Trees, and Suitcase Packing. (2) They show how the ideas can be extended to apply to multicriteria optimization problems, in which they wish to minimize a certain objective function subject to one or more budget constraints. As corollaries they obtain first non-trivial multicriteria approximation algorithms for problems including the k-Hurdle and the Network Inhibition problems.
ERIC Educational Resources Information Center
Wolff, Hans
This paper deals with a stochastic process for the approximation of the root of a regression equation. This process was first suggested by Robbins and Monro. The main result here is a necessary and sufficient condition on the iteration coefficients for convergence of the process (convergence with probability one and convergence in the quadratic…
Approximating Integrals Using Probability
ERIC Educational Resources Information Center
Maruszewski, Richard F., Jr.; Caudle, Kyle A.
2005-01-01
As part of a discussion on Monte Carlo methods, which outlines how to use probability expectations to approximate the value of a definite integral. The purpose of this paper is to elaborate on this technique and then to show several examples using visual basic as a programming tool. It is an interesting method because it combines two branches of…
Approximating Integrals Using Probability
ERIC Educational Resources Information Center
Maruszewski, Richard F., Jr.; Caudle, Kyle A.
2005-01-01
As part of a discussion on Monte Carlo methods, which outlines how to use probability expectations to approximate the value of a definite integral. The purpose of this paper is to elaborate on this technique and then to show several examples using visual basic as a programming tool. It is an interesting method because it combines two branches of…
Optimizing the Zeldovich approximation
NASA Technical Reports Server (NTRS)
Melott, Adrian L.; Pellman, Todd F.; Shandarin, Sergei F.
1994-01-01
We have recently learned that the Zeldovich approximation can be successfully used for a far wider range of gravitational instability scenarios than formerly proposed; we study here how to extend this range. In previous work (Coles, Melott and Shandarin 1993, hereafter CMS) we studied the accuracy of several analytic approximations to gravitational clustering in the mildly nonlinear regime. We found that what we called the 'truncated Zeldovich approximation' (TZA) was better than any other (except in one case the ordinary Zeldovich approximation) over a wide range from linear to mildly nonlinear (sigma approximately 3) regimes. TZA was specified by setting Fourier amplitudes equal to zero for all wavenumbers greater than k(sub nl), where k(sub nl) marks the transition to the nonlinear regime. Here, we study the cross correlation of generalized TZA with a group of n-body simulations for three shapes of window function: sharp k-truncation (as in CMS), a tophat in coordinate space, or a Gaussian. We also study the variation in the crosscorrelation as a function of initial truncation scale within each type. We find that k-truncation, which was so much better than other things tried in CMS, is the worst of these three window shapes. We find that a Gaussian window e(exp(-k(exp 2)/2k(exp 2, sub G))) applied to the initial Fourier amplitudes is the best choice. It produces a greatly improved crosscorrelation in those cases which most needed improvement, e.g. those with more small-scale power in the initial conditions. The optimum choice of kG for the Gaussian window is (a somewhat spectrum-dependent) 1 to 1.5 times k(sub nl). Although all three windows produce similar power spectra and density distribution functions after application of the Zeldovich approximation, the agreement of the phases of the Fourier components with the n-body simulation is better for the Gaussian window. We therefore ascribe the success of the best-choice Gaussian window to its superior treatment
NASA Technical Reports Server (NTRS)
Merrill, W. C.
1978-01-01
The Routh approximation technique for reducing the complexity of system models was applied in the frequency domain to a 16th order, state variable model of the F100 engine and to a 43d order, transfer function model of a launch vehicle boost pump pressure regulator. The results motivate extending the frequency domain formulation of the Routh method to the time domain in order to handle the state variable formulation directly. The time domain formulation was derived and a characterization that specifies all possible Routh similarity transformations was given. The characterization was computed by solving two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described, and some results are given. Additional computational problems are discussed, including an optimization procedure that can improve the approximation accuracy by taking advantage of the transformation characterization.
Topics in Metric Approximation
NASA Astrophysics Data System (ADS)
Leeb, William Edward
This thesis develops effective approximations of certain metrics that occur frequently in pure and applied mathematics. We show that distances that often arise in applications, such as the Earth Mover's Distance between two probability measures, can be approximated by easily computed formulas for a wide variety of ground distances. We develop simple and easily computed characterizations both of norms measuring a function's regularity -- such as the Lipschitz norm -- and of their duals. We are particularly concerned with the tensor product of metric spaces, where the natural notion of regularity is not the Lipschitz condition but the mixed Lipschitz condition. A theme that runs throughout this thesis is that snowflake metrics (metrics raised to a power less than 1) are often better-behaved than ordinary metrics. For example, we show that snowflake metrics on finite spaces can be approximated by the average of tree metrics with a distortion bounded by intrinsic geometric characteristics of the space and not the number of points. Many of the metrics for which we characterize the Lipschitz space and its dual are snowflake metrics. We also present applications of the characterization of certain regularity norms to the problem of recovering a matrix that has been corrupted by noise. We are able to achieve an optimal rate of recovery for certain families of matrices by exploiting the relationship between mixed-variable regularity conditions and the decay of a function's coefficients in a certain orthonormal basis.
diCenzo, George; Milunovic, Branislava; Cheng, Jiujun; Finan, Turlough M
2013-01-01
Bacterial genomes with two (or more) chromosome-like replicons are known, and these appear to be particularly frequent in alphaproteobacteria. The genome of the N(2)-fixing alfalfa symbiont Sinorhizobium meliloti 1021 contains a 3.7-Mb chromosome and 1.4-Mb (pSymA) and 1.7-Mb (pSymB) megaplasmids. In this study, the tRNA(arg) and engA genes, located on the pSymB megaplasmid, are shown to be essential for growth. These genes could be deleted from pSymB when copies were previously integrated into the chromosome. However, in the closely related strain Sinorhizobium fredii NGR234, the tRNA(arg) and engA genes are located on the chromosome, in a 69-kb region designated the engA-tRNA(arg)-rmlC region. This region includes bacA, a gene that is important for intracellular survival during host-bacterium interactions for S. meliloti and the related alphaproteobacterium Brucella abortus. The engA-tRNA(arg)-rmlC region lies between the kdgK and dppF2 (NGR_c24410) genes on the S. fredii chromosome. Synteny analysis showed that kdgK and dppF2 orthologues are adjacent to each other on the chromosomes of 15 sequenced strains of S. meliloti and Sinorhizobium medicae, whereas the 69-kb engA-tRNA(arg)-rmlC region is present on the pSymB-equivalent megaplasmids. This and other evidence strongly suggests that the engA-tRNA(arg)-rmlC region translocated from the chromosome to the progenitor of pSymB in an ancestor common to S. meliloti and S. medicae. To our knowledge, this work represents one of the first experimental demonstrations that essential genes are present on a megaplasmid.
Chalasani, P.; Saias, I.; Jha, S.
1996-04-08
As increasingly large volumes of sophisticated options (called derivative securities) are traded in world financial markets, determining a fair price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-discounted value of the future cash flow on an n-period stock price path. Path-dependent options are particularly difficult to value since the future cash flow depends on the entire stock price path rather than on just the final stock price. Currently such options are approximately priced by Monte carlo methods with error bounds that hold only with high probability and which are reduced by increasing the number of simulation runs. In this paper the authors show that pricing an arbitrary path-dependent option is {number_sign}-P hard. They show that certain types f path-dependent options can be valued exactly in polynomial time. Asian options are path-dependent options that are particularly hard to price, and for these they design deterministic polynomial-time approximate algorithms. They show that the value of a perpetual American put option (which can be computed in constant time) is in many cases a good approximation to the value of an otherwise identical n-period American put option. In contrast to Monte Carlo methods, the algorithms have guaranteed error bounds that are polynormally small (and in some cases exponentially small) in the maturity n. For the error analysis they derive large-deviation results for random walks that may be of independent interest.
Beyond the Kirchhoff approximation
NASA Technical Reports Server (NTRS)
Rodriguez, Ernesto
1989-01-01
The three most successful models for describing scattering from random rough surfaces are the Kirchhoff approximation (KA), the small-perturbation method (SPM), and the two-scale-roughness (or composite roughness) surface-scattering (TSR) models. In this paper it is shown how these three models can be derived rigorously from one perturbation expansion based on the extinction theorem for scalar waves scattering from perfectly rigid surface. It is also shown how corrections to the KA proportional to the surface curvature and higher-order derivatives may be obtained. Using these results, the scattering cross section is derived for various surface models.
Renalier, M H; Batut, J; Ghai, J; Terzaghi, B; Gherardi, M; David, M; Garnerone, A M; Vasse, J; Truchet, G; Huguet, T
1987-01-01
A 290-kilobase (kb) region of the Rhizobium meliloti 2011 pSym megaplasmid, which contains nodulation genes (nod) as well as genes involved in nitrogen fixation (nif and fix), was shown to carry at least six sequences repeated elsewhere in the genome. One of these reiterated sequences, about 5 kb in size, had previously been identified as part of a cluster of fix genes located 220 kb downstream of the nifHDK promoter. Deletion of the reiterated part of this fix cluster does not alter the symbiotic phenotype. Deletion of the second copy of this reiterated sequence, which maps on pSym 40 kb upstream of the nifHDK promoter, also has no effect. Deletion of both of these copies however leads to a Fix- phenotype, indicating that both sequences carry functionally reiterated fix gene(s). The fix copy 40 kb upstream of nifHDK is part of a symbiotic cluster which also carries a nod locus, the deletion of which produces a marked delay in nodulation. Images PMID:3571166
Russell, James H B; Kiddy, Harriet C; Mercer, Nigel S
2014-07-01
The SymNose computer program has been proposed as an objective method for the quantitative assessment of lip symmetry following unilateral cleft lip repair. This study aims to demonstrate the use of SymNose in patients with complete bilateral cleft lip and palate (BCLP), a group previously excluded from computer-based analysis. A retrospective cohort study compared several parameters of lip symmetry between BCLP cases and non-cleft controls. 15 BCLP cases aged 10 (±1 year) who had undergone primary repair were recruited from the patient database at the South West Cleft Unit, Frenchay Hospital. Frontal facial photographs were selected for measurement. 15 age-matched controls were recruited from a local school. Lip symmetry was expressed as: percentage mismatch of left vermillion border and upper lip area over the right, horizontal lip tilt and lateral deviation of the lip. A significant increase in lip asymmetry was found in the BCLP group expressed as upper vermillion border mismatch across computer-defined and user-defined midlines (mean difference was 16.4% (p < 0.01) and 17.5% (p < 0.01) respectively). The results suggest that a significant degree of lip asymmetry remains in BCLP patients even after primary repair. This challenges previous assumptions that those with bilateral defects would be relatively symmetrical. Copyright © 2013 European Association for Cranio-Maxillo-Facial Surgery. Published by Elsevier Ltd. All rights reserved.
Giuntini, Elisa; Mengoni, Alessio; De Filippo, Carlotta; Cavalieri, Duccio; Aubin-Horth, Nadia; Landry, Christian R; Becker, Anke; Bazzicalupo, Marco
2005-11-10
Sinorhizobium meliloti is a soil bacterium that forms nitrogen-fixing nodules on the roots of leguminous plants such as alfalfa (Medicago sativa). This species occupies different ecological niches, being present as a free-living soil bacterium and as a symbiont of plant root nodules. The genome of the type strain Rm 1021 contains one chromosome and two megaplasmids for a total genome size of 6 Mb. We applied comparative genomic hybridisation (CGH) on an oligonucleotide microarrays to estimate genetic variation at the genomic level in four natural strains, two isolated from Italian agricultural soil and two from desert soil in the Aral Sea region. From 4.6 to 5.7 percent of the genes showed a pattern of hybridisation concordant with deletion, nucleotide divergence or ORF duplication when compared to the type strain Rm 1021. A large number of these polymorphisms were confirmed by sequencing and Southern blot. A statistically significant fraction of these variable genes was found on the pSymA megaplasmid and grouped in clusters. These variable genes were found to be mainly transposases or genes with unknown function. The obtained results allow to conclude that the symbiosis-required megaplasmid pSymA can be considered the major hot-spot for intra-specific differentiation in S. meliloti.
Giuntini, Elisa; Mengoni, Alessio; De Filippo, Carlotta; Cavalieri, Duccio; Aubin-Horth, Nadia; Landry, Christian R; Becker, Anke; Bazzicalupo, Marco
2005-01-01
Background Sinorhizobium meliloti is a soil bacterium that forms nitrogen-fixing nodules on the roots of leguminous plants such as alfalfa (Medicago sativa). This species occupies different ecological niches, being present as a free-living soil bacterium and as a symbiont of plant root nodules. The genome of the type strain Rm 1021 contains one chromosome and two megaplasmids for a total genome size of 6 Mb. We applied comparative genomic hybridisation (CGH) on an oligonucleotide microarrays to estimate genetic variation at the genomic level in four natural strains, two isolated from Italian agricultural soil and two from desert soil in the Aral Sea region. Results From 4.6 to 5.7 percent of the genes showed a pattern of hybridisation concordant with deletion, nucleotide divergence or ORF duplication when compared to the type strain Rm 1021. A large number of these polymorphisms were confirmed by sequencing and Southern blot. A statistically significant fraction of these variable genes was found on the pSymA megaplasmid and grouped in clusters. These variable genes were found to be mainly transposases or genes with unknown function. Conclusion The obtained results allow to conclude that the symbiosis-required megaplasmid pSymA can be considered the major hot-spot for intra-specific differentiation in S. meliloti. PMID:16283928
Hierarchical Approximate Bayesian Computation
Turner, Brandon M.; Van Zandt, Trisha
2013-01-01
Approximate Bayesian computation (ABC) is a powerful technique for estimating the posterior distribution of a model’s parameters. It is especially important when the model to be fit has no explicit likelihood function, which happens for computational (or simulation-based) models such as those that are popular in cognitive neuroscience and other areas in psychology. However, ABC is usually applied only to models with few parameters. Extending ABC to hierarchical models has been difficult because high-dimensional hierarchical models add computational complexity that conventional ABC cannot accommodate. In this paper we summarize some current approaches for performing hierarchical ABC and introduce a new algorithm called Gibbs ABC. This new algorithm incorporates well-known Bayesian techniques to improve the accuracy and efficiency of the ABC approach for estimation of hierarchical models. We then use the Gibbs ABC algorithm to estimate the parameters of two models of signal detection, one with and one without a tractable likelihood function. PMID:24297436
Roy, Swapnoneel; Thakur, Ashok Kumar
2008-01-01
Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.
Hybrid Approximate Message Passing
NASA Astrophysics Data System (ADS)
Rangan, Sundeep; Fletcher, Alyson K.; Goyal, Vivek K.; Byrne, Evan; Schniter, Philip
2017-09-01
The standard linear regression (SLR) problem is to recover a vector $\\mathbf{x}^0$ from noisy linear observations $\\mathbf{y}=\\mathbf{Ax}^0+\\mathbf{w}$. The approximate message passing (AMP) algorithm recently proposed by Donoho, Maleki, and Montanari is a computationally efficient iterative approach to SLR that has a remarkable property: for large i.i.d.\\ sub-Gaussian matrices $\\mathbf{A}$, its per-iteration behavior is rigorously characterized by a scalar state-evolution whose fixed points, when unique, are Bayes optimal. AMP, however, is fragile in that even small deviations from the i.i.d.\\ sub-Gaussian model can cause the algorithm to diverge. This paper considers a "vector AMP" (VAMP) algorithm and shows that VAMP has a rigorous scalar state-evolution that holds under a much broader class of large random matrices $\\mathbf{A}$: those that are right-rotationally invariant. After performing an initial singular value decomposition (SVD) of $\\mathbf{A}$, the per-iteration complexity of VAMP can be made similar to that of AMP. In addition, the fixed points of VAMP's state evolution are consistent with the replica prediction of the minimum mean-squared error recently derived by Tulino, Caire, Verd\\'u, and Shamai. The effectiveness and state evolution predictions of VAMP are confirmed in numerical experiments.
Countably QC-Approximating Posets
Mao, Xuxin; Xu, Luoshan
2014-01-01
As a generalization of countably C-approximating posets, the concept of countably QC-approximating posets is introduced. With the countably QC-approximating property, some characterizations of generalized completely distributive lattices and generalized countably approximating posets are given. The main results are as follows: (1) a complete lattice is generalized completely distributive if and only if it is countably QC-approximating and weakly generalized countably approximating; (2) a poset L having countably directed joins is generalized countably approximating if and only if the lattice σc(L)op of all σ-Scott-closed subsets of L is weakly generalized countably approximating. PMID:25165730
NASA Astrophysics Data System (ADS)
Zhou, Yunliang; Ma, S. Y.; Xiong, Chao; Luehr, Hermann
The total air mass densities at about 500 km altitude are derived using super-STAR accelerom-eter measurements onboard GRACE satellites for 25 great magnetic storms with minimum Dst less than 100 nT during 2002 to 2006 years. Taking NRLMSISE-00 model-predicted densities without active ap index input as a reference baseline of quiet-time mass density, the storm-time changes in upper thermospheric mass densities are obtained by subtraction for all the storm events and sorted into different grids of latitude by local time sector. The relationships of the storm-time density changes with various interplanetary parameters and magnetospheric ring current index of Sym-H are statistically investigated. The parameters include Akasofu energy coupling function, the merging electric field Em, the magnitude of IMF component in the GSM y-z plane etc. as calculated from OMNI data at 1 AU. It is found that the storm-time changes in the upper thermospheric mass density have the best linear correlation with the Sym-H index in general, showing nearly zero time delay at low-latitudes and a little time ahead at high-latitudes for most cases. Unexpectedly, the magnitude of IMF component in the y-z plane, Byz, shows correlation with storm-time mass density changes better and closer than Akasofu function and even Em. And, the mass density changes lag behind Byz about 1-4 hours for most cases at low-latitudes. The correlations considered above are local time dependent, showing the lowest at dusk sectors. For the largest superstorm of November 2003, the changes in mass density are correlated very closely with Byz, Em, and Sym-H index, showing correlation coefficients averaged over all latitudes in noon sector as high as 0.93, 0.91 and 0.90 separately. The physical factors controlling the lag times between the mass density changes at mid-low-latitudes and the interplanetary parameter variations are also analyzed. The results in this study may pro-vide useful suggestions for establishing
Fast approximate stochastic tractography.
Iglesias, Juan Eugenio; Thompson, Paul M; Liu, Cheng-Yi; Tu, Zhuowen
2012-01-01
Many different probabilistic tractography methods have been proposed in the literature to overcome the limitations of classical deterministic tractography: (i) lack of quantitative connectivity information; and (ii) robustness to noise, partial volume effects and selection of seed region. However, these methods rely on Monte Carlo sampling techniques that are computationally very demanding. This study presents an approximate stochastic tractography algorithm (FAST) that can be used interactively, as opposed to having to wait several minutes to obtain the output after marking a seed region. In FAST, tractography is formulated as a Markov chain that relies on a transition tensor. The tensor is designed to mimic the features of a well-known probabilistic tractography method based on a random walk model and Monte-Carlo sampling, but can also accommodate other propagation rules. Compared to the baseline algorithm, our method circumvents the sampling process and provides a deterministic solution at the expense of partially sacrificing sub-voxel accuracy. Therefore, the method is strictly speaking not stochastic, but provides a probabilistic output in the spirit of stochastic tractography methods. FAST was compared with the random walk model using real data from 10 patients in two different ways: 1. the probability maps produced by the two methods on five well-known fiber tracts were directly compared using metrics from the image registration literature; and 2. the connectivity measurements between different regions of the brain given by the two methods were compared using the correlation coefficient ρ. The results show that the connectivity measures provided by the two algorithms are well-correlated (ρ = 0.83), and so are the probability maps (normalized cross correlation 0.818 ± 0.081). The maps are also qualitatively (i.e., visually) very similar. The proposed method achieves a 60x speed-up (7 s vs. 7 min) over the Monte Carlo sampling scheme, therefore
DALI: Derivative Approximation for LIkelihoods
NASA Astrophysics Data System (ADS)
Sellentin, Elena
2015-07-01
DALI (Derivative Approximation for LIkelihoods) is a fast approximation of non-Gaussian likelihoods. It extends the Fisher Matrix in a straightforward way and allows for a wider range of posterior shapes. The code is written in C/C++.
Taylor Approximations and Definite Integrals
ERIC Educational Resources Information Center
Gordon, Sheldon P.
2007-01-01
We investigate the possibility of approximating the value of a definite integral by approximating the integrand rather than using numerical methods to approximate the value of the definite integral. Particular cases considered include examples where the integral is improper, such as an elliptic integral. (Contains 4 tables and 2 figures.)
Taylor Approximations and Definite Integrals
ERIC Educational Resources Information Center
Gordon, Sheldon P.
2007-01-01
We investigate the possibility of approximating the value of a definite integral by approximating the integrand rather than using numerical methods to approximate the value of the definite integral. Particular cases considered include examples where the integral is improper, such as an elliptic integral. (Contains 4 tables and 2 figures.)
Approximate equilibria for Bayesian games
NASA Astrophysics Data System (ADS)
Mallozzi, Lina; Pusillo, Lucia; Tijs, Stef
2008-07-01
In this paper the problem of the existence of approximate equilibria in mixed strategies is central. Sufficient conditions are given under which approximate equilibria exist for non-finite Bayesian games. Further one possible approach is suggested to the problem of the existence of approximate equilibria for the class of multicriteria Bayesian games.
Combining global and local approximations
NASA Technical Reports Server (NTRS)
Haftka, Raphael T.
1991-01-01
A method based on a linear approximation to a scaling factor, designated the 'global-local approximation' (GLA) method, is presented and shown capable of extending the range of usefulness of derivative-based approximations to a more refined model. The GLA approach refines the conventional scaling factor by means of a linearly varying, rather than constant, scaling factor. The capabilities of the method are demonstrated for a simple beam example with a crude and more refined FEM model.
Combining global and local approximations
Haftka, R.T. )
1991-09-01
A method based on a linear approximation to a scaling factor, designated the 'global-local approximation' (GLA) method, is presented and shown capable of extending the range of usefulness of derivative-based approximations to a more refined model. The GLA approach refines the conventional scaling factor by means of a linearly varying, rather than constant, scaling factor. The capabilities of the method are demonstrated for a simple beam example with a crude and more refined FEM model. 6 refs.
Phenomenological applications of rational approximants
NASA Astrophysics Data System (ADS)
Gonzàlez-Solís, Sergi; Masjuan, Pere
2016-08-01
We illustrate the powerfulness of Padé approximants (PAs) as a summation method and explore one of their extensions, the so-called quadratic approximant (QAs), to access both space- and (low-energy) time-like (TL) regions. As an introductory and pedagogical exercise, the function 1 zln(1 + z) is approximated by both kind of approximants. Then, PAs are applied to predict pseudoscalar meson Dalitz decays and to extract Vub from the semileptonic B → πℓνℓ decays. Finally, the π vector form factor in the TL region is explored using QAs.
Approximating Functions with Exponential Functions
ERIC Educational Resources Information Center
Gordon, Sheldon P.
2005-01-01
The possibility of approximating a function with a linear combination of exponential functions of the form e[superscript x], e[superscript 2x], ... is considered as a parallel development to the notion of Taylor polynomials which approximate a function with a linear combination of power function terms. The sinusoidal functions sin "x" and cos "x"…
Structural optimization with approximate sensitivities
NASA Technical Reports Server (NTRS)
Patnaik, S. N.; Hopkins, D. A.; Coroneos, R.
1994-01-01
Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-12-22
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-08-18
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Approximating subtree distances between phylogenies.
Bonet, Maria Luisa; St John, Katherine; Mahindru, Ruchi; Amenta, Nina
2006-10-01
We give a 5-approximation algorithm to the rooted Subtree-Prune-and-Regraft (rSPR) distance between two phylogenies, which was recently shown to be NP-complete. This paper presents the first approximation result for this important tree distance. The algorithm follows a standard format for tree distances. The novel ideas are in the analysis. In the analysis, the cost of the algorithm uses a "cascading" scheme that accounts for possible wrong moves. This accounting is missing from previous analysis of tree distance approximation algorithms. Further, we show how all algorithms of this type can be implemented in linear time and give experimental results.
de Maagd, R A; Wijfjes, A H; Spaink, H P; Ruiz-Sainz, J E; Wijffelman, C A; Okker, R J; Lugtenberg, B J
1989-12-01
The region of the Rhizobium leguminosarum biovar viciae Sym plasmid pRL1JI, responsible for the production and secretion of a previously described 50-kilodalton protein (R. A. de Maagd, C. A. Wijffelman, E. Pees, and B. J. J. Lugtenberg, J. Bacteriol. 170:4424-4427, 1988), was cloned and its nucleotide sequence was determined. A new nod gene, nodO, preceded by a poorly conserved nod box, was identified and its transcriptional start site was determined. Comparison of its predicted protein product with the N-terminal amino acid sequence of the isolated secreted protein showed that nodO is the structural gene of this protein, although the nucleotide sequence predicted a protein only 30,002 daltons in size. This comparison also showed that the secreted protein is not the product of N-terminal processing of a larger precursor. A conventional N-terminal signal sequence was not detected in the NodO protein. The NodO protein has significant homology with a part (residues 720 to 920) of the hemolysin protein (HlyA) of Escherichia coli. Analysis of the transcriptional regulation of the nodO gene revealed that, in contrast with other nod promoters in this species, activity of the nodO promoter is greatly enhanced in the presence of multiple copies of the nodD gene.
Grands principes de symétrie à l'épreuve de l'expérience
NASA Astrophysics Data System (ADS)
Depommier, P.
nombres leptoniques partiels. Dans la plupart des extensions du modèle standard on met en évidence plusieurs mécanismes de conversion d'un lepton en un lepton d'une autre famille, avec comme conséquences expérimentales : les désintégrations μ → e γ , μ → e γ γ et μ → e e e la conversion muon-électron dans un noyau, les oscillations de neutrinos. La possibilité d'obtenir une résonance lors de l'oscillation des neutrinos dans la matière a des conséquences importantes pour l'astrophysique. En principe, l'isospin n'était pas au menu du cours, puisque traité par un autre professeur. On a cependant ajouté, à la demande de l'éditeur, un chapitre sur les expériences recherchant une violation de la symétrie de charge dans les forces nucléaires (chapitre 10).
Rytov approximation in electron scattering
NASA Astrophysics Data System (ADS)
Krehl, Jonas; Lubk, Axel
2017-06-01
In this work we introduce the Rytov approximation in the scope of high-energy electron scattering with the motivation of developing better linear models for electron scattering. Such linear models play an important role in tomography and similar reconstruction techniques. Conventional linear models, such as the phase grating approximation, have reached their limits in current and foreseeable applications, most importantly in achieving three-dimensional atomic resolution using electron holographic tomography. The Rytov approximation incorporates propagation effects which are the most pressing limitation of conventional models. While predominately used in the weak-scattering regime of light microscopy, we show that the Rytov approximation can give reasonable results in the inherently strong-scattering regime of transmission electron microscopy.
Dual approximations in optimal control
NASA Technical Reports Server (NTRS)
Hager, W. W.; Ianculescu, G. D.
1984-01-01
A dual approximation for the solution to an optimal control problem is analyzed. The differential equation is handled with a Lagrange multiplier while other constraints are treated explicitly. An algorithm for solving the dual problem is presented.
Exponential approximations in optimal design
NASA Technical Reports Server (NTRS)
Belegundu, A. D.; Rajan, S. D.; Rajgopal, J.
1990-01-01
One-point and two-point exponential functions have been developed and proved to be very effective approximations of structural response. The exponential has been compared to the linear, reciprocal and quadratic fit methods. Four test problems in structural analysis have been selected. The use of such approximations is attractive in structural optimization to reduce the numbers of exact analyses which involve computationally expensive finite element analysis.
Mathematical algorithms for approximate reasoning
NASA Technical Reports Server (NTRS)
Murphy, John H.; Chay, Seung C.; Downs, Mary M.
1988-01-01
Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away
Approximation techniques for neuromimetic calculus.
Vigneron, V; Barret, C
1999-06-01
Approximation Theory plays a central part in modern statistical methods, in particular in Neural Network modeling. These models are able to approximate a large amount of metric data structures in their entire range of definition or at least piecewise. We survey most of the known results for networks of neurone-like units. The connections to classical statistical ideas such as ordinary least squares (LS) are emphasized.
On the semi-classical approximation to the superstring theory
Pollock, M.D. )
1992-10-10
In this paper, the semi-classical limit of the compactified, heterotic superstring theory is examined, including the effects of higher-derivative terms R[sup 2] in the effective Lagrangian. The total wave-function [Psi] obeys a Schrodinger equation in the mini-superspace ds[sup 2] = dt[sup 2] [minus] e[sup 2][alpha](t) dx[sup 2], the canonical coordinates being the position [alpha] and the velocity (Hubble parameter) [xi] [triple bond] [alpha], while the cosmic time coincides with the parameter introduced by Tomonaga, (derivative)/(derivative) [sigma] [triple bond] [xi] (derivative)/(derivative) [alpha]. The wave function describing the matter, [Psi][sub m], also obeys a linear Schrodinger equation.
Approximating random quantum optimization problems
NASA Astrophysics Data System (ADS)
Hsu, B.; Laumann, C. R.; Läuchli, A. M.; Moessner, R.; Sondhi, S. L.
2013-06-01
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem k-body quantum satisfiability (k-QSAT) on large random graphs. As an approximation strategy, we optimize the solution space over “classical” product states, which in turn introduces a novel autonomous classical optimization problem, PSAT, over a space of continuous degrees of freedom rather than discrete bits. Our central results are (i) the derivation of a set of bounds and approximations in various limits of the problem, several of which we believe may be amenable to a rigorous treatment; (ii) a demonstration that an approximation based on a greedy algorithm borrowed from the study of frustrated magnetism performs well over a wide range in parameter space, and its performance reflects the structure of the solution space of random k-QSAT. Simulated annealing exhibits metastability in similar “hard” regions of parameter space; and (iii) a generalization of belief propagation algorithms introduced for classical problems to the case of continuous spins. This yields both approximate solutions, as well as insights into the free energy “landscape” of the approximation problem, including a so-called dynamical transition near the satisfiability threshold. Taken together, these results allow us to elucidate the phase diagram of random k-QSAT in a two-dimensional energy-density-clause-density space.
Wavelet Sparse Approximate Inverse Preconditioners
NASA Technical Reports Server (NTRS)
Chan, Tony F.; Tang, W.-P.; Wan, W. L.
1996-01-01
There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle and Chow and Saad also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse entries so that sparse approximate inverse is possible. However, for the class of matrices that, come from elliptic PDE problems, this assumption may not necessarily hold. Our main idea is to look for a basis, other than the standard one, such that a sparse representation of the inverse is feasible. A crucial observation is that the kind of matrices we are interested in typically have a piecewise smooth inverse. We exploit this fact, by applying wavelet techniques to construct a better sparse approximate inverse in the wavelet basis. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverse. We emphasize that in this paper we have only presented the idea of wavelet approximate inverses and demonstrated its potential but have not yet developed a highly refined and efficient algorithm.
Gadgets, approximation, and linear programming
Trevisan, L.; Sudan, M.; Sorkin, G.B.; Williamson, D.P.
1996-12-31
We present a linear-programming based method for finding {open_quotes}gadgets{close_quotes}, i.e., combinatorial structures reducing constraints of one optimization problems to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method we present a number of new, computer-constructed gadgets for several different reductions. This method also answers a question posed by on how to prove the optimality of gadgets-we show how LP duality gives such proofs. The new gadgets improve hardness results for MAX CUT and MAX DICUT, showing that approximating these problems to within factors of 60/61 and 44/45 respectively is N P-hard. We also use the gadgets to obtain an improved approximation algorithm for MAX 3SAT which guarantees an approximation ratio of .801. This improves upon the previous best bound of .7704.
Rational approximations for tomographic reconstructions
NASA Astrophysics Data System (ADS)
Reynolds, Matthew; Beylkin, Gregory; Monzón, Lucas
2013-06-01
We use optimal rational approximations of projection data collected in x-ray tomography to improve image resolution. Under the assumption that the object of interest is described by functions with jump discontinuities, for each projection we construct its rational approximation with a small (near optimal) number of terms for a given accuracy threshold. This allows us to augment the measured data, i.e., double the number of available samples in each projection or, equivalently, extend (double) the domain of their Fourier transform. We also develop a new, fast, polar coordinate Fourier domain algorithm which uses our nonlinear approximation of projection data in a natural way. Using augmented projections of the Shepp-Logan phantom, we provide a comparison between the new algorithm and the standard filtered back-projection algorithm. We demonstrate that the reconstructed image has improved resolution without additional artifacts near sharp transitions in the image.
Heat pipe transient response approximation.
Reid, R. S.
2001-01-01
A simple and concise routine that approximates the response of an alkali metal heat pipe to changes in evaporator heat transfer rate is described. This analytically based routine is compared with data from a cylindrical heat pipe with a crescent-annular wick that undergoes gradual (quasi-steady) transitions through the viscous and condenser boundary heat transfer limits. The sonic heat transfer limit can also be incorporated into this routine for heat pipes with more closely coupled condensers. The advantages and obvious limitations of this approach are discussed. For reference, a source code listing for the approximation appears at the end of this paper.
Adaptive approximation models in optimization
Voronin, A.N.
1995-05-01
The paper proposes a method for optimization of functions of several variables that substantially reduces the number of objective function evaluations compared to traditional methods. The method is based on the property of iterative refinement of approximation models of the optimand function in approximation domains that contract to the extremum point. It does not require subjective specification of the starting point, step length, or other parameters of the search procedure. The method is designed for efficient optimization of unimodal functions of several (not more than 10-15) variables and can be applied to find the global extremum of polymodal functions and also for optimization of scalarized forms of vector objective functions.
Approximating spatially exclusive invasion processes.
Ross, Joshua V; Binder, Benjamin J
2014-05-01
A number of biological processes, such as invasive plant species and cell migration, are composed of two key mechanisms: motility and reproduction. Due to the spatially exclusive interacting behavior of these processes a cellular automata (CA) model is specified to simulate a one-dimensional invasion process. Three (independence, Poisson, and 2D-Markov chain) approximations are considered that attempt to capture the average behavior of the CA. We show that our 2D-Markov chain approximation accurately predicts the state of the CA for a wide range of motility and reproduction rates.
Galerkin approximations for dissipative magnetohydrodynamics
NASA Technical Reports Server (NTRS)
Chen, Hudong; Shan, Xiaowen; Montgomery, David
1990-01-01
A Galerkin approximation scheme is proposed for voltage-driven, dissipative magnetohydrodynamics. The trial functions are exact eigenfunctions of the linearized continuum equations and represent helical deformations of the axisymmetric, zero-flow, driven steady state. The lowest nontrivial truncation is explored: one axisymmetric trial function and one helical trial function each for the magnetic and velocity fields. The system resembles the Lorenz approximation to Benard convection, but in the region of believed applicability, its dynamical behavior is rather different, including relaxation to a helically deformed state similar to those that have emerged in the much higher resolution computations of Dahlburg et al.
Second Approximation to Conical Flows
1950-12-01
Public Release WRIGHT AIR DEVELOPMENT CENTER AF-WP-(B)-O-29 JUL 53 100 NOTICES ’When Government drawings, specifications, or other data are used V...so that the X, the approximation always depends on the ( "/)th, etc. Here the second approximation, i.e., the terms in C and 62, are computed and...the scheme shown in Fig. 1, the isentropic equations of motion are (cV-X2) +~X~C 6 +- 4= -x- 1 It is assumed that + Ux !E . $O’/ + (8) Introducing Eqs
Pythagorean Approximations and Continued Fractions
ERIC Educational Resources Information Center
Peralta, Javier
2008-01-01
In this article, we will show that the Pythagorean approximations of [the square root of] 2 coincide with those achieved in the 16th century by means of continued fractions. Assuming this fact and the known relation that connects the Fibonacci sequence with the golden section, we shall establish a procedure to obtain sequences of rational numbers…
Pythagorean Approximations and Continued Fractions
ERIC Educational Resources Information Center
Peralta, Javier
2008-01-01
In this article, we will show that the Pythagorean approximations of [the square root of] 2 coincide with those achieved in the 16th century by means of continued fractions. Assuming this fact and the known relation that connects the Fibonacci sequence with the golden section, we shall establish a procedure to obtain sequences of rational numbers…
Singularly Perturbed Lie Bracket Approximation
Durr, Hans-Bernd; Krstic, Miroslav; Scheinker, Alexander; Ebenbauer, Christian
2015-03-27
Here, we consider the interconnection of two dynamical systems where one has an input-affine vector field. We show that by employing a singular perturbation analysis and the Lie bracket approximation technique, the stability of the overall system can be analyzed by regarding the stability properties of two reduced, uncoupled systems.
Long, Chengli; Held, Mark; Hayward, Allison; Nisler, Jaroslav; Spíchal, Lukas; Neil Emery, R J; Moffatt, Barbara A; Guinel, Frédérique C
2012-06-01
R50 (sym16) is a pea nodulation mutant that accumulates cytokinin (CK) in its vegetative organs. Total CK content increases as the plant ages because of the low activity of the enzyme cytokinin oxidase/dehydrogenase (CKX) responsible for CK degradation. R50 exhibits a large seed with high relative water content, and its seedling establishes itself slowly. Whether these two traits are linked to abnormal CK levels was considered here. R50 was found to have a similar germination rate but a much slower epicotyl emergence than Sparkle, its wild-type (WT). At the onset of emergence, the starch grains in R50 cotyledons were larger than those of WT; furthermore, they did not degrade as fast as in WT because of low amylase activity. No differences between the pea lines were observed in the CK forms identified during seed embryogenesis. However, while CK content compared to that of WT was reduced early in R50 embryogenesis, it was elevated later on in its dry seeds where CKX activity was low, although CKX transcript abundance remained high. Transcripts of the two known PsCKX isoforms exhibited tissue- and development-specific profiles with no detectable PsCKX2 expression in cotyledons. There were more of both transcripts in R50 roots than in WT roots, but less of PsCKX2 than PsCKX1 in R50 shoots compared to WT shoots. Thus, although there is a definite CKX post-transcriptional defect in R50 dry seeds, an abnormal CK homeostasis is not the basis of the delay in R50 seedling establishment, which we linked to abnormal amylase activity early in development. Copyright © Physiologia Plantarum 2012.
Ab initio dynamical vertex approximation
NASA Astrophysics Data System (ADS)
Galler, Anna; Thunström, Patrik; Gunacker, Patrik; Tomczak, Jan M.; Held, Karsten
2017-03-01
Diagrammatic extensions of dynamical mean-field theory (DMFT) such as the dynamical vertex approximation (DΓ A) allow us to include nonlocal correlations beyond DMFT on all length scales and proved their worth for model calculations. Here, we develop and implement an Ab initio DΓ A approach (AbinitioDΓ A ) for electronic structure calculations of materials. The starting point is the two-particle irreducible vertex in the two particle-hole channels which is approximated by the bare nonlocal Coulomb interaction and all local vertex corrections. From this, we calculate the full nonlocal vertex and the nonlocal self-energy through the Bethe-Salpeter equation. The AbinitioDΓ A approach naturally generates all local DMFT correlations and all nonlocal G W contributions, but also further nonlocal correlations beyond: mixed terms of the former two and nonlocal spin fluctuations. We apply this new methodology to the prototypical correlated metal SrVO3.
Random-Phase Approximation Methods
NASA Astrophysics Data System (ADS)
Chen, Guo P.; Voora, Vamsee K.; Agee, Matthew M.; Balasubramani, Sree Ganesh; Furche, Filipp
2017-05-01
Random-phase approximation (RPA) methods are rapidly emerging as cost-effective validation tools for semilocal density functional computations. We present the theoretical background of RPA in an intuitive rather than formal fashion, focusing on the physical picture of screening and simple diagrammatic analysis. A new decomposition of the RPA correlation energy into plasmonic modes leads to an appealing visualization of electron correlation in terms of charge density fluctuations. Recent developments in the areas of beyond-RPA methods, RPA correlation potentials, and efficient algorithms for RPA energy and property calculations are reviewed. The ability of RPA to approximately capture static correlation in molecules is quantified by an analysis of RPA natural occupation numbers. We illustrate the use of RPA methods in applications to small-gap systems such as open-shell d- and f-element compounds, radicals, and weakly bound complexes, where semilocal density functional results exhibit strong functional dependence.
Testing the frozen flow approximation
NASA Technical Reports Server (NTRS)
Lucchin, Francesco; Matarrese, Sabino; Melott, Adrian L.; Moscardini, Lauro
1993-01-01
We investigate the accuracy of the frozen-flow approximation (FFA), recently proposed by Matarrese, et al. (1992), for following the nonlinear evolution of cosmological density fluctuations under gravitational instability. We compare a number of statistics between results of the FFA and n-body simulations, including those used by Melott, Pellman & Shandarin (1993) to test the Zel'dovich approximation. The FFA performs reasonably well in a statistical sense, e.g. in reproducing the counts-in-cell distribution, at small scales, but it does poorly in the crosscorrelation with n-body which means it is generally not moving mass to the right place, especially in models with high small-scale power.
Potential of the approximation method
Amano, K.; Maruoka, A.
1996-12-31
Developing some techniques for the approximation method, we establish precise versions of the following statements concerning lower bounds for circuits that detect cliques of size s in a graph with m vertices: For 5 {le} s {le} m/4, a monotone circuit computing CLIQUE(m, s) contains at least (1/2)1.8{sup min}({radical}s-1/2,m/(4s)) gates: If a non-monotone circuit computes CLIQUE using a {open_quotes}small{close_quotes} amount of negation, then the circuit contains an exponential number of gates. The former is proved very simply using so called bottleneck counting argument within the framework of approximation, whereas the latter is verified introducing a notion of restricting negation and generalizing the sunflower contraction.
Nonlinear Filtering and Approximation Techniques
1991-09-01
Shwartz), Academic Press (1991). [191 M.Cl. ROUTBAUD, Fiting lindairc par morceaux avec petit bruit d’obserration, These. Universit6 de Provence ( 1990...Kernel System (GKS), Academic Press (1983). 181 H.J. KUSHNER, Probability methods for approximations in stochastic control and for elliptic equations... Academic Press (1977). [9] F. LE GLAND, Time discretization of nonlinear filtering equations, in: 28th. IEEE CDC, Tampa, pp. 2601-2606. IEEE Press (1989
Analytical solution approximation for bearing
NASA Astrophysics Data System (ADS)
Hanafi, Lukman; Mufid, M. Syifaul
2017-08-01
The purpose of lubrication is to separate two surfaces sliding past each other with a film of some material which can be sheared without causing any damage to the surfaces. Reynolds equation is a basic equation for fluid lubrication which is applied in the bearing problem. This equation can be derived from Navier-Stokes equation and continuity equation. In this paper Reynolds equation is solved using analytical approximation by making simplification to obtain pressure distribution.
Ultrafast approximation for phylogenetic bootstrap.
Minh, Bui Quang; Nguyen, Minh Anh Thi; von Haeseler, Arndt
2013-05-01
Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and the Shimodaira-Hasegawa-like approximate likelihood ratio test have been introduced to speed up the bootstrap. Here, we suggest an ultrafast bootstrap approximation approach (UFBoot) to compute the support of phylogenetic groups in maximum likelihood (ML) based trees. To achieve this, we combine the resampling estimated log-likelihood method with a simple but effective collection scheme of candidate trees. We also propose a stopping rule that assesses the convergence of branch support values to automatically determine when to stop collecting candidate trees. UFBoot achieves a median speed up of 3.1 (range: 0.66-33.3) to 10.2 (range: 1.32-41.4) compared with RAxML RBS for real DNA and amino acid alignments, respectively. Moreover, our extensive simulations show that UFBoot is robust against moderate model violations and the support values obtained appear to be relatively unbiased compared with the conservative standard bootstrap. This provides a more direct interpretation of the bootstrap support. We offer an efficient and easy-to-use software (available at http://www.cibiv.at/software/iqtree) to perform the UFBoot analysis with ML tree inference.
Approximate Counting of Graphical Realizations.
Erdős, Péter L; Kiss, Sándor Z; Miklós, István; Soukup, Lajos
2015-01-01
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007), for regular directed graphs (by Greenhill, 2011) and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013). Several heuristics on counting the number of possible realizations exist (via sampling processes), and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases) the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS) for counting of all realizations.
Approximate Counting of Graphical Realizations
2015-01-01
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007), for regular directed graphs (by Greenhill, 2011) and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013). Several heuristics on counting the number of possible realizations exist (via sampling processes), and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases) the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS) for counting of all realizations. PMID:26161994
Computer Experiments for Function Approximations
Chang, A; Izmailov, I; Rizzo, S; Wynter, S; Alexandrov, O; Tong, C
2007-10-15
This research project falls in the domain of response surface methodology, which seeks cost-effective ways to accurately fit an approximate function to experimental data. Modeling and computer simulation are essential tools in modern science and engineering. A computer simulation can be viewed as a function that receives input from a given parameter space and produces an output. Running the simulation repeatedly amounts to an equivalent number of function evaluations, and for complex models, such function evaluations can be very time-consuming. It is then of paramount importance to intelligently choose a relatively small set of sample points in the parameter space at which to evaluate the given function, and then use this information to construct a surrogate function that is close to the original function and takes little time to evaluate. This study was divided into two parts. The first part consisted of comparing four sampling methods and two function approximation methods in terms of efficiency and accuracy for simple test functions. The sampling methods used were Monte Carlo, Quasi-Random LP{sub {tau}}, Maximin Latin Hypercubes, and Orthogonal-Array-Based Latin Hypercubes. The function approximation methods utilized were Multivariate Adaptive Regression Splines (MARS) and Support Vector Machines (SVM). The second part of the study concerned adaptive sampling methods with a focus on creating useful sets of sample points specifically for monotonic functions, functions with a single minimum and functions with a bounded first derivative.
Approximate reasoning using terminological models
NASA Technical Reports Server (NTRS)
Yen, John; Vaidya, Nitin
1992-01-01
Term Subsumption Systems (TSS) form a knowledge-representation scheme in AI that can express the defining characteristics of concepts through a formal language that has a well-defined semantics and incorporates a reasoning mechanism that can deduce whether one concept subsumes another. However, TSS's have very limited ability to deal with the issue of uncertainty in knowledge bases. The objective of this research is to address issues in combining approximate reasoning with term subsumption systems. To do this, we have extended an existing AI architecture (CLASP) that is built on the top of a term subsumption system (LOOM). First, the assertional component of LOOM has been extended for asserting and representing uncertain propositions. Second, we have extended the pattern matcher of CLASP for plausible rule-based inferences. Third, an approximate reasoning model has been added to facilitate various kinds of approximate reasoning. And finally, the issue of inconsistency in truth values due to inheritance is addressed using justification of those values. This architecture enhances the reasoning capabilities of expert systems by providing support for reasoning under uncertainty using knowledge captured in TSS. Also, as definitional knowledge is explicit and separate from heuristic knowledge for plausible inferences, the maintainability of expert systems could be improved.
Noncommutative minisuperspace, gravity-driven acceleration, and kinetic inflation
NASA Astrophysics Data System (ADS)
Rasouli, S. M. M.; Moniz, Paulo Vargas
2014-10-01
In this paper, we introduce a noncommutative version of the Brans-Dicke (BD) theory and obtain the Hamiltonian equations of motion for a spatially flat Friedmann-Lemaître-Robertson-Walker universe filled with a perfect fluid. We focus on the case where the scalar potential as well as the ordinary matter sector are absent. Then, we investigate gravity-driven acceleration and kinetic inflation in this noncommutative BD cosmology. In contrast to the commutative case, in which the scale factor and BD scalar field are in a power-law form, in the noncommutative case the power-law scalar factor is multiplied by a dynamical exponential warp factor. This warp factor depends on the noncommutative parameter as well as the momentum conjugate associated to the BD scalar field. We show that the BD scalar field and the scale factor effectively depend on the noncommutative parameter. For very small values of this parameter, we obtain an appropriate inflationary solution, which can overcome problems within BD standard cosmology in a more efficient manner. Furthermore, a graceful exit from an early acceleration epoch towards a decelerating radiation epoch is provided. For late times, due to the presence of the noncommutative parameter, we obtain a zero acceleration epoch, which can be interpreted as the coarse-grained explanation.
Quantization of closed mini-superspace models as bound states
NASA Astrophysics Data System (ADS)
Kung, J. H.
1995-01-01
The Wheeler-DeWitt equation is applied to closedk>0 Friedmann-Robertson-Walker metric with various combination of cosmological constant and matter (e.g., radiation or pressureless gas). It is shown that if the universe ends in the matter dominated era (e.g., radiation or pressureless gas) with zero cosmological constant, then the resulting Wheeler-DeWitt equation describes a bound state problem. As solutions of a nondegenerate bound state system, the eigen-wave functions are real (Hartle-Hawking). Furthermore, as a bound state problem, there exists a quantization condition that relates the curvature of the three space with the various energy densities of the universe. If we assume that our universe is closed, then the quantum number of our universe isN˜(Gk)-1˜10122. The largeness of this quantum number is naturally explained by an early inflationary phase which resulted in a flat universe we observe today. It is also shown that if there is a cosmological constant Λ>0 in our universe that persists for all time, then the resulting Wheeler-DeWitt equation describes a non-bound state system, regardless of the magnitude of the cosmological constant. As a consequence, the wave functions are in general complex (Vilenkin).
Simplicial minisuperspace. II. Some classical solutions on simple triangulations
Hartle, J.B.
1986-01-01
The extrema of the Euclidean Regge gravitational action are investigated numerically for some closed, compact, four-dimensional simplicial manifolds with topologies S/sup 4/, CP/sup 2/, and S/sup 2/ x S/sup 2/.
Neighbourhood approximation using randomized forests.
Konukoglu, Ender; Glocker, Ben; Zikic, Darko; Criminisi, Antonio
2013-10-01
Leveraging available annotated data is an essential component of many modern methods for medical image analysis. In particular, approaches making use of the "neighbourhood" structure between images for this purpose have shown significant potential. Such techniques achieve high accuracy in analysing an image by propagating information from its immediate "neighbours" within an annotated database. Despite their success in certain applications, wide use of these methods is limited due to the challenging task of determining the neighbours for an out-of-sample image. This task is either computationally expensive due to large database sizes and costly distance evaluations, or infeasible due to distance definitions over semantic information, such as ground truth annotations, which is not available for out-of-sample images. This article introduces Neighbourhood Approximation Forests (NAFs), a supervised learning algorithm providing a general and efficient approach for the task of approximate nearest neighbour retrieval for arbitrary distances. Starting from an image training database and a user-defined distance between images, the algorithm learns to use appearance-based features to cluster images approximating the neighbourhood structured induced by the distance. NAF is able to efficiently infer nearest neighbours of an out-of-sample image, even when the original distance is based on semantic information. We perform experimental evaluation in two different scenarios: (i) age prediction from brain MRI and (ii) patch-based segmentation of unregistered, arbitrary field of view CT images. The results demonstrate the performance, computational benefits, and potential of NAF for different image analysis applications. Copyright © 2013 Elsevier B.V. All rights reserved.
Topics in Multivariate Approximation Theory.
1982-05-01
of the Bramble -Hilbert lemma (see Bramble & Hhert (13ŕ). Kergin’s scheme raises some questions. In .ontrast £.t its univar- iate antecedent, it...J. R. Rice (19791# An adaptive algorithm for multivariate approximation giving optimal convergence rates, J.Approx. Theory 25, 337-359. J. H. Bramble ...J.Numer.Anal. 7, 112-124. J. H. Bramble & S. R. Hilbert (19711, BoUnds for a class of linear functionals with applications to Hermite interpolation
Approximate transferability in conjugated polyalkenes
NASA Astrophysics Data System (ADS)
Eskandari, Keiamars; Mandado, Marcos; Mosquera, Ricardo A.
2007-03-01
QTAIM computed atomic and bond properties, as well as delocalization indices (obtained from electron densities computed at HF, MP2 and B3LYP levels) of several linear and branched conjugated polyalkenes and O- and N-containing conjugated polyenes have been employed to assess approximate transferable CH groups. The values of these properties indicate the effects of the functional group extend to four CH groups, whereas those of the terminal carbon affect up to three carbons. Ternary carbons also modify significantly the properties of atoms in α, β and γ.
Improved non-approximability results
Bellare, M.; Sudan, M.
1994-12-31
We indicate strong non-approximability factors for central problems: N{sup 1/4} for Max Clique; N{sup 1/10} for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a proof system in which the verifier examines only three {open_quotes}free bits{close_quotes} to attain an error of 1/2. Underlying the Chromatic Number result is a reduction from Max Clique which is more efficient than previous ones.
Approximation for Bayesian Ability Estimation.
1987-02-18
posterior pdfs of ande are given by p(-[Y) p(F) F P((y lei’ j)P )d. SiiJ i (4) a r~d p(e Iy) - p(t0) 1 J i P(Yij ei, (5) As shown in Tsutakawa and Lin...inverse A Hessian of the log of (27) with respect to , evaulatedat a Then, under regularity conditions, the marginal posterior pdf of O is...two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31
Fermion tunneling beyond semiclassical approximation
Majhi, Bibhas Ranjan
2009-02-15
Applying the Hamilton-Jacobi method beyond the semiclassical approximation prescribed in R. Banerjee and B. R. Majhi, J. High Energy Phys. 06 (2008) 095 for the scalar particle, Hawking radiation as tunneling of the Dirac particle through an event horizon is analyzed. We show that, as before, all quantum corrections in the single particle action are proportional to the usual semiclassical contribution. We also compute the modifications to the Hawking temperature and Bekenstein-Hawking entropy for the Schwarzschild black hole. Finally, the coefficient of the logarithmic correction to entropy is shown to be related with the trace anomaly.
Generalized Gradient Approximation Made Simple
Perdew, J.P.; Burke, K.; Ernzerhof, M.
1996-10-01
Generalized gradient approximations (GGA{close_quote}s) for the exchange-correlation energy improve upon the local spin density (LSD) description of atoms, molecules, and solids. We present a simple derivation of a simple GGA, in which all parameters (other than those in LSD) are fundamental constants. Only general features of the detailed construction underlying the Perdew-Wang 1991 (PW91) GGA are invoked. Improvements over PW91 include an accurate description of the linear response of the uniform electron gas, correct behavior under uniform scaling, and a smoother potential. {copyright} {ital 1996 The American Physical Society.}
Laguerre approximation of random foams
NASA Astrophysics Data System (ADS)
Liebscher, André
2015-09-01
Stochastic models for the microstructure of foams are valuable tools to study the relations between microstructure characteristics and macroscopic properties. Owing to the physical laws behind the formation of foams, Laguerre tessellations have turned out to be suitable models for foams. Laguerre tessellations are weighted generalizations of Voronoi tessellations, where polyhedral cells are formed through the interaction of weighted generator points. While both share the same topology, the cell curvature of foams allows only an approximation by Laguerre tessellations. This makes the model fitting a challenging task, especially when the preservation of the local topology is required. In this work, we propose an inversion-based approach to fit a Laguerre tessellation model to a foam. The idea is to find a set of generator points whose tessellation best fits the foam's cell system. For this purpose, we transform the model fitting into a minimization problem that can be solved by gradient descent-based optimization. The proposed algorithm restores the generators of a tessellation if it is known to be Laguerre. If, as in the case of foams, no exact solution is possible, an approximative solution is obtained that maintains the local topology.
Wavelet Approximation in Data Assimilation
NASA Technical Reports Server (NTRS)
Tangborn, Andrew; Atlas, Robert (Technical Monitor)
2002-01-01
Estimation of the state of the atmosphere with the Kalman filter remains a distant goal because of high computational cost of evolving the error covariance for both linear and nonlinear systems. Wavelet approximation is presented here as a possible solution that efficiently compresses both global and local covariance information. We demonstrate the compression characteristics on the the error correlation field from a global two-dimensional chemical constituent assimilation, and implement an adaptive wavelet approximation scheme on the assimilation of the one-dimensional Burger's equation. In the former problem, we show that 99%, of the error correlation can be represented by just 3% of the wavelet coefficients, with good representation of localized features. In the Burger's equation assimilation, the discrete linearized equations (tangent linear model) and analysis covariance are projected onto a wavelet basis and truncated to just 6%, of the coefficients. A nearly optimal forecast is achieved and we show that errors due to truncation of the dynamics are no greater than the errors due to covariance truncation.
Rational approximations to fluid properties
Kincaid, J.M.
1990-05-01
The purpose of this report is to summarize some results that were presented at the Spring AIChE meeting in Orlando, Florida (20 March 1990). We report on recent attempts to develop a systematic method, based on the technique of rational approximation, for creating mathematical models of real-fluid equations of state and related properties. Equation-of-state models for real fluids are usually created by selecting a function {tilde p} (T,{rho}) that contains a set of parameters {l brace}{gamma}{sub i}{r brace}; the {l brace}{gamma}{sub i}{r brace} is chosen such that {tilde p}(T,{rho}) provides a good fit to the experimental data. (Here p is the pressure, T the temperature and {rho} is the density). In most cases a nonlinear least-squares numerical method is used to determine {l brace}{gamma}{sub i}{r brace}. There are several drawbacks to this method: one has essentially to guess what {tilde p}(T,{rho}) should be; the critical region is seldom fit very well and nonlinear numerical methods are time consuming and sometimes not very stable. The rational approximation approach we describe may eliminate all of these drawbacks. In particular it lets the data choose the function {tilde p}(T,{rho}) and its numerical implementation involves only linear algorithms. 27 refs., 5 figs.
Analytical approximations for spiral waves
Löber, Jakob Engel, Harald
2013-12-15
We propose a non-perturbative attempt to solve the kinematic equations for spiral waves in excitable media. From the eikonal equation for the wave front we derive an implicit analytical relation between rotation frequency Ω and core radius R{sub 0}. For free, rigidly rotating spiral waves our analytical prediction is in good agreement with numerical solutions of the linear eikonal equation not only for very large but also for intermediate and small values of the core radius. An equivalent Ω(R{sub +}) dependence improves the result by Keener and Tyson for spiral waves pinned to a circular defect of radius R{sub +} with Neumann boundaries at the periphery. Simultaneously, analytical approximations for the shape of free and pinned spirals are given. We discuss the reasons why the ansatz fails to correctly describe the dependence of the rotation frequency on the excitability of the medium.
Interplay of approximate planning strategies.
Huys, Quentin J M; Lally, Níall; Faulkner, Paul; Eshel, Neir; Seifritz, Erich; Gershman, Samuel J; Dayan, Peter; Roiser, Jonathan P
2015-03-10
Humans routinely formulate plans in domains so complex that even the most powerful computers are taxed. To do so, they seem to avail themselves of many strategies and heuristics that efficiently simplify, approximate, and hierarchically decompose hard tasks into simpler subtasks. Theoretical and cognitive research has revealed several such strategies; however, little is known about their establishment, interaction, and efficiency. Here, we use model-based behavioral analysis to provide a detailed examination of the performance of human subjects in a moderately deep planning task. We find that subjects exploit the structure of the domain to establish subgoals in a way that achieves a nearly maximal reduction in the cost of computing values of choices, but then combine partial searches with greedy local steps to solve subtasks, and maladaptively prune the decision trees of subtasks in a reflexive manner upon encountering salient losses. Subjects come idiosyncratically to favor particular sequences of actions to achieve subgoals, creating novel complex actions or "options."
Indexing the approximate number system.
Inglis, Matthew; Gilmore, Camilla
2014-01-01
Much recent research attention has focused on understanding individual differences in the approximate number system, a cognitive system believed to underlie human mathematical competence. To date researchers have used four main indices of ANS acuity, and have typically assumed that they measure similar properties. Here we report a study which questions this assumption. We demonstrate that the numerical ratio effect has poor test-retest reliability and that it does not relate to either Weber fractions or accuracy on nonsymbolic comparison tasks. Furthermore, we show that Weber fractions follow a strongly skewed distribution and that they have lower test-retest reliability than a simple accuracy measure. We conclude by arguing that in the future researchers interested in indexing individual differences in ANS acuity should use accuracy figures, not Weber fractions or numerical ratio effects.
Approximating metal-insulator transitions
NASA Astrophysics Data System (ADS)
Danieli, Carlo; Rayanov, Kristian; Pavlov, Boris; Martin, Gaven; Flach, Sergej
2015-12-01
We consider quantum wave propagation in one-dimensional quasiperiodic lattices. We propose an iterative construction of quasiperiodic potentials from sequences of potentials with increasing spatial period. At each finite iteration step, the eigenstates reflect the properties of the limiting quasiperiodic potential properties up to a controlled maximum system size. We then observe approximate Metal-Insulator Transitions (MIT) at the finite iteration steps. We also report evidence on mobility edges, which are at variance to the celebrated Aubry-André model. The dynamics near the MIT shows a critical slowing down of the ballistic group velocity in the metallic phase, similar to the divergence of the localization length in the insulating phase.
Analytical approximations for spiral waves.
Löber, Jakob; Engel, Harald
2013-12-01
We propose a non-perturbative attempt to solve the kinematic equations for spiral waves in excitable media. From the eikonal equation for the wave front we derive an implicit analytical relation between rotation frequency Ω and core radius R(0). For free, rigidly rotating spiral waves our analytical prediction is in good agreement with numerical solutions of the linear eikonal equation not only for very large but also for intermediate and small values of the core radius. An equivalent Ω(R(+)) dependence improves the result by Keener and Tyson for spiral waves pinned to a circular defect of radius R(+) with Neumann boundaries at the periphery. Simultaneously, analytical approximations for the shape of free and pinned spirals are given. We discuss the reasons why the ansatz fails to correctly describe the dependence of the rotation frequency on the excitability of the medium.
IONIS: Approximate atomic photoionization intensities
NASA Astrophysics Data System (ADS)
Heinäsmäki, Sami
2012-02-01
A program to compute relative atomic photoionization cross sections is presented. The code applies the output of the multiconfiguration Dirac-Fock method for atoms in the single active electron scheme, by computing the overlap of the bound electron states in the initial and final states. The contribution from the single-particle ionization matrix elements is assumed to be the same for each final state. This method gives rather accurate relative ionization probabilities provided the single-electron ionization matrix elements do not depend strongly on energy in the region considered. The method is especially suited for open shell atoms where electronic correlation in the ionic states is large. Program summaryProgram title: IONIS Catalogue identifier: AEKK_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKK_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 1149 No. of bytes in distributed program, including test data, etc.: 12 877 Distribution format: tar.gz Programming language: Fortran 95 Computer: Workstations Operating system: GNU/Linux, Unix Classification: 2.2, 2.5 Nature of problem: Photoionization intensities for atoms. Solution method: The code applies the output of the multiconfiguration Dirac-Fock codes Grasp92 [1] or Grasp2K [2], to compute approximate photoionization intensities. The intensity is computed within the one-electron transition approximation and by assuming that the sum of the single-particle ionization probabilities is the same for all final ionic states. Restrictions: The program gives nonzero intensities for those transitions where only one electron is removed from the initial configuration(s). Shake-type many-electron transitions are not computed. The ionized shell must be closed in the initial state. Running time: Few seconds for a
Approximate analytic solutions to the NPDD: Short exposure approximations
NASA Astrophysics Data System (ADS)
Close, Ciara E.; Sheridan, John T.
2014-04-01
There have been many attempts to accurately describe the photochemical processes that take places in photopolymer materials. As the models have become more accurate, solving them has become more numerically intensive and more 'opaque'. Recent models incorporate the major photochemical reactions taking place as well as the diffusion effects resulting from the photo-polymerisation process, and have accurately described these processes in a number of different materials. It is our aim to develop accessible mathematical expressions which provide physical insights and simple quantitative predictions of practical value to material designers and users. In this paper, starting with the Non-Local Photo-Polymerisation Driven Diffusion (NPDD) model coupled integro-differential equations, we first simplify these equations and validate the accuracy of the resulting approximate model. This new set of governing equations are then used to produce accurate analytic solutions (polynomials) describing the evolution of the monomer and polymer concentrations, and the grating refractive index modulation, in the case of short low intensity sinusoidal exposures. The physical significance of the results and their consequences for holographic data storage (HDS) are then discussed.
Multidimensional stochastic approximation Monte Carlo
NASA Astrophysics Data System (ADS)
Zablotskiy, Sergey V.; Ivanov, Victor A.; Paul, Wolfgang
2016-06-01
Stochastic Approximation Monte Carlo (SAMC) has been established as a mathematically founded powerful flat-histogram Monte Carlo method, used to determine the density of states, g (E ) , of a model system. We show here how it can be generalized for the determination of multidimensional probability distributions (or equivalently densities of states) of macroscopic or mesoscopic variables defined on the space of microstates of a statistical mechanical system. This establishes this method as a systematic way for coarse graining a model system, or, in other words, for performing a renormalization group step on a model. We discuss the formulation of the Kadanoff block spin transformation and the coarse-graining procedure for polymer models in this language. We also apply it to a standard case in the literature of two-dimensional densities of states, where two competing energetic effects are present g (E1,E2) . We show when and why care has to be exercised when obtaining the microcanonical density of states g (E1+E2) from g (E1,E2) .
Randomized approximate nearest neighbors algorithm
Jones, Peter Wilcox; Osipov, Andrei; Rokhlin, Vladimir
2011-01-01
We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {xj} in , the algorithm attempts to find k nearest neighbors for each of xj, where k is a user-specified integer parameter. The algorithm is iterative, and its running time requirements are proportional to T·N·(d·(log d) + k·(d + log k)·(log N)) + N·k2·(d + log k), with T the number of iterations performed. The memory requirements of the procedure are of the order N·(d + k). A by-product of the scheme is a data structure, permitting a rapid search for the k nearest neighbors among {xj} for an arbitrary point . The cost of each such query is proportional to T·(d·(log d) + log(N/k)·k·(d + log k)), and the memory requirements for the requisite data structure are of the order N·(d + k) + T·(d + N). The algorithm utilizes random rotations and a basic divide-and-conquer scheme, followed by a local graph search. We analyze the scheme’s behavior for certain types of distributions of {xj} and illustrate its performance via several numerical examples. PMID:21885738
Interplay of approximate planning strategies
Huys, Quentin J. M.; Lally, Níall; Faulkner, Paul; Eshel, Neir; Seifritz, Erich; Gershman, Samuel J.; Dayan, Peter; Roiser, Jonathan P.
2015-01-01
Humans routinely formulate plans in domains so complex that even the most powerful computers are taxed. To do so, they seem to avail themselves of many strategies and heuristics that efficiently simplify, approximate, and hierarchically decompose hard tasks into simpler subtasks. Theoretical and cognitive research has revealed several such strategies; however, little is known about their establishment, interaction, and efficiency. Here, we use model-based behavioral analysis to provide a detailed examination of the performance of human subjects in a moderately deep planning task. We find that subjects exploit the structure of the domain to establish subgoals in a way that achieves a nearly maximal reduction in the cost of computing values of choices, but then combine partial searches with greedy local steps to solve subtasks, and maladaptively prune the decision trees of subtasks in a reflexive manner upon encountering salient losses. Subjects come idiosyncratically to favor particular sequences of actions to achieve subgoals, creating novel complex actions or “options.” PMID:25675480
Femtolensing: Beyond the semiclassical approximation
NASA Technical Reports Server (NTRS)
Ulmer, Andrew; Goodman, Jeremy
1995-01-01
Femtolensoing is a gravitational lensing effect in which the magnification is a function not only of the position and sizes of the source and lens, but also of the wavelength of light. Femtolensing is the only known effect of 10(exp -13) - 10(exp -16) solar mass) dark-matter objects and may possibly be detectable in cosmological gamma-ray burst spectra. We present a new and efficient algorithm for femtolensing calculation in general potentials. The physical optics results presented here differ at low frequencies from the semiclassical approximation, in which the flux is attributed to a finite number of mutually coherent images. At higher frequencies, our results agree well with the semicalssical predictions. Applying our method to a point-mass lens with external shear, we find complex events that have structure at both large and small spectral resolution. In this way, we show that femtolensing may be observable for lenses up to 10(exp -11) solar mass, much larger than previously believed. Additionally, we discuss the possibility of a search femtolensing of white dwarfs in the Large Magellanic Cloud at optical wavelengths.
Producing approximate answers to database queries
NASA Technical Reports Server (NTRS)
Vrbsky, Susan V.; Liu, Jane W. S.
1993-01-01
We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. The exact answer is produced if all of the needed data are available and query processing is allowed to continue until completion. The monotone query processing algorithm of APPROXIMATE works within the standard relational algebra framework and can be implemented on a relational database system with little change to the relational architecture. We describe here the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations of both set-valued and single-valued queries. We show how APPROXIMATE is implemented to make effective use of semantic information, provided by an object-oriented view of the database, and describe the additional overhead required by APPROXIMATE.
Signal Approximation with a Wavelet Neural Network
1992-12-01
specialized electronic devices like the Intel Electronically Trainable Analog Neural Network (ETANN) chip. The WNN representation allows the...accurately approximated with a WNN trained with irregularly sampled data. Signal approximation, Wavelet neural network .
Rough Set Approximations in Formal Concept Analysis
NASA Astrophysics Data System (ADS)
Yamaguchi, Daisuke; Murata, Atsuo; Li, Guo-Dong; Nagai, Masatake
Conventional set approximations are based on a set of attributes; however, these approximations cannot relate an object to the corresponding attribute. In this study, a new model for set approximation based on individual attributes is proposed for interval-valued data. Defining an indiscernibility relation is omitted since each attribute value itself has a set of values. Two types of approximations, single- and multiattribute approximations, are presented. A multi-attribute approximation has two solutions: a maximum and a minimum solution. A maximum solution is a set of objects that satisfy the condition of approximation for at least one attribute. A minimum solution is a set of objects that satisfy the condition for all attributes. The proposed set approximation is helpful in finding the features of objects relating to condition attributes when interval-valued data are given. The proposed model contributes to feature extraction in interval-valued information systems.
An approximation technique for jet impingement flow
Najafi, Mahmoud; Fincher, Donald; Rahni, Taeibi; Javadi, KH.; Massah, H.
2015-03-10
The analytical approximate solution of a non-linear jet impingement flow model will be demonstrated. We will show that this is an improvement over the series approximation obtained via the Adomian decomposition method, which is itself, a powerful method for analysing non-linear differential equations. The results of these approximations will be compared to the Runge-Kutta approximation in order to demonstrate their validity.
Energy conservation - A test for scattering approximations
NASA Technical Reports Server (NTRS)
Acquista, C.; Holland, A. C.
1980-01-01
The roles of the extinction theorem and energy conservation in obtaining the scattering and absorption cross sections for several light scattering approximations are explored. It is shown that the Rayleigh, Rayleigh-Gans, anomalous diffraction, geometrical optics, and Shifrin approximations all lead to reasonable values of the cross sections, while the modified Mie approximation does not. Further examination of the modified Mie approximation for the ensembles of nonspherical particles reveals additional problems with that method.
Approximation method for the kinetic Boltzmann equation
NASA Technical Reports Server (NTRS)
Shakhov, Y. M.
1972-01-01
The further development of a method for approximating the Boltzmann equation is considered and a case of pseudo-Maxwellian molecules is treated in detail. A method of approximating the collision frequency is discussed along with a method for approximating the moments of the Boltzmann collision integral. Since the return collisions integral and the collision frequency are expressed through the distribution function moments, use of the proposed methods make it possible to reduce the Boltzmann equation to a series of approximating equations.
Energy conservation - A test for scattering approximations
NASA Technical Reports Server (NTRS)
Acquista, C.; Holland, A. C.
1980-01-01
The roles of the extinction theorem and energy conservation in obtaining the scattering and absorption cross sections for several light scattering approximations are explored. It is shown that the Rayleigh, Rayleigh-Gans, anomalous diffraction, geometrical optics, and Shifrin approximations all lead to reasonable values of the cross sections, while the modified Mie approximation does not. Further examination of the modified Mie approximation for the ensembles of nonspherical particles reveals additional problems with that method.
Compressive Imaging via Approximate Message Passing
2015-09-04
We propose novel compressive imaging algorithms that employ approximate message passing (AMP), which is an iterative signal estimation algorithm that...Approved for Public Release; Distribution Unlimited Final Report: Compressive Imaging via Approximate Message Passing The views, opinions and/or findings...Research Triangle Park, NC 27709-2211 approximate message passing , compressive imaging, compressive sensing, hyperspectral imaging, signal reconstruction
Fractal Trigonometric Polynomials for Restricted Range Approximation
NASA Astrophysics Data System (ADS)
Chand, A. K. B.; Navascués, M. A.; Viswanathan, P.; Katiyar, S. K.
2016-05-01
One-sided approximation tackles the problem of approximation of a prescribed function by simple traditional functions such as polynomials or trigonometric functions that lie completely above or below it. In this paper, we use the concept of fractal interpolation function (FIF), precisely of fractal trigonometric polynomials, to construct one-sided uniform approximants for some classes of continuous functions.
On Approximation of Distribution and Density Functions.
ERIC Educational Resources Information Center
Wolff, Hans
Stochastic approximation algorithms for least square error approximation to density and distribution functions are considered. The main results are necessary and sufficient parameter conditions for the convergence of the approximation processes and a generalization to some time-dependent density and distribution functions. (Author)
Matrix product approximations to conformal field theories
NASA Astrophysics Data System (ADS)
König, Robert; Scholz, Volkher B.
2017-07-01
We establish rigorous error bounds for approximating correlation functions of conformal field theories (CFTs) by certain finite-dimensional tensor networks. For chiral CFTs, the approximation takes the form of a matrix product state. For full CFTs consisting of a chiral and an anti-chiral part, the approximation is given by a finitely correlated state. We show that the bond dimension scales polynomially in the inverse of the approximation error and sub-exponentially in inverse of the minimal distance between insertion points. We illustrate our findings using Wess-Zumino-Witten models, and show that there is a one-to-one correspondence between group-covariant MPS and our approximation.
An Approximate Approach to Automatic Kernel Selection.
Ding, Lizhong; Liao, Shizhong
2016-02-02
Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.
A unified approach to the Darwin approximation
Krause, Todd B.; Apte, A.; Morrison, P. J.
2007-10-15
There are two basic approaches to the Darwin approximation. The first involves solving the Maxwell equations in Coulomb gauge and then approximating the vector potential to remove retardation effects. The second approach approximates the Coulomb gauge equations themselves, then solves these exactly for the vector potential. There is no a priori reason that these should result in the same approximation. Here, the equivalence of these two approaches is investigated and a unified framework is provided in which to view the Darwin approximation. Darwin's original treatment is variational in nature, but subsequent applications of his ideas in the context of Vlasov's theory are not. We present here action principles for the Darwin approximation in the Vlasov context, and this serves as a consistency check on the use of the approximation in this setting.
Cosmological applications of Padé approximant
Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan E-mail: 764644314@qq.com
2014-01-01
As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation.
Approximate dynamic model of a turbojet engine
NASA Technical Reports Server (NTRS)
Artemov, O. A.
1978-01-01
An approximate dynamic nonlinear model of a turbojet engine is elaborated on as a tool in studying the aircraft control loop, with the turbojet engine treated as an actuating component. Approximate relationships linking the basic engine parameters and shaft speed are derived to simplify the problem, and to aid in constructing an approximate nonlinear dynamic model of turbojet engine performance useful for predicting aircraft motion.
The JWKB approximation in loop quantum cosmology
NASA Astrophysics Data System (ADS)
Craig, David; Singh, Parampreet
2017-01-01
We explore the JWKB approximation in loop quantum cosmology in a flat universe with a scalar matter source. Exact solutions of the quantum constraint are studied at small volume in the JWKB approximation in order to assess the probability of tunneling to small or zero volume. Novel features of the approximation are discussed which appear due to the fact that the model is effectively a two-dimensional dynamical system. Based on collaborative work with Parampreet Singh.
Approximation by Ridge Functions and Neural Networks
1997-01-01
univariate spaces Xn Other authors most notably Micchelli and Mhaskar MM MM and Mhaskar M have also considered approximation problems of the...type treated here The work of Micchelli and Mhaskar does not give the best order of approximation Mhaskar M has given best possible results but...function from its projections Duke Math J pp M H Mhaskar Neural networks for optimal approximation of smooth and ana lytic
Piecewise linear approximation for hereditary control problems
NASA Technical Reports Server (NTRS)
Propst, Georg
1990-01-01
This paper presents finite-dimensional approximations for linear retarded functional differential equations by use of discontinuous piecewise linear functions. The approximation scheme is applied to optimal control problems, when a quadratic cost integral must be minimized subject to the controlled retarded system. It is shown that the approximate optimal feedback operators converge to the true ones both in the case where the cost integral ranges over a finite time interval, as well as in the case where it ranges over an infinite time interval. The arguments in the last case rely on the fact that the piecewise linear approximations to stable systems are stable in a uniform sense.
Bent approximations to synchrotron radiation optics
Heald, S.
1981-01-01
Ideal optical elements can be approximated by bending flats or cylinders. This paper considers the applications of these approximate optics to synchrotron radiation. Analytic and raytracing studies are used to compare their optical performance with the corresponding ideal elements. It is found that for many applications the performance is adequate, with the additional advantages of lower cost and greater flexibility. Particular emphasis is placed on obtaining the practical limitations on the use of the approximate elements in typical beamline configurations. Also considered are the possibilities for approximating very long length mirrors using segmented mirrors.
Inversion and approximation of Laplace transforms
NASA Technical Reports Server (NTRS)
Lear, W. M.
1980-01-01
A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.
Approximate methods for equations of incompressible fluid
NASA Astrophysics Data System (ADS)
Galkin, V. A.; Dubovik, A. O.; Epifanov, A. A.
2017-02-01
Approximate methods on the basis of sequential approximations in the theory of functional solutions to systems of conservation laws is considered, including the model of dynamics of incompressible fluid. Test calculations are performed, and a comparison with exact solutions is carried out.
Quirks of Stirling's Approximation
ERIC Educational Resources Information Center
Macrae, Roderick M.; Allgeier, Benjamin M.
2013-01-01
Stirling's approximation to ln "n"! is typically introduced to physical chemistry students as a step in the derivation of the statistical expression for the entropy. However, naive application of this approximation leads to incorrect conclusions. In this article, the problem is first illustrated using a familiar "toy…
Spline approximations for nonlinear hereditary control systems
NASA Technical Reports Server (NTRS)
Daniel, P. L.
1982-01-01
A sline-based approximation scheme is discussed for optimal control problems governed by nonlinear nonautonomous delay differential equations. The approximating framework reduces the original control problem to a sequence of optimization problems governed by ordinary differential equations. Convergence proofs, which appeal directly to dissipative-type estimates for the underlying nonlinear operator, are given and numerical findings are summarized.
Computing Functions by Approximating the Input
ERIC Educational Resources Information Center
Goldberg, Mayer
2012-01-01
In computing real-valued functions, it is ordinarily assumed that the input to the function is known, and it is the output that we need to approximate. In this work, we take the opposite approach: we show how to compute the values of some transcendental functions by approximating the input to these functions, and obtaining exact answers for their…
Quirks of Stirling's Approximation
ERIC Educational Resources Information Center
Macrae, Roderick M.; Allgeier, Benjamin M.
2013-01-01
Stirling's approximation to ln "n"! is typically introduced to physical chemistry students as a step in the derivation of the statistical expression for the entropy. However, naive application of this approximation leads to incorrect conclusions. In this article, the problem is first illustrated using a familiar "toy…
An approximation for inverse Laplace transforms
NASA Technical Reports Server (NTRS)
Lear, W. M.
1981-01-01
Programmable calculator runs simple finite-series approximation for Laplace transform inversions. Utilizing family of orthonormal functions, approximation is used for wide range of transforms, including those encountered in feedback control problems. Method works well as long as F(t) decays to zero as it approaches infinity and so is appliable to most physical systems.
Piecewise linear approximation for hereditary control problems
NASA Technical Reports Server (NTRS)
Propst, Georg
1987-01-01
Finite dimensional approximations are presented for linear retarded functional differential equations by use of discontinuous piecewise linear functions. The approximation scheme is applied to optimal control problems when a quadratic cost integral has to be minimized subject to the controlled retarded system. It is shown that the approximate optimal feedback operators converge to the true ones both in case the cost integral ranges over a finite time interval as well as in the case it ranges over an infinite time interval. The arguments in the latter case rely on the fact that the piecewise linear approximations to stable systems are stable in a uniform sense. This feature is established using a vector-component stability criterion in the state space R(n) x L(2) and the favorable eigenvalue behavior of the piecewise linear approximations.
Approximate error conjugation gradient minimization methods
Kallman, Jeffrey S
2013-05-21
In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.
Approximating maximum clique with a Hopfield network.
Jagota, A
1995-01-01
In a graph, a clique is a set of vertices such that every pair is connected by an edge. MAX-CLIQUE is the optimization problem of finding the largest clique in a given graph and is NP-hard, even to approximate well. Several real-world and theory problems can be modeled as MAX-CLIQUE. In this paper, we efficiently approximate MAX-CLIQUE in a special case of the Hopfield network whose stable states are maximal cliques. We present several energy-descent optimizing dynamics; both discrete (deterministic and stochastic) and continuous. One of these emulates, as special cases, two well-known greedy algorithms for approximating MAX-CLIQUE. We report on detailed empirical comparisons on random graphs and on harder ones. Mean-field annealing, an efficient approximation to simulated annealing, and a stochastic dynamics are the narrow but clear winners. All dynamics approximate much better than one which emulates a "naive" greedy heuristic.
Frankenstein's glue: transition functions for approximate solutions
NASA Astrophysics Data System (ADS)
Yunes, Nicolás
2007-09-01
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we provide an attempt to formalize this gluing scheme by studying transition functions that join approximate analytic solutions together. In particular, we propose certain sufficient conditions on these functions and prove that these conditions guarantee that the joined solution still satisfies the Einstein equations analytically to the same order as the approximate ones. An example is also provided for a binary system of non-spinning black holes, where the approximate solutions are taken to be given by a post-Newtonian expansion and a perturbed Schwarzschild solution. For this specific case, we show that if the transition functions satisfy the proposed conditions, then the joined solution does not contain any violations to the Einstein equations larger than those already inherent in the approximations. We further show that if these functions violate the proposed conditions, then the matter content of the spacetime is modified by the introduction of a matter shell, whose stress energy tensor depends on derivatives of these functions.
Stochastic population dynamics: The Poisson approximation
NASA Astrophysics Data System (ADS)
Solari, Hernán G.; Natiello, Mario A.
2003-03-01
We introduce an approximation to stochastic population dynamics based on almost independent Poisson processes whose parameters obey a set of coupled ordinary differential equations. The approximation applies to systems that evolve in terms of events such as death, birth, contagion, emission, absorption, etc., and we assume that the event-rates satisfy a generalized mass-action law. The dynamics of the populations is then the result of the projection from the space of events into the space of populations that determine the state of the system (phase space). The properties of the Poisson approximation are studied in detail. Especially, error bounds for the moment generating function and the generating function receive particular attention. The deterministic approximation for the population fractions and the Langevin-type approximation for the fluctuations around the mean value are recovered within the framework of the Poisson approximation as particular limit cases. However, the proposed framework allows to treat other limit cases and general situations with small populations that lie outside the scope of the standard approaches. The Poisson approximation can be viewed as a general (numerical) integration scheme for this family of problems in population dynamics.
Approximating Light Rays in the Schwarzschild Field
NASA Astrophysics Data System (ADS)
Semerák, O.
2015-02-01
A short formula is suggested that approximates photon trajectories in the Schwarzschild field better than other simple prescriptions from the literature. We compare it with various "low-order competitors," namely, with those following from exact formulas for small M, with one of the results based on pseudo-Newtonian potentials, with a suitably adjusted hyperbola, and with the effective and often employed approximation by Beloborodov. Our main concern is the shape of the photon trajectories at finite radii, yet asymptotic behavior is also discussed, important for lensing. An example is attached indicating that the newly suggested approximation is usable—and very accurate—for practically solving the ray-deflection exercise.
Approximate knowledge compilation: The first order case
Val, A. del
1996-12-31
Knowledge compilation procedures make a knowledge base more explicit so as make inference with respect to the compiled knowledge base tractable or at least more efficient. Most work to date in this area has been restricted to the propositional case, despite the importance of first order theories for expressing knowledge concisely. Focusing on (LUB) approximate compilation, our contribution is twofold: (1) We present a new ground algorithm for approximate compilation which can produce exponential savings with respect to the previously known algorithm. (2) We show that both ground algorithms can be lifted to the first order case preserving their correctness for approximate compilation.
Approximate Bruechner orbitals in electron propagator calculations
Ortiz, J.V.
1999-12-01
Orbitals and ground-state correlation amplitudes from the so-called Brueckner doubles approximation of coupled-cluster theory provide a useful reference state for electron propagator calculations. An operator manifold with hold, particle, two-hole-one-particle and two-particle-one-hole components is chosen. The resulting approximation, third-order algebraic diagrammatic construction [2ph-TDA, ADC (3)] and 3+ methods. The enhanced versatility of this approximation is demonstrated through calculations on valence ionization energies, core ionization energies, electron detachment energies of anions, and on a molecule with partial biradical character, ozone.
Alternative approximation concepts for space frame synthesis
NASA Technical Reports Server (NTRS)
Lust, R. V.; Schmit, L. A.
1985-01-01
A method for space frame synthesis based on the application of a full gamut of approximation concepts is presented. It is found that with the thoughtful selection of design space, objective function approximation, constraint approximation and mathematical programming problem formulation options it is possible to obtain near minimum mass designs for a significant class of space frame structural systems while requiring fewer than 10 structural analyses. Example problems are presented which demonstrate the effectiveness of the method for frame structures subjected to multiple static loading conditions with limits on structural stiffness and strength.
APPROXIMATING LIGHT RAYS IN THE SCHWARZSCHILD FIELD
Semerák, O.
2015-02-10
A short formula is suggested that approximates photon trajectories in the Schwarzschild field better than other simple prescriptions from the literature. We compare it with various ''low-order competitors'', namely, with those following from exact formulas for small M, with one of the results based on pseudo-Newtonian potentials, with a suitably adjusted hyperbola, and with the effective and often employed approximation by Beloborodov. Our main concern is the shape of the photon trajectories at finite radii, yet asymptotic behavior is also discussed, important for lensing. An example is attached indicating that the newly suggested approximation is usable—and very accurate—for practically solving the ray-deflection exercise.
Information geometry of mean-field approximation.
Tanaka, T
2000-08-01
I present a general theory of mean-field approximation based on information geometry and applicable not only to Boltzmann machines but also to wider classes of statistical models. Using perturbation expansion of the Kullback divergence (or Plefka expansion in statistical physics), a formulation of mean-field approximation of general orders is derived. It includes in a natural way the "naive" mean-field approximation and is consistent with the Thouless-Anderson-Palmer (TAP) approach and the linear response theorem in statistical physics.
A Survey of Techniques for Approximate Computing
Mittal, Sparsh
2016-03-18
Approximate computing trades off computation quality with the effort expended and as rising performance demands confront with plateauing resource budgets, approximate computing has become, not merely attractive, but even imperative. Here, we present a survey of techniques for approximate computing (AC). We discuss strategies for finding approximable program portions and monitoring output quality, techniques for using AC in different processing units (e.g., CPU, GPU and FPGA), processor components, memory technologies etc., and programming frameworks for AC. Moreover, we classify these techniques based on several key characteristics to emphasize their similarities and differences. Finally, the aim of this paper is to provide insights to researchers into working of AC techniques and inspire more efforts in this area to make AC the mainstream computing approach in future systems.
A Survey of Techniques for Approximate Computing
Mittal, Sparsh
2016-03-18
Approximate computing trades off computation quality with the effort expended and as rising performance demands confront with plateauing resource budgets, approximate computing has become, not merely attractive, but even imperative. Here, we present a survey of techniques for approximate computing (AC). We discuss strategies for finding approximable program portions and monitoring output quality, techniques for using AC in different processing units (e.g., CPU, GPU and FPGA), processor components, memory technologies etc., and programming frameworks for AC. Moreover, we classify these techniques based on several key characteristics to emphasize their similarities and differences. Finally, the aim of this paper is tomore » provide insights to researchers into working of AC techniques and inspire more efforts in this area to make AC the mainstream computing approach in future systems.« less
Approximate probability distributions of the master equation.
Thomas, Philipp; Grima, Ramon
2015-07-01
Master equations are common descriptions of mesoscopic systems. Analytical solutions to these equations can rarely be obtained. We here derive an analytical approximation of the time-dependent probability distribution of the master equation using orthogonal polynomials. The solution is given in two alternative formulations: a series with continuous and a series with discrete support, both of which can be systematically truncated. While both approximations satisfy the system size expansion of the master equation, the continuous distribution approximations become increasingly negative and tend to oscillations with increasing truncation order. In contrast, the discrete approximations rapidly converge to the underlying non-Gaussian distributions. The theory is shown to lead to particularly simple analytical expressions for the probability distributions of molecule numbers in metabolic reactions and gene expression systems.
Linear Approximation SAR Azimuth Processing Study
NASA Technical Reports Server (NTRS)
Lindquist, R. B.; Masnaghetti, R. K.; Belland, E.; Hance, H. V.; Weis, W. G.
1979-01-01
A segmented linear approximation of the quadratic phase function that is used to focus the synthetic antenna of a SAR was studied. Ideal focusing, using a quadratic varying phase focusing function during the time radar target histories are gathered, requires a large number of complex multiplications. These can be largely eliminated by using linear approximation techniques. The result is a reduced processor size and chip count relative to ideally focussed processing and a correspondingly increased feasibility for spaceworthy implementation. A preliminary design and sizing for a spaceworthy linear approximation SAR azimuth processor meeting requirements similar to those of the SEASAT-A SAR was developed. The study resulted in a design with approximately 1500 IC's, 1.2 cubic feet of volume, and 350 watts of power for a single look, 4000 range cell azimuth processor with 25 meters resolution.
AN APPROXIMATE EQUATION OF STATE OF SOLIDS.
research. By generalizing experimental data and obtaining unified relations describing the thermodynamic properties of solids, and approximate equation of state is derived which can be applied to a wide class of materials. (Author)
Approximate Controllability Results for Linear Viscoelastic Flows
NASA Astrophysics Data System (ADS)
Chowdhury, Shirshendu; Mitra, Debanjana; Ramaswamy, Mythily; Renardy, Michael
2017-09-01
We consider linear viscoelastic flow of a multimode Maxwell or Jeffreys fluid in a bounded domain with smooth boundary, with a distributed control in the momentum equation. We establish results on approximate and exact controllability.
Approximation concepts for efficient structural synthesis
NASA Technical Reports Server (NTRS)
Schmit, L. A., Jr.; Miura, H.
1976-01-01
It is shown that efficient structural synthesis capabilities can be created by using approximation concepts to mesh finite element structural analysis methods with nonlinear mathematical programming techniques. The history of the application of mathematical programming techniques to structural design optimization problems is reviewed. Several rather general approximation concepts are described along with the technical foundations of the ACCESS 1 computer program, which implements several approximation concepts. A substantial collection of structural design problems involving truss and idealized wing structures is presented. It is concluded that since the basic ideas employed in creating the ACCESS 1 program are rather general, its successful development supports the contention that the introduction of approximation concepts will lead to the emergence of a new generation of practical and efficient, large scale, structural synthesis capabilities in which finite element analysis methods and mathematical programming algorithms will play a central role.
Approximate probability distributions of the master equation
NASA Astrophysics Data System (ADS)
Thomas, Philipp; Grima, Ramon
2015-07-01
Master equations are common descriptions of mesoscopic systems. Analytical solutions to these equations can rarely be obtained. We here derive an analytical approximation of the time-dependent probability distribution of the master equation using orthogonal polynomials. The solution is given in two alternative formulations: a series with continuous and a series with discrete support, both of which can be systematically truncated. While both approximations satisfy the system size expansion of the master equation, the continuous distribution approximations become increasingly negative and tend to oscillations with increasing truncation order. In contrast, the discrete approximations rapidly converge to the underlying non-Gaussian distributions. The theory is shown to lead to particularly simple analytical expressions for the probability distributions of molecule numbers in metabolic reactions and gene expression systems.
Computational aspects of pseudospectral Laguerre approximations
NASA Technical Reports Server (NTRS)
Funaro, Daniele
1989-01-01
Pseudospectral approximations in unbounded domains by Laguerre polynomials lead to ill-conditioned algorithms. Introduced are a scaling function and appropriate numerical procedures in order to limit these unpleasant phenomena.
Polynomial approximation of functions in Sobolev spaces
Dupont, T.; Scott, R.
1980-04-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomical plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.
Computing functions by approximating the input
NASA Astrophysics Data System (ADS)
Goldberg, Mayer
2012-12-01
In computing real-valued functions, it is ordinarily assumed that the input to the function is known, and it is the output that we need to approximate. In this work, we take the opposite approach: we show how to compute the values of some transcendental functions by approximating the input to these functions, and obtaining exact answers for their output. Our approach assumes only the most rudimentary knowledge of algebra and trigonometry, and makes no use of calculus.
Approximate String Matching with Reduced Alphabet
NASA Astrophysics Data System (ADS)
Salmela, Leena; Tarhio, Jorma
We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned version of the approximate Boyer-Moore algorithm utilizing the Four-Russians technique. Our experiments show that the alphabet reduction makes the algorithm faster. Especially in the k-mismatch case, the new variation is faster than earlier algorithms for English data with small values of k.
Some Recent Progress for Approximation Algorithms
NASA Astrophysics Data System (ADS)
Kawarabayashi, Ken-ichi
We survey some recent progress on approximation algorithms. Our main focus is the following two problems that have some recent breakthroughs; the edge-disjoint paths problem and the graph coloring problem. These breakthroughs involve the following three ingredients that are quite central in approximation algorithms: (1) Combinatorial (graph theoretical) approach, (2) LP based approach and (3) Semi-definite programming approach. We also sketch how they are used to obtain recent development.
Polynomial approximation of functions in Sobolev spaces
NASA Technical Reports Server (NTRS)
Dupont, T.; Scott, R.
1980-01-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.
Polynomial approximation of functions in Sobolev spaces
NASA Technical Reports Server (NTRS)
Dupont, T.; Scott, R.
1980-01-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.
Nonlinear Stochastic PDEs: Analysis and Approximations
2016-05-23
3.4.1 Nonlinear Stochastic PDEs: Analysis and Approximations We compare Wiener chaos and stochastic collocation methods for linear advection-reaction...ADDRESS (ES) U.S. Army Research Office P.O. Box 12211 Research Triangle Park, NC 27709-2211 nonlinear stochastic PDEs (SPDEs), nonlocal SPDEs, Navier...3.4.1 Nonlinear Stochastic PDEs: Analysis and Approximations Report Title We compare Wiener chaos and stochastic collocation methods for linear
Approximations and Solution Estimates in Optimization
2016-04-06
Approximations and Solution Estimates in Optimization Johannes O. Royset Operations Research Department Naval Postgraduate School joroyset@nps.edu...Abstract. Approximation is central to many optimization problems and the supporting theory pro- vides insight as well as foundation for algorithms. In...functions quantifies epi-convergence, we are able to obtain estimates of optimal solutions and optimal values through estimates of that distance. In
The closure approximation in the hierarchy equations.
NASA Technical Reports Server (NTRS)
Adomian, G.
1971-01-01
The expectation of the solution process in a stochastic operator equation can be obtained from averaged equations only under very special circumstances. Conditions for validity are given and the significance and validity of the approximation in widely used hierarchy methods and the ?self-consistent field' approximation in nonequilibrium statistical mechanics are clarified. The error at any level of the hierarchy can be given and can be avoided by the use of the iterative method.
An improved proximity force approximation for electrostatics
Fosco, Cesar D.; Lombardo, Fernando C.; Mazzitelli, Francisco D.
2012-08-15
A quite straightforward approximation for the electrostatic interaction between two perfectly conducting surfaces suggests itself when the distance between them is much smaller than the characteristic lengths associated with their shapes. Indeed, in the so called 'proximity force approximation' the electrostatic force is evaluated by first dividing each surface into a set of small flat patches, and then adding up the forces due two opposite pairs, the contributions of which are approximated as due to pairs of parallel planes. This approximation has been widely and successfully applied in different contexts, ranging from nuclear physics to Casimir effect calculations. We present here an improvement on this approximation, based on a derivative expansion for the electrostatic energy contained between the surfaces. The results obtained could be useful for discussing the geometric dependence of the electrostatic force, and also as a convenient benchmark for numerical analyses of the tip-sample electrostatic interaction in atomic force microscopes. - Highlights: Black-Right-Pointing-Pointer The proximity force approximation (PFA) has been widely used in different areas. Black-Right-Pointing-Pointer The PFA can be improved using a derivative expansion in the shape of the surfaces. Black-Right-Pointing-Pointer We use the improved PFA to compute electrostatic forces between conductors. Black-Right-Pointing-Pointer The results can be used as an analytic benchmark for numerical calculations in AFM. Black-Right-Pointing-Pointer Insight is provided for people who use the PFA to compute nuclear and Casimir forces.
Approximating centrality in evolving graphs: toward sublinearity
NASA Astrophysics Data System (ADS)
Priest, Benjamin W.; Cybenko, George
2017-05-01
The identification of important nodes is a ubiquitous problem in the analysis of social networks. Centrality indices (such as degree centrality, closeness centrality, betweenness centrality, PageRank, and others) are used across many domains to accomplish this task. However, the computation of such indices is expensive on large graphs. Moreover, evolving graphs are becoming increasingly important in many applications. It is therefore desirable to develop on-line algorithms that can approximate centrality measures using memory sublinear in the size of the graph. We discuss the challenges facing the semi-streaming computation of many centrality indices. In particular, we apply recent advances in the streaming and sketching literature to provide a preliminary streaming approximation algorithm for degree centrality utilizing CountSketch and a multi-pass semi-streaming approximation algorithm for closeness centrality leveraging a spanner obtained through iteratively sketching the vertex-edge adjacency matrix. We also discuss possible ways forward for approximating betweenness centrality, as well as spectral measures of centrality. We provide a preliminary result using sketched low-rank approximations to approximate the output of the HITS algorithm.
Lerman, Yelena V.; Kennedy, Scott D.; Shankar, Neelaabh; Parisien, Marc; Major, Francois; Turner, Douglas H.
2011-01-01
The NMR solution structure is reported of a duplex, 5′GUGAAGCCCGU/3′UCACAGGAGGC, containing a 4 × 4 nucleotide internal loop from an R2 retrotransposon RNA. The loop contains three sheared purine–purine pairs and reveals a structural element found in other RNAs, which we refer to as the 3RRs motif. Optical melting measurements of the thermodynamics of the duplex indicate that the internal loop is 1.6 kcal/mol more stable at 37°C than predicted. The results identify the 3RRs motif as a common structural element that can facilitate prediction of 3D structure. Known examples include internal loops having the pairings: 5′GAA/3′AGG, 5′GAG/3′AGG, 5′GAA/3′AAG, and 5′AAG/3′AGG. The structural information is compared with predictions made with the MC-Sym program. PMID:21778280
NASA Technical Reports Server (NTRS)
Ito, K.
1984-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
NASA Technical Reports Server (NTRS)
Ito, K.
1985-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A characteristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
The tendon approximator device in traumatic injuries.
Forootan, Kamal S; Karimi, Hamid; Forootan, Nazilla-Sadat S
2015-01-01
Precise and tension-free approximation of two tendon endings is the key predictor of outcomes following tendon lacerations and repairs. We evaluate the efficacy of a new tendon approximator device in tendon laceration repairs. In a comparative study, we used our new tendon approximator device in 99 consecutive patients with laceration of 266 tendons who attend a university hospital and evaluated the operative time to repair the tendons, surgeons' satisfaction as well as patient's outcomes in a long-term follow-up. Data were compared with the data of control patients undergoing tendon repair by conventional method. Totally 266 tendons were repaired by approximator device and 199 tendons by conventional technique. 78.7% of patients in first group were male and 21.2% were female. In approximator group 38% of patients had secondary repair of cut tendons and 62% had primary repair. Patients were followed for a mean period of 3years (14-60 months). Time required for repair of each tendon was significantly reduced with the approximator device (2 min vs. 5.5 min, p<0.0001). After 3-4 weeks of immobilization, passive and active physiotherapy was started. Functional Results of tendon repair were identical in the two groups and were not significantly different. 1% of tendons in group A and 1.2% in group B had rupture that was not significantly different. The new nerve approximator device is cheap, feasible to use and reduces the time of tendon repair with sustained outcomes comparable to the conventional methods.
On uniform approximation of elliptic functions by Padé approximants
NASA Astrophysics Data System (ADS)
Khristoforov, Denis V.
2009-06-01
Diagonal Padé approximants of elliptic functions are studied. It is known that the absence of uniform convergence of such approximants is related to them having spurious poles that do not correspond to any singularities of the function being approximated. A sequence of piecewise rational functions is proposed, which is constructed from two neighbouring Padé approximants and approximates an elliptic function locally uniformly in the Stahl domain. The proof of the convergence of this sequence is based on deriving strong asymptotic formulae for the remainder function and Padé polynomials and on the analysis of the behaviour of a spurious pole. Bibliography: 23 titles.
Approximation of Bivariate Functions via Smooth Extensions
Zhang, Zhihua
2014-01-01
For a smooth bivariate function defined on a general domain with arbitrary shape, it is difficult to do Fourier approximation or wavelet approximation. In order to solve these problems, in this paper, we give an extension of the bivariate function on a general domain with arbitrary shape to a smooth, periodic function in the whole space or to a smooth, compactly supported function in the whole space. These smooth extensions have simple and clear representations which are determined by this bivariate function and some polynomials. After that, we expand the smooth, periodic function into a Fourier series or a periodic wavelet series or we expand the smooth, compactly supported function into a wavelet series. Since our extensions are smooth, the obtained Fourier coefficients or wavelet coefficients decay very fast. Since our extension tools are polynomials, the moment theorem shows that a lot of wavelet coefficients vanish. From this, with the help of well-known approximation theorems, using our extension methods, the Fourier approximation and the wavelet approximation of the bivariate function on the general domain with small error are obtained. PMID:24683316
Recent advances in discrete dipole approximation
NASA Astrophysics Data System (ADS)
Flatau, P. J.
2012-12-01
I will describe recent advances and results related to Discrete Dipole Approximation. I will concentrate on Discrete Dipole Scattering (DDSCAT) code which has been jointly developed by myself and Bruce T. Draine. Discussion will concentrate on calculation of scattering and absorption by isolated particles (e.g., dust grains, ice crystals), calculations of scattering by periodic structures with applications to studies of scattering and absorption by periodic arrangement of finite cylinders, cubes, etc), very fast near field calculation, ways to display scattering targets and their composition using three dimensional graphical codes. I will discuss possible extensions. References Flatau, P. J. and Draine, B. T., 2012, Fast near field calculations in the discrete dipole approximation for regular rectilinear grids, Optics Express, 20, 1247-1252. Draine B. T. and Flatau P. J., 2008, Discrete-dipole approximation for periodic targets: theory and tests , J. Opt. Soc. Am. A., 25, 2693-2703. Draine BT and Flatau PJ, 2012, User Guide for the Discrete Dipole Approximation Code DDSCAT 7.2, arXiv:1202.3424v3.ear field calculations (Fast near field calculations in the discrete dipole approximation for regular rectilinear grids P. J. Flatau and B. T. Draine, Optics Express, Vol. 20, Issue 2, pp. 1247-1252 (2012))
Estimation of distribution algorithms with Kikuchi approximations.
Santana, Roberto
2005-01-01
The question of finding feasible ways for estimating probability distributions is one of the main challenges for Estimation of Distribution Algorithms (EDAs). To estimate the distribution of the selected solutions, EDAs use factorizations constructed according to graphical models. The class of factorizations that can be obtained from these probability models is highly constrained. Expanding the class of factorizations that could be employed for probability approximation is a necessary step for the conception of more robust EDAs. In this paper we introduce a method for learning a more general class of probability factorizations. The method combines a reformulation of a probability approximation procedure known in statistical physics as the Kikuchi approximation of energy, with a novel approach for finding graph decompositions. We present the Markov Network Estimation of Distribution Algorithm (MN-EDA), an EDA that uses Kikuchi approximations to estimate the distribution, and Gibbs Sampling (GS) to generate new points. A systematic empirical evaluation of MN-EDA is done in comparison with different Bayesian network based EDAs. From our experiments we conclude that the algorithm can outperform other EDAs that use traditional methods of probability approximation in the optimization of functions with strong interactions among their variables.
The Cell Cycle Switch Computes Approximate Majority
NASA Astrophysics Data System (ADS)
Cardelli, Luca; Csikász-Nagy, Attila
2012-09-01
Both computational and biological systems have to make decisions about switching from one state to another. The `Approximate Majority' computational algorithm provides the asymptotically fastest way to reach a common decision by all members of a population between two possible outcomes, where the decision approximately matches the initial relative majority. The network that regulates the mitotic entry of the cell-cycle in eukaryotes also makes a decision before it induces early mitotic processes. Here we show that the switch from inactive to active forms of the mitosis promoting Cyclin Dependent Kinases is driven by a system that is related to both the structure and the dynamics of the Approximate Majority computation. We investigate the behavior of these two switches by deterministic, stochastic and probabilistic methods and show that the steady states and temporal dynamics of the two systems are similar and they are exchangeable as components of oscillatory networks.
Ancilla-approximable quantum state transformations
Blass, Andreas; Gurevich, Yuri
2015-04-15
We consider the transformations of quantum states obtainable by a process of the following sort. Combine the given input state with a specially prepared initial state of an auxiliary system. Apply a unitary transformation to the combined system. Measure the state of the auxiliary subsystem. If (and only if) it is in a specified final state, consider the process successful, and take the resulting state of the original (principal) system as the result of the process. We review known information about exact realization of transformations by such a process. Then we present results about approximate realization of finite partial transformations. We not only consider primarily the issue of approximation to within a specified positive ε, but also address the question of arbitrarily close approximation.
Separable approximations of two-body interactions
NASA Astrophysics Data System (ADS)
Haidenbauer, J.; Plessas, W.
1983-01-01
We perform a critical discussion of the efficiency of the Ernst-Shakin-Thaler method for a separable approximation of arbitrary two-body interactions by a careful examination of separable 3S1-3D1 N-N potentials that were constructed via this method by Pieper. Not only the on-shell properties of these potentials are considered, but also a comparison is made of their off-shell characteristics relative to the Reid soft-core potential. We point out a peculiarity in Pieper's application of the Ernst-Shakin-Thaler method, which leads to a resonant-like behavior of his potential 3SD1D. It is indicated where care has to be taken in order to circumvent drawbacks inherent in the Ernst-Shakin-Thaler separable approximation scheme. NUCLEAR REACTIONS Critical discussion of the Ernst-Shakin-Thaler separable approximation method. Pieper's separable N-N potentials examined on shell and off shell.
Approximate solutions of the hyperbolic Kepler equation
NASA Astrophysics Data System (ADS)
Avendano, Martín; Martín-Molina, Verónica; Ortigas-Galindo, Jorge
2015-12-01
We provide an approximate zero widetilde{S}(g,L) for the hyperbolic Kepler's equation S-g {{arcsinh}}(S)-L=0 for gin (0,1) and Lin [0,∞ ). We prove, by using Smale's α -theory, that Newton's method starting at our approximate zero produces a sequence that converges to the actual solution S( g, L) at quadratic speed, i.e. if S_n is the value obtained after n iterations, then |S_n-S|≤ 0.5^{2^n-1}|widetilde{S}-S|. The approximate zero widetilde{S}(g,L) is a piecewise-defined function involving several linear expressions and one with cubic and square roots. In bounded regions of (0,1) × [0,∞ ) that exclude a small neighborhood of g=1, L=0, we also provide a method to construct simpler starters involving only constants.
Fast wavelet based sparse approximate inverse preconditioner
Wan, W.L.
1996-12-31
Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.
Approximation methods in gravitational-radiation theory
NASA Technical Reports Server (NTRS)
Will, C. M.
1986-01-01
The observation of gravitational-radiation damping in the binary pulsar PSR 1913 + 16 and the ongoing experimental search for gravitational waves of extraterrestrial origin have made the theory of gravitational radiation an active branch of classical general relativity. In calculations of gravitational radiation, approximation methods play a crucial role. Recent developments are summarized in two areas in which approximations are important: (a) the quadrupole approxiamtion, which determines the energy flux and the radiation reaction forces in weak-field, slow-motion, source-within-the-near-zone systems such as the binary pulsar; and (b) the normal modes of oscillation of black holes, where the Wentzel-Kramers-Brillouin approximation gives accurate estimates of the complex frequencies of the modes.
Approximation methods in gravitational-radiation theory
NASA Technical Reports Server (NTRS)
Will, C. M.
1986-01-01
The observation of gravitational-radiation damping in the binary pulsar PSR 1913 + 16 and the ongoing experimental search for gravitational waves of extraterrestrial origin have made the theory of gravitational radiation an active branch of classical general relativity. In calculations of gravitational radiation, approximation methods play a crucial role. Recent developments are summarized in two areas in which approximations are important: (a) the quadrupole approxiamtion, which determines the energy flux and the radiation reaction forces in weak-field, slow-motion, source-within-the-near-zone systems such as the binary pulsar; and (b) the normal modes of oscillation of black holes, where the Wentzel-Kramers-Brillouin approximation gives accurate estimates of the complex frequencies of the modes.
Exponential Approximations Using Fourier Series Partial Sums
NASA Technical Reports Server (NTRS)
Banerjee, Nana S.; Geer, James F.
1997-01-01
The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.
Approximating W projection as a separable kernel
NASA Astrophysics Data System (ADS)
Merry, Bruce
2016-02-01
W projection is a commonly used approach to allow interferometric imaging to be accelerated by fast Fourier transforms, but it can require a huge amount of storage for convolution kernels. The kernels are not separable, but we show that they can be closely approximated by separable kernels. The error scales with the fourth power of the field of view, and so is small enough to be ignored at mid- to high frequencies. We also show that hybrid imaging algorithms combining W projection with either faceting, snapshotting, or W stacking allow the error to be made arbitrarily small, making the approximation suitable even for high-resolution wide-field instruments.
Approximate convective heating equations for hypersonic flows
NASA Technical Reports Server (NTRS)
Zoby, E. V.; Moss, J. N.; Sutton, K.
1979-01-01
Laminar and turbulent heating-rate equations appropriate for engineering predictions of the convective heating rates about blunt reentry spacecraft at hypersonic conditions are developed. The approximate methods are applicable to both nonreacting and reacting gas mixtures for either constant or variable-entropy edge conditions. A procedure which accounts for variable-entropy effects and is not based on mass balancing is presented. Results of the approximate heating methods are in good agreement with existing experimental results as well as boundary-layer and viscous-shock-layer solutions.
Bronchopulmonary segments approximation using anatomical atlas
NASA Astrophysics Data System (ADS)
Busayarat, Sata; Zrimec, Tatjana
2007-03-01
Bronchopulmonary segments are valuable as they give more accurate localization than lung lobes. Traditionally, determining the segments requires segmentation and identification of segmental bronchi, which, in turn, require volumetric imaging data. In this paper, we present a method for approximating the bronchopulmonary segments for sparse data by effectively using an anatomical atlas. The atlas is constructed from a volumetric data and contains accurate information about bronchopulmonary segments. A new ray-tracing based image registration is used for transferring the information from the atlas to a query image. Results show that the method is able to approximate the segments on sparse HRCT data with slice gap up to 25 millimeters.
Local density approximations from finite systems
NASA Astrophysics Data System (ADS)
Entwistle, M. T.; Hodgson, M. J. P.; Wetherell, J.; Longstaff, B.; Ramsden, J. D.; Godby, R. W.
2016-11-01
The local density approximation (LDA) constructed through quantum Monte Carlo calculations of the homogeneous electron gas (HEG) is the most common approximation to the exchange-correlation functional in density functional theory. We introduce an alternative set of LDAs constructed from slablike systems of one, two, and three electrons that resemble the HEG within a finite region, and illustrate the concept in one dimension. Comparing with the exact densities and Kohn-Sham potentials for various test systems, we find that the LDAs give a good account of the self-interaction correction, but are less reliable when correlation is stronger or currents flow.
Congruence Approximations for Entrophy Endowed Hyperbolic Systems
NASA Technical Reports Server (NTRS)
Barth, Timothy J.; Saini, Subhash (Technical Monitor)
1998-01-01
Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.
Very fast approximate reconstruction of MR images.
Angelidis, P A
1998-11-01
The ultra fast Fourier transform (UFFT) provides the means for a very fast computation of a magnetic resonance (MR) image, because it is implemented using only additions and no multiplications at all. It achieves this by approximating the complex exponential functions involved in the Fourier transform (FT) sum with computationally simpler periodic functions. This approximation introduces erroneous spectrum peaks of small magnitude. We examine the performance of this transform in some typical MRI signals. The results show that this transform can very quickly provide an MR image. It is proposed to be used as a replacement of the classically used FFT whenever a fast general overview of an image is required.
Characterizing inflationary perturbations: The uniform approximation
Habib, Salman; Heinen, Andreas; Heitmann, Katrin; Jungman, Gerard; Molina-Paris, Carmen
2004-10-15
The spectrum of primordial fluctuations from inflation can be obtained using a mathematically controlled, and systematically extendable, uniform approximation. Closed-form expressions for power spectra and spectral indices may be found without making explicit slow-roll assumptions. Here we provide details of our previous calculations, extend the results beyond leading-order in the approximation, and derive general error bounds for power spectra and spectral indices. Already at next-to-leading-order, the errors in calculating the power spectrum are less than a percent. This meets the accuracy requirement for interpreting next-generation cosmic microwave background observations.
An Approximation Scheme for Delay Equations.
1980-06-16
AD-Am" 155 BtO~i UNkIV PROVIDENCE RI LEFSCI4ETZ CENTER FOR DYNAMI-flO F/f 12/ 1 AN APPROXIMATION SCIEME FOR DELAY EQUATIONS (U) JUN 80 F KAPPEL DAA629...for publ.ic release IAM 19.. and 1s aftnaotaton in unhi tea.0 ( f) 1 DDC UtB Distwifeaton A_._il .rd/or 1 . Introduction. In recent years one can see...Banach spaces. Fundamental for our approach is the following approximation theorem for semigroups of type W: Theorem 1 ([10]). Let AN, N - 1,2,..., and A
Approximate learning algorithm in Boltzmann machines.
Yasuda, Muneki; Tanaka, Kazuyuki
2009-11-01
Boltzmann machines can be regarded as Markov random fields. For binary cases, they are equivalent to the Ising spin model in statistical mechanics. Learning systems in Boltzmann machines are one of the NP-hard problems. Thus, in general we have to use approximate methods to construct practical learning algorithms in this context. In this letter, we propose new and practical learning algorithms for Boltzmann machines by using the belief propagation algorithm and the linear response approximation, which are often referred as advanced mean field methods. Finally, we show the validity of our algorithm using numerical experiments.
An approximate classical unimolecular reaction rate theory
NASA Astrophysics Data System (ADS)
Zhao, Meishan; Rice, Stuart A.
1992-05-01
We describe a classical theory of unimolecular reaction rate which is derived from the analysis of Davis and Gray by use of simplifying approximations. These approximations concern the calculation of the locations of, and the fluxes of phase points across, the bottlenecks to fragmentation and to intramolecular energy transfer. The bottleneck to fragment separation is represented as a vibration-rotation state dependent separatrix, which approximation is similar to but extends and improves the approximations for the separatrix introduced by Gray, Rice, and Davis and by Zhao and Rice. The novel feature in our analysis is the representation of the bottlenecks to intramolecular energy transfer as dividing surfaces in phase space; the locations of these dividing surfaces are determined by the same conditions as locate the remnants of robust tori with frequency ratios related to the golden mean (in a two degree of freedom system these are the cantori). The flux of phase points across each dividing surface is calculated with an analytic representation instead of a stroboscopic mapping. The rate of unimolecular reaction is identified with the net rate at which phase points escape from the region of quasiperiodic bounded motion to the region of free fragment motion by consecutively crossing the dividing surfaces for intramolecular energy exchange and the separatrix. This new theory generates predictions of the rates of predissociation of the van der Waals molecules HeI2, NeI2 and ArI2 which are in very good agreement with available experimental data.
Alternative approximation concepts for space frame synthesis
NASA Technical Reports Server (NTRS)
Lust, R. V.; Schmit, L. A.
1985-01-01
A structural synthesis methodology for the minimum mass design of 3-dimensionall frame-truss structures under multiple static loading conditions and subject to limits on displacements, rotations, stresses, local buckling, and element cross-sectional dimensions is presented. A variety of approximation concept options are employed to yield near optimum designs after no more than 10 structural analyses. Available options include: (A) formulation of the nonlinear mathematcal programming problem in either reciprocal section property (RSP) or cross-sectional dimension (CSD) space; (B) two alternative approximate problem structures in each design space; and (C) three distinct assumptions about element end-force variations. Fixed element, design element linking, and temporary constraint deletion features are also included. The solution of each approximate problem, in either its primal or dual form, is obtained using CONMIN, a feasible directions program. The frame-truss synthesis methodology is implemented in the COMPASS computer program and is used to solve a variety of problems. These problems were chosen so that, in addition to exercising the various approximation concepts options, the results could be compared with previously published work.
Approximations For Controls Of Hereditary Systems
NASA Technical Reports Server (NTRS)
Milman, Mark H.
1988-01-01
Convergence properties of controls, trajectories, and feedback kernels analyzed. Report discusses use of factorization techniques to approximate optimal feedback gains in finite-time, linear-regulator/quadratic-cost-function problem of system governed by retarded-functional-difference equations RFDE's with control delays. Presents approach to factorization based on discretization of state penalty leading to simple structure for feedback control law.
Progressive Image Coding by Hierarchical Linear Approximation.
ERIC Educational Resources Information Center
Wu, Xiaolin; Fang, Yonggang
1994-01-01
Proposes a scheme of hierarchical piecewise linear approximation as an adaptive image pyramid. A progressive image coder comes naturally from the proposed image pyramid. The new pyramid is semantically more powerful than regular tessellation but syntactically simpler than free segmentation. This compromise between adaptability and complexity…
Quickly Approximating the Distance Between Two Objects
NASA Technical Reports Server (NTRS)
Hammen, David
2009-01-01
A method of quickly approximating the distance between two objects (one smaller, regarded as a point; the other larger and complexly shaped) has been devised for use in computationally simulating motions of the objects for the purpose of planning the motions to prevent collisions.
Approximate Solution to the Generalized Boussinesq Equation
NASA Astrophysics Data System (ADS)
Telyakovskiy, A. S.; Mortensen, J.
2010-12-01
The traditional Boussinesq equation describes motion of water in groundwater flows. It models unconfined groundwater flow under the Dupuit assumption that the equipotential lines are vertical, making the flowlines horizontal. The Boussinesq equation is a nonlinear diffusion equation with diffusivity depending linearly on water head. Here we analyze a generalization of the Boussinesq equation, when the diffusivity is a power law function of water head. For example polytropic gases moving through porous media obey this equation. Solving this equation usually requires numerical approximations, but for certain classes of initial and boundary conditions an approximate analytical solution can be constructed. This work focuses on the latter approach, using the scaling properties of the equation. We consider one-dimensional semi-infinite initially empty aquifer with boundary conditions at the inlet in case of cylindrical symmetry. Such situation represents the case of an injection well. Solutions would propagate with the finite speed. We construct an approximate scaling function, and we compare the approximate solution with the direct numerical solutions obtained by using the scaling properties of the equations.
Semiclassical Approximations and Predictability in Ocean Acoustics
1999-09-30
the ONR-funded work being performed by P. Worcester (SIO), J. Colosi (WHOI), M. Wolfson (WSU), J. Spiesberger (UPenn), S. 2 Tomsovic (WSU), G...Acoust. Soc. Am. 103, 2232-2235. Tappert, F. D., Spiesberger , J. L., and L. Boden (1995) New full-wave approximation for ocean acoustic travel time
Approximated integrability of the Dicke model
NASA Astrophysics Data System (ADS)
Relaño, A.; Bastarrachea-Magnani, M. A.; Lerma-Hernández, S.
2016-12-01
A very approximate second integral of motion of the Dicke model is identified within a broad energy region above the ground state, and for a wide range of values of the external parameters. This second integral, obtained from a Born-Oppenheimer approximation, classifies the whole regular part of the spectrum in bands, coming from different semi-classical energy surfaces, and labelled by its corresponding eigenvalues. Results obtained from this approximation are compared with exact numerical diagonalization for finite systems in the superradiant phase, obtaining a remarkable accord. The region of validity of our approach in the parameter space, which includes the resonant case, is unveiled. The energy range of validity goes from the ground state up to a certain upper energy where chaos sets in, and extends far beyond the range of applicability of a simple harmonic approximation around the minimal energy configuration. The upper energy validity limit increases for larger values of the coupling constant and the ratio between the level splitting and the frequency of the field. These results show that the Dicke model behaves like a two-degree-of-freedom integrable model for a wide range of energies and values of the external parameters.
Can Distributional Approximations Give Exact Answers?
ERIC Educational Resources Information Center
Griffiths, Martin
2013-01-01
Some mathematical activities and investigations for the classroom or the lecture theatre can appear rather contrived. This cannot, however, be levelled at the idea given here, since it is based on a perfectly sensible question concerning distributional approximations that was posed by an undergraduate student. Out of this simple question, and…
Local discontinuous Galerkin approximations to Richards’ equation
NASA Astrophysics Data System (ADS)
Li, H.; Farthing, M. W.; Dawson, C. N.; Miller, C. T.
2007-03-01
We consider the numerical approximation to Richards' equation because of its hydrological significance and intrinsic merit as a nonlinear parabolic model that admits sharp fronts in space and time that pose a special challenge to conventional numerical methods. We combine a robust and established variable order, variable step-size backward difference method for time integration with an evolving spatial discretization approach based upon the local discontinuous Galerkin (LDG) method. We formulate the approximation using a method of lines approach to uncouple the time integration from the spatial discretization. The spatial discretization is formulated as a set of four differential algebraic equations, which includes a mass conservation constraint. We demonstrate how this system of equations can be reduced to the solution of a single coupled unknown in space and time and a series of local constraint equations. We examine a variety of approximations at discontinuous element boundaries, permeability approximations, and numerical quadrature schemes. We demonstrate an optimal rate of convergence for smooth problems, and compare accuracy and efficiency for a wide variety of approaches applied to a set of common test problems. We obtain robust and efficient results that improve upon existing methods, and we recommend a future path that should yield significant additional improvements.
Approximating a nonlinear MTFDE from physiology
NASA Astrophysics Data System (ADS)
Teodoro, M. Filomena
2016-12-01
This paper describes a numerical scheme which approximates the solution of a nonlinear mixed type functional differential equation from nerve conduction theory. The solution of such equation is defined in all the entire real axis and tends to known values at ±∞. A numerical method extended from linear case is developed and applied to solve a nonlinear equation.
Large Hierarchies from Approximate R Symmetries
Kappl, Rolf; Ratz, Michael; Schmidt-Hoberg, Kai; Nilles, Hans Peter; Ramos-Sanchez, Saul; Vaudrevange, Patrick K. S.
2009-03-27
We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales.
Block Addressing Indices for Approximate Text Retrieval.
ERIC Educational Resources Information Center
Baeza-Yates, Ricardo; Navarro, Gonzalo
2000-01-01
Discusses indexing in large text databases, approximate text searching, and space-time tradeoffs for indexed text searching. Studies the space overhead and retrieval times as functions of the text block size, concludes that an index can be sublinear in space overhead and query time, and applies the analysis to the Web. (Author/LRW)
Approximating Confidence Intervals for Factor Loadings.
ERIC Educational Resources Information Center
Lambert, Zarrel V.; And Others
1991-01-01
A method is presented that eliminates some interpretational limitations arising from assumptions implicit in the use of arbitrary rules of thumb to interpret exploratory factor analytic results. The bootstrap method is presented as a way of approximating sampling distributions of estimated factor loadings. Simulated datasets illustrate the…
Curved Finite Elements and Curve Approximation
NASA Technical Reports Server (NTRS)
Baart, M. L.
1985-01-01
The approximation of parameterized curves by segments of parabolas that pass through the endpoints of each curve segment arises naturally in all quadratic isoparametric transformations. While not as popular as cubics in curve design problems, the use of parabolas allows the introduction of a geometric measure of the discrepancy between given and approximating curves. The free parameters of the parabola may be used to optimize the fit, and constraints that prevent overspill and curve degeneracy are introduced. This leads to a constrained optimization problem in two varibles that can be solved quickly and reliably by a simple method that takes advantage of the special structure of the problem. For applications in the field of computer-aided design, the given curves are often cubic polynomials, and the coefficient may be calculated in closed form in terms of polynomial coefficients by using a symbolic machine language so that families of curves can be approximated with no further integration. For general curves, numerical quadrature may be used, as in the implementation where the Romberg quadrature is applied. The coefficient functions C sub 1 (gamma) and C sub 2 (gamma) are expanded as polynomials in gamma, so that for given A(s) and B(s) the integrations need only be done once. The method was used to find optimal constrained parabolic approximation to a wide variety of given curves.
Fostering Formal Commutativity Knowledge with Approximate Arithmetic.
Hansen, Sonja Maria; Haider, Hilde; Eichler, Alexandra; Godau, Claudia; Frensch, Peter A; Gaschler, Robert
2015-01-01
How can we enhance the understanding of abstract mathematical principles in elementary school? Different studies found out that nonsymbolic estimation could foster subsequent exact number processing and simple arithmetic. Taking the commutativity principle as a test case, we investigated if the approximate calculation of symbolic commutative quantities can also alter the access to procedural and conceptual knowledge of a more abstract arithmetic principle. Experiment 1 tested first graders who had not been instructed about commutativity in school yet. Approximate calculation with symbolic quantities positively influenced the use of commutativity-based shortcuts in formal arithmetic. We replicated this finding with older first graders (Experiment 2) and third graders (Experiment 3). Despite the positive effect of approximation on the spontaneous application of commutativity-based shortcuts in arithmetic problems, we found no comparable impact on the application of conceptual knowledge of the commutativity principle. Overall, our results show that the usage of a specific arithmetic principle can benefit from approximation. However, the findings also suggest that the correct use of certain procedures does not always imply conceptual understanding. Rather, the conceptual understanding of commutativity seems to lag behind procedural proficiency during elementary school.
Inhomogeneous random phase approximation: A solvable model
Lemm, J.C.
1995-11-15
A recently developed method to include particle-hole correlations into the time-independent mean field theory for scattering (TIMF) by an inhomogeneous random phase approximation (IRPA) is applied to a numerically solvable model. Having adapted the procedure according to numerical requirements, IRPA calculations turn out to be tractable. The obtained results improve TIMF results. 8 refs., 28 figs., 3 tabs.
Block Addressing Indices for Approximate Text Retrieval.
ERIC Educational Resources Information Center
Baeza-Yates, Ricardo; Navarro, Gonzalo
2000-01-01
Discusses indexing in large text databases, approximate text searching, and space-time tradeoffs for indexed text searching. Studies the space overhead and retrieval times as functions of the text block size, concludes that an index can be sublinear in space overhead and query time, and applies the analysis to the Web. (Author/LRW)
Sensing Position With Approximately Constant Contact Force
NASA Technical Reports Server (NTRS)
Sturdevant, Jay
1996-01-01
Computer-controlled electromechanical system uses number of linear variable-differential transformers (LVDTs) to measure axial positions of selected points on surface of lens, mirror, or other precise optical component with high finish. Pressures applied to pneumatically driven LVDTs adjusted to maintain small, approximately constant contact forces as positions of LVDT tips vary.
Padé approximations and diophantine geometry
Chudnovsky, D. V.; Chudnovsky, G. V.
1985-01-01
Using methods of Padé approximations we prove a converse to Eisenstein's theorem on the boundedness of denominators of coefficients in the expansion of an algebraic function, for classes of functions, parametrized by meromorphic functions. This result is applied to the Tate conjecture on the effective description of isogenies for elliptic curves. PMID:16593552
Can Distributional Approximations Give Exact Answers?
ERIC Educational Resources Information Center
Griffiths, Martin
2013-01-01
Some mathematical activities and investigations for the classroom or the lecture theatre can appear rather contrived. This cannot, however, be levelled at the idea given here, since it is based on a perfectly sensible question concerning distributional approximations that was posed by an undergraduate student. Out of this simple question, and…
Approximate model for laser ablation of carbon
NASA Astrophysics Data System (ADS)
Shusser, Michael
2010-08-01
The paper presents an approximate kinetic theory model of ablation of carbon by a nanosecond laser pulse. The model approximates the process as sublimation and combines conduction heat transfer in the target with the gas dynamics of the ablated plume which are coupled through the boundary conditions at the interface. The ablated mass flux and the temperature of the ablating material are obtained from the assumption that the ablation rate is restricted by the kinetic theory limitation on the maximum mass flux that can be attained in a phase-change process. To account for non-uniform distribution of the laser intensity while keeping the calculation simple the quasi-one-dimensional approximation is used in both gas and solid phases. The results are compared with the predictions of the exact axisymmetric model that uses the conservation relations at the interface derived from the momentum solution of the Boltzmann equation for arbitrary strong evaporation. It is seen that the simpler approximate model provides good accuracy.
Kravchuk functions for the finite oscillator approximation
NASA Technical Reports Server (NTRS)
Atakishiyev, Natig M.; Wolf, Kurt Bernardo
1995-01-01
Kravchuk orthogonal functions - Kravchuk polynomials multiplied by the square root of the weight function - simplify the inversion algorithm for the analysis of discrete, finite signals in harmonic oscillator components. They can be regarded as the best approximation set. As the number of sampling points increases, the Kravchuk expansion becomes the standard oscillator expansion.
Variance approximations for assessments of classification accuracy
R. L. Czaplewski
1994-01-01
Variance approximations are derived for the weighted and unweighted kappa statistics, the conditional kappa statistic, and conditional probabilities. These statistics are useful to assess classification accuracy, such as accuracy of remotely sensed classifications in thematic maps when compared to a sample of reference classifications made in the field. Published...
Multidimensional stochastic approximation using locally contractive functions
NASA Technical Reports Server (NTRS)
Lawton, W. M.
1975-01-01
A Robbins-Monro type multidimensional stochastic approximation algorithm which converges in mean square and with probability one to the fixed point of a locally contractive regression function is developed. The algorithm is applied to obtain maximum likelihood estimates of the parameters for a mixture of multivariate normal distributions.
Fostering Formal Commutativity Knowledge with Approximate Arithmetic
Hansen, Sonja Maria; Haider, Hilde; Eichler, Alexandra; Godau, Claudia; Frensch, Peter A.; Gaschler, Robert
2015-01-01
How can we enhance the understanding of abstract mathematical principles in elementary school? Different studies found out that nonsymbolic estimation could foster subsequent exact number processing and simple arithmetic. Taking the commutativity principle as a test case, we investigated if the approximate calculation of symbolic commutative quantities can also alter the access to procedural and conceptual knowledge of a more abstract arithmetic principle. Experiment 1 tested first graders who had not been instructed about commutativity in school yet. Approximate calculation with symbolic quantities positively influenced the use of commutativity-based shortcuts in formal arithmetic. We replicated this finding with older first graders (Experiment 2) and third graders (Experiment 3). Despite the positive effect of approximation on the spontaneous application of commutativity-based shortcuts in arithmetic problems, we found no comparable impact on the application of conceptual knowledge of the commutativity principle. Overall, our results show that the usage of a specific arithmetic principle can benefit from approximation. However, the findings also suggest that the correct use of certain procedures does not always imply conceptual understanding. Rather, the conceptual understanding of commutativity seems to lag behind procedural proficiency during elementary school. PMID:26560311
Approximation algorithms for planning and control
NASA Technical Reports Server (NTRS)
Boddy, Mark; Dean, Thomas
1989-01-01
A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.
Approximating the efficiency characteristics of blade pumps
NASA Astrophysics Data System (ADS)
Shekun, G. D.
2007-11-01
Results from a statistical investigation into the experimental efficiency characteristics of commercial type SD centrifugal pumps and type SDS swirl flow pumps are presented. An exponential function for approximating the efficiency characteristics of blade pumps is given. The versatile nature of this characteristic is confirmed by the fact that the use of different systems of relative units gives identical results.
Counting independent sets using the Bethe approximation
Chertkov, Michael; Chandrasekaran, V; Gamarmik, D; Shah, D; Sin, J
2009-01-01
The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.
Finite difference methods for approximating Heaviside functions
NASA Astrophysics Data System (ADS)
Towers, John D.
2009-05-01
We present a finite difference method for discretizing a Heaviside function H(u(x→)), where u is a level set function u:Rn ↦ R that is positive on a bounded region Ω⊂Rn. There are two variants of our algorithm, both of which are adapted from finite difference methods that we proposed for discretizing delta functions in [J.D. Towers, Two methods for discretizing a delta function supported on a level set, J. Comput. Phys. 220 (2007) 915-931; J.D. Towers, Discretizing delta functions via finite differences and gradient normalization, Preprint at http://www.miracosta.edu/home/jtowers/; J.D. Towers, A convergence rate theorem for finite difference approximations to delta functions, J. Comput. Phys. 227 (2008) 6591-6597]. We consider our approximate Heaviside functions as they are used to approximate integrals over Ω. We prove that our first approximate Heaviside function leads to second order accurate quadrature algorithms. Numerical experiments verify this second order accuracy. For our second algorithm, numerical experiments indicate at least third order accuracy if the integrand f and ∂Ω are sufficiently smooth. Numerical experiments also indicate that our approximations are effective when used to discretize certain singular source terms in partial differential equations. We mostly focus on smooth f and u. By this we mean that f is smooth in a neighborhood of Ω, u is smooth in a neighborhood of ∂Ω, and the level set u(x)=0 is a manifold of codimension one. However, our algorithms still give reasonable results if either f or u has jumps in its derivatives. Numerical experiments indicate approximately second order accuracy for both algorithms if the regularity of the data is reduced in this way, assuming that the level set u(x)=0 is a manifold. Numerical experiments indicate that dependence on the placement of Ω with respect to the grid is quite small for our algorithms. Specifically, a grid shift results in an O(hp) change in the computed solution
Approximation techniques of a selective ARQ protocol
NASA Astrophysics Data System (ADS)
Kim, B. G.
Approximations to the performance of selective automatic repeat request (ARQ) protocol with lengthy acknowledgement delays are presented. The discussion is limited to packet-switched communication systems in a single-hop environment such as found with satellite systems. It is noted that retransmission of errors after ARQ is a common situation. ARQ techniques, e.g., stop-and-wait and continuous, are outlined. A simplified queueing analysis of the selective ARQ protocol shows that exact solutions with long delays are not feasible. Two approximation models are formulated, based on known exact behavior of a system with short delays. The buffer size requirements at both ends of a communication channel are cited as significant factor for accurate analysis, and further examinations of buffer overflow and buffer lock-out probability and avoidance are recommended.
Approximate inverse preconditioners for general sparse matrices
Chow, E.; Saad, Y.
1994-12-31
Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.
Multiwavelet neural network and its approximation properties.
Jiao, L; Pan, J; Fang, Y
2001-01-01
A model of multiwavelet-based neural networks is proposed. Its universal and L(2) approximation properties, together with its consistency are proved, and the convergence rates associated with these properties are estimated. The structure of this network is similar to that of the wavelet network, except that the orthonormal scaling functions are replaced by orthonormal multiscaling functions. The theoretical analyses show that the multiwavelet network converges more rapidly than the wavelet network, especially for smooth functions. To make a comparison between both networks, experiments are carried out with the Lemarie-Meyer wavelet network, the Daubechies2 wavelet network and the GHM multiwavelet network, and the results support the theoretical analysis well. In addition, the results also illustrate that at the jump discontinuities, the approximation performance of the two networks are about the same.
Approximate gauge symmetry of composite vector bosons
NASA Astrophysics Data System (ADS)
Suzuki, Mahiko
2010-08-01
It can be shown in a solvable field theory model that the couplings of the composite vector bosons made of a fermion pair approach the gauge couplings in the limit of strong binding. Although this phenomenon may appear accidental and special to the vector bosons made of a fermion pair, we extend it to the case of bosons being constituents and find that the same phenomenon occurs in a more intriguing way. The functional formalism not only facilitates computation but also provides us with a better insight into the generating mechanism of approximate gauge symmetry, in particular, how the strong binding and global current conservation conspire to generate such an approximate symmetry. Remarks are made on its possible relevance or irrelevance to electroweak and higher symmetries.
Approximated solutions to Born-Infeld dynamics
NASA Astrophysics Data System (ADS)
Ferraro, Rafael; Nigro, Mauro
2016-02-01
The Born-Infeld equation in the plane is usefully captured in complex language. The general exact solution can be written as a combination of holomorphic and anti-holomorphic functions. However, this solution only expresses the potential in an implicit way. We rework the formulation to obtain the complex potential in an explicit way, by means of a perturbative procedure. We take care of the secular behavior common to this kind of approach, by resorting to a symmetry the equation has at the considered order of approximation. We apply the method to build approximated solutions to Born-Infeld electrodynamics. We solve for BI electromagnetic waves traveling in opposite directions. We study the propagation at interfaces, with the aim of searching for effects susceptible to experimental detection. In particular, we show that a reflected wave is produced when a wave is incident on a semi-space containing a magnetostatic field.
Flow past a porous approximate spherical shell
NASA Astrophysics Data System (ADS)
Srinivasacharya, D.
2007-07-01
In this paper, the creeping flow of an incompressible viscous liquid past a porous approximate spherical shell is considered. The flow in the free fluid region outside the shell and in the cavity region of the shell is governed by the Navier Stokes equation. The flow within the porous annulus region of the shell is governed by Darcy’s Law. The boundary conditions used at the interface are continuity of the normal velocity, continuity of the pressure and Beavers and Joseph slip condition. An exact solution for the problem is obtained. An expression for the drag on the porous approximate spherical shell is obtained. The drag experienced by the shell is evaluated numerically for several values of the parameters governing the flow.
A Varifold Approach to Surface Approximation
NASA Astrophysics Data System (ADS)
Buet, Blanche; Leonardi, Gian Paolo; Masnou, Simon
2017-06-01
We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the notion of approximate mean curvature and show various convergence results that hold, in particular, for sequences of discrete varifolds associated with point clouds or pixel/voxel-type discretizations of d-surfaces in the Euclidean n-space, without restrictions on dimension and codimension. The variational nature of the approach also allows us to consider surfaces with singularities, and in that case the approximate mean curvature is consistent with the generalized mean curvature of the limit surface. A series of numerical tests are provided in order to illustrate the effectiveness and generality of the method.
Planetary ephemerides approximation for radar astronomy
NASA Technical Reports Server (NTRS)
Sadr, R.; Shahshahani, M.
1991-01-01
The planetary ephemerides approximation for radar astronomy is discussed, and, in particular, the effect of this approximation on the performance of the programmable local oscillator (PLO) used in Goldstone Solar System Radar is presented. Four different approaches are considered and it is shown that the Gram polynomials outperform the commonly used technique based on Chebyshev polynomials. These methods are used to analyze the mean square, the phase error, and the frequency tracking error in the presence of the worst case Doppler shift that one may encounter within the solar system. It is shown that in the worst case the phase error is under one degree and the frequency tracking error less than one hertz when the frequency to the PLO is updated every millisecond.
Smooth polynomial approximation of spiral arcs
NASA Astrophysics Data System (ADS)
Cripps, R. J.; Hussain, M. Z.; Zhu, S.
2010-03-01
Constructing fair curve segments using parametric polynomials is difficult due to the oscillatory nature of polynomials. Even NURBS curves can exhibit unsatisfactory curvature profiles. Curve segments with monotonic curvature profiles, for example spiral arcs, exist but are intrinsically non-polynomial in nature and thus difficult to integrate into existing CAD systems. A method of constructing an approximation to a generalised Cornu spiral (GCS) arc using non-rational quintic Bézier curves matching end points, end slopes and end curvatures is presented. By defining an objective function based on the relative error between the curvature profiles of the GCS and its Bézier approximation, a curve segment is constructed that has a monotonic curvature profile within a specified tolerance.
Flexible least squares for approximately linear systems
NASA Astrophysics Data System (ADS)
Kalaba, Robert; Tesfatsion, Leigh
1990-10-01
A probability-free multicriteria approach is presented to the problem of filtering and smoothing when prior beliefs concerning dynamics and measurements take an approximately linear form. Consideration is given to applications in the social and biological sciences, where obtaining agreement among researchers regarding probability relations for discrepancy terms is difficult. The essence of the proposed flexible-least-squares (FLS) procedure is the cost-efficient frontier, a curve in a two-dimensional cost plane which provides an explicit and systematic way to determine the efficient trade-offs between the separate costs incurred for dynamic and measurement specification errors. The FLS estimates show how the state vector could have evolved over time in a manner minimally incompatible with the prior dynamic and measurement specifications. A FORTRAN program for implementing the FLS filtering and smoothing procedure for approximately linear systems is provided.
Quantum fluctuations beyond the Gutzwiller approximation
NASA Astrophysics Data System (ADS)
Fabrizio, Michele
2017-02-01
We present a simple scheme to evaluate linear response functions including quantum fluctuation corrections on top of the Gutzwiller approximation. The method is derived for a generic multiband lattice Hamiltonian without any assumption about the dynamics of the variational correlation parameters that define the Gutzwiller wave function, and which thus behave as genuine dynamical degrees of freedom that add on those of the variational uncorrelated Slater determinant. We apply the method to the standard half-filled single-band Hubbard model. We are able to recover known results, but, as a by-product, we also obtain a few other results. In particular, we show that quantum fluctuations can reproduce, almost quantitatively, the behavior of the uniform magnetic susceptibility uncovered by dynamical mean-field theory, which, though enhanced by correlations, is found to be smooth across the paramagnetic Mott transition. By contrast, the simple Gutzwiller approximation predicts that susceptibility to diverge at the transition.
JIMWLK evolution in the Gaussian approximation
NASA Astrophysics Data System (ADS)
Iancu, E.; Triantafyllopoulos, D. N.
2012-04-01
We demonstrate that the Balitsky-JIMWLK equations describing the high-energy evolution of the n-point functions of the Wilson lines (the QCD scattering amplitudes in the eikonal approximation) admit a controlled mean field approximation of the Gaussian type, for any value of the number of colors N c . This approximation is strictly correct in the weak scattering regime at relatively large transverse momenta, where it re-produces the BFKL dynamics, and in the strong scattering regime deeply at saturation, where it properly describes the evolution of the scattering amplitudes towards the respective black disk limits. The approximation scheme is fully specified by giving the 2-point function (the S-matrix for a color dipole), which in turn can be related to the solution to the Balitsky-Kovchegov equation, including at finite N c . Any higher n-point function with n ≥ 4 can be computed in terms of the dipole S-matrix by solving a closed system of evolution equations (a simplified version of the respective Balitsky-JIMWLK equations) which are local in the transverse coordinates. For simple configurations of the projectile in the transverse plane, our new results for the 4-point and the 6-point functions coincide with the high-energy extrapolations of the respective results in the McLerran-Venugopalan model. One cornerstone of our construction is a symmetry property of the JIMWLK evolution, that we notice here for the first time: the fact that, with increasing energy, a hadron is expanding its longitudinal support symmetrically around the light-cone. This corresponds to invariance under time reversal for the scattering amplitudes.
Barycentric approximation in financial decision making
Frauendorfer, K.
1994-12-31
We consider dynamic portfolio selection problems which are exposed to interest rate risk and credit risk caused by stochastic cash-flows and interest rates. For maximizing the expected net present value, we apply the barycentric approximation scheme of stochastic programming and discuss its features to be utilized in financial decision making. In particular, we focus on the martingale property, the term structure of interest rates, cash-flow dynamics, and correlations of the later two.
Beyond the Kirchhoff approximation. II - Electromagnetic scattering
NASA Technical Reports Server (NTRS)
Rodriguez, Ernesto
1991-01-01
In a paper by Rodriguez (1981), the momentum transfer expansion was introduced for scalar wave scattering. It was shown that this expansion can be used to obtain wavelength-dependent curvature corrections to the Kirchhoff approximation. This paper extends the momentum transfer perturbation expansion to electromagnetic waves. Curvature corrections to the surface current are obtained. Using these results, the specular field and the backscatter cross section are calculated.
Solving Math Problems Approximately: A Developmental Perspective
Ganor-Stern, Dana
2016-01-01
Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults’ ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger) than the exact answer and when it was far (vs. close) from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner. PMID:27171224
Stochastic approximation boosting for incomplete data problems.
Sexton, Joseph; Laake, Petter
2009-12-01
Boosting is a powerful approach to fitting regression models. This article describes a boosting algorithm for likelihood-based estimation with incomplete data. The algorithm combines boosting with a variant of stochastic approximation that uses Markov chain Monte Carlo to deal with the missing data. Applications to fitting generalized linear and additive models with missing covariates are given. The method is applied to the Pima Indians Diabetes Data where over half of the cases contain missing values.
Nonlinear amplitude approximation for bilinear systems
NASA Astrophysics Data System (ADS)
Jung, Chulwoo; D'Souza, Kiran; Epureanu, Bogdan I.
2014-06-01
An efficient method to predict vibration amplitudes at the resonant frequencies of dynamical systems with piecewise-linear nonlinearity is developed. This technique is referred to as bilinear amplitude approximation (BAA). BAA constructs a single vibration cycle at each resonant frequency to approximate the periodic steady-state response of the system. It is postulated that the steady-state response is piece-wise linear and can be approximated by analyzing the response over two time intervals during which the system behaves linearly. Overall the dynamics is nonlinear, but the system is in a distinct linear state during each of the two time intervals. Thus, the approximated vibration cycle is constructed using linear analyses. The equation of motion for analyzing the vibration of each state is projected along the overlapping space spanned by the linear mode shapes active in each of the states. This overlapping space is where the vibratory energy is transferred from one state to the other when the system switches from one state to the other. The overlapping space can be obtained using singular value decomposition. The space where the energy is transferred is used together with transition conditions of displacement and velocity compatibility to construct a single vibration cycle and to compute the amplitude of the dynamics. Since the BAA method does not require numerical integration of nonlinear models, computational costs are very low. In this paper, the BAA method is first applied to a single-degree-of-freedom system. Then, a three-degree-of-freedom system is introduced to demonstrate a more general application of BAA. Finally, the BAA method is applied to a full bladed disk with a crack. Results comparing numerical solutions from full-order nonlinear analysis and results obtained using BAA are presented for all systems.
Development of New Density Functional Approximations
NASA Astrophysics Data System (ADS)
Su, Neil Qiang; Xu, Xin
2017-05-01
Kohn-Sham density functional theory has become the leading electronic structure method for atoms, molecules, and extended systems. It is in principle exact, but any practical application must rely on density functional approximations (DFAs) for the exchange-correlation energy. Here we emphasize four aspects of the subject: (a) philosophies and strategies for developing DFAs; (b) classification of DFAs; (c) major sources of error in existing DFAs; and (d) some recent developments and future directions.
Oscillation of boson star in Newtonian approximation
NASA Astrophysics Data System (ADS)
Jarwal, Bharti; Singh, S. Somorendro
2017-03-01
Boson star (BS) rotation is studied under Newtonian approximation. A Coulombian potential term is added as perturbation to the radial potential of the system without disturbing the angular momentum. The results of the stationary states of these ground state, first and second excited state are analyzed with the correction of Coulombian potential. It is found that the results with correction increased in the amplitude of oscillation of BS in comparison to potential without perturbation correction.
Approximation methods for stochastic petri nets
NASA Technical Reports Server (NTRS)
Jungnitz, Hauke Joerg
1992-01-01
Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay
Solving Math Problems Approximately: A Developmental Perspective.
Ganor-Stern, Dana
2016-01-01
Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults' ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger) than the exact answer and when it was far (vs. close) from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner.
Empirical progress and nomic truth approximation revisited.
Kuipers, Theo A F
2014-06-01
In my From Instrumentalism to Constructive Realism (2000) I have shown how an instrumentalist account of empirical progress can be related to nomic truth approximation. However, it was assumed that a strong notion of nomic theories was needed for that analysis. In this paper it is shown, in terms of truth and falsity content, that the analysis already applies when, in line with scientific common sense, nomic theories are merely assumed to exclude certain conceptual possibilities as nomic possibilities.
Numerical quadratures for approximate computation of ERBS
NASA Astrophysics Data System (ADS)
Zanaty, Peter
2013-12-01
In the ground-laying paper [3] on expo-rational B-splines (ERBS), the default numerical method for approximate computation of the integral with C∞-smooth integrand in the definition of ERBS is Romberg integration. In the present work, a variety of alternative numerical quadrature methods for computation of ERBS and other integrals with smooth integrands are studied, and their performance is compared on several benchmark examples.
Numerical Approximation to the Thermodynamic Integrals
NASA Astrophysics Data System (ADS)
Johns, S. M.; Ellis, P. J.; Lattimer, J. M.
1996-12-01
We approximate boson thermodynamic integrals as polynomials in two variables chosen to give the correct limiting expansion and to smoothly interpolate into other regimes. With 10 free parameters, an accuracy of better than 0.009% is achieved for the pressure, internal energy density, and number density. We also revisit the fermion case, originally addressed by Eggleton, Faulkner, & Flannery (1973), and substantially improve the accuracy of their fits.
Coherent population transfer beyond rotating wave approximation
NASA Astrophysics Data System (ADS)
Rhee, Yongjoo; Kwon, Duck-Hee; Han, Jaemin; Park, Hyunmin; Kim, Sunkook
2002-05-01
The mechanism of coherent population transfer in a three-level system of lamda type interacting with strong and ultra-short laser pulses is investigated beyond the rotating wave approximation (RWA). The characteristics of population transfer arising from the consideration without RWA are numerically shown and interpreted in the point of view of dressed states both for the typical Stimulated Raman Adiabatic Passage(STIRAP) and for Optimal Detuning Method(ODM) which uses large wavelength-detuned lasers without time delay.
Three Definitions of Best Linear Approximation
1976-04-01
Three definitions of best (in the least squares sense) linear approximation to given data points are presented. The relationships between these three area discussed along with their relationship to basic statistics such as mean values, the covariance matrix, and the (linear) correlation coefficient . For each of the three definitions, and best line is solved in closed form in terms of the data centroid and the covariance matrix.
Approximate active fault detection and control
NASA Astrophysics Data System (ADS)
Škach, Jan; Punčochář, Ivo; Šimandl, Miroslav
2014-12-01
This paper deals with approximate active fault detection and control for nonlinear discrete-time stochastic systems over an infinite time horizon. Multiple model framework is used to represent fault-free and finitely many faulty models. An imperfect state information problem is reformulated using a hyper-state and dynamic programming is applied to solve the problem numerically. The proposed active fault detector and controller is illustrated in a numerical example of an air handling unit.
Microscopic justification of the equal filling approximation
Perez-Martin, Sara; Robledo, L. M.
2008-07-15
The equal filling approximation, a procedure widely used in mean-field calculations to treat the dynamics of odd nuclei in a time-reversal invariant way, is justified as the consequence of a variational principle over an average energy functional. The ideas of statistical quantum mechanics are employed in the justification. As an illustration of the method, the ground and lowest-lying states of some octupole deformed radium isotopes are computed.
Variational Bayesian Approximation methods for inverse problems
NASA Astrophysics Data System (ADS)
Mohammad-Djafari, Ali
2012-09-01
Variational Bayesian Approximation (VBA) methods are recent tools for effective Bayesian computations. In this paper, these tools are used for inverse problems where the prior models include hidden variables and where where the estimation of the hyper parameters has also to be addressed. In particular two specific prior models (Student-t and mixture of Gaussian models) are considered and details of the algorithms are given.
Capacitor-Chain Successive-Approximation ADC
NASA Technical Reports Server (NTRS)
Cunningham, Thomas
2003-01-01
A proposed successive-approximation analog-to-digital converter (ADC) would contain a capacitively terminated chain of identical capacitor cells. Like a conventional successive-approximation ADC containing a bank of binary-scaled capacitors, the proposed ADC would store an input voltage on a sample-and-hold capacitor and would digitize the stored input voltage by finding the closest match between this voltage and a capacitively generated sum of binary fractions of a reference voltage (Vref). However, the proposed capacitor-chain ADC would offer two major advantages over a conventional binary-scaled-capacitor ADC: (1) In a conventional ADC that digitizes to n bits, the largest capacitor (representing the most significant bit) must have 2(exp n-1) times as much capacitance, and hence, approximately 2(exp n-1) times as much area as does the smallest capacitor (representing the least significant bit), so that the total capacitor area must be 2(exp n) times that of the smallest capacitor. In the proposed capacitor-chain ADC, there would be three capacitors per cell, each approximately equal to the smallest capacitor in the conventional ADC, and there would be one cell per bit. Therefore, the total capacitor area would be only about 3(exp n) times that of the smallest capacitor. The net result would be that the proposed ADC could be considerably smaller than the conventional ADC. (2) Because of edge effects, parasitic capacitances, and manufacturing tolerances, it is difficult to make capacitor banks in which the values of capacitance are scaled by powers of 2 to the required precision. In contrast, because all the capacitors in the proposed ADC would be identical, the problem of precise binary scaling would not arise.
Parameter Biases Introduced by Approximate Gravitational Waveforms
NASA Astrophysics Data System (ADS)
Farr, Benjamin; Coughlin, Scott; Le, John; Skeehan, Connor; Kalogera, Vicky
2013-04-01
The production of the most accurate gravitational waveforms from compact binary mergers require Einstein's equations to be solved numerically, a process far too expensive to produce the ˜10^7 waveforms necessary to estimate the parameters of a measured gravitational wave signal. Instead, parameter estimation depends on approximate or phenomenological waveforms to characterize measured signals. As part of the Ninja collaboration, we study the biases introduced by these methods when estimating the parameters of numerically produced waveforms.
Green-Ampt approximations: A comprehensive analysis
NASA Astrophysics Data System (ADS)
Ali, Shakir; Islam, Adlul; Mishra, P. K.; Sikka, Alok K.
2016-04-01
Green-Ampt (GA) model and its modifications are widely used for simulating infiltration process. Several explicit approximate solutions to the implicit GA model have been developed with varying degree of accuracy. In this study, performance of nine explicit approximations to the GA model is compared with the implicit GA model using the published data for broad range of soil classes and infiltration time. The explicit GA models considered are Li et al. (1976) (LI), Stone et al. (1994) (ST), Salvucci and Entekhabi (1994) (SE), Parlange et al. (2002) (PA), Barry et al. (2005) (BA), Swamee et al. (2012) (SW), Ali et al. (2013) (AL), Almedeij and Esen (2014) (AE), and Vatankhah (2015) (VA). Six statistical indicators (e.g., percent relative error, maximum absolute percent relative error, average absolute percent relative errors, percent bias, index of agreement, and Nash-Sutcliffe efficiency) and relative computer computation time are used for assessing the model performance. Models are ranked based on the overall performance index (OPI). The BA model is found to be the most accurate followed by the PA and VA models for variety of soil classes and infiltration periods. The AE, SW, SE, and LI model also performed comparatively better. Based on the overall performance index, the explicit models are ranked as BA > PA > VA > LI > AE > SE > SW > ST > AL. Results of this study will be helpful in selection of accurate and simple explicit approximate GA models for solving variety of hydrological problems.
CMB-lensing beyond the Born approximation
NASA Astrophysics Data System (ADS)
Marozzi, Giovanni; Fanizza, Giuseppe; Di Dio, Enea; Durrer, Ruth
2016-09-01
We investigate the weak lensing corrections to the cosmic microwave background temperature anisotropies considering effects beyond the Born approximation. To this aim, we use the small deflection angle approximation, to connect the lensed and unlensed power spectra, via expressions for the deflection angles up to third order in the gravitational potential. While the small deflection angle approximation has the drawback to be reliable only for multipoles l lesssim 2500, it allows us to consistently take into account the non-Gaussian nature of cosmological perturbation theory beyond the linear level. The contribution to the lensed temperature power spectrum coming from the non-Gaussian nature of the deflection angle at higher order is a new effect which has not been taken into account in the literature so far. It turns out to be the leading contribution among the post-Born lensing corrections. On the other hand, the effect is smaller than corrections coming from non-linearities in the matter power spectrum, and its imprint on CMB lensing is too small to be seen in present experiments.
A coastal ocean model with subgrid approximation
NASA Astrophysics Data System (ADS)
Walters, Roy A.
2016-06-01
A wide variety of coastal ocean models exist, each having attributes that reflect specific application areas. The model presented here is based on finite element methods with unstructured grids containing triangular and quadrilateral elements. The model optimizes robustness, accuracy, and efficiency by using semi-implicit methods in time in order to remove the most restrictive stability constraints, by using a semi-Lagrangian advection approximation to remove Courant number constraints, and by solving a wave equation at the discrete level for enhanced efficiency. An added feature is the approximation of the effects of subgrid objects. Here, the Reynolds-averaged Navier-Stokes equations and the incompressibility constraint are volume averaged over one or more computational cells. This procedure gives rise to new terms which must be approximated as a closure problem. A study of tidal power generation is presented as an example of this method. A problem that arises is specifying appropriate thrust and power coefficients for the volume averaged velocity when they are usually referenced to free stream velocity. A new contribution here is the evaluation of three approaches to this problem: an iteration procedure and two mapping formulations. All three sets of results for thrust (form drag) and power are in reasonable agreement.
Approximation abilities of neuro-fuzzy networks
NASA Astrophysics Data System (ADS)
Mrówczyńska, Maria
2010-01-01
The paper presents the operation of two neuro-fuzzy systems of an adaptive type, intended for solving problems of the approximation of multi-variable functions in the domain of real numbers. Neuro-fuzzy systems being a combination of the methodology of artificial neural networks and fuzzy sets operate on the basis of a set of fuzzy rules "if-then", generated by means of the self-organization of data grouping and the estimation of relations between fuzzy experiment results. The article includes a description of neuro-fuzzy systems by Takaga-Sugeno-Kang (TSK) and Wang-Mendel (WM), and in order to complement the problem in question, a hierarchical structural self-organizing method of teaching a fuzzy network. A multi-layer structure of the systems is a structure analogous to the structure of "classic" neural networks. In its final part the article presents selected areas of application of neuro-fuzzy systems in the field of geodesy and surveying engineering. Numerical examples showing how the systems work concerned: the approximation of functions of several variables to be used as algorithms in the Geographic Information Systems (the approximation of a terrain model), the transformation of coordinates, and the prediction of a time series. The accuracy characteristics of the results obtained have been taken into consideration.
An Origami Approximation to the Cosmic Web
NASA Astrophysics Data System (ADS)
Neyrinck, Mark C.
2016-10-01
The powerful Lagrangian view of structure formation was essentially introduced to cosmology by Zel'dovich. In the current cosmological paradigm, a dark-matter-sheet 3D manifold, inhabiting 6D position-velocity phase space, was flat (with vanishing velocity) at the big bang. Afterward, gravity stretched and bunched the sheet together in different places, forming a cosmic web when projected to the position coordinates. Here, I explain some properties of an origami approximation, in which the sheet does not stretch or contract (an assumption that is false in general), but is allowed to fold. Even without stretching, the sheet can form an idealized cosmic web, with convex polyhedral voids separated by straight walls and filaments, joined by convex polyhedral nodes. The nodes form in `polygonal' or `polyhedral' collapse, somewhat like spherical/ellipsoidal collapse, except incorporating simultaneous filament and wall formation. The origami approximation allows phase-space geometries of nodes, filaments, and walls to be more easily understood, and may aid in understanding spin correlations between nearby galaxies. This contribution explores kinematic origami-approximation models giving velocity fields for the first time.
Approximate Graph Edit Distance in Quadratic Time.
Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst
2015-09-14
Graph edit distance is one of the most flexible and general graph matching models available. The major drawback of graph edit distance, however, is its computational complexity that restricts its applicability to graphs of rather small size. Recently the authors of the present paper introduced a general approximation framework for the graph edit distance problem. The basic idea of this specific algorithm is to first compute an optimal assignment of independent local graph structures (including substitutions, deletions, and insertions of nodes and edges). This optimal assignment is complete and consistent with respect to the involved nodes of both graphs and can thus be used to instantly derive an admissible (yet suboptimal) solution for the original graph edit distance problem in O(n3) time. For large scale graphs or graph sets, however, the cubic time complexity may still be too high. Therefore, we propose to use suboptimal algorithms with quadratic rather than cubic time for solving the basic assignment problem. In particular, the present paper introduces five different greedy assignment algorithms in the context of graph edit distance approximation. In an experimental evaluation we show that these methods have great potential for further speeding up the computation of graph edit distance while the approximated distances remain sufficiently accurate for graph based pattern classification.
Ranking Support Vector Machine with Kernel Approximation
Dou, Yong
2017-01-01
Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms. PMID:28293256
Strong washout approximation to resonant leptogenesis
NASA Astrophysics Data System (ADS)
Garbrecht, Björn; Gautier, Florian; Klaric, Juraj
2014-09-01
We show that the effective decay asymmetry for resonant Leptogenesis in the strong washout regime with two sterile neutrinos and a single active flavour can in wide regions of parameter space be approximated by its late-time limit ɛ=Xsin(2varphi)/(X2+sin2varphi), where X=8πΔ/(|Y1|2+|Y2|2), Δ=4(M1-M2)/(M1+M2), varphi=arg(Y2/Y1), and M1,2, Y1,2 are the masses and Yukawa couplings of the sterile neutrinos. This approximation in particular extends to parametric regions where |Y1,2|2gg Δ, i.e. where the width dominates the mass splitting. We generalise the formula for the effective decay asymmetry to the case of several flavours of active leptons and demonstrate how this quantity can be used to calculate the lepton asymmetry for phenomenological scenarios that are in agreement with the observed neutrino oscillations. We establish analytic criteria for the validity of the late-time approximation for the decay asymmetry and compare these with numerical results that are obtained by solving for the mixing and the oscillations of the sterile neutrinos. For phenomenologically viable models with two sterile neutrinos, we find that the flavoured effective late-time decay asymmetry can be applied throughout parameter space.
Ranking Support Vector Machine with Kernel Approximation.
Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi
2017-01-01
Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.
Using Approximations to Accelerate Engineering Design Optimization
NASA Technical Reports Server (NTRS)
Torczon, Virginia; Trosset, Michael W.
1998-01-01
Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.
Odic, Darko; Lisboa, Juan Valle; Eisinger, Robert; Olivera, Magdalena Gonzalez; Maiche, Alejandro; Halberda, Justin
2016-01-01
What is the relationship between our intuitive sense of number (e.g., when estimating how many marbles are in a jar), and our intuitive sense of other quantities, including time (e.g., when estimating how long it has been since we last ate breakfast)? Recent work in cognitive, developmental, comparative psychology, and computational neuroscience has suggested that our representations of approximate number, time, and spatial extent are fundamentally linked and constitute a "generalized magnitude system". But, the shared behavioral and neural signatures between number, time, and space may alternatively be due to similar encoding and decision-making processes, rather than due to shared domain-general representations. In this study, we investigate the relationship between approximate number and time in a large sample of 6-8 year-old children in Uruguay by examining how individual differences in the precision of number and time estimation correlate with school mathematics performance. Over four testing days, each child completed an approximate number discrimination task, an approximate time discrimination task, a digit span task, and a large battery of symbolic math tests. We replicate previous reports showing that symbolic math abilities correlate with approximate number precision and extend those findings by showing that math abilities also correlate with approximate time precision. But, contrary to approximate number and time sharing common representations, we find that each of these dimensions uniquely correlates with formal math: approximate number correlates more strongly with formal math compared to time and continues to correlate with math even when precision in time and individual differences in working memory are controlled for. These results suggest that there are important differences in the mental representations of approximate number and approximate time and further clarify the relationship between quantity representations and mathematics. Copyright
Photoelectron spectroscopy and the dipole approximation
Hemmers, O.; Hansen, D.L.; Wang, H.
1997-04-01
Photoelectron spectroscopy is a powerful technique because it directly probes, via the measurement of photoelectron kinetic energies, orbital and band structure in valence and core levels in a wide variety of samples. The technique becomes even more powerful when it is performed in an angle-resolved mode, where photoelectrons are distinguished not only by their kinetic energy, but by their direction of emission as well. Determining the probability of electron ejection as a function of angle probes the different quantum-mechanical channels available to a photoemission process, because it is sensitive to phase differences among the channels. As a result, angle-resolved photoemission has been used successfully for many years to provide stringent tests of the understanding of basic physical processes underlying gas-phase and solid-state interactions with radiation. One mainstay in the application of angle-resolved photoelectron spectroscopy is the well-known electric-dipole approximation for photon interactions. In this simplification, all higher-order terms, such as those due to electric-quadrupole and magnetic-dipole interactions, are neglected. As the photon energy increases, however, effects beyond the dipole approximation become important. To best determine the range of validity of the dipole approximation, photoemission measurements on a simple atomic system, neon, where extra-atomic effects cannot play a role, were performed at BL 8.0. The measurements show that deviations from {open_quotes}dipole{close_quotes} expectations in angle-resolved valence photoemission are observable for photon energies down to at least 0.25 keV, and are quite significant at energies around 1 keV. From these results, it is clear that non-dipole angular-distribution effects may need to be considered in any application of angle-resolved photoelectron spectroscopy that uses x-ray photons of energies as low as a few hundred eV.
Product-State Approximations to Quantum States
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.
2016-02-01
We show that for any many-body quantum state there exists an unentangled quantum state such that most of the two-body reduced density matrices are close to those of the original state. This is a statement about the monogamy of entanglement, which cannot be shared without limit in the same way as classical correlation. Our main application is to Hamiltonians that are sums of two-body terms. For such Hamiltonians we show that there exist product states with energy that is close to the ground-state energy whenever the interaction graph of the Hamiltonian has high degree. This proves the validity of mean-field theory and gives an explicitly bounded approximation error. If we allow states that are entangled within small clusters of systems but product across clusters then good approximations exist when the Hamiltonian satisfies one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state where the blocks in the partition have sublinear entanglement. Previously this was known only in the case of small expansion or in the regime where the entanglement was close to zero. Our approximations allow an extensive error in energy, which is the scale considered by the quantum PCP (probabilistically checkable proof) and NLTS (no low-energy trivial-state) conjectures. Thus our results put restrictions on the possible Hamiltonians that could be used for a possible proof of the qPCP or NLTS conjectures. By contrast the classical PCP constructions are often based on constraint graphs with high degree. Likewise we show that the parallel repetition that is possible with classical constraint satisfaction problems cannot also be possible for quantum Hamiltonians, unless qPCP is false. The main technical tool behind our results is a collection of new classical and quantum de Finetti theorems which do not make any symmetry assumptions on the underlying states.
An approximate projection method for incompressible flow
NASA Astrophysics Data System (ADS)
Stevens, David E.; Chan, Stevens T.; Gresho, Phil
2002-12-01
This paper presents an approximate projection method for incompressible flows. This method is derived from Galerkin orthogonality conditions using equal-order piecewise linear elements for both velocity and pressure, hereafter Q1Q1. By combining an approximate projection for the velocities with a variational discretization of the continuum pressure Poisson equation, one eliminates the need to filter either the velocity or pressure fields as is often needed with equal-order element formulations. This variational approach extends to multiple types of elements; examples and results for triangular and quadrilateral elements are provided. This method is related to the method of Almgren et al. (SIAM J. Sci. Comput. 2000; 22: 1139-1159) and the PISO method of Issa (J. Comput. Phys. 1985; 62: 40-65). These methods use a combination of two elliptic solves, one to reduce the divergence of the velocities and another to approximate the pressure Poisson equation. Both Q1Q1 and the method of Almgren et al. solve the second Poisson equation with a weak error tolerance to achieve more computational efficiency.A Fourier analysis of Q1Q1 shows that a consistent mass matrix has a positive effect on both accuracy and mass conservation. A numerical comparison with the widely used Q1Q0 (piecewise linear velocities, piecewise constant pressures) on a periodic test case with an analytic solution verifies this analysis. Q1Q1 is shown to have comparable accuracy as Q1Q0 and good agreement with experiment for flow over an isolated cubic obstacle and dispersion of a point source in its wake.
Approximate protein structural alignment in polynomial time
Kolodny, Rachel; Linial, Nathan
2004-01-01
Alignment of protein structures is a fundamental task in computational molecular biology. Good structural alignments can help detect distant evolutionary relationships that are hard or impossible to discern from protein sequences alone. Here, we study the structural alignment problem as a family of optimization problems and develop an approximate polynomial-time algorithm to solve them. For a commonly used scoring function, the algorithm runs in O(n10/ε6) time, for globular protein of length n, and it detects alignments that score within an additive error of ε from all optima. Thus, we prove that this task is computationally feasible, although the method that we introduce is too slow to be a useful everyday tool. We argue that such approximate solutions are, in fact, of greater interest than exact ones because of the noisy nature of experimentally determined protein coordinates. The measurement of similarity between a pair of protein structures used by our algorithm involves the Euclidean distance between the structures (appropriately rigidly transformed). We show that an alternative approach, which relies on internal distance matrices, must incorporate sophisticated geometric ingredients if it is to guarantee optimality and run in polynomial time. We use these observations to visualize the scoring function for several real instances of the problem. Our investigations yield insights on the computational complexity of protein alignment under various scoring functions. These insights can be used in the design of scoring functions for which the optimum can be approximated efficiently and perhaps in the development of efficient algorithms for the multiple structural alignment problem. PMID:15304646
Strong washout approximation to resonant leptogenesis
Garbrecht, Björn; Gautier, Florian; Klaric, Juraj E-mail: florian.gautier@tum.de
2014-09-01
We show that the effective decay asymmetry for resonant Leptogenesis in the strong washout regime with two sterile neutrinos and a single active flavour can in wide regions of parameter space be approximated by its late-time limit ε=Xsin(2φ)/(X{sup 2}+sin{sup 2}φ), where X=8πΔ/(|Y{sub 1}|{sup 2}+|Y{sub 2}|{sup 2}), Δ=4(M{sub 1}-M{sub 2})/(M{sub 1}+M{sub 2}), φ=arg(Y{sub 2}/Y{sub 1}), and M{sub 1,2}, Y{sub 1,2} are the masses and Yukawa couplings of the sterile neutrinos. This approximation in particular extends to parametric regions where |Y{sub 1,2}|{sup 2}>> Δ, i.e. where the width dominates the mass splitting. We generalise the formula for the effective decay asymmetry to the case of several flavours of active leptons and demonstrate how this quantity can be used to calculate the lepton asymmetry for phenomenological scenarios that are in agreement with the observed neutrino oscillations. We establish analytic criteria for the validity of the late-time approximation for the decay asymmetry and compare these with numerical results that are obtained by solving for the mixing and the oscillations of the sterile neutrinos. For phenomenologically viable models with two sterile neutrinos, we find that the flavoured effective late-time decay asymmetry can be applied throughout parameter space.
Relativistic Random Phase Approximation At Finite Temperature
Niu, Y. F.; Paar, N.; Vretenar, D.; Meng, J.
2009-08-26
The fully self-consistent finite temperature relativistic random phase approximation (FTRRPA) has been established in the single-nucleon basis of the temperature dependent Dirac-Hartree model (FTDH) based on effective Lagrangian with density dependent meson-nucleon couplings. Illustrative calculations in the FTRRPA framework show the evolution of multipole responses of {sup 132}Sn with temperature. With increased temperature, in both monopole and dipole strength distributions additional transitions appear in the low energy region due to the new opened particle-particle and hole-hole transition channels.
Analytic Approximation to Randomly Oriented Spheroid Extinction
1993-12-01
104 times faster than by the T - matrix code . Since the T-matrix scales as at least the cube of the optical size whereas the analytic approximation is...coefficient estimate, and with the Rayleigh formula. Since it is difficult estimate the accuracy near the limit of stability of the T - matrix code some...additional error due to the T - matrix code could be present. UNCLASSIFIED 30 Max Ret Error, Analytic vs T-Mat, r= 1/5 0.0 20 25 10 ~ 0.5 100 . 7.5 S-1.0
Relativistic mean field approximation to baryons
Dmitri Diakonov
2005-02-01
We stress the importance of the spontaneous chiral symmetry breaking for understanding the low-energy structure of baryons. The Mean Field Approximation to baryons is formulated, which solves several outstanding paradoxes of the naive quark models, and which allows to compute parton distributions at low virtuality in a consistent way. We explain why this approach to baryons leads to the prediction of relatively light exotic pentaquark baryons, in contrast to the constituent models which do not take seriously the importance of chiral symmetry breaking. We briefly discuss why, to our mind, it is easier to produce exotic pentaquarks at low than at high energies.
Approximation of Dynamical System's Separatrix Curves
NASA Astrophysics Data System (ADS)
Cavoretto, Roberto; Chaudhuri, Sanjay; De Rossi, Alessandra; Menduni, Eleonora; Moretti, Francesca; Rodi, Maria Caterina; Venturino, Ezio
2011-09-01
In dynamical systems saddle points partition the domain into basins of attractions of the remaining locally stable equilibria. This problem is rather common especially in population dynamics models, like prey-predator or competition systems. In this paper we construct programs for the detection of points lying on the separatrix curve, i.e. the curve which partitions the domain. Finally, an efficient algorithm, which is based on the Partition of Unity method with local approximants given by Wendland's functions, is used for reconstructing the separatrix curve.
Optimal Markov approximations and generalized embeddings
NASA Astrophysics Data System (ADS)
Holstein, Detlef; Kantz, Holger
2009-05-01
Based on information theory, we present a method to determine an optimal Markov approximation for modeling and prediction from time series data. The method finds a balance between minimal modeling errors by taking as much as possible memory into account and minimal statistical errors by working in embedding spaces of rather small dimension. A key ingredient is an estimate of the statistical error of entropy estimates. The method is illustrated with several examples, and the consequences for prediction are evaluated by means of the root-mean-squared prediction error for point prediction.
Approximation concepts for numerical airfoil optimization
NASA Technical Reports Server (NTRS)
Vanderplaats, G. N.
1979-01-01
An efficient algorithm for airfoil optimization is presented. The algorithm utilizes approximation concepts to reduce the number of aerodynamic analyses required to reach the optimum design. Examples are presented and compared with previous results. Optimization efficiency improvements of more than a factor of 2 are demonstrated. Improvements in efficiency are demonstrated when analysis data obtained in previous designs are utilized. The method is a general optimization procedure and is not limited to this application. The method is intended for application to a wide range of engineering design problems.
Semiclassical approximations to quantum time correlation functions
NASA Astrophysics Data System (ADS)
Egorov, S. A.; Skinner, J. L.
1998-09-01
Over the last 40 years several ad hoc semiclassical approaches have been developed in order to obtain approximate quantum time correlation functions, using as input only the corresponding classical time correlation functions. The accuracy of these approaches has been tested for several exactly solvable gas-phase models. In this paper we test the accuracy of these approaches by comparing to an exactly solvable many-body condensed-phase model. We show that in the frequency domain the Egelstaff approach is the most accurate, especially at high frequencies, while in the time domain one of the other approaches is more accurate.
Approximation Algorithms for Free-Label Maximization
NASA Astrophysics Data System (ADS)
de Berg, Mark; Gerrits, Dirk H. P.
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points in the plane and labels that are unit squares, place a label with each point in P in such a way that the number of free labels (labels not intersecting any other label) is maximized. We develop efficient constant-factor approximation algorithms for this problem, as well as PTASs, for various label-placement models.
Shear viscosity in the postquasistatic approximation
Peralta, C.; Rosales, L.; Rodriguez-Mueller, B.; Barreto, W.
2010-05-15
We apply the postquasistatic approximation, an iterative method for the evolution of self-gravitating spheres of matter, to study the evolution of anisotropic nonadiabatic radiating and dissipative distributions in general relativity. Dissipation is described by viscosity and free-streaming radiation, assuming an equation of state to model anisotropy induced by the shear viscosity. We match the interior solution, in noncomoving coordinates, with the Vaidya exterior solution. Two simple models are presented, based on the Schwarzschild and Tolman VI solutions, in the nonadiabatic and adiabatic limit. In both cases, the eventual collapse or expansion of the distribution is mainly controlled by the anisotropy induced by the viscosity.
The monoenergetic approximation in stellarator neoclassical calculations
NASA Astrophysics Data System (ADS)
Landreman, Matt
2011-08-01
In 'monoenergetic' stellarator neoclassical calculations, to expedite computation, ad hoc changes are made to the kinetic equation so speed enters only as a parameter. Here we examine the validity of this approach by considering the effective particle trajectories in a model magnetic field. We find monoenergetic codes systematically under-predict the true trapped particle fraction. The error in the trapped ion fraction can be of order unity for large but experimentally realizable values of the radial electric field, suggesting some results of these codes may be unreliable in this regime. This inaccuracy is independent of any errors introduced by approximation of the collision operator.
Localization and stationary phase approximation on supermanifolds
NASA Astrophysics Data System (ADS)
Zakharevich, Valentin
2017-08-01
Given an odd vector field Q on a supermanifold M and a Q-invariant density μ on M, under certain compactness conditions on Q, the value of the integral ∫Mμ is determined by the value of μ on any neighborhood of the vanishing locus N of Q. We present a formula for the integral in the case where N is a subsupermanifold which is appropriately non-degenerate with respect to Q. In the process, we discuss the linear algebra necessary to express our result in a coordinate independent way. We also extend the stationary phase approximation and the Morse-Bott lemma to supermanifolds.
Approximations of nonlinear systems having outputs
NASA Technical Reports Server (NTRS)
Hunt, L. R.; Su, R.
1985-01-01
For a nonlinear system with output derivative x = f(x) and y = h(x), two types of linearizations about a point x(0) in state space are considered. One is the usual Taylor series approximation, and the other is defined by linearizing the appropriate Lie derivatives of the output with respect to f about x(0). The latter is called the obvservation model and appears to be quite natural for observation. It is noted that there is a coordinate system in which these two kinds of linearizations agree. In this coordinate system, a technique to construct an observer is introduced.
Analytic approximate radiation effects due to Bremsstrahlung
Ben-Zvi I.
2012-02-01
The purpose of this note is to provide analytic approximate expressions that can provide quick estimates of the various effects of the Bremsstrahlung radiation produced relatively low energy electrons, such as the dumping of the beam into the beam stop at the ERL or field emission in superconducting cavities. The purpose of this work is not to replace a dependable calculation or, better yet, a measurement under real conditions, but to provide a quick but approximate estimate for guidance purposes only. These effects include dose to personnel, ozone generation in the air volume exposed to the radiation, hydrogen generation in the beam dump water cooling system and radiation damage to near-by magnets. These expressions can be used for other purposes, but one should note that the electron beam energy range is limited. In these calculations the good range is from about 0.5 MeV to 10 MeV. To help in the application of this note, calculations are presented as a worked out example for the beam dump of the R&D Energy Recovery Linac.
Optimal Approximation of Quadratic Interval Functions
NASA Technical Reports Server (NTRS)
Koshelev, Misha; Taillibert, Patrick
1997-01-01
Measurements are never absolutely accurate, as a result, after each measurement, we do not get the exact value of the measured quantity; at best, we get an interval of its possible values, For dynamically changing quantities x, the additional problem is that we cannot measure them continuously; we can only measure them at certain discrete moments of time t(sub 1), t(sub 2), ... If we know that the value x(t(sub j)) at a moment t(sub j) of the last measurement was in the interval [x-(t(sub j)), x + (t(sub j))], and if we know the upper bound D on the rate with which x changes, then, for any given moment of time t, we can conclude that x(t) belongs to the interval [x-(t(sub j)) - D (t - t(sub j)), x + (t(sub j)) + D (t - t(sub j))]. This interval changes linearly with time, an is, therefore, called a linear interval function. When we process these intervals, we get an expression that is quadratic and higher order w.r.t. time t, Such "quadratic" intervals are difficult to process and therefore, it is necessary to approximate them by linear ones. In this paper, we describe an algorithm that gives the optimal approximation of quadratic interval functions by linear ones.
Perturbed kernel approximation on homogeneous manifolds
NASA Astrophysics Data System (ADS)
Levesley, J.; Sun, X.
2007-02-01
Current methods for interpolation and approximation within a native space rely heavily on the strict positive-definiteness of the underlying kernels. If the domains of approximation are the unit spheres in euclidean spaces, then zonal kernels (kernels that are invariant under the orthogonal group action) are strongly favored. In the implementation of these methods to handle real world problems, however, some or all of the symmetries and positive-definiteness may be lost in digitalization due to small random errors that occur unpredictably during various stages of the execution. Perturbation analysis is therefore needed to address the stability problem encountered. In this paper we study two kinds of perturbations of positive-definite kernels: small random perturbations and perturbations by Dunkl's intertwining operators [C. Dunkl, Y. Xu, Orthogonal polynomials of several variables, Encyclopedia of Mathematics and Its Applications, vol. 81, Cambridge University Press, Cambridge, 2001]. We show that with some reasonable assumptions, a small random perturbation of a strictly positive-definite kernel can still provide vehicles for interpolation and enjoy the same error estimates. We examine the actions of the Dunkl intertwining operators on zonal (strictly) positive-definite kernels on spheres. We show that the resulted kernels are (strictly) positive-definite on spheres of lower dimensions.
Fast approximate surface evolution in arbitrary dimension
Malcolm, James; Rathi, Yogesh; Yezzi, Anthony; Tannenbaum, Allen
2013-01-01
The level set method is a popular technique used in medical image segmentation; however, the numerics involved make its use cumbersome. This paper proposes an approximate level set scheme that removes much of the computational burden while maintaining accuracy. Abandoning a floating point representation for the signed distance function, we use integral values to represent the signed distance function. For the cases of 2D and 3D, we detail rules governing the evolution and maintenance of these three regions. Arbitrary energies can be implemented in the framework. This scheme has several desirable properties: computations are only performed along the zero level set; the approximate distance function requires only a few simple integer comparisons for maintenance; smoothness regularization involves only a few integer calculations and may be handled apart from the energy itself; the zero level set is represented exactly removing the need for interpolation off the interface; and evolutions proceed on the order of milliseconds per iteration on conventional uniprocessor workstations. To highlight its accuracy, flexibility and speed, we demonstrate the technique on intensity-based segmentations under various statistical metrics. Results for 3D imagery show the technique is fast even for image volumes. PMID:24392194
Approximate Sensory Data Collection: A Survey
Cheng, Siyao; Cai, Zhipeng; Li, Jianzhong
2017-01-01
With the rapid development of the Internet of Things (IoTs), wireless sensor networks (WSNs) and related techniques, the amount of sensory data manifests an explosive growth. In some applications of IoTs and WSNs, the size of sensory data has already exceeded several petabytes annually, which brings too many troubles and challenges for the data collection, which is a primary operation in IoTs and WSNs. Since the exact data collection is not affordable for many WSN and IoT systems due to the limitations on bandwidth and energy, many approximate data collection algorithms have been proposed in the last decade. This survey reviews the state of the art of approximate data collection algorithms. We classify them into three categories: the model-based ones, the compressive sensing based ones, and the query-driven ones. For each category of algorithms, the advantages and disadvantages are elaborated, some challenges and unsolved problems are pointed out, and the research prospects are forecasted. PMID:28287440
Variational extensions of the mean spherical approximation
NASA Astrophysics Data System (ADS)
Blum, L.; Ubriaco, M.
2000-04-01
In a previous work we have proposed a method to study complex systems with objects of arbitrary size. For certain specific forms of the atomic and molecular interactions, surprisingly simple and accurate theories (The Variational Mean Spherical Scaling Approximation, VMSSA) [(Velazquez, Blum J. Chem. Phys. 110 (1990) 10 931; Blum, Velazquez, J. Quantum Chem. (Theochem), in press)] can be obtained. The basic idea is that if the interactions can be expressed in a rapidly converging sum of (complex) exponentials, then the Ornstein-Zernike equation (OZ) has an analytical solution. This analytical solution is used to construct a robust interpolation scheme, the variation mean spherical scaling approximation (VMSSA). The Helmholtz excess free energy Δ A=Δ E- TΔ S is then written as a function of a scaling matrix Γ. Both the excess energy Δ E( Γ) and the excess entropy Δ S( Γ) will be functionals of Γ. In previous work of this series the form of this functional was found for the two- (Blum, Herrera, Mol. Phys. 96 (1999) 821) and three-exponential closures of the OZ equation (Blum, J. Stat. Phys., submitted for publication). In this paper we extend this to M Yukawas, a complete basis set: We obtain a solution for the one-component case and give a closed-form expression for the MSA excess entropy, which is also the VMSSA entropy.
Exact and Approximate Sizes of Convex Datacubes
NASA Astrophysics Data System (ADS)
Nedjar, Sébastien
In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. The notion of data cube has been explored in various ways: iceberg cubes, range cubes, differential cubes or emerging cubes. Previously, we have introduced the concept of convex cube which generalizes all the quoted variants of cubes. More precisely, the convex cube captures all the tuples satisfying a monotone and/or antimonotone constraint combination. This paper is dedicated to a study of the convex cube size. Actually, knowing the size of such a cube even before computing it has various advantages. First of all, free space can be saved for its storage and the data warehouse administration can be improved. However the main interest of this size knowledge is to choose at best the constraints to apply in order to get a workable result. For an aided calibrating of constraints, we propose a sound characterization, based on inclusion-exclusion principle, of the exact size of convex cube as long as an upper bound which can be very quickly yielded. Moreover we adapt the nearly optimal algorithm HyperLogLog in order to provide a very good approximation of the exact size of convex cubes. Our analytical results are confirmed by experiments: the approximated size of convex cubes is really close to their exact size and can be computed quasi immediately.
Adaptive Discontinuous Galerkin Approximation to Richards' Equation
NASA Astrophysics Data System (ADS)
Li, H.; Farthing, M. W.; Miller, C. T.
2006-12-01
Due to the occurrence of large gradients in fluid pressure as a function of space and time resulting from nonlinearities in closure relations, numerical solutions to Richards' equations are notoriously difficult for certain media properties and auxiliary conditions that occur routinely in describing physical systems of interest. These difficulties have motivated a substantial amount of work aimed at improving numerical approximations to this physically important and mathematically rich model. In this work, we build upon recent advances in temporal and spatial discretization methods by developing spatially and temporally adaptive solution approaches based upon the local discontinuous Galerkin method in space and a higher order backward difference method in time. Spatial step-size adaption, h adaption, approaches are evaluated and a so-called hp-adaption strategy is considered as well, which adjusts both the step size and the order of the approximation. Solution algorithms are advanced and performance is evaluated. The spatially and temporally adaptive approaches are shown to be robust and offer significant increases in computational efficiency compared to similar state-of-the-art methods that adapt in time alone. In addition, we extend the proposed methods to two dimensions and provide preliminary numerical results.
Approximation of Failure Probability Using Conditional Sampling
NASA Technical Reports Server (NTRS)
Giesy. Daniel P.; Crespo, Luis G.; Kenney, Sean P.
2008-01-01
In analyzing systems which depend on uncertain parameters, one technique is to partition the uncertain parameter domain into a failure set and its complement, and judge the quality of the system by estimating the probability of failure. If this is done by a sampling technique such as Monte Carlo and the probability of failure is small, accurate approximation can require so many sample points that the computational expense is prohibitive. Previous work of the authors has shown how to bound the failure event by sets of such simple geometry that their probabilities can be calculated analytically. In this paper, it is shown how to make use of these failure bounding sets and conditional sampling within them to substantially reduce the computational burden of approximating failure probability. It is also shown how the use of these sampling techniques improves the confidence intervals for the failure probability estimate for a given number of sample points and how they reduce the number of sample point analyses needed to achieve a given level of confidence.
Revisiting approximate dynamic programming and its convergence.
Heydari, Ali
2014-12-01
Value iteration-based approximate/adaptive dynamic programming (ADP) as an approximate solution to infinite-horizon optimal control problems with deterministic dynamics and continuous state and action spaces is investigated. The learning iterations are decomposed into an outer loop and an inner loop. A relatively simple proof for the convergence of the outer-loop iterations to the optimal solution is provided using a novel idea with some new features. It presents an analogy between the value function during the iterations and the value function of a fixed-final-time optimal control problem. The inner loop is utilized to avoid the need for solving a set of nonlinear equations or a nonlinear optimization problem numerically, at each iteration of ADP for the policy update. Sufficient conditions for the uniqueness of the solution to the policy update equation and for the convergence of the inner-loop iterations to the solution are obtained. Afterwards, the results are formed as a learning algorithm for training a neurocontroller or creating a look-up table to be used for optimal control of nonlinear systems with different initial conditions. Finally, some of the features of the investigated method are numerically analyzed.
Investigating Material Approximations in Spacecraft Radiation Analysis
NASA Technical Reports Server (NTRS)
Walker, Steven A.; Slaba, Tony C.; Clowdsley, Martha S.; Blattnig, Steve R.
2011-01-01
During the design process, the configuration of space vehicles and habitats changes frequently and the merits of design changes must be evaluated. Methods for rapidly assessing astronaut exposure are therefore required. Typically, approximations are made to simplify the geometry and speed up the evaluation of each design. In this work, the error associated with two common approximations used to simplify space radiation vehicle analyses, scaling into equivalent materials and material reordering, are investigated. Over thirty materials commonly found in spacesuits, vehicles, and human bodies are considered. Each material is placed in a material group (aluminum, polyethylene, or tissue), and the error associated with scaling and reordering was quantified for each material. Of the scaling methods investigated, range scaling is shown to be the superior method, especially for shields less than 30 g/cm2 exposed to a solar particle event. More complicated, realistic slabs are examined to quantify the separate and combined effects of using equivalent materials and reordering. The error associated with material reordering is shown to be at least comparable to, if not greater than, the error associated with range scaling. In general, scaling and reordering errors were found to grow with the difference between the average nuclear charge of the actual material and average nuclear charge of the equivalent material. Based on this result, a different set of equivalent materials (titanium, aluminum, and tissue) are substituted for the commonly used aluminum, polyethylene, and tissue. The realistic cases are scaled and reordered using the new equivalent materials, and the reduced error is shown.
Function approximation using adaptive and overlapping intervals
Patil, R.B.
1995-05-01
A problem common to many disciplines is to approximate a function given only the values of the function at various points in input variable space. A method is proposed for approximating a function of several to one variable. The model takes the form of weighted averaging of overlapping basis functions defined over intervals. The number of such basis functions and their parameters (widths and centers) are automatically determined using given training data and a learning algorithm. The proposed algorithm can be seen as placing a nonuniform multidimensional grid in the input domain with overlapping cells. The non-uniformity and overlap of the cells is achieved by a learning algorithm to optimize a given objective function. This approach is motivated by the fuzzy modeling approach and a learning algorithms used for clustering and classification in pattern recognition. The basics of why and how the approach works are given. Few examples of nonlinear regression and classification are modeled. The relationship between the proposed technique, radial basis neural networks, kernel regression, probabilistic neural networks, and fuzzy modeling is explained. Finally advantages and disadvantages are discussed.
Approximate solutions to fractional subdiffusion equations
NASA Astrophysics Data System (ADS)
Hristov, J.
2011-03-01
The work presents integral solutions of the fractional subdiffusion equation by an integral method, as an alternative approach to the solutions employing hypergeometric functions. The integral solution suggests a preliminary defined profile with unknown coefficients and the concept of penetration (boundary layer). The prescribed profile satisfies the boundary conditions imposed by the boundary layer that allows its coefficients to be expressed through its depth as unique parameter. The integral approach to the fractional subdiffusion equation suggests a replacement of the real distribution function by the approximate profile. The solution was performed with Riemann-Liouville time-fractional derivative since the integral approach avoids the definition of the initial value of the time-derivative required by the Laplace transformed equations and leading to a transition to Caputo derivatives. The method is demonstrated by solutions to two simple fractional subdiffusion equations (Dirichlet problems): 1) Time-Fractional Diffusion Equation, and 2) Time-Fractional Drift Equation, both of them having fundamental solutions expressed through the M-Wright function. The solutions demonstrate some basic issues of the suggested integral approach, among them: a) Choice of the profile, b) Integration problem emerging when the distribution (profile) is replaced by a prescribed one with unknown coefficients; c) Optimization of the profile in view to minimize the average error of approximations; d) Numerical results allowing comparisons to the known solutions expressed to the M-Wright function and error estimations.
New Tests of the Fixed Hotspot Approximation
NASA Astrophysics Data System (ADS)
Gordon, R. G.; Andrews, D. L.; Horner-Johnson, B. C.; Kumar, R. R.
2005-05-01
We present new methods for estimating uncertainties in plate reconstructions relative to the hotspots and new tests of the fixed hotspot approximation. We find no significant motion between Pacific hotspots, on the one hand, and Indo-Atlantic hotspots, on the other, for the past ~ 50 Myr, but large and significant apparent motion before 50 Ma. Whether this motion is truly due to motion between hotspots or alternatively due to flaws in the global plate motion circuit can be tested with paleomagnetic data. These tests give results consistent with the fixed hotspot approximation and indicate significant misfits when a relative plate motion circuit through Antarctica is employed for times before 50 Ma. If all of the misfit to the global plate motion circuit is due to motion between East and West Antarctica, then that motion is 800 ± 500 km near the Ross Sea Embayment and progressively less along the Trans-Antarctic Mountains toward the Weddell Sea. Further paleomagnetic tests of the fixed hotspot approximation can be made. Cenozoic and Cretaceous paleomagnetic data from the Pacific plate, along with reconstructions of the Pacific plate relative to the hotspots, can be used to estimate an apparent polar wander (APW) path of Pacific hotspots. An APW path of Indo-Atlantic hotspots can be similarly estimated (e.g. Besse & Courtillot 2002). If both paths diverge in similar ways from the north pole of the hotspot reference frame, it would indicate that the hotspots have moved in unison relative to the spin axis, which may be attributed to true polar wander. If the two paths diverge from one another, motion between Pacific hotspots and Indo-Atlantic hotspots would be indicated. The general agreement of the two paths shows that the former is more important than the latter. The data require little or no motion between groups of hotspots, but up to ~10 mm/yr of motion is allowed within uncertainties. The results disagree, in particular, with the recent extreme interpretation of
An approximate Riemann solver for hypervelocity flows
NASA Technical Reports Server (NTRS)
Jacobs, Peter A.
1991-01-01
We describe an approximate Riemann solver for the computation of hypervelocity flows in which there are strong shocks and viscous interactions. The scheme has three stages, the first of which computes the intermediate states assuming isentropic waves. A second stage, based on the strong shock relations, may then be invoked if the pressure jump across either wave is large. The third stage interpolates the interface state from the two initial states and the intermediate states. The solver is used as part of a finite-volume code and is demonstrated on two test cases. The first is a high Mach number flow over a sphere while the second is a flow over a slender cone with an adiabatic boundary layer. In both cases the solver performs well.
Uncertainty relations and approximate quantum error correction
NASA Astrophysics Data System (ADS)
Renes, Joseph M.
2016-09-01
The uncertainty principle can be understood as constraining the probability of winning a game in which Alice measures one of two conjugate observables, such as position or momentum, on a system provided by Bob, and he is to guess the outcome. Two variants are possible: either Alice tells Bob which observable she measured, or he has to furnish guesses for both cases. Here I derive uncertainty relations for both, formulated directly in terms of Bob's guessing probabilities. For the former these relate to the entanglement that can be recovered by action on Bob's system alone. This gives an explicit quantum circuit for approximate quantum error correction using the guessing measurements for "amplitude" and "phase" information, implicitly used in the recent construction of efficient quantum polar codes. I also find a relation on the guessing probabilities for the latter game, which has application to wave-particle duality relations.
Approximating Densities of States with Gaps
NASA Astrophysics Data System (ADS)
Haydock, Roger; Nex, C. M. M.
2011-03-01
Reconstructing a density of states or similar distribution from moments or continued fractions is an important problem in calculating the electronic and vibrational structure of defective or non-crystalline solids. For single bands a quadratic boundary condition introduced previously [Phys. Rev. B 74, 205121 (2006)] produces results which compare favorably with maximum entropy and even give analytic continuations of Green functions to the unphysical sheet. In this paper, the previous boundary condition is generalized to an energy-independent condition for densities with multiple bands separated by gaps. As an example it is applied to a chain of atoms with s, p, and d bands of different widths with different gaps between them. The results are compared with maximum entropy for different levels of approximation. Generalized hypergeometric functions associated with multiple bands satisfy the new boundary condition exactly. Supported by the Richmond F. Snyder Fund.
Approximate particle spectra in the pyramid scheme
NASA Astrophysics Data System (ADS)
Banks, Tom; Torres, T. J.
2012-12-01
We construct a minimal model inspired by the general class of pyramid schemes [T. Banks and J.-F. Fortin, J. High Energy Phys. 07 (2009) 046JHEPFG1029-8479], which is consistent with both supersymmetry breaking and electroweak symmetry breaking. In order to do computations, we make unjustified approximations to the low energy Kähler potential. The phenomenological viability of the resultant mass spectrum is then examined and compared with current collider limits. We show that for certain regimes of parameters, the model, and thus generically the pyramid scheme, can accommodate the current collider mass constraints on physics beyond the standard model with a tree-level light Higgs mass near 125 GeV. However, in this regime the model exhibits a little hierarchy problem, and one must permit fine-tunings that are of order 5%.
Exact and Approximate Probabilistic Symbolic Execution
NASA Technical Reports Server (NTRS)
Luckow, Kasper; Pasareanu, Corina S.; Dwyer, Matthew B.; Filieri, Antonio; Visser, Willem
2014-01-01
Probabilistic software analysis seeks to quantify the likelihood of reaching a target event under uncertain environments. Recent approaches compute probabilities of execution paths using symbolic execution, but do not support nondeterminism. Nondeterminism arises naturally when no suitable probabilistic model can capture a program behavior, e.g., for multithreading or distributed systems. In this work, we propose a technique, based on symbolic execution, to synthesize schedulers that resolve nondeterminism to maximize the probability of reaching a target event. To scale to large systems, we also introduce approximate algorithms to search for good schedulers, speeding up established random sampling and reinforcement learning results through the quantification of path probabilities based on symbolic execution. We implemented the techniques in Symbolic PathFinder and evaluated them on nondeterministic Java programs. We show that our algorithms significantly improve upon a state-of- the-art statistical model checking algorithm, originally developed for Markov Decision Processes.
Improved approximations for control augmented structural synthesis
NASA Technical Reports Server (NTRS)
Thomas, H. L.; Schmit, L. A.
1990-01-01
A methodology for control-augmented structural synthesis is presented for structure-control systems which can be modeled as an assemblage of beam, truss, and nonstructural mass elements augmented by a noncollocated direct output feedback control system. Truss areas, beam cross sectional dimensions, nonstructural masses and rotary inertias, and controller position and velocity gains are treated simultaneously as design variables. The structural mass and a control-system performance index can be minimized simultaneously, with design constraints placed on static stresses and displacements, dynamic harmonic displacements and forces, structural frequencies, and closed-loop eigenvalues and damping ratios. Intermediate design-variable and response-quantity concepts are used to generate new approximations for displacements and actuator forces under harmonic dynamic loads and for system complex eigenvalues. This improves the overall efficiency of the procedure by reducing the number of complete analyses required for convergence. Numerical results which illustrate the effectiveness of the method are given.
Gutzwiller approximation in strongly correlated electron systems
NASA Astrophysics Data System (ADS)
Li, Chunhua
Gutzwiller wave function is an important theoretical technique for treating local electron-electron correlations nonperturbatively in condensed matter and materials physics. It is concerned with calculating variationally the ground state wave function by projecting out multi-occupation configurations that are energetically costly. The projection can be carried out analytically in the Gutzwiller approximation that offers an approximate way of calculating expectation values in the Gutzwiller projected wave function. This approach has proven to be very successful in strongly correlated systems such as the high temperature cuprate superconductors, the sodium cobaltates, and the heavy fermion compounds. In recent years, it has become increasingly evident that strongly correlated systems have a strong propensity towards forming inhomogeneous electronic states with spatially periodic superstrutural modulations. A good example is the commonly observed stripes and checkerboard states in high- Tc superconductors under a variety of conditions where superconductivity is weakened. There exists currently a real challenge and demand for new theoretical ideas and approaches that treats strongly correlated inhomogeneous electronic states, which is the subject matter of this thesis. This thesis contains four parts. In the first part of the thesis, the Gutzwiller approach is formulated in the grand canonical ensemble where, for the first time, a spatially (and spin) unrestricted Gutzwiller approximation (SUGA) is developed for studying inhomogeneous (both ordered and disordered) quantum electronic states in strongly correlated electron systems. The second part of the thesis applies the SUGA to the t-J model for doped Mott insulators which led to the discovery of checkerboard-like inhomogeneous electronic states competing with d-wave superconductivity, consistent with experimental observations made on several families of high-Tc superconductors. In the third part of the thesis, new
Discrete Spectrum Reconstruction Using Integral Approximation Algorithm.
Sizikov, Valery; Sidorov, Denis
2017-07-01
An inverse problem in spectroscopy is considered. The objective is to restore the discrete spectrum from observed spectrum data, taking into account the spectrometer's line spread function. The problem is reduced to solution of a system of linear-nonlinear equations (SLNE) with respect to intensities and frequencies of the discrete spectral lines. The SLNE is linear with respect to lines' intensities and nonlinear with respect to the lines' frequencies. The integral approximation algorithm is proposed for the solution of this SLNE. The algorithm combines solution of linear integral equations with solution of a system of linear algebraic equations and avoids nonlinear equations. Numerical examples of the application of the technique, both to synthetic and experimental spectra, demonstrate the efficacy of the proposed approach in enabling an effective enhancement of the spectrometer's resolution.
Approximate maximum likelihood decoding of block codes
NASA Technical Reports Server (NTRS)
Greenberger, H. J.
1979-01-01
Approximate maximum likelihood decoding algorithms, based upon selecting a small set of candidate code words with the aid of the estimated probability of error of each received symbol, can give performance close to optimum with a reasonable amount of computation. By combining the best features of various algorithms and taking care to perform each step as efficiently as possible, a decoding scheme was developed which can decode codes which have better performance than those presently in use and yet not require an unreasonable amount of computation. The discussion of the details and tradeoffs of presently known efficient optimum and near optimum decoding algorithms leads, naturally, to the one which embodies the best features of all of them.
Is probabilistic bias analysis approximately Bayesian?
MacLehose, Richard F.; Gustafson, Paul
2011-01-01
Case-control studies are particularly susceptible to differential exposure misclassification when exposure status is determined following incident case status. Probabilistic bias analysis methods have been developed as ways to adjust standard effect estimates based on the sensitivity and specificity of exposure misclassification. The iterative sampling method advocated in probabilistic bias analysis bears a distinct resemblance to a Bayesian adjustment; however, it is not identical. Furthermore, without a formal theoretical framework (Bayesian or frequentist), the results of a probabilistic bias analysis remain somewhat difficult to interpret. We describe, both theoretically and empirically, the extent to which probabilistic bias analysis can be viewed as approximately Bayesian. While the differences between probabilistic bias analysis and Bayesian approaches to misclassification can be substantial, these situations often involve unrealistic prior specifications and are relatively easy to detect. Outside of these special cases, probabilistic bias analysis and Bayesian approaches to exposure misclassification in case-control studies appear to perform equally well. PMID:22157311
Squashed entanglement and approximate private states
NASA Astrophysics Data System (ADS)
Wilde, Mark M.
2016-11-01
The squashed entanglement is a fundamental entanglement measure in quantum information theory, finding application as an upper bound on the distillable secret key or distillable entanglement of a quantum state or a quantum channel. This paper simplifies proofs that the squashed entanglement is an upper bound on distillable key for finite-dimensional quantum systems and solidifies such proofs for infinite-dimensional quantum systems. More specifically, this paper establishes that the logarithm of the dimension of the key system (call it log 2K) in an ɛ -approximate private state is bounded from above by the squashed entanglement of that state plus a term that depends only ɛ and log 2K. Importantly, the extra term does not depend on the dimension of the shield systems of the private state. The result holds for the bipartite squashed entanglement, and an extension of this result is established for two different flavors of the multipartite squashed entanglement.
Approximate Bayesian computation with functional statistics.
Soubeyrand, Samuel; Carpentier, Florence; Guiton, François; Klein, Etienne K
2013-03-26
Functional statistics are commonly used to characterize spatial patterns in general and spatial genetic structures in population genetics in particular. Such functional statistics also enable the estimation of parameters of spatially explicit (and genetic) models. Recently, Approximate Bayesian Computation (ABC) has been proposed to estimate model parameters from functional statistics. However, applying ABC with functional statistics may be cumbersome because of the high dimension of the set of statistics and the dependences among them. To tackle this difficulty, we propose an ABC procedure which relies on an optimized weighted distance between observed and simulated functional statistics. We applied this procedure to a simple step model, a spatial point process characterized by its pair correlation function and a pollen dispersal model characterized by genetic differentiation as a function of distance. These applications showed how the optimized weighted distance improved estimation accuracy. In the discussion, we consider the application of the proposed ABC procedure to functional statistics characterizing non-spatial processes.
PROX: Approximated Summarization of Data Provenance
Ainy, Eleanor; Bourhis, Pierre; Davidson, Susan B.; Deutch, Daniel; Milo, Tova
2016-01-01
Many modern applications involve collecting large amounts of data from multiple sources, and then aggregating and manipulating it in intricate ways. The complexity of such applications, combined with the size of the collected data, makes it difficult to understand the application logic and how information was derived. Data provenance has been proven helpful in this respect in different contexts; however, maintaining and presenting the full and exact provenance may be infeasible, due to its size and complex structure. For that reason, we introduce the notion of approximated summarized provenance, where we seek a compact representation of the provenance at the possible cost of information loss. Based on this notion, we have developed PROX, a system for the management, presentation and use of data provenance for complex applications. We propose to demonstrate PROX in the context of a movies rating crowd-sourcing system, letting participants view provenance summarization and use it to gain insights on the application and its underlying data. PMID:27570843
Multidimensional WKB approximation for particle tunneling
Zamastil, J.
2005-08-15
A method for obtaining the WKB wave function describing the particle tunneling outside of a two-dimensional potential well is suggested. The Cartesian coordinates (x,y) are chosen in such a way that the x axis has the direction of the probability flux at large distances from the well. The WKB wave function is then obtained by simultaneous expansion of the wave function in the coordinate y and the parameter determining the curvature of the escape path. It is argued, both physically and mathematically, that these two expansions are mutually consistent. It is shown that the method provides systematic approximation to the outgoing probability flux. Both the technical and conceptual advantages of this approach in comparison with the usual approach based on the solution of classical equations of motion are pointed out. The method is applied to the problem of the coupled anharmonic oscillators and verified through the dispersion relations.
Approximate flavor symmetries in the lepton sector
Rasin, A. ); Silva, J.P. )
1994-01-01
Approximate flavor symmetries in the quark sector have been used as a handle on physics beyond the standard model. Because of the great interest in neutrino masses and mixings and the wealth of existing and proposed neutrino experiments it is important to extend this analysis to the leptonic sector. We show that in the seesaw mechanism the neutrino masses and mixing angles do not depend on the details of the right-handed neutrino flavor symmetry breaking, and are related by a simple formula. We propose several [ital Ansa]$[ital uml]---[ital tze] which relate different flavor symmetry-breaking parameters and find that the MSW solution to the solar neutrino problem is always easily fit. Further, the [nu][sub [mu]-][nu][sub [tau
Improved approximations for control augmented structural synthesis
NASA Technical Reports Server (NTRS)
Thomas, H. L.; Schmit, L. A.
1990-01-01
A methodology for control-augmented structural synthesis is presented for structure-control systems which can be modeled as an assemblage of beam, truss, and nonstructural mass elements augmented by a noncollocated direct output feedback control system. Truss areas, beam cross sectional dimensions, nonstructural masses and rotary inertias, and controller position and velocity gains are treated simultaneously as design variables. The structural mass and a control-system performance index can be minimized simultaneously, with design constraints placed on static stresses and displacements, dynamic harmonic displacements and forces, structural frequencies, and closed-loop eigenvalues and damping ratios. Intermediate design-variable and response-quantity concepts are used to generate new approximations for displacements and actuator forces under harmonic dynamic loads and for system complex eigenvalues. This improves the overall efficiency of the procedure by reducing the number of complete analyses required for convergence. Numerical results which illustrate the effectiveness of the method are given.
Heat flow in the postquasistatic approximation
Rodriguez-Mueller, B.; Peralta, C.; Barreto, W.; Rosales, L.
2010-08-15
We apply the postquasistatic approximation to study the evolution of spherically symmetric fluid distributions undergoing dissipation in the form of radial heat flow. For a model that corresponds to an incompressible fluid departing from the static equilibrium, it is not possible to go far from the initial state after the emission of a small amount of energy. Initially collapsing distributions of matter are not permitted. Emission of energy can be considered as a mechanism to avoid the collapse. If the distribution collapses initially and emits one hundredth of the initial mass only the outermost layers evolve. For a model that corresponds to a highly compressed Fermi gas, only the outermost shell can evolve with a shorter hydrodynamic time scale.
Nanostructures: Scattering beyond the Born approximation
NASA Astrophysics Data System (ADS)
Grigoriev, S. V.; Syromyatnikov, A. V.; Chumakov, A. P.; Grigoryeva, N. A.; Napolskii, K. S.; Roslyakov, I. V.; Eliseev, A. A.; Petukhov, A. V.; Eckerlebe, H.
2010-03-01
The neutron scattering on a two-dimensional ordered nanostructure with the third nonperiodic dimension can go beyond the Born approximation. In our model supported by the exact theoretical solution a well-correlated hexagonal porous structure of anodic aluminum oxide films acts as a peculiar two-dimensional grating for the coherent neutron wave. The thickness of the film L (length of pores) plays important role in the transition from the weak to the strong scattering regimes. It is shown that the coherency of the standard small-angle neutron scattering setups suits to the geometry of the studied objects and often affects the intensity of scattering. The proposed theoretical solution can be applied in the small-angle neutron diffraction experiments with flux lines in superconductors, periodic arrays of magnetic or superconducting nanowires, as well as in small-angle diffraction experiments on synchrotron radiation.
CT reconstruction via denoising approximate message passing
NASA Astrophysics Data System (ADS)
Perelli, Alessandro; Lexa, Michael A.; Can, Ali; Davies, Mike E.
2016-05-01
In this paper, we adapt and apply a compressed sensing based reconstruction algorithm to the problem of computed tomography reconstruction for luggage inspection. Specifically, we propose a variant of the denoising generalized approximate message passing (D-GAMP) algorithm and compare its performance to the performance of traditional filtered back projection and to a penalized weighted least squares (PWLS) based reconstruction method. D-GAMP is an iterative algorithm that at each iteration estimates the conditional probability of the image given the measurements and employs a non-linear "denoising" function which implicitly imposes an image prior. Results on real baggage show that D-GAMP is well-suited to limited-view acquisitions.
The Bloch Approximation in Periodically Perforated Media
Conca, C. Gomez, D. Lobo, M. Perez, E.
2005-06-15
We consider a periodically heterogeneous and perforated medium filling an open domain {omega} of R{sup N}. Assuming that the size of the periodicity of the structure and of the holes is O({epsilon}),we study the asymptotic behavior, as {epsilon} {sup {yields}} 0, of the solution of an elliptic boundary value problem with strongly oscillating coefficients posed in {omega}{sup {epsilon}}({omega}{sup {epsilon}} being {omega} minus the holes) with a Neumann condition on the boundary of the holes. We use Bloch wave decomposition to introduce an approximation of the solution in the energy norm which can be computed from the homogenized solution and the first Bloch eigenfunction. We first consider the case where {omega}is R{sup N} and then localize the problem for abounded domain {omega}, considering a homogeneous Dirichlet condition on the boundary of {omega}.
Fast Approximate Quadratic Programming for Graph Matching
Vogelstein, Joshua T.; Conroy, John M.; Lyzinski, Vince; Podrazik, Louis J.; Kratzer, Steven G.; Harley, Eric T.; Fishkind, Donniell E.; Vogelstein, R. Jacob; Priebe, Carey E.
2015-01-01
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance. PMID:25886624
PROX: Approximated Summarization of Data Provenance.
Ainy, Eleanor; Bourhis, Pierre; Davidson, Susan B; Deutch, Daniel; Milo, Tova
2016-03-01
Many modern applications involve collecting large amounts of data from multiple sources, and then aggregating and manipulating it in intricate ways. The complexity of such applications, combined with the size of the collected data, makes it difficult to understand the application logic and how information was derived. Data provenance has been proven helpful in this respect in different contexts; however, maintaining and presenting the full and exact provenance may be infeasible, due to its size and complex structure. For that reason, we introduce the notion of approximated summarized provenance, where we seek a compact representation of the provenance at the possible cost of information loss. Based on this notion, we have developed PROX, a system for the management, presentation and use of data provenance for complex applications. We propose to demonstrate PROX in the context of a movies rating crowd-sourcing system, letting participants view provenance summarization and use it to gain insights on the application and its underlying data.
Spline Approximation of Thin Shell Dynamics
NASA Technical Reports Server (NTRS)
delRosario, R. C. H.; Smith, R. C.
1996-01-01
A spline-based method for approximating thin shell dynamics is presented here. While the method is developed in the context of the Donnell-Mushtari thin shell equations, it can be easily extended to the Byrne-Flugge-Lur'ye equations or other models for shells of revolution as warranted by applications. The primary requirements for the method include accuracy, flexibility and efficiency in smart material applications. To accomplish this, the method was designed to be flexible with regard to boundary conditions, material nonhomogeneities due to sensors and actuators, and inputs from smart material actuators such as piezoceramic patches. The accuracy of the method was also of primary concern, both to guarantee full resolution of structural dynamics and to facilitate the development of PDE-based controllers which ultimately require real-time implementation. Several numerical examples provide initial evidence demonstrating the efficacy of the method.
Fast approximate quadratic programming for graph matching.
Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E
2015-01-01
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.
Approximate Sensory Data Collection: A Survey.
Cheng, Siyao; Cai, Zhipeng; Li, Jianzhong
2017-03-10
With the rapid development of the Internet of Things (IoTs), wireless sensor networks (WSNs) and related techniques, the amount of sensory data manifests an explosive growth. In some applications of IoTs and WSNs, the size of sensory data has already exceeded several petabytes annually, which brings too many troubles and challenges for the data collection, which is a primary operation in IoTs and WSNs. Since the exact data collection is not affordable for many WSN and IoT systems due to the limitations on bandwidth and energy, many approximate data collection algorithms have been proposed in the last decade. This survey reviews the state of the art of approximatedatacollectionalgorithms. Weclassifythemintothreecategories: themodel-basedones, the compressive sensing based ones, and the query-driven ones. For each category of algorithms, the advantages and disadvantages are elaborated, some challenges and unsolved problems are pointed out, and the research prospects are forecasted.
Approximation Preserving Reductions among Item Pricing Problems
NASA Astrophysics Data System (ADS)
Hamane, Ryoso; Itoh, Toshiya; Tomita, Kouhei
When a store sells items to customers, the store wishes to determine the prices of the items to maximize its profit. Intuitively, if the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. So it would be hard for the store to decide the prices of items. Assume that the store has a set V of n items and there is a set E of m customers who wish to buy those items, and also assume that each item i ∈ V has the production cost di and each customer ej ∈ E has the valuation vj on the bundle ej ⊆ V of items. When the store sells an item i ∈ V at the price ri, the profit for the item i is pi = ri - di. The goal of the store is to decide the price of each item to maximize its total profit. We refer to this maximization problem as the item pricing problem. In most of the previous works, the item pricing problem was considered under the assumption that pi ≥ 0 for each i ∈ V, however, Balcan, et al. [In Proc. of WINE, LNCS 4858, 2007] introduced the notion of “loss-leader, ” and showed that the seller can get more total profit in the case that pi < 0 is allowed than in the case that pi < 0 is not allowed. In this paper, we derive approximation preserving reductions among several item pricing problems and show that all of them have algorithms with good approximation ratio.
Robust Generalized Low Rank Approximations of Matrices.
Shi, Jiarong; Yang, Wei; Zheng, Xiuyun
2015-01-01
In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM) claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM). We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM) to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.
Robust Generalized Low Rank Approximations of Matrices
Shi, Jiarong; Yang, Wei; Zheng, Xiuyun
2015-01-01
In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM) claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM). We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM) to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods. PMID:26367116
The Guarding Problem - Complexity and Approximation
NASA Astrophysics Data System (ADS)
Reddy, T. V. Thirumala; Krishna, D. Sai; Rangan, C. Pandu
Let G = (V, E) be the given graph and G R = (V R ,E R ) and G C = (V C ,E C ) be the sub graphs of G such that V R ∩ V C = ∅ and V R ∪ V C = V. G C is referred to as the cops region and G R is called as the robber region. Initially a robber is placed at some vertex of V R and the cops are placed at some vertices of V C . The robber and cops may move from their current vertices to one of their neighbours. While a cop can move only within the cops region, the robber may move to any neighbour. The robber and cops move alternatively. A vertex v ∈ V C is said to be attacked if the current turn is the robber's turn, the robber is at vertex u where u ∈ V R , (u,v) ∈ E and no cop is present at v. The guarding problem is to find the minimum number of cops required to guard the graph G C from the robber's attack. We first prove that the decision version of this problem when G R is an arbitrary undirected graph is PSPACE-hard. We also prove that the complexity of the decision version of the guarding problem when G R is a wheel graph is NP-hard. We then present approximation algorithms if G R is a star graph, a clique and a wheel graph with approximation ratios H(n 1), 2 H(n 1) and left( H(n1) + 3/2 right) respectively, where H(n1) = 1 + 1/2 + ... + 1/n1 and n 1 = ∣ V R ∣.
Observations on the behavior of vitreous ice at approximately 82 and approximately 12 K.
Wright, Elizabeth R; Iancu, Cristina V; Tivol, William F; Jensen, Grant J
2006-03-01
In an attempt to determine why cooling with liquid helium actually proved disadvantageous in our electron cryotomography experiments, further tests were performed to explore the differences in vitreous ice at approximately 82 and approximately 12 K. Electron diffraction patterns showed clearly that the vitreous ice of interest in biological electron cryomicroscopy (i.e., plunge-frozen, buffered protein solutions) does indeed collapse into a higher density phase when irradiated with as few as 2-3 e-/A2 at approximately 12 K. The high density phase spontaneously expanded back to a state resembling the original, low density phase over a period of hours at approximately 82 K. Movements of gold fiducials and changes in the lengths of tunnels drilled through the ice confirmed these phase changes, and also revealed gross changes in the concavity of the ice layer spanning circular holes in the carbon support. Brief warmup-cooldown cycles from approximately 12 to approximately 82 K and back, as would be required by the flip-flop cryorotation stage, did not induce a global phase change, but did allow certain local strains to relax. Several observations including the rates of tunnel collapse and the production of beam footprints suggested that the high density phase flows more readily in response to irradiation. Finally, the patterns of bubbling were different at the two temperatures. It is concluded that the collapse of vitreous ice at approximately 12 K around macromolecules is too rapid to account alone for the problematic loss of contrast seen, which must instead be due to secondary effects such as changes in the mobility of radiolytic fragments and water.
NASA Astrophysics Data System (ADS)
Hinds, Arianne T.
2011-09-01
Spatial transformations whose kernels employ sinusoidal functions for the decorrelation of signals remain as fundamental components of image and video coding systems. Practical implementations are designed in fixed precision for which the most challenging task is to approximate these constants with values that are both efficient in terms of complexity and accurate with respect to their mathematical definitions. Scaled architectures, for example, as used in the implementations of the order-8 Discrete Cosine Transform and its corresponding inverse both specified in ISO/IEC 23002-2 (MPEG C Pt. 2), can be utilized to mitigate the complexity of these approximations. That is, the implementation of the transform can be designed such that it is completed in two stages: 1) the main transform matrix in which the sinusoidal constants are roughly approximated, and 2) a separate scaling stage to further refine the approximations. This paper describes a methodology termed the Common Factor Method, for finding fixed-point approximations of such irrational values suitable for use in scaled architectures. The order-16 Discrete Cosine Transform provides a framework in which to demonstrate the methodology, but the methodology itself can be employed to design fixed-point implementations of other linear transformations.
PHRAPL: Phylogeographic Inference Using Approximate Likelihoods.
Jackson, Nathon D; Morales, Ariadna E; Carstens, Bryan C; O'Meara, Brian C
2017-02-16
The demographic history of most species is complex, with multiple evolutionary processes combining to shape the observed patterns of genetic diversity. To infer this history, the discipline of phylogeography has (to date) used models that simplify the historical demography of the focal organism, for example by assuming or ignoring ongoing gene flow between populations or by requiring a priori specification of divergence history. Since no single model incorporates every possible evolutionary process, researchers rely on intuition to choose the models that they use to analyze their data. Here, we describe an approximate likelihood approach that reduces this reliance on intuition. PHRAPL allows users to calculate the probability of a large number of complex demographic histories given a set of gene trees, enabling them to identify the most likely underlying model and estimate parameters for a given system. Available model parameters include coalescence time among populations or species, gene flow, and population size. We describe the method and test its performance in model selection and parameter estimation using simulated data. We also compare model probabilities estimated using our approximate likelihood method to those obtained using standard analytical likelihood. The method performs well under a wide range of scenarios, although this is sometimes contingent on sampling many loci. In most scenarios, as long as there are enough loci and if divergence among populations is sufficiently deep, PHRAPL can return the true model in nearly all simulated replicates. Parameter estimates from the method are also generally accurate in most cases. PHRAPL is a valuable new method for phylogeographic model selection and will be particularly useful as a tool to more extensively explore demographic model space than is typically done or to estimate parameters for complex models that are not readily implemented using current methods. Estimating relevant parameters using the most
Padé approximants and analytic continuation of Euclidean Φ -derivable approximations
NASA Astrophysics Data System (ADS)
Markó, Gergely; Reinosa, Urko; Szép, Zsolt
2017-08-01
We investigate the Padé approximation method for the analytic continuation of numerical data and its ability to access, from the Euclidean propagator, both the spectral function and part of the physical information hidden in the second Riemann sheet. We test this method using various benchmarks at zero temperature: a simple perturbative approximation as well as the two-loop Φ -derivable approximation. The analytic continuation method is then applied to Euclidean data previously obtained in the O (4 ) symmetric model (within a given renormalization scheme) to assess the difference between zero-momentum and pole masses, which is in general a difficult question to answer within nonperturbative approaches such as the Φ -derivable expansion scheme.
Consistent Yokoya-Chen Approximation to Beamstrahlung(LCC-0010)
Peskin, M
2004-04-22
I reconsider the Yokoya-Chen approximate evolution equation for beamstrahlung and modify it slightly to generate simple, consistent analytical approximations for the electron and photon energy spectra. I compare these approximations to previous ones, and to simulation data.I reconsider the Yokoya-Chen approximate evolution equation for beamstrahlung and modify it slightly to generate simple, consistent analytical approximations for the electron and photon energy spectra. I compare these approximations to previous ones, and to simulation data.
Magnetic reconnection under anisotropic magnetohydrodynamic approximation
Hirabayashi, K.; Hoshino, M.
2013-11-15
We study the formation of slow-mode shocks in collisionless magnetic reconnection by using one- and two-dimensional collisionless MHD codes based on the double adiabatic approximation and the Landau closure model. We bridge the gap between the Petschek-type MHD reconnection model accompanied by a pair of slow shocks and the observational evidence of the rare occasion of in-situ slow shock observations. Our results showed that once magnetic reconnection takes place, a firehose-sense (p{sub ∥}>p{sub ⊥}) pressure anisotropy arises in the downstream region, and the generated slow shocks are quite weak comparing with those in an isotropic MHD. In spite of the weakness of the shocks, however, the resultant reconnection rate is 10%–30% higher than that in an isotropic case. This result implies that the slow shock does not necessarily play an important role in the energy conversion in the reconnection system and is consistent with the satellite observation in the Earth's magnetosphere.
Stopping power beyond the adiabatic approximation
Caro, M.; Correa, A. A.; Artacho, E.; ...
2017-06-01
Energetic ions traveling in solids deposit energy in a variety of ways, being nuclear and electronic stopping the two avenues in which dissipation is usually treated. This separation between electrons and ions relies on the adiabatic approximation in which ions interact via forces derived from the instantaneous electronic ground state. In a more detailed view, in which non-adiabatic effects are explicitly considered, electronic excitations alter the atomic bonding, which translates into changes in the interatomic forces. In this work, we use time dependent density functional theory and forces derived from the equations of Ehrenfest dynamics that depend instantaneously on themore » time-dependent electronic density. With them we analyze how the inter-ionic forces are affected by electronic excitations in a model of a Ni projectile interacting with a Ni target, a metallic system with strong electronic stopping and shallow core level states. We find that the electronic excitations induce substantial modifications to the inter-ionic forces, which translate into nuclear stopping power well above the adiabatic prediction. Particularly, we observe that most of the alteration of the adiabatic potential in early times comes from the ionization of the core levels of the target ions, not readily screened by the valence electrons.« less
Configuring Airspace Sectors with Approximate Dynamic Programming
NASA Technical Reports Server (NTRS)
Bloem, Michael; Gupta, Pramod
2010-01-01
In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.
Grover's quantum search algorithm and Diophantine approximation
Dolev, Shahar; Pitowsky, Itamar; Tamir, Boaz
2006-02-15
In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O({radical}(N)) queries of the oracle that identifies the object. His result was generalized to the case of finding one object in a subset of marked elements. We consider the following computational problem: A subset of marked elements is given whose number of elements is either M or K, our task is to determine which is the case. We show how to solve this problem with a high probability of success using iterations of Grover's basic step only, and no other algorithm. Let m be the required number of iterations; we prove that under certain restrictions on the sizes of M and K the estimation m<2{radical}(N)/({radical}(K)-{radical}(M)) obtains. This bound reproduces previous results based on more elaborate algorithms, and is known to be optimal up to a constant factor. Our method involves simultaneous Diophantine approximations, so that Grover's algorithm is conceptualized as an orbit of an ergodic automorphism of the torus. We comment on situations where the algorithm may be slow, and note the similarity between these cases and the problem of small divisors in classical mechanics.
Approximate Methods for State-Space Models.
Koyama, Shinsuke; Pérez-Bolde, Lucia Castellanos; Shalizi, Cosma Rohilla; Kass, Robert E
2010-03-01
State-space models provide an important body of techniques for analyzing time-series, but their use requires estimating unobserved states. The optimal estimate of the state is its conditional expectation given the observation histories, and computing this expectation is hard when there are nonlinearities. Existing filtering methods, including sequential Monte Carlo, tend to be either inaccurate or slow. In this paper, we study a nonlinear filter for nonlinear/non-Gaussian state-space models, which uses Laplace's method, an asymptotic series expansion, to approximate the state's conditional mean and variance, together with a Gaussian conditional distribution. This Laplace-Gaussian filter (LGF) gives fast, recursive, deterministic state estimates, with an error which is set by the stochastic characteristics of the model and is, we show, stable over time. We illustrate the estimation ability of the LGF by applying it to the problem of neural decoding and compare it to sequential Monte Carlo both in simulations and with real data. We find that the LGF can deliver superior results in a small fraction of the computing time.
When Density Functional Approximations Meet Iron Oxides.
Meng, Yu; Liu, Xing-Wu; Huo, Chun-Fang; Guo, Wen-Ping; Cao, Dong-Bo; Peng, Qing; Dearden, Albert; Gonze, Xavier; Yang, Yong; Wang, Jianguo; Jiao, Haijun; Li, Yongwang; Wen, Xiao-Dong
2016-10-11
Three density functional approximations (DFAs), PBE, PBE+U, and Heyd-Scuseria-Ernzerhof screened hybrid functional (HSE), were employed to investigate the geometric, electronic, magnetic, and thermodynamic properties of four iron oxides, namely, α-FeOOH, α-Fe2O3, Fe3O4, and FeO. Comparing our calculated results with available experimental data, we found that HSE (a = 0.15) (containing 15% "screened" Hartree-Fock exchange) can provide reliable values of lattice constants, Fe magnetic moments, band gaps, and formation energies of all four iron oxides, while standard HSE (a = 0.25) seriously overestimates the band gaps and formation energies. For PBE+U, a suitable U value can give quite good results for the electronic properties of each iron oxide, but it is challenging to accurately get other properties of the four iron oxides using the same U value. Subsequently, we calculated the Gibbs free energies of transformation reactions among iron oxides using the HSE (a = 0.15) functional and plotted the equilibrium phase diagrams of the iron oxide system under various conditions, which provide reliable theoretical insight into the phase transformations of iron oxides.
Approximate Model for Turbulent Stagnation Point Flow.
Dechant, Lawrence
2016-01-01
Here we derive an approximate turbulent self-similar model for a class of favorable pressure gradient wedge-like flows, focusing on the stagnation point limit. While the self-similar model provides a useful gross flow field estimate this approach must be combined with a near wall model is to determine skin friction and by Reynolds analogy the heat transfer coefficient. The combined approach is developed in detail for the stagnation point flow problem where turbulent skin friction and Nusselt number results are obtained. Comparison to the classical Van Driest (1958) result suggests overall reasonable agreement. Though the model is only valid near the stagnation region of cylinders and spheres it nonetheless provides a reasonable model for overall cylinder and sphere heat transfer. The enhancement effect of free stream turbulence upon the laminar flow is used to derive a similar expression which is valid for turbulent flow. Examination of free stream enhanced laminar flow suggests that the rather than enhancement of a laminar flow behavior free stream disturbance results in early transition to turbulent stagnation point behavior. Excellent agreement is shown between enhanced laminar flow and turbulent flow behavior for high levels, e.g. 5% of free stream turbulence. Finally the blunt body turbulent stagnation results are shown to provide realistic heat transfer results for turbulent jet impingement problems.
Approximations for generalized bilevel programming problem
Morgan, J.; Lignola, M.B.
1994-12-31
The following mathematical programming with variational inequality constraints, also called {open_quotes}Generalized bilevel programming problem{close_quotes}, is considered: minimize f(x, y) subject to x {element_of} U and y {element_of} S(x) where S(x) is the solution set of a parametrized variational inequality; i.e., S(x) = {l_brace}y {element_of} U(x): F(x, y){sup T} (y-z){<=} 0 {forall}z {element_of} U (x){r_brace} with f : R{sup n} {times} R{sup m} {yields} {bar R}, F : R{sup n} {times} R{sup m} - R{sup n} and U(x) = {l_brace}y {element_of} {Gamma}{sup T} c{sub i} (x, y) {<=} 0 for 1 = 1, p{r_brace} with c : R{sup n} {times} R{sup m} {yields} R and U{sub ad}, {Gamma} be compact subsets of R{sup m} and R{sup n} respectively. Approximations will be presented to guarantee not only existence of solutions but also convergence of them under perturbations of the data. Connections with previous results obtained when the lower level problem is an optimization one, will be given.
Approximate theory for radial filtration/consolidation
Tiller, F.M.; Kirby, J.M.; Nguyen, H.L.
1996-10-01
Approximate solutions are developed for filtration and subsequent consolidation of compactible cakes on a cylindrical filter element. Darcy`s flow equation is coupled with equations for equilibrium stress under the conditions of plane strain and axial symmetry for radial flow inwards. The solutions are based on power function forms involving the relationships of the solidosity {epsilon}{sub s} (volume fraction of solids) and the permeability K to the solids effective stress p{sub s}. The solutions allow determination of the various parameters in the power functions and the ratio k{sub 0} of the lateral to radial effective stress (earth stress ratio). Measurements were made of liquid and effective pressures, flow rates, and cake thickness versus time. Experimental data are presented for a series of tests in a radial filtration cell with a central filter element. Slurries prepared from two materials (Microwate, which is mainly SrSO{sub 4}, and kaolin) were used in the experiments. Transient deposition of filter cakes was followed by static (i.e., no flow) conditions in the cake. The no-flow condition was accomplished by introducing bentonite which produced a nearly impermeable layer with negligible flow. Measurement of the pressure at the cake surface and the transmitted pressure on the central element permitted calculation of k{sub 0}.
Coulomb glass in the random phase approximation
NASA Astrophysics Data System (ADS)
Basylko, S. A.; Onischouk, V. A.; Rosengren, A.
2002-01-01
A three-dimensional model of the electrons localized on randomly distributed donor sites of density n and with the acceptor charge uniformly smeared on these sites, -Ke on each, is considered in the random phase approximation (RPA). For the case K=1/2 the free energy, the density of the one-site energies (DOSE) ɛ, and the pair OSE correlators are found. In the high-temperature region (e2n1/3/T)<1 (T is the temperature) RPA energies and DOSE are in a good agreement with the corresponding data of Monte Carlo simulations. Thermodynamics of the model in this region is similar to the one of an electrolyte in the regime of Debye screening. In the vicinity of the Fermi level μ=0 the OSE correlations, depending on sgn(ɛ1.ɛ2) and with very slow decoupling law, have been found. The main result is that even in the temperature range where the energy of a Coulomb glass is determined by Debye screening effects, the correlations of the long-range nature between the OSE still exist.
Dynamical Vertex Approximation for the Hubbard Model
NASA Astrophysics Data System (ADS)
Toschi, Alessandro
A full understanding of correlated electron systems in the physically relevant situations of three and two dimensions represents a challenge for the contemporary condensed matter theory. However, in the last years considerable progress has been achieved by means of increasingly more powerful quantum many-body algorithms, applied to the basic model for correlated electrons, the Hubbard Hamiltonian. Here, I will review the physics emerging from studies performed with the dynamical vertex approximation, which includes diagrammatic corrections to the local description of the dynamical mean field theory (DMFT). In particular, I will first discuss the phase diagram in three dimensions with a special focus on the commensurate and incommensurate magnetic phases, their (quantum) critical properties, and the impact of fluctuations on electronic lifetimes and spectral functions. In two dimensions, the effects of non-local fluctuations beyond DMFT grow enormously, determining the appearance of a low-temperature insulating behavior for all values of the interaction in the unfrustrated model: Here the prototypical features of the Mott-Hubbard metal-insulator transition, as well as the existence of magnetically ordered phases, are completely overwhelmed by antiferromagnetic fluctuations of exponentially large extension, in accordance with the Mermin-Wagner theorem. Eventually, by a fluctuation diagnostics analysis of cluster DMFT self-energies, the same magnetic fluctuations are identified as responsible for the pseudogap regime in the holed-doped frustrated case, with important implications for the theoretical modeling of the cuprate physics.
[Complex systems variability analysis using approximate entropy].
Cuestas, Eduardo
2010-01-01
Biological systems are highly complex systems, both spatially and temporally. They are rooted in an interdependent, redundant and pleiotropic interconnected dynamic network. The properties of a system are different from those of their parts, and they depend on the integrity of the whole. The systemic properties vanish when the system breaks down, while the properties of its components are maintained. The disease can be understood as a systemic functional alteration of the human body, which present with a varying severity, stability and durability. Biological systems are characterized by measurable complex rhythms, abnormal rhythms are associated with disease and may be involved in its pathogenesis, they are been termed "dynamic disease." Physicians have long time recognized that alterations of physiological rhythms are associated with disease. Measuring absolute values of clinical parameters yields highly significant, clinically useful information, however evaluating clinical parameters the variability provides additionally useful clinical information. The aim of this review was to study one of the most recent advances in the measurement and characterization of biological variability made possible by the development of mathematical models based on chaos theory and nonlinear dynamics, as approximate entropy, has provided us with greater ability to discern meaningful distinctions between biological signals from clinically distinct groups of patients.
Approximate von Neumann entropy for directed graphs.
Ye, Cheng; Wilson, Richard C; Comin, César H; Costa, Luciano da F; Hancock, Edwin R
2014-05-01
In this paper, we develop an entropy measure for assessing the structural complexity of directed graphs. Although there are many existing alternative measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, we explore an alternative technique that is applicable to directed graphs. We commence by using Chung's generalization of the Laplacian of a directed graph to extend the computation of von Neumann entropy from undirected to directed graphs. We provide a simplified form of the entropy which can be expressed in terms of simple node in-degree and out-degree statistics. Moreover, we find approximate forms of the von Neumann entropy that apply to both weakly and strongly directed graphs, and that can be used to characterize network structure. We illustrate the usefulness of these simplified entropy forms defined in this paper on both artificial and real-world data sets, including structures from protein databases and high energy physics theory citation networks.
Adaptive approximation of higher order posterior statistics
Lee, Wonjung
2014-02-01
Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively.
An approximate treatment of gravitational collapse
NASA Astrophysics Data System (ADS)
Ascasibar, Yago; Granero-Belinchón, Rafael; Moreno, José Manuel
2013-11-01
This work studies a simplified model of the gravitational instability of an initially homogeneous infinite medium, represented by Td, based on the approximation that the mean fluid velocity is always proportional to the local acceleration. It is shown that, mathematically, this assumption leads to the restricted Patlak-Keller-Segel model considered by Jäger and Luckhaus or, equivalently, the Smoluchowski equation describing the motion of self-gravitating Brownian particles, coupled to the modified Newtonian potential that is appropriate for an infinite mass distribution. We discuss some of the fundamental properties of a non-local generalization of this model where the effective pressure force is given by a fractional Laplacian with 0<α<2 and illustrate them by means of numerical simulations. Local well-posedness in Sobolev spaces is proven, and we show the smoothing effect of our equation, as well as a Beale-Kato-Majda-type criterion in terms of ‖. It is also shown that the problem is ill-posed in Sobolev spaces when it is considered backward in time. Finally, we prove that, in the critical case (one conservative and one dissipative derivative), ‖(t) is uniformly bounded in terms of the initial data for sufficiently large pressure forces.
A simple, approximate model of parachute inflation
Macha, J.M.
1992-01-01
A simple, approximate model of parachute inflation is described. The model is based on the traditional, practical treatment of the fluid resistance of rigid bodies in nonsteady flow, with appropriate extensions to accommodate the change in canopy inflated shape. Correlations for the steady drag and steady radial force as functions of the inflated radius are required as input to the dynamic model. In a novel approach, the radial force is expressed in terms of easily obtainable drag and reefing fine tension measurements. A series of wind tunnel experiments provides the needed correlations. Coefficients associated with the added mass of fluid are evaluated by calibrating the model against an extensive and reliable set of flight data. A parameter is introduced which appears to universally govern the strong dependence of the axial added mass coefficient on motion history. Through comparisons with flight data, the model is shown to realistically predict inflation forces for ribbon and ringslot canopies over a wide range of sizes and deployment conditions.
A simple, approximate model of parachute inflation
Macha, J.M.
1992-11-01
A simple, approximate model of parachute inflation is described. The model is based on the traditional, practical treatment of the fluid resistance of rigid bodies in nonsteady flow, with appropriate extensions to accommodate the change in canopy inflated shape. Correlations for the steady drag and steady radial force as functions of the inflated radius are required as input to the dynamic model. In a novel approach, the radial force is expressed in terms of easily obtainable drag and reefing fine tension measurements. A series of wind tunnel experiments provides the needed correlations. Coefficients associated with the added mass of fluid are evaluated by calibrating the model against an extensive and reliable set of flight data. A parameter is introduced which appears to universally govern the strong dependence of the axial added mass coefficient on motion history. Through comparisons with flight data, the model is shown to realistically predict inflation forces for ribbon and ringslot canopies over a wide range of sizes and deployment conditions.
NASA Astrophysics Data System (ADS)
Kim, SungKun; Lee, Hunpyo
2017-06-01
Via a dynamical cluster approximation with N c = 4 in combination with a semiclassical approximation (DCA+SCA), we study the doped two-dimensional Hubbard model. We obtain a plaquette antiferromagnetic (AF) Mott insulator, a plaquette AF ordered metal, a pseudogap (or d-wave superconductor) and a paramagnetic metal by tuning the doping concentration. These features are similar to the behaviors observed in copper-oxide superconductors and are in qualitative agreement with the results calculated by the cluster dynamical mean field theory with the continuous-time quantum Monte Carlo (CDMFT+CTQMC) approach. The results of our DCA+SCA differ from those of the CDMFT+CTQMC approach in that the d-wave superconducting order parameters are shown even in the high doped region, unlike the results of the CDMFT+CTQMC approach. We think that the strong plaquette AF orderings in the dynamical cluster approximation (DCA) with N c = 4 suppress superconducting states with increasing doping up to strongly doped region, because frozen dynamical fluctuations in a semiclassical approximation (SCA) approach are unable to destroy those orderings. Our calculation with short-range spatial fluctuations is initial research, because the SCA can manage long-range spatial fluctuations in feasible computational times beyond the CDMFT+CTQMC tool. We believe that our future DCA+SCA calculations should supply information on the fully momentum-resolved physical properties, which could be compared with the results measured by angle-resolved photoemission spectroscopy experiments.
Coronal Loops: Evolving Beyond the Isothermal Approximation
NASA Astrophysics Data System (ADS)
Schmelz, J. T.; Cirtain, J. W.; Allen, J. D.
2002-05-01
Are coronal loops isothermal? A controversy over this question has arisen recently because different investigators using different techniques have obtained very different answers. Analysis of SOHO-EIT and TRACE data using narrowband filter ratios to obtain temperature maps has produced several key publications that suggest that coronal loops may be isothermal. We have constructed a multi-thermal distribution for several pixels along a relatively isolated coronal loop on the southwest limb of the solar disk using spectral line data from SOHO-CDS taken on 1998 Apr 20. These distributions are clearly inconsistent with isothermal plasma along either the line of sight or the length of the loop, and suggested rather that the temperature increases from the footpoints to the loop top. We speculated originally that these differences could be attributed to pixel size -- CDS pixels are larger, and more `contaminating' material would be expected along the line of sight. To test this idea, we used CDS iron line ratios from our data set to mimic the isothermal results from the narrowband filter instruments. These ratios indicated that the temperature gradient along the loop was flat, despite the fact that a more complete analysis of the same data showed this result to be false! The CDS pixel size was not the cause of the discrepancy; rather, the problem lies with the isothermal approximation used in EIT and TRACE analysis. These results should serve as a strong warning to anyone using this simplistic method to obtain temperature. This warning is echoed on the EIT web page: ``Danger! Enter at your own risk!'' In other words, values for temperature may be found, but they may have nothing to do with physical reality. Solar physics research at the University of Memphis is supported by NASA grant NAG5-9783. This research was funded in part by the NASA/TRACE MODA grant for Montana State University.
Bond selective chemistry beyond the adiabatic approximation
Butler, L.J.
1993-12-01
One of the most important challenges in chemistry is to develop predictive ability for the branching between energetically allowed chemical reaction pathways. Such predictive capability, coupled with a fundamental understanding of the important molecular interactions, is essential to the development and utilization of new fuels and the design of efficient combustion processes. Existing transition state and exact quantum theories successfully predict the branching between available product channels for systems in which each reaction coordinate can be adequately described by different paths along a single adiabatic potential energy surface. In particular, unimolecular dissociation following thermal, infrared multiphoton, or overtone excitation in the ground state yields a branching between energetically allowed product channels which can be successfully predicted by the application of statistical theories, i.e. the weakest bond breaks. (The predictions are particularly good for competing reactions in which when there is no saddle point along the reaction coordinates, as in simple bond fission reactions.) The predicted lack of bond selectivity results from the assumption of rapid internal vibrational energy redistribution and the implicit use of a single adiabatic Born-Oppenheimer potential energy surface for the reaction. However, the adiabatic approximation is not valid for the reaction of a wide variety of energetic materials and organic fuels; coupling between the electronic states of the reacting species play a a key role in determining the selectivity of the chemical reactions induced. The work described below investigated the central role played by coupling between electronic states in polyatomic molecules in determining the selective branching between energetically allowed fragmentation pathways in two key systems.
Generalized stationary phase approximations for mountain waves
NASA Astrophysics Data System (ADS)
Knight, H.; Broutman, D.; Eckermann, S. D.
2016-04-01
Large altitude asymptotic approximations are derived for vertical displacements due to mountain waves generated by hydrostatic wind flow over arbitrary topography. This leads to new asymptotic analytic expressions for wave-induced vertical displacement for mountains with an elliptical Gaussian shape and with the major axis oriented at any angle relative to the background wind. The motivation is to understand local maxima in vertical displacement amplitude at a given height for elliptical mountains aligned at oblique angles to the wind direction, as identified in Eckermann et al. ["Effects of horizontal geometrical spreading on the parameterization of orographic gravity-wave drag. Part 1: Numerical transform solutions," J. Atmos. Sci. 72, 2330-2347 (2015)]. The standard stationary phase method reproduces one type of local amplitude maximum that migrates downwind with increasing altitude. Another type of local amplitude maximum stays close to the vertical axis over the center of the mountain, and a new generalized stationary phase method is developed to describe this other type of local amplitude maximum and the horizontal variation of wave-induced vertical displacement near the vertical axis of the mountain in the large altitude limit. The new generalized stationary phase method describes the asymptotic behavior of integrals where the asymptotic parameter is raised to two different powers (1/2 and 1) rather than just one power as in the standard stationary phase method. The vertical displacement formulas are initially derived assuming a uniform background wind but are extended to accommodate both vertical shear with a fixed wind direction and vertical variations in the buoyancy frequency.
Rapid approximate inversion of airborne TEM
NASA Astrophysics Data System (ADS)
Fullagar, Peter K.; Pears, Glenn A.; Reid, James E.; Schaa, Ralf
2015-11-01
Rapid interpretation of large airborne transient electromagnetic (ATEM) datasets is highly desirable for timely decision-making in exploration. Full solution 3D inversion of entire airborne electromagnetic (AEM) surveys is often still not feasible on current day PCs. Therefore, two algorithms to perform rapid approximate 3D interpretation of AEM have been developed. The loss of rigour may be of little consequence if the objective of the AEM survey is regional reconnaissance. Data coverage is often quasi-2D rather than truly 3D in such cases, belying the need for `exact' 3D inversion. Incorporation of geological constraints reduces the non-uniqueness of 3D AEM inversion. Integrated interpretation can be achieved most readily when inversion is applied to a geological model, attributed with lithology as well as conductivity. Geological models also offer several practical advantages over pure property models during inversion. In particular, they permit adjustment of geological boundaries. In addition, optimal conductivities can be determined for homogeneous units. Both algorithms described here can operate on geological models; however, they can also perform `unconstrained' inversion if the geological context is unknown. VPem1D performs 1D inversion at each ATEM data location above a 3D model. Interpretation of cover thickness is a natural application; this is illustrated via application to Spectrem data from central Australia. VPem3D performs 3D inversion on time-integrated (resistive limit) data. Conversion to resistive limits delivers a massive increase in speed since the TEM inverse problem reduces to a quasi-magnetic problem. The time evolution of the decay is lost during the conversion, but the information can be largely recovered by constructing a starting model from conductivity depth images (CDIs) or 1D inversions combined with geological constraints if available. The efficacy of the approach is demonstrated on Spectrem data from Brazil. Both separately and in
Approximate nearest neighbors via dictionary learning
NASA Astrophysics Data System (ADS)
Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2011-06-01
Approximate Nearest Neighbors (ANN) in high dimensional vector spaces is a fundamental, yet challenging problem in many areas of computer science, including computer vision, data mining and robotics. In this work, we investigate this problem from the perspective of compressive sensing, especially the dictionary learning aspect. High dimensional feature vectors are seldom seen to be sparse in the feature domain; examples include, but not limited to Scale Invariant Feature Transform (SIFT) descriptors, Histogram Of Gradients, Shape Contexts, etc. Compressive sensing advocates that if a given vector has a dense support in a feature space, then there should exist an alternative high dimensional subspace where the features are sparse. This idea is leveraged by dictionary learning techniques through learning an overcomplete projection from the feature space so that the vectors are sparse in the new space. The learned dictionary aids in refining the search for the nearest neighbors to a query feature vector into the most likely subspace combination indexed by its non-zero active basis elements. Since the size of the dictionary is generally very large, distinct feature vectors are most likely to have distinct non-zero basis. Utilizing this observation, we propose a novel representation of the feature vectors as tuples of non-zero dictionary indices, which then reduces the ANN search problem into hashing the tuples to an index table; thereby dramatically improving the speed of the search. A drawback of this naive approach is that it is very sensitive to feature perturbations. This can be due to two possibilities: (i) the feature vectors are corrupted by noise, (ii) the true data vectors undergo perturbations themselves. Existing dictionary learning methods address the first possibility. In this work we investigate the second possibility and approach it from a robust optimization perspective. This boils down to the problem of learning a dictionary robust to feature
A comparison of approximate interval estimators for the Bernoulli parameter
NASA Technical Reports Server (NTRS)
Leemis, Lawrence; Trivedi, Kishor S.
1993-01-01
The goal of this paper is to compare the accuracy of two approximate confidence interval estimators for the Bernoulli parameter p. The approximate confidence intervals are based on the normal and Poisson approximations to the binomial distribution. Charts are given to indicate which approximation is appropriate for certain sample sizes and point estimators.
Testing approximations for non-linear gravitational clustering
NASA Technical Reports Server (NTRS)
Coles, Peter; Melott, Adrian L.; Shandarin, Sergei F.
1993-01-01
The accuracy of various analytic approximations for following the evolution of cosmological density fluctuations into the nonlinear regime is investigated. The Zel'dovich approximation is found to be consistently the best approximation scheme. It is extremely accurate for power spectra characterized by n = -1 or less; when the approximation is 'enhanced' by truncating highly nonlinear Fourier modes the approximation is excellent even for n = +1. The performance of linear theory is less spectrum-dependent, but this approximation is less accurate than the Zel'dovich one for all cases because of the failure to treat dynamics. The lognormal approximation generally provides a very poor fit to the spatial pattern.
Program Determines Minimum-State Approximations To Unsteady Aerodynamic Forces
NASA Technical Reports Server (NTRS)
Karpel, Mordechay; Hoadley, Sherwood T.
1993-01-01
MIST implements minimum-state method for determining rational approximations of matrix of aerodynamic force coefficients. Accepts complex tabular data representing generalized unsteady aerodynamic forces over set of reduced frequencies. Determines approximations to tabular data in Laplace domain by use of rational functions. Provides capability to select coefficients of denominator in rational approximations, to constrain approximation selectably without increasing size of problem, and determines and emphasizes criticial frequency ranges in determining approximations. Written in ANSI FORTRAN 77.
NASA Astrophysics Data System (ADS)
Lanzerotti, L. J.; Maclennan, C. G.; Gold, R. E.; Armstrong, T. P.; Roelof, E. C.; Krimigis, S. M.; Simnett, G. M.; Sarris, E. T.; Anderson, K. A.; Pick, M.
1995-02-01
We report measurements of the oxygen component (0.5 - 22 MeV/nucl) of the interplanetary cosmic ray flux as a function of heliolatitude. The measurements reported here were made with the Wart telescope of the Heliosphere Instrument for Spectra, Composition, and Anisotropy at Low Energies (HI-SCALE) low energy particle instrument on the Ulysses spacecraft as the spacecraft climbed from approximately 24 deg to approximately 64 deg south solar heliolatitude during 1993 and early 1994. As a function of heliolatitude, the O abundance at 2-2.8 MeV/nucl drops sharply at latitudes above the heliospheric current sheet. The oxygen spectrum obtained above the current sheet has a broad peak centered at an energy of approximately 2.5 MeV/nucl that is the anomalous O component at these latitudes. There is little evidence for a latitude dependence in the anomalous O fluxes as measured above the current sheet. Within the heliospheric current sheet, the O measurements are composed of both solar and anomalous origin particles.
Differential equation based method for accurate approximations in optimization
NASA Technical Reports Server (NTRS)
Pritchard, Jocelyn I.; Adelman, Howard M.
1990-01-01
A method to efficiently and accurately approximate the effect of design changes on structural response is described. The key to this method is to interpret sensitivity equations as differential equations that may be solved explicitly for closed form approximations, hence, the method is denoted the Differential Equation Based (DEB) method. Approximations were developed for vibration frequencies, mode shapes and static displacements. The DEB approximation method was applied to a cantilever beam and results compared with the commonly-used linear Taylor series approximations and exact solutions. The test calculations involved perturbing the height, width, cross-sectional area, tip mass, and bending inertia of the beam. The DEB method proved to be very accurate, and in most cases, was more accurate than the linear Taylor series approximation. The method is applicable to simultaneous perturbation of several design variables. Also, the approximations may be used to calculate other system response quantities. For example, the approximations for displacements are used to approximate bending stresses.
Saddlepoint approximations for small sample logistic regression problems.
Platt, R W
2000-02-15
Double saddlepoint approximations provide quick and accurate approximations to exact conditional tail probabilities in a variety of situations. This paper describes the use of these approximations in two logistic regression problems. An investigation of regression analysis of the log-odds ratio in a sequence or set of 2x2 tables via simulation studies shows that in practical settings the saddlepoint methods closely approximate exact conditional inference. The double saddlepoint approximation in the test for trend in a sequence of binomial random variates is also shown, via simulation studies, to be an effective approximation to exact conditional inference.
Sun, Bo; Zhang, Ping; Zhao, Xian-Geng
2008-02-28
The electronic structure and properties of PuO2 and Pu2O3 have been studied from first principles by the all-electron projector-augmented-wave method. The local density approximation+U and the generalized gradient approximation+U formalisms have been used to account for the strong on-site Coulomb repulsion among the localized Pu 5f electrons. We discuss how the properties of PuO2 and Pu2O3 are affected by the choice of U as well as the choice of exchange-correlation potential. Also, oxidation reaction of Pu2O3, leading to formation of PuO2, and its dependence on U and exchange-correlation potential have been studied. Our results show that by choosing an appropriate U, it is promising to correctly and consistently describe structural, electronic, and thermodynamic properties of PuO2 and Pu2O3, which enable the modeling of redox process involving Pu-based materials possible.
NASA Astrophysics Data System (ADS)
Peng, Degao; Yang, Yang; Zhang, Peng; Yang, Weitao
2014-12-01
In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N4). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as < hat{S}2rangle are also developed and tested.
Peng, Degao; Yang, Yang; Zhang, Peng; Yang, Weitao
2014-12-07
In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N(4)). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as ⟨Ŝ(2)⟩ are also developed and tested.
Peng, Degao; Yang, Yang; Zhang, Peng; Yang, Weitao
2014-12-07
In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N{sup 4}). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as 〈S{sup ^2}〉 are also developed and tested.
Difference equation state approximations for nonlinear hereditary control problems
NASA Technical Reports Server (NTRS)
Rosen, I. G.
1984-01-01
Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems. Previously announced in STAR as N83-33589
Difference equation state approximations for nonlinear hereditary control problems
NASA Technical Reports Server (NTRS)
Rosen, I. G.
1982-01-01
Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems.
Difference equation state approximations for nonlinear hereditary control problems
NASA Technical Reports Server (NTRS)
Rosen, I. G.
1984-01-01
Discrete approximation schemes for the solution of nonlinear hereditary control problems are constructed. The methods involve approximation by a sequence of optimal control problems in which the original infinite dimensional state equation has been approximated by a finite dimensional discrete difference equation. Convergence of the state approximations is argued using linear semigroup theory and is then used to demonstrate that solutions to the approximating optimal control problems in some sense approximate solutions to the original control problem. Two schemes, one based upon piecewise constant approximation, and the other involving spline functions are discussed. Numerical results are presented, analyzed and used to compare the schemes to other available approximation methods for the solution of hereditary control problems. Previously announced in STAR as N83-33589
View southwest; taxi office New Canaan Railroad Station, Approximately ...
View southwest; taxi office - New Canaan Railroad Station, Approximately 200 feet southwest of intersection of Park & Elm Streets & approximately 150 feet north of Pine Street, New Canaan, Fairfield County, CT
Normal and Feature Approximations from Noisy Point Clouds
2005-02-01
Normal and Feature Approximations from Noisy Point Clouds Tamal K. Dey Jian Sun Abstract We consider the problem of approximating normal and...normal and, in partic- ular, feature size approximations for noisy point clouds . In the noise-free case the choice of the Delaunay balls is not an issue...axis from noisy point clouds ex- ists [7]. This algorithm approximates the medial axis with Voronoi faces under a stringent uniform sampling
Pawlak algebra and approximate structure on fuzzy lattice.
Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai
2014-01-01
The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties.
Pawlak Algebra and Approximate Structure on Fuzzy Lattice
Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai
2014-01-01
The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties. PMID:25152922
The best uniform approximation of ellipse with degree two
NASA Astrophysics Data System (ADS)
Rababah, Abedallah; AlMeraj, Zainab
2017-07-01
A uniform quadratic approximation of degree 2 is created in explicit parametric form to represent elliptical arcs. The error function is identical to that of the Chebyshev polynomial of degree 4 and equioscillates five times with an approximation order of four. In this paper we provide the approximation method, show it is efficient, its error bound to be accurate and demonstrate that it satisfies properties of the best uniform approximation.
A new approximation method for stress constraints in structural synthesis
NASA Technical Reports Server (NTRS)
Vanderplaats, Garret N.; Salajegheh, Eysa
1987-01-01
A new approximation method for dealing with stress constraints in structural synthesis is presented. The finite element nodal forces are approximated and these are used to create an explicit, but often nonlinear, approximation to the original problem. The principal motivation is to create the best approximation possible, in order to reduce the number of detailed finite element analyses needed to reach the optimum. Examples are offered and compared with published results, to demonstrate the efficiency and reliability of the proposed method.
Meta-Regression Approximations to Reduce Publication Selection Bias
ERIC Educational Resources Information Center
Stanley, T. D.; Doucouliagos, Hristos
2014-01-01
Publication selection bias is a serious challenge to the integrity of all empirical sciences. We derive meta-regression approximations to reduce this bias. Our approach employs Taylor polynomial approximations to the conditional mean of a truncated distribution. A quadratic approximation without a linear term, precision-effect estimate with…
43 CFR 2650.5-2 - Rule of approximation.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 43 Public Lands: Interior 2 2011-10-01 2011-10-01 false Rule of approximation. 2650.5-2 Section 2650.5-2 Public Lands: Interior Regulations Relating to Public Lands (Continued) BUREAU OF LAND... Selections: Generally § 2650.5-2 Rule of approximation. To assure full entitlement, the rule of approximation...
Meta-Regression Approximations to Reduce Publication Selection Bias
ERIC Educational Resources Information Center
Stanley, T. D.; Doucouliagos, Hristos
2014-01-01
Publication selection bias is a serious challenge to the integrity of all empirical sciences. We derive meta-regression approximations to reduce this bias. Our approach employs Taylor polynomial approximations to the conditional mean of a truncated distribution. A quadratic approximation without a linear term, precision-effect estimate with…
Explicitly solvable complex Chebyshev approximation problems related to sine polynomials
NASA Technical Reports Server (NTRS)
Freund, Roland
1989-01-01
Explicitly solvable real Chebyshev approximation problems on the unit interval are typically characterized by simple error curves. A similar principle is presented for complex approximation problems with error curves induced by sine polynomials. As an application, some new explicit formulae for complex best approximations are derived.
Discrete extrinsic curvatures and approximation of surfaces by polar polyhedra
NASA Astrophysics Data System (ADS)
Garanzha, V. A.
2010-01-01
Duality principle for approximation of geometrical objects (also known as Eu-doxus exhaustion method) was extended and perfected by Archimedes in his famous tractate “Measurement of circle”. The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygons (polyhedra) which approximate curvilinear convex body. This sequence allows to approximate length of curve, as well as area and volume of the bodies and to obtain error estimates for approximation. In this work it is shown that a sequence of pairs of locally polar polyhedra allows to construct piecewise-affine approximation to spherical Gauss map, to construct convergent point-wise approximations to mean and Gauss curvature, as well as to obtain natural discretizations of bending energies. The Suggested approach can be applied to nonconvex surfaces and in the case of multiple dimensions.
Minisuperspace quantization of bubbling AdS2×S2 geometries
NASA Astrophysics Data System (ADS)
Li, Qinglin
2017-01-01
We quantize the moduli space of supersymmetric microstates describing four-dimensional black holes with AdS2×S2 asymptotics. To acquire the commutation relations of quantization, we find the symplectic form that is imposed in the Type IIB supergravity and defined in the space of solutions parametrized by one complex harmonic function in R3 with sources distributed along closed curves.
Discontinuous Galerkin method based on non-polynomial approximation spaces
Yuan Ling . E-mail: lyuan@dam.brown.edu; Shu Chiwang . E-mail: shu@dam.brown.edu
2006-10-10
In this paper, we develop discontinuous Galerkin (DG) methods based on non-polynomial approximation spaces for numerically solving time dependent hyperbolic and parabolic and steady state hyperbolic and elliptic partial differential equations (PDEs). The algorithm is based on approximation spaces consisting of non-polynomial elementary functions such as exponential functions, trigonometric functions, etc., with the objective of obtaining better approximations for specific types of PDEs and initial and boundary conditions. It is shown that L {sup 2} stability and error estimates can be obtained when the approximation space is suitably selected. It is also shown with numerical examples that a careful selection of the approximation space to fit individual PDE and initial and boundary conditions often provides more accurate results than the DG methods based on the polynomial approximation spaces of the same order of accuracy.
The selection of approximating functions for tabulated numerical data
NASA Technical Reports Server (NTRS)
Ingram, H. L.; Hooker, W. R.
1972-01-01
A computer program was developed that selects, from a list of candidate functions, the approximating functions and associated coefficients which result in the best curve fit of a given set of numerical data. The advantages of the approach used here are: (1) Multivariable approximations can be performed. (2) Flexibility with respect to the type of approximations used is available. (3) The program is designed to choose the best terms to be used in the approximation from an arbitrary list of possible terms so that little knowledge of the proper approximating form is required. (4) Recursion relations are used in determining the coefficients of the approximating functions, which reduces the computer execution time of the program.
On approximating hereditary dynamics by systems of ordinary differential equations
NASA Technical Reports Server (NTRS)
Cliff, E. M.; Burns, J. A.
1978-01-01
The paper deals with methods of obtaining approximate solutions to linear retarded functional differential equations (hereditary systems). The basic notion is to project the infinite dimensional space of initial functions for the hereditary system onto a finite dimensional subspace. Within this framework, two particular schemes are discussed. The first uses well-known piecewise constant approximations, while the second is a new method based on piecewise linear approximating functions. Numerical results are given.
A piecewise linear approximation scheme for hereditary optimal control problems
NASA Technical Reports Server (NTRS)
Cliff, E. M.; Burns, J. A.
1977-01-01
An approximation scheme based on 'piecewise linear' approximations of L2 spaces is employed to formulate a numerical method for solving quadratic optimal control problems governed by linear retarded functional differential equations. This piecewise linear method is an extension of the so called averaging technique. It is shown that the Riccati equation for the linear approximation is solved by simple transformation of the averaging solution. Thus, the computational requirements are essentially the same. Numerical results are given.
On approximating hereditary dynamics by systems of ordinary differential equations
NASA Technical Reports Server (NTRS)
Cliff, E. M.; Burns, J. A.
1978-01-01
The paper deals with methods of obtaining approximate solutions to linear retarded functional differential equations (hereditary systems). The basic notion is to project the infinite dimensional space of initial functions for the hereditary system onto a finite dimensional subspace. Within this framework, two particular schemes are discussed. The first uses well-known piecewise constant approximations, while the second is a new method based on piecewise linear approximating functions. Numerical results are given.
NEW APPROACHES: Analysis, graphs, approximations: a toolbox for solving problems
NASA Astrophysics Data System (ADS)
Newburgh, Ronald
1997-11-01
A simple kinematic problem is solved by using three different techniques - analysis, graphs and approximations. Using three different techniques is pedagogically sound for it leads the student to the realization that the physics of a problem rather than the solution technique is the more important for understanding. The approximation technique is a modification of the Newton - Raphson method but is considerably simpler, avoiding calculation of derivatives. It also offers an opportunity to introduce approximation techniques at the very beginning of physics study.
The Approximability of Learning and Constraint Satisfaction Problems
2010-10-07
The Approximability of Learning and Constraint Satisfaction Problems Yi Wu CMU-CS-10-142 October 7, 2010 School of Computer Science Carnegie Mellon...00-00-2010 to 00-00-2010 4. TITLE AND SUBTITLE The Approximability of Learning and Constraint Satisfaction Problems 5a. CONTRACT NUMBER 5b...approximability of two classes of NP-hard problems: Constraint Satisfaction Problems (CSPs) and Computational Learning Problems. For CSPs, we mainly study the
Approximate analytical calculations of photon geodesics in the Schwarzschild metric
NASA Astrophysics Data System (ADS)
De Falco, Vittorio; Falanga, Maurizio; Stella, Luigi
2016-10-01
We develop a method for deriving approximate analytical formulae to integrate photon geodesics in a Schwarzschild spacetime. Based on this, we derive the approximate equations for light bending and propagation delay that have been introduced empirically. We then derive for the first time an approximate analytical equation for the solid angle. We discuss the accuracy and range of applicability of the new equations and present a few simple applications of them to known astrophysical problems.
A piecewise linear approximation scheme for hereditary optimal control problems
NASA Technical Reports Server (NTRS)
Cliff, E. M.; Burns, J. A.
1977-01-01
An approximation scheme based on 'piecewise linear' approximations of L2 spaces is employed to formulate a numerical method for solving quadratic optimal control problems governed by linear retarded functional differential equations. This piecewise linear method is an extension of the so called averaging technique. It is shown that the Riccati equation for the linear approximation is solved by simple transformation of the averaging solution. Thus, the computational requirements are essentially the same. Numerical results are given.
Penalty Approximation for Non-smooth Constraints in Vibroimpact
NASA Astrophysics Data System (ADS)
Paoli, Lætitia; Schatzman, Michelle
2001-12-01
We examine the penalty approximation of the free motion of a material point in an angular domain; we choose an over-damped penalty approximation, and we prove that if the first impact point is not at the vertex, then the limit of the approximation exists and is described by Moreau's rule for inelastic impacts. The proofs rely on validated asymptotics and use some classical tools of the theory of dynamical systems.
Differential equation based method for accurate approximations in optimization
NASA Technical Reports Server (NTRS)
Pritchard, Jocelyn I.; Adelman, Howard M.
1990-01-01
This paper describes a method to efficiently and accurately approximate the effect of design changes on structural response. The key to this new method is to interpret sensitivity equations as differential equations that may be solved explicitly for closed form approximations, hence, the method is denoted the Differential Equation Based (DEB) method. Approximations were developed for vibration frequencies, mode shapes and static displacements. The DEB approximation method was applied to a cantilever beam and results compared with the commonly-used linear Taylor series approximations and exact solutions. The test calculations involved perturbing the height, width, cross-sectional area, tip mass, and bending inertia of the beam. The DEB method proved to be very accurate, and in msot cases, was more accurate than the linear Taylor series approximation. The method is applicable to simultaneous perturbation of several design variables. Also, the approximations may be used to calculate other system response quantities. For example, the approximations for displacement are used to approximate bending stresses.
Monotonically improving approximate answers to relational algebra queries
NASA Technical Reports Server (NTRS)
Smith, Kenneth P.; Liu, J. W. S.
1989-01-01
We present here a query processing method that produces approximate answers to queries posed in standard relational algebra. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy enables us to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes appromimate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.
Approximation functions for airblast environments from buried charges
Reichenbach, H.; Behrens, K.; Kuhl, A.L.
1993-11-01
In EMI report E 1/93, ``Airblast Environments from Buried HE-Charges,`` fit functions were used for the compact description of blastwave parameters. The coefficients of these functions were approximated by means of second order polynomials versus DOB. In most cases, the agreement with the measured data was satisfactory; to reduce remaining noticeable deviations, an approximation by polygons (i.e., piecewise-linear approximation) was used instead of polynomials. The present report describes the results of the polygon approximation and compares them to previous data. We conclude that the polygon representation leads to a better agreement with the measured data.
Impact of inflow transport approximation on light water reactor analysis
NASA Astrophysics Data System (ADS)
Choi, Sooyoung; Smith, Kord; Lee, Hyun Chul; Lee, Deokjung
2015-10-01
The impact of the inflow transport approximation on light water reactor analysis is investigated, and it is verified that the inflow transport approximation significantly improves the accuracy of the transport and transport/diffusion solutions. A methodology for an inflow transport approximation is implemented in order to generate an accurate transport cross section. The inflow transport approximation is compared to the conventional methods, which are the consistent-PN and the outflow transport approximations. The three transport approximations are implemented in the lattice physics code STREAM, and verification is performed for various verification problems in order to investigate their effects and accuracy. From the verification, it is noted that the consistent-PN and the outflow transport approximations cause significant error in calculating the eigenvalue and the power distribution. The inflow transport approximation shows very accurate and precise results for the verification problems. The inflow transport approximation shows significant improvements not only for the high leakage problem but also for practical large core problem analyses.
How to Solve Schroedinger Problems by Approximating the Potential Function
Ledoux, Veerle; Van Daele, Marnix
2010-09-30
We give a survey over the efforts in the direction of solving the Schroedinger equation by using piecewise approximations of the potential function. Two types of approximating potentials have been considered in the literature, that is piecewise constant and piecewise linear functions. For polynomials of higher degree the approximating problem is not so easy to integrate analytically. This obstacle can be circumvented by using a perturbative approach to construct the solution of the approximating problem, leading to the so-called piecewise perturbation methods (PPM). We discuss the construction of a PPM in its most convenient form for applications and show that different PPM versions (CPM,LPM) are in fact equivalent.
An approximation based global optimization strategy for structural synthesis
NASA Technical Reports Server (NTRS)
Sepulveda, A. E.; Schmit, L. A.
1991-01-01
A global optimization strategy for structural synthesis based on approximation concepts is presented. The methodology involves the solution of a sequence of highly accurate approximate problems using a global optimization algorithm. The global optimization algorithm implemented consists of a branch and bound strategy based on the interval evaluation of the objective function and constraint functions, combined with a local feasible directions algorithm. The approximate design optimization problems are constructed using first order approximations of selected intermediate response quantities in terms of intermediate design variables. Some numerical results for example problems are presented to illustrate the efficacy of the design procedure setforth.
Neural networks for functional approximation and system identification.
Mhaskar, H N; Hahm, N
1997-01-01
We construct generalized translation networks to approximate uniformly a class of nonlinear, continuous functionals defined on Lp ([-1, 1]s) for integer s > or = 1, 1 < or = p < infinity, or C ([-1, 1]s). We obtain lower bounds on the possible order of approximation for such functionals in terms of any approximation process depending continuously on a given number of parameters. Our networks almost achieve this order of approximation in terms of the number of parameters (neurons) involved in the network. The training is simple and noniterative; in particular, we avoid any optimization such as that involved in the usual backpropagation.
On polyhedral approximations in an n-dimensional space
NASA Astrophysics Data System (ADS)
Balashov, M. V.
2016-10-01
The polyhedral approximation of a positively homogeneous (and, in general, nonconvex) function on a unit sphere is investigated. Such a function is presupporting (i.e., its convex hull is the supporting function) for a convex compact subset of R n . The considered polyhedral approximation of this function provides a polyhedral approximation of this convex compact set. The best possible estimate for the error of the considered approximation is obtained in terms of the modulus of uniform continuous subdifferentiability in the class of a priori grids of given step in the Hausdorff metric.
Angular Distributions of Synchrotron Radiation in the Nonrelativistic Approximation
NASA Astrophysics Data System (ADS)
Bagrov, V. G.; Loginov, A. S.
2017-03-01
The angular distribution functions of the polarized components of synchrotron radiation in the nonrelativistic approximation are investigated using methods of classical and quantum theory. Particles of zero spin (bosons) and spin 1/2 (electrons) are considered in the quantum theory. It is shown that in the first nonzero approximation the angular distribution functions, calculated by methods of classical and quantum theory, coincide identically. Quantum corrections to the angular distribution functions appear only in the subsequent approximation whereas the total radiated power contains quantum and spin corrections already in the first approximation.
Spatial Ability Explains the Male Advantage in Approximate Arithmetic
Wei, Wei; Chen, Chuansheng; Zhou, Xinlin
2016-01-01
Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former’s advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is closely associated with visuospatial processing, which shows a male advantage we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experiment 1 and 554 college students in Experiment 2), we found that males showed better performance in approximate arithmetic, which was accounted for by gender differences in spatial ability. PMID:27014124
Spatial Ability Explains the Male Advantage in Approximate Arithmetic.
Wei, Wei; Chen, Chuansheng; Zhou, Xinlin
2016-01-01
Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former's advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is closely associated with visuospatial processing, which shows a male advantage we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experiment 1 and 554 college students in Experiment 2), we found that males showed better performance in approximate arithmetic, which was accounted for by gender differences in spatial ability.
Sensitivity analysis and approximation methods for general eigenvalue problems
NASA Technical Reports Server (NTRS)
Murthy, D. V.; Haftka, R. T.
1986-01-01
Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.
Differential equation based method for accurate approximations in optimization
NASA Technical Reports Server (NTRS)
Pritchard, Jocelyn I.; Adelman, Howard M.
1990-01-01
This paper describes a method to efficiently and accurately approximate the effect of design changes on structural response. The key to this new method is to interpret sensitivity equations as differential equations that may be solved explicitly for closed form approximations, hence, the method is denoted the Differential Equation Based (DEB) method. Approximations were developed for vibration frequencies, mode shapes and static displacements. The DEB approximation method was applied to a cantilever beam and results compared with the commonly-used linear Taylor series approximations and exact solutions. The test calculations involved perturbing the height, width, cross-sectional area, tip mass, and bending inertia of the beam. The DEB method proved to be very accurate, and in msot cases, was more accurate than the linear Taylor series approximation. The method is applicable to simultaneous perturbation of several design variables. Also, the approximations may be used to calculate other system response quantities. For example, the approximations for displacement are used to approximate bending stresses.
Padé approximants of the Mittag-Leffler functions
NASA Astrophysics Data System (ADS)
Starovoitov, A. P.; Starovoitova, N. A.
2007-08-01
It is shown that for m\\le n the Padé approximants \\{\\pi_{n,m}(\\,\\cdot\\,;F_{\\gamma})\\}, which locally deliver the best rational approximations to the Mittag-Leffler functions F_\\gamma, approximate the F_\\gamma as n\\to\\infty uniformly on the compact set D=\\{z:\\vert z\\vert\\le1\\} at a rate asymptotically equal to the best possible one. In particular, analogues of the well-known results of Braess and Trefethen relating to the approximation of \\exp{z} are proved for the Mittag-Leffler functions. Bibliography: 28 titles.
Better approximation guarantees for job-shop scheduling
Goldberg, L.A.; Paterson, M.; Srinivasan, A.
1997-06-01
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein & Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work, and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.
Orthogonal polynomial approximation in higher dimensions: Applications in astrodynamics
NASA Astrophysics Data System (ADS)
Bani Younes, Ahmad Hani Abd Alqader
We propose novel methods to utilize orthogonal polynomial approximation in higher dimension spaces, which enable us to modify classical differential equation solvers to perform high precision, long-term orbit propagation. These methods have immediate application to efficient propagation of catalogs of Resident Space Objects (RSOs) and improved accounting for the uncertainty in the ephemeris of these objects. More fundamentally, the methodology promises to be of broad utility in solving initial and two point boundary value problems from a wide class of mathematical representations of problems arising in engineering, optimal control, physical sciences and applied mathematics. We unify and extend classical results from function approximation theory and consider their utility in astrodynamics. Least square approximation, using the classical Chebyshev polynomials as basis functions, is reviewed for discrete samples of the to-be-approximated function. We extend the orthogonal approximation ideas to n-dimensions in a novel way, through the use of array algebra and Kronecker operations. Approximation of test functions illustrates the resulting algorithms and provides insight into the errors of approximation, as well as the associated errors arising when the approximations are differentiated or integrated. Two sets of applications are considered that are challenges in astrodynamics. The first application addresses local approximation of high degree and order geopotential models, replacing the global spherical harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. A method is introduced which adapts the approximation degree radially, compatible with the truth that the highest degree approximations (to ensure maximum acceleration error < 10-9 ms-2, globally) are required near the Earths surface, whereas lower degree approximations are required as radius increases. We show that a four order of magnitude speedup is
Legendre-Tau approximations for functional differential equations
NASA Technical Reports Server (NTRS)
Ito, K.; Teglas, R.
1983-01-01
The numerical approximation of solutions to linear functional differential equations are considered using the so called Legendre tau method. The functional differential equation is first reformulated as a partial differential equation with a nonlocal boundary condition involving time differentiation. The approximate solution is then represented as a truncated Legendre series with time varying coefficients which satisfy a certain system of ordinary differential equations. The method is very easy to code and yields very accurate approximations. Convergence is established, various numerical examples are presented, and comparison between the latter and cubic spline approximations is made.
Cosmic shear covariance: the log-normal approximation
NASA Astrophysics Data System (ADS)
Hilbert, S.; Hartlap, J.; Schneider, P.
2011-12-01
Context. Accurate estimates of the errors on the cosmological parameters inferred from cosmic shear surveys require accurate estimates of the covariance of the cosmic shear correlation functions. Aims: We seek approximations to the cosmic shear covariance that are as easy to use as the common approximations based on normal (Gaussian) statistics, but yield more accurate covariance matrices and parameter errors. Methods: We derive expressions for the cosmic shear covariance under the assumption that the underlying convergence field follows log-normal statistics. We also derive a simplified version of this log-normal approximation by only retaining the most important terms beyond normal statistics. We use numerical simulations of weak lensing to study how well the normal, log-normal, and simplified log-normal approximations as well as empirical corrections to the normal approximation proposed in the literature reproduce shear covariances for cosmic shear surveys. We also investigate the resulting confidence regions for cosmological parameters inferred from such surveys. Results: We find that the normal approximation substantially underestimates the cosmic shear covariances and the inferred parameter confidence regions, in particular for surveys with small fields of view and large galaxy densities, but also for very wide surveys. In contrast, the log-normal approximation yields more realistic covariances and confidence regions, but also requires evaluating slightly more complicated expressions. However, the simplified log-normal approximation, although as simple as the normal approximation, yields confidence regions that are almost as accurate as those obtained from the log-normal approximation. The empirical corrections to the normal approximation do not yield more accurate covariances and confidence regions than the (simplified) log-normal approximation. Moreover, they fail to produce positive-semidefinite data covariance matrices in certain cases, rendering them
Embedding impedance approximations in the analysis of SIS mixers
NASA Technical Reports Server (NTRS)
Kerr, A. R.; Pan, S.-K.; Withington, S.
1992-01-01
Future millimeter-wave radio astronomy instruments will use arrays of many SIS receivers, either as focal plane arrays on individual radio telescopes, or as individual receivers on the many antennas of radio interferometers. Such applications will require broadband integrated mixers without mechanical tuners. To produce such mixers, it will be necessary to improve present mixer design techniques, most of which use the three-frequency approximation to Tucker's quantum mixer theory. This paper examines the adequacy of three approximations to Tucker's theory: (1) the usual three-frequency approximation which assumes a sinusoidal LO voltage at the junction, and a short-circuit at all frequencies above the upper sideband; (2) a five-frequency approximation which allows two LO voltage harmonics and five small-signal sidebands; and (3) a quasi five-frequency approximation in which five small-signal sidebands are allowed, but the LO voltage is assumed sinusoidal. These are compared with a full harmonic-Newton solution of Tucker's equations, including eight LO harmonics and their corresponding sidebands, for realistic SIS mixer circuits. It is shown that the accuracy of the three approximations depends strongly on the value of omega R(sub N)C for the SIS junctions used. For large omega R(sub N)C, all three approximations approach the eight-harmonic solution. For omega R(sub N)C values in the range 0.5 to 10, the range of most practical interest, the quasi five-frequency approximation is a considerable improvement over the three-frequency approximation, and should be suitable for much design work. For the realistic SIS mixers considered here, the five-frequency approximation gives results very close to those of the eight-harmonic solution. Use of these approximations, where appropriate, considerably reduces the computational effort needed to analyze an SIS mixer, and allows the design and optimization of mixers using a personal computer.
The Accuracy of Three Approximations for Test Reliability.
ERIC Educational Resources Information Center
Kleinke, David J.
Data from 200 college-level tests were used to compare three reliability approximations (two of Saupe and one of Cureton) to Kuder-Richardson Formula 20 (KR20). While the approximations correlated highly (about .9) with the reliability estimate, they tended to be underapproximations. The explanation lies in an apparent bias of Lord's approximation…
Reply to Steele & Ferrer: Modeling Oscillation, Approximately or Exactly?
ERIC Educational Resources Information Center
Oud, Johan H. L.; Folmer, Henk
2011-01-01
This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent version of the local linear approximation procedure…
Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation
ERIC Educational Resources Information Center
Gordon, Sheldon P.; Yang, Yajun
2017-01-01
This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…
Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation
ERIC Educational Resources Information Center
Gordon, Sheldon P.; Yang, Yajun
2017-01-01
This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…
Finding the Best Quadratic Approximation of a Function
ERIC Educational Resources Information Center
Yang, Yajun; Gordon, Sheldon P.
2011-01-01
This article examines the question of finding the best quadratic function to approximate a given function on an interval. The prototypical function considered is f(x) = e[superscript x]. Two approaches are considered, one based on Taylor polynomial approximations at various points in the interval under consideration, the other based on the fact…
Reply to Steele & Ferrer: Modeling Oscillation, Approximately or Exactly?
ERIC Educational Resources Information Center
Oud, Johan H. L.; Folmer, Henk
2011-01-01
This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent version of the local linear approximation procedure…
Convergence to approximate solutions and perturbation resilience of iterative algorithms
NASA Astrophysics Data System (ADS)
Reich, Simeon; Zaslavski, Alexander J.
2017-04-01
We first consider nonexpansive self-mappings of a metric space and study the asymptotic behavior of their inexact orbits. We then apply our results to the analysis of iterative methods for finding approximate fixed points of nonexpansive mappings and approximate zeros of monotone operators.
Approximation in LQG control of a thermoelastic rod
NASA Technical Reports Server (NTRS)
Gibson, J. S.; Rosen, I. G.; Tao, G.
1989-01-01
Control and estimator gains are computed for linear-quadratic-Gaussian (LQG) optimal control of the axial vibrations of a thermoelastic rod. The computations are based on a modal approximation of the partial differential equations representing the rod, and convergence of the approximations to control and estimator gains is the main issue.