WorldWideScience

Sample records for partially dead recursive

  1. 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...

  2. 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...

  3. 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)

  4. Recursive N-way partial least squares for brain-computer interface.

    Directory of Open Access Journals (Sweden)

    Andrey Eliseyev

    Full Text Available In the article tensor-input/tensor-output blockwise Recursive N-way Partial Least Squares (RNPLS regression is considered. It combines the multi-way tensors decomposition with a consecutive calculation scheme and allows blockwise treatment of tensor data arrays with huge dimensions, as well as the adaptive modeling of time-dependent processes with tensor variables. In the article the numerical study of the algorithm is undertaken. The RNPLS algorithm demonstrates fast and stable convergence of regression coefficients. Applied to Brain Computer Interface system calibration, the algorithm provides an efficient adjustment of the decoding model. Combining the online adaptation with easy interpretation of results, the method can be effectively applied in a variety of multi-modal neural activity flow modeling tasks.

  5. Achieving numerical accuracy and high performance using recursive tile LU factorization with partial pivoting

    KAUST Repository

    Dongarra, Jack

    2013-09-18

    The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore processors continue to present challenges to the development of fast and robust numerical software due to the increasing levels of hardware parallelism and widening gap between core and memory speeds. In this context, the difficulty in developing new algorithms for the scientific community resides in the combination of two goals: achieving high performance while maintaining the accuracy of the numerical algorithm. This paper proposes a new approach for computing the LU factorization in parallel on multicore architectures, which not only improves the overall performance but also sustains the numerical quality of the standard LU factorization algorithm 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 as well as the atomicity of selecting the appropriate pivots. Our approach uses a parallel fine-grained recursive formulation of the panel factorization step and implements the update of the trailing submatrix with the tile algorithm. Based on conflict-free partitioning of the data and lockless synchronization mechanisms, our implementation lets the overall computation flow naturally without contention. The dynamic runtime system called QUARK is then able to schedule tasks with heterogeneous granularities and to transparently introduce algorithmic lookahead. The performance results of our implementation are competitive compared to the currently available software packages and libraries. For example

  6. Achieving numerical accuracy and high performance using recursive tile LU factorization with partial pivoting

    KAUST Repository

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

    2013-01-01

    The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore processors continue to present challenges to the development of fast and robust numerical software due to the increasing levels of hardware parallelism and widening gap between core and memory speeds. In this context, the difficulty in developing new algorithms for the scientific community resides in the combination of two goals: achieving high performance while maintaining the accuracy of the numerical algorithm. This paper proposes a new approach for computing the LU factorization in parallel on multicore architectures, which not only improves the overall performance but also sustains the numerical quality of the standard LU factorization algorithm 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 as well as the atomicity of selecting the appropriate pivots. Our approach uses a parallel fine-grained recursive formulation of the panel factorization step and implements the update of the trailing submatrix with the tile algorithm. Based on conflict-free partitioning of the data and lockless synchronization mechanisms, our implementation lets the overall computation flow naturally without contention. The dynamic runtime system called QUARK is then able to schedule tasks with heterogeneous granularities and to transparently introduce algorithmic lookahead. The performance results of our implementation are competitive compared to the currently available software packages and libraries. For example

  7. 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

  8. 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.

  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. 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

  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. 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.

  13. 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.

  14. 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....

  15. 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.

  16. 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.

  17. 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

  18. 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.

  19. 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.

  20. 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

  1. 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.

  2. 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…

  3. 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....

  4. Dead Man or Dead Hand?

    DEFF Research Database (Denmark)

    Ringe, Wolf-Georg

    and potential takeover bids. Recent Delaware case-law suggests that the most extreme, ‘dead hand’ version of such clauses might violate directors’ fiduciary duties. This short article develops some initial thoughts on the phenomenon and evaluates how the new poison pills would be handled under European takeover...

  5. 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.

  6. 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.

  7. 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...

  8. 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...

  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. 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.

  11. 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

  12. 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...

  13. 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…

  14. Deadly progress

    International Nuclear Information System (INIS)

    Nader, R.; Abbotts, J.

    1978-01-01

    Nuclear power plants are safe, they help to get through the future bottle-neck in the field of energy, nuclear power plants provide for cheap electrical power and support economic growth - these are the sedative formulae which have been used for years to close the populations eyes towards the real problems. In this book, the American lawyer Ralph Nader and the nuclear chemist John Abbots not only oppose this myth of atomic safety, but they also defeat this theory with numerous technical, economic, and political details. Having realized the fact that the development of atomic energy can no longer be prevented by warnings of independent experts, but only by massive protests by the population - i.e. the protest by informed persons-, they give an understandable introduction to the techniques of atomic energy, construction of nuclear power plants, radioactive radiation, safety, etc. Furthermore, they inform about the social, political, and economic background of the nuclear power forcing. Nader and Abbots show the uncertainty of science, they bring secret documents about failures already occured and point out the catastrophic consequences of possible defects. The result of the thorough study: A 'technologic Vietnam' impends both USA and all other nuclear power countries, if the population won't struggle against this dead-end programme of the governments. (orig./HP) [de

  15. 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...

  16. 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…

  17. Love the dead, fear the dead

    DEFF Research Database (Denmark)

    Seebach, Sophie Hooge

    2017-01-01

    The dead are everywhere in the landscape in Acholi, northern Uganda. In the homes, the dead are present through their gravesites, situated next to houses and huts, and as spiritual presences in their family’s daily lives. In the bush, the dead are present as a constant potentiality, in the form...

  18. 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)

  19. Who's Counting Dead Wood ?

    OpenAIRE

    Woodall, C. W.; Verkerk, H.; Rondeux, Jacques; Ståhl, G.

    2009-01-01

    Dead wood in forests is a critical component of biodiversity, carbon and nutrient cycles, stand structure, and fuel loadings. Until recently, very few countries have conducted systematic inventories of dead wood resources across their forest lands. This may be changing as an increasing number of countries implement dead wood inventories. A recent survey looks at the status and attributes of forest dead wood inventories in over 60 countries. About 13 percent of countries inventory dead wood gl...

  20. 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....

  1. 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.

  2. 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

  3. 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.

  4. 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.

  5. 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.

  6. Simulating detectors dead time

    International Nuclear Information System (INIS)

    Rustom, Ibrahim Farog Ibrahim

    2015-06-01

    Nuclear detectors are used in all aspects of nuclear measurements. All nuclear detectors are characterized by their dead time i.e. the time needed by a detector to recover from a previous incident. A detector dead time influences measurements taken by a detector and specially when measuring high decay rate (>) where is the detector dead time. Two models are usually used to correct for the dead time effect: the paralayzable and the non-paralayzable models. In the current work we use Monte Carlo simulation techniques to simulate radioactivity and the effect of dead time and the count rate of a detector with a dead time =5x10 - 5s assuming the non-paralayzable model. The simulation indicates that assuming a non -paralayzable model could be used to correct for decay rate measured by a detector. The reliability of the non-paralayzable model to correct the measured decay rate could be gauged using the Monte Carlo simulation. (Author)

  7. 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

  8. 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.

  9. 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.)

  10. 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.

  11. 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.

  12. Live and Dead Nodes

    DEFF Research Database (Denmark)

    Jørgensen, Sune Lehman; Jackson, A. D.

    2005-01-01

    In this paper, we explore the consequences of a distinction between `live' and `dead' network nodes; `live' nodes are able to acquire new links whereas `dead' nodes are static. We develop an analytically soluble growing network model incorporating this distinction and show that it can provide...

  13. 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

  14. 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.

  15. 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...

  16. 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.

  17. 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)

  18. 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.

  19. 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

  20. Practicing on Newly Dead

    Directory of Open Access Journals (Sweden)

    Jewel Abraham

    2015-07-01

    Full Text Available A newly dead cadaver simulation is practiced on the physical remains of the dead before the onset of rigor mortis. This technique has potential benefits for providing real-life in-situ experience for novice providers in health care practices. Evolving ethical views in health care brings into question some of the ethical aspects associated with newly dead cadaver simulation in terms of justification for practice, autonomy, consent, and the need of disclosure. A clear statement of policies and procedures on newly dead cadaver simulation has yet to be implemented. Although there are benefits and disadvantages to an in-situ cadaver simulation, such practices should not be carried out in secrecy as there is no compelling evidence that suggests such training as imperative. Secrecy in these practices is a violation of honor code of nursing ethics. As health care providers, practitioners are obliged to be ethically honest and trustworthy to their patients. The author explores the ethical aspects of using newly dead cadaver simulation in training novice nursing providers to gain competency in various lifesaving skills, which otherwise cannot be practiced on a living individual. The author explores multiple views on cadaver simulation in relation to ethical theories and practices such as consent and disclosure to family.

  1. 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

  2. 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...

  3. 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.

  4. 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

  5. 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…

  6. Dead-ice environments

    DEFF Research Database (Denmark)

    Krüger, Johannes; Kjær, Kurt H.; Schomacker, Anders

    2010-01-01

    glacier environment. The scientific challenges are to answer the key questions. What are the conditions for dead-ice formation? From which sources does the sediment cover originate? Which melting and reworking processes act in the ice-cored moraines? What is the rate of de-icing in the ice-cored moraines...

  7. Resurrecting deadly carrots

    DEFF Research Database (Denmark)

    Weitzel, Corinna; Rønsted, Nina; Spalik, Krysztof

    2014-01-01

    Thapsia L. circumscribes a small genus of herbaceous perennials in the taxonomically difficult family Apiaceae. Thapsia occurs around the Mediterranean, extending from the Atlantic coasts of Portugal and Morocco to Crete and other Greek Islands in the East. Thapsia is commonly known as deadly...

  8. Non-abelian Z-theory: Berends-Giele recursion for the α{sup ′}-expansion of disk integrals

    Energy Technology Data Exchange (ETDEWEB)

    Mafra, Carlos R. [STAG Research Centre and Mathematical Sciences, University of Southampton,Southampton (United Kingdom); Institute for Advanced Study, School of Natural Sciences,Einstein Drive, Princeton, NJ 08540 (United States); Schlotterer, Oliver [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,Am Mühlenberg 1, 14476 Potsdam (Germany)

    2017-01-09

    We present a recursive method to calculate the α{sup ′}-expansion of disk integrals arising in tree-level scattering of open strings which resembles the approach of Berends and Giele to gluon amplitudes. Following an earlier interpretation of disk integrals as doubly partial amplitudes of an effective theory of scalars dubbed as Z-theory, we pinpoint the equation of motion of Z-theory from the Berends-Giele recursion for its tree amplitudes. A computer implementation of this method including explicit results for the recursion up to order α{sup ′7} is made available on the website repo.or.cz/BGap.git.

  9. The Dead Sea

    Science.gov (United States)

    2006-01-01

    The Dead Sea is the lowest point on Earth at 418 meters below sea level, and also one of the saltiest bodies of water on Earth with a salinity of about 300 parts-per-thousand (nine times greater than ocean salinity). It is located on the border between Jordan and Israel, and is fed by the Jordan River. The Dead Sea is located in the Dead Sea Rift, formed as a result of the Arabian tectonic plate moving northward away from the African Plate. The mineral content of the Dead Sea is significantly different from that of ocean water, consisting of approximately 53% magnesium chloride, 37% potassium chloride and 8% sodium chloride. In the early part of the 20th century, the Dead Sea began to attract interest from chemists who deduced that the Sea was a natural deposit of potash and bromine. From the Dead Sea brine, Israel and Jordan produce 3.8 million tons potash, 200,000 tons elemental bromine, 45,000 tons caustic soda, 25, 000 tons magnesium metal, and sodium chloride. Both countries use extensive salt evaporation pans that have essentially diked the entire southern end of the Dead Sea. With its 14 spectral bands from the visible to the thermal infrared wavelength region, and its high spatial resolution of 15 to 90 meters (about 50 to 300 feet), ASTER images Earth to map and monitor the changing surface of our planet. ASTER is one of five Earth-observing instruments launched December 18, 1999, on NASA's Terra satellite. The instrument was built by Japan's Ministry of Economy, Trade and Industry. A joint U.S./Japan science team is responsible for validation and calibration of the instrument and the data products. The broad spectral coverage and high spectral resolution of ASTER provides scientists in numerous disciplines with critical information for surface mapping, and monitoring of dynamic conditions and temporal change. Example applications are: monitoring glacial advances and retreats; monitoring potentially active volcanoes; identifying crop stress; determining

  10. 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...

  11. 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.

  12. 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.)

  13. 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.

  14. 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.

  15. 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...

  16. 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

  17. 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...

  18. 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

  19. 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

  20. 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.

  1. 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.

  2. The Dead Walk

    Directory of Open Access Journals (Sweden)

    Bill Phillips

    2014-02-01

    Full Text Available Monsters have always enjoyed a significant presence in the human imagination, and religion was instrumental in replacing the physical horror they engendered with that of a moral threat. Zombies, however, are amoral – their motivation purely instinctive and arbitrary, yet they are, perhaps, the most loathed of all contemporary monsters. One explanation for this lies in the theory of the uncanny valley, proposed by robotics engineer Masahiro Mori. According to the theory, we reserve our greatest fears for those things which seem most human, yet are not – such as dead bodies. Such a reaction is most likely a survival mechanism to protect us from danger and disease – a mechanism even more essential when the dead rise up and walk. From their beginnings zombies have reflected western societies’ greatest fears – be they of revolutionary Haitians, women, or communists. In recent years the rise in the popularity of the zombie in films, books and television series reflects our fears for the planet, the economy, and of death itself

  3. Partial Evaluation of the Euclidian Algorithm

    DEFF Research Database (Denmark)

    Danvy, Olivier; Goldberg, Mayer

    1997-01-01

    -like behavior. Each of them presents a challenge for partial evaluation. The Euclidian algorithm is one of them, and in this article, we make it amenable to partial evaluation. We observe that the number of iterations in the Euclidian algorithm is bounded by a number that can be computed given either of the two...... arguments. We thus rephrase this algorithm using bounded recursion. The resulting program is better suited for automatic unfolding and thus for partial evaluation. Its specialization is efficient....

  4. 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.

  5. 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)

  6. 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,…

  7. 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.

  8. Dressing the dead body

    Directory of Open Access Journals (Sweden)

    Birgitta Nordström

    2016-12-01

    Full Text Available My current research focuses on textiles and rites, especially woven textiles for funerals and moments of loss. What active role can a textile such as an infant-wrapping cloth or a funeral pall play in the mourning process? This article will describe the development and current questions that address 1 the infant-wrapping cloth – the textile that is used to dress, clothe, or cover the dead body with particular attention to the question of infant mortality and the material practices of care. 2 The funeral pall that is used at funerals, draped over the coffin or as a body cover at hospital viewing rooms. One example to be presented is Kortedalakrönika (‘The Chronicle of Kortedala’, a collaborative project, woven for a church in Gothenburg. My work is based in artistic practice but opens up several scientific and existential questions.

  9. Dead of night.

    Science.gov (United States)

    Balter, Leon

    2010-07-01

    Dead of Night, the first psychoanalytic horror film, was produced in England in 1945, immediately after the end of World War II--that is, after the English population had suffered systematic Nazi terror from imminent invasion, incessant aerial bombing, and rocket-bombs. This film continued the prewar format of horror films based on themes of the supernatural and the hubris and excesses of science. However, it introduced psychoanalysis as the science in question. The film is structured on two levels: a genteel English country weekend to which witty and urbane guests have been invited; and five horror stories told by the guests. Psychoanalytic insights into this film structure are used here to explain how the film induces horror in the audience.

  10. 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

  11. 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...

  12. 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...

  13. Vivitron dead section pumping tests

    International Nuclear Information System (INIS)

    Heugel, J.; Bayet, J.P.; Brandt, C.; Delhomme, C.; Krieg, C.; Kustner, F.; Meiss, R.; Riehl, R.; Roth, C.; Schlewer, B.; Six, P.; Weber, A.

    1990-10-01

    Pumping tests have been conducted on a simulated accelerator dead section. The behavior of different pump types are compared and analyzed. Vacuum conditions to be expected in the Vivitron are reached and several parameters are verified. Selection of a pump for the Vivitron dead section is confirmed

  14. 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...

  15. 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.

  16. 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.

  17. 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

  18. 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.

  19. Youth in Dead End

    Directory of Open Access Journals (Sweden)

    Duygu TANRIKULU

    2011-01-01

    Full Text Available The primary factor to ensure economic and social development and also to build a healthy society is the education system which plays a significant role in human capital formation and shapes the social structure and its outputs. In this context, there are some risks threatening the youth that is trying to position itself on the education-employment line and some critical areas in need of national policy intervention as well. Hence, by analyzing indicators on education and labor force, this study aims to reveal the amount of youth under risk and to identify these critical areas, while targeting to highlight the urgent need for policy development focusing on youth in dead end. Within the study, it is emphasized that the education system causes youth to face with the problems of access and quality, and that there is a significant amount of youth not in education and employment, while underlining the necessity of bringing especially this inactive youth in economy in addition to equipping with required qualifications for their active participation in social life. Thus, in order to hinder human capital loss additionally, there is policy need in two directions, as focusing on the education system to prevent new hopeless generations on the one hand, and on the inclusion of the disadvantaged youth on the other.

  20. And the Dead Remain Behind

    Directory of Open Access Journals (Sweden)

    Peter Read

    2013-08-01

    Full Text Available In most cultures the dead and their living relatives are held in a dialogic relationship. The dead have made it clear, while living, what they expect from their descendants. The living, for their part, wish to honour the tombs of their ancestors; at the least, to keep the graves of the recent dead from disrepair. Despite the strictures, the living can fail their responsibilities, for example, by migration to foreign countries. The peripatetic Chinese are one of the few cultures able to overcome the dilemma of the wanderer or the exile. With the help of a priest, an Australian Chinese migrant may summon the soul of an ancestor from an Asian grave to a Melbourne temple, where the spirit, though removed from its earthly vessel, will rest and remain at peace. Amongst cultures in which such practices are not culturally appropriate, to fail to honour the family dead can be exquisitely painful. Violence is the cause of most failure.

  1. Anthrax, People and Dead Hippos

    Centers for Disease Control (CDC) Podcasts

    2017-11-07

    Epidemiologist, Dr. Melissa Marx, discuses anthrax deaths in people who ate dead hippos.  Created: 11/7/2017 by National Center for Emerging and Zoonotic Infectious Diseases (NCEZID).   Date Released: 11/7/2017.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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

  7. 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

  8. 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

  9. 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

  10. 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

  11. 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.

  12. 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

  13. 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.)

  14. 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)

  15. 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.

  16. 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.

  17. Dead zone characteristics of a gas counter

    International Nuclear Information System (INIS)

    Nohtomi, Akihiro; Sakae, Takeji; Matoba, Masaru; Koori, Norihiko.

    1990-01-01

    The dead zone was recently defined as the product of dead length and dead time in order to describe the characteristics of the self-quenching streamer (SQS) mode of a gas counter. Investigation of the dead zone characteristics has been extended for the proportional and GM modes, and the measured dead zone has been compared with that of the SQS mode. Accurate values for the dead zone could be determined by means of a newly developed method with a pulse interval time to amplitude converter. Each operation mode indicates distinct dead zone characteristics. Properties of gas counters for high counting rates may be improved on the basis of measurements of the dead zone. (author)

  18. 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.

  19. 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)

  20. Deadly Choices empowering Indigenous Australians through social networking sites.

    Science.gov (United States)

    McPhail-Bell, Karen; Appo, Nathan; Haymes, Alana; Bond, Chelsea; Brough, Mark; Fredericks, Bronwyn

    2017-04-05

    The potential for health promotion through social networking sites (SNSs) is widely recognized. However, while health promotion prides itself in focusing on the social determinants of health, its partiality for persuading individuals to comply with health behaviours dominates the way health promotion utilizes SNSs. This paper contributes to an understanding of collaborative ways SNSs can work for health promotion agendas of self-determination and empowerment in an Indigenous Australia context. An ethnographic study was undertaken with Deadly Choices, an Indigenous-led health promotion initiative. The study involved participant observation of interactions on Deadly Choices SNSs between Deadly Choices and its online community members. Deadly Choices provides an example of SNSs providing a powerful tool to create a safe, inclusive and positive space for Indigenous people and communities to profile their healthy choices, according to Indigenous notions of health and identity. The study found five principles that underpin Deadly Choices' use of SNSs for health promotion. These are: create a dialogue; build community online and offline; incentivise healthy online engagement; celebrate Indigenous identity and culture; and prioritize partnerships. Deadly Choices SNSs empowers Indigenous people and communities to be health promoters themselves, which represents a power shift from health promotion practitioner to Indigenous people and communities and more broadly, an enactment of Indigenous self-determination on SNSs. Mainstream health promotion can learn from Indigenous health promotion practice regarding the use of SNSs for health promotion agendas. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  1. An Imperative Type Hierarchy with Partial Products

    DEFF Research Database (Denmark)

    Schwartzbach, Michael Ignatieff; Schmidt, Erik Meineche

    1989-01-01

    notation for defining recursive types, that is superior to traditional type sums and products. We show how the ordering on types extends to an ordering on types with invariants. We allow the use of least upper bounds in type definitions and show how to compute upper bounds of invariants.......A type hierarchy for a programming language defines an ordering on the types such that any application for small types may be reused for all larger types. The imperative facet makes this non-trivial; the straight-forward definitions will yield an inconsistent system. We introduce a new type...... constructor, the partial product, and show how to define a consistent hierarchy in the context of fully recursive types. A simple polymorphism is derived by introducing a notion of placeholder types. By extending the partial product types to include structural invariants we obtain a particularly appropriate...

  2. 7 CFR 322.29 - Dead bees.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 5 2010-01-01 2010-01-01 false Dead bees. 322.29 Section 322.29 Agriculture..., DEPARTMENT OF AGRICULTURE BEES, BEEKEEPING BYPRODUCTS, AND BEEKEEPING EQUIPMENT Importation and Transit of Restricted Articles § 322.29 Dead bees. (a) Dead bees imported into or transiting the United States must be...

  3. 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

  4. 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 ...

  5. 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

  6. 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.

  7. 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.

  8. 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.

  9. 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

  10. 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

  11. 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...

  12. 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.

  13. 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...

  14. 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....

  15. 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...

  16. 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....

  17. 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

  18. 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…

  19. 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...

  20. 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

  1. 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

  2. Electronic fingerprinting of the dead.

    Science.gov (United States)

    Rutty, G N; Stringer, K; Turk, E E

    2008-01-01

    To date, a number of methods exist for the capture of fingerprints from cadavers that can then be used in isolation as a primary method for the identification of the dead. We report the use of a handheld, mobile wireless unit used in conjunction with a personal digital assistant (PDA) device for the capture of fingerprints from the dead. We also consider a handheld single-digit fingerprint scanner that utilises a USB laptop connection for the electronic capture of cadaveric fingerprints. Both are single-operator units that, if ridge detail is preserved, can collect a 10-set of finger pad prints in approximately 45 and 90 s, respectively. We present our observations on the restrictions as to when such devices can be used with cadavers. We do, however, illustrate that the images are of sufficient quality to allow positive identification from finger pad prints of the dead. With the development of mobile, handheld, biometric, PDA-based units for the police, we hypothesize that, under certain circumstances, devices such as these could be used for the accelerated acquisition of fingerprint identification data with the potential for rapid near-patient identification in the future.

  3. 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.

  4. Are Brain Dead Individuals Dead? Grounds for Reasonable Doubt.

    Science.gov (United States)

    Brugger, E Christian

    2016-06-01

    According to the biological definition of death, a human body that has not lost the capacity to holistically organize itself is the body of a living human individual. Reasonable doubt against the conclusion that it has lost the capacity exists when the body appears to express it and no evidence to the contrary is sufficient to rule out reasonable doubt against the conclusion that the apparent expression is a true expression (i.e., when the conclusion that what appears to be holistic organization is in fact holistic organization remains a reasonable explanatory hypothesis in light of the best evidence to the contrary). This essay argues that the evidence and arguments against the conclusion that the signs of complex bodily integration exhibited in ventilated brain dead bodies are true expressions of somatic integration are unpersuasive; that is, they are not adequate to exclude reasonable doubt against the conclusion that BD bodies are dead. Since we should not treat as corpses what for all we know might be living human beings, it follows that we have an obligation to treat BD individuals as if they were living human beings. © The Author 2016. Published by Oxford University Press, on behalf of the Journal of Medicine and Philosophy Inc. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

  5. Dead time of dual detector tools

    International Nuclear Information System (INIS)

    Czubek, J.A.

    1994-01-01

    A theory of the dead time for the dual detector nuclear tool with the analogue signal transmission is given in the paper. At least two different times exist in such tools: the dead time of detectors (for final computation they assumed identical to each other) and the dead time of the signal transmission set-up. A method of two radioactive sources is proposed to measure these two different dead times. When the times used for measuring every countrate needed in the dead time determination algorithm are taken into account, the statistical accuracy of the dead time determination can be obtained. These estimations are performed by the computer simulation method. Two codes have been designed: DEADT2D (DEAD Time for 2 Detectors) and DEADT2DS (DEAD Time for 2 Detectors with Statistics). The first code calculates the dead time based on the recorded countrates only, the second is doing a 'simulation job' and provides information on the statistical distribution of the observed dead times. The theory and the numerical solutions were checked both by the simulation calculations and by the experiments performed with the ODSN-102 tool (the experiments were performed by T. Zorski). (Author)

  6. 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...

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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)

  13. 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.

  14. 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.

  15. 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)

  16. 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

  17. 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.

  18. 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.

  19. 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.

  20. 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.

  1. 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...

  2. 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....

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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)

  8. 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.

  9. 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.

  10. 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.

  11. Personal Identity and Resurrection from the Dead

    Directory of Open Access Journals (Sweden)

    Gasparov Igor

    2017-04-01

    Full Text Available The paper examines arguments of the “Christian materialist” Trenton Merricks that he provided in support of the claim that the Christian doctrine of resurrection from the dead is compatible with the materialist understanding of the nature of human beings. In his paper The Resurrection of the Body, Merricks discussed two aspects of the materialist interpretation of the traditional religious doctrine of the bodily resurrection. On the one hand, he analyses and tries to overcome objections against the possibility of the general resurrection in case the materialist understanding of the nature of human personality should be true (mainly the problem of the temporal gap. On the other hand, he provides some reasons why the materialist understanding of human nature is more relevant than its dualist counterpart to the doctrine of the bodily resurrection. The present paper evaluates his arguments and discusses the suggestion that the doctrine of resurrection is not only compatible with materialism, but is also tenable if human beings are identical with their physical bodies. The conclusion of the paper is that Merricks’ apologetic arguments achieve their aims in defending the doctrine of resurrection only partially; the resurrection doctrine appears more tenable if we accept the dualistic conception of human nature.

  12. Coincidence-counting corrections for accidental coincidences, set dead time and intrinsic dead time

    International Nuclear Information System (INIS)

    Wyllie, H.A.

    1998-01-01

    An equation is derived for calculating the radioactivity of a source from the results of coincidence counting, taking into account dead-time losses and accidental coincidences. The corrections allow for the extension of the set dead time in the p channel by the intrinsic dead time. Experimental verification shows improvement over a previous equation. (author)

  13. 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

  14. 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.

  15. ppcor: An R Package for a Fast Calculation to Semi-partial Correlation Coefficients.

    Science.gov (United States)

    Kim, Seongho

    2015-11-01

    Lack of a general matrix formula hampers implementation of the semi-partial correlation, also known as part correlation, to the higher-order coefficient. This is because the higher-order semi-partial correlation calculation using a recursive formula requires an enormous number of recursive calculations to obtain the correlation coefficients. To resolve this difficulty, we derive a general matrix formula of the semi-partial correlation for fast computation. The semi-partial correlations are then implemented on an R package ppcor along with the partial correlation. Owing to the general matrix formulas, users can readily calculate the coefficients of both partial and semi-partial correlations without computational burden. The package ppcor further provides users with the level of the statistical significance with its test statistic.

  16. 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)

  17. Raising the Dead without a Red Sea-Dead Sea project? Hydro-economics and governance

    Directory of Open Access Journals (Sweden)

    D. E. Rosenberg

    2011-04-01

    Full Text Available Seven decades of extractions have dramatically reduced Jordan River flows, lowered the Dead Sea level, opened sink holes, and caused other environmental problems. The fix Jordan, Israel, and the Palestinians propose would build an expensive multipurpose conveyance project from the Red Sea to the Dead Sea that would also generate hydropower and desalinate water. This paper compares the Red-Dead project to alternatives that may also raise the Dead Sea level. Hydro-economic model results for the Jordan-Israel-Palestinian inter-tied water systems show two restoration alternatives are more economically viable than the proposed Red-Dead project. Many decentralized new supply, wastewater reuse, conveyance, conservation, and leak reduction projects and programs in each country can together increase economic benefits and reliably deliver up to 900 MCM yr−1 to the Dead Sea. Similarly, a smaller Red-Dead project that only generates hydropower can deliver large flows to the Dead Sea when the sale price of generated electricity is sufficiently high. However, for all restoration options, net benefits fall and water scarcity rises as flows to the Dead Sea increase. This finding suggests (i each country has no individual incentive to return water to the Dead Sea, and (ii outside institutions that seek to raise the Dead must also offer countries direct incentives to deliver water to the Sea besides building the countries new infrastructure.

  18. 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....

  19. 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.

  20. 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)

  1. 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.

  2. 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

  3. 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...

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. Determination of detection equipment dead time

    International Nuclear Information System (INIS)

    Sacha, J.

    1980-01-01

    A method is described of determining dead time by short-lived source measurement. It is based on measuring the sample count rates in different time intervals when only dead time correction is changed with the changing count of recorded pulses. The dead time may be determined from the measured values by a numerical-graphical method. The method is described. The advantage of the method is the minimization of errors and inaccuracies; the disadvantage is that the half-life of the source used should very accurately be known. (J.P.)

  9. Measurement of the Dead-Time in a Multichannel Analyser

    DEFF Research Database (Denmark)

    Mortensen, L.; Olsen, J.

    1973-01-01

    By means of two simple measurements three different dead-times are determined: the normal dead-time, a dead-time coming from the pile-up, and a dead-time due to the finite width of the timing pulses.......By means of two simple measurements three different dead-times are determined: the normal dead-time, a dead-time coming from the pile-up, and a dead-time due to the finite width of the timing pulses....

  10. 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.

  11. 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...

  12. 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…

  13. 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 (...

  14. 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...

  15. 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

  16. Dead pixel replacement in LWIR microgrid polarimeters.

    Science.gov (United States)

    Ratliff, Bradley M; Tyo, J Scott; Boger, James K; Black, Wiley T; Bowers, David L; Fetrow, Matthew P

    2007-06-11

    LWIR imaging arrays are often affected by nonresponsive pixels, or "dead pixels." These dead pixels can severely degrade the quality of imagery and often have to be replaced before subsequent image processing and display of the imagery data. For LWIR arrays that are integrated with arrays of micropolarizers, the problem of dead pixels is amplified. Conventional dead pixel replacement (DPR) strategies cannot be employed since neighboring pixels are of different polarizations. In this paper we present two DPR schemes. The first is a modified nearest-neighbor replacement method. The second is a method based on redundancy in the polarization measurements.We find that the redundancy-based DPR scheme provides an order-of-magnitude better performance for typical LWIR polarimetric data.

  17. 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.

  18. Another method of dead time correction

    International Nuclear Information System (INIS)

    Sabol, J.

    1988-01-01

    A new method of the correction of counting losses caused by a non-extended dead time of pulse detection systems is presented. The approach is based on the distribution of time intervals between pulses at the output of the system. The method was verified both experimentally and by using the Monte Carlo simulations. The results show that the suggested technique is more reliable and accurate than other methods based on a separate measurement of the dead time. (author) 5 refs

  19. Landsliding in partially saturated materials

    Science.gov (United States)

    Godt, J.W.; Baum, R.L.; Lu, N.

    2009-01-01

    [1] Rainfall-induced landslides are pervasive in hillslope environments around the world and among the most costly and deadly natural hazards. However, capturing their occurrence with scientific instrumentation in a natural setting is extremely rare. The prevailing thinking on landslide initiation, particularly for those landslides that occur under intense precipitation, is that the failure surface is saturated and has positive pore-water pressures acting on it. Most analytic methods used for landslide hazard assessment are based on the above perception and assume that the failure surface is located beneath a water table. By monitoring the pore water and soil suction response to rainfall, we observed shallow landslide occurrence under partially saturated conditions for the first time in a natural setting. We show that the partially saturated shallow landslide at this site is predictable using measured soil suction and water content and a novel unified effective stress concept for partially saturated earth materials. Copyright 2009 by the American Geophysical Union.

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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...

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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...

  11. 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

  12. 9 CFR 314.8 - Dead animal carcasses.

    Science.gov (United States)

    2010-01-01

    ... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Dead animal carcasses. 314.8 Section... Dead animal carcasses. (a) With the exception of dead livestock which have died en route and are received with livestock for slaughter at an official establishment, no dead animal or part of the carcass...

  13. 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

  14. 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

  15. Virtually Dead: Digital Public Mortuary Archaeology

    Directory of Open Access Journals (Sweden)

    Howard Williams

    2015-12-01

    Full Text Available Over recent decades, the ethics, politics and public engagements of mortuary archaeology have received sustained scrutiny, including how we handle, write about and display the archaeological dead. Yet the burgeoning use of digital media to engage different audiences in the archaeology of death and burial have so far escaped attention. This article explores categories and strategies by which digital media create virtual communities engaging with mortuary archaeology. Considering digital public mortuary archaeology (DPMA as a distinctive theme linking archaeology, mortality and material culture, we discuss blogs, vlogs and Twitter as case studies to illustrate the variety of strategies by which digital media can promote, educate and engage public audiences with archaeological projects and research relating to death and the dead in the human past. The article then explores a selection of key critical concerns regarding how the digital dead are currently portrayed, identifying the need for further investigation and critical reflection on DPMA’s aims, objectives and aspired outcomes.

  16. Dead sea transform fault system reviews

    CERN Document Server

    Garfunkel, Zvi; Kagan, Elisa

    2014-01-01

    The Dead Sea transform is an active plate boundary connecting the Red Sea seafloor spreading system to the Arabian-Eurasian continental collision zone. Its geology and geophysics provide a natural laboratory for investigation of the surficial, crustal and mantle processes occurring along transtensional and transpressional transform fault domains on a lithospheric scale and related to continental breakup. There have been many detailed and disciplinary studies of the Dead Sea transform fault zone during the last?20 years and this book brings them together.This book is an updated comprehensive coverage of the knowledge, based on recent studies of the tectonics, structure, geophysics, volcanism, active tectonics, sedimentology and paleo and modern climate of the Dead Sea transform fault zone. It puts together all this new information and knowledge in a coherent fashion.

  17. Foehn-induced effects on local dust pollution, frontal clouds and solar radiation in the Dead Sea valley

    Science.gov (United States)

    Kishcha, Pavel; Starobinets, Boris; Savir, Amit; Alpert, Pinhas; Kaplan, Michael

    2018-06-01

    Despite the long history of investigation of foehn phenomena, there are few studies of the influence of foehn winds on air pollution and none in the Dead Sea valley. For the first time the foehn phenomenon and its effects on local dust pollution, frontal cloudiness and surface solar radiation were analyzed in the Dead Sea valley, as it occurred on 22 March 2013. This was carried out using both numerical simulations and observations. The foehn winds intensified local dust emissions, while the foehn-induced temperature inversion trapped dust particles beneath this inversion. These two factors caused extreme surface dust concentration in the western Dead Sea valley. The dust pollution was transported by west winds eastward, to the central Dead Sea valley, where the speed of these winds sharply decreased. The transported dust was captured by the ascending airflow contributing to the maximum aerosol optical depth (AOD) over the central Dead Sea valley. On the day under study, the maximum surface dust concentration did not coincide with the maximum AOD: this being one of the specific effects of the foehn phenomenon on dust pollution in the Dead Sea valley. Radar data showed a passage of frontal cloudiness through the area of the Dead Sea valley leading to a sharp drop in noon solar radiation. The descending airflow over the downwind side of the Judean Mountains led to the formation of a cloud-free band followed by only the partial recovery of solar radiation because of the extreme dust pollution caused by foehn winds.

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. 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

  3. 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

  4. Partial Cancellation

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Partial Cancellation. Full Cancellation is desirable. But complexity requirements are enormous. 4000 tones, 100 Users billions of flops !!! Main Idea: Challenge: To determine which cross-talker to cancel on what “tone” for a given victim. Constraint: Total complexity is ...

  5. 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.

  6. 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.

  7. 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.

  8. 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

  9. 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.

  10. 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.

  11. 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.

  12. 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

  13. 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.)

  14. 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.)

  15. 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...

  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. 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 .....

  18. 32 CFR 632.4 - Deadly force.

    Science.gov (United States)

    2010-07-01

    ..., is substantially important to national security. (See paragraph (b) of this section.) (iii) Escape of... security or an essential national defense mission. (2) Substantially important to national security based... INVESTIGATIONS USE OF FORCE BY PERSONNEL ENGAGED IN LAW ENFORCEMENT AND SECURITY DUTIES § 632.4 Deadly force. (a...

  19. Bibliography on dead-time effects

    International Nuclear Information System (INIS)

    1975-01-01

    A BIPM (Bureau International des Poids et Mesures) Working Party has assembled a bibliography of the publications dealing with the measurement of dead times, the evaluation of the corresponding corrections and of other closely related subjects. It contains some 350 references, each of which is given with its full title; an author index is added. The search has been stopped in August 1975

  20. Dinosaurs of India: Dead but Alive

    Indian Academy of Sciences (India)

    Table of contents. Dinosaurs of India: Dead but Alive · Fossils · Evolution and O2 PAL · The Science in Dinosaurs · Origin/ Extinction of Dinosaurs · PowerPoint Presentation · India –94my + 50my · Icehouse /Greenhouse through time · Global Mean Annual Temperature Distributions at 100 my · Global Mean Annual ...

  1. Tunnel Diode Discriminator with Fixed Dead Time

    DEFF Research Database (Denmark)

    Diamond, J. M.

    1965-01-01

    A solid state discriminator for the range 0.4 to 10 V is described. Tunnel diodes are used for the discriminator element and in a special fixed dead time circuit. An analysis of temperature stability is presented. The regulated power supplies are described, including a special negative resistance...

  2. Unethical and Deadly Symbiosis in Higher Education

    Science.gov (United States)

    Crumbley, D. Larry; Flinn, Ronald; Reichelt, Kenneth J.

    2012-01-01

    As administrators are pressured to increase retention rates in accounting departments, and higher education in general, a deadly symbiosis is occurring. Most students and parents only wish for high grades, so year after year many educators engage in unethical grade inflation and course work deflation. Since administrators use the students to audit…

  3. Partial processing

    International Nuclear Information System (INIS)

    1978-11-01

    This discussion paper considers the possibility of applying to the recycle of plutonium in thermal reactors a particular method of partial processing based on the PUREX process but named CIVEX to emphasise the differences. The CIVEX process is based primarily on the retention of short-lived fission products. The paper suggests: (1) the recycle of fission products with uranium and plutonium in thermal reactor fuel would be technically feasible; (2) it would, however, take ten years or more to develop the CIVEX process to the point where it could be launched on a commercial scale; (3) since the majority of spent fuel to be reprocessed this century will have been in storage for ten years or more, the recycling of short-lived fission products with the U-Pu would not provide an effective means of making refabrication fuel ''inaccessible'' because the radioactivity associated with the fission products would have decayed. There would therefore be no advantage in partial processing

  4. Partial gigantism

    Directory of Open Access Journals (Sweden)

    М.М. Karimova

    2017-05-01

    Full Text Available A girl with partial gigantism (the increased I and II fingers of the left foot is being examined. This condition is a rare and unresolved problem, as the definite reason of its development is not determined. Wait-and-see strategy is recommended, as well as correcting operations after closing of growth zones, and forming of data pool for generalization and development of schemes of drug and radial therapeutic methods.

  5. 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

  6. Effect of counting system dead time on thyroid uptake measurements

    International Nuclear Information System (INIS)

    Simpkin, D.J.

    1984-01-01

    Equations are derived and the results of numerical calculations shown that illustrate the effect of counting system dead time on measured thyroid uptake of radioiodine. It is predicted that the observed uptake is higher than the true uptake due to system dead time. This is shown for both paralyzing and nonparalyzing dead time. The effect of increasing the administered activity is shown to increase the measured uptake, in a manner predicted by the paralyzable and nonparalyzable dead time models

  7. Dead Time in the LAr Calorimeter Front-End Readout

    CERN Document Server

    Gingrich, D M

    2002-01-01

    We present readout time, latency, buffering, and dead-time calculations for the switched capacitor array controllers of the LAr calorimeter. The dead time is compared with algorithms for the dead-time generation in the level-1 central trigger processor.

  8. The zero inflation of standing dead tree carbon stocks

    Science.gov (United States)

    Christopher W. Woodall; David W. MacFarlane

    2012-01-01

    Given the importance of standing dead trees in numerous forest ecosystem attributes/processes such as carbon (C) stocks, the USDA Forest Service’s Forest Inventory and Analysis (FIA) program began consistent nationwide sampling of standing dead trees in 1999. Modeled estimates of standing dead tree C stocks are currently used as the official C stock estimates for the...

  9. 14 CFR 1203b.106 - Use of deadly force.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Use of deadly force. 1203b.106 Section... AUTHORITY AND USE OF FORCE BY NASA SECURITY FORCE PERSONNEL § 1203b.106 Use of deadly force. Deadly force shall be used only in those circumstances where the security force officer reasonably believes that...

  10. 10 CFR 1047.7 - Use of deadly force.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 4 2010-01-01 2010-01-01 false Use of deadly force. 1047.7 Section 1047.7 Energy DEPARTMENT OF ENERGY (GENERAL PROVISIONS) LIMITED ARREST AUTHORITY AND USE OF FORCE BY PROTECTIVE FORCE OFFICERS General Provisions § 1047.7 Use of deadly force. (a) Deadly force means that force which a...

  11. Perturbative search for dead-end CFTs

    International Nuclear Information System (INIS)

    Nakayama, Yu

    2015-01-01

    To explore the possibility of self-organized criticality, we look for CFTs without any relevant scalar deformations (a.k.a. dead-end CFTs) within power-counting renormalizable quantum field theories with a weakly coupled Lagrangian description. In three dimensions, the only candidates are pure (Abelian) gauge theories, which may be further deformed by Chern-Simons terms. In four dimensions, we show that there are infinitely many non-trivial candidates based on chiral gauge theories. Using the three-loop beta functions, we compute the gap of scaling dimensions above the marginal value, and it can be as small as O(10"−"5) and robust against the perturbative corrections. These classes of candidates are very weakly coupled and our perturbative conclusion seems difficult to refute. Thus, the hypothesis that non-trivial dead-end CFTs do not exist is likely to be false in four dimensions.

  12. Potential Evaporite Biomarkers from the Dead Sea

    Science.gov (United States)

    Morris, Penny A.; Wentworth, Susan J.; Thomas-Keprta, Kathie; Allen, Carlton C.; McKay, David S.

    2001-01-01

    The Dead Sea is located on the northern branch of the African-Levant Rift systems. The rift system, according to one model, was formed by a series of strike slip faults, initially forming approximately two million years ago. The Dead Sea is an evaporite basin that receives freshwater from springs and from the Jordan River. The Dead Sea is different from other evaporite basins, such as the Great Salt Lake, in that it possesses high concentrations of magnesium and has an average pH of 6.1. The dominant cation in the Great Salt Lake is sodium, and the pH is 7.7. Calcium concentrations are also higher in the Dead Sea than in the Great Salt Lake. Both basins are similar in that the dominant anion is chlorine and the salinity levels are approximately 20 %. Other common cations that have been identified from the waters of the Dead Sea and the Great Salt Lake include sodium and potassium. A variety of Archea, Bacteria, and a single genus of a green algal, Dunaliella, has been described from the Dead Sea. Earlier studies concentrated on microbial identification and analysis of their unique physiology that allows them to survive in this type of extreme environment. Potential microbial fossilization processes, microbial fossils, and the metallic ions associated with fossilization have not been studied thoroughly. The present study is restricted to identifying probable microbial morphologies and associated metallic ions. XRD (X Ray Diffraction) analysis indicates the presence of halite, quartz, and orthoclase feldspar. In addition to these minerals, other workers have reported potassium chloride, magnesium bromide, magnesium chloride, calcium chloride, and calcium sulfate. Halite, calcium sulfate, and orthoclase were examined in this report for the presence of microbes, microbially induced deposits or microbial alteration. Neither the gypsum nor the orthoclase surfaces possesses any obvious indications of microbial life or fossilization. The sand-sized orthoclase particles are

  13. Visualization of deuterium dead layer by atom probe tomography

    KAUST Repository

    Gemma, Ryota

    2012-12-01

    The first direct observation, by atom probe tomography, of a deuterium dead layer is reported for Fe/V multilayered film loaded with D solute atoms. The thickness of the dead layers was measured to be 0.4-0.5 nm. The dead layers could be distinguished from chemically intermixed layers. The results suggest that the dead layer effect occurs even near the interface of the mixing layers, supporting an interpretation that the dead layer effect cannot be explained solely by electronic charge transfer but also involves a modulation of rigidity. © 2012 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

  14. Visualization of deuterium dead layer by atom probe tomography

    KAUST Repository

    Gemma, Ryota; Al-Kassab, Talaat; Kirchheim, Reiner; Pundt, Astrid A.

    2012-01-01

    The first direct observation, by atom probe tomography, of a deuterium dead layer is reported for Fe/V multilayered film loaded with D solute atoms. The thickness of the dead layers was measured to be 0.4-0.5 nm. The dead layers could be distinguished from chemically intermixed layers. The results suggest that the dead layer effect occurs even near the interface of the mixing layers, supporting an interpretation that the dead layer effect cannot be explained solely by electronic charge transfer but also involves a modulation of rigidity. © 2012 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

  15. 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.

  16. 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

  17. 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.

  18. 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

  19. 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...

  20. 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.

  1. 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.

  2. 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

  3. 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)

  4. 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

  5. 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.

  6. Nonlinear dead water resistance at subcritical speed

    Science.gov (United States)

    Grue, John

    2015-08-01

    The dead water resistance F 1 = /1 2 C d w ρ S U 2 (ρ fluid density, U ship speed, S wetted body surface, Cdw resistance coefficient) on a ship moving at subcritical speed along the upper layer of a two-layer fluid is calculated by a strongly nonlinear method assuming potential flow in each layer. The ship dimensions correspond to those of the Polar ship Fram. The ship draught, b0, is varied in the range 0.25h0-0.9h0 (h0 the upper layer depth). The calculations show that Cdw/(b0/h0)2 depends on the Froude number only, in the range close to critical speed, Fr = U/c0 ˜ 0.875-1.125 (c0 the linear internal long wave speed), irrespective of the ship draught. The function Cdw/(b0/h0)2 attains a maximum at subcritical Froude number depending on the draught. Maximum Cdw/(b0/h0)2 becomes 0.15 for Fr = 0.76, b0/h0 = 0.9, and 0.16 for Fr = 0.74, b0/h0 = 1, where the latter extrapolated value of the dead water resistance coefficient is about 60 times higher than the frictional drag coefficient and relevant for the historical dead water observations. The nonlinear Cdw significantly exceeds linear theory (Fr < 0.85). The ship generated waves have a wave height comparable to the upper layer depth. Calculations of three-dimensional wave patterns at critical speed compare well to available laboratory experiments. Upstream solitary waves are generated in a wave tank of finite width, when the layer depths differ, causing an oscillation of the force. In a wide ocean, a very wide wave system develops at critical speed. The force approaches a constant value for increasing time.

  7. 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.

  8. 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)

  9. 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.

  10. 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)

  11. 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.

  12. 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.

  13. 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

  14. 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

  15. 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.

  16. 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.

  17. Simple dead-time corrections for discrete time series of non-Poisson data

    International Nuclear Information System (INIS)

    Larsen, Michael L; Kostinski, Alexander B

    2009-01-01

    The problem of dead time (instrumental insensitivity to detectable events due to electronic or mechanical reset time) is considered. Most existing algorithms to correct for event count errors due to dead time implicitly rely on Poisson counting statistics of the underlying phenomena. However, when the events to be measured are clustered in time, the Poisson statistics assumption results in underestimating both the true event count and any statistics associated with count variability; the 'busiest' part of the signal is partially missed. Using the formalism associated with the pair-correlation function, we develop first-order correction expressions for the general case of arbitrary counting statistics. The results are verified through simulation of a realistic clustering scenario

  18. Asteroid 'Bites the Dust' Around Dead Star

    Science.gov (United States)

    2009-01-01

    NASA's Spitzer Space Telescope set its infrared eyes upon the dusty remains of shredded asteroids around several dead stars. This artist's concept illustrates one such dead star, or 'white dwarf,' surrounded by the bits and pieces of a disintegrating asteroid. These observations help astronomers better understand what rocky planets are made of around other stars. Asteroids are leftover scraps of planetary material. They form early on in a star's history when planets are forming out of collisions between rocky bodies. When a star like our sun dies, shrinking down to a skeleton of its former self called a white dwarf, its asteroids get jostled about. If one of these asteroids gets too close to the white dwarf, the white dwarf's gravity will chew the asteroid up, leaving a cloud of dust. Spitzer's infrared detectors can see these dusty clouds and their various constituents. So far, the telescope has identified silicate minerals in the clouds polluting eight white dwarfs. Because silicates are common in our Earth's crust, the results suggest that planets similar to ours might be common around other stars.

  19. Fungi colonizing dead leaves of herbs

    Directory of Open Access Journals (Sweden)

    Maria Kowalik

    2013-04-01

    Full Text Available The material was collected from the Botanical Garden and the Collegium Medicum Medicinal Plant Garden of the Jagiellonian University in Krakow. The investigated species were: lemon balm (Mellisa officinalis L., common lavender (Lavendula angustifolia Mill., horsemint (Mentha longifolia L., sage (Salvia officinalis L., sweet basil (Ocimum basilicum L., and wild marjoram (Origanum vulgare L.. The aim of the investigation was to identify fungi causing the death of leaf tissues of herbs from the mint family Lamiaceae. In mycological investigations, 180 fragments of each plant leaves (1,080 dead leaf fragments in total were placed in a 2% PDA medium. Over 970 colonies of fungi belonging to 48 species were isolated from the dead leaf tissues of the six herb species. Alternaria alternata (toxin-producing, Epicoccum nigrum and Sordaria fimicola were the most frequently isolated. The largest numbers of colonies and species of fungi were isolated from horsemint, while the lowest numbers were from wild marjoram leaves. It was shown that the death of leaves of selected herb species from the Lamiaceae family was caused by various fungi. The results of the mycological analysis confirmed the diversity of species colonizing the leaves of the herbs.

  20. Breathing Life Into Dead-Zones

    Directory of Open Access Journals (Sweden)

    Gressel Oliver

    2013-04-01

    Full Text Available The terrestrial planet formation regions of protoplanetary disks are generally sufficiently cold to be con- sidered non-magnetized and, consequently, dynamically inactive. However, recent investigations of these so-called “Dead-Zones” indicate the possibility that disks with strong mean radial temperature gradients can support instabilities associated with disk-normal gradients of the basic Keplerian shear profile. This process, known as the Goldreich-Schubert-Fricke (GSF instability, is the instability of short radial wavelength inertial modes and depends wholly on the presence of vertical gradients of the mean Keplerian (zonal flow. We report here high resolution fully nonlinear axisymmetric numerical studies of this instability and find a number of features including how, in the nonlinear saturated state, unstable discs become globally distorted, with strong vertical oscillations occurring at all radii due to local instability. We find that nonaxisymmetric numerical experiments are accompanied by significant amounts angular momentum transport (α ~ 0001. This instability should be operating in the Dead-Zones of protoplanetary disks at radii greater than 10-15 AU in minimum mass solar nebula models.

  1. A new G-M counter dead time model

    International Nuclear Information System (INIS)

    Lee, S.H.; Gardner, R.P.

    2000-01-01

    A hybrid G-M counter dead time model was derived by combining the idealized paralyzable and non-paralyzable models. The new model involves two parameters, which are the paralyzable and non-paralyzable dead times. The dead times used in the model are very closely related to the physical dead time of the G-M tube and its resolving time. To check the validity of the model, the decaying source method with 56 Mn was used. The corrected counting rates by the new G-M dead time model were compared with the observed counting rates obtained from the measurement and gave very good agreement within 5% up to 7x10 4 counts/s for a G-M tube with a dead time of about 300 μs

  2. Factors affecting fall down rates of dead aspen (Populus tremuloides) biomass following severe drought in west-central Canada.

    Science.gov (United States)

    Ted Hogg, Edward H; Michaelian, Michael

    2015-05-01

    Increases in mortality of trembling aspen (Populus tremuloides Michx.) have been recorded across large areas of western North America following recent periods of exceptionally severe drought. The resultant increase in standing, dead tree biomass represents a significant potential source of carbon emissions to the atmosphere, but the timing of emissions is partially driven by dead-wood dynamics which include the fall down and breakage of dead aspen stems. The rate at which dead trees fall to the ground also strongly influences the period over which forest dieback episodes can be detected by aerial surveys or satellite remote sensing observations. Over a 12-year period (2000-2012), we monitored the annual status of 1010 aspen trees that died during and following a severe regional drought within 25 study areas across west-central Canada. Observations of stem fall down and breakage (snapping) were used to estimate woody biomass transfer from standing to downed dead wood as a function of years since tree death. For the region as a whole, we estimated that >80% of standing dead aspen biomass had fallen after 10 years. Overall, the rate of fall down was minimal during the year following stem death, but thereafter fall rates followed a negative exponential equation with k = 0.20 per year. However, there was high between-site variation in the rate of fall down (k = 0.08-0.37 per year). The analysis showed that fall down rates were positively correlated with stand age, site windiness, and the incidence of decay fungi (Phellinus tremulae (Bond.) Bond. and Boris.) and wood-boring insects. These factors are thus likely to influence the rate of carbon emissions from dead trees following periods of climate-related forest die-off episodes. © 2014 Her Majesty the Queen in Right of Canada Global Change Biology © 2014 John Wiley & Sons Ltd Reproduced with the permission of the Minister of Natural Resources Canada.

  3. Dead time effects in laser Doppler anemometry measurements

    DEFF Research Database (Denmark)

    Velte, Clara Marika; Buchhave, Preben; George, William K.

    2014-01-01

    frequency range, starting around the cutoff frequency due to the finite size of the MV. Using computer-generated data mimicking the LDA data, these effects have previously been shown to appear due to the effect of dead time, i.e., the finite time during which the system is not able to acquire new...... measurements. These dead times can be traced back to the fact that the burst-mode LDA cannot measure more than one signal burst at a time. Since the dead time is approximately equal to the residence time for a particle traversing a measurement volume, we are dealing with widely varying dead times, which...

  4. The ecosystem service value of living versus dead biogenic reef

    Science.gov (United States)

    Sheehan, E. V.; Bridger, D.; Attrill, M. J.

    2015-03-01

    Mixed maerl beds (corralline red algae) comprise dead thalli with varying amounts of live maerl fragments, but previously it was not known whether the presence of the live maerl increases the ecosystem service 'habitat provision' of the dead maerl for the associated epibenthos. A 'flying array' towed sled with high definition video was used to film transects of the epibenthos in dead maerl and mixed maerl beds in two locations to the north and south of the English Channel (Falmouth and Jersey). Mixed maerl beds supported greater number of taxa and abundance than dead beds in Falmouth, while in Jersey, mixed and dead beds supported similar number of taxa and dead beds had a greater abundance of epifauna. Scallops tended to be more abundant on mixed beds than dead beds. Tube worms were more abundant on mixed beds in Falmouth and dead beds in Jersey. An increasing percentage occurrence of live maerl thalli correlated with increasing number of taxa in Falmouth but not Jersey. It was concluded that while live thalli can increase the functional role of dead maerl beds for the epibenthos, this is dependent on location and response variable. As a result of this work, maerl habitat in SE Jersey has been protected from towed demersal fishing gear.

  5. 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.

  6. 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...

  7. 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

  8. 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

  9. 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

  10. 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

  11. 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

  12. 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

  13. 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

  14. 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...

  15. 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

  16. 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.

  17. The prevalence and challenges of abandoned dead neonates in an ...

    African Journals Online (AJOL)

    parents/caregivers' attitudes toward dead neonates. Hospital-based postbereavement programs should be organized to ... Dead neonates at the Neonatal Intensive Care Units,. Pediatric Emergency Department, Pediatric Surgical .... interventions and newborn survival. Niger J Med 2006; 15:108–114. 3 Kalkofen RW. After a ...

  18. Dead wood inventory and assessment in South Korea

    Science.gov (United States)

    Jong-Su Yim; Rae Hyun Kim; Sun-Jeong Lee; Yeongmo. Son

    2015-01-01

    Dead wood (DW) plays a critical role not only in maintaining biodiversity but also in stocking carbon under UNFCCC. From the 5th national forest inventory (NFI5; 2006-2010) in South Korea, field data relevant to the DW including standing and downed dead trees by four decay class, etc. were collected. Based on the NFI5 data,...

  19. Quantifying carbon stores and decomposition in dead wood: A review

    Science.gov (United States)

    Matthew B. Russell; Shawn Fraver; Tuomas Aakala; Jeffrey H. Gove; Christopher W. Woodall; Anthony W. D’Amato; Mark J. Ducey

    2015-01-01

    The amount and dynamics of forest dead wood (both standing and downed) has been quantified by a variety of approaches throughout the forest science and ecology literature. Differences in the sampling and quantification of dead wood can lead to differences in our understanding of forests and their role in the sequestration and emissions of CO2, as...

  20. Dead time corrections using the backward extrapolation method

    Energy Technology Data Exchange (ETDEWEB)

    Gilad, E., E-mail: gilade@bgu.ac.il [The Unit of Nuclear Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105 (Israel); Dubi, C. [Department of Physics, Nuclear Research Center NEGEV (NRCN), Beer-Sheva 84190 (Israel); Geslot, B.; Blaise, P. [DEN/CAD/DER/SPEx/LPE, CEA Cadarache, Saint-Paul-les-Durance 13108 (France); Kolin, A. [Department of Physics, Nuclear Research Center NEGEV (NRCN), Beer-Sheva 84190 (Israel)

    2017-05-11

    Dead time losses in neutron detection, caused by both the detector and the electronics dead time, is a highly nonlinear effect, known to create high biasing in physical experiments as the power grows over a certain threshold, up to total saturation of the detector system. Analytic modeling of the dead time losses is a highly complicated task due to the different nature of the dead time in the different components of the monitoring system (e.g., paralyzing vs. non paralyzing), and the stochastic nature of the fission chains. In the present study, a new technique is introduced for dead time corrections on the sampled Count Per Second (CPS), based on backward extrapolation of the losses, created by increasingly growing artificially imposed dead time on the data, back to zero. The method has been implemented on actual neutron noise measurements carried out in the MINERVE zero power reactor, demonstrating high accuracy (of 1–2%) in restoring the corrected count rate. - Highlights: • A new method for dead time corrections is introduced and experimentally validated. • The method does not depend on any prior calibration nor assumes any specific model. • Different dead times are imposed on the signal and the losses are extrapolated to zero. • The method is implemented and validated using neutron measurements from the MINERVE. • Result show very good correspondence to empirical results.

  1. Simulation of Simple Controlled Processes with Dead-Time.

    Science.gov (United States)

    Watson, Keith R.; And Others

    1985-01-01

    The determination of closed-loop response of processes containing dead-time is typically not covered in undergraduate process control, possibly because the solution by Laplace transforms requires the use of Pade approximation for dead-time, which makes the procedure lengthy and tedious. A computer-aided method is described which simplifies the…

  2. COMPARATIVE ANALYSIS OF TECHNILOGIES OF CHITOSAN PRODUCTION FROM DEAD BEES

    Directory of Open Access Journals (Sweden)

    Marina Abramova

    2017-07-01

    Full Text Available Objective: The aim of this work is to study the characteristics of technology of chitosan obtaining from unconventional sources, namely from dead bees. Methods: The article considers three methods of chitosan obtaining from dead bees, namely the technology with the usage of dead bees with low degree of drying; the technology with the usage of dead bees with high degree of drying; the technology with the usage of dead bees with high degree of drying but without separation of deproteination and deacetylation stages. Results: It is proved that the technology with the usage of dead bees with high degree of drying but without separation of deproteination and deacetylation stages does not require high temperatures and long time. Yield of chitosan with the use of this technology is 21-24%. Discussion: The expediency of dead bees usage as raw material for the production of chitosan in Ukraine is shown. The technologies of chitosan obtaining from dead bees are compared, the most efficient one is chosen, which provide the highest yield of the finished product, so it is the most promising for the application in practice.

  3. On 0-Complete Partial Metric Spaces and Quantitative Fixed Point Techniques in Denotational Semantics

    Directory of Open Access Journals (Sweden)

    N. Shahzad

    2013-01-01

    Full Text Available In 1994, Matthews introduced the notion of partial metric space with the aim of providing a quantitative mathematical model suitable for program verification. Concretely, Matthews proved a partial metric version of the celebrated Banach fixed point theorem which has become an appropriate quantitative fixed point technique to capture the meaning of recursive denotational specifications in programming languages. In this paper we show that a few assumptions in statement of Matthews fixed point theorem can be relaxed in order to provide a quantitative fixed point technique useful to analyze the meaning of the aforementioned recursive denotational specifications in programming languages. In particular, we prove a new fixed point theorem for self-mappings between partial metric spaces in which the completeness has been replaced by 0-completeness and the contractive condition has been weakened in such a way that the new one best fits the requirements of practical problems in denotational semantics. Moreover, we provide examples that show that the hypothesis in the statement of our new result cannot be weakened. Finally, we show the potential applicability of the developed theory by means of analyzing a few concrete recursive denotational specifications, some of them admitting a unique meaning and others supporting multiple ones.

  4. Cascades of pile-up and dead time

    International Nuclear Information System (INIS)

    Pomme, S.

    2008-01-01

    Count loss through a cascade of pile-up and dead time is studied. Time interval density-distribution functions and throughput factors are presented for counters with a series arrangement of pile-up and extending or non-extending dead time. A counter is considered, where an artificial dead time is imposed on every counted event, in order to control the length and type of dead time. For such a system, it is relatively easy to determine an average count-loss correction factor via a live-time clock gated by the imposed dead-time signal ('live-time mode'), or otherwise to apply a correction factor based on the inversion of the throughput function ('real-time mode'). However, these techniques do not account for additional loss through pulse pile-up. In this work, counting errors associated with neglecting cascade effects are calculated for measurements in live-time and real-time mode

  5. Measurement-based modeling of bromine chemistry in the boundary layer: 1. Bromine chemistry at the Dead Sea

    Science.gov (United States)

    Tas, E.; Peleg, M.; Pedersen, D. U.; Matveev, V.; Pour Biazar, A.; Luria, M.

    2006-12-01

    The Dead Sea is an excellent natural laboratory for the investigation of Reactive Bromine Species (RBS) chemistry, due to the high RBS levels observed in this area, combined with anthropogenic air pollutants up to several ppb. The present study investigated the basic chemical mechanism of RBS at the Dead Sea using a numerical one-dimensional chemical model. Simulations were based on data obtained from comprehensive measurements performed at sites along the Dead Sea. The simulations showed that the high BrO levels measured frequently at the Dead Sea could only partially be attributed to the highly concentrated Br- present in the Dead Sea water. Furthermore, the RBS activity at the Dead Sea cannot solely be explained by a pure gas phase mechanism. This paper presents a chemical mechanism which can account for the observed chemical activity at the Dead Sea, with the addition of only two heterogeneous processes: the "Bromine Explosion" mechanism and the heterogeneous decomposition of BrONO2. Ozone frequently dropped below a threshold value of ~1 to 2 ppbv at the Dead Sea evaporation ponds, and in such cases, O3 became a limiting factor for the production of BrOx (BrO+Br). The entrainment of O3 fluxes into the evaporation ponds was found to be essential for the continuation of RBS activity, and to be the main reason for the jagged diurnal pattern of BrO observed in the Dead Sea area, and for the positive correlation observed between BrO and O3 at low O3 concentrations. The present study has shown that the heterogeneous decomposition of BrONO2 has a great potential to affect the RBS activity in areas influenced by anthropogenic emissions, mainly due to the positive correlation between the rate of this process and the levels of NO2. Further investigation of the influence of the decomposition of BrONO2 may be especially important in understanding the RBS activity at mid-latitudes.

  6. Measurement-based modeling of bromine chemistry in the boundary layer: 1. Bromine chemistry at the Dead Sea

    Directory of Open Access Journals (Sweden)

    E. Tas

    2006-01-01

    Full Text Available The Dead Sea is an excellent natural laboratory for the investigation of Reactive Bromine Species (RBS chemistry, due to the high RBS levels observed in this area, combined with anthropogenic air pollutants up to several ppb. The present study investigated the basic chemical mechanism of RBS at the Dead Sea using a numerical one-dimensional chemical model. Simulations were based on data obtained from comprehensive measurements performed at sites along the Dead Sea. The simulations showed that the high BrO levels measured frequently at the Dead Sea could only partially be attributed to the highly concentrated Br− present in the Dead Sea water. Furthermore, the RBS activity at the Dead Sea cannot solely be explained by a pure gas phase mechanism. This paper presents a chemical mechanism which can account for the observed chemical activity at the Dead Sea, with the addition of only two heterogeneous processes: the "Bromine Explosion" mechanism and the heterogeneous decomposition of BrONO2. Ozone frequently dropped below a threshold value of ~1 to 2 ppbv at the Dead Sea evaporation ponds, and in such cases, O3 became a limiting factor for the production of BrOx (BrO+Br. The entrainment of O3 fluxes into the evaporation ponds was found to be essential for the continuation of RBS activity, and to be the main reason for the jagged diurnal pattern of BrO observed in the Dead Sea area, and for the positive correlation observed between BrO and O3 at low O3 concentrations. The present study has shown that the heterogeneous decomposition of BrONO2 has a great potential to affect the RBS activity in areas influenced by anthropogenic emissions, mainly due to the positive correlation between the rate of this process and the levels of NO2. Further investigation of the influence of the decomposition of BrONO2 may be especially important in understanding the RBS activity at mid-latitudes.

  7. 9 CFR 82.6 - Interstate movement of dead birds and dead poultry from a quarantined area.

    Science.gov (United States)

    2010-01-01

    ... provided in paragraph (b) of this section for dressed carcasses, dead birds and dead poultry, including any... poultry at the destination listed on the permit required by paragraph (a)(1) of this section. (b) Dressed... quarantined area only if: (1) The dressed carcasses are from birds or poultry that were slaughtered in a...

  8. Partial mortality in massive reef corals as an indicator of sediment stress on coral reefs

    International Nuclear Information System (INIS)

    Nugues, Maggy M.; Roberts, Callum M.

    2003-01-01

    Partial mortality and fission on colonies of four common massive coral species were examined at sites differing in their exposure to river sediments in St. Lucia, West Indies. Rates of partial mortality were higher close to the river mouths, where more sediments were deposited, than away from the rivers in two coral species. Frequency of fission showed no significant trend. The percent change in coral cover on reefs from 1995 to 1998 was negatively related to the rate of partial mortality estimated in 1998 in all species. This suggests that partial mortality rates could reflect longer-term temporal changes in coral communities. Similar conclusions could also be reached using a less precise measure and simply recording partial mortality on colonies as <50% and ≥50% dead tissue. We conclude that partial mortality in some species of massive reef corals, expressed as the amount of dead tissue per colony, could provide a rapid and effective means of detecting sediment stress on coral reefs

  9. Partial mortality in massive reef corals as an indicator of sediment stress on coral reefs

    Energy Technology Data Exchange (ETDEWEB)

    Nugues, Maggy M.; Roberts, Callum M

    2003-03-01

    Partial mortality and fission on colonies of four common massive coral species were examined at sites differing in their exposure to river sediments in St. Lucia, West Indies. Rates of partial mortality were higher close to the river mouths, where more sediments were deposited, than away from the rivers in two coral species. Frequency of fission showed no significant trend. The percent change in coral cover on reefs from 1995 to 1998 was negatively related to the rate of partial mortality estimated in 1998 in all species. This suggests that partial mortality rates could reflect longer-term temporal changes in coral communities. Similar conclusions could also be reached using a less precise measure and simply recording partial mortality on colonies as <50% and {>=}50% dead tissue. We conclude that partial mortality in some species of massive reef corals, expressed as the amount of dead tissue per colony, could provide a rapid and effective means of detecting sediment stress on coral reefs.

  10. The effects of passive humidifier dead space on respiratory variables in paralyzed and spontaneously breathing patients.

    Science.gov (United States)

    Campbell, R S; Davis, K; Johannigman, J A; Branson, R D

    2000-03-01

    ) to 59 +/- 11% (HME) (p < 0.05) and arterial partial pressure of carbon dioxide (PaCO2) increased from 43.2 +/- 8.5 mm Hg (HH) to 43.9 +/- 8.7 mm Hg (HHME) to 46.8 +/- 11 mm Hg (HME) (p < 0.05). There were no changes in respiratory frequency, tidal volume, minute volume, carbon dioxide production, or intrinsic positive end-expiratory pressure. These findings suggest that use of passive humidifiers with increased dead space is associated with increased VD/VT. In spontaneously breathing patients this is associated with an increase in respiratory rate and minute volume to maintain constant alveolar ventilation. In paralyzed patients this is associated with a small but statistically significant increase in PaCO2. Clinicians should be aware that each type of passive humidifier has inherent dead space characteristics. Passive humidifiers with high dead space may negatively impact the respiratory function of spontaneously breathing patients or carbon dioxide retention in paralyzed patients. When choosing a passive humidifier, the device with the smallest dead space, but which meets the desired moisture output requirements, should be selected.

  11. The deeper structure of the southern Dead Sea basin derived from neural network analysis of velocity and attenuation tomography

    Science.gov (United States)

    Braeuer, Benjamin; Haberland, Christian; Bauer, Klaus; Weber, Michael

    2014-05-01

    The Dead Sea basin is a pull-apart basin at the Dead Sea transform fault, the boundary between the African and the Arabian plates. Though the DSB has been studied for a long time, the available knowledge - based mainly on surface geology, drilling and seismic reflection surveys - gives only a partial picture of its shallow structure. Therefore, within the framework of the international DESIRE (DEad Sea Integrated REsearch) project, a dense temporary local seismological network was operated in the southern Dead Sea area. Within 18 month of recording 650 events were detected. In addition to an already published tomography study revealing the distribution of P velocities and the Vp/Vs ratios a 2D P-wave attenuation tomography (parameter Qp) was performed. The neural network technique of Self-organizing maps (SOM) is used for the joint interpretation of these three parameters (Vp, Vp/Vs, Qp). The resulting clusters in the petrophysical parameter space are assigned to the main lithological units below the southern part of the Dead Sea basin: (1) The basin sediments characterized by strong attenuation, high vp/vs ratios and low P velocities. (2) The pre-basin sediments characterized by medium to strong attenuation, low Vp/Vs ratios and medium P velocities. (3) The basement characterized by low to moderate attenuation, medium vp/vs ratios and high P velocities. Thus, the asymmetric southern Dead Sea basin is filled with basin sediments down to depth of 7 to 12 km. Below the basin sediments, the pre-basin sediments are extending to a depth between 13 and 18 km.

  12. Autopsies of the real: Resurrecting the dead

    Directory of Open Access Journals (Sweden)

    Valis, Noël

    2011-12-01

    Full Text Available The sense of the real, or the material—the dead body—as an inextricable part of the sacred does not disappear in the secular environment of the nineteenth and twentieth centuries. This article analyzes specific humanitarian narratives centered on the practice of autopsy and mummification, in which the traces of Catholicism act as a kind of spectral discourse of the imagination, where the real is configured in forms of the uncanny, the monstrous or the sacred.

    El sentido de lo real, de lo material —el cuerpo sin vida— como una inextricable parte de lo sagrado, no desaparece del ambiente secular de los siglos XIX y XX. En los relatos analizados en este artículo se estudia cómo en determinadas narrativas humanitarias centradas en la práctica de la autopsia y la momificación, las huellas del catolicismo actúan como una suerte de discurso espectral de la imaginación, en que lo real se configura en formas de lo siniestro, lo monstruoso o lo sagrado.

  13. 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...

  14. 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.

  15. 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.

  16. 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

  17. 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)

  18. 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.

  19. 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.

  20. 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‎

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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...

  6. 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.

  7. 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...

  8. 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.

  9. 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

  10. 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

  11. 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.

  12. 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...

  13. 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...

  14. 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 ...

  15. 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 ...

  16. 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.

  17. 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

  18. Recursive evaluation of space-time lattice Green's functions

    International Nuclear Information System (INIS)

    De Hon, Bastiaan P; Arnold, John M

    2012-01-01

    double the pulse width of the source signature to keep pulse distortion at bay. The GF time sequences can also be used for an efficient computation of discrete space-frequency LGFs, especially if one employs Aitken's δ 2 process for the acceleration of the convergence of the consecutive partial sums. (paper)

  19. 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.

  20. 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.

  1. Are We the Walking Dead? Burnout as Zombie Apocalypse.

    Science.gov (United States)

    Doolittle, Benjamin R

    2016-11-01

    The Walking Dead , one of the most popular television shows in recent history, uses the plot of a zombie apocalypse as a lens into exploring the human condition. Amidst a particularly dangerous moment, the show's hero references the human struggle to survive by remarking, " We are the walking dead." This offhand comment sheds light upon physicians' struggles in medicine, in particular the high prevalence of burnout and the challenge to cultivate compassion and meaning. This is an important question for our age and for our profession. Are we the walking dead? © 2016 Annals of Family Medicine, Inc.

  2. Dead-Time Generation in Six-Phase Frequency Inverter

    Directory of Open Access Journals (Sweden)

    Aurelijus Pitrėnas

    2016-06-01

    Full Text Available In this paper control of multi-phase induction drives is discussed. Structure of six-phase frequency inverter is examined. The article deals with dead-time generation circuits in six-phase frequency inverter for transistor control signals. Computer models of dead-time circuits is created using LTspice software package. Simulation results are compared with experimental results of the tested dead-time circuits. Parameters obtained in simulation results are close to the parameters obtained in experimental results.

  3. 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

  4. Dead zone area at the downstream flow of barrages

    Directory of Open Access Journals (Sweden)

    Mohamed F. Sauida

    2016-12-01

    Full Text Available Flow separation is a natural phenomenon encountered at some cases downstream of barrages. The main flow is divided into current and dead zone flows. The percentage area of dead zone flow must be taken into consideration downstream of barrages, due to its negative effect on flow characteristics. Experimental studies were conducted in the Hydraulic Research Institute (HRI, on a physical regulator model with five vents. Theoretically the separation zone is described as a part of an ellipse which is practically verified by plotting velocity vectors. The results show that the percentage area of dead zone to the area through length of separation depends mainly on the expansion ratio [channel width to width of opened vents], with maximum value of 81% for operated side gates. A statistical analysis was derived, to predict the percentage area of dead zone flow to the area through length of separation.

  5. Optimal linear filtering of Poisson process with dead time

    International Nuclear Information System (INIS)

    Glukhova, E.V.

    1993-01-01

    The paper presents a derivation of an integral equation defining the impulsed transient of optimum linear filtering for evaluation of the intensity of the fluctuating Poisson process with allowance for dead time of transducers

  6. Experimental dead-time distortions of Poisson processes

    International Nuclear Information System (INIS)

    Faraci, G.; Pennisi, A.R.; Consiglio Nazionale delle Ricerche, Catania

    1983-01-01

    In order to check the distortions, introduced by a non-extended dead time on the Poisson statistics, accurate experiments have been made in single channel counting. At a given measuring time, the dependence on the choice of the time origin and on the width of the dead time has been verified. An excellent agreement has been found between the theoretical expressions and the experimental curves. (orig.)

  7. The dead donor rule, voluntary active euthanasia, and capital punishment.

    Science.gov (United States)

    Coons, Christian; Levin, Noah

    2011-06-01

    We argue that the dead donor rule, which states that multiple vital organs should only be taken from dead patients, is justified neither in principle nor in practice. We use a thought experiment and a guiding assumption in the literature about the justification of moral principles to undermine the theoretical justification for the rule. We then offer two real world analogues to this thought experiment, voluntary active euthanasia and capital punishment, and argue that the moral permissibility of terminating any patient through the removal of vital organs cannot turn on whether or not the practice violates the dead donor rule. Next, we consider practical justifications for the dead donor rule. Specifically, we consider whether there are compelling reasons to promulgate the rule even though its corresponding moral principle is not theoretically justified. We argue that there are no such reasons. In fact, we argue that promulgating the rule may actually decrease public trust in organ procurement procedures and medical institutions generally - even in states that do not permit capital punishment or voluntary active euthanasia. Finally, we examine our case against the dead donor rule in the light of common arguments for it. We find that these arguments are often misplaced - they do not support the dead donor rule. Instead, they support the quite different rule that patients should not be killed for their vital organs.

  8. Dead wood for biodiversity - foresters torn between mistrust and commitment

    International Nuclear Information System (INIS)

    Deuffic, Philippe

    2010-01-01

    Dead wood is a key element in forest biodiversity, which is used as one of the indicators for sustainable development of forests. A survey was conducted among foresters and users in the Landes de Gascogne and ile-de-France areas so as to assess practises and social representations associated with dead wood. From the results of the survey, it appears that there is a diversity of practices and divergences about the implications connected with dead wood. The 64 respondents can be divided into roughly six groups (G1: 'industrial foresters', G2: the 'silvicultural foresters', G3: the 'remote foresters', G4: the 'environmentalist foresters', G5: the 'naturalists' and G6: the 'users'). Among other things, they can be differentiated by their management practises, their degree of knowledge about and concern with ecology, their social networks, their aesthetic judgment, their perception of risks and their economic requirements. While underscoring the scarce popularity on average of the biodiversity-related issues, this sociological survey also highlights: the need for a minimal regulatory framework to achieve integrated retention of dead wood, the serious concern of forest managers in the Landes with plant health risks associated with dead wood, and the need for a functional justification for keeping dead wood in the ecosystem. (authors)

  9. Modeling decay rates of dead wood in a neotropical forest.

    Science.gov (United States)

    Hérault, Bruno; Beauchêne, Jacques; Muller, Félix; Wagner, Fabien; Baraloto, Christopher; Blanc, Lilian; Martin, Jean-Michel

    2010-09-01

    Variation of dead wood decay rates among tropical trees remains one source of uncertainty in global models of the carbon cycle. Taking advantage of a broad forest plot network surveyed for tree mortality over a 23-year period, we measured the remaining fraction of boles from 367 dead trees from 26 neotropical species widely varying in wood density (0.23-1.24 g cm(-3)) and tree circumference at death time (31.5-272.0 cm). We modeled decay rates within a Bayesian framework assuming a first order differential equation to model the decomposition process and tested for the effects of forest management (selective logging vs. unexploited), of mode of death (standing vs. downed) and of topographical levels (bottomlands vs. hillsides vs. hilltops) on wood decay rates. The general decay model predicts the observed remaining fraction of dead wood (R2 = 60%) with only two biological predictors: tree circumference at death time and wood specific density. Neither selective logging nor local topography had a differential effect on wood decay rates. Including the mode of death into the model revealed that standing dead trees decomposed faster than downed dead trees, but the gain of model accuracy remains rather marginal. Overall, these results suggest that the release of carbon from tropical dead trees to the atmosphere can be simply estimated using tree circumference at death time and wood density.

  10. Exercising is like flogging a dead horse

    International Nuclear Information System (INIS)

    Molhoek, W.

    2003-01-01

    - FR (NPP Gravelines) was conducted (22-23th of May 2001). The main objectives of the INEX series of exercises were focused on: decision making based on limited information and uncertain plant conditions; the use of real time communications with actual equipment and procedures; public information and interaction with media; the use of real weather for real time forecasts. For real further improvement of (nuclear) emergency management and response, not only national and international exercises such as INEX, CONVEX, JINEX etc. are needed, but the efforts to improve personal performance of key-persons involved is crucial. Structural plans to train and exercise individuals and teams should therefore be developed as well. To move the dead horse and create a racehorse need a lot of personal skills and attention. It is also recognized that often the carrot is better than the whip. (author)

  11. Options for reducing HIV transmission related to the dead space in needles and syringes.

    Science.gov (United States)

    Zule, William A; Pande, Poonam G; Otiashvili, David; Bobashev, Georgiy V; Friedman, Samuel R; Gyarmathy, V Anna; Des Jarlais, Don C

    2018-01-15

    When shared by people who inject drugs, needles and syringes with different dead space may affect the probability of HIV and hepatitis C virus (HCV) transmission differently. We measured dead space in 56 needle and syringe combinations obtained from needle and syringe programs across 17 countries in Europe and Asia. We also calculated the amounts of blood and HIV that would remain in different combinations following injection and rinsing. Syringe barrel capacities ranged from 0.5 to 20 mL. Needles ranged in length from 8 to 38 mm. The average dead space was 3 μL in low dead space syringes with permanently attached needles, 13 μL in high dead space syringes with low dead space needles, 45 μL in low dead space syringes with high dead space needles, and 99 μL in high dead space syringes with high dead space needles. Among low dead space designs, calculated volumes of blood and HIV viral burden were lowest for low dead space syringes with permanently attached needles and highest for low dead space syringes with high dead space needles. The dead space in different low dead space needle and syringe combinations varied substantially. To reduce HIV transmission related to syringe sharing, needle and syringe programs need to combine this knowledge with the needs of their clients.

  12. A method for the measurement of the intrinsic dead time of a counting system

    International Nuclear Information System (INIS)

    Wyllie, H.A.

    1989-01-01

    Equations are derived for (a) the determination of the intrinsic dead time of a counting system in the components preceding the paralysis unit which imposes the set dead time, and (b) a more accurate correction of count rates in a single-channel system, taking into account the extension of the set dead time by the intrinsic dead time. (author)

  13. 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....

  14. 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.

  15. 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

  16. 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.

  17. 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

  18. 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.

  19. 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.

  20. 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.

  1. 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...

  2. 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

  3. 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.

  4. 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

  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. 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.

  9. 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...

  10. 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.

  11. 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...

  12. 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

  13. 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

  14. Partial tooth gear bearings

    Science.gov (United States)

    Vranish, John M. (Inventor)

    2010-01-01

    A partial gear bearing including an upper half, comprising peak partial teeth, and a lower, or bottom, half, comprising valley partial teeth. The upper half also has an integrated roller section between each of the peak partial teeth with a radius equal to the gear pitch radius of the radially outwardly extending peak partial teeth. Conversely, the lower half has an integrated roller section between each of the valley half teeth with a radius also equal to the gear pitch radius of the peak partial teeth. The valley partial teeth extend radially inwardly from its roller section. The peak and valley partial teeth are exactly out of phase with each other, as are the roller sections of the upper and lower halves. Essentially, the end roller bearing of the typical gear bearing has been integrated into the normal gear tooth pattern.

  15. 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.

  16. Assessment and management of dead-wood habitat

    Science.gov (United States)

    Hagar, Joan

    2007-01-01

    The Bureau of Land Management (BLM) is in the process of revising its resource management plans for six districts in western and southern Oregon as the result of the settlement of a lawsuit brought by the American Forest Resource Council. A range of management alternatives is being considered and evaluated including at least one that will minimize reserves on O&C lands. In order to develop the bases for evaluating management alternatives, the agency needs to derive a reasonable range of objectives for key issues and resources. Dead-wood habitat for wildlife has been identified as a key resource for which decision-making tools and techniques need to be refined and clarified. Under the Northwest Forest Plan, reserves were to play an important role in providing habitat for species associated with dead wood (U.S. Department of Agriculture Forest Service and U.S. Department of the Interior Bureau of Land Management, 1994). Thus, the BLM needs to: 1) address the question of how dead wood will be provided if reserves are not included as a management strategy in the revised Resource Management Plan, and 2) be able to evaluate the effects of alternative land management approaches. Dead wood has become an increasingly important conservation issue in managed forests, as awareness of its function in providing wildlife habitat and in basic ecological processes has dramatically increased over the last several decades (Laudenslayer et al., 2002). A major concern of forest managers is providing dead wood habitat for terrestrial wildlife. Wildlife in Pacific Northwest forests have evolved with disturbances that create large amounts of dead wood; so, it is not surprising that many species are closely associated with standing (snags) or down, dead wood. In general, the occurrence or abundance of one-quarter to one-third of forest-dwelling vertebrate wildlife species, is strongly associated with availability of suitable dead-wood habitat (Bunnell et al., 1999; Rose et al., 2001). In

  17. Net carbon flux of dead wood in forests of the Eastern US.

    Science.gov (United States)

    Woodall, C W; Russell, M B; Walters, B F; D'Amato, A W; Fraver, S; Domke, G M

    2015-03-01

    Downed dead wood (DDW) in forest ecosystems is a C pool whose net flux is governed by a complex of natural and anthropogenic processes and is critical to the management of the entire forest C pool. As empirical examination of DDW C net flux has rarely been conducted across large scales, the goal of this study was to use a remeasured inventory of DDW C and ancillary forest attributes to assess C net flux across forests of the Eastern US. Stocks associated with large fine woody debris (diameter 2.6-7.6 cm) decreased over time (-0.11 Mg ha(-1) year(-1)), while stocks of larger-sized coarse DDW increased (0.02 Mg ha(-1) year(-1)). Stocks of total DDW C decreased (-0.14 Mg ha(-1) year(-1)), while standing dead and live tree stocks both increased, 0.01 and 0.44 Mg ha(-1) year(-1), respectively. The spatial distribution of DDW C stock change was highly heterogeneous with random forests model results indicating that management history, live tree stocking, natural disturbance, and growing degree days only partially explain stock change. Natural disturbances drove substantial C transfers from the live tree pool (≈-4 Mg ha(-1) year(-1)) to the standing dead tree pool (≈3 Mg ha(-1) year(-1)) with only a minimal increase in DDW C stocks (≈1 Mg ha(-1) year(-1)) in lower decay classes, suggesting a delayed transfer of C to the DDW pool. The assessment and management of DDW C flux is complicated by the diversity of natural and anthropogenic forces that drive their dynamics with the scale and timing of flux among forest C pools remaining a large knowledge gap.

  18. 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...

  19. 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

  20. 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…

  1. Essays on partial retirement

    NARCIS (Netherlands)

    Kantarci, T.

    2012-01-01

    The five essays in this dissertation address a range of topics in the micro-economic literature on partial retirement. The focus is on the labor market behavior of older age groups. The essays examine the economic and non-economic determinants of partial retirement behavior, the effect of partial

  2. Accuracy in gamma spectrometry: Pileup, dead time, and fast electornics

    International Nuclear Information System (INIS)

    Lindstrom, R.M.

    1993-01-01

    An important source of inaccuracy in neutron activation analysis is the nonlinear throughput of the counting system, especially at high counting rates. Losses, due to the finite time needed for events to happen, occur in all parts of the spectrometer system: the germanium detector crystal, preamplifier, amplifier, analog-digital converter (ADC), and MCA or computer. The slowest unbuffered units are the ADC and the amplifier, followed by the crystal. Even with modern fast electronics, losses can be important, although compensating circuits can greatly improve accuracy if they are used correctly. The ADC dead time is less of a problem than it was a decade ago. For example, a modern successive-approximation ADC in the author's laboratory takes 6 μs to digitize a gamma ray in the middle of an 8192-channel spectrum, compared with 60 μs for the Wilkinson device that it replaced. Dead-time circuits in MCAs for many years have compensated very well for this dead time. Pulse pileup is as important as ADC dead time. Random coincidence, the accidental arrival of the signal from two nonrelated gamma rays at the amplifier in a time short compared to the shaping time, results in a composite pulse that distorts the spectrum. For accurate spectrometry, each such random-sum pulse should be excluded from the spectrum (pileup rejection), and the system dead time must be adjusted to compensate for the time the system is busy analyzing this rejected event (pileup live-time correction)

  3. The Dead Sea, The Lake and Its Setting

    Science.gov (United States)

    Brink, Uri ten

    I cannot think of a subject more befitting the description of interdisciplinary research with societal relevance than the study of the Dead Sea, a terminal lake of the Jordan River in Israel and Jordan. The scientific study of the Dead Sea is intimately connected with politics, religion, archeology, economic development, tourism, and environmental change.The Dead Sea is a relatively closed geologic and limnologic system with drastic physical changes often occurring on human timescales and with a long human history to observe these changes. Research in this unique area covers diverse aspects such as active subsidence and deformation along strike-slip faults; vertical stratification and stability of the water column; physical properties of extremely saline and dense (1234 kg/m3) water; spontaneous precipitation of minerals in an oversaturated environment; origin of the unusual chemical composition of the brine; existence of life in extreme environments; use of lake level fluctuations as a paleoclimatic indicator; and effects on the environment of human intervention versus natural climatic variability. Although the Dead Sea covers a small area on a global scale, it is nevertheless one of the largest natural laboratories for these types of research on Earth. These reasons make the Dead Sea a fascinating topic for the curious mind.

  4. Once upon a time... Dead wood in french forests

    International Nuclear Information System (INIS)

    Bartoli, Michel; Geny, Bernard

    2005-01-01

    For many centuries in France, dead wood was an essential source of energy for households. Harvesting dead wood was both authorised - in particular, through allocation of rights of use - and highly regulated. Restrictions on its employment were established by texts ranging from the 1515 royal decree to an implementation decree of 1853 that is still applicable today - its owner must have formally released the wood. It must be dry and lying on the ground. It can be broken only by hand and no means other than human labour can be used to transport it. Furthermore, it cannot be the outcome of an act that caused a stem to dry while standing. In the 19. century, the huge number of trials, some of which went as far as the supreme court, shows just how important dead wood was socially, and much coveted by the paupers who were confronted with increasingly repressive forest police. These trials provide an excellent reflection of a society that harvested all the proceeds of felling. From the end of the 18. century to the middle of the 20., forestry treatises always dealt with removal of dead trees as a priority. Dead wood was for a long time and up to very recently abhorred but latterly has begun to be considered as an important compartment of biodiversity. History shows that it is no surprise that for the time being there is little of it to be found in our forests. (authors)

  5. 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.

  6. Thermodynamic analysis of a Stirling engine including regenerator dead volume

    Energy Technology Data Exchange (ETDEWEB)

    Puech, Pascal; Tishkova, Victoria [Universite de Toulouse, UPS, CNRS, CEMES, 29 rue Jeanne Marvig, F-31055 Toulouse (France)

    2011-02-15

    This paper provides a theoretical investigation on the thermodynamic analysis of a Stirling engine with linear and sinusoidal variations of the volume. The regenerator in a Stirling engine is an internal heat exchanger allowing to reach high efficiency. We used an isothermal model to analyse the net work and the heat stored in the regenerator during a complete cycle. We show that the engine efficiency with perfect regeneration doesn't depend on the regenerator dead volume but this dead volume strongly amplifies the imperfect regeneration effect. An analytical expression to estimate the improvement due to the regenerator has been proposed including the combined effects of dead volume and imperfect regeneration. This could be used at the very preliminary stage of the engine design process. (author)

  7. Resonant power converter comprising adaptive dead-time control

    DEFF Research Database (Denmark)

    2017-01-01

    The invention relates in a first aspect to a resonant power converter comprising: a first power supply rail for receipt of a positive DC supply voltage and a second power supply rail for receipt of a negative DC supply voltage. The resonant power converter comprises a resonant network with an input...... terminal for receipt of a resonant input voltage from a driver circuit. The driver circuit is configured for alternatingly pulling the resonant input voltage towards the positive and negative DC supply voltages via first and second semiconductor switches, respectively, separated by intervening dead......-time periods in accordance with one or more driver control signals. A dead-time controller is configured to adaptively adjusting the dead-time periods based on the resonant input voltage....

  8. Love letters to the dead: resurrecting an epistolary art.

    Science.gov (United States)

    Lander, Dorothy A; Graham-Pole, John R

    This article explores the art of letter-writing, specifically to our beloved dead, as a form of autoethnographic research, pedagogy, and care work. As university teachers and qualitative researchers in palliative and end-of-life care, we review the literature and history of epistolary communications with the deceased, as a prelude to writing our own letters. John writes to his long-dead mother and Dorothy to her recently deceased spouse Patrick, each letter followed by a reflective dialogue between us. Through this dialogue, we highlight the potential application of this art, or handcraft, to formal and informal palliative care, and the implications for practice, pedagogy, policy, and research. We propose that such direct, non-mediated, communications can offer a valuable form of healing for bereaved people. The therapeutic potential of letter writing and the abundance of literary and popular culture exemplars of responses from the dead are also largely unexplored in death education and research.

  9. Recurrent Partial Words

    Directory of Open Access Journals (Sweden)

    Francine Blanchet-Sadri

    2011-08-01

    Full Text Available Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words. Given an infinite partial word w, the number of distinct full words over the alphabet that are compatible with factors of w of length n, called subwords of w, refers to a measure of complexity of infinite partial words so-called subword complexity. This measure is of particular interest because we can construct partial words with subword complexities not achievable by full words. In this paper, we consider the notion of recurrence over infinite partial words, that is, we study whether all of the finite subwords of a given infinite partial word appear infinitely often, and we establish connections between subword complexity and recurrence in this more general framework.

  10. 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.

  11. 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.

  12. 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

  13. 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.

  14. 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 .

  15. 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.

  16. 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.

  17. 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

  18. 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.

  19. 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.

  20. Monitoring the Dead Sea Region by Multi-Parameter Stations

    Science.gov (United States)

    Mohsen, A.; Weber, M. H.; Kottmeier, C.; Asch, G.

    2015-12-01

    The Dead Sea Region is an exceptional ecosystem whose seismic activity has influenced all facets of the development, from ground water availability to human evolution. Israelis, Palestinians and Jordanians living in the Dead Sea region are exposed to severe earthquake hazard. Repeatedly large earthquakes (e.g. 1927, magnitude 6.0; (Ambraseys, 2009)) shook the whole Dead Sea region proving that earthquake hazard knows no borders and damaging seismic events can strike anytime. Combined with the high vulnerability of cities in the region and with the enormous concentration of historical values this natural hazard results in an extreme earthquake risk. Thus, an integration of earthquake parameters at all scales (size and time) and their combination with data of infrastructure are needed with the specific aim of providing a state-of-the-art seismic hazard assessment for the Dead Sea region as well as a first quantitative estimate of vulnerability and risk. A strong motivation for our research is the lack of reliable multi-parameter ground-based geophysical information on earthquakes in the Dead Sea region. The proposed set up of a number of observatories with on-line data access will enable to derive the present-day seismicity and deformation pattern in the Dead Sea region. The first multi-parameter stations were installed in Jordan, Israel and Palestine for long-time monitoring. All partners will jointly use these locations. All stations will have an open data policy, with the Deutsches GeoForschungsZentrum (GFZ, Potsdam, Germany) providing the hard and software for real-time data transmission via satellite to Germany, where all partners can access the data via standard data protocols.

  1. Microbe Profile: Mycobacterium tuberculosis: Humanity's deadly microbial foe.

    Science.gov (United States)

    Gordon, Stephen V; Parish, Tanya

    2018-04-01

    Mycobacterium tuberculosis is an expert and deadly pathogen, causing the disease tuberculosis (TB) in humans. It has several notable features: the ability to enter non-replicating states for long periods and cause latent infection; metabolic remodelling during chronic infection; a thick, waxy cell wall; slow growth rate in culture; and intrinsic drug resistance and antibiotic tolerance. As a pathogen, M. tuberculosis has a complex relationship with its host, is able to replicate inside macrophages, and expresses diverse immunomodulatory molecules. M. tuberculosis currently causes over 1.8 million deaths a year, making it the world's most deadly human pathogen.

  2. Homer and the cult of the dead in Helladic times

    Directory of Open Access Journals (Sweden)

    Odysseus Tsagarakis

    1980-12-01

    Full Text Available This paper discusses the Homeric bothros (Odyssey X 517 ff. as a possible source of information for the ritual and function of various bothroi (grave pits which are considered to be an important archaeological source. It seems that the bothroi were, by their nature, best suited to a cult of the dead and served as altars. The paper also discusses the possible reasons for the existence of the cult and argues against the view that fear of the dead motivated the cult in Helladic times.

  3. Tourism development challenges on the Dead Sea shore

    Directory of Open Access Journals (Sweden)

    Wendt Jan A.

    2016-12-01

    Full Text Available The Dead Sea along with Jerusalem belongs to one of the most well-known spots visited by tourists in Israel. Because of many factors, such as the water level of the Dead Sea at a depth of 430 m b.s.l. (in 2015, average salinity of 26%, hot springs and many healing salts located there, it is a unique tourist attraction on a global level. Its attractiveness is heightened by its proximity to other sites of interest, such as the Jewish fortress at Masada, Jericho, Qumran, where the Dead Sea Scrolls were found, as well as Petra, Madaba and Al-Karak on the Jordanian side of the Dead Sea. High salinity and a microclimate create perfect conditions for the development of health resorts and medical tourism. Extracting healing salts from its waters for the needs of the chemical industry is important for both the economy and medical tourism. However, as a consequence of the agricultural and urban use of the waters of the River Jordan, which flows into the Dead Sea, a persistent decrease in the lake water level has been observed over the last century. This has created a number of economic and political issues. The problems which still have to be resolved are associated with the Red Sea-Dead Sea Conduit (Canal, the division of Jordan’s water resources, conservation of the unique reservoir of the Dead Sea and the threat of hindering the development of tourism within the region. The presentation of these issues is the main aim of this research paper. The study is based on the analysis of changes in tourism flows, results of research studies and the prognosis of changes in the water level of the Dead Sea. It presents an assessment of the effects of this phenomenon on the tourist economy. At the current level of tourism flows within the region, the tourist capacity of local beaches will be exceeded in areas where the most popular tourist resorts are located. Increased expenditure on development of tourism infrastructure in the coastal zone can also be observed

  4. Preparation of 'dead water' for low background liquid scintillation counting

    International Nuclear Information System (INIS)

    Morishima, Hiroshige; Koga, Taeko; Niwa, Takeo; Kawai, Hiroshi

    1987-01-01

    'Dead water', low level tritiated water is indispensable to measure tritium concentration in environmental waters using a low background liquid scintillation counter. Water produced by combustion of natural gas, or deep sea water etc. are usually used for the above purpose. A new method of reducing tritium concentration in natural water has been introduced for preparation of 'dead water'. This method is to combine hydrogen-oxygen mixture produced by water electrolysis with hopcalite catalyzer at 700 deg C. Deep well water was electrolized up to 2/3 volume, and tritium concentration of recombined water was reduced to be about one third of that of the original one. (author)

  5. Numerical methods for stochastic partial differential equations with white noise

    CERN Document Server

    Zhang, Zhongqiang

    2017-01-01

    This book covers numerical methods for stochastic partial differential equations with white noise using the framework of Wong-Zakai approximation. The book begins with some motivational and background material in the introductory chapters and is divided into three parts. Part I covers numerical stochastic ordinary differential equations. Here the authors start with numerical methods for SDEs with delay using the Wong-Zakai approximation and finite difference in time. Part II covers temporal white noise. Here the authors consider SPDEs as PDEs driven by white noise, where discretization of white noise (Brownian motion) leads to PDEs with smooth noise, which can then be treated by numerical methods for PDEs. In this part, recursive algorithms based on Wiener chaos expansion and stochastic collocation methods are presented for linear stochastic advection-diffusion-reaction equations. In addition, stochastic Euler equations are exploited as an application of stochastic collocation methods, where a numerical compa...

  6. Coincidence counting corrections for dead time losses and accidental coincidences

    International Nuclear Information System (INIS)

    Wyllie, H.A.

    1987-04-01

    An equation is derived for the calculation of the radioactivity of a source from the results of coincidence counting taking into account the dead-time losses and accidental coincidences. The derivation is an extension of the method of J. Bryant [Int. J. Appl. Radiat. Isot., 14:143, 1963]. The improvement on Bryant's formula has been verified by experiment

  7. Dead Zones in LX-17 and PBX 9502

    Energy Technology Data Exchange (ETDEWEB)

    Souers, P C; Andreski, H G; Batteux, J; Bratton, B; Cabacungan, C; Cook, III, C F; Fletcher, S; Garza, R; Grimsley, D; Handly, J; Hernandez, A; McMaster, P; Molitoris, J D; Palmer, R; Prindiville, J; Rodriguez, J; Schneberk, D; Wong, B; Vitello, P

    2005-09-06

    Pin and X-ray corner-turning data have been taken on ambient LX-17 and PBX 9052, and the results are listed in tables as an aid to future modeling. The results have been modeled at 4 zones/mm with a reactive flow approach that varies the burn rate as a function of pressure. A single rate format is used to simulate failure and detonation in different pressure regimes. A pressure cut-off must also be reached to initiate the burn. Corner-turning and failure are modeled using an intermediate pressure rate region, and detonation occurs at high pressure. The TATB booster is also modeled using reactive flow, and X-ray tomography is used to partition the ram-pressed hemisphere into five different density regions. The model reasonably fits the bare corner-turning experiment but predicts a smaller dead zone with steel confinement, in contradiction with experiment. The same model also calculates the confined and unconfined cylinder detonation velocities and predicts the failure of the unconfined cylinder at 3.75 mm radius. The PBX 9502 shows a smaller dead zone than LX-17. An old experiment that showed a large apparent dead zone in Comp B was repeated with X-ray transmission and no dead zone was seen. This confirms the idea that a variable burn rate is the key to modeling. The model also produces initiation delays, which are shorter than those found in time-to-detonation.

  8. Comparative structural analysis of human DEAD-box RNA helicases.

    Directory of Open Access Journals (Sweden)

    Patrick Schütz

    2010-09-01

    Full Text Available DEAD-box RNA helicases play various, often critical, roles in all processes where RNAs are involved. Members of this family of proteins are linked to human disease, including cancer and viral infections. DEAD-box proteins contain two conserved domains that both contribute to RNA and ATP binding. Despite recent advances the molecular details of how these enzymes convert chemical energy into RNA remodeling is unknown. We present crystal structures of the isolated DEAD-domains of human DDX2A/eIF4A1, DDX2B/eIF4A2, DDX5, DDX10/DBP4, DDX18/myc-regulated DEAD-box protein, DDX20, DDX47, DDX52/ROK1, and DDX53/CAGE, and of the helicase domains of DDX25 and DDX41. Together with prior knowledge this enables a family-wide comparative structural analysis. We propose a general mechanism for opening of the RNA binding site. This analysis also provides insights into the diversity of DExD/H- proteins, with implications for understanding the functions of individual family members.

  9. Assessment of biofuel potential of dead neem leaves ( Azadirachta ...

    African Journals Online (AJOL)

    Unfortunately, the lack of information on the biomass and energy potentials of these wastes empedes any initiative for its industrial biomethanization. This study was investigated with the aim of evaluating the biofuel potentials of dead neem leaves in Maroua town. The number of neem trees, as well as biomass produced by ...

  10. Remembering Important People On The Day Of The Dead

    Science.gov (United States)

    Curriculum Review, 2005

    2005-01-01

    This article describes a project that can help students learn more about historic figures-or remember lost loved ones--with this Day of the Dead project from Frida Kahlo and Diego Rivera. The purpose is to remember the wonderful things the person did, and to celebrate his or her life. Directions for construction, as well as a suggested list of…

  11. Necrotizing fasciitis: A deadly disease | Cree | East and Central ...

    African Journals Online (AJOL)

    Background: Knowledge of the diagnosis, cause, course and required treatment of this deadly disease among physicians and surgeons around the world is limited. Methods: A study was undertaken at University Teaching Hospital (UTH), Lusaka Zambia to review the incidence, associated pathology, management given, ...

  12. Dynamic optimization of dead-end membrane filtration

    NARCIS (Netherlands)

    Blankert, B.; Betlem, Bernardus H.L.; Roffel, B.; Marquardt, Wolfgang; Pantelides, Costas

    2006-01-01

    An operating strategy aimed at minimizing the energy consumption during the filtration phase of dead-end membrane filtration has been formulated. A method allowing fast calculation of trajectories is used to allow incorporation in a hierarchical optimization scheme. The optimal trajectory can be

  13. Comparison of burning characteristics of live and dead chaparral fuels

    Science.gov (United States)

    L. Sun; X. Zhou; S. Mahalingam; D.R. Weise

    2006-01-01

    Wildfire spread in living vegetation, such as chaparral in southern California, often causes significant damage to infrastructure and ecosystems. The effects of physical characteristics of fuels and fuel beds on live fuel burning and whether live fuels differ fundamentally from dead woody fuels in their burning characteristics are not well understood. Toward this end,...

  14. Comparative structural analysis of human DEAD-box RNA helicases.

    Science.gov (United States)

    Schütz, Patrick; Karlberg, Tobias; van den Berg, Susanne; Collins, Ruairi; Lehtiö, Lari; Högbom, Martin; Holmberg-Schiavone, Lovisa; Tempel, Wolfram; Park, Hee-Won; Hammarström, Martin; Moche, Martin; Thorsell, Ann-Gerd; Schüler, Herwig

    2010-09-30

    DEAD-box RNA helicases play various, often critical, roles in all processes where RNAs are involved. Members of this family of proteins are linked to human disease, including cancer and viral infections. DEAD-box proteins contain two conserved domains that both contribute to RNA and ATP binding. Despite recent advances the molecular details of how these enzymes convert chemical energy into RNA remodeling is unknown. We present crystal structures of the isolated DEAD-domains of human DDX2A/eIF4A1, DDX2B/eIF4A2, DDX5, DDX10/DBP4, DDX18/myc-regulated DEAD-box protein, DDX20, DDX47, DDX52/ROK1, and DDX53/CAGE, and of the helicase domains of DDX25 and DDX41. Together with prior knowledge this enables a family-wide comparative structural analysis. We propose a general mechanism for opening of the RNA binding site. This analysis also provides insights into the diversity of DExD/H- proteins, with implications for understanding the functions of individual family members.

  15. Dead Metaphor in Selected Advertisements in Nigerian Dailies ...

    African Journals Online (AJOL)

    Dead metaphors and images are often enlivened and empowered by advertisers to help their commUlzication and to achieve bewitching effects. It is interesting to see words and phrases that may be presumed to have been drained of their linguistic strength being brought back to currency and made to act fast in aiding ...

  16. Theory of precipitation effects on dead cylindrical fuels

    Science.gov (United States)

    Michael A. Fosberg

    1972-01-01

    Numerical and analytical solutions of the Fickian diffusion equation were used to determine the effects of precipitation on dead cylindrical forest fuels. The analytical solution provided a physical framework. The numerical solutions were then used to refine the analytical solution through a similarity argument. The theoretical solutions predicted realistic rates of...

  17. Skeletal muscle mitochondrial respiration in AMPKa2 kinase dead mice

    DEFF Research Database (Denmark)

    Larsen, Steen; Kristensen, Jonas Møller; Stride, Nis

    2012-01-01

    AIM: To study if the phenotypical characteristics (exercise intolerance; reduced spontaneous activity) of the AMPKa2 kinase-dead (KD) mice can be explained by a reduced mitochondrial respiratory flux rates (JO(2) ) in skeletal muscle. Secondly, the effect of the maturation process on JO(2...

  18. Dead space variability of face masks for valved holding chambers.

    Science.gov (United States)

    Amirav, Israel; Newhouse, Michael T

    2008-03-01

    Valved holding chambers with masks are commonly used to deliver inhaled medications to young children with asthma. Optimal mask properties such as their dead space volume have received little attention. The smaller the mask the more likely it is that a greater proportion of the dose in the VHC will be inhaled with each breath, thus speeding VHC emptying and improving overall aerosol delivery efficiency and dose. Masks may have different DSV and thus different performance. To compare both physical dead space and functional dead space of different face masks under various applied pressures. The DSV of three commonly used face masks of VHCs was measured by water displacement both under various pressures (to simulate real-life application, dynamic DSV) and under no pressure (static DSV). There was a great variability of both static and dynamic dead space among various face mask for VHCs, which is probably related to their flexibility. Different masks have different DSV characteristics. This variability should be taken into account when comparing the clinical efficacy of various VHCs.

  19. Eating the dead in Madagascar | Campbell | South African Medical ...

    African Journals Online (AJOL)

    They may be supported in societies under stress or in times of famine, to reflect aggression and antisocial behaviour (in cases where the bodies of enemies killed in battle or people who have harmed the family are eaten), or to honour a dead kinsman. It was, for example, noted in Madagascar during the imperial campaigns ...

  20. Syntactic Reconstruction and Reanalysis, Semantic Dead Ends, and Prefrontal Cortex

    DEFF Research Database (Denmark)

    Christensen, Ken Ramshøj

    2010-01-01

    have been to Paris than […] to Oslo), using pseudo-elliptical structures (‘dead ends’) as control (More people have been to Paris than I have). (ii) Reanalysis in the face of structural ambiguity in syntactic ‘garden paths’, where the parser initially assigns an incorrect structure and is forced...

  1. Dead wood in European beech (Fagus sylvatica) forest reserves

    NARCIS (Netherlands)

    Christensen, M.; Hahn, K.; Mountford, E.P.; Ódor, P.; Standovár, T.; Rozenbergar, D.; Diaci, J.; Wijdeven, S.M.J.; Meyer, P.; Winter, S.; Vrska, T.

    2005-01-01

    Data were analysed on the volume of dead wood in 86 beech forest reserves, covering most of the range of European beech forests. The mean volume was 130 m3/ha and the variation among reserves was high, ranging from almost nil to 550 m3/ha. The volume depended significantly on forest type, age since

  2. Stylistic Variation In Three English Translations Of The Dead Sea ...

    African Journals Online (AJOL)

    Since the discovery of the Dead Sea Scrolls in 1947 different English translations were published. In this article the stylistic variation of three of these translations are analysed. It is suggested that the issue of stylistic variation boils down to linguistically inscribed preference in the choice and construction of discourses in the ...

  3. Down dead wood statistics for Maine timberlands, 1995

    Science.gov (United States)

    Linda S. Heath; David C. Chojnacky; David C. Chojnacky

    2001-01-01

    Down dead wood (DDW) is important for its role in carbon and nutrient cycling, carbon sequestration, wildfire behavior, plant reproduction, and wildlife habitat. DDW was measured for the first time during a forest inventory of Maine by the USDA Forest Service in 1994-1996. Pieces greater than 3 feet long and greater than 3 inches in diameter at point of intersection...

  4. Literary Genres in Poetic Texts from the Dead Sea Scrolls

    Science.gov (United States)

    Pickut, William Douglas

    2017-01-01

    Among the texts of the Dead Sea Scrolls, there are four literary compositions that bear the superscriptional designations shir and mizmor. These designations correspond directly to superscriptional designations provided many times in both the now-canonical Psalter and the various witnesses to those texts unearthed at Qumran. On its face, this fact…

  5. Book Review Lifeblood: How to Change the World, One Dead ...

    African Journals Online (AJOL)

    Book Review Lifeblood: How to Change the World, One Dead Mosquito at a Time By Alex Perry (2011). Melissa Raemaekers. Abstract. Pp xiv + 219. R210. Picador Africa, Pan Macmillan, South Africa. 2011. ISBN 978-1-77010-146-3. February 2012, Vol. 102, No. 2 SAMJ. Full Text: EMAIL FREE FULL TEXT EMAIL FREE ...

  6. Cowboys and zombies: destabilizing patriarchal discourse in The Walking Dead

    NARCIS (Netherlands)

    Hassler-Forest, D.

    2012-01-01

    The serialized comic book The Walking Dead, written by Robert Kirkman and drawn by Charlie Adlard, has been published by Image Comics from October 2003, and is still being released in monthly instalments as of this writing. It has won numerous awards, including the prestigious Eisner Award for Best

  7. Gastric necrosis four years after fundoplication causing a dead foetus

    DEFF Research Database (Denmark)

    Thinggaard, Ebbe; Skovsen, Anders Peter; Kildsig, Jeppe

    2014-01-01

    A 31-year-old pregnant woman was admitted and treated for diabetic ketoacidosis. As the patient deteriorated and the viability of the foetus was uncertain a CT scan was done which showed free fluid and air intraabdominally. Surgery was performed. A dead foetus was delivered and a 2 × 5 cm necrotic...

  8. Real time damage detection using recursive principal components and time varying auto-regressive modeling

    Science.gov (United States)

    Krishnan, M.; Bhowmik, B.; Hazra, B.; Pakrashi, V.

    2018-02-01

    In this paper, a novel baseline free approach for continuous online damage detection of multi degree of freedom vibrating structures using Recursive Principal Component Analysis (RPCA) in conjunction with Time Varying Auto-Regressive Modeling (TVAR) is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal components online using rank-one perturbation method, followed by TVAR modeling of the first transformed response, to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/non-linear-states that indicate damage. Most of the works available in the literature deal with algorithms that require windowing of the gathered data owing to their data-driven nature which renders them ineffective for online implementation. Algorithms focussed on mathematically consistent recursive techniques in a rigorous theoretical framework of structural damage detection is missing, which motivates the development of the present framework that is amenable for online implementation which could be utilized along with suite experimental and numerical investigations. The RPCA algorithm iterates the eigenvector and eigenvalue estimates for sample covariance matrices and new data point at each successive time instants, using the rank-one perturbation method. TVAR modeling on the principal component explaining maximum variance is utilized and the damage is identified by tracking the TVAR coefficients. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data without requiring any baseline data. Numerical simulations performed on a 5-dof nonlinear system under white noise excitation and El Centro (also known as 1940 Imperial Valley earthquake) excitation, for different damage scenarios, demonstrate the robustness of the proposed algorithm. The method is further validated on results obtained from case studies involving

  9. The active structure of the Dead Sea depression

    Science.gov (United States)

    Shamir, G.

    2003-04-01

    The ~220km long gravitational and structural Dead Sea Depression (DSD), situated along the southern section of the Dead Sea Transform (DST), is centered by the Dead Sea basin sensu strictu (DSB), which has been described since the 1960?s as a pull-apart basin over a presumed left-hand fault step. However, several observations, or their lack thereof, question this scheme, e.g. (i) It is not supported by recent seismological and geomorphic data; (ii) It does not explain the fault pattern and mixed sinistral and dextral offset along the DSB western boundary; (iii) It does not simply explain the presence of intense deformation outside the presumed fault step zone; (iv) It is inconsistent with the orientation of seismically active faults within the Dead Sea and Jericho Valley; (v); It is apparently inconsistent with the symmetrical structure of the DSD; (vi) The length of the DSB exceeds the total offset along the Dead Sea Transform, while its subsidence is about the age of the DST. Integration of newly acquired and analyzed data (high resolution and petroleum seismic reflection data, earthquake relocation and fault plane solutions) with previously published data (structural mapping, fracture orientation distribution, Bouguer anomaly maps, sinkhole distribution, geomorphic lineaments) now shows that the active upper crustal manifestation of the DSD is a broad shear zone dominated by internal fault systems oriented NNE and NNW. These fault systems are identified by earthquake activity, seismic reflection observations, alignment of recent sinkholes, and distribution of Bouguer anomaly gradients. Motion on the NNE system is normal-dextral, suggesting that counterclockwise rotation may have taken place within the shear zone. The overall sinistral motion between the Arabian and Israel-Sinai plates along the DSD is thus accommodated by distributed shear across the N-S extending DSD. The three-dimensionality of this motion at the DSD may be related to the rate of convergence

  10. 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.

  11. The recursive combination filter approach of pre-processing for the estimation of standard deviation of RR series.

    Science.gov (United States)

    Mishra, Alok; Swati, D

    2015-09-01

    Variation in the interval between the R-R peaks of the electrocardiogram represents the modulation of the cardiac oscillations by the autonomic nervous system. This variation is contaminated by anomalous signals called ectopic beats, artefacts or noise which mask the true behaviour of heart rate variability. In this paper, we have proposed a combination filter of recursive impulse rejection filter and recursive 20% filter, with recursive application and preference of replacement over removal of abnormal beats to improve the pre-processing of the inter-beat intervals. We have tested this novel recursive combinational method with median method replacement to estimate the standard deviation of normal to normal (SDNN) beat intervals of congestive heart failure (CHF) and normal sinus rhythm subjects. This work discusses the improvement in pre-processing over single use of impulse rejection filter and removal of abnormal beats for heart rate variability for the estimation of SDNN and Poncaré plot descriptors (SD1, SD2, and SD1/SD2) in detail. We have found the 22 ms value of SDNN and 36 ms value of SD2 descriptor of Poincaré plot as clinical indicators in discriminating the normal cases from CHF cases. The pre-processing is also useful in calculation of Lyapunov exponent which is a nonlinear index as Lyapunov exponents calculated after proposed pre-processing modified in a way that it start following the notion of less complex behaviour of diseased states.

  12. An Introduction to Recursive Partitioning: Rationale, Application, and Characteristics of Classification and Regression Trees, Bagging, and Random Forests

    Science.gov (United States)

    Strobl, Carolin; Malley, James; Tutz, Gerhard

    2009-01-01

    Recursive partitioning methods have become popular and widely used tools for nonparametric regression and classification in many scientific fields. Especially random forests, which can deal with large numbers of predictor variables even in the presence of complex interactions, have been applied successfully in genetics, clinical medicine, and…

  13. "There and Back Again" in the Writing Classroom: A Graduate Student's Recursive Journey through Pedagogical Research and Theory Development

    Science.gov (United States)

    Mori, Miki

    2013-01-01

    This article discusses my (recursive) process of theory building and the relationship between research, teaching, and theory development for graduate students. It shows how graduate students can reshape their conceptual frameworks not only through course work, but also through researching classes they teach. Specifically, while analyzing the…

  14. Packet loss replacement in voip using a recursive low-order autoregressive modelbased speech

    International Nuclear Information System (INIS)

    Miralavi, Seyed Reza; Ghorshi, Seyed; Mortazavi, Mohammad; Choupan, Jeiran

    2011-01-01

    In real-time packet-based communication systems one major problem is misrouted or delayed packets which results in degraded perceived voice quality. When some speech packets are not available on time, the packet is known as lost packet in real-time communication systems. The easiest task of a network terminal receiver is to replace silence for the duration of lost speech segments. In a high quality communication system in order to avoid quality reduction due to packet loss a suitable method and/or algorithm is needed to replace the missing segments of speech. In this paper, we introduce a recursive low order autoregressive (AR) model for replacement of lost speech segment. The evaluation results show that this method has a lower mean square error (MSE) and low complexity compared to the other efficient methods like high-order AR model without any substantial degradation in perceived voice quality.

  15. TouchGrid: Touchpad pointing by recursively mapping taps to smaller display regions

    DEFF Research Database (Denmark)

    Hertzum, Morten; Hornbæk, Kasper

    2005-01-01

    Touchpad devices are widely used but lacking in pointing efficiency. The TouchGrid, an instance of what we term cell cursors, replaces moving the cursor through dragging the finger on a touchpad with tapping in different regions of the touchpad. The touchpad regions are recursively mapped...... to smaller display regions and thereby enable high-precision pointing without requiring high tapping precision. In an experiment, six subjects used the TouchGrid and a standard touchpad across different numbers of targets, distances to targets, and target widths. Whereas standard touchpad operation follows...... Fitts’ law, target selection time with the TouchGrid is a linear function of the required number of taps. The TouchGrid was significantly faster for small targets and for tasks requiring one tap, and marginally faster for two-tap tasks. Error rates tended to be higher with the TouchGrid than...

  16. 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.

  17. Efficient Implementation of the 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 typically the main computational effort at each iteration....... In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky...... factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver....

  18. Recursive thoughts on the simulation of the flexible multibody dynamics of slender offshore structures

    Science.gov (United States)

    Schilder, J.; Ellenbroek, M.; de Boer, A.

    2017-12-01

    In this work, the floating frame of reference formulation is used to create a flexible multibody model of slender offshore structures such as pipelines and risers. It is shown that due to the chain-like topology of the considered structures, the equation of motion can be expressed in terms of absolute interface coordinates. In the presented form, kinematic constraint equations are satisfied explicitly and the Lagrange multipliers are eliminated from the equations. Hence, the structures can be conveniently coupled to finite element or multibody models of for example seabed and vessel. The chain-like topology enables the efficient use of recursive solution procedures for both transient dynamic analysis and equilibrium analysis. For this, the transfer matrix method is used. In order to improve the convergence of the equilibrium analysis, the analytical solution of an ideal catenary is used as an initial configuration, reducing the number of required iterations.

  19. 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.

  20. Design of 2-D Recursive Filters Using Self-adaptive Mutation Differential Evolution Algorithm

    Directory of Open Access Journals (Sweden)

    Lianghong Wu

    2011-08-01

    Full Text Available This paper investigates a novel approach to the design of two-dimensional recursive digital filters using differential evolution (DE algorithm. The design task is reformulated as a constrained minimization problem and is solved by an Self-adaptive Mutation DE algorithm (SAMDE, which adopts an adaptive mutation operator that combines with the advantages of the DE/rand/1/bin strategy and the DE/best/2/bin strategy. As a result, its convergence performance is improved greatly. Numerical experiment results confirm the conclusion. The proposedSAMDE approach is effectively applied to test a numerical example and is compared with previous design methods. The computational experiments show that the SAMDE approach can obtain better results than previous design methods.

  1. A recursive algorithm for computing the inverse of the Vandermonde matrix

    Directory of Open Access Journals (Sweden)

    Youness Aliyari Ghassabeh

    2016-12-01

    Full Text Available The inverse of a Vandermonde matrix has been used for signal processing, polynomial interpolation, curve fitting, wireless communication, and system identification. In this paper, we propose a novel fast recursive algorithm to compute the inverse of a Vandermonde matrix. The algorithm computes the inverse of a higher order Vandermonde matrix using the available lower order inverse matrix with a computational cost of $ O(n^2 $. The proposed algorithm is given in a matrix form, which makes it appropriate for hardware implementation. The running time of the proposed algorithm to find the inverse of a Vandermonde matrix using a lower order Vandermonde matrix is compared with the running time of the matrix inversion function implemented in MATLAB.

  2. Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm. Chapter 5

    Science.gov (United States)

    Tilton, James C.; Plaza, Antonio J. (Editor); Chang, Chein-I. (Editor)

    2008-01-01

    The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

  3. Variable forgetting factor mechanisms for diffusion recursive least squares algorithm in sensor networks

    Science.gov (United States)

    Zhang, Ling; Cai, Yunlong; Li, Chunguang; de Lamare, Rodrigo C.

    2017-12-01

    In this work, we present low-complexity variable forgetting factor (VFF) techniques for diffusion recursive least squares (DRLS) algorithms. Particularly, we propose low-complexity VFF-DRLS algorithms for distributed parameter and spectrum estimation in sensor networks. For the proposed algorithms, they can adjust the forgetting factor automatically according to the posteriori error signal. We develop detailed analyses in terms of mean and mean square performance for the proposed algorithms and derive mathematical expressions for the mean square deviation (MSD) and the excess mean square error (EMSE). The simulation results show that the proposed low-complexity VFF-DRLS algorithms achieve superior performance to the existing DRLS algorithm with fixed forgetting factor when applied to scenarios of distributed parameter and spectrum estimation. Besides, the simulation results also demonstrate a good match for our proposed analytical expressions.

  4. Probabilistic forecasting of the solar irradiance with recursive ARMA and GARCH models

    DEFF Research Database (Denmark)

    David, M.; Ramahatana, F.; Trombe, Pierre-Julien

    2016-01-01

    Forecasting of the solar irradiance is a key feature in order to increase the penetration rate of solar energy into the energy grids. Indeed, the anticipation of the fluctuations of the solar renewables allows a better management of the production means of electricity and a better operation...... sky index show some similarities with that of financial time series. The aim of this paper is to assess the performances of a commonly used combination of two linear models (ARMA and GARCH) in econometrics in order to provide probabilistic forecasts of solar irradiance. In addition, a recursive...... regarding the statistical distribution of the error, the reliability of the probabilistic forecasts stands in the same order of magnitude as other works done in the field of solar forecasting....

  5. Estimation of the blood velocity spectrum using a recursive lattice filter

    DEFF Research Database (Denmark)

    Jensen, Jørgen Arendt; Buelund, Claus; Jørgensen, Allan

    1996-01-01

    acquired for showing the blood velocity distribution are inherently non-stationary, due to the pulsatility of the flow. All current signal processing schemes assume that the signal is stationary within the window of analysis, although this is an approximation. In this paper a recursive least......-stationarity are incorporated through an exponential decay factor, that sets the exponential horizon of the filter. A factor close to 1 gives a long horizon with low variance estimates, but can not track a highly non-stationary flow. Setting the factor is therefore a compromise between estimate variance and the filter...... with the actual distributions that always will be smooth. Setting the exponential decay factor to 0.99 gives satisfactory results for in-vivo data from the carotid artery. The filter can easily be implemented using a standard fixed-point signal processing chip for real-time processing...

  6. System Simulation by Recursive Feedback: Coupling a Set of Stand-Alone Subsystem Simulations

    Science.gov (United States)

    Nixon, D. D.

    2001-01-01

    Conventional construction of digital dynamic system simulations often involves collecting differential equations that model each subsystem, arran g them to a standard form, and obtaining their numerical gin solution as a single coupled, total-system simultaneous set. Simulation by numerical coupling of independent stand-alone subsimulations is a fundamentally different approach that is attractive because, among other things, the architecture naturally facilitates high fidelity, broad scope, and discipline independence. Recursive feedback is defined and discussed as a candidate approach to multidiscipline dynamic system simulation by numerical coupling of self-contained, single-discipline subsystem simulations. A satellite motion example containing three subsystems (orbit dynamics, attitude dynamics, and aerodynamics) has been defined and constructed using this approach. Conventional solution methods are used in the subsystem simulations. Distributed and centralized implementations of coupling have been considered. Numerical results are evaluated by direct comparison with a standard total-system, simultaneous-solution approach.

  7. The prostate cancer risk stratification (ProCaRS) project: Recursive partitioning risk stratification analysis

    International Nuclear Information System (INIS)

    Rodrigues, George; Lukka, Himu; Warde, Padraig; Brundage, Michael; Souhami, Luis; Crook, Juanita; Cury, Fabio; Catton, Charles; Mok, Gary; Martin, Andre-Guy; Vigneault, Eric; Morris, Jim; Warner, Andrew; Gonzalez Maldonado, Sandra; Pickles, Tom

    2013-01-01

    Background: The Genitourinary Radiation Oncologists of Canada (GUROC) published a three-group risk stratification (RS) system to assist prostate cancer decision-making in 2001. The objective of this project is to use the ProCaRS database to statistically model the predictive accuracy and clinical utility of a proposed new multi-group RS schema. Methods: The RS analyses utilized the ProCaRS database that consists of 7974 patients from four Canadian institutions. Recursive partitioning analysis (RPA) was utilized to explore the sub-stratification of groups defined by the existing three-group GUROC scheme. 10-fold cross-validated C-indices and the Net Reclassification Index were both used to assess multivariable models and compare the predictive accuracy of existing and proposed RS systems, respectively. Results: The recursive partitioning analysis has suggested that the existing GUROC classification system could be altered to accommodate as many as six separate and statistical unique groups based on differences in BFFS (C-index 0.67 and AUC 0.70). GUROC low-risk patients would be divided into new favorable-low and low-risk groups based on PSA ⩽6 and PSA >6. GUROC intermediate-risk patients can be subclassified into low-intermediate and high-intermediate groups. GUROC high-intermediate-risk is defined as existing GUROC intermediate-risk with PSA >=10 AND either T2b/c disease or T1T2a disease with Gleason 7. GUROC high-risk patients would be subclassified into an additional extreme-risk group (GUROC high-risk AND (positive cores ⩾87.5% OR PSA >30). Conclusions: Proposed RS subcategories have been identified by a RPA of the ProCaRS database

  8. Exact Calculation of the Thermodynamics of Biomacromolecules on Cubic Recursive Lattice.

    Science.gov (United States)

    Huang, Ran

    The thermodynamics of biomacromolecules featured as foldable polymer with inner-linkage of hydrogen bonds, e. g. protein, RNA and DNA, play an impressive role in either physical, biological, and polymer sciences. By treating the foldable chains to be the two-tolerate self-avoiding trails (2T polymer), abstract lattice modeling of these complex polymer systems to approach their thermodynamics and subsequent bio-functional properties have been developed for decades. Among these works, the calculations modeled on Bethe and Husimi lattice have shown the excellence of being exactly solvable. Our project extended this effort into the 3D situation, i.e. the cubic recursive lattice. The preliminary exploration basically confirmed others' previous findings on the planar structure, that we have three phases in the grand-canonical phase diagram, with a 1st order transition between non-polymerized and polymer phases, and a 2nd order transition between two distinguishable polymer phases. However the hydrogen bond energy J, stacking energy ɛ, and chain rigidity energy H play more vigorous effects on the thermal behaviors, and this is hypothesized to be due to the larger number of possible configurations provided by the complicated 3D model. By the so far progress, the calculation of biomacromolecules may be applied onto more complex recursive lattices, such as the inhomogeneous lattice to describe the cross-dimensional situations, and beside the thermal properties of the 2T polymers, we may infer some interesting insights of the mysterious folding problem itself. National Natural Science Foundation of China.

  9. Parameter Identification of Ship Maneuvering Models Using Recursive Least Square Method Based on Support Vector Machines

    Directory of Open Access Journals (Sweden)

    Man Zhu

    2017-03-01

    Full Text Available Determination of ship maneuvering models is a tough task of ship maneuverability prediction. Among several prime approaches of estimating ship maneuvering models, system identification combined with the full-scale or free- running model test is preferred. In this contribution, real-time system identification programs using recursive identification method, such as the recursive least square method (RLS, are exerted for on-line identification of ship maneuvering models. However, this method seriously depends on the objects of study and initial values of identified parameters. To overcome this, an intelligent technology, i.e., support vector machines (SVM, is firstly used to estimate initial values of the identified parameters with finite samples. As real measured motion data of the Mariner class ship always involve noise from sensors and external disturbances, the zigzag simulation test data include a substantial quantity of Gaussian white noise. Wavelet method and empirical mode decomposition (EMD are used to filter the data corrupted by noise, respectively. The choice of the sample number for SVM to decide initial values of identified parameters is extensively discussed and analyzed. With de-noised motion data as input-output training samples, parameters of ship maneuvering models are estimated using RLS and SVM-RLS, respectively. The comparison between identification results and true values of parameters demonstrates that both the identified ship maneuvering models from RLS and SVM-RLS have reasonable agreements with simulated motions of the ship, and the increment of the sample for SVM positively affects the identification results. Furthermore, SVM-RLS using data de-noised by EMD shows the highest accuracy and best convergence.

  10. Recursive SVM feature selection and sample classification for mass-spectrometry and microarray data

    Directory of Open Access Journals (Sweden)

    Harris Lyndsay N

    2006-04-01

    Full Text Available Abstract Background Like microarray-based investigations, high-throughput proteomics techniques require machine learning algorithms to identify biomarkers that are informative for biological classification problems. Feature selection and classification algorithms need to be robust to noise and outliers in the data. Results We developed a recursive support vector machine (R-SVM algorithm to select important genes/biomarkers for the classification of noisy data. We compared its performance to a similar, state-of-the-art method (SVM recursive feature elimination or SVM-RFE, paying special attention to the ability of recovering the true informative genes/biomarkers and the robustness to outliers in the data. Simulation experiments show that a 5 %-~20 % improvement over SVM-RFE can be achieved regard to these properties. The SVM-based methods are also compared with a conventional univariate method and their respective strengths and weaknesses are discussed. R-SVM was applied to two sets of SELDI-TOF-MS proteomics data, one from a human breast cancer study and the other from a study on rat liver cirrhosis. Important biomarkers found by the algorithm were validated by follow-up biological experiments. Conclusion The proposed R-SVM method is suitable for analyzing noisy high-throughput proteomics and microarray data and it outperforms SVM-RFE in the robustness to noise and in the ability to recover informative features. The multivariate SVM-based method outperforms the univariate method in the classification performance, but univariate methods can reveal more of the differentially expressed features especially when there are correlations between the features.

  11. Cross-validation and Peeling Strategies for Survival Bump Hunting using Recursive Peeling Methods

    Science.gov (United States)

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

    2015-01-01

    We introduce a framework to build a survival/risk bump hunting model with a censored time-to-event response. Our Survival Bump Hunting (SBH) method is based on a recursive peeling procedure that uses a specific survival peeling criterion derived from non/semi-parametric statistics such as the hazards-ratio, the log-rank test or the Nelson--Aalen estimator. To optimize the tuning parameter of the model and validate it, we introduce an objective function based on survival or prediction-error statistics, such as the log-rank test and the concordance error rate. We also describe two alternative cross-validation techniques adapted to the joint task of decision-rule making by recursive peeling and survival estimation. Numerical analyses show the importance of replicated cross-validation and the differences between criteria and techniques in both low and high-dimensional settings. Although several non-parametric survival models exist, none addresses the problem of directly identifying local extrema. We show how SBH efficiently estimates extreme survival/risk subgroups unlike other models. This provides an insight into the behavior of commonly used models and suggests alternatives to be adopted in practice. Finally, our SBH framework was applied to a clinical dataset. In it, we identified subsets of patients characterized by clinical and demographic covariates with a distinct extreme survival outcome, for which tailored medical interventions could be made. An R package PRIMsrc (Patient Rule Induction Method in Survival, Regression and Classification settings) is available on CRAN (Comprehensive R Archive Network) and GitHub. PMID:27034730

  12. Foraging behavior of pileated woodpeckers in partial cut and uncut bottomland hardwood forest

    Science.gov (United States)

    Newell, P.; King, Sammy L.; Kaller, Michael D.

    2009-01-01

    In bottomland hardwood forests, partial cutting techniques are increasingly advocated and used to create habitat for priority wildlife like Louisiana black bear (Ursus americanus luteolus), white-tailed deer (Odocoileus virginianus), and Neotropical migrants. Although partial cutting may be beneficial to some species, those that use dead wood may be negatively affected since large diameter and poor quality trees (deformed, moribund, or dead) are rare, but normally targeted for removal. On the other hand, partial cutting can create dead wood if logging slash is left on-site. We studied foraging behavior of pileated woodpeckers (Dryocopus pileatus) in one- and two-year-old partial cuts designed to benefit priority species and in uncut forest during winter, spring, and summer of 2006 and 2007 in Louisiana. Males and females did not differ in their use of tree species, dbh class, decay class, foraging height, use of foraging tactics or substrate types; however, males foraged on larger substrates than females. In both partial cut and uncut forest, standing live trees were most frequently used (83% compared to 14% for standing dead trees and 3% for coarse woody debris); however, dead trees were selected (i.e. used out of proportion to availability). Overcup oak (Quercus lyrata) and bitter pecan (Carya aquatica) were also selected and sugarberry (Celtis laevigata) avoided. Pileated woodpeckers selected trees >= 50 cm dbh and avoided trees in smaller dbh classes (10-20 cm). Density of selected foraging substrates was the same in partial cut and uncut forest. Of the foraging substrates, woodpeckers spent 54% of foraging time on live branches and boles, 37% on dead branches and boles, and 9% on vines. Of the foraging tactics, the highest proportion of foraging time was spent excavating (58%), followed by pecking (14%), gleaning (14%), scaling (7%), berry-eating (4%), and probing (3%). Woodpecker use of foraging tactics and substrates, and foraging height and substrate

  13. Autoregressive Model with Partial Forgetting within Rao-Blackwellized Particle Filter

    Czech Academy of Sciences Publication Activity Database

    Dedecius, Kamil; Hofman, Radek

    2012-01-01

    Roč. 41, č. 5 (2012), s. 582-589 ISSN 0361-0918 R&D Projects: GA MV VG20102013018; GA ČR GA102/08/0567 Grant - others:ČVUT(CZ) SGS 10/099/OHK3/1T/16 Institutional research plan: CEZ:AV0Z10750506 Keywords : Bayesian methods * Particle filters * Recursive estimation Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.295, year: 2012 http://library.utia.cas.cz/separaty/2012/AS/dedecius-autoregressive model with partial forgetting within rao-blackwellized particle filter.pdf

  14. A queueing model for error control of partial buffer sharing in ATM

    Directory of Open Access Journals (Sweden)

    Ahn Boo Yong

    1999-01-01

    Full Text Available We model the error control of the partial buffer sharing of ATM by a queueing system M 1 , M 2 / G / 1 / K + 1 with threshold and instantaneous Bernoulli feedback. We first derive the system equations and develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time of each class of cells. An algorithm is developed for finding the optimal threshold and queue capacity for a given quality of service.

  15. Smoking Out a Deadly Threat: Tobacco Use in the LGBT Community

    Science.gov (United States)

    ... Out a Deadly Threat: Tobacco Use in the LGBT Community Disparities in Lung Health Series "Smoking Out a Deadly Threat: Tobacco Use in the LGBT Community" is part of the American Lung Association's ...

  16. Occurrence of organohalogens at the Dead Sea Basin

    Science.gov (United States)

    Tubbesing, Christoph; Kotte, Karsten; Keppler, Frank; Krause, Torsten; Bahlmann, Enno; Schöler, Heinfried

    2013-04-01

    Most arid and semi-arid regions are characterized by evaporites, which are assured sources for volatile organohalogens (VOX) [1]. These compounds play an important role in tropospheric and stratospheric chemistry. The Dead Sea between Israel and Jordan is the world's most famous and biggest all-season water covered salt lake. In both countries chemical plants like the Dead Sea Works and the Arab Potash Company are located at the southern part of the Dead Sea and mine various elements such as bromine and magnesium. Conveying sea water through constructed evaporation pans multifarious salts are enriched and precipitated. In contrast, the Northern basin and main part of the Dead Sea has remained almost untouched by industrial salt production. Its fresh water supply from the Jordan River is constantly decreasing, leading to further increased salinity. During a HALOPROC campaign (Natural Halogenation Processes in the Environment) we collected various samples including air, soils, sediments, halophytic plants, ground- and seawater from the Northern and Southern basin of the Israeli side of the Dead Sea. These samples were investigated for the occurrence of halocarbons using different analytical techniques. Most samples were analyzed for volatile organohalogens such as haloalkanes using gas chromatography- mass spectrometry (GC-MS). Interestingly, there is a strong enrichment of trihalomethanes (THM), especially all chlorinated and brominated ones and also the iodinated compound dichloroiodomethane were found in the Southern basin. In addition, volatile organic carbons (VOC) such as ethene and some other alkenes were analyzed by a gas chromatography-flame ionisation detector (GC-FID) to obtain further information about potential precursors of halogenated compounds. Halophytic plants were investigated for their potential to release chloromethane and bromomethane but also for their stable carbon and hydrogen isotope composition. For this purpose, a plant chamber was

  17. Hyperbolic partial differential equations

    CERN Document Server

    Witten, Matthew

    1986-01-01

    Hyperbolic Partial Differential Equations III is a refereed journal issue that explores the applications, theory, and/or applied methods related to hyperbolic partial differential equations, or problems arising out of hyperbolic partial differential equations, in any area of research. This journal issue is interested in all types of articles in terms of review, mini-monograph, standard study, or short communication. Some studies presented in this journal include discretization of ideal fluid dynamics in the Eulerian representation; a Riemann problem in gas dynamics with bifurcation; periodic M

  18. Successful removable partial dentures.

    Science.gov (United States)

    Lynch, Christopher D

    2012-03-01

    Removable partial dentures (RPDs) remain a mainstay of prosthodontic care for partially dentate patients. Appropriately designed, they can restore masticatory efficiency, improve aesthetics and speech, and help secure overall oral health. However, challenges remain in providing such treatments, including maintaining adequate plaque control, achieving adequate retention, and facilitating patient tolerance. The aim of this paper is to review the successful provision of RPDs. Removable partial dentures are a successful form of treatment for replacing missing teeth, and can be successfully provided with appropriate design and fabrication concepts in mind.

  19. Beginning partial differential equations

    CERN Document Server

    O'Neil, Peter V

    2011-01-01

    A rigorous, yet accessible, introduction to partial differential equations-updated in a valuable new edition Beginning Partial Differential Equations, Second Edition provides a comprehensive introduction to partial differential equations (PDEs) with a special focus on the significance of characteristics, solutions by Fourier series, integrals and transforms, properties and physical interpretations of solutions, and a transition to the modern function space approach to PDEs. With its breadth of coverage, this new edition continues to present a broad introduction to the field, while also addres

  20. Microclimate and habitat heterogeneity as the major drivers of beetle diversity in dead wood

    Science.gov (United States)

    Sebastian Seibold; Claus Bassler; Roland Brandl; Boris Buche; Alexander Szallies; Simon Thorn; Michael D. Ulyshen; Jorg Muller; Christopher Baraloto

    2016-01-01

    1. Resource availability and habitat heterogeneity are principle drivers of biodiversity, but their individual roles often remain unclear since both factors are usually correlated. The biodiversity of species dependent on dead wood could be driven by either resource availability represented by dead-wood amount or habitat heterogeneity characterized by dead-wood...

  1. Proportional Derivative Control with Inverse Dead-Zone for Pendulum Systems

    Directory of Open Access Journals (Sweden)

    José de Jesús Rubio

    2013-01-01

    Full Text Available A proportional derivative controller with inverse dead-zone is proposed for the control of pendulum systems. The proposed method has the characteristic that the inverse dead-zone is cancelled with the pendulum dead-zone. Asymptotic stability of the proposed technique is guaranteed by the Lyapunov analysis. Simulations of two pendulum systems show the effectiveness of the proposed technique.

  2. Predation by northern squawfish on live and dead juvenile chinook salmon

    International Nuclear Information System (INIS)

    Gadomski, D.M.; Hall-Griswold, J.A.

    1992-01-01

    Northern squawfish Ptychocheilus oregonensis is a major predator of juvenile salmonids Oncorhynchus spp. migrating downstream through the Columbia River. High predation rates occur just below dams. If northern squawfish selectively consume salmonids killed or injured during dam passage, previous estimates of predation mortality may be too high. We conducted laboratory experiments that indicate northern squawfish prefer dead juvenile chinook salmon O. tshawytscha over live individuals. When equal numbers of dead and live chinook salmon were offered to northern squawfish maintained on a natural photoperiod (15 h light: 9 h darkness), significantly more (P < 0.05) dead than live fish were consumed, both in 1,400-L circular tanks and in an 11,300-L raceway (62% and 79% of prey consumed were dead, respectively). When dead and live juvenile chinook salmon were provided in proportions more similar to those below dams (20% dead, 80% live), northern squawfish still selected for dead prey (36% of fish consumed were dead). In additional experiments, northern squawfish were offered a proportion of 20% dead juvenile chinook salmon during 4-h periods of either light or darkness. The predators were much more selective for dead chinook salmon during bright light (88% of fish consumed were dead) than during darkness (31% were dead)

  3. Dead space and slope indices from the expiratory carbon dioxide tension-volume curve

    NARCIS (Netherlands)

    A.H. Kars (Alice); J.M. Bogaard (Jan); Th. Stijnen (Theo); J. de Vries; A.F.M. Verbraak (Anton); C. Hilvering

    1997-01-01

    textabstractThe slope of phase 3 and three noninvasively determined dead space estimates derived from the expiratory carbon dioxide tension (PCO2) versus volume curve, including the Bohr dead space (VD,Bohr), the Fowler dead space (VD,Fowler) and pre-interface expirate

  4. Awakening the "Walking Dead": Zombie Pedagogy for Millennials

    Directory of Open Access Journals (Sweden)

    Nancy Dawn Wadsworth

    2017-02-01

    Full Text Available This article lays out the pedagogical benefits of using popular zombie productions, particularly AMC's The Walking Dead, to teach a critical introduction to modern political theory. Based on my undergraduate course: "Political Theory, Climate Change, and the Zombie Apocalypse," the article outlines how The Walking Dead can be used to critique the mythic assumptions built into modern social contract theory; to introduce other political ideologies, including conservatism, anarchism, fascism, and communism; and to consider the political challenges raised by a global problem such as climate change in an increasingly neoliberal environment. Zombie productions are offered as a particularly salient pedagogical tool that can help awaken critical political analysis for the Millennial Generation.

  5. Not to declare dead someone still alive: Case reports

    Directory of Open Access Journals (Sweden)

    Anđelić Slađana

    2015-01-01

    Full Text Available Introduction. Diagnosing death represents an activity that carries a great deal of public responsibility for medical professionals and is continually exposed to the control of citizens and media. Although this is a taboo subject in medical circles, unfortunately in medical practice there are situations when the physician issues a death diagnosis form without even examining the person or for an already buried person. Such physician’s action is impermissible and it leads to the possibility of professional and criminal law punishment. Case Outline. By giving examples from practice, we wish to point out the need for exceptional caution when confirming and diagnosing death in order to diagnose the true, i.e. rule out apparent death and consequently avoid the mistake of declaring dead someone still alive. Conclusion. When confirming and declaring death, exceptional caution of the physician is necessary so as not to declare dead someone still alive!

  6. The Dead Mother, the Uncanny, and the Holy Ghost

    Directory of Open Access Journals (Sweden)

    Gal Ventura

    2015-01-01

    Full Text Available Recurrent portrayals of dead mothers frequently appeared in French art from 1800 to 1850. This essay focuses on one of the latest manifestations of this image, namely, the French Realist Jules Breton's (1827-1906 painting The Hunger of 1850, in order to examine the psycho-historical elements associated with the mother's death. Through an analysis of the "Uncanny" as formulated by both Ernst Jentsch and Sigmund Freud, we will address the undissolvable link between the structuralization of "homeliness" in the late eighteenth century and the dread it evoked in the early nineteenth century, as two sides of the same coin. We will simultaneously consider the inherent conflictuality embodied by the dead mother according to the French psychoanalyst André Green, who dealt with the experience of "nothingness" that characterizes children of mothers-who-refuse-to-die.

  7. Solution of the Markov chain for the dead time problem

    International Nuclear Information System (INIS)

    Degweker, S.B.

    1997-01-01

    A method for solving the equation for the Markov chain, describing the effect of a non-extendible dead time on the statistics of time correlated pulses, is discussed. The equation, which was derived in an earlier paper, describes a non-linear process and is not amenable to exact solution. The present method consists of representing the probability generating function as a factorial cumulant expansion and neglecting factorial cumulants beyond the second. This results in a closed set of non-linear equations for the factorial moments. Stationary solutions of these equations, which are of interest for calculating the count rate, are obtained iteratively. The method is applied to the variable dead time counter technique for estimation of system parameters in passive neutron assay of Pu and reactor noise analysis. Comparisons of results by this method with Monte Carlo calculations are presented. (author)

  8. Is it practical to use the gamma camera dead time

    International Nuclear Information System (INIS)

    Morin, P.P.; Morin, J.F.; Caroff, J.; Lahellec, M.; Savina, A.

    1975-01-01

    The linearity of gamma camera counting is an essential feature for users engaged in quantitative dynamic studies. Instead of defining this quality by the usual dead time, the disadvantages of which are reported, it is proposed to use the experimental count rate giving 10% loss. It is shown that by proceeding in this way all ambiguity would be abolished, where both the counting linearity itself and its relation to sensitivity are concerned [fr

  9. Thermodynamics of the dead zone inner edge in protoplanetary disks

    International Nuclear Information System (INIS)

    Faure, Julien

    2014-01-01

    The dead zone, a quiescent region enclosed in the turbulent flow of a protoplanetary disk, seems to be a promising site for planet formation. Indeed, the development of a density maximum at the dead zone inner edge, that has the property to trap the infalling dust, is a natural outcome of the accretion mismatch at this interface. Moreover, the flow here may be unstable and organize itself into vortical structures that efficiently collect dust grains. The inner edge location is however loosely constrained. In particular, it depends on the thermodynamical prescriptions of the disk model that is considered. It has been recently proposed that the inner edge is not static and that the variations of young stars accretion luminosity are the signature of this interface displacements. This thesis address the question of the impact of the gas thermodynamics onto its dynamics around the dead zone inner edge. MHD simulations including the complex interplay between thermodynamical processes and the dynamics confirmed the dynamical behaviour of the inner edge. A first measure of the interface velocity has been realised. This result has been compared to the predictions of a mean field model. It revealed the crucial role of the energy transport by density waves excited at the interface. These simulations also exhibit a new intriguing phenomenon: vortices forming at the interface follow a cycle of formation-migration-destruction. This vortex cycle may compromise the formation of planetesimals at the inner edge. This thesis claims that thermodynamical processes are at the heart of how the region around the dead zone inner edge in protoplanetary disks works. (author) [fr

  10. Strong tracking adaptive Kalman filters for underwater vehicle dead reckoning

    Institute of Scientific and Technical Information of China (English)

    XIAO Kun; FANG Shao-ji; PANG Yong-jie

    2007-01-01

    To improve underwater vehicle dead reckoning, a developed strong tracking adaptive kalman filter is proposed. The filter is improved with an additional adaptive factor and an estimator of measurement noise covariance. Since the magnitude of fading factor is changed adaptively, the tracking ability of the filter is still enhanced in low velocity condition of underwater vehicles. The results of simulation tests prove the presented filter effective.

  11. Partial knee replacement - slideshow

    Science.gov (United States)

    ... page: //medlineplus.gov/ency/presentations/100225.htm Partial knee replacement - series—Normal anatomy To use the sharing ... A.M. Editorial team. Related MedlinePlus Health Topics Knee Replacement A.D.A.M., Inc. is accredited ...

  12. Beginning partial differential equations

    CERN Document Server

    O'Neil, Peter V

    2014-01-01

    A broad introduction to PDEs with an emphasis on specialized topics and applications occurring in a variety of fields Featuring a thoroughly revised presentation of topics, Beginning Partial Differential Equations, Third Edition provides a challenging, yet accessible,combination of techniques, applications, and introductory theory on the subjectof partial differential equations. The new edition offers nonstandard coverageon material including Burger's equation, the telegraph equation, damped wavemotion, and the use of characteristics to solve nonhomogeneous problems. The Third Edition is or

  13. Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind

    Directory of Open Access Journals (Sweden)

    Patrick Connolly

    2017-09-01

    Full Text Available The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization provides the critical theoretical context within which the significance of Friston's (2010a Free Energy Principle (FEP for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while “psychoanalytic” mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989 offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect, which is itself founded upon the tendency toward autopoiesis (self-making within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis

  14. Correction for intrinsic and set dead-time losses in radioactivity counting

    International Nuclear Information System (INIS)

    Wyllie, H.A.

    1992-12-01

    Equations are derived for the determination of the intrinsic dead time of the components which precede the paralysis unit in a counting system for measuring radioactivity. The determination depends on the extension of the set dead time by the intrinsic dead time. Improved formulae are given for the dead-time correction of the count rate of a radioactive source in a single-channel system. A variable in the formulae is the intrinsic dead time which is determined concurrently with the counting of the source. The only extra equipment required in a conventional system is a scaler. 5 refs., 2 tabs., 21 figs

  15. The Active Structure of the Greater Dead Sea Basin

    Science.gov (United States)

    Shamir, G.

    2002-12-01

    The Greater Dead Sea Basin (GDSB) is a 220km long depression situated along the southern section of the Dead Sea Transform (DST), between two structurally and gravitationally elevated points, Wadi Malih in the north and Paran fault zone in the south. In its center is the Dead Sea basin 'sensu strictu' (DSB), which has been described since the 1970s as a pull-apart basin at a left step-over along the DST. However, several observations, or their lack thereof, contradict this scheme, e.g. (i) It is not supported by recent seismological and geomorphic data; (ii) It does not explain the fault pattern and mixed sinistral and dextral offset along the DSB western boundary; (iii) It does not simply explain the presence of intense deformation outside the presumed fault step zone; (iv) It is inconsistent with the orientation of seismically active faults within the Dead Sea and Jericho Valley; (v) The length of the DSB exceeds the total offset along the Dead Sea Transform, while its subsidence is about the age of the DST. In this study, newly acquired and analyzed data (high resolution seismic reflection and earthquake relocation and fault plane solutions) has been integrated with previously published data (structural mapping, fracture orientation distribution, Bouguer anomaly maps, sinkhole distribution, geomorphic lineaments). The results show that the GDSB is dominated by two active fault systems, one trending NNE and showing normal-dextral motion, the other trending NW. These systems are identified by earthquake activity, seismic reflection observations, alignment of recent sinkholes, and distribution of Bouguer anomaly gradients. As a result, the intra-basin structure is of a series of rectangular blocks. The dextral slip component along NNE trending faults, the mixed sense of lateral offset along the western boundary of the DSB and temporal change in fracture orientation in the Jericho Valley suggest that the intra-basin blocks have rotated counterclockwise since the

  16. Recursive SVM biomarker selection for early detection of breast cancer in peripheral blood.

    Science.gov (United States)

    Zhang, Fan; Kaufman, Howard L; Deng, Youping; Drabier, Renee

    2013-01-01

    Breast cancer is worldwide the second most common type of cancer after lung cancer. Traditional mammography and Tissue Microarray has been studied for early cancer detection and cancer prediction. However, there is a need for more reliable diagnostic tools for early detection of breast cancer. This can be a challenge due to a number of factors and logistics. First, obtaining tissue biopsies can be difficult. Second, mammography may not detect small tumors, and is often unsatisfactory for younger women who typically have dense breast tissue. Lastly, breast cancer is not a single homogeneous disease but consists of multiple disease states, each arising from a distinct molecular mechanism and having a distinct clinical progression path which makes the disease difficult to detect and predict in early stages. In the paper, we present a Support Vector Machine based on Recursive Feature Elimination and Cross Validation (SVM-RFE-CV) algorithm for early detection of breast cancer in peripheral blood and show how to use SVM-RFE-CV to model the classification and prediction problem of early detection of breast cancer in peripheral blood.The training set which consists of 32 health and 33 cancer samples and the testing set consisting of 31 health and 34 cancer samples were randomly separated from a dataset of peripheral blood of breast cancer that is downloaded from Gene Express Omnibus. First, we identified the 42 differentially expressed biomarkers between "normal" and "cancer". Then, with the SVM-RFE-CV we extracted 15 biomarkers that yield zero cross validation score. Lastly, we compared the classification and prediction performance of SVM-RFE-CV with that of SVM and SVM Recursive Feature Elimination (SVM-RFE). We found that 1) the SVM-RFE-CV is suitable for analyzing noisy high-throughput microarray data, 2) it outperforms SVM-RFE in the robustness to noise and in the ability to recover informative features, and 3) it can improve the prediction performance (Area Under

  17. Comparative growth and development of spiders reared on live and dead prey.

    Science.gov (United States)

    Peng, Yu; Zhang, Fan; Gui, Shaolan; Qiao, Huping; Hose, Grant C

    2013-01-01

    Scavenging (feeding on dead prey) has been demonstrated across a number of spider families, yet the implications of feeding on dead prey for the growth and development of individuals and population is unknown. In this study we compare the growth, development, and predatory activity of two species of spiders that were fed on live and dead prey. Pardosa astrigera (Lycosidae) and Hylyphantes graminicola (Lyniphiidae) were fed live or dead fruit flies, Drosophila melanogaster. The survival of P. astrigera and H. graminicola was not affected by prey type. The duration of late instars of P. astrigera fed dead prey were longer and mature spiders had less protein content than those fed live prey, whereas there were no differences in the rate of H. graminicola development, but the mass of mature spiders fed dead prey was greater than those fed live prey. Predation rates by P. astrigera did not differ between the two prey types, but H. graminicola had a higher rate of predation on dead than alive prey, presumably because the dead flies were easier to catch and handle. Overall, the growth, development and reproduction of H. graminicola reared with dead flies was better than those reared on live flies, yet for the larger P. astrigera, dead prey may suit smaller instars but mature spiders may be best maintained with live prey. We have clearly demonstrated that dead prey may be suitable for rearing spiders, although the success of the spiders fed such prey appears size- and species specific.

  18. Relative abundance and species richness of cerambycid beetles in partial cut and uncut bottomland hardwood forests

    Science.gov (United States)

    Newell, P.; King, S.

    2009-01-01

    Partial cutting techniques are increasingly advocated and used to create habitat for priority wildlife. However, partial cutting may or may not benefit species dependent on deadwood; harvesting can supplement coarse woody debris in the form of logging slash, but standing dead trees may be targeted for removal. We sampled cerambycid beetles during the spring and summer of 2006 and 2007 with canopy malaise traps in 1- and 2-year-old partial cut and uncut bottomland hardwood forests of Louisiana. We captured a total of 4195 cerambycid beetles representing 65 species. Relative abundance was higher in recent partial cuts than in uncut controls and with more dead trees in a plot. Total species richness and species composition were not different between treatments. The results suggest partial cuts with logging slash left on site increase the abundance of cerambycid beetles in the first few years after partial cutting and that both partial cuts and uncut forest should be included in the bottomland hardwood forest landscape.

  19. Molecular-based recursive partitioning analysis model for glioblastoma in the temozolomide era a correlative analysis based on nrg oncology RTOG 0525

    NARCIS (Netherlands)

    Bell, Erica Hlavin; Pugh, Stephanie L.; McElroy, Joseph P.; Gilbert, Mark R.; Mehta, Minesh; Klimowicz, Alexander C.; Magliocco, Anthony; Bredel, Markus; Robe, Pierre; Grosu, Anca L.; Stupp, Roger; Curran, Walter; Becker, Aline P.; Salavaggione, Andrea L.; Barnholtz-Sloan, Jill S.; Aldape, Kenneth; Blumenthal, Deborah T.; Brown, Paul D.; Glass, Jon; Souhami, Luis; Lee, R. Jeffrey; Brachman, David; Flickinger, John; Won, Minhee; Chakravarti, Arnab

    2017-01-01

    IMPORTANCE: There is a need for a more refined, molecularly based classification model for glioblastoma (GBM) in the temozolomide era. OBJECTIVE: To refine the existing clinically based recursive partitioning analysis (RPA) model by incorporating molecular variables. DESIGN, SETTING, AND

  20. Output-Only Modal Parameter Recursive Estimation of Time-Varying Structures via a Kernel Ridge Regression FS-TARMA Approach

    Directory of Open Access Journals (Sweden)

    Zhi-Sai Ma

    2017-01-01

    Full Text Available Modal parameter estimation plays an important role in vibration-based damage detection and is worth more attention and investigation, as changes in modal parameters are usually being used as damage indicators. This paper focuses on the problem of output-only modal parameter recursive estimation of time-varying structures based upon parameterized representations of the time-dependent autoregressive moving average (TARMA. A kernel ridge regression functional series TARMA (FS-TARMA recursive identification scheme is proposed and subsequently employed for the modal parameter estimation of a numerical three-degree-of-freedom time-varying structural system and 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 pseudolinear regression FS-TARMA approach via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics in a recursive manner.

  1. Prognostic Classification Factors Associated With Development of Multiple Autoantibodies, Dysglycemia, and Type 1 Diabetes?A Recursive Partitioning Analysis

    OpenAIRE

    Xu, Ping; Krischer, Jeffrey P.

    2016-01-01

    OBJECTIVE To define prognostic classification factors associated with the progression from single to multiple autoantibodies, multiple autoantibodies to dysglycemia, and dysglycemia to type 1 diabetes onset in relatives of individuals with type 1 diabetes. RESEARCH DESIGN AND METHODS Three distinct cohorts of subjects from the Type 1 Diabetes TrialNet Pathway to Prevention Study were investigated separately. A recursive partitioning analysis (RPA) was used to determine the risk classes. Clini...

  2. The spin-3/2 Blume-Capel model on the Bethe lattice using the recursion method

    International Nuclear Information System (INIS)

    Albayrak, Erhan; Keskin, Mustafa

    2000-01-01

    The spin-3/2 Blume-Capel model is solved on the Bethe lattice using the exact recursion equations. The nature of the variation of the Curie temperature with the ratio of the single-ion anisotropy term to the exchange-coupling constant is studied and the phase diagrams are constructed on the Bethe lattice with the co-ordination numbers q=3 and 6. A comparison is made with the results of the other approximation schemes

  3. The spin-3/2 Blume-Capel model on the Bethe lattice using the recursion method

    CERN Document Server

    Albayrak, E

    2000-01-01

    The spin-3/2 Blume-Capel model is solved on the Bethe lattice using the exact recursion equations. The nature of the variation of the Curie temperature with the ratio of the single-ion anisotropy term to the exchange-coupling constant is studied and the phase diagrams are constructed on the Bethe lattice with the co-ordination numbers q=3 and 6. A comparison is made with the results of the other approximation schemes.

  4. Partial differential equations

    CERN Document Server

    Evans, Lawrence C

    2010-01-01

    This text gives a comprehensive survey of modern techniques in the theoretical study of partial differential equations (PDEs) with particular emphasis on nonlinear equations. The exposition is divided into three parts: representation formulas for solutions; theory for linear partial differential equations; and theory for nonlinear partial differential equations. Included are complete treatments of the method of characteristics; energy methods within Sobolev spaces; regularity for second-order elliptic, parabolic, and hyperbolic equations; maximum principles; the multidimensional calculus of variations; viscosity solutions of Hamilton-Jacobi equations; shock waves and entropy criteria for conservation laws; and, much more.The author summarizes the relevant mathematics required to understand current research in PDEs, especially nonlinear PDEs. While he has reworked and simplified much of the classical theory (particularly the method of characteristics), he primarily emphasizes the modern interplay between funct...

  5. A novel recursive Fourier transform for nonuniform sampled signals: application to heart rate variability spectrum estimation.

    Science.gov (United States)

    Holland, Alexander; Aboy, Mateo

    2009-07-01

    We present a novel method to iteratively calculate discrete Fourier transforms for discrete time signals with sample time intervals that may be widely nonuniform. The proposed recursive Fourier transform (RFT) does not require interpolation of the samples to uniform time intervals, and each iterative transform update of N frequencies has computational order N. Because of the inherent non-uniformity in the time between successive heart beats, an application particularly well suited for this transform is power spectral density (PSD) estimation for heart rate variability. We compare RFT based spectrum estimation with Lomb-Scargle Transform (LST) based estimation. PSD estimation based on the LST also does not require uniform time samples, but the LST has a computational order greater than Nlog(N). We conducted an assessment study involving the analysis of quasi-stationary signals with various levels of randomly missing heart beats. Our results indicate that the RFT leads to comparable estimation performance to the LST with significantly less computational overhead and complexity for applications requiring iterative spectrum estimations.

  6. Literacity: A multimedia adult literacy package combining NASA technology, recursive ID theory, and authentic instruction theory

    Science.gov (United States)

    Willis, Jerry; Willis, Dee Anna; Walsh, Clare; Stephens, Elizabeth; Murphy, Timothy; Price, Jerry; Stevens, William; Jackson, Kevin; Villareal, James A.; Way, Bob

    1994-01-01

    An important part of NASA's mission involves the secondary application of its technologies in the public and private sectors. One current application under development is LiteraCity, a simulation-based instructional package for adults who do not have functional reading skills. Using fuzzy logic routines and other technologies developed by NASA's Information Systems Directorate and hypermedia sound, graphics, and animation technologies the project attempts to overcome the limited impact of adult literacy assessment and instruction by involving the adult in an interactive simulation of real-life literacy activities. The project uses a recursive instructional development model and authentic instruction theory. This paper describes one component of a project to design, develop, and produce a series of computer-based, multimedia instructional packages. The packages are being developed for use in adult literacy programs, particularly in correctional education centers. They use the concepts of authentic instruction and authentic assessment to guide development. All the packages to be developed are instructional simulations. The first is a simulation of 'finding a friend a job.'

  7. 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.

  8. Temporal parameter change of human postural control ability during upright swing using recursive least square method

    Science.gov (United States)

    Goto, Akifumi; Ishida, Mizuri; Sagawa, Koichi

    2010-01-01

    The purpose of this study is to derive quantitative assessment indicators of the human postural control ability. An inverted pendulum is applied to standing human body and is controlled by ankle joint torque according to PD control method in sagittal plane. Torque control parameters (KP: proportional gain, KD: derivative gain) and pole placements of postural control system are estimated with time from inclination angle variation using fixed trace method as recursive least square method. Eight young healthy volunteers are participated in the experiment, in which volunteers are asked to incline forward as far as and as fast as possible 10 times over 10 [s] stationary intervals with their neck joint, hip joint and knee joint fixed, and then return to initial upright posture. The inclination angle is measured by an optical motion capture system. Three conditions are introduced to simulate unstable standing posture; 1) eyes-opened posture for healthy condition, 2) eyes-closed posture for visual impaired and 3) one-legged posture for lower-extremity muscle weakness. The estimated parameters Kp, KD and pole placements are applied to multiple comparison test among all stability conditions. The test results indicate that Kp, KD and real pole reflect effect of lower-extremity muscle weakness and KD also represents effect of visual impairment. It is suggested that the proposed method is valid for quantitative assessment of standing postural control ability.

  9. Recursive Partitioning Analysis for New Classification of Patients With Esophageal Cancer Treated by Chemoradiotherapy

    International Nuclear Information System (INIS)

    Nomura, Motoo; Shitara, Kohei; Kodaira, Takeshi; Kondoh, Chihiro; Takahari, Daisuke; Ura, Takashi; Kojima, Hiroyuki; Kamata, Minoru; Muro, Kei; Sawada, Satoshi

    2012-01-01

    Background: The 7th edition of the American Joint Committee on Cancer staging system does not include lymph node size in the guidelines for staging patients with esophageal cancer. The objectives of this study were to determine the prognostic impact of the maximum metastatic lymph node diameter (ND) on survival and to develop and validate a new staging system for patients with esophageal squamous cell cancer who were treated with definitive chemoradiotherapy (CRT). Methods: Information on 402 patients with esophageal cancer undergoing CRT at two institutions was reviewed. Univariate and multivariate analyses of data from one institution were used to assess the impact of clinical factors on survival, and recursive partitioning analysis was performed to develop the new staging classification. To assess its clinical utility, the new classification was validated using data from the second institution. Results: By multivariate analysis, gender, T, N, and ND stages were independently and significantly associated with survival (p < 0.05). The resulting new staging classification was based on the T and ND. The four new stages led to good separation of survival curves in both the developmental and validation datasets (p < 0.05). Conclusions: Our results showed that lymph node size is a strong independent prognostic factor and that the new staging system, which incorporated lymph node size, provided good prognostic power, and discriminated effectively for patients with esophageal cancer undergoing CRT.

  10. An efficient recursive least square-based condition monitoring approach for a rail vehicle suspension system

    Science.gov (United States)

    Liu, X. Y.; Alfi, S.; Bruni, S.

    2016-06-01

    A model-based condition monitoring strategy for the railway vehicle suspension is proposed in this paper. This approach is based on recursive least square (RLS) algorithm focusing on the deterministic 'input-output' model. RLS has Kalman filtering feature and is able to identify the unknown parameters from a noisy dynamic system by memorising the correlation properties of variables. The identification of suspension parameter is achieved by machine learning of the relationship between excitation and response in a vehicle dynamic system. A fault detection method for the vertical primary suspension is illustrated as an instance of this condition monitoring scheme. Simulation results from the rail vehicle dynamics software 'ADTreS' are utilised as 'virtual measurements' considering a trailer car of Italian ETR500 high-speed train. The field test data from an E464 locomotive are also employed to validate the feasibility of this strategy for the real application. Results of the parameter identification performed indicate that estimated suspension parameters are consistent or approximate with the reference values. These results provide the supporting evidence that this fault diagnosis technique is capable of paving the way for the future vehicle condition monitoring system.

  11. 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.

  12. The Impacts of Environmental Tax in China: A Dynamic Recursive Multi-Sector CGE Model

    Directory of Open Access Journals (Sweden)

    Bowen Xiao

    2015-07-01

    Full Text Available In recent years, the accumulated environmental problems resulting from excessive usage of fossil fuels have gradually loomed. Thus, an environmental tax, as an important policy tool, has been put on the agenda in China. In this paper, a dynamic recursive multi-sector Computable General Equilibrium (CGE model is applied to explore the impacts of the environmental tax on China’s economy. To comprehensively analyze the impacts, we introduce four kinds of typical contaminants and set two kinds of scenarios: different tax rates and different tax refunds. The results show that the environmental tax is conducive to environmental improvement, but the economic variables are adversely affected, for example, the loss of GDP at the low level tax rate is 0.46%. In order to offset the negative impacts, we presume the government refunds the tax. The results show that this can indeed relieve the negative effects. When the government refunds the production tax and corporate income tax, 0.49% and 0.34% of GDP is relieved by respectively. This paper provides a comprehensive analysis of the implementation of the environmental tax in China and lays a solid foundation for the introduction of the environmental tax.

  13. 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.

  14. Prediction of Protein Structural Class Based on Gapped-Dipeptides and a Recursive Feature Selection Approach

    Directory of Open Access Journals (Sweden)

    Taigang Liu

    2015-12-01

    Full Text Available The prior knowledge of protein structural class may offer useful clues on understanding its functionality as well as its tertiary structure. Though various significant efforts have been made to find a fast and effective computational approach to address this problem, it is still a challenging topic in the field of bioinformatics. The position-specific score matrix (PSSM profile has been shown to provide a useful source of information for improving the prediction performance of protein structural class. However, this information has not been adequately explored. To this end, in this study, we present a feature extraction technique which is based on gapped-dipeptides composition computed directly from PSSM. Then, a careful feature selection technique is performed based on support vector machine-recursive feature elimination (SVM-RFE. These optimal features are selected to construct a final predictor. The results of jackknife tests on four working datasets show that our method obtains satisfactory prediction accuracies by extracting features solely based on PSSM and could serve as a very promising tool to predict protein structural class.

  15. Gravity Search Algorithm hybridized Recursive Least Square method for power system harmonic estimation

    Directory of Open Access Journals (Sweden)

    Santosh Kumar Singh

    2017-06-01

    Full Text Available This paper presents a new hybrid method based on Gravity Search Algorithm (GSA and Recursive Least Square (RLS, known as GSA-RLS, to solve the harmonic estimation problems in the case of time varying power signals in presence of different noises. GSA is based on the Newton’s law of gravity and mass interactions. In the proposed method, the searcher agents are a collection of masses that interact with each other using Newton’s laws of gravity and motion. The basic GSA algorithm strategy is combined with RLS algorithm sequentially in an adaptive way to update the unknown parameters (weights of the harmonic signal. Simulation and practical validation are made with the experimentation of the proposed algorithm with real time data obtained from a heavy paper industry. A comparative performance of the proposed algorithm is evaluated with other recently reported algorithms like, Differential Evolution (DE, Particle Swarm Optimization (PSO, Bacteria Foraging Optimization (BFO, Fuzzy-BFO (F-BFO hybridized with Least Square (LS and BFO hybridized with RLS algorithm, which reveals that the proposed GSA-RLS algorithm is the best in terms of accuracy, convergence and computational time.

  16. 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.

  17. Pornography Use and Loneliness: A Bidirectional Recursive Model and Pilot Investigation.

    Science.gov (United States)

    Butler, Mark H; Pereyra, Samuel A; Draper, Thomas W; Leonhardt, Nathan D; Skinner, Kevin B

    2018-02-17

    Sexuality is presumptively and observably a powerful core element of the human pair-bond relationship. Technological advances of the last half-century have made media a dominant cultural and developmental presence, including scripting sexual relationship attitudes and behavior. Theoretically and empirically, we examine loneliness as it relates to pornography use in terms of pornography's relational scripting and its addictive potential. Empirically, we examine the associative nature between pornography use and loneliness using a measurement model and two structural equation models where pornography use and loneliness are regressed on each other, respectively. Survey data were collected from a sample of 1,247 participants, who completed an online questionnaire containing questions on pornography use, the University of California-Los Angeles Loneliness Scale (UCLALS), and other demographic variables. Results from our analyses revealed significant and positive associations between pornography use and loneliness for all three models. Findings provide grounds for possible future bidirectional, recursive modeling of the relation between pornography use and loneliness.

  18. 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.

  19. Optimizing NEURON Simulation Environment Using Remote Memory Access with Recursive Doubling on Distributed Memory Systems.

    Science.gov (United States)

    Shehzad, Danish; Bozkuş, Zeki

    2016-01-01

    Increase in complexity of neuronal network models escalated the efforts to make NEURON simulation environment efficient. The computational neuroscientists divided the equations into subnets amongst multiple processors for achieving better hardware performance. On parallel machines for neuronal networks, interprocessor spikes exchange consumes large section of overall simulation time. In NEURON for communication between processors Message Passing Interface (MPI) is used. MPI_Allgather collective is exercised for spikes exchange after each interval across distributed memory systems. The increase in number of processors though results in achieving concurrency and better performance but it inversely affects MPI_Allgather which increases communication time between processors. This necessitates improving communication methodology to decrease the spikes exchange time over distributed memory systems. This work has improved MPI_Allgather method using Remote Memory Access (RMA) by moving two-sided communication to one-sided communication, and use of recursive doubling mechanism facilitates achieving efficient communication between the processors in precise steps. This approach enhanced communication concurrency and has improved overall runtime making NEURON more efficient for simulation of large neuronal network models.

  20. Multiple Memory Structure Bit Reversal Algorithm Based on Recursive Patterns of Bit Reversal Permutation

    Directory of Open Access Journals (Sweden)

    K. K. L. B. Adikaram

    2014-01-01

    Full Text Available With the increasing demand for online/inline data processing efficient Fourier analysis becomes more and more relevant. Due to the fact that the bit reversal process requires considerable processing time of the Fast Fourier Transform (FFT algorithm, it is vital to optimize the bit reversal algorithm (BRA. This paper is to introduce an efficient BRA with multiple memory structures. In 2009, Elster showed the relation between the first and the second halves of the bit reversal permutation (BRP and stated that it may cause serious impact on cache performance of the computer, if implemented. We found exceptions, especially when the said index mapping was implemented with multiple one-dimensional memory structures instead of multidimensional or one-dimensional memory structure. Also we found a new index mapping, even after the recursive splitting of BRP into equal sized slots. The four-array and the four-vector versions of BRA with new index mapping reported 34% and 16% improvement in performance in relation to similar versions of Linear BRA of Elster which uses single one-dimensional memory structure.