WorldWideScience

Sample records for recursive formulas generating

  1. Analytic study of the Migdal-Kadanoff recursion formula

    International Nuclear Information System (INIS)

    Ito, K.R.

    1984-01-01

    After proposing lattice gauge field models in which the Migdal renormalization group recursion formulas are exact, we study the recursion formulas analytically. If D is less than 4, it is shown that the effective actions of D-dimensional U(1) lattice gauge models are uniformly driven to the high temperature region no matter how low the initial temperature is. If the initial temperature is large enough, this holds for any D and gauge group G. These are also the cases for the recursion formulas of Kadanoff type. It turns out, however, that the string tension for D=3 obtained by these methods is rather big compared with the one already obtained by Mack, Goepfert and by the present author. The reason is clarified. (orig.)

  2. Multiphonon theory: generalized Wick's theorem and recursion formulas

    International Nuclear Information System (INIS)

    Silvestre-Brac, B.; Piepenbring, R.

    1982-04-01

    Overlaps and matrix elements of one and two-body operators are calculated in a space spanned by multiphonons of different types taking properly the Pauli principle into account. Two methods are developped: a generalized Wick's theorem dealing with new contractions and recursion formulas well suited for numerical applications

  3. Some recursive formulas for Selberg-type integrals

    Energy Technology Data Exchange (ETDEWEB)

    Iguri, Sergio [Instituto de AstronomIa y Fisica del Espacio (CONICET-UBA). C. C. 67, Suc. 28, 1428 Buenos Aires (Argentina); Mansour, Toufik, E-mail: siguri@iafe.uba.a, E-mail: toufik@math.haifa.ac.i [Department of Mathematics, University of Haifa, Haifa 31905 (Israel)

    2010-02-12

    A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previous results in Aomoto (1987) SIAM J. Math. Anal. 18 545-49 and Iguri (2009) Lett. Math. Phys. 89 141-58. These formulas provide a well-defined algorithm for computing Selberg-Schur integrals whenever the Kostka numbers relating Schur functions and the corresponding monomial polynomials are explicitly known. We illustrate the usefulness of our results discussing some interesting examples.

  4. Chiodo formulas for the r-th roots and topological recursion

    OpenAIRE

    Lewanski, Danilo; Popolitov, Alexandr; Shadrin, Sergey; Zvonkine, Dimitri

    2015-01-01

    We analyze Chiodo's formulas for the Chern classes related to the r-th roots of the suitably twisted integer powers of the canonical class on the moduli space of curves. The intersection numbers of these classes with psi-classes are reproduced via the Chekhov-Eynard-Orantin topological recursion. As an application, we prove that the Johnson-Pandharipande-Tseng formula for the orbifold Hurwitz numbers is equivalent to the topological recursion for the orbifold Hurwitz numbers. In particular, t...

  5. Chiodo formulas for the r-th roots and topological recursion

    NARCIS (Netherlands)

    Lewanski, D.; Popolitov, A.; Shadrin, S.; Zvonkine, D.

    We analyze Chiodo’s formulas for the Chern classes related to the r-th roots of the suitably twisted integer powers of the canonical class on the moduli space of curves. The intersection numbers of these classes with ψ-classes are reproduced via the Chekhov–Eynard–Orantin topological recursion. As

  6. A Recursive Formula for the Evaluation of Earth Return Impedance on Buried Cables

    Directory of Open Access Journals (Sweden)

    Reynaldo Iracheta

    2015-09-01

    Full Text Available This paper presents an alternative solution based on infinite series for the accurate and efficient evaluation of cable earth return impedances. This method uses Wedepohl and Wilcox’s transformation to decompose Pollaczek’s integral in a set of Bessel functions and a definite integral. The main feature of Bessel functions is that they are easy to compute in modern mathematical software tools such as Matlab. The main contributions of this paper are the approximation of the definite integral by an infinite series, since it does not have analytical solution; and its numerical solution by means of a recursive formula. The accuracy and efficiency of this recursive formula is compared against the numerical integration method for a broad range of frequencies and cable  configurations. Finally, the proposed method is used as a subroutine for cable parameter calculation in the inverse Numerical Laplace Transform (NLT to obtain accurate transient responses in the time domain.

  7. A new term in the recursive expansion of the inverse Baker-Campbell-Hausdorff formula

    International Nuclear Information System (INIS)

    Riccardi, A.

    1984-01-01

    A recursive algorithm is derived, allowing the expansion in lambda of z=exp(x+lambda y) for noncommuting x and y, written as ordered product of exponentials. Such an expansion is the inverse of the usual Baker-Campbell-Hausdorff formula. The explicit form of the terms, up to third order in lambda is also given. The same method provides the explicit expansion to any order for the matrix elements of z

  8. Recursion Formulae for Obtaining Surfaces with Constant Mean Curvature in R2,1

    International Nuclear Information System (INIS)

    Tian Yongbo; Nan Zhijie; Tian Chou

    2007-01-01

    Though the Baecklund transformation on time-like surfaces with constant mean curvature surfaces in R 2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related integrable system cannot be avoided when the Baecklund transformation is used. For sake of this, in this article, some special work is done to reform the Baecklund transformation to a recursion formula, by which we can construct time-like surfaces with constant mean curvature form known ones just by quadrature procedure.

  9. Recursive formulae and performance comparisons for first mode dynamics of periodic structures

    Science.gov (United States)

    Hobeck, Jared D.; Inman, Daniel J.

    2017-05-01

    Periodic structures are growing in popularity especially in the energy harvesting and metastructures communities. Common types of these unique structures are referred to in the literature as zigzag, orthogonal spiral, fan-folded, and longitudinal zigzag structures. Many of these studies on periodic structures have two competing goals in common: (a) minimizing natural frequency, and (b) minimizing mass or volume. These goals suggest that no single design is best for all applications; therefore, there is a need for design optimization and comparison tools which first require efficient easy-to-implement models. All available structural dynamics models for these types of structures do provide exact analytical solutions; however, they are complex requiring tedious implementation and providing more information than necessary for practical applications making them computationally inefficient. This paper presents experimentally validated recursive models that are able to very accurately and efficiently predict the dynamics of the four most common types of periodic structures. The proposed modeling technique employs a combination of static deflection formulae and Rayleigh’s Quotient to estimate the first mode shape and natural frequency of periodic structures having any number of beams. Also included in this paper are the results of an extensive experimental validation study which show excellent agreement between model prediction and measurement. Lastly, the proposed models are used to evaluate the performance of each type of structure. Results of this performance evaluation reveal key advantages and disadvantages associated with each type of structure.

  10. Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

    International Nuclear Information System (INIS)

    Hernandez-Walls, R; Martín-Atienza, B; Salinas-Matus, M; Castillo, J

    2017-01-01

    When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations. (paper)

  11. Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

    Science.gov (United States)

    Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.

    2017-11-01

    When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.

  12. Evaluation of the Kubo formula for the conductivity using the recursion method

    International Nuclear Information System (INIS)

    Yeyati, A.L.; Weissmann, M.; Anda, E.

    1988-09-01

    We propose a numerical algorithm based on the recursion method to calculate the conductivity of a disordered system described by a tight-binding Hamiltonian. It has the advantage that the density of states and the conductivity can be obtained in a single recursion calculation. The method is applied to simple one and two-dimensional incommensurate systems in order to check the validity of the assumptions made and the numerical efficiency. The calculated conductivity shows a clear drop when the Fermi energy crosses a mobility edge. Potential applications of this work to other systems are discussed. (author). 13 refs, 9 figs

  13. Recursive inter-generational utility in global climate risk modeling

    Energy Technology Data Exchange (ETDEWEB)

    Minh, Ha-Duong [Centre International de Recherche sur l' Environnement et le Developpement (CIRED-CNRS), 75 - Paris (France); Treich, N. [Institut National de Recherches Agronomiques (INRA-LEERNA), 31 - Toulouse (France)

    2003-07-01

    This paper distinguishes relative risk aversion and resistance to inter-temporal substitution in climate risk modeling. Stochastic recursive preferences are introduced in a stylized numeric climate-economy model using preliminary IPCC 1998 scenarios. It shows that higher risk aversion increases the optimal carbon tax. Higher resistance to inter-temporal substitution alone has the same effect as increasing the discount rate, provided that the risk is not too large. We discuss implications of these findings for the debate upon discounting and sustainability under uncertainty. (author)

  14. Generation and importance of linked and irreducible moment diagrams in the recursive residue generation method

    International Nuclear Information System (INIS)

    Schek, I.; Wyatt, R.E.

    1986-01-01

    Molecular multiphoton processes are treated in the Recursive Residue Generation Method (A. Nauts and R.E. Wyatt, Phys. Rev. Lett 51, 2238 (1983)) by converting the molecular-field Hamiltonian matrix into tridiagonal form, using the Lanczos equations. In this study, the self-energies (diagonal) and linking (off-diagaonal) terms in the tridiagonal matrix are obtained by comparing linked moment diagrams in both representations. The dynamics of the source state is introduced and computed in terms of the linked and the irreducible moments

  15. The additive congruential random number generator--A special case of a multiple recursive generator

    Science.gov (United States)

    Wikramaratna, Roy S.

    2008-07-01

    This paper considers an approach to generating uniformly distributed pseudo-random numbers which works well in serial applications but which also appears particularly well-suited for application on parallel processing systems. Additive Congruential Random Number (ACORN) generators are straightforward to implement for arbitrarily large order and modulus; if implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. Previously published theoretical analysis has demonstrated that a kth order ACORN sequence approximates to being uniformly distributed in up to k dimensions, for any given k. ACORN generators can be constructed to give period lengths exceeding any given number (for example, with period length in excess of 230p, for any given p). Results of empirical tests have demonstrated that, if p is greater than or equal to 2, then the ACORN generator can be used successfully for generating double precision uniform random variates. This paper demonstrates that an ACORN generator is a particular case of a multiple recursive generator (and, therefore, also a special case of a matrix generator). Both these latter approaches have been widely studied, and it is to be hoped that the results given in the present paper will lead to greater confidence in using the ACORN generators.

  16. On Recursion

    Directory of Open Access Journals (Sweden)

    Jeffrey eWatumull

    2014-01-01

    Full Text Available It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauser, Chomsky, and Fitch’s (2002 articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language—the faculty of language in the narrow sense (FLN—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or nonexistent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension; definition by induction (i.e., rules strongly generative of structure; and mathematical induction (i.e., rules for the principled—and potentially unbounded—expansion of strongly generated structure. By these necessary and sufficient criteria, the grammars of all natural

  17. On Modified Bar recursion

    DEFF Research Database (Denmark)

    Oliva, Paulo Borges

    2002-01-01

    Modified bar recursion is a variant of Spector's bar recursion which can be used to give a realizability interpretation of the classical axiom of dependent choice. This realizability allows for the extraction of witnesses from proofs of forall-exists-formulas in classical analysis. In this talk I...... shall report on results regarding the relationship between modified and Spector's bar recursion. I shall also show that a seemingly weak form of modified bar recursion is as strong as "full" modified bar recursion in higher types....

  18. A recursive economic dispatch algorithm for assessing the cost of thermal generator schedules

    International Nuclear Information System (INIS)

    Wong, K.P.; Doan, K.

    1992-01-01

    This paper develops an efficient, recursive algorithm for determining the economic power dispatch of thermal generators within the unit commitment environment. A method for incorporating the operation limits of all on-line generators and limits due to ramping generators is developed in the paper. The developed algorithm is amenable for computer implementation using the artificial intelligence programming language, Prolog. The performance of the developed algorithm is demonstrated through its application to evaluate the costs of dispatching 13 thermal generators within a generator schedule in a 24-hour schedule horizon

  19. Symbolic generation of finite difference formulas

    International Nuclear Information System (INIS)

    Keller, H.; Pereyra, V.

    1978-01-01

    Tables of coefficients for high order accurate, compact approximations to the first ten derivatives on and at the midpoints of uniform nets are presented. The exact rational weights are generated and tested by means of symbolic manipulation implemented through MACSYMA. These weights are required in the application of deferred corrections to new methods for solving higher order two point boundary value problems

  20. Recursive analysis

    CERN Document Server

    Goodstein, R L

    2010-01-01

    Recursive analysis develops natural number computations into a framework appropriate for real numbers. This text is based upon primary recursive arithmetic and presents a unique combination of classical analysis and intuitional analysis. Written by a master in the field, it is suitable for graduate students of mathematics and computer science and can be read without a detailed knowledge of recursive arithmetic.Introductory chapters on recursive convergence and recursive and relative continuity are succeeded by explorations of recursive and relative differentiability, the relative integral, and

  1. Some reference formulas for the generating functions of canonical transformations

    Energy Technology Data Exchange (ETDEWEB)

    Anselmi, Damiano [Universita di Pisa, Dipartimento di Fisica ' ' Enrico Fermi' ' , Pisa (Italy); INFN, Sezione di Pisa, Pisa (Italy)

    2016-02-15

    We study some properties of the canonical transformations in classical mechanics and quantum field theory and give a number of practical formulas concerning their generating functions. First, we give a diagrammatic formula for the perturbative expansion of the composition law around the identity map. Then we propose a standard way to express the generating function of a canonical transformation by means of a certain ''componential'' map, which obeys the Baker-Campbell-Hausdorff formula. We derive the diagrammatic interpretation of the componential map, work out its relation with the solution of the Hamilton-Jacobi equation and derive its time-ordered version. Finally, we generalize the results to the Batalin-Vilkovisky formalism, where the conjugate variables may have both bosonic and fermionic statistics, and describe applications to quantum field theory. (orig.)

  2. A formula relating infinitesimal Backlund transformations to hierarchy generating operators

    International Nuclear Information System (INIS)

    Hou, B.Y.; Tu, G.Z.

    1982-12-01

    Let u'=Bsub(eta)u and l be, respectively, the elementary Backlund transformation and hierarchy generating operators for the AKNS equations. It is shown that (dB/d eta)(Bsub(eta)) - 1 =σ 3 /(l-eta). A similar formula relating to the general NxN matrix spectral problem is also derived. (author)

  3. A direct recursive residue generation method: application to photoionization of hydrogen in static electric fields

    International Nuclear Information System (INIS)

    Karlsson, H.O.; Goscinski, O.

    1994-01-01

    In studies of hydrogenic systems via the recursive residue generation method (RRGM) the major bottleneck is the matrix vector product HC, between the Hamiltonian matrix H and a Lanczos vector C. For highly excited states and/or strong perturbations the size of H grows fast leading to storage problems. By making use of direct methods, i.e. avoidance of explicit construction of large Hamiltonian matrices, such problems can be overcome. Utilizing the underlying analytical properties of the Laguerre basis e -λr L k 2l+2 (2λr) a direct RRGM (D-RRGM) for the unperturbed hydrogenic Hamiltonian is derived, changing the storage needs from scaling as N 2 to 4N where N is the number of radial functions for each factorized H o (l,m) block with the possibility of parallel processing. A further computational simplification is introduced by putting the expression for the photoionization (PI) cross section in the rational form conventionally used in the representation of density of states (DOS). This allows the construction of the PI cross section directly from the tridiagonal Lanczos matrix avoiding the explicit calculation of individual eigen values and eigenvectors. (Author)

  4. 几何分布高阶原点矩的递推公式及推论%Recursive Formula and Inference of High - order Origin Moments of Geometric Distribution

    Institute of Scientific and Technical Information of China (English)

    韩建玲

    2012-01-01

    利用幂级数逐项积分性质给出几何分布高阶原点矩的递推公式,并得到推论,使得计算高阶原点矩更为简捷方便.%In this paper, the recursive formula and inference of high -order origin moments of geometric distribution are given by using the nature of power series.

  5. Nonlinear Disturbance Attenuation Controller for Turbo-Generators in Power Systems via Recursive Design

    NARCIS (Netherlands)

    Cao, M.; Shen, T.L.; Song, Y.H.; Mei, S.W.

    2002-01-01

    The paper proposes a nonlinear robust controller for steam governor control in power systems. Based on dissipation theory, an innovative recursive design method is presented to construct the storage function of single machine infinite bus (SMIB) and multi-machine power systems. Furthermore, the

  6. Deformation of the three-term recursion relation and generation of new orthogonal polynomials

    International Nuclear Information System (INIS)

    Alhaidari, A D

    2002-01-01

    We find solutions for a linear deformation of the three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is written in terms of the original one and the deformation parameters

  7. Thinking recursively

    CERN Document Server

    Roberts, Eric S

    1986-01-01

    Concentrating on the practical value of recursion, this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science.

  8. On the Relation between Spector's Bar Recursion and Modified Bar Recursion

    DEFF Research Database (Denmark)

    Oliva, Paulo Borges

    2002-01-01

    We introduce a variant of Spector's Bar Recursion in finite types to give a realizability interpretation of the classical axiom of dependent choice allowing for the extraction of witnesses from proofs of Sigma_1 formulas in classical analysis. We also give a bar recursive definition of the fan...... functional and study the relationship of our variant of Bar Recursion with others....

  9. Hopf algebras and topological recursion

    International Nuclear Information System (INIS)

    Esteves, João N

    2015-01-01

    We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293–309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347–452). (paper)

  10. 1/fα fractal noise generation from Gruenwald-Letnikov formula

    International Nuclear Information System (INIS)

    Rodriguez, Eduardo; Echeverria, Juan Carlos; Alvarez-Ramirez, Jose

    2009-01-01

    This communication presents a recursive algorithm for generating streams of 1/f α fractal noise, by means of fractional integration/differentiation of a white noise signal. The quality of correlated and anticorrelated noise obtained by this approach is evaluated by applying detrended fluctuation analysis.

  11. Geometric recursion

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas

    We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... as Poisson structures on the moduli space of flat connections. The theory has a wider scope than that and one expects that many functorial objects in low-dimensional geometry and topology should have a GR construction. The geometric recursion has various projections to topological recursion (TR) and we...... in particular show it retrieves all previous variants and applications of TR. We also show that, for any initial data for topological recursion, one can construct initial data for GR with values in Frobenius algebra-valued continuous functions on Teichmueller space, such that the ωg,n of TR are obtained...

  12. Generating Models of a Matched Formula with a Polynomial Delay

    Czech Academy of Sciences Publication Activity Database

    Savický, Petr; Kučera, P.

    2016-01-01

    Roč. 56, č. 6 (2016), s. 379-402 ISSN 1076-9757 R&D Projects: GA ČR GBP202/12/G061 Grant - others:GA ČR(CZ) GA15-15511S Institutional support: RVO:67985807 Keywords : conjunctive normal form * matched formula * pure literal satisfiable formula Subject RIV: BA - General Mathematics Impact factor: 2.284, year: 2016

  13. Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

    Directory of Open Access Journals (Sweden)

    Petruska Gyorgy

    2007-01-01

    Full Text Available Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.

  14. Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

    Directory of Open Access Journals (Sweden)

    Gyorgy Petruska

    2007-02-01

    Full Text Available Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.

  15. Recursive generation of Cartesian angular momentum coupling trees for SO(3)

    International Nuclear Information System (INIS)

    Sherborne, B.S.; Stedman, G.E.

    1990-01-01

    Two computer algorithms are evaluated for the reduction of angular momentum coupling trees with vector (j=1) terminals with a Cartesian choice of basis as used in nonlinear optics. Rather than employ advanced tensor algebra, both methods essentially iterate in distinct ways the basic techniques of angular momentum coupling. Turbo Pascal programs implementing these algorithms are presented and compared. The accompanying analysis integrates the Cartesian tensor approach and the diagrammatic approach to the solution of problems in nonlinear optics. The programs generate TeX files for the relevant angular momentum diagrams. (orig.)

  16. Recursive macro generator for the TAS-86 language. First part: the macro generator language. Second part: system internal logics

    International Nuclear Information System (INIS)

    Zraick, Samir

    1970-01-01

    A macro-generator is a translator which is able to interpret and translate a programme written in a macro-language. After a first part presenting the main notions and proposing a brief description of the TAS-86 language, the second part of this research thesis reports the development of the macro-generator language, and notably presents the additional functionalities provided by the macro generator. The development is illustrated by logical flowcharts and programming listings

  17. Recursion Theory Week

    CERN Document Server

    Müller, Gert; Sacks, Gerald

    1990-01-01

    These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.

  18. Classification Formula and Generation Algorithm of Cycle Decomposition Expression for Dihedral Groups

    Directory of Open Access Journals (Sweden)

    Dakun Zhang

    2013-01-01

    Full Text Available The necessary of classification research on common formula of group (dihedral group cycle decomposition expression is illustrated. It includes the reflection and rotation conversion, which derived six common formulae on cycle decomposition expressions of group; it designed the generation algorithm on the cycle decomposition expressions of group, which is based on the method of replacement conversion and the classification formula; algorithm analysis and the results of the process show that the generation algorithm which is based on the classification formula is outperformed by the general algorithm which is based on replacement conversion; it has great significance to solve the enumeration of the necklace combinational scheme, especially the structural problems of combinational scheme, by using group theory and computer.

  19. Recursive smoothers for hidden discrete-time Markov chains

    Directory of Open Access Journals (Sweden)

    Lakhdar Aggoun

    2005-01-01

    Full Text Available We consider a discrete-time Markov chain observed through another Markov chain. The proposed model extends models discussed by Elliott et al. (1995. We propose improved recursive formulae to update smoothed estimates of processes related to the model. These recursive estimates are used to update the parameter of the model via the expectation maximization (EM algorithm.

  20. Moment generating functions and Normalized implied volatilities: unification and extension via Fukasawa's pricing formula

    OpenAIRE

    De Marco, Stefano; Martini, Claude

    2017-01-01

    We extend the model-free formula of [Fukasawa 2012] for $\\mathbb E[\\Psi(X_T)]$, where $X_T=\\log S_T/F$ is the log-price of an asset, to functions $\\Psi$ of exponential growth. The resulting integral representation is written in terms of normalized implied volatilities. Just as Fukasawa's work provides rigourous ground for Chriss and Morokoff's (1999) model-free formula for the log-contract (related to the Variance swap implied variance), we prove an expression for the moment generating functi...

  1. Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion

    Science.gov (United States)

    Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.

    2018-06-01

    A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2 D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.

  2. Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion

    Science.gov (United States)

    Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.

    2017-12-01

    A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.

  3. Cumulant generating function formula of heat transfer in ballistic systems with lead-lead coupling

    Science.gov (United States)

    Li, Huanan; Agarwalla, Bijay Kumar; Wang, Jian-Sheng

    2012-10-01

    Based on a two-time observation protocol, we consider heat transfer in a given time interval tM in a lead-junction-lead system taking coupling between the leads into account. In view of the two-time observation, consistency conditions are carefully verified in our specific family of quantum histories. Furthermore, its implication is briefly explored. Then using the nonequilibrium Green's function method, we obtain an exact formula for the cumulant generating function for heat transfer between the two leads, valid in both transient and steady-state regimes. Also, a compact formula for the cumulant generating function in the long-time limit is derived, for which the Gallavotti-Cohen fluctuation symmetry is explicitly verified. In addition, we briefly discuss Di Ventra's repartitioning trick regarding whether the repartitioning procedure of the total Hamiltonian affects the nonequilibrium steady-state current fluctuation. All kinds of properties of nonequilibrium current fluctuations, such as the fluctuation theorem in different time regimes, could be readily given according to these exact formulas.

  4. The Influence of Allocation Formula on Generation of Profit in Different Economy Sectors

    Directory of Open Access Journals (Sweden)

    Kateřina Krchnivá

    2015-01-01

    Full Text Available The mechanism for the distribution of the Common Consolidated Corporate Tax Base will be based on three macroeconomics factors which are considered to be the main indicators of generated profit/loss. The paper analyzes the explanatory power of proposed allocation formula for the distribution of the Common Consolidated Corporate Tax Base with respect to the sector of economic activity from the perspective of the Czech independent enterprises. The research is based on the comparison of the coefficients of determination indicating the proportion of explained variability of proposed multiple regression models. The paper concludes that the proportion of explained profitability by the allocation formula factors as are defined by the Common Consolidated Corporate Tax Base Draft Directive may differ up to 34% with regard to the sector of economic activity classified by NACE classification.

  5. A New Approach for Proving or Generating Combinatorial Identities

    Science.gov (United States)

    Gonzalez, Luis

    2010-01-01

    A new method for proving, in an immediate way, many combinatorial identities is presented. The method is based on a simple recursive combinatorial formula involving n + 1 arbitrary real parameters. Moreover, this formula enables one not only to prove, but also generate many different combinatorial identities (not being required to know them "a…

  6. Recursion complexity in cognition

    CERN Document Server

    Roeper, Thomas

    2014-01-01

    This volume focuses on recursion, highlighting its central role in modern science. It reveals a host of new theoretical arguments, philosophical perspectives, formal representations and empirical evidence from parsing, acquisition and computer models.

  7. A recursive algorithm for trees and forests

    OpenAIRE

    Guo, Song; Guo, Victor J. W.

    2017-01-01

    Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.

  8. Language and Recursion

    Science.gov (United States)

    Lowenthal, Francis

    2010-11-01

    This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.

  9. CFT and topological recursion

    CERN Document Server

    Kostov, Ivan

    2010-01-01

    We study the quasiclassical expansion associated with a complex curve. In a more specific context this is the 1/N expansion in U(N)-invariant matrix integrals. We compare two approaches, the CFT approach and the topological recursion, and show their equivalence. The CFT approach reformulates the problem in terms of a conformal field theory on a Riemann surface, while the topological recursion is based on a recurrence equation for the observables representing symplectic invariants on the complex curve. The two approaches lead to two different graph expansions, one of which can be obtained as a partial resummation of the other.

  10. Recursive representation of Wronskians in confluent supersymmetric quantum mechanics

    International Nuclear Information System (INIS)

    Contreras-Astorga, Alonso; Schulze-Halberg, Axel

    2017-01-01

    A recursive form of arbitrary-order Wronskian associated with transformation functions in the confluent algorithm of supersymmetric quantum mechanics (SUSY) is constructed. With this recursive form regularity conditions for the generated potentials can be analyzed. Moreover, as byproducts we obtain new representations of solutions to Schrödinger equations that underwent a confluent SUSY-transformation. (paper)

  11. Cobham recursive set functions

    Czech Academy of Sciences Publication Activity Database

    Beckmann, A.; Buss, S.; Friedman, S.-D.; Müller, M.; Thapen, Neil

    2016-01-01

    Roč. 167, č. 3 (2016), s. 335-369 ISSN 0168-0072 R&D Projects: GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : set function * polynomial time * Cobham recursion Subject RIV: BA - General Mathematics Impact factor: 0.647, year: 2016 http://www.sciencedirect.com/science/article/pii/S0168007215001293

  12. 3. Procedures and Recursion

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 6. Algorithms Procedures and Recursion. R K Shyamasundar. Series Article Volume 1 ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road Mumbai 400 005, India.

  13. Recursive automatic classification algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Bauman, E V; Dorofeyuk, A A

    1982-03-01

    A variational statement of the automatic classification problem is given. The dependence of the form of the optimal partition surface on the form of the classification objective functional is investigated. A recursive algorithm is proposed for maximising a functional of reasonably general form. The convergence problem is analysed in connection with the proposed algorithm. 8 references.

  14. a Recursive Approach to Compute Normal Forms

    Science.gov (United States)

    HSU, L.; MIN, L. J.; FAVRETTO, L.

    2001-06-01

    Normal forms are instrumental in the analysis of dynamical systems described by ordinary differential equations, particularly when singularities close to a bifurcation are to be characterized. However, the computation of a normal form up to an arbitrary order is numerically hard. This paper focuses on the computer programming of some recursive formulas developed earlier to compute higher order normal forms. A computer program to reduce the system to its normal form on a center manifold is developed using the Maple symbolic language. However, it should be stressed that the program relies essentially on recursive numerical computations, while symbolic calculations are used only for minor tasks. Some strategies are proposed to save computation time. Examples are presented to illustrate the application of the program to obtain high order normalization or to handle systems with large dimension.

  15. A foundation for real recursive function theory

    NARCIS (Netherlands)

    J.F. Costa; B. S. Loff Barreto (Bruno Serra); J. Mycka

    2009-01-01

    htmlabstractThe class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the

  16. Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA

    DEFF Research Database (Denmark)

    Conradie, Willem; Goranko, Valentin; Vakarelov, Dimiter

    2010-01-01

    The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents...... on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds....

  17. Approximate Bayesian recursive estimation

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav

    2014-01-01

    Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf

  18. Recursion theory for metamathematics

    CERN Document Server

    Smullyan, Raymond M

    1993-01-01

    This work is a sequel to the author''s Godel''s Incompleteness Theorems, though it can be read independently by anyone familiar with Godel''s incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

  19. Cosymmetries and Nijenhuis recursion operators for difference equations

    International Nuclear Information System (INIS)

    Mikhailov, Alexander V; Xenitidis, Pavlos; Wang, Jing Ping

    2011-01-01

    In this paper we discuss the concept of cosymmetries and co-recursion operators for difference equations and present a co-recursion operator for the Viallet equation. We also discover a new type of factorization for the recursion operators of difference equations. This factorization enables us to give an elegant proof that the pseudo-difference operator R presented in Mikhailov et al 2011 Theor. Math. Phys. 167 421–43 is a recursion operator for the Viallet equation. Moreover, we show that the operator R is Nijenhuis and thus generates infinitely many commuting local symmetries. The recursion operator R and its factorization into Hamiltonian and symplectic operators have natural applications to Yamilov's discretization of the Krichever–Novikov equation

  20. Kind of approximate theoretical calculating formula of heat-exchange area for the vertical U-bend tube natural-circuit steam generator

    International Nuclear Information System (INIS)

    Luo Mingkun; Wang Fei; Huang Wei; Zhang Wenqi; Zhao Shan; Lu Lianghong

    2001-01-01

    A kind of approximate theoretical calculating formula of the vertical U-bend tube natural-circuit steam generator is deduced by using an approximate method, the results of this formula is compared with the heat exchanging areas of the real vertical U-bend tube natural-circuit steam generators, the absolute errors of them are below 8%

  1. The generation of simple compliance boundaries for mobile communication base station antennas using formulae for SAR estimation.

    Science.gov (United States)

    Thors, B; Hansson, B; Törnevik, C

    2009-07-07

    In this paper, a procedure is proposed for generating simple and practical compliance boundaries for mobile communication base station antennas. The procedure is based on a set of formulae for estimating the specific absorption rate (SAR) in certain directions around a class of common base station antennas. The formulae, given for both whole-body and localized SAR, require as input the frequency, the transmitted power and knowledge of antenna-related parameters such as dimensions, directivity and half-power beamwidths. With knowledge of the SAR in three key directions it is demonstrated how simple and practical compliance boundaries can be generated outside of which the exposure levels do not exceed certain limit values. The conservativeness of the proposed procedure is discussed based on results from numerical radio frequency (RF) exposure simulations with human body phantoms from the recently developed Virtual Family.

  2. Closed form of the Baker-Campbell-Hausdorff formula for the generators of semisimple complex Lie algebras

    International Nuclear Information System (INIS)

    Matone, Marco

    2016-01-01

    Recently it has been introduced an algorithm for the Baker-Campbell-Hausdorff (BCH) formula, which extends the Van-Brunt and Visser recent results, leading to new closed forms of BCH formula. More recently, it has been shown that there are 13 types of such commutator algebras. We show, by providing the explicit solutions, that these include the generators of the semisimple complex Lie algebras. More precisely, for any pair, X, Y of the Cartan-Weyl basis, we find W, linear combination of X, Y, such that exp(X) exp(Y) = exp(W). The derivation of such closed forms follows, in part, by using the above mentioned recent results. The complete derivation is provided by considering the structure of the root system. Furthermore, if X, Y, and Z are three generators of the Cartan-Weyl basis, we find, for a wide class of cases, W, a linear combination of X, Y and Z, such that exp(X) exp(Y) exp(Z) = exp(W). It turns out that the relevant commutator algebras are type 1c-i, type 4 and type 5. A key result concerns an iterative application of the algorithm leading to relevant extensions of the cases admitting closed forms of the BCH formula. Here we provide the main steps of such an iteration that will be developed in a forthcoming paper. (orig.)

  3. Cumulant generating function formula of heat transfer in ballistic systems with lead-lead coupling and general nonlinear systems

    Science.gov (United States)

    Li, Huanan

    2013-03-01

    Based on a two-time observation protocol, we consider heat transfer in a given time interval tM in a lead-junction-lead system taking coupling between the leads into account. In view of the two-time observation, consistency conditions are carefully verified in our specific family of quantum histories. Furthermore, its implication is briefly explored. Then using the nonequilibrium Green's function method, we obtain an exact formula for the cumulant generating function for heat transfer between the two leads, valid in both transient and steady-state regimes. Also, a compact formula for the cumulant generating function in the long-time limit is derived, for which the Gallavotti-Cohen fluctuation symmetry is explicitly verified. In addition, we briefly discuss Di Ventra's repartitioning trick regarding whether the repartitioning procedure of the total Hamiltonian affects the nonequilibrium steady-state current fluctuation. All kinds of properties of nonequilibrium current fluctuations, such as the fluctuation theorem in different time regimes, could be readily given according to these exact formulas. Finally a practical formalism dealing with cumulants of heat transfer across general nonlinear quantum systems is established based on field theoretical/algebraic method.

  4. Closed form of the Baker-Campbell-Hausdorff formula for the generators of semisimple complex Lie algebras

    Energy Technology Data Exchange (ETDEWEB)

    Matone, Marco [Universita di Padova, Dipartimento di Fisica e Astronomia ' ' G. Galilei' ' , Padua (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Padova, Padua (Italy)

    2016-11-15

    Recently it has been introduced an algorithm for the Baker-Campbell-Hausdorff (BCH) formula, which extends the Van-Brunt and Visser recent results, leading to new closed forms of BCH formula. More recently, it has been shown that there are 13 types of such commutator algebras. We show, by providing the explicit solutions, that these include the generators of the semisimple complex Lie algebras. More precisely, for any pair, X, Y of the Cartan-Weyl basis, we find W, linear combination of X, Y, such that exp(X) exp(Y) = exp(W). The derivation of such closed forms follows, in part, by using the above mentioned recent results. The complete derivation is provided by considering the structure of the root system. Furthermore, if X, Y, and Z are three generators of the Cartan-Weyl basis, we find, for a wide class of cases, W, a linear combination of X, Y and Z, such that exp(X) exp(Y) exp(Z) = exp(W). It turns out that the relevant commutator algebras are type 1c-i, type 4 and type 5. A key result concerns an iterative application of the algorithm leading to relevant extensions of the cases admitting closed forms of the BCH formula. Here we provide the main steps of such an iteration that will be developed in a forthcoming paper. (orig.)

  5. Molecular formula and METLIN Personal Metabolite Database matching applied to the identification of compounds generated by LC/TOF-MS.

    Science.gov (United States)

    Sana, Theodore R; Roark, Joseph C; Li, Xiangdong; Waddell, Keith; Fischer, Steven M

    2008-09-01

    In an effort to simplify and streamline compound identification from metabolomics data generated by liquid chromatography time-of-flight mass spectrometry, we have created software for constructing Personalized Metabolite Databases with content from over 15,000 compounds pulled from the public METLIN database (http://metlin.scripps.edu/). Moreover, we have added extra functionalities to the database that (a) permit the addition of user-defined retention times as an orthogonal searchable parameter to complement accurate mass data; and (b) allow interfacing to separate software, a Molecular Formula Generator (MFG), that facilitates reliable interpretation of any database matches from the accurate mass spectral data. To test the utility of this identification strategy, we added retention times to a subset of masses in this database, representing a mixture of 78 synthetic urine standards. The synthetic mixture was analyzed and screened against this METLIN urine database, resulting in 46 accurate mass and retention time matches. Human urine samples were subsequently analyzed under the same analytical conditions and screened against this database. A total of 1387 ions were detected in human urine; 16 of these ions matched both accurate mass and retention time parameters for the 78 urine standards in the database. Another 374 had only an accurate mass match to the database, with 163 of those masses also having the highest MFG score. Furthermore, MFG calculated a formula for a further 849 ions that had no match to the database. Taken together, these results suggest that the METLIN Personal Metabolite database and MFG software offer a robust strategy for confirming the formula of database matches. In the event of no database match, it also suggests possible formulas that may be helpful in interpreting the experimental results.

  6. A method for generating permutation distribution of ranks in a k ...

    African Journals Online (AJOL)

    ... in a combinatorial sense the distribution of the ranks is obtained via its generating function. The formulas are defined recursively to speed up computations using the computer algebra system Mathematica. Key words: Partitions, generating functions, combinatorics, permutation test, exact tests, computer algebra, k-sample, ...

  7. Explicit Formulae for the Continued Fraction Convergents of "Square Root of D"

    Science.gov (United States)

    Braza, Peter A.

    2010-01-01

    The formulae for the convergents of continued fractions are always given recursively rather than in explicit form. This article derives explicit formulae for the convergents of the continued fraction expansions for square roots.

  8. The ABCD of topological recursion

    DEFF Research Database (Denmark)

    Andersen, Jorgen Ellegaard; Borot, Gaëtan; Chekhov, Leonid O.

    Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of math-ph/0702045, seeing it as a quantization of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial data a quantum Airy structure...... the 2d TQFT partition function as a special case), non-commutative Frobenius algebras, loop spaces of Frobenius algebras and a Z2-invariant version of the latter. This Z2-invariant version in the case of a semi-simple Frobenius algebra corresponds to the topological recursion of math-ph/0702045....

  9. Radioelement decay schemes and equivalent graphs: formulae generated by algorithm for radioelement detection

    International Nuclear Information System (INIS)

    Becker, Antoine; Lame, Jacques; Le Gallic, Yves.

    1980-02-01

    In order to obtain a theoretical expression for the resultant uncertainty from a general relation concerning the detection of a radionuclide with a complex decay scheme, we seek to discuss here the necessary conditions for writing down such an expression. These conditions are: (1) determination, on a graph equivalent to the decay scheme concerned, of a classification into simple elementary paths between specified initial and final levels, so that an occurrence probability can be assigned to each independent decay route; (2) at least formal consideration of detector 'responses', not to a particular particle emission, but to each independent route as a whole; (3) hence the derivation of detection-selection formulae, in the apparent absence of instrumental dead time, which are especially concise and readable, and allow the formal separation of the factors arising from the geometry, the decay scheme, the detector efficiency and the parametric distribution [fr

  10. Recursive Algorithm For Linear Regression

    Science.gov (United States)

    Varanasi, S. V.

    1988-01-01

    Order of model determined easily. Linear-regression algorithhm includes recursive equations for coefficients of model of increased order. Algorithm eliminates duplicative calculations, facilitates search for minimum order of linear-regression model fitting set of data satisfactory.

  11. Features and Recursive Structure

    Directory of Open Access Journals (Sweden)

    Kuniya Nasukawa

    2015-01-01

    Full Text Available Based on the cross-linguistic tendency that weak vowels are realized with a central quality such as ə, ɨ, or ɯ, this paper attempts to account for this choice by proposing that the nucleus itself is one of the three monovalent vowel elements |A|, |I| and |U| which function as the building blocks of melodic structure. I claim that individual languages make a parametric choice to determine which of the three elements functions as the head of a nuclear expression. In addition, I show that elements can be freely concatenated to create melodic compounds. The resulting phonetic value of an element compound is determined by the specific elements it contains and by the head-dependency relations between those elements. This concatenation-based recursive mechanism of melodic structure can also be extended to levels above the segment, thus ultimately eliminating the need for syllabic constituents. This approach reinterprets the notion of minimalism in phonology by opposing the string-based flat structure.

  12. Recursive Ultrasound Imaging

    DEFF Research Database (Denmark)

    Nikolov, Svetoslav; Gammelmark, Kim; Jensen, Jørgen Arendt

    1999-01-01

    This paper presents a new imaging method, applicable for both 2D and 3D imaging. It is based on Synthetic Transmit Aperture Focusing, but unlike previous approaches a new frame is created after every pulse emission. The elements from a linear transducer array emit pulses one after another. The same...... transducer element is used after N-xmt emissions. For each emission the signals from the individual elements are beam-formed in parallel for all directions in the image. A new frame is created by adding the new RF lines to the RF lines from the previous frame. The RF data recorded at the previous emission...... with the same element are subtracted. This yields a new image after each pulse emission and can give a frame rate of e.g. 5000 images/sec. The paper gives a derivation of the recursive imaging technique and compares simulations for fast B-mode imaging with measurements. A low value of N-xmt is necessary...

  13. Recursive ultrasound imaging

    DEFF Research Database (Denmark)

    2000-01-01

    A method and an apparatus for recursive ultrasound imaging is presented. The method uses a Synthetic Transmit Aperture, but unlike previous approaches a new frame is created at every pulse emission. In receive, parallel beam forming is implemented. The beam formed RF data is added to the previously...... created RF lines. To keep the level of the signal, the RF data obtained previously, when emitting with the same element is subtracted from the RF lines. Up to 5000 frames/sec can be achieved for a tissue depth of 15 cm with a speed of sound of c = 1540 m/s. The high frame rate makes continuous imaging...... data possible, which can significantly enhance flow imaging. A point spread function 2° wide at -6 dB and grating lobes of $m(F) -50 dB is obtained with a 64 elements phased array with a central frequency ƒ¿0? = 3 MHz using a sparse transmit aperture using only 10 elements (N¿xmt? = 10) during pulse...

  14. Compact QED tree-level amplitudes from dressed BCFW recursion relations

    International Nuclear Information System (INIS)

    Badger, Simon D.; Henn, Johannes M.

    2010-05-01

    We construct a modified on-shell BCFW recursion relation to derive compact analytic representations of tree-level amplitudes in QED. As an application, we study the amplitudes of a fermion pair coupling to an arbitrary number of photons and give compact formulae for the NMHV and N 2 MHV case. We demonstrate that the new recursion relation reduces the growth in complexity with additional photons to be exponential rather than factorial. (orig.)

  15. Compact QED tree-level amplitudes from dressed BCFW recursion relations

    Energy Technology Data Exchange (ETDEWEB)

    Badger, Simon D. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Henn, Johannes M. [Humboldt Univ., Berlin (Germany). Inst. fuer Physik

    2010-05-15

    We construct a modified on-shell BCFW recursion relation to derive compact analytic representations of tree-level amplitudes in QED. As an application, we study the amplitudes of a fermion pair coupling to an arbitrary number of photons and give compact formulae for the NMHV and N{sup 2}MHV case. We demonstrate that the new recursion relation reduces the growth in complexity with additional photons to be exponential rather than factorial. (orig.)

  16. Trotter-Kato product formula and fractional powers of self-adjoint generators

    CERN Document Server

    Ichinose, I; Zagrebnov, Z

    2002-01-01

    Let $A$ and $B$ be non-negative self-adjoint operators in a Hilbert space such that their densely defined form sum $H = A \\stackrel{\\cdot}{+} B$ obeys $\\dom(H^\\ga) \\subseteq \\dom(A^\\ga) \\cap \\dom(B^\\ga)$ for some $\\ga \\in (1/2,1)$. It is proved that if, in addition, $A$ and $B$ satisfy $\\dom(A^{1/2}) \\subseteq \\dom(B^{1/2})$, then the symmetric and non-symmetric Trotter-Kato product formula converges in the operator norm: % % \\bed \\ba{c} \\left\\|\\left(e^{-tB/2n}e^{-tA/n}e^{-tB/2n}\\right)^n - e^{-tH}\\right\\| = O(n^{-(2\\ga-1)}), \\\\[2mm] \\left\\|\\left(e^{-tA/n}e^{-tB/n}\\right)^n - e^{-tH}\\right\\| = O(n^{-(2\\ga-1)}) \\ea \\eed % % uniformly in $t \\in [0,T]$, $0 < T < \\infty$, as $n \\to \\infty$, both with the same optimal error bound. The same is valid if one replaces the exponential function in the product by functions of the Kato class, that is, by real-valued Borel measurable functions $f(\\cdot)$ defined on the non-negative real axis obeying $0 \\le f(x) \\le 1$, $f(0) = 1$ and $f'(+0) = -1$, with some addition...

  17. Lipid oxidation in baked products: impact of formula and process on the generation of volatile compounds.

    Science.gov (United States)

    Maire, Murielle; Rega, Barbara; Cuvelier, Marie-Elisabeth; Soto, Paola; Giampaoli, Pierre

    2013-12-15

    This paper investigates the effect of ingredients on the reactions occurring during the making of sponge cake and leading to the generation of volatile compounds related to flavour quality. To obtain systems sensitive to lipid oxidation (LO), a formulation design was applied varying the composition of fatty matter and eggs. Oxidation of polyunsaturated fatty acids (PUFA) and formation of related volatile compounds were followed at the different steps of cake-making. Optimised dynamic Solid Phase Micro Extraction was applied to selectively extract either volatile or semi-volatile compounds directly from the baking vapours. We show for the first time that in the case of alveolar baked products, lipid oxidation occurs very early during the step of dough preparation and to a minor extent during the baking process. The generation of lipid oxidation compounds depends on PUFA content and on the presence of endogenous antioxidants in the raw matter. Egg yolk seemed to play a double role on reactivity: protecting unsaturated lipids from oxidation and being necessary to generate a broad class of compounds of the Maillard reaction during baking and linked to the typical flavour of sponge cake. Copyright © 2013 Elsevier Ltd. All rights reserved.

  18. Recursion Relations for Conformal Blocks

    CERN Document Server

    Penedones, João; Yamazaki, Masahito

    2016-09-12

    In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension $\\Delta$ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in 1307.6856 for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.

  19. Recursive Definitions of Monadic Functions

    Directory of Open Access Journals (Sweden)

    Alexander Krauss

    2010-12-01

    Full Text Available Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.

  20. Recursive-operator method in vibration problems for rod systems

    Science.gov (United States)

    Rozhkova, E. V.

    2009-12-01

    Using linear differential equations with constant coefficients describing one-dimensional dynamical processes as an example, we show that the solutions of these equations and systems are related to the solution of the corresponding numerical recursion relations and one does not have to compute the roots of the corresponding characteristic equations. The arbitrary functions occurring in the general solution of the homogeneous equations are determined by the initial and boundary conditions or are chosen from various classes of analytic functions. The solutions of the inhomogeneous equations are constructed in the form of integro-differential series acting on the right-hand side of the equation, and the coefficients of the series are determined from the same recursion relations. The convergence of formal solutions as series of a more general recursive-operator construction was proved in [1]. In the special case where the solutions of the equation can be represented in separated variables, the power series can be effectively summed, i.e., expressed in terms of elementary functions, and coincide with the known solutions. In this case, to determine the natural vibration frequencies, one obtains algebraic rather than transcendental equations, which permits exactly determining the imaginary and complex roots of these equations without using the graphic method [2, pp. 448-449]. The correctness of the obtained formulas (differentiation formulas, explicit expressions for the series coefficients, etc.) can be verified directly by appropriate substitutions; therefore, we do not prove them here.

  1. WKB solutions of difference equations and reconstruction by the topological recursion

    Science.gov (United States)

    Marchal, Olivier

    2018-01-01

    The purpose of this article is to analyze the connection between Eynard-Orantin topological recursion and formal WKB solutions of a \\hbar -difference equation: \\Psi(x+\\hbar)=≤ft(e\\hbar\\fracd{dx}\\right) \\Psi(x)=L(x;\\hbar)\\Psi(x) with L(x;\\hbar)\\in GL_2( ({C}(x))[\\hbar]) . In particular, we extend the notion of determinantal formulas and topological type property proposed for formal WKB solutions of \\hbar -differential systems to this setting. We apply our results to a specific \\hbar -difference system associated to the quantum curve of the Gromov-Witten invariants of {P}1 for which we are able to prove that the correlation functions are reconstructed from the Eynard-Orantin differentials computed from the topological recursion applied to the spectral curve y=\\cosh-1\\frac{x}{2} . Finally, identifying the large x expansion of the correlation functions, proves a recent conjecture made by Dubrovin and Yang regarding a new generating series for Gromov-Witten invariants of {P}1 .

  2. Proof Rules for Recursive Procedures

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1993-01-01

    Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule deals with total correctness and is based on results of Gries and Martin. The rule is easier to apply than Martin's. It is introduced as an extension of a specification format for Pascal-procedures, with

  3. CP-Recursion in Danish

    DEFF Research Database (Denmark)

    Nyvad, Anne Mette; Christensen, Ken Ramshøj; Vikner, Sten

    2017-01-01

    Based on data from extraction, embedded V2, and complementizer stacking, this paper proposes a cP/CP-analysis of CP-recursion in Danish. Because extraction can be shown to be possible from relative clauses, wh-islands, and adverbial clauses, and given that long extraction is successive......-cyclic, an extra specifier position has to be available as an escape hatch. Consequently, such extractions require a CP-recursion analysis, as has been argued for embedded V2 and for complementizer stacking. Given that CP-recursion in embedded V2 clauses does not allow extraction, whereas other types of CP......-recursion do, we suggest that embedded V2 is fundamentally different, in that main clause V2 and embedded V2 involve a CP (“big CP”), whereas all other clausal projections above IP are instances of cP (“little cP”). The topmost “little” c° has an occurrence feature that enables extraction but bars spell...

  4. Lessons in Contingent, Recursive Humility

    Science.gov (United States)

    Vagle, Mark D.

    2011-01-01

    In this article, the author argues that critical work in teacher education should begin with teacher educators turning a critical eye on their own practices. The author uses Lesko's conception of contingent, recursive growth and change to analyze a lesson he observed as part of a phenomenological study aimed at understanding more about what it is…

  5. Adding Recursive Constructs to Bialgebraic Semantics

    DEFF Research Database (Denmark)

    Klin, Bartek

    2004-01-01

    This paper aims at fitting a general class of recursive equations into the framework of ‘well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin. Rather than interpreting recursive constructs by means of operational rules, separate recursive equatio...

  6. How Learning Logic Programming Affects Recursion Comprehension

    Science.gov (United States)

    Haberman, Bruria

    2004-01-01

    Recursion is a central concept in computer science, yet it is difficult for beginners to comprehend. Israeli high-school students learn recursion in the framework of a special modular program in computer science (Gal-Ezer & Harel, 1999). Some of them are introduced to the concept of recursion in two different paradigms: the procedural…

  7. Counting Your Way to the Sum of Squares Formula

    Indian Academy of Sciences (India)

    IAS Admin

    This gives us a brand new formula for the sum of the squares of the first n positive integers! A small tweak gives us a second formula, for free! For, we have the following identity for the binomial coeffi- cients which comes from the well known recursive rela- tion which the binomial coefficients satisfy: (n + 1. 3 )+ ( n + 1. 2 )= (.

  8. A strange recursion operator demystified

    International Nuclear Information System (INIS)

    Sergyeyev, A

    2005-01-01

    We show that a new integrable two-component system of KdV type studied by Karasu (Kalkanli) et al (2004 Acta Appl. Math. 83 85-94) is bi-Hamiltonian, and its recursion operator, which has a highly unusual structure of nonlocal terms, can be written as a ratio of two compatible Hamiltonian operators found by us. Using this we prove that the system in question possesses an infinite hierarchy of local commuting generalized symmetries and conserved quantities in involution, and the evolution systems corresponding to these symmetries are bi-Hamiltonian as well. We also show that upon introduction of suitable nonlocal variables the nonlocal terms of the recursion operator under study can be written in the usual form, with the integration operator D -1 x appearing in each term at most once. (letter to the editor)

  9. New class of filter functions generated most directly by Christoffel-Darboux formula for Gegenbauer orthogonal polynomials

    Science.gov (United States)

    Ilić, Aleksandar D.; Pavlović, Vlastimir D.

    2011-01-01

    A new original formulation of all pole low-pass filter functions is proposed in this article. The starting point in solving the approximation problem is a direct application of the Christoffel-Darboux formula for the set of orthogonal polynomials, including Gegenbauer orthogonal polynomials in the finite interval [-1, +1] with the application of a weighting function with a single free parameter. A general solution for the filter functions is obtained in a compact explicit form, which is shown to enable generation of the Gegenbauer filter functions in a simple way by choosing the value of the free parameter. Moreover, the proposed solution with the same criterion of approximation could be used to generate Legendre and Chebyshev filter functions of the first and second kind as well. The examples of proposed filter functions of even (10th) and odd (11th) order are illustrated. The approximation is shown to yield a good compromise solution with respect to the filter frequency characteristics (magnitude as well as phase characteristics). The influence of tolerance of the filter critical component (inductor) on the proposed magnitude and group delay characteristics of a resistively terminated LC lossless ladder filter is analysed as well. The proposed filter functions are superior in terms of the excellent magnitude characteristic, which approximates an ideal filter almost perfectly over the entire pass-band range and exhibits the summed sensitivity function better than that of a Butterworth filter. In the article, we present the filter function solution that exhibits optimum amplitude as well as optimum group delay characteristics that are of crucial importance for implementation of digital processing as well as RF analogue parts of communication networks. Derivation of the other band range filter functions, which could be realised either by continuous or digital filters, is also generally possible with the procedure proposed in this article.

  10. Kant's universal law formula revisited

    NARCIS (Netherlands)

    Nyholm, S.

    2015-01-01

    Kantians are increasingly deserting the universal law formula in favor of the humanity formula. The former, they argue, is open to various decisive objections; the two are not equivalent; and it is only by appealing to the human- ity formula that Kant can reliably generate substantive implications

  11. Recursive Trees for Practical ORAM

    Directory of Open Access Journals (Sweden)

    Moataz Tarik

    2015-06-01

    Full Text Available We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r-ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r-ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r-ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r-ORAM’s soundness, we conduct a detailed overflow analysis. r-ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r-ORAM in a practical setting to back up our theoretical claims.

  12. Primitive recursive realizability and basic propositional logic

    NARCIS (Netherlands)

    Plisko, Valery

    2007-01-01

    Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there

  13. Conjugate gradient algorithms using multiple recursions

    Energy Technology Data Exchange (ETDEWEB)

    Barth, T.; Manteuffel, T.

    1996-12-31

    Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

  14. Bounded queries in recursion theory

    CERN Document Server

    Gasarch, William I

    1999-01-01

    One of the major concerns of theoretical computer science is the classifi­ cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.

  15. Recursive sequences in first-year calculus

    Science.gov (United States)

    Krainer, Thomas

    2016-02-01

    This article provides ready-to-use supplementary material on recursive sequences for a second-semester calculus class. It equips first-year calculus students with a basic methodical procedure based on which they can conduct a rigorous convergence or divergence analysis of many simple recursive sequences on their own without the need to invoke inductive arguments as is typically required in calculus textbooks. The sequences that are accessible to this kind of analysis are predominantly (eventually) monotonic, but also certain recursive sequences that alternate around their limit point as they converge can be considered.

  16. Topological recursion for Gaussian means and cohomological field theories

    Science.gov (United States)

    Andersen, J. E.; Chekhov, L. O.; Norbury, P.; Penner, R. C.

    2015-12-01

    We introduce explicit relations between genus-filtrated s-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich-Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces M g,s disc (discrete volumes). Using these relations, we express Gaussian means in all orders of the genus expansion as polynomials in special times weighted by ancestor invariants of an underlying cohomological field theory. We translate the topological recursion of the Gaussian model into recurrence relations for the coefficients of this expansion, which allows proving that they are integers and positive. We find the coefficients in the first subleading order for M g,1 for all g in three ways: using the refined Harer-Zagier recursion, using the Givental-type decomposition of the KPMM, and counting diagrams explicitly.

  17. Berends-Giele recursions and the BCJ duality in superspace and components

    Energy Technology Data Exchange (ETDEWEB)

    Mafra, Carlos R. [Institute for Advanced Study, School of Natural Sciences,Einstein Drive, Princeton, NJ 08540 (United States); DAMTP, University of Cambridge,Wilberforce Road, Cambridge, CB3 0WA (United Kingdom); Schlotterer, Oliver [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,Am Muehlenberg, 14476 Potsdam (Germany)

    2016-03-15

    The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.

  18. Berends-Giele recursions and the BCJ duality in superspace and components

    International Nuclear Information System (INIS)

    Mafra, Carlos R.; Schlotterer, Oliver

    2016-01-01

    The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.

  19. Formula inflation

    Directory of Open Access Journals (Sweden)

    Antipov Valerij Ivanovich

    2015-10-01

    Full Text Available The article gives a modern interpretation of the Fisher formula, the calculated velocity of circulation of money supply M2 in the interval 1995-2013 and forecast of its changes until 2030 when hypotheses about the rate of inflation and GDP. Points to the fallacy of its direct use to control inflation and money supply. For a more detailed understanding of the inflationary process proposes a new frequency formula and the explanation of the situation with the regulation of prices in the economy.

  20. Makeham's Formula

    DEFF Research Database (Denmark)

    Astrup Jensen, Bjarne

    analysis. We use Makeham's formula to decompose the return on a bond investment into interest payments, realized capital gains and accrued capital gains for a variety of accounting rules for measuring accruals in order to study the theoretical properties of these accounting rules, their taxation...... consequences and their implications for the relation between the yield before tax and the yield after tax. We also show how Makeham's formula produces short-cut expressions for the duration and convexity of a bond and facilitates the analytical calculation of the yield in certain cases....

  1. New Recursive Representations for the Favard Constants with Application to Multiple Singular Integrals and Summation of Series

    Directory of Open Access Journals (Sweden)

    Snezhana Georgieva Gocheva-Ilieva

    2013-01-01

    Full Text Available There are obtained integral form and recurrence representations for some Fourier series and connected with them Favard constants. The method is based on preliminary integration of Fourier series which permits to establish general recursion formulas for Favard constants. This gives the opportunity for effective summation of infinite series and calculation of some classes of multiple singular integrals by the Favard constants.

  2. Recursive relations for a quiver gauge theory

    International Nuclear Information System (INIS)

    Park, Jaemo; Sim, Woojoo

    2006-01-01

    We study the recursive relations for a quiver gauge theory with the gauge group SU(N 1 ) x SU(N 2 ) with bifundamental fermions transforming as (N 1 , N-bar 2 ). We work out the recursive relation for the amplitudes involving a pair of quark and antiquark and gluons of each gauge group. We realize directly in the recursive relations the invariance under the order preserving permutations of the gluons of the first and the second gauge group. We check the proposed relations for MHV, 6-point and 7-point amplitudes and find the agreements with the known results and the known relations with the single gauge group amplitudes. The proposed recursive relation is much more efficient in calculating the amplitudes than using the known relations with the amplitudes of the single gauge group

  3. Is recursion language-specific? Evidence of recursive mechanisms in the structure of intentional action.

    Science.gov (United States)

    Vicari, Giuseppe; Adenzato, Mauro

    2014-05-01

    In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains. Copyright © 2014 Elsevier Inc. All rights reserved.

  4. Recursive tridiagonalization of infinite dimensional Hamiltonians

    International Nuclear Information System (INIS)

    Haydock, R.; Oregon Univ., Eugene, OR

    1989-01-01

    Infinite dimensional, computable, sparse Hamiltonians can be numerically tridiagonalized to finite precision using a three term recursion. Only the finite number of components whose relative magnitude is greater than the desired precision are stored at any stage in the computation. Thus the particular components stored change as the calculation progresses. This technique avoids errors due to truncation of the orbital set, and makes terminators unnecessary in the recursion method. (orig.)

  5. Recursion Operators for Dispersionless KP Hierarchy

    International Nuclear Information System (INIS)

    Cheng Qiusheng; He Jingsong

    2012-01-01

    Based on the corresponding theorem between dispersionless KP (dKP) hierarchy and ħ-dependent KP (ħKP) hierarchy, a general formal representation of the recursion operators for dKP hierarchy under n-reduction is given in a systematical way from the corresponding ħKP hierarchy. To illustrate this method, the recursion operators for dKP hierarchy under 2-reduction and 3-reduction are calculated in detail.

  6. Recursion theory computational aspects of definability

    CERN Document Server

    Chong, Chi Tat

    2015-01-01

    This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

  7. Makeham's Formula

    DEFF Research Database (Denmark)

    Astrup Jensen, Bjarne

    analysis. We use Makeham's formula to decompose the return on a bond investment into interest payments, realized capital gains and accrued capital gains for a variety of accounting rules for measuring accruals in order to study the theoretical properties of these accounting rules, their taxation...

  8. Recursion Of Binary Space As A Foundation Of Repeatable Programs

    Directory of Open Access Journals (Sweden)

    Jeremy Horne

    2006-10-01

    Full Text Available Every computation, including recursion, is based on natural philosophy. Our world may be expressed in terms of a binary logical space that contains functions that act simultaneously as objects and processes (operands and operators. This paper presents an outline of the results of research about that space and suggests routes for further inquiry. Binary logical space is generated sequentially from an origin in a standard coordinate system. At least one method exists to show that each of the resulting 16 functions repeats itself by repeatedly forward-feeding outputs of a function operating over two others as new operands of the original function until the original function appears as an output, thus behaving as an apparent homeostatic automaton. As any space of any dimension is composed of one or more of these functions, so the space is recursive, as well. Semantics gives meaning to recursive structures, computer programs and fundamental constituents of our universe being two examples. Such thoughts open inquiry into larger philosophical issues as free will and determinism.

  9. Isotope decay equations solved by means of a recursive method

    International Nuclear Information System (INIS)

    Grant, Carlos

    2009-01-01

    The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)

  10. Continued development of recursive thinking in adolescence : Longitudinal analyses with a revised recursive thinking test

    NARCIS (Netherlands)

    van den Bos, E.; de Rooij, M.; Sumter, S.R.; Westenberg, P.M.

    2016-01-01

    The present study adds to the emerging literature on the development of social cognition in adolescence by investigating the development of recursive thinking (i.e., thinking about thinking). Previous studies have indicated that the development of recursive thinking is not completed during

  11. Simple recursion relations for general field theories

    International Nuclear Information System (INIS)

    Cheung, Clifford; Shen, Chia-Hsien; Trnka, Jaroslav

    2015-01-01

    On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensional analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-line constructibility of all gauge theories with fermions and complex scalars in arbitrary representations, all supersymmetric theories, and the standard model. Moreover, all amplitudes in non-renormalizable theories without derivative interactions are constructible; with derivative interactions, a subset of amplitudes is constructible. We illustrate our results with examples from both renormalizable and non-renormalizable theories. Our study demonstrates both the power and limitations of recursion relations as a self-contained formulation of quantum field theory.

  12. Updating Recursive XML Views of Relations

    DEFF Research Database (Denmark)

    Choi, Byron; Cong, Gao; Fan, Wenfei

    2009-01-01

    This paper investigates the view update problem for XML views published from relational data. We consider XML views defined in terms of mappings directed by possibly recursive DTDs compressed into DAGs and stored in relations. We provide new techniques to efficiently support XML view updates...... specified in terms of XPath expressions with recursion and complex filters. The interaction between XPath recursion and DAG compression of XML views makes the analysis of the XML view update problem rather intriguing. Furthermore, many issues are still open even for relational view updates, and need...... to be explored. In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present effecient algorithms to translate XML updates to relational view updates. On the relational side, we propose a mild condition on SPJ views, and show...

  13. Adaptable Iterative and Recursive Kalman Filter Schemes

    Science.gov (United States)

    Zanetti, Renato

    2014-01-01

    Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

  14. The recursive solution of the Schroedinger equation

    International Nuclear Information System (INIS)

    Haydock, R.

    The transformation of an arbitrary quantum model and its subsequent analysis is proposed. The chain expresses mathematically the physical concept of local environment. The recursive transformation yields analytic chains for some systems, but it is also convenient and efficient for constructing numerical chain models enabling the solution of problems which are too big for numerical matrix methods. The chain model sugests new approach to quantum mechanical models. Because of the simple solution of chain models, the qualitative behaviour of different physical properties can be determined. Unlike many methods for solving quantum models, one has rigorous results about the convergence of approximation. Because they are defined recursively, the approsimations are suited to computation. (Ha)

  15. Breastfeeding vs. Formula Feeding

    Science.gov (United States)

    ... for Educators Search English Español Breastfeeding vs. Formula Feeding KidsHealth / For Parents / Breastfeeding vs. Formula Feeding What's ... work with a lactation specialist. All About Formula Feeding Commercially prepared infant formulas are a nutritious alternative ...

  16. The Method of Recursive Counting: Can one go further?

    International Nuclear Information System (INIS)

    Creutz, M.; Horvath, I.

    1993-12-01

    After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations

  17. Decidability and Expressiveness of Recursive Weighted Logic

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. RecursiveWeighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties...

  18. Adaptable recursive binary entropy coding technique

    Science.gov (United States)

    Kiely, Aaron B.; Klimesh, Matthew A.

    2002-07-01

    We present a novel data compression technique, called recursive interleaved entropy coding, that is based on recursive interleaving of variable-to variable length binary source codes. A compression module implementing this technique has the same functionality as arithmetic coding and can be used as the engine in various data compression algorithms. The encoder compresses a bit sequence by recursively encoding groups of bits that have similar estimated statistics, ordering the output in a way that is suited to the decoder. As a result, the decoder has low complexity. The encoding process for our technique is adaptable in that each bit to be encoded has an associated probability-of-zero estimate that may depend on previously encoded bits; this adaptability allows more effective compression. Recursive interleaved entropy coding may have advantages over arithmetic coding, including most notably the admission of a simple and fast decoder. Much variation is possible in the choice of component codes and in the interleaving structure, yielding coder designs of varying complexity and compression efficiency; coder designs that achieve arbitrarily small redundancy can be produced. We discuss coder design and performance estimation methods. We present practical encoding and decoding algorithms, as well as measured performance results.

  19. Certified higher-order recursive path ordering

    NARCIS (Netherlands)

    Koprowski, A.; Pfenning, F.

    2006-01-01

    The paper reports on a formalization of a proof of wellfoundedness of the higher-order recursive path ordering (HORPO) in the proof checker Coq. The development is axiom-free and fully constructive. Three substantive parts that could be used also in other developments are the formalizations of the

  20. A Survey on Teaching and Learning Recursive Programming

    Science.gov (United States)

    Rinderknecht, Christian

    2014-01-01

    We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative…

  1. Generation of standard gas mixtures of halogenated, aliphatic, and aromatic compounds and prediction of the individual output rates based on molecular formula and boiling point.

    Science.gov (United States)

    Thorenz, Ute R; Kundel, Michael; Müller, Lars; Hoffmann, Thorsten

    2012-11-01

    In this work, we describe a simple diffusion capillary device for the generation of various organic test gases. Using a set of basic equations the output rate of the test gas devices can easily be predicted only based on the molecular formula and the boiling point of the compounds of interest. Since these parameters are easily accessible for a large number of potential analytes, even for those compounds which are typically not listed in physico-chemical handbooks or internet databases, the adjustment of the test gas source to the concentration range required for the individual analytical application is straightforward. The agreement of the predicted and measured values is shown to be valid for different groups of chemicals, such as halocarbons, alkanes, alkenes, and aromatic compounds and for different dimensions of the diffusion capillaries. The limits of the predictability of the output rates are explored and observed to result in an underprediction of the output rates when very thin capillaries are used. It is demonstrated that pressure variations are responsible for the observed deviation of the output rates. To overcome the influence of pressure variations and at the same time to establish a suitable test gas source for highly volatile compounds, also the usability of permeation sources is explored, for example for the generation of molecular bromine test gases.

  2. Recursions for Statistical Multiple Alignment

    DEFF Research Database (Denmark)

    Hein, Jotun; Pedersen, Christian Nørgaard Storm; Jensen, Jens Ledet

    2002-01-01

    Algorithms are presented that allow the calculation of the probability of a set of sequences related by a binary tree that have evolved according to the Thorne–Kishino–Felsenstein model for a fixed set of parameters. The algorithms are based on a Markov chain generating sequences and their alignm...

  3. Analysis of litter size and average litter weight in pigs using a recursive model

    DEFF Research Database (Denmark)

    Varona, Luis; Sorensen, Daniel; Thompson, Robin

    2007-01-01

    An analysis of litter size and average piglet weight at birth in Landrace and Yorkshire using a standard two-trait mixed model (SMM) and a recursive mixed model (RMM) is presented. The RMM establishes a one-way link from litter size to average piglet weight. It is shown that there is a one......-to-one correspondence between the parameters of SMM and RMM and that they generate equivalent likelihoods. As parameterized in this work, the RMM tests for the presence of a recursive relationship between additive genetic values, permanent environmental effects, and specific environmental effects of litter size......, on average piglet weight. The equivalent standard mixed model tests whether or not the covariance matrices of the random effects have a diagonal structure. In Landrace, posterior predictive model checking supports a model without any form of recursion or, alternatively, a SMM with diagonal covariance...

  4. The boundary length and point spectrum enumeration of partial chord diagrams using cut and join recursion

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Fuji, Hiroyuki; Penner, Robert C.

    relation, which combined with an initial condition determines these numbers uniquely. This recursion relation is equivalent to a second order, non-linear, algebraic partial differential equation for the generating function of the numbers of partial chord diagrams filtered by the boundary length and point...

  5. On semantics and applications of guarded recursion

    DEFF Research Database (Denmark)

    Bizjak, Aleš

    2016-01-01

    denotational model and a logic for reasoning about program equivalence. In the last three chapters we study syntax and semantics of a dependent type theory with a family of later modalities indexed by the set of clocks, and clock quantifiers. In the fourth and fifth chapters we provide two model constructions......In this dissertation we study applications and semantics of guarded recursion, which is a method for ensuring that self-referential descriptions of objects define a unique object. The first two chapters are devoted to applications. We use guarded recursion, first in the form of explicit step......-indexing and then in the form of the internal language of particular sheaf topos, to construct logical relations for reasoning about contextual approximation of probabilistic and nondeterministic programs. These logical relations are sound and complete and useful for showing a range of example equivalences. In the third...

  6. A recursive reduction of tensor Feynman integrals

    International Nuclear Information System (INIS)

    Diakonidis, T.; Riemann, T.; Tausk, J.B.; Fleischer, J.

    2009-07-01

    We perform a recursive reduction of one-loop n-point rank R tensor Feynman integrals [in short: (n,R)-integrals] for n≤6 with R≤n by representing (n,R)-integrals in terms of (n,R-1)- and (n-1,R-1)-integrals. We use the known representation of tensor integrals in terms of scalar integrals in higher dimension, which are then reduced by recurrence relations to integrals in generic dimension. With a systematic application of metric tensor representations in terms of chords, and by decomposing and recombining these representations, we find the recursive reduction for the tensors. The procedure represents a compact, sequential algorithm for numerical evaluations of tensor Feynman integrals appearing in next-to-leading order contributions to massless and massive three- and four-particle production at LHC and ILC, as well as at meson factories. (orig.)

  7. Trace formulae for arithmetical systems

    International Nuclear Information System (INIS)

    Bogomolny, E.B.; Georgeot, B.; Giannoni, M.J.; Schmit, C.

    1992-09-01

    For quantum problems on the pseudo-sphere generated by arithmetic groups there exist special trace formulae, called trace formulae for Hecke operators, which permit the reconstruction of wave functions from the knowledge of periodic orbits. After a short discussion of this subject, the Hecke operators trace formulae are presented for the Dirichlet problem on the modular billiard, which is a prototype of arithmetical systems. The results of numerical computations for these semiclassical type relations are in good agreement with the directly computed eigenfunctions. (author) 23 refs.; 2 figs

  8. Recursions of Symmetry Orbits and Reduction without Reduction

    Directory of Open Access Journals (Sweden)

    Andrei A. Malykh

    2011-04-01

    Full Text Available We consider a four-dimensional PDE possessing partner symmetries mainly on the example of complex Monge-Ampère equation (CMA. We use simultaneously two pairs of symmetries related by a recursion relation, which are mutually complex conjugate for CMA. For both pairs of partner symmetries, using Lie equations, we introduce explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. We study the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. We use point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence we end up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. We present algebraic and exponential examples of such solutions that govern Legendre-transformed Ricci-flat Kähler metrics with no Killing vectors. A similar procedure is briefly outlined for Husain equation.

  9. Painlevé equations, topological type property and reconstruction by the topological recursion

    Science.gov (United States)

    Iwaki, K.; Marchal, O.; Saenz, A.

    2018-01-01

    In this article we prove that Lax pairs associated with ħ-dependent six Painlevé equations satisfy the topological type property proposed by Bergère, Borot and Eynard for any generic choice of the monodromy parameters. Consequently we show that one can reconstruct the formal ħ-expansion of the isomonodromic τ-function and of the determinantal formulas by applying the so-called topological recursion to the spectral curve attached to the Lax pair in all six Painlevé cases. Finally we illustrate the former results with the explicit computations of the first orders of the six τ-functions.

  10. Improved Undecidability Results for Reachability Games on Recursive Timed Automata

    Directory of Open Access Journals (Sweden)

    Shankara Narayanan Krishna

    2014-08-01

    Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.

  11. Recursive definition of global cellular-automata mappings

    DEFF Research Database (Denmark)

    Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...

  12. Recursive definition of global cellular-automata mappings

    International Nuclear Information System (INIS)

    Feldberg, R.; Knudsen, C.; Rasmussen, S.

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice

  13. On optimal quadrature formulae

    Directory of Open Access Journals (Sweden)

    Lanzara Flavia

    2000-01-01

    Full Text Available A procedure to construct quadrature formulae which are exact for solutions of linear differential equations and are optimal in the sense of Sard is discussed. We give necessary and sufficient conditions under which such formulae do exist. Several formulae obtained by applying this method are considered and compared with well known formulae.

  14. Recursive deconvolution of combinatorial chemical libraries.

    OpenAIRE

    Erb, E; Janda, K D; Brenner, S

    1994-01-01

    A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a...

  15. The Lehmer Matrix and Its Recursive Analogue

    Science.gov (United States)

    2010-01-01

    LU factorization of matrix A by considering det A = det U = ∏n i=1 2i−1 i2 . The nth Catalan number is given in terms of binomial coefficients by Cn...for failing to comply with a collection of information if it does not display a currently valid OMB control number . 1. REPORT DATE 2010 2. REPORT...TYPE 3. DATES COVERED 00-00-2010 to 00-00-2010 4. TITLE AND SUBTITLE The Lehmer matrix and its recursive analogue 5a. CONTRACT NUMBER 5b

  16. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    NARCIS (Netherlands)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years) and one older

  17. Active control versus recursive backstepping control of a chaotic ...

    African Journals Online (AJOL)

    ... than for the recursive backstepping controllers. However, the flexibility in the choice of the control laws for recursive backstepping design gives room for further improvement in its performance and enables it to achieve the goals of stabilization and tracking. Journal of the Nigerian Association of Mathematical Physics Vol.

  18. Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning

    Science.gov (United States)

    Josephson, Marika

    2011-01-01

    In 2002, Chomsky, Hauser, and Fitch asserted that recursion may be the one aspect of the human language faculty that makes human language unique in the narrow sense--unique to language and unique to human beings. They also argue somewhat more quietly (as do Pinker and Jackendoff 2005) that recursion may be possible outside of language: navigation,…

  19. Excel 2013 formulas

    CERN Document Server

    Walkenbach, John

    2013-01-01

    Maximize the power of Excel 2013 formulas with this must-have Excel reference John Walkenbach, known as ""Mr. Spreadsheet,"" is a master at deciphering complex technical topics and Excel formulas are no exception. This fully updated book delivers more than 800 pages of Excel 2013 tips, tricks, and techniques for creating formulas that calculate, developing custom worksheet functions with VBA, debugging formulas, and much more. Demonstrates how to use all the latest features in Excel 2013 Shows how to create financial formulas and tap into the power of array formulas

  20. A self-applicable online partial evaluator for recursive flowchart languages

    DEFF Research Database (Denmark)

    Glück, Robert

    2012-01-01

    This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls. Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported in the literature for of¿ine partial evaluation. This result is remarkable...... because it has been assumed that online partial evaluation techniques unavoidably lead to inef¿cient and overgeneralized generating extensions. The purpose of this paper is not to determine which kind of partial evaluation is better, but to show how the problem can be solved by recursive polyvariant...... specialization. The design of the self-applicable online partial evaluator is based on a number of known techniques, but by combining them in a new way this result can be produced. The partial evaluator, its techniques, and its implementation are presented in full. Self-application according to all three...

  1. A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces

    DEFF Research Database (Denmark)

    Schwinghammer, Jan; Birkedal, Lars; Støvring, Kristian

    2011-01-01

    ´eraud and Pottier’s type and capability system including both frame and anti-frame rules. The model is a possible worlds model based on the operational semantics and step-indexed heap relations, and the worlds are constructed as a recursively defined predicate on a recursively defined metric space. We also extend...

  2. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    for Chargu´eraud and Pottier’s type and capability system including frame and anti-frame rules, based on the operational semantics and step-indexed heap relations. The worlds are constructed as a recursively defined predicate on a recursively defined metric space, which provides a considerably simpler...

  3. Algebraic Optimization of Recursive Database Queries

    DEFF Research Database (Denmark)

    Hansen, Michael Reichhardt

    1988-01-01

    Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered a generali......Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered...... a generalization of Aho and Ullman, (1979). The result is interpreted in function free logic database terms as a transformation of the recursively defined predicate involving: (a) elimination of an argument, and (b) propagation of selections (instantiations) to the extensionally defined predicates. A collection...

  4. Locating one pairwise interaction: Three recursive constructions

    Directory of Open Access Journals (Sweden)

    Charles J. Colbourn

    2016-09-01

    Full Text Available In a complex component-based system, choices (levels for components (factors may interact tocause faults in the system behaviour. When faults may be caused by interactions among few factorsat specific levels, covering arrays provide a combinatorial test suite for discovering the presence offaults. While well studied, covering arrays do not enable one to determine the specific levels of factorscausing the faults; locating arrays ensure that the results from test suite execution suffice to determinethe precise levels and factors causing faults, when the number of such causes is small. Constructionsfor locating arrays are at present limited to heuristic computational methods and quite specific directconstructions. In this paper three recursive constructions are developed for locating arrays to locateone pairwise interaction causing a fault.

  5. Generating QCD amplitudes in the color-flow basis with MadGraph

    International Nuclear Information System (INIS)

    Hagiwara, Kaoru; Takaesu, Yoshitaro

    2011-01-01

    We propose to make use of the off-shell recursive relations with the color-flow decomposition in the calculation of QCD amplitudes on MadGraph. We introduce colored quarks and their interactions with nine gluons in the color-flow basis plus an Abelian gluon on MadGraph, such that it generates helicity amplitudes in the color-flow basis with off-shell recursive formulae for multi-gluon sub-amplitudes. We demonstrate calculations of up to 5-jet processes such as gg→5g, u anti u→5g and uu→uuggg. Although our demonstration is limited, it paves the way to evaluate amplitudes with more quark lines and gluons with MadGraph. (orig.)

  6. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind.

    Directory of Open Access Journals (Sweden)

    Burcu Arslan

    Full Text Available In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years and one older (6;7-8;10 years. Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children's second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck.

  7. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    Science.gov (United States)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6–6;5 years) and one older (6;7–8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children’s second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck. PMID:28072823

  8. Higher Education Funding Formulas.

    Science.gov (United States)

    McKeown-Moak, Mary P.

    1999-01-01

    One of the most critical components of the college or university chief financial officer's job is budget planning, especially using formulas. A discussion of funding formulas looks at advantages, disadvantages, and types of formulas used by states in budgeting for higher education, and examines how chief financial officers can position the campus…

  9. On Recursive Modification in Child L1 French

    Directory of Open Access Journals (Sweden)

    Yves Roberge

    2018-03-01

    Full Text Available This paper investigates nominal recursive modification (RM in the L1 acquisition of French. Although recursion is considered the fundamental property of human languages, recursive self-embedding is found to be difficult for children in a variety of languages and constructions. Despite these challenges, the acquisition of RM proves to be resilient; acquirable even under severely degraded input conditions. From a minimalist perspective on the operations of narrow syntax, recursive embedding is essentially the application of a sequence of Merge operations (Chomsky 1995; Trotzke and Zwart 2014; therefore, given the universality of Merge, we do not expect to find cross-linguistic differences in how difficult recursion is. But if the challenging nature of recursion stems from factors which might differ from language to language, we expect different outcomes cross-linguistically. We compare new data from French to existing English data (Pérez-Leroux et al. 2012 in order to examine to what extent language-specific properties of RM structures determine the acquisition path. While children’s production differs significantly from their adult’s counterparts, we find no differences between French-speaking and English-speaking children. Our findings suggest that the challenging nature of recursion does not stem from the grammar itself and that what shapes the acquisition path is the interaction between universal properties of language and considerations not specific to language, namely computational efficiency.

  10. Excel2003 Formulas

    CERN Document Server

    Walkenbach, John

    2011-01-01

    Everything you need to know about* Mastering operators, error values, naming techniques, and absolute versus relative references* Debugging formulas and using the auditing tools* Importing and exporting XML files and mapping the data to specific cells* Using Excel 2003's rights management feature* Working magic with array formulas* Developing custom formulas to produce the results you needHere's the formula for Excel excellenceFormulas are the lifeblood of spreadsheets, and no one can bring a spreadsheet to life like John Walkenbach. In this detailed reference guide, he delves deeply into unde

  11. Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

    Science.gov (United States)

    Rosu, Grigore; Havelund, Klaus

    2001-01-01

    The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.

  12. Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

    Directory of Open Access Journals (Sweden)

    Thomas J. Marlowe

    1998-01-01

    Full Text Available Reliability is an important consideration in analyzing computer and other communication networks, but current techniques are extremely limited in the classes of graphs which can be analyzed efficiently. While Gilbert's formula establishes a theoretically elegant recursive relationship between the edge reliability of a graph and the reliability of its subgraphs, naive evaluation requires consideration of all sequences of deletions of individual vertices, and for many graphs has time complexity essentially Θ (N!. We discuss a general approach which significantly reduces complexity, encoding subgraph isomorphism in a finer partition by invariants, and recursing through the set of invariants.

  13. Explicit flow equations and recursion operator of the ncKP hierarchy

    International Nuclear Information System (INIS)

    He, Jingsong; Wang, Lihong; Tu, Junyi; Li, Xiaodong

    2011-01-01

    The explicit expression of the flow equations of the noncommutative Kadomtsev–Petviashvili (ncKP) hierarchy is derived. Compared with the flow equations of the KP hierarchy, our result shows that the additional terms in the flow equations of the ncKP hierarchy indeed consist of commutators of dynamical coordinates {u i }. The recursion operator for the flow equations under n-reduction is presented. Further, under 2-reduction, we calculate a nonlocal recursion operator Φ(2) of the noncommutative Korteweg–de Vries(ncKdV) hierarchy, which generates a hierarchy of local, higher-order flows. Thus we solve the open problem proposed by Olver and Sokolov (1998 Commun. Math. Phys. 193 245–68)

  14. Recursive construction of (J,L (J,L QC LDPC codes with girth 6

    Directory of Open Access Journals (Sweden)

    Mohammad Gholami

    2016-06-01

    Full Text Available ‎In this paper‎, ‎a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6‎. ‎For a J×L J×L exponent matrix E E‎, ‎the lower bound Q(E Q(E is obtained explicitly such that (J,L (J,L QC LDPC codes with girth at least 6 exist for any circulant permutation matrix (CPM size m≥Q(E m≥Q(E‎. ‎The results show that the exponent matrices constructed with our recursive algorithm have smaller lower-bound than the ones proposed recently with girth 6‎

  15. Tracking of Multiple Moving Sources Using Recursive EM Algorithm

    Directory of Open Access Journals (Sweden)

    Böhme Johann F

    2005-01-01

    Full Text Available We deal with recursive direction-of-arrival (DOA estimation of multiple moving sources. Based on the recursive EM algorithm, we develop two recursive procedures to estimate the time-varying DOA parameter for narrowband signals. The first procedure requires no prior knowledge about the source movement. The second procedure assumes that the motion of moving sources is described by a linear polynomial model. The proposed recursion updates the polynomial coefficients when a new data arrives. The suggested approaches have two major advantages: simple implementation and easy extension to wideband signals. Numerical experiments show that both procedures provide excellent results in a slowly changing environment. When the DOA parameter changes fast or two source directions cross with each other, the procedure designed for a linear polynomial model has a better performance than the general procedure. Compared to the beamforming technique based on the same parameterization, our approach is computationally favorable and has a wider range of applications.

  16. Inner and Outer Recursive Neural Networks for Chemoinformatics Applications.

    Science.gov (United States)

    Urban, Gregor; Subrahmanya, Niranjan; Baldi, Pierre

    2018-02-26

    Deep learning methods applied to problems in chemoinformatics often require the use of recursive neural networks to handle data with graphical structure and variable size. We present a useful classification of recursive neural network approaches into two classes, the inner and outer approach. The inner approach uses recursion inside the underlying graph, to essentially "crawl" the edges of the graph, while the outer approach uses recursion outside the underlying graph, to aggregate information over progressively longer distances in an orthogonal direction. We illustrate the inner and outer approaches on several examples. More importantly, we provide open-source implementations [available at www.github.com/Chemoinformatics/InnerOuterRNN and cdb.ics.uci.edu ] for both approaches in Tensorflow which can be used in combination with training data to produce efficient models for predicting the physical, chemical, and biological properties of small molecules.

  17. Convolution of second order linear recursive sequences II.

    Directory of Open Access Journals (Sweden)

    Szakács Tamás

    2017-12-01

    Full Text Available We continue the investigation of convolutions of second order linear recursive sequences (see the first part in [1]. In this paper, we focus on the case when the characteristic polynomials of the sequences have common root.

  18. Recursive stochastic effects in valley hybrid inflation

    Science.gov (United States)

    Levasseur, Laurence Perreault; Vennin, Vincent; Brandenberger, Robert

    2013-10-01

    Hybrid inflation is a two-field model where inflation ends because of a tachyonic instability, the duration of which is determined by stochastic effects and has important observational implications. Making use of the recursive approach to the stochastic formalism presented in [L. P. Levasseur, preceding article, Phys. Rev. D 88, 083537 (2013)], these effects are consistently computed. Through an analysis of backreaction, this method is shown to converge in the valley but points toward an (expected) instability in the waterfall. It is further shown that the quasistationarity of the auxiliary field distribution breaks down in the case of a short-lived waterfall. We find that the typical dispersion of the waterfall field at the critical point is then diminished, thus increasing the duration of the waterfall phase and jeopardizing the possibility of a short transition. Finally, we find that stochastic effects worsen the blue tilt of the curvature perturbations by an O(1) factor when compared with the usual slow-roll contribution.

  19. Recursive relations for processes with n photons of noncommutative QED

    International Nuclear Information System (INIS)

    Jafari, Abolfazl

    2007-01-01

    Recursion relations are derived in the sense of Berends-Giele for the multi-photon processes of noncommutative QED. The relations concern purely photonic processes as well as the processes with two fermions involved, both for arbitrary number of photons at tree level. It is shown that despite of the dependence of noncommutative vertices on momentum, in contrast to momentum-independent color factors of QCD, the recursion relation method can be employed for multi-photon processes of noncommutative QED

  20. COMPARISON OF RECURSIVE ESTIMATION TECHNIQUES FOR POSITION TRACKING RADIOACTIVE SOURCES

    International Nuclear Information System (INIS)

    Muske, K.; Howse, J.

    2000-01-01

    This paper compares the performance of recursive state estimation techniques for tracking the physical location of a radioactive source within a room based on radiation measurements obtained from a series of detectors at fixed locations. Specifically, the extended Kalman filter, algebraic observer, and nonlinear least squares techniques are investigated. The results of this study indicate that recursive least squares estimation significantly outperforms the other techniques due to the severe model nonlinearity

  1. Quantum rings and recursion relations in 2D quantum gravity

    International Nuclear Information System (INIS)

    Kachru, S.

    1992-01-01

    This paper discusses tachyon condensate perturbations to the action of the two-dimensional string theory corresponding to the c + 1 matrix model. These are shown to deform the action of the ground ring on the tachyon modules, confirming a conjecture of Witten. The ground ring structure is used to derive recursion relations which relate (N + 1) and N tachyon bulk scattering amplitudes. These recursion relations allow one to compute all bulk amplitudes

  2. THE ROSENBLUTH FORMULA

    Energy Technology Data Exchange (ETDEWEB)

    Yennie, D. R.

    1963-06-15

    The Rosenbluth formula, defined as the theoretical expression for the differential cross section for electronproton scattering under one-photon- exchange, is discussed. Electron-proton amd positron-proton scattering are compared using the formula. Some possible corrections to the Rosenbluth formula are discussed. The effects of nonelectromagnetic interactions and two-photon- exchange, with the possibility of Regge pole behavior, are also discussed. (R.E.U.)

  3. Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

    Energy Technology Data Exchange (ETDEWEB)

    Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)

    1996-12-31

    The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

  4. Recursive recovery of Markov transition probabilities from boundary value data

    Energy Technology Data Exchange (ETDEWEB)

    Patch, Sarah Kathyrn [Univ. of California, Berkeley, CA (United States)

    1994-04-01

    In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 x 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 x 2 x 2 problem, is solved.

  5. Zimmermann's forest formula, infrared divergences and the QCD beta function

    Directory of Open Access Journals (Sweden)

    Franz Herzog

    2018-01-01

    Full Text Available We review Zimmermann's forest formula, which solves Bogoliubov's recursive R-operation for the subtraction of ultraviolet divergences in perturbative Quantum Field Theory. We further discuss a generalisation of the R-operation which subtracts besides ultraviolet also Euclidean infrared divergences. This generalisation, which goes under the name of the R⁎-operation, can be used efficiently to compute renormalisation constants. We will discuss several results obtained by this method with focus on the QCD beta function at five loops as well as the application to hadronic Higgs boson decay rates at N4LO. This article summarizes a talk given at the Wolfhart Zimmermann Memorial Symposium.

  6. Recursion to food plants by free-ranging Bornean elephant

    Directory of Open Access Journals (Sweden)

    Megan English

    2015-08-01

    Full Text Available Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant’s preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when

  7. Recursion to food plants by free-ranging Bornean elephant.

    Science.gov (United States)

    English, Megan; Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne

    2015-01-01

    Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis) in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months) for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody) and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant's preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when quantities have

  8. Selected Baking Formulas.

    Science.gov (United States)

    Bogdany, Melvin

    This manual is designed to help baking students learn to use formulas in the preparation of baking products. Tested and proven formulas are, for the most part, standard ones with only slight modifications. The recipes are taken mainly from bakery product manufacturers and are presented in quantities suitable for school-shop use. Each recipe…

  9. Prebiotics in infant formula

    Science.gov (United States)

    Vandenplas, Yvan; Greef, Elisabeth De; Veereman, Gigi

    2014-01-01

    The gastrointestinal microbiota of breast-fed babies differ from classic standard formula fed infants. While mother's milk is rich in prebiotic oligosaccharides and contains small amounts of probiotics, standard infant formula doesn’t. Different prebiotic oligosaccharides are added to infant formula: galacto-oligosaccharides, fructo-oligosaccharide, polydextrose, and mixtures of these. There is evidence that addition of prebiotics in infant formula alters the gastrointestinal (GI) microbiota resembling that of breastfed infants. They are added to infant formula because of their presence in breast milk. Infants on these supplemented formula have a lower stool pH, a better stool consistency and frequency and a higher concentration of bifidobacteria in their intestine compared to infants on a non-supplemented standard formula. Since most studies suggest a trend for beneficial clinical effects, and since these ingredients are very safe, prebiotics bring infant formula one step closer to breastmilk, the golden standard. However, despite the fact that adverse events are rare, the evidence on prebiotics of a significant health benefit throughout the alteration of the gut microbiota is limited. PMID:25535999

  10. Formula misasi?! / Sten Soomlais

    Index Scriptorium Estoniae

    Soomlais, Sten

    2008-01-01

    Formula Student on kõrgkoolide masinaehituse ja/või autotehnika tudengite meeskondade vaheline iga-aastane tootearendusvõistlus, mis kujutab endast väikese vormelauto projekteerimist, ehitamist ja võidusõitmist ringrajal. Lisa: Formula Student Eestis

  11. Strong Generative Capacity and the Empirical Base of Linguistic Theory

    Directory of Open Access Journals (Sweden)

    Dennis Ott

    2017-09-01

    Full Text Available This Perspective traces the evolution of certain central notions in the theory of Generative Grammar (GG. The founding documents of the field suggested a relation between the grammar, construed as recursively enumerating an infinite set of sentences, and the idealized native speaker that was essentially equivalent to the relation between a formal language (a set of well-formed formulas and an automaton that recognizes strings as belonging to the language or not. But this early view was later abandoned, when the focus of the field shifted to the grammar's strong generative capacity as recursive generation of hierarchically structured objects as opposed to strings. The grammar is now no longer seen as specifying a set of well-formed expressions and in fact necessarily constructs expressions of any degree of intuitive “acceptability.” The field of GG, however, has not sufficiently acknowledged the significance of this shift in perspective, as evidenced by the fact that (informal and experimentally-controlled observations about string acceptability continue to be treated as bona fide data and generalizations for the theory of GG. The focus on strong generative capacity, it is argued, requires a new discussion of what constitutes valid empirical evidence for GG beyond observations pertaining to weak generation.

  12. Layer-splitting technique for testing the recursive scheme for multilayer shields gamma ray buildup factors

    International Nuclear Information System (INIS)

    Alkhatib, Sari F.; Park, Chang Je; Jeong, Hae Yong; Lee, Yongdeok

    2016-01-01

    Highlights: • A simple formalism is suggested for the recursive approach and then it is used to produce buildup factors for certain multilayer shields. • The newly layer-splitting technique is implemented on the studied cases for testing the suggested formalism performance. • The buildup factors are generated using cubic polynomial fitting functions that are produced based on previous well-acknowledge data. - Abstract: This study illustrates the implementation of the newly suggested layer-splitting testing technique. This technique is introduced in order to be implemented in examining suggested formalisms for the recursive scheme (or iterative scheme). The recursive scheme is a concept used in treating and producing the gamma ray buildup factors in the case of multilayer shields. The layer-splitting technique simply enforces the scheme to treat a single layer of one material as two separated layers with similar characteristics. Thus it subjects the scheme to an abnormal definition of the multilayer shield that will test its performance in treating the successive layers. Thus, it will act as a method of verification for the approximations and assumptions taken in consideration. A simple formalism was suggested for the recursive scheme then the splitting technique was implemented on it. The results of implementing both the suggested formalism and the splitting technique are then illustrated and discussed. Throughout this study, cubic polynomial fitting functions were used to generate the data of buildup factors for the basic single-media that constitute the multilayer shields understudy. This study is limited to the cases of multiple shields consisting of repeated consecutive thin layers of lead–water and iron–water shields for 1 MeV gamma rays. The produced results of the buildup factor values through the implementation of the suggested formalism showed good consistency with the Monte Carlo simulation results of Lin and Jiang work. In the implementation of

  13. Video game for learning and metaphorization of recursive algorithms

    Directory of Open Access Journals (Sweden)

    Ricardo Inacio Alvares Silva

    2013-09-01

    Full Text Available The learning of recursive algorithms in computer programming is problematic, because its execution and resolution is not natural to the thinking way people are trained and used to since young. As with other topics in algorithms, we use metaphors to make parallels between the abstract and the concrete to help in understanding the operation of recursive algorithms. However, the classic metaphors employed in this area, such as calculating factorial recursively and Towers of Hanoi game, may just confuse more or be insufficient. In this work, we produced a computer game to assist students in computer courses in learning recursive algorithms. It was designed to have regular video game characteristics, with narrative and classical gameplay elements, commonly found in this kind of product. Aiding to education occurs through metaphorization, or in other words, through experiences provided by game situations that refer to recursive algorithms. To this end, we designed and imbued in the game four valid metaphors related to the theory, and other minor references to the subject.

  14. Recursion method in the k-space representation

    International Nuclear Information System (INIS)

    Anlage, S.M.; Smith, D.L.

    1986-01-01

    We show that by using a unitary transformation to k space and the special-k-point method for evaluating Brillouin-zone sums, the recursion method can be very effectively applied to translationally invariant systems. We use this approach to perform recursion calculations for realistic tight-binding Hamiltonians which describe diamond- and zinc-blende-structure semiconductors. Projected densities of states for these Hamiltonians have band gaps and internal van Hove singularities. We calculate coefficients for 63 recursion levels exactly and for about 200 recursion levels to a good approximation. Comparisons are made for materials with different magnitude band gaps (diamond, Si, α-Sn). Comparison is also made between materials with one (e.g., diamond) and two (e.g., GaAs) band gaps. The asymptotic behavior of the recursion coefficients is studied by Fourier analysis. Band gaps in the projected density of states dominate the asymptotic behavior. Perturbation analysis describes the asymptotic behavior rather well. Projected densities of states are calculated using a very simple termination scheme. These densities of states compare favorably with the results of Gilat-Raubenheimer integration

  15. Fundamental formulas of physics

    CERN Document Server

    1960-01-01

    The republication of this book, unabridged and corrected, fills the need for a comprehensive work on fundamental formulas of mathematical physics. It ranges from simple operations to highly sophisticated ones, all presented most lucidly with terms carefully defined and formulas given completely. In addition to basic physics, pertinent areas of chemistry, astronomy, meteorology, biology, and electronics are also included.This is no mere listing of formulas, however. Mathematics is integrated into text, for the most part, so that each chapter stands as a brief summary or even short textbook of

  16. A Summation Formula for Macdonald Polynomials

    Science.gov (United States)

    de Gier, Jan; Wheeler, Michael

    2016-03-01

    We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases {t = 1} and {q = 0}, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and q-Whittaker polynomials.

  17. Infant Formula and Fluorosis

    Science.gov (United States)

    ... Private Wells Infant Formula Fluorosis Public Health Service Recommendation Water Operators & Engineers Water Fluoridation Additives Shortages of Fluoridation Additives Drinking Water Pipe Systems CDC-Sponsored Water Fluoridation Training Links to Other ...

  18. Formulae as Scientific Stories

    Science.gov (United States)

    Horsewell, Ian

    2017-01-01

    In science lessons many students struggle to apply the principles of rearranging formulae, even after coverage in maths. A structured approach is suggested that focuses on describing a narrative linking cause and effect before explicit mathematical terms are introduced.

  19. Abbott Infant Formula Recall

    Data.gov (United States)

    U.S. Department of Health & Human Services — This list includes products subject to recall since September 2010 related to infant formula distributed by Abbott. This list will be updated with publicly available...

  20. From twistor string theory to recursion relations

    International Nuclear Information System (INIS)

    Spradlin, Marcus; Volovich, Anastasia

    2009-01-01

    Witten's twistor string theory gives rise to an enigmatic formula 1 known as the 'connected prescription' for tree-level Yang-Mills scattering amplitudes. We derive a link representation for the connected prescription by Fourier transforming it to mixed coordinates in terms of both twistor and dual twistor variables. We show that it can be related to other representations of amplitudes by applying the global residue theorem to deform the contour of integration. For six and seven particles we demonstrate explicitly that certain contour deformations rewrite the connected prescription as the Britto-Cachazo-Feng-Witten representation, thereby establishing a concrete link between Witten's twistor string theory and the dual formulation for the S matrix of the N=4 SYM recently proposed by Arkani-Hamed et al. Other choices of integration contour also give rise to 'intermediate prescriptions'. We expect a similar though more intricate structure for more general amplitudes.

  1. On Recursion Operator of the q -KP Hierarchy

    International Nuclear Information System (INIS)

    Tian Ke-Lei; Zhu Xiao-Ming; He Jing-Song

    2016-01-01

    It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy. The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator θ, which originates from the Leibnitz rule of the quantum calculus. We further show that the n-reduction leads to a recursive scheme for these flow equations. The recursion operator for the flow equations of the q-KP hierarchy under the n-reduction is also derived. (paper)

  2. Recursive B-spline approximation using the Kalman filter

    Directory of Open Access Journals (Sweden)

    Jens Jauch

    2017-02-01

    Full Text Available This paper proposes a novel recursive B-spline approximation (RBA algorithm which approximates an unbounded number of data points with a B-spline function and achieves lower computational effort compared with previous algorithms. Conventional recursive algorithms based on the Kalman filter (KF restrict the approximation to a bounded and predefined interval. Conversely RBA includes a novel shift operation that enables to shift estimated B-spline coefficients in the state vector of a KF. This allows to adapt the interval in which the B-spline function can approximate data points during run-time.

  3. Analytical recursive method to ascertain multisite entanglement in doped quantum spin ladders

    Science.gov (United States)

    Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal

    2017-08-01

    We formulate an analytical recursive method to generate the wave function of doped short-range resonating valence bond (RVB) states as a tool to efficiently estimate multisite entanglement as well as other physical quantities in doped quantum spin ladders. We prove that doped RVB ladder states are always genuine multipartite entangled. Importantly, our results show that within specific doping concentration and model parameter regimes, the doped RVB state essentially characterizes the trends of genuine multiparty entanglement in the exact ground states of the Hubbard model with large on-site interactions, in the limit that yields the t -J Hamiltonian.

  4. Contributions to multidimensional quadrature formulas

    International Nuclear Information System (INIS)

    Guenther, C.

    1976-11-01

    The general objective of this paper is to construct multidimensional quadrature formulas similar to the Gaussian Quadrature Formulas in one dimension. The correspondence between these formulas and orthogonal and nonnegative polynomials is established. One part of the paper considers the construction of multidimensional quadrature formulas using only methods of algebraic geometry, on the other part it is tried to obtain results on quadrature formulas with real nodes and, if possible, with positive weights. The results include the existence of quadrature formulas, information on the number resp. on the maximum possible number of points in the formulas for given polynomial degree N and the construction of formulas. (orig.) [de

  5. Recursion-transform method for computing resistance of the complex resistor network with three arbitrary boundaries.

    Science.gov (United States)

    Tan, Zhi-Zhong

    2015-05-01

    We develop a general recursion-transform (R-T) method for a two-dimensional resistor network with a zero resistor boundary. As applications of the R-T method, we consider a significant example to illuminate the usefulness for calculating resistance of a rectangular m×n resistor network with a null resistor and three arbitrary boundaries, a problem never solved before, since Green's function techniques and Laplacian matrix approaches are invalid in this case. Looking for the exact calculation of the resistance of a binary resistor network is important but difficult in the case of an arbitrary boundary since the boundary is like a wall or trap which affects the behavior of finite network. In this paper we obtain several general formulas of resistance between any two nodes in a nonregular m×n resistor network in both finite and infinite cases. In particular, 12 special cases are given by reducing one of the general formulas to understand its applications and meanings, and an integral identity is found when we compare the equivalent resistance of two different structures of the same problem in a resistor network.

  6. Real-time recursive hyperspectral sample and band processing algorithm architecture and implementation

    CERN Document Server

    Chang, Chein-I

    2017-01-01

    This book explores recursive architectures in designing progressive hyperspectral imaging algorithms. In particular, it makes progressive imaging algorithms recursive by introducing the concept of Kalman filtering in algorithm design so that hyperspectral imagery can be processed not only progressively sample by sample or band by band but also recursively via recursive equations. This book can be considered a companion book of author’s books, Real-Time Progressive Hyperspectral Image Processing, published by Springer in 2016. Explores recursive structures in algorithm architecture Implements algorithmic recursive architecture in conjunction with progressive sample and band processing Derives Recursive Hyperspectral Sample Processing (RHSP) techniques according to Band-Interleaved Sample/Pixel (BIS/BIP) acquisition format Develops Recursive Hyperspectral Band Processing (RHBP) techniques according to Band SeQuential (BSQ) acquisition format for hyperspectral data.

  7. A recursion relation for coefficients of fractional parentage in the seniority scheme

    International Nuclear Information System (INIS)

    Evans, T.

    1985-01-01

    A recursion relations for coefficients as fractional parentage in the seniority scheme are discussed. Determinated dependence of recursion relations from the particle number permit to evaluate matrix elements of creation and annihilation operators for fermions or bosons. 10 refs. (author)

  8. Numerical evaluation of general n-dimensional integrals by the repeated use of Newton-Cotes formulas

    International Nuclear Information System (INIS)

    Nihira, Takeshi; Iwata, Tadao.

    1992-07-01

    The composites Simpson's rule is extended to n-dimensional integrals with variable limits. This extension is illustrated by means of the recursion relation of n-fold series. The structure of calculation by the Newton-Cotes formulas for n-dimensional integrals is clarified with this method. A quadrature formula corresponding to the Newton-Cotes formulas can be readily constructed. The results computed for some examples are given, and the error estimates for two or three dimensional integrals are described using the error term. (author)

  9. Active control versus recursive backstepping control of a chaotic ...

    African Journals Online (AJOL)

    In this paper active controllers and recursive backstepping controllers are designed for a third order chaotic system. The performances of these controllers in the control of the dynamics of the chaotic system are investigated numerically and are found to be effective. Comparison of their transient performances show that the ...

  10. Recursive form of general limited memory variable metric methods

    Czech Academy of Sciences Publication Activity Database

    Lukšan, Ladislav; Vlček, Jan

    2013-01-01

    Roč. 49, č. 2 (2013), s. 224-235 ISSN 0023-5954 Institutional support: RVO:67985807 Keywords : unconstrained optimization * large scale optimization * limited memory methods * variable metric updates * recursive matrix formulation * algorithms Subject RIV: BA - General Mathematics Impact factor: 0.563, year: 2013 http://dml.cz/handle/10338.dmlcz/143365

  11. Recursive representation of the torus 1-point conformal block

    Science.gov (United States)

    Hadasz, Leszek; Jaskólski, Zbigniew; Suchanek, Paulina

    2010-01-01

    The recursive relation for the 1-point conformal block on a torus is derived and used to prove the identities between conformal blocks recently conjectured by Poghossian in [1]. As an illustration of the efficiency of the recurrence method the modular invariance of the 1-point Liouville correlation function is numerically analyzed.

  12. The Free Energy in the Derrida-Retaux Recursive Model

    Science.gov (United States)

    Hu, Yueyun; Shi, Zhan

    2018-05-01

    We are interested in a simple max-type recursive model studied by Derrida and Retaux (J Stat Phys 156:268-290, 2014) in the context of a physics problem, and find a wide range for the exponent in the free energy in the nearly supercritical regime.

  13. Recursive subspace identification for in flight modal analysis of airplanes

    OpenAIRE

    De Cock , Katrien; Mercère , Guillaume; De Moor , Bart

    2006-01-01

    International audience; In this paper recursive subspace identification algorithms are applied to track the modal parameters of airplanes on-line during test flights. The ability to track changes in the damping ratios and the influence of the forgetting factor are studied through simulations.

  14. Differential constraints for bounded recursive identification with multivariate splines

    NARCIS (Netherlands)

    De Visser, C.C.; Chu, Q.P.; Mulder, J.A.

    2011-01-01

    The ability to perform online model identification for nonlinear systems with unknown dynamics is essential to any adaptive model-based control system. In this paper, a new differential equality constrained recursive least squares estimator for multivariate simplex splines is presented that is able

  15. Predicate Transformers for Recursive Procedures with Local Variables

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1999-01-01

    The weakest precondition semantics of recursive procedures with local variables are developed for an imperative language with demonic and angelic operators for unbounded nondeterminate choice. This does not require stacking of local variables. The formalism serves as a foundation for a proof rule

  16. Denotational semantics of recursive types in synthetic guarded domain theory

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Paviotti, Marco

    2016-01-01

    typed lambda calculus with fixed points). This model was intensional in that it could distinguish between computations computing the same result using a different number of fixed point unfoldings. In this work we show how also programming languages with recursive types can be given denotational...

  17. A bijection between phylogenetic trees and plane oriented recursive trees

    OpenAIRE

    Prodinger, Helmut

    2017-01-01

    Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.

  18. Step-indexed Kripke models over recursive worlds

    DEFF Research Database (Denmark)

    Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan

    2011-01-01

    worlds that are recursively defined in a category of metric spaces. In this paper, we broaden the scope of this technique from the original domain-theoretic setting to an elementary, operational one based on step indexing. The resulting method is widely applicable and leads to simple, succinct models...

  19. Efficient Integrity Checking for Databases with Recursive Views

    DEFF Research Database (Denmark)

    Martinenghi, Davide; Christiansen, Henning

    2005-01-01

    Efficient and incremental maintenance of integrity constraints involving recursive views is a difficult issue that has received some attention in the past years, but for which no widely accepted solution exists yet. In this paper a technique is proposed for compiling such integrity constraints in...... approaches have not achieved comparable optimization with the same level of generality....

  20. Theory of Mind, linguistic recursion and autism spectrum disorder

    DEFF Research Database (Denmark)

    Polyanskaya, Irina; Blackburn, Patrick Rowan; Braüner, Torben

    2017-01-01

    In this paper we give the motivation for and discuss the design of an experiment investigating whether the acquisition of linguistic recur-sion helps children with Autism Spectrum Disorder (ASD) develop second-order false belief skills. We first present the relevant psycho-logical concepts (in...

  1. A metric model of lambda calculus with guarded recursion

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence....

  2. Symbolic Reachability for Process Algebras with Recursive Data Types

    NARCIS (Netherlands)

    Blom, Stefan; van de Pol, Jan Cornelis; Fitzgerald, J.S.; Haxthausen, A.E.; Yenigun, H.

    2008-01-01

    In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our

  3. Recursivity: A Working Paper on Rhetoric and "Mnesis"

    Science.gov (United States)

    Stormer, Nathan

    2013-01-01

    This essay proposes the genealogical study of remembering and forgetting as recursive rhetorical capacities that enable discourse to place itself in an ever-changing present. "Mnesis" is a meta-concept for the arrangements of remembering and forgetting that enable rhetoric to function. Most of the essay defines the materiality of "mnesis", first…

  4. Consumption-Portfolio Optimization with Recursive Utility in Incomplete Markets

    DEFF Research Database (Denmark)

    Kraft, Holger; Seifried, Frank Thomas; Steffensen, Mogens

    2013-01-01

    In an incomplete market, we study the optimal consumption-portfolio decision of an investor with recursive preferences of Epstein–Zin type. Applying a classical dynamic programming approach, we formulate the associated Hamilton–Jacobi–Bellman equation and provide a suitable verification theorem...

  5. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.

    2012-01-01

    is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive

  6. Pedestrian Path Prediction with Recursive Bayesian Filters: A Comparative Study

    NARCIS (Netherlands)

    Schneider, N.; Gavrila, D.M.

    2013-01-01

    In the context of intelligent vehicles, we perform a comparative study on recursive Bayesian filters for pedestrian path prediction at short time horizons (< 2s). We consider Extended Kalman Filters (EKF) based on single dynamical models and Interacting Multiple Models (IMM) combining several such

  7. Fuel formula for lighters

    Energy Technology Data Exchange (ETDEWEB)

    Iwayama, I.; Iwayama, A.

    1982-04-10

    A fuel formula that includes a homogenous mixture of benzine, aromatic ether oils, perfume and other perfuming agents, as well as the lowest possible aliphatic alcohol as a component solvent, surfactant, and possibly, a soluble pigment that colors the formula an appropriate color. This formula is used as an aromatic fuel for cigarette lights. The ether oils can be musk, amber, camomille, lavender, mint, anise, rose, camphor, and other aromatic oils; the perfuming agents are: geraniol, linalool, menthol, camphor, benzyl or phenetyl alcohols, phenylacetaldehyde, vanillin, coumarin, and so forth; the pigments are: beta-carotene, sudan dyes, etc.; the low aliphatic alcohols are EtOH, iso-PrOH. Example: 70 parts benzine, 10 parts EtOH, 15 parts oxide mezithylene and 5 parts borneol form a clear liquid that has a camphor aroma when it is lit.

  8. Young child formula

    DEFF Research Database (Denmark)

    Hojsak, Iva; Bronsky, Jiri; Campoy, Cristina

    2018-01-01

    Young child formulae (YCF) are milk-based drinks or plant protein-based formulae intended to partially satisfy the nutritional requirements of young children ages 1 to 3 years. Although widely available on the market, their composition is, however, not strictly regulated and health effects have...... not been systematically studied. Therefore, the European Society for Paediatric Gastroenterology, Hepatology and Nutrition (ESPGHAN) Committee on Nutrition (CoN) performed a systematic review of the literature to review the composition of YCF and consider their role in the diet of young children...... for the routine use of YCF in children from 1 to 3 years of life, but they can be used as part of a strategy to increase the intake of iron, vitamin D, and n-3 PUFA and decrease the intake of protein compared with unfortified cow's milk. Follow-on formulae can be used for the same purpose. Other strategies...

  9. Electromagnetic shielding formulae

    International Nuclear Information System (INIS)

    Dahlberg, E.

    1979-02-01

    This addendum to an earlier collection of electromagnetic shielding formulae (TRITA-EPP-75-27) contains simple transfer matrices suitable for calculating the quasistatic shielding efficiency for multiple transverse-field and axial-field cylindrical and spherical shields, as well as for estimating leakage fields from long coaxial cables and the normal-incidence transmission of a plane wave through a multiple plane shield. The differences and similarities between these cases are illustrated by means of equivalent circuits and transmission line analogies. The addendum also includes a discussion of a possible heuristic improvement of some shielding formulae. (author)

  10. Third order trace formula

    Indian Academy of Sciences (India)

    N. Centre for Advanced Scientific Research, Bangalore 560 064, India. 2Indian Institute of ... for rational functions φ with poles off R. In [5,16], Koplienko's trace formula was derived ... be a sequence of complex numbers such that ..... Again if we set the sum of the second and fourth term inside the integral in (2.3) to be. I2 ≡.

  11. The Jacobi inversion formula

    NARCIS (Netherlands)

    Koekoek, J.; Koekoek, R.

    1999-01-01

    We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to the weight function [Enlarge Image] where >-1, ß>-1M=0 and N=0. In order to find explicit formulas for the coefficients of these differential equations we

  12. Chen's inversion formula

    International Nuclear Information System (INIS)

    Hughes, B.D.; Frankel, N.E.; Ninham, B.W.

    1990-01-01

    An alternative view is presented of the Chen's generalization of a formula of classic algebraic number theory, based on the Mellin transformation and Reimann's zeta function. The advantages of the Mellin transform, as a method with a primary role in asymptotic analysis, are outlined. 10 refs

  13. Parallel Recursive State Compression for Free

    NARCIS (Netherlands)

    Laarman, Alfons; van de Pol, Jan Cornelis; Weber, M.; Groce, Alex; Musuvathi, Madanlal

    2011-01-01

    State space exploration is a basic solution to many verification problems, but is limited by time and memory usage. Due to physical limits in modern CPUs, sequential exploration algorithms do not benefit automatically from the next generation of processors anymore, hence the need for multi-core

  14. A new recursion operator for Adler's equation in the Viallet form

    International Nuclear Information System (INIS)

    Mikhailov, A.V.; Wang, J.P.

    2011-01-01

    For Adler's equation in the Viallet form and Yamilov's discretisation of the Krichever-Novikov equation we present new recursion and Hamiltonian operators. This new recursion operator and the recursion operator found in [A.V. Mikhailov, et al., Theor. Math. Phys. 167 (2011) 421, (arXiv:1004.5346)] satisfy the spectral curve associated with the equation. -- Highlights: → We present new recursion and Hamiltonian operators for the equation. → We establish the relation between this recursion operator and the known one. → The relation is given by the spectral curve associated with the equation.

  15. Reliability evaluation of non-reparable three-state systems using Markov model and its comparison with the UGF and the recursive methods

    International Nuclear Information System (INIS)

    Pourkarim Guilani, Pedram; Sharifi, Mani; Niaki, S.T.A.; Zaretalab, Arash

    2014-01-01

    In multi-state systems (MSS) reliability problems, it is assumed that the components of each subsystem have different performance rates with certain probabilities. This leads into extensive computational efforts involved in using the commonly employed universal generation function (UGF) and the recursive algorithm to obtain reliability of systems consisting of a large number of components. This research deals with evaluating non-repairable three-state systems reliability and proposes a novel method based on a Markov process for which an appropriate state definition is provided. It is shown that solving the derived differential equations significantly reduces the computational time compared to the UGF and the recursive algorithm. - Highlights: • Reliability evaluation of a non-repairable three-state systems is aimed. • A novel method based on a Markov process is proposed. • An appropriate state definition is provided. • Computational time is significantly less compared to the ones in the UGF and the recursive methods

  16. Observation of [Formula: see text] and [Formula: see text] decays.

    Science.gov (United States)

    Aaij, R; Adeva, B; Adinolfi, M; Ajaltouni, Z; Akar, S; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves, A A; Amato, S; Amerio, S; Amhis, Y; An, L; Anderlini, L; Andreassi, G; Andreotti, M; Andrews, J E; Appleby, R B; Archilli, F; d'Argent, P; Arnau Romeu, J; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Babuschkin, I; Bachmann, S; Back, J J; Badalov, A; Baesso, C; Baker, S; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Baszczyk, M; Batozskaya, V; Batsukh, B; Battista, V; Bay, A; Beaucourt, L; Beddow, J; Bedeschi, F; Bediaga, I; Bel, L J; Bellee, V; Belloli, N; Belous, K; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bertolin, A; Betancourt, C; Betti, F; Bettler, M-O; van Beuzekom, M; Bezshyiko, Ia; Bifani, S; Billoir, P; Bird, T; Birnkraut, A; Bitadze, A; Bizzeti, A; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Boettcher, T; Bondar, A; Bondar, N; Bonivento, W; Bordyuzhin, I; Borgheresi, A; Borghi, S; Borisyak, M; Borsato, M; Bossu, F; Boubdir, M; Bowcock, T J V; Bowen, E; Bozzi, C; Braun, S; Britsch, M; Britton, T; Brodzicka, J; Buchanan, E; Burr, C; Bursche, A; Buytaert, J; Cadeddu, S; Calabrese, R; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D H; Capriotti, L; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carniti, P; Carson, L; Carvalho Akiba, K; Casse, G; Cassina, L; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cavallero, G; Cenci, R; Charles, M; Charpentier, Ph; Chatzikonstantinidis, G; Chefdeville, M; Chen, S; Cheung, S-F; Chobanova, V; Chrzaszcz, M; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coco, V; Cogan, J; Cogneras, E; Cogoni, V; Cojocariu, L; Collazuol, G; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombs, G; Coquereau, S; Corti, G; Corvo, M; Costa Sobral, C M; Couturier, B; Cowan, G A; Craik, D C; Crocombe, A; Cruz Torres, M; Cunliffe, S; Currie, R; D'Ambrosio, C; Da Cunha Marinho, F; Dall'Occo, E; Dalseno, J; David, P N Y; Davis, A; De Aguiar Francisco, O; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Serio, M; De Simone, P; Dean, C-T; Decamp, D; Deckenhoff, M; Del Buono, L; Demmer, M; Dendek, A; Derkach, D; Deschamps, O; Dettori, F; Dey, B; Di Canto, A; Dijkstra, H; Dordei, F; Dorigo, M; Dosil Suárez, A; Dovbnya, A; Dreimanis, K; Dufour, L; Dujany, G; Dungs, K; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Déléage, N; Easo, S; Ebert, M; Egede, U; Egorychev, V; Eidelman, S; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; Ely, S; Esen, S; Evans, H M; Evans, T; Falabella, A; Farley, N; Farry, S; Fay, R; Fazzini, D; Ferguson, D; Fernandez Prieto, A; Ferrari, F; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fini, R A; Fiore, M; Fiorini, M; Firlej, M; Fitzpatrick, C; Fiutowski, T; Fleuret, F; Fohl, K; Fontana, M; Fontanelli, F; Forshaw, D C; Forty, R; Franco Lima, V; Frank, M; Frei, C; Fu, J; Furfaro, E; Färber, C; Gallas Torreira, A; Galli, D; Gallorini, S; Gambetta, S; Gandelman, M; Gandini, P; Gao, Y; Garcia Martin, L M; García Pardiñas, J; Garra Tico, J; Garrido, L; Garsed, P J; Gascon, D; Gaspar, C; Gavardi, L; Gazzoni, G; Gerick, D; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gianì, S; Gibson, V; Girard, O G; Giubega, L; Gizdov, K; Gligorov, V V; Golubkov, D; Golutvin, A; Gomes, A; Gorelov, I V; Gotti, C; Govorkova, E; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graverini, E; Graziani, G; Grecu, A; Griffith, P; Grillo, L; Gruberg Cazon, B R; Grünberg, O; Gushchin, E; Guz, Yu; Gys, T; Göbel, C; Hadavizadeh, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Haines, S C; Hall, S; Hamilton, B; Han, X; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hatch, M; He, J; Head, T; Heister, A; Hennessy, K; Henrard, P; Henry, L; Hernando Morata, J A; van Herwijnen, E; Heß, M; Hicheur, A; Hill, D; Hombach, C; Hopchev, H; Hulsbergen, W; Humair, T; Hushchyn, M; Hussain, N; Hutchcroft, D; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jalocha, J; Jans, E; Jawahery, A; Jiang, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Jurik, N; Kandybei, S; Kanso, W; Karacson, M; Kariuki, J M; Karodia, S; Kecke, M; Kelsey, M; Kenyon, I R; Kenzie, M; Ketel, T; Khairullin, E; Khanji, B; Khurewathanakul, C; Kirn, T; Klaver, S; Klimaszewski, K; Koliiev, S; Kolpin, M; Komarov, I; Koopman, R F; Koppenburg, P; Kosmyntseva, A; Kozachuk, A; Kozeiha, M; Kravchuk, L; Kreplin, K; Kreps, M; Krokovny, P; Kruse, F; Krzemien, W; Kucewicz, W; Kucharczyk, M; Kudryavtsev, V; Kuonen, A K; Kurek, K; Kvaratskheliya, T; Lacarrere, D; Lafferty, G; Lai, A; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J-P; Leflat, A; Lefrançois, J; Lefèvre, R; Lemaitre, F; Lemos Cid, E; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Likhomanenko, T; Lindner, R; Linn, C; Lionetto, F; Liu, B; Liu, X; Loh, D; Longstaff, I; Lopes, J H; Lucchesi, D; Lucio Martinez, M; Luo, H; Lupato, A; Luppi, E; Lupton, O; Lusiani, A; Lyu, X; Machefert, F; Maciuc, F; Maev, O; Maguire, K; Malde, S; Malinin, A; Maltsev, T; Manca, G; Mancinelli, G; Manning, P; Maratas, J; Marchand, J F; Marconi, U; Marin Benito, C; Marino, P; Marks, J; Martellotti, G; Martin, M; Martinelli, M; Martinez Santos, D; Martinez Vidal, F; Martins Tostes, D; Massacrier, L M; Massafferri, A; Matev, R; Mathad, A; Mathe, Z; Matteuzzi, C; Mauri, A; Maurin, B; Mazurov, A; McCann, M; McCarthy, J; McNab, A; McNulty, R; Meadows, B; Meier, F; Meissner, M; Melnychuk, D; Merk, M; Merli, A; Michielin, E; Milanes, D A; Minard, M-N; Mitzel, D S; Mogini, A; Molina Rodriguez, J; Monroy, I A; Monteil, S; Morandin, M; Morawski, P; Mordà, A; Morello, M J; Moron, J; Morris, A B; Mountain, R; Muheim, F; Mulder, M; Mussini, M; Müller, D; Müller, J; Müller, K; Müller, V; Naik, P; Nakada, T; Nandakumar, R; Nandi, A; Nasteva, I; Needham, M; Neri, N; Neubert, S; Neufeld, N; Neuner, M; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Nieswand, S; Niet, R; Nikitin, N; Nikodem, T; Novoselov, A; O'Hanlon, D P; Oblakowska-Mucha, A; Obraztsov, V; Ogilvy, S; Oldeman, R; Onderwater, C J G; Otalora Goicochea, J M; Otto, A; Owen, P; Oyanguren, A; Pais, P R; Palano, A; Palombo, F; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Pappalardo, L L; Parker, W; Parkes, C; Passaleva, G; Pastore, A; Patel, G D; Patel, M; Patrignani, C; Pearce, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perret, P; Pescatore, L; Petridis, K; Petrolini, A; Petrov, A; Petruzzo, M; Picatoste Olloqui, E; Pietrzyk, B; Pikies, M; Pinci, D; Pistone, A; Piucci, A; Playfer, S; Plo Casasus, M; Poikela, T; Polci, F; Poluektov, A; Polyakov, I; Polycarpo, E; Pomery, G J; Popov, A; Popov, D; Popovici, B; Poslavskii, S; Potterat, C; Price, E; Price, J D; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Quagliani, R; Rachwal, B; Rademacker, J H; Rama, M; Ramos Pernas, M; Rangel, M S; Raniuk, I; Ratnikov, F; Raven, G; Redi, F; Reichert, S; Dos Reis, A C; Remon Alepuz, C; Renaudin, V; Ricciardi, S; Richards, S; Rihl, M; Rinnert, K; Rives Molina, V; Robbe, P; Rodrigues, A B; Rodrigues, E; Rodriguez Lopez, J A; Rodriguez Perez, P; Rogozhnikov, A; Roiser, S; Rollings, A; Romanovskiy, V; Romero Vidal, A; Ronayne, J W; Rotondo, M; Rudolph, M S; Ruf, T; Ruiz Valls, P; Saborido Silva, J J; Sadykhov, E; Sagidova, N; Saitta, B; Salustino Guimaraes, V; Sanchez Mayordomo, C; Sanmartin Sedes, B; Santacesaria, R; Santamarina Rios, C; Santimaria, M; Santovetti, E; Sarti, A; Satriano, C; Satta, A; Saunders, D M; Savrina, D; Schael, S; Schellenberg, M; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmelzer, T; Schmidt, B; Schneider, O; Schopper, A; Schubert, K; Schubiger, M; Schune, M-H; Schwemmer, R; Sciascia, B; Sciubba, A; Semennikov, A; Sergi, A; Serra, N; Serrano, J; Sestini, L; Seyfert, P; Shapkin, M; Shapoval, I; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, V; Siddi, B G; Silva Coutinho, R; Silva de Oliveira, L; Simi, G; Simone, S; Sirendi, M; Skidmore, N; Skwarnicki, T; Smith, E; Smith, I T; Smith, J; Smith, M; Snoek, H; Sokoloff, M D; Soler, F J P; Souza De Paula, B; Spaan, B; Spradlin, P; Sridharan, S; Stagni, F; Stahl, M; Stahl, S; Stefko, P; Stefkova, S; Steinkamp, O; Stemmle, S; Stenyakin, O; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Stracka, S; Straticiuc, M; Straumann, U; Sun, L; Sutcliffe, W; Swientek, K; Syropoulos, V; Szczekowski, M; Szumlak, T; T'Jampens, S; Tayduganov, A; Tekampe, T; Tellarini, G; Teubert, F; Thomas, E; van Tilburg, J; Tilley, M J; Tisserand, V; Tobin, M; Tolk, S; Tomassetti, L; Tonelli, D; Topp-Joergensen, S; Toriello, F; Tournefier, E; Tourneur, S; Trabelsi, K; Traill, M; Tran, M T; Tresch, M; Trisovic, A; Tsaregorodtsev, A; Tsopelas, P; Tully, A; Tuning, N; Ukleja, A; Ustyuzhanin, A; Uwer, U; Vacca, C; Vagnoni, V; Valassi, A; Valat, S; Valenti, G; Vallier, A; Vazquez Gomez, R; Vazquez Regueiro, P; Vecchi, S; van Veghel, M; Velthuis, J J; Veltri, M; Veneziano, G; Venkateswaran, A; Vernet, M; Vesterinen, M; Viaud, B; Vieira, D; Vieites Diaz, M; Viemann, H; Vilasis-Cardona, X; Vitti, M; Volkov, V; Vollhardt, A; Voneki, B; Vorobyev, A; Vorobyev, V; Voß, C; de Vries, J A; Vázquez Sierra, C; Waldi, R; Wallace, C; Wallace, R; Walsh, J; Wang, J; Ward, D R; Wark, H M; Watson, N K; Websdale, D; Weiden, A; Whitehead, M; Wicht, J; Wilkinson, G; Wilkinson, M; Williams, M; Williams, M P; Williams, M; Williams, T; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wormser, G; Wotton, S A; Wraight, K; Wyllie, K; Xie, Y; Xing, Z; Xu, Z; Yang, Z; Yin, H; Yu, J; Yuan, X; Yushchenko, O; Zarebski, K A; Zavertyaev, M; Zhang, L; Zhang, Y; Zhang, Y; Zhelezov, A; Zheng, Y; Zhokhov, A; Zhu, X; Zhukov, V; Zucchelli, S

    2017-01-01

    The decays [Formula: see text] and [Formula: see text] are observed for the first time using a data sample corresponding to an integrated luminosity of 3.0 fb[Formula: see text], collected by the LHCb experiment in proton-proton collisions at the centre-of-mass energies of 7 and 8[Formula: see text]. The branching fractions relative to that of [Formula: see text] are measured to be [Formula: see text]where the first uncertainties are statistical and the second are systematic.

  17. Density of states, Poisson's formula of summation and Walfisz's formula

    International Nuclear Information System (INIS)

    Fucho, P.

    1980-06-01

    Using Poisson's formula for summation, we obtain an expression for density of states of d-dimensional scalar Helmoholtz's equation under various boundary conditions. Likewise, we also obtain formulas of Walfisz's type. It becomes evident that the formulas obtained by Pathria et al. in connection with ideal bosons in a finite system are exactly the same as those obtained by utilizing the formulas for density of states. (author)

  18. Algebraic computability and enumeration models recursion theory and descriptive complexity

    CERN Document Server

    Nourani, Cyrus F

    2016-01-01

    This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...

  19. EEG and MEG source localization using recursively applied (RAP) MUSIC

    Energy Technology Data Exchange (ETDEWEB)

    Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [University of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

    1996-12-31

    The multiple signal characterization (MUSIC) algorithm locates multiple asynchronous dipolar sources from electroencephalography (EEG) and magnetoencephalography (MEG) data. A signal subspace is estimated from the data, then the algorithm scans a single dipole model through a three-dimensional head volume and computes projections onto this subspace. To locate the sources, the user must search the head volume for local peaks in the projection metric. Here we describe a novel extension of this approach which we refer to as RAP (Recursively APplied) MUSIC. This new procedure automatically extracts the locations of the sources through a recursive use of subspace projections, which uses the metric of principal correlations as a multidimensional form of correlation analysis between the model subspace and the data subspace. The dipolar orientations, a form of `diverse polarization,` are easily extracted using the associated principal vectors.

  20. Recursive utility in a Markov environment with stochastic growth.

    Science.gov (United States)

    Hansen, Lars Peter; Scheinkman, José A

    2012-07-24

    Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility.

  1. BPSK Receiver Based on Recursive Adaptive Filter with Remodulation

    Directory of Open Access Journals (Sweden)

    N. Milosevic

    2011-12-01

    Full Text Available This paper proposes a new binary phase shift keying (BPSK signal receiver intended for reception under conditions of significant carrier frequency offsets. The recursive adaptive filter with least mean squares (LMS adaptation is used. The proposed receiver has a constant, defining the balance between the recursive and the nonrecursive part of the filter, whose proper choice allows a simple construction of the receiver. The correct choice of this parameter could result in unitary length of the filter. The proposed receiver has performance very close to the performance of the BPSK receiver with perfect frequency synchronization, in a wide range of frequency offsets (plus/minus quarter of the signal bandwidth. The results obtained by the software simulation are confirmed by the experimental results measured on the receiver realized with the universal software radio peripheral (USRP, with the baseband signal processing at personal computer (PC.

  2. Recursive Neural Networks in Quark/Gluon Tagging

    CERN Multimedia

    CERN. Geneva

    2018-01-01

    Vidyo contribution Based on the natural tree-like structure of jet sequential clustering, the recursive neural networks (RecNNs) embed jet clustering history recursively as in natural language processing. We explore the performance of RecNN in quark/gluon discrimination. The results show that RecNNs work better than the baseline BDT by a few percent in gluon rejection at the working point of 50\\% quark acceptance. We also experimented on some relevant aspects which might influence the performance of networks. It shows that even only particle flow identification as input feature without any extra information on momentum or angular position is already giving a fairly good result, which indicates that most of the information for q/g discrimination is already included in the tree-structure itself.

  3. Study of recursive model for pole-zero cancellation circuit

    International Nuclear Information System (INIS)

    Zhou Jianbin; Zhou Wei; Hong Xu; Hu Yunchuan; Wan Xinfeng; Du Xin; Wang Renbo

    2014-01-01

    The output of charge sensitive amplifier (CSA) is a negative exponential signal with long decay time which will result in undershoot after C-R differentiator. Pole-zero cancellation (PZC) circuit is often applied to eliminate undershoot in many radiation detectors. However, it is difficult to use a zero created by PZC circuit to cancel a pole in CSA output signal accurately because of the influences of electronic components inherent error and environmental factors. A novel recursive model for PZC circuit is presented based on Kirchhoff's Current Law (KCL) in this paper. The model is established by numerical differentiation algorithm between the input and the output signal. Some simulation experiments for a negative exponential signal are carried out using Visual Basic for Application (VBA) program and a real x-ray signal is also tested. Simulated results show that the recursive model can reduce the time constant of input signal and eliminate undershoot. (authors)

  4. ETHICS AND KNOWLEDGE OF RECURSIVITY IN PSYCHOLOGISTS TRAINING

    Directory of Open Access Journals (Sweden)

    Ramón Sanz Ferramola

    2008-07-01

    Full Text Available This work deals with the characterization of psychology as a science and profession. Thisfeature is part of the Argentine academic tradition which goes from the origins of psychology as an undergraduate program by the end of the 1950s to the present day. In relation to this topic, four issues are analysed: a the knowledges of psychology showing the necessity of two epistemic dimensions closely related, namely the discursivity and recursivity, or knowledge and metaknowledge, b the role of psychology as a profession within the praxis, rather than in the poiesis, according to the Greek distinction between the implications of these two modalities of the “doing”, c the concurrence and difference of ethics and deontology, their roles, bounds and potentialities within the psychological field in general, and that of scientific-professional morality in particular, and d the definition and characterization of ethics and epistemology as knowledge of recursivity in psychologists’ training.

  5. Recursive Bayesian recurrent neural networks for time-series modeling.

    Science.gov (United States)

    Mirikitani, Derrick T; Nikolaev, Nikolay

    2010-02-01

    This paper develops a probabilistic approach to recursive second-order training of recurrent neural networks (RNNs) for improved time-series modeling. A general recursive Bayesian Levenberg-Marquardt algorithm is derived to sequentially update the weights and the covariance (Hessian) matrix. The main strengths of the approach are a principled handling of the regularization hyperparameters that leads to better generalization, and stable numerical performance. The framework involves the adaptation of a noise hyperparameter and local weight prior hyperparameters, which represent the noise in the data and the uncertainties in the model parameters. Experimental investigations using artificial and real-world data sets show that RNNs equipped with the proposed approach outperform standard real-time recurrent learning and extended Kalman training algorithms for recurrent networks, as well as other contemporary nonlinear neural models, on time-series modeling.

  6. Functional Dual Adaptive Control with Recursive Gaussian Process Model

    International Nuclear Information System (INIS)

    Prüher, Jakub; Král, Ladislav

    2015-01-01

    The paper deals with dual adaptive control problem, where the functional uncertainties in the system description are modelled by a non-parametric Gaussian process regression model. Current approaches to adaptive control based on Gaussian process models are severely limited in their practical applicability, because the model is re-adjusted using all the currently available data, which keeps growing with every time step. We propose the use of recursive Gaussian process regression algorithm for significant reduction in computational requirements, thus bringing the Gaussian process-based adaptive controllers closer to their practical applicability. In this work, we design a bi-criterial dual controller based on recursive Gaussian process model for discrete-time stochastic dynamic systems given in an affine-in-control form. Using Monte Carlo simulations, we show that the proposed controller achieves comparable performance with the full Gaussian process-based controller in terms of control quality while keeping the computational demands bounded. (paper)

  7. One loop integration with hypergeometric series by using recursion relations

    International Nuclear Information System (INIS)

    Watanabe, Norihisa; Kaneko, Toshiaki

    2014-01-01

    General one-loop integrals with arbitrary mass and kinematical parameters in d-dimensional space-time are studied. By using Bernstein theorem, a recursion relation is obtained which connects (n + 1)-point to n-point functions. In solving this recursion relation, we have shown that one-loop integrals are expressed by a newly defined hypergeometric function, which is a special case of Aomoto-Gelfand hypergeometric functions. We have also obtained coefficients of power series expansion around 4-dimensional space-time for two-, three- and four-point functions. The numerical results are compared with ''LoopTools'' for the case of two- and three-point functions as examples

  8. Model-based dispersive wave processing: A recursive Bayesian solution

    International Nuclear Information System (INIS)

    Candy, J.V.; Chambers, D.H.

    1999-01-01

    Wave propagation through dispersive media represents a significant problem in many acoustic applications, especially in ocean acoustics, seismology, and nondestructive evaluation. In this paper we propose a propagation model that can easily represent many classes of dispersive waves and proceed to develop the model-based solution to the wave processing problem. It is shown that the underlying wave system is nonlinear and time-variable requiring a recursive processor. Thus the general solution to the model-based dispersive wave enhancement problem is developed using a Bayesian maximum a posteriori (MAP) approach and shown to lead to the recursive, nonlinear extended Kalman filter (EKF) processor. The problem of internal wave estimation is cast within this framework. The specific processor is developed and applied to data synthesized by a sophisticated simulator demonstrating the feasibility of this approach. copyright 1999 Acoustical Society of America.

  9. Formulas of Revised MRP

    Directory of Open Access Journals (Sweden)

    Alfredo Bregni

    2013-04-01

    innovation to the main process functioning. As a result, the proposed algorithm copes better with demand uncertainty, lowers the system nervousness and also removes the need for continuous forecast adjustments, thereby improving the ease in managing the material flow, allowing the development of new forms of collaboration among different supply chain partners and the creation of new business networks. The algorithm is presented in formulas to describe in detail each procedure step and calculations.

  10. Contradiction and Kant's Formula of Universal Law

    NARCIS (Netherlands)

    Kleingeld, Pauline

    2017-01-01

    Kant’s most prominent formulation of the Categorical Imperative, known as the Formula of Universal Law (FUL), is generally thought to demand that one act only on maxims that one can will as universal laws without this generating a contradiction. Kant's view is standardly summarized as requiring the

  11. An ISU(3) hadron mass formula

    International Nuclear Information System (INIS)

    Perjes, Z.; Sparling, G.A.J.

    1980-12-01

    A universal mass expression is derived for non-charm hadrons which unites GMO formulae for various multiplets. Mass splitting is achieved via the generators of the 14-parameter ISU(3) group. The spectrum depends on three parameters which vary with the spin. Comparison with particle data shows a nearly linear dependence. (author)

  12. Classification and Recursion Operators of Dark Burgers' Equation

    Science.gov (United States)

    Chen, Mei-Dan; Li, Biao

    2018-01-01

    With the help of symbolic computation, two types of complete scalar classification for dark Burgers' equations are derived by requiring the existence of higher order differential polynomial symmetries. There are some free parameters for every class of dark Burgers' systems; so some special equations including symmetry equation and dual symmetry equation are obtained by selecting the free parameter. Furthermore, two kinds of recursion operators for these dark Burgers' equations are constructed by two direct assumption methods.

  13. A RECURSIVE ALGORITHM SUITABLE FOR REAL-TIME MEASUREMENT

    Directory of Open Access Journals (Sweden)

    Giovanni Bucci

    1995-12-01

    Full Text Available This paper deals with a recursive algorithm suitable for realtime measurement applications, based on an indirect technique, useful in those applications where the required quantities cannot be measured in a straightforward way. To cope with time constraints a parallel formulation of it, suitable to be implemented on multiprocessor systems, is presented. The adopted concurrent implementation is based on factorization techniques. Some experimental results related to the application of the system for carrying out measurements on synchronous motors are included.

  14. Model-based Recursive Partitioning for Subgroup Analyses

    OpenAIRE

    Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten

    2016-01-01

    The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by...

  15. A Decidable Recursive Logic for Weighted Transition Systems

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    In this paper we develop and study the Recursive Weighted Logic (RWL), a multi-modal logic that expresses qualitative and quantitative properties of labelled weighted transition systems (LWSs). LWSs are transition systems labelled with actions and real-valued quantities representing the costs of ...... extends previous results that we have demonstrated for a similar but much more restrictive logic that can only use one variable for each type of resource to encode logical properties....

  16. On а Recursive-Parallel Algorithm for Solving the Knapsack Problem

    Directory of Open Access Journals (Sweden)

    Vladimir V. Vasilchikov

    2018-01-01

    Full Text Available In this paper, we offer an efficient parallel algorithm for solving the NP-complete Knapsack Problem in its basic, so-called 0-1 variant. To find its exact solution, algorithms belonging to the category ”branch and bound methods” have long been used. To speed up the solving with varying degrees of efficiency, various options for parallelizing computations are also used. We propose here an algorithm for solving the problem, based on the paradigm of recursive-parallel computations. We consider it suited well for problems of this kind, when it is difficult to immediately break up the computations into a sufficient number of subtasks that are comparable in complexity, since they appear dynamically at run time. We used the RPM ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network in the .NET Framework. Such applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support for the .NET Framework can be used as a programming language in conjunction with this library. For our experiments, we developed some C# applications using this library. The main purpose of these experiments was to study the acceleration achieved by recursive-parallel computing. A detailed description of the algorithm and its testing, as well as the results obtained, are also given in the paper.

  17. Recursive regularization step for high-order lattice Boltzmann methods

    Science.gov (United States)

    Coreixas, Christophe; Wissocq, Gauthier; Puigt, Guillaume; Boussuge, Jean-François; Sagaut, Pierre

    2017-09-01

    A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive computation of nonequilibrium Hermite polynomial coefficients. In addition to the reduced computational cost of this procedure with respect to the standard one, the recursive step allows to considerably enhance the stability and accuracy of the numerical scheme by properly filtering out second- (and higher-) order nonhydrodynamic contributions in under-resolved conditions. This is first shown in the isothermal case where the simulation of the doubly periodic shear layer is performed with a Reynolds number ranging from 104 to 106, and where a thorough analysis of the case at Re=3 ×104 is conducted. In the latter, results obtained using both regularization steps are compared against the Bhatnagar-Gross-Krook LBM for standard (D2Q9) and high-order (D2V17 and D2V37) lattice structures, confirming the tremendous increase of stability range of the proposed approach. Further comparisons on thermal and fully compressible flows, using the general extension of this procedure, are then conducted through the numerical simulation of Sod shock tubes with the D2V37 lattice. They confirm the stability increase induced by the recursive approach as compared with the standard one.

  18. Recursion relations for AdS/CFT correlators

    International Nuclear Information System (INIS)

    Raju, Suvrat

    2011-01-01

    We expand on the results of our recent letter [Phys. Rev. Lett. 106, 091601 (2011)], where we presented new recursion relations for correlation functions of the stress-tensor and conserved currents in conformal field theories with an AdS d+1 dual for d≥4. These recursion relations are derived by generalizing the Britto-Cachazo-Feng-Witten (BCFW) relations to amplitudes in anti-de Sitter space (AdS) that are dual to boundary correlators, and are usually computed perturbatively by Witten diagrams. Our results relate vacuum-correlation functions to integrated products of lower-point transition amplitudes, which correspond to correlators calculated between states dual to certain normalizable modes. We show that the set of ''polarization vectors'' for which amplitudes behave well under the BCFW extension is smaller than in flat-space. We describe how transition amplitudes for more general external polarizations can be constructed by combining answers obtained by different pairs of BCFW shifts. We then generalize these recursion relations to supersymmetric theories. In AdS, unlike flat-space, even maximal supersymmetry is insufficient to permit the computation of all correlators of operators in the same multiplet as a stress-tensor or conserved current. Finally, we work out some simple examples to verify our results.

  19. Parallelizable approximate solvers for recursions arising in preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)

    1996-12-31

    For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.

  20. Towards Interactive Construction of Topical Hierarchy: A Recursive Tensor Decomposition Approach.

    Science.gov (United States)

    Wang, Chi; Liu, Xueqing; Song, Yanglei; Han, Jiawei

    2015-08-01

    Automatic construction of user-desired topical hierarchies over large volumes of text data is a highly desirable but challenging task. This study proposes to give users freedom to construct topical hierarchies via interactive operations such as expanding a branch and merging several branches. Existing hierarchical topic modeling techniques are inadequate for this purpose because (1) they cannot consistently preserve the topics when the hierarchy structure is modified; and (2) the slow inference prevents swift response to user requests. In this study, we propose a novel method, called STROD, that allows efficient and consistent modification of topic hierarchies, based on a recursive generative model and a scalable tensor decomposition inference algorithm with theoretical performance guarantee. Empirical evaluation shows that STROD reduces the runtime of construction by several orders of magnitude, while generating consistent and quality hierarchies.

  1. Variable depth recursion algorithm for leaf sequencing

    International Nuclear Information System (INIS)

    Siochi, R. Alfredo C.

    2007-01-01

    The processes of extraction and sweep are basic segmentation steps that are used in leaf sequencing algorithms. A modified version of a commercial leaf sequencer changed the way that the extracts are selected and expanded the search space, but the modification maintained the basic search paradigm of evaluating multiple solutions, each one consisting of up to 12 extracts and a sweep sequence. While it generated the best solutions compared to other published algorithms, it used more computation time. A new, faster algorithm selects one extract at a time but calls itself as an evaluation function a user-specified number of times, after which it uses the bidirectional sweeping window algorithm as the final evaluation function. To achieve a performance comparable to that of the modified commercial leaf sequencer, 2-3 calls were needed, and in all test cases, there were only slight improvements beyond two calls. For the 13 clinical test maps, computation speeds improved by a factor between 12 and 43, depending on the constraints, namely the ability to interdigitate and the avoidance of the tongue-and-groove under dose. The new algorithm was compared to the original and modified versions of the commercial leaf sequencer. It was also compared to other published algorithms for 1400, random, 15x15, test maps with 3-16 intensity levels. In every single case the new algorithm provided the best solution

  2. Recurrences and explicit formulae for the expansion and connection coefficients in series of Bessel polynomials

    International Nuclear Information System (INIS)

    Doha, E H; Ahmed, H M

    2004-01-01

    A formula expressing explicitly the derivatives of Bessel polynomials of any degree and for any order in terms of the Bessel polynomials themselves is proved. Another explicit formula, which expresses the Bessel expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of its original Bessel coefficients, is also given. A formula for the Bessel coefficients of the moments of one single Bessel polynomial of certain degree is proved. A formula for the Bessel coefficients of the moments of a general-order derivative of an infinitely differentiable function in terms of its Bessel coefficients is also obtained. Application of these formulae for solving ordinary differential equations with varying coefficients, by reducing them to recurrence relations in the expansion coefficients of the solution, is explained. An algebraic symbolic approach (using Mathematica) in order to build and solve recursively for the connection coefficients between Bessel-Bessel polynomials is described. An explicit formula for these coefficients between Jacobi and Bessel polynomials is given, of which the ultraspherical polynomial and its consequences are important special cases. Two analytical formulae for the connection coefficients between Laguerre-Bessel and Hermite-Bessel are also developed

  3. Analysis of straightening formula

    Directory of Open Access Journals (Sweden)

    Devadatta M. Kulkarni

    1988-01-01

    standard bitableaux (or the set of standard monomials in minors gives a free basis for a polynomial ring in a matrix of indeterminates over a field. The straightening formula expresses a nonstandard bitableau as an integral linear cobmbination of standard bitableaux. In this paper we analyse the exchanges in the process of straightening a nonstandard pure tableau of depth two. We give precisely the number of steps required to straighten a given violation of a nonstandard tableau. We also characterise the violation which is eliminated in a single step.

  4. Bryant J. correction formula

    International Nuclear Information System (INIS)

    Tejera R, A.; Cortes P, A.; Becerril V, A.

    1990-03-01

    For the practical application of the method proposed by J. Bryant, the authors carried out a series of small corrections, related with the bottom, the dead time of the detectors and channels, with the resolution time of the coincidences, with the accidental coincidences, with the decay scheme and with the gamma efficiency of the beta detector beta and the beta efficiency beta of the gamma detector. The calculation of the correction formula is presented in the development of the present report, being presented 25 combinations of the probability of the first existent state at once of one disintegration and the second state at once of the following disintegration. (Author)

  5. Self-lubricating formula

    Energy Technology Data Exchange (ETDEWEB)

    Borzenko, V.A.; Koltovskiy, L.V.; Koshelyov, Yu.I.; Kuzovlyev, G.F.; Lebedyev, S.I.; Sitnikov, S.A.; Telegin, V.D.

    1979-12-30

    To improve operation of scrubbers that operate in crystallizers for deparaffinization of oil products, a formula is being suggested which contains siliceous fibers, and a type of thermoactive resin - phenol-formaldehyde laquer, with the following component ration (% weight): carbon fiber 20-25, siliceous fibers 20-30, dry lubricant 10-15, phenolformaldehyde laquer up to 100. Phys.-mech. characteristics are flexure, compression, Ak of the suggested and known compositions (kgs/cm/sup 2/) 2150-2450 and 2550-2700, 32-37 and 1750, 2150 and 27 operation resource 2100:2500 and 1400.

  6. Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language.

    Science.gov (United States)

    Cho, Pyeong Whan; Szkudlarek, Emily; Tabor, Whitney

    2016-01-01

    Learning is typically understood as a process in which the behavior of an organism is progressively shaped until it closely approximates a target form. It is easy to comprehend how a motor skill or a vocabulary can be progressively learned-in each case, one can conceptualize a series of intermediate steps which lead to the formation of a proficient behavior. With grammar, it is more difficult to think in these terms. For example, center embedding recursive structures seem to involve a complex interplay between multiple symbolic rules which have to be in place simultaneously for the system to work at all, so it is not obvious how the mechanism could gradually come into being. Here, we offer empirical evidence from a new artificial language (or "artificial grammar") learning paradigm, Locus Prediction, that, despite the conceptual conundrum, recursion acquisition occurs gradually, at least for a simple formal language. In particular, we focus on a variant of the simplest recursive language, a (n) b (n) , and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the next higher level (aaabbb) more readily than participants trained on one level of structure (ab) combined with a filler sentence; nevertheless, they do not generalize immediately; (ii) participants trained up to three levels (ab, aabb, aaabbb) generalize more readily to four levels than participants trained on two levels generalize to three; (iii) when we present the levels in succession, starting with the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were not trained; (iv) the intermediate patterns of behavior are associated with perturbations of an attractor in the sense of dynamical systems theory. We argue that all of these behaviors indicate a theory of mental representation in which recursive

  7. An Exact Formula for Calculating Inverse Radial Lens Distortions

    Directory of Open Access Journals (Sweden)

    Pierre Drap

    2016-06-01

    Full Text Available This article presents a new approach to calculating the inverse of radial distortions. The method presented here provides a model of reverse radial distortion, currently modeled by a polynomial expression, that proposes another polynomial expression where the new coefficients are a function of the original ones. After describing the state of the art, the proposed method is developed. It is based on a formal calculus involving a power series used to deduce a recursive formula for the new coefficients. We present several implementations of this method and describe the experiments conducted to assess the validity of the new approach. Such an approach, non-iterative, using another polynomial expression, able to be deduced from the first one, can actually be interesting in terms of performance, reuse of existing software, or bridging between different existing software tools that do not consider distortion from the same point of view.

  8. Anti-Authoritarian Metrics: Recursivity as a strategy for post-capitalism

    Directory of Open Access Journals (Sweden)

    David Adam Banks

    2016-12-01

    Full Text Available This essay proposes that those seeking to build counter-power institutions and communities learn to think in terms of what I call “recursivity.” Recursivity is an anti-authoritarian metric that helps bring about a sensitivity to feedback loops at multiple levels of organization. I begin by describing how technological systems and the socio-economic order co-constitute one-another around efficiency metrics. I then go on to define recursivity as social conditions that contain within them all of the parts and practices for their maturation and expansion, and show how organizations that demonstrate recursivity, like the historical English commons, have been marginalized or destroyed all together. Finally, I show how the ownership of property is inherently antithetical to the closed loops of recursivity. All of this is bookended by a study of urban planning’s recursive beginnings.

  9. Generating loop graphs via Hopf algebra in quantum field theory

    International Nuclear Information System (INIS)

    Mestre, Angela; Oeckl, Robert

    2006-01-01

    We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be evaluated directly as contributions to the connected n-point functions. The recursion proceeds by loop order and vertex number

  10. On the asymptotic form of the recursion method basis vectors for periodic Hamiltonians

    International Nuclear Information System (INIS)

    O'Reilly, E.P.; Weaire, D.

    1984-01-01

    The authors present the first detailed study of the recursion method basis vectors for the case of a periodic Hamiltonian. In the examples chosen, the probability density scales linearly with n as n → infinity, whenever the local density of states is bounded. Whenever it is unbounded and the recursion coefficients diverge, different scaling behaviour is found. These findings are explained and a scaling relationship between the asymptotic forms of the recursion coefficients and basis vectors is proposed. (author)

  11. A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems

    Directory of Open Access Journals (Sweden)

    White Michael S

    2003-01-01

    Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.

  12. A model of guarded recursion with clock synchronisation

    DEFF Research Database (Denmark)

    Bizjak, Aleš; Møgelberg, Rasmus Ejlers

    2015-01-01

    productivity to be captured in types. The calculus uses clocks representing time streams and clock quantifiers which allow limited and controlled elimination of modalities. The calculus has since been extended to dependent types by Møgelberg. Both works give denotational semantics but no rewrite semantics....... In previous versions of this calculus, different clocks represented separate time streams and clock synchronisation was prohibited. In this paper we show that allowing clock synchronisation is safe by constructing a new model of guarded recursion and clocks. This result will greatly simplify the type theory...... by removing freshness restrictions from typing rules, and is a necessary step towards defining rewrite semantics, and ultimately implementing the calculus....

  13. Chain of matrices, loop equations and topological recursion

    CERN Document Server

    Orantin, Nicolas

    2009-01-01

    Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.

  14. Recursive Neural Networks Based on PSO for Image Parsing

    Directory of Open Access Journals (Sweden)

    Guo-Rong Cai

    2013-01-01

    Full Text Available This paper presents an image parsing algorithm which is based on Particle Swarm Optimization (PSO and Recursive Neural Networks (RNNs. State-of-the-art method such as traditional RNN-based parsing strategy uses L-BFGS over the complete data for learning the parameters. However, this could cause problems due to the nondifferentiable objective function. In order to solve this problem, the PSO algorithm has been employed to tune the weights of RNN for minimizing the objective. Experimental results obtained on the Stanford background dataset show that our PSO-based training algorithm outperforms traditional RNN, Pixel CRF, region-based energy, simultaneous MRF, and superpixel MRF.

  15. Optimally eating a stochastic cake. A recursive utility approach

    International Nuclear Information System (INIS)

    Epaulard, Anne; Pommeret, Aude

    2003-01-01

    In this short paper, uncertainties on resource stock and on technical progress are introduced into an intertemporal equilibrium model of optimal extraction of a non-renewable resource. The representative consumer maximizes a recursive utility function which disentangles between intertemporal elasticity of substitution and risk aversion. A closed-form solution is derived for both the optimal extraction and price paths. The value of the intertemporal elasticity of substitution relative to unity is then crucial in understanding extraction. Moreover, this model leads to a non-renewable resource price following a geometric Brownian motion

  16. Structural properties of recursively partitionable graphs with connectivity 2

    DEFF Research Database (Denmark)

    Baudon, Olivier; Bensmail, Julien; Foucaud, Florent

    2017-01-01

    , namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be con-nected but also ful_l additional conditions. In this paper, we point out some structural...... properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called...

  17. Pesin’s entropy formula for stochastic flows of diffeomorphisms

    Institute of Scientific and Technical Information of China (English)

    刘培东

    1996-01-01

    Pesin’s entropy formula relating entropy and Lyapunov exponents within the context of random dynamical systems generated by (discrete or continuous) stochastic flows of diffeomorphisms (including solution flows of stochastic differential equations on manifolds) is proved.

  18. Production of [Formula: see text] and [Formula: see text] mesons up to high transverse momentum in pp collisions at 2.76 TeV.

    Science.gov (United States)

    Acharya, S; Adamová, D; Aggarwal, M M; Rinella, G Aglieri; Agnello, M; Agrawal, N; Ahammed, Z; Ahmad, N; Ahn, S U; Aiola, S; Akindinov, A; Alam, S N; Albuquerque, D S D; Aleksandrov, D; Alessandro, B; Alexandre, D; Molina, R Alfaro; Alici, A; Alkin, A; Alme, J; Alt, T; Altsybeev, I; Prado, C Alves Garcia; An, M; Andrei, C; Andrews, H A; Andronic, A; Anguelov, V; Anson, C; Antičić, T; Antinori, F; Antonioli, P; Anwar, R; Aphecetche, L; Appelshäuser, H; Arcelli, S; Arnaldi, R; Arnold, O W; Arsene, I C; Arslandok, M; Audurier, B; Augustinus, A; Averbeck, R; Awes, T; Azmi, M D; Badalà, A; Baek, Y W; Bagnasco, S; Bailhache, R; Bala, R; Baldisseri, A; Ball, M; Baral, R C; Barbano, A M; Barbera, R; Barile, F; Barioglio, L; Barnaföldi, G G; Barnby, L S; Barret, V; Bartalini, P; Barth, K; Bartke, J; Bartsch, E; Basile, M; Bastid, N; Basu, S; Bathen, B; Batigne, G; Camejo, A Batista; Batyunya, B; Batzing, P C; Bearden, I G; Beck, H; Bedda, C; Behera, N K; Belikov, I; Bellini, F; Martinez, H Bello; Bellwied, R; Beltran, L G E; Belyaev, V; Bencedi, G; Beole, S; Bercuci, A; Berdnikov, Y; Berenyi, D; Bertens, R A; Berzano, D; Betev, L; Bhasin, A; Bhat, I R; Bhati, A K; Bhattacharjee, B; Bhom, J; Bianchi, L; Bianchi, N; Bianchin, C; Bielčík, J; Bielčíková, J; Bilandzic, A; Biro, G; Biswas, R; Biswas, S; Blair, J T; Blau, D; Blume, C; Boca, G; Bock, F; Bogdanov, A; Boldizsár, L; Bombara, M; Bonomi, G; Bonora, M; Book, J; Borel, H; Borissov, A; Borri, M; Botta, E; Bourjau, C; Braun-Munzinger, P; Bregant, M; Broker, T A; Browning, T A; Broz, M; Brucken, E J; Bruna, E; Bruno, G E; Budnikov, D; Buesching, H; Bufalino, S; Buhler, P; Buitron, S A I; Buncic, P; Busch, O; Buthelezi, Z; Butt, J B; Buxton, J T; Cabala, J; Caffarri, D; Caines, H; Caliva, A; Villar, E Calvo; Camerini, P; Capon, A A; Carena, F; Carena, W; Carnesecchi, F; Castellanos, J Castillo; Castro, A J; Casula, E A R; Sanchez, C Ceballos; Cerello, P; Chang, B; Chapeland, S; Chartier, M; Charvet, J L; Chattopadhyay, S; Chattopadhyay, S; Chauvin, A; Cherney, M; Cheshkov, C; Cheynis, B; Barroso, V Chibante; Chinellato, D D; Cho, S; Chochula, P; Choi, K; Chojnacki, M; Choudhury, S; Christakoglou, P; Christensen, C H; Christiansen, P; Chujo, T; Chung, S U; Cicalo, C; Cifarelli, L; Cindolo, F; Cleymans, J; Colamaria, F; Colella, D; Collu, A; Colocci, M; Concas, M; Balbastre, G Conesa; Valle, Z Conesa Del; Connors, M E; Contreras, J G; Cormier, T M; Morales, Y Corrales; Maldonado, I Cortés; Cortese, P; Cosentino, M R; Costa, F; Costanza, S; Crkovská, J; Crochet, P; Cuautle, E; Cunqueiro, L; Dahms, T; Dainese, A; Danisch, M C; Danu, A; Das, D; Das, I; Das, S; Dash, A; Dash, S; De, S; De Caro, A; de Cataldo, G; de Conti, C; de Cuveland, J; De Falco, A; De Gruttola, D; De Marco, N; De Pasquale, S; De Souza, R D; Degenhardt, H F; Deisting, A; Deloff, A; Deplano, C; Dhankher, P; Di Bari, D; Di Mauro, A; Di Nezza, P; Di Ruzza, B; Corchero, M A Diaz; Dietel, T; Dillenseger, P; Divià, R; Djuvsland, Ø; Dobrin, A; Gimenez, D Domenicis; Dönigus, B; Dordic, O; Drozhzhova, T; Dubey, A K; Dubla, A; Ducroux, L; Duggal, A K; Dupieux, P; Ehlers, R J; Elia, D; Endress, E; Engel, H; Epple, E; Erazmus, B; Erhardt, F; Espagnon, B; Esumi, S; Eulisse, G; Eum, J; Evans, D; Evdokimov, S; Fabbietti, L; Faivre, J; Fantoni, A; Fasel, M; Feldkamp, L; Feliciello, A; Feofilov, G; Ferencei, J; Téllez, A Fernández; Ferreiro, E G; Ferretti, A; Festanti, A; Feuillard, V J G; Figiel, J; Figueredo, M A S; Filchagin, S; Finogeev, D; Fionda, F M; Fiore, E M; Floris, M; Foertsch, S; Foka, P; Fokin, S; Fragiacomo, E; Francescon, A; Francisco, A; Frankenfeld, U; Fronze, G G; Fuchs, U; Furget, C; Furs, A; Girard, M Fusco; Gaardhøje, J J; Gagliardi, M; Gago, A M; Gajdosova, K; Gallio, M; Galvan, C D; Ganoti, P; Gao, C; Garabatos, C; Garcia-Solis, E; Garg, K; Garg, P; Gargiulo, C; Gasik, P; Gauger, E F; Ducati, M B Gay; Germain, M; Ghosh, P; Ghosh, S K; Gianotti, P; Giubellino, P; Giubilato, P; Gladysz-Dziadus, E; Glässel, P; Coral, D M Goméz; Ramirez, A Gomez; Gonzalez, A S; Gonzalez, V; González-Zamora, P; Gorbunov, S; Görlich, L; Gotovac, S; Grabski, V; Graczykowski, L K; Graham, K L; Greiner, L; Grelli, A; Grigoras, C; Grigoriev, V; Grigoryan, A; Grigoryan, S; Grion, N; Gronefeld, J M; Grosa, F; Grosse-Oetringhaus, J F; Grosso, R; Gruber, L; Grull, F R; Guber, F; Guernane, R; Guerzoni, B; Gulbrandsen, K; Gunji, T; Gupta, A; Gupta, R; Guzman, I B; Haake, R; Hadjidakis, C; Hamagaki, H; Hamar, G; Hamon, J C; Harris, J W; Harton, A; Hatzifotiadou, D; Hayashi, S; Heckel, S T; Hellbär, E; Helstrup, H; Herghelegiu, A; Corral, G Herrera; Herrmann, F; Hess, B A; Hetland, K F; Hillemanns, H; Hippolyte, B; Hladky, J; Hohlweger, B; Horak, D; Hornung, S; Hosokawa, R; Hristov, P; Hughes, C; Humanic, T J; Hussain, N; Hussain, T; Hutter, D; Hwang, D S; Ilkaev, R; Inaba, M; Ippolitov, M; Irfan, M; Isakov, V; Ivanov, M; Ivanov, V; Izucheev, V; Jacak, B; Jacazio, N; Jacobs, P M; Jadhav, M B; Jadlovska, S; Jadlovsky, J; Jaelani, S; Jahnke, C; Jakubowska, M J; Janik, M A; Jayarathna, P H S Y; Jena, C; Jena, S; Jercic, M; Bustamante, R T Jimenez; Jones, P G; Jusko, A; Kalinak, P; Kalweit, A; Kamin, J; Kang, J H; Kaplin, V; Kar, S; Uysal, A Karasu; Karavichev, O; Karavicheva, T; Karayan, L; Karpechev, E; Kebschull, U; Keidel, R; Keijdener, D L D; Keil, M; Ketzer, B; Khan, P; Khan, S A; Khanzadeev, A; Kharlov, Y; Khatun, A; Khuntia, A; Kielbowicz, M M; Kileng, B; Kim, D; Kim, D W; Kim, D J; Kim, H; Kim, J S; Kim, J; Kim, M; Kim, M; Kim, S; Kim, T; Kirsch, S; Kisel, I; Kiselev, S; Kisiel, A; Kiss, G; Klay, J L; Klein, C; Klein, J; Klein-Bösing, C; Klewin, S; Kluge, A; Knichel, M L; Knospe, A G; Kobdaj, C; Kofarago, M; Kollegger, T; Kolojvari, A; Kondratiev, V; Kondratyeva, N; Kondratyuk, E; Konevskikh, A; Kopcik, M; Kour, M; Kouzinopoulos, C; Kovalenko, O; Kovalenko, V; Kowalski, M; Meethaleveedu, G Koyithatta; Králik, I; Kravčáková, A; Krivda, M; Krizek, F; Kryshen, E; Krzewicki, M; Kubera, A M; Kučera, V; Kuhn, C; Kuijer, P G; Kumar, A; Kumar, J; Kumar, L; Kumar, S; Kundu, S; Kurashvili, P; Kurepin, A; Kurepin, A B; Kuryakin, A; Kushpil, S; Kweon, M J; Kwon, Y; La Pointe, S L; La Rocca, P; Fernandes, C Lagana; Lakomov, I; Langoy, R; Lapidus, K; Lara, C; Lardeux, A; Lattuca, A; Laudi, E; Lavicka, R; Lazaridis, L; Lea, R; Leardini, L; Lee, S; Lehas, F; Lehner, S; Lehrbach, J; Lemmon, R C; Lenti, V; Leogrande, E; Monzón, I León; Lévai, P; Li, S; Li, X; Lien, J; Lietava, R; Lindal, S; Lindenstruth, V; Lippmann, C; Lisa, M A; Litichevskyi, V; Ljunggren, H M; Llope, W J; Lodato, D F; Loenne, P I; Loginov, V; Loizides, C; Loncar, P; Lopez, X; Torres, E López; Lowe, A; Luettig, P; Lunardon, M; Luparello, G; Lupi, M; Lutz, T H; Maevskaya, A; Mager, M; Mahajan, S; Mahmood, S M; Maire, A; Majka, R D; Malaev, M; Cervantes, I Maldonado; Malinina, L; Mal'Kevich, D; Malzacher, P; Mamonov, A; Manko, V; Manso, F; Manzari, V; Mao, Y; Marchisone, M; Mareš, J; Margagliotti, G V; Margotti, A; Margutti, J; Marín, A; Markert, C; Marquard, M; Martin, N A; Martinengo, P; Martinez, J A L; Martínez, M I; García, G Martínez; Pedreira, M Martinez; Mas, A; Masciocchi, S; Masera, M; Masoni, A; Mastroserio, A; Mathis, A M; Matyja, A; Mayer, C; Mazer, J; Mazzilli, M; Mazzoni, M A; Meddi, F; Melikyan, Y; Menchaca-Rocha, A; Meninno, E; Pérez, J Mercado; Meres, M; Mhlanga, S; Miake, Y; Mieskolainen, M M; Mihaylov, D L; Mikhaylov, K; Milano, L; Milosevic, J; Mischke, A; Mishra, A N; Miśkowiec, D; Mitra, J; Mitu, C M; Mohammadi, N; Mohanty, B; Khan, M Mohisin; Montes, E; De Godoy, D A Moreira; Moreno, L A P; Moretto, S; Morreale, A; Morsch, A; Muccifora, V; Mudnic, E; Mühlheim, D; Muhuri, S; Mukherjee, M; Mulligan, J D; Munhoz, M G; Münning, K; Munzer, R H; Murakami, H; Murray, S; Musa, L; Musinsky, J; Myers, C J; Naik, B; Nair, R; Nandi, B K; Nania, R; Nappi, E; Narayan, A; Naru, M U; da Luz, H Natal; Nattrass, C; Navarro, S R; Nayak, K; Nayak, R; Nayak, T K; Nazarenko, S; Nedosekin, A; De Oliveira, R A Negrao; Nellen, L; Nesbo, S V; Ng, F; Nicassio, M; Niculescu, M; Niedziela, J; Nielsen, B S; Nikolaev, S; Nikulin, S; Nikulin, V; Noferini, F; Nomokonov, P; Nooren, G; Noris, J C C; Norman, J; Nyanin, A; Nystrand, J; Oeschler, H; Oh, S; Ohlson, A; Okubo, T; Olah, L; Oleniacz, J; Da Silva, A C Oliveira; Oliver, M H; Onderwaater, J; Oppedisano, C; Orava, R; Oravec, M; Velasquez, A Ortiz; Oskarsson, A; Otwinowski, J; Oyama, K; Pachmayer, Y; Pacik, V; Pagano, D; Pagano, P; Paić, G; Palni, P; Pan, J; Pandey, A K; Panebianco, S; Papikyan, V; Pappalardo, G S; Pareek, P; Park, J; Park, W J; Parmar, S; Passfeld, A; Pathak, S P; Paticchio, V; Patra, R N; Paul, B; Pei, H; Peitzmann, T; Peng, X; Pereira, L G; Da Costa, H Pereira; Peresunko, D; Lezama, E Perez; Peskov, V; Pestov, Y; Petráček, V; Petrov, V; Petrovici, M; Petta, C; Pezzi, R P; Piano, S; Pikna, M; Pillot, P; Pimentel, L O D L; Pinazza, O; Pinsky, L; Piyarathna, D B; Oskoń, M Pł; Planinic, M; Pluta, J; Pochybova, S; Podesta-Lerma, P L M; Poghosyan, M G; Polichtchouk, B; Poljak, N; Poonsawat, W; Pop, A; Poppenborg, H; Porteboeuf-Houssais, S; Porter, J; Pospisil, J; Pozdniakov, V; Prasad, S K; Preghenella, R; Prino, F; Pruneau, C A; Pshenichnov, I; Puccio, M; Puddu, G; Pujahari, P; Punin, V; Putschke, J; Qvigstad, H; Rachevski, A; Raha, S; Rajput, S; Rak, J; Rakotozafindrabe, A; Ramello, L; Rami, F; Rana, D B; Raniwala, R; Raniwala, S; Räsänen, S S; Rascanu, B T; Rathee, D; Ratza, V; Ravasenga, I; Read, K F; Redlich, K; Rehman, A; Reichelt, P; Reidt, F; Ren, X; Renfordt, R; Reolon, A R; Reshetin, A; Reygers, K; Riabov, V; Ricci, R A; Richert, T; Richter, M; Riedler, P; Riegler, W; Riggi, F; Ristea, C; Cahuantzi, M Rodríguez; Røed, K; Rogochaya, E; Rohr, D; Röhrich, D; Rokita, P S; Ronchetti, F; Ronflette, L; Rosnet, P; Rossi, A; Rotondi, A; Roukoutakis, F; Roy, A; Roy, C; Roy, P; Montero, A J Rubio; Rueda, O V; Rui, R; Russo, R; Rustamov, A; Ryabinkin, E; Ryabov, Y; Rybicki, A; Saarinen, S; Sadhu, S; Sadovsky, S; Šafařík, K; Saha, S K; Sahlmuller, B; Sahoo, B; Sahoo, P; Sahoo, R; Sahoo, S; Sahu, P K; Saini, J; Sakai, S; Saleh, M A; Salzwedel, J; Sambyal, S; Samsonov, V; Sandoval, A; Sarkar, D; Sarkar, N; Sarma, P; Sas, M H P; Scapparone, E; Scarlassara, F; Scharenberg, R P; Scheid, H S; Schiaua, C; Schicker, R; Schmidt, C; Schmidt, H R; Schmidt, M O; Schmidt, M; Schuchmann, S; Schukraft, J; Schutz, Y; Schwarz, K; Schweda, K; Scioli, G; Scomparin, E; Scott, R; Šefčík, M; Seger, J E; Sekiguchi, Y; Sekihata, D; Selyuzhenkov, I; Senosi, K; Senyukov, S; Serradilla, E; Sett, P; Sevcenco, A; Shabanov, A; Shabetai, A; Shadura, O; Shahoyan, R; Shangaraev, A; Sharma, A; Sharma, A; Sharma, M; Sharma, M; Sharma, N; Sheikh, A I; Shigaki, K; Shou, Q; Shtejer, K; Sibiriak, Y; Siddhanta, S; Sielewicz, K M; Siemiarczuk, T; Silvermyr, D; Silvestre, C; Simatovic, G; Simonetti, G; Singaraju, R; Singh, R; Singhal, V; Sinha, T; Sitar, B; Sitta, M; Skaali, T B; Slupecki, M; Smirnov, N; Snellings, R J M; Snellman, T W; Song, J; Song, M; Soramel, F; Sorensen, S; Sozzi, F; Spiriti, E; Sputowska, I; Srivastava, B K; Stachel, J; Stan, I; Stankus, P; Stenlund, E; Stiller, J H; Stocco, D; Strmen, P; Suaide, A A P; Sugitate, T; Suire, C; Suleymanov, M; Suljic, M; Sultanov, R; Šumbera, M; Sumowidagdo, S; Suzuki, K; Swain, S; Szabo, A; Szarka, I; Szczepankiewicz, A; Szymanski, M; Tabassam, U; Takahashi, J; Tambave, G J; Tanaka, N; Tarhini, M; Tariq, M; Tarzila, M G; Tauro, A; Muñoz, G Tejeda; Telesca, A; Terasaki, K; Terrevoli, C; Teyssier, B; Thakur, D; Thakur, S; Thomas, D; Tieulent, R; Tikhonov, A; Timmins, A R; Toia, A; Tripathy, S; Trogolo, S; Trombetta, G; Trubnikov, V; Trzaska, W H; Trzeciak, B A; Tsuji, T; Tumkin, A; Turrisi, R; Tveter, T S; Ullaland, K; Umaka, E N; Uras, A; Usai, G L; Utrobicic, A; Vala, M; Van Der Maarel, J; Van Hoorne, J W; van Leeuwen, M; Vanat, T; Vyvre, P Vande; Varga, D; Vargas, A; Vargyas, M; Varma, R; Vasileiou, M; Vasiliev, A; Vauthier, A; Doce, O Vázquez; Vechernin, V; Veen, A M; Velure, A; Vercellin, E; Limón, S Vergara; Vernet, R; Vértesi, R; Vickovic, L; Vigolo, S; Viinikainen, J; Vilakazi, Z; Baillie, O Villalobos; Tello, A Villatoro; Vinogradov, A; Vinogradov, L; Virgili, T; Vislavicius, V; Vodopyanov, A; Völkl, M A; Voloshin, K; Voloshin, S A; Volpe, G; von Haller, B; Vorobyev, I; Voscek, D; Vranic, D; Vrláková, J; Wagner, B; Wagner, J; Wang, H; Wang, M; Watanabe, D; Watanabe, Y; Weber, M; Weber, S G; Weiser, D F; Wessels, J P; Westerhoff, U; Whitehead, A M; Wiechula, J; Wikne, J; Wilk, G; Wilkinson, J; Willems, G A; Williams, M C S; Windelband, B; Witt, W E; Yalcin, S; Yang, P; Yano, S; Yin, Z; Yokoyama, H; Yoo, I-K; Yoon, J H; Yurchenko, V; Zaccolo, V; Zaman, A; Zampolli, C; Zanoli, H J C; Zardoshti, N; Zarochentsev, A; Závada, P; Zaviyalov, N; Zbroszczyk, H; Zhalov, M; Zhang, H; Zhang, X; Zhang, Y; Zhang, C; Zhang, Z; Zhao, C; Zhigareva, N; Zhou, D; Zhou, Y; Zhou, Z; Zhu, H; Zhu, J; Zhu, X; Zichichi, A; Zimmermann, A; Zimmermann, M B; Zimmermann, S; Zinovjev, G; Zmeskal, J

    2017-01-01

    The invariant differential cross sections for inclusive [Formula: see text] and [Formula: see text] mesons at midrapidity were measured in pp collisions at [Formula: see text] TeV for transverse momenta [Formula: see text] GeV/ c and [Formula: see text] GeV/ c , respectively, using the ALICE detector. This large range in [Formula: see text] was achieved by combining various analysis techniques and different triggers involving the electromagnetic calorimeter (EMCal). In particular, a new single-cluster, shower-shape based method was developed for the identification of high-[Formula: see text] neutral pions, which exploits that the showers originating from their decay photons overlap in the EMCal. Above 4 GeV/[Formula: see text], the measured cross sections are found to exhibit a similar power-law behavior with an exponent of about 6.3. Next-to-leading-order perturbative QCD calculations differ from the measured cross sections by about 30% for the [Formula: see text], and between 30-50% for the [Formula: see text] meson, while generator-level simulations with PYTHIA 8.2 describe the data to better than 10-30%, except at [Formula: see text] GeV/[Formula: see text]. The new data can therefore be used to further improve the theoretical description of [Formula: see text] and [Formula: see text] meson production.

  19. Quadrature formulas for Fourier coefficients

    KAUST Repository

    Bojanov, Borislav

    2009-09-01

    We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the Fourier-Tchebycheff coefficients given by Micchelli and Sharma and construct new Gaussian formulas for the Fourier coefficients of a function, based on the values of the function and its derivatives. © 2009 Elsevier B.V. All rights reserved.

  20. Transfer maps and projection formulas

    OpenAIRE

    Tabuada, Goncalo

    2010-01-01

    Transfer maps and projection formulas are undoubtedly one of the key tools in the development and computation of (co)homology theories. In this note we develop an unified treatment of transfer maps and projection formulas in the non-commutative setting of dg categories. As an application, we obtain transfer maps and projection formulas in algebraic K-theory, cyclic homology, topological cyclic homology, and other scheme invariants.

  1. A new Bayesian recursive technique for parameter estimation

    Science.gov (United States)

    Kaheil, Yasir H.; Gill, M. Kashif; McKee, Mac; Bastidas, Luis

    2006-08-01

    The performance of any model depends on how well its associated parameters are estimated. In the current application, a localized Bayesian recursive estimation (LOBARE) approach is devised for parameter estimation. The LOBARE methodology is an extension of the Bayesian recursive estimation (BARE) method. It is applied in this paper on two different types of models: an artificial intelligence (AI) model in the form of a support vector machine (SVM) application for forecasting soil moisture and a conceptual rainfall-runoff (CRR) model represented by the Sacramento soil moisture accounting (SAC-SMA) model. Support vector machines, based on statistical learning theory (SLT), represent the modeling task as a quadratic optimization problem and have already been used in various applications in hydrology. They require estimation of three parameters. SAC-SMA is a very well known model that estimates runoff. It has a 13-dimensional parameter space. In the LOBARE approach presented here, Bayesian inference is used in an iterative fashion to estimate the parameter space that will most likely enclose a best parameter set. This is done by narrowing the sampling space through updating the "parent" bounds based on their fitness. These bounds are actually the parameter sets that were selected by BARE runs on subspaces of the initial parameter space. The new approach results in faster convergence toward the optimal parameter set using minimum training/calibration data and fewer sets of parameter values. The efficacy of the localized methodology is also compared with the previously used BARE algorithm.

  2. Interacting via the Heap in the Presence of Recursion

    Directory of Open Access Journals (Sweden)

    Jurriaan Rot

    2012-12-01

    Full Text Available Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such a static analysis is, in general, undecidable. In this paper we study the verification of recursive programs with unbounded allocation of objects, in a simple imperative language for heap manipulation. We present an improved semantics for this language, using an abstraction that is precise. For any program with a bounded visible heap, meaning that the number of objects reachable from variables at any point of execution is bounded, this abstraction is a finitary representation of its behaviour, even though an unbounded number of objects can appear in the state. As a consequence, for such programs model checking is decidable. Finally we introduce a specification language for temporal properties of the heap, and discuss model checking these properties against heap-manipulating programs.

  3. Recursive estimation of the parts production process quality indicator

    Directory of Open Access Journals (Sweden)

    Filipovich Oleg

    2017-01-01

    Full Text Available Consideration is given to a mathematical representation for manufacturing of batch parts on a metal-cutting machine tool. Linear dimensions of machined parts are assumed to be the major quality indicator, deviation from these dimensions is determined by size setting of machine tool and ensemble of random factors. It is allowed to have absolutely precise pre-setting of machine tool, effects from setup level offsetting due to deformation in process equipment on the specified indicator are disregarded. Consideration is given to factors which affect the tool wear, with two definitions of tool wear being provided. Reasons for development of random error in processing, dependence of measurement results on error as well as distribution laws and some parameters of random values are provided. To evaluate deviation of size setting value in each cycle, it is proposed to apply a recursive algorithm in description of investigated dynamic discrete process in the space state. Kalman filter equations are used in description of process model by means of first-order difference equations. The algorithm of recursive estimation is implemented in the mathematical software Maple. Simulation results which prove effectiveness of algorithm application to investigate the given dynamic system are provided. Variants of algorithm application and opportunities of further research are proposed.

  4. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack

    2012-01-01

    The LU factorization is an important numerical algorithm for solving system of linear equations. This paper proposes a novel approach for computing the LU factorization in parallel on multicore architectures. It improves the overall performance and also achieves the numerical quality of the standard LU factorization with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive formulation of the factorization. It is based on conflict-free partitioning of the data and lock-less synchronization mechanisms. Our implementation lets the overall computation naturally flow with limited contention. Our recursive panel factorization provides the necessary performance increase for the inherently problematic portion of the LU factorization of square matrices. A large panel width results in larger Amdahl\\'s fraction as our experiments have revealed which is consistent with related efforts. The performance results of our implementation reveal superlinear speedup and far exceed what can be achieved with equivalent MKL and/or LAPACK routines. © 2012 The authors and IOS Press. All rights reserved.

  5. Contradiction and Kant's Formula of Universal Law

    OpenAIRE

    Kleingeld, Pauline

    2017-01-01

    Kant’s most prominent formulation of the Categorical Imperative, known as the Formula of Universal Law (FUL), is generally thought to demand that one act only on maxims that one can will as universal laws without this generating a contradiction. Kant's view is standardly summarized as requiring the 'universalizability' of one's maxims and described in terms of the distinction between 'contradictions in conception' and 'contradictions in the will'. Focussing on the underappreciated significanc...

  6. Dimensional regularization in position space and a forest formula for regularized Epstein-Glaser renormalization

    International Nuclear Information System (INIS)

    Keller, Kai Johannes

    2010-04-01

    The present work contains a consistent formulation of the methods of dimensional regularization (DimReg) and minimal subtraction (MS) in Minkowski position space. The methods are implemented into the framework of perturbative Algebraic Quantum Field Theory (pAQFT). The developed methods are used to solve the Epstein-Glaser recursion for the construction of time-ordered products in all orders of causal perturbation theory. A solution is given in terms of a forest formula in the sense of Zimmermann. A relation to the alternative approach to renormalization theory using Hopf algebras is established. (orig.)

  7. Dimensional regularization in position space and a forest formula for regularized Epstein-Glaser renormalization

    Energy Technology Data Exchange (ETDEWEB)

    Keller, Kai Johannes

    2010-04-15

    The present work contains a consistent formulation of the methods of dimensional regularization (DimReg) and minimal subtraction (MS) in Minkowski position space. The methods are implemented into the framework of perturbative Algebraic Quantum Field Theory (pAQFT). The developed methods are used to solve the Epstein-Glaser recursion for the construction of time-ordered products in all orders of causal perturbation theory. A solution is given in terms of a forest formula in the sense of Zimmermann. A relation to the alternative approach to renormalization theory using Hopf algebras is established. (orig.)

  8. Relationship between Maximum Principle and Dynamic Programming for Stochastic Recursive Optimal Control Problems and Applications

    Directory of Open Access Journals (Sweden)

    Jingtao Shi

    2013-01-01

    Full Text Available This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result.

  9. A recursive Formulation of the Inversion of symmetric positive defite matrices in packed storage data format

    DEFF Research Database (Denmark)

    Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred

    2002-01-01

    A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory words...

  10. The Paradigm Recursion: Is It More Accessible When Introduced in Middle School?

    Science.gov (United States)

    Gunion, Katherine; Milford, Todd; Stege, Ulrike

    2009-01-01

    Recursion is a programming paradigm as well as a problem solving strategy thought to be very challenging to grasp for university students. This article outlines a pilot study, which expands the age range of students exposed to the concept of recursion in computer science through instruction in a series of interesting and engaging activities. In…

  11. Time-area efficient multiplier-free recursive filter architectures for FPGA implementation

    DEFF Research Database (Denmark)

    Shajaan, Mohammad; Sørensen, John Aasted

    1996-01-01

    Simultaneous design of multiplier-free recursive filters (IIR filters) and their hardware implementation in Xilinx field programmable gate array (XC4000) is presented. The hardware design methodology leads to high performance recursive filters with sampling frequencies in the interval 15-21 MHz (...

  12. A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration

    DEFF Research Database (Denmark)

    Cherabini, Luca; Danvy, Olivier

    2011-01-01

    We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' induction principle for primitive recursion,`a la Goedel, and primitive iteration, `a la Church. We use 'Kleene's trick' to show that primitive recursion and primitive iiteration are as expressive...

  13. Recursion rules for scattering amplitudes in non-Abelian gauge theories

    International Nuclear Information System (INIS)

    Kim, C.; Nair, V.P.

    1997-01-01

    We present a functional derivation of recursion rules for scattering amplitudes in a non-Abelian gauge theory in a form valid to arbitrary loop order. The tree-level and one-loop recursion rules are explicitly displayed. copyright 1997 The American Physical Society

  14. Generalized Path Analysis and Generalized Simultaneous Equations Model for Recursive Systems with Responses of Mixed Types

    Science.gov (United States)

    Tsai, Tien-Lung; Shau, Wen-Yi; Hu, Fu-Chang

    2006-01-01

    This article generalizes linear path analysis (PA) and simultaneous equations models (SiEM) to deal with mixed responses of different types in a recursive or triangular system. An efficient instrumental variable (IV) method for estimating the structural coefficients of a 2-equation partially recursive generalized path analysis (GPA) model and…

  15. Grouping Minerals by Their Formulas

    Science.gov (United States)

    Mulvey, Bridget

    2018-01-01

    Minerals are commonly taught in ways that emphasize mineral identification for its own sake or maybe to help identify rocks. But how do minerals fit in with other science content taught? The author uses mineral formulas to help Earth science students wonder about the connection between elements, compounds, mixtures, minerals, and mineral formulas.…

  16. Statistics Using Just One Formula

    Science.gov (United States)

    Rosenthal, Jeffrey S.

    2018-01-01

    This article advocates that introductory statistics be taught by basing all calculations on a single simple margin-of-error formula and deriving all of the standard introductory statistical concepts (confidence intervals, significance tests, comparisons of means and proportions, etc) from that one formula. It is argued that this approach will…

  17. Discontinuity formulas for multiparticle amplitudes

    International Nuclear Information System (INIS)

    Stapp, H.P.

    1976-03-01

    It is shown how discontinuity formulas for multiparticle scattering amplitudes are derived from unitarity and analyticity. The assumed analyticity property is the normal analytic structure, which was shown to be equivalent to the space-time macrocausality condition. The discontinuity formulas to be derived are the basis of multi-particle fixed-t dispersion relations

  18. Source localization using recursively applied and projected (RAP) MUSIC

    Energy Technology Data Exchange (ETDEWEB)

    Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [Univ. of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

    1998-03-01

    A new method for source localization is described that is based on a modification of the well known multiple signal classification (MUSIC) algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form an intermediate array gain matrix, and projects both the array manifold and the signal subspace estimate into its orthogonal complement. The MUSIC projection is then performed in this reduced subspace. Using the metric of principal angles, the authors describe a general form of the RAP-MUSIC algorithm for the case of diversely polarized sources. Through a uniform linear array simulation, the authors demonstrate the improved Monte Carlo performance of RAP-MUSIC relative to MUSIC and two other sequential subspace methods, S and IES-MUSIC.

  19. Geometrical interpretation of the topological recursion, and integrable string theories

    CERN Document Server

    Eynard, Bertrand

    2009-01-01

    Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative geometry like maps, partitions, Hurwitz numbers, intersection numbers, Gromov-Witten invariants... The problem is thus to understand what they count, or in other words, given a spectral curve, construct an enumerative geometry problem. This is what we do in a semi-heuristic approach in this article. Starting from a spectral curve, i.e. an integrable system, we use its flat connection and flat coordinates, to define a family of worldsheets, whose enumeration is indeed solved by the topological recursion and symplectic invariants. In other words, for any spectral curve, we construct a corresponding string theory, whose target space is a submanifold of the Jacobian.

  20. Toward An Ontology of Mutual Recursion: Models, Mind and Media

    Directory of Open Access Journals (Sweden)

    Mat Wall-Smith

    2008-01-01

    Full Text Available In Parables for the Virtual Massumi describes 'The Autonomy of Affect' in our ecology of thought (Massumi 2002 : 35. The object of Stiegler's Technics and Time is 'technics apprehended as the horizon of all possibility to come and all possibility of a future' (Stiegler 1998 : ix. The ecological dynamic described by the recursion between this 'affective autonomy' and a 'technical horizon of possibility' describes a metamodel of the relation between body and world, between perception and expression. I argue that this metamodel allows for the technical architectures that enshrine media processes and models as both the manifestation and modulation of the 'industry' or vitality of mind. I argue that these technical architectures are crucial to the creation and maintenance of dynamic ecologies of living.

  1. Applying recursive numerical integration techniques for solving high dimensional integrals

    International Nuclear Information System (INIS)

    Ammon, Andreas; Genz, Alan; Hartung, Tobias; Jansen, Karl; Volmer, Julia; Leoevey, Hernan

    2016-11-01

    The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.

  2. A Recursive Fuzzy System for Efficient Digital Image Stabilization

    Directory of Open Access Journals (Sweden)

    Nikolaos Kyriakoulis

    2008-01-01

    Full Text Available A novel digital image stabilization technique is proposed in this paper. It is based on a fuzzy Kalman compensation of the global motion vector (GMV, which is estimated in the log-polar plane. The GMV is extracted using four local motion vectors (LMVs computed on respective subimages in the logpolar plane. The fuzzy Kalman system consists of a fuzzy system with the Kalman filter's discrete time-invariant definition. Due to this inherited recursiveness, the output results into smoothed image sequences. The proposed stabilization system aims to compensate any oscillations of the frame absolute positions, based on the motion estimation in the log-polar domain, filtered by the fuzzy Kalman system, and thus the advantages of both the fuzzy Kalman system and the log-polar transformation are exploited. The described technique produces optimal results in terms of the output quality and the level of compensation.

  3. Stochastic Recursive Algorithms for Optimization Simultaneous Perturbation Methods

    CERN Document Server

    Bhatnagar, S; Prashanth, L A

    2013-01-01

    Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms: • are easily implemented; • do not require an explicit system model; and • work with real or simulated data. Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix. The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from sim...

  4. Recursive model for the fragmentation of polarized quarks

    Science.gov (United States)

    Kerbizi, A.; Artru, X.; Belghobsi, Z.; Bradamante, F.; Martin, A.

    2018-04-01

    We present a model for Monte Carlo simulation of the fragmentation of a polarized quark. The model is based on string dynamics and the 3P0 mechanism of quark pair creation at string breaking. The fragmentation is treated as a recursive process, where the splitting function of the subprocess q →h +q' depends on the spin density matrix of the quark q . The 3P0 mechanism is parametrized by a complex mass parameter μ , the imaginary part of which is responsible for single spin asymmetries. The model has been implemented in a Monte Carlo program to simulate jets made of pseudoscalar mesons. Results for single hadron and hadron pair transverse-spin asymmetries are found to be in agreement with experimental data from SIDIS and e+e- annihilation. The model predictions on the jet-handedness are also discussed.

  5. Applying recursive numerical integration techniques for solving high dimensional integrals

    Energy Technology Data Exchange (ETDEWEB)

    Ammon, Andreas [IVU Traffic Technologies AG, Berlin (Germany); Genz, Alan [Washington State Univ., Pullman, WA (United States). Dept. of Mathematics; Hartung, Tobias [King' s College, London (United Kingdom). Dept. of Mathematics; Jansen, Karl; Volmer, Julia [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Leoevey, Hernan [Humboldt Univ. Berlin (Germany). Inst. fuer Mathematik

    2016-11-15

    The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.

  6. Normalized Minimum Error Entropy Algorithm with Recursive Power Estimation

    Directory of Open Access Journals (Sweden)

    Namyong Kim

    2016-06-01

    Full Text Available The minimum error entropy (MEE algorithm is known to be superior in signal processing applications under impulsive noise. In this paper, based on the analysis of behavior of the optimum weight and the properties of robustness against impulsive noise, a normalized version of the MEE algorithm is proposed. The step size of the MEE algorithm is normalized with the power of input entropy that is estimated recursively for reducing its computational complexity. The proposed algorithm yields lower minimum MSE (mean squared error and faster convergence speed simultaneously than the original MEE algorithm does in the equalization simulation. On the condition of the same convergence speed, its performance enhancement in steady state MSE is above 3 dB.

  7. Binary recursive partitioning: background, methods, and application to psychology.

    Science.gov (United States)

    Merkle, Edgar C; Shaffer, Victoria A

    2011-02-01

    Binary recursive partitioning (BRP) is a computationally intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor variables that were related to the response variable, along with the nature of the variables' relationships. No significance tests are involved, and the tree's 'goodness' is judged based on its predictive accuracy. In this paper, we describe BRP methods in a detailed manner and illustrate their use in psychological research. We also provide R code for carrying out the methods.

  8. A nested recursive logit model for route choice analysis

    DEFF Research Database (Denmark)

    Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

    2015-01-01

    choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination....... The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible......We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...

  9. Tracking of nuclear reactor parameters via recursive non linear estimation

    International Nuclear Information System (INIS)

    Pages Fita, J.; Alengrin, G.; Aguilar Martin, J.; Zwingelstein, M.

    1975-01-01

    The usefulness of nonlinear estimation in the supervision of nuclear reactors, as well for reactivity determination as for on-line modelisation in order to detect eventual and unwanted changes in working operation is illustrated. It is dealt with the reactivity estimation using an a priori dynamical model under the hypothesis of one group of delayed neutrons (measurements were done with an ionisation chamber). The determination of the reactivity using such measurements appears as a nonlinear estimation procedure derived from a particular form of nonlinear filter. Observed inputs being demand of power and inside temperature, and output being the reactivity balance, a recursive algorithm is derived for the estimation of the parameters that define the actual behavior of the reactor. Example of treatment of real data is given [fr

  10. Object grammars and random generation

    Directory of Open Access Journals (Sweden)

    I. Dutour

    1998-12-01

    Full Text Available This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.

  11. Automated fault tree synthesis by semantic network modeling, rulebased development and recursive 3-value procedure

    International Nuclear Information System (INIS)

    Kumamoto, Hiromitsu; Henley, E.J.

    1995-01-01

    A concept of flow is introduced to represent any material, information, energy, activity, or phenomenon which can move or propagate along flow paths to cause events specific to the system to be analyzed. A graphical equipment library is given to represent typical types of 'generation rate' and 'aperture' controllers. The system is modeled by a semantic network with labeled arrows showing effect to cause (backward) relationships between flow and equipment nodes. A correspondence between the equipment library and the system components is established, and the semantic network is constructed by integrating network fragments in the library. Fixed and/or free boundary conditions can be specified explicitly for flow or equipment nodes. Forward-chaining event development rules locally trace the labeled arrows, while a 3-value procedure guides the FT generation by recursive rule applications. The rules are obtained from tables and equipment definitions. The 3-value logic is used to truncate FTs according to the boundary conditions. Different FTs are generated for different top events and boundary conditions, given a semantic network model. FT modules and their hierarchies can be identified by examining network theoretic properties of flow nodes. The proposed approach is demonstrated for a relay system, a hypothetical swimming pool reactor and a chemical reactor

  12. Review of atomic mass formula

    Energy Technology Data Exchange (ETDEWEB)

    Tachibana, Takahiro [Waseda Univ., Tokyo (Japan). Advanced Research Center for Science and Engineering

    1997-07-01

    Wapstra and Audi`s Table is famous for evaluation of experimental data of atomic nuclear masses (1993/1995 version) which estimated about 2000 kinds of nuclei. The error of atomic mass of formula is 0.3 MeV-0.8 MeV. Four kinds of atomic mass formula: JM (Jaenecke and Masson), TUYY (Tachibana, Uno, Yamada and Yamada), FRDM (Moeller, Nix, Myers and Swiatecki) and ETFSI (Aboussir, Pearson, Dutta and Tondeur) and their properties (number of parameter and error etc.) were explained. An estimation method of theoretical error of mass formula was presented. It was estimated by the theoretical error of other surrounding nuclei. (S.Y.)

  13. Determination of a CO sub 2 rating formula for fossil-fired, electricity-generating power plants. Zur Festlegung einer CO sub 2 -Steuerformel fuer fossil-befeuerte, stromerzeugende Kraftwerke

    Energy Technology Data Exchange (ETDEWEB)

    Seifritz, W [Stuttgart Univ. (Germany). Inst. fuer Energiewirtschaft und Rationelle Energieanwendung

    1991-12-01

    Dr. Martin Proske was right in Ref (1) to point to the fact that a CO{sub 2}-tax has to take into account the quality of the secondary energy carrier, too. In the opinion of the author, however, the tax-formula of M. Proske has still to be modified if CO{sub 2}-free fossil power stations were introduced. Failing this, the development of CO{sub 2}-free power stations with the necessary removal and disposal of CO{sub 2} would be not attractive although this future type of a power station could substantially contribute to the climate-neutrality of fossil fuels. A corresponding modification of the tax-formula is proposed. (orig.).

  14. Pseudocode Interpreter (Pseudocode Integrated Development Environment with Lexical Analyzer and Syntax Analyzer using Recursive Descent Parsing Algorithm

    Directory of Open Access Journals (Sweden)

    Christian Lester D. Gimeno

    2017-11-01

    Full Text Available –This research study focused on the development of a software that helps students design, write, validate and run their pseudocode in a semi Integrated Development Environment (IDE instead of manually writing it on a piece of paper.Specifically, the study aimed to develop lexical analyzer or lexer, syntax analyzer or parser using recursive descent parsing algorithm and an interpreter. The lexical analyzer reads pseudocodesource in a sequence of symbols or characters as lexemes.The lexemes are then analyzed by the lexer that matches a pattern for valid tokens and passes to the syntax analyzer or parser. The syntax analyzer or parser takes those valid tokens and builds meaningful commands using recursive descent parsing algorithm in a form of an abstract syntax tree. The generation of an abstract syntax tree is based on the specified grammar rule created by the researcher expressed in Extended Backus-Naur Form. The Interpreter takes the generated abstract syntax tree and starts the evaluation or interpretation to produce pseudocode output. The software was evaluated using white-box testing by several ICT professionals and black-box testing by several computer science students based on the International Organization for Standardization (ISO 9126 software quality standards. The overall results of the evaluation both for white-box and black-box were described as “Excellent in terms of functionality, reliability, usability, efficiency, maintainability and portability”.

  15. Theory of Mind Development in Adolescence and Early Adulthood: The Growing Complexity of Recursive Thinking Ability

    Science.gov (United States)

    Valle, Annalisa; Massaro, Davide; Castelli, Ilaria; Marchetti, Antonella

    2015-01-01

    This study explores the development of theory of mind, operationalized as recursive thinking ability, from adolescence to early adulthood (N = 110; young adolescents = 47; adolescents = 43; young adults = 20). The construct of theory of mind has been operationalized in two different ways: as the ability to recognize the correct mental state of a character, and as the ability to attribute the correct mental state in order to predict the character’s behaviour. The Imposing Memory Task, with five recursive thinking levels, and a third-order false-belief task with three recursive thinking levels (devised for this study) have been used. The relationship among working memory, executive functions, and linguistic skills are also analysed. Results show that subjects exhibit less understanding of elevated recursive thinking levels (third, fourth, and fifth) compared to the first and second levels. Working memory is correlated with total recursive thinking, whereas performance on the linguistic comprehension task is related to third level recursive thinking in both theory of mind tasks. An effect of age on third-order false-belief task performance was also found. A key finding of the present study is that the third-order false-belief task shows significant age differences in the application of recursive thinking that involves the prediction of others’ behaviour. In contrast, such an age effect is not observed in the Imposing Memory Task. These results may support the extension of the investigation of the third order false belief after childhood. PMID:27247645

  16. Identifying risk profiles for childhood obesity using recursive partitioning based on individual, familial, and neighborhood environment factors.

    Science.gov (United States)

    Van Hulst, Andraea; Roy-Gagnon, Marie-Hélène; Gauvin, Lise; Kestens, Yan; Henderson, Mélanie; Barnett, Tracie A

    2015-02-15

    Few studies consider how risk factors within multiple levels of influence operate synergistically to determine childhood obesity. We used recursive partitioning analysis to identify unique combinations of individual, familial, and neighborhood factors that best predict obesity in children, and tested whether these predict 2-year changes in body mass index (BMI). Data were collected in 2005-2008 and in 2008-2011 for 512 Quebec youth (8-10 years at baseline) with a history of parental obesity (QUALITY study). CDC age- and sex-specific BMI percentiles were computed and children were considered obese if their BMI was ≥95th percentile. Individual (physical activity and sugar-sweetened beverage intake), familial (household socioeconomic status and measures of parental obesity including both BMI and waist circumference), and neighborhood (disadvantage, prestige, and presence of parks, convenience stores, and fast food restaurants) factors were examined. Recursive partitioning, a method that generates a classification tree predicting obesity based on combined exposure to a series of variables, was used. Associations between resulting varying risk group membership and BMI percentile at baseline and 2-year follow up were examined using linear regression. Recursive partitioning yielded 7 subgroups with a prevalence of obesity equal to 8%, 11%, 26%, 28%, 41%, 60%, and 63%, respectively. The 2 highest risk subgroups comprised i) children not meeting physical activity guidelines, with at least one BMI-defined obese parent and 2 abdominally obese parents, living in disadvantaged neighborhoods without parks and, ii) children with these characteristics, except with access to ≥1 park and with access to ≥1 convenience store. Group membership was strongly associated with BMI at baseline, but did not systematically predict change in BMI. Findings support the notion that obesity is predicted by multiple factors in different settings and provide some indications of potentially

  17. FDA Abbott Infant Formula Recall

    Data.gov (United States)

    U.S. Department of Health & Human Services — On September 22, 2010, Abbott issued a voluntary recall of certain Similac powdered infant formula after identifying a common warehouse beetle (both larvae and...

  18. Quadrature formulas for Fourier coefficients

    KAUST Repository

    Bojanov, Borislav; Petrova, Guergana

    2009-01-01

    We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node

  19. Efficient design of two-dimensional recursive digital filters. Final report

    International Nuclear Information System (INIS)

    Twogood, R.E.; Mitra, S.K.

    1980-01-01

    This report outlines the research progress during the period August 1978 to July 1979. This work can be divided into seven basic project areas. Project 1 deals with a comparative study of 2-D recursive and nonrecursive digital filters. The second project addresses a new design technique for 2-D half-plane recursive filters, and Projects 3 thru 5 deal with implementation issues. The sixth project presents our recent study of the applicability of array processors to 2-D digital signal processing. The final project involves our investigation into techniques for incorporating symmetry constraints on 2-D recursive filters in order to yield more efficient implementations

  20. Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

    Directory of Open Access Journals (Sweden)

    Marlowe Thomas J.

    1998-01-01

    Full Text Available Reliability is an important consideration in analyzing computer and other communication networks, but current techniques are extremely limited in the classes of graphs which can be analyzed efficiently. While Gilbert's formula establishes a theoretically elegant recursive relationship between the edge reliability of a graph and the reliability of its subgraphs, naive evaluation requires consideration of all sequences of deletions of individual vertices, and for many graphs has time complexity essentially Θ (N!. We discuss a general approach which significantly reduces complexity, encoding subgraph isomorphism in a finer partition by invariants, and recursing through the set of invariants. We illustrate this approach using threshhold graphs, and show that any computation of reliability using Gilbert's formula will be polynomial-time if and only if the number of invariants considered is polynomial; we then show families of graphs with polynomial-time, and non-polynomial reliability computation, and show that these encompass most previously known results. We then codify our approach to indicate how it can be used for other classes of graphs, and suggest several classes to which the technique can be applied.

  1. Natural product-like virtual libraries: recursive atom-based enumeration.

    Science.gov (United States)

    Yu, Melvin J

    2011-03-28

    A new molecular enumerator is described that allows chemically and architecturally diverse sets of natural product-like and drug-like structures to be generated from a core structure as simple as a single carbon atom or as complex as a polycyclic ring system. Integrated with a rudimentary machine-learning algorithm, the enumerator has the ability to assemble biased virtual libraries enriched in compounds predicted to meet target criteria. The ability to dynamically generate relatively small focused libraries in a recursive manner could reduce the computational time and infrastructure necessary to construct and manage extremely large static libraries. Depending on enumeration conditions, natural product-like structures can be produced with a wide range of heterocyclic and alicyclic ring assemblies. Because natural products represent a proven source of validated structures for identifying and designing new drug candidates, mimicking the structural and topological diversity found in nature with a dynamic set of virtual natural product-like compounds may facilitate the creation of new ideas for novel, biologically relevant lead structures in areas of uncharted chemical space.

  2. (Non)local Hamiltonian and symplectic structures, recursions and hierarchies: a new approach and applications to the N = 1 supersymmetric KdV equation

    International Nuclear Information System (INIS)

    Kersten, P; Krasil'shchik, I; Verbovetsky, A

    2004-01-01

    Using methods of Kersten et al (2004 J. Geom. Phys. 50 273-302) and Krasil'shchik and Kersten (2000 Symmetries and Recursion Operators for Classical and Supersymmetric Differential Equations (Dordrecht: Kluwer)), we accomplish an extensive study of the N = 1 supersymmetric Korteweg-de Vries (KdV) equation. The results include a description of local and nonlocal Hamiltonian and symplectic structures, five hierarchies of symmetries, the corresponding hierarchies of conservation laws, recursion operators for symmetries and generating functions of conservation laws. We stress that the main point of the paper is not just the results on super-KdV equation itself, but merely exposition of the efficiency of the geometrical approach and of the computational algorithms based on it

  3. An Integrated Approach for Non-Recursive Formulation of Connection-Coefficients of Orthogonal Functions

    Directory of Open Access Journals (Sweden)

    Monika GARG

    2012-08-01

    Full Text Available In this paper, an integrated approach is proposed for non-recursive formulation of connection coefficients of different orthogonal functions in terms of a generic orthogonal function. The application of these coefficients arises when the product of two orthogonal basis functions are to be expressed in terms of single basis functions. Two significant advantages are achieved; one, the non-recursive formulations avoid memory and stack overflows in computer implementations; two, the integrated approach provides for digital hardware once-designed can be used for different functions. Computational savings achieved with the proposed non-recursive formulation vis-à-vis recursive formulation, reported in the literature so far, have been demonstrated using MATLAB PROFILER.

  4. Recursive least squares method of regression coefficients estimation as a special case of Kalman filter

    Science.gov (United States)

    Borodachev, S. M.

    2016-06-01

    The simple derivation of recursive least squares (RLS) method equations is given as special case of Kalman filter estimation of a constant system state under changing observation conditions. A numerical example illustrates application of RLS to multicollinearity problem.

  5. Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model

    Energy Technology Data Exchange (ETDEWEB)

    Dymnikov, A D [University of St Petersburg, (Russian Federation). Institute of Computational Mathematics and Control Process

    1994-12-31

    In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs.

  6. Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model

    Energy Technology Data Exchange (ETDEWEB)

    Dymnikov, A.D. [University of St Petersburg, (Russian Federation). Institute of Computational Mathematics and Control Process

    1993-12-31

    In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs.

  7. Nonasymptotic form of the recursion relations of the three-dimensional Ising model

    International Nuclear Information System (INIS)

    Kozlovskii, M.P.

    1989-01-01

    Approximate recursion relations for the three-dimensional Ising model are obtained in the form of rapidly converging series. The representation of the recursion relations in the form of nonasymptotic series entails the abandonment of traditional perturbation theory based on a Gaussian measure density. The recursion relations proposed in the paper are used to calculate the critical exponent ν of the correlation length. It is shown that the difference form of the recursion relations leads, when higher non-Gaussian basis measures are used, to disappearance of a dependence of the critical exponent ν on s when s > 2 (s is the parameter of the division of the phase space into layers). The obtained results make it possible to calculate explicit expressions for the thermodynamic functions near the phase transition point

  8. Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model

    International Nuclear Information System (INIS)

    Dymnikov, A.D.

    1993-01-01

    In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs

  9. Fredholm's minors of arbitrary order: their representations as a determinant of resolvents and in terms of free fermions and an explicit formula for their functional derivative

    International Nuclear Information System (INIS)

    Feinberg, Joshua

    2004-01-01

    We study the Fredholm minors associated with a Fredholm equation of the second type. We present a couple of new linear recursion relations involving the nth and (n - 1)th minors, whose solution is a representation of the nth minor as an n x n determinant of resolvents. The latter is given a simple interpretation in terms of a path integral over non-interacting fermions. We also provide an explicit formula for the functional derivative of a Fredholm minor of order n with respect to the kernel. Our formula is a linear combination of the nth and the (n ± 1)th minors

  10. Using Recursive Regression to Explore Nonlinear Relationships and Interactions: A Tutorial Applied to a Multicultural Education Study

    Directory of Open Access Journals (Sweden)

    Kenneth David Strang

    2009-03-01

    Full Text Available This paper discusses how a seldom-used statistical procedure, recursive regression (RR, can numerically and graphically illustrate data-driven nonlinear relationships and interaction of variables. This routine falls into the family of exploratory techniques, yet a few interesting features make it a valuable compliment to factor analysis and multiple linear regression for method triangulation. By comparison, nonlinear cluster analysis also generates graphical dendrograms to visually depict relationships, but RR (as implemented here uses multiple combinations of nominal and interval predictors regressed on a categorical or ratio dependent variable. In similar fashion, multidimensional scaling, multiple discriminant analysis and conjoint analysis are constrained at best to predicting an ordinal dependent variable (as currently implemented in popular software. A flexible capability of RR (again as implemented here is the transformation of factor data (for substituting codes. One powerful RR feature is the ability to treat missing data as a theoretically important predictor value (useful for survey questions that respondents do not wish to answer. For practitioners, the paper summarizes how this technique fits within the generally-accepted statistical methods. Popular software such as SPSS, SAS or LISREL can be used, while sample data can be imported in common formats including ASCII text, comma delimited, Excel XLS, and SPSS SAV. A tutorial approach is applied here using RR in LISREL. The tutorial leverages a partial sample from a study that used recursive regression to predict grades from international student learning styles. Some tutorial portions are technical, to improve the ambiguous RR literature.

  11. Implicit learning of recursive context-free grammars.

    Science.gov (United States)

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

    Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.

  12. Decision-Directed Recursive Least Squares MIMO Channels Tracking

    Directory of Open Access Journals (Sweden)

    Karami Ebrahim

    2006-01-01

    Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.

  13. Implicit Learning of Recursive Context-Free Grammars

    Science.gov (United States)

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

    Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021

  14. Guided wave tomography in anisotropic media using recursive extrapolation operators

    Science.gov (United States)

    Volker, Arno

    2018-04-01

    Guided wave tomography is an advanced technology for quantitative wall thickness mapping to image wall loss due to corrosion or erosion. An inversion approach is used to match the measured phase (time) at a specific frequency to a model. The accuracy of the model determines the sizing accuracy. Particularly for seam welded pipes there is a measurable amount of anisotropy. Moreover, for small defects a ray-tracing based modelling approach is no longer accurate. Both issues are solved by applying a recursive wave field extrapolation operator assuming vertical transverse anisotropy. The inversion scheme is extended by not only estimating the wall loss profile but also the anisotropy, local material changes and transducer ring alignment errors. This makes the approach more robust. The approach will be demonstrated experimentally on different defect sizes, and a comparison will be made between this new approach and an isotropic ray-tracing approach. An example is given in Fig. 1 for a 75 mm wide, 5 mm deep defect. The wave field extrapolation based tomography clearly provides superior results.

  15. Implicit learning of recursive context-free grammars.

    Directory of Open Access Journals (Sweden)

    Martin Rohrmeier

    Full Text Available Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.

  16. Model-Based Recursive Partitioning for Subgroup Analyses.

    Science.gov (United States)

    Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten

    2016-05-01

    The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by predictive factors. The method starts with a model for the overall treatment effect as defined for the primary analysis in the study protocol and uses measures for detecting parameter instabilities in this treatment effect. The procedure produces a segmented model with differential treatment parameters corresponding to each patient subgroup. The subgroups are linked to predictive factors by means of a decision tree. The method is applied to the search for subgroups of patients suffering from amyotrophic lateral sclerosis that differ with respect to their Riluzole treatment effect, the only currently approved drug for this disease.

  17. Recursive Monte Carlo method for deep-penetration problems

    International Nuclear Information System (INIS)

    Goldstein, M.; Greenspan, E.

    1980-01-01

    The Recursive Monte Carlo (RMC) method developed for estimating importance function distributions in deep-penetration problems is described. Unique features of the method, including the ability to infer the importance function distribution pertaining to many detectors from, essentially, a single M.C. run and the ability to use the history tape created for a representative region to calculate the importance function in identical regions, are illustrated. The RMC method is applied to the solution of two realistic deep-penetration problems - a concrete shield problem and a Tokamak major penetration problem. It is found that the RMC method can provide the importance function distributions, required for importance sampling, with accuracy that is suitable for an efficient solution of the deep-penetration problems considered. The use of the RMC method improved, by one to three orders of magnitude, the solution efficiency of the two deep-penetration problems considered: a concrete shield problem and a Tokamak major penetration problem. 8 figures, 4 tables

  18. Measurement of [Formula: see text] polarisation in [Formula: see text] collisions at [Formula: see text] = 7 TeV.

    Science.gov (United States)

    Aaij, R; Adeva, B; Adinolfi, M; Affolder, A; Ajaltouni, Z; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves, A A; Amato, S; Amerio, S; Amhis, Y; An, L; Anderlini, L; Anderson, J; Andreassen, R; Andreotti, M; Andrews, J E; Appleby, R B; Aquines Gutierrez, O; Archilli, F; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Bachmann, S; Back, J J; Badalov, A; Balagura, V; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Batozskaya, V; Bauer, Th; Bay, A; Beddow, J; Bedeschi, F; Bediaga, I; Belogurov, S; Belous, K; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bettler, M-O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Bizzeti, A; Bjørnstad, P M; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Borsato, M; Bowcock, T J V; Bowen, E; Bozzi, C; Brambach, T; van den Brand, J; Bressieux, J; Brett, D; Britsch, M; Britton, T; Brook, N H; Brown, H; Bursche, A; Busetto, G; Buytaert, J; Cadeddu, S; Calabrese, R; Callot, O; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carranza-Mejia, H; Carson, L; Carvalho Akiba, K; Casse, G; Cassina, L; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cenci, R; Charles, M; Charpentier, Ph; Cheung, S-F; Chiapolini, N; Chrzaszcz, M; Ciba, K; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coca, C; Coco, V; Cogan, J; Cogneras, E; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombes, M; Coquereau, S; Corti, G; Corvo, M; Counts, I; Couturier, B; Cowan, G A; Craik, D C; Cruz Torres, M; Cunliffe, S; Currie, R; D'Ambrosio, C; Dalseno, J; David, P; David, P N Y; Davis, A; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Silva, W; De Simone, P; Decamp, D; Deckenhoff, M; Del Buono, L; Déléage, N; Derkach, D; Deschamps, O; Dettori, F; Di Canto, A; Dijkstra, H; Donleavy, S; Dordei, F; Dorigo, M; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dupertuis, F; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; El Rifai, I; Elsasser, Ch; Esen, S; Evans, T; Falabella, A; Färber, C; Farinelli, C; Farry, S; Ferguson, D; Fernandez Albor, V; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fiore, M; Fiorini, M; Firlej, M; Fitzpatrick, C; Fiutowski, T; Fontana, M; Fontanelli, F; Forty, R; Francisco, O; Frank, M; Frei, C; Frosini, M; Fu, J; Furfaro, E; Gallas Torreira, A; Galli, D; Gandelman, M; Gandini, P; Gao, Y; Garofoli, J; Garra Tico, J; Garrido, L; Gaspar, C; Gauld, R; Gavardi, L; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gianelle, A; Giani, S; Gibson, V; Giubega, L; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gordon, H; Gotti, C; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Griffith, P; Grillo, L; Grünberg, O; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Haines, S C; Hall, S; Hamilton, B; Hampson, T; Han, X; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hartmann, T; He, J; Head, T; Heijne, V; Hennessy, K; Henrard, P; Henry, L; Hernando Morata, J A; van Herwijnen, E; Heß, M; Hicheur, A; Hill, D; Hoballah, M; Hombach, C; Hulsbergen, W; Hunt, P; Hussain, N; Hutchcroft, D; Hynds, D; Iakovenko, V; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jalocha, J; Jans, E; Jaton, P; Jawahery, A; Jezabek, M; Jing, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Jurik, N; Kaballo, M; Kandybei, S; Kanso, W; Karacson, M; Karbach, T M; Kelsey, M; Kenyon, I R; Ketel, T; Khanji, B; Khurewathanakul, C; Klaver, S; Kochebina, O; Kolpin, M; Komarov, I; Koopman, R F; Koppenburg, P; Korolev, M; Kozlinskiy, A; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kucharczyk, M; Kudryavtsev, V; Kurek, K; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanciotti, E; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J-P; Lefèvre, R; Leflat, A; Lefrançois, J; Leo, S; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Liles, M; Lindner, R; Linn, C; Lionetto, F; Liu, B; Liu, G; Lohn, S; Longstaff, I; Longstaff, I; Lopes, J H; Lopez-March, N; Lowdon, P; Lu, H; Lucchesi, D; Luisier, J; Luo, H; Lupato, A; Luppi, E; Lupton, O; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Malde, S; Manca, G; Mancinelli, G; Manzali, M; Maratas, J; Marchand, J F; Marconi, U; Marino, P; Märki, R; Marks, J; Martellotti, G; Martens, A; Martín Sánchez, A; Martinelli, M; Martinez Santos, D; Martinez Vidal, F; Martins Tostes, D; Massafferri, A; Matev, R; Mathe, Z; Matteuzzi, C; Mazurov, A; McCann, M; McCarthy, J; McNab, A; McNulty, R; McSkelly, B; Meadows, B; Meier, F; Meissner, M; Merk, M; Milanes, D A; Minard, M-N; Molina Rodriguez, J; Monteil, S; Moran, D; Morandin, M; Morawski, P; Mordà, A; Morello, M J; Moron, J; Mountain, R; Muheim, F; Müller, K; Muresan, R; Muster, B; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Needham, M; Neri, N; Neubert, S; Neufeld, N; Neuner, M; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Nicol, M; Niess, V; Niet, R; Nikitin, N; Nikodem, T; Novoselov, A; Oblakowska-Mucha, A; Obraztsov, V; Oggero, S; Ogilvy, S; Okhrimenko, O; Oldeman, R; Onderwater, G; Orlandea, M; Otalora Goicochea, J M; Owen, P; Oyanguren, A; Pal, B K; Palano, A; Palombo, F; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Parkes, C; Parkinson, C J; Passaleva, G; Patel, G D; Patel, M; Patrignani, C; Pazos Alvarez, A; Pearce, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perez Trigo, E; Perret, P; Perrin-Terrin, M; Pescatore, L; Pesen, E; Petridis, K; Petrolini, A; Picatoste Olloqui, E; Pietrzyk, B; Pilař, T; Pinci, D; Pistone, A; Playfer, S; Plo Casasus, M; Polci, F; Polok, G; Poluektov, A; Polycarpo, E; Popov, A; Popov, D; Popovici, B; Potterat, C; Powell, A; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Rachwal, B; Rademacker, J H; Rakotomiaramanana, B; Rama, M; Rangel, M S; Raniuk, I; Rauschmayr, N; Raven, G; Redford, S; Reichert, S; Reid, M M; Dos Reis, A C; Ricciardi, S; Richards, A; Rinnert, K; Rives Molina, V; Roa Romero, D A; Robbe, P; Rodrigues, A B; Rodrigues, E; Rodriguez Perez, P; Roiser, S; Romanovsky, V; Romero Vidal, A; Rotondo, M; Rouvinet, J; Ruf, T; Ruffini, F; Ruiz, H; Ruiz Valls, P; Sabatino, G; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salustino Guimaraes, V; Sanchez Mayordomo, C; Sanmartin Sedes, B; Santacesaria, R; Santamarina Rios, C; Santovetti, E; Sapunov, M; Sarti, A; Satriano, C; Satta, A; Savrie, M; Savrina, D; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmidt, B; Schneider, O; Schopper, A; Schune, M-H; Schwemmer, R; Sciascia, B; Sciubba, A; Seco, M; Semennikov, A; Senderowska, K; Sepp, I; Serra, N; Serrano, J; Sestini, L; Seyfert, P; Shapkin, M; Shapoval, I; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, V; Shires, A; Silva Coutinho, R; Simi, G; Sirendi, M; Skidmore, N; Skwarnicki, T; Smith, N A; Smith, E; Smith, E; Smith, J; Smith, M; Snoek, H; Sokoloff, M D; Soler, F J P; Soomro, F; Souza, D; Souza De Paula, B; Spaan, B; Sparkes, A; Spinella, F; Spradlin, P; Stagni, F; Stahl, S; Steinkamp, O; Stenyakin, O; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Stracka, S; Straticiuc, M; Straumann, U; Stroili, R; Subbiah, V K; Sun, L; Sutcliffe, W; Swientek, K; Swientek, S; Syropoulos, V; Szczekowski, M; Szczypka, P; Szilard, D; Szumlak, T; T'Jampens, S; Teklishyn, M; Tellarini, G; Teodorescu, E; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Tolk, S; Tomassetti, L; Tonelli, D; Topp-Joergensen, S; Torr, N; Tournefier, E; Tourneur, S; Tran, M T; Tresch, M; Tsaregorodtsev, A; Tsopelas, P; Tuning, N; Ubeda Garcia, M; Ukleja, A; Ustyuzhanin, A; Uwer, U; Vagnoni, V; Valenti, G; Vallier, A; Vazquez Gomez, R; Vazquez Regueiro, P; Vázquez Sierra, C; Vecchi, S; Velthuis, J J; Veltri, M; Veneziano, G; Vesterinen, M; Viaud, B; Vieira, D; Vieites Diaz, M; Vilasis-Cardona, X; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; Voss, H; de Vries, J A; Waldi, R; Wallace, C; Wallace, R; Walsh, J; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Webber, A D; Websdale, D; Whitehead, M; Wicht, J; Wiedner, D; Wiggers, L; Wilkinson, G; Williams, M P; Williams, M; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wormser, G; Wotton, S A; Wright, S; Wu, S; Wyllie, K; Xie, Y; Xing, Z; Xu, Z; Yang, Z; Yuan, X; Yushchenko, O; Zangoli, M; Zavertyaev, M; Zhang, F; Zhang, L; Zhang, W C; Zhang, Y; Zhelezov, A; Zhokhov, A; Zhong, L; Zvyagin, A

    The polarisation of prompt [Formula: see text] mesons is measured by performing an angular analysis of [Formula: see text] decays using proton-proton collision data, corresponding to an integrated luminosity of 1.0[Formula: see text], collected by the LHCb detector at a centre-of-mass energy of 7 TeV. The polarisation is measured in bins of transverse momentum [Formula: see text] and rapidity [Formula: see text] in the kinematic region [Formula: see text] and [Formula: see text], and is compared to theoretical models. No significant polarisation is observed.

  19. Estimation of Mechanical Signals in Induction Motors using the Recursive Prediction Error Method

    DEFF Research Database (Denmark)

    Børsting, H.; Knudsen, Morten; Rasmussen, Henrik

    1993-01-01

    Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed ........Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed .....

  20. Hill's formula

    Energy Technology Data Exchange (ETDEWEB)

    Bolotin, Sergey V [Steklov Mathematical Institute, Russian Academy of Sciences, Moscow (Russian Federation); Treschev, Dmitrii V [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

    2010-07-27

    In his study of periodic orbits of the three-body problem, Hill obtained a formula connecting the characteristic polynomial of the monodromy matrix of a periodic orbit with the infinite determinant of the Hessian of the action functional. A mathematically rigorous definition of the Hill determinant and a proof of Hill's formula were obtained later by Poincare. Here two multidimensional generalizations of Hill's formula are given: for discrete Lagrangian systems (symplectic twist maps) and for continuous Lagrangian systems. Additional aspects appearing in the presence of symmetries or reversibility are discussed. Also studied is the change of the Morse index of a periodic trajectory upon reduction of order in a system with symmetries. Applications are given to the problem of stability of periodic orbits. Bibliography: 34 titles.

  1. Semiclassical structure of trace formulas

    International Nuclear Information System (INIS)

    Littlejohn, R.G.

    1990-01-01

    Trace formulas provide the only general relations known connecting quantum mechanics with classical mechanics in the case that the classical motion is chaotic. In particular, they connect quantal objects such as the density of states with classical periodic orbits. In this paper, several trace formulas, including those of Gutzwiller, Balian and Bloch, Tabor, and Berry, are examined from a geometrical standpoint. New forms of the amplitude determinant in asymptotic theory are developed as tools for this examination. The meaning of caustics in these formulas is revealed in terms of intersections of Lagrangian manifolds in phase space. The periodic orbits themselves appear as caustics of an unstable kind, lying on the intersection of two Lagrangian manifolds in the appropriate phase space. New insight is obtained into the Weyl correspondence and the Wigner function, especially their caustic structures

  2. Evaluating four readability formulas for Afrikaans.

    NARCIS (Netherlands)

    Jansen, C. J. M.; Richards, Rose; Van Zyl, Liezl

    2017-01-01

    For almost a hundred years now, readability formulas have been used to measure how difficult it is to comprehend a given text. To date, four readability formulas have been developed for Afrikaans. Two such formulas were published by Van Rooyen (1986), one formula by McDermid Heyns (2007) and one

  3. 27 CFR 5.27 - Formulas.

    Science.gov (United States)

    2010-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Formulas. 5.27 Section 5.27 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU, DEPARTMENT OF THE TREASURY LIQUORS LABELING AND ADVERTISING OF DISTILLED SPIRITS Formulas § 5.27 Formulas. Formulas are...

  4. A recursive microfluidic platform to explore the emergence of chemical evolution

    Directory of Open Access Journals (Sweden)

    David Doran

    2017-08-01

    Full Text Available We propose that a chemically agnostic approach to explore the origin of life, using an automated recursive platform based on droplet microfluidics, could be used to induce artificial chemical evolution by iterations of growth, speciation, selection, and propagation. To explore this, we set about designing an open source prototype of a fully automated evolution machine, comprising seven modules. These modules are a droplet generator, droplet transfer, passive and active size sorting, splitter, incubation chamber, reservoir, and injectors, all run together via a LabVIEWTM program integration system. Together we aim for the system to be used to drive cycles of droplet birth, selection, fusion, and propagation. As a proof of principle, in addition to the working individual modules, we present data showing the osmotic exchange of glycylglycine containing and pure aqueous droplets, showing that the fittest droplets exhibit higher osomolarity relative to their neighbours, and increase in size compared to their neighbours. This demonstrates the ability of our platform to explore some different physicochemical conditions, combining the efficiency and unbiased nature of automation with our ability to select droplets as functional units based on simple criteria.

  5. Manin matrices and Talalaev's formula

    International Nuclear Information System (INIS)

    Chervov, A; Falqui, G

    2008-01-01

    In this paper we study properties of Lax and transfer matrices associated with quantum integrable systems. Our point of view stems from the fact that their elements satisfy special commutation properties, considered by Yu I Manin some 20 years ago at the beginning of quantum group theory. These are the commutation properties of matrix elements of linear homomorphisms between polynomial rings; more explicitly these read: (1) elements of the same column commute; (2) commutators of the cross terms are equal: [M ij , M kl ] [M kj , M il ] (e.g. [M 11 , M 22 ] = [M 21 , M 12 ]). The main aim of this paper is twofold: on the one hand we observe and prove that such matrices (which we call Manin matrices in short) behave almost as well as matrices with commutative elements. Namely, the theorems of linear algebra (e.g., a natural definition of the determinant, the Cayley-Hamilton theorem, the Newton identities and so on and so forth) have a straightforward counterpart in the case of Manin matrices. On the other hand, we remark that such matrices are somewhat ubiquitous in the theory of quantum integrability. For instance, Manin matrices (and their q-analogs) include matrices satisfying the Yang-Baxter relation 'RTT=TTR' and the so-called Cartier-Foata matrices. Also, they enter Talalaev's remarkable formulae: det(∂ z -L gaudin (z)), det(1-e -∂z T Yangian (z)) for the 'quantum spectral curve', and appear in the separation of variables problem and Capelli identities. We show that theorems of linear algebra, after being established for such matrices, have various applications to quantum integrable systems and Lie algebras, e.g. in the construction of new generators in Z(U crit (gl-hat n )) (and, in general, in the construction of quantum conservation laws), in the Knizhnik-Zamolodchikov equation, and in the problem of Wick ordering. We propose, in the appendix, a construction of quantum separated variables for the XXX-Heisenberg system

  6. Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind

    Science.gov (United States)

    Bánréti, Zoltán; Hoffmann, Ildikó; Vincze, Veronika

    2016-01-01

    The relationship between recursive sentence embedding and theory-of-mind (ToM) inference is investigated in three persons with Broca's aphasia, two persons with Wernicke's aphasia, and six persons with mild and moderate Alzheimer's disease (AD). We asked questions of four types about photographs of various real-life situations. Type 4 questions asked participants about intentions, thoughts, or utterances of the characters in the pictures (“What may X be thinking/asking Y to do?”). The expected answers typically involved subordinate clauses introduced by conjunctions or direct quotations of the characters' utterances. Broca's aphasics did not produce answers with recursive sentence embedding. Rather, they projected themselves into the characters' mental states and gave direct answers in the first person singular, with relevant ToM content. We call such replies “situative statements.” Where the question concerned the mental state of the character but did not require an answer with sentence embedding (“What does X hate?”), aphasics gave descriptive answers rather than situative statements. Most replies given by persons with AD to Type 4 questions were grammatical instances of recursive sentence embedding. They also gave a few situative statements but the ToM content of these was irrelevant. In more than one third of their well-formed sentence embeddings, too, they conveyed irrelevant ToM contents. Persons with moderate AD were unable to pass secondary false belief tests. The results reveal double dissociation: Broca's aphasics are unable to access recursive sentence embedding but they can make appropriate ToM inferences; moderate AD persons make the wrong ToM inferences but they are able to access recursive sentence embedding. The double dissociation may be relevant for the nature of the relationship between the two recursive capacities. Broca's aphasics compensated for the lack of recursive sentence embedding by recursive ToM reasoning represented in very

  7. One-particle many-body Green's function theory: Algebraic recursive definitions, linked-diagram theorem, irreducible-diagram theorem, and general-order algorithms.

    Science.gov (United States)

    Hirata, So; Doran, Alexander E; Knowles, Peter J; Ortiz, J V

    2017-07-28

    A thorough analytical and numerical characterization of the whole perturbation series of one-particle many-body Green's function (MBGF) theory is presented in a pedagogical manner. Three distinct but equivalent algebraic (first-quantized) recursive definitions of the perturbation series of the Green's function are derived, which can be combined with the well-known recursion for the self-energy. Six general-order algorithms of MBGF are developed, each implementing one of the three recursions, the ΔMPn method (where n is the perturbation order) [S. Hirata et al., J. Chem. Theory Comput. 11, 1595 (2015)], the automatic generation and interpretation of diagrams, or the numerical differentiation of the exact Green's function with a perturbation-scaled Hamiltonian. They all display the identical, nondivergent perturbation series except ΔMPn, which agrees with MBGF in the diagonal and frequency-independent approximations at 1≤n≤3 but converges at the full-configuration-interaction (FCI) limit at n=∞ (unless it diverges). Numerical data of the perturbation series are presented for Koopmans and non-Koopmans states to quantify the rate of convergence towards the FCI limit and the impact of the diagonal, frequency-independent, or ΔMPn approximation. The diagrammatic linkedness and thus size-consistency of the one-particle Green's function and self-energy are demonstrated at any perturbation order on the basis of the algebraic recursions in an entirely time-independent (frequency-domain) framework. The trimming of external lines in a one-particle Green's function to expose a self-energy diagram and the removal of reducible diagrams are also justified mathematically using the factorization theorem of Frantz and Mills. Equivalence of ΔMPn and MBGF in the diagonal and frequency-independent approximations at 1≤n≤3 is algebraically proven, also ascribing the differences at n = 4 to the so-called semi-reducible and linked-disconnected diagrams.

  8. Use of genomic recursions and algorithm for proven and young animals for single-step genomic BLUP analyses--a simulation study.

    Science.gov (United States)

    Fragomeni, B O; Lourenco, D A L; Tsuruta, S; Masuda, Y; Aguilar, I; Misztal, I

    2015-10-01

    The purpose of this study was to examine accuracy of genomic selection via single-step genomic BLUP (ssGBLUP) when the direct inverse of the genomic relationship matrix (G) is replaced by an approximation of G(-1) based on recursions for young genotyped animals conditioned on a subset of proven animals, termed algorithm for proven and young animals (APY). With the efficient implementation, this algorithm has a cubic cost with proven animals and linear with young animals. Ten duplicate data sets mimicking a dairy cattle population were simulated. In a first scenario, genomic information for 20k genotyped bulls, divided in 7k proven and 13k young bulls, was generated for each replicate. In a second scenario, 5k genotyped cows with phenotypes were included in the analysis as young animals. Accuracies (average for the 10 replicates) in regular EBV were 0.72 and 0.34 for proven and young animals, respectively. When genomic information was included, they increased to 0.75 and 0.50. No differences between genomic EBV (GEBV) obtained with the regular G(-1) and the approximated G(-1) via the recursive method were observed. In the second scenario, accuracies in GEBV (0.76, 0.51 and 0.59 for proven bulls, young males and young females, respectively) were also higher than those in EBV (0.72, 0.35 and 0.49). Again, no differences between GEBV with regular G(-1) and with recursions were observed. With the recursive algorithm, the number of iterations to achieve convergence was reduced from 227 to 206 in the first scenario and from 232 to 209 in the second scenario. Cows can be treated as young animals in APY without reducing the accuracy. The proposed algorithm can be implemented to reduce computing costs and to overcome current limitations on the number of genotyped animals in the ssGBLUP method. © 2015 Blackwell Verlag GmbH.

  9. Ground-state magnetization of the Ising spin glass: A recursive numerical method and Chen-Ma scaling

    Science.gov (United States)

    Sepehrinia, Reza; Chalangari, Fartash

    2018-03-01

    The ground-state properties of quasi-one-dimensional (Q1D) Ising spin glass are investigated using an exact numerical approach and analytical arguments. A set of coupled recursive equations for the ground-state energy are introduced and solved numerically. For various types of coupling distribution, we obtain accurate results for magnetization, particularly in the presence of a weak external magnetic field. We show that in the weak magnetic field limit, similar to the 1D model, magnetization exhibits a singular power-law behavior with divergent susceptibility. Remarkably, the spectrum of magnetic exponents is markedly different from that of the 1D system even in the case of two coupled chains. The magnetic exponent makes a crossover from being dependent on a distribution function to a constant value independent of distribution. We provide an analytic theory for these observations by extending the Chen-Ma argument to the Q1D case. We derive an analytical formula for the exponent which is in perfect agreement with the numerical results.

  10. Measurement of azimuthal correlations of D mesons with charged particles in pp collisions at [Formula: see text] TeV and p-Pb collisions at [Formula: see text] TeV.

    Science.gov (United States)

    Adam, J; Adamová, D; Aggarwal, M M; Aglieri Rinella, G; Agnello, M; Agrawal, N; Ahammed, Z; Ahmad, S; Ahn, S U; Aiola, S; Akindinov, A; Alam, S N; Albuquerque, D S D; Aleksandrov, D; Alessandro, B; Alexandre, D; Alfaro Molina, R; Alici, A; Alkin, A; Almaraz, J R M; Alme, J; Alt, T; Altinpinar, S; Altsybeev, I; Alves Garcia Prado, C; Andrei, C; Andronic, A; Anguelov, V; Antičić, T; Antinori, F; Antonioli, P; Aphecetche, L; Appelshäuser, H; Arcelli, S; Arnaldi, R; Arnold, O W; Arsene, I C; Arslandok, M; Audurier, B; Augustinus, A; Averbeck, R; Azmi, M D; Badalà, A; Baek, Y W; Bagnasco, S; Bailhache, R; Bala, R; Balasubramanian, S; Baldisseri, A; Baral, R C; Barbano, A M; Barbera, R; Barile, F; Barnaföldi, G G; Barnby, L S; Barret, V; Bartalini, P; Barth, K; Bartke, J; Bartsch, E; Basile, M; Bastid, N; Basu, S; Bathen, B; Batigne, G; Batista Camejo, A; Batyunya, B; Batzing, P C; Bearden, I G; Beck, H; Bedda, C; Behera, N K; Belikov, I; Bellini, F; Bello Martinez, H; Bellwied, R; Belmont, R; Belmont-Moreno, E; Beltran, L G E; Belyaev, V; Bencedi, G; Beole, S; Berceanu, I; Bercuci, A; Berdnikov, Y; Berenyi, D; Bertens, R A; Berzano, D; Betev, L; Bhasin, A; Bhat, I R; Bhati, A K; Bhattacharjee, B; Bhom, J; Bianchi, L; Bianchi, N; Bianchin, C; Bielčík, J; Bielčíková, J; Bilandzic, A; Biro, G; Biswas, R; Biswas, S; Bjelogrlic, S; Blair, J T; Blau, D; Blume, C; Bock, F; Bogdanov, A; Bøggild, H; Boldizsár, L; Bombara, M; Bonora, M; Book, J; Borel, H; Borissov, A; Borri, M; Bossú, F; Botta, E; Bourjau, C; Braun-Munzinger, P; Bregant, M; Breitner, T; Broker, T A; Browning, T A; Broz, M; Brucken, E J; Bruna, E; Bruno, G E; Budnikov, D; Buesching, H; Bufalino, S; Buitron, S A I; Buncic, P; Busch, O; Buthelezi, Z; Butt, J B; Buxton, J T; Cabala, J; Caffarri, D; Cai, X; Caines, H; Diaz, L Calero; Caliva, A; Calvo Villar, E; Camerini, P; Carena, F; Carena, W; Carnesecchi, F; Castillo Castellanos, J; Castro, A J; Casula, E A R; Ceballos Sanchez, C; Cepila, J; Cerello, P; Cerkala, J; Chang, B; Chapeland, S; Chartier, M; Charvet, J L; Chattopadhyay, S; Chattopadhyay, S; Chauvin, A; Chelnokov, V; Cherney, M; Cheshkov, C; Cheynis, B; Chibante Barroso, V; Chinellato, D D; Cho, S; Chochula, P; Choi, K; Chojnacki, M; Choudhury, S; Christakoglou, P; Christensen, C H; Christiansen, P; Chujo, T; Chung, S U; Cicalo, C; Cifarelli, L; Cindolo, F; Cleymans, J; Colamaria, F; Colella, D; Collu, A; Colocci, M; Conesa Balbastre, G; Conesa Del Valle, Z; Connors, M E; Contreras, J G; Cormier, T M; Corrales Morales, Y; Cortés Maldonado, I; Cortese, P; Cosentino, M R; Costa, F; Crkovská, J; Crochet, P; Cruz Albino, R; Cuautle, E; Cunqueiro, L; Dahms, T; Dainese, A; Danisch, M C; Danu, A; Das, D; Das, I; Das, S; Dash, A; Dash, S; De, S; De Caro, A; de Cataldo, G; de Conti, C; de Cuveland, J; De Falco, A; De Gruttola, D; De Marco, N; De Pasquale, S; De Souza, R D; Deisting, A; Deloff, A; Dénes, E; Deplano, C; Dhankher, P; Di Bari, D; Di Mauro, A; Di Nezza, P; Di Ruzza, B; Diaz Corchero, M A; Dietel, T; Dillenseger, P; Divià, R; Djuvsland, Ø; Dobrin, A; Domenicis Gimenez, D; Dönigus, B; Dordic, O; Drozhzhova, T; Dubey, A K; Dubla, A; Ducroux, L; Dupieux, P; Ehlers, R J; Elia, D; Endress, E; Engel, H; Epple, E; Erazmus, B; Erdemir, I; Erhardt, F; Espagnon, B; Estienne, M; Esumi, S; Eum, J; Evans, D; Evdokimov, S; Eyyubova, G; Fabbietti, L; Fabris, D; Faivre, J; Fantoni, A; Fasel, M; Feldkamp, L; Feliciello, A; Feofilov, G; Ferencei, J; Fernández Téllez, A; Ferreiro, E G; Ferretti, A; Festanti, A; Feuillard, V J G; Figiel, J; Figueredo, M A S; Filchagin, S; Finogeev, D; Fionda, F M; Fiore, E M; Fleck, M G; Floris, M; Foertsch, S; Foka, P; Fokin, S; Fragiacomo, E; Francescon, A; Francisco, A; Frankenfeld, U; Fronze, G G; Fuchs, U; Furget, C; Furs, A; Fusco Girard, M; Gaardhøje, J J; Gagliardi, M; Gago, A M; Gajdosova, K; Gallio, M; Galvan, C D; Gangadharan, D R; Ganoti, P; Gao, C; Garabatos, C; Garcia-Solis, E; Gargiulo, C; Gasik, P; Gauger, E F; Germain, M; Gheata, M; Ghosh, P; Ghosh, S K; Gianotti, P; Giubellino, P; Giubilato, P; Gladysz-Dziadus, E; Glässel, P; Goméz Coral, D M; Gomez Ramirez, A; Gonzalez, A S; Gonzalez, V; González-Zamora, P; Gorbunov, S; Görlich, L; Gotovac, S; Grabski, V; Grachov, O A; Graczykowski, L K; Graham, K L; Grelli, A; Grigoras, A; Grigoras, C; Grigoriev, V; Grigoryan, A; Grigoryan, S; Grinyov, B; Grion, N; Gronefeld, J M; Grosse-Oetringhaus, J F; Grosso, R; Gruber, L; Guber, F; Guernane, R; Guerzoni, B; Gulbrandsen, K; Gunji, T; Gupta, A; Gupta, R; Haake, R; Hadjidakis, C; Haiduc, M; Hamagaki, H; Hamar, G; Hamon, J C; Harris, J W; Harton, A; Hatzifotiadou, D; Hayashi, S; Heckel, S T; Hellbär, E; Helstrup, H; Herghelegiu, A; Herrera Corral, G; Hess, B A; Hetland, K F; Hillemanns, H; Hippolyte, B; Horak, D; Hosokawa, R; Hristov, P; Hughes, C; Humanic, T J; Hussain, N; Hussain, T; Hutter, D; Hwang, D S; Ilkaev, R; Inaba, M; Incani, E; Ippolitov, M; Irfan, M; Isakov, V; Ivanov, M; Ivanov, V; Izucheev, V; Jacak, B; Jacazio, N; Jacobs, P M; Jadhav, M B; Jadlovska, S; Jadlovsky, J; Jahnke, C; Jakubowska, M J; Janik, M A; Jayarathna, P H S Y; Jena, C; Jena, S; Jimenez Bustamante, R T; Jones, P G; Jusko, A; Kalinak, P; Kalweit, A; Kang, J H; Kaplin, V; Kar, S; Karasu Uysal, A; Karavichev, O; Karavicheva, T; Karayan, L; Karpechev, E; Kebschull, U; Keidel, R; Keijdener, D L D; Keil, M; Khan, M Mohisin; Khan, P; Khan, S A; Khanzadeev, A; Kharlov, Y; Kileng, B; Kim, D W; Kim, D J; Kim, D; Kim, H; Kim, J S; Kim, J; Kim, M; Kim, M; Kim, S; Kim, T; Kirsch, S; Kisel, I; Kiselev, S; Kisiel, A; Kiss, G; Klay, J L; Klein, C; Klein, J; Klein-Bösing, C; Klewin, S; Kluge, A; Knichel, M L; Knospe, A G; Kobdaj, C; Kofarago, M; Kollegger, T; Kolojvari, A; Kondratiev, V; Kondratyeva, N; Kondratyuk, E; Konevskikh, A; Kopcik, M; Kour, M; Kouzinopoulos, C; Kovalenko, O; Kovalenko, V; Kowalski, M; Koyithatta Meethaleveedu, G; Králik, I; Kravčáková, A; Krivda, M; Krizek, F; Kryshen, E; Krzewicki, M; Kubera, A M; Kučera, V; Kuhn, C; Kuijer, P G; Kumar, A; Kumar, J; Kumar, L; Kumar, S; Kurashvili, P; Kurepin, A; Kurepin, A B; Kuryakin, A; Kweon, M J; Kwon, Y; La Pointe, S L; La Rocca, P; Ladron de Guevara, P; Lagana Fernandes, C; Lakomov, I; Langoy, R; Lapidus, K; Lara, C; Lardeux, A; Lattuca, A; Laudi, E; Lea, R; Leardini, L; Lee, S; Lehas, F; Lehner, S; Lemmon, R C; Lenti, V; Leogrande, E; León Monzón, I; León Vargas, H; Leoncino, M; Lévai, P; Li, S; Li, X; Lien, J; Lietava, R; Lindal, S; Lindenstruth, V; Lippmann, C; Lisa, M A; Ljunggren, H M; Lodato, D F; Loenne, P I; Loginov, V; Loizides, C; Lopez, X; López Torres, E; Lowe, A; Luettig, P; Lunardon, M; Luparello, G; Lupi, M; Lutz, T H; Maevskaya, A; Mager, M; Mahajan, S; Mahmood, S M; Maire, A; Majka, R D; Malaev, M; Maldonado Cervantes, I; Malinina, L; Mal'Kevich, D; Malzacher, P; Mamonov, A; Manko, V; Manso, F; Manzari, V; Mao, Y; Marchisone, M; Mareš, J; Margagliotti, G V; Margotti, A; Margutti, J; Marín, A; Markert, C; Marquard, M; Martin, N A; Martinengo, P; Martínez, M I; Martínez García, G; Martinez Pedreira, M; Mas, A; Masciocchi, S; Masera, M; Masoni, A; Mastroserio, A; Matyja, A; Mayer, C; Mazer, J; Mazzoni, M A; Mcdonald, D; Meddi, F; Melikyan, Y; Menchaca-Rocha, A; Meninno, E; Mercado Pérez, J; Meres, M; Mhlanga, S; Miake, Y; Mieskolainen, M M; Mikhaylov, K; Milano, L; Milosevic, J; Mischke, A; Mishra, A N; Miśkowiec, D; Mitra, J; Mitu, C M; Mohammadi, N; Mohanty, B; Molnar, L; Montaño Zetina, L; Montes, E; Moreira De Godoy, D A; Moreno, L A P; Moretto, S; Morreale, A; Morsch, A; Muccifora, V; Mudnic, E; Mühlheim, D; Muhuri, S; Mukherjee, M; Mulligan, J D; Munhoz, M G; Münning, K; Munzer, R H; Murakami, H; Murray, S; Musa, L; Musinsky, J; Naik, B; Nair, R; Nandi, B K; Nania, R; Nappi, E; Naru, M U; Natal da Luz, H; Nattrass, C; Navarro, S R; Nayak, K; Nayak, R; Nayak, T K; Nazarenko, S; Nedosekin, A; Negrao De Oliveira, R A; Nellen, L; Ng, F; Nicassio, M; Niculescu, M; Niedziela, J; Nielsen, B S; Nikolaev, S; Nikulin, S; Nikulin, V; Noferini, F; Nomokonov, P; Nooren, G; Noris, J C C; Norman, J; Nyanin, A; Nystrand, J; Oeschler, H; Oh, S; Oh, S K; Ohlson, A; Okatan, A; Okubo, T; Olah, L; Oleniacz, J; Oliveira Da Silva, A C; Oliver, M H; Onderwaater, J; Oppedisano, C; Orava, R; Oravec, M; Ortiz Velasquez, A; Oskarsson, A; Otwinowski, J; Oyama, K; Ozdemir, M; Pachmayer, Y; Pagano, D; Pagano, P; Paić, G; Pal, S K; Palni, P; Pan, J; Pandey, A K; Papikyan, V; Pappalardo, G S; Pareek, P; Park, J; Park, W J; Parmar, S; Passfeld, A; Paticchio, V; Patra, R N; Paul, B; Pei, H; Peitzmann, T; Peng, X; Pereira Da Costa, H; Peresunko, D; Perez Lezama, E; Peskov, V; Pestov, Y; Petráček, V; Petrov, V; Petrovici, M; Petta, C; Piano, S; Pikna, M; Pillot, P; Pimentel, L O D L; Pinazza, O; Pinsky, L; Piyarathna, D B; Płoskoń, M; Planinic, M; Pluta, J; Pochybova, S; Podesta-Lerma, P L M; Poghosyan, M G; Polichtchouk, B; Poljak, N; Poonsawat, W; Pop, A; Poppenborg, H; Porteboeuf-Houssais, S; Porter, J; Pospisil, J; Prasad, S K; Preghenella, R; Prino, F; Pruneau, C A; Pshenichnov, I; Puccio, M; Puddu, G; Pujahari, P; Punin, V; Putschke, J; Qvigstad, H; Rachevski, A; Raha, S; Rajput, S; Rak, J; Rakotozafindrabe, A; Ramello, L; Rami, F; Raniwala, R; Raniwala, S; Räsänen, S S; Rascanu, B T; Rathee, D; Read, K F; Redlich, K; Reed, R J; Rehman, A; Reichelt, P; Reidt, F; Ren, X; Renfordt, R; Reolon, A R; Reshetin, A; Reygers, K; Riabov, V; Ricci, R A; Richert, T; Richter, M; Riedler, P; Riegler, W; Riggi, F; Ristea, C; Rocco, E; Rodríguez Cahuantzi, M; Rodriguez Manso, A; Røed, K; Rogochaya, E; Rohr, D; Röhrich, D; Ronchetti, F; Ronflette, L; Rosnet, P; Rossi, A; Roukoutakis, F; Roy, A; Roy, C; Roy, P; Rubio Montero, A J; Rui, R; Russo, R; Ryabinkin, E; Ryabov, Y; Rybicki, A; Saarinen, S; Sadhu, S; Sadovsky, S; Šafařík, K; Sahlmuller, B; Sahoo, P; Sahoo, R; Sahoo, S; Sahu, P K; Saini, J; Sakai, S; Saleh, M A; Salzwedel, J; Sambyal, S; Samsonov, V; Šándor, L; Sandoval, A; Sano, M; Sarkar, D; Sarkar, N; Sarma, P; Scapparone, E; Scarlassara, F; Schiaua, C; Schicker, R; Schmidt, C; Schmidt, H R; Schmidt, M; Schuchmann, S; Schukraft, J; Schutz, Y; Schwarz, K; Schweda, K; Scioli, G; Scomparin, E; Scott, R; Šefčík, M; Seger, J E; Sekiguchi, Y; Sekihata, D; Selyuzhenkov, I; Senosi, K; Senyukov, S; Serradilla, E; Sevcenco, A; Shabanov, A; Shabetai, A; Shadura, O; Shahoyan, R; Shangaraev, A; Sharma, A; Sharma, M; Sharma, M; Sharma, N; Sheikh, A I; Shigaki, K; Shou, Q; Shtejer, K; Sibiriak, Y; Siddhanta, S; Sielewicz, K M; Siemiarczuk, T; Silvermyr, D; Silvestre, C; Simatovic, G; Simonetti, G; Singaraju, R; Singh, R; Singhal, V; Sinha, T; Sitar, B; Sitta, M; Skaali, T B; Slupecki, M; Smirnov, N; Snellings, R J M; Snellman, T W; Song, J; Song, M; Song, Z; Soramel, F; Sorensen, S; Sozzi, F; Spiriti, E; Sputowska, I; Spyropoulou-Stassinaki, M; Stachel, J; Stan, I; Stankus, P; Stenlund, E; Steyn, G; Stiller, J H; Stocco, D; Strmen, P; Suaide, A A P; Sugitate, T; Suire, C; Suleymanov, M; Suljic, M; Sultanov, R; Šumbera, M; Sumowidagdo, S; Szabo, A; Szarka, I; Szczepankiewicz, A; Szymanski, M; Tabassam, U; Takahashi, J; Tambave, G J; Tanaka, N; Tarhini, M; Tariq, M; Tarzila, M G; Tauro, A; Muñoz, G Tejeda; Telesca, A; Terasaki, K; Terrevoli, C; Teyssier, B; Thäder, J; Thakur, D; Thomas, D; Tieulent, R; Tikhonov, A; Timmins, A R; Toia, A; Trogolo, S; Trombetta, G; Trubnikov, V; Trzaska, W H; Tsuji, T; Tumkin, A; Turrisi, R; Tveter, T S; Ullaland, K; Uras, A; Usai, G L; Utrobicic, A; Vala, M; Valencia Palomo, L; Vallero, S; Van Der Maarel, J; Van Hoorne, J W; van Leeuwen, M; Vanat, T; Vande Vyvre, P; Varga, D; Vargas, A; Vargyas, M; Varma, R; Vasileiou, M; Vasiliev, A; Vauthier, A; Vázquez Doce, O; Vechernin, V; Veen, A M; Velure, A; Vercellin, E; Vergara Limón, S; Vernet, R; Verweij, M; Vickovic, L; Viinikainen, J; Vilakazi, Z; Villalobos Baillie, O; Villatoro Tello, A; Vinogradov, A; Vinogradov, L; Virgili, T; Vislavicius, V; Viyogi, Y P; Vodopyanov, A; Völkl, M A; Voloshin, K; Voloshin, S A; Volpe, G; von Haller, B; Vorobyev, I; Vranic, D; Vrláková, J; Vulpescu, B; Wagner, B; Wagner, J; Wang, H; Wang, M; Watanabe, D; Watanabe, Y; Weber, M; Weber, S G; Weiser, D F; Wessels, J P; Westerhoff, U; Whitehead, A M; Wiechula, J; Wikne, J; Wilk, G; Wilkinson, J; Willems, G A; Williams, M C S; Windelband, B; Winn, M; Yalcin, S; Yang, P; Yano, S; Yin, Z; Yokoyama, H; Yoo, I-K; Yoon, J H; Yurchenko, V; Zaborowska, A; Zaccolo, V; Zaman, A; Zampolli, C; Zanoli, H J C; Zaporozhets, S; Zardoshti, N; Zarochentsev, A; Závada, P; Zaviyalov, N; Zbroszczyk, H; Zgura, I S; Zhalov, M; Zhang, H; Zhang, X; Zhang, Y; Zhang, C; Zhang, Z; Zhao, C; Zhigareva, N; Zhou, D; Zhou, Y; Zhou, Z; Zhu, H; Zhu, J; Zichichi, A; Zimmermann, A; Zimmermann, M B; Zinovjev, G; Zyzak, M

    2017-01-01

    The azimuthal correlations of D mesons with charged particles were measured with the ALICE apparatus in pp collisions at [Formula: see text] and p-Pb collisions at [Formula: see text] at the Large Hadron Collider. [Formula: see text], [Formula: see text], and [Formula: see text] mesons and their charge conjugates with transverse momentum [Formula: see text] and rapidity in the nucleon-nucleon centre-of-mass system [Formula: see text] (pp collisions) and [Formula: see text] (p-Pb collisions) were correlated to charged particles with [Formula: see text]. The yield of charged particles in the correlation peak induced by the jet containing the D meson and the peak width are compatible within uncertainties in the two collision systems. The data are described within uncertainties by Monte-Carlo simulations based on PYTHIA, POWHEG, and EPOS 3 event generators.

  11. Measurement of charged particle multiplicities and densities in [Formula: see text] collisions at [Formula: see text]TeV in the forward region.

    Science.gov (United States)

    Aaij, R; Adeva, B; Adinolfi, M; Affolder, A; Ajaltouni, Z; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves, A A; Amato, S; Amerio, S; Amhis, Y; Anderlini, L; Anderson, J; Andreassen, R; Andreotti, M; Andrews, J E; Appleby, R B; Aquines Gutierrez, O; Archilli, F; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Bachmann, S; Back, J J; Badalov, A; Balagura, V; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Batozskaya, V; Bauer, Th; Bay, A; Beddow, J; Bedeschi, F; Bediaga, I; Belogurov, S; Belous, K; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bettler, M-O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Bizzeti, A; Bjørnstad, P M; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Borsato, M; Bowcock, T J V; Bowen, E; Bozzi, C; Brambach, T; Vanden Brand, J; Bressieux, J; Brett, D; Britsch, M; Britton, T; Brook, N H; Brown, H; Bursche, A; Busetto, G; Buytaert, J; Cadeddu, S; Calabrese, R; Callot, O; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carranza-Mejia, H; Carson, L; Carvalho Akiba, K; Casse, G; Cassina, L; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cenci, R; Charles, M; Charpentier, Ph; Cheung, S-F; Chiapolini, N; Chrzaszcz, M; Ciba, K; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coca, C; Coco, V; Cogan, J; Cogneras, E; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombes, M; Coquereau, S; Corti, G; Counts, I; Couturier, B; Cowan, G A; Craik, D C; Cruz Torres, M; Cunliffe, S; Currie, R; D'Ambrosio, C; Dalseno, J; David, P; David, P N Y; Davis, A; De Bonis, I; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Silva, W; De Simone, P; Decamp, D; Deckenhoff, M; Del Buono, L; Déléage, N; Derkach, D; Deschamps, O; Dettori, F; Di Canto, A; Dijkstra, H; Donleavy, S; Dordei, F; Dorigo, M; Dorosz, P; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dupertuis, F; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; El Rifai, I; Elsasser, Ch; Esen, S; Falabella, A; Färber, C; Farinelli, C; Farry, S; Ferguson, D; Fernandez Albor, V; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fiore, M; Fiorini, M; Fitzpatrick, C; Fontana, M; Fontanelli, F; Forty, R; Francisco, O; Frank, M; Frei, C; Frosini, M; Fu, J; Furfaro, E; Gallas Torreira, A; Galli, D; Gandelman, M; Gandini, P; Gao, Y; Garofoli, J; Garra Tico, J; Garrido, L; Gaspar, C; Gauld, R; Gavardi, L; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gianelle, A; Giani, S; Gibson, V; Giubega, L; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gordon, H; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Griffith, P; Grillo, L; Grünberg, O; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Hafkenscheid, T W; Haines, S C; Hall, S; Hamilton, B; Hampson, T; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hartmann, T; He, J; Head, T; Heijne, V; Hennessy, K; Henrard, P; Henry, L; Hernando Morata, J A; van Herwijnen, E; Heß, M; Hicheur, A; Hill, D; Hoballah, M; Hombach, C; Hulsbergen, W; Hunt, P; Hussain, N; Hutchcroft, D; Hynds, D; Iakovenko, V; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jans, E; Jaton, P; Jawahery, A; Jing, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Jurik, N; Kaballo, M; Kandybei, S; Kanso, W; Karacson, M; Karbach, T M; Kelsey, M; Kenyon, I R; Ketel, T; Khanji, B; Khurewathanakul, C; Klaver, S; Kochebina, O; Komarov, I; Koopman, R F; Koppenburg, P; Korolev, M; Kozlinskiy, A; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kucharczyk, M; Kudryavtsev, V; Kurek, K; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanciotti, E; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J-P; Lefèvre, R; Leflat, A; Lefrançois, J; Leo, S; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Liles, M; Lindner, R; Linn, C; Lionetto, F; Liu, B; Liu, G; Lohn, S; Longstaff, I; Lopes, J H; Lopez-March, N; Lowdon, P; Lu, H; Lucchesi, D; Luisier, J; Luo, H; Luppi, E; Lupton, O; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Malde, S; Manca, G; Mancinelli, G; Manzali, M; Maratas, J; Marconi, U; Marino, P; Märki, R; Marks, J; Martellotti, G; Martens, A; Martín Sánchez, A; Martinelli, M; Martinez Santos, D; Martinez Vidal, F; Martins Tostes, D; Massafferri, A; Matev, R; Mathe, Z; Matteuzzi, C; Mazurov, A; McCann, M; McCarthy, J; McNab, A; McNulty, R; McSkelly, B; Meadows, B; Meier, F; Meissner, M; Merk, M; Milanes, D A; Minard, M-N; Molina Rodriguez, J; Monteil, S; Moran, D; Morandin, M; Morawski, P; Mordà, A; Morello, M J; Mountain, R; Muheim, F; Müller, K; Muresan, R; Muryn, B; Muster, B; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Needham, M; Neri, N; Neubert, S; Neufeld, N; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Nicol, M; Niess, V; Niet, R; Nikitin, N; Nikodem, T; Novoselov, A; Oblakowska-Mucha, A; Obraztsov, V; Oggero, S; Ogilvy, S; Okhrimenko, O; Oldeman, R; Onderwater, G; Orlandea, M; Otalora Goicochea, J M; Owen, P; Oyanguren, A; Pal, B K; Palano, A; Palombo, F; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Pappalardo, L; Parkes, C; Parkinson, C J; Passaleva, G; Patel, G D; Patel, M; Patrignani, C; Pavel-Nicorescu, C; Pazos Alvarez, A; Pearce, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perez Trigo, E; Perret, P; Perrin-Terrin, M; Pescatore, L; Pesen, E; Pessina, G; Petridis, K; Petrolini, A; Picatoste Olloqui, E; Pietrzyk, B; Pilař, T; Pinci, D; Pistone, A; Playfer, S; Plo Casasus, M; Polci, F; Polok, G; Poluektov, A; Polycarpo, E; Popov, A; Popov, D; Popovici, B; Potterat, C; Powell, A; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Rachwal, B; Rademacker, J H; Rakotomiaramanana, B; Rama, M; Rangel, M S; Raniuk, I; Rauschmayr, N; Raven, G; Redford, S; Reichert, S; Reid, M M; Dos Reis, A C; Ricciardi, S; Richards, A; Rinnert, K; Rives Molina, V; Roa Romero, D A; Robbe, P; Roberts, D A; Rodrigues, A B; Rodrigues, E; Rodriguez Perez, P; Roiser, S; Romanovsky, V; Romero Vidal, A; Rotondo, M; Rouvinet, J; Ruf, T; Ruffini, F; Ruiz, H; Ruiz Valls, P; Sabatino, G; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salustino Guimaraes, V; Sanmartin Sedes, B; Santacesaria, R; Santamarina Rios, C; Santovetti, E; Sapunov, M; Sarti, A; Satriano, C; Satta, A; Savrie, M; Savrina, D; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmidt, B; Schneider, O; Schopper, A; Schune, M-H; Schwemmer, R; Sciascia, B; Sciubba, A; Seco, M; Semennikov, A; Senderowska, K; Sepp, I; Serra, N; Serrano, J; Seyfert, P; Shapkin, M; Shapoval, I; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, O; Shevchenko, V; Shires, A; Silva Coutinho, R; Simi, G; Sirendi, M; Skidmore, N; Skwarnicki, T; Smith, N A; Smith, E; Smith, E; Smith, J; Smith, M; Snoek, H; Sokoloff, M D; Soler, F J P; Soomro, F; Souza, D; De Paula, B Souza; Spaan, B; Sparkes, A; Spinella, F; Spradlin, P; Stagni, F; Stahl, S; Steinkamp, O; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Stracka, S; Straticiuc, M; Straumann, U; Stroili, R; Subbiah, V K; Sun, L; Sutcliffe, W; Swientek, S; Syropoulos, V; Szczekowski, M; Szczypka, P; Szilard, D; Szumlak, T; T'Jampens, S; Teklishyn, M; Tellarini, G; Teodorescu, E; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Tolk, S; Tomassetti, L; Tonelli, D; Topp-Joergensen, S; Torr, N; Tournefier, E; Tourneur, S; Tran, M T; Tresch, M; Tsaregorodtsev, A; Tsopelas, P; Tuning, N; Ubeda Garcia, M; Ukleja, A; Ustyuzhanin, A; Uwer, U; Vagnoni, V; Valenti, G; Vallier, A; Vazquez Gomez, R; Vazquez Regueiro, P; Vázquez Sierra, C; Vecchi, S; Velthuis, J J; Veltri, M; Veneziano, G; Vesterinen, M; Viaud, B; Vieira, D; Vilasis-Cardona, X; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; Voss, H; de Vries, J A; Waldi, R; Wallace, C; Wallace, R; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Webber, A D; Websdale, D; Whitehead, M; Wicht, J; Wiechczynski, J; Wiedner, D; Wiggers, L; Wilkinson, G; Williams, M P; Williams, M; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wormser, G; Wotton, S A; Wright, S; Wu, S; Wyllie, K; Xie, Y; Xing, Z; Yang, Z; Yuan, X; Yushchenko, O; Zangoli, M; Zavertyaev, M; Zhang, F; Zhang, L; Zhang, W C; Zhang, Y; Zhelezov, A; Zhokhov, A; Zhong, L; Zvyagin, A

    Charged particle multiplicities are studied in proton-proton collisions in the forward region at a centre-of-mass energy of [Formula: see text]TeV with data collected by the LHCb detector. The forward spectrometer allows access to a kinematic range of [Formula: see text] in pseudorapidity, momenta greater than [Formula: see text] and transverse momenta greater than [Formula: see text]. The measurements are performed using events with at least one charged particle in the kinematic acceptance. The results are presented as functions of pseudorapidity and transverse momentum and are compared to predictions from several Monte Carlo event generators.

  12. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.

    Science.gov (United States)

    Alonso, Roberto; Monroy, Raúl; Trejo, Luis A

    2016-08-17

    The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

  13. A recursive Monte Carlo method for estimating importance functions in deep penetration problems

    International Nuclear Information System (INIS)

    Goldstein, M.

    1980-04-01

    A pratical recursive Monte Carlo method for estimating the importance function distribution, aimed at importance sampling for the solution of deep penetration problems in three-dimensional systems, was developed. The efficiency of the recursive method was investigated for sample problems including one- and two-dimensional, monoenergetic and and multigroup problems, as well as for a practical deep-penetration problem with streaming. The results of the recursive Monte Carlo calculations agree fairly well with Ssub(n) results. It is concluded that the recursive Monte Carlo method promises to become a universal method for estimating the importance function distribution for the solution of deep-penetration problems, in all kinds of systems: for many systems the recursive method is likely to be more efficient than previously existing methods; for three-dimensional systems it is the first method that can estimate the importance function with the accuracy required for an efficient solution based on importance sampling of neutron deep-penetration problems in those systems

  14. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers

    Directory of Open Access Journals (Sweden)

    Roberto Alonso

    2016-08-01

    Full Text Available The Domain Name System (DNS is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS. The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

  15. Down two steps: Are bilinguals delayed in the acquisition of recursively embedded PPs?

    Directory of Open Access Journals (Sweden)

    Ana Pérez-Leroux

    2017-08-01

    Full Text Available The present study examines whether bilingual children are delayed in the ability to produce complex DPs. We elicited production of DPs containing two PP modifiers, in two conditions designed to tease apart the acquisition of an embedding rule from the acquisition of the recursivity of an embedding rule. In the recursive condition, one modifier PP was itself modified by an additional PP. In the non-recursive condition, both PPs sequentially modified the main noun. Participants were 71 English monolingual children and 35 bilinguals between the ages of four and six. The evidence suggested an overall difference between groups, however further analysis revealed that bilinguals differed from monolinguals only insofar as the onset of PP embedding. No specific additional bilingual delay arose from the recursive condition. This suggests that recursive embedding is a resilient domain in language acquisition and supports proposals that link morphosyntactic delays in bilingual children to domains of grammar that are heavily reliant on lexical learning, which would include learning the first instance of PP embedding. --- Original in English.   --- DOI: http://dx.doi.org/10.12957/matraga.2017.28781

  16. Twisting formula of epsilon factors

    Indian Academy of Sciences (India)

    Sazzad Ali Biswas

    2017-08-07

    Aug 7, 2017 ... In this article, we give a generalized twisting formula for ϵ(χ1χ2,ψ), when both χ1 and χ2 are ramified via the following local Jacobi sums. Let UF be the group of units in OF (ring of integers of F). For characters χ1, χ2 of F. × and a positive integer n, we define the local Jacobi sum. Jt(χ1,χ2, n) = ∑ x∈UF. Un.

  17. New Pfaffian formulae for an overlap of multiple quasiparticle states

    Directory of Open Access Journals (Sweden)

    Oi Makito

    2014-03-01

    Full Text Available The Pfaffian formulae recently derived by the authors are presented. They can be widely applied to evaluations of a variety of quantities, necessary in nuclear many-body theories, such as the generator coordinate method (GCM. As an example, an application to the energy expectation is presented.

  18. A Poisson type formula for Hardy classes on Heisenberg's group

    Directory of Open Access Journals (Sweden)

    Lopushansky O.V.

    2010-06-01

    Full Text Available The Hardy type class of complex functions with infinite many variables defined on the Schrodinger irreducible unitary orbit of reduced Heisenberg group, generated by the Gauss density, is investigated. A Poisson integral type formula for their analytic extensions on an open ball is established. Taylor coefficients for analytic extensions are described by the associatedsymmetric Fock space.

  19. On the gravitational radiation formula

    International Nuclear Information System (INIS)

    Schaefer, G.; Dehnen, H.

    1980-01-01

    For electromagnetically as well as gravitationally bound quantum mechanical many-body systems the coefficients of absorption and induced emission of gravitational radiation are calculated in the first-order approximation. The results are extended subsequently to systems with arbitrary non-Coulomb-like two-particle interaction potentials;it is shown explicitly that in all cases the perturbation of the binding potentials of the bound systems by the incident gravitational wave field itself must be taken into account. With the help of the thermodynamic equilibrium of gravitational radiation and quantised matter, the coefficients for spontaneous emission of gravitational radiation are derived and the gravitational radiation formula for emission of gravitational quadrupole radiation by bound quantum mechanical many-body systems is given. According to the correspondence principle the present result is completely identical with the well known classical radiation formula, by which recent criticism against this formula is refuted. Finally the quantum mechanical absorption cross section for gravitational quadrupole radiation is deduced and compared with the corresponding classical expressions. As a special example the vibrating two-mass quadrupole is treated explicitly. (author)

  20. Multiloop stringlike formulas for QED

    International Nuclear Information System (INIS)

    Lam, C.S.

    1993-01-01

    Multiloop gauge-theory amplitudes written in the Feynman-parameter representation are poised to take advantage of two important developments of the past decade: the spinor-helicity technique and the superstring reorganization. The former has been considered in a previous paper; the latter will be elaborated in this paper. We show here how to write multiloop stringlike formulas in the Feynman-parameter representation for any diagram in QED, including those involving other nonelectromagnetic interactions, provided the internal photon lines are not adjacent to any external photon line. The general connection between the Feynman-parameter approach and the superstring and/or first-quantized approach is discussed. In the special case of a one-loop multiphoton amplitude, these formulas reduce to the ones obtained by the superstring and the first-quantized methods. The stringlike formulas exhibit a simple gauge structure which makes the Ward-Takahashi identity apparent, and enables the integration-by-parts technique of Bern and Kosower to be applied, so that gauge-invariant parts can be extracted diagram by diagram with the seagull vertex neglected

  1. Formulaic speech in disorders of language

    Directory of Open Access Journals (Sweden)

    Diana Sidtis

    2014-04-01

    Formulaic language studies remain less well recognized in language disorders. Profiles of differential formulaic language abilities in neurological disease have implications for cerebral models of language and for clinical evaluation and treatment of neurogenic language disorders.

  2. Explicit formulas for Clebsch-Gordan coefficients

    International Nuclear Information System (INIS)

    Rudnicki-Bujnowski, G.

    1975-01-01

    The problem is to obtain explicit algebraic formulas of Clebsch-Gordan coefficients for high values of angular momentum. The method of solution is an algebraic method based on the Racah formula using the FORMAC programming language. (Auth.)

  3. Talking from d'Alembert formula

    International Nuclear Information System (INIS)

    Liu Ruxun.

    1989-11-01

    In the paper, two new approaches to prove the famous d'Alembert formula are proposed, and some further extensions of the formula also advanced. Many interesting results and application prospects are discussed. (author). 2 refs, 3 figs

  4. Infant Formula - Buying, Preparing, Storing, and Feeding

    Science.gov (United States)

    ... 000806.htm Infant Formula - buying, preparing, storing, and feeding To use the sharing features on this page, ... brush to get at hard-to-reach places. Feeding Formula to Baby Here is a guide to ...

  5. Simple and Clear Proofs of Stirling's Formula

    Science.gov (United States)

    Niizeki, Shozo; Araki, Makoto

    2010-01-01

    The purpose of our article is to show two simpler and clearer methods of proving Stirling's formula than the traditional and conventional ones. The distinction of our method is to use the simple trapezoidal formula.

  6. Thickened infant formula: What to know

    NARCIS (Netherlands)

    Salvatore, Silvia; Savino, Francesco; Singendonk, Maartje; Tabbers, Merit; Benninga, Marc A.; Staiano, Annamaria; Vandenplas, Yvan

    2018-01-01

    This study aimed to provide an overview of the characteristics of thickened formulas to aid health care providers manage infants with regurgitations. The indications, properties, and efficacy of different thickening agents and thickened formulas on regurgitation and gastroesophageal reflux in

  7. Design and Implementation of Recursive Model Predictive Control for Permanent Magnet Synchronous Motor Drives

    Directory of Open Access Journals (Sweden)

    Xuan Wu

    2015-01-01

    Full Text Available In order to control the permanent-magnet synchronous motor system (PMSM with different disturbances and nonlinearity, an improved current control algorithm for the PMSM systems using recursive model predictive control (RMPC is developed in this paper. As the conventional MPC has to be computed online, its iterative computational procedure needs long computing time. To enhance computational speed, a recursive method based on recursive Levenberg-Marquardt algorithm (RLMA and iterative learning control (ILC is introduced to solve the learning issue in MPC. RMPC is able to significantly decrease the computation cost of traditional MPC in the PMSM system. The effectiveness of the proposed algorithm has been verified by simulation and experimental results.

  8. Recursive Subspace Identification of AUV Dynamic Model under General Noise Assumption

    Directory of Open Access Journals (Sweden)

    Zheping Yan

    2014-01-01

    Full Text Available A recursive subspace identification algorithm for autonomous underwater vehicles (AUVs is proposed in this paper. Due to the advantages at handling nonlinearities and couplings, the AUV model investigated here is for the first time constructed as a Hammerstein model with nonlinear feedback in the linear part. To better take the environment and sensor noises into consideration, the identification problem is concerned as an errors-in-variables (EIV one which means that the identification procedure is under general noise assumption. In order to make the algorithm recursively, propagator method (PM based subspace approach is extended into EIV framework to form the recursive identification method called PM-EIV algorithm. With several identification experiments carried out by the AUV simulation platform, the proposed algorithm demonstrates its effectiveness and feasibility.

  9. A Revised Piecewise Linear Recursive Convolution FDTD Method for Magnetized Plasmas

    International Nuclear Information System (INIS)

    Liu Song; Zhong Shuangying; Liu Shaobin

    2005-01-01

    The piecewise linear recursive convolution (PLRC) finite-different time-domain (FDTD) method improves accuracy over the original recursive convolution (RC) FDTD approach and current density convolution (JEC) but retains their advantages in speed and efficiency. This paper describes a revised piecewise linear recursive convolution PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time, enabling the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations of the reflection and transmission coefficients through a magnetized plasma layer. The results show that the revised PLRC-FDTD method has improved the accuracy over the original RC FDTD method and JEC FDTD method

  10. Testing digital recursive filtering method for radiation measurement channel using pin diode detector

    International Nuclear Information System (INIS)

    Talpalariu, C. M.; Talpalariu, J.; Popescu, O.; Mocanasu, M.; Lita, I.; Visan, D. A.

    2016-01-01

    In this work we have studied a software filtering method implemented in a pulse counting computerized measuring channel using PIN diode radiation detector. In case our interest was focalized for low rate decay radiation measurement accuracies improvement and response time optimization. During works for digital mathematical algorithm development, we used a hardware radiation measurement channel configuration based on PIN diode BPW34 detector, preamplifier, filter and programmable counter, computer connected. We report measurement results using two digital recursive methods in statically and dynamically field evolution. Software for graphical input/output real time diagram representation was designed and implemented, facilitating performances evaluation between the response of fixed configuration software recursive filter and dynamically adaptive configuration recursive filter. (authors)

  11. Parameter Estimation of a Closed Loop Coupled Tank Time Varying System using Recursive Methods

    International Nuclear Information System (INIS)

    Basir, Siti Nora; Yussof, Hanafiah; Shamsuddin, Syamimi; Selamat, Hazlina; Zahari, Nur Ismarrubie

    2013-01-01

    This project investigates the direct identification of closed loop plant using discrete-time approach. The uses of Recursive Least Squares (RLS), Recursive Instrumental Variable (RIV) and Recursive Instrumental Variable with Centre-Of-Triangle (RIV + COT) in the parameter estimation of closed loop time varying system have been considered. The algorithms were applied in a coupled tank system that employs covariance resetting technique where the time of parameter changes occur is unknown. The performances of all the parameter estimation methods, RLS, RIV and RIV + COT were compared. The estimation of the system whose output was corrupted with white and coloured noises were investigated. Covariance resetting technique successfully executed when the parameters change. RIV + COT gives better estimates than RLS and RIV in terms of convergence and maximum overshoot

  12. Recursive Estimation for Dynamical Systems with Different Delay Rates Sensor Network and Autocorrelated Process Noises

    Directory of Open Access Journals (Sweden)

    Jianxin Feng

    2014-01-01

    Full Text Available The recursive estimation problem is studied for a class of uncertain dynamical systems with different delay rates sensor network and autocorrelated process noises. The process noises are assumed to be autocorrelated across time and the autocorrelation property is described by the covariances between different time instants. The system model under consideration is subject to multiplicative noises or stochastic uncertainties. The sensor delay phenomenon occurs in a random way and each sensor in the sensor network has an individual delay rate which is characterized by a binary switching sequence obeying a conditional probability distribution. By using the orthogonal projection theorem and an innovation analysis approach, the desired recursive robust estimators including recursive robust filter, predictor, and smoother are obtained. Simulation results are provided to demonstrate the effectiveness of the proposed approaches.

  13. Production of [Formula: see text] and [Formula: see text] in p-Pb collisions at [Formula: see text] TeV.

    Science.gov (United States)

    Adamová, D; Aggarwal, M M; Aglieri Rinella, G; Agnello, M; Agrawal, N; Ahammed, Z; Ahmad, S; Ahn, S U; Aiola, S; Akindinov, A; Alam, S N; Albuquerque, D S D; Aleksandrov, D; Alessandro, B; Alexandre, D; Alfaro Molina, R; Alici, A; Alkin, A; Alme, J; Alt, T; Altinpinar, S; Altsybeev, I; Alves Garcia Prado, C; An, M; Andrei, C; Andrews, H A; Andronic, A; Anguelov, V; Anson, C; Antičić, T; Antinori, F; Antonioli, P; Anwar, R; Aphecetche, L; Appelshäuser, H; Arcelli, S; Arnaldi, R; Arnold, O W; Arsene, I C; Arslandok, M; Audurier, B; Augustinus, A; Averbeck, R; Azmi, M D; Badalà, A; Baek, Y W; Bagnasco, S; Bailhache, R; Bala, R; Baldisseri, A; Ball, M; Baral, R C; Barbano, A M; Barbera, R; Barile, F; Barioglio, L; Barnaföldi, G G; Barnby, L S; Barret, V; Bartalini, P; Barth, K; Bartke, J; Bartsch, E; Basile, M; Bastid, N; Basu, S; Bathen, B; Batigne, G; Batista Camejo, A; Batyunya, B; Batzing, P C; Bearden, I G; Beck, H; Bedda, C; Behera, N K; Belikov, I; Bellini, F; Bello Martinez, H; Bellwied, R; Beltran, L G E; Belyaev, V; Bencedi, G; Beole, S; Bercuci, A; Berdnikov, Y; Berenyi, D; Bertens, R A; Berzano, D; Betev, L; Bhasin, A; Bhat, I R; Bhati, A K; Bhattacharjee, B; Bhom, J; Bianchi, L; Bianchi, N; Bianchin, C; Bielčík, J; Bielčíková, J; Bilandzic, A; Biro, G; Biswas, R; Biswas, S; Blair, J T; Blau, D; Blume, C; Boca, G; Bock, F; Bogdanov, A; Boldizsár, L; Bombara, M; Bonomi, G; Bonora, M; Book, J; Borel, H; Borissov, A; Borri, M; Botta, E; Bourjau, C; Braun-Munzinger, P; Bregant, M; Broker, T A; Browning, T A; Broz, M; Brucken, E J; Bruna, E; Bruno, G E; Budnikov, D; Buesching, H; Bufalino, S; Buhler, P; Buitron, S A I; Buncic, P; Busch, O; Buthelezi, Z; Butt, J B; Buxton, J T; Cabala, J; Caffarri, D; Caines, H; Caliva, A; Calvo Villar, E; Camerini, P; Capon, A A; Carena, F; Carena, W; Carnesecchi, F; Castillo Castellanos, J; Castro, A J; Casula, E A R; Ceballos Sanchez, C; Cerello, P; Chang, B; Chapeland, S; Chartier, M; Charvet, J L; Chattopadhyay, S; Chattopadhyay, S; Chauvin, A; Cherney, M; Cheshkov, C; Cheynis, B; Chibante Barroso, V; Chinellato, D D; Cho, S; Chochula, P; Choi, K; Chojnacki, M; Choudhury, S; Christakoglou, P; Christensen, C H; Christiansen, P; Chujo, T; Chung, S U; Cicalo, C; Cifarelli, L; Cindolo, F; Cleymans, J; Colamaria, F; Colella, D; Collu, A; Colocci, M; Conesa Balbastre, G; Conesa Del Valle, Z; Connors, M E; Contreras, J G; Cormier, T M; Corrales Morales, Y; Cortés Maldonado, I; Cortese, P; Cosentino, M R; Costa, F; Costanza, S; Crkovská, J; Crochet, P; Cuautle, E; Cunqueiro, L; Dahms, T; Dainese, A; Danisch, M C; Danu, A; Das, D; Das, I; Das, S; Dash, A; Dash, S; De, S; De Caro, A; de Cataldo, G; de Conti, C; de Cuveland, J; De Falco, A; De Gruttola, D; De Marco, N; De Pasquale, S; De Souza, R D; Degenhardt, H F; Deisting, A; Deloff, A; Deplano, C; Dhankher, P; Di Bari, D; Di Mauro, A; Di Nezza, P; Di Ruzza, B; Diaz Corchero, M A; Dietel, T; Dillenseger, P; Divià, R; Djuvsland, Ø; Dobrin, A; Domenicis Gimenez, D; Dönigus, B; Dordic, O; Drozhzhova, T; Dubey, A K; Dubla, A; Ducroux, L; Duggal, A K; Dupieux, P; Ehlers, R J; Elia, D; Endress, E; Engel, H; Epple, E; Erazmus, B; Erhardt, F; Espagnon, B; Esumi, S; Eulisse, G; Eum, J; Evans, D; Evdokimov, S; Fabbietti, L; Fabris, D; Faivre, J; Fantoni, A; Fasel, M; Feldkamp, L; Feliciello, A; Feofilov, G; Ferencei, J; Fernández Téllez, A; Ferreiro, E G; Ferretti, A; Festanti, A; Feuillard, V J G; Figiel, J; Figueredo, M A S; Filchagin, S; Finogeev, D; Fionda, F M; Fiore, E M; Floris, M; Foertsch, S; Foka, P; Fokin, S; Fragiacomo, E; Francescon, A; Francisco, A; Frankenfeld, U; Fronze, G G; Fuchs, U; Furget, C; Furs, A; Fusco Girard, M; Gaardhøje, J J; Gagliardi, M; Gago, A M; Gajdosova, K; Gallio, M; Galvan, C D; Gangadharan, D R; Ganoti, P; Gao, C; Garabatos, C; Garcia-Solis, E; Garg, K; Garg, P; Gargiulo, C; Gasik, P; Gauger, E F; Gay Ducati, M B; Germain, M; Ghosh, P; Ghosh, S K; Gianotti, P; Giubellino, P; Giubilato, P; Gladysz-Dziadus, E; Glässel, P; Goméz Coral, D M; Gomez Ramirez, A; Gonzalez, A S; Gonzalez, V; González-Zamora, P; Gorbunov, S; Görlich, L; Gotovac, S; Grabski, V; Graczykowski, L K; Graham, K L; Greiner, L; Grelli, A; Grigoras, C; Grigoriev, V; Grigoryan, A; Grigoryan, S; Grion, N; Gronefeld, J M; Grosa, F; Grosse-Oetringhaus, J F; Grosso, R; Gruber, L; Grull, F R; Guber, F; Guernane, R; Guerzoni, B; Gulbrandsen, K; Gunji, T; Gupta, A; Gupta, R; Guzman, I B; Haake, R; Hadjidakis, C; Hamagaki, H; Hamar, G; Hamon, J C; Harris, J W; Harton, A; Hatzifotiadou, D; Hayashi, S; Heckel, S T; Hellbär, E; Helstrup, H; Herghelegiu, A; Herrera Corral, G; Herrmann, F; Hess, B A; Hetland, K F; Hillemanns, H; Hippolyte, B; Hladky, J; Horak, D; Hosokawa, R; Hristov, P; Hughes, C; Humanic, T J; Hussain, N; Hussain, T; Hutter, D; Hwang, D S; Ilkaev, R; Inaba, M; Ippolitov, M; Irfan, M; Isakov, V; Islam, M S; Ivanov, M; Ivanov, V; Izucheev, V; Jacak, B; Jacazio, N; Jacobs, P M; Jadhav, M B; Jadlovska, S; Jadlovsky, J; Jahnke, C; Jakubowska, M J; Janik, M A; Jayarathna, P H S Y; Jena, C; Jena, S; Jercic, M; Jimenez Bustamante, R T; Jones, P G; Jusko, A; Kalinak, P; Kalweit, A; Kang, J H; Kaplin, V; Kar, S; Karasu Uysal, A; Karavichev, O; Karavicheva, T; Karayan, L; Karpechev, E; Kebschull, U; Keidel, R; Keijdener, D L D; Keil, M; Ketzer, B; Mohisin Khan, M; Khan, P; Khan, S A; Khanzadeev, A; Kharlov, Y; Khatun, A; Khuntia, A; Kielbowicz, M M; Kileng, B; Kim, D W; Kim, D J; Kim, D; Kim, H; Kim, J S; Kim, J; Kim, M; Kim, M; Kim, S; Kim, T; Kirsch, S; Kisel, I; Kiselev, S; Kisiel, A; Kiss, G; Klay, J L; Klein, C; Klein, J; Klein-Bösing, C; Klewin, S; Kluge, A; Knichel, M L; Knospe, A G; Kobdaj, C; Kofarago, M; Kollegger, T; Kolojvari, A; Kondratiev, V; Kondratyeva, N; Kondratyuk, E; Konevskikh, A; Kopcik, M; Kour, M; Kouzinopoulos, C; Kovalenko, O; Kovalenko, V; Kowalski, M; Koyithatta Meethaleveedu, G; Králik, I; Kravčáková, A; Krivda, M; Krizek, F; Kryshen, E; Krzewicki, M; Kubera, A M; Kučera, V; Kuhn, C; Kuijer, P G; Kumar, A; Kumar, J; Kumar, L; Kumar, S; Kundu, S; Kurashvili, P; Kurepin, A; Kurepin, A B; Kuryakin, A; Kushpil, S; Kweon, M J; Kwon, Y; La Pointe, S L; La Rocca, P; Lagana Fernandes, C; Lakomov, I; Langoy, R; Lapidus, K; Lara, C; Lardeux, A; Lattuca, A; Laudi, E; Lavicka, R; Lazaridis, L; Lea, R; Leardini, L; Lee, S; Lehas, F; Lehner, S; Lehrbach, J; Lemmon, R C; Lenti, V; Leogrande, E; León Monzón, I; Lévai, P; Li, S; Li, X; Lien, J; Lietava, R; Lindal, S; Lindenstruth, V; Lippmann, C; Lisa, M A; Litichevskyi, V; Ljunggren, H M; Llope, W J; Lodato, D F; Loenne, P I; Loginov, V; Loizides, C; Loncar, P; Lopez, X; López Torres, E; Lowe, A; Luettig, P; Lunardon, M; Luparello, G; Lupi, M; Lutz, T H; Maevskaya, A; Mager, M; Mahajan, S; Mahmood, S M; Maire, A; Majka, R D; Malaev, M; Maldonado Cervantes, I; Malinina, L; Mal'Kevich, D; Malzacher, P; Mamonov, A; Manko, V; Manso, F; Manzari, V; Mao, Y; Marchisone, M; Mareš, J; Margagliotti, G V; Margotti, A; Margutti, J; Marín, A; Markert, C; Marquard, M; Martin, N A; Martinengo, P; Martinez, J A L; Martínez, M I; Martínez García, G; Martinez Pedreira, M; Mas, A; Masciocchi, S; Masera, M; Masoni, A; Mastroserio, A; Mathis, A M; Matyja, A; Mayer, C; Mazer, J; Mazzilli, M; Mazzoni, M A; Meddi, F; Melikyan, Y; Menchaca-Rocha, A; Meninno, E; Mercado Pérez, J; Meres, M; Mhlanga, S; Miake, Y; Mieskolainen, M M; Mihaylov, D; Mikhaylov, K; Milano, L; Milosevic, J; Mischke, A; Mishra, A N; Miśkowiec, D; Mitra, J; Mitu, C M; Mohammadi, N; Mohanty, B; Montes, E; Moreira De Godoy, D A; Moreno, L A P; Moretto, S; Morreale, A; Morsch, A; Muccifora, V; Mudnic, E; Mühlheim, D; Muhuri, S; Mukherjee, M; Mulligan, J D; Munhoz, M G; Münning, K; Munzer, R H; Murakami, H; Murray, S; Musa, L; Musinsky, J; Myers, C J; Naik, B; Nair, R; Nandi, B K; Nania, R; Nappi, E; Naru, M U; Natal da Luz, H; Nattrass, C; Navarro, S R; Nayak, K; Nayak, R; Nayak, T K; Nazarenko, S; Nedosekin, A; Negrao De Oliveira, R A; Nellen, L; Nesbo, S V; Ng, F; Nicassio, M; Niculescu, M; Niedziela, J; Nielsen, B S; Nikolaev, S; Nikulin, S; Nikulin, V; Noferini, F; Nomokonov, P; Nooren, G; Noris, J C C; Norman, J; Nyanin, A; Nystrand, J; Oeschler, H; Oh, S; Ohlson, A; Okubo, T; Olah, L; Oleniacz, J; Oliveira Da Silva, A C; Oliver, M H; Onderwaater, J; Oppedisano, C; Orava, R; Oravec, M; Ortiz Velasquez, A; Oskarsson, A; Otwinowski, J; Oyama, K; Ozdemir, M; Pachmayer, Y; Pacik, V; Pagano, D; Pagano, P; Paić, G; Pal, S K; Palni, P; Pan, J; Pandey, A K; Panebianco, S; Papikyan, V; Pappalardo, G S; Pareek, P; Park, J; Park, W J; Parmar, S; Passfeld, A; Pathak, S P; Paticchio, V; Patra, R N; Paul, B; Pei, H; Peitzmann, T; Peng, X; Pereira, L G; Pereira Da Costa, H; Peresunko, D; Perez Lezama, E; Peskov, V; Pestov, Y; Petráček, V; Petrov, V; Petrovici, M; Petta, C; Pezzi, R P; Piano, S; Pikna, M; Pillot, P; Pimentel, L O D L; Pinazza, O; Pinsky, L; Piyarathna, D B; Płoskoń, M; Planinic, M; Pluta, J; Pochybova, S; Podesta-Lerma, P L M; Poghosyan, M G; Polichtchouk, B; Poljak, N; Poonsawat, W; Pop, A; Poppenborg, H; Porteboeuf-Houssais, S; Porter, J; Pospisil, J; Pozdniakov, V; Prasad, S K; Preghenella, R; Prino, F; Pruneau, C A; Pshenichnov, I; Puccio, M; Puddu, G; Pujahari, P; Punin, V; Putschke, J; Qvigstad, H; Rachevski, A; Raha, S; Rajput, S; Rak, J; Rakotozafindrabe, A; Ramello, L; Rami, F; Rana, D B; Raniwala, R; Raniwala, S; Räsänen, S S; Rascanu, B T; Rathee, D; Ratza, V; Ravasenga, I; Read, K F; Redlich, K; Rehman, A; Reichelt, P; Reidt, F; Ren, X; Renfordt, R; Reolon, A R; Reshetin, A; Reygers, K; Riabov, V; Ricci, R A; Richert, T; Richter, M; Riedler, P; Riegler, W; Riggi, F; Ristea, C; Rodríguez Cahuantzi, M; Røed, K; Rogochaya, E; Rohr, D; Röhrich, D; Rokita, P S; Ronchetti, F; Ronflette, L; Rosnet, P; Rossi, A; Rotondi, A; Roukoutakis, F; Roy, A; Roy, C; Roy, P; Rubio Montero, A J; Rui, R; Russo, R; Rustamov, A; Ryabinkin, E; Ryabov, Y; Rybicki, A; Saarinen, S; Sadhu, S; Sadovsky, S; Šafařík, K; Saha, S K; Sahlmuller, B; Sahoo, B; Sahoo, P; Sahoo, R; Sahoo, S; Sahu, P K; Saini, J; Sakai, S; Saleh, M A; Salzwedel, J; Sambyal, S; Samsonov, V; Sandoval, A; Sarkar, D; Sarkar, N; Sarma, P; Sas, M H P; Scapparone, E; Scarlassara, F; Scharenberg, R P; Scheid, H S; Schiaua, C; Schicker, R; Schmidt, C; Schmidt, H R; Schmidt, M O; Schmidt, M; Schukraft, J; Schutz, Y; Schwarz, K; Schweda, K; Scioli, G; Scomparin, E; Scott, R; Šefčík, M; Seger, J E; Sekiguchi, Y; Sekihata, D; Selyuzhenkov, I; Senosi, K; Senyukov, S; Serradilla, E; Sett, P; Sevcenco, A; Shabanov, A; Shabetai, A; Shadura, O; Shahoyan, R; Shangaraev, A; Sharma, A; Sharma, A; Sharma, M; Sharma, M; Sharma, N; Sheikh, A I; Shigaki, K; Shou, Q; Shtejer, K; Sibiriak, Y; Siddhanta, S; Sielewicz, K M; Siemiarczuk, T; Silvermyr, D; Silvestre, C; Simatovic, G; Simonetti, G; Singaraju, R; Singh, R; Singhal, V; Sinha, T; Sitar, B; Sitta, M; Skaali, T B; Slupecki, M; Smirnov, N; Snellings, R J M; Snellman, T W; Song, J; Song, M; Soramel, F; Sorensen, S; Sozzi, F; Spiriti, E; Sputowska, I; Srivastava, B K; Stachel, J; Stan, I; Stankus, P; Stenlund, E; Stiller, J H; Stocco, D; Strmen, P; Suaide, A A P; Sugitate, T; Suire, C; Suleymanov, M; Suljic, M; Sultanov, R; Šumbera, M; Sumowidagdo, S; Suzuki, K; Swain, S; Szabo, A; Szarka, I; Szczepankiewicz, A; Szymanski, M; Tabassam, U; Takahashi, J; Tambave, G J; Tanaka, N; Tarhini, M; Tariq, M; Tarzila, M G; Tauro, A; Tejeda Muñoz, G; Telesca, A; Terasaki, K; Terrevoli, C; Teyssier, B; Thakur, D; Thakur, S; Thomas, D; Tieulent, R; Tikhonov, A; Timmins, A R; Toia, A; Tripathy, S; Trogolo, S; Trombetta, G; Trubnikov, V; Trzaska, W H; Trzeciak, B A; Tsuji, T; Tumkin, A; Turrisi, R; Tveter, T S; Ullaland, K; Umaka, E N; Uras, A; Usai, G L; Utrobicic, A; Vala, M; Van Der Maarel, J; Van Hoorne, J W; van Leeuwen, M; Vanat, T; Vande Vyvre, P; Varga, D; Vargas, A; Vargyas, M; Varma, R; Vasileiou, M; Vasiliev, A; Vauthier, A; Vázquez Doce, O; Vechernin, V; Veen, A M; Velure, A; Vercellin, E; Vergara Limón, S; Vernet, R; Vértesi, R; Vickovic, L; Vigolo, S; Viinikainen, J; Vilakazi, Z; Villalobos Baillie, O; Villatoro Tello, A; Vinogradov, A; Vinogradov, L; Virgili, T; Vislavicius, V; Vodopyanov, A; Völkl, M A; Voloshin, K; Voloshin, S A; Volpe, G; von Haller, B; Vorobyev, I; Voscek, D; Vranic, D; Vrláková, J; Wagner, B; Wagner, J; Wang, H; Wang, M; Watanabe, D; Watanabe, Y; Weber, M; Weber, S G; Weiser, D F; Wessels, J P; Westerhoff, U; Whitehead, A M; Wiechula, J; Wikne, J; Wilk, G; Wilkinson, J; Willems, G A; Williams, M C S; Windelband, B; Witt, W E; Yalcin, S; Yang, P; Yano, S; Yin, Z; Yokoyama, H; Yoo, I-K; Yoon, J H; Yurchenko, V; Zaccolo, V; Zaman, A; Zampolli, C; Zanoli, H J C; Zaporozhets, S; Zardoshti, N; Zarochentsev, A; Závada, P; Zaviyalov, N; Zbroszczyk, H; Zhalov, M; Zhang, H; Zhang, X; Zhang, Y; Zhang, C; Zhang, Z; Zhao, C; Zhigareva, N; Zhou, D; Zhou, Y; Zhou, Z; Zhu, H; Zhu, J; Zhu, X; Zichichi, A; Zimmermann, A; Zimmermann, M B; Zimmermann, S; Zinovjev, G; Zmeskal, J

    2017-01-01

    The transverse momentum distributions of the strange and double-strange hyperon resonances ([Formula: see text], [Formula: see text]) produced in p-Pb collisions at [Formula: see text] TeV were measured in the rapidity range [Formula: see text] for event classes corresponding to different charged-particle multiplicity densities, [Formula: see text]d[Formula: see text]/d[Formula: see text]. The mean transverse momentum values are presented as a function of [Formula: see text]d[Formula: see text]/d[Formula: see text], as well as a function of the particle masses and compared with previous results on hyperon production. The integrated yield ratios of excited to ground-state hyperons are constant as a function of [Formula: see text]d[Formula: see text]/d[Formula: see text]. The equivalent ratios to pions exhibit an increase with [Formula: see text]d[Formula: see text]/d[Formula: see text], depending on their strangeness content.

  14. Relations Among Some Fuzzy Entropy Formulae

    Institute of Scientific and Technical Information of China (English)

    卿铭

    2004-01-01

    Fuzzy entropy has been widely used to analyze and design fuzzy systems, and many fuzzy entropy formulae have been proposed. For further in-deepth analysis of fuzzy entropy, the axioms and some important formulae of fuzzy entropy are introduced. Some equivalence results among these fuzzy entropy formulae are proved, and it is shown that fuzzy entropy is a special distance measurement.

  15. 27 CFR 25.57 - Formula information.

    Science.gov (United States)

    2010-04-01

    ... OF THE TREASURY LIQUORS BEER Miscellaneous Provisions Formulas § 25.57 Formula information. (a..., or after fermentation). (3) For formulas that include the use of flavors and other nonbeverage ingredients containing alcohol, you must explicitly indicate: (i) The volume and alcohol content of the beer...

  16. Analogues of Euler and Poisson Summation Formulae

    Indian Academy of Sciences (India)

    ... f ( n ) have been obtained in a unified manner, where (()) is a periodic complex sequence; () is the divisor function and () is a sufficiently smooth function on [, ]. We also state a generalised Abel's summation formula, generalised Euler's summation formula and Euler's summation formula in several variables.

  17. 27 CFR 5.26 - Formula requirements.

    Science.gov (United States)

    2010-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Formula requirements. 5.26 Section 5.26 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU, DEPARTMENT OF THE TREASURY LIQUORS LABELING AND ADVERTISING OF DISTILLED SPIRITS Formulas § 5.26 Formula...

  18. Parameter Estimation of Permanent Magnet Synchronous Motor Using Orthogonal Projection and Recursive Least Squares Combinatorial Algorithm

    Directory of Open Access Journals (Sweden)

    Iman Yousefi

    2015-01-01

    Full Text Available This paper presents parameter estimation of Permanent Magnet Synchronous Motor (PMSM using a combinatorial algorithm. Nonlinear fourth-order space state model of PMSM is selected. This model is rewritten to the linear regression form without linearization. Noise is imposed to the system in order to provide a real condition, and then combinatorial Orthogonal Projection Algorithm and Recursive Least Squares (OPA&RLS method is applied in the linear regression form to the system. Results of this method are compared to the Orthogonal Projection Algorithm (OPA and Recursive Least Squares (RLS methods to validate the feasibility of the proposed method. Simulation results validate the efficacy of the proposed algorithm.

  19. A new algorithm for recursive estimation of ARMA parameters in reactor noise analysis

    International Nuclear Information System (INIS)

    Tran Dinh Tri

    1992-01-01

    In this paper a new recursive algorithm for estimating the parameters of the Autoregressive Moving Average (ARMA) model from measured data is presented. The Yule-Walker equations for the case of the ARMA model are derived from the ARMA equation with innovations. The recursive algorithm is based on choosing an appropriate form of the operator functions and suitable representation of the (n + 1)-th order operator functions according to those with lower order. Two cases, when the order of the AR part is equal to that of the MA part, and the general case, were considered. (Author)

  20. Recursive prediction error methods for online estimation in nonlinear state-space models

    Directory of Open Access Journals (Sweden)

    Dag Ljungquist

    1994-04-01

    Full Text Available Several recursive algorithms for online, combined state and parameter estimation in nonlinear state-space models are discussed in this paper. Well-known algorithms such as the extended Kalman filter and alternative formulations of the recursive prediction error method are included, as well as a new method based on a line-search strategy. A comparison of the algorithms illustrates that they are very similar although the differences can be important for the online tracking capabilities and robustness. Simulation experiments on a simple nonlinear process show that the performance under certain conditions can be improved by including a line-search strategy.

  1. Recursive evaluation of interaction forces of unbounded soil in time domain

    International Nuclear Information System (INIS)

    Motosaka, M.

    1987-01-01

    Recursive formulations have hardly been used in the analysis of soil-structure interaction. A notable exception is described in Verbic 1973, which corresponds to the impulse-invariant way discussed in Section 2. Section 3 describes another possibility to derive a recursive relation based on a segment approach using z-transforms. An illustrative example is examined in Section 4, and in Section 5 the number of operations is addressed. This compact paper is based on Wolf and Motosaka 1988. (orig./HP)

  2. STATE ESTIMATION IN ALCOHOLIC CONTINUOUS FERMENTATION OF ZYMOMONAS MOBILIS USING RECURSIVE BAYESIAN FILTERING: A SIMULATION APPROACH

    Directory of Open Access Journals (Sweden)

    Olga Lucia Quintero

    2008-05-01

    Full Text Available This work presents a state estimator for a continuous bioprocess. To this aim, the Non Linear Filtering theory based on the recursive application of Bayes rule and Monte Carlo techniques is used. Recursive Bayesian Filters Sampling Importance Resampling (SIR is employed, including different kinds of resampling. Generally, bio-processes have strong non-linear and non-Gaussian characteristics, and this tool becomes attractive. The estimator behavior and performance are illustrated with the continuous process of alcoholic fermentation of Zymomonas mobilis. Not too many applications with this tool have been reported in the biotechnological area.

  3. Recursive analytical solution describing artificial satellite motion perturbed by an arbitrary number of zonal terms

    Science.gov (United States)

    Mueller, A. C.

    1977-01-01

    An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.

  4. Recursion relations for the overlap of a Morse continuum state with a Lanczos basis state

    International Nuclear Information System (INIS)

    Lutrus, C.K.; Suck Salk, S.H.

    1988-01-01

    In the resonant reactive scattering theory of Mundel, Berman, and Domcke [Phys. Rev. A 32, 181 (1985)], the overlap of a Morse continuum state and a Lanczos basis state appears in the expression of transition amplitude. In their study, recursion relations for Green's functions in the Lanczos basis were used for computational efficiency. In this paper we derive new recursion relations specifically for the evaluation of overlap between the Morse continuum wave and Lanczos basis state that appears in the transition amplitude of resonant scattering. They are found to be simple to use with great accuracy

  5. Recursive estimation techniques for detection of small objects in infrared image data

    Science.gov (United States)

    Zeidler, J. R.; Soni, T.; Ku, W. H.

    1992-04-01

    This paper describes a recursive detection scheme for point targets in infrared (IR) images. Estimation of the background noise is done using a weighted autocorrelation matrix update method and the detection statistic is calculated using a recursive technique. A weighting factor allows the algorithm to have finite memory and deal with nonstationary noise characteristics. The detection statistic is created by using a matched filter for colored noise, using the estimated noise autocorrelation matrix. The relationship between the weighting factor, the nonstationarity of the noise and the probability of detection is described. Some results on one- and two-dimensional infrared images are presented.

  6. A new design for SLAM front-end based on recursive SOM

    Science.gov (United States)

    Yang, Xuesi; Xia, Shengping

    2015-12-01

    Aiming at the graph optimization-based monocular SLAM, a novel design for the front-end in single camera SLAM is proposed, based on the recursive SOM. Pixel intensities are directly used to achieve image registration and motion estimation, which can save time compared with the current appearance-based frameworks, usually including feature extraction and matching. Once a key-frame is identified, a recursive SOM is used to actualize loop-closure detecting, resulting a more precise location. The experiment on a public dataset validates our method on a computer with a quicker and effective result.

  7. Algebraic properties of the monopole formula

    Energy Technology Data Exchange (ETDEWEB)

    Hanany, Amihay [Theoretical Physics Group, Imperial College London,Prince Consort Road, London, SW7 2AZ (United Kingdom); Sperling, Marcus [Fakultät für Physik, Universität Wien,Boltzmanngasse 5, 1200 Wien (Austria)

    2017-02-06

    The monopole formula provides the Hilbert series of the Coulomb branch for a 3-dimensional N=4 gauge theory. Employing the concept of a fan defined by the matter content, and summing over the corresponding collection of monoids, allows the following: firstly, we provide explicit expressions for the Hilbert series for any gauge group. Secondly, we prove that the order of the pole at t=1 and t→∞ equals the complex or quaternionic dimension of the moduli space, respectively. Thirdly, we determine all bare and dressed BPS monopole operators that are sufficient to generate the entire chiral ring. As an application, we demonstrate the implementation of our approach to computer algebra programs and the applicability to higher rank gauge theories.

  8. Stream Kriging: Incremental and recursive ordinary Kriging over spatiotemporal data streams

    Science.gov (United States)

    Zhong, Xu; Kealy, Allison; Duckham, Matt

    2016-05-01

    Ordinary Kriging is widely used for geospatial interpolation and estimation. Due to the O (n3) time complexity of solving the system of linear equations, ordinary Kriging for a large set of source points is computationally intensive. Conducting real-time Kriging interpolation over continuously varying spatiotemporal data streams can therefore be especially challenging. This paper develops and tests two new strategies for improving the performance of an ordinary Kriging interpolator adapted to a stream-processing environment. These strategies rely on the expectation that, over time, source data points will frequently refer to the same spatial locations (for example, where static sensor nodes are generating repeated observations of a dynamic field). First, an incremental strategy improves efficiency in cases where a relatively small proportion of previously processed spatial locations are absent from the source points at any given iteration. Second, a recursive strategy improves efficiency in cases where there is substantial set overlap between the sets of spatial locations of source points at the current and previous iterations. These two strategies are evaluated in terms of their computational efficiency in comparison to ordinary Kriging algorithm. The results show that these two strategies can reduce the time taken to perform the interpolation by up to 90%, and approach average-case time complexity of O (n2) when most but not all source points refer to the same locations over time. By combining the approaches developed in this paper with existing heuristic ordinary Kriging algorithms, the conclusions indicate how further efficiency gains could potentially be accrued. The work ultimately contributes to the development of online ordinary Kriging interpolation algorithms, capable of real-time spatial interpolation with large streaming data sets.

  9. Improving the Network Scale-Up Estimator: Incorporating Means of Sums, Recursive Back Estimation, and Sampling Weights.

    Directory of Open Access Journals (Sweden)

    Patrick Habecker

    Full Text Available Researchers interested in studying populations that are difficult to reach through traditional survey methods can now draw on a range of methods to access these populations. Yet many of these methods are more expensive and difficult to implement than studies using conventional sampling frames and trusted sampling methods. The network scale-up method (NSUM provides a middle ground for researchers who wish to estimate the size of a hidden population, but lack the resources to conduct a more specialized hidden population study. Through this method it is possible to generate population estimates for a wide variety of groups that are perhaps unwilling to self-identify as such (for example, users of illegal drugs or other stigmatized populations via traditional survey tools such as telephone or mail surveys--by asking a representative sample to estimate the number of people they know who are members of such a "hidden" subpopulation. The original estimator is formulated to minimize the weight a single scaling variable can exert upon the estimates. We argue that this introduces hidden and difficult to predict biases, and instead propose a series of methodological advances on the traditional scale-up estimation procedure, including a new estimator. Additionally, we formalize the incorporation of sample weights into the network scale-up estimation process, and propose a recursive process of back estimation "trimming" to identify and remove poorly performing predictors from the estimation process. To demonstrate these suggestions we use data from a network scale-up mail survey conducted in Nebraska during 2014. We find that using the new estimator and recursive trimming process provides more accurate estimates, especially when used in conjunction with sampling weights.

  10. Atomic mass formula with linear shell terms

    International Nuclear Information System (INIS)

    Uno, Masahiro; Yamada, Masami; Ando, Yoshihira; Tachibana, Takahiro.

    1981-01-01

    An atomic mass formula is constructed in the form of a sum of gross terms and empirical linear shell terms. Values of the shell parameters are determined after the statistical method of Uno and Yamada, Which is characterized by inclusion of the error inherent in the mass formula. The resulting formula reproduces the input masses with the standard deviation of 393 keV. A prescription is given for estimating errors of calculated masses. The mass formula is compared with recent experimental data of Rb, Cs and Fr isotopes, which are not included in the input data, and also with the constant-shell-term formula of Uno and Yamada. (author)

  11. Measurement of the [Formula: see text] meson lifetime using [Formula: see text] decays.

    Science.gov (United States)

    Aaij, R; Adeva, B; Adinolfi, M; Affolder, A; Ajaltouni, Z; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Cartelle, P Alvarez; Alves, A A; Amato, S; Amerio, S; Amhis, Y; Anderlini, L; Anderson, J; Andreassen, R; Andreotti, M; Andrews, J E; Appleby, R B; Gutierrez, O Aquines; Archilli, F; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Bachmann, S; Back, J J; Badalov, A; Balagura, V; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Batozskaya, V; Bauer, Th; Bay, A; Beddow, J; Bedeschi, F; Bediaga, I; Belogurov, S; Belous, K; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bettler, M-O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Bizzeti, A; Bjørnstad, P M; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Borsato, M; Bowcock, T J V; Bowen, E; Bozzi, C; Brambach, T; van den Brand, J; Bressieux, J; Brett, D; Britsch, M; Britton, T; Brook, N H; Brown, H; Bursche, A; Busetto, G; Buytaert, J; Cadeddu, S; Calabrese, R; Callot, O; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carranza-Mejia, H; Carson, L; Carvalho Akiba, K; Casse, G; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cenci, R; Charles, M; Charpentier, Ph; Cheung, S-F; Chiapolini, N; Chrzaszcz, M; Ciba, K; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coca, C; Coco, V; Cogan, J; Cogneras, E; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombes, M; Coquereau, S; Corti, G; Counts, I; Couturier, B; Cowan, G A; Craik, D C; Cruz Torres, M; Cunliffe, S; Currie, R; D'Ambrosio, C; Dalseno, J; David, P; David, P N Y; Davis, A; De Bonis, I; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Silva, W; De Simone, P; Decamp, D; Deckenhoff, M; Del Buono, L; Déléage, N; Derkach, D; Deschamps, O; Dettori, F; Di Canto, A; Dijkstra, H; Donleavy, S; Dordei, F; Dorigo, M; Dorosz, P; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dupertuis, F; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; El Rifai, I; Elsasser, Ch; Falabella, A; Färber, C; Farinelli, C; Farry, S; Ferguson, D; Fernandez Albor, V; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fiore, M; Fiorini, M; Fitzpatrick, C; Fontana, M; Fontanelli, F; Forty, R; Francisco, O; Frank, M; Frei, C; Frosini, M; Furfaro, E; Gallas Torreira, A; Galli, D; Gandelman, M; Gandini, P; Gao, Y; Garofoli, J; Garra Tico, J; Garrido, L; Gaspar, C; Gauld, R; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gianelle, A; Gibson, V; Giubega, L; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gordon, H; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Griffith, P; Grillo, L; Grünberg, O; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Hafkenscheid, T W; Haines, S C; Hall, S; Hamilton, B; Hampson, T; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hartmann, T; He, J; Head, T; Heijne, V; Hennessy, K; Henrard, P; Hernando Morata, J A; van Herwijnen, E; Heß, M; Hicheur, A; Hill, D; Hoballah, M; Hombach, C; Hulsbergen, W; Hunt, P; Huse, T; Hussain, N; Hutchcroft, D; Hynds, D; Iakovenko, V; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jans, E; Jaton, P; Jawahery, A; Jing, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Jurik, N; Kaballo, M; Kandybei, S; Kanso, W; Karacson, M; Karbach, T M; Kenyon, I R; Ketel, T; Khanji, B; Khurewathanakul, C; Klaver, S; Kochebina, O; Komarov, I; Koopman, R F; Koppenburg, P; Korolev, M; Kozlinskiy, A; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kucharczyk, M; Kudryavtsev, V; Kurek, K; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanciotti, E; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J-P; Lefèvre, R; Leflat, A; Lefrançois, J; Leo, S; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Liles, M; Lindner, R; Linn, C; Lionetto, F; Liu, B; Liu, G; Lohn, S; Longstaff, I; Lopes, J H; Lopez-March, N; Lowdon, P; Lu, H; Lucchesi, D; Luisier, J; Luo, H; Luppi, E; Lupton, O; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Malde, S; Manca, G; Mancinelli, G; Manzali, M; Maratas, J; Marconi, U; Marino, P; Märki, R; Marks, J; Martellotti, G; Martens, A; Martín Sánchez, A; Martinelli, M; Martinez Santos, D; Martins Tostes, D; Massafferri, A; Matev, R; Mathe, Z; Matteuzzi, C; Mazurov, A; McCann, M; McCarthy, J; McNab, A; McNulty, R; McSkelly, B; Meadows, B; Meier, F; Meissner, M; Merk, M; Milanes, D A; Minard, M-N; Molina Rodriguez, J; Monteil, S; Moran, D; Morandin, M; Morawski, P; Mordà, A; Morello, M J; Mountain, R; Mous, I; Muheim, F; Müller, K; Muresan, R; Muryn, B; Muster, B; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Needham, M; Neubert, S; Neufeld, N; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Nicol, M; Niess, V; Niet, R; Nikitin, N; Nikodem, T; Novoselov, A; Oblakowska-Mucha, A; Obraztsov, V; Oggero, S; Ogilvy, S; Okhrimenko, O; Oldeman, R; Onderwater, G; Orlandea, M; Otalora Goicochea, J M; Owen, P; Oyanguren, A; Pal, B K; Palano, A; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Pappalardo, L; Parkes, C; Parkinson, C J; Passaleva, G; Patel, G D; Patel, M; Patrignani, C; Pavel-Nicorescu, C; Pazos Alvarez, A; Pearce, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perez Trigo, E; Perret, P; Perrin-Terrin, M; Pescatore, L; Pesen, E; Pessina, G; Petridis, K; Petrolini, A; Picatoste Olloqui, E; Pietrzyk, B; Pilař, T; Pinci, D; Pistone, A; Playfer, S; Plo Casasus, M; Polci, F; Polok, G; Poluektov, A; Polycarpo, E; Popov, A; Popov, D; Popovici, B; Potterat, C; Powell, A; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Rachwal, B; Rademacker, J H; Rakotomiaramanana, B; Rama, M; Rangel, M S; Raniuk, I; Rauschmayr, N; Raven, G; Redford, S; Reichert, S; Reid, M M; Dos Reis, A C; Ricciardi, S; Richards, A; Rinnert, K; Rives Molina, V; Roa Romero, D A; Robbe, P; Roberts, D A; Rodrigues, A B; Rodrigues, E; Rodriguez Perez, P; Roiser, S; Romanovsky, V; Romero Vidal, A; Rotondo, M; Rouvinet, J; Ruf, T; Ruffini, F; Ruiz, H; Ruiz Valls, P; Sabatino, G; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salustino Guimaraes, V; Sanmartin Sedes, B; Santacesaria, R; Santamarina Rios, C; Santovetti, E; Sapunov, M; Sarti, A; Satriano, C; Satta, A; Savrie, M; Savrina, D; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmidt, B; Schneider, O; Schopper, A; Schune, M-H; Schwemmer, R; Sciascia, B; Sciubba, A; Seco, M; Semennikov, A; Senderowska, K; Sepp, I; Serra, N; Serrano, J; Seyfert, P; Shapkin, M; Shapoval, I; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, O; Shevchenko, V; Shires, A; Silva Coutinho, R; Simi, G; Sirendi, M; Skidmore, N; Skwarnicki, T; Smith, N A; Smith, E; Smith, E; Smith, J; Smith, M; Snoek, H; Sokoloff, M D; Soler, F J P; Soomro, F; Souza, D; Souza De Paula, B; Spaan, B; Sparkes, A; Spinella, F; Spradlin, P; Stagni, F; Stahl, S; Steinkamp, O; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Stracka, S; Straticiuc, M; Straumann, U; Stroili, R; Subbiah, V K; Sun, L; Sutcliffe, W; Swientek, S; Syropoulos, V; Szczekowski, M; Szczypka, P; Szilard, D; Szumlak, T; T'Jampens, S; Teklishyn, M; Tellarini, G; Teodorescu, E; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Tolk, S; Tomassetti, L; Tonelli, D; Topp-Joergensen, S; Torr, N; Tournefier, E; Tourneur, S; Tran, M T; Tresch, M; Tsaregorodtsev, A; Tsopelas, P; Tuning, N; Ubeda Garcia, M; Ukleja, A; Ustyuzhanin, A; Uwer, U; Vagnoni, V; Valenti, G; Vallier, A; Vazquez Gomez, R; Vazquez Regueiro, P; Vázquez Sierra, C; Vecchi, S; Velthuis, J J; Veltri, M; Veneziano, G; Vesterinen, M; Viaud, B; Vieira, D; Vilasis-Cardona, X; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; Voss, H; de Vries, J A; Waldi, R; Wallace, C; Wallace, R; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Webber, A D; Websdale, D; Whitehead, M; Wicht, J; Wiechczynski, J; Wiedner, D; Wiggers, L; Wilkinson, G; Williams, M P; Williams, M; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wormser, G; Wotton, S A; Wright, S; Wu, S; Wyllie, K; Xie, Y; Xing, Z; Yang, Z; Yuan, X; Yushchenko, O; Zangoli, M; Zavertyaev, M; Zhang, F; Zhang, L; Zhang, W C; Zhang, Y; Zhelezov, A; Zhokhov, A; Zhong, L; Zvyagin, A

    The lifetime of the [Formula: see text] meson is measured using semileptonic decays having a [Formula: see text] meson and a muon in the final state. The data, corresponding to an integrated luminosity of [Formula: see text], are collected by the LHCb detector in [Formula: see text] collisions at a centre-of-mass energy of 8 TeV. The measured lifetime is [Formula: see text]where the first uncertainty is statistical and the second is systematic.

  12. Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

    Science.gov (United States)

    Rodriguez, G.; Scheid, R. E., Jr.

    1987-01-01

    This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

  13. Joint Analysis of Binomial and Continuous Traits with a Recursive Model

    DEFF Research Database (Denmark)

    Varona, Louis; Sorensen, Daniel

    2014-01-01

    This work presents a model for the joint analysis of a binomial and a Gaussian trait using a recursive parametrization that leads to a computationally efficient implementation. The model is illustrated in an analysis of mortality and litter size in two breeds of Danish pigs, Landrace and Yorkshir...

  14. Real-time recursive motion segmentation of video data on a programmable device

    NARCIS (Netherlands)

    Wittebrood, R.B; Haan, de G.

    2001-01-01

    We previously reported on a recursive algorithm enabling real-time object-based motion estimation (OME) of standard definition video on a digital signal processor (DSP). The algorithm approximates the motion of the objects in the image with parametric motion models and creates a segmentation mask by

  15. The calculation of deep levels in semiconductors by using a recursion method for super-cells

    International Nuclear Information System (INIS)

    Wong Yongliang.

    1987-01-01

    The paper presents the theory of deep levels in semiconductors, the super-cell approach to the theory of deep level impurities, the calculation of band structure by using the tight-binding method and the recursion method used to study the defects in the presence of lattice relaxation and extended defect complexes. 47 refs

  16. Hurwitz numbers, moduli of curves, topological recursion, Givental's theory and their relations

    NARCIS (Netherlands)

    Spitz, L.

    2014-01-01

    The study of curves is an important area of research in algebraic geometry and mathematical physics. In my thesis I study so-called moduli spaces of curves; these are spaces that parametrize all curves with some specified properties. In particular, I study maps from curves to other spaces, recursive

  17. Using metrics for proof rules for recursively defined delay-insensitive specifications

    NARCIS (Netherlands)

    Mallon, WC; Udding, JT

    1997-01-01

    An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are

  18. The Monge-Ampère equation: Hamiltonian and symplectic structures, recursions, and hierarchies

    NARCIS (Netherlands)

    Kersten, P.H.M.; Krasil'shchik, I.; Verbovetsky, A.V.

    2004-01-01

    Using methods of geometry and cohomology developed recently, we study the Monge-Ampère equation, arising as the first nontrivial equation in the associativity equations, or WDVV equations. We describe Hamiltonian and symplectic structures as well as recursion operators for this equation in its

  19. Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals

    DEFF Research Database (Denmark)

    Sturm, Bob L.; Daudet, Laurent

    2011-01-01

    We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries...

  20. Cross-Validation of Survival Bump Hunting by Recursive Peeling Methods.

    Science.gov (United States)

    Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J Sunil

    2014-08-01

    We introduce a survival/risk bump hunting framework to build a bump hunting model with a possibly censored time-to-event type of response and to validate model estimates. First, we describe the use of adequate survival peeling criteria to build a survival/risk bump hunting model based on recursive peeling methods. Our method called "Patient Recursive Survival Peeling" is a rule-induction method that makes use of specific peeling criteria such as hazard ratio or log-rank statistics. Second, to validate our model estimates and improve survival prediction accuracy, we describe a resampling-based validation technique specifically designed for the joint task of decision rule making by recursive peeling (i.e. decision-box) and survival estimation. This alternative technique, called "combined" cross-validation is done by combining test samples over the cross-validation loops, a design allowing for bump hunting by recursive peeling in a survival setting. We provide empirical results showing the importance of cross-validation and replication.

  1. Tableau Formulas for One-Row Macdonald Polynomials of Types C_n and D_n

    Science.gov (United States)

    Feigin, Boris; Hoshino, Ayumu; Noumi, Masatoshi; Shibahara, Jun; Shiraishi, Jun'ichi

    2015-12-01

    We present explicit formulas for the Macdonald polynomials of types C_n and D_n in the one-row case. In view of the combinatorial structure, we call them ''tableau formulas''. For the construction of the tableau formulas, we apply some transformation formulas for the basic hypergeometric series involving very well-poised balanced {}_{12}W_{11} series. We remark that the correlation functions of the deformed W algebra generators automatically give rise to the tableau formulas when we principally specialize the coordinate variables.

  2. Tolerance of a standard intact protein formula versus a partially hydrolyzed formula in healthy, term infants

    Directory of Open Access Journals (Sweden)

    Marunycz John D

    2009-06-01

    Full Text Available Abstract Background Parents who perceive common infant behaviors as formula intolerance-related often switch formulas without consulting a health professional. Up to one-half of formula-fed infants experience a formula change during the first six months of life. Methods The objective of this study was to assess discontinuance due to study physician-assessed formula intolerance in healthy, term infants. Infants (335 were randomized to receive either a standard intact cow milk protein formula (INTACT or a partially hydrolyzed cow milk protein formula (PH in a 60 day non-inferiority trial. Discontinuance due to study physician-assessed formula intolerance was the primary outcome. Secondary outcomes included number of infants who discontinued for any reason, including parent-assessed. Results Formula intolerance between groups (INTACT, 12.3% vs. PH, 13.7% was similar for infants who completed the study or discontinued due to study physician-assessed formula intolerance. Overall study discontinuance based on parent- vs. study physician-assessed intolerance for all infants (14.4 vs.11.1% was significantly different (P = 0.001. Conclusion This study demonstrated no difference in infant tolerance of intact vs. partially hydrolyzed cow milk protein formulas for healthy, term infants over a 60-day feeding trial, suggesting nonstandard partially hydrolyzed formulas are not necessary as a first-choice for healthy infants. Parents frequently perceived infant behavior as formula intolerance, paralleling previous reports of unnecessary formula changes. Trial Registration clinicaltrials.gov: NCT00666120

  3. The Green-Kubo formula for locally interacting fermionic open systems

    CERN Document Server

    Jaksic, V; Pillet, C A

    2006-01-01

    We consider a model describing finitely many free Fermi gas reservoirs coupled by local interactions and prove the Green-Kubo formulas and the Onsager reciprocity relations for heat and charge fluxes generated by temperature and chemical potential differentials.

  4. Magical Formulae for Market Futures

    DEFF Research Database (Denmark)

    Garsten, Christina; Sörbom, Adrienne

    2016-01-01

    Markets are often portrayed as being organized by way of rationalized knowledge, objective reasoning, and the fluctuations of demand and supply. In parallel, and often mixed with this modality of knowledge, magical beliefs and practices are prevalent. Business leaders, management consultants......, and financial advisors are often savvy in the art of creatively blending the ‘objective facts’ of markets with magical formulae, rites, and imaginaries of the future. This article looks at the World Economic Forum's yearly Davos meeting as a large-scale ritual that engages senior executives of global...... corporations, top-level politicians, and civil society leaders to contribute to the overall aim of ‘improving the world’. The Davos gathering has become a vital part of the business calendar, just as much for the intensity of its networking as for the declarations of action from the speakers’ podiums...

  5. Chaos and the Kubo formula

    International Nuclear Information System (INIS)

    Suhl, H.

    1994-01-01

    Much of condensed matter theory makes copious use of linear response theory, often not in the sense of macroscopically based regression relations of Onsager type, but in the sense of the Kubo formulation, which is formally based on microscopic equations of motion. Van Kampen has cast doubt on the validity of the latter approach, noting that the extreme sensitivity of the orbits of many-particle systems to small deviations invalidates a microscopically derived linear theory. Here I show that its validity can be reestablished by treating real time as a stochastic function of collision number, and deferring the return to real time to the end of the calculation. However, the constants in the final formula do change. ((orig.))

  6. Mathematical Formula Search using Natural Language Queries

    Directory of Open Access Journals (Sweden)

    YANG, S.

    2014-11-01

    Full Text Available This paper presents how to search mathematical formulae written in MathML when given plain words as a query. Since the proposed method allows natural language queries like the traditional Information Retrieval for the mathematical formula search, users do not need to enter any complicated math symbols and to use any formula input tool. For this, formula data is converted into plain texts, and features are extracted from the converted texts. In our experiments, we achieve an outstanding performance, a MRR of 0.659. In addition, we introduce how to utilize formula classification for formula search. By using class information, we finally achieve an improved performance, a MRR of 0.690.

  7. Welfare Effects of Tariff Reduction Formulas

    DEFF Research Database (Denmark)

    Guldager, Jan G.; Schröder, Philipp J.H.

    WTO negotiations rely on tariff reduction formulas. It has been argued that formula approaches are of increasing importance in trade talks, because of the large number of countries involved, the wider dispersion in initial tariffs (e.g. tariff peaks) and gaps between bound and applied tariff rate....... No single formula dominates for all conditions. The ranking of the three tools depends on the degree of product differentiation in the industry, and the achieved reduction in the average tariff....

  8. A General Framework for Probabilistic Characterizing Formulae

    DEFF Research Database (Denmark)

    Sack, Joshua; Zhang, Lijun

    2012-01-01

    Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae of many non-probabilistic behavioral relations. Our paper studies their techniques in a probabilistic setting. We provide...... a general method for determining characteristic formulae of behavioral relations for probabilistic automata using fixed-point probability logics. We consider such behavioral relations as simulations and bisimulations, probabilistic bisimulations, probabilistic weak simulations, and probabilistic forward...

  9. Ctrl+Shift+Enter mastering Excel array formulas a book about building efficient formulas, advanced formulas, and array formulas for data analysis

    CERN Document Server

    Girvin, Mike

    2013-01-01

    Designed with Excel gurus in mind, this handbook outlines how to create formulas that can be used to solve everyday problems with a series of data values that standard Excel formulas cannot or would be too arduous to attempt. Beginning with an introduction to array formulas, this manual examines topics such as how they differ from ordinary formulas, the benefits and drawbacks of their use, functions that can and cannot handle array calculations, and array constants and functions. Among the practical applications surveyed include how to extract data from tables and unique lists, how to get resu

  10. Comparison of various HFB overlap formulae

    International Nuclear Information System (INIS)

    Oi, M.

    2015-01-01

    The nuclear many-body approach beyond the mean-field approximation demands overlap calculations of different many-body states. Norm overlaps between two different Hartree-Fock-Bogoliubov states can be calculated by means of the Onishi formula. However, the formula leaves the sign of the norm overlap undetermined. Several approaches have been proposed by Hara-Hayashi-Ring, Neergård-Wüst, and Robledo. In the present paper, the Neergård-Wüst formula is examined whether it is applicable to practical numerical calculations, although the formula was dismissed by many nuclear theoreticians so far for unknown reasons

  11. Design Formula for Breakage of Tetrapods

    DEFF Research Database (Denmark)

    Burcharth, H. F.; Jensen, Jacob Birk; Liu, Z.

    1995-01-01

    The paper presents a design formula for Tetrapod armour on a 1:1.5 slope exposed to head-on random wave attack. The formula predicts the relative number of broken Tetrapods as function of: the mass of the Tetrapods, the concrete tensile strength and the wave height in front of the structure. Thus......, the formula addresses the observed problem of ensuring structural integrity of the slender types of non-reinforced armour units. The formula is based on results from small scale model tests with load-cell instrumented Tetrapods in which both the static, the quasi-static and the impact proportions of the loads...

  12. Superfluid Kubo formulas from partition function

    International Nuclear Information System (INIS)

    Chapman, Shira; Hoyos, Carlos; Oz, Yaron

    2014-01-01

    Linear response theory relates hydrodynamic transport coefficients to equilibrium retarded correlation functions of the stress-energy tensor and global symmetry currents in terms of Kubo formulas. Some of these transport coefficients are non-dissipative and affect the fluid dynamics at equilibrium. We present an algebraic framework for deriving Kubo formulas for such thermal transport coefficients by using the equilibrium partition function. We use the framework to derive Kubo formulas for all such transport coefficients of superfluids, as well as to rederive Kubo formulas for various normal fluid systems

  13. Wave Generation Theory

    DEFF Research Database (Denmark)

    Frigaard, Peter; Høgedal, Michael; Christensen, Morten

    The intention of this manual is to provide some formulas and techniques which can be used for generating waves in hydraulic laboratories. Both long crested waves (2-D waves) and short crested waves (3-D waves) are considered.......The intention of this manual is to provide some formulas and techniques which can be used for generating waves in hydraulic laboratories. Both long crested waves (2-D waves) and short crested waves (3-D waves) are considered....

  14. A new optical rotation dispersion formula

    International Nuclear Information System (INIS)

    Kimel, I.

    1981-12-01

    A new dispersion formula for the rotatory power is obtained in the framework of Kubo forlalism for transport coefficients. Unlike the well known Rosenfeld-Condon dispersion law, this formula is consistent with the free electron gas asymptotic behavior. (Author) [pt

  15. Formula Approaches for Market Access Negotiations

    NARCIS (Netherlands)

    J.F. François (Joseph); W. Martin (William)

    2002-01-01

    textabstractMost of the large tariff reductions achieved in multilateral trade negotiations have involved tariff-cutting formulas such as the "Swiss" formula. However, wide variations in initial tariff rates between active participants call for new approaches under the Doha Development Agenda. This

  16. Bismut Formulae and Applications for Functional SPDEs

    OpenAIRE

    Bao, Jianhai; Wang, Feng-Yu; Yuan, Chenggui

    2011-01-01

    By using Malliavin calculus, explicit derivative formulae are established for a class of semi-linear functional stochastic partial differential equations with additive or multiplicative noise. As applications, gradient estimates and Harnack inequalities are derived for the semigroup of the associated segment process. Keywords: Bismut formula, Malliavin calculus, gradient estimate, Harnack inequality, functional SPDE

  17. The evolution of formula-bio

    NARCIS (Netherlands)

    Maas, A.; Steinbuch, M.

    2013-01-01

    Formula-Bio started out as a dream of building a race car with only three students and thereby showing the world that everything is possible if you put your passion into it. In this internship report the story of Formula-Bio and the reasoning behind the FB01 can be found. A large part of the report

  18. 5 CFR 1315.17 - Formulas.

    Science.gov (United States)

    2010-01-01

    ...) Daily simple interest formula. (1) To calculate daily simple interest the following formula may be used... a payment is due on April 1 and the payment is not made until April 11, a simple interest... equation calculates simple interest on any additional days beyond a monthly increment. (3) For example, if...

  19. New entropy formula for Kerr black holes

    Directory of Open Access Journals (Sweden)

    González Hernán A.

    2018-01-01

    Full Text Available We introduce a new entropy formula for Kerr black holes inspired by recent results for 3-dimensional black holes and cosmologies with soft Heisenberg hair. We show that also Kerr–Taub–NUT black holes obey the same formula.

  20. Misconceptions in global reactions and formula writing

    Directory of Open Access Journals (Sweden)

    Stig R. Johansson

    2016-10-01

    Full Text Available The frequently used concept of “global reaction” is discussed and the reason for the confusion behind explained. The misconception is cleared by formula writing based on the donor–acceptor (donac reaction concept and by applying the Grand Rule of Formula Writing that is based on it.

  1. Borromean surgery formula for the Casson invariant

    DEFF Research Database (Denmark)

    Meilhan, Jean-Baptiste Odet Thierry

    2008-01-01

    It is known that every oriented integral homology 3-sphere can be obtained from S3 by a finite sequence of Borromean surgeries. We give an explicit formula for the variation of the Casson invariant under such a surgery move. The formula involves simple classical invariants, namely the framing...

  2. 101 ready-to-use Excel formulas

    CERN Document Server

    Alexander, Michael

    2014-01-01

    Mr. Spreadsheet has done it again with 101 easy-to-apply Excel formulas 101 Ready-to-Use Excel Formulas is filled with the most commonly-used, real-world Excel formulas that can be repurposed and put into action, saving you time and increasing your productivity. Each segment of this book outlines a common business or analysis problem that needs to be solved and provides the actual Excel formulas to solve the problem-along with detailed explanation of how the formulas work. Written in a user-friendly style that relies on a tips and tricks approach, the book details how to perform everyday Excel tasks with confidence. 101 Ready-to-Use Excel Formulas is sure to become your well-thumbed reference to solve your workplace problems. The recipes in the book are structured to first present the problem, then provide the formula solution, and finally show how it works so that it can be customized to fit your needs. The companion website to the book allows readers to easily test the formulas and provides visual confirmat...

  3. 27 CFR 24.211 - Formula required.

    Science.gov (United States)

    2010-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Formula required. 24.211 Section 24.211 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU, DEPARTMENT... which it is to be made, except that no formula is required for distilling material or vinegar stock. The...

  4. Generating series for GUE correlators

    Science.gov (United States)

    Dubrovin, Boris; Yang, Di

    2017-11-01

    We extend to the Toda lattice hierarchy the approach of Bertola et al. (Phys D Nonlinear Phenom 327:30-57, 2016; IMRN, 2016) to computation of logarithmic derivatives of tau-functions in terms of the so-called matrix resolvents of the corresponding difference Lax operator. As a particular application we obtain explicit generating series for connected GUE correlators. On this basis an efficient recursive procedure for computing the correlators in full genera is developed.

  5. Assessing the relative importance of correlates of loneliness in later life: Gaining insight using recursive partitioning

    DEFF Research Database (Denmark)

    Ejlskov, Linda; Wulff, Jesper; Bøggild, Henrik

    2017-01-01

    and demographic correlates were poor identifiers of loneliness. The regression tree suggested that loneliness was not raised among those with poor mental wellbeing if they identified their partner as closest confidante and had frequent social contact. CONCLUSION: Recursive partitioning can identify which......OBJECTIVES: Improving the design and targeting of interventions is important for alleviating loneliness among older adults. This requires identifying which correlates are the most important predictors of loneliness. This study demonstrates the use of recursive partitioning in exploring...... the characteristics and assessing the relative importance of correlates of loneliness in older adults. METHOD: Using exploratory regression trees and random forests, we examined combinations and the relative importance of 42 correlates in relation to loneliness at age 68 among 2453 participants from the birth cohort...

  6. Analysis and application of two recursive parametric estimation algorithms for an asynchronous machine

    International Nuclear Information System (INIS)

    Damek, Nawel; Kamoun, Samira

    2011-01-01

    In this communication, two recursive parametric estimation algorithms are analyzed and applied to an squirrelcage asynchronous machine located at the research ''Unit of Automatic Control'' (UCA) at ENIS. The first algorithm which, use the transfer matrix mathematical model, is based on the gradient principle. The second algorithm, which use the state-space mathematical model, is based on the minimization of the estimation error. These algorithms are applied as a key technique to estimate asynchronous machine with unknown, but constant or timevarying parameters. Stator voltage and current are used as measured data. The proposed recursive parametric estimation algorithms are validated on the experimental data of an asynchronous machine under normal operating condition as full load. The results show that these algorithms can estimate effectively the machine parameters with reliability.

  7. Symmetries and recursion operators of variable coefficient Korteweg-de Vries equations

    International Nuclear Information System (INIS)

    Baby, B.V.

    1987-01-01

    The infinitely many symmetries and recursion operators are constructed for two recently introduced variable coefficient Korteweg-de Vries equations, u t +αt n uu x +βt 2n+1 u xxx =0 and v t +βt 2n+1 (v 3 -6vv x )+(n+1)/t(xv x +2v)=0. The recursion operators are developed from Lax-pairs and this method is extended to nonisospectral problems. Olver's method of finding the existence of infinitely many symmetries for an evolution equation is found to be true for the nonisospectral case. It is found that the minimum number of different infinite sets of symmetries is the same as the number of independent similarity transformation groups associated with the given evolution equation. The relation between Painleve property and symmetries is also discussed in this paper. (author). 29 refs

  8. Attitude determination and calibration using a recursive maximum likelihood-based adaptive Kalman filter

    Science.gov (United States)

    Kelly, D. A.; Fermelia, A.; Lee, G. K. F.

    1990-01-01

    An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.

  9. All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

    Directory of Open Access Journals (Sweden)

    N. Stojanovic

    2014-09-01

    Full Text Available A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0, controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev filters of the first and of the second kind, and also Legendre and Butterworth filters are shown to be special cases of these allpole recursive digital filters. Closed form equations for the computation of the filter coefficients are provided. The design technique is illustrated with examples.

  10. A fast iterative recursive least squares algorithm for Wiener model identification of highly nonlinear systems.

    Science.gov (United States)

    Kazemi, Mahdi; Arefi, Mohammad Mehdi

    2017-03-01

    In this paper, an online identification algorithm is presented for nonlinear systems in the presence of output colored noise. The proposed method is based on extended recursive least squares (ERLS) algorithm, where the identified system is in polynomial Wiener form. To this end, an unknown intermediate signal is estimated by using an inner iterative algorithm. The iterative recursive algorithm adaptively modifies the vector of parameters of the presented Wiener model when the system parameters vary. In addition, to increase the robustness of the proposed method against variations, a robust RLS algorithm is applied to the model. Simulation results are provided to show the effectiveness of the proposed approach. Results confirm that the proposed method has fast convergence rate with robust characteristics, which increases the efficiency of the proposed model and identification approach. For instance, the FIT criterion will be achieved 92% in CSTR process where about 400 data is used. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

  11. A novel intrusion detection method based on OCSVM and K-means recursive clustering

    Directory of Open Access Journals (Sweden)

    Leandros A. Maglaras

    2015-01-01

    Full Text Available In this paper we present an intrusion detection module capable of detecting malicious network traffic in a SCADA (Supervisory Control and Data Acquisition system, based on the combination of One-Class Support Vector Machine (OCSVM with RBF kernel and recursive k-means clustering. Important parameters of OCSVM, such as Gaussian width o and parameter v affect the performance of the classifier. Tuning of these parameters is of great importance in order to avoid false positives and over fitting. The combination of OCSVM with recursive k- means clustering leads the proposed intrusion detection module to distinguish real alarms from possible attacks regardless of the values of parameters o and v, making it ideal for real-time intrusion detection mechanisms for SCADA systems. Extensive simulations have been conducted with datasets extracted from small and medium sized HTB SCADA testbeds, in order to compare the accuracy, false alarm rate and execution time against the base line OCSVM method.

  12. Recursive approach for non-Markovian time-convolutionless master equations

    Science.gov (United States)

    Gasbarri, G.; Ferialdi, L.

    2018-02-01

    We consider a general open system dynamics and we provide a recursive method to derive the associated non-Markovian master equation in a perturbative series. The approach relies on a momenta expansion of the open system evolution. Unlike previous perturbative approaches of this kind, the method presented in this paper provides a recursive definition of each perturbative term. Furthermore, we give an intuitive diagrammatic description of each term of the series, which provides a useful analytical tool to build them and to derive their structure in terms of commutators and anticommutators. We eventually apply our formalism to the evolution of the observables of the reduced system, by showing how the method can be applied to the adjoint master equation, and by developing a diagrammatic description of the associated series.

  13. QCD amplitudes with 2 initial spacelike legs via generalised BCFW recursion

    Energy Technology Data Exchange (ETDEWEB)

    Kutak, Krzysztof; Hameren, Andreas van; Serino, Mirko [The H. Niewodniczański Institute of Nuclear Physics, Polish Academy of Sciences, ul. Radzikowskiego 152, 31-342, Cracow (Poland)

    2017-02-02

    We complete the generalisation of the BCFW recursion relation to the off-shell case, allowing for the computation of tree level scattering amplitudes for full High Energy Factorisation (HEF), i.e. with both incoming partons having a non-vanishing transverse momentum. We provide explicit results for color-ordered amplitudes with two off-shell legs in massless QCD up to 4 point, continuing the program begun in two previous papers. For the 4-fermion amplitudes, which are not BCFW-recursible, we perform a diagrammatic computation, so as to offer a complete set of expressions. We explicitly show and discuss some plots of the squared 2→2 matrix elements as functions of the differences in rapidity and azimuthal angle of the final state particles.

  14. CP-recursion and the derivation of verb second in Germanic main and embedded clauses

    DEFF Research Database (Denmark)

    Vikner, Sten

    2017-01-01

    , this is normally not the case for all types of embedded clauses, as e. g. embedded questions (almost) never allow V2 (Julien 2007, Vikner 2001, though see McCloskey 2006 and Biberauer 2015). As in Nyvad et al. (2016), I will explore a particular derivation of (embedded) V2, in terms of a cP/CP-distinction, which...... may be seen as a version of the CP-recursion analysis (deHaan & Weerman 1986, Vikner 1995 and many others). The idea is that because embedded V2 clauses do not allow extraction, whereas other types of CP-recursion clauses do (Christensen et al. 2013a; Christensen et al. 2013b; Christensen & Nyvad 2014...

  15. Recursive parameter estimation for Hammerstein-Wiener systems using modified EKF algorithm.

    Science.gov (United States)

    Yu, Feng; Mao, Zhizhong; Yuan, Ping; He, Dakuo; Jia, Mingxing

    2017-09-01

    This paper focuses on the recursive parameter estimation for the single input single output Hammerstein-Wiener system model, and the study is then extended to a rarely mentioned multiple input single output Hammerstein-Wiener system. Inspired by the extended Kalman filter algorithm, two basic recursive algorithms are derived from the first and the second order Taylor approximation. Based on the form of the first order approximation algorithm, a modified algorithm with larger parameter convergence domain is proposed to cope with the problem of small parameter convergence domain of the first order one and the application limit of the second order one. The validity of the modification on the expansion of convergence domain is shown from the convergence analysis and is demonstrated with two simulation cases. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  16. Nonparametric bootstrap procedures for predictive inference based on recursive estimation schemes

    OpenAIRE

    Corradi, Valentina; Swanson, Norman R.

    2005-01-01

    Our objectives in this paper are twofold. First, we introduce block bootstrap techniques that are (first order) valid in recursive estimation frameworks. Thereafter, we present two examples where predictive accuracy tests are made operational using our new bootstrap procedures. In one application, we outline a consistent test for out-of-sample nonlinear Granger causality, and in the other we outline a test for selecting amongst multiple alternative forecasting models, all of which are possibl...

  17. Recursive estimation of the claim rates and sizes in an insurance model

    Directory of Open Access Journals (Sweden)

    Lakhdar Aggoun

    2004-01-01

    Full Text Available It is a common fact that for most classes of general insurance, many possible sources of heterogeneity of risk exist. Premium rates based on information from a heterogeneous portfolio might be quite inadequate. One way of reducing this danger is by grouping policies according to the different levels of the various risk factors involved. Using measure change techniques, we derive recursive filters and predictors for the claim rates and claim sizes for the different groups.

  18. Separating the Classes of Recursively Enumerable Languages Based on Machine Size

    Czech Academy of Sciences Publication Activity Database

    van Leeuwen, J.; Wiedermann, Jiří

    2015-01-01

    Roč. 26, č. 6 (2015), s. 677-695 ISSN 0129-0541 R&D Projects: GA ČR GAP202/10/1333 Grant - others:GA ČR(CZ) GA15-04960S Institutional support: RVO:67985807 Keywords : recursively enumerable languages * RE hierarchy * finite languages * machine size * descriptional complexity * Turing machines with advice Subject RIV: IN - Informatics, Computer Science Impact factor: 0.467, year: 2015

  19. Recursive estimation of high-order Markov chains: Approximation by finite mixtures

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav

    2016-01-01

    Roč. 326, č. 1 (2016), s. 188-201 ISSN 0020-0255 R&D Projects : GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Markov chain * Approximate parameter estimation * Bayesian recursive estimation * Adaptive systems * Kullback–Leibler divergence * Forgetting Subject RIV: BC - Control Systems Theory Impact factor: 4.832, year: 2016 http://library.utia.cas.cz/separaty/2015/AS/karny-0447119.pdf

  20. Numerical solution of recirculating flow by a simple finite element recursion relation

    Energy Technology Data Exchange (ETDEWEB)

    Pepper, D W; Cooper, R E

    1980-01-01

    A time-split finite element recursion relation, based on linear basis functions, is used to solve the two-dimensional equations of motion. Recirculating flow in a rectangular cavity and free convective flow in an enclosed container are analyzed. The relation has the advantage of finite element accuracy and finite difference speed and simplicity. Incorporating dissipation parameters in the functionals decreases numerical dispersion and improves phase lag.

  1. All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

    OpenAIRE

    N. Stojanovic; N. Stamenkovic; V. Stojanovic

    2014-01-01

    A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0), controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev f...

  2. Local Stability Conditions for Two Types of Monetary Models with Recursive Utility

    OpenAIRE

    Miyazaki, Kenji; Utsunomiya, Hitoshi

    2009-01-01

    This paper explores local stability conditions for money-in-utility-function (MIUF) and transaction-costs (TC) models with recursive utility.A monetary variant of the Brock-Gale condition provides a theoretical justification of the comparative statics analysis. One of sufficient conditions for local stability is increasing marginal impatience (IMI) in consumption and money. However, this does not deny the possibility of decreasing marginal impatience (DMI). The local stability with DMI is mor...

  3. ACCOUNTING FUNDAMENTALS AND VARIATIONS OF STOCK PRICE: METHODOLOGICAL REFINEMENT WITH RECURSIVE SIMULTANEOUS MODEL

    OpenAIRE

    Sumiyana, Sumiyana; Baridwan, Zaki

    2015-01-01

    This study investigates association between accounting fundamentals and variations of stock prices using recursive simultaneous equation model. The accounting fundamentalsconsist of earnings yield, book value, profitability, growth opportunities and discount rate. The prior single relationships model has been investigated by Chen and Zhang (2007),Sumiyana (2011) and Sumiyana et al. (2010). They assume that all accounting fundamentals associate direct-linearly to the stock returns. This study ...

  4. Accounting Fundamentals and Variations of Stock Price: Methodological Refinement with Recursive Simultaneous Model

    OpenAIRE

    Sumiyana, Sumiyana; Baridwan, Zaki

    2013-01-01

    This study investigates association between accounting fundamentals and variations of stock prices using recursive simultaneous equation model. The accounting fundamentalsconsist of earnings yield, book value, profitability, growth opportunities and discount rate. The prior single relationships model has been investigated by Chen and Zhang (2007),Sumiyana (2011) and Sumiyana et al. (2010). They assume that all accounting fundamentals associate direct-linearly to the stock returns. This study ...

  5. PATH ANALYSIS WITH LOGISTIC REGRESSION MODELS : EFFECT ANALYSIS OF FULLY RECURSIVE CAUSAL SYSTEMS OF CATEGORICAL VARIABLES

    OpenAIRE

    Nobuoki, Eshima; Minoru, Tabata; Geng, Zhi; Department of Medical Information Analysis, Faculty of Medicine, Oita Medical University; Department of Applied Mathematics, Faculty of Engineering, Kobe University; Department of Probability and Statistics, Peking University

    2001-01-01

    This paper discusses path analysis of categorical variables with logistic regression models. The total, direct and indirect effects in fully recursive causal systems are considered by using model parameters. These effects can be explained in terms of log odds ratios, uncertainty differences, and an inner product of explanatory variables and a response variable. A study on food choice of alligators as a numerical exampleis reanalysed to illustrate the present approach.

  6. Study of the production of charged pions, kaons, and protons in pPb collisions at [Formula: see text]5.02[Formula: see text].

    Science.gov (United States)

    Chatrchyan, S; Khachatryan, V; Sirunyan, A M; Tumasyan, A; Adam, W; Bergauer, T; Dragicevic, M; Erö, J; Fabjan, C; Friedl, M; Frühwirth, R; Ghete, V M; Hörmann, N; Hrubec, J; Jeitler, M; Kiesenhofer, W; Knünz, V; Krammer, M; Krätschmer, I; Liko, D; Mikulec, I; Rabady, D; Rahbaran, B; Rohringer, C; Rohringer, H; Schöfbeck, R; Strauss, J; Taurok, A; Treberer-Treberspurg, W; Waltenberger, W; Wulz, C-E; Mossolov, V; Shumeiko, N; Suarez Gonzalez, J; Alderweireldt, S; Bansal, M; Bansal, S; Cornelis, T; De Wolf, E A; Janssen, X; Knutsson, A; Luyckx, S; Mucibello, L; Ochesanu, S; Roland, B; Rougny, R; Staykova, Z; Van Haevermaet, H; Van Mechelen, P; Van Remortel, N; Van Spilbeeck, A; Blekman, F; Blyweert, S; D'Hondt, J; Kalogeropoulos, A; Keaveney, J; Maes, M; Olbrechts, A; Tavernier, S; Van Doninck, W; Van Mulders, P; Van Onsem, G P; Villella, I; Caillol, C; Clerbaux, B; De Lentdecker, G; Favart, L; Gay, A P R; Hreus, T; Léonard, A; Marage, P E; Mohammadi, A; Perniè, L; Reis, T; Seva, T; Thomas, L; Van der Velde, C; Vanlaer, P; Wang, J; Adler, V; Beernaert, K; Benucci, L; Cimmino, A; Costantini, S; Dildick, S; Garcia, G; Klein, B; Lellouch, J; Marinov, A; Mccartin, J; Rios, A A Ocampo; Ryckbosch, D; Sigamani, M; Strobbe, N; Thyssen, F; Tytgat, M; Walsh, S; Yazgan, E; Zaganidis, N; Basegmez, S; Beluffi, C; Bruno, G; Castello, R; Caudron, A; Ceard, L; Delaere, C; du Pree, T; Favart, D; Forthomme, L; Giammanco, A; Hollar, J; Jez, P; Lemaitre, V; Liao, J; Militaru, O; Nuttens, C; Pagano, D; Pin, A; Piotrzkowski, K; Popov, A; Selvaggi, M; Garcia, J M Vizan; Beliy, N; Caebergs, T; Daubie, E; Hammad, G H; Alves, G A; Martins Junior, M Correa; Martins, T; Pol, M E; Souza, M H G; Aldá Júnior, W L; Carvalho, W; Chinellato, J; Custódio, A; Da Costa, E M; De Jesus Damiao, D; De Oliveira Martins, C; De Souza, S Fonseca; Malbouisson, H; Malek, M; Figueiredo, D Matos; Mundim, L; Nogima, H; Da Silva, W L Prado; Santoro, A; Sznajder, A; Manganote, E J Tonelli; Pereira, A Vilela; Dias, F A; Tomei, T R Fernandez Perez; Lagana, C; Novaes, S F; Padula, Sandra S; Bernardes, C A; Gregores, E M; Mercadante, P G; Genchev, V; Iaydjiev, P; Piperov, S; Rodozov, M; Sultanov, G; Vutova, M; Dimitrov, A; Hadjiiska, R; Kozhuharov, V; Litov, L; Pavlov, B; Petkov, P; Bian, J G; Chen, G M; Chen, H S; Jiang, C H; Liang, D; Liang, S; Meng, X; Tao, J; Wang, X; Wang, Z; Xiao, H; Xu, M; Asawatangtrakuldee, C; Ban, Y; Guo, Y; Li, W; Liu, S; Mao, Y; Qian, S J; Teng, H; Wang, D; Zhang, L; Zou, W; Avila, C; Montoya, C A Carrillo; Sierra, L F Chaparro; Gomez, J P; Moreno, B Gomez; Sanabria, J C; Godinovic, N; Lelas, D; Plestina, R; Polic, D; Puljak, I; Antunovic, Z; Kovac, M; Brigljevic, V; Duric, S; Kadija, K; Luetic, J; Mekterovic, D; Morovic, S; Tikvica, L; Attikis, A; Mavromanolakis, G; Mousa, J; Nicolaou, C; Ptochos, F; Razis, P A; Finger, M; Finger, M; Abdelalim, A A; Assran, Y; Elgammal, S; Ellithi Kamel, A; Mahmoud, M A; Radi, A; Kadastik, M; Müntel, M; Murumaa, M; Raidal, M; Rebane, L; Tiko, A; Eerola, P; Fedi, G; Voutilainen, M; Härkönen, J; Karimäki, V; Kinnunen, R; Kortelainen, M J; Lampén, T; Lassila-Perini, K; Lehti, S; Lindén, T; Luukka, P; Mäenpää, T; Peltola, T; Tuominen, E; Tuominiemi, J; Tuovinen, E; Wendland, L; Tuuva, T; Besancon, M; Couderc, F; Dejardin, M; Denegri, D; Fabbro, B; Faure, J L; Ferri, F; Ganjour, S; Givernaud, A; Gras, P; de Monchenault, G Hamel; Jarry, P; Locci, E; Malcles, J; Millischer, L; Nayak, A; Rander, J; Rosowsky, A; Titov, M; Baffioni, S; Beaudette, F; Benhabib, L; Bluj, M; Busson, P; Charlot, C; Daci, N; Dahms, T; Dalchenko, M; Dobrzynski, L; Florent, A; de Cassagnac, R Granier; Haguenauer, M; Miné, P; Mironov, C; Naranjo, I N; Nguyen, M; Ochando, C; Paganini, P; Sabes, D; Salerno, R; Sirois, Y; Veelken, C; Zabi, A; Agram, J-L; Andrea, J; Bloch, D; Brom, J-M; Chabert, E C; Collard, C; Conte, E; Drouhin, F; Fontaine, J-C; Gelé, D; Goerlach, U; Goetzmann, C; Juillot, P; Le Bihan, A-C; Van Hove, P; Gadrat, S; Beauceron, S; Beaupere, N; Boudoul, G; Brochet, S; Chasserat, J; Chierici, R; Contardo, D; Depasse, P; El Mamouni, H; Fay, J; Gascon, S; Gouzevitch, M; Ille, B; Kurca, T; Lethuillier, M; Mirabito, L; Perries, S; Sgandurra, L; Sordini, V; Vander Donckt, M; Verdier, P; Viret, S; Tsamalaidze, Z; Autermann, C; Beranek, S; Calpas, B; Edelhoff, M; Feld, L; Heracleous, N; Hindrichs, O; Klein, K; Ostapchuk, A; Perieanu, A; Raupach, F; Sammet, J; Schael, S; Sprenger, D; Weber, H; Wittmer, B; Zhukov, V; Ata, M; Caudron, J; Dietz-Laursonn, E; Duchardt, D; Erdmann, M; Fischer, R; Güth, A; Hebbeker, T; Heidemann, C; Hoepfner, K; Klingebiel, D; Kreuzer, P; Merschmeyer, M; Meyer, A; Olschewski, M; Padeken, K; Papacz, P; Pieta, H; Reithler, H; Schmitz, S A; Sonnenschein, L; Steggemann, J; Teyssier, D; Thüer, S; Weber, M; Cherepanov, V; Erdogan, Y; Flügge, G; Geenen, H; Geisler, M; Haj Ahmad, W; Hoehle, F; Kargoll, B; Kress, T; Kuessel, Y; Lingemann, J; Nowack, A; Nugent, I M; Perchalla, L; Pooth, O; Stahl, A; Aldaya Martin, M; Asin, I; Bartosik, N; Behr, J; Behrenhoff, W; Behrens, U; Bergholz, M; Bethani, A; Borras, K; Burgmeier, A; Cakir, A; Calligaris, L; Campbell, A; Choudhury, S; Costanza, F; Diez Pardos, C; Dooling, S; Dorland, T; Eckerlin, G; Eckstein, D; Flucke, G; Geiser, A; Glushkov, I; Gunnellini, P; Habib, S; Hauk, J; Hellwig, G; Horton, D; Jung, H; Kasemann, M; Katsas, P; Kleinwort, C; Kluge, H; Krämer, M; Krücker, D; Kuznetsova, E; Lange, W; Leonard, J; Lipka, K; Lohmann, W; Lutz, B; Mankel, R; Marfin, I; Melzer-Pellmann, I-A; Meyer, A B; Mnich, J; Mussgiller, A; Naumann-Emme, S; Novgorodova, O; Nowak, F; Olzem, J; Perrey, H; Petrukhin, A; Pitzl, D; Placakyte, R; Raspereza, A; Cipriano, P M Ribeiro; Riedl, C; Ron, E; Sahin, M Ö; Salfeld-Nebgen, J; Schmidt, R; Schoerner-Sadenius, T; Sen, N; Stein, M; Walsh, R; Wissing, C; Blobel, V; Enderle, H; Erfle, J; Garutti, E; Gebbert, U; Görner, M; Gosselink, M; Haller, J; Heine, K; Höing, R S; Kaussen, G; Kirschenmann, H; Klanner, R; Kogler, R; Lange, J; Marchesini, I; Peiffer, T; Pietsch, N; Rathjens, D; Sander, C; Schettler, H; Schleper, P; Schlieckau, E; Schmidt, A; Schröder, M; Schum, T; Seidel, M; Sibille, J; Sola, V; Stadie, H; Steinbrück, G; Thomsen, J; Troendle, D; Usai, E; Vanelderen, L; Barth, C; Baus, C; Berger, J; Böser, C; Butz, E; Chwalek, T; De Boer, W; Descroix, A; Dierlamm, A; Feindt, M; Guthoff, M; Hartmann, F; Hauth, T; Held, H; Hoffmann, K H; Husemann, U; Katkov, I; Komaragiri, J R; Kornmayer, A; Lobelle Pardo, P; Martschei, D; Müller, Th; Niegel, M; Nürnberg, A; Oberst, O; Ott, J; Quast, G; Rabbertz, K; Ratnikov, F; Röcker, S; Schilling, F-P; Schott, G; Simonis, H J; Stober, F M; Ulrich, R; Wagner-Kuhr, J; Wayand, S; Weiler, T; Zeise, M; Anagnostou, G; Daskalakis, G; Geralis, T; Kesisoglou, S; Kyriakis, A; Loukas, D; Markou, A; Markou, C; Ntomari, E; Gouskos, L; Panagiotou, A; Saoulidou, N; Stiliaris, E; Aslanoglou, X; Evangelou, I; Flouris, G; Foudas, C; Kokkas, P; Manthos, N; Papadopoulos, I; Paradas, E; Bencze, G; Hajdu, C; Hidas, P; Horvath, D; Sikler, F; Veszpremi, V; Vesztergombi, G; Zsigmond, A J; Beni, N; Czellar, S; Molnar, J; Palinkas, J; Szillasi, Z; Karancsi, J; Raics, P; Trocsanyi, Z L; Ujvari, B; Swain, S K; Beri, S B; Bhatnagar, V; Dhingra, N; Gupta, R; Kaur, M; Mehta, M Z; Mittal, M; Nishu, N; Saini, L K; Sharma, A; Singh, J B; Kumar, Ashok; Kumar, Arun; Ahuja, S; Bhardwaj, A; Choudhary, B C; Malhotra, S; Naimuddin, M; Ranjan, K; Saxena, P; Sharma, V; Shivpuri, R K; Banerjee, S; Bhattacharya, S; Chatterjee, K; Dutta, S; Gomber, B; Jain, Sa; Jain, Sh; Khurana, R; Modak, A; Mukherjee, S; Roy, D; Sarkar, S; Sharan, M; Abdulsalam, A; Dutta, D; Kailas, S; Kumar, V; Mohanty, A K; Pant, L M; Shukla, P; Topkar, A; Aziz, T; Chatterjee, R M; Ganguly, S; Ghosh, S; Guchait, M; Gurtu, A; Kole, G; Kumar, S; Maity, M; Majumder, G; Mazumdar, K; Mohanty, G B; Parida, B; Sudhakar, K; Wickramage, N; Dugad, S; Arfaei, H; Bakhshiansohi, H; Etesami, S M; Fahim, A; Jafari, A; Khakzad, M; Najafabadi, M Mohammadi; Mehdiabadi, S Paktinat; Safarzadeh, B; Zeinali, M; Grunewald, M; Abbrescia, M; Barbone, L; Calabria, C; Chhibra, S S; Colaleo, A; Creanza, D; De Filippis, N; De Palma, M; Fiore, L; Iaselli, G; Maggi, G; Maggi, M; Marangelli, B; My, S; Nuzzo, S; Pacifico, N; Pompili, A; Pugliese, G; Selvaggi, G; Silvestris, L; Singh, G; Venditti, R; Verwilligen, P; Zito, G; Abbiendi, G; Benvenuti, A C; Bonacorsi, D; Braibant-Giacomelli, S; Brigliadori, L; Campanini, R; Capiluppi, P; Castro, A; Cavallo, F R; Codispoti, G; Cuffiani, M; Dallavalle, G M; Fabbri, F; Fanfani, A; Fasanella, D; Giacomelli, P; Grandi, C; Guiducci, L; Marcellini, S; Masetti, G; Meneghelli, M; Montanari, A; Navarria, F L; Odorici, F; Perrotta, A; Primavera, F; Rossi, A M; Rovelli, T; Siroli, G P; Tosi, N; Travaglini, R; Albergo, S; Chiorboli, M; Costa, S; Giordano, F; Potenza, R; Tricomi, A; Tuve, C; Barbagli, G; Ciulli, V; Civinini, C; D'Alessandro, R; Focardi, E; Frosali, S; Gallo, E; Gonzi, S; Gori, V; Lenzi, P; Meschini, M; Paoletti, S; Sguazzoni, G; Tropiano, A; Benussi, L; Bianco, S; Piccolo, D; Fabbricatore, P; Musenich, R; Tosi, S; Benaglia, A; De Guio, F; Dinardo, M E; Fiorendi, S; Gennai, S; Ghezzi, A; Govoni, P; Lucchini, M T; Malvezzi, S; Manzoni, R A; Martelli, A; Menasce, D; Moroni, L; Paganoni, M; Pedrini, D; Ragazzi, S; Redaelli, N; de Fatis, T Tabarelli; Buontempo, S; Cavallo, N; De Cosa, A; Fabozzi, F; Iorio, A O M; Lista, L; Meola, S; Merola, M; Paolucci, P; Azzi, P; Bacchetta, N; Bisello, D; Branca, A; Carlin, R; Checchia, P; Dorigo, T; Dosselli, U; Galanti, M; Gasparini, F; Gasparini, U; Giubilato, P; Gonella, F; Gozzelino, A; Kanishchev, K; Lacaprara, S; Lazzizzera, I; Margoni, M; Meneguzzo, A T; Montecassiano, F; Passaseo, M; Pazzini, J; Pozzobon, N; Ronchese, P; Simonetto, F; Torassa, E; Tosi, M; Vanini, S; Zotto, P; Zucchetta, A; Zumerle, G; Kanishchev, F K; Gabusi, M; Ratti, S P; Riccardi, C; Vitulo, P; Biasini, M; Bilei, G M; Fanò, L; Lariccia, P; Mantovani, G; Menichelli, M; Nappi, A; Romeo, F; Saha, A; Santocchia, A; Spiezia, A; Androsov, K; Azzurri, P; Bagliesi, G; Bernardini, J; Boccali, T; Broccolo, G; Castaldi, R; Ciocci, M A; D'Agnolo, R T; Dell'Orso, R; Fiori, F; Foà, L; Giassi, A; Grippo, M T; Kraan, A; Ligabue, F; Lomtadze, T; Martini, L; Messineo, A; Palla, F; Rizzi, A; Savoy-Navarro, A; Serban, A T; Spagnolo, P; Squillacioti, P; Tenchini, R; Tonelli, G; Venturi, A; Verdini, P G; Vernieri, C; Barone, L; Cavallari, F; Del Re, D; Diemoz, M; Grassi, M; Longo, E; Margaroli, F; Meridiani, P; Micheli, F; Nourbakhsh, S; Organtini, G; Paramatti, R; Rahatlou, S; Rovelli, C; Soffi, L; Amapane, N; Arcidiacono, R; Argiro, S; Arneodo, M; Bellan, R; Biino, C; Cartiglia, N; Casasso, S; Costa, M; Demaria, N; Mariotti, C; Maselli, S; Mazza, G; Migliore, E; Monaco, V; Musich, M; Obertino, M M; Pastrone, N; Pelliccioni, M; Potenza, A; Romero, A; Ruspa, M; Sacchi, R; Solano, A; Staiano, A; Tamponi, U; Belforte, S; Candelise, V; Casarsa, M; Cossutti, F; Ricca, G Della; Gobbo, B; La Licata, C; Marone, M; Montanino, D; Penzo, A; Schizzi, A; Zanetti, A; Chang, S; Kim, T Y; Nam, S K; Kim, D H; Kim, G N; Kim, J E; Kong, D J; Oh, Y D; Park, H; Son, D C; Kim, J Y; Kim, Zero J; Song, S; Choi, S; Gyun, D; Hong, B; Jo, M; Kim, H; Kim, T J; Lee, K S; Park, S K; Roh, Y; Choi, M; Kim, J H; Park, C; Park, I C; Park, S; Ryu, G; Choi, Y; Choi, Y K; Goh, J; Kim, M S; Kwon, E; Lee, B; Lee, J; Lee, S; Seo, H; Yu, I; Grigelionis, I; Juodagalvis, A; Castilla-Valdez, H; De La Cruz-Burelo, E; de La Cruz, I Heredia; Lopez-Fernandez, R; Martínez-Ortega, J; Sanchez-Hernandez, A; Villasenor-Cendejas, L M; Carrillo Moreno, S; Vazquez Valencia, F; Salazar Ibarguen, H A; Linares, E Casimiro; Pineda, A Morelos; Reyes-Santos, M A; Krofcheck, D; Bell, A J; Butler, P H; Doesburg, R; Reucroft, S; Silverwood, H; Ahmad, M; Asghar, M I; Butt, J; Hoorani, H R; Khalid, S; Khan, W A; Khurshid, T; Qazi, S; Shah, M A; Shoaib, M; Bialkowska, H; Boimska, B; Frueboes, T; Górski, M; Kazana, M; Nawrocki, K; Romanowska-Rybinska, K; Szleper, M; Wrochna, G; Zalewski, P; Brona, G; Bunkowski, K; Cwiok, M; Dominik, W; Doroba, K; Kalinowski, A; Konecki, M; Krolikowski, J; Misiura, M; Wolszczak, W; Almeida, N; Bargassa, P; Da Cruz E Silva, C Beirão; Faccioli, P; Ferreira Parracho, P G; Gallinaro, M; Nguyen, F; Antunes, J Rodrigues; Seixas, J; Varela, J; Vischia, P; Afanasiev, S; Bunin, P; Gavrilenko, M; Golutvin, I; Gorbunov, I; Karjavin, V; Konoplyanikov, V; Kozlov, G; Lanev, A; Malakhov, A; Matveev, V; Moisenz, P; Palichik, V; Perelygin, V; Shmatov, S; Skatchkov, N; Smirnov, V; Zarubin, A; Evstyukhin, S; Golovtsov, V; Ivanov, Y; Kim, V; Levchenko, P; Murzin, V; Oreshkin, V; Smirnov, I; Sulimov, V; Uvarov, L; Vavilov, S; Vorobyev, A; Vorobyev, An; Andreev, Yu; Dermenev, A; Gninenko, S; Golubev, N; Kirsanov, M; Krasnikov, N; Pashenkov, A; Tlisov, D; Toropin, A; Epshteyn, V; Erofeeva, M; Gavrilov, V; Lychkovskaya, N; Popov, V; Safronov, G; Semenov, S; Spiridonov, A; Stolin, V; Vlasov, E; Zhokin, A; Andreev, V; Azarkin, M; Dremin, I; Kirakosyan, M; Leonidov, A; Mesyats, G; Rusakov, S V; Vinogradov, A; Belyaev, A; Boos, E; Ershov, A; Gribushin, A; Klyukhin, V; Kodolova, O; Korotkikh, V; Lokhtin, I; Markina, A; Obraztsov, S; Petrushanko, S; Savrin, V; Snigirev, A; Vardanyan, I; Azhgirey, I; Bayshev, I; Bitioukov, S; Kachanov, V; Kalinin, A; Konstantinov, D; Krychkine, V; Petrov, V; Ryutin, R; Sobol, A; Tourtchanovitch, L; Troshin, S; Tyurin, N; Uzunian, A; Volkov, A; Adzic, P; Djordjevic, M; Ekmedzic, M; Krpic, D; Milosevic, J; Aguilar-Benitez, M; Maestre, J Alcaraz; Battilana, C; Calvo, E; Cerrada, M; Llatas, M Chamizo; Colino, N; De La Cruz, B; Peris, A Delgado; Vázquez, D Domínguez; Bedoya, C Fernandez; Ramos, J P Fernández; Ferrando, A; Flix, J; Fouz, M C; Garcia-Abia, P; Lopez, O Gonzalez; Lopez, S Goy; Hernandez, J M; Josa, M I; Merino, G; De Martino, E Navarro; Pelayo, J Puerta; Olmeda, A Quintario; Redondo, I; Romero, L; Santaolalla, J; Soares, M S; Willmott, C; Albajar, C; de Trocóniz, J F; Brun, H; Cuevas, J; Menendez, J Fernandez; Folgueras, S; Caballero, I Gonzalez; Iglesias, L Lloret; Gomez, J Piedra; Cifuentes, J A Brochero; Cabrillo, I J; Calderon, A; Chuang, S H; Campderros, J Duarte; Fernandez, M; Gomez, G; Sanchez, J Gonzalez; Graziano, A; Jorda, C; Virto, A Lopez; Marco, J; Marco, R; Rivero, C Martinez; Matorras, F; Sanchez, F J Munoz; Rodrigo, T; Rodríguez-Marrero, A Y; Ruiz-Jimeno, A; Scodellaro, L; Vila, I; Cortabitarte, R Vilar; Abbaneo, D; Auffray, E; Auzinger, G; Bachtis, M; Baillon, P; Ball, A H; Barney, D; Bendavid, J; Benitez, J F; Bernet, C; Bianchi, G; Bloch, P; Bocci, A; Bonato, A; Bondu, O; Botta, C; Breuker, H; Camporesi, T; Cerminara, G; Christiansen, T; Perez, J A Coarasa; Colafranceschi, S; d'Enterria, D; Dabrowski, A; David, A; De Roeck, A; De Visscher, S; Di Guida, S; Dobson, M; Dupont-Sagorin, N; Elliott-Peisert, A; Eugster, J; Funk, W; Georgiou, G; Giffels, M; Gigi, D; Gill, K; Giordano, D; Girone, M; Giunta, M; Glege, F; Gomez-Reino Garrido, R; Gowdy, S; Guida, R; Hammer, J; Hansen, M; Harris, P; Hartl, C; Hinzmann, A; Innocente, V; Janot, P; Karavakis, E; Kousouris, K; Krajczar, K; Lecoq, P; Lee, Y-J; Lourenço, C; Magini, N; Malberti, M; Malgeri, L; Mannelli, M; Masetti, L; Meijers, F; Mersi, S; Meschi, E; Moser, R; Mulders, M; Musella, P; Nesvold, E; Orsini, L; Cortezon, E Palencia; Perez, E; Perrozzi, L; Petrilli, A; Pfeiffer, A; Pierini, M; Pimiä, M; Piparo, D; Plagge, M; Quertenmont, L; Racz, A; Reece, W; Rolandi, G; Rovere, M; Sakulin, H; Santanastasio, F; Schäfer, C; Schwick, C; Segoni, I; Sekmen, S; Siegrist, P; Silva, P; Simon, M; Sphicas, P; Spiga, D; Stoye, M; Tsirou, A; Veres, G I; Vlimant, J R; Wöhri, H K; Worm, S D; Zeuner, W D; Bertl, W; Deiters, K; Erdmann, W; Gabathuler, K; Horisberger, R; Ingram, Q; Kaestli, H C; König, S; Kotlinski, D; Langenegger, U; Renker, D; Rohe, T; Bachmair, F; Bäni, L; Bianchini, L; Bortignon, P; Buchmann, M A; Casal, B; Chanon, N; Deisher, A; Dissertori, G; Dittmar, M; Donegà, M; Dünser, M; Eller, P; Freudenreich, K; Grab, C; Hits, D; Lecomte, P; Lustermann, W; Mangano, B; Marini, A C; Del Arbol, P Martinez Ruiz; Meister, D; Mohr, N; Moortgat, F; Nägeli, C; Nef, P; Nessi-Tedaldi, F; Pandolfi, F; Pape, L; Pauss, F; Peruzzi, M; Ronga, F J; Rossini, M; Sala, L; Sanchez, A K; Starodumov, A; Stieger, B; Takahashi, M; Tauscher, L; Thea, A; Theofilatos, K; Treille, D; Urscheler, C; Wallny, R; Weber, H A; Amsler, C; Chiochia, V; Favaro, C; Ivova Rikova, M; Kilminster, B; Millan Mejias, B; Otiougova, P; Robmann, P; Snoek, H; Taroni, S; Tupputi, S; Verzetti, M; Cardaci, M; Chen, K H; Ferro, C; Kuo, C M; Li, S W; Lin, W; Lu, Y J; Volpe, R; Yu, S S; Bartalini, P; Chang, P; Chang, Y H; Chang, Y W; Chao, Y; Chen, K F; Dietz, C; Grundler, U; Hou, W-S; Hsiung, Y; Kao, K Y; Lei, Y J; Lu, R-S; Majumder, D; Petrakou, E; Shi, X; Shiu, J G; Tzeng, Y M; Wang, M; Asavapibhop, B; Suwonjandee, N; Adiguzel, A; Bakirci, M N; Cerci, S; Dozen, C; Dumanoglu, I; Eskut, E; Girgis, S; Gokbulut, G; Gurpinar, E; Hos, I; Kangal, E E; Kayis Topaksu, A; Onengut, G; Ozdemir, K; Ozturk, S; Polatoz, A; Sogut, K; Sunar Cerci, D; Tali, B; Topakli, H; Vergili, M; Akin, I V; Aliev, T; Bilin, B; Bilmis, S; Deniz, M; Gamsizkan, H; Guler, A M; Karapinar, G; Ocalan, K; Ozpineci, A; Serin, M; Sever, R; Surat, U E; Yalvac, M; Zeyrek, M; Gülmez, E; Isildak, B; Kaya, M; Kaya, O; Ozkorucuklu, S; Sonmez, N; Bahtiyar, H; Barlas, E; Cankocak, K; Günaydin, Y O; Vardarlı, F I; Yücel, M; Levchuk, L; Sorokin, P; Brooke, J J; Clement, E; Cussans, D; Flacher, H; Frazier, R; Goldstein, J; Grimes, M; Heath, G P; Heath, H F; Kreczko, L; Metson, S; Newbold, D M; Nirunpong, K; Poll, A; Senkin, S; Smith, V J; Williams, T; Belyaev, A; Brew, C; Brown, R M; Cockerill, D J A; Coughlan, J A; Harder, K; Harper, S; Olaiya, E; Petyt, D; Radburn-Smith, B C; Shepherd-Themistocleous, C H; Tomalin, I R; Womersley, W J; Bainbridge, R; Buchmuller, O; Burton, D; Colling, D; Cripps, N; Cutajar, M; Dauncey, P; Davies, G; Negra, M Della; Ferguson, W; Fulcher, J; Futyan, D; Gilbert, A; Bryer, A Guneratne; Hall, G; Hatherell, Z; Hays, J; Iles, G; Jarvis, M; Karapostoli, G; Kenzie, M; Lane, R; Lucas, R; Lyons, L; Magnan, A-M; Marrouche, J; Mathias, B; Nandi, R; Nash, J; Nikitenko, A; Pela, J; Pesaresi, M; Petridis, K; Pioppi, M; Raymond, D M; Rogerson, S; Rose, A; Seez, C; Sharp, P; Sparrow, A; Tapper, A; Vazquez Acosta, M; Virdee, T; Wakefield, S; Wardle, N; Whyntie, T; Chadwick, M; Cole, J E; Hobson, P R; Khan, A; Kyberd, P; Leggat, D; Leslie, D; Martin, W; Reid, I D; Symonds, P; Teodorescu, L; Turner, M; Dittmann, J; Hatakeyama, K; Kasmi, A; Liu, H; Scarborough, T; Charaf, O; Cooper, S I; Henderson, C; Rumerio, P; Avetisyan, A; Bose, T; Fantasia, C; Heister, A; Lawson, P; Lazic, D; Rohlf, J; Sperka, D; St John, J; Sulak, L; Alimena, J; Christopher, G; Cutts, D; Demiragli, Z; Ferapontov, A; Garabedian, A; Heintz, U; Jabeen, S; Kukartsev, G; Laird, E; Landsberg, G; Luk, M; Narain, M; Segala, M; Sinthuprasith, T; Speer, T; Breedon, R; Breto, G; De La Barca Sanchez, M Calderon; Chauhan, S; Chertok, M; Conway, J; Conway, R; Cox, P T; Erbacher, R; Gardner, M; Houtz, R; Ko, W; Kopecky, A; Lander, R; Miceli, T; Pellett, D; Ricci-Tam, F; Rutherford, B; Searle, M; Smith, J; Squires, M; Tripathi, M; Wilbur, S; Yohay, R; Andreev, V; Cline, D; Cousins, R; Erhan, S; Everaerts, P; Farrell, C; Felcini, M; Hauser, J; Ignatenko, M; Jarvis, C; Rakness, G; Schlein, P; Takasugi, E; Traczyk, P; Valuev, V; Babb, J; Clare, R; Ellison, J; Gary, J W; Hanson, G; Jandir, P; Liu, H; Long, O R; Luthra, A; Nguyen, H; Paramesvaran, S; Sturdy, J; Sumowidagdo, S; Wilken, R; Wimpenny, S; Andrews, W; Branson, J G; Cerati, G B; Cittolin, S; Evans, D; Holzner, A; Kelley, R; Lebourgeois, M; Letts, J; Macneill, I; Padhi, S; Palmer, C; Petrucciani, G; Pieri, M; Sani, M; Simon, S; Sudano, E; Tadel, M; Tu, Y; Vartak, A; Wasserbaech, S; Würthwein, F; Yagil, A; Yoo, J; Barge, D; Campagnari, C; D'Alfonso, M; Danielson, T; Flowers, K; Geffert, P; George, C; Golf, F; Incandela, J; Justus, C; Kalavase, P; Kovalskyi, D; Krutelyov, V; Lowette, S; Magaña Villalba, R; Mccoll, N; Pavlunin, V; Ribnik, J; Richman, J; Rossin, R; Stuart, D; To, W; West, C; Apresyan, A; Bornheim, A; Bunn, J; Chen, Y; Di Marco, E; Duarte, J; Kcira, D; Ma, Y; Mott, A; Newman, H B; Rogan, C; Spiropulu, M; Timciuc, V; Veverka, J; Wilkinson, R; Xie, S; Yang, Y; Zhu, R Y; Azzolini, V; Calamba, A; Carroll, R; Ferguson, T; Iiyama, Y; Jang, D W; Liu, Y F; Paulini, M; Russ, J; Vogel, H; Vorobiev, I; Cumalat, J P; Drell, B R; Ford, W T; Gaz, A; Lopez, E Luiggi; Nauenberg, U; Smith, J G; Stenson, K; Ulmer, K A; Wagner, S R; Alexander, J; Chatterjee, A; Eggert, N; Gibbons, L K; Hopkins, W; Khukhunaishvili, A; Kreis, B; Mirman, N; Kaufman, G Nicolas; Patterson, J R; Ryd, A; Salvati, E; Sun, W; Teo, W D; Thom, J; Thompson, J; Tucker, J; Weng, Y; Winstrom, L; Wittich, P; Winn, D; Abdullin, S; Albrow, M; Anderson, J; Apollinari, G; Bauerdick, L A T; Beretvas, A; Berryhill, J; Bhat, P C; Burkett, K; Butler, J N; Chetluru, V; Cheung, H W K; Chlebana, F; Cihangir, S; Elvira, V D; Fisk, I; Freeman, J; Gao, Y; Gottschalk, E; Gray, L; Green, D; Gutsche, O; Hare, D; Harris, R M; Hirschauer, J; Hooberman, B; Jindariani, S; Johnson, M; Joshi, U; Kaadze, K; Klima, B; Kunori, S; Kwan, S; Linacre, J; Lincoln, D; Lipton, R; Lykken, J; Maeshima, K; Marraffino, J M; Outschoorn, V I Martinez; Maruyama, S; Mason, D; McBride, P; Mishra, K; Mrenna, S; Musienko, Y; Newman-Holmes, C; O'Dell, V; Prokofyev, O; Ratnikova, N; Sexton-Kennedy, E; Sharma, S; Spalding, W J; Spiegel, L; Taylor, L; Tkaczyk, S; Tran, N V; Uplegger, L; Vaandering, E W; Vidal, R; Whitmore, J; Wu, W; Yang, F; Yun, J C; Acosta, D; Avery, P; Bourilkov, D; Chen, M; Cheng, T; Das, S; De Gruttola, M; Di Giovanni, G P; Dobur, D; Drozdetskiy, A; Field, R D; Fisher, M; Fu, Y; Furic, I K; Hugon, J; Kim, B; Konigsberg, J; Korytov, A; Kropivnitskaya, A; Kypreos, T; Low, J F; Matchev, K; Milenovic, P; Mitselmakher, G; Muniz, L; Remington, R; Rinkevicius, A; Skhirtladze, N; Snowball, M; Yelton, J; Zakaria, M; Gaultney, V; Hewamanage, S; Linn, S; Markowitz, P; Martinez, G; Rodriguez, J L; Adams, T; Askew, A; Bochenek, J; Chen, J; Diamond, B; Gleyzer, S V; Haas, J; Hagopian, S; Hagopian, V; Johnson, K F; Prosper, H; Veeraraghavan, V; Weinberg, M; Baarmand, M M; Dorney, B; Hohlmann, M; Kalakhety, H; Yumiceva, F; Adams, M R; Apanasevich, L; Bazterra, V E; Betts, R R; Bucinskaite, I; Callner, J; Cavanaugh, R; Evdokimov, O; Gauthier, L; Gerber, C E; Hofman, D J; Khalatyan, S; Kurt, P; Lacroix, F; Moon, D H; O'Brien, C; Silkworth, C; Strom, D; Turner, P; Varelas, N; Akgun, U; Albayrak, E A; Bilki, B; Clarida, W; Dilsiz, K; Duru, F; Griffiths, S; Merlo, J-P; Mermerkaya, H; Mestvirishvili, A; Moeller, A; Nachtman, J; Newsom, C R; Ogul, H; Onel, Y; Ozok, F; Sen, S; Tan, P; Tiras, E; Wetzel, J; Yetkin, T; Yi, K; Barnett, B A; Blumenfeld, B; Bolognesi, S; Giurgiu, G; Gritsan, A V; Hu, G; Maksimovic, P; Martin, C; Swartz, M; Whitbeck, A; Baringer, P; Bean, A; Benelli, G; Kenny, R P; Murray, M; Noonan, D; Sanders, S; Stringer, R; Wood, J S; Barfuss, A F; Chakaberia, I; Ivanov, A; Khalil, S; Makouski, M; Maravin, Y; Shrestha, S; Svintradze, I; Gronberg, J; Lange, D; Rebassoo, F; Wright, D; Baden, A; Calvert, B; Eno, S C; Gomez, J A; Hadley, N J; Kellogg, R G; Kolberg, T; Lu, Y; Marionneau, M; Mignerey, A C; Pedro, K; Peterman, A; Skuja, A; Temple, J; Tonjes, M B; Tonwar, S C; Apyan, A; Bauer, G; Busza, W; Cali, I A; Chan, M; Di Matteo, L; Dutta, V; Gomez Ceballos, G; Goncharov, M; Gulhan, D; Kim, Y; Klute, M; Lai, Y S; Levin, A; Luckey, P D; Ma, T; Nahn, S; Paus, C; Ralph, D; Roland, C; Roland, G; Stephans, G S F; Stöckli, F; Sumorok, K; Velicanu, D; Wolf, R; Wyslouch, B; Yang, M; Yilmaz, Y; Yoon, A S; Zanetti, M; Zhukova, V; Dahmes, B; De Benedetti, A; Franzoni, G; Gude, A; Haupt, J; Kao, S C; Klapoetke, K; Kubota, Y; Mans, J; Pastika, N; Rusack, R; Sasseville, M; Singovsky, A; Tambe, N; Turkewitz, J; Acosta, J G; Cremaldi, L M; Kroeger, R; Oliveros, S; Perera, L; Rahmat, R; Sanders, D A; Summers, D; Avdeeva, E; Bloom, K; Bose, S; Claes, D R; Dominguez, A; Eads, M; Suarez, R Gonzalez; Keller, J; Kravchenko, I; Lazo-Flores, J; Malik, S; Meier, F; Snow, G R; Dolen, J; Godshalk, A; Iashvili, I; Jain, S; Kharchilava, A; Kumar, A; Rappoccio, S; Wan, Z; Alverson, G; Barberis, E; Baumgartel, D; Chasco, M; Haley, J; Massironi, A; Nash, D; Orimoto, T; Trocino, D; Wood, D; Zhang, J; Anastassov, A; Hahn, K A; Kubik, A; Lusito, L; Mucia, N; Odell, N; Pollack, B; Pozdnyakov, A; Schmitt, M; Stoynev, S; Sung, K; Velasco, M; Won, S; Berry, D; Brinkerhoff, A; Chan, K M; Hildreth, M; Jessop, C; Karmgard, D J; Kolb, J; Lannon, K; Luo, W; Lynch, S; Marinelli, N; Morse, D M; Pearson, T; Planer, M; Ruchti, R; Slaunwhite, J; Valls, N; Wayne, M; Wolf, M; Antonelli, L; Bylsma, B; Durkin, L S; Hill, C; Hughes, R; Kotov, K; Ling, T Y; Puigh, D; Rodenburg, M; Smith, G; Vuosalo, C; Winer, B L; Wolfe, H; Berry, E; Elmer, P; Halyo, V; Hebda, P; Hegeman, J; Hunt, A; Jindal, P; Koay, S A; Lujan, P; Marlow, D; Medvedeva, T; Mooney, M; Olsen, J; Piroué, P; Quan, X; Raval, A; Saka, H; Stickland, D; Tully, C; Werner, J S; Zenz, S C; Zuranski, A; Brownson, E; Lopez, A; Mendez, H; Ramirez Vargas, J E; Alagoz, E; Benedetti, D; Bolla, G; Bortoletto, D; De Mattia, M; Everett, A; Hu, Z; Jones, M; Jung, K; Koybasi, O; Kress, M; Leonardo, N; Lopes Pegna, D; Maroussov, V; Merkel, P; Miller, D H; Neumeister, N; Shipsey, I; Silvers, D; Svyatkovskiy, A; Vidal Marono, M; Wang, F; Xie, W; Xu, L; Yoo, H D; Zablocki, J; Zheng, Y; Guragain, S; Parashar, N; Adair, A; Akgun, B; Ecklund, K M; Geurts, F J M; Padley, B P; Redjimi, R; Roberts, J; Zabel, J; Betchart, B; Bodek, A; Covarelli, R; de Barbaro, P; Demina, R; Eshaq, Y; Ferbel, T; Garcia-Bellido, A; Goldenzweig, P; Han, J; Harel, A; Miner, D C; Petrillo, G; Vishnevskiy, D; Zielinski, M; Bhatti, A; Ciesielski, R; Demortier, L; Goulianos, K; Lungu, G; Malik, S; Mesropian, C; Arora, S; Barker, A; Chou, J P; Contreras-Campana, C; Contreras-Campana, E; Duggan, D; Ferencek, D; Gershtein, Y; Gray, R; Halkiadakis, E; Hidas, D; Lath, A; Panwalkar, S; Park, M; Patel, R; Rekovic, V; Robles, J; Salur, S; Schnetzer, S; Seitz, C; Somalwar, S; Stone, R; Thomas, S; Thomassen, P; Walker, M; Cerizza, G; Hollingsworth, M; Rose, K; Spanier, S; Yang, Z C; York, A; Bouhali, O; Eusebi, R; Flanagan, W; Gilmore, J; Kamon, T; Khotilovich, V; Montalvo, R; Osipenkov, I; Pakhotin, Y; Perloff, A; Roe, J; Safonov, A; Sakuma, T; Suarez, I; Tatarinov, A; Toback, D; Akchurin, N; Cowden, C; Damgov, J; Dragoiu, C; Dudero, P R; Jeong, C; Kovitanggoon, K; Lee, S W; Libeiro, T; Volobouev, I; Appelt, E; Delannoy, A G; Greene, S; Gurrola, A; Johns, W; Maguire, C; Melo, A; Sharma, M; Sheldon, P; Snook, B; Tuo, S; Velkovska, J; Arenton, M W; Boutle, S; Cox, B; Francis, B; Goodell, J; Hirosky, R; Ledovskoy, A; Lin, C; Neu, C; Wood, J; Gollapinni, S; Harr, R; Karchin, P E; Don, C Kottachchi Kankanamge; Lamichhane, P; Sakharov, A; Belknap, D A; Borrello, L; Carlsmith, D; Cepeda, M; Dasu, S; Friis, E; Grothe, M; Hall-Wilton, R; Herndon, M; Hervé, A; Klabbers, P; Klukas, J; Lanaro, A; Loveless, R; Mohapatra, A; Mozer, M U; Ojalvo, I; Pierro, G A; Polese, G; Ross, I; Savin, A; Smith, W H; Swanson, J

    Spectra of identified charged hadrons are measured in pPb collisions with the CMS detector at the LHC at [Formula: see text]. Charged pions, kaons, and protons in the transverse-momentum range [Formula: see text]-1.7[Formula: see text] and laboratory rapidity [Formula: see text] are identified via their energy loss in the silicon tracker. The average [Formula: see text] increases with particle mass and the charged multiplicity of the event. The increase of the average [Formula: see text] with charged multiplicity is greater for heavier hadrons. Comparisons to Monte Carlo event generators reveal that Epos Lhc, which incorporates additional hydrodynamic evolution of the created system, is able to reproduce most of the data features, unlike Hijing and Ampt. The [Formula: see text] spectra and integrated yields are also compared to those measured in pp and PbPb collisions at various energies. The average transverse momentum and particle ratio measurements indicate that particle production at LHC energies is strongly correlated with event particle multiplicity.

  7. Production of [Formula: see text] and [Formula: see text] in proton-proton collisions at [Formula: see text] 7 TeV.

    Science.gov (United States)

    Abelev, B; Adam, J; Adamová, D; Aggarwal, M M; Rinella, G Aglieri; Agnello, M; Agostinelli, A; Agrawal, N; Ahammed, Z; Ahmad, N; Ahmed, I; Ahn, S U; Ahn, S A; Aimo, I; Aiola, S; Ajaz, M; Akindinov, A; Alam, S N; Aleksandrov, D; Alessandro, B; Alexandre, D; Alici, A; Alkin, A; Alme, J; Alt, T; Altinpinar, S; Altsybeev, I; Alves Garcia Prado, C; Andrei, C; Andronic, A; Anguelov, V; Anielski, J; Antičić, T; Antinori, F; Antonioli, P; Aphecetche, L; Appelshäuser, H; Arcelli, S; Armesto, N; Arnaldi, R; Aronsson, T; Arsene, I C; Arslandok, M; Augustinus, A; Averbeck, R; Awes, T C; Azmi, M D; Bach, M; Badalà, A; Baek, Y W; Bagnasco, S; Bailhache, R; Bala, R; Baldisseri, A; Baltasar Dos Santos Pedrosa, F; Baral, R C; Barbera, R; Barile, F; Barnaföldi, G G; Barnby, L S; Barret, V; Bartke, J; Basile, M; Bastid, N; Basu, S; Bathen, B; Batigne, G; Batista Camejo, A; Batyunya, B; Batzing, P C; Baumann, C; Bearden, I G; Beck, H; Bedda, C; Behera, N K; Belikov, I; Bellini, F; Bellwied, R; Belmont-Moreno, E; Belmont, R; Belyaev, V; Bencedi, G; Beole, S; Berceanu, I; Bercuci, A; Berdnikov, Y; Berenyi, D; Berger, M E; Bertens, R A; Berzano, D; Betev, L; Bhasin, A; Bhat, I R; Bhati, A K; Bhattacharjee, B; Bhom, J; Bianchi, L; Bianchi, N; Bianchin, C; Bielčík, J; Bielčíková, J; Bilandzic, A; Bjelogrlic, S; Blanco, F; Blau, D; Blume, C; Bock, F; Bogdanov, A; Bøggild, H; Bogolyubsky, M; Böhmer, F V; Boldizsár, L; Bombara, M; Book, J; Borel, H; Borissov, A; Bossú, F; Botje, M; Botta, E; Böttger, S; Braun-Munzinger, P; Bregant, M; Breitner, T; Broker, T A; Browning, T A; Broz, M; Bruna, E; Bruno, G E; Budnikov, D; Buesching, H; Bufalino, S; Buncic, P; Busch, O; Buthelezi, Z; Caffarri, D; Cai, X; Caines, H; Calero Diaz, L; Caliva, A; Calvo Villar, E; Camerini, P; Carena, F; Carena, W; Castillo Castellanos, J; Casula, E A R; Catanescu, V; Cavicchioli, C; Ceballos Sanchez, C; Cepila, J; Cerello, P; Chang, B; Chapeland, S; Charvet, J L; Chattopadhyay, S; Chattopadhyay, S; Chelnokov, V; Cherney, M; Cheshkov, C; Cheynis, B; Chibante Barroso, V; Chinellato, D D; Chochula, P; Chojnacki, M; Choudhury, S; Christakoglou, P; Christensen, C H; Christiansen, P; Chujo, T; Chung, S U; Cicalo, C; Cifarelli, L; Cindolo, F; Cleymans, J; Colamaria, F; Colella, D; Collu, A; Colocci, M; Conesa Balbastre, G; Conesa Del Valle, Z; Connors, M E; Contreras, J G; Cormier, T M; Corrales Morales, Y; Cortese, P; Cortés Maldonado, I; Cosentino, M R; Costa, F; Crochet, P; Cruz Albino, R; Cuautle, E; Cunqueiro, L; Dainese, A; Dang, R; Danu, A; Das, D; Das, I; Das, K; Das, S; Dash, A; Dash, S; De, S; Delagrange, H; Deloff, A; Dénes, E; D'Erasmo, G; De Caro, A; de Cataldo, G; de Cuveland, J; De Falco, A; De Gruttola, D; De Marco, N; De Pasquale, S; de Rooij, R; Diaz Corchero, M A; Dietel, T; Dillenseger, P; Divià, R; Di Bari, D; Di Liberto, S; Di Mauro, A; Di Nezza, P; Djuvsland, Ø; Dobrin, A; Dobrowolski, T; Domenicis Gimenez, D; Dönigus, B; Dordic, O; Dørheim, S; Dubey, A K; Dubla, A; Ducroux, L; Dupieux, P; Dutta Majumdar, A K; Hilden, T E; Ehlers, R J; Elia, D; Engel, H; Erazmus, B; Erdal, H A; Eschweiler, D; Espagnon, B; Esposito, M; Estienne, M; Esumi, S; Evans, D; Evdokimov, S; Fabris, D; Faivre, J; Falchieri, D; Fantoni, A; Fasel, M; Fehlker, D; Feldkamp, L; Felea, D; Feliciello, A; Feofilov, G; Ferencei, J; Fernández Téllez, A; Ferreiro, E G; Ferretti, A; Festanti, A; Figiel, J; Figueredo, M A S; Filchagin, S; Finogeev, D; Fionda, F M; Fiore, E M; Floratos, E; Floris, M; Foertsch, S; Foka, P; Fokin, S; Fragiacomo, E; Francescon, A; Frankenfeld, U; Fuchs, U; Furget, C; Furs, A; Fusco Girard, M; Gaardhøje, J J; Gagliardi, M; Gago, A M; Gallio, M; Gangadharan, D R; Ganoti, P; Gao, C; Garabatos, C; Garcia-Solis, E; Gargiulo, C; Garishvili, I; Gerhard, J; Germain, M; Gheata, A; Gheata, M; Ghidini, B; Ghosh, P; Ghosh, S K; Gianotti, P; Giubellino, P; Gladysz-Dziadus, E; Glässel, P; Gomez Ramirez, A; González-Zamora, P; Gorbunov, S; Görlich, L; Gotovac, S; Graczykowski, L K; Grelli, A; Grigoras, A; Grigoras, C; Grigoriev, V; Grigoryan, A; Grigoryan, S; Grinyov, B; Grion, N; Grosse-Oetringhaus, J F; Grossiord, J-Y; Grosso, R; Guber, F; Guernane, R; Guerzoni, B; Guilbaud, M; Gulbrandsen, K; Gulkanyan, H; Gumbo, M; Gunji, T; Gupta, A; Gupta, R; Khan, K H; Haake, R; Haaland, Ø; Hadjidakis, C; Haiduc, M; Hamagaki, H; Hamar, G; Hanratty, L D; Hansen, A; Harris, J W; Hartmann, H; Harton, A; Hatzifotiadou, D; Hayashi, S; Heckel, S T; Heide, M; Helstrup, H; Herghelegiu, A; Herrera Corral, G; Hess, B A; Hetland, K F; Hippolyte, B; Hladky, J; Hristov, P; Huang, M; Humanic, T J; Hussain, N; Hussain, T; Hutter, D; Hwang, D S; Ilkaev, R; Ilkiv, I; Inaba, M; Innocenti, G M; Ionita, C; Ippolitov, M; Irfan, M; Ivanov, M; Ivanov, V; Jachołkowski, A; Jacobs, P M; Jahnke, C; Jang, H J; Janik, M A; Jayarathna, P H S Y; Jena, C; Jena, S; Jimenez Bustamante, R T; Jones, P G; Jung, H; Jusko, A; Kadyshevskiy, V; Kalinak, P; Kalweit, A; Kamin, J; Kang, J H; Kaplin, V; Kar, S; Karasu Uysal, A; Karavichev, O; Karavicheva, T; Karpechev, E; Kebschull, U; Keidel, R; Keijdener, D L D; Svn, M Keil; Khan, M M; Khan, P; Khan, S A; Khanzadeev, A; Kharlov, Y; Kileng, B; Kim, B; Kim, D W; Kim, D J; Kim, J S; Kim, M; Kim, M; Kim, S; Kim, T; Kirsch, S; Kisel, I; Kiselev, S; Kisiel, A; Kiss, G; Klay, J L; Klein, J; Klein-Bösing, C; Kluge, A; Knichel, M L; Knospe, A G; Kobdaj, C; Kofarago, M; Köhler, M K; Kollegger, T; Kolojvari, A; Kondratiev, V; Kondratyeva, N; Konevskikh, A; Kovalenko, V; Kowalski, M; Kox, S; Koyithatta Meethaleveedu, G; Kral, J; Králik, I; Kravčáková, A; Krelina, M; Kretz, M; Krivda, M; Krizek, F; Kryshen, E; Krzewicki, M; Kučera, V; Kucheriaev, Y; Kugathasan, T; Kuhn, C; Kuijer, P G; Kulakov, I; Kumar, J; Kurashvili, P; Kurepin, A; Kurepin, A B; Kuryakin, A; Kushpil, S; Kweon, M J; Kwon, Y; Ladron de Guevara, P; Lagana Fernandes, C; Lakomov, I; Langoy, R; Lara, C; Lardeux, A; Lattuca, A; La Pointe, S L; La Rocca, P; Lea, R; Leardini, L; Lee, G R; Legrand, I; Lehnert, J; Lemmon, R C; Lenti, V; Leogrande, E; Leoncino, M; León Monzón, I; Lévai, P; Li, S; Lien, J; Lietava, R; Lindal, S; Lindenstruth, V; Lippmann, C; Lisa, M A; Ljunggren, H M; Lodato, D F; Loenne, P I; Loggins, V R; Loginov, V; Lohner, D; Loizides, C; Lopez, X; López Torres, E; Lu, X-G; Luettig, P; Lunardon, M; Luparello, G; Ma, R; Maevskaya, A; Mager, M; Mahapatra, D P; Mahmood, S M; Maire, A; Majka, R D; Malaev, M; Maldonado Cervantes, I; Malinina, L; Mal'Kevich, D; Malzacher, P; Mamonov, A; Manceau, L; Manko, V; Manso, F; Manzari, V; Marchisone, M; Mareš, J; Margagliotti, G V; Margotti, A; Marín, A; Markert, C; Marquard, M; Martashvili, I; Martin, N A; Martinengo, P; Martínez, M I; Martínez García, G; Martin Blanco, J; Martynov, Y; Mas, A; Masciocchi, S; Masera, M; Masoni, A; Massacrier, L; Mastroserio, A; Matyja, A; Mayer, C; Mazer, J; Mazzoni, M A; Meddi, F; Menchaca-Rocha, A; Meninno, E; Mercado Pérez, J; Meres, M; Miake, Y; Mikhaylov, K; Milano, L; Milosevic, J; Mischke, A; Mishra, A N; Miśkowiec, D; Mitra, J; Mitu, C M; Mlynarz, J; Mohammadi, N; Mohanty, B; Molnar, L; Montaño Zetina, L; Montes, E; Morando, M; Moreira De Godoy, D A; Moretto, S; Morreale, A; Morsch, A; Muccifora, V; Mudnic, E; Mühlheim, D; Muhuri, S; Mukherjee, M; Müller, H; Munhoz, M G; Murray, S; Musa, L; Musinsky, J; Nandi, B K; Nania, R; Nappi, E; Nattrass, C; Nayak, K; Nayak, T K; Nazarenko, S; Nedosekin, A; Nicassio, M; Niculescu, M; Niedziela, J; Nielsen, B S; Nikolaev, S; Nikulin, S; Nikulin, V; Nilsen, B S; Noferini, F; Nomokonov, P; Nooren, G; Norman, J; Nyanin, A; Nystrand, J; Oeschler, H; Oh, S; Oh, S K; Okatan, A; Okubo, T; Olah, L; Oleniacz, J; Oliveira Da Silva, A C; Onderwaater, J; Oppedisano, C; Ortiz Velasquez, A; Oskarsson, A; Otwinowski, J; Oyama, K; Ozdemir, M; Sahoo, P; Pachmayer, Y; Pachr, M; Pagano, P; Paić, G; Pajares, C; Pal, S K; Palmeri, A; Pant, D; Papikyan, V; Pappalardo, G S; Pareek, P; Park, W J; Parmar, S; Passfeld, A; Patalakha, D I; Paticchio, V; Paul, B; Pawlak, T; Peitzmann, T; Pereira Da Costa, H; Pereira De Oliveira Filho, E; Peresunko, D; Pérez Lara, C E; Pesci, A; Peskov, V; Pestov, Y; Petráček, V; Petran, M; Petris, M; Petrovici, M; Petta, C; Piano, S; Pikna, M; Pillot, P; Pinazza, O; Pinsky, L; Piyarathna, D B; Płoskoń, M; Planinic, M; Pluta, J; Pochybova, S; Podesta-Lerma, P L M; Poghosyan, M G; Pohjoisaho, E H O; Polichtchouk, B; Poljak, N; Pop, A; Porteboeuf-Houssais, S; Porter, J; Potukuchi, B; Prasad, S K; Preghenella, R; Prino, F; Pruneau, C A; Pshenichnov, I; Puccio, M; Puddu, G; Pujahari, P; Punin, V; Putschke, J; Qvigstad, H; Rachevski, A; Raha, S; Rajput, S; Rak, J; Rakotozafindrabe, A; Ramello, L; Raniwala, R; Raniwala, S; Räsänen, S S; Rascanu, B T; Rathee, D; Rauf, A W; Razazi, V; Read, K F; Real, J S; Redlich, K; Reed, R J; Rehman, A; Reichelt, P; Reicher, M; Reidt, F; Renfordt, R; Reolon, A R; Reshetin, A; Rettig, F; Revol, J-P; Reygers, K; Riabov, V; Ricci, R A; Richert, T; Richter, M; Riedler, P; Riegler, W; Riggi, F; Rivetti, A; Rocco, E; Rodríguez Cahuantzi, M; Rodriguez Manso, A; Røed, K; Rogochaya, E; Rohni, S; Rohr, D; Röhrich, D; Romita, R; Ronchetti, F; Ronflette, L; Rosnet, P; Rossi, A; Roukoutakis, F; Roy, A; Roy, C; Roy, P; Rubio Montero, A J; Rui, R; Russo, R; Ryabinkin, E; Ryabov, Y; Rybicki, A; Sadovsky, S; Šafařík, K; Sahlmuller, B; Sahoo, R; Sahu, P K; Saini, J; Sakai, S; Salgado, C A; Salzwedel, J; Sambyal, S; Samsonov, V; Sanchez Castro, X; Sánchez Rodríguez, F J; Šándor, L; Sandoval, A; Sano, M; Santagati, G; Sarkar, D; Scapparone, E; Scarlassara, F; Scharenberg, R P; Schiaua, C; Schicker, R; Schmidt, C; Schmidt, H R; Schuchmann, S; Schukraft, J; Schulc, M; Schuster, T; Schutz, Y; Schwarz, K; Schweda, K; Scioli, G; Scomparin, E; Scott, R; Segato, G; Seger, J E; Sekiguchi, Y; Selyuzhenkov, I; Senosi, K; Seo, J; Serradilla, E; Sevcenco, A; Shabetai, A; Shabratova, G; Shahoyan, R; Shangaraev, A; Sharma, A; Sharma, N; Sharma, S; Shigaki, K; Shtejer, K; Sibiriak, Y; Siddhanta, S; Siemiarczuk, T; Silvermyr, D; Silvestre, C; Simatovic, G; Singaraju, R; Singh, R; Singha, S; Singhal, V; Sinha, B C; Sinha, T; Sitar, B; Sitta, M; Skaali, T B; Skjerdal, K; Slupecki, M; Smirnov, N; Snellings, R J M; Søgaard, C; Soltz, R; Song, J; Song, M; Soramel, F; Sorensen, S; Spacek, M; Spiriti, E; Sputowska, I; Spyropoulou-Stassinaki, M; Srivastava, B K; Stachel, J; Stan, I; Stefanek, G; Steinpreis, M; Stenlund, E; Steyn, G; Stiller, J H; Stocco, D; Stolpovskiy, M; Strmen, P; Suaide, A A P; Sugitate, T; Suire, C; Suleymanov, M; Sultanov, R; Šumbera, M; Symons, T J M; Szabo, A; Szanto de Toledo, A; Szarka, I; Szczepankiewicz, A; Szymanski, M; Takahashi, J; Tangaro, M A; Tapia Takaki, J D; Tarantola Peloni, A; Tarazona Martinez, A; Tariq, M; Tarzila, M G; Tauro, A; Tejeda Muñoz, G; Telesca, A; Terasaki, K; Terrevoli, C; Thäder, J; Thomas, D; Tieulent, R; Timmins, A R; Toia, A; Trubnikov, V; Trzaska, W H; Tsuji, T; Tumkin, A; Turrisi, R; Tveter, T S; Ullaland, K; Uras, A; Usai, G L; Vajzer, M; Vala, M; Valencia Palomo, L; Vallero, S; Vande Vyvre, P; Van Der Maarel, J; Van Hoorne, J W; van Leeuwen, M; Vargas, A; Vargyas, M; Varma, R; Vasileiou, M; Vasiliev, A; Vechernin, V; Veldhoen, M; Velure, A; Venaruzzo, M; Vercellin, E; Vergara Limón, S; Vernet, R; Verweij, M; Vickovic, L; Viesti, G; Viinikainen, J; Vilakazi, Z; Villalobos Baillie, O; Vinogradov, A; Vinogradov, L; Vinogradov, Y; Virgili, T; Vislavicius, V; Viyogi, Y P; Vodopyanov, A; Völkl, M A; Voloshin, K; Voloshin, S A; Volpe, G; von Haller, B; Vorobyev, I; Vranic, D; Vrláková, J; Vulpescu, B; Vyushin, A; Wagner, B; Wagner, J; Wagner, V; Wang, M; Wang, Y; Watanabe, D; Weber, M; Weber, S G; Wessels, J P; Westerhoff, U; Wiechula, J; Wikne, J; Wilde, M; Wilk, G; Wilkinson, J; Williams, M C S; Windelband, B; Winn, M; Yaldo, C G; Yamaguchi, Y; Yang, H; Yang, P; Yang, S; Yano, S; Yasnopolskiy, S; Yi, J; Yin, Z; Yoo, I-K; Yushmanov, I; Zaccolo, V; Zach, C; Zaman, A; Zampolli, C; Zaporozhets, S; Zarochentsev, A; Závada, P; Zaviyalov, N; Zbroszczyk, H; Zgura, I S; Zhalov, M; Zhang, H; Zhang, X; Zhang, Y; Zhao, C; Zhigareva, N; Zhou, D; Zhou, F; Zhou, Y; Zhuo, Zhou; Zhu, H; Zhu, J; Zhu, X; Zichichi, A; Zimmermann, A; Zimmermann, M B; Zinovjev, G; Zoccarato, Y; Zyzak, M

    The production of the strange and double-strange baryon resonances ([Formula: see text], [Formula: see text]) has been measured at mid-rapidity ([Formula: see text][Formula: see text]) in proton-proton collisions at [Formula: see text] [Formula: see text] 7 TeV with the ALICE detector at the LHC. Transverse momentum spectra for inelastic collisions are compared to QCD-inspired models, which in general underpredict the data. A search for the [Formula: see text] pentaquark, decaying in the [Formula: see text] channel, has been carried out but no evidence is seen.

  8. Measurement of quarkonium production at forward rapidity in [Formula: see text] collisions at [Formula: see text]TeV.

    Science.gov (United States)

    Abelev, B; Adam, J; Adamová, D; Aggarwal, M M; Agnello, M; Agostinelli, A; Agrawal, N; Ahammed, Z; Ahmad, N; Ahmad Masoodi, A; Ahmed, I; Ahn, S U; Ahn, S A; Aimo, I; Aiola, S; Ajaz, M; Akindinov, A; Aleksandrov, D; Alessandro, B; Alexandre, D; Alici, A; Alkin, A; Alme, J; Alt, T; Altini, V; Altinpinar, S; Altsybeev, I; Alves Garcia Prado, C; Andrei, C; Andronic, A; Anguelov, V; Anielski, J; Antičić, T; Antinori, F; Antonioli, P; Aphecetche, L; Appelshäuser, H; Arbor, N; Arcelli, S; Armesto, N; Arnaldi, R; Aronsson, T; Arsene, I C; Arslandok, M; Augustinus, A; Averbeck, R; Awes, T C; Azmi, M D; Bach, M; Badalà, A; Baek, Y W; Bagnasco, S; Bailhache, R; Bala, R; Baldisseri, A; Baltasar Dos Santos Pedrosa, F; Baral, R C; Barbera, R; Barile, F; Barnaföldi, G G; Barnby, L S; Barret, V; Bartke, J; Basile, M; Bastid, N; Basu, S; Bathen, B; Batigne, G; Batyunya, B; Batzing, P C; Baumann, C; Bearden, I G; Beck, H; Bedda, C; Behera, N K; Belikov, I; Bellini, F; Bellwied, R; Belmont-Moreno, E; Bencedi, G; Beole, S; Berceanu, I; Bercuci, A; Berdnikov, Y; Berenyi, D; Bertens, R A; Berzano, D; Betev, L; Bhasin, A; Bhat, I R; Bhati, A K; Bhattacharjee, B; Bhom, J; Bianchi, L; Bianchi, N; Bianchin, C; Bielčík, J; Bielčíková, J; Bilandzic, A; Bjelogrlic, S; Blanco, F; Blau, D; Blume, C; Bock, F; Bogdanov, A; Bøggild, H; Bogolyubsky, M; Boldizsár, L; Bombara, M; Book, J; Borel, H; Borissov, A; Bossú, F; Botje, M; Botta, E; Böttger, S; Braun-Munzinger, P; Bregant, M; Breitner, T; Broker, T A; Browning, T A; Broz, M; Bruna, E; Bruno, G E; Budnikov, D; Buesching, H; Bufalino, S; Buncic, P; Busch, O; Buthelezi, Z; Caffarri, D; Cai, X; Caines, H; Caliva, A; Calvo Villar, E; Camerini, P; Carena, F; Carena, W; Castillo Castellanos, J; Casula, E A R; Catanescu, V; Cavicchioli, C; Ceballos Sanchez, C; Cepila, J; Cerello, P; Chang, B; Chapeland, S; Charvet, J L; Chattopadhyay, S; Chattopadhyay, S; Chelnokov, V; Cherney, M; Cheshkov, C; Cheynis, B; Chibante Barroso, V; Chinellato, D D; Chochula, P; Chojnacki, M; Choudhury, S; Christakoglou, P; Christensen, C H; Christiansen, P; Chujo, T; Chung, S U; Cicalo, C; Cifarelli, L; Cindolo, F; Cleymans, J; Colamaria, F; Colella, D; Collu, A; Colocci, M; Conesa Balbastre, G; Conesa Del Valle, Z; Connors, M E; Contreras, J G; Cormier, T M; Corrales Morales, Y; Cortese, P; Cortés Maldonado, I; Cosentino, M R; Costa, F; Crochet, P; Cruz Albino, R; Cuautle, E; Cunqueiro, L; Dainese, A; Dang, R; Danu, A; Das, D; Das, I; Das, K; Das, S; Dash, A; Dash, S; De, S; Delagrange, H; Deloff, A; Dénes, E; D'Erasmo, G; De Caro, A; de Cataldo, G; de Cuveland, J; De Falco, A; De Gruttola, D; De Marco, N; De Pasquale, S; de Rooij, R; Diaz Corchero, M A; Dietel, T; Divià, R; Di Bari, D; Di Liberto, S; Di Mauro, A; Di Nezza, P; Djuvsland, Ø; Dobrin, A; Dobrowolski, T; Domenicis Gimenez, D; Dönigus, B; Dordic, O; Dubey, A K; Dubla, A; Ducroux, L; Dupieux, P; Dutta Majumdar, A K; Ehlers, R J; Elia, D; Engel, H; Erazmus, B; Erdal, H A; Eschweiler, D; Espagnon, B; Esposito, M; Estienne, M; Esumi, S; Evans, D; Evdokimov, S; Fabris, D; Faivre, J; Falchieri, D; Fantoni, A; Fasel, M; Fehlker, D; Feldkamp, L; Felea, D; Feliciello, A; Feofilov, G; Ferencei, J; Fernández Téllez, A; Ferreiro, E G; Ferretti, A; Festanti, A; Figiel, J; Figueredo, M A S; Filchagin, S; Finogeev, D; Fionda, F M; Fiore, E M; Floratos, E; Floris, M; Foertsch, S; Foka, P; Fokin, S; Fragiacomo, E; Francescon, A; Frankenfeld, U; Fuchs, U; Furget, C; Fusco Girard, M; Gaardhøje, J J; Gagliardi, M; Gago, A M; Gallio, M; Gangadharan, D R; Ganoti, P; Garabatos, C; Garcia-Solis, E; Gargiulo, C; Garishvili, I; Gerhard, J; Germain, M; Gheata, A; Gheata, M; Ghidini, B; Ghosh, P; Ghosh, S K; Gianotti, P; Giubellino, P; Gladysz-Dziadus, E; Glässel, P; Gomez Ramirez, A; González-Zamora, P; Gorbunov, S; Görlich, L; Gotovac, S; Graczykowski, L K; Grelli, A; Grigoras, A; Grigoras, C; Grigoriev, V; Grigoryan, A; Grigoryan, S; Grinyov, B; Grion, N; Grosse-Oetringhaus, J F; Grossiord, J-Y; Grosso, R; Guber, F; Guernane, R; Guerzoni, B; Guilbaud, M; Gulbrandsen, K; Gulkanyan, H; Gunji, T; Gupta, A; Gupta, R; Khan, K H; Haake, R; Haaland, Ø; Hadjidakis, C; Haiduc, M; Hamagaki, H; Hamar, G; Hanratty, L D; Hansen, A; Harris, J W; Hartmann, H; Harton, A; Hatzifotiadou, D; Hayashi, S; Heckel, S T; Heide, M; Helstrup, H; Herghelegiu, A; Herrera Corral, G; Hess, B A; Hetland, K F; Hicks, B; Hippolyte, B; Hladky, J; Hristov, P; Huang, M; Humanic, T J; Hutter, D; Hwang, D S; Ilkaev, R; Ilkiv, I; Inaba, M; Innocenti, G M; Ionita, C; Ippolitov, M; Irfan, M; Ivanov, M; Ivanov, V; Ivanytskyi, O; Jachołkowski, A; Jacobs, P M; Jahnke, C; Jang, H J; Janik, M A; Jayarathna, P H S Y; Jena, S; Jimenez Bustamante, R T; Jones, P G; Jung, H; Jusko, A; Kadyshevskiy, V; Kalcher, S; Kalinak, P; Kalweit, A; Kamin, J; Kang, J H; Kaplin, V; Kar, S; Karasu Uysal, A; Karavichev, O; Karavicheva, T; Karpechev, E; Kebschull, U; Keidel, R; Khan, M M; Khan, P; Khan, S A; Khanzadeev, A; Kharlov, Y; Kileng, B; Kim, B; Kim, D W; Kim, D J; Kim, J S; Kim, M; Kim, M; Kim, S; Kim, T; Kirsch, S; Kisel, I; Kiselev, S; Kisiel, A; Kiss, G; Klay, J L; Klein, J; Klein-Bösing, C; Kluge, A; Knichel, M L; Knospe, A G; Kobdaj, C; Köhler, M K; Kollegger, T; Kolojvari, A; Kondratiev, V; Kondratyeva, N; Konevskikh, A; Kovalenko, V; Kowalski, M; Kox, S; Koyithatta Meethaleveedu, G; Kral, J; Králik, I; Kramer, F; Kravčáková, A; Krelina, M; Kretz, M; Krivda, M; Krizek, F; Krus, M; Kryshen, E; Krzewicki, M; Kučera, V; Kucheriaev, Y; Kugathasan, T; Kuhn, C; Kuijer, P G; Kulakov, I; Kumar, J; Kurashvili, P; Kurepin, A; Kurepin, A B; Kuryakin, A; Kushpil, S; Kweon, M J; Kwon, Y; Ladron de Guevara, P; Lagana Fernandes, C; Lakomov, I; Langoy, R; Lara, C; Lardeux, A; Lattuca, A; La Pointe, S L; La Rocca, P; Lea, R; Lee, G R; Legrand, I; Lehnert, J; Lemmon, R C; Lenti, V; Leogrande, E; Leoncino, M; León Monzón, I; Lévai, P; Li, S; Lien, J; Lietava, R; Lindal, S; Lindenstruth, V; Lippmann, C; Lisa, M A; Ljunggren, H M; Lodato, D F; Loenne, P I; Loggins, V R; Loginov, V; Lohner, D; Loizides, C; Lopez, X; López Torres, E; Lu, X-G; Luettig, P; Lunardon, M; Luo, J; Luparello, G; Luzzi, C; Ma, R; Maevskaya, A; Mager, M; Mahapatra, D P; Maire, A; Majka, R D; Malaev, M; Maldonado Cervantes, I; Malinina, L; Mal'Kevich, D; Malzacher, P; Mamonov, A; Manceau, L; Manko, V; Manso, F; Manzari, V; Marchisone, M; Mareš, J; Margagliotti, G V; Margotti, A; Marín, A; Markert, C; Marquard, M; Martashvili, I; Martin, N A; Martinengo, P; Martínez, M I; Martínez García, G; Martin Blanco, J; Martynov, Y; Mas, A; Masciocchi, S; Masera, M; Masoni, A; Massacrier, L; Mastroserio, A; Matyja, A; Mayer, C; Mazer, J; Mazzoni, M A; Meddi, F; Menchaca-Rocha, A; Mercado Pérez, J; Meres, M; Miake, Y; Mikhaylov, K; Milano, L; Milosevic, J; Mischke, A; Mishra, A N; Miśkowiec, D; Mitu, C M; Mlynarz, J; Mohanty, B; Molnar, L; Montaño Zetina, L; Montes, E; Morando, M; Moreira De Godoy, D A; Moretto, S; Morreale, A; Morsch, A; Muccifora, V; Mudnic, E; Muhuri, S; Mukherjee, M; Müller, H; Munhoz, M G; Murray, S; Musa, L; Musinsky, J; Nandi, B K; Nania, R; Nappi, E; Nattrass, C; Nayak, T K; Nazarenko, S; Nedosekin, A; Nicassio, M; Niculescu, M; Nielsen, B S; Nikolaev, S; Nikulin, S; Nikulin, V; Nilsen, B S; Noferini, F; Nomokonov, P; Nooren, G; Nyanin, A; Nystrand, J; Oeschler, H; Oh, S; Oh, S K; Okatan, A; Olah, L; Oleniacz, J; Oliveira Da Silva, A C; Onderwaater, J; Oppedisano, C; Ortiz Velasquez, A; Oskarsson, A; Otwinowski, J; Oyama, K; Sahoo, P; Pachmayer, Y; Pachr, M; Pagano, P; Paić, G; Painke, F; Pajares, C; Pal, S K; Palmeri, A; Pant, D; Papikyan, V; Pappalardo, G S; Pareek, P; Park, W J; Parmar, S; Passfeld, A; Patalakha, D I; Paticchio, V; Paul, B; Pawlak, T; Peitzmann, T; Pereira Da Costa, H; Pereira De Oliveira Filho, E; Peresunko, D; Pérez Lara, C E; Pesci, A; Peskov, V; Pestov, Y; Petráček, V; Petran, M; Petris, M; Petrovici, M; Petta, C; Piano, S; Pikna, M; Pillot, P; Pinazza, O; Pinsky, L; Piyarathna, D B; Płoskoń, M; Planinic, M; Pluta, J; Pochybova, S; Podesta-Lerma, P L M; Poghosyan, M G; Pohjoisaho, E H O; Polichtchouk, B; Poljak, N; Pop, A; Porteboeuf-Houssais, S; Porter, J; Pospisil, V; Potukuchi, B; Prasad, S K; Preghenella, R; Prino, F; Pruneau, C A; Pshenichnov, I; Puddu, G; Pujahari, P; Punin, V; Putschke, J; Qvigstad, H; Rachevski, A; Raha, S; Rak, J; Rakotozafindrabe, A; Ramello, L; Raniwala, R; Raniwala, S; Räsänen, S S; Rascanu, B T; Rathee, D; Rauf, A W; Razazi, V; Read, K F; Real, J S; Redlich, K; Reed, R J; Rehman, A; Reichelt, P; Reicher, M; Reidt, F; Renfordt, R; Reolon, A R; Reshetin, A; Rettig, F; Revol, J-P; Reygers, K; Ricci, R A; Richert, T; Richter, M; Riedler, P; Riegler, W; Riggi, F; Rivetti, A; Rocco, E; Rodríguez Cahuantzi, M; Rodriguez Manso, A; Røed, K; Rogochaya, E; Rohni, S; Rohr, D; Röhrich, D; Romita, R; Ronchetti, F; Rosnet, P; Rossegger, S; Rossi, A; Roukoutakis, F; Roy, A; Roy, C; Roy, P; Rubio Montero, A J; Rui, R; Russo, R; Ryabinkin, E; Rybicki, A; Sadovsky, S; Šafařík, K; Sahlmuller, B; Sahoo, R; Sahu, P K; Saini, J; Salgado, C A; Salzwedel, J; Sambyal, S; Samsonov, V; Sanchez Castro, X; Sánchez Rodríguez, F J; Šándor, L; Sandoval, A; Sano, M; Santagati, G; Sarkar, D; Scapparone, E; Scarlassara, F; Scharenberg, R P; Schiaua, C; Schicker, R; Schmidt, C; Schmidt, H R; Schuchmann, S; Schukraft, J; Schulc, M; Schuster, T; Schutz, Y; Schwarz, K; Schweda, K; Scioli, G; Scomparin, E; Scott, R; Segato, G; Seger, J E; Sekiguchi, Y; Selyuzhenkov, I; Seo, J; Serradilla, E; Sevcenco, A; Shabetai, A; Shabratova, G; Shahoyan, R; Shangaraev, A; Sharma, N; Sharma, S; Shigaki, K; Shtejer, K; Sibiriak, Y; Siddhanta, S; Siemiarczuk, T; Silvermyr, D; Silvestre, C; Simatovic, G; Singaraju, R; Singh, R; Singha, S; Singhal, V; Sinha, B C; Sinha, T; Sitar, B; Sitta, M; Skaali, T B; Skjerdal, K; Smakal, R; Smirnov, N; Snellings, R J M; Søgaard, C; Soltz, R; Song, J; Song, M; Soramel, F; Sorensen, S; Spacek, M; Sputowska, I; Spyropoulou-Stassinaki, M; Srivastava, B K; Stachel, J; Stan, I; Stefanek, G; Steinpreis, M; Stenlund, E; Steyn, G; Stiller, J H; Stocco, D; Stolpovskiy, M; Strmen, P; Suaide, A A P; Sugitate, T; Suire, C; Suleymanov, M; Sultanov, R; Šumbera, M; Susa, T; Symons, T J M; Szanto de Toledo, A; Szarka, I; Szczepankiewicz, A; Szymanski, M; Takahashi, J; Tangaro, M A; Tapia Takaki, J D; Tarantola Peloni, A; Tarazona Martinez, A; Tauro, A; Tejeda Muñoz, G; Telesca, A; Terrevoli, C; Thäder, J; Thomas, D; Tieulent, R; Timmins, A R; Toia, A; Torii, H; Trubnikov, V; Trzaska, W H; Tsuji, T; Tumkin, A; Turrisi, R; Tveter, T S; Ulery, J; Ullaland, K; Uras, A; Usai, G L; Vajzer, M; Vala, M; Valencia Palomo, L; Vallero, S; Vande Vyvre, P; Vannucci, L; Van Hoorne, J W; van Leeuwen, M; Vargas, A; Varma, R; Vasileiou, M; Vasiliev, A; Vechernin, V; Veldhoen, M; Velure, A; Venaruzzo, M; Vercellin, E; Vergara Limón, S; Vernet, R; Verweij, M; Vickovic, L; Viesti, G; Viinikainen, J; Vilakazi, Z; Villalobos Baillie, O; Vinogradov, A; Vinogradov, L; Vinogradov, Y; Virgili, T; Viyogi, Y P; Vodopyanov, A; Völkl, M A; Voloshin, K; Voloshin, S A; Volpe, G; von Haller, B; Vorobyev, I; Vranic, D; Vrláková, J; Vulpescu, B; Vyushin, A; Wagner, B; Wagner, J; Wagner, V; Wang, M; Wang, Y; Watanabe, D; Weber, M; Wessels, J P; Westerhoff, U; Wiechula, J; Wikne, J; Wilde, M; Wilk, G; Wilkinson, J; Williams, M C S; Windelband, B; Winn, M; Xiang, C; Yaldo, C G; Yamaguchi, Y; Yang, H; Yang, P; Yang, S; Yano, S; Yasnopolskiy, S; Yi, J; Yin, Z; Yoo, I-K; Yushmanov, I; Zaccolo, V; Zach, C; Zaman, A; Zampolli, C; Zaporozhets, S; Zarochentsev, A; Závada, P; Zaviyalov, N; Zbroszczyk, H; Zgura, I S; Zhalov, M; Zhang, H; Zhang, X; Zhang, Y; Zhao, C; Zhigareva, N; Zhou, D; Zhou, F; Zhou, Y; Zhu, H; Zhu, J; Zhu, X; Zichichi, A; Zimmermann, A; Zimmermann, M B; Zinovjev, G; Zoccarato, Y; Zynovyev, M; Zyzak, M

    The inclusive production cross sections at forward rapidity of [Formula: see text], [Formula: see text], [Formula: see text](1S) and [Formula: see text](2S) are measured in [Formula: see text] collisions at [Formula: see text] with the ALICE detector at the LHC. The analysis is based on a data sample corresponding to an integrated luminosity of 1.35 pb[Formula: see text]. Quarkonia are reconstructed in the dimuon-decay channel and the signal yields are evaluated by fitting the [Formula: see text] invariant mass distributions. The differential production cross sections are measured as a function of the transverse momentum [Formula: see text] and rapidity [Formula: see text], over the ranges [Formula: see text] GeV/c for [Formula: see text], [Formula: see text] GeV/c for all other resonances and for [Formula: see text]. The measured cross sections integrated over [Formula: see text] and [Formula: see text], and assuming unpolarized quarkonia, are: [Formula: see text] [Formula: see text]b, [Formula: see text] [Formula: see text]b, [Formula: see text] nb and [Formula: see text] nb, where the first uncertainty is statistical and the second one is systematic. The results are compared to measurements performed by other LHC experiments and to theoretical models.

  9. Recursive solution for dynamic response of one-dimensional structures with time-dependent boundary conditions

    International Nuclear Information System (INIS)

    Abadi, Mohammad Tahaye

    2015-01-01

    A recursive solution method is derived for the transient response of one-dimensional structures subjected to the general form of time dependent boundary conditions. Unlike previous solution methods that assumed the separation of variables, the present method involves formulating and solving the dynamic problems using the summation of two single-argument functions satisfying the motion equation. Based on boundary and initial conditions, a recursive procedure is derived to determine the single-argument functions. Such a procedure is applied to the general form of boundary conditions, and an analytical solution is derived by solving the recursive equation. The present solution method is implemented for base excitation problems, and the results are compared with those of the previous analytical solution and the Finite element (FE) analysis. The FE results converge to the present analytical solution, although considerable error is found in predicting a solution method on the basis of the separation of variables. The present analytical solution predicts the transient response for wave propagation problems in broadband excitation frequencies.

  10. Recursive solution for dynamic response of one-dimensional structures with time-dependent boundary conditions

    Energy Technology Data Exchange (ETDEWEB)

    Abadi, Mohammad Tahaye [Aerospace Research Institute, Tehran (Iran, Islamic Republic of)

    2015-10-15

    A recursive solution method is derived for the transient response of one-dimensional structures subjected to the general form of time dependent boundary conditions. Unlike previous solution methods that assumed the separation of variables, the present method involves formulating and solving the dynamic problems using the summation of two single-argument functions satisfying the motion equation. Based on boundary and initial conditions, a recursive procedure is derived to determine the single-argument functions. Such a procedure is applied to the general form of boundary conditions, and an analytical solution is derived by solving the recursive equation. The present solution method is implemented for base excitation problems, and the results are compared with those of the previous analytical solution and the Finite element (FE) analysis. The FE results converge to the present analytical solution, although considerable error is found in predicting a solution method on the basis of the separation of variables. The present analytical solution predicts the transient response for wave propagation problems in broadband excitation frequencies.

  11. Recursive engagement: the public as data analysts and outreach creators

    CERN Document Server

    Kalderon, Charles William; The ATLAS collaboration

    2018-01-01

    Two recent outreach projects are making use of public communities to enhance and build upon the first phases setup by physicists. “HiggsHunters” asked the public to search for displaced vertices in event displays, during which time a pool of trusted members arose in the associated discussion. The data this generated is now being analysed by schoolchildren, through which they can both learn the principles of scientific research and contribute directly to it. Also involving schoolchildren is “ATLAScraft”, a recreation of ATLAS and the wider CERN complex in minecraft. Here, the basic layout was provided, but students subsequently researched and created their own mini-games to explain various aspects of the LHC and detector physics to others. [NB: 15 minutes talk plus 2 minutes of questions

  12. Effect of individual components of soy formula and cows milk formula on zinc bioavailability

    International Nuclear Information System (INIS)

    Loennerdal, B.; Cederblad, A.; Davidsson, L.; Sandstroem, B.

    1984-01-01

    Zinc absorption from human milk, cows milk formulas, and soy formulas was studied in human adults by a radioisotope technique using 65 Zn and whole body counting. Individual dietary components were investigated for effects on zinc absorption. Phytate was found to have a strong inhibitory effect on zinc absorption; addition of phytate to cows milk formula (yielding a phytate concentration similar to that of soy formula) resulted in a decrease in zinc absorption from 31 to 16% similar to the absorption for soy formula (14%). Carbohydrate source, calcium, and zinc levels of the diet did not affect zinc absorption significantly. Iron supplementation of cows milk formula decreased zinc absorption from 24 to 18% although this decrease was not found to be significant (p less than 0.1). Absorption of zinc from a whey-adjusted cows milk formula was higher (31%) than from a nonmodified cows milk formula (22%). Increasing the zinc supplementation level in cows milk formula but not in soy formula increased zinc absorption to approximate that from breast milk. It is suggested that reduction of phytate content of soy formula may be a more effective avenue of modification than increased level of zinc supplementation

  13. Understanding women's interpretations of infant formula advertising.

    Science.gov (United States)

    Parry, Kathleen; Taylor, Emily; Hall-Dardess, Pam; Walker, Marsha; Labbok, Miriam

    2013-06-01

    Exclusive breastfeeding for 6 months and continued breastfeeding for at least 1 year is recommended by all major health organizations. Whereas 74.6 percent of mothers initiate breastfeeding at birth, exclusivity and duration remain significantly lower than national goals. Empirical evidence suggests that exposure to infant formula marketing contributes to supplementation and premature cessation. The objective of this study was to explore how women interpret infant formula advertising to aid in an understanding of this association. Four focus groups were structured to include women with similar childbearing experience divided according to reproductive status: preconceptional, pregnant, exclusive breastfeeders, and formula feeders. Facilitators used a prepared protocol to guide discussion of infant formula advertisements. Authors conducted a thematic content analysis with special attention to women's statements about what they believed the advertisements said about how the products related to human milk (superior, inferior, similar) and how they reported reacting to these interpretations. Participants reported that the advertisements conveyed an expectation of failure with breastfeeding, and that formula is a solution to fussiness, spitting up, and other normal infant behaviors. Participants reported that the advertisements were confusing in terms of how formula-feeding is superior, inferior or the same as breastfeeding. This confusion was exacerbated by an awareness of distribution by health care practitioners and institutions, suggesting provider endorsement of infant formula. Formula marketing appears to decrease mothers' confidence in their ability to breastfeed, especially when provided by health care practitioners and institutions. Therefore, to be supportive of breastfeeding, perinatal educators and practitioners could be more effective if they did not offer infant formula advertising to mothers. © 2013, Copyright the Authors, Journal compilation © 2013

  14. Generalization of the Fermi-Segre formula

    International Nuclear Information System (INIS)

    Froeman, N.; Froeman, P.O.

    1981-01-01

    A generalization of the non-relativistic Fermi-Segre formula into a formula which is valid also for angular momentum quantum numbers l different from zero, is derived by means of a phase-integral method. The formula thus obtained, which gives an expression for the limit of u(r)/rsup(l+1) as r→0, where u(r) is a normalized bound-state radial wavefunction, in terms of the derivative of the energy level Esub(n'), with respect to the radial quantum number n', is an improvement and generalization of a formula which has been obtained by M.A. Bouchiat and C. Bouchiat. It reduces to their formula for a particular class of potentials and highly excited states with not too large values of l, and it reduces to the Fermi-Segre formula when l=0. The accuracy of our formula, as well as that of the Bouchiat-Bouchiat formula, is investigated by application to an exactly soluble model. The formula obtained can also be written in another form by replacing dEsub(n')/dn' by an expression involving a closed-loop integral in the complex r-plane (around the generalized classical turning points), the integrand being a phase-integral quantity expressed in terms of the potential in which the particle moves. It is also shown that the exact value of the limit of u(r)/rsup(l+1) as r→0 can be expressed as an expectation value of a certain function depending on the physical potential V(r) and r a swell as on l and Esub(n')

  15. 27 CFR 17.133 - Food product formulas.

    Science.gov (United States)

    2010-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Food product formulas. 17.133 Section 17.133 Alcohol, Tobacco Products and Firearms ALCOHOL AND TOBACCO TAX AND TRADE BUREAU... PRODUCTS Formulas and Samples Approval of Formulas § 17.133 Food product formulas. Formulas for nonbeverage...

  16. The Processing on Different Types of English Formulaic Sequences

    Science.gov (United States)

    Qian, Li

    2015-01-01

    Formulaic sequences are found to be processed faster than their matched novel phrases in previous studies. Given the variety of formulaic types, few studies have compared processing on different types of formulaic sequences. The present study explored the processing among idioms, speech formulae and written formulae. It has been found that in…

  17. Determination of Formula for Vickers Hardness Measurements Uncertainty

    International Nuclear Information System (INIS)

    Purba, Asli

    2007-01-01

    The purpose of formula determination is to obtain the formula of Vickers hardness measurements uncertainty. The approach to determine the formula: influenced parameters identification, creating a cause and effect diagram, determination of sensitivity, determination of standard uncertainty and determination of formula for Vickers hardness measurements uncertainty. The results is a formula for determination of Vickers hardness measurements uncertainty. (author)

  18. Supertrace formulae for nonlinearly realized supersymmetry

    Science.gov (United States)

    Murli, Divyanshu; Yamada, Yusuke

    2018-04-01

    We derive the general supertrace formula for a system with N chiral superfields and one nilpotent chiral superfield in global and local supersymmetry. The nilpotent multiplet is realized by taking the scalar-decoupling limit of a chiral superfield breaking supersymmetry spontaneously. As we show, however, the modified formula is not simply related to the scalar-decoupling limit of the supertrace in linearly-realized supersymmetry. We also show that the supertrace formula reduces to that of a linearly realized supersymmetric theory with a decoupled sGoldstino if the Goldstino is the fermion in the nilpotent multiplet.

  19. Radiosurgery and the double logistic product formula

    International Nuclear Information System (INIS)

    Flickinger, J.C.; Steiner, L.

    1990-01-01

    The double logistic product formula is proposed as a method for predicting the probability of developing brain necrosis after high dose irradiation of small target volumes as used in stereotactic radiosurgery. Dose-response data observed for the production of localized radiation necreosis for treating intractable pain with the original Leksell gamma unit were used to choose the best fitting parameters for the double logistic product formula. This model can be used with either exponential or linear quadratic formulas to account for the effects of dose, fractionation and time in addition to volume. Dose-response predictions for stereotactic radiosurgery with different sized collimators are presented. (author). 41 refs.; 5 figs.; 1 tab

  20. Fermionic formula for double Kostka polynomials

    OpenAIRE

    Liu, Shiyuan

    2016-01-01

    The $X=M$ conjecture asserts that the $1D$ sum and the fermionic formula coincide up to some constant power. In the case of type $A,$ both the $1D$ sum and the fermionic formula are closely related to Kostka polynomials. Double Kostka polynomials $K_{\\Bla,\\Bmu}(t),$ indexed by two double partitions $\\Bla,\\Bmu,$ are polynomials in $t$ introduced as a generalization of Kostka polynomials. In the present paper, we consider $K_{\\Bla,\\Bmu}(t)$ in the special case where $\\Bmu=(-,\\mu'').$ We formula...

  1. Recursive evaluation of space-time lattice Green's functions

    International Nuclear Information System (INIS)

    De Hon, Bastiaan P; Arnold, John M

    2012-01-01

    Up to a multiplicative constant, the lattice Green's function (LGF) as defined in condensed matter physics and lattice statistical mechanics is equivalent to the Z-domain counterpart of the finite-difference time-domain Green's function (GF) on a lattice. Expansion of a well-known integral representation for the LGF on a ν-dimensional hyper-cubic lattice in powers of Z −1 and application of the Chu–Vandermonde identity results in ν − 1 nested finite-sum representations for discrete space-time GFs. Due to severe numerical cancellations, these nested finite sums are of little practical use. For ν = 2, the finite sum may be evaluated in closed form in terms of a generalized hypergeometric function. For special lattice points, that representation simplifies considerably, while on the other hand the finite-difference stencil may be used to derive single-lattice-point second-order recurrence schemes for generating 2D discrete space-time GF time sequences on the fly. For arbitrary symbolic lattice points, Zeilberger's algorithm produces a third-order recurrence operator with polynomial coefficients of the sixth degree. The corresponding recurrence scheme constitutes the most efficient numerical method for the majority of lattice points, in spite of the fact that for explicit numeric lattice points the associated third-order recurrence operator is not the minimum recurrence operator. As regards the asymptotic bounds for the possible solutions to the recurrence scheme, Perron's theorem precludes factorial or exponential growth. Along horizontal lattices directions, rapid initial growth does occur, but poses no problems in augmented dynamic-range fixed precision arithmetic. By analysing long-distance wave propagation along a horizontal lattice direction, we have concluded that the chirp-up oscillations of the discrete space-time GF are the root cause of grid dispersion anisotropy. With each factor of ten increase in the lattice distance, one would have to roughly

  2. Sequence spaces [Formula: see text] and [Formula: see text] with application in clustering.

    Science.gov (United States)

    Khan, Mohd Shoaib; Alamri, Badriah As; Mursaleen, M; Lohani, Qm Danish

    2017-01-01

    Distance measures play a central role in evolving the clustering technique. Due to the rich mathematical background and natural implementation of [Formula: see text] distance measures, researchers were motivated to use them in almost every clustering process. Beside [Formula: see text] distance measures, there exist several distance measures. Sargent introduced a special type of distance measures [Formula: see text] and [Formula: see text] which is closely related to [Formula: see text]. In this paper, we generalized the Sargent sequence spaces through introduction of [Formula: see text] and [Formula: see text] sequence spaces. Moreover, it is shown that both spaces are BK -spaces, and one is a dual of another. Further, we have clustered the two-moon dataset by using an induced [Formula: see text]-distance measure (induced by the Sargent sequence space [Formula: see text]) in the k-means clustering algorithm. The clustering result established the efficacy of replacing the Euclidean distance measure by the [Formula: see text]-distance measure in the k-means algorithm.

  3. A New Euler's Formula for DNA Polyhedra

    Science.gov (United States)

    Hu, Guang; Qiu, Wen-Yuan; Ceulemans, Arnout

    2011-01-01

    DNA polyhedra are cage-like architectures based on interlocked and interlinked DNA strands. We propose a formula which unites the basic features of these entangled structures. It is based on the transformation of the DNA polyhedral links into Seifert surfaces, which removes all knots. The numbers of components , of crossings , and of Seifert circles are related by a simple and elegant formula: . This formula connects the topological aspects of the DNA cage to the Euler characteristic of the underlying polyhedron. It implies that Seifert circles can be used as effective topological indices to describe polyhedral links. Our study demonstrates that, the new Euler's formula provides a theoretical framework for the stereo-chemistry of DNA polyhedra, which can characterize enzymatic transformations of DNA and be used to characterize and design novel cages with higher genus. PMID:22022596

  4. Newton Binomial Formulas in Schubert Calculus

    OpenAIRE

    Cordovez, Jorge; Gatto, Letterio; Santiago, Taise

    2008-01-01

    We prove Newton's binomial formulas for Schubert Calculus to determine numbers of base point free linear series on the projective line with prescribed ramification divisor supported at given distinct points.

  5. The local index formula in noncommutative geometry

    International Nuclear Information System (INIS)

    Higson, N.

    2003-01-01

    These notes present a partial account of the local index theorem in non-commutative geometry discovered by Alain Connes and Henri Moscovici. It includes Elliptic partial differential operators, cyclic homology theory, Chern characters, homotopy invariants and the index formulas

  6. How to Save Money on Infant Formula

    Science.gov (United States)

    ... for newsletters, special programs, and deals on formula company websites. They often send out coupons and free ... M. is also a founding member of Hi-Ethics and subscribes to the principles of the Health ...

  7. "Formula Student" / Malle Jürves

    Index Scriptorium Estoniae

    Jürves, Malle, 1950-

    2008-01-01

    Tehnikakõrgkooli ja tehnikaülikooli tudengite 17-liikmeline võiskond osales tänavu suvel Inglismaal Silverstone'i ringrajakompleksis peetaval tootearendusvõistlusel "Formula Student" omaehitatud vormelautoga

  8. Use of a Recursive-Rule eXtraction algorithm with J48graft to achieve highly accurate and concise rule extraction from a large breast cancer dataset

    Directory of Open Access Journals (Sweden)

    Yoichi Hayashi

    Full Text Available To assist physicians in the diagnosis of breast cancer and thereby improve survival, a highly accurate computer-aided diagnostic system is necessary. Although various machine learning and data mining approaches have been devised to increase diagnostic accuracy, most current methods are inadequate. The recently developed Recursive-Rule eXtraction (Re-RX algorithm provides a hierarchical, recursive consideration of discrete variables prior to analysis of continuous data, and can generate classification rules that have been trained on the basis of both discrete and continuous attributes. The objective of this study was to extract highly accurate, concise, and interpretable classification rules for diagnosis using the Re-RX algorithm with J48graft, a class for generating a grafted C4.5 decision tree. We used the Wisconsin Breast Cancer Dataset (WBCD. Nine research groups provided 10 kinds of highly accurate concrete classification rules for the WBCD. We compared the accuracy and characteristics of the rule set for the WBCD generated using the Re-RX algorithm with J48graft with five rule sets obtained using 10-fold cross validation (CV. We trained the WBCD using the Re-RX algorithm with J48graft and the average classification accuracies of 10 runs of 10-fold CV for the training and test datasets, the number of extracted rules, and the average number of antecedents for the WBCD. Compared with other rule extraction algorithms, the Re-RX algorithm with J48graft resulted in a lower average number of rules for diagnosing breast cancer, which is a substantial advantage. It also provided the lowest average number of antecedents per rule. These features are expected to greatly aid physicians in making accurate and concise diagnoses for patients with breast cancer. Keywords: Breast cancer diagnosis, Rule extraction, Re-RX algorithm, J48graft, C4.5

  9. Parametric Improper Integrals, Wallis Formula and Catalan Numbers

    Science.gov (United States)

    Dana-Picard, Thierry; Zeitoun, David G.

    2012-01-01

    We present a sequence of improper integrals, for which a closed formula can be computed using Wallis formula and a non-straightforward recurrence formula. This yields a new integral presentation for Catalan numbers.

  10. A general formula for the WACC

    OpenAIRE

    Farber, André; Gillet, Roland; Szafarz, Ariane

    2005-01-01

    Recent controversies testify that the tax shield valuation remains a hot topic in the financial literature. Basically, two methods have been proposed to incorporate the tax benefit of debt in the present value computation: The adjusted present value(APV), and the classical weighted average cost of capital (WACC). This note clarifies the relationship between these two apparently different approaches by offering a general formula for the WACC. This formula encompasses earlier results obtained b...

  11. The DOZZ formula from the path integral

    Science.gov (United States)

    Kupiainen, Antti; Rhodes, Rémi; Vargas, Vincent

    2018-05-01

    We present a rigorous proof of the Dorn, Otto, Zamolodchikov, Zamolodchikov formula (the DOZZ formula) for the 3 point structure constants of Liouville Conformal Field Theory (LCFT) starting from a rigorous probabilistic construction of the functional integral defining LCFT given earlier by the authors and David. A crucial ingredient in our argument is a probabilistic derivation of the reflection relation in LCFT based on a refined tail analysis of Gaussian multiplicative chaos measures.

  12. A Formula for the Units to Satisfy an Operation's Desired Rate of Return in CVP Analysis--A Conceptual Approach

    Science.gov (United States)

    Anderson, Johann A.; Leese, Wallace R.

    2016-01-01

    A common formula presented in many managerial- and cost-accounting textbooks makes possible the determination of the quantity of units which must be produced and sold to generate a desired dollar-amount of operating income. This article addresses the question "What formula can be used to determine the quantity of units needed to yield a…

  13. Connected formulas for amplitudes in standard model

    Energy Technology Data Exchange (ETDEWEB)

    He, Song [CAS Key Laboratory of Theoretical Physics,Institute of Theoretical Physics, Chinese Academy of Sciences,Beijing 100190 (China); School of Physical Sciences, University of Chinese Academy of Sciences,No. 19A Yuquan Road, Beijing 100049 (China); Zhang, Yong [Department of Physics, Beijing Normal University,Beijing 100875 (China); CAS Key Laboratory of Theoretical Physics,Institute of Theoretical Physics, Chinese Academy of Sciences,Beijing 100190 (China)

    2017-03-17

    Witten’s twistor string theory has led to new representations of S-matrix in massless QFT as a single object, including Cachazo-He-Yuan formulas in general and connected formulas in four dimensions. As a first step towards more realistic processes of the standard model, we extend the construction to QCD tree amplitudes with massless quarks and those with a Higgs boson. For both cases, we find connected formulas in four dimensions for all multiplicities which are very similar to the one for Yang-Mills amplitudes. The formula for quark-gluon color-ordered amplitudes differs from the pure-gluon case only by a Jacobian factor that depends on flavors and orderings of the quarks. In the formula for Higgs plus multi-parton amplitudes, the massive Higgs boson is effectively described by two additional massless legs which do not appear in the Parke-Taylor factor. The latter also represents the first twistor-string/connected formula for form factors.

  14. Supplementation of prebiotics in infant formula

    Directory of Open Access Journals (Sweden)

    Močić Pavić A

    2014-06-01

    Full Text Available Ana Močić Pavić, Iva Hojsak Referral Center for Pediatric Gastroenterology and Nutrition, Children's Hospital Zagreb, Zagreb, Croatia Background: In recent years prebiotics have been added to infant formula to make it resemble breast milk more closely and to promote growth and development of beneficial intestinal microbiota. This review aims to present new data on the possible positive effects of prebiotics in infant formula on intestinal microbiota (bifidogenic and lactogenic effect and on clinical outcomes including growth, infections, and allergies. With that aim, a literature search of the Cochrane Central Register of Controlled Trials (CENTRAL, EMBASE, Scopus, PubMed/Medline, Web of Science, and Science Direct in the last 10 years (December 2003 to December 2013 was performed. Results: Altogether 24 relevant studies were identified. It was found that during intervention, prebiotics can elicit a bifidogenic and lactogenic effect. As far as clinical outcomes were concerned, 14 studies investigated the effect of infant formula supplemented with prebiotics on growth and found that there was no difference when compared with non-supplemented infant formula. All available data are insufficient to support prebiotic supplementation in order to reduce risk of allergies and infections. Conclusion: There is currently no strong evidence to recommend routine supplementation of infant formulas with prebiotics. Further well-designed clinical studies with long-term follow-up are needed. Keywords: prebiotics, infant formula, growth, allergy, infections, supplementation

  15. Fundamental formulae for wave-energy conversion.

    Science.gov (United States)

    Falnes, Johannes; Kurniawan, Adi

    2015-03-01

    The time-average wave power that is absorbed from an incident wave by means of a wave-energy conversion (WEC) unit, or by an array of WEC units-i.e. oscillating immersed bodies and/or oscillating water columns (OWCs)-may be mathematically expressed in terms of the WEC units' complex oscillation amplitudes, or in terms of the generated outgoing (diffracted plus radiated) waves, or alternatively, in terms of the radiated waves alone. Following recent controversy, the corresponding three optional expressions are derived, compared and discussed in this paper. They all provide the correct time-average absorbed power. However, only the first-mentioned expression is applicable to quantify the instantaneous absorbed wave power and the associated reactive power. In this connection, new formulae are derived that relate the 'added-mass' matrix, as well as a couple of additional reactive radiation-parameter matrices, to the difference between kinetic energy and potential energy in the water surrounding the immersed oscillating WEC array. Further, a complex collective oscillation amplitude is introduced, which makes it possible to derive, by a very simple algebraic method, various simple expressions for the maximum time-average wave power that may be absorbed by the WEC array. The real-valued time-average absorbed power is illustrated as an axisymmetric paraboloid defined on the complex collective-amplitude plane. This is a simple illustration of the so-called 'fundamental theorem for wave power'. Finally, the paper also presents a new derivation that extends a recently published result on the direction-average maximum absorbed wave power to cases where the WEC array's radiation damping matrix may be singular and where the WEC array may contain OWCs in addition to oscillating bodies.

  16. New formulae between Jacobi polynomials and some fractional Jacobi functions generalizing some connection formulae

    Science.gov (United States)

    Abd-Elhameed, W. M.

    2017-07-01

    In this paper, a new formula relating Jacobi polynomials of arbitrary parameters with the squares of certain fractional Jacobi functions is derived. The derived formula is expressed in terms of a certain terminating hypergeometric function of the type _4F3(1) . With the aid of some standard reduction formulae such as Pfaff-Saalschütz's and Watson's identities, the derived formula can be reduced in simple forms which are free of any hypergeometric functions for certain choices of the involved parameters of the Jacobi polynomials and the Jacobi functions. Some other simplified formulae are obtained via employing some computer algebra algorithms such as the algorithms of Zeilberger, Petkovsek and van Hoeij. Some connection formulae between some Jacobi polynomials are deduced. From these connection formulae, some other linearization formulae of Chebyshev polynomials are obtained. As an application to some of the introduced formulae, a numerical algorithm for solving nonlinear Riccati differential equation is presented and implemented by applying a suitable spectral method.

  17. Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Chekhov, Leonid O.; Penner, Robert

    2013-01-01

    and free energies are convergent for small t and all s as a perturbation of the Gaussian potential, which arises for st=0. This perturbation is computed using the formalism of the topological recursion. The corresponding enumeration of chord diagrams gives at once the number of RNA complexes of a given...... topology as well as the number of cells in Riemann's moduli spaces for bordered surfaces. The free energies are computed here in principle for all genera and explicitly for genera less than four....

  18. Loop equations and topological recursion for the arbitrary-$\\beta$ two-matrix model

    CERN Document Server

    Bergère, Michel; Marchal, Olivier; Prats-Ferrer, Aleix

    2012-01-01

    We write the loop equations for the $\\beta$ two-matrix model, and we propose a topological recursion algorithm to solve them, order by order in a small parameter. We find that to leading order, the spectral curve is a "quantum" spectral curve, i.e. it is given by a differential operator (instead of an algebraic equation for the hermitian case). Here, we study the case where that quantum spectral curve is completely degenerate, it satisfies a Bethe ansatz, and the spectral curve is the Baxter TQ relation.

  19. Recursive polarization of nuclear spins in diamond at arbitrary magnetic fields

    International Nuclear Information System (INIS)

    Pagliero, Daniela; Laraoui, Abdelghani; Henshaw, Jacob D.; Meriles, Carlos A.

    2014-01-01

    We introduce an alternate route to dynamically polarize the nuclear spin host of nitrogen-vacancy (NV) centers in diamond. Our approach articulates optical, microwave, and radio-frequency pulses to recursively transfer spin polarization from the NV electronic spin. Using two complementary variants of the same underlying principle, we demonstrate nitrogen nuclear spin initialization approaching 80% at room temperature both in ensemble and single NV centers. Unlike existing schemes, our approach does not rely on level anti-crossings and is thus applicable at arbitrary magnetic fields. This versatility should prove useful in applications ranging from nanoscale metrology to sensitivity-enhanced NMR

  20. Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion

    Directory of Open Access Journals (Sweden)

    Wolfgang Jeltsch

    2014-06-01

    Full Text Available Functional reactive programming (FRP makes it possible to express temporal aspects of computations in a declarative way. Recently we developed two kinds of categorical models of FRP: abstract process categories (APCs and concrete process categories (CPCs. Furthermore we showed that APCs generalize CPCs. In this paper, we extend APCs with additional structure. This structure models recursion and corecursion operators that are related to time. We show that the resulting categorical models generalize those CPCs that impose an additional constraint on time scales. This constraint boils down to ruling out ω-supertasks, which are closely related to Zeno's paradox of Achilles and the tortoise.

  1. Recursive Cluster Elimination (RCE for classification and feature selection from gene expression data

    Directory of Open Access Journals (Sweden)

    Showe Louise C

    2007-05-01

    Full Text Available Abstract Background Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that are important for distinguishing the different sample classes being compared, poses a challenging problem in high dimensional data analysis. We describe a new procedure for selecting significant genes as recursive cluster elimination (RCE rather than recursive feature elimination (RFE. We have tested this algorithm on six datasets and compared its performance with that of two related classification procedures with RFE. Results We have developed a novel method for selecting significant genes in comparative gene expression studies. This method, which we refer to as SVM-RCE, combines K-means, a clustering method, to identify correlated gene clusters, and Support Vector Machines (SVMs, a supervised machine learning classification method, to identify and score (rank those gene clusters for the purpose of classification. K-means is used initially to group genes into clusters. Recursive cluster elimination (RCE is then applied to iteratively remove those clusters of genes that contribute the least to the classification performance. SVM-RCE identifies the clusters of correlated genes that are most significantly differentially expressed between the sample classes. Utilization of gene clusters, rather than individual genes, enhances the supervised classification accuracy of the same data as compared to the accuracy when either SVM or Penalized Discriminant Analysis (PDA with recursive feature elimination (SVM-RFE and PDA-RFE are used to remove genes based on their individual discriminant weights. Conclusion SVM-RCE provides improved classification accuracy with complex microarray data sets when it is compared to the classification accuracy of the same datasets using either SVM-RFE or PDA-RFE. SVM-RCE identifies clusters of correlated genes that when considered together

  2. A novel noncommutative KdV-type equation, its recursion operator, and solitons

    Science.gov (United States)

    Carillo, Sandra; Lo Schiavo, Mauro; Porten, Egmont; Schiebold, Cornelia

    2018-04-01

    A noncommutative KdV-type equation is introduced extending the Bäcklund chart in Carillo et al. [Symmetry Integrability Geom.: Methods Appl. 12, 087 (2016)]. This equation, called meta-mKdV here, is linked by Cole-Hopf transformations to the two noncommutative versions of the mKdV equations listed in Olver and Sokolov [Commun. Math. Phys. 193, 245 (1998), Theorem 3.6]. For this meta-mKdV, and its mirror counterpart, recursion operators, hierarchies, and an explicit solution class are derived.

  3. Recursiveness in learning processes: An analogy to help software development for ABA intervention for autistic kids

    Science.gov (United States)

    Presti, Giovambattista; Premarini, Claudio; Leuzzi, Martina; Di Blasi, Melina; Squatrito, Valeria

    2017-11-01

    The operant was conceptualized by Skinner as a class of behaviors which have common effect on the environment and that, as a class can be shown to vary lawfully in their relations to the other environmental variables, namely antecedents and consequences. And Skinner himself underlined the fact that "operant field is the very field purpose of behavior". The operant offers interesting basic and applied characteristic to conceptualize complex behavior as a recursive process of learning. In this paper we will discuss how the operant concept can be applied in the implementation of software oriented to increase cognitive skills in autistic children and provide an example.

  4. Recursive Utility and the Superneutrality of Money on the Transition Path

    OpenAIRE

    Miyazaki, Kenji

    2010-01-01

    this paper investigates whether a change in the growth rate of the money supply enhances the rate of capital accumulation in a cash-in-advance monetary model with recursive utility. Although money is superneutral in the steady state, the effect of the growth rate of money on the speed of capital accumulation depends not only on the curvature of the felicity but also on the slope and curvature of the discount rate function. We find that when the discount rate decreases with consumption and the...

  5. Gluon and quark jets in a recursive model motivated by quantum chromodynamics

    International Nuclear Information System (INIS)

    Sukhatme, U.P.

    1979-01-01

    We compute observable quantities like the multiplicity and momentum distributions of hadrons in gluon and quark jets in the framework of a recursive cascade model, which is strongly motivated by the fundamental interactions of QCD. Fragmentation occurs via 3 types of breakups: quark → meson + quark, gluon → meson + gluon, gluon → quark + antiquark. In our model gluon jets are softer than quark jets. The ratio of gluon jet to quark jet multiplicity is found to be 2 asymptotically, but much less at lower energies. Some phenomenological consequences for γ decay are discussed. (orig.)

  6. Event-triggered sensor data transmission policy for receding horizon recursive state estimation

    Directory of Open Access Journals (Sweden)

    Yunji Li

    2017-06-01

    Full Text Available We consider a sensor data transmission policy for receding horizon recursive state estimation in a networked linear system. A good tradeoff between estimation error and communication rate could be achieved according to a transmission strategy, which decides the transfer time of the data packet. Here we give this transmission policy through proving the upper bound of system performance. Moreover, the lower bound of system performance is further analyzed in detail. A numerical example is given to verify the potential and effectiveness of the theoretical results.

  7. Gauge amplitude identities by on-shell recursion relation in S-matrix program

    International Nuclear Information System (INIS)

    Feng Bo; Huang Rijun; Jia Yin

    2011-01-01

    Using only the Britto-Cachazo-Feng-Witten (BCFW) on-shell recursion relation we prove color-order reversed relation, U(1)-decoupling relation, Kleiss-Kuijf (KK) relation and Bern-Carrasco-Johansson (BCJ) relation for color-ordered gauge amplitude in the framework of S-matrix program without relying on Lagrangian description. Our derivation is the first pure field theory proof of the new discovered BCJ identity, which substantially reduces the color-ordered basis from (n-2)! to (n-3)!. Our proof gives also its physical interpretation as the mysterious bonus relation with 1/(z 2 ) behavior under suitable on-shell deformation for no adjacent pair.

  8. Speed control of induction motor using fuzzy recursive least squares technique

    OpenAIRE

    Santiago Sánchez; Eduardo Giraldo

    2008-01-01

    A simple adaptive controller design is presented in this paper, the control system uses the adaptive fuzzy logic, sliding modes and is trained with the recursive least squares technique. The problem of parameter variation is solved with the adaptive controller; the use of an internal PI regulator produces that the speed control of the induction motor be achieved by the stator currents instead the input voltage. The rotor-flux oriented coordinated system model is used to develop and test the c...

  9. Speed control of induction motor using fuzzy recursive least squares technique

    Directory of Open Access Journals (Sweden)

    Santiago Sánchez

    2008-12-01

    Full Text Available A simple adaptive controller design is presented in this paper, the control system uses the adaptive fuzzy logic, sliding modes and is trained with the recursive least squares technique. The problem of parameter variation is solved with the adaptive controller; the use of an internal PI regulator produces that the speed control of the induction motor be achieved by the stator currents instead the input voltage. The rotor-flux oriented coordinated system model is used to develop and test the control system.

  10. Parallel Implementation of Riccati Recursion for Solving Linear-Quadratic Control Problems

    DEFF Research Database (Denmark)

    Frison, Gianluca; Jørgensen, John Bagterp

    2013-01-01

    In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper...... an alternative version of the Riccati recursion solver for LQ control problems is presented. The performance of both the classical and the alternative version is analyzed from a theoretical as well as a numerical point of view, and the alternative version is found to be approximately 50% faster than...

  11. Projection-based Bayesian recursive estimation of ARX model with uniform innovations

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav; Pavelková, Lenka

    2007-01-01

    Roč. 56, 9/10 (2007), s. 646-655 ISSN 0167-6911 R&D Projects: GA AV ČR 1ET100750401; GA MŠk 2C06001; GA MDS 1F43A/003/120 Institutional research plan: CEZ:AV0Z10750506 Keywords : ARX model * Bayesian recursive estimation * Uniform distribution Subject RIV: BC - Control Systems Theory Impact factor: 1.634, year: 2007 http://dx.doi.org/10.1016/j.sysconle.2007.03.005

  12. Conformal symmetry in two-dimensional space: recursion representation of conformal block

    International Nuclear Information System (INIS)

    Zamolodchikov, A.B.

    1988-01-01

    The four-point conformal block plays an important part in the analysis of the conformally invariant operator algebra in two-dimensional space. The behavior of the conformal block is calculated in the present paper in the limit in which the dimension Δ of the intermediate operator tends to infinity. This makes it possible to construct a recursion relation for this function that connects the conformal block at arbitrary Δ to the blocks corresponding to the dimensions of the zero vectors in the degenerate representations of the Virasoro algebra. The relation is convenient for calculating the expansion of the conformal block in powers of the uniformizing parameters q = i π tau

  13. Parametric output-only identification of time-varying structures using a kernel recursive extended least squares TARMA approach

    Science.gov (United States)

    Ma, Zhi-Sai; Liu, Li; Zhou, Si-Da; Yu, Lei; Naets, Frank; Heylen, Ward; Desmet, Wim

    2018-01-01

    The problem of parametric output-only identification of time-varying structures in a recursive manner is considered. A kernelized time-dependent autoregressive moving average (TARMA) model is proposed by expanding the time-varying model parameters onto the basis set of kernel functions in a reproducing kernel Hilbert space. An exponentially weighted kernel recursive extended least squares TARMA identification scheme is proposed, and a sliding-window technique is subsequently applied to fix the computational complexity for each consecutive update, allowing the method to operate online in time-varying environments. The proposed sliding-window exponentially weighted kernel recursive extended least squares TARMA method is employed for the identification of a laboratory time-varying structure consisting of a simply supported beam and a moving mass sliding on it. The proposed method is comparatively assessed against an existing recursive pseudo-linear regression TARMA method via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics. Furthermore, the comparisons demonstrate the superior achievable accuracy, lower computational complexity and enhanced online identification capability of the proposed kernel recursive extended least squares TARMA approach.

  14. Recursive Fitness

    National Research Council Canada - National Science Library

    Cook, James

    1998-01-01

    ...; all the other voyagers are tried and true initiates. His brotherhood lives under arcane rules -- one may not eat beans, for instance -- and dedicates itself to discovering mathematical regularity in nature...

  15. Multicanonical recursions

    International Nuclear Information System (INIS)

    Berg, B.A.

    1996-01-01

    Recently multicanonical Monte Carlo (MC) sampling and closely related methods have received much attention. Considerable gains have been achieved in situations with open-quotes supercriticalclose quotes slowing down, such as first-order transition, and systems with conflicting constrains, for instance, spin glasses or proteins. In the multicanonical ensemble one samples configurations such that exact reconstruction of canonical expectation values becomes feasible for a desired temperature range. This requires a broad energy distribution, and leaves innovative freedom concerning the optimal shape. Considerable practical experience exists only for the uniform energy distribution

  16. Recursive Averaging

    Science.gov (United States)

    Smith, Scott G.

    2015-01-01

    In this article, Scott Smith presents an innocent problem (Problem 12 of the May 2001 Calendar from "Mathematics Teacher" ("MT" May 2001, vol. 94, no. 5, p. 384) that was transformed by several timely "what if?" questions into a rewarding investigation of some interesting mathematics. These investigations led to two…

  17. Test generator development for differential equations for lms moodle

    Directory of Open Access Journals (Sweden)

    Анна Александровна Муханова

    2014-12-01

    Full Text Available This article discusses the basic mechanisms of the test generator for differential equations, developed by the authors. The generator is designed to generate a large number of test questions in accordance with user-defined rules, which include: the number of tasks required for each type of differential equation, and the tasks difficulty, controlled by the nesting level of recursive functions. The generator produces a test file format GIFT, which is a plain text file.

  18. Formula Dan Ekspresi Formulaik: Aspek Kelisanan Mantra Dalam Pertunjukan Reog

    Directory of Open Access Journals (Sweden)

    Heru S.P Saputra

    2010-12-01

    Full Text Available Artikel ini bertujuan mendiskusikan aspek kelisanan mantra yang digunakan dalam pertunjukan reog. Hasil kajian menunjukkan bahwa dalam seni tradisi reog, mantra merupakan media verbal yang digunakan oleh pembarong untuk mendatangkan kekuatan magis dalam rangkaian tari dhadhak merak. Mantra-mantra di antaranya Mantra Prosesi Drojogan dan Mantra Pangracutan dalam konteks pertunjukan reog merupakan wujud aspek kelisanan. Mantra-mantra tersebut tersusun atas formula-formula, yakni formula repetisi tautotes, formula paralelisme sintaktis, formula konkatenasi, formula repetisi anafora, dan formula repetisi epifora. Dengan beragam formula tersebut, mantra memiliki perulangan yang berpola dan men- jadi terasa ritmis sehingga menunjukkan ekspresi formulaik. Formula dan ekspresi formulaik tersebut merupakan aspek kelisanan utama yang mencerminkan sakralitas dan spiritualitas da- lam seni tradisi reog. Abstract: This article aims to discuss aspects of spells (magic-formula orality used in the reog show. The study shows that in the reog tradition art, the spells is a verbal medium used by pembarong to bring in a series of magical power dhadhak merak dance. Spells among others, Prosesi Drojogan and Pangracutan spells in the context of the show is a form of reog orality aspects. Spells are made up of formulas, i.e. tautotes repetition formula, syntactic parallelism formula, concatenate formula, anaphora repetition formula, and epifora repetition formula. With a variety of formulas, the repetition of the spells has become patterned and rhythmic feel, thereby indicating formulaic expression. The formulas and formulaic expressions are the main orality aspects that reflect sacredness and spirituality in reog traditions art. Key Words: spells or magic-formula, formulas, sacredness, spirituality, tradition art

  19. Generation of Random Numbers and Parallel Random Number Streams for Monte Carlo Simulations

    Directory of Open Access Journals (Sweden)

    L. Yu. Barash

    2012-01-01

    Full Text Available Modern methods and libraries for high quality pseudorandom number generation and for generation of parallel random number streams for Monte Carlo simulations are considered. The probability equidistribution property and the parameters when the property holds at dimensions up to logarithm of mesh size are considered for Multiple Recursive Generators.

  20. Semi-empirical formulas for sputtering yield

    International Nuclear Information System (INIS)

    Yamamura, Yasumichi

    1994-01-01

    When charged particles, electrons, light and so on are irradiated on solid surfaces, the materials are lost from the surfaces, and this phenomenon is called sputtering. In order to understand sputtering phenomenon, the bond energy of atoms on surfaces, the energy given to the vicinity of surfaces and the process of converting the given energy to the energy for releasing atoms must be known. The theories of sputtering and the semi-empirical formulas for evaluating the dependence of sputtering yield on incident energy are explained. The mechanisms of sputtering are that due to collision cascade in the case of heavy ion incidence and that due to surface atom recoil in the case of light ion incidence. The formulas for the sputtering yield of low energy heavy ion sputtering, high energy light ion sputtering and the general case between these extreme cases, and the Matsunami formula are shown. At the stage of the publication of Atomic Data and Nuclear Data Tables in 1984, the data up to 1983 were collected, and about 30 papers published thereafter were added. The experimental data for low Z materials, for example Be, B and C and light ion sputtering data were reported. The combination of ions and target atoms in the collected sputtering data is shown. The new semi-empirical formula by slightly adjusting the Matsunami formula was decided. (K.I.)

  1. Weak interactions - formulae, results, and derivations

    Energy Technology Data Exchange (ETDEWEB)

    Pietschmann, H

    1983-01-01

    The purpose of this book is to provide experimental and theoretical physicists working in the field of weak interactions with a reference work which includes all the formulae and results needed in actual research. The derivation of these formulae is also given in detail for some typical examples to facilitate their use. New developments in unified gauge theories have been included as well as the decay processes of the new particles such as intermediate bosons and tau-lepton. In order to supply the research worker with a convenient working aid, frequently occurring mathematical formulae as well as phase space integrals and the Dirac algebra have been included. Treatment of field operators - also with respect to discrete transformations C, P, T and G - as well as products of invariant functions are provided. Particular emphasis has been placed on the Lagrangian of unified electroweak interactions. The major portion of the work is, of course, devoted to formulae for decay processes and scattering cross-sections. Useful formulae in e/sup +/e/sup -/ reactions and a small dictionary for translations into other forms for the space-time metric are collected in appendices.

  2. Infant formula and early childhood caries

    Directory of Open Access Journals (Sweden)

    Saudamini Girish More

    2018-01-01

    Full Text Available The prevalence of early childhood caries (ECC is increasing worldwide. Impaired oral health could have a negative impact on the overall health of infants. ECC can continue to deteriorate the growth and development of the child in preschool stage. Feeding practices largely influence the occurrence of ECC. Infant formula is commonly used as supplements or substitutes for breast milk up to the first 2 years of age. The dietary sugars such as lactose and sucrose, present in the infant formula, could act as a favorable substrate and change the oral microflora. Infant formula constitutes of various minerals which are known to affect tooth mineralization including iron, fluoride, and calcium. A number of in vitro, animal, and human studies have been conducted to understand their effect on oral environment and microbiota. Exploring the scientific literature for different types of infant formula and their role in the etiopathogenesis of dental caries could give us an insight into the cariogenic potential of infant formula. Furthermore, this could be source of information for health practitioners as they are the ones who are first sought by parents for advice related to infant feeding.

  3. A recursive field-normalized bibliometric performance indicator: an application to the field of library and information science.

    Science.gov (United States)

    Waltman, Ludo; Yan, Erjia; van Eck, Nees Jan

    2011-10-01

    Two commonly used ideas in the development of citation-based research performance indicators are the idea of normalizing citation counts based on a field classification scheme and the idea of recursive citation weighing (like in PageRank-inspired indicators). We combine these two ideas in a single indicator, referred to as the recursive mean normalized citation score indicator, and we study the validity of this indicator. Our empirical analysis shows that the proposed indicator is highly sensitive to the field classification scheme that is used. The indicator also has a strong tendency to reinforce biases caused by the classification scheme. Based on these observations, we advise against the use of indicators in which the idea of normalization based on a field classification scheme and the idea of recursive citation weighing are combined.

  4. Move! Eat better: try the FIT formula

    CERN Multimedia

    CERN Medical Service

    2013-01-01

    In the physics world, some formulas lead to a Nobel prize. In the world of health and physical activity, the Medical Service also has a winning formula...   FIT (physical activity) =       Frequency x Intensity x Time Frequency = more than 3 times per week. Intensity = physical activity which slightly increases your heart rate and breathing rate. Time = more than 30 minutes (per session). As part of our Move! Eat better campaign, the Medical Service is still offering the use of a pedometer (available on loan from the infirmary), which is a really useful tool to help you reach the winning FIT formula. Interested in borrowing a CERN pedometer?  Click here!

  5. Mass formula for quasi-black holes

    International Nuclear Information System (INIS)

    Lemos, Jose P. S.; Zaslavskii, Oleg B.

    2008-01-01

    A quasi-black hole, either nonextremal or extremal, can be broadly defined as the limiting configuration of a body when its boundary approaches the body's quasihorizon. We consider the mass contributions and the mass formula for a static quasi-black hole. The analysis involves careful scrutiny of the surface stresses when the limiting configuration is reached. It is shown that there exists a strict correspondence between the mass formulas for quasi-black holes and pure black holes. This perfect parallelism exists in spite of the difference in derivation and meaning of the formulas in both cases. For extremal quasi-black holes the finite surface stresses give zero contribution to the total mass. This leads to a very special version of Abraham-Lorentz electron in general relativity in which the total mass has pure electromagnetic origin in spite of the presence of bare stresses.

  6. From Pauli Matrices to Quantum Ito Formula

    International Nuclear Information System (INIS)

    Pautrat, Yan

    2005-01-01

    This paper answers important questions raised by the recent description, by Attal, of a robust and explicit method to approximate basic objects of quantum stochastic calculus on bosonic Fock space by analogues on the state space of quantum spin chains. The existence of that method justifies a detailed investigation of discrete-time quantum stochastic calculus. Here we fully define and study that theory and obtain in particular a discrete-time quantum Ito formula, which one can see as summarizing the commutation relations of Pauli matrices.An apparent flaw in that approximation method is the difference in the quantum Ito formulas, discrete and continuous, which suggests that the discrete quantum stochastic calculus differs fundamentally from the continuous one and is therefore not a suitable object to approximate subtle phenomena. We show that flaw is only apparent by proving that the continuous-time quantum Ito formula is actually a consequence of its discrete-time counterpart

  7. Sum formulas for reductive algebraic groups

    DEFF Research Database (Denmark)

    Andersen, Henning Haahr; Kulkarni, Upendra

    2008-01-01

    \\supset V^1 \\cdots \\supset V^r = 0$. The sum of the positive terms in this filtration satisfies a well known sum formula. If $T$ denotes a tilting module either for $G$ or $U_q$ then we can similarly filter the space $\\Hom_G(V,T)$, respectively $\\Hom_{U_q}(V,T)$ and there is a sum formula for the positive...... terms here as well. We give an easy and unified proof of these two (equivalent) sum formulas. Our approach is based on an Euler type identity which we show holds without any restrictions on $p$ or $l$. In particular, we get rid of previous such restrictions in the tilting module case....

  8. International design competition. Formula student Germany; Internationaler Konstruktionswettbewerb. Formula Student Germany

    Energy Technology Data Exchange (ETDEWEB)

    Liebl, Johannes; Siebenpfeiffer, Wolfgang (eds.)

    2011-11-15

    Within the International Design Competition 2011 at the Hockenheimring (Federal Republic of Germany) the following contributions were presented: (1) Formula Student Germany - Experience the Future (Tim Hannig); (2) Live at the Hockenheimring 2011; (3) Cutaway Model of the FSC Winning Car - The GFR11c by the Global Formula Racing Team of the DHBW Ravensburg; (4) Formula Student Racecar with Selective Cylinder Deactivation (Alexander Titz); (5) Construction of a crankshaft for the RS11 (Stefan Buhl); (6) The Wheel Design of the ARG 11 (Megan Rotondo); (7) Cutaway Model of the FSE Winning Car - The DUT11 by the DUT Racing Team of the Delft University of Technology; (8) Formula Student Electric - E-Scrutineering (Ann-Christin Bartoelke); (9) Development of an E-motor for Formular Student Electric (Urs Leuthold); (10) The Battery Management System of the FHWT04e (Andreas Hagemeyer); (11) Overall Results 2011 at a Glance; (12) Show your Colours; (13) Formula Student Germany visiting China (Alia Pierce).

  9. Application of the Recursive Finite Element Approach on 2D Periodic Structures under Harmonic Vibrations

    Directory of Open Access Journals (Sweden)

    Reem Yassine

    2016-12-01

    Full Text Available The frequency response function is a quantitative measure used in structural analysis and engineering design; hence, it is targeted for accuracy. For a large structure, a high number of substructures, also called cells, must be considered, which will lead to a high amount of computational time. In this paper, the recursive method, a finite element method, is used for computing the frequency response function, independent of the number of cells with much lesser time costs. The fundamental principle is eliminating the internal degrees of freedom that are at the interface between a cell and its succeeding one. The method is applied solely for free (no load nodes. Based on the boundary and interior degrees of freedom, the global dynamic stiffness matrix is computed by means of products and inverses resulting with a dimension the same as that for one cell. The recursive method is demonstrated on periodic structures (cranes and buildings under harmonic vibrations. The method yielded a satisfying time decrease with a maximum time ratio of 1 18 and a percentage difference of 19%, in comparison with the conventional finite element method. Close values were attained at low and very high frequencies; the analysis is supported for two types of materials (steel and plastic. The method maintained its efficiency with a high number of forces, excluding the case when all of the nodes are under loads.

  10. Image defog algorithm based on open close filter and gradient domain recursive bilateral filter

    Science.gov (United States)

    Liu, Daqian; Liu, Wanjun; Zhao, Qingguo; Fei, Bowen

    2017-11-01

    To solve the problems of fuzzy details, color distortion, low brightness of the image obtained by the dark channel prior defog algorithm, an image defog algorithm based on open close filter and gradient domain recursive bilateral filter, referred to as OCRBF, was put forward. The algorithm named OCRBF firstly makes use of weighted quad tree to obtain more accurate the global atmospheric value, then exploits multiple-structure element morphological open and close filter towards the minimum channel map to obtain a rough scattering map by dark channel prior, makes use of variogram to correct the transmittance map,and uses gradient domain recursive bilateral filter for the smooth operation, finally gets recovery images by image degradation model, and makes contrast adjustment to get bright, clear and no fog image. A large number of experimental results show that the proposed defog method in this paper can be good to remove the fog , recover color and definition of the fog image containing close range image, image perspective, the image including the bright areas very well, compared with other image defog algorithms,obtain more clear and natural fog free images with details of higher visibility, what's more, the relationship between the time complexity of SIDA algorithm and the number of image pixels is a linear correlation.

  11. Recursive wind speed forecasting based on Hammerstein Auto-Regressive model

    International Nuclear Information System (INIS)

    Ait Maatallah, Othman; Achuthan, Ajit; Janoyan, Kerop; Marzocca, Pier

    2015-01-01

    Highlights: • Developed a new recursive WSF model for 1–24 h horizon based on Hammerstein model. • Nonlinear HAR model successfully captured chaotic dynamics of wind speed time series. • Recursive WSF intrinsic error accumulation corrected by applying rotation. • Model verified for real wind speed data from two sites with different characteristics. • HAR model outperformed both ARIMA and ANN models in terms of accuracy of prediction. - Abstract: A new Wind Speed Forecasting (WSF) model, suitable for a short term 1–24 h forecast horizon, is developed by adapting Hammerstein model to an Autoregressive approach. The model is applied to real data collected for a period of three years (2004–2006) from two different sites. The performance of HAR model is evaluated by comparing its prediction with the classical Autoregressive Integrated Moving Average (ARIMA) model and a multi-layer perceptron Artificial Neural Network (ANN). Results show that the HAR model outperforms both the ARIMA model and ANN model in terms of root mean square error (RMSE), mean absolute error (MAE), and Mean Absolute Percentage Error (MAPE). When compared to the conventional models, the new HAR model can better capture various wind speed characteristics, including asymmetric (non-gaussian) wind speed distribution, non-stationary time series profile, and the chaotic dynamics. The new model is beneficial for various applications in the renewable energy area, particularly for power scheduling

  12. Block recursive LU preconditioners for the thermally coupled incompressible inductionless MHD problem

    Science.gov (United States)

    Badia, Santiago; Martín, Alberto F.; Planas, Ramon

    2014-10-01

    The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirable in order to capture the different physical scales of the problem at hand. However, solving the multiphysics linear systems of equations resulting from such algorithms is a very challenging task which requires efficient and scalable preconditioners. In this work, a new family of recursive block LU preconditioners is designed and tested for solving the thermally coupled inductionless MHD equations. These preconditioners are obtained after splitting the fully coupled matrix into one-physics problems for every variable (velocity, pressure, current density, electric potential and temperature) that can be optimally solved, e.g., using preconditioned domain decomposition algorithms. The main idea is to arrange the original matrix into an (arbitrary) 2 × 2 block matrix, and consider an LU preconditioner obtained by approximating the corresponding Schur complement. For every one of the diagonal blocks in the LU preconditioner, if it involves more than one type of unknowns, we proceed the same way in a recursive fashion. This approach is stated in an abstract way, and can be straightforwardly applied to other multiphysics problems. Further, we precisely explain a flexible and general software design for the code implementation of this type of preconditioners.

  13. Working Memory: A Cognitive Limit to Non-Human Primate Recursive Thinking Prior to Hominid Evolution

    Directory of Open Access Journals (Sweden)

    Dwight W. Read

    2008-10-01

    Full Text Available In this paper I explore the possibility that recursion is not part of the cognitive repertoire of non-human primates such as chimpanzees due to limited working memory capacity. Multiple lines of data, from nut cracking to the velocity and duration of cognitive development, imply that chimpanzees have a short-term memory size that limits working memory to dealing with two, or at most three, concepts at a time. If so, as a species they lack the cognitive capacity for recursive thinking to be integrated into systems of social organization and communication. If this limited working memory capacity is projected back to a common ancestor for Pan and Homo, it follows that early hominid ancestors would have had limited working memory capacity. Hence we should find evidence for expansion of working memory capacity during hominid evolution reflected in changes in the products of conceptually framed activities such as stone tool production. Data on the artifacts made by our hominid ancestors support this expansion hypothesis for hominid working memory, thereby leading to qualitative differences between Pan and Homo.

  14. The understanding of the students about the nature of light in recursive curriculum

    Directory of Open Access Journals (Sweden)

    Geide Rosa Coelho

    2010-01-01

    Full Text Available We report an inquiry on the development of students' understanding about the nature of light. The study happened in a learning environment with a recursive and spiral Physics syllabus. We investigated the change in students' understanding about the nature of light during their 3rd year in High School, and the level of understanding about this subject achieved by students at the end of this year. To assess the students' understanding, we developed an open questionnaire form and a set of hierarchical categories, consisting of five different models about the nature of light. The questionnaire was used to access the students´ understanding at the beginning and at the end of the third level of the recursive curriculum. The results showed that students have a high level of prior knowledge, and also that the Physics learning they experienced had enhanced their understanding, despite the effects are not verified in all the Physics classes. By the end of the third year, most of the students explain the nature of light using or a corpuscular electromagnetic model or a dual electromagnetic model, but some students use these models with inconsistencies in their explanations.

  15. Soft sensor modelling by time difference, recursive partial least squares and adaptive model updating

    International Nuclear Information System (INIS)

    Fu, Y; Xu, O; Yang, W; Zhou, L; Wang, J

    2017-01-01

    To investigate time-variant and nonlinear characteristics in industrial processes, a soft sensor modelling method based on time difference, moving-window recursive partial least square (PLS) and adaptive model updating is proposed. In this method, time difference values of input and output variables are used as training samples to construct the model, which can reduce the effects of the nonlinear characteristic on modelling accuracy and retain the advantages of recursive PLS algorithm. To solve the high updating frequency of the model, a confidence value is introduced, which can be updated adaptively according to the results of the model performance assessment. Once the confidence value is updated, the model can be updated. The proposed method has been used to predict the 4-carboxy-benz-aldehyde (CBA) content in the purified terephthalic acid (PTA) oxidation reaction process. The results show that the proposed soft sensor modelling method can reduce computation effectively, improve prediction accuracy by making use of process information and reflect the process characteristics accurately. (paper)

  16. Efficient O(N) recursive computation of the operational space inertial matrix

    International Nuclear Information System (INIS)

    Lilly, K.W.; Orin, D.E.

    1993-01-01

    The operational space inertia matrix Λ reflects the dynamic properties of a robot manipulator to its tip. In the control domain, it may be used to decouple force and/or motion control about the manipulator workspace axes. The matrix Λ also plays an important role in the development of efficient algorithms for the dynamic simulation of closed-chain robotic mechanisms, including simple closed-chain mechanisms such as multiple manipulator systems and walking machines. The traditional approach used to compute Λ has a computational complexity of O(N 3 ) for an N degree-of-freedom manipulator. This paper presents the development of a recursive algorithm for computing the operational space inertia matrix (OSIM) that reduces the computational complexity to O(N). This algorithm, the inertia propagation method, is based on a single recursion that begins at the base of the manipulator and progresses out to the last link. Also applicable to redundant systems and mechanisms with multiple-degree-of-freedom joints, the inertia propagation method is the most efficient method known for computing Λ for N ≥ 6. The numerical accuracy of the algorithm is discussed for a PUMA 560 robot with a fixed base

  17. Stability of recursive out-of-sequence measurement filters: an open problem

    Science.gov (United States)

    Chen, Lingji; Moshtagh, Nima; Mehra, Raman K.

    2011-06-01

    In many applications where communication delays are present, measurements with earlier time stamps can arrive out-of-sequence, i.e., after state estimates have been obtained for the current time instant. To incorporate such an Out-Of-Sequence Measurement (OOSM), many algorithms have been proposed in the literature to obtain or approximate the optimal estimate that would have been obtained if the OOSM had arrived in-sequence. When OOSM occurs repeatedly, approximate estimations as a result of incorporating one OOSM have to serve as the basis for incorporating yet another OOSM. The question of whether the "approximation of approximation" is well behaved, i.e., whether approximation errors accumulate in a recursive setting, has not been adequately addressed in the literature. This paper draws attention to the stability question of recursive OOSM processing filters, formulates the problem in a specific setting, and presents some simulation results that suggest that such filters are indeed well-behaved. Our hope is that more research will be conducted in the future to rigorously establish stability properties of these filters.

  18. Cultivation of Agaricus bisporus on some compost formulas and ...

    African Journals Online (AJOL)

    Three compost formulas (formula I, formula II, and formula III) based waste tea leaves and using some activator materials such as wheat bran, chicken manure and pigeon manure were studied for Agaricus bisporus cultivation. Some locally available peats such as peat of Bolu, peat of Agacbasi, peat of Caykara and theirs ...

  19. Accurate formulas for the penalty caused by interferometric crosstalk

    DEFF Research Database (Denmark)

    Rasmussen, Christian Jørgen; Liu, Fenghai; Jeppesen, Palle

    2000-01-01

    New simple formulas for the penalty caused by interferometric crosstalk in PIN receiver systems and optically preamplified receiver systems are presented. They are more accurate than existing formulas.......New simple formulas for the penalty caused by interferometric crosstalk in PIN receiver systems and optically preamplified receiver systems are presented. They are more accurate than existing formulas....

  20. The rational formula from the runhydrograph | Parak | Water SA

    African Journals Online (AJOL)

    catchments. However, as a result of the criticisms, the formula carries with it many cautions. One such caution regards the determination of the formula\\'s runoff coefficient c, which is seen as the main difficulty in the design application of the formula. Mindful of this, it was decided to investigate the calibration of this coefficient, ...