Analysis and enumeration algorithms for biological graphs

CERN Document Server

Marino, Andrea

2015-01-01

In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions...

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

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

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.

Almost computably enumerable families of sets

International Nuclear Information System (INIS)

Kalimullin, I Sh

2008-01-01

An almost computably enumerable family that is not Φ'-computably enumerable is constructed. Moreover, it is established that for any computably enumerable (c.e.) set A there exists a family that is X-c.e. if and only if the set X is not A-computable. Bibliography: 5 titles.

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

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.

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

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

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

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…

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

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.

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

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

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.

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…

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

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

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)

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.

Perceptual grouping affects haptic enumeration over the fingers

NARCIS (Netherlands)

Overvliet, K.E.; Plaisier, M.A.

2016-01-01

Spatial arrangement is known to influence enumeration times in vision. In haptic enumeration, it has been shown that dividing the total number of items over the two hands can speed up enumeration. Here we investigated how spatial arrangement of items and non-items presented to the individual fingers

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

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.

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

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

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.

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.

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.

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.

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.

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

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.

Application of hyperplane arrangements to weight enumeration

NARCIS (Netherlands)

Jurrius, R.P.M.J.; Pellikaan, G.R.

2014-01-01

Many research in coding theory is focussed on linear error-correcting codes. Since these codes are subspaces, linear algebra plays a prominent role in studying them. An important polynomial invariant of linear error-correcting codes is the (extended) weight enumerator. The weight enumerator gives

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

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.

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.

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

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.

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

Ensemble Weight Enumerators for Protograph LDPC Codes

Science.gov (United States)

Divsalar, Dariush

2006-01-01

Recently LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC codes with protograph structures are obtained. Asymptotic results are derived as the block size goes to infinity. In particular we are interested in obtaining ensemble average weight enumerators for protograph LDPC codes which have minimum distance that grows linearly with block size. As with irregular ensembles, linear minimum distance property is sensitive to the proportion of degree-2 variable nodes. In this paper the derived results on ensemble weight enumerators show that linear minimum distance condition on degree distribution of unstructured irregular LDPC codes is a sufficient but not a necessary condition for protograph LDPC codes.

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.

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

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.

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.

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.

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

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.

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.

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

Enumerating submultisets of multisets

NARCIS (Netherlands)

Hage, J.

2001-01-01

In this paper we consider the problem of enumerating the submultisets of a multiset, in which each element has equal multiplicity. The crucial property is that consecutive submultisets in this listing differ one in the cardinality of only one of the elements. This is a generalization to k-ary

Recursive Lexicographical Search

DEFF Research Database (Denmark)

Iskhakov, Fedor; Rust, John; Schjerning, Bertel

2016-01-01

of Bertrand price competition with cost reducing investments which we show is a DDG. We provide an exact non- iterative algorithm that finds all MPE of every stage game, and prove there can be only 1, 3 or 5 of them. Using the stage games as building blocks, RLS rapidly finds and enumerates all MPE...

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.

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

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)

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)

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

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

Enumeration of fungi in barley

CSIR Research Space (South Africa)

Rabie, CJ

1997-04-01

Full Text Available Estimation of fungal contamination of barley grain is important as certain fungi can proliferate during the malting process. The following factors which may affect the enumeration of fungi were evaluated: dilution versus direct plating, pre...

Top-k Based Adaptive Enumeration in Constraint Programming

Directory of Open Access Journals (Sweden)

Ricardo Soto

2015-01-01

order for variables and values is employed along the search. In this paper, we present a new and more lightweight approach for performing adaptive enumeration. We incorporate a powerful classification technique named Top-k in order to adaptively select strategies along the resolution. We report results on a set of well-known benchmarks where the proposed approach noticeably competes with classical and modern adaptive enumeration methods for constraint satisfaction.

The association of color memory and the enumeration of multiple spatially overlapping sets.

Science.gov (United States)

Poltoratski, Sonia; Xu, Yaoda

2013-07-09

Using dot displays, Halberda, Sires, and Feigenson (2006) showed that observers could simultaneously encode the numerosity of two spatially overlapping sets and the superset of all items at a glance. With the brief display and the masking used in Halberda et al., the task required observers to encode the colors of each set in order to select and enumerate all the dots in that set. As such, the observed capacity limit for set enumeration could reflect a limit in visual short-term memory (VSTM) capacity for the set color rather than a limit in set enumeration per se. Here, we largely replicated Halberda et al. and found successful enumeration of approximately two sets (the superset was not probed). We also found that only about two and a half colors could be remembered from the colored dot displays whether or not the enumeration task was performed concurrently with the color VSTM task. Because observers must remember the color of a set prior to enumerating it, the under three-item VSTM capacity for color necessarily dictates that set enumeration capacity in this paradigm could not exceed two sets. Thus, the ability to enumerate multiple spatially overlapping sets is likely limited by VSTM capacity to retain the discriminating feature of these sets. This relationship suggests that the capacity for set enumeration cannot be considered independently from the capacity for the set's defining features.

Template-based combinatorial enumeration of virtual compound libraries for lipids.

Science.gov (United States)

Sud, Manish; Fahy, Eoin; Subramaniam, Shankar

2012-09-25

A variety of software packages are available for the combinatorial enumeration of virtual libraries for small molecules, starting from specifications of core scaffolds with attachments points and lists of R-groups as SMILES or SD files. Although SD files include atomic coordinates for core scaffolds and R-groups, it is not possible to control 2-dimensional (2D) layout of the enumerated structures generated for virtual compound libraries because different packages generate different 2D representations for the same structure. We have developed a software package called LipidMapsTools for the template-based combinatorial enumeration of virtual compound libraries for lipids. Virtual libraries are enumerated for the specified lipid abbreviations using matching lists of pre-defined templates and chain abbreviations, instead of core scaffolds and lists of R-groups provided by the user. 2D structures of the enumerated lipids are drawn in a specific and consistent fashion adhering to the framework for representing lipid structures proposed by the LIPID MAPS consortium. LipidMapsTools is lightweight, relatively fast and contains no external dependencies. It is an open source package and freely available under the terms of the modified BSD license.

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.

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.

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

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.

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

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.

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

Turn-Based War Chess Model and Its Search Algorithm per Turn

Directory of Open Access Journals (Sweden)

Hai Nan

2016-01-01

Full Text Available War chess gaming has so far received insufficient attention but is a significant component of turn-based strategy games (TBS and is studied in this paper. First, a common game model is proposed through various existing war chess types. Based on the model, we propose a theory frame involving combinational optimization on the one hand and game tree search on the other hand. We also discuss a key problem, namely, that the number of the branching factors of each turn in the game tree is huge. Then, we propose two algorithms for searching in one turn to solve the problem: (1 enumeration by order; (2 enumeration by recursion. The main difference between these two is the permutation method used: the former uses the dictionary sequence method, while the latter uses the recursive permutation method. Finally, we prove that both of these algorithms are optimal, and we analyze the difference between their efficiencies. An important factor is the total time taken for the unit to expand until it achieves its reachable position. The factor, which is the total number of expansions that each unit makes in its reachable position, is set. The conclusion proposed is in terms of this factor: Enumeration by recursion is better than enumeration by order in all situations.

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

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)

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.

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

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

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)

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

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.

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.

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.

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

Circulating Tumor Cells, Enumeration and Beyond

Energy Technology Data Exchange (ETDEWEB)

Hou, Jian-Mei [Clinical and Experimental Pharmacology Group, Paterson Institute for Cancer Research, Manchester M20 4BX (United Kingdom); Krebs, Matthew [Clinical and Experimental Pharmacology Group, Paterson Institute for Cancer Research, Manchester M20 4BX (United Kingdom); Christie Hospital Foundation NHS Trust, Manchester M20 4BX (United Kingdom); Ward, Tim; Morris, Karen; Sloane, Robert [Clinical and Experimental Pharmacology Group, Paterson Institute for Cancer Research, Manchester M20 4BX (United Kingdom); Blackhall, Fiona [Clinical and Experimental Pharmacology Group, Paterson Institute for Cancer Research, Manchester M20 4BX (United Kingdom); School of Cancer and Enabling Sciences, University of Manchester, Manchester Cancer Research Centre, Manchester Academic Health Sciences Centre, Manchester M20 4BX (United Kingdom); Christie Hospital Foundation NHS Trust, Manchester M20 4BX (United Kingdom); Dive, Caroline, E-mail: cdive@picr.man.ac.uk [Clinical and Experimental Pharmacology Group, Paterson Institute for Cancer Research, Manchester M20 4BX (United Kingdom); School of Cancer and Enabling Sciences, University of Manchester, Manchester Cancer Research Centre, Manchester Academic Health Sciences Centre, Manchester M20 4BX (United Kingdom)

2010-06-09

The detection and enumeration of circulating tumor cells (CTCs) has shown significant clinical utility with respect to prognosis in breast, colorectal and prostate cancers. Emerging studies show that CTCs can provide pharmacodynamic information to aid therapy decision making. CTCs as a ‘virtual and real-time biopsy’ have clear potential to facilitate exploration of tumor biology, and in particular, the process of metastasis. The challenge of profiling CTC molecular characteristics and generating CTC signatures using current technologies is that they enrich rather than purify CTCs from whole blood; we face the problem of looking for the proverbial ‘needle in the haystack’. This review summarizes the current methods for CTC detection and enumeration, focuses on molecular characterization of CTCs, unveils some aspects of CTC heterogeneity, describes attempts to purify CTCs and scans the horizon for approaches leading to comprehensive dissection of CTC biology.

Circulating Tumor Cells, Enumeration and Beyond

International Nuclear Information System (INIS)

Hou, Jian-Mei; Krebs, Matthew; Ward, Tim; Morris, Karen; Sloane, Robert; Blackhall, Fiona; Dive, Caroline

2010-01-01

The detection and enumeration of circulating tumor cells (CTCs) has shown significant clinical utility with respect to prognosis in breast, colorectal and prostate cancers. Emerging studies show that CTCs can provide pharmacodynamic information to aid therapy decision making. CTCs as a ‘virtual and real-time biopsy’ have clear potential to facilitate exploration of tumor biology, and in particular, the process of metastasis. The challenge of profiling CTC molecular characteristics and generating CTC signatures using current technologies is that they enrich rather than purify CTCs from whole blood; we face the problem of looking for the proverbial ‘needle in the haystack’. This review summarizes the current methods for CTC detection and enumeration, focuses on molecular characterization of CTCs, unveils some aspects of CTC heterogeneity, describes attempts to purify CTCs and scans the horizon for approaches leading to comprehensive dissection of CTC biology

Scalable approximate policies for Markov decision process models of hospital elective admissions.

Science.gov (United States)

Zhu, George; Lizotte, Dan; Hoey, Jesse

2014-05-01

To demonstrate the feasibility of using stochastic simulation methods for the solution of a large-scale Markov decision process model of on-line patient admissions scheduling. The problem of admissions scheduling is modeled as a Markov decision process in which the states represent numbers of patients using each of a number of resources. We investigate current state-of-the-art real time planning methods to compute solutions to this Markov decision process. Due to the complexity of the model, traditional model-based planners are limited in scalability since they require an explicit enumeration of the model dynamics. To overcome this challenge, we apply sample-based planners along with efficient simulation techniques that given an initial start state, generate an action on-demand while avoiding portions of the model that are irrelevant to the start state. We also propose a novel variant of a popular sample-based planner that is particularly well suited to the elective admissions problem. Results show that the stochastic simulation methods allow for the problem size to be scaled by a factor of almost 10 in the action space, and exponentially in the state space. We have demonstrated our approach on a problem with 81 actions, four specialities and four treatment patterns, and shown that we can generate solutions that are near-optimal in about 100s. Sample-based planners are a viable alternative to state-based planners for large Markov decision process models of elective admissions scheduling. Copyright © 2014 Elsevier B.V. All rights reserved.

Taking a(c)count of eye movements: Multiple mechanisms underlie fixations during enumeration.

Science.gov (United States)

Paul, Jacob M; Reeve, Robert A; Forte, Jason D

2017-03-01

We habitually move our eyes when we enumerate sets of objects. It remains unclear whether saccades are directed for numerosity processing as distinct from object-oriented visual processing (e.g., object saliency, scanning heuristics). Here we investigated the extent to which enumeration eye movements are contingent upon the location of objects in an array, and whether fixation patterns vary with enumeration demands. Twenty adults enumerated random dot arrays twice: first to report the set cardinality and second to judge the perceived number of subsets. We manipulated the spatial location of dots by presenting arrays at 0°, 90°, 180°, and 270° orientations. Participants required a similar time to enumerate the set or the perceived number of subsets in the same array. Fixation patterns were systematically shifted in the direction of array rotation, and distributed across similar locations when the same array was shown on multiple occasions. We modeled fixation patterns and dot saliency using a simple filtering model and show participants judged groups of dots in close proximity (2°-2.5° visual angle) as distinct subsets. Modeling results are consistent with the suggestion that enumeration involves visual grouping mechanisms based on object saliency, and specific enumeration demands affect spatial distribution of fixations. Our findings highlight the importance of set computation, rather than object processing per se, for models of numerosity processing.

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)

A note on the complexity of finding and enumerating elementary modes.

NARCIS (Netherlands)

Acuna, V.; Marchetti-Spaccamela, A.; Sagot, M.-F.; Stougie, L.

2010-01-01

In the context of the study into elementary modes of metabolic networks, we prove two complexity results. Enumerating elementary modes containing a specific reaction is hard in an enumeration complexity sense. The decision problem if there exists an elementary mode containing two specific reactions

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.

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…

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)

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

Automated Mobile System for Accurate Outdoor Tree Crop Enumeration Using an Uncalibrated Camera

OpenAIRE

Thuy Tuong Nguyen; David C. Slaughter; Bradley D. Hanson; Andrew Barber; Amy Freitas; Daniel Robles; Erin Whelan

2015-01-01

This paper demonstrates an automated computer vision system for outdoor tree crop enumeration in a seedling nursery. The complete system incorporates both hardware components (including an embedded microcontroller, an odometry encoder, and an uncalibrated digital color camera) and software algorithms (including microcontroller algorithms and the proposed algorithm for tree crop enumeration) required to obtain robust performance in a natural outdoor environment. The enumeration system uses a t...

Circulating Tumor Cells, Enumeration and Beyond

Directory of Open Access Journals (Sweden)

Jian-Mei Hou

2010-06-01

Full Text Available The detection and enumeration of circulating tumor cells (CTCs has shown significant clinical utility with respect to prognosis in breast, colorectal and prostate cancers. Emerging studies show that CTCs can provide pharmacodynamic information to aid therapy decision making. CTCs as a ‘virtual and real-time biopsy’ have clear potential to facilitate exploration of tumor biology, and in particular, the process of metastasis. The challenge of profiling CTC molecular characteristics and generating CTC signatures using current technologies is that they enrich rather than purify CTCs from whole blood; we face the problem of looking for the proverbial ‘needle in the haystack’. This review summarizes the current methods for CTC detection and enumeration, focuses on molecular characterization of CTCs, unveils some aspects of CTC heterogeneity, describes attempts to purify CTCs and scans the horizon for approaches leading to comprehensive dissection of CTC biology.

Summary of the Skookumchuck Creek bull trout enumeration project 2001.; TOPICAL

International Nuclear Information System (INIS)

Baxter, James S.; Baxter, Jeremy

2002-01-01

This report summarizes the second year of a bull trout (Salvelinus confluentus) enumeration project on Skookumchuck Creek in southeastern British Columbia. An enumeration fence and traps were installed on the creek from September 6th to October 12th 2001 to enable the capture of post-spawning bull trout emigrating out of the watershed. During the study period, a total of 273 bull trout were sampled through the enumeration fence. Length and weight were determined for all bull trout captured. In total, 39 fish of undetermined sex, 61 males and 173 females were processed through the fence. An additional 19 bull trout were observed on a snorkel survey prior to the fence being removed on October 12th. Coupled with the fence count, the total bull trout enumerated during this project was 292 fish. Several other species of fish were captured at the enumeration fence including westslope cutthroat trout (Oncorhynchus clarki lewisi), Rocky Mountain whitefish (Prosopium williamsoni), and kokanee (O. nerka). A total of 143 bull trout redds were enumerated on the ground in two different locations (river km 27.5-30.5, and km 24.0-25.5) on October 3rd. The majority of redds (n=132) were observed in the 3.0 km index section (river km 27.5-30.5) that has been surveyed over the past five years. The additional 11 redds were observed in a 1.5 km section (river km 24.0-25.5). Summary plots of water temperature for Bradford Creek, Sandown Creek, Buhl Creek, and Skookumchuck Creek at three locations suggested that water temperatures were within the temperature range preferred by bull trout for spawning, egg incubation, and rearing

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

Toward the Soundness of Sense Structure Definitions in Thesaurus-Dictionaries. Parsing Problems and Solutions

Directory of Open Access Journals (Sweden)

Neculai Curteanu

2012-10-01

Full Text Available In this paper we point out some difficult problems of thesaurus-dictionary entry parsing, relying on the parsing technology of SCD (Segmentation-Cohesion-Dependency configurations, successfully applied on six largest thesauri -- Romanian (2, French, German (2, and Russian. \\textbf{Challenging Problems:} \\textbf{(a}~Intricate and~/~or recursive structures of the lexicographic segments met in the entries of certain thesauri; \\textbf{(b}~Cyclicity (recursive calls of some sense marker classes on marker sequences; \\textbf{(c}~Establishing the hypergraph-driven dependencies between all the atomic and non-atomic sense definitions. Classical approach to solve these parsing problems is hard mainly because of depth-first search of sense definitions and markers, the substantial complexity of entries, and the sense tree dynamic construction embodied within these parsers. \\textbf{SCD-based Parsing Solutions:} \\textbf{(a}~The SCD parsing method is a procedural tool, completely formal grammar-free, handling the recursive structure of the lexicographic segments by procedural non-recursive calls performed on the SCD parsing configurations of the entry structure. \\textbf{(b}~For dealing with cyclicity (recursive calls between secondary sense markers and the sense enumeration markers, we proposed the Enumeration Closing Condition, sometimes coupled with New{\\_}Paragraphs typographic markers transformed into numeral sense enumeration. \\textbf{(c}~These problems, their lexicographic modeling and parsing solutions are addressed to both dictionary parser programmers to experience the SCD-based parsing method, as well as to lexicographers and thesauri designers for tailoring balanced lexical-semantics granularities and sounder sense tree definitions of the dictionary entries.

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

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

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

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.

RatBot: anti-enumeration peer-to-peer botnets

Energy Technology Data Exchange (ETDEWEB)

Yan, Guanhua [Los Alamos National Laboratory; Eidenbenz, Stephan [Los Alamos National Laboratory; Chen, Songqing [GEORGE MASON UNIV.

2010-01-01

Botnets have emerged as one of the most severe cyber threats in recent years. To obtain high resilience against a single point of failure, the new generation of botnets have adopted the peer-to-peer (P2P) structure. One critical question regarding these P2P botnets is: how big are they indeed? To address this question, researchers have proposed both actively crawling and passively monitoring methods to enumerate existing P2P botnets. In this work, we go further to explore the potential strategies that botnets may have to obfuscate their true sizes. Towards this end, this paper introduces RatBot, a P2P botnet that applies some statistical techniques to defeat existing P2P botnet enumeration methods. The key ideas of RatBot are two-fold: (1) there exist a fraction of bots that are indistinguishable from their fake identities, which are spoofing IP addresses they use to hide themselves; (2) we use a heavy-tailed distribution to generate the number of fake identities for each of these bots so that the sum of observed fake identities converges only slowly and thus has high variation. We use large-scale high-fidelity simulation to quantify the estimation errors under diverse settings, and the results show that a naive enumeration technique can overestimate the sizes of P2P botnets by one order of magnitude. We believe that our work reveals new challenges of accurately estimating the sizes of P2P botnets, and hope that it will raise the awareness of security practitioners with these challenges. We further suggest a few countermeasures that can potentially defeat RatBot's anti-enumeration scheme.

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

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

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

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.

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

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.

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

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…

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

21 CFR 866.4700 - Automated fluorescence in situ hybridization (FISH) enumeration systems.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Automated fluorescence in situ hybridization (FISH... Laboratory Equipment and Reagents § 866.4700 Automated fluorescence in situ hybridization (FISH) enumeration... Hybridization (FISH) Enumeration Systems.” See § 866.1(e) for the availability of this guidance document. [70 FR...

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

TEMA and Dot Enumeration Profiles Predict Mental Addition Problem Solving Speed Longitudinally.

Science.gov (United States)

Major, Clare S; Paul, Jacob M; Reeve, Robert A

2017-01-01

Different math indices can be used to assess math potential at school entry. We evaluated whether standardized math achievement (TEMA-2 performance), core number abilities (dot enumeration, symbolic magnitude comparison), non-verbal intelligence (NVIQ) and visuo-spatial working memory (VSWM), in combination or separately, predicted mental addition problem solving speed over time. We assessed 267 children's TEMA-2, magnitude comparison, dot enumeration, and VSWM abilities at school entry (5 years) and NVIQ at 8 years. Mental addition problem solving speed was assessed at 6, 8, and 10 years. Longitudinal path analysis supported a model in which dot enumeration performance ability profiles and previous mental addition speed predicted future mental addition speed on all occasions, supporting a componential account of math ability. Standardized math achievement and NVIQ predicted mental addition speed at specific time points, while VSWM and symbolic magnitude comparison did not contribute unique variance to the model. The implications of using standardized math achievement and dot enumeration ability to index math learning potential at school entry are discussed.

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.

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

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)

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

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

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)

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

Enumeration of minimal stoichiometric precursor sets in metabolic networks.

Science.gov (United States)

Andrade, Ricardo; Wannagat, Martin; Klein, Cecilia C; Acuña, Vicente; Marchetti-Spaccamela, Alberto; Milreu, Paulo V; Stougie, Leen; Sagot, Marie-France

2016-01-01

What an organism needs at least from its environment to produce a set of metabolites, e.g. target(s) of interest and/or biomass, has been called a minimal precursor set. Early approaches to enumerate all minimal precursor sets took into account only the topology of the metabolic network (topological precursor sets). Due to cycles and the stoichiometric values of the reactions, it is often not possible to produce the target(s) from a topological precursor set in the sense that there is no feasible flux. Although considering the stoichiometry makes the problem harder, it enables to obtain biologically reasonable precursor sets that we call stoichiometric. Recently a method to enumerate all minimal stoichiometric precursor sets was proposed in the literature. The relationship between topological and stoichiometric precursor sets had however not yet been studied. Such relationship between topological and stoichiometric precursor sets is highlighted. We also present two algorithms that enumerate all minimal stoichiometric precursor sets. The first one is of theoretical interest only and is based on the above mentioned relationship. The second approach solves a series of mixed integer linear programming problems. We compared the computed minimal precursor sets to experimentally obtained growth media of several Escherichia coli strains using genome-scale metabolic networks. The results show that the second approach efficiently enumerates minimal precursor sets taking stoichiometry into account, and allows for broad in silico studies of strains or species interactions that may help to understand e.g. pathotype and niche-specific metabolic capabilities. sasita is written in Java, uses cplex as LP solver and can be downloaded together with all networks and input files used in this paper at http://www.sasita.gforge.inria.fr.

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.

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

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.

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.

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

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.

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

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.

Impact of enumeration method on diversity of Escherichia coli genotypes isolated from surface water.

Science.gov (United States)

Martin, E C; Gentry, T J

2016-11-01

There are numerous regulatory-approved Escherichia coli enumeration methods, but it is not known whether differences in media composition and incubation conditions impact the diversity of E. coli populations detected by these methods. A study was conducted to determine if three standard water quality assessments, Colilert ® , USEPA Method 1603, (modified mTEC) and USEPA Method 1604 (MI), detect different populations of E. coli. Samples were collected from six watersheds and analysed using the three enumeration approaches followed by E. coli isolation and genotyping. Results indicated that the three methods generally produced similar enumeration data across the sites, although there were some differences on a site-by-site basis. The Colilert ® method consistently generated the least diverse collection of E. coli genotypes as compared to modified mTEC and MI, with those two methods being roughly equal to each other. Although the three media assessed in this study were designed to enumerate E. coli, the differences in the media composition, incubation temperature, and growth platform appear to have a strong selective influence on the populations of E. coli isolated. This study suggests that standardized methods of enumeration and isolation may be warranted if researchers intend to obtain individual E. coli isolates for further characterization. This study characterized the impact of three USEPA-approved Escherichia coli enumeration methods on observed E. coli population diversity in surface water samples. Results indicated that these methods produced similar E. coli enumeration data but were more variable in the diversity of E. coli genotypes observed. Although the three methods enumerate the same species, differences in media composition, growth platform, and incubation temperature likely contribute to the selection of different cultivable populations of E. coli, and thus caution should be used when implementing these methods interchangeably for

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.

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.

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.

Method to enumerate oocysts of cryptosporidium and cysts of Giardia in water

International Nuclear Information System (INIS)

Briancesco, R.; Bonadonna, L.

2000-01-01

Cryptosporidium and Giardia have been recognized as etiological agents of gastrointestinal illness in humans with severe consequences on children and immunocompromised individuals. Water seems to be vehicle of infection. In last years many efforts have been done to evaluate a method to enumerate oocysts of Cryptosporidium and cysts of Giardia in waters. Throughout filtration and concentration steps, the two procedures proposed allow to enumerate oocysts and cysts belonging to the two genera of protozoa [it

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

Enumeration of Rectangles in a Tableau Shape

Science.gov (United States)

Mingus, Tabitha T. Y.; Grassl, Richard M.; Diaz, Ricardo; Andrew, Lane; Parker, Frieda

2010-01-01

This article analyzes the challenge of counting the number of rectangles of all sizes in the n-tableau and to provide a combinatorial reason for the answer. The authors present a solution on enumerating rectangles in the n-tableau using Grassl and Mingus results. The authors demonstrate their conjecture for the n-tableau and attempt to apply their…

Emergency department admissions are more profitable than non-emergency department admissions.

Science.gov (United States)

Henneman, Philip L; Lemanski, Michael; Smithline, Howard A; Tomaszewski, Andrew; Mayforth, Janice A

2009-02-01

We compare the contribution margin per case per hospital day of emergency department (ED) admissions with non-ED admissions in a single hospital, a 600-bed, academic, tertiary referral, Level I trauma center with an annual ED census of 100,000. This was a retrospective comparison of the contribution margin per case per day for ED and non-ED inpatient admissions for fiscal years 2003, 2004, and 2005 (October 1 through September 30). Contribution margin is defined as net revenue minus total direct costs; it is then expressed per case per hospital day. Service lines are a set of linked patient care services. Observation admissions and outpatient services are not included. Resident expenses (eg, salary and benefits) and revenue (ie, Medicare payment of indirect medical expenses and direct medical expenses) are not included. Overhead expenses are not included (eg, building maintenance, utilities, information services support, administrative services). For fiscal year 2003 through fiscal year 2005, there were 51,213 ED and 57,004 non-ED inpatient admissions. Median contribution margin per day for ED admissions was higher than for non-ED admissions: ED admissions $769 (interquartile range $265 to $1,493) and non-ED admissions $595 (interquartile range $178 to $1,274). Median contribution margin per day varied by site of admissions, by diagnosis-related group, by service line, and by insurance type. In summary, ED admissions in our institution generate a higher contribution margin per day than non-ED admissions.

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.

Enumeration, isolation and identification of bacteria and fungi from ...

African Journals Online (AJOL)

Enumeration, isolation and identification of bacteria and fungi from soil contaminated with petroleum products ... dropping can be useful in the bioremediation of soil contaminated with petroleum products and possibly other oil polluted sites.

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

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

Enumeration of self-avoiding walks on the square lattice

International Nuclear Information System (INIS)

Jensen, Iwan

2004-01-01

We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points have been derived to length 59. An analysis of the resulting series yields accurate estimates of the critical exponents γ and ν confirming predictions of their exact values. Likewise we obtain accurate amplitude estimates yielding precise values for certain universal amplitude combinations. Finally we report on an analysis giving compelling evidence that the leading non-analytic correction-to-scaling exponent Δ 1 = 3/2

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.

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.

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.

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.

[Evaluation of hospital admissions: admission guidelines implementation in a pediatric emergency department].

Science.gov (United States)

Katz, Manuel; Warshawsky, Sheila S; Rosen, Shirley; Barak, Nurit; Press, Joseph

2004-10-01

To develop and implement locally tailored pediatric admission guidelines for use in a pediatric emergency department and evaluate the appropriateness of admissions based on these guidelines. Our Study was based on the development of admission guidelines by senior physicians, using the Delphi Consensus Process, for use in the Pediatric Emergency Department (PED) at Soroka University Medical Center (Soroka). We evaluated the appropriateness of admissions to the pediatric departments of Soroka on 33 randomly selected days in 1999 and 2000 prior to guideline implementation and 30 randomly selected days in 2001, after guideline implementation. A total of 1037 files were evaluated. A rate of 12.4% inappropriate admissions to the pediatric departments was found based on locally tailored admission guidelines. There was no change in the rate of inappropriate admissions after implementation of admission guidelines in PED. Inappropriate admissions were associated with age above 3 years, hospital stay of two days or less and the season. The main reasons for evaluating an admission as inappropriate were that the admission did not comply with the guidelines and that the case could be managed in an ambulatory setting. There were distinctive differences in the characteristics of the Bedouin and Jewish populations admitted to the pediatric departments, although no difference was found in the rate of inappropriate admissions between these populations. Patient management in Soroka PED is tailored to the conditions of this medical center and to the characteristics of the population it serves. The admission guidelines developed reflect these special conditions. Lack of change in the rate of inappropriate admissions following implementation of the guidelines indicates that the guidelines reflect the physicians' approach to patient management that existed in Soroka PED prior to guideline implementation. Hospital admission guidelines have a role in the health management system; however

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.

A combinatorial enumeration problem of RNA secondary structures

African Journals Online (AJOL)

use

2011-12-21

Dec 21, 2011 ... interesting combinatorial questions (Chen et al., 2005;. Liu, 2006; Schmitt and Waterman 1994; Stein and. Waterman 1978). The research on the enumeration of. RNA secondary structures becomes one of the hot topics in Computational Molecular Biology. An RNA molecule is described by its sequences of.

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

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

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.

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…

Probiotic bacteria: selective enumeration and survival in dairy foods.

Science.gov (United States)

Shah, N P

2000-04-01

A number of health benefits have been claimed for probiotic bacteria such as Lactobacillus acidophilus, Bifidobacterium spp., and Lactobacillus casei. Because of the potential health benefits, these organisms are increasingly incorporated into dairy foods. However, studies have shown low viability of probiotics in market preparations. In order to assess viability of probiotic bacteria, it is important to have a working method for selective enumeration of these probiotic bacteria. Viability of probiotic bacteria is important in order to provide health benefits. Viability of probiotic bacteria can be improved by appropriate selection of acid and bile resistant strains, use of oxygen impermeable containers, two-step fermentation, micro-encapsulation, stress adaptation, incorporation of micronutrients such as peptides and amino acids and by sonication of yogurt bacteria. This review will cover selective enumeration and survival of probiotic bacteria in dairy foods.

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

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)

Evaluation of culture media for selective enumeration of bifidobacteria and lactic acid bacteria

Directory of Open Access Journals (Sweden)

Judit Süle

2014-09-01

Full Text Available The purpose of this study was to test the suitability of Transgalactosylated oligosaccharides-mupirocin lithium salt (TOS-MUP and MRS-clindamycin-ciprofloxacin (MRS-CC agars, along with several other culture media, for selectively enumerating bifidobacteria and lactic acid bacteria (LAB species commonly used to make fermented milks. Pure culture suspensions of a total of 13 dairy bacteria strains, belonging to eight species and five genera, were tested for growth capability under various incubation conditions. TOS-MUP agar was successfully used for the selective enumeration of both Bifidobacterium animalis subsp. lactis BB-12 and B. breve M-16 V. MRS-CC agar showed relatively good selectivity for Lactobacillus acidophilus, however, it also promoted the growth of Lb. casei strains. For this reason, MRS-CC agar can only be used as a selective medium for the enumeration of Lb. acidophilus if Lb. casei is not present in a product at levels similar to or exceeding those of Lb. acidophilus. Unlike bifidobacteria and coccus-shaped LAB, all the lactobacilli strains involved in this work were found to grow well in MRS pH 5.4 agar incubated under anaerobiosis at 37 °C for 72 h. Therefore, this method proved to be particularly suitable for the selective enumeration of Lactobacillus spp.

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.

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.

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.

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

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

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.

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

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.

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…

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

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)

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.

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.

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

Mupirocin-mucin agar for selective enumeration of Bifidobacterium bifidum

Czech Academy of Sciences Publication Activity Database

Pechar, R.; Rada, V.; Parafati, L.; Musilová, S.; Bunešová, V.; Vlková, E.; Killer, Jiří; Mrázek, Jakub; Kmeť, V.; Svejštil, R.

2014-01-01

Roč. 191, č. 1 (2014), s. 32-35 ISSN 0168-1605 R&D Projects: GA ČR GA13-08803S Institutional support: RVO:67985904 Keywords : probiotics * Bifidobacterium bifidum * selective enumeration Subject RIV: EE - Microbiology, Virology Impact factor: 3.082, year: 2014

A state enumeration of the foil knot

OpenAIRE

Ramaharo, Franck; Rakotondrajao, Fanja

2017-01-01

We split the crossings of the foil knot and enumerate the resulting states with a generating polynomial. Unexpectedly, the number of such states which consist of two components are given by the lazy caterer's sequence. This sequence describes the maximum number of planar regions that is obtained with a given number of straight lines. We then establish a bijection between this partition of the plane and the concerned foil splits sequence.

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

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

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.

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

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

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)

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)

Enumeration of smallest intervention strategies in genome-scale metabolic networks.

Directory of Open Access Journals (Sweden)

Axel von Kamp

2014-01-01

Full Text Available One ultimate goal of metabolic network modeling is the rational redesign of biochemical networks to optimize the production of certain compounds by cellular systems. Although several constraint-based optimization techniques have been developed for this purpose, methods for systematic enumeration of intervention strategies in genome-scale metabolic networks are still lacking. In principle, Minimal Cut Sets (MCSs; inclusion-minimal combinations of reaction or gene deletions that lead to the fulfilment of a given intervention goal provide an exhaustive enumeration approach. However, their disadvantage is the combinatorial explosion in larger networks and the requirement to compute first the elementary modes (EMs which itself is impractical in genome-scale networks. We present MCSEnumerator, a new method for effective enumeration of the smallest MCSs (with fewest interventions in genome-scale metabolic network models. For this we combine two approaches, namely (i the mapping of MCSs to EMs in a dual network, and (ii a modified algorithm by which shortest EMs can be effectively determined in large networks. In this way, we can identify the smallest MCSs by calculating the shortest EMs in the dual network. Realistic application examples demonstrate that our algorithm is able to list thousands of the most efficient intervention strategies in genome-scale networks for various intervention problems. For instance, for the first time we could enumerate all synthetic lethals in E.coli with combinations of up to 5 reactions. We also applied the new algorithm exemplarily to compute strain designs for growth-coupled synthesis of different products (ethanol, fumarate, serine by E.coli. We found numerous new engineering strategies partially requiring less knockouts and guaranteeing higher product yields (even without the assumption of optimal growth than reported previously. The strength of the presented approach is that smallest intervention strategies can be

Immunophenotypic enumeration of CD4 + T-lymphocyte values in ...

African Journals Online (AJOL)

Background: The enumeration of CD4+ T-lymphocytes in Human Immunodeficiency Virus (HIV)-infected individuals is an essential tool for staging HIV disease, to make decisions for initiation of anti-retroviral therapy (ART), for monitoring response to ART and to initiate chemoprophylaxis against opportunistic infections.

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.

Enumeration of small collections violates Weber's law.

Science.gov (United States)

Choo, H; Franconeri, S L

2014-02-01

In a phenomenon called subitizing, we can immediately generate exact counts of small collections (one to three objects), in contrast to larger collections, for which we must either create rough estimates or serially count. A parsimonious explanation for this advantage for small collections is that noisy representations of small collections are more tolerable, due to the larger relative differences between consecutive numbers (e.g., 2 vs. 3 is a 50 % increase, but 10 vs. 11 is only a 10 % increase). In contrast, the advantage could stem from the fact that small-collection enumeration is more precise, relying on a unique mechanism. Here, we present two experiments that conclusively showed that the enumeration of small collections is indeed "superprecise." Participants compared numerosity within either small or large visual collections in conditions in which the relative differences were controlled (e.g., performance for 2 vs. 3 was compared with performance for 20 vs. 30). Small-number comparison was still faster and more accurate, across both "more-fewer" judgments (Exp. 1), and "same-different" judgments (Exp. 2). We then reviewed the remaining potential mechanisms that might underlie this superprecision for small collections, including the greater diagnostic value of visual features that correlate with number and a limited capacity for visually individuating objects.

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

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.

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.

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.

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

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

Sensitive enumeration of Listeria monocytogenes and other Listeria species in various naturally contaminated matrices using a membrane filtration method.

Science.gov (United States)

Barre, Léna; Brasseur, Emilie; Doux, Camille; Lombard, Bertrand; Besse, Nathalie Gnanou

2015-06-01

For the enumeration of Listeria monocytogenes (L. monocytogenes) in food, a sensitive enumeration method has been recently developed. This method is based on a membrane filtration of the food suspension followed by transfer of the filter on a selective medium to enumerate L. monocytogenes. An evaluation of this method was performed with several categories of foods naturally contaminated with L. monocytogenes. The results obtained with this technique were compared with those obtained from the modified reference EN ISO 11290-2 method for the enumeration of L. monocytogenes in food, and are found to provide more precise results. In most cases, the filtration method enabled to examine a greater quantity of food thus greatly improving the sensitivity of the enumeration. However, it was hardly applicable to some food categories because of filtration problems and background microbiota interference. Copyright © 2014 Elsevier Ltd. All rights reserved.

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.

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.

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.

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.

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.

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.

BACTERIOLOGICAL PROPERTIES OF MARINE WATER IN ADRIATIC FISH FARMS: ENUMERATION OF HETEROTROPHIC BACTERIA

Directory of Open Access Journals (Sweden)

Emin Teskeredžić

2012-12-01

Full Text Available Aquaculture is currently one of the fastest growing food production sectors in the world. Increase in nutrients and organic wastes lead to general deterioration of water quality. The problem of water quality is associated with both physical and chemical factors, as well as microbiological water quality. Heterotrophic bacteria play an important role in the process of decomposition of organic matter in water environment and indicate eutrophication process. Here we present our experience and knowledge on bacterial properties of marine water in the Adriatic fish farms with European sea bass (Dicentrarchus labrax L., 1758, with an emphasis on enumeration of heterotrophic bacteria in marine water. We applied two temperatures of incubation, as well as two methods for enumeration of heterotrophic bacteria: substrate SimPlate® test and spread plate method on conventional artificial media (Marine agar and Tryptic Soy agar with added NaCl. The results of analysis of bacteriological properties of marine water in the Adriatic fish farms showed that enumeration of heterotrophic bacteria in marine water depends on the applied incubation temperature and media for enumeration. At the same time, the incubation temperature of 22C favours more intense growth of marine heterotrophic bacteria, whereas a SimPlate test gives higher values of heterotrophic bacteria. Volatile values of heterotrophic bacteria during this research indicate a possible deterioration of microbiological water quality in the Adriatic fish farms and a need for regular monitoring of marine water quality.

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.

Enumeration of connected Catalan objects by type

OpenAIRE

Rhoades, Brendon

2010-01-01

Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We define a notion of `connectivity' for these objects and prove an analogous product formula which counts connected objects by type. Our proof of this product formula is combinatorial and bijective. We extend this to a product formula which counts objects wit...

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)

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

MacWilliams Identity for M-Spotty Weight Enumerator

Science.gov (United States)

Suzuki, Kazuyoshi; Fujiwara, Eiji

M-spotty byte error control codes are very effective for correcting/detecting errors in semiconductor memory systems that employ recent high-density RAM chips with wide I/O data (e.g., 8, 16, or 32bits). In this case, the width of the I/O data is one byte. A spotty byte error is defined as random t-bit errors within a byte of length b bits, where 1 le t ≤ b. Then, an error is called an m-spotty byte error if at least one spotty byte error is present in a byte. M-spotty byte error control codes are characterized by the m-spotty distance, which includes the Hamming distance as a special case for t =1 or t = b. The MacWilliams identity provides the relationship between the weight distribution of a code and that of its dual code. The present paper presents the MacWilliams identity for the m-spotty weight enumerator of m-spotty byte error control codes. In addition, the present paper clarifies that the indicated identity includes the MacWilliams identity for the Hamming weight enumerator as a special case.

Constellations of gaps in Eratosthenes sieve

OpenAIRE

Holt, Fred B.

2015-01-01

A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences are known as constellations. Over the last year we identified a discrete linear system that exactly models the population of any gap across all stages of the sieve. In August 2014 we summarized our results from analyzing this discrete model on populations of...

Comparison of media for enumeration of Clostridium perfringens from foods

NARCIS (Netherlands)

Jong, A.E.I. de; Eijhusen, G.P.; Brouwer-Post, E.J.F.; Grand, M.; Johansson, T.; Kärkkäinen, T.; Marugg, J.; Veld, P.H. in 't; Warmerdam, F.H.M.; Wörner, G.; Zicavo, A.; Rombouts, F.M.; Beumer, R.R.

2003-01-01

Many media have been developed to enumerate Clostridium perfringens from foods. In this study, six media [iron sulfite (IS) agar, tryptose sulfite cycloserine (TSC) agar, Shahidi Ferguson perfringens (SFP) agar, sulfite cycloserine azide (SCA), differential clostridial agar (DCA), and oleandomycin

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

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

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

Automated Mobile System for Accurate Outdoor Tree Crop Enumeration Using an Uncalibrated Camera.

Science.gov (United States)

Nguyen, Thuy Tuong; Slaughter, David C; Hanson, Bradley D; Barber, Andrew; Freitas, Amy; Robles, Daniel; Whelan, Erin

2015-07-28

This paper demonstrates an automated computer vision system for outdoor tree crop enumeration in a seedling nursery. The complete system incorporates both hardware components (including an embedded microcontroller, an odometry encoder, and an uncalibrated digital color camera) and software algorithms (including microcontroller algorithms and the proposed algorithm for tree crop enumeration) required to obtain robust performance in a natural outdoor environment. The enumeration system uses a three-step image analysis process based upon: (1) an orthographic plant projection method integrating a perspective transform with automatic parameter estimation; (2) a plant counting method based on projection histograms; and (3) a double-counting avoidance method based on a homography transform. Experimental results demonstrate the ability to count large numbers of plants automatically with no human effort. Results show that, for tree seedlings having a height up to 40 cm and a within-row tree spacing of approximately 10 cm, the algorithms successfully estimated the number of plants with an average accuracy of 95.2% for trees within a single image and 98% for counting of the whole plant population in a large sequence of images.

Accuracy and impact of spatial aids based upon satellite enumeration to improve indoor residual spraying spatial coverage.

Science.gov (United States)

Bridges, Daniel J; Pollard, Derek; Winters, Anna M; Winters, Benjamin; Sikaala, Chadwick; Renn, Silvia; Larsen, David A

2018-02-23

Indoor residual spraying (IRS) is a key tool in the fight to control, eliminate and ultimately eradicate malaria. IRS protection is based on a communal effect such that an individual's protection primarily relies on the community-level coverage of IRS with limited protection being provided by household-level coverage. To ensure a communal effect is achieved through IRS, achieving high and uniform community-level coverage should be the ultimate priority of an IRS campaign. Ensuring high community-level coverage of IRS in malaria-endemic areas is challenging given the lack of information available about both the location and number of households needing IRS in any given area. A process termed 'mSpray' has been developed and implemented and involves use of satellite imagery for enumeration for planning IRS and a mobile application to guide IRS implementation. This study assessed (1) the accuracy of the satellite enumeration and (2) how various degrees of spatial aid provided through the mSpray process affected community-level IRS coverage during the 2015 spray campaign in Zambia. A 2-stage sampling process was applied to assess accuracy of satellite enumeration to determine number and location of sprayable structures. Results indicated an overall sensitivity of 94% for satellite enumeration compared to finding structures on the ground. After adjusting for structure size, roof, and wall type, households in Nchelenge District where all types of satellite-based spatial aids (paper-based maps plus use of the mobile mSpray application) were used were more likely to have received IRS than Kasama district where maps used were not based on satellite enumeration. The probability of a household being sprayed in Nchelenge district where tablet-based maps were used, did not differ statistically from that of a household in Samfya District, where detailed paper-based spatial aids based on satellite enumeration were provided. IRS coverage from the 2015 spray season benefited from

Recursive and non-linear logistic regression: moving on from the original EuroSCORE and EuroSCORE II methodologies.

Science.gov (United States)

Poullis, Michael

2014-11-01

EuroSCORE II, despite improving on the original EuroSCORE system, has not solved all the calibration and predictability issues. Recursive, non-linear and mixed recursive and non-linear regression analysis were assessed with regard to sensitivity, specificity and predictability of the original EuroSCORE and EuroSCORE II systems. The original logistic EuroSCORE, EuroSCORE II and recursive, non-linear and mixed recursive and non-linear regression analyses of these risk models were assessed via receiver operator characteristic curves (ROC) and Hosmer-Lemeshow statistic analysis with regard to the accuracy of predicting in-hospital mortality. Analysis was performed for isolated coronary artery bypass grafts (CABGs) (n = 2913), aortic valve replacement (AVR) (n = 814), mitral valve surgery (n = 340), combined AVR and CABG (n = 517), aortic (n = 350), miscellaneous cases (n = 642), and combinations of the above cases (n = 5576). The original EuroSCORE had an ROC below 0.7 for isolated AVR and combined AVR and CABG. None of the methods described increased the ROC above 0.7. The EuroSCORE II risk model had an ROC below 0.7 for isolated AVR only. Recursive regression, non-linear regression, and mixed recursive and non-linear regression all increased the ROC above 0.7 for isolated AVR. The original EuroSCORE had a Hosmer-Lemeshow statistic that was above 0.05 for all patients and the subgroups analysed. All of the techniques markedly increased the Hosmer-Lemeshow statistic. The EuroSCORE II risk model had a Hosmer-Lemeshow statistic that was significant for all patients (P linear regression failed to improve on the original Hosmer-Lemeshow statistic. The mixed recursive and non-linear regression using the EuroSCORE II risk model was the only model that produced an ROC of 0.7 or above for all patients and procedures and had a Hosmer-Lemeshow statistic that was highly non-significant. The original EuroSCORE and the EuroSCORE II risk models do not have adequate ROC and Hosmer

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‎

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

Optimisation of a direct plating method for the detection and enumeration of Alicyclobacillus acidoterrestris spores.

Science.gov (United States)

Henczka, Marek; Djas, Małgorzata; Filipek, Katarzyna

2013-01-01

A direct plating method for the detection and enumeration of Alicyclobacillus acidoterrestris spores has been optimised. The results of the application of four types of growth media (BAT agar, YSG agar, K agar and SK agar) regarding the recovery and enumeration of A. acidoterrestris spores were compared. The influence of the type of applied growth medium, heat shock conditions, incubation temperature, incubation time, plating technique and the presence of apple juice in the sample on the accuracy of the detection and enumeration of A. acidoterrestris spores was investigated. Among the investigated media, YSG agar was the most sensitive medium, and its application resulted in the highest recovery of A. acidoterrestris spores, while K agar and BAT agar were the least suitable media. The effect of the heat shock time on the recovery of spores was negligible. When there was a low concentration of spores in a sample, the membrane filtration method was superior to the spread plating method. The obtained results show that heat shock carried out at 80°C for 10 min and plating samples in combination with membrane filtration on YSG agar, followed by incubation at 46°C for 3 days provided the optimal conditions for the detection and enumeration of A. acidoterrestris spores. Application of the presented method allows highly efficient, fast and sensitive identification and enumeration of A. acidoterrestris spores in food products. This methodology will be useful for the fruit juice industry for identifying products contaminated with A. acidoterrestris spores, and its practical application may prevent economic losses for manufacturers. Copyright © 2012 Elsevier B.V. All rights reserved.

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

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.

Peadiatric social admission

OpenAIRE

Carter Anand, Janet

2009-01-01

The phenomenon of paediatric social admission describes the hospitalisation of children for medicallynon- urgent and/or social reasons. Much of the research in this field has been in relation to avoidable admissions which have been identified, studied and condoned based on strict medical criteria. Such research has tended to mask the significance of social factors and the commonplace practice of Paediatric Social Admission. This paper examines decision making from the perspective of the healt...

Enumeration of Enterobacter cloacae after chloramine exposure.

OpenAIRE

Watters, S K; Pyle, B H; LeChevallier, M W; McFeters, G A

1989-01-01

Growth of Enterobacter cloacae on various media was compared after disinfection. This was done to examine the effects of monochloramine and chlorine on the enumeration of coliforms. The media used were TLY (nonselective; 5.5% tryptic soy broth, 0.3% yeast extract, 1.0% lactose, and 1.5% Bacto-Agar), m-T7 (selective; developed to recover injured coliforms), m-Endo (selective; contains sodium sulfite), TLYS (TLY with sodium sulfite), and m-T7S (m-T7 with sodium sulfite). Sodium sulfite in any m...

Enumeration of petroleum hydrocarbon utilizing bacteria

International Nuclear Information System (INIS)

Mukherjee, S.; Barot, M.; Levine, A.D.

1996-01-01

In-situ biological treatment is one among a number of emerging technologies that may be applied to the remediation of contaminated soils and groundwater. In 1985, a surface spill of 1,500 gallons of dielectric transformer oil at the Sandia National Laboratories (HERMES II facility) resulted in contamination of soil up to depths of 160 feet. The extent of contamination and site characteristics favored the application of in-situ bioremediation as a potential remedial technology. The purpose of this research was to enumerate indigenous microbial populations capable of degrading petroleum hydrocarbons. Microbial enumeration and characterization methods suitably adapted for hydrocarbon utilizing bacteria were used as an indicator of the presence of viable microbial consortia in excavated oil samples with hydrocarbon (TPH) concentrations ranging from 300 to 26,850 ppm. Microbial activity was quantified by direct and streak plating soil samples on silica gel media. Effects of toxicity and temperature were studied using batch cultures of hydrocarbon utilizing bacteria (selectively isolated in an enrichment medium), at temperatures of 20 and 35 C. It was concluded from this study that it is possible to isolate native microorganisms from contaminated soils from depths of 60 to 160 feet, and with oil concentration ranging from 300 to 26,850 ppm. About 62% of the microorganisms isolated form the contaminated soil were capable of using contaminant oil as a substrate for growth and metabolism under aerobic conditions. Growth rates were observed to be 50% higher for the highest contaminant concentration at 20 C. Resistance to toxicity to contaminant oil was also observed to be greater at 20 C than at 35 C

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

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

Dense module enumeration in biological networks

Science.gov (United States)

Tsuda, Koji; Georgii, Elisabeth

2009-12-01

Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.

Dense module enumeration in biological networks

International Nuclear Information System (INIS)

Tsuda, Koji; Georgii, Elisabeth

2009-01-01

Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.

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

Resonance – Journal of Science Education | Indian Academy of ...

Indian Academy of Sciences (India)

https://www.ias.ac.in/article/fulltext/reso/020/10/0880-0892. Keywords. Combinatorial proof; algebraic proof; binomial coefficient; recursive relation; ordered pair; triple; chessboard; square; cube; fourth power; enumeration. Author Affiliations. Shailesh A Shirali1. Sahyadri School Tiwai Hill, Rajgurunagar Pune 410 513, India.

The isolation, enumeration, and characterization of Rhizobium bacteria of the soil in Wamena Biological Garden

Directory of Open Access Journals (Sweden)

SRI PURWANINGSIH

2005-04-01

Full Text Available The eleven soil samples have been isolated and characterized. The aims of the study were to get the pure culture and some data which described about enumeration and especially their characters in relation to the acids and bases reaction in their growth. The isolation of the bacteria use Yeast Extract Mannitol Agar medium (YEMA while the characterization by using YEMA medium mixed with Brom Thymol Blue and Congo Red indicators respectively. The results showed that eighteen isolates have been isolated which consisted of three low growing and fifteen fast growing bacteria. Two isolates were not indicated Rhizobium and sixteen were Rhizobium. Density of Rhizobium enumeration was varied which related to soil organic matter content. The enumeration bacteria in YEMA medium were in the range of 0.6 x 105 and 11.6 x 105 CFU /g soil. The highest population was found in soil sample of Wieb vegetation.

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.

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.

Automated Mobile System for Accurate Outdoor Tree Crop Enumeration Using an Uncalibrated Camera

Directory of Open Access Journals (Sweden)

Thuy Tuong Nguyen

2015-07-01

Full Text Available This paper demonstrates an automated computer vision system for outdoor tree crop enumeration in a seedling nursery. The complete system incorporates both hardware components (including an embedded microcontroller, an odometry encoder, and an uncalibrated digital color camera and software algorithms (including microcontroller algorithms and the proposed algorithm for tree crop enumeration required to obtain robust performance in a natural outdoor environment. The enumeration system uses a three-step image analysis process based upon: (1 an orthographic plant projection method integrating a perspective transform with automatic parameter estimation; (2 a plant counting method based on projection histograms; and (3 a double-counting avoidance method based on a homography transform. Experimental results demonstrate the ability to count large numbers of plants automatically with no human effort. Results show that, for tree seedlings having a height up to 40 cm and a within-row tree spacing of approximately 10 cm, the algorithms successfully estimated the number of plants with an average accuracy of 95.2% for trees within a single image and 98% for counting of the whole plant population in a large sequence of images.

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.

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.

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.

Planar articulated mechanism design by graph theoretical enumeration

DEFF Research Database (Denmark)

Kawamoto, A; Bendsøe, Martin P.; Sigmund, Ole

2004-01-01

This paper deals with design of articulated mechanisms using a truss-based ground-structure representation. By applying a graph theoretical enumeration approach we can perform an exhaustive analysis of all possible topologies for a test example for which we seek a symmetric mechanism. This guaran....... This guarantees that one can identify the global optimum solution. The result underlines the importance of mechanism topology and gives insight into the issues specific to articulated mechanism designs compared to compliant mechanism designs....

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.

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.

Enumeration and estimation of insect attack fruits of some cultivars ...

African Journals Online (AJOL)

In this study, five cultivars of Punica granatum identified (two of which are endemic, while the other three are new) were grown in certain farms at Al-Taif, Saudi Arabia. Enumeration to the insects attack its' fruits illustrated that, there are three insects, namely, Virchola livia, Ectomyelois ceratonia and Pseudococcus maitimus ...

Spatial working memory load affects counting but not subitizing in enumeration.

Science.gov (United States)

Shimomura, Tomonari; Kumada, Takatsune

2011-08-01

The present study investigated whether subitizing reflects capacity limitations associated with two types of working memory tasks. Under a dual-task situation, participants performed an enumeration task in conjunction with either a spatial (Experiment 1) or a nonspatial visual (Experiment 2) working memory task. Experiment 1 showed that spatial working memory load affected the slope of a counting function but did not affect subitizing performance or subitizing range. Experiment 2 showed that nonspatial visual working memory load affected neither enumeration efficiency nor subitizing range. Furthermore, in both spatial and nonspatial memory tasks, neither subitizing efficiency nor subitizing range was affected by amount of imposed memory load. In all the experiments, working memory load failed to influence slope, subitizing range, or overall reaction time. These findings suggest that subitizing is performed without either spatial or nonspatial working memory. A possible mechanism of subitizing with independent capacity of working memory is discussed.

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.

Performance of mycological media in enumerating desiccated food spoilage yeasts: an interlaboratory study.

Science.gov (United States)

Beuchat, L R; Frandberg, E; Deak, T; Alzamora, S M; Chen, J; Guerrero, A S; López-Malo, A; Ohlsson, I; Olsen, M; Peinado, J M; Schnurer, J; de Siloniz, M I; Tornai-Lehoczki, J

2001-10-22

Dichloran 18% glycerol agar (DG18) was originally formulated to enumerate nonfastidious xerophilic moulds in foods containing rapidly growing Eurotium species. Some laboratories are now using DG18 as a general purpose medium for enumerating yeasts and moulds, although its performance in recovering yeasts from dry foods has not been evaluated. An interlaboratory study compared DG18 with dichloran rose bengal chloramphenicol agar (DRBC), plate count agar supplemented with chloramphenicol (PCAC), tryptone glucose yeast extract chloramphenicol agar (TGYC), acidified potato dextrose agar (APDA), and orange serum agar (OSA) for their suitability to enumerate 14 species of lyophilized yeasts. The coefficient of variation for among-laboratories repeatability within yeast was 1.39% and reproducibility of counts among laboratories was 7.1%. The order of performance of media for recovering yeasts was TGYC > PCAC = OSA > APDA > DRBC > DG 18. A second study was done to determine the combined effects of storage time and temperature on viability of yeasts and suitability of media for recovery. Higher viability was retained at -18 degrees C than at 5 degrees C or 25 degrees C for up to 42 weeks, although the difference in mean counts of yeasts stored at -18 degrees C and 25 degrees C was only 0.78 log10 cfu/ml of rehydrated suspension. TGYC was equal to PCAC and superior to the other four media in recovering yeasts stored at -18 degrees C, 5 degrees C, or 25 degrees C for up to 42 weeks. Results from both the interlaboratory study and the storage study support the use of TGYC for enumerating desiccated yeasts. DG18 is not recommended as a general purpose medium for recovering yeasts from a desiccated condition.

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 .

Media for the isolation and enumeration of bifidobacteria in dairy products.

Science.gov (United States)

Roy, D

2001-09-28

Bifidobacteria are commonly used for the production of fermented milks, alone or in combination with other lactic acid bacteria. Bifidobacteria populations in fermented milks should be over 10(6) bifidobacteria/g at the time of consumption of strain added to the product. Hence, rapid and reliable methods are needed to routinely determine the initial inoculum and to estimate the storage time period bifidobacteria remain viable. Plate count methods are still preferable for quality control measurements in dairy products. It is, therefore, necessary to have a medium that selectively promotes the growth of bifidobacteria, whereas other bacteria are suppressed. The present paper is an overview of media and methods including summaries of published comparisons between different selective media. Culture media for bifidobacteria may be divided into basal, elective, differential and selective culture medium. Non-selective media are useful for routine enumeration of bifidobacteria when present in non-fermented milks. Reinforced Clostridial Agar and De Man Rogosa Sharpe (MRS) supplemented with cysteine and agar available commercially are the media of choice for industrial quality control laboratories. Several media for selective or differential isolation have been described for enumeration of bifidobacteria from other lactic acid bacteria. From the large number of selective media available, it can be concluded that there is no standard medium for the detection of bifidobacteria. However, Columbia agar base media supplemented with lithium chloride and sodium propionate and MRS medium supplemented with neomycin, paromomycin, nalidixic acid and lithium chloride can be recommended for selective enumeration of bifidobacteria in dairy products.

Development of an enumeration method for arsenic methylating bacteria from mixed culture samples.

Science.gov (United States)

Islam, S M Atiqul; Fukushi, Kensuke; Yamamoto, Kazuo

2005-12-01

Bacterial methylation of arsenic converts inorganic arsenic into volatile and non-volatile methylated species. It plays an important role in the arsenic cycle in the environment. Despite the potential environmental significance of AsMB, an assessment of their population size and activity remains unknown. This study has now established a protocol for enumeration of AsMB by means of the anaerobic-culture-tube, most probable number (MPN) method. Direct detection of volatile arsenic species is then done by GC-MS. This method is advantageous as it can simultaneously enumerate AsMB and acetate and formate-utilizing methanogens. The incubation time for this method was determined to be 6 weeks, sufficient time for AsMB growth.

Integer Set Compression and Statistical Modeling

DEFF Research Database (Denmark)

Larsson, N. Jesper

2014-01-01

enumeration of elements may be arbitrary or random, but where statistics is kept in order to estimate probabilities of elements. We present a recursive subset-size encoding method that is able to benefit from statistics, explore the effects of permuting the enumeration order based on element probabilities......Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher compression performance. In this work, we address the case where...

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

Miniaturized most probable number for the enumeration of Salmonella sp in artificially contaminated chicken meat

Directory of Open Access Journals (Sweden)

FL Colla

2014-03-01

Full Text Available Salmonella is traditionally identified by conventional microbiological tests, but the enumeration of this bacterium is not used on a routine basis. Methods such as the most probable number (MPN, which utilize an array of multiple tubes, are time-consuming and expensive, whereas miniaturized most probable number (mMPN methods, which use microplates, can be adapted for the enumeration of bacteria, saving up time and materials. The aim of the present paper is to assess two mMPN methods for the enumeration of Salmonella sp in artificially-contaminated chicken meat samples. Microplates containing 24 wells (method A and 96 wells (method B, both with peptone water as pre-enrichment medium and modified semi-solid Rappaport-Vassiliadis (MSRV as selective enrichment medium, were used. The meat matrix consisted of 25g of autoclaved ground chicken breast contaminated with dilutions of up to 10(6 of Salmonella Typhimurium (ST and Escherichia coli (EC. In method A, the dilution 10-5 of Salmonella Typhimurium corresponded to >57 MPN/mL and the dilution 10-6 was equal to 30 MPN/mL. There was a correlation between the counts used for the artificial contamination of the samples and those recovered by mMPN, indicating that the method A was sensitive for the enumeration of different levels of contamination of the meat matrix. In method B, there was no correlation between the inoculated dilutions and the mMPN results.

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

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.

The Effect of Enumeration of Self-Relevant Words on Self-Focused Attention and Repetitive Negative Thoughts

Science.gov (United States)

Muranaka, Seiji; Sasaki, Jun

2018-01-01

Self-focused attention refers to awareness of self-referent, internally generated information. It can be categorized into dysfunctional (i.e., self-rumination) and functional (self-reflection) aspects. According to theory on cognitive resource limitations (e.g., Moreno, 2006), there is a difference in cognitive resource allocation between these two aspects of self-focused attention. We propose a new task, self-relevant word (SRW) enumeration, that can aid in behaviorally identifying individuals’ use of self-rumination and self-reflection. The present study has two purposes: to determine the association between self-focus and SRW enumeration, and to examine the effect of dysfunctional SRW enumeration on repetitive negative thinking. One hundred forty-six undergraduate students participated in this study. They completed a measure of state anxiety twice, before and after imagining a social failure situation. They also completed the SRW enumeration task, Repetitive Thinking Questionnaire, Short Fear of Negative Evaluation Scale, and Rumination-Reflection Questionnaire. A correlational analysis indicated a significant positive correlation between self-reflection and the number of SRWs. Furthermore, individuals high in self-reflection had a tendency to pay more attention to problems than did those high in self-rumination. A significant positive correlation was found between self-rumination and the strength of self-relevance of negative SRWs. Through a path analysis, we found a significant positive effect of the self-relevance of negative SRWs on repetitive negative thinking. Notably, however, the model that excluded self-rumination as an explanatory variable showed a better fit to the data than did the model that included it. In summary, SRW enumeration might enable selective and independent detection of the degree of self-reflection and self-rumination, and therefore should be examined in future research in order to design new behavioral procedures. PMID:29896140

The Effect of Enumeration of Self-Relevant Words on Self-Focused Attention and Repetitive Negative Thoughts

Directory of Open Access Journals (Sweden)

Seiji Muranaka

2018-05-01

Full Text Available Self-focused attention refers to awareness of self-referent, internally generated information. It can be categorized into dysfunctional (i.e., self-rumination and functional (self-reflection aspects. According to theory on cognitive resource limitations (e.g., Moreno, 2006, there is a difference in cognitive resource allocation between these two aspects of self-focused attention. We propose a new task, self-relevant word (SRW enumeration, that can aid in behaviorally identifying individuals’ use of self-rumination and self-reflection. The present study has two purposes: to determine the association between self-focus and SRW enumeration, and to examine the effect of dysfunctional SRW enumeration on repetitive negative thinking. One hundred forty-six undergraduate students participated in this study. They completed a measure of state anxiety twice, before and after imagining a social failure situation. They also completed the SRW enumeration task, Repetitive Thinking Questionnaire, Short Fear of Negative Evaluation Scale, and Rumination-Reflection Questionnaire. A correlational analysis indicated a significant positive correlation between self-reflection and the number of SRWs. Furthermore, individuals high in self-reflection had a tendency to pay more attention to problems than did those high in self-rumination. A significant positive correlation was found between self-rumination and the strength of self-relevance of negative SRWs. Through a path analysis, we found a significant positive effect of the self-relevance of negative SRWs on repetitive negative thinking. Notably, however, the model that excluded self-rumination as an explanatory variable showed a better fit to the data than did the model that included it. In summary, SRW enumeration might enable selective and independent detection of the degree of self-reflection and self-rumination, and therefore should be examined in future research in order to design new behavioral procedures.

Enumeration of RNA complexes via random matrix theory

DEFF Research Database (Denmark)

Andersen, Jørgen E; Chekhov, Leonid O.; Penner, Robert C

2013-01-01

molecules and hydrogen bonds in a given complex. The free energies of this matrix model are computed using the so-called topological recursion, which is a powerful new formalism arising from random matrix theory. These numbers of RNA complexes also have profound meaning in mathematics: they provide......In the present article, we review a derivation of the numbers of RNA complexes of an arbitrary topology. These numbers are encoded in the free energy of the Hermitian matrix model with potential V(x)=x(2)/2 - stx/(1 - tx), where s and t are respective generating parameters for the number of RNA...

Nonflexible Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1978-01-01

We discuss the structure of Lie-admissible algebras which are defined by nonflexible identities. These algebras largely arise from the antiflexible algebras, 2-varieties and associator dependent algebras. The nonflexible Lie-admissible algebras in our discussion are in essence byproducts of the study of nonassociative algebras defined by identities of degree 3. The main purpose is to discuss the classification of simple Lie-admissible algebras of nonflexible type

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

Aboriginal fractions: enumerating identity in Taiwan.

Science.gov (United States)

Liu, Jennifer A

2012-01-01

Notions of identity in Taiwan are configured in relation to numbers. I examine the polyvalent capacities of enumerative technologies in both the production of ethnic identities and claims to political representation and justice. By critically historicizing the manner in which Aborigines in Taiwan have been, and continue to be, constructed as objects and subjects of scientific knowledge production through technologies of measuring, I examine the genetic claim made by some Taiwanese to be "fractionally" Aboriginal. Numbers and techniques of measuring are used ostensibly to know the Aborigines, but they are also used to construct a genetically unique Taiwanese identity and to incorporate the Aborigines within projects of democratic governance. Technologies of enumeration thus serve within multiple, and sometimes contradictory, projects of representation and knowledge production.

Nonimmigrant Admissions - Annual Report

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

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.

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.

An information theory criteria based blind method for enumerating active users in DS-CDMA system

Science.gov (United States)

Samsami Khodadad, Farid; Abed Hodtani, Ghosheh

2014-11-01

In this paper, a new and blind algorithm for active user enumeration in asynchronous direct sequence code division multiple access (DS-CDMA) in multipath channel scenario is proposed. The proposed method is based on information theory criteria. There are two main categories of information criteria which are widely used in active user enumeration, Akaike Information Criterion (AIC) and Minimum Description Length (MDL) information theory criteria. The main difference between these two criteria is their penalty functions. Due to this difference, MDL is a consistent enumerator which has better performance in higher signal-to-noise ratios (SNR) but AIC is preferred in lower SNRs. In sequel, we propose a SNR compliance method based on subspace and training genetic algorithm to have the performance of both of them. Moreover, our method uses only a single antenna, in difference to the previous methods which decrease hardware complexity. Simulation results show that the proposed method is capable of estimating the number of active users without any prior knowledge and the efficiency of the method.

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

A shared, flexible neural map architecture reflects capacity limits in both visual short-term memory and enumeration.

Science.gov (United States)

Knops, André; Piazza, Manuela; Sengupta, Rakesh; Eger, Evelyn; Melcher, David

2014-07-23

Human cognition is characterized by severe capacity limits: we can accurately track, enumerate, or hold in mind only a small number of items at a time. It remains debated whether capacity limitations across tasks are determined by a common system. Here we measure brain activation of adult subjects performing either a visual short-term memory (vSTM) task consisting of holding in mind precise information about the orientation and position of a variable number of items, or an enumeration task consisting of assessing the number of items in those sets. We show that task-specific capacity limits (three to four items in enumeration and two to three in vSTM) are neurally reflected in the activity of the posterior parietal cortex (PPC): an identical set of voxels in this region, commonly activated during the two tasks, changed its overall response profile reflecting task-specific capacity limitations. These results, replicated in a second experiment, were further supported by multivariate pattern analysis in which we could decode the number of items presented over a larger range during enumeration than during vSTM. Finally, we simulated our results with a computational model of PPC using a saliency map architecture in which the level of mutual inhibition between nodes gives rise to capacity limitations and reflects the task-dependent precision with which objects need to be encoded (high precision for vSTM, lower precision for enumeration). Together, our work supports the existence of a common, flexible system underlying capacity limits across tasks in PPC that may take the form of a saliency map. Copyright © 2014 the authors 0270-6474/14/349857-10$15.00/0.

44 CFR 68.9 - Admissible evidence.

Science.gov (United States)

2010-10-01

... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Admissible evidence. 68.9 Section 68.9 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF... admissible. (b) Documentary and oral evidence shall be admissible. (c) Admissibility of non-expert testimony...

Adequacy and Complete Axiomatization for Timed Modal Logic

DEFF Research Database (Denmark)

Jaziri, Samy; Larsen, Kim Guldstrand; Mardare, Radu Iulian

2014-01-01

of the open questions in the field. Secondly, we prove that the set of validities are not recursively enumerable. Nevertheless, we develop a strongly-complete proof system for TML. Since the logic is not compact, the proof system contains infinitary rules, but only with countable sets of instances. Thus, we...

A Stunning Admission

Science.gov (United States)

Hu, Helen

2012-01-01

Few people set out to become admissions counselors, say people in the profession. But the field is requiring skills that are more demanding and varied than ever. And at a time when universities are looking especially hard at the bottom line, people in admissions need to constantly learn new things and make themselves indispensable. Counselors…

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.

Discontinuity in the Enumeration of Sequentially Presented Auditory and Visual Stimuli

Science.gov (United States)

Camos, Valerie; Tillmann, Barbara

2008-01-01

The seeking of discontinuity in enumeration was recently renewed because Cowan [Cowan, N. (2001). "The magical number 4 in short-term memory: A reconsideration of mental storage capacity." "Behavioral and Brain Sciences," 24, 87-185; Cowan, N. (2005). "Working memory capacity." Hove: Psychology Press] suggested that it allows evaluating the limit…

Simple method for correct enumeration of Staphylococcus aureus

DEFF Research Database (Denmark)

Haaber, J.; Cohn, M. T.; Petersen, A.

2016-01-01

culture. When grown in such liquid cultures, the human pathogen Staphylococcus aureus is characterized by its aggregation of single cells into clusters of variable size. Here, we show that aggregation during growth in the laboratory standard medium tryptic soy broth (TSB) is common among clinical...... and laboratory S. aureus isolates and that aggregation may introduce significant bias when applying standard enumeration methods on S. aureus growing in laboratory batch cultures. We provide a simple and efficient sonication procedure, which can be applied prior to optical density measurements to give...

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.

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

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.

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.

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.

Monitor and Protect Wigwam River Bull Trout for Koocanusa Reservoir : Summary of the Skookumchuck Creek Bull Trout Enumeration Project Final Report 2000-2002.

Energy Technology Data Exchange (ETDEWEB)

Baxter, Jeremy; Baxter, James S.

2002-12-01

This report summarizes the third and final year of a bull trout (Salvelinus confluentus) enumeration project on Skookumchuck Creek in southeastern British Columbia. The fence and traps were operated from September 6th to October 11th 2002 in order to enumerate post-spawning bull trout. During the study period a total of 309 bull trout were captured at the fence. In total, 16 fish of undetermined sex, 114 males and 179 females were processed at the fence. Length and weight data, as well as recapture information, were collected for these fish. An additional 41 bull trout were enumerated upstream of the fence by snorkeling prior to fence removal. Coupled with the fence count, the total bull trout enumerated during the project was 350 individuals. Several fish that were tagged in the lower Bull River were recaptured in 2002, as were repeat and alternate year spawners previously enumerated in past years at the fence. A total of 149 bull trout redds were enumerated on the ground in 2002, of which 143 were in the 3.0 km index section (river km 27.5-30.5) that has been surveyed over the past six years. The results of the three year project are summarized, and population characteristics are discussed.

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

Survival of probiotic adjunct cultures in cheese and challenges in their enumeration using selective media.

Science.gov (United States)

Oberg, C J; Moyes, L V; Domek, M J; Brothersen, C; McMahon, D J

2011-05-01

Various selective media for enumerating probiotic and cheese cultures were screened, with 6 media then used to study survival of probiotic bacteria in full-fat and low-fat Cheddar cheese. Commercial strains of Lactobacillus acidophilus, Lactobacillus casei, Lactobacillus paracasei, or Bifidobacterium lactis were added as probiotic adjuncts. The selective media, designed to promote growth of certain lactic acid bacteria (LAB) over others or to differentiate between LAB, were used to detect individual LAB types during cheese storage. Commercial strains of Lactococcus, Lactobacillus, and Bifidobacterium spp. were initially screened on the 6 selective media along with nonstarter LAB (NSLAB) isolates. The microbial flora of the cheeses was analyzed during 9 mo of storage at 6°C. Many NSLAB were able to grow on media presumed selective for Lactococcus, Bifidobacterium spp., or Lb. acidophilus, which became apparent after 90 d of cheese storage, Between 90 and 120 d of storage, bacterial counts changed on media selective for Bifidobacterium spp., suggesting growth of NSLAB. Appearance of NSLAB on Lb. casei selective media [de man, Rogosa, and Sharpe (MRS)+vancomycin] occurred sooner (30 d) in low-fat cheese than in full-fat control cheeses. Differentiation between NSLAB and Lactococcus was achieved by counting after 18 to 24h when the NSLAB colonies were only pinpoint in size. Growth of NSLAB on the various selective media during aging means that probiotic adjunct cultures added during cheesemaking can only be enumerated with confidence on selective media for up to 3 or 4 mo. After this time, growth of NSLAB obfuscates enumeration of probiotic adjuncts. When adjunct Lb. casei or Lb. paracasei cultures are added during cheesemaking, they appear to remain at high numbers for a long time (9 mo) when counted on MRS+vancomycin medium, but a reasonable probability exists that they have been overtaken by NSLAB, which also grow readily on this medium. Enumeration using multiple

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

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

Professional perspectives on systemic barriers to admission avoidance: learning from a system dynamics study of older people's admission pathways.

Science.gov (United States)

Walsh, Bronagh; Lattimer, Valerie; Wintrup, Julie; Brailsford, Sally

2015-06-01

There is debate worldwide about the best way to manage increased healthcare demand within ageing populations, particularly rising rates of unplanned and avoidable hospital admissions. To understand health and social care professionals' perspectives on barriers to admission avoidance throughout the admissions journey, in particular: the causes of avoidable admissions in older people; drivers of admission and barriers to use of admission avoidance strategies; and improvements to reduce unnecessary admissions. A qualitative framework analysis of interview data from a System dynamics (SD) modelling study. Semi-structured interviews were conducted with twenty health and social care professionals with experience of older people's admissions. The interviews were used to build understanding of factors facilitating or hindering admission avoidance across the admissions system. Data were analysed using framework analysis. Three overarching themes emerged: understanding the needs of the patient group; understanding the whole system; and systemwide access to expertise in care of older people. There were diverse views on the underlying reasons for avoidable admissions and recognition of the need for whole-system approaches to service redesign. Participants recommended system redesign that recognises the specific needs of older people, but there was no consensus on underlying patient needs or specific service developments. Access to expertise in management of older and frailer patients was seen as a barrier to admission avoidance throughout the system. Providing access to expertise and leadership in care of frail older people across the admissions system presents a challenge for service managers and nurse educators but is seen as a prerequisite for effective admission avoidance. System redesign to meet the needs of frail older people requires agreement on causes of avoidable admission and underlying patient needs. © 2014 John Wiley & Sons Ltd.

Selective and differential enumerations of Lactobacillus delbrueckii subsp. bulgaricus, Streptococcus thermophilus, Lactobacillus acidophilus, Lactobacillus casei and Bifidobacterium spp. in yoghurt--a review.

Science.gov (United States)

Ashraf, Rabia; Shah, Nagendra P

2011-10-03

Yoghurt is increasingly being used as a carrier of probiotic bacteria for their potential health benefits. To meet with a recommended level of ≥10(6) viable cells/g of a product, assessment of viability of probiotic bacteria in market preparations is crucial. This requires a working method for selective enumeration of these probiotic bacteria and lactic acid bacteria in yoghurt such as Streptococcus thermophilus, Lactobacillus delbrueckii subsp. bulgaricus, Lb. acidophilus, Lb. casei and Bifidobacterium. This chapter presents an overview of media that could be used for differential and selective enumerations of yoghurt bacteria. De Man Rogosa Sharpe agar containing fructose (MRSF), MRS agar pH 5.2 (MRS 5.2), reinforced clostridial prussian blue agar at pH 5.0 (RCPB 5.0) or reinforced clostridial agar at pH 5.3 (RCA 5.3) are suitable for enumeration of Lb. delbrueckii subsp. bulgaricus when the incubation is carried out at 45°C for 72h. S. thermophilus (ST) agar and M17 are recommended for selective enumeration of S. thermophilus. Selective enumeration of Lb. acidophilus in mixed culture could be made in Rogosa agar added with 5-bromo-4-chloro-3-indolyl-β-d-glucopyranoside (X-Glu) or MRS containing maltose (MRSM) and incubation in a 20% CO2 atmosphere. Lb. casei could be selectively enumerated on specially formulated Lb. casei (LC) agar from products containing yoghurt starter bacteria (S. thermophilus and Lb. delbrueckii subsp. bulgaricus), Lb. acidophilus, Bifidobacterium spp. and Lb. casei. Bifidobacterium could be enumerated on MRS agar supplemented with nalidixic acid, paromomycin, neomycin sulphate and lithium chloride (MRS-NPNL) under anaerobic incubation at 37°C for 72h. Copyright © 2011. Published by Elsevier B.V.

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.

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)

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

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

Advice on Admissions Transparency

Science.gov (United States)

Australian Government Tertiary Education Quality and Standards Agency, 2018

2018-01-01

Admissions transparency means that prospective domestic undergraduate students can easily find good quality admissions information that allows them to compare courses and providers and make informed study choices. In October 2016 the Higher Education Standards Panel (HESP) made recommendations to achieve greater transparency in higher education…

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

Seven-hour fluorescence in situ hybridization technique for enumeration of Enterobacteriaceae in food and environmental water sample.

Science.gov (United States)

Ootsubo, M; Shimizu, T; Tanaka, R; Sawabe, T; Tajima, K; Ezura, Y

2003-01-01

A fluorescent in situ hybridization (FISH) technique using an Enterobacteriaceae-specific probe (probe D) to target 16S rRNA was improved in order to enumerate, within a single working day, Enterobacteriaceae present in food and environmental water samples. In order to minimize the time required for the FISH procedure, each step of FISH with probe D was re-evaluated using cultured Escherichia coli. Five minutes of ethanol treatment for cell fixation and hybridization were sufficient to visualize cultured E. coli, and FISH could be performed within 1 h. Because of the difficulties in detecting low levels of bacterial cells by FISH without cultivation, a FISH technique for detecting microcolonies on membrane filters was investigated to improve the bacterial detection limit. FISH with probe D following 6 h of cultivation to grow microcolonies on a 13 mm diameter membrane filter was performed, and whole Enterobacteriaceae microcolonies on the filter were then detected and enumerated by manual epifluorescence microscopic scanning at magnification of x100 in ca 5 min. The total time for FISH with probe D following cultivation (FISHFC) was reduced to within 7 h. FISHFC can be applied to enumerate cultivable Enterobacteriaceae in food (above 100 cells g-1) and environmental water samples (above 1 cell ml-1). Cultivable Enterobacteriaceae in food and water samples were enumerated accurately within 7 h using the FISHFC method. A FISHFC method capable of evaluating Enterobacteriaceae contamination in food and environmental water within a single working day was developed.

Nonimmigrant Admissions: Fiscal Year 2005

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2016

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2010

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2006

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admission: Fiscal Year 2007

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2014

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2008

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2012

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions - Fiscal Year 2013

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2009

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2015

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2011

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

Nonimmigrant Admissions: Fiscal Year 2004

Data.gov (United States)

Department of Homeland Security — Nonimmigrants are foreign nationals granted temporary admission into the United States. The major purposes for which nonimmigrant admission may be authorized include...

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

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

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

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.

Boltzmann Oracle for Combinatorial Systems

OpenAIRE

Pivoteau , Carine; Salvy , Bruno; Soria , Michèle

2008-01-01

International audience; Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence. We show that the combinatorial systems translate into numerical iteration schemes that provide such oracles. In particular, we give a fast oracle based on Newton iteration.

Circular Coinduction

Science.gov (United States)

Rosu, Grigore; Goguen, Joseph; Norvig, Peter (Technical Monitor)

2001-01-01

Circular coinduction is a technique for behavioral reasoning that extends cobasis coinduction to specifications with circularities. Because behavioral satisfaction is not recursively enumerable, no algorithm can work for every behavioral statement. However. algorithms using circular coinduction can prove every practical behavioral result that we know. This paper proves the correctness of circular coinduction and some consequences.

Object grammars and random generation

Directory of Open Access Journals (Sweden)

I. Dutour

1998-12-01

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

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.

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.

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

Admission Systems and Student Mobility: A Proposal for an EU-Wide Registry for University Admission

Directory of Open Access Journals (Sweden)

Cecile Hoareau McGrath

2016-07-01

Full Text Available Europe’s higher education systems are struggling to respond to the established mass demand for higher education, especially given the proportional decline in available resources per student and, more generally the demand for an ever longer education and reduction of the population of working age due to demographic decline. In addition, growing student mobility puts pressure on admission systems to set up relevant procedures for applicants who wish to enter a country. Admission systems to higher education constitute one key element in the mitigation of these challenges. Admissions can regulate student flows, and play a key role in guaranteeing the acquisition of skills in higher education by matching student profiles to their desired courses of study. This article puts European admission systems in perspective. The issue of regulation of student mobility is topical, given the broader and salient discussion on migration flows in Europe. The article uses international comparisons with systems such as the US, Australia and Japan, to provide a critical overview of the role of admission systems in an often overlooked but yet fundamental part of the European Higher Education Area, namely student mobility. The paper also argues for the creation of an information-sharing EU registry on admissions practices for mobile students.

32 CFR 575.2 - Admission; general.

Science.gov (United States)

2010-07-01

... MILITARY ACADEMY § 575.2 Admission; general. (a) In one major respect, the requirements for admission to the United States Military Academy differ from the normal requirements for admission to a civilian college or university; each candidate must obtain an official nomination to the Academy. The young person...

The use of antibiotics to improve phage detection and enumeration by the double-layer agar technique

Directory of Open Access Journals (Sweden)

Ferreira Eugénio C

2009-07-01

Full Text Available Abstract Background The Double-Layer Agar (DLA technique is extensively used in phage research to enumerate and identify phages and to isolate mutants and new phages. Many phages form large and well-defined plaques that are easily observed so that they can be enumerated when plated by the DLA technique. However, some give rise to small and turbid plaques that are very difficult to detect and count. To overcome these problems, some authors have suggested the use of dyes to improve the contrast between the plaques and the turbid host lawns. It has been reported that some antibiotics stimulate bacteria to produce phages, resulting in an increase in final titer. Thus, antibiotics might contribute to increasing plaque size in solid media. Results Antibiotics with different mechanisms of action were tested for their ability to enhance plaque morphology without suppressing phage development. Some antibiotics increased the phage plaque surface by up to 50-fold. Conclusion This work presents a modification of the DLA technique that can be used routinely in the laboratory, leading to a more accurate enumeration of phages that would be difficult or even impossible otherwise.

New recursive-least-squares algorithms for nonlinear active control of sound and vibration using neural networks.

Science.gov (United States)

Bouchard, M

2001-01-01

In recent years, a few articles describing the use of neural networks for nonlinear active control of sound and vibration were published. Using a control structure with two multilayer feedforward neural networks (one as a nonlinear controller and one as a nonlinear plant model), steepest descent algorithms based on two distinct gradient approaches were introduced for the training of the controller network. The two gradient approaches were sometimes called the filtered-x approach and the adjoint approach. Some recursive-least-squares algorithms were also introduced, using the adjoint approach. In this paper, an heuristic procedure is introduced for the development of recursive-least-squares algorithms based on the filtered-x and the adjoint gradient approaches. This leads to the development of new recursive-least-squares algorithms for the training of the controller neural network in the two networks structure. These new algorithms produce a better convergence performance than previously published algorithms. Differences in the performance of algorithms using the filtered-x and the adjoint gradient approaches are discussed in the paper. The computational load of the algorithms discussed in the paper is evaluated for multichannel systems of nonlinear active control. Simulation results are presented to compare the convergence performance of the algorithms, showing the convergence gain provided by the new algorithms.

An Admissions Officer's Credentials

Science.gov (United States)

Chronicle of Higher Education, 2007

2007-01-01

Marilee Jones has resigned as a dean of admissions at the Massachusetts Institute of Technology after admitting that she had misrepresented her academic degrees when first applying to work at the university in 1979. As one of the nation's most prominent admissions officers--and a leader in the movement to make the application process less…

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

Enumeration versus Multiple Object Tracking: The Case of Action Video Game Players

Science.gov (United States)

Green, C. S.; Bavelier, D.

2006-01-01

Here, we demonstrate that action video game play enhances subjects' ability in two tasks thought to indicate the number of items that can be apprehended. Using an enumeration task, in which participants have to determine the number of quickly flashed squares, accuracy measures showed a near ceiling performance for low numerosities and a sharp drop…

Monitor and Protect Wigwam River Bull Trout for Koocanusa Reservoir : Summary of the Skookumchuck Creek Bull Trout Enumeration Project, Annual Report 2001.

Energy Technology Data Exchange (ETDEWEB)

Baxter, James S.; Baxter, Jeremy

2002-03-01

This report summarizes the second year of a bull trout (Salvelinus confluentus) enumeration project on Skookumchuck Creek in southeastern British Columbia. An enumeration fence and traps were installed on the creek from September 6th to October 12th 2001 to enable the capture of post-spawning bull trout emigrating out of the watershed. During the study period, a total of 273 bull trout were sampled through the enumeration fence. Length and weight were determined for all bull trout captured. In total, 39 fish of undetermined sex, 61 males and 173 females were processed through the fence. An additional 19 bull trout were observed on a snorkel survey prior to the fence being removed on October 12th. Coupled with the fence count, the total bull trout enumerated during this project was 292 fish. Several other species of fish were captured at the enumeration fence including westslope cutthroat trout (Oncorhynchus clarki lewisi), Rocky Mountain whitefish (Prosopium williamsoni), and kokanee (O. nerka). A total of 143 bull trout redds were enumerated on the ground in two different locations (river km 27.5-30.5, and km 24.0-25.5) on October 3rd. The majority of redds (n=132) were observed in the 3.0 km index section (river km 27.5-30.5) that has been surveyed over the past five years. The additional 11 redds were observed in a 1.5 km section (river km 24.0-25.5). Summary plots of water temperature for Bradford Creek, Sandown Creek, Buhl Creek, and Skookumchuck Creek at three locations suggested that water temperatures were within the temperature range preferred by bull trout for spawning, egg incubation, and rearing.

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

Enumerating all maximal frequent subtrees in collections of phylogenetic trees.

Science.gov (United States)

Deepak, Akshay; Fernández-Baca, David

2014-01-01

A common problem in phylogenetic analysis is to identify frequent patterns in a collection of phylogenetic trees. The goal is, roughly, to find a subset of the species (taxa) on which all or some significant subset of the trees agree. One popular method to do so is through maximum agreement subtrees (MASTs). MASTs are also used, among other things, as a metric for comparing phylogenetic trees, computing congruence indices and to identify horizontal gene transfer events. We give algorithms and experimental results for two approaches to identify common patterns in a collection of phylogenetic trees, one based on agreement subtrees, called maximal agreement subtrees, the other on frequent subtrees, called maximal frequent subtrees. These approaches can return subtrees on larger sets of taxa than MASTs, and can reveal new common phylogenetic relationships not present in either MASTs or the majority rule tree (a popular consensus method). Our current implementation is available on the web at https://code.google.com/p/mfst-miner/. Our computational results confirm that maximal agreement subtrees and all maximal frequent subtrees can reveal a more complete phylogenetic picture of the common patterns in collections of phylogenetic trees than maximum agreement subtrees; they are also often more resolved than the majority rule tree. Further, our experiments show that enumerating maximal frequent subtrees is considerably more practical than enumerating ordinary (not necessarily maximal) frequent subtrees.

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

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

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

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

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.

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.

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.

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

Enumeration of RNA complexes via random matrix theory.

Science.gov (United States)

Andersen, Jørgen E; Chekhov, Leonid O; Penner, Robert C; Reidys, Christian M; Sułkowski, Piotr

2013-04-01

In the present article, we review a derivation of the numbers of RNA complexes of an arbitrary topology. These numbers are encoded in the free energy of the Hermitian matrix model with potential V(x)=x2/2-stx/(1-tx), where s and t are respective generating parameters for the number of RNA molecules and hydrogen bonds in a given complex. The free energies of this matrix model are computed using the so-called topological recursion, which is a powerful new formalism arising from random matrix theory. These numbers of RNA complexes also have profound meaning in mathematics: they provide the number of chord diagrams of fixed genus with specified numbers of backbones and chords as well as the number of cells in Riemann's moduli spaces for bordered surfaces of fixed topological type.

Optimal admission to higher education

DEFF Research Database (Denmark)

Albæk, Karsten

2016-01-01

that documents the relevance of theory and illustrates how to apply optimal admission procedures. Indirect gains from optimal admission procedures include the potential for increasing entire cohorts of students' probability of graduating with a higher education degree, thereby increasing the skill level...

A comparison of test statistics for the recovery of rapid growth-based enumeration tests

NARCIS (Netherlands)

van den Heuvel, Edwin R.; IJzerman-Boon, Pieta C.

This paper considers five test statistics for comparing the recovery of a rapid growth-based enumeration test with respect to the compendial microbiological method using a specific nonserial dilution experiment. The finite sample distributions of these test statistics are unknown, because they are

Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition

Directory of Open Access Journals (Sweden)

Sung Sik U

2016-10-01

Full Text Available This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices. 

Enumeration of Mars years and seasons since the beginning of telescopic exploration

Science.gov (United States)

Piqueux, Sylvain; Byrne, Shane; Titus, Timothy N.; Hansen, Candice J.; Kieffer, Hugh H.

2015-01-01

A clarification for the enumeration of Mars Years prior to 1955 is presented, along with a table providing the Julian dates associated with Ls = 0° for Mars Years -183 (beginning of the telescopic study of Mars) to 100. A practical algorithm for computing Ls as a function of the Julian Date is provided. No new science results are presented

The Enumeration Structure of 爾雅 Ěryǎ's "Semantic Lists"

Science.gov (United States)

Teboul (戴明德), Michel

Modern linguistic enumeration theory is applied to a study of 爾雅 Ěryǎ's Semantic Lists, leading to an in-depth analysis of the work's first three sections without any recourse to the traditional methods of Chinese classical philology. It is hoped that an extension of the same method can lead to a better understanding of the remaining 16 sections.

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)

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.

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.

A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models

Science.gov (United States)

Ma, Fei; Su, Jing; Yao, Bing

2018-05-01

The problem of determining and calculating the number of spanning trees of any finite graph (model) is a great challenge, and has been studied in various fields, such as discrete applied mathematics, theoretical computer science, physics, chemistry and the like. In this paper, firstly, thank to lots of real-life systems and artificial networks built by all kinds of functions and combinations among some simpler and smaller elements (components), we discuss some helpful network-operation, including link-operation and merge-operation, to design more realistic and complicated network models. Secondly, we present a method for computing the total number of spanning trees. As an accessible example, we apply this method to space of trees and cycles respectively, and our results suggest that it is indeed a better one for such models. In order to reflect more widely practical applications and potentially theoretical significance, we study the enumerating method in some existing scale-free network models. On the other hand, we set up a class of new models displaying scale-free feature, that is to say, following P(k) k-γ, where γ is the degree exponent. Based on detailed calculation, the degree exponent γ of our deterministic scale-free models satisfies γ > 3. In the rest of our discussions, we not only calculate analytically the solutions of average path length, which indicates our models have small-world property being prevailing in amounts of complex systems, but also derive the number of spanning trees by means of the recursive method described in this paper, which clarifies our method is convenient to research these models.

The Predictive Validity of using Admissions Testing and Multiple Mini-interviews in Undergraduate University Admissions

DEFF Research Database (Denmark)

Makransky, Guido; Havmose, Philip S.; Vang, Maria Louison

2017-01-01

The aim of this study was to evaluate the predictive validity of a two-step admissions procedure that included a cognitive ability test followed by multiple mini-interviews (MMI) used to assess non-cognitive skills compared to a grade-based admissions relative to subsequent drop-out rates...... and academic achievement after one and two years of study. The participants consisted of the entire population of 422 psychology students who were admitted to the University of Southern Denmark between 2010 and 2013. The results showed significantly lower drop-out rates after the first year of study, and non......-significant lower drop-out rates after the second year of study for the admission procedure that included the assessment of non-cognitive skills though the MMI. Furthermore, this admission procedure resulted in a significant lower risk of failing the final exam after the first and second year of study, compared...

Enumerating all maximal frequent subtrees in collections of phylogenetic trees

Science.gov (United States)

2014-01-01

Background A common problem in phylogenetic analysis is to identify frequent patterns in a collection of phylogenetic trees. The goal is, roughly, to find a subset of the species (taxa) on which all or some significant subset of the trees agree. One popular method to do so is through maximum agreement subtrees (MASTs). MASTs are also used, among other things, as a metric for comparing phylogenetic trees, computing congruence indices and to identify horizontal gene transfer events. Results We give algorithms and experimental results for two approaches to identify common patterns in a collection of phylogenetic trees, one based on agreement subtrees, called maximal agreement subtrees, the other on frequent subtrees, called maximal frequent subtrees. These approaches can return subtrees on larger sets of taxa than MASTs, and can reveal new common phylogenetic relationships not present in either MASTs or the majority rule tree (a popular consensus method). Our current implementation is available on the web at https://code.google.com/p/mfst-miner/. Conclusions Our computational results confirm that maximal agreement subtrees and all maximal frequent subtrees can reveal a more complete phylogenetic picture of the common patterns in collections of phylogenetic trees than maximum agreement subtrees; they are also often more resolved than the majority rule tree. Further, our experiments show that enumerating maximal frequent subtrees is considerably more practical than enumerating ordinary (not necessarily maximal) frequent subtrees. PMID:25061474

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.

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

Causes of Hospital Admissions in Domus

DEFF Research Database (Denmark)

Skov Benthien, Kirstine; Nordly, Mie; von Heymann-Horan, Annika

2018-01-01

CONTEXT: Avoidable hospital admissions are important negative indicators of quality of end-of-life care. Specialized palliative care (SPC) may support patients remaining at home. OBJECTIVES: Therefore, the purpose of this study was to investigate if SPC at home could prevent hospital admissions...... in patients with incurable cancer. METHODS: These are secondary results of Domus: a randomized controlled trial of accelerated transition to SPC with psychological intervention at home (Clinicaltrials.gov: NCT01885637). Participants were patients with incurable cancer and limited antineoplastic treatment...... significantly in overall potentially avoidable admissions. Both groups felt mostly safe about their place of care. CONCLUSION: The intervention did not prevent hospital admissions. Likely, any intervention effects were outweighed by increased identification of problems in the intervention group leading...

Holistic Admissions in Nursing: We Can Do This.

Science.gov (United States)

Glazer, Greer; Clark, Angela; Bankston, Karen; Danek, Jennifer; Fair, Malika; Michaels, Julia

2016-01-01

Research shows that holistic admissions review practices can increase diversity across students without decreasing the workforce preparedness and academic success of students. Therefore, many disciplines have readily adopted the widespread use of holistic admissions review. Despite its proven effectiveness in addressing student diversity, nursing has been slow to implement holistic admissions review. The purpose of this study was to gain a better understanding of the barriers to implementing holistic admissions review in nursing and the feasibility of adopting holistic admissions review across nursing programs. A biphasic qualitative research study was conducted with nursing deans from across the United States. Qualitative data collection consisted of two phases of focus group discussions conducted over a 3-month period. The qualitative data were analyzed using content analysis. The categories and subcategories identified in Phase 1 informed the discussion in Phase 2. One overarching category from Phase 1 was identified, which was the lack of nursing schools' knowledge regarding holistic admissions review. Four subcategories also identified in Phase 1 included the need for better dissemination of evidence, the need for additional support from university leaders and administrators, the need for legal guidance to facilitate implementation of holistic admissions review, and ensuring appropriate resources to support the holistic admissions review process. Three categories emerged in Phase 2, which included everyone's buy-in is required, the need for a model, and a need for training. The adoption of holistic admissions review in nursing may be feasible. However, certain barriers need to be overcome so that nursing schools can successfully take on this process. Therefore, five recommendations have been developed to assist nursing schools in the implementation of holistic admissions review. These recommendations include increasing knowledge and understanding of holistic

Holistic Admissions in Nursing: We Can Do This

Science.gov (United States)

GLAZER, GREER; CLARK, ANGELA; BANKSTON, KAREN; DANEK, JENNIFER; FAIR, MALIKA; MICHAELS, JULIA

2016-01-01

Research shows that holistic admissions review practices can increase diversity across students without decreasing the workforce preparedness and academic success of students. Therefore, many disciplines have readily adopted the widespread use of holistic admissions review. Despite its proven effectiveness in addressing student diversity, nursing has been slow to implement holistic admissions review. The purpose of this study was to gain a better understanding of the barriers to implementing holistic admissions review in nursing and the feasibility of adopting holistic admissions review across nursing programs. A biphasic qualitative research study was conducted with nursing deans from across the United States. Qualitative data collection consisted of two phases of focus group discussions conducted over a 3-month period. The qualitative data were analyzed using content analysis. The categories and subcategories identified in Phase 1 informed the discussion in Phase 2. One overarching category from Phase 1 was identified, which was the lack of nursing schools’ knowledge regarding holistic admissions review. Four subcategories also identified in Phase 1 included the need for better dissemination of evidence, the need for additional support from university leaders and administrators, the need for legal guidance to facilitate implementation of holistic admissions review, and ensuring appropriate resources to support the holistic admissions review process. Three categories emerged in Phase 2, which included everyone’s buy-in is required, the need for a model, and a need for training. The adoption of holistic admissions review in nursing may be feasible. However, certain barriers need to be overcome so that nursing schools can successfully take on this process. Therefore, five recommendations have been developed to assist nursing schools in the implementation of holistic admissions review. These recommendations include increasing knowledge and understanding of

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

International Nuclear Information System (INIS)

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

2014-01-01

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

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

Structure preserving transformations for Newtonian Lie-admissible equations

International Nuclear Information System (INIS)

Cantrijn, F.

1979-01-01

Recently, a new formulation of non-conservative mechanics has been presented in terms of Hamilton-admissible equations which constitute a generalization of the conventional Hamilton equations. The algebraic structure entering the Hamilton-admissible description of a non-conservative system is that of a Lie-admissible algebra. The corresponding geometrical treatment is related to the existence of a so-called symplectic-admissible form. The transformation theory for Hamilton-admissible systems is currently investigated. The purpose of this paper is to describe one aspect of this theory by identifying the class of transformations which preserve the structure of Hamilton-admissible equations. Necessary and sufficient conditions are established for a transformation to be structure preserving. Some particular cases are discussed and an example is worked out

Enumeration of Enterobacter cloacae after chloramine exposure.

Science.gov (United States)

Watters, S K; Pyle, B H; LeChevallier, M W; McFeters, G A

1989-01-01

Growth of Enterobacter cloacae on various media was compared after disinfection. This was done to examine the effects of monochloramine and chlorine on the enumeration of coliforms. The media used were TLY (nonselective; 5.5% tryptic soy broth, 0.3% yeast extract, 1.0% lactose, and 1.5% Bacto-Agar), m-T7 (selective; developed to recover injured coliforms), m-Endo (selective; contains sodium sulfite), TLYS (TLY with sodium sulfite), and m-T7S (m-T7 with sodium sulfite). Sodium sulfite in any medium improved the recovery of chloramine-treated E. cloacae. However, sodium sulfite in TLYS and m-T7S did not significantly improve the detection of chlorine-treated E. cloacae, and m-Endo was the least effective medium for recovering chlorinated bacteria. Differences in recovery of chlorine- and chloramine-treated E. cloacae are consistent with mechanistic differences between the disinfectants. PMID:2619309

The Pi-0-2-Completeness of most of the Properties of Rewriting You Care About (and Productivity)

DEFF Research Database (Denmark)

Simonsen, Jakob Grue

2009-01-01

Most of the standard pleasant properties of term rewriting systems are undecidable; to wit: local confluence, confluence, normalization, termination, and completeness. Mere undecidability is insufficient to rule out a number of possibly useful properties: For instance, if the set of normalizing...... term rewriting systems were recursively enumerable, there would be a program yielding “yes” in finite time if applied to any normalizing term rewriting system. The contribution of this paper is to show (the uniform version of) each member of the list of properties above (as well as the property...... of being a productive specification of a stream) complete for the class $\\Pi^0_2$. Thus, there is neither a program that can enumerate the set of rewriting systems enjoying any one of the properties, nor is there a program enumerating the set of systems that do not. For normalization and termination we...

Do we represent intentional action as recursively embedded? The answer must be empirical. A comment on Vicari and Adenzato (2014).

Science.gov (United States)

Martins, Mauricio D; Fitch, W Tecumseh

2015-12-15

The relationship between linguistic syntax and action planning is of considerable interest in cognitive science because many researchers suggest that "motor syntax" shares certain key traits with language. In a recent manuscript in this journal, Vicari and Adenzato (henceforth VA) critiqued Hauser, Chomsky and Fitch's 2002 (henceforth HCF's) hypothesis that recursion is language-specific, and that its usage in other domains is parasitic on language resources. VA's main argument is that HCF's hypothesis is falsified by the fact that recursion typifies the structure of intentional action, and recursion in the domain of action is independent of language. Here, we argue that VA's argument is incomplete, and that their formalism can be contrasted with alternative frameworks that are equally consistent with existing data. Therefore their conclusions are premature without further empirical testing and support. In particular, to accept VA's argument it would be necessary to demonstrate both that humans in fact represent self-embedding in the structure of intentional action, and that language is not used to construct these representations. Copyright © 2015 Elsevier Inc. All rights reserved.

An insight into the isolation, enumeration and molecular detection of Listeria monocytogenes in food

Directory of Open Access Journals (Sweden)

Jodi Woan-Fei Law

2015-11-01

Full Text Available Listeria monocytogenes, a foodborne pathogen that can cause listeriosis through the consumption of food contaminated with this pathogen. The ability of L. monocytogenes to survive in extreme conditions and cause food contaminations have become a major concern. Hence, routine microbiological food testing is necessary to prevent food contamination and outbreaks of foodborne illness. This review provides insight into the methods for cultural detection, enumeration and molecular identification of L. monocytogenes in various food samples. There are a number of enrichment and plating media that can be used for the isolation of L. monocytogenes from food samples. Enrichment media such as buffered Listeria Enrichment Broth (BLEB, Fraser broth and University of Vermont Medium (UVM Listeria enrichment broth are recommended by regulatory agencies such as FDA-BAM, USDA-FSIS and ISO. Many plating media are available for the isolation of L. monocytogenes, for instance, PALCAM, Oxford and other chromogenic media. Besides, reference methods like FDA-BAM, ISO 11290 method and USDA-FSIS method are usually applied for the cultural detection or enumeration of L. monocytogenes. MPN technique is applied for the enumeration of L. monocytogenes in the case of low level contamination. Molecular methods including polymerase chain reaction (PCR, multiplex polymerase chain reaction (mPCR, real-time/quantitative polymerase chain reaction (qPCR, nucleic acid sequence-based amplification (NASBA, loop-mediated isothermal amplification (LAMP, DNA microarray and Next Generation Sequencing (NGS technology for the detection and identification of L. monocytogenes are discussed in this review. Overall, molecular methods are rapid, sensitive, specific, time- and labour-saving. In future, there are chances for the development of new techniques for the detection and identification of foodborne with improved features.

Theorems of Tarski's Undefinability and Godel's Second Incompleteness - Computationally

OpenAIRE

Salehi, Saeed

2015-01-01

We present a version of Godel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions (first discussed by M. Detlefsen 2001). We also argue that Tarski's theorem on the Undefinability of Truth is Godel's First Incompleteness Theorem relativized to definable oracles; here a unification of these two theorems is given.

Trends in substance use admissions among older adults.

Science.gov (United States)

Chhatre, Sumedha; Cook, Ratna; Mallik, Eshita; Jayadevappa, Ravishankar

2017-08-22

Substance abuse is a growing, but mostly silent, epidemic among older adults. We sought to analyze the trends in admissions for substance abuse treatment among older adults (aged 55 and older). Treatment Episode Data Set - Admissions (TEDS-A) for period between 2000 and 2012 was used. The trends in admission for primary substances, demographic attributes, characteristics of substance abused and type of admission were analyzed. While total number of substance abuse treatment admissions between 2000 and 2012 changed slightly, proportion attributable to older adults increased from 3.4% to 7.0%. Substantial changes in the demographic, substance use pattern, and treatment characteristics for the older adult admissions were noted. Majority of the admissions were for alcohol as the primary substance. However there was a decreasing trend in this proportion (77% to 64%). The proportion of admissions for following primary substances showed increase: cocaine/crack, marijuana/hashish, heroin, non-prescription methadone, and other opiates and synthetics. Also, admissions for older adults increased between 2000 and 2012 for African Americans (21% to 28%), females (20% to 24%), high school graduates (63% to 75%), homeless (15% to 19%), unemployed (77% to 84%), and those with psychiatric problems (17% to 32%).The proportion of admissions with prior history of substance abuse treatment increased from 39% to 46% and there was an increase in the admissions where more than one problem substance was reported. Ambulatory setting continued to be the most frequent treatment setting, and individual (including self-referral) was the most common referral source. The use of medication assisted therapy remained low over the years (7% - 9%). The changing demographic and substance use pattern of older adults implies that a wide array of psychological, social, and physiological needs will arise. Integrated, multidisciplinary and tailored policies for prevention and treatment are necessary to

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.

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

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.

Exponentiation and deformations of Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1982-01-01

The exponential function is defined for a finite-dimensional real power-associative algebra with unit element. The application of the exponential function is focused on the power-associative (p,q)-mutation of a real or complex associative algebra. Explicit formulas are computed for the (p,q)-mutation of the real envelope of the spin 1 algebra and the Lie algebra so(3) of the rotation group, in light of earlier investigations of the spin 1/2. A slight variant of the mutated exponential is interpreted as a continuous function of the Lie algebra into some isotope of the corresponding linear Lie group. The second part of this paper is concerned with the representation and deformation of a Lie-admissible algebra. The second cohomology group of a Lie-admissible algebra is introduced as a generalization of those of associative and Lie algebras in the Hochschild and Chevalley-Eilenberg theory. Some elementary theory of algebraic deformation of Lie-admissible algebras is discussed in view of generalization of that of associative and Lie algebras. Lie-admissible deformations are also suggested by the representation of Lie-admissible algebras. Some explicit examples of Lie-admissible deformation are given in terms of the (p,q)-mutation of associative deformation of an associative algebra. Finally, we discuss Lie-admissible deformations of order one

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

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.

Enumeration of microbial populations in radioactive environments by epifluorescence microscopy

International Nuclear Information System (INIS)

Pansoy-Hjelvik, M.E.; Strietelmeier, B.A.; Paffett, M.T.

1997-01-01

Epifluorescence microscopy was utilized to enumerate halophilic bacterial populations in two studies involving inoculated, actual waste/brine mixtures and pure brine solutions. The studies include an initial set of experiments designed to elucidate potential transformations of actinide-containing wastes under salt-repository conditions, including microbially mediated changes. The first study included periodic enumeration of bacterial populations of a mixed inoculum initially added to a collection of test containers. The contents of the test containers are the different types of actual radioactive waste that could potentially be stored in nuclear waste repositories in a salt environment. The transuranic waste was generated from materials used in actinide laboratory research. The results show that cell numbers decreased with time. Sorption of the bacteria to solid surfaces in the test system is discussed as a possible mechanism for the decrease in cell numbers. The second study was designed to determine radiological and/or chemical effects of 239 Pu, 243 Am, 237 Np, 232 Th and 238 U on the growth of pure and mixed anaerobic, denitrifying bacterial cultures in brine media. Pu, Am, and Np isotopes at concentrations of ≤1x10 -6 M , ≤5x10 -6 M and ≤5x10 -4 M respectively, and Th and U isotopes ≤4x10 -3 M were tested in these media. The results indicate that high concentrations of certain actinides affected both the bacterial growth rate and morphology. However, relatively minor effects from Am were observed at all tested concentrations with the pure culture

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

Enumeration of virtual libraries of combinatorial modular macrocyclic (bracelet, necklace) architectures and their linear counterparts.

Science.gov (United States)

Taniguchi, Masahiko; Du, Hai; Lindsey, Jonathan S

2013-09-23

A wide variety of cyclic molecular architectures are built of modular subunits and can be formed combinatorially. The mathematics for enumeration of such objects is well-developed yet lacks key features of importance in chemistry, such as specifying (i) the structures of individual members among a set of isomers, (ii) the distribution (i.e., relative amounts) of products, and (iii) the effect of nonequal ratios of reacting monomers on the product distribution. Here, a software program (Cyclaplex) has been developed to determine the number, identity (including isomers), and relative amounts of linear and cyclic architectures from a given number and ratio of reacting monomers. The program includes both mathematical formulas and generative algorithms for enumeration; the latter go beyond the former to provide desired molecular-relevant information and data-mining features. The program is equipped to enumerate four types of architectures: (i) linear architectures with directionality (macroscopic equivalent = electrical extension cords), (ii) linear architectures without directionality (batons), (iii) cyclic architectures with directionality (necklaces), and (iv) cyclic architectures without directionality (bracelets). The program can be applied to cyclic peptides, cycloveratrylenes, cyclens, calixarenes, cyclodextrins, crown ethers, cucurbiturils, annulenes, expanded meso-substituted porphyrin(ogen)s, and diverse supramolecular (e.g., protein) assemblies. The size of accessible architectures encompasses up to 12 modular subunits derived from 12 reacting monomers or larger architectures (e.g. 13-17 subunits) from fewer types of monomers (e.g. 2-4). A particular application concerns understanding the possible heterogeneity of (natural or biohybrid) photosynthetic light-harvesting oligomers (cyclic, linear) formed from distinct peptide subunits.

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.

Sample handling factors affecting the enumeration of lactobacilli and cellulolytic bacteria in equine feces

Science.gov (United States)

The objectives were to compare media types and evaluate the effects of fecal storage time and temperature on the enumeration of cellulolytic bacteria and lactobacilli from horses. Fecal samples were collected from horses (n = 3) and transported to the lab (CO2, 37 ºC, 0.5 h). The samples were assign...

32 CFR 776.66 - Bar admission and disciplinary matters.

Science.gov (United States)

2010-07-01

... 32 National Defense 5 2010-07-01 2010-07-01 false Bar admission and disciplinary matters. 776.66... ADVOCATE GENERAL Rules of Professional Conduct § 776.66 Bar admission and disciplinary matters. (a) Bar admission and disciplinary matters. A covered attorney, in connection with any application for bar admission...

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.

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.

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.

An insight into the isolation, enumeration, and molecular detection of Listeria monocytogenes in food

Science.gov (United States)

Law, Jodi Woan-Fei; Ab Mutalib, Nurul-Syakima; Chan, Kok-Gan; Lee, Learn-Han

2015-01-01

Listeria monocytogenes, a foodborne pathogen that can cause listeriosis through the consumption of food contaminated with this pathogen. The ability of L. monocytogenes to survive in extreme conditions and cause food contaminations have become a major concern. Hence, routine microbiological food testing is necessary to prevent food contamination and outbreaks of foodborne illness. This review provides insight into the methods for cultural detection, enumeration, and molecular identification of L. monocytogenes in various food samples. There are a number of enrichment and plating media that can be used for the isolation of L. monocytogenes from food samples. Enrichment media such as buffered Listeria enrichment broth, Fraser broth, and University of Vermont Medium (UVM) Listeria enrichment broth are recommended by regulatory agencies such as Food and Drug Administration-bacteriological and analytical method (FDA-BAM), US Department of Agriculture-Food and Safety (USDA-FSIS), and International Organization for Standardization (ISO). Many plating media are available for the isolation of L. monocytogenes, for instance, polymyxin acriflavin lithium-chloride ceftazidime aesculin mannitol, Oxford, and other chromogenic media. Besides, reference methods like FDA-BAM, ISO 11290 method, and USDA-FSIS method are usually applied for the cultural detection or enumeration of L. monocytogenes. most probable number technique is applied for the enumeration of L. monocytogenes in the case of low level contamination. Molecular methods including polymerase chain reaction, multiplex polymerase chain reaction, real-time/quantitative polymerase chain reaction, nucleic acid sequence-based amplification, loop-mediated isothermal amplification, DNA microarray, and next generation sequencing technology for the detection and identification of L. monocytogenes are discussed in this review. Overall, molecular methods are rapid, sensitive, specific, time- and labor-saving. In future, there are

Social Factors Determine the Emergency Medical Admission Workload

Directory of Open Access Journals (Sweden)

Seán Cournane

2017-06-01

Full Text Available We related social factors with the annual rate of emergency medical admissions using census small area statistics. All emergency medical admissions (70,543 episodes in 33,343 patients within the catchment area of St. James’s Hospital, Dublin, were examined between 2002 and 2016. Deprivation Index, Single-Parent status, Educational level and Unemployment rates were regressed against admission rates. High deprivation areas had an approximately fourfold (Incidence Rate Ratio (IRR 4.0 (3.96, 4.12 increase in annual admission rate incidence/1000 population from Quintile 1(Q1, from 9.2/1000 (95% Confidence Interval (CI: 9.0, 9.4 to Q5 37.3 (37.0, 37.5. Single-Parent families comprised 40.6% of households (95% CI: 32.4, 49.7; small areas with more Single Parents had a higher admission rate-IRR (Q1 vs. for Q5 of 2.92 (95% CI: 2.83, 3.01. The admission incidence rate was higher for Single-Parent status (IRR 1.50 (95% CI: 1.46, 1.52 where the educational completion level was limited to primary level (Incidence Rate Ratio 1.45 (95% CI: 1.43, 1.47. Small areas with higher educational quintiles predicted lower Admission Rates (IRR 0.85 (95% CI: 0.84, 0.86. Social factors strongly predict the annual incidence rate of emergency medical admissions.

Service philosophies for hospital admission planning

NARCIS (Netherlands)

Adan, I.J.B.F.; Vissers, J.M.H.; Vissers, J.M.H.; Beech, R.

2005-01-01

The ‘traditional’ service philosophy underlying hospital admission planning has been one of optimising the use of scarce hospital resources without paying much attention to the level of service offered to patients. As patients nowadays do not accept long waiting times for hospital admission, it

HEMATOPOIETIC PROGENITOR CELLS AS A PREDICTIVE OF CD34+ ENUMERATION PRIOR TO PERIPHERAL BLOOD STEM CELLS HARVESTING

Directory of Open Access Journals (Sweden)

Z. Zulkafli

2014-09-01

Full Text Available Background: To date, the CD34+ cell enumeration has relied predominantly on flow cytometry technique. However, flow cytometry is time consuming and operator dependent. The application of the hematopoietic progenitor cells (HPCs channel in Sysmex XE-2100, a fully automated hematology analyzer offers an alternative approach, which is with minimal sample manipulation and less operator dependent. This study evaluates the utility of HPC counts as a predictive of CD34+ enumeration prior to peripheral blood stem cells harvesting. Materials and methods: HPC, CD34+, white blood cell (WBC, reticulocytes (retic, immature platelet fraction (IPF and immature reticulocyte fraction (IRF were determined in 61 samples from 19 patients with hematological malignancies (15 lymphoma and 4 multiple myeloma patients at Hospital Universiti Sains Malaysia (Hospital USM who had received granulocyte-colony stimulating factor (G-CSF and planned for autologous transplantation. Results: CD34+ count showed strong and significant correlation with HPC. The receiver operating characteristics (ROC curve analysis revealed that HPC count > 21.5 x 106 / L can predicts a pre harvest CD34+ count of >20 x 106 / L with sensitivity of 77%, specificity of 64% and area under the curve (AUC of 0.802. Conclusion: We concluded that HPC count can be a useful potential parameter in optimizing timing for CD34+ enumeration prior to leukapheresis.

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

Scheduling admissions and reducing variation in bed demand

NARCIS (Netherlands)

Bekker, R.; Out, P.

2011-01-01

Variability in admissions and lengths of stay inherently leads to variability in bed occupancy. The aim of this paper is to analyse the impact of these sources of variability on the required amount of capacity and to determine admission quota for scheduled admissions to regulate the occupancy

Mathematics Admission Test Remarks

Directory of Open Access Journals (Sweden)

Ideon Erge

2016-12-01

Full Text Available Since 2014, there have been admission tests in mathematics for applicants to the Estonian University of Life Sciences for Geodesy, Land Management and Real Estate Planning; Civil Engineering; Hydraulic Engineering and Water Pollution Control; Engineering and Technetronics curricula. According to admission criteria, the test must be taken by students who have not passed the specific mathematics course state exam or when the score was less than 20 points. The admission test may also be taken by those who wish to improve their state exam score. In 2016, there were 126 such applicants of whom 63 took the test. In 2015, the numbers were 129 and 89 and in 2014 150 and 47 accordingly. The test was scored on scale of 100. The arithmetic average of the score was 30.6 points in 2016, 29.03 in 2015 and 18.84 in 2014. The test was considered to be passed with 1 point in 2014 and 20 points in 2015 and 2016. We analyzed test results and gave examples of problems which were solved exceptionally well or not at all.

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

Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures

OpenAIRE

Sorenson, Jonathan P.

2010-01-01

We extend the known tables of pseudosquares and pseudocubes, discuss the implications of these new data on the conjectured distribution of pseudosquares and pseudocubes, and present the details of the algorithm used to do this work. Our algorithm is based on the space-saving wheel data structure combined with doubly-focused enumeration, run in parallel on a cluster supercomputer.

Pattern of non-communicable diseases among medical admissions ...

African Journals Online (AJOL)

Medical admissions due to non-communicable diseases were carefully selected and analyzed. There were 1853 cases of various non-communicable diseases out of a total medical admission of 3294 constituting 56.2% of total medical admissions. Diseases of the cardiovascular, endocrine and renal systems were the most ...

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

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.

Specific dot-immunobinding assay for detection and enumeration of Thiobacillus ferrooxidans

International Nuclear Information System (INIS)

Arredondo, R.; Jerez, C.A.

1989-01-01

A specific and very sensitive dot-immunobinding assay for the detection and enumeration of the bioleaching microorganism Thiobacillus ferrooxidans was developed. Nitrocellulose spotted with samples was incubated with polyclonal antisera against whole T. ferrooxidans cells and then in 125 I-labeled protein A or 125 I-labeled goat antirabbit immunoglobulin G; incubation was followed by autoradiography. Since a minimum of 10 3 cells per dot could be detected, the method offers the possibility of simultaneous processing of numerous samples in a short time to monitor the levels of T. ferrooxidans in bioleaching operations

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.

Undergraduate Admissions | NSU

Science.gov (United States)

. Continuing Education Financial Aid Career Development Regional Campuses International Affairs Veterans Admissions Honors College Experiential Education Study Abroad Research Opportunities Career Preparation SharkLink California Disclosure International Affairs Undergraduate Advising Career Development Libraries at

Rethinking Dental School Admission Criteria: Correlation Between Pre-Admission Variables and First-Year Performance for Six Classes at One Dental School.

Science.gov (United States)

Rowland, Kevin C; Rieken, Susan

2018-04-01

Admissions committees in dental schools are charged with the responsibility of selecting candidates who will succeed in school and become successful members of the profession. Identifying students who will have academic difficulty is challenging. The aim of this study was to determine the predictive value of pre-admission variables for the first-year performance of six classes at one U.S. dental school. The authors hypothesized that the variables undergraduate grade point average (GPA), undergraduate science GPA (biology, chemistry, and physics), and Dental Admission Test (DAT) scores would predict the level of performance achieved in the first year of dental school, measured by year-end GPA. Data were collected in 2015 from school records for all 297 students in the six cohorts who completed the first year (Classes of 2007 through 2013). In the results, statistically significant correlations existed between all pre-admission variables and first-year GPA, but the associations were only weak to moderate. Lower performing students at the end of the first year (lowest 10% of GPA) had, on average, lower pre-admission variables than the other students, but the differences were small (≤10.8% in all categories). When all the pre-admission variables were considered together in a multiple regression analysis, a significant association was found between pre-admission variables and first-year GPA, but the association was weak (adjusted R 2 =0.238). This weak association suggests that these students' first-year dental school GPAs were mostly determined by factors other than the pre-admission variables studied and has resulted in the school's placing greater emphasis on other factors for admission decisions.

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.

Comparison of selected methods for the enumeration of fecal coliforms and Escherichia coli in shellfish.

Science.gov (United States)

Grabow, W O; De Villiers, J C; Schildhauer, C I

1992-09-01

In a comparison of five selected methods for the enumeration of fecal coliforms and Escherichia coli in naturally contaminated and sewage-seeded mussels (Choromytilus spp.) and oysters (Ostrea spp.), a spread-plate procedure with mFC agar without rosolic acid and preincubation proved the method of choice for routine quality assessment.

49 CFR 1114.3 - Admissibility of business records.

Science.gov (United States)

2010-10-01

... 49 Transportation 8 2010-10-01 2010-10-01 false Admissibility of business records. 1114.3 Section... § 1114.3 Admissibility of business records. Any writing or record, whether in the form of an entry in a... be admissible as evidence thereof if it appears that it was made in the regular course of business...

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.

Perceptions of admission committee members: some aspects on individual admission to dental education at Karolinska Institutet.

Science.gov (United States)

Röding, Karin

2005-08-01

The aim of the study was to generate an overall impression of the admission committee's (AC) perspective on individualised admission procedures, derived from some perceived experience of the individual committee members using semi-structured interviews. Qualitative research was used and data were collected by use of interviews. The results show that the committee members are highly committed to the task and try to identify desirable, non-cognitive attributes in the applicants, such as motivation, empathy, drive, and tenacity: 'emotional intelligence'. The committee members were of the opinion that it was possible to identify these attributes in an applicant. The AC further believes that the admissions procedure influences academic achievements because students regard themselves as specially selected and therefore aspire to higher achievements.

Fluorogenic membrane overlays to enumerate total coliforms, Escherichia coli, and total Vibrionaceae in shellfish and seawater

Science.gov (United States)

Three assays were developed to enumerate total coliforms, Escherichia coli, and total Vibrionaceae in shellfish and other foods and in seawater and other environmental samples. Assays involve membrane overlays of overnight colonies on non-selective agar plates to detect ß-glucuronidase and lysyl am...

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

Science.gov (United States)

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

2017-07-28

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

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

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.

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.

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

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

False confessions, expert testimony, and admissibility.

Science.gov (United States)

Watson, Clarence; Weiss, Kenneth J; Pouncey, Claire

2010-01-01

The confession of a criminal defendant serves as a prosecutor's most compelling piece of evidence during trial. Courts must preserve a defendant's constitutional right to a fair trial while upholding the judicial interests of presenting competent and reliable evidence to the jury. When a defendant seeks to challenge the validity of that confession through expert testimony, the prosecution often contests the admissibility of the expert's opinion. Depending on the content and methodology of the expert's opinion, testimony addressing the phenomenon of false confessions may or may not be admissible. This article outlines the scientific and epistemological bases of expert testimony on false confession, notes the obstacles facing its admissibility, and provides guidance to the expert in formulating opinions that will reach the judge or jury. We review the 2006 New Jersey Superior Court decision in State of New Jersey v. George King to illustrate what is involved in the admissibility of false-confession testimony and use the case as a starting point in developing a best-practice approach to working in this area.

OPTIMAL PRICE OF ADMISSION BANTIMURUNG NATURAL PARK, SOUTH SULAWESI

Directory of Open Access Journals (Sweden)

Wahyudi Isnan

2016-12-01

Full Text Available The number of visitors to the Bantimurung natural park fluctuated allegedly due to the increase of the price of admission ticket. The aim of the study is to analyze optimal price of admission ticket and willingness of visitors to pay admission ticket to the Park. The study was conducted in Bantimurung natural park, South Sulawsi, from January to April 2013.117 number of samples was taken by using convenience sampling method. Analysis of optimal prices and the willingness of visitors to pay for ecotourism to the Park were conducted by creating tourism demand function, which then simulated the price of admission, into the equation function of tourist demand. The results showed that the optimal price of the admission ticket was at the price of Rp75,000. At the optimal price of admission ticket of Rp75,000 the Park would earn revenues of Rp18,230,700,000. An average value of the visitor willingness to pay was Rp118,032, with price of admission ticket was Rp75,000, then, the average visitor will get consumer surplus of Rp43,032. If the management of Bantimurung natural park desiring to increase the total revenue, then the price of admission ticket can be increased to be Rp75,000.

Admissibility and hyperbolicity

CERN Document Server

Barreira, Luís; Valls, Claudia

2018-01-01

This book gives a comprehensive overview of the relationship between admissibility and hyperbolicity. Essential theories and selected developments are discussed with highlights to applications. The dedicated readership includes researchers and graduate students specializing in differential equations and dynamical systems (with emphasis on hyperbolicity) who wish to have a broad view of the topic and working knowledge of its techniques. The book may also be used as a basis for appropriate graduate courses on hyperbolicity; the pointers and references given to further research will be particularly useful. The material is divided into three parts: the core of the theory, recent developments, and applications. The first part pragmatically covers the relation between admissibility and hyperbolicity, starting with the simpler case of exponential contractions. It also considers exponential dichotomies, both for discrete and continuous time, and establishes corresponding results building on the arguments for exponent...

The Pattern of Surgical Admissions in University of Nigeria Teaching ...

African Journals Online (AJOL)

The digestive system and genitourinary systems were the most commonly affected systems. Emergency admission accounted for 18.1% of all surgical admissions while elective admissions accounted for the rest. Conclusion: More detailed research on the pattern of admissions is important in planning and should be carried ...

Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs

International Nuclear Information System (INIS)

Samatova, N F; Schmidt, M C; Hendrix, W; Breimyer, P; Thomas, K; Park, B-H

2008-01-01

Data-driven construction of predictive models for biological systems faces challenges from data intensity, uncertainty, and computational complexity. Data-driven model inference is often considered a combinatorial graph problem where an enumeration of all feasible models is sought. The data-intensive and the NP-hard nature of such problems, however, challenges existing methods to meet the required scale of data size and uncertainty, even on modern supercomputers. Maximal clique enumeration (MCE) in a graph derived from such biological data is often a rate-limiting step in detecting protein complexes in protein interaction data, finding clusters of co-expressed genes in microarray data, or identifying clusters of orthologous genes in protein sequence data. We report two key advances that address this challenge. We designed and implemented the first (to the best of our knowledge) parallel MCE algorithm that scales linearly on thousands of processors running MCE on real-world biological networks with thousands and hundreds of thousands of vertices. In addition, we proposed and developed the Graph Perturbation Theory (GPT) that establishes a foundation for efficiently solving the MCE problem in perturbed graphs, which model the uncertainty in the data. GPT formulates necessary and sufficient conditions for detecting the differences between the sets of maximal cliques in the original and perturbed graphs and reduces the enumeration time by more than 80% compared to complete recomputation

Inactivation of viable Ascaris eggs by reagents during enumeration.

Science.gov (United States)

Nelson, K L; Darby, J L

2001-12-01

Various reagents commonly used to enumerate viable helminth eggs from wastewater and sludge were evaluated for their potential to inactivate Ascaris eggs under typical laboratory conditions. Two methods were used to enumerate indigenous Ascaris eggs from sludge samples. All steps in the methods were the same except that in method I a phase extraction step with acid-alcohol (35% ethanol in 0.1 N H(2)SO(4)) and diethyl ether was used whereas in method II the extraction step was avoided by pouring the sample through a 38-microm-mesh stainless steel sieve that retained the eggs. The concentration of eggs and their viability were lower in the samples processed by method I than in the samples processed by method II by an average of 48 and 70%, respectively. A second set of experiments was performed using pure solutions of Ascaris suum eggs to elucidate the effect of the individual reagents and relevant combination of reagents on the eggs. The percentages of viable eggs in samples treated with acid-alcohol alone and in combination with diethyl ether or ethyl acetate were 52, 27, and 4%, respectively, whereas in the rest of the samples the viability was about 80%. Neither the acid nor the diethyl ether alone caused any decrease in egg viability. Thus, the observed inactivation was attributed primarily to the 35% ethanol content of the acid-alcohol solution. Inactivation of the eggs was prevented by limiting the direct exposure to the extraction reagents to 30 min and diluting the residual concentration of acid-alcohol in the sample by a factor of 100 before incubation. Also, the viability of the eggs was maintained if the acid-alcohol solution was replaced with an acetoacetic buffer. None of the reagents used for the flotation step of the sample cleaning procedure (ZnSO(4), MgSO(4), and NaCl) or during incubation (0.1 N H(2)SO(4) and 0.5% formalin) inactivated the Ascaris eggs under the conditions studied.

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.

[How medical students perform academically by admission types?].

Science.gov (United States)

Kim, Se-Hoon; Lee, Keumho; Hur, Yera; Kim, Ji-Ha

2013-09-01

Despite the importance of selecting students whom are capable for medical education and to become a good doctor, not enough studies have been done in the category. This study focused on analysing the medical students' academic performance (grade point average, GPA) differences, flunk and dropout rates by admission types. From 2004 to 2010, we gathered 369 Konyang University College of Medicine's students admission data and analyzed the differences between admission method and academic achievement, differences in failure and dropout rates. Analysis of variance (ANOVA), ordinary least square, and logistic regression were used. The rolling students showed higher academic achievement from year 1 to 3 than regular students (p dropout rate by admission types, regular admission type students showed higher drop out rate than the rolling ones which demonstrates admission types gives significant effect on flunk or dropout rates in medical students (p students tend to show lower flunk rate and dropout rates and perform better academically. This implies selecting students primarily by Korean College Scholastic Ability Test does not guarantee their academic success in medical education. Thus we suggest a more in-depth comprehensive method of selecting students that are appropriate to individual medical school's educational goal.

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

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.

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.

Analysis of National Trends in Admissions for Pulmonary Embolism.

Science.gov (United States)

Smith, Sean B; Geske, Jeffrey B; Kathuria, Parul; Cuttica, Michael; Schimmel, Daniel R; Courtney, D Mark; Waterer, Grant W; Wunderink, Richard G

2016-07-01

Pulmonary embolism (PE) remains a significant cause of hospital admission and health-care costs. Estimates of PE incidence came from the 1990s, and data are limited to describe trends in hospital admissions for PE over the past decade. We analyzed Nationwide Inpatient Sample data from 1993 to 2012 to identify patients admitted with PE. We included admissions with International Classification of Diseases, 9th revision, codes listing PE as the principal diagnosis as well as admissions with PE listed secondary to principal diagnoses of respiratory failure or DVT. Massive PE was defined by mechanical ventilation, vasopressors, or nonseptic shock. Outcomes included hospital lengths of stay, adjusted charges, and all-cause hospital mortality. Linear regression was used to analyze changes over time. Admissions for PE increased from 23 per 100,000 in 1993 to 65 per 100,000 in 2012 (P < .001). The percent of admissions meeting criteria for massive PE decreased (5.3% to 4.4%, P = .002), but the absolute number of admissions for massive PE increased (from 1.5 to 2.8 per 100,000, P < .001). Median length of stay decreased from 8 (interquartile range [IQR], 6-11) to 4 (IQR, 3-6) days (P < .001). Adjusted hospital charges increased from $16,475 (IQR, $10,748-$26,211) in 1993 to $25,728 (IQR, $15,505-$44,493) in 2012 (P < .001). All-cause hospital mortality decreased from 7.1% to 3.2% (P < .001), but population-adjusted deaths during admission for PE increased from 1.6 to 2.1 per 100,000 (P < .001). Total admissions and hospital charges for PE have increased over the past two decades. However, the population-adjusted admission rate has increased disproportionately to the incidence of patients with severe PE. We hypothesize that these findings reflect a concerning national movement toward more admissions of less severe PE. Copyright © 2016 American College of Chest Physicians. Published by Elsevier Inc. All rights reserved.

Patient admission planning using Approximate Dynamic Programming

NARCIS (Netherlands)

Hulshof, P.J.H.; Mes, Martijn R.K.; Boucherie, Richardus J.; Hans, Elias W.

2016-01-01

Tactical planning in hospitals involves elective patient admission planning and the allocation of hospital resource capacities. We propose a method to develop a tactical resource allocation and patient admission plan that takes stochastic elements into consideration, thereby providing robust plans.

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

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.

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

General Practitioners and Involuntary Admission

DEFF Research Database (Denmark)

Jepsen, Britta; Lomborg, Kirsten; Engberg, Marianne

2010-01-01

Background: In many countries, medical authorities are responsible for involuntary admissions of mentally ill patients. Nonetheless, very little is known about GPs' experiences with involuntary admission. Aim: The aim of the present study was to explore GP's experiences from participating....... They felt that sectioning patients was unpleasant, and felt nervous, but experienced relief and professional satisfaction if things went well. The GPs experienced the doctor-patient relationship to be at risk, but also reported that it could be improved. GPs felt that they were not taken seriously...

78 FR 62415 - Refugee Admissions for Fiscal Year 2014

Science.gov (United States)

2013-10-21

... October 2, 2013 Refugee Admissions for Fiscal Year 2014 Memorandum for the Secretary of State In... authorize the following actions: The admission of up to 70,000 refugees to the United States during fiscal... with Federal refugee resettlement assistance under the Amerasian immigrant admissions program, as...

Enumeration of sugars and sugar alcohols hydroxyl groups by aqueous-based acetylation and MALDI-TOF mass spectrometry

Science.gov (United States)

A method is described for enumerating hydroxyl groups on analytes in aqueous media is described, and applied to some common polyalcohols (erythritol, mannitol, and xylitol) and selected carbohydrates. The analytes were derivatized in water with vinyl acetate in presence of sodium phosphate buffer. ...

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.

Asians in Higher Education: Conflicts over Admissions.

Science.gov (United States)

Hoachlander, E. Gareth; Brown, Cynthia L.

1989-01-01

Many Asian Americans believe that the admissions policies of many selective colleges are unfair to them. Demographic trends and the resultant political activity are discussed. The admissions policies and practices that Asian Americans consider objectionable are examined and some policy options are offered. (MLW)

Seasonal variations in hospital admissions for mania

DEFF Research Database (Denmark)

Medici, Clara Reece; Vestergaard, Claus Høstrup; Hadzi-Pavlovic, Dusan

2016-01-01

in summer. Higher admission rates were associated with more sunshine, more ultraviolet radiation, higher temperature and less snow but were unassociated with rainfall. We did not find a secular trend in the seasonal pattern. Finally, neither gender nor admission status impacted on the overall seasonal...

Fixed and growth mindsets in physics graduate admissions

Directory of Open Access Journals (Sweden)

Rachel E. Scherr

2017-11-01

Full Text Available Considering the evidence that standard physics graduate admissions practices tend to exclude women and traditionally marginalized racial and ethnic groups from the discipline, we investigate (a the characteristics of students that physics graduate admissions committee members seek to admit to their programs and (b the practices associated with these admissions goals. The data for this investigation are interviews with 18 faculty who chair graduate admissions committees in programs that prioritize diversity in their graduate admissions practices. We find that some express elements of an implicit theory of intelligence known as a “fixed mindset,” in which intelligence is understood as an inherent capacity or ability primarily measured by standardized test scores and grades. Some also express elements of a “growth mindset,” in which intelligence is understood in terms of acquired knowledge and effort. Overall, most faculty interviewed expressed elements of both mindsets. A fixed mindset in physics graduate admissions is consistent with research identifying physics as a “brilliance-required” field, whose members tend to believe that raw, innate talent is a primary requirement for success in the discipline. Such a mindset directly affects the participation of women and some racial or ethnic groups, who are stereotyped as lacking such high-level intellectual ability.

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

Optimal Admission to Higher Education

DEFF Research Database (Denmark)

Albæk, Karsten

This paper constructs higher education admission rules that maximise graduation rates and thus increase the skill level of the work force. An application shows that students with a low level in mathematics in secondary school ought to find it easier to be admitted to an economics programme than...... to law or psychology programmes, even though economics is the most difficult programme from which to graduate without a strong background in mathematics. Indirect gains from optimal admission include the potential of making whole cohorts of students more able to graduate with a higher education degree....

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.

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

Decline in adolescent treatment admissions for methamphetamine ...

African Journals Online (AJOL)

Background and objectives. The purpose of this report is to describe the changing trends in adolescent treatment admissions for methamphetamine in Cape Town, and to discuss possible implications. Method. Data were collected on admissions for drug abuse treatment through a regular monitoring system involving drug ...

19 CFR 210.31 - Requests for admission.

Science.gov (United States)

2010-04-01

... 19 Customs Duties 3 2010-04-01 2010-04-01 false Requests for admission. 210.31 Section 210.31 Customs Duties UNITED STATES INTERNATIONAL TRADE COMMISSION INVESTIGATIONS OF UNFAIR PRACTICES IN IMPORT TRADE ADJUDICATION AND ENFORCEMENT Discovery and Compulsory Process § 210.31 Requests for admission. (a...

Comparison of methods for detection and enumeration of airborne microorganisms collected by liquid impingement.

OpenAIRE

Terzieva, S; Donnelly, J; Ulevicius, V; Grinshpun, S A; Willeke, K; Stelma, G N; Brenner, K P

1996-01-01

Bacterial agents and cell components can be spread as bioaerosols, producing infections and asthmatic problems. This study compares four methods for the detection and enumeration of aerosolized bacteria collected in an AGI-30 impinger. Changes in the total and viable concentrations of Pseudomonas fluorescens in the collection fluid with respect to time of impingement were determined. Two direct microscopic methods (acridine orange and BacLight) and aerodynamic aerosol-size spectrometry (Aeros...

Admissions through the emergency department due to drug-related problems

International Nuclear Information System (INIS)

Yosef H Al-Olah; Khalifa M Al Thiab

2010-01-01

Hospital admissions due to drug-related problems (DRPs) have been studied internationally, but local data are limited. Therefore, we undertook a prospective, observational study of all admissions through the emergency department (ED) at a tertiary referral hospital in Saudi Arabia to determine the incidence of admissions through the ED due to DRPs, types of DRPs, length of stay (LOS) in the hospital after ED admissions due to DRPs, and assessment of preventability of admissions due to DRPs.All admissions through the ED over a period of 28 consecutive days were evaluated to determine if they were due to definite or possible DRPs. Data was collected on a daily basis for each admission over the previous 24 hours. Each incident was assessed by three investigators Of 557 patients admitted through the ED, 82 (14.7%) admissions were due to DRP (53 definite, 29 possible). The most common types of DRP were failure to receive medication in 25 cases (47.2%), an adverse drug reaction in 13 cases (24.5%), and drug overdose in 6 cases (11.3%). In the definite DRP group, 83.0% were definitely preventable, 3.8% were possibly preventable and 13.2% were definitely non-preventable.DRPs are a serious and costly issue facing health care professionals and health care systems. Most admissions due to DRPs are avoidable (Author).

Inferring relationships between clinical mastitis, productivity and fertility: a recursive model application including genetics, farm associated herd management, and cow-specific antibiotic treatments.

Science.gov (United States)

Rehbein, Pia; Brügemann, Kerstin; Yin, Tong; V Borstel, U König; Wu, Xiao-Lin; König, Sven

2013-10-01

A dataset of test-day records, fertility traits, and one health trait including 1275 Brown Swiss cows kept in 46 small-scale organic farms was used to infer relationships among these traits based on recursive Gaussian-threshold models. Test-day records included milk yield (MY), protein percentage (PROT-%), fat percentage (FAT-%), somatic cell score (SCS), the ratio of FAT-% to PROT-% (FPR), lactose percentage (LAC-%), and milk urea nitrogen (MUN). Female fertility traits were defined as the interval from calving to first insemination (CTFS) and success of a first insemination (SFI), and the health trait was clinical mastitis (CM). First, a tri-trait model was used which postulated the recursive effect of a test-day observation in the early period of lactation on liability to CM (LCM), and further the recursive effect of LCM on the following test-day observation. For CM and female fertility traits, a bi-trait recursive Gaussian-threshold model was employed to estimate the effects from CM to CTFS and from CM on SFI. The recursive effects from CTFS and SFI onto CM were not relevant, because CM was recorded prior to the measurements for CTFS and SFI. Results show that the posterior heritability for LCM was 0.05, and for all other traits, heritability estimates were in reasonable ranges, each with a small posterior SD. Lowest heritability estimates were obtained for female reproduction traits, i.e. h(2)=0.02 for SFI, and h(2)≈0 for CTFS. Posterior estimates of genetic correlations between LCM and production traits (MY and MUN), and between LCM and somatic cell score (SCS), were large and positive (0.56-0.68). Results confirm the genetic antagonism between MY and LCM, and the suitability of SCS as an indicator trait for CM. Structural equation coefficients describe the impact of one trait on a second trait on the phenotypic pathway. Higher values for FAT-% and FPR were associated with a higher LCM. The rate of change in FAT-% and in FPR in the ongoing lactation with

Temperature effects on hospital admissions for kidney morbidity in Taiwan

International Nuclear Information System (INIS)

Lin, Yu-Kai; Wang, Yu-Chun; Ho, Tsung-Jung; Lu, Chensheng

2013-01-01

Objective: This study aimed to associate hospital admissions of kidney diseases with extreme temperature and prolonged heat/cold events in 7 regions of Taiwan. Methods: Age-specific ( 10 , O 3 , and NO 2 ) and potential confounders. Results: We observed a V or J-shape association between daily average temperatures and the RR estimates for hospital admissions of kidney diseases in Taiwan. The lowest risk for hospital admissions of kidney diseases was found at around 25 °C, and risk increased as temperatures deviated from 25 °C. The pooled cumulative 8-day RR for all ages of population of the 7 study areas were 1.10 (95% confidence interval (CI): 1.01, 1.19) at 18 °C and 1.45 (95% CI: 1.27, 1.64) at 30 °C. High temperature has more profound influence on hospital admission of kidney diseases than low temperature. Temperature risks for hospital admissions were similar between younger (< 65 years) and elderly (65 + years) population. This study observed no significant effects of prolonged heat extremes on hospital admissions of kidney diseases. Conclusions: The heat effect for kidney morbidities leading to hospital admission was more significant than that of the cold temperature. This study did not find the age-dependent relative risks for temperature associating with hospital admissions of kidney diseases. - Highlights: ► V or J-shaped association was observed between daily temperatures and hospital admissions for renal diseases in Taiwan. ► The pooled relative risks accounting for 8 days of lag for the 7 study areas were 1.1 at 18 °C and 1.46 at 30 °C. ► There is no difference of the relative risk estimates for hospital admissions between younger and elderly population. ► We found significant protective effects of hospital admissions for prolonged cold extremes, but not for heat extremes

Lexical Profiles of Thailand University Admission Tests

Science.gov (United States)

Cherngchawano, Wirun; Jaturapitakkul, Natjiree

2014-01-01

University Admission Tests in Thailand are important documents which reflect Thailand's education system. To study at a higher education level, all students generally need to take the University Admission Tests designed by the National Institute of Educational Testing Service (NIETS). For the English test, vocabulary and reading comprehension is…

Confronting the categories: Equitable admissions without apartheid ...

African Journals Online (AJOL)

I offer a critical-race-standpoint as an alternative conceptual orientation and method for transformative admissions committed to racial redress that is socially just. I conclude that admissions criteria should encompass the lived realities of inequality and be informed by a conception of humanism as critique. This requires ...

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.

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.

Puberty menorrhagia Requiring Inpatient Admission

Directory of Open Access Journals (Sweden)

AH Khosla

2010-06-01

Full Text Available INTRODUCTION: Puberty menorrhagia is a significant health problem in adolescent age group and severe cases may require admission and blood transfusion. Aim of this study was to evaluate the causes, associated complications and management of puberty menorrhagia. METHODS: Hospital records of all patients of puberty menorrhagia requiring admission were analyzed for etiology, duration since menarche, duration of bleeding, investigation profile and management. RESULTS: There were 18 patients of puberty menorrhagia requiring hospital admission. Etiology was anovulatory bleeding in 11 patients, bleeding disorders in five which included idiopathic thrombocytopenia purpura in three and one each with Von-Willebrand disease and leukemia. Two patients had hypothyroidism as the cause. Fourteen patients presented with severe anaemia and required blood transfusion. All except one responded to oral hormonal therapy. CONCLUSIONS: Puberty menorrhagia can be associated with severe complications and requiring blood transfusion. Although most common cause is anovulation but bleeding disorder, other medical condition and other organic causes must be ruled out in any patient of Puberty menorrhagia. KEYWORDS: anovulation, bleeding disorder, puberty, menorrhagia, anaemia.

Assessing academic potential for university admission: The ...

African Journals Online (AJOL)

A Biographical Questionnaire (BQ) has been used in the Faculty of Humanities at the University of the Witwatersrand since the mid-80s, to identify potential to succeed at university among applicants who have not met the requirements for automatic admission. As the key instrument in a special admissions process, the

Admissions 2015 Indian Institute of Science, Bangalore

Indian Academy of Sciences (India)

IAS Admin

2015-02-02

Feb 2, 2015 ... advertisement that will appear in Employment News dated 14th February 2015 and also our website: www.iisc.ernet.in/admissions. Online submission of application be made by accessing the IISc website www.iisc.ernet.in/admissions for all the programmes. IMPORTANT DATES. Website opening and ...

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.

Treatment Episode Data Set: Admissions (TEDS-A-2002)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1994)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2008)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2003)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2006)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2011)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1999)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1997)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2000)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2009)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2010)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1998)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2007)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1993)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1995)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1996)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2005)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-1992)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2001)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2004)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2013)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

Treatment Episode Data Set: Admissions (TEDS-A-2012)

Data.gov (United States)

U.S. Department of Health & Human Services — The Treatment Episode Data Set -- Admissions (TEDS-A) is a national census data system of annual admissions to substance abuse treatment facilities. TEDS-A provides...

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

Science.gov (United States)

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

2015-10-01

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

Effect of storage time and temperature of equine feces on the subsequent enumeration of lactobacilli and cellulolytic bacteria

Science.gov (United States)

Cellulolytic bacteria and lactobacilli are beneficial microbes in the equine hindgut. There are several existing methodologies for the enumeration of these bacteria, which vary based on selective and differential media and sample handling procedures including storage time and temperature. The object...

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.

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.

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.

Daily weather variables and affective disorder admissions to psychiatric hospitals

Science.gov (United States)

McWilliams, Stephen; Kinsella, Anthony; O'Callaghan, Eadbhard

2014-12-01

Numerous studies have reported that admission rates in patients with affective disorders are subject to seasonal variation. Notwithstanding, there has been limited evaluation of the degree to which changeable daily meteorological patterns influence affective disorder admission rates. A handful of small studies have alluded to a potential link between psychiatric admission rates and meteorological variables such as environmental temperature (heat waves in particular), wind direction and sunshine. We used the Kruskal-Wallis test, ARIMA and time-series regression analyses to examine whether daily meteorological variables—namely wind speed and direction, barometric pressure, rainfall, hours of sunshine, sunlight radiation and temperature—influence admission rates for mania and depression across 12 regions in Ireland over a 31-year period. Although we found some very weak but interesting trends for barometric pressure in relation to mania admissions, daily meteorological patterns did not appear to affect hospital admissions overall for mania or depression. Our results do not support the small number of papers to date that suggest a link between daily meteorological variables and affective disorder admissions. Further study is needed.

Assisted admissions? A national survey of general practitioner experience of involuntary admissions.

LENUS (Irish Health Repository)

Kelly, M

2011-10-01

The 2001 Mental Health Act introduced in 2006, changed how a patient is admitted involuntarily to a psychiatric unit. This paper reports on a national survey of general practitioners\\' experience implementing the Act. Five hundred and sixty eight (568) GPs completed the survey. Twenty five percent (25%) of respondants had not used it. When used, twenty four percent (24%) report that it takes seven hours or more to complete an admission. Fifty percent (50%) of respondents are confident to complete the necessary paperwork. Overall GPs are dissatisfied with arrangements for transport of patients (mean Likert score 3.5), primarily due to the time delay. GPs believe this places risk on the patient, family and GP. Only thirty-three percent (33%) of respondents feel that the Mental Health Act has improved the patient, GP and family experience of involuntary admission.

Series expansions without diagrams

International Nuclear Information System (INIS)

Bhanot, G.; Creutz, M.; Horvath, I.; Lacki, J.; Weckel, J.

1994-01-01

We discuss the use of recursive enumeration schemes to obtain low- and high-temperature series expansions for discrete statistical systems. Using linear combinations of generalized helical lattices, the method is competitive with diagrammatic approaches and is easily generalizable. We illustrate the approach using Ising and Potts models. We present low-temperature series results in up to five dimensions and high-temperature series in three dimensions. The method is general and can be applied to any discrete model

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…

An interlaboratory study to find an alternative to the MPN technique for enumerating Escherichia coli in shellfish

DEFF Research Database (Denmark)

Ogden, I.D.; Brown, G.C.; Gallacher, S.

1998-01-01

Nine laboratories in eight countries tested 16 batches of common mussels (Mytilus edulis) over a 32 week period in order to find an alternative to the Most Probable Number (MPN) technique to enumerate E. coli. The alternatives investigated included the 3M Petrifilm system, the Merck Chromocult agar...

Temperature effects on hospital admissions for kidney morbidity in Taiwan

Energy Technology Data Exchange (ETDEWEB)

Lin, Yu-Kai [Department of Environmental Health, Harvard School of Public Health, 665 Huntington Avenue, Boston, MA 02115 (United States); Wang, Yu-Chun [Department of Bioenvironmental Engineering, College of Engineering, Chung Yuan Christian University, 200 Chung-Pei Road, Chung Li 320, Taiwan (China); Research Center for Environmental Risk Management, Chung Yuan Christian University, 200 Chung-Pei Road, Chung Li 320, Taiwan (China); Ho, Tsung-Jung [The Division of Chinese Medicine, China Medical University Beigang Hospital, Taiwan (China); School Of Chinese Medicine, College of Chinese Medicine, China Medical University, 91 Xueshi Road, Taichung City 404, Taiwan (China); Lu, Chensheng, E-mail: cslu@hsph.harvard.edu [Department of Environmental Health, Harvard School of Public Health, 665 Huntington Avenue, Boston, MA 02115 (United States)

2013-01-15

Objective: This study aimed to associate hospital admissions of kidney diseases with extreme temperature and prolonged heat/cold events in 7 regions of Taiwan. Methods: Age-specific (< 65 years, 65 + years and all ages) hospital admission records of nephritis, nephrotic syndrome, or nephrosis, in the form of electronic insurance reimbursement claims, were retrieved from Taiwan's National Health Insurance Research Database during the period of 2000–2008. The area–age-specific relative risk (RR) accounting for 8 days of lag for temperature on hospital admissions of kidney diseases were estimated using distributed lag non-linear models with the Poisson distribution controlling for extreme temperature events, levels of air pollutants (PM{sub 10}, O{sub 3}, and NO{sub 2}) and potential confounders. Results: We observed a V or J-shape association between daily average temperatures and the RR estimates for hospital admissions of kidney diseases in Taiwan. The lowest risk for hospital admissions of kidney diseases was found at around 25 °C, and risk increased as temperatures deviated from 25 °C. The pooled cumulative 8-day RR for all ages of population of the 7 study areas were 1.10 (95% confidence interval (CI): 1.01, 1.19) at 18 °C and 1.45 (95% CI: 1.27, 1.64) at 30 °C. High temperature has more profound influence on hospital admission of kidney diseases than low temperature. Temperature risks for hospital admissions were similar between younger (< 65 years) and elderly (65 + years) population. This study observed no significant effects of prolonged heat extremes on hospital admissions of kidney diseases. Conclusions: The heat effect for kidney morbidities leading to hospital admission was more significant than that of the cold temperature. This study did not find the age-dependent relative risks for temperature associating with hospital admissions of kidney diseases. - Highlights: ► V or J-shaped association was observed between daily temperatures and

[Influence of postcode on paediatric admissions in Seville].

Science.gov (United States)

Tornero Patricio, Sebastián; Charris-Castro, Liliana; Granero Asencio, Mercedes; Daponte Codina, Antonio

2017-12-01

The postcode (where the home is situated) is an indicator of socioeconomic status and is associated with morbidity, mortality, and the use of health services. The aim of this study was to analyse its effects on paediatric admissions and to determine the rates of the most common causes of paediatric admissions in Seville. An observational cross-sectional study with two analysis units: under 15 year-old "admissions" in public hospitals in Seville (n=2,660) and "city districts" of Seville (n=11). The independent variable analysed was whether the postcode of the admitted patients was within a Regional Government designated "area with social transformation needs". The analysis of the admissions was performed using X 2 -test, Fisher test and Student-t test, with the description of rates using the calculation of crude and specific rates, and by rate ratio. Children living in districts with a lower socioeconomic status were on average 7 months younger (P<.001), and they were significantly more likely to be admitted via the emergency department (P<.001). There was no statistical difference detected in either the length of hospital stay or mortality. The crude admission rate ratio was higher in districts with a lower socioeconomic status (1.8), with a higher specific rate ratio detected in admissions due to asthma, respiratory infections, inguinal hernia, and epilepsy/convulsions. Paediatric hospital admission rates of the main diagnoses were higher in districts with a lower socioeconomic status. Children living in these districts were more likely to be admitted younger and via the emergency department. Copyright © 2016 Asociación Española de Pediatría. Publicado por Elsevier España, S.L.U. All rights reserved.

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

International Nuclear Information System (INIS)

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

2004-01-01

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

Reductive Lie-admissible algebras applied to H-spaces and connections

International Nuclear Information System (INIS)

Sagle, A.A.

1982-01-01

An algebra A with multiplication xy is Lie-admissible if the vector space A with new multiplication [x,y] = xy-yx is a Lie algebra; we denote this Lie algebra by A - . Thus, an associative algebra is Lie-admissible but a Cayley algebra is not Lie-admissible. In this paper we show how Lie-admissible algebras arise from Lie groups and their application to differential geometry on Lie groups via the following theorem. Let A be an n-dimensional Lie-admissible algebra over the reals. Let G be a Lie group with multiplication function μ and with Lie algebra g which is isomorphic to A - . Then there exiss a corrdinate system at the identify e in G which represents μ by a function F:gxg→g defined locally at the origin, such that the second derivative, F 2 , at the origin defines on the vector space g the structure of a nonassociative algebra (g, F 2 ). Furthermore this algebra is isomorphic to A and (g, F 2 ) - is isomorphic to A - . Thus roughly, any Lie-admissible algebra is isomorphic to an algebra obtained from a Lie algebra via a change of coordinates in the Lie group. Lie algebras arise by using canonical coordinates and the Campbell-Hausdorff formula. Applications of this show that any G-invariant psuedo-Riemannian connection on G is completely determined by a suitable Lie-admissible algebra. These results extend to H-spaces, reductive Lie-admissible algebras and connections on homogeneous H-spaces. Thus, alternative and other non-Lie-admissible algebras can be utilized

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

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.

[Intelligence, socio-economic status and hospital admissions of young adults].

Science.gov (United States)

Bosma, H; Traag, T; Berger-van Sijl, M; van Eijk, J; Otten, F

2007-05-12

To determine whether socio-economic differences in hospital admissions of adolescents and young adults are related to differences in intelligence. . Retrospective cohort study. The data were derived from a group of 10,231 young adults and adolescents who were followed for a total of 47,212 person years with regard to their hospital admissions. Intelligence was measured in the first year of secondary school by 2 non-verbal intelligence tests for fluid intelligence. Data from hospital admissions were matched to a large-scale educational and occupational cohort. Data were analysed with Cox proportional hazards analysis. Intelligence was not found to be related to hospital admissions. However, a low occupational and educational level of the young adults or their parents, was strongly related to heightened risk for hospital admissions. In particular, the low socio-economic status of a respondent was associated with heightened risk for hospital admissions due to accidents (relative risk: 3.49; 95% confidence interval: 1.91-6.39). The small extent to which the socio-economic differences in hospital admissions seem to be based upon fluid intelligence, at least in adolescents and young adults, as well as the heightened risks of hospital admissions in lower socio-economic status groups and the associated high costs for health care legitimise further study of the determinants of these differences.

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.

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.

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.

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

Trends in hospital admissions, re-admissions, and in-hospital mortality among HIV-infected patients between 1993 and 2013: Impact of hepatitis C co-infection.

Science.gov (United States)

Meijide, Héctor; Mena, Álvaro; Rodríguez-Osorio, Iria; Pértega, Sonia; Castro-Iglesias, Ángeles; Rodríguez-Martínez, Guillermo; Pedreira, José; Poveda, Eva

2017-01-01

New patterns in epidemiological characteristics of people living with HIV infection (PLWH) and the introduction of Highly Active Antiretroviral Therapy (HAART) have changed the profile of hospital admissions in this population. The aim of this study was to evaluate trends in hospital admissions, re-admissions, and mortality rates in HIV patients and to analyze the role of HCV co-infection. A retrospective cohort study conducted on all hospital admissions of HIV patients between 1993 and 2013. The study time was divided in two periods (1993-2002 and 2003-2013) to be compared by conducting a comparative cross-sectional analysis. A total of 22,901 patient-years were included in the analysis, with 6917 hospital admissions, corresponding to 1937 subjects (75% male, mean age 36±11 years, 37% HIV/HCV co-infected patients). The median length of hospital stay was 8 days (5-16), and the 30-day hospital re-admission rate was 20.1%. A significant decrease in hospital admissions related with infectious and psychiatric diseases was observed in the last period (2003-2013), but there was an increase in those related with malignancies, cardiovascular, gastrointestinal, and chronic respiratory diseases. In-hospital mortality remained high (6.8% in the first period vs. 6.3% in the second one), with a progressive increase of non-AIDS-defining illness deaths (37.9% vs. 68.3%, P<.001). The admission rate significantly dropped after 1996 (4.9% yearly), but it was less pronounced in HCV co-infected patients (1.7% yearly). Hospital admissions due to infectious and psychiatric disorders have decreased, with a significant increase in non-AIDS-defining malignancies, cardiovascular, and chronic respiratory diseases. In-hospital mortality is currently still high, but mainly because of non-AIDS-defining illnesses. HCV co-infection increased the hospital stay and re-admissions during the study period. Copyright © 2016 Elsevier España, S.L.U. and Sociedad Española de Enfermedades Infecciosas y

Introducing the fit-criteria assessment plot - A visualisation tool to assist class enumeration in group-based trajectory modelling.

Science.gov (United States)

Klijn, Sven L; Weijenberg, Matty P; Lemmens, Paul; van den Brandt, Piet A; Lima Passos, Valéria

2017-10-01

Background and objective Group-based trajectory modelling is a model-based clustering technique applied for the identification of latent patterns of temporal changes. Despite its manifold applications in clinical and health sciences, potential problems of the model selection procedure are often overlooked. The choice of the number of latent trajectories (class-enumeration), for instance, is to a large degree based on statistical criteria that are not fail-safe. Moreover, the process as a whole is not transparent. To facilitate class enumeration, we introduce a graphical summary display of several fit and model adequacy criteria, the fit-criteria assessment plot. Methods An R-code that accepts universal data input is presented. The programme condenses relevant group-based trajectory modelling output information of model fit indices in automated graphical displays. Examples based on real and simulated data are provided to illustrate, assess and validate fit-criteria assessment plot's utility. Results Fit-criteria assessment plot provides an overview of fit criteria on a single page, placing users in an informed position to make a decision. Fit-criteria assessment plot does not automatically select the most appropriate model but eases the model assessment procedure. Conclusions Fit-criteria assessment plot is an exploratory, visualisation tool that can be employed to assist decisions in the initial and decisive phase of group-based trajectory modelling analysis. Considering group-based trajectory modelling's widespread resonance in medical and epidemiological sciences, a more comprehensive, easily interpretable and transparent display of the iterative process of class enumeration may foster group-based trajectory modelling's adequate use.