Simple Lie groups without the approximation property
DEFF Research Database (Denmark)
Haagerup, Uffe; de Laat, Tim
2013-01-01
For a locally compact group G, let A(G) denote its Fourier algebra, and let M0A(G) denote the space of completely bounded Fourier multipliers on G. The group G is said to have the Approximation Property (AP) if the constant function 1 can be approximated by a net in A(G) in the weak-∗ topology...
Rice, Samara Lloyd; Tonigan, J Scott
2012-01-04
Social support for abstinence in Alcoholics Anonymous (AA) has been reported to be a consistent factor accounting for AA benefit. However, the nonspecific or unintended effects of such support remain poorly understood and rarely investigated. This prospective study investigated how one nonspecific factor-perceived AA group cohesiveness-predicted increased practice of AA-related behaviors. Findings indicated that impressions of AA group cohesion predicted increased AA attendance, the practice of prescribed AA activities, and self-reported AA usefulness. It appears that a sense of belongingness predicts subsequent engagement in the AA social network that, in turn, is predictive of increased abstinence.
The exact renormalization group and approximation solutions
Morris, T R
1994-01-01
We investigate the structure of Polchinski's formulation of the flow equations for the continuum Wilson effective action. Reinterpretations in terms of I.R. cutoff greens functions are given. A promising non-perturbative approximation scheme is derived by carefully taking the sharp cutoff limit and expanding in `irrelevancy' of operators. We illustrate with two simple models of four dimensional $\\lambda \\varphi^4$ theory: the cactus approximation, and a model incorporating the first irrelevant correction to the renormalized coupling. The qualitative and quantitative behaviour give confidence in a fuller use of this method for obtaining accurate results.
Introducing the AAS Working Group on Astroinformatics and Astrostatistics
Ivezic, Zeljko
2014-01-01
In response to two White Papers submitted to the Astro2010 Decadal Survey (1,2), a new AAS Working Group on Astroinformatics and Astrostatistics (WGAA) has been approved by the AAS Council at the 220th Meeting, June 2012, in Anchorage. The motivation for this WG is the growing importance of the interface between astronomy and various branches of applied mathematics, computer science and the emerging field of data science. With the new data-intensive projects envisioned for the coming decade, the need for advice derived from the focused attention of a group of AAS members who work in these areas is bound to increase. The Working Group is charged with spreading awareness of rapidly advancing computational techniques, sophsticated statistical methods, and highly capble software to further the goals of astronomical and astrophysical research. The three main strategic goals adopted by the WGAA Steering Committee for the next few years are to: (i) develop, organize and maintain methodological resources (such as software tools, papers, books, and lectures); (ii) enhance human resources (such as foster the creation of career paths, establish a Speakers' Bureau, establish and maintain an archived discussion forum, enable periodic news distribution); and (iii) organize topical meetings. The WGAA Steering Committee at this time includes twelve members: Kirk Borne, George Djorgovski, Eric Feigelson, Eric Ford, Alyssa Goodman, Joe Hilbe, Zeljko Ivezic (chair), Ashish Mahabal, Aneta Siemiginowska, Alex Szalay, Rick White, and Padma Yanamandra-Fisher. I will summarize our accomplishments since July 2012. (1) Astroinformatics: A 21st Century Approach to Astronomy (Borne & 90 coauthors), (2) The Astronomical Information Sciences: A Keystone for 21st-Century Astronomy (Loredo & 72 coauthors)
On Approximation of Lie Groups by Discrete Subgroups
Indian Academy of Sciences (India)
Hatem Hamrouni; Salah Souissi
2014-02-01
A locally compact group is said to be approximated by discrete sub-groups (in the sense of Tôyama) if there is a sequence of discrete subgroups of that converges to in the Chabauty topology (or equivalently, in the Vietoris topology). The notion of approximation of Lie groups by discrete subgroups was introduced by Tôyama in Kodai Math. Sem. Rep. 1 (1949) 36–37 and investigated in detail by Kuranishi in Nagoya Math. J. 2 (1951) 63–71. It is known as a theorem of Tôyama that any connected Lie group approximated by discrete subgroups is nilpotent. The converse, in general, does not hold. For example, a connected simply connected nilpotent Lie group is approximated by discrete subgroups if and only if has a rational structure. On the other hand, if is a discrete uniform subgroup of a connected, simply connected nilpotent Lie group then is approximated by discrete subgroups $_n$ containing . The proof of the above result is by induction on the dimension of , and gives an algorithm for inductively determining $_n$. The purpose of this paper is to give another proof in which we present an explicit formula for the sequence $(_n)_{n≥ 0}$ in terms of . Several applications are given.
Approximation Properties for Groups and von Neumann Algebras
DEFF Research Database (Denmark)
Knudby, Søren
The main topic of the thesis is approximation properties for locally compact groups with applications to operator algebras. In order to study the relationship between weak amenability and the Haagerup property, the weak Haagerup property and the weak Haagerup constant are introduced. The weak...
Multinorms and Approximate Amenability of Weighted Group Algebras
Directory of Open Access Journals (Sweden)
Saman Ghaderkhani
2014-01-01
Full Text Available Let G be a locally compact group, and take p,q with 1≤p,q<∞. We prove that, for any left (p,q-multiinvariant functional on L∞(G and for any weight function ω≥1 on G, the approximate amenability of the Banach algebra L1(G,ω implies the left (p,q-amenability of G, but in general the opposite is not true. Our proof uses the notion of multinorms. We also investigate the approximate amenability of M(G,ω.
Approximation Properties for Groups and von Neumann Algebras
DEFF Research Database (Denmark)
Knudby, Søren
The main topic of the thesis is approximation properties for locally compact groups with applications to operator algebras. In order to study the relationship between weak amenability and the Haagerup property, the weak Haagerup property and the weak Haagerup constant are introduced. The weak...... Haagerup property is (strictly) weaker than both weak amenability and the Haagerup property. We establish a relation between the weak Haagerup property and semigroups of Herz-Schur multipliers. For free groups, we prove that a generator of a semigroup of radial, contractive Herz-Schur multipliers...... is linearly bounded by the word length function. In joint work with Haagerup, we show that a connected simple Lie group has the weak Haagerup property if and only if its real rank is at most one. The result coincides with the characterization of connected simple Lie groups which are weakly amenable. Moreover...
A polylogarithmic approximation algorithm for group Steiner tree problem
N. Garg; Konjevod, G.; Ravi, R.
1997-01-01
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group. The problem was introduced by Reich and Widmayer and finds applications in VLSI design. The group Steiner tree problem generalizes the set covering problem, and is therefore at least as hard. We give a randomized $O(\\log^3 n \\log k)$...
Modulus of smoothness and theorems concerning approximation on compact groups
Directory of Open Access Journals (Sweden)
H. Vaezi
2003-01-01
Full Text Available We consider the generalized shift operator defined by (Shuf(g=∫Gf(tut−1gdt on a compact group G, and by using this operator, we define spherical modulus of smoothness. So, we prove Stechkin and Jackson-type theorems.
The AAS Working Group on Accessibility and Disability (WGAD)
Monkiewicz, Jacqueline A.; Shanahan, J.; Murphy, Nicholas Arnold; Gilbert, Lauren
2016-06-01
The Working Group on Accessibility and Disability (WGAD) was formed by the Council of the American Astronomical Society in late 2015 in order to monitor and addresses issues of inclusivity in the astronomical community related to disability. WGAD promotes of the principles of universal accessibility and disability justice in both professional astronomy and astronomy education. The short term goals of WGAD for the next two years include producing a set of guidelines for a wide range of activities including supporting improved access to journals, data, and conferences. We will provide information and training regarding universal design as a guiding principle. The longer term goals of WGAD include integrating universal design as primary design strategy across the board in our many aspects of daily work life.
The AAS Working Group on Accessibility and Disability (WGAD): Year 1 Highlights
Aarnio, Alicia; Monkiewicz, Jacqueline; Murphy, Nicholas Arnold; Nordhaus, Jason; Tuttle, Sarah E.
2017-01-01
The AAS Working Group on Accessibility and Disability (WGAD) was formed in January of 2016 with the express purpose of seeking equity of opportunity and building inclusive practices for disabled astronomers at all career stages. In our first year, the WGAD has been actively developing resources and the online infrastructure for the dissemination of information and engagement with the astronomy community. Our official WGAD website has gone live, and we have used both the access: astronomy google group and blog to discuss specific issues of disability justice and to raise awareness for less-discussed barriers to access. The WGAD has developed relationships and collaboration with AAS inclusion committees (SGMA, CSMA, CSWA) so our work can recognize and address the intersections of identity astronomers occupy. In this presentation, we summarize our year one activities, focusing on our recently developed set of recommendations for journal accessibility to ensure everyone can engage with journal content and navigate the submission process. We will also discuss ongoing and future endeavors: a best practices guide for accessibility to be available via our website, and a site visit program.
The AAS Working Group on Accessibility and Disability (WGAD) Year 1 Highlights and Database Access
Knierman, Karen A.; Diaz Merced, Wanda; Aarnio, Alicia; Garcia, Beatriz; Monkiewicz, Jacqueline A.; Murphy, Nicholas Arnold
2017-06-01
The AAS Working Group on Accessibility and Disability (WGAD) was formed in January of 2016 with the express purpose of seeking equity of opportunity and building inclusive practices for disabled astronomers at all educational and career stages. In this presentation, we will provide a summary of current activities, focusing on developing best practices for accessibility with respect to astronomical databases, publications, and meetings. Due to the reliance of space sciences on databases, it is important to have user centered design systems for data retrieval. The cognitive overload that may be experienced by users of current databases may be mitigated by use of multi-modal interfaces such as xSonify. Such interfaces would be in parallel or outside the original database and would not require additional software efforts from the original database. WGAD is partnering with the IAU Commission C1 WG Astronomy for Equity and Inclusion to develop such accessibility tools for databases and methods for user testing. To collect data on astronomical conference and meeting accessibility considerations, WGAD solicited feedback from January AAS attendees via a web form. These data, together with upcoming input from the community and analysis of accessibility documents of similar conferences, will be used to create a meeting accessibility document. Additionally, we will update the progress of journal access guidelines and our social media presence via Twitter. We recommend that astronomical journals form committees to evaluate the accessibility of their publications by performing user-centered usability studies.
Barber, Michael N.
1980-03-01
An algorithm for determining the sequence of variational parameters in a variational approximation to a real-space renormalization group is developed. Using this procedure, the Kadanoff one-hypercube approximation for the two-dimensional Ising model is investigated in some detail. We conclude that the apparent success of this method is somewhat fortuitous; a consistent and completely optimized treatment yielding considerably poorer estimates of the specific heat exponents. In addition, the variational parameter is found to be non-analytic at the fixed point. The nature of singularity agrees with the predictions of van Saarloos, van Leeuwen, and Pruisken.
Approximation of the WRB reference group with the reapplication of archive soil databases
Directory of Open Access Journals (Sweden)
Balla Dániel
2016-12-01
Full Text Available In our study, we tested the existing and freely accessible soil databases covering a smaller geographical region surveyed and classified according to the Hungarian classification in order to approximate the WRB soil reference groups (RSG. We tested the results and applicability of approximation for the RSG with three different methods on 12 soil profiles. First, RSGs were assigned to Hungarian soil taxa based on results of previous correlation studies, secondly, a freely accessible online database of ISRIC was applied furthermore, and an automated reclassification developed and programmed by us was used, which takes the original soil data as input.
Zhang, Liangsheng; Zhao, Bo; Devakul, Trithep; Huse, David A.
2016-06-01
We present a simplified strong-randomness renormalization group (RG) that captures some aspects of the many-body localization (MBL) phase transition in generic disordered one-dimensional systems. This RG can be formulated analytically and is mathematically equivalent to a domain coarsening model that has been previously solved. The critical fixed-point distribution and critical exponents (that satisfy the Chayes inequality) are thus obtained analytically or to numerical precision. This reproduces some, but not all, of the qualitative features of the MBL phase transition that are indicated by previous numerical work and approximate RG studies: our RG might serve as a "zeroth-order" approximation for future RG studies. One interesting feature that we highlight is that the rare Griffiths regions are fractal. For thermal Griffiths regions within the MBL phase, this feature might be qualitatively correctly captured by our RG. If this is correct beyond our approximations, then these Griffiths effects are stronger than has been previously assumed.
Guilleux, Maxime
2016-01-01
Nonperturbative renormalization group techniques have recently proven a powerful tool to tackle the nontrivial infrared dynamics of light scalar fields in de Sitter space. In the present article, we develop the formalism beyond the local potential approximation employed in earlier works. In particular, we consider the derivative expansion, a systematic expansion in powers of field derivatives, appropriate for long wavelength modes, that we generalize to the relevant case of a curved metric with Lorentzian signature. The method is illustrated with a detailed discussion of the so-called local potential approximation prime which, on the top of the full effective potential, includes a running (but field-independent) field renormalization. We explicitly compute the associated anomalous dimension for O(N) theories. We find that it can take large values along the flow, leading to sizable differences as compared to the local potential approximation. However, it does not prevent the phenomenon of gravitationally induc...
On the Anionic Group Approximation to the Borate Nonlinear Optical Materials
Directory of Open Access Journals (Sweden)
Rukang Li
2017-02-01
Full Text Available In this mini-review type of article, a brief summary of the anionic group approximation as it relates to the borate nonlinear optical (NLO crystals, an idea firstly proposed by Professor Chen, is presented.The basic idea, calculation method, tabulated coefficients of various common borate, as well as nitrate or carbonate groups, in their ideal geometries will be presented. New practices reveal that those parameters can still give very accurate predicted NLO coefficients for recently found NLO crystals without any adjustment of parameters.
Guilleux, Maxime; Serreau, Julien
2017-02-01
Nonperturbative renormalization group techniques have recently proven a powerful tool to tackle the nontrivial infrared dynamics of light scalar fields in de Sitter space. In the present article, we develop the formalism beyond the local potential approximation employed in earlier works. In particular, we consider the derivative expansion, a systematic expansion in powers of field derivatives, appropriate for long wavelength modes, that we generalize to the relevant case of a curved metric with Lorentzian signature. The method is illustrated with a detailed discussion of the so-called local potential approximation prime which, on top of the full effective potential, includes a running (but field-independent) field renormalization. We explicitly compute the associated anomalous dimension for O (N ) theories. We find that it can take large values along the flow, leading to sizable differences as compared to the local potential approximation. However, it does not prevent the phenomenon of gravitationally induced dimensional reduction pointed out in previous studies. We show that, as a consequence, the effective potential at the end of the flow is unchanged as compared to the local potential approximation, the main effect of the running anomalous dimension being merely to slow down the flow. We discuss some consequences of these findings.
Arnone, S; Yoshida, K
2001-01-01
Exact renormalization group techniques are applied to mass deformed N=4 supersymmetric Yang-Mills theory, viewed as a regularised N=2 model. The solution of the flow equation, in the local potential approximation, reproduces the one-loop (perturbatively exact) expression for the effective action of N=2 supersymmetric Yang-Mills theory, when the regularising mass, M, reaches the value of the dynamical cutoff. One speculates about the way in which further non-perturbative contributions (instanton effects) may be accounted for.
Morris, Titus; Bogner, Scott
2016-09-01
The In-Medium Similarity Renormalization Group (IM-SRG) has been applied successfully to the ground state of closed shell finite nuclei. Recent work has extended its ability to target excited states of these closed shell systems via equation of motion methods, and also complete spectra of the whole SD shell via effective shell model interactions. A recent alternative method for solving of the IM-SRG equations, based on the Magnus expansion, not only provides a computationally feasible route to producing observables, but also allows for approximate handling of induced three-body forces. Promising results for several systems, including finite nuclei, will be presented and discussed.
Correlation functions of just renormalizable tensorial group field theory: The melonic approximation
Samary, Dine Ousmane; Vignes-Tourneret, Fabien; Wulkenhaar, Raimar
2014-01-01
The $D$-colored version of tensor models has been shown to admit a large $N$-limit expansion. The leading contributions result from so-called melonic graphs which are dual to the $D$-sphere. This is a note about the Schwinger-Dyson equations of the tensorial $\\varphi^{4}_{5}$-model (with propagator $1/{\\bf p}^{2}$) and their melonic approximation. We derive the master equations for two- and four-point correlation functions and discuss their solution.
Directory of Open Access Journals (Sweden)
Yun Wang
2016-01-01
Full Text Available Gamma Gaussian inverse Wishart cardinalized probability hypothesis density (GGIW-CPHD algorithm was always used to track group targets in the presence of cluttered measurements and missing detections. A multiple models GGIW-CPHD algorithm based on best-fitting Gaussian approximation method (BFG and strong tracking filter (STF is proposed aiming at the defect that the tracking error of GGIW-CPHD algorithm will increase when the group targets are maneuvering. The best-fitting Gaussian approximation method is proposed to implement the fusion of multiple models using the strong tracking filter to correct the predicted covariance matrix of the GGIW component. The corresponding likelihood functions are deduced to update the probability of multiple tracking models. From the simulation results we can see that the proposed tracking algorithm MM-GGIW-CPHD can effectively deal with the combination/spawning of groups and the tracking error of group targets in the maneuvering stage is decreased.
Energy Technology Data Exchange (ETDEWEB)
Pruschke, T.; Bulla, R. [Institute fuer Theoretische Physik der Universitaet, Regensburg (Germany)
1995-05-01
The numerical renormalization group method is applied to an Anderson impurity with an energy dependent coupling to the conduction band. We describe how the discrete spectra resulting from the numerical calculation can be reliably smoothed using a continued fraction expansion. The investigations are connected with the study of models in infinite spatial dimensions.
Coherent states, quantum gravity, and the Born- Oppenheimer approximation. II. Compact Lie groups
Stottmeister, Alexander; Thiemann, Thomas
2016-07-01
In this article, the second of three, we discuss and develop the basis of a Weyl quantisation for compact Lie groups aiming at loop quantum gravity-type models. This Weyl quantisation may serve as the main mathematical tool to implement the program of space adiabatic perturbation theory in such models. As we already argued in our first article, space adiabatic perturbation theory offers an ideal framework to overcome the obstacles that hinder the direct implementation of the conventional Born-Oppenheimer approach in the canonical formulation of loop quantum gravity. Additionally, we conjecture the existence of a new form of the Segal-Bargmann-Hall "coherent state" transform for compact Lie groups G, which we prove for G = U(1)n and support by numerical evidence for G = SU(2). The reason for conjoining this conjecture with the main topic of this article originates in the observation that the coherent state transform can be used as a basic building block of a coherent state quantisation (Berezin quantisation) for compact Lie groups G. But, as Weyl and Berezin quantisation for ℝ2d are intimately related by heat kernel evolution, it is natural to ask whether a similar connection exists for compact Lie groups as well. Moreover, since the formulation of space adiabatic perturbation theory requires a (deformation) quantisation as minimal input, we analyse the question to what extent the coherent state quantisation, defined by the Segal-Bargmann-Hall transform, can serve as basis of the former.
Lecoutre, Bruno
1991-01-01
The routine epsilon approximate test in repeated measures designs when the condition of circularity is unfulfilled uses an erroneous formula in the case of two or more groups. Because this may lead to underestimation of the deviation from circularity when the subject number is small, a correction is proposed. (Author/SLD)
Approximate group context tree: applications to dynamic programming and dynamic choice models
Belloni, Alexandre
2011-01-01
The paper considers a variable length Markov chain model associated with a group of stationary processes that share the same context tree but potentially different conditional probabilities. We propose a new model selection and estimation method, develop oracle inequalities and model selection properties for the estimator. These results also provide conditions under which the use of the group structure can lead to improvements in the overall estimation. Our work is also motivated by two methodological applications: discrete stochastic dynamic programming and dynamic discrete choice models. We analyze the uniform estimation of the value function for dynamic programming and the uniform estimation of average dynamic marginal effects for dynamic discrete choice models accounting for possible imperfect model selection. We also derive the typical behavior of our estimator when applied to polynomially $\\beta$-mixing stochastic processes. For parametric models, we derive uniform rate of convergence for the estimation...
Leerach, Nontaphat; Yakaew, Swanya; Phimnuan, Preeyawass; Soimee, Wichuda; Nakyai, Wongnapa; Luangbudnark, Witoo; Viyoch, Jarupa
2017-03-01
Chronic UVB exposure causes skin disorders and cancer through DNA strand breaks and oxidation of numerous functional groups of proteins and lipids in the skin. In this study, we investigated the effects of Thai banana (Musa AA group, "Khai," and Musa ABB group, "Namwa") on the prevention of UVB-induced skin damage when fed to male ICR mice. Mice were orally fed banana (Khai or Namwa) fruit pulps at dose of 1mg/g body weight/day for 12weeks. The shaved backs of the mice were irradiated with UVB for 12weeks. The intensity dose of UVB-exposure was increased from 54mJ/cm(2)/exposure at week 1 to 126mJ/cm(2)/exposure at week 12. A significant increase in skin thickness, lipid peroxidation, protein oxidation end products, and expression of MMP-1 was observed in UVB-irradiated mouse skin. A reduction in the accumulation of oxidation end products was found in the skin of UVB-irradiated mice receiving Khai. This occurred in conjunction with a reduction in MMP-1 expression, inhibition of epidermal thickening, and induction of γ-GCS expression. The dietary intake of Khai prevented skin damage from chronic UVB exposure by increased γ-GCS expression and reduced oxidation end products included carbonyls, malondialdehyde and 4-hydroxynonenal. Copyright © 2017 Elsevier B.V. All rights reserved.
Institute of Scientific and Technical Information of China (English)
Kunyang Wang; Feng Dai
2007-01-01
As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years (2001-2005).Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.
Long range hops and the pair annihilation reaction A+A-->0: renormalization group and simulation.
Vernon, Daniel C
2003-10-01
A simple example of a nonequilibrium system for which fluctuations are important is a system of particles which diffuse and may annihilate in pairs on contact. The renormalization group can be used to calculate the time dependence of the density of particles, and provides both an exact value for the exponent governing the decay of particles and an epsilon expansion for the amplitude of this power law. When the diffusion is anomalous, as when the particles perform Lévy flights, the critical dimension depends continuously on the control parameter for the Lévy distribution. The epsilon expansion can then become an expansion in a small parameter. We present the renormalization group calculation and compare these results with those of a simulation.
Directory of Open Access Journals (Sweden)
S. Yamoah
2012-04-01
Full Text Available The understanding of the time-dependent behaviour of the neutron population in a nuclear reactor in response to either a planned or unplanned change in the reactor conditions is of great importance to the safe and reliable operation of the reactor. In this study two analytical methods have been presented to solve the point kinetic equations of average one-group of delayed neutrons. These methods which are both approximate solution of the point reactor kinetic equations are compared with a numerical solution using the Euler’s first order method. To obtain accurate solution for the Euler method, a relatively small time step was chosen for the numerical solution. These methods are applied to different types of reactivity to check the validity of the analytical method by comparing the analytical results with the numerical results. From the results, it is observed that the analytical solution agrees well with the numerical solution.
Andersen, A C; Pustovit, V N; Niklasson, G A
2001-01-01
Certain dust particles in space are expected to appear as clusters of individual grains. The morphology of these clusters could be fractal or compact. In this paper we study the light scattering by compact and fractal polycrystalline graphite clusters consisting of touching identical spheres. We compare three general methods for computing the extinction of the clusters in the wavelength range 0.1 - 100 micron, namely, a rigorous solution (Gerardy & Ausloos 1982) and two different discrete-dipole approximation methods -- MarCODES (Markel 1998) and DDSCAT (Draine & Flatau 1994). We consider clusters of N = 4, 7, 8, 27,32, 49, 108 and 343 particles of radii either 10 nm or 50 nm, arranged in three different geometries: open fractal (dimension D = 1.77), simple cubic and face-centred cubic. The rigorous solution shows that the extinction of the fractal clusters, with N 5 micron, the rigorous solution indicates that the extinction from fractal and compact clusters are of the same order of magnitude. It wa...
Kinza, Michael; Honerkamp, Carsten
2015-07-01
In the derivation of low-energy effective models for solids targeting the bands near the Fermi level, the constrained random-phase approximation (cRPA) has become an appreciated tool to compute the effective interactions. The Wick-ordered constrained functional renormalization group (cfRG) generalizes the cRPA approach by including all interaction channels in an unbiased way. Here we present applications of the cfRG to two simple multiband systems and compare the resulting effective interactions to the cRPA. First, we consider a multiband model for monolayer graphene, where we integrate out the σ bands to get an effective theory for π bands. It turns out that terms beyond cRPA are strongly suppressed by the different x y -plane reflection symmetry of the bands. In our model the cfRG corrections to cRPA become visible when one disturbs this symmetry difference slightly, however, without qualitative changes. This study shows that the embedding or layering of two-dimensional electronic systems can alter the effective interaction parameters beyond what is expected from screening considerations. The second example is a one-dimensional model for a diatomic system reminiscent of a CuO chain, where we consider an effective theory for Cu 3 d -like orbitals. Here the fRG data shows relevant and qualitative corrections compared to the cRPA results. We argue that the new interaction terms affect the magnetic properties of the low-energy model.
DEFF Research Database (Denmark)
Abildskov, Jens; Constantinou, Leonidas; Gani, Rafiqul
1996-01-01
A simple modification of group contribution based models for estimation of liquid phase activity coefficients is proposed. The main feature of this modification is that contributions estimated from the present first-order groups in many instances are found insufficient since the first-order groups...
Approximate Representations and Approximate Homomorphisms
Moore, Cristopher
2010-01-01
Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups: functions f:G -> U_d such that Pr[f(xy) = f(x) f(y)] is large, or more generally Exp_{x,y} ||f(xy) - f(x)f(y)||^2$ is small, where x and y are uniformly random elements of the group G and U_d denotes the unitary group of degree d. We bound these quantities in terms of the ratio d / d_min where d_min is the dimension of the smallest nontrivial representation of G. As an application, we bound the extent to which a function f : G -> H can be an approximate homomorphism where H is another finite group. We show that if H's representations are significantly smaller than G's, no such f can be much more homomorphic than a random function. We interpret these results as showing that if G is quasirandom, that is, if d_min is large, then G cannot be embedded in a small number of dimensi...
Choi, Gongjun
2015-01-01
We study asymptotically free SU($N_c$) gauge theories with ${\\cal N}=1$ supersymmetry, including the purely gluonic theory and theories with $N_f$ copies of a pair of massless chiral superfields in the respective representations $R$ and $\\bar R$ of SU($N_c$). The cases in which $R$ is the fundamental representation and the symmetric and antisymmetric rank-2 tensor representation are considered. We calculate Pad\\'e approximants to the beta functions for these theories in the $\\overline{\\rm DR}$ scheme up to four-loop order for the gluonic theory and up to three-loop order for the theories with matter superfields and compare results for IR zeros and poles with results from the NSVZ beta function. Our calculations provide a quantitative measure, for these theories, of how well finite-order perturbative results calculated in one scheme reproduce properties of a known beta function calculated in a different scheme.
Directory of Open Access Journals (Sweden)
Kamnoon KANCHANAPOOM
2012-02-01
Full Text Available Yellow compact calluses were induced from in vitro-grown shoot tips of diploid bananas (Musa acuminata, AA group �Kluai Sa� and �Kluai Leb Mu Nang� on a modified Murashige and Skoog (MS medium containing 100 mg/L malt extract, 50 mg/L proline, 50 mg/L cysteine, 100 mg/L glutamine, 1 mg/L biotin, 7 mg/L Dicamba and 2 mg/L TDZ. Green shoot buds were induced after transfer of the yellow compact calluses to the same MS medium but supplemented with 1 mg/L NAA and 3 mg/L BA and plant regeneration was achieved through organogenesis in callus cultures. Regenerated shoots were rooted on MS medium containing 0.2% activated charcoal but without plant growth regulators. Histological analysis revealed that calluses originated from small dense cells with well stained cytoplasm and nucleus typical of meristematic cells.
National Oceanic and Atmospheric Administration, Department of Commerce — The geomagnetic aa index provides a long climatology of global geomagnetic activity using 2 antipodal observatories at Greenwich and Melbourne- IAGA Bulletin 37,...
Smith, Penny A. Morris
1999-01-01
Archean aged rocks from the Pilbara Block area of western Australia (Warrawoona Group, Towers Formation, -3.3-3.5 Ga) contain microfossils that are composed of various sizes of spheres and filaments. The first descriptions of these microfossils were published in the late 1970's (Dunlop, 1978; Dunlop, et. al., 1978). The authenticity of the microfossils is well established. The small size of the microfossils prevents isotope dating, at least with the present technology. Microbiologists, however, have established guidelines to determine the authenticity of the Archean aged organic remains (Schopf, Walter, 1992).
Berndt, Sandra; Ebben, Barbara; Kubinski, Eva; Sim, Grant; Liu, Kristin; Lazarus, Sheryl; Thurlow, Martha; Christian, Elizabeth
2011-01-01
Beginning in 2007, federal regulations to two major education laws gave state departments of education the option to develop an alternate assessment based on modified achievement standards (AA-MAS) for some students with disabilities. The regulations stated that the AA-MAS was intended for students who were being instructed in the grade-level…
Gudipati, The AAS WGLA: Murthy; Brickhouse, Nancy; Cowan, John; Drake, Paul; Federman, Steven; Ferland, Gary; Frank, Adam; Haxton, Wick; Herbst, Eric; Mumma, Michael; Salama, Farid; Savin, Daniel Wolf; Ziurys, Lucy
2009-01-01
The WGLA of the AAS (http://www.aas.org/labastro/) promotes collaboration and exchange of knowledge between astronomy and planetary sciences and the laboratory sciences (physics, chemistry, and biology). Laboratory data needs of ongoing and next generation planetary science missions are carefully evaluated and recommended in this white paper submitted by the WGLA to Planetary Decadal Survey.
Carter, Susan J.
2001-01-01
Why alternative investments? In a word: performance. Many higher education endowment and foundation managers are making increasing commitments to alternative investments, or AAs, in order to obtain higher returns and broader diversification for their investment portfolios than public securities instruments can usually provide. Learn how to handle…
A.A., constructivism, and reflecting teams.
Nevels, B
1997-12-01
Numerous studies and clinical anecdotes reveal a relationship between attendance at A.A. meetings and/or degree of involvement in A.A. and maintenance of sobriety. Hypotheses as to how A.A. and/or the A.A. meeting is helpful to its members have ranged from a focus on factors common to all therapy groups, to aspects of A.A. "treatment" which are behavioral in nature. Presented here is another way of understanding A.A.'s effectiveness within the frame of more recent, constructivistic approaches to family therapy. In particular, the A.A. topic meeting is compared to the reflecting team concept of Tom Anderson.
Directory of Open Access Journals (Sweden)
Carlos Nava Quiroz***
2010-03-01
were distributed as follows: 58 adolescents (high school students, 55 members of AA and 44college students. Significant differences were found between some subscales and different reference groups. Most of thesedifferences were found in terms of cutting social cognitive skills. The group of alcoholics AA made the difference, showingthem a higher score on the subscales that indicate «fear» or «concern» in certain social situations. We discuss these findingsand their implications for treatment and prevention of alcoholism.
Harrigan, Matthew J; Newberg, Lee A; Yanny, Brian; Beers, Timothy C; Lee, Young Sun; Fiorentin, Paola Re
2010-01-01
A new moving group comprising at least four Blue Horizontal Branch (BHB) stars is identified at (l,b) = (65 deg, 48 deg). The horizontal branch at g0=18.9 magnitude implies a distance of 50 kpc from the Sun. The heliocentric radial velocity is RV = -157 +/- 4 km/s, corresponding to V(gsr) = -10 km/s; the dispersion in line-of-sight velocity is consistent with the instrumental errors for these stars. The mean metallicity of the moving group is [Fe/H] approximately -2.4, which is significantly more metal poor than the stellar spheroid. We estimate that the BHB stars in the outer halo have a mean metallicity of [Fe/H] = -2.0, with a wide scatter and a distribution that does not change much as a function of distance from the Sun. We explore the systematics of SDSS DR7 surface gravity metallicity determinations for faint BHB stars, and present a technique for estimating the significance of clumps discovered in multidimensional data. This moving group cannot be distinguished in density, and highlights the need to c...
Approximate and renormgroup symmetries
Energy Technology Data Exchange (ETDEWEB)
Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling
2009-07-01
''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)
Laboratory Astrophysics Division of the AAS (LAD)
Salama, Farid; Drake, R. P.; Federman, S. R.; Haxton, W. C.; Savin, D. W.
2012-01-01
The purpose of the Laboratory Astrophysics Division (LAD) is to advance our understanding of the Universe through the promotion of fundamental theoretical and experimental research into the underlying processes that drive the Cosmos. LAD represents all areas of astrophysics and planetary sciences. The first new AAS Division in more than 30 years, the LAD traces its history back to the recommendation from the scientific community via the White Paper from the 2006 NASA-sponsored Laboratory Astrophysics Workshop. This recommendation was endorsed by the Astronomy and Astrophysics Advisory Committee (AAAC), which advises the National Science Foundation (NSF), the National Aeronautics and Space Administration (NASA), and the U.S. Department of Energy (DOE) on selected issues within the fields of astronomy and astrophysics that are of mutual interest and concern to the agencies. In January 2007, at the 209th AAS meeting, the AAS Council set up a Steering Committee to formulate Bylaws for a Working Group on Laboratory Astrophysics (WGLA). The AAS Council formally established the WGLA with a five-year mandate in May 2007, at the 210th AAS meeting. From 2008 through 2012, the WGLA annually sponsored Meetings in-a-Meeting at the AAS Summer Meetings. In May 2011, at the 218th AAS meeting, the AAS Council voted to convert the WGLA, at the end of its mandate, into a Division of the AAS and requested draft Bylaws from the Steering Committee. In January 2012, at the 219th AAS Meeting, the AAS Council formally approved the Bylaws and the creation of the LAD. The inaugural gathering and the first business meeting of the LAD were held at the 220th AAS meeting in Anchorage in June 2012. You can learn more about LAD by visiting its website at http://lad.aas.org/ and by subscribing to its mailing list.
De Bondt, Niki; Van Petegem, Peter
2015-01-01
The Overexcitability Questionnaire-Two (OEQ-II) measures the degree and nature of overexcitability, which assists in determining the developmental potential of an individual according to Dabrowski's Theory of Positive Disintegration. Previous validation studies using frequentist confirmatory factor analysis, which postulates exact parameter constraints, led to model rejection and a long series of model modifications. Bayesian structural equation modeling (BSEM) allows the application of zero-mean, small-variance priors for cross-loadings, residual covariances, and differences in measurement parameters across groups, better reflecting substantive theory and leading to better model fit and less overestimation of factor correlations. Our BSEM analysis with a sample of 516 students in higher education yields positive results regarding the factorial validity of the OEQ-II. Likewise, applying BSEM-based alignment with approximate measurement invariance, the absence of non-invariant factor loadings and intercepts across gender is supportive of the psychometric quality of the OEQ-II. Compared to males, females scored significantly higher on emotional and sensual overexcitability, and significantly lower on psychomotor overexcitability.
CERN. Geneva
2015-01-01
Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...
Amiri, Mojtaba; Amini, Ramin
2012-08-01
A comparison of oral/inhaled opium addicts with a healthy control group was investigated. Using the graphite furnace atomic absorption spectroscopy (GF-AAS) followed by chemometric analysis, sub-to-low µg L-1 concentrations of blood lead level (BLL) was detected in both the addict and the control groups. In this study, BLL of 78 subjects (Iranian volunteers) in two opium-addicted (patient group) and healthy control groups was evaluated. All the volunteers were men. The patient group was comprised of 39 patients who used opium orally or by inhalation with a mean age of 48.6 ± 7.3 years. The patient group was selected through systematic incidental sampling from 150 orally or by inhalation opium-addicted patients referred to Shariati Hospital located in Tehran .The control group (39 subjects) was matched with the patient group with regard to age and sex and with a mean age of 44.8 ± 5.6 years. The mean concentration of lead was found to be significantly lower (P = 0.0001) in control group (16.70 ± 12.51 μg/dL) compared to addicts (57.04 ± 46.03 μg/dL). When the addicts were divided into various age groups, there appeared to be a significant difference (p= 0.0451) in blood lead concentration as a function of age, however when the control group was considered, no difference was observed (P = 0.51). Also, a tendency (P = 0.048) towards increasing BLL with respect to BMI was observed due to drug consumption, but there was no significant variation between BLL concentration and BMI when the control group was considered (P = 0.35). It was observed that the BLL in opium-addicts was significantly higher than that of the healthy control group. The mean difference of both groups was statistically significant.
Photographic Service
1980-01-01
The AA in its final stage of construction, before it disappeared from view under concrete shielding. Antiprotons were first injected, stochastically cooled and accumulated in July 1980. From 1981 on, the AA provided antiprotons for collisions with protons, first in the ISR, then in the SPS Collider. From 1983 on, it also sent antiprotons, via the PS, to the Low-Energy Antiproton Ring (LEAR). The AA was dismantled in 1997 and shipped to Japan.
Energy Technology Data Exchange (ETDEWEB)
Harrigan, Matthew J.; Newberg, Heidi Jo; Newberg, Lee A.; /Rensselaer Poly.; Yanny, Brian; /Fermilab; Beers, Timothy C.; Lee, Young Sun; /Michigan State U.; Fiorentin, Paola Re; /Ljubljana U. /Heidelberg, Max Planck Inst. Astron.
2010-02-01
A new moving group comprising at least four Blue Horizontal Branch (BHB) stars is identified at (l; b) = (65{sup o}; 48{sup o}). The horizontal branch at g{sub 0} = 18.9 magnitude implies a distance of 50 kpc from the Sun. The heliocentric radial velocity is
Capelo, Pedro R; Natarajan, Priyamvada
2011-01-01
We constrain gas and dark matter (DM) parameters of galaxy groups and clusters, by comparing X-ray scaling relations to theoretical expectations, obtained assuming that the gas is in hydrostatic equilibrium with the DM and follows a polytropic relation. We vary four parameters: the gas polytropic index Gamma, its temperature at large radii T_xi, the DM logarithmic slope at large radii zeta and its concentration c_vir. When comparing the model to the observed mass-temperature (M-T) relation of local clusters, our results are independent of both T_xi and c_vir. We thus obtain constraints on Gamma, by fixing the DM profile, and on zeta, by fixing the gas profile. For an NFW DM profile, we find that 6/5
Energy Technology Data Exchange (ETDEWEB)
Fadin, V.S. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Budker Nuclear Physics Institute, Novosibirsk (Russian Federation); Novosibirskij Gosudarstvennyj Univ., Novosibirsk (Russian Federation); Lipatov, L.N. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Petersburg Nuclear Physics Institute, Gatchina (Russian Federation); St. Petersburg State Univ., Gatchina (Russian Federation)
2011-12-15
We calculate the eigenvalues of the next-to-leading kernel for the BFKL equation in the adjoint representation of the gauge group SU(N{sub c}) in the N=4 supersymmetric Yang-Mills model. These eigenvalues are used to obtain the high energy behavior of the remainder function for the 6-point scattering amplitude with the maximal helicity violation in the kinematical regions containing the Mandelstam cut contribution. The leading and next-to-leading singularities of the corresponding collinear anomalous dimension are calculated in all orders of perturbation theory. We compare our result with the known collinear limit and with the recently suggested ansatz for the remainder function in three loops and obtain the full agreement providing that the numerical parameters in this anzatz are chosen in an appropriate way.
1978-01-01
Quickly improvised measurement equipment for the AA (Antiproton Accumulator) was all the tight schedule permitted, but the high motivation of the team made up for the lack of convenience. From left to right: Roy Billinge (Joint AA Project Leader, the other one was Simon van der Meer); Bruno Autin, Brian Pincott, Colin Johnson.
Kohler, Susanna
2016-01-01
Editors Note:This week were at the 227th AAS Meeting in Kissimmee, FL. Along with several fellow authors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting at the end of each day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Welcome to Day 2 of the winter American Astronomical Society (AAS) meeting in Kissimmee! Several of us are attending the conference this year, and we will report highlights from each day here on astrobites. If youd like to see more timely updates during the day, we encourage you to follow @astrobites on twitter or search the #aas227 hashtag.Plenary Session: Black Hole Physics with the Event Horizon Telescope (by Susanna Kohler)If anyone needed motivation to wake up early this morning, they got it in the form of Feryal Ozel (University of Arizona) enthralling us all with exciting pictures, videos, and words about black holes and the Event Horizon Telescope. Ozel spoke to a packed room (at 8:30am!) about where the project currently stands, and where its heading in the future.The EHT has pretty much the coolest goal ever: actually image the event horizons of black holes in our universe. The problem is that the largest black hole we can look at (Sgr A*, in the center of our galaxy) has an event horizon size of 50 as. For this kind of resolution roughly equivalent to trying to image a DVD on the Moon! wed need an Earth-sized telescope. EHT has solved this problem by linking telescopes around the world, creating one giant, mm-wavelength effective telescope with a baseline the size of Earth.Besides producing awesome images, the EHT will be able to test properties of black-hole spacetime, the no-hair theorem, and general relativity (GR) in new regimes.Ozel walked us through some of the theory prep work we need to do now in order to get the most science out of the EHT, including devising new
Kohler, Susanna
2016-01-01
Editors Note:This week were at the 227th AAS Meeting in Kissimmee, FL. Along with several fellow authors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting at the end of each day. Follow along here or at astrobites.com, or catch ourlive-tweeted updates from the @astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Things kicked off last night at our undergraduate reception booth. Thanks to all of you who stopped by we were delightedto have so many people tell us that they already know about and useastrobites, and we were excited to introduce a new cohort of students at AAS to astrobites for the first time.Tuesday morning was the official start of the meeting. Here are just a few of the talks and workshops astrobiters attended today.Opening Address (by Becky Smethurst)The President of the AAS, aka our fearless leader Meg Urry kicked off the meeting this morning at the purely coffee powered hour of 8am this morning. She spoke about the importance of young astronomers at the meeting (heres looking at you reader!) and also the importance of the new Working Group for Accessibility and Disabilities (aka WGAD pronounced like wicked) at the AAS. The Society has made extra effort this year to make the conference accessible to all,a message which was very well received by everyone in attendance.Kavli Lecture: New Horizons Alan Stern (by Becky Smethurst)We were definitely spoilt with the first Plenary lecture at this years conference Alan Stern gave us a a review of the New Horizons mission of the Pluto Fly By (astrobites covered the mission back in July with this post). We were treated to beautiful images, wonderful results and a foray into geology.Before (Hubble) and after #NewHorizons. #thatisall #science #astro alanstern #aas227 pic.twitter.com/kkMt6RsSIR Science News (@topsciencething) January 5, 2016Some awesome facts from the lecture that blew my mind:New Horizons is now 2AU (!) beyond Pluto
The AA disappearing under concrete shielding
CERN PhotoLab
1982-01-01
When the AA started up in July 1980, the machine stood freely in its hall, providing visitors with a view through the large window in the AA Control Room. The target area, in which the high-intensity 26 GeV/c proton beam from the PS hit the production target, was heavily shielded, not only towards the outside but also towards the AA-Hall. However, electrons and pions emanating from the target with the same momentum as the antiprotons, but much more numerous, accompanied these through the injection line into the AA ring. The pions decayed with a half-time corresponding to approximately a revolution period (540 ns), whereas the electrons lost energy through synchrotron radiation and ended up on the vacuum chamber wall. Electrons and pions produced the dominant component of the radiation level in the hall and the control room. With operation times far exceeding original expectations, the AA had to be buried under concrete shielding in order to reduce the radiation level by an order of magnitude.
Kohler, Susanna
2016-01-01
Greetings from the 227th American Astronomical Society meeting in Kissimmee, Florida! This week, along with several fellow authors from astrobites, Iwill bewritingupdates on selectedevents at themeeting and posting at the end of each day. You can follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.If youre an author or referee (or plan to be!) and youre here at the meeting, consider joining us at our Author and Referee Workshop on Wednesday in the Tallahassee room, where well be sharingsome of the exciting new features of the AAS journals. You can drop intoeither of the two-hour sessions(10 AM 12 PM or 1 PM 3 PM), and there will be afree buffet lunch at noon.Heres the agenda:Morning SessionTopic Speaker10:00 am 10:05 amIntroductionsJulie Steffen10:05 am 10:35 amChanges at AAS Journals; How to Be a Successful AAS AuthorEthan Vishniac10:35 am 11:00 amThe Peer Review ProcessButler Burton11:00 am 11:15 amAAS Nova: Sharing AAS Authors Research with the Broader CommunitySusanna Kohler11:15 am 11:30 amFixing Software and Instrumentation Publishing: New Paper Styles in AAS JournalsChris Lintott11:30 am 11:45 amMaking Article Writing Easier with the New AASTeX v6.0Greg Schwarz11:45 am 12:00 pmBringing JavaScript and Interactivity to Your AAS Journal FiguresGus MuenchLunch SessionTopic Speaker12:00 pm 12:15 pmUnified Astronomy ThesaurusKatie Frey12:15 pm 12:30 pmAAS/ADS ORCID Integration ToolAlberto Accomazzi12:30 pm 12:45 pmWorldWide Telescope and Video AbstractsJosh Peek12:45 pm 01:00 pmArizona Astronomical Data Hub (AADH)Bryan HeidornAfternoon SessionTopic Speaker01:00 pm 01:05 pmIntroductionsJulie Steffen01:05 pm 01:35 pmChanges at AAS Journals; How to Be a Successful AAS AuthorEthan Vishniac01:35 pm 02:00 pmThe Peer Review ProcessButler Burton02:00 pm 02:15 pmAAS Nova: Sharing AAS Authors Research with the Broader CommunitySusanna Kohler02:15 pm 02:30 pm
National Oceanic and Atmospheric Administration, Department of Commerce — The geomagnetic aa indices are the continuation of the series beginning in the year 1868. A full description of these indices is given in the International...
Kohler, Susanna
2016-06-01
Greetings from the 228th American Astronomical Society meeting in San Diego, California! This week, along with a team of fellow authorsfrom astrobites, Iwill bewritingupdates on selectedevents at themeeting and posting twiceeach day. You can follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.If youre at the meeting, come stop by the AAS booth (Booth #211-213) to learn about the newly-announced partnership between AAS and astrobites and pick up some swag.And dont forget to visit the IOP booth in the Exhibit Hall (Booth #223) to learn more about the new corridors for AAS Journals and to pick up a badge pin to representyour corridor!
Diophantine approximation and automorphic spectrum
Ghosh, Anish; Nevo, Amos
2010-01-01
The present paper establishes qunatitative estimates on the rate of diophantine approximation in homogeneous varieties of semisimple algebraic groups. The estimates established generalize and improve previous ones, and are sharp in a number of cases. We show that the rate of diophantine approximation is controlled by the spectrum of the automorphic representation, and is thus subject to the generalised Ramanujan conjectures.
Kohler, Susanna
2016-06-01
Editors Note:This week were at the 228th AAS Meeting in San Diego, CA. Along with a team ofauthors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting twiceeach day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Plenary Session 2015 Newton Lacy Pierce Prize Lecture: The Elephant in the Room: Effects of Distant, Massive Companions on Planetary System Architectures (by Leonardo dos Santos)The first session on Wednesday at 228th AAS Meeting was the Newton Lacy Pierce Prize Lecture by Heather Knutson (California Institute of Technology). This talk featured a broad range of research efforts on exoplanets, with the main focus on how we study the composition of their atmospheres, and how multi-body interactions carve the structure of the planetary systems we observe.One of her first points is the well-known idea that the Solar System is an oddball, compared to the exoplanet systems we have found so far: most of these systems contain hot Jupiters and mini-Neptunes at very close-in orbits around their host stars. Moreover, even when studying their transmission spectra, it is difficult to know the exact composition of their atmospheres.Knutson: it is difficult to constrain atmospheric composition of exoplanets (H-poor or H-rich+clouds?) #aas228pic.twitter.com/LdyN4o9RC7 astrobites (@astrobites) June 15, 2016The main proposal on how these systems formed is the migration scenario. In order to validate this idea, Dr. Knutson and her group The Friends of Hot Jupiters study systems with close-in gas giants and their frequency of binary companions, which are supposed to be the main culprits causing gas-giant migration. They found that approximately half of the observed systems have long-distance companions, providing strong validation of the migration scenario. Moreover, Dr. Knutson speculates that wide binaries have more
Kataev, A L
2015-01-01
The semi-analytical $O(\\alpha_s^4)$ expression for the renormalization group $\\beta$-function in the ${\\rm{V}}$-scheme is obtained in the case of the $SU(N_c)$ gauge group. In the process of calculations we use the existing information about the three-loop perturbative approximation for the QCD static potential, evaluated in the $\\rm{\\overline{MS}}$-scheme. The comparison of the numerical values of the third and fourth coefficients for the QCD RG $\\beta$- functions in the gauge-independent ${\\rm{V}}$- and $\\rm{\\overline{MS}}$-schemes and in minimal MOM scheme in the the Landau gauge is presented. The phenomenologically-oriented comparisons for the coefficients of $O(\\alpha_s^4)$ expression for the $e^+e^-$-annihilation R-ratio in these schemes are presented. It is shown, that taking into account of these QCD contributions are of vital importance and lead to the drastic decrease of the scheme-dependence ambiguities of the fourth-order perturbative QCD approximations for the $e^+e^-$ annihilation R-ratio for th...
Diophantine approximation and badly approximable sets
DEFF Research Database (Denmark)
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X....... The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...
Kohler, Susanna
2016-06-01
Editors Note: Lastweek we were at the 228th AAS Meeting in San Diego, CA. Here is a final post aboutselectedevents on the last day of the meeting, written by authors fromastrobites.com, a grad-student collaborative project with which we recently announced a new partnership! Starting in July,keep an eye out for astrobites postsat AAS Nova in between Highlights(i.e., on Tuesdays and Thursdays).Were excited to be working together to bring you more recent astronomy research from AAS journals!Extrasolar Planets: Detection (by Leonardo dos Santos)Thursdays first session on exoplanets was about detecting these distant worlds, and the opening talk was given by Robert Siverd (Las Cumbres Observatory). He describes the NRES, a network of spectrographs that will look for exoplanets using the radial velocity method. One of the coolest aspects of this instrument is that it will feature an on the fly scheduling system that will perform observations as efficiently as possible. The spectrograph is still being tested, but a unit will be deployed at CTIO later this year.@lcogt contracted by @NASA_TESS for follow up of their candidates. #aas228 Jessie Christiansen (@aussiastronomer) June 16, 2016Measuring the depths of transits and eclipses in Spitzer has been problematic in the past, since the Spitzer instrument IRAC (InfraRed Array Camera) has a non-uniform response in its detectors pixels. But, as reported by James Ingalls (Spitzer Science Center, Caltech), observers are circumventing this issue by using what they call the staring mode (avoiding large pointing jumps) and an algorithm to pick sweet spot pixels. Moreover, the results from the IRAC Data Challenge are helping to better understand its behavior. Giuseppe Morello (University College London), on the other hand, explained how his research group gets rid of instrumental effects from IRAC using machine learning. This method removes systematics from exoplanet transit data no matter if the noise source is from an instrument or
Mapping CSF biomarker profiles onto NIA-AA guidelines for Alzheimer's disease.
Alexopoulos, Panagiotis; Roesler, Jennifer; Thierjung, Nathalie; Werle, Lukas; Buck, Dorothea; Yakushev, Igor; Gleixner, Lena; Kagerbauer, Simone; Ortner, Marion; Grimmer, Timo; Kübler, Hubert; Martin, Jan; Laskaris, Nikolaos; Kurz, Alexander; Perneczky, Robert
2016-10-01
The National Institute on Aging-Alzheimer's Association (NIA-AA) guidelines for Alzheimer's disease (AD) propose the categorization of individuals according to their biomarker constellation. Though the NIA-AA criteria for preclinical AD and AD dementia have already been applied in conjunction with imaging AD biomarkers, the application of the criteria using comprehensive cerebrospinal fluid (CSF) biomarker information has not been thoroughly studied yet. The study included a monocentric cohort with healthy (N = 41) and disease (N = 22) controls and patients with AD dementia (N = 119), and a multicentric sample with healthy controls (N = 116) and patients with AD dementia (N = 102). The CSF biomarkers β-amyloid 1-42, total tau, and phosphorylated tau at threonine 181 were measured with commercially available assays. Biomarker values were trichotomized into positive for AD, negative, or borderline. In controls the presence of normal CSF profiles varied between 13.6 and 25.4 % across the studied groups, while up to 8.6 % of them had abnormal CSF biomarkers. In 40.3-52.9 % of patients with AD dementia, a typical CSF profile for AD was detected. Approximately 40 % of the potential biomarker constellations are not considered in the NIA-AA guidelines, and more than 40 % of participants could not be classified into the NIA-AA categories with distinct biomarker constellations. Here, a refined scheme covering all potential biomarker constellations is proposed. These results enrich the discussion on the NIA-AA guidelines and point to a discordance between clinical symptomatology and CSF biomarkers even in patients with full-blown AD dementia, who are supposed to have a clearly positive for AD neurochemical profile.
Marvel, Kevin B.
2012-08-01
The American Astronomical Society provides substantial programs in the area of Career Services.Motivated by the Society's mission to enhance and share humanity's understanding of the Universe, the AAS provides a central resource for advertising positions, interviewing opportunities at its annual winter meeting and information, workshops and networks to enable astronomers to find employment.The programs of the Society in this area are overseen by an active committee on employment and the AAS Council itself.Additional resources that help characterize the field, its growth and facts about employment such as salaries and type of jobs available are regularly summarized and reported on by the American Institute of Physics.
Directory of Open Access Journals (Sweden)
Brenda Oppert
Full Text Available Bacillus thuringiensis (Bt crystal (Cry proteins are effective against a select number of insect pests, but improvements are needed to increase efficacy and decrease time to mortality for coleopteran pests. To gain insight into the Bt intoxication process in Coleoptera, we performed RNA-Seq on cDNA generated from the guts of Tenebrio molitor larvae that consumed either a control diet or a diet containing Cry3Aa protoxin. Approximately 134,090 and 124,287 sequence reads from the control and Cry3Aa-treated groups were assembled into 1,318 and 1,140 contigs, respectively. Enrichment analyses indicated that functions associated with mitochondrial respiration, signalling, maintenance of cell structure, membrane integrity, protein recycling/synthesis, and glycosyl hydrolases were significantly increased in Cry3Aa-treated larvae, whereas functions associated with many metabolic processes were reduced, especially glycolysis, tricarboxylic acid cycle, and fatty acid synthesis. Microarray analysis was used to evaluate temporal changes in gene expression after 6, 12 or 24 h of Cry3Aa exposure. Overall, microarray analysis indicated that transcripts related to allergens, chitin-binding proteins, glycosyl hydrolases, and tubulins were induced, and those related to immunity and metabolism were repressed in Cry3Aa-intoxicated larvae. The 24 h microarray data validated most of the RNA-Seq data. Of the three intoxication intervals, larvae demonstrated more differential expression of transcripts after 12 h exposure to Cry3Aa. Gene expression examined by three different methods in control vs. Cry3Aa-treated larvae at the 24 h time point indicated that transcripts encoding proteins with chitin-binding domain 3 were the most differentially expressed in Cry3Aa-intoxicated larvae. Overall, the data suggest that T. molitor larvae mount a complex response to Cry3Aa during the initial 24 h of intoxication. Data from this study represent the largest genetic sequence
Oppert, Brenda; Dowd, Scot E; Bouffard, Pascal; Li, Lewyn; Conesa, Ana; Lorenzen, Marcé D; Toutges, Michelle; Marshall, Jeremy; Huestis, Diana L; Fabrick, Jeff; Oppert, Cris; Jurat-Fuentes, Juan Luis
2012-01-01
Bacillus thuringiensis (Bt) crystal (Cry) proteins are effective against a select number of insect pests, but improvements are needed to increase efficacy and decrease time to mortality for coleopteran pests. To gain insight into the Bt intoxication process in Coleoptera, we performed RNA-Seq on cDNA generated from the guts of Tenebrio molitor larvae that consumed either a control diet or a diet containing Cry3Aa protoxin. Approximately 134,090 and 124,287 sequence reads from the control and Cry3Aa-treated groups were assembled into 1,318 and 1,140 contigs, respectively. Enrichment analyses indicated that functions associated with mitochondrial respiration, signalling, maintenance of cell structure, membrane integrity, protein recycling/synthesis, and glycosyl hydrolases were significantly increased in Cry3Aa-treated larvae, whereas functions associated with many metabolic processes were reduced, especially glycolysis, tricarboxylic acid cycle, and fatty acid synthesis. Microarray analysis was used to evaluate temporal changes in gene expression after 6, 12 or 24 h of Cry3Aa exposure. Overall, microarray analysis indicated that transcripts related to allergens, chitin-binding proteins, glycosyl hydrolases, and tubulins were induced, and those related to immunity and metabolism were repressed in Cry3Aa-intoxicated larvae. The 24 h microarray data validated most of the RNA-Seq data. Of the three intoxication intervals, larvae demonstrated more differential expression of transcripts after 12 h exposure to Cry3Aa. Gene expression examined by three different methods in control vs. Cry3Aa-treated larvae at the 24 h time point indicated that transcripts encoding proteins with chitin-binding domain 3 were the most differentially expressed in Cry3Aa-intoxicated larvae. Overall, the data suggest that T. molitor larvae mount a complex response to Cry3Aa during the initial 24 h of intoxication. Data from this study represent the largest genetic sequence dataset for T. molitor
Leike, Reimar H
2016-01-01
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how "embarrassing" it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-approximated belief and (2) that the ranking judges approximations only by their predictions for actual outcomes. We find that this ranking is equivalent to the Kullback-Leibler divergence that is frequently used in the literature. However, there seems to be confusion about the correct order in which its functional arguments, the approximated and non-approximated beliefs, should be used. We hope that our elementary derivation settles the apparent confusion. We show for example that when approximating beliefs with Gaussian distributions the optimal approximation is given by moment matching. This is in contrast to many su...
Rašin, Andrija
1994-01-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.
On Element SDD Approximability
Avron, Haim; Toledo, Sivan
2009-01-01
This short communication shows that in some cases scalar elliptic finite element matrices cannot be approximated well by an SDD matrix. We also give a theoretical analysis of a simple heuristic method for approximating an element by an SDD matrix.
Buxner, Sanlyn; Holbrook, Jarita; AAS Oral History Team
2016-06-01
Now in its fourth year, the AAS Oral History Project has interviewed over 80 astronomers from all over the world. Led by the AAS Historical Astronomy Division (HAD) and partially funded by the American Institute of Physics Niels Bohr Library and ongoing support from the AAS, volunteers have collected oral histories from astronomers at professional meetings starting in 2015, including AAS, DPS, and the IAU general assembly. Each interview lasts one and a half to two hours and focuses on interviewees’ personal and professional lives. Questions include those about one’s family, childhood, strong influences on one’s scientific career, career path, successes and challenges, perspectives on how astronomy is changing as a field, and advice to the next generation. Each interview is audio recorded and transcribed, the content of which is checked with each interviewee. Once complete, interview transcripts are posted online as part of a larger oral history library at https://www.aip.org/history-programs/niels-bohr-library/oral-histories. Future analysis will reveal a rich story of astronomers and will help the community address issues of diversity, controversies, and the changing landscape of science. We are still recruiting individuals to be interviewed from all stages of career from undergraduate students to retired and emeritus astronomers. Contact Jarita Holbrook to schedule an interview or to find out more information about the project (astroholbrook@gmail.com). Also, contact Jarita Holbrook if you would like to become an interviewer for the project.
Approximate iterative algorithms
Almudevar, Anthony Louis
2014-01-01
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a
Approximation of distributed delays
Lu, Hao; Eberard, Damien; Simon, Jean-Pierre
2010-01-01
We address in this paper the approximation problem of distributed delays. Such elements are convolution operators with kernel having bounded support, and appear in the control of time-delay systems. From the rich literature on this topic, we propose a general methodology to achieve such an approximation. For this, we enclose the approximation problem in the graph topology, and work with the norm defined over the convolution Banach algebra. The class of rational approximates is described, and a constructive approximation is proposed. Analysis in time and frequency domains is provided. This methodology is illustrated on the stabilization control problem, for which simulations results show the effectiveness of the proposed methodology.
Diophantine approximation and badly approximable sets
DEFF Research Database (Denmark)
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X...
Sparse approximation with bases
2015-01-01
This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications. The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...
The Antiproton Accumulator (AA)
1980-01-01
Section 06 - 08*) of the AA where the dispersion (and hence the horizontal beam size) is large. One can distinguish (left to right): A vacuum-tank, two bending magnets (BST06 and BST07 in blue) with a quadrupole (QDN07, in red) in between, another vacuum-tank, a wide quadrupole (QFW08) and a further tank . The tanks are covered with heating tape for bake-out. The tank left of BST06 contained the stack core pickup for stochastic cooling (see 7906193, 7906190, 8005051), the two other tanks served mainly as vacuum chambers in the region where the beam was large. Peter Zettwoch works on BST06. *) see: H. Koziol, Antiproton Accumulator Parameter List, PS/AA/Note 84-2 (1984)
Approximation techniques for engineers
Komzsik, Louis
2006-01-01
Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.
Achieser, N I
2004-01-01
A pioneer of many modern developments in approximation theory, N. I. Achieser designed this graduate-level text from the standpoint of functional analysis. The first two chapters address approximation problems in linear normalized spaces and the ideas of P. L. Tchebysheff. Chapter III examines the elements of harmonic analysis, and Chapter IV, integral transcendental functions of the exponential type. The final two chapters explore the best harmonic approximation of functions and Wiener's theorem on approximation. Professor Achieser concludes this exemplary text with an extensive section of pr
The Antiproton Accumulator (AA)
1980-01-01
A section of the AA where the dispersion (and hence the horizontal beam size) is large. One can distinguish (left to right): A large vacuum-tank, a quadrupole (QDN09*), a bending magnet (BST08), another vacuum-tank, a wide quadrupole (QFW08) and (in the background) a further bending magnet (BST08). The tanks are covered with heating tape for bake-out. The tank left of QDN09 contained the kickers for stochastic pre-cooling (see 790621, 8002234, 8002637X), the other one served mainly as vacuum chamber in the region where the beam was large. Peter Zettwoch works on QFW08. * see: H. Koziol, Antiproton Accumulator Parameter List, PS/AA/Note 84-2 (1984) See under 7911303, 7911597X, 8004261 and 8202324. For photos of the AA in different phases of completion (between 1979 and 1982) see: 7911303, 7911597X, 8004261, 8004608X, 8005563X, 8005565X, 8006716X, 8006722X, 8010939X, 8010941X, 8202324, 8202658X, 8203628X .
Expectation Consistent Approximate Inference
DEFF Research Database (Denmark)
Opper, Manfred; Winther, Ole
2005-01-01
We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability dis...
Ordered cones and approximation
Keimel, Klaus
1992-01-01
This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.
Approximate Modified Policy Iteration
Scherrer, Bruno; Ghavamzadeh, Mohammad; Geist, Matthieu
2012-01-01
Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three approximate MPI (AMPI) algorithms that are extensions of the well-known approximate DP algorithms: fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide an error propagation analysis for AMPI that unifies those for approximate policy and value iteration. We also provide a finite-sample analysis for the classification-based implementation of AMPI (CBMPI), which is more general (and somehow contains) than the analysis of the other presented AMPI algorithms. An interesting observation is that the MPI's parameter allows us to control the balance of errors (in value function approximation and in estimating the greedy policy) in the fina...
Mathematical algorithms for approximate reasoning
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
2010-01-01
RESUMENEntre los factores de riesgo de inicio al consumo de alcohol se encuentra el déficit en habilidades sociales, que aunqueno es determinante, sí es un factor que de alguna manera influye en la conducta de beber en exceso. En la presenteinvestigación se realizó un análisis de habilidades sociales en tres muestras distintas: universitarios, adolescentes y alcohólicosen recuperación (AA). Se utilizaron los siguientes instrumentos: Escala Multidimensional de Expresión Social – ParteMotora (E...
Approximate calculation of integrals
Krylov, V I
2006-01-01
A systematic introduction to the principal ideas and results of the contemporary theory of approximate integration, this volume approaches its subject from the viewpoint of functional analysis. In addition, it offers a useful reference for practical computations. Its primary focus lies in the problem of approximate integration of functions of a single variable, rather than the more difficult problem of approximate integration of functions of more than one variable.The three-part treatment begins with concepts and theorems encountered in the theory of quadrature. The second part is devoted to t
Approximating Stationary Statistical Properties
Institute of Scientific and Technical Information of China (English)
Xiaoming WANG
2009-01-01
It is well-known that physical laws for large chaotic dynamical systems are revealed statistically. Many times these statistical properties of the system must be approximated numerically. The main contribution of this manuscript is to provide simple and natural criterions on numerical methods (temporal and spatial discretization) that are able to capture the stationary statistical properties of the underlying dissipative chaotic dynamical systems asymptotically. The result on temporal approximation is a recent finding of the author, and the result on spatial approximation is a new one. Applications to the infinite Prandtl number model for convection and the barotropic quasi-geostrophic model are also discussed.
Directory of Open Access Journals (Sweden)
Malvina Baica
1985-01-01
Full Text Available The author uses a new modification of Jacobi-Perron Algorithm which holds for complex fields of any degree (abbr. ACF, and defines it as Generalized Euclidean Algorithm (abbr. GEA to approximate irrationals.
Approximations in Inspection Planning
DEFF Research Database (Denmark)
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
The Karlqvist approximation revisited
Tannous, C
2015-01-01
The Karlqvist approximation signaling the historical beginning of magnetic recording head theory is reviewed and compared to various approaches progressing from Green, Fourier, Conformal mapping that obeys the Sommerfeld edge condition at angular points and leads to exact results.
Approximations in Inspection Planning
DEFF Research Database (Denmark)
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
Gautschi, Walter; Rassias, Themistocles M
2011-01-01
Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg
Approximation Behooves Calibration
DEFF Research Database (Denmark)
da Silva Ribeiro, André Manuel; Poulsen, Rolf
2013-01-01
Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009.......Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....
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.
Directory of Open Access Journals (Sweden)
Maksim Duškin
2015-11-01
Full Text Available Approximation and supposition This article compares exponents of approximation (expressions like Russian около, примерно, приблизительно, более, свыше and the words expressing supposition (for example Russian скорее всего, наверное, возможно. These words are often confused in research, in particular researchers often mention exponents of supposition in case of exponents of approximation. Such approach arouses some objections. The author intends to demonstrate in this article a notional difference between approximation and supposition, therefore the difference between exponents of these two notions. This difference could be described by specifying different attitude of approximation and supposition to the notion of knowledge. Supposition implies speaker’s ignorance of the exact number, while approximation does not mean such ignorance. The article offers examples proving this point of view.
1980-01-01
Focusing magnet used for the AA (antiproton accumulator).Making an antiproton beam took a lot of time and effort. Firstly, protons were accelerated to an energy of 26 GeV in the PS and ejected onto a metal target. From the spray of emerging particles, a magnetic horn picked out 3.6 GeV antiprotons for injection into the AA through a wide-aperture focusing quadrupole magnet. For a million protons hitting the target, just one antiproton was captured, 'cooled' and accumulated. It took 3 days to make a beam of 3 x 10^11 - three hundred thousand million - antiprotons. About focusing magnets (quadrupoles): Quadrupole magnets are needed to focus the particle beams and squeeze them so that more particles collide when the beams cross. Particle beams are stored for about 10 hours in the LHC. During this time, the particles make four hundred million revolutions around the machine, travelling a distance equivalent to the diameter of the solar system.
Covariant approximation averaging
Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph
2014-01-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 $N_f=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.
Diophantine approximations on fractals
Einsiedler, Manfred; Shapira, Uri
2009-01-01
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0,1]^2, possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no irrational numbers x in the unit interval such that the continued fraction expansions of {nx mod1 : n is a natural number} are uniformly eventually bounded.
Monotone Boolean approximation
Energy Technology Data Exchange (ETDEWEB)
Hulme, B.L.
1982-12-01
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
Aedes cadherin mediates the in vivo toxicity of the Cry11Aa toxin to Aedes aegypti.
Lee, Su-Bum; Chen, Jianwu; Aimanova, Karlygash G; Gill, Sarjeet S
2015-06-01
Cadherin plays an important role in the toxicity of Bacillus thuringiensis Cry proteins. We previously cloned a full-length cadherin from Aedes aegypti larvae and reported this protein binds Cry11Aa toxin from B. thuringiensis subsp. israelensis with high affinity, ≈16.7nM. Based on these results, we investigated if Aedes cadherin is involved in the in vivo toxicity of Cry11Aa toxin to Ae. aegypti. We established a mosquito cell line stably expressing the full-length Aedes cadherin and transgenic mosquitoes with silenced Aedes cadherin expression. Cells expressing the Aedes cadherin showed increased sensitivity to Cry11Aa toxin. Cry11Aa toxin at 400nM killed approximately 37% of the cells in 3h. Otherwise, transgenic mosquitoes with silenced Aedes cadherin expression showed increased tolerance to Cry11Aa toxin. Furthermore, cells expressing Aedes cadherin triggered Cry11Aa oligomerization. These results show the Aedes cadherin plays a pivotal role in Cry11Aa toxicity to Ae. aegypti larvae by mediating Cry11Aa oligomerization. However, since high toxicity was not obtained in cadherin-expressing cells, an additional receptor may be needed for manifestation of full toxicity. Moreover, cells expressing Aedes cadherin were sensitive to Cry4Aa and Cry11Ba, but not Cry4Ba. However transgenic mosquitoes with silenced Aedes cadherin expression showed no tolerance to Cry4Aa, Cry4Ba, and Cry11Ba toxins. These results suggest that while Aedes cadherin may mediate Cry4Aa and Cry11Ba toxicity, this cadherin but is not the main receptor of Cry4Aa, Cry4Ba and Cry11Ba toxin in Ae. aegypti.
Prestack wavefield approximations
Alkhalifah, Tariq
2013-09-01
The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Norton, Andrew H.
1991-01-01
Local spline approximants offer a means for constructing finite difference formulae for numerical solution of PDEs. These formulae seem particularly well suited to situations in which the use of conventional formulae leads to non-linear computational instability of the time integration. This is explained in terms of frequency responses of the FDF.
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Approximation by Cylinder Surfaces
DEFF Research Database (Denmark)
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...
Topology, calculus and approximation
Komornik, Vilmos
2017-01-01
Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejér, Stieltjes, and Turán. The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Carathéodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure an...
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2011-01-01
Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.
Optimization and approximation
Pedregal, Pablo
2017-01-01
This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.
Topics in Metric Approximation
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.
Kohler, Susanna
2016-01-01
Editors Note:This week were at the 227th AAS Meeting in Kissimmee, FL. Along with several fellow authors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting at the end of each day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Welcome to Day 3 of the winter American Astronomical Society (AAS) meeting in Kissimmee! Several of us are attending the conference this year, and we will report highlights from each day here on astrobites. If youd like to see more timely updates during the day, we encourage you to follow @astrobites on twitter or search the #aas227 hashtag.Henry Norris Russell Lecture: Viewing the Universe with Infrared Eyes: The Spitzer Space Telescope (by Erika Nesvold)The Henry Norris Russell Award is the highest honor given by the AAS, for a lifetime of eminence in astronomy research. This years award went to Giovanni Fazio of the Harvard-Smithsonian Center for Astrophysics. Fazio became a leader in gamma ray astronomy before switching mid-career to the study of infrared astronomy, and he gave his award lecture on the latter subject, specifically on the Spitzer Space Telescope, one of the most successful infrared telescopes of all time.Artists rendering of the Spitzer space telescope. [NASA/JPL-Caltech]Spitzer has been operating for more than twelve years, and has resulted in over six thousand papers in refereed journals in that time. The telescope sits in an Earth-trailing orbit around the Sun, and is now farther from the Earth (1.4 AU) than the Earth is from the Sun. Fazio gave the audience a fascinating overview of the science done by Spitzer over more than a decade. One of the most productive areas of research for Spitzer is the study of exoplanets, which hadnt even been discovered when the Spitzer Telescope was first conceived. Spitzers high sensitivity and ability to observe exoplanets over
Energy Technology Data Exchange (ETDEWEB)
Chalasani, P.; Saias, I. [Los Alamos National Lab., NM (United States); Jha, S. [Carnegie Mellon Univ., Pittsburgh, PA (United States)
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.
Finite elements and approximation
Zienkiewicz, O C
2006-01-01
A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o
Metric Diophantine approximation on homogeneous varieties
Ghosh, Anish; Nevo, Amos
2012-01-01
We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khinchin and Jarnik theorems. In full generality our results establish simultaneous Diophantine approximation with respect to several completions, and Diophantine approximation over general number fields using S-algebraic integers. In several important examples, the metric results we obtain are optimal. The proof uses quantitative equidistribution properties of suitable averaging operators, which are derived from spectral bounds in automorphic representations.
Approximate Bayesian computation.
Directory of Open Access Journals (Sweden)
Mikael Sunnåker
Full Text Available Approximate Bayesian computation (ABC constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology.
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.
Approximation by Cylinder Surfaces
DEFF Research Database (Denmark)
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
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, ptendon 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.
S-Approximation: A New Approach to Algebraic Approximation
Directory of Open Access Journals (Sweden)
M. R. Hooshmandasl
2014-01-01
Full Text Available We intend to study a new class of algebraic approximations, called S-approximations, and their properties. We have shown that S-approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of S-approximations, called Sℳ-approximations, and showed that this subclass preserves most of the properties of inclusion based approximations but is not necessarily inclusionbased. The paper concludes by studying some basic operations on S-approximations and counting the number of S-min functions.
Zheng, Dasheng; Valdez-Cruz, Norma Adriana; Armengol, Gemma; Sevrez, Chloe; Munoz-Olaya, Jose Maurilio; Yuan, Zhiming; Orduz, Sergio; Crickmore, Neil
2007-01-01
The cyt1Aa gene from Bacillus thuringiensis subsp. israelensis (Bti), whose product synergizes other mosquitocidal toxins, and functions as a repressor of resistance developed by mosquitoes against Bacilli insecticides, was introduced into the aquatic Gram-negative bacterium Asticcacaulis excentricus alongside the cry11Aa gene. The genes were introduced as an operon, but although mRNA was detected for both genes, no Cyt1Aa toxin was detected. Both proteins were expressed using a construct in which a promoter was inserted upstream of each gene. Recombinant A. excentricus expressing both toxins was found to be approximately twice as toxic to third instar larvae of Culex quinquefasciatus as transformants expressing just Cry11Aa.
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2012-05-01
Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.
Kohler, Susanna
2016-01-01
Editors Note:This week were at the 227th AAS Meeting in Kissimmee, FL. Along with several fellow authors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting at the end of each day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Welcome to Day 4 of the winter American Astronomical Society (AAS) meeting in Kissimmee! Several of us are attending the conference this year, and we will report highlights from each day here on astrobites. If youd like to see more timely updates during the day, we encourage you to follow @astrobites on twitter or search the #aas227 hashtag.Helen B. Warner Prize: Origins of Structure in Planetary Systems (by Erika Nesvold)Another excellent prize lecture started off todays sessions. The Helen B. Warner Prize is awarded for achievement in observational or theoretical astrophysics by a young researcher (no more than eight years after their Ph.D.). This years Warner Prize was presented to Ruth Murray-Clay of UC Santa Barbara. For her award lecture, Murray-Clay told us all about planetary system architecture: the number, masses, and orbits of planets in a given system.Ruth Murray-Clay [photo from http://web.physics.ucsb.edu/ ~murray/biocv.html]The underlying question motivating this type of research is: How rare is the Solar System? In other words, how likely is it that a given planetary system will have rocky planets close to their star, gas giants farther out, and ice giants at the outer reaches of the system? Answering this question will help us solve the physics problem of how and where planets form, and will also help us on our search for other planets like Earth.The data on exoplanet population from transit and radial velocity observations and from direct imaging tell us that our Solar System is not common (many systems we observe have much more eccentric gas giants), but that doesnt
2011-01-01
Background Tropane alkaloids (TA) including anisodamine, anisodine, hyoscyamine and scopolamine are a group of important anticholinergic drugs with rapidly increasing market demand, so it is significant to improve TA production by biotechnological approaches. Putrescine N-methyltransferase (PMT) was considered as the first rate-limiting upstream enzyme while tropinone reductase I (TRI) was an important branch-controlling enzyme involved in TA biosynthesis. However, there is no report on simultaneous introduction of PMT and TRI genes into any TA-producing plant including Anisodus acutangulus (A. acutangulus), which is a Solanaceous perennial plant that is endemic to China and is an attractive resource plant for production of TA. Results In this study, 21 AaPMT and AaTRI double gene transformed lines (PT lines), 9 AaPMT single gene transformed lines (P lines) and 5 AaTRI single gene transformed lines (T lines) were generated. RT-PCR and real-time fluorescence quantitative analysis results revealed that total AaPMT (AaPMT T) and total AaTRI (AaTRI T) gene transcripts in transgenic PT, P and T lines showed higher expression levels than native AaPMT (AaPMT E) and AaTRI (AaTRI E) gene transcripts. As compared to the control and single gene transformed lines (P or T lines), PT transgenic hairy root lines produced significantly higher levels of TA. The highest yield of TA was detected as 8.104 mg/g dw in line PT18, which was 8.66, 4.04, and 3.11-times higher than those of the control (0.935 mg/g dw), P3 (highest in P lines, 2.004 mg/g dw) and T12 (highest in T lines, 2.604 mg/g dw), respectively. All the tested samples were found to possess strong radical scavenging capacity, which were similar to control. Conclusion In the present study, the co-expression of AaPMT and AaTRI genes in A. acutangulus hairy roots significantly improved the yields of TA and showed higher antioxidant activity than control because of higher total TA content, which is the first report on
Directory of Open Access Journals (Sweden)
Zhang Ang
2011-04-01
Full Text Available Abstract Background Tropane alkaloids (TA including anisodamine, anisodine, hyoscyamine and scopolamine are a group of important anticholinergic drugs with rapidly increasing market demand, so it is significant to improve TA production by biotechnological approaches. Putrescine N-methyltransferase (PMT was considered as the first rate-limiting upstream enzyme while tropinone reductase I (TRI was an important branch-controlling enzyme involved in TA biosynthesis. However, there is no report on simultaneous introduction of PMT and TRI genes into any TA-producing plant including Anisodus acutangulus (A. acutangulus, which is a Solanaceous perennial plant that is endemic to China and is an attractive resource plant for production of TA. Results In this study, 21 AaPMT and AaTRI double gene transformed lines (PT lines, 9 AaPMT single gene transformed lines (P lines and 5 AaTRI single gene transformed lines (T lines were generated. RT-PCR and real-time fluorescence quantitative analysis results revealed that total AaPMT (AaPMT T and total AaTRI (AaTRI T gene transcripts in transgenic PT, P and T lines showed higher expression levels than native AaPMT (AaPMT E and AaTRI (AaTRI E gene transcripts. As compared to the control and single gene transformed lines (P or T lines, PT transgenic hairy root lines produced significantly higher levels of TA. The highest yield of TA was detected as 8.104 mg/g dw in line PT18, which was 8.66, 4.04, and 3.11-times higher than those of the control (0.935 mg/g dw, P3 (highest in P lines, 2.004 mg/g dw and T12 (highest in T lines, 2.604 mg/g dw, respectively. All the tested samples were found to possess strong radical scavenging capacity, which were similar to control. Conclusion In the present study, the co-expression of AaPMT and AaTRI genes in A. acutangulus hairy roots significantly improved the yields of TA and showed higher antioxidant activity than control because of higher total TA content, which is the first
Zhang, Lei; Chen, Cong; Cao, Yuliang; Xie, Baifa; Chen, Xiangyu; Zeng, Fanjie; Liu, Minghua
2016-09-01
The aim of this study was to investigate the immunoprotective effects of AaHIV in mice. After purification, a 12% sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE) was performed. Bicinchoninic acid was used to determine the molecular weight and concentration of AaHIV. AaHIV, venom complex (VC), and phosphate buffered saline (PBS) were subsequently used to immunize the mice three times, and the blood was sampled 1 week after the third immunization to determine the serum immunoglobulin G (IgG) antibody titer. A skin-bleeding inhibition assay and toxin-eliminating assay were performed on the immunized mice. The purity and concentration of AaHIV were 86.6% and 1.20 mg/mL, respectively. The AaHIV group exhibited higher antibody titers than the VC group. The survival rate of the AaHIV group (7/10) was significantly higher than that of the PBS group (0/10) (P = 0.0031). The high titer of antibodies induced by AaHIV partially neutralized the bleeding activity of the Deinagkistrodon acutus venom complex. © 2016 Wiley Periodicals, Inc.
Operators of Approximations and Approximate Power Set Spaces
Institute of Scientific and Technical Information of China (English)
ZHANG Xian-yong; MO Zhi-wen; SHU Lan
2004-01-01
Boundary inner and outer operators are introduced; and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.
Subbaraman, Meenakshi Sabina; Kaskutas, Lee Ann
2012-12-01
A trial of "Making Alcoholics Anonymous Easier" (MAAEZ), a group-format 12-step facilitation program, showed significantly higher odds of past 30-day abstinence after 12 months among those who had been treated in MAAEZ compared to usual care, especially for clients with high prior AA/NA/CA meeting attendance (>90 prior meetings; OR = 2.94, p = .02). We examined whether MAAEZ effects for this group were mediated by social support for sobriety and comfort with the 12-step fellowship. Among those with high prior AA/NA/CA attendance, we performed tests of multiple mediation to estimate MAAEZ effects attributable to the combined effect of social network support for sobriety, comfort being at AA/NA/CA meetings, and comfort speaking at AA/NA/CA meetings. To gain some understanding of sustaining these behaviors, we also examined each potential mediating variable measured both prior to, and concurrent with, 12-month outcomes. Having support for sobriety at 6 months emerged as a mediator of 12-month MAAEZ effects, when controlling for comfort being and speaking at AA/NA/CA meetings at 6 months. The effect remained when controlling for mediator values at 12 months, and explained 44% of the MAAEZ effect. Results highlight the value of studying specific, modifiable 12-step activities, and demonstrate the importance of exploring subgroups to determine behaviors and attitudes to target for optimal treatment. For example, increasing support for sobriety among those with high prior AA/NA/CA attendance may be especially pertinent. 2013 APA, all rights reserved
International Conference Approximation Theory XV
Schumaker, Larry
2017-01-01
These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...
Kohler, Susanna
2016-06-01
is less likely to see, and vice versa. Angela Berti detected the signal of galactic conformity all the way to redshift z=1, an effect that makes galaxies more likely to be found around neighbors that are very similar (in terms of color or shape) than different kinds. Georgiana Ogrean closed the session by showing a merger between two galaxies that is not producing a strong shock front. 112: Astronomy Education for All: The 2017 Eclipse, Accessibility and NASA (by Meredith Rawls)This afternoon session kicked off with an advertisement for US-based astronomers favorite upcoming event: the 2017 Solar Eclipse. Jay Pasachoff reviewed plans for the August 21, 2017 event and pointed us to resources about choosing the best viewing site and what to expect on the momentous day. We also heard from Denise Smith, Jim Manning, and Daniel McIntosh about various NASA-funded efforts for education and outreach in the classroom and beyond. A sampling of NASA education and outreach resources compiled over several years, presented by Jim Manning #aas228 pic.twitter.com/T41gdHFoDv Meredith Rawls (@merrdiff) June 13, 2016The other two talks from this session focused on the newly-formed AAS Working Group for Accessibility and Disability and what the astronomical community can do to cultivate a more accessible culture. Speakers Jackie Monkiewicz and Lauren Gilbert described how and why inaccessibility is driving people away from the field: by requiring people with disabilities to disclose those disabilities, by maintaining inaccessible buildings and observatories, by acting inappropriately when accommodations are requested, and by not working well in advance of a course or event to anticipate the needs of people with disabilities. To learn more about what you can do to make astronomy accessible, and what efforts are already underway (including right here at AAS 228), see these resources compiled by AstroBetter.Press Conference: From Molecules to Galaxies (by Leonardo dos Santos
Guidelines for Professional Referral to Alcoholics Anonymous and Other Twelve Step Groups.
Riordan, Richard J.; Walsh, Lani
1994-01-01
Reviews 12-step programs, focusing on Alcoholics Anonymous (AA), the oldest and largest 12-step group. Explores criticisms of AA, describes its components and mechanics, and provides guidelines for client referral. Includes 28 citations. (Author/CRR)
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-07
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
Nonlinear Approximation Using Gaussian Kernels
Hangelbroek, Thomas
2009-01-01
It is well-known that non-linear approximation has an advantage over linear schemes in the sense that it provides comparable approximation rates to those of the linear schemes, but to a larger class of approximands. This was established for spline approximations and for wavelet approximations, and more recently for homogeneous radial basis function (surface spline) approximations. However, no such results are known for the Gaussian function. The crux of the difficulty lies in the necessity to vary the tension parameter in the Gaussian function spatially according to local information about the approximand: error analysis of Gaussian approximation schemes with varying tension are, by and large, an elusive target for approximators. We introduce and analyze in this paper a new algorithm for approximating functions using translates of Gaussian functions with varying tension parameters. Our scheme is sophisticated to a degree that it employs even locally Gaussians with varying tensions, and that it resolves local ...
Forms of Approximate Radiation Transport
Brunner, G
2002-01-01
Photon radiation transport is described by the Boltzmann equation. Because this equation is difficult to solve, many different approximate forms have been implemented in computer codes. Several of the most common approximations are reviewed, and test problems illustrate the characteristics of each of the approximations. This document is designed as a tutorial so that code users can make an educated choice about which form of approximate radiation transport to use for their particular simulation.
Approximation by Multivariate Singular Integrals
Anastassiou, George A
2011-01-01
Approximation by Multivariate Singular Integrals is the first monograph to illustrate the approximation of multivariate singular integrals to the identity-unit operator. The basic approximation properties of the general multivariate singular integral operators is presented quantitatively, particularly special cases such as the multivariate Picard, Gauss-Weierstrass, Poisson-Cauchy and trigonometric singular integral operators are examined thoroughly. This book studies the rate of convergence of these operators to the unit operator as well as the related simultaneous approximation. The last cha
Approximations of fractional Brownian motion
Li, Yuqiang; 10.3150/10-BEJ319
2012-01-01
Approximations of fractional Brownian motion using Poisson processes whose parameter sets have the same dimensions as the approximated processes have been studied in the literature. In this paper, a special approximation to the one-parameter fractional Brownian motion is constructed using a two-parameter Poisson process. The proof involves the tightness and identification of finite-dimensional distributions.
Approximation by planar elastic curves
DEFF Research Database (Denmark)
Brander, David; Gravesen, Jens; Nørbjerg, Toke Bjerge
2016-01-01
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good initial guess for the approximating curve. A gradient......-driven optimization is then used to find the approximating elastic curve....
SwrAA activates poly-gamma-glutamate synthesis in addition to swarming in Bacillus subtilis.
Osera, Cecilia; Amati, Giuseppe; Calvio, Cinzia; Galizzi, Alessandro
2009-07-01
Poly-gamma-glutamic acid (gamma-PGA) is an extracellular polymer produced by various strains of Bacillus. Iotat was first described as the component of the capsule in Bacillus anthracis, where it plays a relevant role in virulence. gamma-PGA is also a distinctive component of 'natto', a traditional Japanese food consisting of soybean fermented by Bacillus subtilis (natto). Domesticated B. subtilis strains do not synthesize gamma-PGA although they possess the functional biosynthetic pgs operon. In the present work we explore the correlation between the genetic determinants, swrAA and degU, which allow a derivative of the domestic strain JH642 to display a mucoid colony morphology on LB agar plates due to the production of gamma-PGA. Full activation of the pgs operon requires the co-presence of SwrAA and the phosphorylated form of DegU (DegU approximately P). The presence of either DegU approximately P or SwrAA alone has only marginal effects on pgs operon transcription and gamma-PGA production. Although SwrAA was identified as necessary for swarming and full swimming motility together with DegU, we show that motility is not involved in gamma-PGA production. Activation of gamma-PGA synthesis is therefore a motility-independent phenotype in which SwrAA and DegU approximately P display a cooperative effect.
International Conference Approximation Theory XIV
Schumaker, Larry
2014-01-01
This volume developed from papers presented at the international conference Approximation Theory XIV, held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.
Exact constants in approximation theory
Korneichuk, N
1991-01-01
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base
Self-polymerization of Eu(TTA)3AA in rubber and their fluorescence effect
Institute of Scientific and Technical Information of China (English)
姚璐; 温世鹏; 段雪; 胡晓丹; 车明生; 景文峰; 刘浩亮; 刘力
2013-01-01
A simple europium complex, Eu(TTA)3AA (TTA=4,4,4-trifluoro-1-(2-thienyl)-1,3-butanedione, AA=acrylic acid) was syn-thesized by a simple solution method. Then, two kinds of rubber matrix, nitrile-butadiene rubber (NBR) and silicone rubber (SiR) were used as the substrate for Eu(TTA)3AA to prepare fluorescence composites. The neat Eu(TTA)3AA complex showed the ability of self-polymerization when it was heated at 145 °C. It was found that the fluorescence intensity of the neat Eu(TTA)3AA decreased over 70%when the polymerization time was over 25 min at 145 °C. The results also revealed that the polymerizated Eu(TTA)3AA could be dispersed in nano-scale in two matrices and the luminescent intensities decreased 52%in NBR matrix, and 95%in SiR ma-trix compared with two relative compounds without crosslinking. To optimize the luminescence intensity of the composites, the Eu(TTA)3AA polymerization kinetic process in matrix was investigated in detail by controlling the temperature, the crosslinking agent, etc. The results showed that the peroxide could accelerate Eu(TTA)3AA self-polymerization in the rubber matrix, and therefore improved the dispersion, but not be helpful for the luminescence intensity enhancement. In addition, the relatively higher luminescence intensity in Eu(TTA)3AA/NBR in comparison to that of Eu(TTA)3AA/SiR might contribute to the interaction between nitrile group (-CN) in NBR and Eu-complexes, suggesting that the luminescence intensity of the composites also depended on the matrix characteristics.
A systematic sequence of relativistic approximations.
Dyall, Kenneth G
2002-06-01
An approach to the development of a systematic sequence of relativistic approximations is reviewed. The approach depends on the atomically localized nature of relativistic effects, and is based on the normalized elimination of the small component in the matrix modified Dirac equation. Errors in the approximations are assessed relative to four-component Dirac-Hartree-Fock calculations or other reference points. Projection onto the positive energy states of the isolated atoms provides an approximation in which the energy-dependent parts of the matrices can be evaluated in separate atomic calculations and implemented in terms of two sets of contraction coefficients. The errors in this approximation are extremely small, of the order of 0.001 pm in bond lengths and tens of microhartrees in absolute energies. From this approximation it is possible to partition the atoms into relativistic and nonrelativistic groups and to treat the latter with the standard operators of nonrelativistic quantum mechanics. This partitioning is shared with the relativistic effective core potential approximation. For atoms in the second period, errors in the approximation are of the order of a few hundredths of a picometer in bond lengths and less than 1 kJ mol(-1) in dissociation energies; for atoms in the third period, errors are a few tenths of a picometer and a few kilojoule/mole, respectively. A third approximation for scalar relativistic effects replaces the relativistic two-electron integrals with the nonrelativistic integrals evaluated with the atomic Foldy-Wouthuysen coefficients as contraction coefficients. It is similar to the Douglas-Kroll-Hess approximation, and is accurate to about 0.1 pm and a few tenths of a kilojoule/mole. The integrals in all the approximations are no more complicated than the integrals in the full relativistic methods, and their derivatives are correspondingly easy to formulate and evaluate.
BDD Minimization for Approximate Computing
Soeken, Mathias; Grosse, Daniel; Chandrasekharan, Arun; Drechsler, Rolf
2016-01-01
We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representation but meets a threshold w.r.t. an error metric. We present operators to derive approximated functions and present algorithms to exactly compute the error metrics directly on the BDD representation. An experimental evaluation demonstrates the app...
Tree wavelet approximations with applications
Institute of Scientific and Technical Information of China (English)
XU Yuesheng; ZOU Qingsong
2005-01-01
We construct a tree wavelet approximation by using a constructive greedy scheme(CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.
Some results in Diophantine approximation
DEFF Research Database (Denmark)
the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered...
Beyond the random phase approximation
DEFF Research Database (Denmark)
Olsen, Thomas; Thygesen, Kristian S.
2013-01-01
We assess the performance of a recently proposed renormalized adiabatic local density approximation (rALDA) for ab initio calculations of electronic correlation energies in solids and molecules. The method is an extension of the random phase approximation (RPA) derived from time-dependent density...
Uniform approximation by (quantum) polynomials
Drucker, A.; de Wolf, R.
2011-01-01
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectivel
Global approximation of convex functions
Azagra, D
2011-01-01
We show that for every (not necessarily bounded) open convex subset $U$ of $\\R^n$, every (not necessarily Lipschitz or strongly) convex function $f:U\\to\\R$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and $C^k$ smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on $\\R^n$ by strongly convex functions.
Approximate circuits for increased reliability
Energy Technology Data Exchange (ETDEWEB)
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.
Approximate circuits for increased reliability
Energy Technology Data Exchange (ETDEWEB)
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.
Chen, Yu; Ding, Hua; Cai, Zhihui; Zhao, Jingwei; Li, Jizhong
2016-12-01
Friction stir welding (FSW) has been used for joining AA5083 and AA7B04 alloy sheets with the aim of studying the microstructure and the mechanical properties of dissimilar FSW joints obtained by varying the initial base metal state of AA7B04 alloy. The results show that the initial base metal state has a significant impact on the material flow during dissimilar FSW. As compared with the joints placing hard alloy (artificially aged AA7B04-AA or naturally aged AA7B04-NA) on the retreating side, it becomes easier transporting AA5083 from advancing side to retreating side when soft alloy (annealed AA7B04-O) is placed on the retreating side. The atomic diffusion does not occur at the interface between AA5083 and AA7B04, indicating that the mixing of the two materials is merely mechanical. Grain refinement is observed in the stir zone. The failure location during tensile tests is different depending on the initial base metal state. The joints (AA5083/AA7B04-AA and AA5083/AA7B04-O) fail in the base metal on the soft material side which corresponds to the minimum values in hardness profiles. Differently, the joints (AA5083/AA5083 and AA5083/AA7B04-O) fail in the stir zone due to the presence of defects including "zigzag line," kissing bond and discontinuous voids.
Chen, Yu; Ding, Hua; Cai, Zhihui; Zhao, Jingwei; Li, Jizhong
2017-02-01
Friction stir welding (FSW) has been used for joining AA5083 and AA7B04 alloy sheets with the aim of studying the microstructure and the mechanical properties of dissimilar FSW joints obtained by varying the initial base metal state of AA7B04 alloy. The results show that the initial base metal state has a significant impact on the material flow during dissimilar FSW. As compared with the joints placing hard alloy (artificially aged AA7B04-AA or naturally aged AA7B04-NA) on the retreating side, it becomes easier transporting AA5083 from advancing side to retreating side when soft alloy (annealed AA7B04-O) is placed on the retreating side. The atomic diffusion does not occur at the interface between AA5083 and AA7B04, indicating that the mixing of the two materials is merely mechanical. Grain refinement is observed in the stir zone. The failure location during tensile tests is different depending on the initial base metal state. The joints (AA5083/AA7B04-AA and AA5083/AA7B04-O) fail in the base metal on the soft material side which corresponds to the minimum values in hardness profiles. Differently, the joints (AA5083/AA5083 and AA5083/AA7B04-O) fail in the stir zone due to the presence of defects including "zigzag line," kissing bond and discontinuous voids.
AA, closed orbit observation pickup
CERN PhotoLab
1980-01-01
Electrostatic pickups around the circumference of the AA served for the measurement of the closed orbits across the wide momentum range of +- 3% to either side of central orbit. The pickups were of the "shoebox" type, with diagonal cuts, a horizontal and a vertical one mechanically coupled together. They were located where they would not require extra space. The wide ones (very wide indeed: 70 cm), like the one we see here, were placed inside the vacuum chamber of the wide quadrupoles QFW, at maximum dispersion. See also 8001372, 8001383, 8010045
AA, closed orbit observation pickup
CERN PhotoLab
1980-01-01
Electrostatic pickups around the circumference of the AA served for the measurement of the closed orbits across the wide momentum range of +- 3% to either side of central orbit. The pickups were of the "shoebox" type, with diagonal cuts, a horizontal and a vertical one mechanically coupled together. They were located where they would not require extra space. The wide ones (very wide indeed: 70 cm), like the one we see here, were placed inside the vacuum chamber of the wide quadrupoles, QFW, at maximum dispersion. See also 8001372,8001383, 8010042
AA, closed orbit observation pickup
1980-01-01
Electrostatic pickups around the circumference of the AA served for the measurement of the closed orbits across the wide momentum range of +- 3% to either side of central orbit. The pickups were of the "shoebox" type, with diagonal cuts, a horizontal and a vertical one mechanically coupled together. They were located where they would not require extra space. The small ones, like the one we see here, were inserted into the vacuum chamber of the BLG (long and narrow) bending magnets. See also 8001372, 8010042, 8010045
AA, closed orbit observation pickup
CERN PhotoLab
1980-01-01
Electrostatic pickups around the circumference of the AA served for the measurement of the closed orbits across the wide momentum range of +- 3% to either side of central orbit. The pickups were of the "shoebox" type, with diagonal cuts, a horizontal and a vertical one mechanically coupled together. They were located where they would not require extra space. The small ones, like the one we see here, were inserted into the vacuum chamber of the BLG (long and narrow) bending magnets. Werner Sax contemplates his achievement. See also 8001383, 8010042, 8010045.
Rytov approximation in electron scattering
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.
Rollout sampling approximate policy iteration
Dimitrakakis, C.; Lagoudakis, M.G.
2008-01-01
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a
Approximate common divisors via lattices
Cohn, Henry
2011-01-01
We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common divisor of size N^beta, this improves the size of the error tolerated from N^(beta^2) to N^(beta^((m+1)/m)), under a commonly used heuristic assumption. This gives a more detailed analysis of the hardness assumption underlying the recent fully homomorphic cryptosystem of van Dijk, Gentry, Halevi, and Vaikuntanathan. While these results do not challenge the suggested parameters, a 2^sqrt(n) approximation algorithm for lattice basis reduction in n dimensions could be used to break these parameters. We have implemented our algorithm, and it performs better in practice than the theoretical analysis suggests. Our results fit into a broader context of analogies between cryptanalysis and coding theory. The multivariate approximate common divisor problem is the number-theoretic analogue of noisy multivariate polynomial interpolation, and we ...
Approximate Implicitization Using Linear Algebra
Directory of Open Access Journals (Sweden)
Oliver J. D. Barrowclough
2012-01-01
Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.
Binary nucleation beyond capillarity approximation
Kalikmanov, V.I.
2010-01-01
Large discrepancies between binary classical nucleation theory (BCNT) and experiments result from adsorption effects and inability of BCNT, based on the phenomenological capillarity approximation, to treat small clusters. We propose a model aimed at eliminating both of these deficiencies. Adsorption
Weighted approximation with varying weight
Totik, Vilmos
1994-01-01
A new construction is given for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form w"n"(" "= uppercase)P"n"(" "= uppercase). The new technique settles several open problems, and it leads to a simple proof for the strong asymptotics on some L p(uppercase) extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power- type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified toyield (in a sense) uniformly good approximation on the whole support. This allows one to deduce strong asymptotics in some L p(uppercase) extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behavior of orthogonal polynomials and multipoint Pade approximation. The approach is potential-theoretic, but the text is self-contained.
Nonlinear approximation with redundant dictionaries
DEFF Research Database (Denmark)
Borup, Lasse; Nielsen, M.; Gribonval, R.
2005-01-01
In this paper we study nonlinear approximation and data representation with redundant function dictionaries. In particular, approximation with redundant wavelet bi-frame systems is studied in detail. Several results for orthonormal wavelets are generalized to the redundant case. In general......, for a wavelet bi-frame system the approximation properties are limited by the number of vanishing moments of the system. In some cases this can be overcome by oversampling, but at a price of replacing the canonical expansion by another linear expansion. Moreover, for special non-oversampled wavelet bi-frames we...... can obtain good approximation properties not restricted by the number of vanishing moments, but again without using the canonical expansion....
Approximate transformations for van der Pol-type equations
Directory of Open Access Journals (Sweden)
R. K. Gazizov
2006-01-01
Full Text Available Classification of van der Pol-type equations with respect to admitted approximate transformation groups transforming a small parameter is given. It is shown that approximate symmetries transforming the small parameter as well as the usual approximate symmetries can be used for approximate integration (e.g., by method of successive reduction of order of ordinary differential equations with a small parameter.
Twisted inhomogeneous Diophantine approximation and badly approximable sets
Harrap, Stephen
2010-01-01
For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max {||qx_1||^(-i), ||qx_2||^(-j)} > c(x)/q for all q in N. Building on a result of Kurzweil, a new characterization of the set Bad(i, j) in terms of `well-approximable' vectors in the area of `twisted' inhomogeneous Diophantine approximation is established. In addition, it is shown that Bad^x(i, j), the `twisted' inhomogeneous analogue of Bad(i, j), has full Hausdorff dimension 2 when x is chosen from the set Bad(i, j).
Kohler, Susanna
2016-06-01
Editors Note:This week were at the 228th AAS Meeting in San Diego, CA. Along with a team ofauthors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting twiceeach day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Wikipedia Year of Science Editathon (by Meredith Rawls)Whats your first go-to source for an unfamiliar topic on the internet? If you said Wikipedia, youre not alone. For many people, Wikipedia is the primary source of information about astronomy and science. However, many Wikipedia articles about science topics are incomplete or missing, and women are underrepresented among scientists with biographies.To address this, the AAS Astronomy Education Board teamed up with the Wiki Education Foundation to host an edit-a-thon as part of the Wikipedia Year of Science. More than forty attendees spent the better part of three hours working through tutorials, creating new articles, and editing existing ones. The session was generously sponsored by the Simons Foundation.The Year of Science initiative seeks to bring Wikipedia editing skills to the classroom and help new editors find sustainable ways to contribute to Wikipedia in the long term. Anybody can create a free account and start editing!As a first-time Wikipedia contributor, I took the time to go through nearly all the tutorial exercises and familiarize myself with the process of editing a page. I decided to flesh out one section in an existing page about asteroseismology. Others created biography pages from scratch or selected various astronomical topics to write about. To me, the editing process felt like a cross between writing a blog post and a journal article, in a hack day type environment. Working through the tutorial and some examples renewed my empathy for learners who are tackling a new skill set for the first time. A full summary of our
Reinforcement Learning via AIXI Approximation
Veness, Joel; Hutter, Marcus; Silver, David
2010-01-01
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian optimality notion for general reinforcement learning agents. Previously, it has been unclear whether the theory of AIXI could motivate the design of practical algorithms. We answer this hitherto open question in the affirmative, by providing the first computationally feasible approximation to the AIXI agent. To develop our approximation, we introduce a Monte Carlo Tree Search algorithm along with an agent-specific extension of the Context Tree Weighting algorithm. Empirically, we present a set of encouraging results on a number of stochastic, unknown, and partially observable domains.
Approximate Matching of Hierarchial Data
DEFF Research Database (Denmark)
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...
Concept Approximation between Fuzzy Ontologies
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Fuzzy ontologies are efficient tools to handle fuzzy and uncertain knowledge on the semantic web; but there are heterogeneity problems when gaining interoperability among different fuzzy ontologies. This paper uses concept approximation between fuzzy ontologies based on instances to solve the heterogeneity problems. It firstly proposes an instance selection technology based on instance clustering and weighting to unify the fuzzy interpretation of different ontologies and reduce the number of instances to increase the efficiency. Then the paper resolves the problem of computing the approximations of concepts into the problem of computing the least upper approximations of atom concepts. It optimizes the search strategies by extending atom concept sets and defining the least upper bounds of concepts to reduce the searching space of the problem. An efficient algorithm for searching the least upper bounds of concept is given.
Approximating Graphic TSP by Matchings
Mömke, Tobias
2011-01-01
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
Diophantine approximation and Dirichlet series
Queffélec, Hervé
2013-01-01
This self-contained book will benefit beginners as well as researchers. It is devoted to Diophantine approximation, the analytic theory of Dirichlet series, and some connections between these two domains, which often occur through the Kronecker approximation theorem. Accordingly, the book is divided into seven chapters, the first three of which present tools from commutative harmonic analysis, including a sharp form of the uncertainty principle, ergodic theory and Diophantine approximation to be used in the sequel. A presentation of continued fraction expansions, including the mixing property of the Gauss map, is given. Chapters four and five present the general theory of Dirichlet series, with classes of examples connected to continued fractions, the famous Bohr point of view, and then the use of random Dirichlet series to produce non-trivial extremal examples, including sharp forms of the Bohnenblust-Hille theorem. Chapter six deals with Hardy-Dirichlet spaces, which are new and useful Banach spaces of anal...
Approximation methods in probability theory
Čekanavičius, Vydas
2016-01-01
This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.
Approximate Sparse Regularized Hyperspectral Unmixing
Directory of Open Access Journals (Sweden)
Chengzhi Deng
2014-01-01
Full Text Available Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel. In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU, is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery. And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem. In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer. Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer. Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.
Transfinite Approximation of Hindman's Theorem
Beiglböck, Mathias
2010-01-01
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring of the integers there are arbitrarily long finite sets with the same property. We extend the finite form of Hindman's Theorem to a "transfinite" version for each countable ordinal, and show that Hindman's Theorem is equivalent to the appropriate transfinite approximation holding for every countable ordinal. We then give a proof of Hindman's Theorem by directly proving these transfinite approximations.
Adiabatic approximation of time-dependent density matrix functional response theory.
Pernal, Katarzyna; Giesbertz, Klaas; Gritsenko, Oleg; Baerends, Evert Jan
2007-12-07
Time-dependent density matrix functional theory can be formulated in terms of coupled-perturbed response equations, in which a coupling matrix K(omega) features, analogous to the well-known time-dependent density functional theory (TDDFT) case. An adiabatic approximation is needed to solve these equations, but the adiabatic approximation is much more critical since there is not a good "zero order" as in TDDFT, in which the virtual-occupied Kohn-Sham orbital energy differences serve this purpose. We discuss a simple approximation proposed earlier which uses only results from static calculations, called the static approximation (SA), and show that it is deficient, since it leads to zero response of the natural orbital occupation numbers. This leads to wrong behavior in the omega-->0 limit. An improved adiabatic approximation (AA) is formulated. The two-electron system affords a derivation of exact coupled-perturbed equations for the density matrix response, permitting analytical comparison of the adiabatic approximation with the exact equations. For the two-electron system also, the exact density matrix functional (2-matrix in terms of 1-matrix) is known, enabling testing of the static and adiabatic approximations unobscured by approximations in the functional. The two-electron HeH(+) molecule shows that at the equilibrium distance, SA consistently underestimates the frequency-dependent polarizability alpha(omega), the adiabatic TDDFT overestimates alpha(omega), while AA improves upon SA and, indeed, AA produces the correct alpha(0). For stretched HeH(+), adiabatic density matrix functional theory corrects the too low first excitation energy and overpolarization of adiabatic TDDFT methods and exhibits excellent agreement with high-quality CCSD ("exact") results over a large omega range.
Tree wavelet approximations with applications
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
[1]Baraniuk, R. G., DeVore, R. A., Kyriazis, G., Yu, X. M., Near best tree approximation, Adv. Comput. Math.,2002, 16: 357-373.[2]Cohen, A., Dahmen, W., Daubechies, I., DeVore, R., Tree approximation and optimal encoding, Appl. Comput.Harmonic Anal., 2001, 11: 192-226.[3]Dahmen, W., Schneider, R., Xu, Y., Nonlinear functionals of wavelet expansions-adaptive reconstruction and fast evaluation, Numer. Math., 2000, 86: 49-101.[4]DeVore, R. A., Nonlinear approximation, Acta Numer., 1998, 7: 51-150.[5]Davis, G., Mallat, S., Avellaneda, M., Adaptive greedy approximations, Const. Approx., 1997, 13: 57-98.[6]DeVore, R. A., Temlyakov, V. N., Some remarks on greedy algorithms, Adv. Comput. Math., 1996, 5: 173-187.[7]Kashin, B. S., Temlyakov, V. N., Best m-term approximations and the entropy of sets in the space L1, Mat.Zametki (in Russian), 1994, 56: 57-86.[8]Temlyakov, V. N., The best m-term approximation and greedy algorithms, Adv. Comput. Math., 1998, 8:249-265.[9]Temlyakov, V. N., Greedy algorithm and m-term trigonometric approximation, Constr. Approx., 1998, 14:569-587.[10]Hutchinson, J. E., Fractals and self similarity, Indiana. Univ. Math. J., 1981, 30: 713-747.[11]Binev, P., Dahmen, W., DeVore, R. A., Petruchev, P., Approximation classes for adaptive methods, Serdica Math.J., 2002, 28: 1001-1026.[12]Gilbarg, D., Trudinger, N. S., Elliptic Partial Differential Equations of Second Order, Berlin: Springer-Verlag,1983.[13]Ciarlet, P. G., The Finite Element Method for Elliptic Problems, New York: North Holland, 1978.[14]Birman, M. S., Solomiak, M. Z., Piecewise polynomial approximation of functions of the class Wαp, Math. Sb.,1967, 73: 295-317.[15]DeVore, R. A., Lorentz, G. G., Constructive Approximation, New York: Springer-Verlag, 1993.[16]DeVore, R. A., Popov, V., Interpolation of Besov spaces, Trans. Amer. Math. Soc., 1988, 305: 397-414.[17]Devore, R., Jawerth, B., Popov, V., Compression of wavelet decompositions, Amer. J. Math., 1992, 114: 737-785.[18]Storozhenko, E
Behmand, Saleh Alaei; Mirsalehi, Seyyed Ehsan; Omidvar, Hamid; Safarkhanian, Mohammad Ali
2016-10-01
In this article, filling friction stir welding (FFSW) of the remaining exit holes of AA5456 alloy friction-stir-welded lap joints was studied. For this purpose, the influences of different rotating speeds, holding times, and pin materials, AA5456 and AA2024, on the metallurgical structure and joint strength were investigated. The observations showed that defect-free lap joints are successfully obtainable by this method using similar and dissimilar consumable pins. The results indicated that the higher rotating speed and holding time adversely affect the weld performance. The best result was achieved for 30 seconds holding time, 500 rpm rotating speed, and AA2024 consumable pin. In this condition, a lap shear strength of 10 pct higher than that of the nonfilled joint, equivalent to about 94 pct of the original defect-free FSW joint, was obtained, whereas the GTAW filled joint showed only approximately 87 pct of the continuous FSW joint strength.
Kohler, Susanna
2016-06-01
Editors Note:This week were at the 228th AAS Meeting in San Diego, CA. Along with a team ofauthors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting twiceeach day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Come visit astrobites at the AAS booth we have swag!Things kicked off last night at our undergraduate reception booth. Thanks to all of you who stopped by we were delightedto hear from undergrads who already know and love the site, educators who want to use it in their classrooms, and students who had not yet been introduced to astrobites and were excited about a new resource!For the rest of the meeting we will be stationed at theAAS booth in the exhibit hall (booth #211-213), so drop by if you want to learn more (or pick up swag: weve got lots of stickers and sunglasses)!Mondaymorning was the official start of the meeting. Here are just a few of the talks and workshops astrobiters attended this morning.Opening Address(by Susanna Kohler)AAS President Meg Urry kicked off the meeting this morning at 8am with an overview of some of the great endeavors AAS is supporting. We astrobiters had personal motivation to drag ourselves out of bed that early: during this session, Urryannounced the new partnership between AAS and astrobites!Urry touched on some difficult topics in her welcome, including yesterdays tragedy in Orlando. Shereiteratedthe AASs support fortheCommittee for Sexual-Orientation and Gender Minorities in Astronomy (SGMA). She also reminded meeting attendees about the importance ofkeeping conference interactions professional, and pointed to the meetings anti-harassment policy.Partnership Announcement (by Michael Zevin)This morning, the American Astronomical Society announced the new partnership that it will have with Astrobites! We are beyond excited to embark on this new partnership with the
WKB Approximation in Noncommutative Gravity
Directory of Open Access Journals (Sweden)
Maja Buric
2007-12-01
Full Text Available We consider the quasi-commutative approximation to a noncommutative geometry defined as a generalization of the moving frame formalism. The relation which exists between noncommutativity and geometry is used to study the properties of the high-frequency waves on the flat background.
Approximation properties of haplotype tagging
Directory of Open Access Journals (Sweden)
Dreiseitl Stephan
2006-01-01
Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.
Truthful approximations to range voting
DEFF Research Database (Denmark)
Filos-Ratsika, Aris; Miltersen, Peter Bro
We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare...
Approximate Reasoning with Fuzzy Booleans
Broek, van den P.M.; Noppen, J.A.R.
2004-01-01
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp ante
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
2013-01-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
On badly approximable complex numbers
DEFF Research Database (Denmark)
Esdahl-Schou, Rune; Kristensen, S.
We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...
Rational approximation of vertical segments
Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte
2007-08-01
In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.
Approximation on the complex sphere
Alsaud, Huda; Kushpel, Alexander; Levesley, Jeremy
2012-01-01
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations. The results obtained is a synthesis of new results on classical orthogonal polynomials, harmonic analysis on manifolds and geometric properties of Euclidean spaces.
On badly approximable complex numbers
DEFF Research Database (Denmark)
Esdahl-Schou, Rune; Kristensen, S.
We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...
Pythagorean Approximations and Continued Fractions
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…
Approximation of Surfaces by Cylinders
DEFF Research Database (Denmark)
Randrup, Thomas
1998-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...
Approximate Reanalysis in Topology Optimization
DEFF Research Database (Denmark)
Amir, Oded; Bendsøe, Martin P.; Sigmund, Ole
2009-01-01
In the nested approach to structural optimization, most of the computational effort is invested in the solution of the finite element analysis equations. In this study, the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures...
Low Rank Approximation in $G_0W_0$ Approximation
Shao, Meiyue; Yang, Chao; Liu, Fang; da Jornada, Felipe H; Deslippe, Jack; Louie, Steven G
2016-01-01
The single particle energies obtained in a Kohn--Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in transport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green's function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The $G_0W_0$ approximation is a widely used technique in which the self energy is expressed as the convolution of a non-interacting Green's function ($G_0$) and a screened Coulomb interaction ($W_0$) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating $W_0$ at multiple frequencies. In this paper, we discuss how the cos...
First circulating beam in the AA
1980-01-01
On 3 July 1980, two years after project authorization, beam circulated for the first time in the AA. It was a 3.56 GeV/c proton test beam. We see an expecting crowd, minutes before the happy event. The persons are too numerous to name them all, but the 3 most prominent ones are at the centre (left to right): Roy Billinge (Joint AA Project Leader, with his hand on the control box), Eifionydd Jones (white shirt), Simon van der Meer (spiritus rector and Joint AA Project Leader). The first antiprotons were injected, made to circulate and cooled soon after, on 14 July 1980.
Smit, EN; Koopmann, M; Boersma, ER; Muskiet, FAJ
2000-01-01
We investigated whether supplementation with arachidonic acid (20:4 omega 6; AA), ora combination of AA and docosahexaenoic acid (22:6 omega 3; DHA) would affect human milk polyunsaturated fatty acid (PUFA) composition. Ten women were daily supplemented with 300 mg AA, eight with 300 mg AA, 110 mg e
Smit, EN; Koopmann, M; Boersma, ER; Muskiet, FAJ
We investigated whether supplementation with arachidonic acid (20:4 omega 6; AA), ora combination of AA and docosahexaenoic acid (22:6 omega 3; DHA) would affect human milk polyunsaturated fatty acid (PUFA) composition. Ten women were daily supplemented with 300 mg AA, eight with 300 mg AA, 110 mg
Approximate Inference for Wireless Communications
DEFF Research Database (Denmark)
Hansen, Morten
This thesis investigates signal processing techniques for wireless communication receivers. The aim is to improve the performance or reduce the computationally complexity of these, where the primary focus area is cellular systems such as Global System for Mobile communications (GSM) (and extensions...... complexity can potentially lead to limited power consumption, which translates into longer battery life-time in the handsets. The scope of the thesis is more specifically to investigate approximate (nearoptimal) detection methods that can reduce the computationally complexity significantly compared...... to the optimal one, which usually requires an unacceptable high complexity. Some of the treated approximate methods are based on QL-factorization of the channel matrix. In the work presented in this thesis it is proven how the QL-factorization of frequency-selective channels asymptotically provides the minimum...
Hydrogen Beyond the Classic Approximation
Scivetti, I
2003-01-01
The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position
Validity of the eikonal approximation
Kabat, D
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymptotic behavior of the full amplitude. For spin--2 tensor fields the eikonal captures the leading behavior of each order in perturbation theory, but the sum of eikonal terms is subdominant to graphs neglected by the approximation. We also comment on the eikonal for Yang-Mills vector exchange, where the additional complexities of the non-abelian theory may be absorbed into Regge-type modifications of the gauge boson propagators.
Approximate Privacy: Foundations and Quantification
Feigenbaum, Joan; Schapira, Michael
2009-01-01
Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of online sensitive data about individuals and organizations. Consequently, concern about the privacy of these data has become a top priority, particularly those data that are created and used in electronic commerce. There have been many formulations of privacy and, unfortunately, many negative results about the feasibility of maintaining privacy of sensitive data in realistic networked environments. We formulate communication-complexity-based definitions, both worst-case and average-case, of a problem's privacy-approximation ratio. We use our definitions to investigate the extent to which approximate privacy is achievable in two standard problems: the second-price Vickrey auction and the millionaires problem of Yao. For both the second-price Vickrey auction and the millionaires problem, we show that not only is perfect privacy impossible or infeasibly costly to achieve...
Validity of the Eikonal Approximation
Kabat, Daniel
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymp...
Friction Stir Weldabilities of AA1050-H24 and AA6061-T6 Aluminum Alloys
Institute of Scientific and Technical Information of China (English)
Huijie LIU; Hidetoshi FUJIN; Masakatsu MAEDA; Kiyoshi NOGI
2005-01-01
The friction stir weldabilities of the strain-hardened AA1050-H24 and precipitate-hardened AA6061-T6 aluminum alloys were examined to reveal the effects of material properties on the friction stir welding behavior. The experimental results are obtlained. (1) For AA1050-H24, the weld can possess smoother surface ripples; there is no elliptical weld nugget in the weld; there is no discernible interface between the stir zone and the thermomechanically affected zone;and the internal defect of the weld looks like a long crack and is located in the lower part of the weld. (2) For AA6061-T6, the weld usually possesses slightly rougher surface ripples; an elliptical weld nugget clearly exists in the weld; there are discernible interfaces among the weld nugget, thermomechanically affected zone and heat affected zone; and the internal defect of the weld is similar to that of the AA1050-H24 weld. (3) The effective range of welding parameters for AA1050-H24 is narrow, while the one for AA6061-T6 is very wide. (4) The maximum tensile strength efficiency of the AA1050-H24 joints is similar to that of the AA6061-T6 joints, i.e. 79% and 77%, respectively.
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.
Directory of Open Access Journals (Sweden)
Péter L Erdős
Full Text Available 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.
Many Faces of Boussinesq Approximations
Vladimirov, Vladimir A
2016-01-01
The \\emph{equations of Boussinesq approximation} (EBA) for an incompressible and inhomogeneous in density fluid are analyzed from a viewpoint of the asymptotic theory. A systematic scaling shows that there is an infinite number of related asymptotic models. We have divided them into three classes: `poor', `reasonable' and `good' Boussinesq approximations. Each model can be characterized by two parameters $q$ and $k$, where $q =1, 2, 3, \\dots$ and $k=0, \\pm 1, \\pm 2,\\dots$. Parameter $q$ is related to the `quality' of approximation, while $k$ gives us an infinite set of possible scales of velocity, time, viscosity, \\emph{etc.} Increasing $q$ improves the quality of a model, but narrows the limits of its applicability. Parameter $k$ allows us to vary the scales of time, velocity and viscosity and gives us the possibility to consider any initial and boundary conditions. In general, we discover and classify a rich variety of possibilities and restrictions, which are hidden behind the routine use of the Boussinesq...
The power of alternative assessments (AAs)
Institute of Scientific and Technical Information of China (English)
张千茜
2013-01-01
This article starts by discussing the potential disadvantages of traditional assessment towards young English as a Second Language (ESL) learners within the American public school education system. In response to such disadvantages, researchers ’call for the implementation of alternative assessments (AAs) is therefore introduced along with the various benefits of AAs. However, the current mainstream education policy in the US, namely No Child Left Behind (NCLB) Policy, is still largely based on the tra-ditional ways of testing, making policy-oriented implementation of AAs on large scales remarkably difficult. After careful analysis, the author points out several implications concerning how, under such an existing policy of NCLB, can practitioners effectively accommodate young ESL learners by applying the power of AAs.
Magnetic horn of the Antiproton Accumulator (AA)
Photographic Service
1988-01-01
In the 1960s, the invention of this "current sheet lens" has helped to greatly improve the flux of neutrino beams. It was used again at the AA, collecting antiprotons from the production target at angles too large to fit into the acceptance of the AA. It was machined from aluminium to a thickness of 1.4 mm and pulsed at 400 kA for 15 microseconds (half-sine).
Rollout Sampling Approximate Policy Iteration
Dimitrakakis, Christos
2008-01-01
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions which focus on policy representation using classifiers and address policy learning as a supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.
Approximate Deconvolution Reduced Order Modeling
Xie, Xuping; Wang, Zhu; Iliescu, Traian
2015-01-01
This paper proposes a large eddy simulation reduced order model(LES-ROM) framework for the numerical simulation of realistic flows. In this LES-ROM framework, the proper orthogonal decomposition(POD) is used to define the ROM basis and a POD differential filter is used to define the large ROM structures. An approximate deconvolution(AD) approach is used to solve the ROM closure problem and develop a new AD-ROM. This AD-ROM is tested in the numerical simulation of the one-dimensional Burgers equation with a small diffusion coefficient(10^{-3})
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
Plasma Physics Approximations in Ares
Energy Technology Data Exchange (ETDEWEB)
Managan, R. A.
2015-01-08
Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, F_{n}( μ/θ ), the chemical potential, μ or ζ = ln(1+e^{ μ/θ} ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A^{α} (ζ ),A^{β} (ζ ), ζ, f(ζ ) = (1 + e^{-μ/θ})F_{1/2}(μ/θ), F_{1/2}'/F_{1/2}, F_{c}^{α}, and F_{c}^{β}. In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.
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 (gamma sub i); the (gamma sub i) 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 (gamma sub i). 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.
Negative Affect, Relapse, and Alcoholics Anonymous (AA): Does AA Work by Reducing Anger?*
Kelly, John F.; Stout, Robert L.; Tonigan, J. Scott; Magill, Molly; Pagano, Maria E.
2010-01-01
Objective: Anger and other indices of negative affect have been implicated in a stress-induced pathway to relapse. The Alcoholics Anonymous (AA) literature states that reduction of anger is critical to recovery, yet this proposed mechanism has rarely been investigated. Using lagged, controlled hierarchical linear modeling analyses, this study investigated whether AA attendance mobilized changes in anger and whether such changes explained AA-related benefit. Method: Alcohol-dependent adults (N = 1,706) receiving treatment as part of a clinical trial were assessed at intake and at 3, 6, 9, 12, and 15 months. Results: Findings revealed substantially elevated levels of anger compared with the general population (98th percentile) that decreased over 15-month follow-up but remained high (89th percentile). AA attendance was associated with better drinking outcomes, and higher levels of anger were associated with heavier drinking. However, AA attendance was unrelated to changes in anger. Conclusions: Although support was not found for anger as a mediator, there was strong convergence between AA's explicit emphasis on anger and the present findings: Anger appears to be a serious, enduring problem related to relapse and heavy alcohol consumption. Methodological factors may have contributed to the lack of association between AA and anger, but results suggest that AA attendance alone may be insufficient to alleviate the suffering and alcohol-related risks specifically associated with anger. PMID:20409438
Negative affect, relapse, and Alcoholics Anonymous (AA): does AA work by reducing anger?
Kelly, John F; Stout, Robert L; Tonigan, J Scott; Magill, Molly; Pagano, Maria E
2010-05-01
Anger and other indices of negative affect have been implicated in a stress-induced pathway to relapse. The Alcoholics Anonymous (AA) literature states that reduction of anger is critical to recovery, yet this proposed mechanism has rarely been investigated. Using lagged, controlled hierarchical linear modeling analyses, this study investigated whether AA attendance mobilized changes in anger and whether such changes explained AA-related benefit. Alcohol-dependent adults (N = 1,706) receiving treatment as part of a clinical trial were assessed at intake and at 3, 6, 9, 12, and 15 months. Findings revealed substantially elevated levels of anger compared with the general population (98th percentile) that decreased over 15-month follow-up but remained high (89th percentile). AA attendance was associated with better drinking outcomes, and higher levels of anger were associated with heavier drinking. However, AA attendance was unrelated to changes in anger. Although support was not found for anger as a mediator, there was strong convergence between AA's explicit emphasis on anger and the present findings: Anger appears to be a serious, enduring problem related to relapse and heavy alcohol consumption. Methodological factors may have contributed to the lack of association between AA and anger, but results suggest that AA attendance alone may be insufficient to alleviate the suffering and alcohol-related risks specifically associated with anger.
Dodgson's Rule Approximations and Absurdity
McCabe-Dansted, John C
2010-01-01
With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe et al., 2003), unlike the traditional Dodgson rule. We call this rule DC and introduce two new related rules (DR and D&). Dodgson did not explicitly propose the "Dodgson rule" (Tideman, 1987); we argue that DC and DR are better realizations of the principle behind the Dodgson rule than the traditional Dodgson rule. These rules, especially D&, are also effective approximations to the traditional Dodgson's rule. We show that, unlike the rules we have considered previously, the DC, DR and D& scores differ from the Dodgson score by no more than a fixed amount given a fixed number of alternatives, and thus these new rules converge to Dodgson under any reasonable assumption on voter behaviour, including the Impartial Anonymous Culture assumption.
Approximation by double Walsh polynomials
Directory of Open Access Journals (Sweden)
Ferenc Móricz
1992-01-01
Full Text Available We study the rate of approximation by rectangular partial sums, Cesàro means, and de la Vallée Poussin means of double Walsh-Fourier series of a function in a homogeneous Banach space X. In particular, X may be Lp(I2, where 1≦p<∞ and I2=[0,1×[0,1, or CW(I2, the latter being the collection of uniformly W-continuous functions on I2. We extend the results by Watari, Fine, Yano, Jastrebova, Bljumin, Esfahanizadeh and Siddiqi from univariate to multivariate cases. As by-products, we deduce sufficient conditions for convergence in Lp(I2-norm and uniform convergence on I2 as well as characterizations of Lipschitz classes of functions. At the end, we raise three problems.
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."
Approximate reduction of dynamical systems
Tabuada, Paulo; Julius, Agung; Pappas, George J
2007-01-01
The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with mechanical systems with symmetry--which, unfortunately, limits the type of systems to which it can be applied. The goal of this paper is to consider a more general form of reduction, termed approximate reduction, in order to extend the class of systems that can be reduced. Using notions related to incremental stability, we give conditions on when a dynamical system can be projected to a lower dimensional space while providing hard bounds on the induced errors, i.e., when it is behaviorally similar to a dynamical system on a lower dimensional space. These concepts are illustrated on a series of examples.
Diophantine approximations and Diophantine equations
Schmidt, Wolfgang M
1991-01-01
"This book by a leading researcher and masterly expositor of the subject studies diophantine approximations to algebraic numbers and their applications to diophantine equations. The methods are classical, and the results stressed can be obtained without much background in algebraic geometry. In particular, Thue equations, norm form equations and S-unit equations, with emphasis on recent explicit bounds on the number of solutions, are included. The book will be useful for graduate students and researchers." (L'Enseignement Mathematique) "The rich Bibliography includes more than hundred references. The book is easy to read, it may be a useful piece of reading not only for experts but for students as well." Acta Scientiarum Mathematicarum
Truthful approximations to range voting
DEFF Research Database (Denmark)
Filos-Ratsika, Aris; Miltersen, Peter Bro
We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare...... maximization in this setting. With m being the number of alternatives, we exhibit a randomized truthful-in-expectation ordinal mechanism implementing an outcome whose expected social welfare is at least an Omega(m^{-3/4}) fraction of the social welfare of the socially optimal alternative. On the other hand, we...... show that for sufficiently many agents and any truthful-in-expectation ordinal mechanism, there is a valuation profile where the mechanism achieves at most an O(m^{-{2/3}) fraction of the optimal social welfare in expectation. We get tighter bounds for the natural special case of m = 3...
Approximation of Surfaces by Cylinders
DEFF Research Database (Denmark)
Randrup, Thomas
1998-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
Analytical approximations for spiral waves
Energy Technology Data Exchange (ETDEWEB)
Löber, Jakob, E-mail: jakob@physik.tu-berlin.de; Engel, Harald [Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstrasse 36, EW 7-1, 10623 Berlin (Germany)
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.
On quantum and approximate privacy
Klauck, H
2001-01-01
This paper studies privacy in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not increased by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) privately which are not computable using quantum communication without leakage or using classical communication with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of o(1) instead of privacy loss 0.
IONIS: Approximate atomic photoionization intensities
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
Transgenic cotton expressing Cry10Aa toxin confers high resistance to the cotton boll weevil.
Ribeiro, Thuanne Pires; Arraes, Fabricio Barbosa Monteiro; Lourenço-Tessutti, Isabela Tristan; Silva, Marilia Santos; Lisei-de-Sá, Maria Eugênia; Lucena, Wagner Alexandre; Macedo, Leonardo Lima Pepino; Lima, Janaina Nascimento; Santos Amorim, Regina Maria; Artico, Sinara; Alves-Ferreira, Márcio; Mattar Silva, Maria Cristina; Grossi-de-Sa, Maria Fatima
2017-01-12
Genetically modified (GM) cotton plants that effectively control cotton boll weevil (CBW), which is the most destructive cotton insect pest in South America, are reported here for the first time. This work presents the successful development of a new GM cotton with high resistance to CBW conferred by Cry10Aa toxin, a protein encoded by entomopathogenic Bacillus thuringiensis (Bt) gene. The plant transformation vector harbouring cry10Aa gene driven by the cotton ubiquitination-related promoter uceA1.7 was introduced into a Brazilian cotton cultivar by biolistic transformation. Quantitative PCR (qPCR) assays revealed high transcription levels of cry10Aa in both T0 GM cotton leaf and flower bud tissues. Southern blot and qPCR-based 2(-ΔΔCt) analyses revealed that T0 GM plants had either one or two transgene copies. Quantitative and qualitative analyses of Cry10Aa protein expression showed variable protein expression levels in both flower buds and leaves tissues of T0 GM cotton plants, ranging from approximately 3.0 to 14.0 μg g(-1) fresh tissue. CBW susceptibility bioassays, performed by feeding adults and larvae with T0 GM cotton leaves and flower buds, respectively, demonstrated a significant entomotoxic effect and a high level of CBW mortality (up to 100%). Molecular analysis revealed that transgene stability and entomotoxic effect to CBW were maintained in T1 generation as the Cry10Aa toxin expression levels remained high in both tissues, ranging from 4.05 to 19.57 μg g(-1) fresh tissue, and the CBW mortality rate remained around 100%. In conclusion, these Cry10Aa GM cotton plants represent a great advance in the control of the devastating CBW insect pest and can substantially impact cotton agribusiness.
Approximate analytic solutions to the NPDD: Short exposure approximations
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.
Solving Math Problems Approximately: A Developmental Perspective.
Directory of Open Access Journals (Sweden)
Dana Ganor-Stern
Full Text Available 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.
Formation Tracking Based on Approximate Velocities
Directory of Open Access Journals (Sweden)
Eduardo Gamaliel Hernandez-Martinez
2015-12-01
Full Text Available This paper analyses the formation tracking of groups of mobile robots moving on the plane. A leader robot is chosen to follow a prescribed trajectory whilst the rest, considered as followers, are formed in an open-chain configuration. Two formation-tracking control laws using approximate velocities are proposed, in which some velocities must be communicated between robots in order to ensure the simultaneous preservation of the formation and the following of the group path. The main result is analysis of the convergence of the two proposed control laws. The restriction of inaccurate information occurs in decentralized multi-robot platforms, in which the mobile agents are only able to measure positions and the velocities’ functions are estimated using online numerical methods. A numerical simulation of both controllers in the case of omnidirectional robots is shown. For the case of the unicycle-type robots, real-time experiments of both controllers were implemented and tested.
Outcomes From AAS Hack Day at the 227th AAS Meeting
Kohler, Susanna
2016-01-01
Editors Note:This is a final post from the 227th AAS Meeting in Kissimmee, FL. This special summary of AAS Hack Day, a meeting of AAS members to collaboratively work on various small projects, was written by Meredith Rawls (@Merrdiff) and was originally posted on astrobites.com.As the 227thAmerican Astronomical Society meeting drew to a close (see highlights from Day 1, Day 2, Day 3, and Day 4), a group of at least 50 attendees spent Day 4working on small projects fondly called hacks. Thanks to sponsorship from LSST and Northrup Grumman, the industrious hackers werewell-caffeinated and fed so we could devote time and energy toworking in groups on one-day projects.TheHack Day beganat 10am with pitches. Anybody with a project idea was welcome to briefly speak and try to convince others to work with them. Only someideas panned out, but the enthusiasm was palpable. Its not every day you get a full room of astronomers and affiliates eager to spend hours working on fun and useful projects to benefit the community.#hackAAS is getting underway! #aas227 pic.twitter.com/yX7jlOnSCK James R A Davenport (@jradavenport) January 8, 2016Here is a rundown of what we accomplished. Pretty impressive for a single day! Many thanks to fellow astrobiter Erika Nesvold (now at Carnegie DTM; @erikanesvold) whose hack was live-documenting all the other hacks. Her tweets as @astrobites appeared with the #hackaas hashtag, and her notes made this recap post infinitely easier to write.Interested in joining the fun? Sign up for Hack Day at the 2017 JanuaryAAS meeting (its free with meeting registration), and consider applying for the .Astronomy conference this summer.Towards Optimal Session Scheduling:Adrian Price-Whelan (Columbia), David Hogg (NYU), and Scott Idem (AAS) began writing a program to take all submitted abstracts to a conference like AAS and sort them using keywords to avoid scheduling similar talks in parallel sessions. Its impossible to make everyone happy, but minimizing conflicts
Carboxy-terminal extension effects on crystal formation and insecticidal properties of Cry15Aa
Naimov, S.; Valkova, R.; Dukjandiev, S.; Minkov, J.; Maagd, de R.A.
2011-01-01
Cry15Aa protein, produced by Bacillus thuringiensis serovar thompsoni HD542, in a crystal together with a 40 kDa accompanying protein, is one of a small group of non-typical, less well-studied members of the Cry family of insecticidal proteins, and may provide an alternative for the more commonly us
Randomized approximate nearest neighbors algorithm.
Jones, Peter Wilcox; Osipov, Andrei; Rokhlin, Vladimir
2011-09-20
We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in R(d), the algorithm attempts to find k nearest neighbors for each of x(j), 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·k(2)·(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 {x(j)} for an arbitrary point x ∈ R(d). 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 {x(j)} and illustrate its performance via several numerical examples.
Crystal structure determination of alkaline haemorrhagin AaHⅢ from snake venom of Agkistrodon acutus
Institute of Scientific and Technical Information of China (English)
龚为民; 滕脉坤; 牛立文
1997-01-01
The haemorrhagin AaH Ⅲ isolated from the snake venom of Agkistrodon acutus is one of the few al-kaline ones in snake venoms. Its crystals belong to space group P212121 with a = 9. 573 4 nm, b = 4. 996 7 nm and c = 4. 728 8 nm. Its crystal structure was determined by the molecular replacement method according to the model of metalloproteinase Adamalysin n from eastern rattlesnake venom. The AaHⅢ structure has been refined by PROLSQ. The final R factor was 0.254 and the RMS deviations of bond lengths and angles were 0. 001 8 nm and 1.5°. The structure comparison suggested that AaHⅢ has a similar structure to other snake venom zinc-metalloproteinases. They all belong to matrix metalloproteinases super-family.
AAS Nova and Astrobites: Making current astronomy research accessible
Kohler, Susanna; Astrobites Team
2016-10-01
AAS Nova and Astrobites are two resources available for astronomers, astronomy students, and astronomy enthusiasts to keep up with some of the most recent research published across the field of astronomy. Both supported by the AAS, these two daily astrophysical literature blogs provide accessible summaries of recent publications on the arXiv and in AAS journals. We present the goals, content, and readership of AAS Nova and Astrobites, and discuss how they might be used as tools in the undergraduate classroom.
Obtaining exact value by approximate computations
Institute of Scientific and Technical Information of China (English)
Jing-zhong ZHANG; Yong FENG
2007-01-01
Numerical approximate computations can solve large and complex problems fast. They have the advantage of high efficiency. However they only give approximate results, whereas we need exact results in some fields. There is a gap between approximate computations and exact results.In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.
Fuzzy Set Approximations in Fuzzy Formal Contexts
Institute of Scientific and Technical Information of China (English)
Mingwen Shao; Shiqing Fan
2006-01-01
In this paper, a kind of multi-level formal concept is introduced. Based on the proposed multi-level formal concept, we present a pair of rough fuzzy set approximations within fuzzy formal contexts. By the proposed rough fuzzy set approximations, we can approximate a fuzzy set according to different precision level. We discuss the properties of the proposed approximation operators in detail.
Obtaining exact value by approximate computations
Institute of Scientific and Technical Information of China (English)
2007-01-01
Numerical approximate computations can solve large and complex problems fast.They have the advantage of high efficiency.However they only give approximate results,whereas we need exact results in some fields.There is a gap between approximate computations and exact results. In this paper,we build a bridge by which exact results can be obtained by numerical approximate computations.
Kohler, Susanna
2016-06-01
Editors Note:This week were at the 228th AAS Meeting in San Diego, CA. Along with a team ofauthors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting twiceeach day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.The Limits of Scientific Cosmology: Setting the Stage: Accepted Facts, and Testing Limitations in Theory and Data (by Gourav Khullar)With a stellar lineup of speakers to talk about current and future prospects of cosmology and its limits (or lack thereof), the first session kicked off with talks by Risa Wechsler, Joseph Silk, and Sean Carroll (his talk on Multiverses is described below, by Nathan Sanders). Risa set the stage with an elaborate description of the current accepted facts in the era of precision cosmology including the standard model of concordance cosmology, described by seven parameters and an accepted Lambda-CDM paradigm (with a cosmological constant and cold dark matter). The talk stressed on the fact that all these parameters are understood to a percent order precision, which is a remarkable deviation from the time in 1990s when according to Risa, Alan Guth never thought that any of these numbers could be measured precisely!Risa Wechsler describing our current constraints on what Dark Matter could constitute.Joseph Silk discussing limits on cosmological parameters.The CMB measurements, Big Bang Nucleosynthesis estimates and galaxy clustering statistics all contribute to locking down the description of our universe. She emphasized on the tensions between different probes to measure expansion rate H0 of the universe, and small scale predictions of cold dark matter simulations, but she is hopeful that these shall be resolved eventually. Joe Silk followed this up with his interpretation of trying to understand our place in the universe and placing limits on different parameters and
Nonlinear approximation with dictionaries I. Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2004-01-01
We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation...... with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...
Nonlinear approximation with dictionaries, I: Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
We study various approximation classes associated with $m$-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best $m$-term approximation is compared to new classes defined by considering $m......$-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space...
Zhang, Ying; Fu, Xueqing; Hao, Xiaolong; Zhang, Lida; Wang, Luyao; Qian, Hongmei; Zhao, Jingya
2016-07-01
Phenylalanine ammonia-lyase (PAL) is the key enzyme in the biosynthetic pathway of salicylic acid (SA). In this study, a full-length cDNA of PAL gene (named as AaPAL1) was cloned from Artemisia annua. The gene contains an open reading frame of 2,151 bps encoding 716 amino acids. Comparative and bioinformatics analysis revealed that the polypeptide protein of AaPAL1 was highly homologous to PALs from other plant species. Southern blot analysis revealed that it belonged to a gene family with three members. Quantitative RT-PCR analysis of various tissues of A. annua showed that AaPAL1 transcript levels were highest in the young leaves. A 1160-bp promoter region was also isolated resulting in identification of distinct cis-regulatory elements including W-box, TGACG-motif, and TC-rich repeats. Quantitative RT-PCR indicated that AaPAL1 was upregulated by salinity, drought, wounding, and SA stresses, which were corroborated positively with the identified cis-elements within the promoter region. AaPAL1 was successfully expressed in Escherichia. coli and the enzyme activity of the purified AaPAL1 was approximately 287.2 U/mg. These results substantiated the involvement of AaPAL1 in the phenylalanine pathway.
An Approximate Model of Microchannel Cooling
Institute of Scientific and Technical Information of China (English)
ShipingYu; MingdaoXin
1994-01-01
Forced convective heat transfer in micro-rectangular channels can be described by a group of two-dimensional differential equations.These equations take the conduction in microchannel wall along the direction of flow of coolants into account,which are more generalized than those which neglect the conduction.For the same reason,they are suitable particularly for gases-cooled microchannels.With only numerical solution to the equations till today,an approximate analytic solution is derived here,From this solution,a rather simple formula can be introduced further,by which the differences between considering the conduction and neglecting it are easily found.In addition,the reasonableness of the classical fin method is also discussed.An experimental example of air-cooled microchannels is illustrated.
Kohler, Susanna
2016-06-01
Editors Note:This week were at the 228th AAS Meeting in San Diego, CA. Along with a team ofauthors from astrobites.com, I will bewritingupdates on selectedevents at themeeting and posting twiceeach day. Follow along here or atastrobites.com, or catch ourlive-tweeted updates from the@astrobites Twitter account. The usual posting schedule for AAS Nova will resumenext week.Plenary Session (Day 1) The Galaxy Zoo(by Benny Tsang)Galaxy Zoo was so hot that the servers hosting the galaxy images got melted down soon after being launched.Kevin Schawinski from ETH Zurich took us on a tour ofhis wonderful Galaxy Zoo. It is a huge zoo with about a quarter million zookeepers, they are citizen astronomers who collaboratively classify galaxies by their looks as an attempt to understand galaxy evolution. The big question that is being answered is: how do blue, actively star-forming galaxies evolve into red, quiescent (non-star-forming) galaxies? The Zoo helped reveal that blue galaxies turn into red galaxies via two possible paths galaxies might run out of supply of gas and shut off star formation slowly; or they could merge with one another and turn off star formation by destroying the gas reservoir rapidly!The Galaxy Zoo project also led to the discoveries of:Green Peas: they are the living fossils of galaxy evolution; compact, bright, green galaxies that are actively forming starsOverlapping galaxies: they are pairs of galaxies that are separated physically but happen to lie on the same line of sight; they provide excellent laboratories for studying dust extinctionHannys Voorwerp: an unusual object named after Hanny the discoverer, which is believed to be the first detection of quasar light echoThe idea of Galaxy Zoo in getting help from citizen scientists was further extended into an award-winningproject known as the Zooniverse, which is an online platform for streamlined crowd-sourcing for scientific research that requires human input. The future of astronomy is going to be
Baranek, Jakub; Kaznowski, Adam; Konecka, Edyta; Naimov, Samir
2015-09-01
Vegetative insecticidal proteins (Vips) secreted by some isolates of Bacillus thuringiensis show activity against insects and are regarded as insecticides against pests. A number of B. thuringiensis strains harbouring vip3A genes were isolated from different sources and identified by using a PCR based approach. The isolates with the highest insecticidal activity were indicated in screening tests, and their vip genes were cloned and sequenced. The analysis revealed two polymorphic Vip protein forms, which were classified as Vip3Aa58 and Vip3Aa59. After expression of the vip genes, the proteins were isolated and characterized. The activity of both toxins was estimated against economically important lepidopteran pests of woodlands (Dendrolimus pini), orchards (Cydia pomonella) and field crops (Spodoptera exigua). Vip3Aa58 and Vip3Aa59 were highly toxic and their potency surpassed those of many Cry proteins used in commercial bioinsecticides. Vip3Aa59 revealed similar larvicidal activity as Vip3Aa58 against S. exigua and C. pomonella. Despite 98% similarity of amino acid sequences of both proteins, Vip3Aa59 was significantly more active against D. pini. Additionally the effect of proteolytic activation of Vip58Aa and Vip3Aa59 on toxicity of D. pini and S. exigua was studied. Both Vip3Aa proteins did not show any activity against Tenebrio molitor (Coleoptera) larvae. The results suggest that the Vip3Aa58 and Vip3Aa59 toxins might be useful for controlling populations of insect pests of crops and forests.
AA, sandwich line with magnetic horn
1980-01-01
Continuation from 8010293: Finally, the sandwich line with the horn is placed on the ground, for the horn to be inspected and, if needed, exchanged for a new one. The whole procedure was trained with several members of the AA team, for quick and safe handling, and to share the radiation dose amongst them.
AA, vacuum tank for stochastic precooling
1979-01-01
The vaccum tank in which the fast stochastic precooling kicker was installed. It is clad with heating jackets for bake-out to 200 deg C, indispensable for reaching the operational vacuum of 7E-11 Torr. Alain Poncet, responsible for AA vacuum, is looking on. See also 7910268, 8002234.
Processing and Optimization of Dissimilar Friction Stir Welding of AA 2219 and AA 7039 Alloys
Venkateswarlu, D.; Nageswara rao, P.; Mahapatra, M. M.; Harsha, S. P.; Mandal, N. R.
2015-12-01
The present paper discusses the optimization of dissimilar friction stir welding of AA 2219 and AA 7039 alloys with respect to tool design issues including microstructural study of weld. The optimized ultimate tensile strength was ~280 MPa, and % elongation was ~11.5. It was observed that the extent of tool shoulder flat surface and tool rotational speed influenced the weld quality significantly. A mathematical model was also developed using response surface regression analysis to predict the effects of tool geometry and process variables on dissimilar AA 2219 and AA 7039 alloys welds. The microstructure evolution and mechanical properties were investigated by employing electron backscatter diffraction technique, Vickers microhardness, and tensile testing, respectively. The microstructural observations indicated that the grain size obtained at advancing side (AA 2219 alloy side) was much finer compared to the retreating side (AA 7039 alloy side). Hardness distribution in the stir zone was inhomogeneous, which might be due to inadequate mixing of weld zone material. The hardness values observed at the weld zone were lower than that in the base materials.
Ultrasonic inspection of AA6013 laser welded joints
Directory of Open Access Journals (Sweden)
Adriano Passini
2011-09-01
Full Text Available Interest in laser beam welding for aerospace applications is continuously growing, mainly for aluminum alloys. The joints quality is usually assessed by non-destructive inspection (NDI. In this work, bead on plate laser welds on 1.6 mm thick AA6013 alloy sheets, using a 2 kW Yb-fiber laser were obtained and inspected by pulse/echo ultrasonic phased-array technique. Good and poor quality welds were inspected in order to verify the limits of inspection, comparing also to X-ray radiography and metallographic inspections. The results showed that ultrasonic phased array technique was able to identify the presence of grouped porosity, through the attenuation of the amplitude of the echo signal. This attenuation is attributed to the scattering of the waves caused by micro pores, with individual size below the resolution limit of the equipment, but when grouped, can cause a perceptive effect on the reflection spectra.
APPROXIMATE SAMPLING THEOREM FOR BIVARIATE CONTINUOUS FUNCTION
Institute of Scientific and Technical Information of China (English)
杨守志; 程正兴; 唐远炎
2003-01-01
An approximate solution of the refinement equation was given by its mask, and the approximate sampling theorem for bivariate continuous function was proved by applying the approximate solution. The approximate sampling function defined uniquely by the mask of the refinement equation is the approximate solution of the equation, a piece-wise linear function, and posseses an explicit computation formula. Therefore the mask of the refinement equation is selected according to one' s requirement, so that one may controll the decay speed of the approximate sampling function.
Bernstein-type approximations of smooth functions
Directory of Open Access Journals (Sweden)
Andrea Pallini
2007-10-01
Full Text Available The Bernstein-type approximation for smooth functions is proposed and studied. We propose the Bernstein-type approximation with definitions that directly apply the binomial distribution and the multivariate binomial distribution. The Bernstein-type approximations generalize the corresponding Bernstein polynomials, by considering definitions that depend on a convenient approximation coefficient in linear kernels. In the Bernstein-type approximations, we study the uniform convergence and the degree of approximation. The Bernstein-type estimators of smooth functions of population means are also proposed and studied.
Averett, Laurel E; Schoenfisch, Mark H; Akhremitchev, Boris B; Gorkun, Oleg V
2009-11-18
Fibrin, the structural scaffold of blood clots, spontaneously polymerizes through the formation of 'A-a' knob-hole bonds. When subjected to external force, the dissociation of this bond is accompanied by two to four abrupt changes in molecular dimension observable as rupture events in a force curve. Herein, the configuration, molecular extension, and kinetic parameters of each rupture event are examined. The increases in contour length indicate that the D region of fibrinogen can lengthen by approximately 50% of the length of a fibrin monomer before rupture of the 'A-a' interaction. The dependence of the dissociation rate on applied force was obtained using probability distributions of rupture forces collected at different pull-off velocities. These distributions were fit using a model in which the effects of the shape of the binding potential are used to quantify the kinetic parameters of forced dissociation. We found that the weak initial rupture (i.e., event 1) was not well approximated by these models. The ruptured bonds comprising the strongest ruptures, events 2 and 3, had kinetic parameters similar to those commonly found for the mechanical unfolding of globular proteins. The bonds ruptured in event 4 were well described by these analyses, but were more loosely bound than the bonds in events 2 and 3. We propose that the first event represents the rupture of an unknown interaction parallel to the 'A-a' bond, events 2 and 3 represent unfolding of structures in the D region of fibrinogen, and event 4 is the rupture of the 'A-a' knob-hole bond weakened by prior structural unfolding. Comparison of the activation energy obtained via force spectroscopy measurements with the thermodynamic free energy of 'A-a' bond dissociation indicates that the 'A-a' bond may be more resistant to rupture by applied force than to rupture by thermal dissociation.
DE Lara, Ana Paula DE Souza Stori; Lorenzon, Lucas Bigolin; Vianna, Ana Muñoz; Santos, Francisco Denis Souza; Pinto, Luciano Silva; Aires Berne, Maria Elisabeth; Leite, Fábio Pereira Leivas
2016-10-01
Effective control of gastrointestinal parasites is necessary in sheep production. The development of anthelmintics resistance is causing the available chemically based anthelmintics to become less effective. Biological control strategies present an alternative to this problem. In the current study, we tested the larvicidal effects of Bacillus thuringiensis var. israelensis Cry11Aa toxin against Haemonchus contortus larvae. Bacterial suspensions [2 × 108 colony-forming units (CFU) g-1 of the feces] of B. thuringiensis var. israelensis and recombinant Escherichia coli expressing Cry11Aa toxin were added to naturally H. contortus egg-contaminated feces. The larvae were quantified, and significant reductions of 62 and 81% (P < 0·001) were, respectively observed, compared with the control group. A 30 mL bacterial suspension (1 × 108 CFU mL-1) of B. thuringiensis var. israelensis and recombinant E. coli expressing Cry11Aa toxin were then orally administered to lambs naturally infected with H. contortus. Twelve hours after administration, feces were collected and submitted to coprocultures. Significant larvae reductions (P < 0·001) of 79 and 90% were observed respectively compared with the control group. The results suggest that the Cry11Aa toxin of B. thuringiensis var. israelensis is a promising new class of biological anthelmintics for treating sheep against H. contortus.
Sampling, Filtering and Sparse Approximations on Combinatorial Graphs
Pesenson, Isaac Z
2011-01-01
In this paper we address sampling and approximation of functions on combinatorial graphs. We develop filtering on graphs by using Schr\\"odinger's group of operators generated by combinatorial Laplace operator. Then we construct a sampling theory by proving Poincare and Plancherel-Polya-type inequalities for functions on graphs. These results lead to a theory of sparse approximations on graphs and have potential applications to filtering, denoising, data dimension reduction, image processing, image compression, computer graphics, visualization and learning theory.
Spectra of absolute instruments from the WKB approximation
Tyc, Tomas
2013-01-01
We calculate frequency spectra of absolute optical instruments using the WKB approximation. The resulting eigenfrequencies approximate the actual values very accurately, in some cases they even give the exact values. Our calculations confirm results obtained previously by a completely different method. In particular, the eigenfrequencies of absolute instruments form tight groups that are almost equidistantly spaced. We demonstrate our method and its results on several examples.
PVA/AA photopolymers and PA-LCoS devices combined for holographic data storage
Márquez, Andrés.; Martínez, Francisco J.; Fernández, Roberto; Gallego, Sergi; Álvarez, Mariela L.; Pascual, Inmaculada; Beléndez, Augusto
2016-09-01
We introduce a polyvinil alcohol/acrylamide (PVA/AA) photopolymer compound in a holographic memory testing platform to provide experimental results for storage and retrieval of information. We also investigate different codification schemes for the data pages addressed onto the parallel-addressed liquid crystal on silicon (PA-LCoS) device, used as the data pager, such as binary intensity modulation (BIM), and hybrid-ternary modulation (HTM), and we will see that an actual approximation for HTM can be obtained with a PA-LCoS device. We will also evaluate the effect of the time fluctuations in the PA-LCoS microdisplays onto the BIM and HTM regimes. Good results in terms of signal-tonoise ratio and bit-error ratio are provided with the experimental system and using the PVA/AA photopolymer produced in our lab, thus showing its potential and interest for future research focused on this material with highly tunable properties.
Directory of Open Access Journals (Sweden)
Katarzyna Lundmark
Full Text Available AA amyloidosis is a systemic disease that develops secondary to chronic inflammatory diseases Macrophages are often found in the vicinity of amyloid deposits and considered to play a role in both formation and degradation of amyloid fibrils. In spleen reside at least three types of macrophages, red pulp macrophages (RPM, marginal zone macrophages (MZM, metallophilic marginal zone macrophages (MMZM. MMZM and MZM are located in the marginal zone and express a unique collection of scavenger receptors that are involved in the uptake of blood-born particles. The murine AA amyloid model that resembles the human form of the disease has been used to study amyloid effects on different macrophage populations. Amyloid was induced by intravenous injection of amyloid enhancing factor and subcutaneous injections of silver nitrate and macrophages were identified with specific antibodies. We show that MZMs are highly sensitive to amyloid and decrease in number progressively with increasing amyloid load. Total area of MMZMs is unaffected by amyloid but cells are activated and migrate into the white pulp. In a group of mice spleen macrophages were depleted by an intravenous injection of clodronate filled liposomes. Subsequent injections of AEF and silver nitrate showed a sustained amyloid development. RPMs that constitute the majority of macrophages in spleen, appear insensitive to amyloid and do not participate in amyloid formation.
Applications of Discrepancy Theory in Multiobjective Approximation
Glaßer, Christian; Witek, Maximilian
2011-01-01
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
Fractal Trigonometric Polynomials for Restricted Range Approximation
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.
Axiomatic Characterizations of IVF Rough Approximation Operators
Directory of Open Access Journals (Sweden)
Guangji Yu
2014-01-01
Full Text Available This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.
Some relations between entropy and approximation numbers
Institute of Scientific and Technical Information of China (English)
郑志明
1999-01-01
A general result is obtained which relates the entropy numbers of compact maps on Hilbert space to its approximation numbers. Compared with previous works in this area, it is particularly convenient for dealing with the cases where the approximation numbers decay rapidly. A nice estimation between entropy and approximation numbers for noncompact maps is given.
Nonlinear approximation with dictionaries, I: Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
$-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space...
Operator approximant problems arising from quantum theory
Maher, Philip J
2017-01-01
This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.
Advanced Concepts and Methods of Approximate Reasoning
1989-12-01
and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka, editors, Approximate Reasoning and...190, 1981. [43] E. Trillas and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka
NONLINEAR APPROXIMATION WITH GENERAL WAVE PACKETS
Institute of Scientific and Technical Information of China (English)
L. Borup; M. Nielsen
2005-01-01
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete characterization of the approximation spaces is derived.
Approximate Nearest Neighbor Queries among Parallel Segments
DEFF Research Database (Denmark)
Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias
2010-01-01
We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...
Nonlinear approximation with general wave packets
DEFF Research Database (Denmark)
Borup, Lasse; Nielsen, Morten
2005-01-01
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete...... characterization of the approximation spaces is derived....
Nonlinear approximation with bi-framelets
DEFF Research Database (Denmark)
Borup, Lasse; Nielsen, Morten; Gribonval, Rémi
2005-01-01
We study the approximation in Lebesgue spaces of wavelet bi-frame systems given by translations and dilations of a finite set of generators. A complete characterization of the approximation spaces associated with best m-term approximation of wavelet bi-framelet systems is given...
Approximation properties of fine hyperbolic graphs
Indian Academy of Sciences (India)
Benyin Fu
2016-05-01
In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable discrete metric space. Moreover, we use the techniques of Ozawa’s to prove that a fine hyperbolic graph has the metric invariant translation approximation property.
Approximating the double-cut-and-join distance between unsigned genomes
Directory of Open Access Journals (Sweden)
Yu Jiadong
2011-10-01
Full Text Available Abstract In this paper we study the problem of sorting unsigned genomes by double-cut-and-join operations, where genomes allow a mix of linear and circular chromosomes to be present. First, we formulate an equivalent optimization problem, called maximum cycle/path decomposition, which is aimed at finding a largest collection of edge-disjoint cycles/AA-paths/AB-paths in a breakpoint graph. Then, we show that the problem of finding a largest collection of edge-disjoint cycles/AA-paths/AB-paths of length no more than l can be reduced to the well-known degree-bounded k-set packing problem with k = 2l. Finally, a polynomial-time approximation algorithm for the problem of sorting unsigned genomes by double-cut-and-join operations is devised, which achieves the approximation ratio for any positive ε. For the restricted variation where each genome contains only one linear chromosome, the approximation ratio can be further improved to
Energy Technology Data Exchange (ETDEWEB)
Schikorra, M.; Tekkaya, A. E. [Institute of Forming Technology and Lightweight Construction, Dortmund (Germany); Donate, L.; Iomesani, L. [University of Bologna, Bologna (Italy)
2007-10-15
Microstructure and material flow of aluminum alloys have a significant influence on the mechanical properties and surface quality. In extrusion of aluminum billets at high temperatures the microstructure is dependent on the alloy and the forming and temperature history. A prediction of grain size and precipitation is of increasing importance in order to design the process by adjustment of parameters such as punch speed, temperatures, and quenching. To give references for microstructure prediction based on material flow, and with it strain and strain rate history, this paper deals with the microstructure during the extrusion process of AA6060, AA6082, and AA7075 alloys. Billets have been partly extruded to axisymmetric round profiles and the microstructure of the press rests consisting of the billet rests in container and die has been considered. Furthermore, these rests have been analyzed to show the material flow, dynamic and static recrystallization based on macro etchings and visible microstructure under different conditions, e.g. as in the area of high strain rate near the container wall, or in dead zones. To allow an accurate simulation of the extrusion process, punch force and temperature conditions during the tests have been measured and are presented in this paper, too.
Resonant-state expansion Born Approximation
Doost, M B
2015-01-01
The Born Approximation is a fundamental formula in Physics, it allows the calculation of weak scattering via the Fourier transform of the scattering potential. I extend the Born Approximation by including in the formula the Fourier transform of a truncated basis of the infinite number of appropriately normalised resonant states. This extension of the Born Approximation is named the Resonant-State Expansion Born Approximation or RSE Born Approximation. The resonant-states of the system can be calculated using the recently discovered RSE perturbation theory for electrodynamics and normalised correctly to appear in spectral Green's functions via the flux volume normalisation.
Canonical Sets of Best L1-Approximation
Directory of Open Access Journals (Sweden)
Dimiter Dryanov
2012-01-01
Full Text Available In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are called canonical sets of best approximation. The present paper summarizes results on canonical sets of best L1-approximation with emphasis on multivariate interpolation and best L1-approximation by blending functions. The best L1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariate L1-approximation by sums of univariate functions. Explicit constructions of best one-sided L1-approximants give rise to well-known and new inequalities.
Mapping moveout approximations in TI media
Stovas, Alexey
2013-11-21
Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.
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.
On Gakerkin approximations for the quasigeostrophic equations
Rocha, Cesar B; Grooms, Ian
2015-01-01
We study the representation of approximate solutions of the three-dimensional quasigeostrophic (QG) equations using Galerkin series with standard vertical modes. In particular, we show that standard modes are compatible with nonzero buoyancy at the surfaces and can be used to solve the Eady problem. We extend two existing Galerkin approaches (A and B) and develop a new Galerkin approximation (C). Approximation A, due to Flierl (1978), represents the streamfunction as a truncated Galerkin series and defines the potential vorticity (PV) that satisfies the inversion problem exactly. Approximation B, due to Tulloch and Smith (2009b), represents the PV as a truncated Galerkin series and calculates the streamfunction that satisfies the inversion problem exactly. Approximation C, the true Galerkin approximation for the QG equations, represents both streamfunction and PV as truncated Galerkin series, but does not satisfy the inversion equation exactly. The three approximations are fundamentally different unless the b...
National Research Council Canada - National Science Library
Sahu, Gopal K; Upadhyay, Seema; Panna, Shradha M
2014-01-01
... in different age groups is least studied. This article reports the activity of sAA in human subjects of different age groups subjected to psychological stress induced through stressful video clip...
Colchicine use in isolated renal AA amyloidosis.
Meneses, Carlos F; Egües, César A; Uriarte, Miren; Belzunegui, Joaquín; Rezola, Marta
2015-01-01
We present the case of a 45-year-old woman, with two-year history of chronic renal insufficiency and proteinuria. A kidney biopsy showed the presence of AA amyloidosis (positive Congo red staining and immunohistochemistry). There was no evidence of amyloid deposits in other organs and there was no underlying disease. AA amyloidosis normally is secondary to chronic inflammatory or infectious diseases. High levels of IL-1, IL-6 and TNF-α play a role in the pathogenesis of amyloidosis and induce the synthesis of serum amyloid A protein (SAA), a precursor of tissue amyloid deposits. We empirically treated the patient with a low dose colchicine. The patient responded well. Colchicine has been used for the treatment of Familiar Mediterranean Fever and related auto-inflammatory diseases. To monitor treatment responses, we measured SAA finding low titers. Soon after treatment onset there were signs of improvement pertaining to proteinuria and stabilization of renal function.
Absorption spectra of AA-stacked graphite
Energy Technology Data Exchange (ETDEWEB)
Chiu, C W; Lee, S H; Chen, S C; Lin, M F [Department of Physics, National Cheng Kung University, Taiwan (China); Shyu, F L, E-mail: fl.shyu@msa.hinet.ne, E-mail: mflin@mail.ncku.edu.t [Department of Physics, ROC Military Academy, 830 Kaohsiung, Taiwan (China)
2010-08-15
AA-stacked graphite shows strong anisotropy in geometric structures and velocity matrix elements. However, the absorption spectra are isotropic for the polarization vector on the graphene plane. The spectra exhibit one prominent plateau at middle energy and one shoulder structure at lower energy. These structures directly reflect the unique geometric and band structures and provide sufficient information for experimental fitting of the intralayer and interlayer atomic interactions. On the other hand, monolayer graphene shows a sharp absorption peak but no shoulder structure; AA-stacked bilayer graphene has two absorption peaks at middle energy and abruptly vanishes at lower energy. Furthermore, the isotropic features are expected to exist in other graphene-related systems. The calculated results and the predicted atomic interactions could be verified by optical measurements.
Stochastic Lie group integrators
Malham, Simon J A
2007-01-01
We present Lie group integrators for nonlinear stochastic differential equations with non-commutative vector fields whose solution evolves on a smooth finite dimensional manifold. Given a Lie group action that generates transport along the manifold, we pull back the stochastic flow on the manifold to the Lie group via the action, and subsequently pull back the flow to the corresponding Lie algebra via the exponential map. We construct an approximation to the stochastic flow in the Lie algebra via closed operations and then push back to the Lie group and then to the manifold, thus ensuring our approximation lies in the manifold. We call such schemes stochastic Munthe-Kaas methods after their deterministic counterparts. We also present stochastic Lie group integration schemes based on Castell--Gaines methods. These involve using an underlying ordinary differential integrator to approximate the flow generated by a truncated stochastic exponential Lie series. They become stochastic Lie group integrator schemes if...
First circulating beam in the AA
1980-01-01
On 3 July 1980, two years after project authorization, beam circulated for the first time in the AA. It was a 3.5 GeV/c proton test beam. We see an expecting crowd, minutes before the happy event. The persons are to numerous to name them all. Heribert Koziol, apparently asleep, is answering the call from an impatient director. See also 8007094.
Wooden Model of Wide AA Bending Magnet
1978-01-01
The very particular lattice of the AA required 2 types of dipoles (bending magnets: BLG, long and narrow; BST, short and wide). The wide ones had a steel length of 2.71 m, a "good field" width of 0.564 m, and a weight of about 75 t. Here we see a wooden model, built in 1978, to gain dimensional experience with such a monster.
AA, inner conductor of a magnetic horn
CERN PhotoLab
1981-01-01
At the start-up of the AA and during its initial operation, magnetic horns focused the antiprotons emanating from the production target. These "current-sheet lenses" had a thin inner conductor (for minimum absorption of antiprotons), machined from aluminium to wall thicknesses of 0.7 or 1 mm. The half-sine pulses rose to 150 kA in 8 microsec. The angular acceptance was 50 mrad.
AAS Oral History Project - Seeking Planetary Scientist
Buxner, Sanlyn; Holbrook, Jarita
2016-10-01
Now in its fourth year, the AAS Oral History Project has interviewed over 100 space scientists from all over the world. Led by the AAS Historical Astronomy Division (HAD) and partially funded by the American Institute of Physics Niels Bohr Library and ongoing support from the AAS, volunteers have collected oral histories from space scientists at professional meetings starting in 2015, including AAS, DPS, and the IAU general assembly. Each interview lasts one and a half to two hours and focuses on interviewees' personal and professional lives. Questions include those about one's family, childhood, strong influences on one's scientific career, career path, successes and challenges, perspectives on how astronomy is changing as a field, and advice to the next generation. Each interview is audio recorded and transcribed, the content of which is checked with each interviewee. Once complete, interview transcripts are posted online as part of a larger oral history library at https://www.aip.org/history-programs/niels-bohr-library/oral-histories. We will present preliminary analysis of those interviewed including characterizing career status, age range, nationality, and primary field. Additionally, we will discuss trends beginning to emerge in analysis of participants' responses about data driven science and advice to the next generation. Future analysis will reveal a rich story of space scientists and will help the community address issues of diversity, controversies, and the changing landscape of science. We are actively recruiting individuals to be interviewed at this meeting from all stages of career from undergraduate students to retired and emeritus astronomers. We are especially interested in interviewing 40+E members of DPS. Contact Sanlyn Buxner to schedule an interview or to find out more information about the project (buxner@psi.edu). Contact Jarita Holbrook if you would like to become an interviewer for the project (astroholbrook@gmail.com).
AA, assembly of wide bending magnet
1980-01-01
The very particular lattice of the AA required 2 types of dipoles (bending magnets; BST, short and wide; BLG, long and narrow). The wide ones had a steel length of 2.71 m, a "good field" width of 0.564 m, and a weight of about 75 t. Here we see the copper coils being hoisted onto the lower half of a BST. See also 7811105, 8006050. For a BLG, see 8001044.
Yang, Y.; Wang, X.; Hsiao, B. S.
2016-07-01
A novel kind of thin-film nanofibrous composite (TFNC) nanofiltration (NF) membranes consisting of a polyamide (PA) barrier layer were successfully fabricated by interfacial polymerization (IFP) based on electrospun double-layer nanofibrous substrates, which have an ultrathin poly (acrylonitrile-co-acrylic acid) (PAN-AA) nanofibrous layer as top layer and a thicker polyacrylonitrile (PAN) nanofiber layer as bottom porous support layer. Immersing PAN/PAN-AA nanofibrous substrates into 1-ethyl-(3-3-dimethylaminopropyl) carbodiimide hydrochloride/N-hydroxysuccinimide (EDC/NHS) aqueous solution and piperazine (PIP) aqueous solution (0.20 wt%) sequentially for a period of time, the carboxyl groups on PAN-AA nanofibers were activated by carbodiimide and then reacted with the amide groups. The as prepared composite membrane has an integrated structure with high rejection rate (98.0%); high permeate flux (40.4 L/m2h) for MgSO4 aqueous solution (2 g/L).
Interpolation function for approximating knee joint behavior in human gait
Toth-Taşcǎu, Mirela; Pater, Flavius; Stoia, Dan Ioan
2013-10-01
Starting from the importance of analyzing the kinematic data of the lower limb in gait movement, especially the angular variation of the knee joint, the paper propose an approximation function that can be used for processing the correlation among a multitude of knee cycles. The approximation of the raw knee data was done by Lagrange polynomial interpolation on a signal acquired using Zebris Gait Analysis System. The signal used in approximation belongs to a typical subject extracted from a lot of ten investigated subjects, but the function domain of definition belongs to the entire group. The study of the knee joint kinematics plays an important role in understanding the kinematics of the gait, this articulation having the largest range of motion in whole joints, in gait. The study does not propose to find an approximation function for the adduction-abduction movement of the knee, this being considered a residual movement comparing to the flexion-extension.
Dissociation between exact and approximate addition in developmental dyslexia.
Yang, Xiujie; Meng, Xiangzhi
2016-09-01
Previous research has suggested that number sense and language are involved in number representation and calculation, in which number sense supports approximate arithmetic, and language permits exact enumeration and calculation. Meanwhile, individuals with dyslexia have a core deficit in phonological processing. Based on these findings, we thus hypothesized that children with dyslexia may exhibit exact calculation impairment while doing mental arithmetic. The reaction time and accuracy while doing exact and approximate addition with symbolic Arabic digits and non-symbolic visual arrays of dots were compared between typically developing children and children with dyslexia. Reaction time analyses did not reveal any differences across two groups of children, the accuracies, interestingly, revealed a distinction of approximation and exact addition across two groups of children. Specifically, two groups of children had no differences in approximation. Children with dyslexia, however, had significantly lower accuracy in exact addition in both symbolic and non-symbolic tasks than that of typically developing children. Moreover, linguistic performances were selectively associated with exact calculation across individuals. These results suggested that children with dyslexia have a mental arithmetic deficit specifically in the realm of exact calculation, while their approximation ability is relatively intact.
An Update on the AAS Astronomy Ambassadors Program
Fienberg, Richard T.; Gurton, S.; Fraknoi, A.; Prather, E. E.; Hurst, A.; Schatz, D. L.
2013-06-01
The American Astronomical Society, partnering with organizations active in science education and public outreach (EPO), has launched a series of professional-development workshops and a community of practice designed to help improve early-career astronomers’ ability to effectively communicate with students and the public. Called Astronomy Ambassadors, the program provides mentoring and training experiences for young astronomers, from advanced undergraduates to beginning faculty; it also provides access to resources and a network of contacts within the astronomy EPO community. By learning how to implement effective education and outreach strategies, Astronomy Ambassadors become better teachers, better presenters at meetings, and better representatives of our science to the public and to government. And because young astronomers are a more diverse group than those who currently do the majority of outreach, they help the astronomical community present a more multicultural and gender-balanced face to the public, enabling members of underserved groups to see themselves as scientists. Ambassadors are provided with a large library of outreach activities and materials that are suitable for a range of venues and audiences and that will grow with time. For much of this library we are using resources developed by organizations such as the Astronomical Society of the Pacific, the Pacific Science Center, and the Center for Astronomy Education for other outreach programs, though some resources have been created by one of us (AF) specifically for this program. The first Astronomy Ambassadors workshop was held at the 221st meeting of the AAS in January 2013 and served 30 young astronomers chosen from more than 75 applicants. Incorporating feedback from workshop participants and lessons learned from the reports they’ve submitted after conducting their own outreach events, we are now planning the second annual workshop to be held 4-5 January 2014 at the 223rd AAS meeting in
The Graph Isomorphism Problem and approximate categories
Derksen, Harm
2010-01-01
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many pairs of graphs, but the pairs of non-isomorphic graphs constructed by Cai, Furer and Immerman it cannot distinguish. If d is fixed, then the WL-algorithm runs in polynomial time. We will formulate the Graph Isomorphism Problem as an Orbit Problem: Given a representation V of an algebraic group G and two elements v_1,v_2 in V, decide whether v_1 and v_2 lie in the same G-orbit. Then we attack the Orbit Problem by constructing certain approximate categories C_d(V), d=1,2,3,... whose objects include the elements of V. We show that v_1 and v_2 are not in the same orbit by showing that they are not isomorphic in the category C_d(V) for some d. For every d this gives us an algorithm for isomorphism testing. We will show that the WL-algorithms reduce to our algorithms, but that ou...
Improving biconnectivity approximation via local optimization
Energy Technology Data Exchange (ETDEWEB)
Ka Wong Chong; Tak Wah Lam [Univ. of Hong Kong (Hong Kong)
1996-12-31
The problem of finding the minimum biconnected spanning subgraph of an undirected graph is NP-hard. A lot of effort has been made to find biconnected spanning subgraphs that approximate to the minimum one as close as possible. Recently, new polynomial-time (sequential) approximation algorithms have been devised to improve the approximation factor from 2 to 5/3 , then 3/2, while NC algorithms have also been known to achieve 7/4 + {epsilon}. This paper presents a new technique which can be used to further improve parallel approximation factors to 5/3 + {epsilon}. In the sequential context, the technique reveals an algorithm with a factor of {alpha} + 1/5, where a is the approximation factor of any 2-edge connectivity approximation algorithm.
Frankenstein's Glue: Transition functions for approximate solutions
Yunes, N
2006-01-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 solutions together. In particular, we propose certain sufficient conditions on these functions and proof that these conditions guarantee that the joined solution still satisfies the Einstein equations 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...
Floating-Point $L^2$-Approximations
Brisebarre, Nicolas; Hanrot, Guillaume
2007-01-01
International audience; Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those functions. These approximations can be good under several criteria, the most desirable being probably that the relative error is as small as possible in the $L^{\\infty}$ sense, i.e. everywhere on the interval under study. In the present paper, we investigate a simpler criterion, the $L^2$ case. Though finding a best polynomial $L^2$-approximation with ...
Approximately liner phase IIR digital filter banks
J. D. Ćertić; M. D. Lutovac; L. D. Milić
2013-01-01
In this paper, uniform and nonuniform digital filter banks based on approximately linear phase IIR filters and frequency response masking technique (FRM) are presented. Both filter banks are realized as a connection of an interpolated half-band approximately linear phase IIR filter as a first stage of the FRM design and an appropriate number of masking filters. The masking filters are half-band IIR filters with an approximately linear phase. The resulting IIR filter banks are compared with li...
Dammak, Mariam; Khedher, Saoussen Ben; Boukedi, Hanen; Chaib, Ikbel; Laarif, Asma; Tounsi, Slim
2016-02-01
Bacillus thuringiensis (Bt) Cry1A toxins are known for their effectiveness against lepidopteran insects. In this study, the entomopathogenic activity of Cry1Aa was investigated against two lepidopteran larvae causing serious threat to various crops, Spodoptera littoralis and Tuta absoluta. Contrarily to S. littoralis, which showed low susceptibility to Cry1Aa (40% mortality with 1μg/cm(2)), T. absoluta was very sensitive to this delta-endotoxin (LC50 of 95.8ng/cm(2)). The different steps in the mode of action of this toxin on the two larvae were studied with the aim to understand the origin of their difference of susceptibility. Activation of the 130kDa Cry1Aa protein by T. absoluta larvae juice generated a 65kDa active toxin, whereas S. littoralis gut juice led to a complete degradation of the protoxin. The study of the interaction of the brush border membrane vesicles (BBMV) with purified biotinylated Cry1Aa toxin revealed six and seven toxin binding proteins in T. absoluta and S. littoralis BBMV, respectively. Midgut histopathology of Cry1Aa fed larvae demonstrated approximately similar damage caused by the toxin in the two larvae midguts. These results suggest that the activation step was strongly involved in the difference of susceptibility of the two larvae to Cry1Aa.
A Note on Generalized Approximation Property
Directory of Open Access Journals (Sweden)
Antara Bhar
2013-01-01
Full Text Available We introduce a notion of generalized approximation property, which we refer to as --AP possessed by a Banach space , corresponding to an arbitrary Banach sequence space and a convex subset of , the class of bounded linear operators on . This property includes approximation property studied by Grothendieck, -approximation property considered by Sinha and Karn and Delgado et al., and also approximation property studied by Lissitsin et al. We characterize a Banach space having --AP with the help of -compact operators, -nuclear operators, and quasi--nuclear operators. A particular case for ( has also been characterized.
Upper Bounds on Numerical Approximation Errors
DEFF Research Database (Denmark)
Raahauge, Peter
2004-01-01
This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function....... The bounds apply to moregeneral problems than existing bounding methods do. For instance, since strict concavityis not required, linear models and piecewise linear approximations can bedealt with. Despite the generality, the bounds perform well in comparison with existingmethods even when applied...... to approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...
TMB: Automatic differentiation and laplace approximation
DEFF Research Database (Denmark)
Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte
2016-01-01
computations. The user defines the joint likelihood for the data and the random effects as a C++ template function, while all the other operations are done in R; e.g., reading in the data. The package evaluates and maximizes the Laplace approximation of the marginal likelihood where the random effects...... are automatically integrated out. This approximation, and its derivatives, are obtained using automatic differentiation (up to order three) of the joint likelihood. The computations are designed to be fast for problems with many random effects (approximate to 10(6)) and parameters (approximate to 10...
Comparison between ARB and CARB processes on an AA5754/AA6061 composite
Verstraete, K.; Helbert, A.-L.; Brisset, F.; Baudin, T.
2014-08-01
The present work aims to compare two processes: Accumulative Roll Bonding and Cross Accumulative Roll Bonding (CARB). Both processes consist in the repetition of rolling but the second technique adds a 90° rotation of the sheet around its normal direction between each rolling. Microstructure, mechanical properties and texture were compared for both processes on an AA5754/AA6061 composite. As a result a thinner and less elongated microstructure was obtained in the CARB process leading to an isotropy and an improvement of the mechanical properties. Besides, the texture was characterized by the rotated Cube component for both processes but for CARB it is of less strength.
Terra, Mauro Barbosa; Barros, Helena Maria Tannhauser; Stein, Airton Tetelbom; Figueira, Ivan; Palermo, Luiz Henrique; Athayde, Luciana Dias; de Souza Gonçalves, Marcelo; da Silveira, Dartiu Xavier
2008-01-01
This study was designed to determine factors affecting adherence to Alcoholics Anonymous (AA) groups. This cohort involved 300 alcoholics committed to three hospitals in Porto Alegre, Brazil. They were interviewed again in their homes after six months. The SCID-I and a questionnaire focusing on patient relationship with AA groups were used. The responses obtained through the questionnaire were independently evaluated by two researchers. AA adherence was below 20%. The main factors reported by patients as reasons for non-adherence to AA were relapse, lack of identification with the method, lack of need, and lack of credibility. The factors reported by patients as reasons for adherence were identification with the method and a way to avoid relapse. Although AA is considered an effective intervention for alcoholism, its adherence rate was excessively low. The identification of these nonadherence factors could help health professionals in referring certain alcoholic patients to therapeutic interventions other than AA.
Simon van der Meer in the AA Control Room
CERN PhotoLab
1984-01-01
Simon van der Meer, spiritus rector of the Antiproton Accumulator, in the AA Control Room. Inventor of stochastic cooling, on which the AA was based, and of the magnetic horn, with which the antiprotons were focused, he also wrote most of the software with which the AA was controlled, and spent uncountable numbers of hours in this chair to tickle the AA to top performance. 8 months after this picture was taken, he received, in October 1984, the Nobel prize, together with Carlo Rubbia, the moving force behind the whole Proton-Antiproton Collider project that led to the discovery, in 1983, of the W and Z intermediate bosons.
2011-01-01
and R.S. Mishra, Effect of Friction Stir 940Processing on the Microstructure of Cast A356 Aluminum , Mater. Sci. 941Eng. A, 2006, 433, p 269–278...REPORT Computational Investigation of Hardness Evolution During Friction-Stir Welding of AA5083 and AA2139 Aluminum Alloys 14. ABSTRACT 16. SECURITY...is combined with the basic physical metallurgy of two wrought aluminum alloys to predict/assess their FSW behaviors. The two alloys selected are AA5083
Andberg, Martina; Mollerup, Filip; Parikka, Kirsti; Koutaniemi, Sanna; Boer, Harry; Juvonen, Minna; Master, Emma; Tenkanen, Maija; Kruus, Kristiina
2017-08-04
We describe here the identification and characterization of a copper radical oxidase from Auxiliary Activities Family 5 (AA5_2) that was distinguished by showing preferential activity towards raffinose. Despite the biotechnological potential of carbohydrate oxidases from family AA5, very few members have been characterized. The gene encoding raffinose oxidase activity from Colletotrichum graminicola, (Cg RaOx; EC 1.1.3.-) was identified utilizing a bioinformatics approach based on the known modular structure of a characterized AA5_2 galactose oxidase. Cg RaOx was expressed in Pichia pastoris and the purified enzyme displayed the highest activity on the trisaccharide raffinose, whereas the activity on the disaccharide melibiose was three times lower and more than ten times lower activity was detected on D-galactose at 300 mM substrate concentration. Thus, the substrate preference of Cg RaOx distinguished clearly from the known galactose oxidases. The site of oxidation for raffinose was studied by (1)H NMR and mass spectrometry, and confirmed that the hydroxyl group at the C6 position was oxidized to an aldehyde, and that in addition uronic acid was produced as a side product. A new ESI-MS method for the identification of C-6 oxidized products was developed and the formation mechanism of the uronic acid studied. Cg RaOx presented a novel activity pattern in the AA5 family.Importance Currently there are only a few characterized members of the CAZy AA5 protein family. These enzymes are interesting from an application point of view because of their ability to utilize the cheap and abundant oxidant O2 without the requirement ofcomplex cofactors such as FAD or NAD(P). Here we present the identification and characterization of a novel AA5 member from Colletotrichum graminicola As discussed in the paper, the bioinformatics approach using the modular structure of galactose oxidase was successful in finding a C6-OH carbohydrate oxidase having substrate preference for the
Inversion and approximation of Laplace transforms
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.
Computing Functions by Approximating the Input
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…
Non-Linear Approximation of Bayesian Update
Litvinenko, Alexander
2016-06-23
We develop a non-linear approximation of expensive Bayesian formula. This non-linear approximation is applied directly to Polynomial Chaos Coefficients. In this way, we avoid Monte Carlo sampling and sampling error. We can show that the famous Kalman Update formula is a particular case of this update.
Random Attractors of Stochastic Modified Boussinesq Approximation
Institute of Scientific and Technical Information of China (English)
郭春晓
2011-01-01
The Boussinesq approximation is a reasonable model to describe processes in body interior in planetary physics. We refer to [1] and [2] for a derivation of the Boussinesq approximation, and [3] for some related results of existence and uniqueness of solution.
Approximating a harmonizable isotropic random field
Directory of Open Access Journals (Sweden)
Randall J. Swift
2001-01-01
Full Text Available The class of harmonizable fields is a natural extension of the class of stationary fields. This paper considers a stochastic series approximation of a harmonizable isotropic random field. This approximation is useful for numerical simulation of such a field.
On approximating multi-criteria TSP
Manthey, Bodo; Albers, S.; Marion, J.-Y.
2009-01-01
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized app
Regression with Sparse Approximations of Data
DEFF Research Database (Denmark)
Noorzad, Pardis; Sturm, Bob L.
2012-01-01
We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected by...
A case where BO Approximation breaks down
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
@@ The Bom-Oppenheimer (BO)Approximation is ubiquitous in molecular physics,quantum physics and quantum chemistry. However, CAS researchers recently observed a breakdown of the Approximation in the reaction of fluorine with deuterium atoms.The result has been published in the August 24 issue of Science.
Two Point Pade Approximants and Duality
Banks, Tom
2013-01-01
We propose the use of two point Pade approximants to find expressions valid uniformly in coupling constant for theories with both weak and strong coupling expansions. In particular, one can use these approximants in models with a strong/weak duality, when the symmetries do not determine exact expressions for some quantity.
Function Approximation Using Probabilistic Fuzzy Systems
J.H. van den Berg (Jan); U. Kaymak (Uzay); R.J. Almeida e Santos Nogueira (Rui Jorge)
2011-01-01
textabstractWe consider function approximation by fuzzy systems. Fuzzy systems are typically used for approximating deterministic functions, in which the stochastic uncertainty is ignored. We propose probabilistic fuzzy systems in which the probabilistic nature of uncertainty is taken into account.
Approximation of the Inverse -Frame Operator
Indian Academy of Sciences (India)
M R Abdollahpour; A Najati
2011-05-01
In this paper, we introduce the concept of (strong) projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we like using finite-dimensional linear algebra.
Nonlinear approximation with dictionaries I. Direct estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2004-01-01
with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...
Approximations for stop-loss reinsurance premiums
Reijnen, Rajko; Albers, Willem/Wim; Kallenberg, W.C.M.
2005-01-01
Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are use
Quirks of Stirling's Approximation
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…
INVARIANT RANDOM APPROXIMATION IN NONCONVEX DOMAIN
Directory of Open Access Journals (Sweden)
R. Shrivastava
2012-05-01
Full Text Available Random fixed point results in the setup of compact and weakly compact domain of Banach spaces which is not necessary starshaped have been obtained in the present work. Invariant random approximation results have also been determined asits application. In this way, random version of invariant approximation results due toMukherjee and Som [13] and Singh [17] have been given.
Approximability and Parameterized Complexity of Minmax Values
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt; Hansen, Thomas Dueholm; Miltersen, Peter Bro;
2008-01-01
We consider approximating the minmax value of a multi player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ε log n digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand...
Hardness of approximation for strip packing
DEFF Research Database (Denmark)
Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin
2017-01-01
[SODA 2016] have recently proposed a (1.4 + ϵ)-approximation algorithm for this variant, thus showing that strip packing with polynomially bounded data can be approximated better than when exponentially large values are allowed in the input. Their result has subsequently been improved to a (4/3 + ϵ...
Approximations for stop-loss reinsurance premiums
Reijnen, Rajko; Albers, Willem; Kallenberg, Wilbert C.M.
2005-01-01
Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are use
Approximations for stop-loss reinsurance premiums
Reijnen, R.; Albers, W.; Kallenberg, W.C.M.
2003-01-01
Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are use
Lifetime of the Nonlinear Geometric Optics Approximation
DEFF Research Database (Denmark)
Binzer, Knud Andreas
The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations.......The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations....
An improved proximity force approximation for electrostatics
Fosco, C D; Mazzitelli, F D
2012-01-01
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 to 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 contribution of which are approximated as due to pairs of parallel planes. This approximation has been widely and successfully applied to 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 to discuss the geometric dependence of the electrostatic force, and also as a convenient benchmark for numerical analyses of the tip-sample electrostatic interaction i...
Approximate Furthest Neighbor in High Dimensions
DEFF Research Database (Denmark)
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen;
2015-01-01
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclid......Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high......-dimensional Euclidean space. We build on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk’s approximation factor and reducing the running time by a logarithmic factor. We also present a variation...
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-01-01
The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400--407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305--320]. The application of the trajectory averaging estimator to other stochastic approximation MCMC algorithms, for example, a stochastic approximation MLE al...
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.
NCBI nr-aa BLAST: CBRC-DYAK-02-0048 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DYAK-02-0048 gb|AAS74186.1| 5-HT1A [Drosophila melanogaster] gb|AAS74187.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74231.1| 5-HT1A [Drosophila melanogaster] gb|AAS74233.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74373.1| 5-HT1A [Drosophila melanogaster] AAS74186.1 1e-163 91% ...
NCBI nr-aa BLAST: CBRC-DSIM-02-0057 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DSIM-02-0057 gb|AAS74184.1| 5-HT1A [Drosophila melanogaster] gb|AAS74194.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74236.1| 5-HT1A [Drosophila melanogaster] gb|AAS74326.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74372.1| 5-HT1A [Drosophila melanogaster] AAS74184.1 1e-177 97% ...
NCBI nr-aa BLAST: CBRC-DYAK-02-0048 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DYAK-02-0048 gb|AAS74184.1| 5-HT1A [Drosophila melanogaster] gb|AAS74194.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74236.1| 5-HT1A [Drosophila melanogaster] gb|AAS74326.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74372.1| 5-HT1A [Drosophila melanogaster] AAS74184.1 1e-163 91% ...
Prat, Vincent; Lignières, François; Ballot, Jérôme; Culpin, Pierre-Marie
2016-01-01
Context. As of today, asteroseismology mainly allows us to probe internal rotation of stars when modes are only weakly affected by rotation using perturbative methods. Such methods cannot be applied to rapidly rotating stars, which exhibit complex oscillation spectra. In this context, the so-called traditional approximation, which neglects the terms associated with the latitudinal component of the rotation vector, describes modes that are strongly affected by rotation and is sometimes used for interpreting asteroseismic data. However, its domain of validity is not established yet. Aims. We aim at deriving analytical prescriptions for period spacings of low-frequency gravity modes strongly affected by rotation through the full Coriolis acceleration that can be used to probe stellar internal structure and rotation. Methods. The asymptotic theory of gravito-inertial waves in uniformly rotating stars using ray theory described by Prat et al. (2016, A&A, 587, A110) is approximated in the low-frequency regime, ...
AAS Special Session: Policy Making in Astronomy
Cardelli, J. A.; Massa, D.
1995-12-01
The professional astronomical community today is more diverse than at any time in its history. Individuals participating in creative research programs can be found in a wide range of positions. This type of diversity, which mixes research, education, and service (e.g. contract) work, represents the strength of contemporary astronomy. While recognizing the unavoidable reductions in funding and restructuring of organizations like NASA, it is imperative that the significance of the current diversity be considered during these processes. Creative ideas are one of the cornerstones of quality research, and they can originate anywhere. Consequently, it is essential that adequate research resources remain available for free and open competition by all astronomers. Our goal in this session is to bring together officials from the AAS, NASA, and the NSF to discuss how the policy and decision making process operates and whether it should be changed to better serve the general needs of the professional astronomical community. Examples of the issues we believe are important include: In establishing new policy, how can the needs of the average research astronomer be better addressed? How could input from such astronomers be provided to those who craft NASA/NSF policy? How can/should the AAS serve as an interface between policy/decision making bodies and its membership? Should the AAS membership become more actively/effectively involved in the decision making process and, if so, how? More information on this session and related issues can be found at the Association of Research Astronomers Home Page: http://www.phy.vill.edu/astro/faculty/ara/ara_home.htm
Swift Observations of SN 2007aa
Immler, S.; Brown, P. J.; Milne, P.
2007-03-01
Swift Ultraviolet/Optical Telescope (UVOT) and X-Ray Telescope (XRT) observed the type II SN 2007aa (CBET #850, IAUC #8814) on 2007-02-24.63 UT. The following UVOT magnitudes were measured: V = 15.8 (322 s exposure time), B = 16.4 (367 s), U = 16.9 (367 s), UVW1 [181-321nm] = 18.6 (737 s), UVM2 [166-268 nm] > 19.5 (3-sigma upper limit; 236 s), and UVW2 [112-264 nm] = 19.7 (725 s). The magnitudes have not been corrected for extinction.
AA, Inner Conductor of Magnetic Horn
CERN PhotoLab
1979-01-01
Antiprotons emerging at large angles from the production target (hit by an intense 26 GeV proton beam from the PS), were focused into the acceptance of the injection line of the AA by means of a "magnetic horn" (current-sheet lens). Here we see an early protype of the horn's inner conductor, machined from solid aluminium to a thickness of less than 1 mm. The 1st version had to withstand pulses of 150 kA, 15 us long, every 2.4 s. See 8801040 for a later version.
Atlas of Vega: 3850 -- 6860 \\AA
Kim, Hyun-Sook; Valyavin, G; Lee, Byeong-Cheol; Shimansky, V; Galazutdinov, G A
2009-01-01
We present a high resolving power ($\\lambda$ / $\\Delta\\lambda$ = 90,000) and high signal-to-noise ratio ($\\sim$700) spectral atlas of Vega covering the 3850 -- 6860 \\AA wavelength range. The atlas is a result of averaging of spectra recorded with the aid of the echelle spectrograph BOES fed by the 1.8-m telescope at Bohyunsan observatory (Korea). The atlas is provided only in machine-readable form (electronic data file) and will be available in the SIMBAD database upon publication.
Wooden Model of Wide AA Bending Magnet
1978-01-01
The very particular lattice of the AA required 2 types of dipoles (bending magnets: BLG, long and narrow; BST, short and wide). A wide one had a steel length of 2.71 m, a "good field" width of 0.564 m, and a weight of about 75 t. A wooden model was build in 1978, to gain dimensional experience. Here, Peter Zettwoch, one of the largest men at CERN at that time, is putting a hand in the mouth of the wooden BST monster.
Frankenstein's glue: transition functions for approximate solutions
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.
Entanglement in the Born-Oppenheimer Approximation
Izmaylov, Artur F
2016-01-01
The role of electron-nuclear entanglement on the validity of the Born-Oppenheimer (BO) approximation is investigated. While nonadiabatic couplings generally lead to entanglement and to a failure of the BO approximation, surprisingly the degree of electron-nuclear entanglement is found to be uncorrelated with the degree of validity of the BO approximation. This is because while the degree of entanglement of BO states is determined by their deviation from the corresponding states in the crude BO approximation, the accuracy of the BO approximation is dictated, instead, by the deviation of the BO states from the exact electron-nuclear states. In fact, in the context of a minimal avoided crossing model, extreme cases are identified where an adequate BO state is seen to be maximally entangled, and where the BO approximation fails but the associated BO state remains approximately unentangled. Further, the BO states are found to not preserve the entanglement properties of the exact electron-nuclear eigenstates, and t...
DIFFERENCE SCHEMES BASING ON COEFFICIENT APPROXIMATION
Institute of Scientific and Technical Information of China (English)
MOU Zong-ze; LONG Yong-xing; QU Wen-xiao
2005-01-01
In respect of variable coefficient differential equations, the equations of coefficient function approximation were more accurate than the coefficient to be frozen as a constant in every discrete subinterval. Usually, the difference schemes constructed based on Taylor expansion approximation of the solution do not suit the solution with sharp function.Introducing into local bases to be combined with coefficient function approximation, the difference can well depict more complex physical phenomena, for example, boundary layer as well as high oscillatory, with sharp behavior. The numerical test shows the method is more effective than the traditional one.
Approximate equivalence in von Neumann algebras
Institute of Scientific and Technical Information of China (English)
DING; Huiru; Don; Hadwin
2005-01-01
One formulation of D. Voiculescu's theorem on approximate unitary equivalence is that two unital representations π and ρ of a separable C*-algebra are approximately unitarily equivalent if and only if rank o π = rank o ρ. We study the analog when the ranges of π and ρ are contained in a von Neumann algebra R, the unitaries inducing the approximate equivalence must come from R, and "rank" is replaced with "R-rank" (defined as the Murray-von Neumann equivalence of the range projection).
Approximation of free-discontinuity problems
Braides, Andrea
1998-01-01
Functionals involving both volume and surface energies have a number of applications ranging from Computer Vision to Fracture Mechanics. In order to tackle numerical and dynamical problems linked to such functionals many approximations by functionals defined on smooth functions have been proposed (using high-order singular perturbations, finite-difference or non-local energies, etc.) The purpose of this book is to present a global approach to these approximations using the theory of gamma-convergence and of special functions of bounded variation. The book is directed to PhD students and researchers in calculus of variations, interested in approximation problems with possible applications.
Mathematical analysis, approximation theory and their applications
Gupta, Vijay
2016-01-01
Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.
Regression with Sparse Approximations of Data
DEFF Research Database (Denmark)
Noorzad, Pardis; Sturm, Bob L.
2012-01-01
We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected...... by a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...
Orthorhombic rational approximants for decagonal quasicrystals
Indian Academy of Sciences (India)
S Ranganathan; Anandh Subramaniam
2003-10-01
An important exercise in the study of rational approximants is to derive their metric, especially in relation to the corresponding quasicrystal or the underlying clusters. Kuo’s model has been the widely accepted model to calculate the metric of the decagonal approximants. Using an alternate model, the metric of the approximants and other complex structures with the icosahedral cluster are explained elsewhere. In this work a comparison is made between the two models bringing out their equivalence. Further, using the concept of average lattices, a modified model is proposed.
Approximation of the semi-infinite interval
Directory of Open Access Journals (Sweden)
A. McD. Mercer
1980-01-01
Full Text Available The approximation of a function f∈C[a,b] by Bernstein polynomials is well-known. It is based on the binomial distribution. O. Szasz has shown that there are analogous approximations on the interval [0,∞ based on the Poisson distribution. Recently R. Mohapatra has generalized Szasz' result to the case in which the approximating function is αe−ux∑k=N∞(uxkα+β−1Γ(kα+βf(kαuThe present note shows that these results are special cases of a Tauberian theorem for certain infinite series having positive coefficients.
Energy Technology Data Exchange (ETDEWEB)
Kubota, Akira [Biology Department, Woods Hole Oceanographic Institution, Woods Hole, MA 02543 (United States); Bainy, Afonso C.D. [Biology Department, Woods Hole Oceanographic Institution, Woods Hole, MA 02543 (United States); Departamento de Bioquímica, CCB, Universidade Federal de Santa Catarina, Florianopolis, SC 88040-900 (Brazil); Woodin, Bruce R.; Goldstone, Jared V. [Biology Department, Woods Hole Oceanographic Institution, Woods Hole, MA 02543 (United States); Stegeman, John J., E-mail: jstegeman@whoi.edu [Biology Department, Woods Hole Oceanographic Institution, Woods Hole, MA 02543 (United States)
2013-10-01
The cytochrome P450 (CYP) 2 gene family is the largest and most diverse CYP gene family in vertebrates. In zebrafish, we have identified 10 genes in a new subfamily, CYP2AA, which does not show orthology to any human or other mammalian CYP genes. Here we report evolutionary and structural relationships of the 10 CYP2AA genes and expression of the first two genes, CYP2AA1 and CYP2AA2. Parsimony reconstruction of the tandem duplication pattern for the CYP2AA cluster suggests that CYP2AA1, CYP2AA2 and CYP2AA3 likely arose in the earlier duplication events and thus are most diverged in function from the other CYP2AAs. On the other hand, CYP2AA8 and CYP2AA9 are genes that arose in the latest duplication event, implying functional similarity between these two CYPs. A molecular model of CYP2AA1 showing the sequence conservation across the CYP2AA cluster reveals that the regions with the highest variability within the cluster map onto CYP2AA1 near the substrate access channels, suggesting differing substrate specificities. Zebrafish CYP2AA1 transcript was expressed predominantly in the intestine, while CYP2AA2 was most highly expressed in the kidney, suggesting differing roles in physiology. In the liver CYP2AA2 expression but not that of CYP2AA1, was increased by 1,4-bis [2-(3,5-dichloropyridyloxy)] benzene (TCPOBOP) and, to a lesser extent, by phenobarbital (PB). In contrast, pregnenolone 16α-carbonitrile (PCN) increased CYP2AA1 expression, but not CYP2AA2 in the liver. The results identify a CYP2 subfamily in zebrafish that includes genes apparently induced by PB-type chemicals and PXR agonists, the first concrete in vivo evidence for a PB-type response in fish. - Highlights: • A tandemly duplicated cluster of ten CYP2AA genes was described in zebrafish. • Parsimony and duplication analyses suggest pathways to CYP2AA diversity. • Homology models reveal amino acid positions possibly related to functional diversity. • The CYP2AA locus does not share synteny with
An overview on Approximate Bayesian computation*
Directory of Open Access Journals (Sweden)
Baragatti Meïli
2014-01-01
Full Text Available Approximate Bayesian computation techniques, also called likelihood-free methods, are one of the most satisfactory approach to intractable likelihood problems. This overview presents recent results since its introduction about ten years ago in population genetics.
Trigonometric Approximations for Some Bessel Functions
Muhammad Taher Abuelma'atti
1999-01-01
Formulas are obtained for approximating the tabulated Bessel functions Jn(x), n = 0–9 in terms of trigonometric functions. These formulas can be easily integrated and differentiated and are convenient for personal computers and pocket calculators.
Low Rank Approximation Algorithms, Implementation, Applications
Markovsky, Ivan
2012-01-01
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...
Asynchronous stochastic approximation with differential inclusions
Directory of Open Access Journals (Sweden)
David S. Leslie
2012-01-01
Full Text Available The asymptotic pseudo-trajectory approach to stochastic approximation of Benaïm, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into the mean field to produce convergence results which remain similar to those of an equivalent synchronous process. In addition, this allows many of the restrictive assumptions previously associated with asynchronous stochastic approximation to be removed. The framework is extended for a coupled asynchronous stochastic approximation process with set-valued mean fields. Two-timescales arguments are used here in a similar manner to the original work in this area by Borkar. The applicability of this approach is demonstrated through learning in a Markov decision process.
An approximate Expression for Viscosity of Nanosuspensions
Domostroeva, N G
2009-01-01
We consider liquid suspensions with dispersed nanoparticles. Using two-points Pade approximants and combining results of both hydrodynamic and molecular dynamics methods, we obtain the effective viscosity for any diameters of nanoparticles
On Approximating Four Covering and Packing Problems
Ashley, Mary; Berman, Piotr; Chaovalitwongse, Wanpracha; DasGupta, Bhaskar; Kao, Ming-Yang; 10.1016/j.jcss.2009.01.002
2011-01-01
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from full-sibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results; this is done by directly transforming the inapproximability gap of Haastad for the problem of maximizing the number of satisfied equations for a set of equations over GF(2) and is interesting in its own right. Our approximability results on the full siblings reconstruction problems answers questions originally posed by Berger-Wolf et al. and our results on the maximum profit coverage problem provides almost matching upper and lower bounds on the approximation ratio, answering a...
Staying thermal with Hartree ensemble approximations
Energy Technology Data Exchange (ETDEWEB)
Salle, Mischa E-mail: msalle@science.uva.nl; Smit, Jan E-mail: jsmit@science.uva.nl; Vink, Jeroen C. E-mail: jcvink@science.uva.nl
2002-03-25
We study thermal behavior of a recently introduced Hartree ensemble approximation, which allows for non-perturbative inhomogeneous field configurations as well as for approximate thermalization, in the phi (cursive,open) Greek{sup 4} model in 1+1 dimensions. Using ensembles with a free field thermal distribution as out-of-equilibrium initial conditions we determine thermalization time scales. The time scale for which the system stays in approximate quantum thermal equilibrium is an indication of the time scales for which the approximation method stays reasonable. This time scale turns out to be two orders of magnitude larger than the time scale for thermalization, in the range of couplings and temperatures studied. We also discuss simplifications of our method which are numerically more efficient and make a comparison with classical dynamics.
Approximations of solutions to retarded integrodifferential equations
Directory of Open Access Journals (Sweden)
Dhirendra Bahuguna
2004-11-01
Full Text Available In this paper we consider a retarded integrodifferential equation and prove existence, uniqueness and convergence of approximate solutions. We also give some examples to illustrate the applications of the abstract results.
Approximation methods in gravitational-radiation theory
Will, C. M.
1986-02-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. The author summarizes recent developments in two areas in which approximations are important: (1) the quadrupole approximation, 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 (2) the normal modes of oscillation of black holes, where the Wentzel-Kramers-Brillouin approximation gives accurate estimates of the complex frequencies of the modes.
APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION
Directory of Open Access Journals (Sweden)
Mădălina Roxana Buneci
2016-12-01
Full Text Available The purpose of this paper is provide a set of Maple procedures to construct approximate developments of a general surface of revolution generalizing the well-known gore method for sphere
Methods of Fourier analysis and approximation theory
Tikhonov, Sergey
2016-01-01
Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.
Seismic wave extrapolation using lowrank symbol approximation
Fomel, Sergey
2012-04-30
We consider the problem of constructing a wave extrapolation operator in a variable and possibly anisotropic medium. Our construction involves Fourier transforms in space combined with the help of a lowrank approximation of the space-wavenumber wave-propagator matrix. A lowrank approximation implies selecting a small set of representative spatial locations and a small set of representative wavenumbers. We present a mathematical derivation of this method, a description of the lowrank approximation algorithm and numerical examples that confirm the validity of the proposed approach. Wave extrapolation using lowrank approximation can be applied to seismic imaging by reverse-time migration in 3D heterogeneous isotropic or anisotropic media. © 2012 European Association of Geoscientists & Engineers.
Approximate Flavor Symmetry in Supersymmetric Model
Tao, Zhijian
1998-01-01
We investigate the maximal approximate flavor symmetry in the framework of generic minimal supersymmetric standard model. We consider the low energy effective theory of the flavor physics with all the possible operators included. Spontaneous flavor symmetry breaking leads to the approximate flavor symmetry in Yukawa sector and the supersymmetry breaking sector. Fermion mass and mixing hierachies are the results of the hierachy of the flavor symmetry breaking. It is found that in this theory i...
Pointwise approximation by elementary complete contractions
Magajna, Bojan
2009-01-01
A complete contraction on a C*-algebra A, which preserves all closed two sided ideals J, can be approximated pointwise by elementary complete contractions if and only if the induced map on the tensor product of B with A/J is contractive for every C*-algebra B, ideal J in A and C*-tensor norm on the tensor product. A lifting obstruction for such an approximation is also obtained.
Polynomial approximation of functions in Sobolev spaces
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.
Parallel local approximation MCMC for expensive models
Conrad, Patrick; Davis, Andrew; Marzouk, Youssef; Pillai, Natesh; Smith, Aaron
2016-01-01
Performing Bayesian inference via Markov chain Monte Carlo (MCMC) can be exceedingly expensive when posterior evaluations invoke the evaluation of a computationally expensive model, such as a system of partial differential equations. In recent work [Conrad et al. JASA 2015, arXiv:1402.1694] we described a framework for constructing and refining local approximations of such models during an MCMC simulation. These posterior--adapted approximations harness regularity of the model to reduce the c...
The Actinide Transition Revisited by Gutzwiller Approximation
Xu, Wenhu; Lanata, Nicola; Yao, Yongxin; Kotliar, Gabriel
2015-03-01
We revisit the problem of the actinide transition using the Gutzwiller approximation (GA) in combination with the local density approximation (LDA). In particular, we compute the equilibrium volumes of the actinide series and reproduce the abrupt change of density found experimentally near plutonium as a function of the atomic number. We discuss how this behavior relates with the electron correlations in the 5 f states, the lattice structure, and the spin-orbit interaction. Our results are in good agreement with the experiments.
Intuitionistic Fuzzy Automaton for Approximate String Matching
Directory of Open Access Journals (Sweden)
K.M. Ravi
2014-03-01
Full Text Available This paper introduces an intuitionistic fuzzy automaton model for computing the similarity between pairs of strings. The model details the possible edit operations needed to transform any input (observed string into a target (pattern string by providing a membership and non-membership value between them. In the end, an algorithm is given for approximate string matching and the proposed model computes the similarity and dissimilarity between the pair of strings leading to better approximation.
Approximations for the Erlang Loss Function
DEFF Research Database (Denmark)
Mejlbro, Leif
1998-01-01
Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error <1E-2, and methods are indicated for improving this bound.......Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error
Staying Thermal with Hartree Ensemble Approximations
Salle, M; Vink, Jeroen C
2000-01-01
Using Hartree ensemble approximations to compute the real time dynamics of scalar fields in 1+1 dimension, we find that with suitable initial conditions, approximate thermalization is achieved much faster than found in our previous work. At large times, depending on the interaction strength and temperature, the particle distribution slowly changes: the Bose-Einstein distribution of the particle densities develops classical features. We also discuss variations of our method which are numerically more efficient.
Lattice quantum chromodynamics with approximately chiral fermions
Energy Technology Data Exchange (ETDEWEB)
Hierl, Dieter
2008-05-15
In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the {theta}{sup +} pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)
Nonlinear approximation in alpha-modulation spaces
DEFF Research Database (Denmark)
Borup, Lasse; Nielsen, Morten
2006-01-01
The α-modulation spaces are a family of spaces that contain the Besov and modulation spaces as special cases. In this paper we prove that brushlet bases can be constructed to form unconditional and even greedy bases for the α-modulation spaces. We study m -term nonlinear approximation with brushlet...... bases, and give complete characterizations of the associated approximation spaces in terms of α-modulation spaces....
On surface approximation using developable surfaces
DEFF Research Database (Denmark)
Chen, H. Y.; Lee, I. K.; Leopoldseder, s.
1999-01-01
We introduce a method for approximating a given surface by a developable surface. It will be either a G(1) surface consisting of pieces of cones or cylinders of revolution or a G(r) NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding. (C) 1999 Academic Press....
On surface approximation using developable surfaces
DEFF Research Database (Denmark)
Chen, H. Y.; Lee, I. K.; Leopoldseder, S.
1998-01-01
We introduce a method for approximating a given surface by a developable surface. It will be either a G_1 surface consisting of pieces of cones or cylinders of revolution or a G_r NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding....
Differential geometry of proteins. Helical approximations.
Louie, A H; Somorjai, R L
1983-07-25
We regard a protein molecule as a geometric object, and in a first approximation represent it as a regular parametrized space curve passing through its alpha-carbon atoms (the backbone). In an earlier paper we argued that the regular patterns of secondary structures of proteins (morphons) correspond to geodesics on minimal surfaces. In this paper we discuss methods of recognizing these morphons on space curves that represent the protein backbone conformation. The mathematical tool we employ is the differential geometry of curves and surfaces. We introduce a natural approximation of backbone space curves in terms of helical approximating elements and present a computer algorithm to implement the approximation. Simple recognition criteria are given for the various morphons of proteins. These are incorporated into our helical approximation algorithm, together with more non-local criteria for the recognition of beta-sheet topologies. The method and the algorithm are illustrated with several examples of representative proteins. Generalizations of the helical approximation method are considered and their possible implications for protein energetics are sketched.
Sköld, U M
2016-12-01
Approximal surfaces are a focal point for caries prevention among adolescents in Sweden and the aims of this study were therefore to evaluate approximal caries incidence and caries progression among adolescents with and without a three-year school-based fluoride varnish programme in relation to approximal caries prevalence at baseline. In all, 758 (89%) 13-year-olds completed the three-year randomised controlled trial. They all used fluoride toothpaste at home and had regular dental check-ups at the public dental clinics. The mean approximal caries incidence for the adolescents who were caries free on these surfaces at baseline was 0.13 (SD 0.54) in the fluoride varnish group and 0.79 (1.93) in the control group. The corresponding values for those who had caries at baseline in these groups were 1.29 (2.21) and 2.62 (3.22) respectively. The latter two groups also had 0.34 (1.00) and 0.70 (1.13) approximal enamel lesions that progressed. All differences were statistically significant (p⟨0.001). Among those individuals who had approximal caries at baseline, double the number of early approximal enamel lesions in the control group progressed compared with the fluoride varnish group. The school-based fluoride varnish programme inhibited new approximal lesions to a great extent and effectively kept approximal enamel lesions within the enamel among 13-16-year-olds. It is therefore recommended that such a programme is warranted when the approximal surfaces are still caries free in order to keep these surfaces free from caries and keep upcoming approximal enamel lesions within the enamel.
DEFF Research Database (Denmark)
Sadegh, Payman
1997-01-01
This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...
NCBI nr-aa BLAST: CBRC-DSIM-04-0001 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DSIM-04-0001 gb|AAS74960.1| 5-HT2 [Drosophila melanogaster] gb|AAS74962.1| 5-HT2 [Drosophila... melanogaster] gb|AAS74964.1| 5-HT2 [Drosophila melanogaster] gb|AAS74966.1| 5-HT2 [Drosophila... melanogaster] gb|AAS74970.1| 5-HT2 [Drosophila melanogaster] gb|AAS74972.1| 5-HT2 [Drosophila melanogaster]... gb|AAS74976.1| 5-HT2 [Drosophila melanogaster] gb|AAS74978.1| 5-HT2 [Drosophila ...melanogaster] gb|AAS74979.1| 5-HT2 [Drosophila melanogaster] gb|AAS74980.1| 5-HT2 [Drosophila melanogaster] gb|AAS74981.1| 5-HT2 [Dro
Effect of altitude relocations upon AaDo2 at rest and during exercise.
Cruz, J C; Hartley, L H; Vogel, J A
1975-09-01
The supine pulmonary venous admixture (shunt) has been measured at Cerro de Pasco, 4,350 m altitude in eight subjects native to high altitude (HAN) under resting condition. Alveolar-arterial O2 tension difference (AaDO2) was also determined at rest and during exercise. The same subjects were studied again after 10 days' sojourn at sea level in Lima at 150 m altitude. They were compared with four subjects from sea level (SLN) who were studied first at Lima and after 2 and 10 days at Cerro de Pasco. At altitude, AaDO2 was smaller in HAN than SLN both at rest and during exercise. Shunt was the same in both groups. It is concluded that HAN show more even ventilation/perfusion relationship (VA/Q) at altitude, probably due to their high pulmonary artery pressure. On the contrary, SLN show less even VA/Q on altitude exposure, since their shunt decreased 37%. At sea level, HAN increased their AaDO2 due partially to an increase of 110% in their shunt, and in part due to less even VA/Q as shown by augmented VD/VT ratios. Each group tended to have a more effective gas exchange in its own environment.
Recombinant scorpion insectotoxin AaIT kills specifically insect cells but not human cells
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
The nucleotide sequence deduced from the amino acid sequence of the scorpion insectotoxin AaIT was chemically synthesized and was expressed in Escherichia coli. The authenticity of this in vitro expressed peptide was confirmed by N-terminal peptide sequencing. Two groups of bioassays, artificial diet incorporation assay and contact insecticidal effect assay, were carried out separately to verify the toxicity of this recombinant toxin. At the end of a 24 h experimental period, more than 60% of the testing diamondback moth (Plutella xylostella) larvae were killed in both groups with LCs0 value of 18.4 uM and 0.70 μM respectively. Cytotoxicity assay using cultured Sf9 insect cells and MCF-7 human cells demonstrated that the toxin AaIT had specific toxicity against insect cells but not human cells. Only 0.13 μM recombinant toxin was needed to kill 50% of cultured insect cells while as much as 1.3μM toxin had absolutely no effect on human cells. Insect cells produced obvious intrusions from their plasma membrane before broken up. We infer that toxin AaIT bind to a putative sodium channel in these insect cells and open the channel persistently, which would result in Na+ influx and finally cause destruction of insect cells.
Dalmasse, K; Gibson, S E; Fan, Y; Flyer, N
2016-01-01
The Coronal Multichannel Polarimeter (CoMP) routinely performs coronal polarimetric measurements using the Fe XIII 10747 $\\AA$ and 10798 $\\AA$ lines, which are sensitive to the coronal magnetic field. However, inverting such polarimetric measurements into magnetic field data is a difficult task because the corona is optically thin at these wavelengths and the observed signal is therefore the integrated emission of all the plasma along the line of sight. To overcome this difficulty, we take on a new approach that combines a parameterized 3D magnetic field model with forward modeling of the polarization signal. For that purpose, we develop a new, fast and efficient, optimization method for model-data fitting: the Radial-basis-functions Optimization Approximation Method (ROAM). Model-data fitting is achieved by optimizing a user-specified log-likelihood function that quantifies the differences between the observed polarization signal and its synthetic/predicted analogue. Speed and efficiency are obtained by comb...
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.
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.
Directory of Open Access Journals (Sweden)
Chetan Patil
2016-07-01
Full Text Available This paper reports hardness testing conducted on welded butt joints by FSW and TIG welding process on similar and dissimilar aluminium alloys. FSW joints were produced for similar alloys of AA7075T651 and dissimilar alloys of AA7075T651- AA6061T6. The Friction stir welds of AA7075 & AA6061 aluminium alloy were produced at different tool rotational speeds of 650,700, 800, 900, 1000 and transverse speed of 30, 35, 40 mm/min. TIG welding was conducted along the rolling direction of similar and dissimilar aluminium plates. The Brinell hardness testing techniques were employed to conduct the tests; these tests were conducted on the welds to ascertain the joint integrity before characterization to have an idea of the quality of the welds
Etelälahti, Tiina J; Saarikoski, Sirkku T; Eriksson, C J Peter
2011-08-01
In our previous studies on alcohol-preferring AA (Alko alcohol) and nonpreferring ANA (Alko nonalcohol) rats, we have observed that the AA rats exhibit lower endogenous levels of corticosterone, higher testosterone levels, and more frequent alcohol-induced testosterone elevations when compared with ANA rats. The objective of the present study was to get more conclusive evidence for the potential role of the hypothalamus-pituitary-adrenal and hypothalamus-pituitary-gonadal axes in alcohol drinking by using the F2 experimental design. Alcohol-preferring AA and alcohol-nonpreferring ANA rat lines were crossbred to form a F1 population from which the final F2 population was derived. Male animals were challenged with a priming alcohol dose after which a 3 weeks' voluntary alcohol drinking period took place. After a washout period of 1 week, one-half of the 40 highest and 40 lowest alcohol drinkers were challenged with a second dose of alcohol and the other half with saline. Serum testosterone and corticosterone levels were measured before and during the test. Higher endogenous testosterone levels were detected in the rats of the high alcohol consumption group compared with the low consumption group. Also supporting the original AA/ANA line differences, a trend for lower endogenous corticosterone levels were measured in the high alcohol consumption group compared with the low consumption group. The alcohol challenge test after the drinking period resulted in a higher frequency (38%) of testosterone elevations in the high drinkers compared with the low drinkers (5%). The present data confirms the validity of the positive connections between testosterone elevation and increased alcohol drinking, as well as between testosterone reduction and decreased alcohol drinking, in AA and ANA rats.
Tree-fold loop approximation of AMD
Energy Technology Data Exchange (ETDEWEB)
Ono, Akira [Tohoku Univ., Sendai (Japan). Faculty of Science
1997-05-01
AMD (antisymmetrized molecular dynamics) is a frame work for describing a wave function of nucleon multi-body system by Slater determinant of Gaussian wave flux, and a theory for integrally describing a wide range of nuclear reactions such as intermittent energy heavy ion reaction, nucleon incident reaction and so forth. The aim of this study is induction on approximation equation of expected value, {nu}, in correlation capable of calculation with time proportional A (exp 3) (or lower), and to make AMD applicable to the heavier system such as Au+Au. As it must be avoided to break characteristics of AMD, it needs not to be anxious only by approximating the {nu}-value. However, in order to give this approximation any meaning, error of this approximation will have to be sufficiently small in comparison with bond energy of atomic nucleus and smaller than 1 MeV/nucleon. As the absolute expected value in correlation may be larger than 50 MeV/nucleon, the approximation is required to have a high accuracy within 2 percent. (G.K.)
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-10-01
The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.
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
Monte Carlo simulation on kinetic behavior of one-pot hyperbranched polymerization based on AA*+CB2
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
Monte Carlo simulation was applied to investigate the kinetic behavior of AA*+CB2 system.The algorithm consisted of two procedures to simulate the in-situ synthesis of AB2-like intermediate and the subsequent polymerization,respectively.In order to improve the accuracy of the prediction,the mobility distinction between different scale molecules in polymerization was taken into account by relating the reaction rate constants to the collision possibility of each pair of species.The feed ratio of initial monomers and the activity difference between the two functional groups within AA* were studied systematically to catch the essential features of the reaction.Simulation results have revealed that the achievable maximum conversion primarily depends on the extent of the reactivity difference between A and A*-groups,and it is suggested that A*-group should be at least 10 times more active than A-group to achieve high number-average degree of polymerization.
Approximation Limits of Linear Programs (Beyond Hierarchies)
Braun, Gábor; Pokutta, Sebastian; Steurer, David
2012-01-01
We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for approximations of semidefinite programs by linear programs. Our main ingredient is a quantitative improvement of Razborov's rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjointness matrix.
Discontinuous Galerkin Methods with Trefftz Approximation
Kretzschmar, Fritz; Tsukerman, Igor; Weiland, Thomas
2013-01-01
We present a novel Discontinuous Galerkin Finite Element Method for wave propagation problems. The method employs space-time Trefftz-type basis functions that satisfy the underlying partial differential equations and the respective interface boundary conditions exactly in an element-wise fashion. The basis functions can be of arbitrary high order, and we demonstrate spectral convergence in the $\\Lebesgue_2$-norm. In this context, spectral convergence is obtained with respect to the approximation error in the entire space-time domain of interest, i.e. in space and time simultaneously. Formulating the approximation in terms of a space-time Trefftz basis makes high order time integration an inherent property of the method and clearly sets it apart from methods, that employ a high order approximation in space only.
Approximating light rays in the Schwarzschild field
Semerak, Oldrich
2014-01-01
A short formula is suggested which 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 behaviour is also discussed, important for lensing. An example is attached indicating that the newly suggested approximation is usable--and very accurate--for practical solving of the ray-deflection exercise.
On the approximate zero of Newton method
Institute of Scientific and Technical Information of China (English)
黄正达
2003-01-01
A judgment criterion to guarantee a point to be a Chen' s approximate zero of Newton method for solving nonlinear equation is sought by dominating sequence techniques. The criterion is based on the fact that the dominating function may have only one simple positive zero, assuming that the operator is weak Lipschitz continuous, which is much more relaxed and can be checked much more easily than Lipschitz continuous in practice. It is demonstrated that a Chen' s approximate zero may not be a Smale' s approximate zero. The error estimate obtained indicated the convergent order when we use |f(x) | < ε to stop computation in software.The result can also be applied for solving partial derivative and integration equations.
On the approximate zero of Newton method
Institute of Scientific and Technical Information of China (English)
黄正达
2003-01-01
A judgment criterion to guarantee a point to be a Chen's approximate zero of Newton method for solving nonlinear equation is sought by dominating sequence techniques. The criterion is based on the fact that the dominating function may have only one simple positive zero, assuming that the operator is weak Lipschitz continuous, which is much more relaxed and can be checked much more easily than Lipschitz continuous in practice. It is demonstrated that a Chen's approximate zero may not be a Smale's approximate zero. The error estimate obtained indicated the convergent order when we use |f(x)|<ε to stop computation in software. The result can also be applied for solving partial derivative and integration equations.
Optical pulse propagation with minimal approximations
Kinsler, Paul
2010-01-01
Propagation equations for optical pulses are needed to assist in describing applications in ever more extreme situations—including those in metamaterials with linear and nonlinear magnetic responses. Here I show how to derive a single first-order propagation equation using a minimum of approximations and a straightforward “factorization” mathematical scheme. The approach generates exact coupled bidirectional equations, after which it is clear that the description can be reduced to a single unidirectional first-order wave equation by means of a simple “slow evolution” approximation, where the optical pulse changes little over the distance of one wavelength. It also allows a direct term-to-term comparison of an exact bidirectional theory with the approximate unidirectional theory.
Rough interfaces beyond the Gaussian approximation
Caselle, M; Gliozzi, F; Hasenbusch, M; Pinn, K; Vinti, S; Caselle, M; Gliozzi, F; Fiore, R; Hasenbusch, M; Pinn, K; Vinti, S
1994-01-01
We compare predictions of the Capillary Wave Model beyond its Gaussian approximation with Monte Carlo results for the energy gap and the surface energy of the 3D Ising model in the scaling region. Our study reveals that the finite size effects of these quantities are well described by the Capillary Wave Model, expanded to two--loop order ( one order beyond the Gaussian approximation). We compare predictions of the Capillary Wave Model with Monte Carlo results for the energy gap and the interface energy of the 3D Ising model in the scaling region. Our study reveals that the finite size effects of these quantities are well described by the Capillary Wave Model, expanded to two-loop order (one order beyond the Gaussian approximation).
Implementing regularization implicitly via approximate eigenvector computation
Mahoney, Michael W
2010-01-01
Regularization is a powerful technique for extracting useful information from noisy data. Typically, it is implemented by adding some sort of norm constraint to an objective function and then exactly optimizing the modified objective function. This procedure typically leads to optimization problems that are computationally more expensive than the original problem, a fact that is clearly problematic if one is interested in large-scale applications. On the other hand, a large body of empirical work has demonstrated that heuristics, and in some cases approximation algorithms, developed to speed up computations sometimes have the side-effect of performing regularization implicitly. Thus, we consider the question: What is the regularized optimization objective that an approximation algorithm is exactly optimizing? We address this question in the context of computing approximations to the smallest nontrivial eigenvector of a graph Laplacian; and we consider three random-walk-based procedures: one based on the heat ...
On approximation of Markov binomial distributions
Xia, Aihua; 10.3150/09-BEJ194
2010-01-01
For a Markov chain $\\mathbf{X}=\\{X_i,i=1,2,...,n\\}$ with the state space $\\{0,1\\}$, the random variable $S:=\\sum_{i=1}^nX_i$ is said to follow a Markov binomial distribution. The exact distribution of $S$, denoted $\\mathcal{L}S$, is very computationally intensive for large $n$ (see Gabriel [Biometrika 46 (1959) 454--460] and Bhat and Lal [Adv. in Appl. Probab. 20 (1988) 677--680]) and this paper concerns suitable approximate distributions for $\\mathcal{L}S$ when $\\mathbf{X}$ is stationary. We conclude that the negative binomial and binomial distributions are appropriate approximations for $\\mathcal{L}S$ when $\\operatorname {Var}S$ is greater than and less than $\\mathbb{E}S$, respectively. Also, due to the unique structure of the distribution, we are able to derive explicit error estimates for these approximations.
Fast wavelet based sparse approximate inverse preconditioner
Energy Technology Data Exchange (ETDEWEB)
Wan, W.L. [Univ. of California, Los Angeles, CA (United States)
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.
Numerical approximation of partial differential equations
Bartels, Sören
2016-01-01
Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular ...
On Born approximation in black hole scattering
Energy Technology Data Exchange (ETDEWEB)
Batic, D. [University of West Indies, Department of Mathematics, Kingston (Jamaica); Kelkar, N.G.; Nowakowski, M. [Universidad de los Andes, Departamento de Fisica, Bogota (Colombia)
2011-12-15
A massless field propagating on spherically symmetric black hole metrics such as the Schwarzschild, Reissner-Nordstroem and Reissner-Nordstroem-de Sitter backgrounds is considered. In particular, explicit formulae in terms of transcendental functions for the scattering of massless scalar particles off black holes are derived within a Born approximation. It is shown that the conditions on the existence of the Born integral forbid a straightforward extraction of the quasi normal modes using the Born approximation for the scattering amplitude. Such a method has been used in literature. We suggest a novel, well defined method, to extract the large imaginary part of quasinormal modes via the Coulomb-like phase shift. Furthermore, we compare the numerically evaluated exact scattering amplitude with the Born one to find that the approximation is not very useful for the scattering of massless scalar, electromagnetic as well as gravitational waves from black holes. (orig.)
Time Stamps for Fixed-Point Approximation
DEFF Research Database (Denmark)
Damian, Daniela
2001-01-01
Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed-point approximat......Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed......-point approximation algorithm which maintains a single copy of intermediate results. We then prove the correctness of this algorithm....
Approximate Dynamic Programming in Tracking Control of a Robotic Manipulator
Marcin Szuster; Piotr Gierlak
2016-01-01
This article focuses on the implementation of an approximate dynamic programming algorithm in the discrete tracking control system of the three-degrees of freedom Scorbot-ER 4pc robotic manipulator. The controlled system is included in an articulated robots group which uses rotary joints to access their work space. The main part of the control system is a dual heuristic dynamic programming algorithm that consists of two structures designed in the form of neural networks: an actor and a critic...
Exponential Approximations Using Fourier Series Partial Sums
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.
Extending the Eikonal Approximation to Low Energy
Capel, Pierre; Ogata, Kazuyuki
2014-01-01
E-CDCC and DEA, two eikonal-based reaction models are compared to CDCC at low energy (e.g. 20AMeV) to study their behaviour in the regime at which the eikonal approximation is supposed to fail. We confirm that these models lack the Coulomb deflection of the projectile by the target. We show that a hybrid model, built on the CDCC framework at low angular momenta and the eikonal approximation at larger angular momenta gives a perfect agreement with CDCC. An empirical shift in impact parameter can also be used reliably to simulate this missing Coulomb deflection.
Approximately-Balanced Drilling in Daqing Oilfield
Institute of Scientific and Technical Information of China (English)
Xia Bairu; Zheng Xiuhua; Li Guoqing; Tian Tuo
2004-01-01
The Daqing oilfield is a multilayered heterogeneous oil field where the pressure are different in the same vertical profile causing many troubles to the adjustment well drillings. The approximately-balanced drilling technique has been developed and proved to be efficient and successful in Daqing oilfield. This paper discusses the application of approximately-balanced drilling technique under the condition of multilayered pressure in Daqing oilfield, including the prediction of formation pressure, the pressure discharge technique for the drilling well and the control of the density of drilling fluid.
Faddeev Random Phase Approximation for Molecules
Degroote, Matthias; Barbieri, Carlo
2010-01-01
The Faddeev Random Phase Approximation is a Green's function technique that makes use of Faddeev-equations to couple the motion of a single electron to the two-particle--one-hole and two-hole--one-particle excitations. This method goes beyond the frequently used third-order Algebraic Diagrammatic Construction method: all diagrams involving the exchange of phonons in the particle-hole and particle-particle channel are retained, but the phonons are described at the level of the Random Phase Approximation. This paper presents the first results for diatomic molecules at equilibrium geometry. The behavior of the method in the dissociation limit is also investigated.
An Approximate Bayesian Fundamental Frequency Estimator
DEFF Research Database (Denmark)
Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt
2012-01-01
Joint fundamental frequency and model order estimation is an important problem in several applications such as speech and music processing. In this paper, we develop an approximate estimation algorithm of these quantities using Bayesian inference. The inference about the fundamental frequency...... and the model order is based on a probability model which corresponds to a minimum of prior information. From this probability model, we give the exact posterior distributions on the fundamental frequency and the model order, and we also present analytical approximations of these distributions which lower...
Approximate Controllability of Fractional Integrodifferential Evolution Equations
Directory of Open Access Journals (Sweden)
R. Ganesh
2013-01-01
Full Text Available This paper addresses the issue of approximate controllability for a class of control system which is represented by nonlinear fractional integrodifferential equations with nonlocal conditions. By using semigroup theory, p-mean continuity and fractional calculations, a set of sufficient conditions, are formulated and proved for the nonlinear fractional control systems. More precisely, the results are established under the assumption that the corresponding linear system is approximately controllable and functions satisfy non-Lipschitz conditions. The results generalize and improve some known results.
Excluded-Volume Approximation for Supernova Matter
Yudin, A V
2014-01-01
A general scheme of the excluded-volume approximation as applied to multicomponent systems with an arbitrary degree of degeneracy has been developed. This scheme also admits an allowance for additional interactions between the components of a system. A specific form of the excluded-volume approximation for investigating supernova matter at subnuclear densities has been found from comparison with the hard-sphere model. The possibility of describing the phase transition to uniform nuclear matter in terms of the formalism under consideration is discussed.
Generalized companion matrix for approximate GCD
Boito, Paola
2011-01-01
We study a variant of the univariate approximate GCD problem, where the coe?- cients of one polynomial f(x)are known exactly, whereas the coe?cients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]=(f). In particular, the structure of the null space of the multiplication matrix contains all the essential information about GCD(f; g). Moreover, the multiplication matrix exhibits a displacement structure that allows us to design a fast algorithm for approximate GCD computation with quadratic complexity w.r.t. polynomial degrees.
An approximate analytical approach to resampling averages
DEFF Research Database (Denmark)
Malzahn, Dorthe; Opper, M.
2004-01-01
Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach for appr......Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach...
Static correlation beyond the random phase approximation
DEFF Research Database (Denmark)
Olsen, Thomas; Thygesen, Kristian Sommer
2014-01-01
We investigate various approximations to the correlation energy of a H2 molecule in the dissociation limit, where the ground state is poorly described by a single Slater determinant. The correlation energies are derived from the density response function and it is shown that response functions...... derived from Hedin's equations (Random Phase Approximation (RPA), Time-dependent Hartree-Fock (TDHF), Bethe-Salpeter equation (BSE), and Time-Dependent GW) all reproduce the correct dissociation limit. We also show that the BSE improves the correlation energies obtained within RPA and TDHF significantly...
Approximate formulas for moderately small eikonal amplitudes
Kisselev, A. V.
2016-08-01
We consider the eikonal approximation for moderately small scattering amplitudes. To find numerical estimates of these approximations, we derive formulas that contain no Bessel functions and consequently no rapidly oscillating integrands. To obtain these formulas, we study improper integrals of the first kind containing products of the Bessel functions J0(z). We generalize the expression with four functions J0(z) and also find expressions for the integrals with the product of five and six Bessel functions. We generalize a known formula for the improper integral with two functions Jυ (az) to the case with noninteger υ and complex a.
Approximating W projection as a separable kernel
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.
BEST APPROXIMATION BY DOWNWARD SETS WITH APPLICATIONS
Institute of Scientific and Technical Information of China (English)
H.Mohebi; A. M. Rubinov
2006-01-01
We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs (W,x), where x ∈ X and W is a closed downward subset of X.
Local density approximations from finite systems
Entwistle, Mike; Wetherell, Jack; Longstaff, Bradley; Ramsden, James; Godby, Rex
2016-01-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 slab-like 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.
Song, Feifei; Chen, Chen; Wu, Songqing; Shao, Ensi; Li, Mengnan; Guan, Xiong; Huang, Zhipeng
2016-03-30
Vip proteins, a new group of insecticidal toxins produced by Bacillus thuringiensis, are effective against specific pests including Spodoptera litura. Here, we report construction of a transcriptome database of S. litura by de novo assembly along with detection of the transcriptional response of S. litura larvae to Vip3Aa toxin. In total, 56,498 unigenes with an N50 value of 1,853 bp were obtained. Results of transcriptome abundance showed that Vip3Aa toxin provoked a wide transcriptional response of the S. litura midgut. The differentially expressed genes were enriched for immunity-related, metabolic-related and Bt-related genes. Twenty-nine immunity-related genes, 102 metabolic-related genes and 62 Bt-related genes with differential expression were found. On the basis of transcriptional profiling analysis, we focus on the functional validation of trypsin which potentially participated in the activation of Vip3Aa protoxin. Zymogram analysis indicated that the presence of many proteases, including trypsin, in S. litura larvae midgut. Results of enzymolysis in vitro of Vip3Aa by trypsin, and bioassay and histopathology of the trypsin-digested Vip3Aa toxin showed that trypsin was possibly involved in the Vip3Aa activation. This study provides a transcriptome foundation for the identification and functional validation of the differentially expressed genes in an agricultural important pest, S. litura.
Gueutin, Victor; Langlois, Anne-Lyse; Shehwaro, Nathalie; Elharraqui, Ryme; Rouvier, Philippe; Izzedine, Hassane
2013-01-01
Nonhematologic malignancies are rarely reported to be associated with AA amyloidosis. Although the association between renal cell carcinoma and systemic AA amyloidosis has been established, the evidence linking pulmonary cancer to AA amyloidosis is scarce. Here, a case of biopsy-proven renal AA amyloidosis complicated with nephrotic syndrome associated with lung carcinoma is reported.
Directory of Open Access Journals (Sweden)
Victor Gueutin
2013-01-01
Full Text Available Nonhematologic malignancies are rarely reported to be associated with AA amyloidosis. Although the association between renal cell carcinoma and systemic AA amyloidosis has been established, the evidence linking pulmonary cancer to AA amyloidosis is scarce. Here, a case of biopsy-proven renal AA amyloidosis complicated with nephrotic syndrome associated with lung carcinoma is reported.
NCBI nr-aa BLAST: CBRC-AGAM-07-0022 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-AGAM-07-0022 ref|ZP_01789747.1| hypothetical protein CGSHiAA_08330 [Haemophilus influenza...e PittAA] gb|EDK08473.1| hypothetical protein CGSHiAA_08330 [Haemophilus influenzae PittAA] ZP_01789747.1 2e-14 23% ...
NCBI nr-aa BLAST: CBRC-ACAR-01-0367 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-ACAR-01-0367 ref|ZP_01790024.1| hypothetical protein CGSHiAA_05974 [Haemophilus influenza...e PittAA] gb|EDK08288.1| hypothetical protein CGSHiAA_05974 [Haemophilus influenzae PittAA] ZP_01790024.1 4.0 29% ...
NCBI nr-aa BLAST: CBRC-GGAL-35-0091 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-GGAL-35-0091 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 2e-08 34% ...
NCBI nr-aa BLAST: CBRC-RNOR-15-0027 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-RNOR-15-0027 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 2e-30 98% ...
NCBI nr-aa BLAST: CBRC-HSAP-02-0029 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-HSAP-02-0029 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 5e-11 48% ...
NCBI nr-aa BLAST: CBRC-RNOR-08-0315 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-RNOR-08-0315 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 8e-25 73% ...
NCBI nr-aa BLAST: CBRC-HSAP-02-0031 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-HSAP-02-0031 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 6e-09 52% ...
NCBI nr-aa BLAST: CBRC-OLAT-13-0071 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-OLAT-13-0071 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 0.14 37% ...
NCBI nr-aa BLAST: CBRC-PTRO-02-0026 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-PTRO-02-0026 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 8e-09 50% ...
NCBI nr-aa BLAST: CBRC-PTRO-27-0055 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-PTRO-27-0055 ref|ZP_01791635.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenza...e PittAA] gb|EDK06802.1| hypothetical protein CGSHiAA_09967 [Haemophilus influenzae PittAA] ZP_01791635.1 8e-09 53% ...
A novel Cry9Aa with increased toxicity for Spodoptera exigua (Hübner)
Naimov, S.; Nedyalkova, R.; Staykov, N.; Weemen-Hendriks, M.; Minkov, I.; Maagd, de R.A.
2014-01-01
Cry9Aa, produced by Bacillus thuringiensis is reported to be not active against Spodoptera exigua (beet armyworm). In this study we have cloned a new cry9Aa5 gene encoding a protoxin with increased activity against S. exigua as compared to Cry9Aa1. When aligned to Cry9Aa1, four amino acid substituti
Hayakawa, Tohru; Howlader, Mohammad Tofazzal Hossain; Yamagiwa, Masashi; Sakai, Hiroshi
2008-10-01
Cry4Aa produced by Bacillus thuringiensis is a dipteran-specific toxin and is, therefore, of great interest for developing a bioinsecticide to control mosquitoes. However, the expression of Cry4Aa in Escherichia coli is relatively low, which is a major disadvantage in its development as a bioinsecticide. In this study, to establish an effective production system, a 1,914-bp modified gene (cry4Aa-S1) encoding Cry4Aa was designed and synthesized in accordance with the G + C content and codon preference of E. coli genes without altering the encoded amino acid sequence. The cry4Aa-S1 gene allowed a significant improvement in expression level, over five-fold, compared to that of the original cry4Aa gene. The product of the cry4Aa-S1 gene showed the same level of insecticidal activity against Culex pipiens larvae as that from cry4Aa. This suggested that unfavorable codon usage was one of the reasons for poor expression of cry4Aa in E. coli, and, therefore, changing the cry4Aa codons to accord with the codon usage in E. coli led to efficient production of Cry4Aa. Efficient production of Cry4Aa in E. coli can be a powerful measure to prepare a sufficient amount of Cry4Aa protein for both basic analytical and applied researches.
AA, shims and washers on quadrupole ends
CERN PhotoLab
1981-01-01
Due to the fact that much of the field of the quadrupoles was outside the iron (in particular with the wide quadrupoles) and that thus the fields of quadrupoles and bending magnets interacted, the lattice properties of the AA could not be predicted with the required accuracy. After a first running period in 1980, during which detailed measurements were made with proton test beams, corrections to the quadrupoles were made in 1981, in the form of laminated shims at the ends of the poles, and with steel washers. With the latter ones, further refinements were made in an iterative procedure with measurements on the circulating beam. This eventually resulted, amongst other things, in a very low chromaticity, with the Q-values being constant to within +- 0.001 over the total momentum range of 6 %. Here we see the shims and washers on a narrow qudrupole (QFN, QDN). See also 8103203, 8103204, 8103205, 8103206.
Chen, Yongli; Gao, Dan; Bai, Hangrui; Liu, Hongxia; Lin, Shuo; Jiang, Yuyang
2016-07-01
Application of matrix-assisted laser-desorption/ionization mass spectrometry (MALDI MS) to analyze small molecules have some limitations, due to the inhomogeneous analyte/matrix co-crystallization and interference of matrix-related peaks in low m/z region. In this work, carbon dots (CDs) were for the first time applied as a binary matrix with 9-Aminoacridine (9AA) in MALDI MS for small molecules analysis. By 9AA/CDs assisted desorption/ionization (D/I) process, a wide range of small molecules, including nucleosides, amino acids, oligosaccharides, peptides, and anticancer drugs with a higher sensitivity were demonstrated in the positive ion mode. A detection limit down to 5 fmol was achieved for cytidine. 9AA/CDs matrix also exhibited excellent reproducibility compared with 9AA matrix. Moreover, by exploring the ionization mechanism of the matrix, the influence factors might be attributed to the four parts: (1) the strong UV absorption of 9AA/CDs due to their π-conjugated network; (2) the carboxyl groups modified on the CDs surface act as protonation sites for proton transfer in positive ion mode; (3) the thin layer crystal of 9AA/CDs could reach a high surface temperature more easily and lower transfer energy for LDI MS; (4) CDs could serve as a matrix additive to suppress 9AA ionization. Furthermore, this matrix was allowed for the analysis of glucose as well as nucleosides in human urine, and the level of cytidine was quantified with a linear range of 0.05-5 mM (R(2) > 0.99). Therefore, the 9AA/CDs matrix was proven to be an effective MALDI matrix for the analysis of small molecules with improved sensitivity and reproducibility. This work provides an alternative solution for small molecules detection that can be further used in complex samples analysis. Graphical Abstract ᅟ.
Chen, Yongli; Gao, Dan; Bai, Hangrui; Liu, Hongxia; Lin, Shuo; Jiang, Yuyang
2016-07-01
Application of matrix-assisted laser-desorption/ionization mass spectrometry (MALDI MS) to analyze small molecules have some limitations, due to the inhomogeneous analyte/matrix co-crystallization and interference of matrix-related peaks in low m/z region. In this work, carbon dots (CDs) were for the first time applied as a binary matrix with 9-Aminoacridine (9AA) in MALDI MS for small molecules analysis. By 9AA/CDs assisted desorption/ionization (D/I) process, a wide range of small molecules, including nucleosides, amino acids, oligosaccharides, peptides, and anticancer drugs with a higher sensitivity were demonstrated in the positive ion mode. A detection limit down to 5 fmol was achieved for cytidine. 9AA/CDs matrix also exhibited excellent reproducibility compared with 9AA matrix. Moreover, by exploring the ionization mechanism of the matrix, the influence factors might be attributed to the four parts: (1) the strong UV absorption of 9AA/CDs due to their π-conjugated network; (2) the carboxyl groups modified on the CDs surface act as protonation sites for proton transfer in positive ion mode; (3) the thin layer crystal of 9AA/CDs could reach a high surface temperature more easily and lower transfer energy for LDI MS; (4) CDs could serve as a matrix additive to suppress 9AA ionization. Furthermore, this matrix was allowed for the analysis of glucose as well as nucleosides in human urine, and the level of cytidine was quantified with a linear range of 0.05-5 mM (R2 > 0.99). Therefore, the 9AA/CDs matrix was proven to be an effective MALDI matrix for the analysis of small molecules with improved sensitivity and reproducibility. This work provides an alternative solution for small molecules detection that can be further used in complex samples analysis.
Bergamasco, V B; Mendes, D R P; Fernandes, O A; Desidério, J A; Lemos, M V F
2013-02-01
The polyphagous pests belonging to the genus Spodoptera are considered to be among the most important causes of damage and are widely distributed throughout the Americas'. Due to the extensive use of genetically modified plants containing Bacillus thuringiensis genes that code for insecticidal proteins, resistant insects may arise. To prevent the development of resistance, pyramided plants, which express multiple insecticidal proteins that act through distinct mode of actions, can be used. This study analyzed the mechanisms of action for the proteins Cry1Ia10 and Vip3Aa on neonatal Spodoptera frugiperda, Spodoptera albula, Spodoptera eridania and Spodoptera cosmioides larvae. The interactions of these toxins with receptors on the intestinal epithelial membrane were also analyzed by binding biotinylated toxins to brush border membrane vesicles (BBMVs) from the intestines of these insects. A putative receptor of approximately 65 kDa was found by ligand blotting in all of these species. In vitro competition assays using biotinylated proteins have indicated that Vip3Aa and Cry1Ia10 do not compete for the same receptor for S. frugiperda, S. albula and S. cosmioides and that Vip3Aa was more efficient than Cry1Ia10 when tested individually, by bioassays. A synergistic effect of the toxins in S. frugiperda, S. albula and S. cosmioides was observed when they were combined. However, in S. eridania, Cry1Ia10 and Vip3Aa might compete for the same receptor and through bioassays Cry1Ia10 was more efficient than Vip3Aa and showed an antagonistic effect when the proteins were combined. These results suggest that using these genes to develop pyramided plants may not prove effective in preventing the development of resistance in S. eridiana.
Bharadwaj, Rajnish; Cimino, Patrick J; Flanagan, Margaret E; Latimer, Caitlin S; Gonzalez-Cuyar, Luis F; Juric-Sekhar, Gordana; Montine, Thomas J; Marshall, Desiree A; Keene, C Dirk
2017-08-16
In response to concerns regarding resource expenditures required to fully implement the 2012 NIA-AA Sponsored Guidelines for the neuropathologic assessment of Alzheimer's disease (AD), we previously developed a sensitive and cost-reducing Condensed Protocol (CP) at the University of Washington (UW) Alzheimer's Disease Research Center (ADRC) that consolidated the recommended NIA-AA protocol into fewer cassettes requiring fewer immunohistochemical stains. The CP was not designed to replace NIA-AA protocols, but instead to make the NIA-AA criteria accessible to clinical and forensic neuropathology practices where resources limit full implementation of NIA-AA guidelines. In this regard, we developed practical criteria to instigate CP sampling and immunostaining, and applied these criteria in an academic clinical neuropathological practice. Over the course of one year, 73 cases were sampled using the CP; of those, 53 (72.6%) contained histologic features that prompted CP workup. We found that the CP resulted in increased identification of AD and Lewy body disease neuropathologic changes from what was expected using a clinical history-driven workup alone, while saving approximately $900 per case. This study demonstrates the feasibility and cost-savings of the CP applied to a clinical autopsy practice, and highlights potentially unrecognized neurodegenerative disease processes in the general aging community. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.
Pablo, Herbert; Moffat, Anthony F J; Corcoran, Michael; Shenar, Tomer; Benvenuto, Omar; Fuller, Jim; Naze, Yael; Hoffman, Jennifer L; Miroshnichenko, Anatoly; Apellaniz, Jesus Maiz; Evans, Nancy; Eversberg, Thomas; Gayley, Ken; Gull, Ted; Hamaguch, Kenji; Hamann, Wolf-Rainer; Henrichs, Huib; Hole, Tabetha; Ignace, Richard; Iping, Rosina; Lauer, Jennifer; Leutenegger, Maurice; Lomax, Jamie; Nichols, Joy; Oskinova, Lida; Owocki, Stan; Pollock, Andy; Russell, Christopher M P; Waldron, Wayne; Buil, Christian; Garrel, Thierry; Graham, Keith; Heathcote, Bernard; Lemoult, Thierry; Li, Dong; Mauclaire, Benjamin; Potter, Mike; Ribeiro, Jose; Matthews, Jaymie; Cameron, Chris; Guenther, David; Kuschnig, Rainer; Rowe, Jason; Rucinski, Slavek; Sasselov, Dimitar; Weiss, Werner
2015-01-01
We report on both high-precision photometry from the MOST space telescope and ground-based spectroscopy of the triple system delta Ori A consisting of a binary O9.5II+early-B (Aa1 and Aa2) with P = 5.7d, and a more distant tertiary (O9 IV P > 400 yrs). This data was collected in concert with X-ray spectroscopy from the Chandra X-ray Observatory. Thanks to continuous coverage for 3 weeks, the MOST light curve reveals clear eclipses between Aa1 and Aa2 for the ?first time in non-phased data. From the spectroscopy we have a well constrained radial velocity curve of Aa1. While we are unable to recover radial velocity variations of the secondary star, we are able to constrain several fundamental parameters of this system and determine an approximate mass of the primary using apsidal motion. We also detected second order modulations at 12 separate frequencies with spacings indicative of tidally influenced oscillations. These spacings have never been seen in a massive binary, making this system one of only a handful...
The A&A Experience With Impact Factors
Sandqvist, A
2004-01-01
There is a widespread impression that the scientific journal "Astronomy & Astrophysics" (A&A) has a smaller impact, as measured by citations to articles, than some of the other major astronomy journals. This impression was apparently supported - and probably created - by the Journal Citation Report (JCR), which is prepared annually by the Institute of Scientific Information (ISI) Web of Knowledge. The published poor impact factor of A&A was in fact wrong and was due to a serious flaw in the method used by ISI Web of Knowledge to determine it. The resulting damage inflicted upon A&A by the JCR is incalculable.
Corrosion issues of powder coated AA6060 aluminium profiles
DEFF Research Database (Denmark)
Din, Rameez Ud; Valgarðsson, Smári; Jellesen, Morten Stendahl
2015-01-01
In this study detailed microstructural investigation of the reason for unexpected corrosion of powder coated aluminium alloy AA6060 windows profiles has been performed. The results from this study reveals that the failure of the window profiles was originated from the surface defects present...... on the extruded AA6060 aluminium profile after metallurgical process prior to powder coating. Surface defects are produced due to intermetallic particles in the alloy, which disturb the flow during the extrusion process. The corrosion mechanism leading to the failure of the powder coated AA6060 aluminium profiles...
Effect of pressurized steam on AA1050 aluminium
DEFF Research Database (Denmark)
Jariyaboon, Manthana; Møller, Per; Ambat, Rajan
2012-01-01
Purpose - The purpose of this paper is to understand the effect of pressurized steam on surface changes, structures of intermetallic particles and corrosion behavior of AA1050 aluminium. Design/methodology/approach - Industrially pure aluminium (AA1050, 99.5 per cent) surfaces were exposed...... reactivities was observed due to the formation of the compact oxide layer. Originality/value - This paper reveals a detailed investigation of how pressurized steam can affect the corrosion behaviour of AA1050 aluminium and the structure of Fe-containing intermetallic particles....
Rational approximations and quantum algorithms with postselection
Mahadev, U.; de Wolf, R.
2015-01-01
We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We gi
Kravchuk functions for the finite oscillator approximation
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.
Optical bistability without the rotating wave approximation
Energy Technology Data Exchange (ETDEWEB)
Sharaby, Yasser A., E-mail: Yasser_Sharaby@hotmail.co [Physics Department, Faculty of Applied Sciences, Suez Canal University, Suez (Egypt); Joshi, Amitabh, E-mail: ajoshi@eiu.ed [Department of Physics, Eastern Illinois University, Charleston, IL 61920 (United States); Hassan, Shoukry S., E-mail: Shoukryhassan@hotmail.co [Mathematics Department, College of Science, University of Bahrain, P.O. Box 32038 (Bahrain)
2010-04-26
Optical bistability for two-level atomic system in a ring cavity is investigated outside the rotating wave approximation (RWA) using non-autonomous Maxwell-Bloch equations with Fourier decomposition up to first harmonic. The first harmonic output field component exhibits reversed or closed loop bistability simultaneously with the usual (anti-clockwise) bistability in the fundamental field component.
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
Crutchfield, Christopher; Fineman, Jeremy T; Karger, David R; Scott, Jacob
2008-01-01
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes the expected makespan, which is the expected time at which all jobs complete. Lin and Rajaraman gave the first approximations for this NP-hard problem for the special cases of independent jobs, precedence constraints forming disjoint chains, and precedence constraints forming trees. In this paper, we present asymptotically better approximation algorithms. In particular, we give an O(loglog min(m,n))-approximation for indep...
Markov operators, positive semigroups and approximation processes
Altomare, Francesco; Leonessa, Vita; Rasa, Ioan
2015-01-01
In recent years several investigations have been devoted to the study of large classes of (mainly degenerate) initial-boundary value evolution problems in connection with the possibility to obtain a constructive approximation of the associated positive C_0-semigroups. In this research monograph we present the main lines of a theory which finds its root in the above-mentioned research field.
Image Compression Via a Fast DCT Approximation
Bayer, F. M.; Cintra, R. J.
2010-01-01
Discrete transforms play an important role in digital signal processing. In particular, due to its transform domain energy compaction properties, the discrete cosine transform (DCT) is pivotal in many image processing problems. This paper introduces a numerical approximation method for the DCT based
Approximation algorithms for planning and control
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.
Large hierarchies from approximate R symmetries
Energy Technology Data Exchange (ETDEWEB)
Kappl, Rolf; Ratz, Michael [Technische Univ. Muenchen, Garching (Germany). Physik Dept. T30; Nilles, Hans Peter [Bonn Univ. (Germany). Bethe Zentrum fuer Theoretische Physik und Physikalisches Inst.; Ramos-Sanchez, Saul; Schmidt-Hoberg, Kai [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Vaudrevange, Patrick K.S. [Ludwig-Maximilians-Univ. Muenchen (Germany). Arnold Sommerfeld Zentrum fuer Theoretische Physik
2008-12-15
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. (orig.)
Strong washout approximation to resonant leptogenesis
Energy Technology Data Exchange (ETDEWEB)
Garbrecht, Bjoern; Gautier, Florian; Klaric, Juraj [Physik Department T70, James-Franck-Strasse, Techniche Universitaet Muenchen, 85748 Garching (Germany)
2016-07-01
We study resonant Leptogenesis with two sterile neutrinos with masses M{sub 1} and M{sub 2}, Yukawa couplings Y{sub 1} and Y{sub 2}, and a single active flavor. Specifically, we focus on the strong washout regime, where the decay width dominates the mass splitting of the two sterile neutrinos. We show that one can approximate the effective decay asymmetry by it's late time limit ε = X sin(2 φ)/(X{sup 2}+sin{sup 2}φ), where X=8 π Δ/(vertical stroke Y{sub 1} vertical stroke {sup 2}+ vertical stroke Y{sub 2} vertical stroke {sup 2}), Δ=4(M{sub 1}-M{sub 2})/(M{sub 1}+M{sub 2}), and φ=arg(Y{sub 2}/Y{sub 1}), and establish criteria for the validity of this approximation. We compare the approximate results with numerical ones, obtained by solving the mixing and oscillations of the sterile neutrinos. We generalize the formula to the case of several active flavors, and demonstrate how it can be used to calculate the lepton asymmetry in phenomenological scenarios which are in agreement with the neutrino oscillation data. We find that that using the late time limit is an applicable approximation throughout the phenomenologically viable parameter space.
Lower Bound Approximation for Elastic Buckling Loads
Vrouwenvelder, A.; Witteveen, J.
1975-01-01
An approximate method for the elastic buckling analysis of two-dimensional frames is introduced. The method can conveniently be explained with reference to a physical interpretation: In the frame every member is replaced by two new members: - a flexural member without extensional rigidity to transmi
Approximate Equilibrium Problems and Fixed Points
Directory of Open Access Journals (Sweden)
H. Mazaheri
2013-01-01
Full Text Available We find a common element of the set of fixed points of a map and the set of solutions of an approximate equilibrium problem in a Hilbert space. Then, we show that one of the sequences weakly converges. Also we obtain some theorems about equilibrium problems and fixed points.
Approximations in diagnosis: motivations and techniques
Harmelen, van F.A.H.; Teije, A. ten
1995-01-01
We argue that diagnosis should not be seen as solving a problem with a unique definition, but rather that there exists a whole space of reasonable notions of diagnosis. These notions can be seen as mutual approximations. We present a number of reasons for choosing among different notions of diagnos
Eignets for function approximation on manifolds
Mhaskar, H N
2009-01-01
Let $\\XX$ be a compact, smooth, connected, Riemannian manifold without boundary, $G:\\XX\\times\\XX\\to \\RR$ be a kernel. Analogous to a radial basis function network, an eignet is an expression of the form $\\sum_{j=1}^M a_jG(\\circ,y_j)$, where $a_j\\in\\RR$, $y_j\\in\\XX$, $1\\le j\\le M$. We describe a deterministic, universal algorithm for constructing an eignet for approximating functions in $L^p(\\mu;\\XX)$ for a general class of measures $\\mu$ and kernels $G$. Our algorithm yields linear operators. Using the minimal separation amongst the centers $y_j$ as the cost of approximation, we give modulus of smoothness estimates for the degree of approximation by our eignets, and show by means of a converse theorem that these are the best possible for every \\emph{individual function}. We also give estimates on the coefficients $a_j$ in terms of the norm of the eignet. Finally, we demonstrate that if any sequence of eignets satisfies the optimal estimates for the degree of approximation of a smooth function, measured in ter...
Approximations in diagnosis: motivations and techniques
Harmelen, van F.A.H.; Teije, A. ten
1995-01-01
We argue that diagnosis should not be seen as solving a problem with a unique definition, but rather that there exists a whole space of reasonable notions of diagnosis. These notions can be seen as mutual approximations. We present a number of reasons for choosing among different notions of
Empirical progress and nomic truth approximation revisited
Kuipers, Theodorus
2014-01-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
Faddeev Random Phase Approximation applied to molecules
Degroote, Matthias
2012-01-01
This Ph.D. thesis derives the equations of the Faddeev Random Phase Approximation (FRPA) and applies the method to a set of small atoms and molecules. The occurence of RPA instabilities in the dissociation limit is addressed in molecules and by the study of the Hubbard molecule as a test system with reduced dimensionality.
Auction analysis by normal form game approximation
Kaisers, Michael; Tuyls, Karl; Thuijsman, Frank; Parsons, Simon
2008-01-01
Auctions are pervasive in todaypsilas society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by introducing a methodology to approximate heuristic payoff tables by normal form games. An example from the auction domain
Fostering Formal Commutativity Knowledge with Approximate Arithmetic.
Directory of Open Access Journals (Sweden)
Sonja Maria Hansen
Full Text Available 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.
Approximate fixed point of Reich operator
Directory of Open Access Journals (Sweden)
M. Saha
2013-01-01
Full Text Available In the present paper, we study the existence of approximate fixed pointfor Reich operator together with the property that the ε-fixed points are concentrated in a set with the diameter tends to zero if ε $to$ > 0.
Approximation of Aggregate Losses Using Simulation
Directory of Open Access Journals (Sweden)
Mohamed A. Mohamed
2010-01-01
Full Text Available Problem statement: The modeling of aggregate losses is one of the main objectives in actuarial theory and practice, especially in the process of making important business decisions regarding various aspects of insurance contracts. The aggregate losses over a fixed time period is often modeled by mixing the distributions of loss frequency and severity, whereby the distribution resulted from this approach is called a compound distribution. However, in many cases, realistic probability distributions for loss frequency and severity cannot be combined mathematically to derive the compound distribution of aggregate losses. Approach: This study aimed to approximate the aggregate loss distribution using simulation approach. In particular, the approximation of aggregate losses was based on a compound Poisson-Pareto distribution. The effects of deductible and policy limit on the individual loss as well as the aggregate losses were also investigated. Results: Based on the results, the approximation of compound Poisson-Pareto distribution via simulation approach agreed with the theoretical mean and variance of each of the loss frequency, loss severity and aggregate losses. Conclusion: This study approximated the compound distribution of aggregate losses using simulation approach. The investigation on retained losses and insurance claims allowed an insured or a company to select an insurance contract that fulfills its requirement. In particular, if a company wants to have an additional risk reduction, it can compare alternative policies by considering the worthiness of the additional expected total cost which can be estimated via simulation approach.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-11-30
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Approximations in the PE-method
DEFF Research Database (Denmark)
Arranz, Marta Galindo
1996-01-01
Two differenct sources of errors may occur in the implementation of the PE methods; a phase error introduced in the approximation of a pseudo-differential operator and an amplitude error generated from the starting field. First, the inherent phase errors introduced in the solution are analyzed...
Approximating the DGP of China's Quarterly GDP
Ph.H.B.F. Franses (Philip Hans); H. Mees (Heleen)
2010-01-01
textabstractWe demonstrate that the data generating process (DGP) of China’s cumulated quarterly Gross Domestic Product (GDP, current prices), as it is reported by the National Bureau of Statistics of China, can be (very closely) approximated by a simple rule. This rule is that annual growth in any
OPTICAL QUANTIFICATION OF APPROXIMAL CARIES INVITRO
VANDERIJKE, JW; HERKSTROTER, FM; TENBOSCH, JJ
1991-01-01
A fluorescent dye was applied to extracted premolars with either early artificial lesions or natural white-spot lesions. The teeth were placed in an approximal geometry, and with a specially designed fibre-optic probe the fluorescence of the dye was measured in the lesions. The same fibre-optic
Approximation Algorithms for Model-Based Diagnosis
Feldman, A.B.
2010-01-01
Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components (diagnoses) that explain the observed behavior, according to some minimality criterion. This thesis presents greedy approximation a
An Approximation of Ultra-Parabolic Equations
Directory of Open Access Journals (Sweden)
Allaberen Ashyralyev
2012-01-01
Full Text Available The first and second order of accuracy difference schemes for the approximate solution of the initial boundary value problem for ultra-parabolic equations are presented. Stability of these difference schemes is established. Theoretical results are supported by the result of numerical examples.
Approximation Algorithms for Model-Based Diagnosis
Feldman, A.B.
2010-01-01
Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components (diagnoses) that explain the observed behavior, according to some minimality criterion. This thesis presents greedy approximation a
Approximating the DGP of China's Quarterly GDP
Ph.H.B.F. Franses (Philip Hans); H. Mees (Heleen)
2010-01-01
textabstractWe demonstrate that the data generating process (DGP) of China’s cumulated quarterly Gross Domestic Product (GDP, current prices), as it is reported by the National Bureau of Statistics of China, can be (very closely) approximated by a simple rule. This rule is that annual growth in any
$\\Phi$-derivable approximations in gauge theories
Arrizabalaga, A
2003-01-01
We discuss the method of $\\Phi$-derivable approximations in gauge theories. There, two complications arise, namely the violation of Bose symmetry in correlation functions and the gauge dependence. For the latter we argue that the error introduced by the gauge dependent terms is controlled, therefore not invalidating the method.
Approximations of Two-Attribute Utility Functions
1976-09-01
Introduction to Approximation Theory, McGraw-Hill, New York, 1966. Faber, G., Uber die interpolatorische Darstellung stetiger Funktionen, Deutsche...Management Review 14 (1972b) 37-50. Keeney, R. L., A decision analysis with multiple objectives: the Mexico City airport, Bell Journal of Economics
Approximate Furthest Neighbor in High Dimensions
DEFF Research Database (Denmark)
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen
2015-01-01
-dimensional Euclidean space. We build on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk’s approximation factor and reducing the running time by a logarithmic factor. We also present a variation...
Virial expansion coefficients in the harmonic approximation
DEFF Research Database (Denmark)
R. Armstrong, J.; Zinner, Nikolaj Thomas; V. Fedorov, D.
2012-01-01
The virial expansion method is applied within a harmonic approximation to an interacting N-body system of identical fermions. We compute the canonical partition functions for two and three particles to get the two lowest orders in the expansion. The energy spectrum is carefully interpolated...
Nonlinear approximation with dictionaries,.. II: Inverse estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for separated decomposable dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually...
Intrinsic Diophantine approximation on general polynomial surfaces
DEFF Research Database (Denmark)
Tiljeset, Morten Hein
2017-01-01
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously -approximable points on a curve, surface, etc, given as a graph of integer polynomials. We obtain complete answers to these questions for algebraically “nice” manifolds. This generalizes earlier work done...
Turbo Equalization Using Partial Gaussian Approximation
DEFF Research Database (Denmark)
Zhang, Chuanzong; Wang, Zhongyong; Manchón, Carles Navarro
2016-01-01
returned by the equalizer by using a partial Gaussian approximation (PGA). We exploit the specific structure of the ISI channel model to compute the latter messages from the beliefs obtained using a Kalman smoother/equalizer. Doing so leads to a significant complexity reduction compared to the initial PGA...
Subset Selection by Local Convex Approximation
DEFF Research Database (Denmark)
Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik
1999-01-01
least squares criterion. We propose an optimization technique for the posed probelm based on a modified version of the Newton-Raphson iterations, combined with a backward elimination type algorithm. THe Newton-Raphson modification concerns iterative approximations to the non-convex cost function...
Nonlinear approximation with dictionaries. II. Inverse Estimates
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2006-01-01
In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal...
NCBI nr-aa BLAST: CBRC-DYAK-02-0049 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DYAK-02-0049 gb|AAS74384.1| 5-HT1B [Drosophila melanogaster] gb|AAS74386.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74388.1| 5-HT1B [Drosophila melanogaster] gb|AAS74390.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74392.1| 5-HT1B [Drosophila melanogaster] gb|AAS74394.1| 5-HT1B [Drosophila melanog...aster] gb|AAS74395.1| 5-HT1B [Drosophila melanogaster] gb|AAS74396.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74404.1| 5-HT1B [Drosophila melanogaster] gb|AAS74408.1| 5-HT1B [Drosophila mela
NCBI nr-aa BLAST: CBRC-DMEL-04-0001 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DMEL-04-0001 gb|AAS74999.1| 5-HT2 [Drosophila melanogaster] gb|AAS75013.1| 5-HT2 [Drosophila... melanogaster] gb|AAS75024.1| 5-HT2 [Drosophila melanogaster] gb|AAS75026.1| 5-HT2 [Drosophila... melanogaster] gb|AAS75043.1| 5-HT2 [Drosophila melanogaster] gb|AAS75052.1| 5-HT2 [Drosophila melanogaster]... gb|AAS75056.1| 5-HT2 [Drosophila melanogaster] gb|AAS75073.1| 5-HT2 [Drosophila ...melanogaster] gb|AAS75095.1| 5-HT2 [Drosophila melanogaster] AAS74999.1 1e-165 100% ...
NCBI nr-aa BLAST: CBRC-DSIM-04-0001 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DSIM-04-0001 gb|AAS74999.1| 5-HT2 [Drosophila melanogaster] gb|AAS75013.1| 5-HT2 [Drosophila... melanogaster] gb|AAS75024.1| 5-HT2 [Drosophila melanogaster] gb|AAS75026.1| 5-HT2 [Drosophila... melanogaster] gb|AAS75043.1| 5-HT2 [Drosophila melanogaster] gb|AAS75052.1| 5-HT2 [Drosophila melanogaster]... gb|AAS75056.1| 5-HT2 [Drosophila melanogaster] gb|AAS75073.1| 5-HT2 [Drosophila ...melanogaster] gb|AAS75095.1| 5-HT2 [Drosophila melanogaster] AAS74999.1 1e-156 96% ...
NCBI nr-aa BLAST: CBRC-DSIM-02-0056 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DSIM-02-0056 gb|AAS74384.1| 5-HT1B [Drosophila melanogaster] gb|AAS74386.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74388.1| 5-HT1B [Drosophila melanogaster] gb|AAS74390.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74392.1| 5-HT1B [Drosophila melanogaster] gb|AAS74394.1| 5-HT1B [Drosophila melanog...aster] gb|AAS74395.1| 5-HT1B [Drosophila melanogaster] gb|AAS74396.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74404.1| 5-HT1B [Drosophila melanogaster] gb|AAS74408.1| 5-HT1B [Drosophila mela
NCBI nr-aa BLAST: CBRC-DYAK-02-0049 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DYAK-02-0049 gb|AAS74383.1| 5-HT1B [Drosophila melanogaster] gb|AAS74385.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74397.1| 5-HT1B [Drosophila melanogaster] gb|AAS74398.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74401.1| 5-HT1B [Drosophila melanogaster] gb|AAS74414.1| 5-HT1B [Drosophila melanog...aster] gb|AAS74416.1| 5-HT1B [Drosophila melanogaster] gb|AAS74418.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74419.1| 5-HT1B [Drosophila melanogaster] gb|AAS74424.1| 5-HT1B [Drosophila mela
NCBI nr-aa BLAST: CBRC-DMEL-02-0053 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DMEL-02-0053 gb|AAS74380.1| 5-HT1B [Drosophila melanogaster] gb|AAS74382.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74389.1| 5-HT1B [Drosophila melanogaster] gb|AAS74402.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74403.1| 5-HT1B [Drosophila melanogaster] gb|AAS74405.1| 5-HT1B [Drosophila melanog...aster] gb|AAS74406.1| 5-HT1B [Drosophila melanogaster] gb|AAS74411.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74412.1| 5-HT1B [Drosophila melanogaster] gb|AAS74413.1| 5-HT1B [Drosophila mela
NCBI nr-aa BLAST: CBRC-DSIM-02-0057 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DSIM-02-0057 gb|AAS74185.1| 5-HT1A [Drosophila melanogaster] gb|AAS74209.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74210.1| 5-HT1A [Drosophila melanogaster] gb|AAS74211.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74224.1| 5-HT1A [Drosophila melanogaster] gb|AAS74234.1| 5-HT1A [Drosophila melanog...aster] gb|AAS74254.1| 5-HT1A [Drosophila melanogaster] gb|AAS74258.1| 5-HT1A [Drosophila... melanogaster] gb|AAS74262.1| 5-HT1A [Drosophila melanogaster] gb|AAS74278.1| 5-HT1A [Drosophila mela
NCBI nr-aa BLAST: CBRC-DMEL-02-0053 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DMEL-02-0053 gb|AAS74384.1| 5-HT1B [Drosophila melanogaster] gb|AAS74386.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74388.1| 5-HT1B [Drosophila melanogaster] gb|AAS74390.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74392.1| 5-HT1B [Drosophila melanogaster] gb|AAS74394.1| 5-HT1B [Drosophila melanog...aster] gb|AAS74395.1| 5-HT1B [Drosophila melanogaster] gb|AAS74396.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74404.1| 5-HT1B [Drosophila melanogaster] gb|AAS74408.1| 5-HT1B [Drosophila mela
NCBI nr-aa BLAST: CBRC-DSIM-02-0056 [SEVENS
Lifescience Database Archive (English)
Full Text Available CBRC-DSIM-02-0056 gb|AAS74383.1| 5-HT1B [Drosophila melanogaster] gb|AAS74385.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74397.1| 5-HT1B [Drosophila melanogaster] gb|AAS74398.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74401.1| 5-HT1B [Drosophila melanogaster] gb|AAS74414.1| 5-HT1B [Drosophila melanog...aster] gb|AAS74416.1| 5-HT1B [Drosophila melanogaster] gb|AAS74418.1| 5-HT1B [Drosophila... melanogaster] gb|AAS74419.1| 5-HT1B [Drosophila melanogaster] gb|AAS74424.1| 5-HT1B [Drosophila mela
Peel, M. J.; Steuwer, A.; Withers, P. J.; Dickerson, T.; Shi, Q.; Shercliff, H.
2006-07-01
The aim of this study was to explore the so-called processing window, within which good-quality welds can be produced, for the friction stir welding of AA5083 to AA6082. To that end a systematic set of nine instrumented welds were made using rotation speeds of 280, 560, and 840 rpm and traverse speeds of 100, 200, and 300 mm/min with AA5083 on the advancing side and another nine with the materials reversed. For comparison a smaller series of AA5083-AA5083 and AA6082-AA6082 welds were also made. Thermocouple measurements, tool torque, extent of material mixing, and macrostructural observations all indicate that the temperature under the tool is more strongly dependent on the rotation than the traverse speed. It was found that in the current case, the power (energy/s) and heat input (energy/mm) do not correlate simply with the weld temperature. As a result, such metrics may not be suitable for characterizing the conditions under which welds are produced.
Counting independent sets using the Bethe approximation
Energy Technology Data Exchange (ETDEWEB)
Chertkov, Michael [Los Alamos National Laboratory; Chandrasekaran, V [MIT; Gamarmik, D [MIT; Shah, D [MIT; Sin, J [MIT
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.
Hybrid diffusion approximation in highly absorbing media and its effects of source approximation
Institute of Scientific and Technical Information of China (English)
Huijuan Tian; Ying Liu; Lijun Wang; Yuhui Zhang; Lifeng Xiao
2009-01-01
A modified diffusion approximation model called the hybrid diffusion approximation that can be used for highly absorbing media is investigated.The analytic solution of the hybrid diffusion approximation for reflectance in two-source approximation and steady-state case with extrapolated boundary is obtained.The effects of source approximation on the analytic solution are investigated,and it is validated that two-source approximation in highly absorbing media to describe the optical properties of biological tissue is necessary.Monte Carlo simulation of recovering optical parameters from reflectant data is done with the use of this model.The errors of recovering μa and μ's are smaller than 15% for the reduced albedo between 0.77 and 0.5 with the source-detector separation of 0.4-3 ram.
Cusack, Rhodri; Vicente-Grabovetsky, Alejandro; Mitchell, Daniel J; Wild, Conor J; Auer, Tibor; Linke, Annika C; Peelle, Jonathan E
2014-01-01
Recent years have seen neuroimaging data sets becoming richer, with larger cohorts of participants, a greater variety of acquisition techniques, and increasingly complex analyses. These advances have made data analysis pipelines complicated to set up and run (increasing the risk of human error) and time consuming to execute (restricting what analyses are attempted). Here we present an open-source framework, automatic analysis (aa), to address these concerns. Human efficiency is increased by making code modular and reusable, and managing its execution with a processing engine that tracks what has been completed and what needs to be (re)done. Analysis is accelerated by optional parallel processing of independent tasks on cluster or cloud computing resources. A pipeline comprises a series of modules that each perform a specific task. The processing engine keeps track of the data, calculating a map of upstream and downstream dependencies for each module. Existing modules are available for many analysis tasks, such as SPM-based fMRI preprocessing, individual and group level statistics, voxel-based morphometry, tractography, and multi-voxel pattern analyses (MVPA). However, aa also allows for full customization, and encourages efficient management of code: new modules may be written with only a small code overhead. aa has been used by more than 50 researchers in hundreds of neuroimaging studies comprising thousands of subjects. It has been found to be robust, fast, and efficient, for simple-single subject studies up to multimodal pipelines on hundreds of subjects. It is attractive to both novice and experienced users. aa can reduce the amount of time neuroimaging laboratories spend performing analyses and reduce errors, expanding the range of scientific questions it is practical to address.
Directory of Open Access Journals (Sweden)
Rhodri eCusack
2015-01-01
Full Text Available Recent years have seen neuroimaging data becoming richer, with larger cohorts of participants, a greater variety of acquisition techniques, and increasingly complex analyses. These advances have made data analysis pipelines complex to set up and run (increasing the risk of human error and time consuming to execute (restricting what analyses are attempted. Here we present an open-source framework, automatic analysis (aa, to address these concerns. Human efficiency is increased by making code modular and reusable, and managing its execution with a processing engine that tracks what has been completed and what needs to be (redone. Analysis is accelerated by optional parallel processing of independent tasks on cluster or cloud computing resources. A pipeline comprises a series of modules that each perform a specific task. The processing engine keeps track of the data, calculating a map of upstream and downstream dependencies for each module. Existing modules are available for many analysis tasks, such as SPM-based fMRI preprocessing, individual and group level statistics, voxel-based morphometry, tractography, and multi-voxel pattern analyses (MVPA. However, aa also allows for full customization, and encourages efficient management of code: new modules may be written with only a small code overhead. aa has been used by more than 50 researchers in hundreds of neuroimaging studies comprising thousands of subjects. It has been found to be robust, fast and efficient, for simple single subject studies up to multimodal pipelines on hundreds of subjects. It is attractive to both novice and experienced users. aa can reduce the amount of time neuroimaging laboratories spend performing analyses and reduce errors, expanding the range of scientific questions it is practical to address.
Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
De Marchi, Stefano
2011-01-01
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\\it Approximate Fekete Points} (AFP) and the {\\it Discrete Leja Points} (DLP) extracted from suitable {\\it Weakly Admissible Meshes} (WAMs) of the cylinder. From the analysis of the growth of the Lebesgue constants, approximation and cubature errors, we show that the AFP and the DLP extracted from WAM are good points for polynomial approximation and numerical integration of functions defined on the cylinder.
Pollution assessment and heavy metal determination by AAS in ...
African Journals Online (AJOL)
Foisal
by AAS in waste water collected from Kushtia industrial zone in ... because of the treatment cost, unconsciousness and other various causes .... Biological oxygen demand (BOD5) ..... Resources Management in European Agriculture. J. Water ...
Traveltime approximations for inhomogeneous HTI media
Alkhalifah, Tariq Ali
2011-01-01
Traveltimes information is convenient for parameter estimation especially if the medium is described by an anisotropic set of parameters. This is especially true if we could relate traveltimes analytically to these medium parameters, which is generally hard to do in inhomogeneous media. As a result, I develop traveltimes approximations for horizontaly transversely isotropic (HTI) media as simplified and even linear functions of the anisotropic parameters. This is accomplished by perturbing the solution of the HTI eikonal equation with respect to η and the azimuthal symmetry direction (usually used to describe the fracture direction) from a generally inhomogeneous elliptically anisotropic background medium. The resulting approximations can provide accurate analytical description of the traveltime in a homogenous background compared to other published moveout equations out there. These equations will allow us to readily extend the inhomogenous background elliptical anisotropic model to an HTI with a variable, but smoothly varying, η and horizontal symmetry direction values. © 2011 Society of Exploration Geophysicists.
Approximate inverse preconditioners for general sparse matrices
Energy Technology Data Exchange (ETDEWEB)
Chow, E.; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)
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.
Approximate Lesion Localization in Dermoscopy Images
Celebi, M Emre; Schaefer, Gerald; Stoecker, William V; 10.1111/j.1600-0846.2009.00357.x
2010-01-01
Background: Dermoscopy is one of the major imaging modalities used in the diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty and subjectivity of human interpretation, automated analysis of dermoscopy images has become an important research area. Border detection is often the first step in this analysis. Methods: In this article, we present an approximate lesion localization method that serves as a preprocessing step for detecting borders in dermoscopy images. In this method, first the black frame around the image is removed using an iterative algorithm. The approximate location of the lesion is then determined using an ensemble of thresholding algorithms. Results: The method is tested on a set of 428 dermoscopy images. The localization error is quantified by a metric that uses dermatologist determined borders as the ground truth. Conclusion: The results demonstrate that the method presented here achieves both fast and accurate localization of lesions in dermoscopy images.
Performance of a Distributed Stochastic Approximation Algorithm
Bianchi, Pascal; Hachem, Walid
2012-01-01
In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients: the existence of a Lyapunov function for the mean field in the agreement subspace, and a contraction property of the random matrices of weights in the subspace orthogonal to the agreement subspace. A second order analysis of the algorithm is also performed under the form of a Central Limit Theorem. The Polyak-averaged version of the algorithm is also considered.
Approximate gauge symemtry of composite vector bosons
Energy Technology Data Exchange (ETDEWEB)
Suzuki, Mahiko
2010-06-01
It can be shown in a solvable field theory model that the couplings of the composite vector mesons 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 more an 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.
Quasi-chemical approximation for polyatomic mixtures
Dávila, M V; Matoz-Fernandez, D A; Ramirez-Pastor, A J
2016-01-01
The statistical thermodynamics of binary mixtures of polyatomic species was developed on a generalization in the spirit of the lattice-gas model and the quasi-chemical approximation (QCA). The new theoretical framework is obtained by combining: (i) the exact analytical expression for the partition function of non-interacting mixtures of linear $k$-mers and $l$-mers (species occupying $k$ sites and $l$ sites, respectively) adsorbed in one dimension, and its extension to higher dimensions; and (ii) a generalization of the classical QCA for multicomponent adsorbates and multisite-occupancy adsorption. The process is analyzed through the partial adsorption isotherms corresponding to both species of the mixture. Comparisons with analytical data from Bragg-Williams approximation (BWA) and Monte Carlo simulations are performed in order to test the validity of the theoretical model. Even though a good fitting is obtained from BWA, it is found that QCA provides a more accurate description of the phenomenon of adsorpti...
Improved Approximations for Some Polymer Extension Models
Petrosyan, Rafayel
2016-01-01
We propose approximations for force-extension dependencies for the freely jointed chain (FJC) and worm-like chain (WLC) models as well as for extension-force dependence for the WLC model. Proposed expressions show less than 1% relative error in the useful range of the corresponding variables. These results can be applied for fitting force-extension curves obtained in molecular force spectroscopy experiments. Particularly they can be useful for cases where one has geometries of springs in series and/or in parallel where particular combination of expressions should be used for fitting the data. All approximations have been obtained following the same procedure of determining the asymptotes and then reducing the relative error of that expression by adding an appropriate term obtained from fitting its absolute error.
Regularized Laplacian Estimation and Fast Eigenvector Approximation
Perry, Patrick O
2011-01-01
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick \\emph{approximation} to the first nontrivial eigenvector of a data graph Laplacian \\emph{exactly} solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to the manner in which $\\ell_2$-regularized or $\\ell_1$-regularized $\\ell_2$-regression (often called Ridge regression and Lasso regression, respectively) can be interpreted in terms of a Gaussian prior or a Laplace prior, respectively, on the coefficient vector of the regression problem. Our framework will imply that the solutions to the Mahoney-Orecchia regularized SDP can be interpreted as regularized estimates of the pseudoinverse of the graph Laplacian. Conversely, it will imply that the solution to this regularized estimation problem can be computed very quickly by running, e.g., the fast diffusion-base...
On approximative solutions of multistopping problems
Faller, Andreas; 10.1214/10-AAP747
2012-01-01
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed to be independent not to be identically distributed. The basic assumption is convergence of a related imbedded point process to a continuous time Poisson process in the plane, which serves as a limiting model for the stopping problem. The optimal $m$-stopping curves for this limiting model are determined by differential equations of first order. A general approximation result is established which ensures convergence of the finite discrete time $m$-stopping problem to that in the limit model. This allows the construction of approximative solutions of the discrete time $m$-stopping problem. In detail, the case of i.i.d. sequences with discount and observation costs is discussed and explicit results are obtained.
Numerical and approximate solutions for plume rise
Krishnamurthy, Ramesh; Gordon Hall, J.
Numerical and approximate analytical solutions are compared for turbulent plume rise in a crosswind. The numerical solutions were calculated using the plume rise model of Hoult, Fay and Forney (1969, J. Air Pollut. Control Ass.19, 585-590), over a wide range of pertinent parameters. Some wind shear and elevated inversion effects are included. The numerical solutions are seen to agree with the approximate solutions over a fairly wide range of the parameters. For the conditions considered in the study, wind shear effects are seen to be quite small. A limited study was made of the penetration of elevated inversions by plumes. The results indicate the adequacy of a simple criterion proposed by Briggs (1969, AEC Critical Review Series, USAEC Division of Technical Information extension, Oak Ridge, Tennesse).
Approximated solutions to Born-Infeld dynamics
Energy Technology Data Exchange (ETDEWEB)
Ferraro, Rafael [Instituto de Astronomía y Física del Espacio (IAFE, CONICET-UBA),Casilla de Correo 67, Sucursal 28, 1428 Buenos Aires (Argentina); Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina); Nigro, Mauro [Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina)
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.
SOME CONVERSE RESULTS ON ONESIDED APPROXIMATION: JUSTIFICATIONS
Institute of Scientific and Technical Information of China (English)
Wang Jianli; Zhou Songping
2003-01-01
The present paper deals with best onesided approximation rate in Lp spaces ～En (f)Lp of f ∈ C2π. Although it is clear that the estimate ～En(f)Lp≤C ‖f‖ Lp cannot be correct for all f ∈ Lp2π in case p＜∞, the question whether ～En (f)Lp ≤Cω (f, n-1 )Lp or ～En(f)Lp ≤CEn(f)Lp holds for f ∈ C2π remains totally untouched.Therefore it forms a basic problem to justify onesided approximation. The present paper will provide an answer to settle down the basis.
An Origami Approximation to the Cosmic Web
Neyrinck, Mark C
2014-01-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 ...
Improved Approximation for Orienting Mixed Graphs
Gamzu, Iftah
2012-01-01
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path. This problem has recently arisen in the study of biological networks, and it also has applications in communication networks. In this paper, we identify an interesting local-to-global orientation property. This property enables us to modify the best known algorithms for maximum mixed graph orientation and some of its special structured instances, due to Elberfeld et al. (CPM '11), and obtain improved approximation ratios. We further proceed by developing an algorithm that achieves an even better approximation guarantee for the general setting of the problem. Finally, we study several well-motivated variants of this orientation problem.