Primitive recursive realizability and basic propositional logic
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
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...
Guerra, Jorge; Uddin, Jasim; Nilsen, Dawn; Mclnerney, James; Fadoo, Ammarah; Omofuma, Isirame B; Hughes, Shatif; Agrawal, Sunil; Allen, Peter; Schambra, Heidi M
2017-07-01
There currently exist no practical tools to identify functional movements in the upper extremities (UEs). This absence has limited the precise therapeutic dosing of patients recovering from stroke. In this proof-of-principle study, we aimed to develop an accurate approach for classifying UE functional movement primitives, which comprise functional movements. Data were generated from inertial measurement units (IMUs) placed on upper body segments of older healthy individuals and chronic stroke patients. Subjects performed activities commonly trained during rehabilitation after stroke. Data processing involved the use of a sliding window to obtain statistical descriptors, and resulting features were processed by a Hidden Markov Model (HMM). The likelihoods of the states, resulting from the HMM, were segmented by a second sliding window and their averages were calculated. The final predictions were mapped to human functional movement primitives using a Logistic Regression algorithm. Algorithm performance was assessed with a leave-one-out analysis, which determined its sensitivity, specificity, and positive and negative predictive values for all classified primitives. In healthy control and stroke participants, our approach identified functional movement primitives embedded in training activities with, on average, 80% precision. This approach may support functional movement dosing in stroke rehabilitation.
Goodstein, R L
2010-01-01
Recursive analysis develops natural number computations into a framework appropriate for real numbers. This text is based upon primary recursive arithmetic and presents a unique combination of classical analysis and intuitional analysis. Written by a master in the field, it is suitable for graduate students of mathematics and computer science and can be read without a detailed knowledge of recursive arithmetic.Introductory chapters on recursive convergence and recursive and relative continuity are succeeded by explorations of recursive and relative differentiability, the relative integral, and
DEFF Research Database (Denmark)
Nielsen, Jacob; Sørensen, Anders Stengaard; Christensen, Thomas Søndergaard
Stroke is a leading cause of serious long-term disability. Post-stroke rehabilitation is a demanding task for the patient and a costly challenge for both society and healthcare systems. We present a novel approach for training of upper extremities after a stroke by utilising an industrial robotic...
Roberts, Eric S
1986-01-01
Concentrating on the practical value of recursion, this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science.
Armstrong, R A; Cairns, N J; Lantos, P L
1998-12-01
The spatial distribution of the diffuse, primitive, and classic amyloid-beta deposits was studied in the upper laminae of the superior frontal gyrus in cases of sporadic Alzheimer disease (AD). Amyloid-beta-stained tissue was counterstained with collagen IV to determine whether the spatial distribution of the amyloid-beta deposits along the cortex was related to blood vessels. In all patients, amyloid-beta deposits and blood vessels were aggregated into distinct clusters and in many patients, the clusters were distributed with a regular periodicity along the cortex. The clusters of diffuse and primitive deposits did not coincide with the clusters of blood vessels in most patients. However, the clusters of classic amyloid-beta deposits coincided with those of the large diameter (>10 microm) blood vessels in all patients and with clusters of small-diameter (upper cortical laminae.
Iteration and primitive recursion in categorical terms
Geuvers, J.H.; Poll, E.; Barendsen, E.; Capretta, V.; Geuvers, H.; Niqui, M.
2007-01-01
We study various well-known schemes for defining inductive and co-inductive types from a categorical perspective. Categorically, an inductive type is just an initial algebra and a coinductive type is just a terminal co-algebra. However, in category theory these notions are quite strong, requiring
Directory of Open Access Journals (Sweden)
Jeffrey eWatumull
2014-01-01
Full Text Available It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauser, Chomsky, and Fitch’s (2002 articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language—the faculty of language in the narrow sense (FLN—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or nonexistent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension; definition by induction (i.e., rules strongly generative of structure; and mathematical induction (i.e., rules for the principled—and potentially unbounded—expansion of strongly generated structure. By these necessary and sufficient criteria, the grammars of all natural
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas
We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... as Poisson structures on the moduli space of flat connections. The theory has a wider scope than that and one expects that many functorial objects in low-dimensional geometry and topology should have a GR construction. The geometric recursion has various projections to topological recursion (TR) and we...... in particular show it retrieves all previous variants and applications of TR. We also show that, for any initial data for topological recursion, one can construct initial data for GR with values in Frobenius algebra-valued continuous functions on Teichmueller space, such that the ωg,n of TR are obtained...
Müller, Gert; Sacks, Gerald
1990-01-01
These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
DEFF Research Database (Denmark)
Oliva, Paulo Borges
2002-01-01
Modified bar recursion is a variant of Spector's bar recursion which can be used to give a realizability interpretation of the classical axiom of dependent choice. This realizability allows for the extraction of witnesses from proofs of forall-exists-formulas in classical analysis. In this talk I...... shall report on results regarding the relationship between modified and Spector's bar recursion. I shall also show that a seemingly weak form of modified bar recursion is as strong as "full" modified bar recursion in higher types....
On Synchronization Primitive Systems.
The report studies the question: what synchronization primitive should be used to handle inter-process communication. A formal model is presented...between these synchronization primitives. Although only four synchronization primitives are compared, the general methods can be used to compare other... synchronization primitives. Moreover, in the definitions of these synchronization primitives, conditional branches are explicitly allowed. In addition
Domaratzki, Michael; Rampersad, Narad
2011-01-01
We investigate Abelian primitive words, which are words that are not Abelian powers. We show that unlike classical primitive words, the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive in linear time. Also different from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration problems and the relation to the theory of codes. Peer reviewed
Recursion complexity in cognition
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.
Lowenthal, Francis
2010-11-01
This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.
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.
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
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.
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.
Dynamic Primitives in the Control of Locomotion
Directory of Open Access Journals (Sweden)
Neville eHogan
2013-06-01
Full Text Available Humans achieve locomotor dexterity that far exceeds the capability of modern robots, yet this is achieved despite slower actuators, imprecise sensors and vastly slower communication. We propose that this spectacular performance arises from encoding motor commands in terms of dynamic primitives. We propose three primitives as a foundation for a comprehensive theoretical framework that can embrace a wide range of upper- and lower-limb behaviors. Building on previous work that suggested discrete and rhythmic movements as elementary dynamic behaviors, we define submovements and oscillations: As discrete movements cannot be combined with sufficient flexibility, we argue that suitably-defined submovements are primitives. As the term rhythmic may be ambiguous, we define oscillations as the corresponding class of primitives. We further propose mechanical impedances as a third class of dynamic primitives, necessary for interaction with the physical environment. Combination of these three classes of primitive requires care. One approach is through a generalized equivalent network: a virtual trajectory composed of simultaneous and/or sequential submovements and/or oscillations that interacts with mechanical impedances to produce observable forces and motions. Reliable experimental identification of these dynamic primitives presents challenges: Identification of mechanical impedances is exquisitely sensitive to assumptions about their dynamic structure; identification of submovements and oscillations is sensitive to their assumed form and to details of the algorithm used to extract them. Some methods to address these challenges are presented. Some implications of this theoretical framework for locomotor rehabilitation are considered.
Dynamic primitives in the control of locomotion.
Hogan, Neville; Sternad, Dagmar
2013-01-01
Humans achieve locomotor dexterity that far exceeds the capability of modern robots, yet this is achieved despite slower actuators, imprecise sensors, and vastly slower communication. We propose that this spectacular performance arises from encoding motor commands in terms of dynamic primitives. We propose three primitives as a foundation for a comprehensive theoretical framework that can embrace a wide range of upper- and lower-limb behaviors. Building on previous work that suggested discrete and rhythmic movements as elementary dynamic behaviors, we define submovements and oscillations: as discrete movements cannot be combined with sufficient flexibility, we argue that suitably-defined submovements are primitives. As the term "rhythmic" may be ambiguous, we define oscillations as the corresponding class of primitives. We further propose mechanical impedances as a third class of dynamic primitives, necessary for interaction with the physical environment. Combination of these three classes of primitive requires care. One approach is through a generalized equivalent network: a virtual trajectory composed of simultaneous and/or sequential submovements and/or oscillations that interacts with mechanical impedances to produce observable forces and motions. Reliable experimental identification of these dynamic primitives presents challenges: identification of mechanical impedances is exquisitely sensitive to assumptions about their dynamic structure; identification of submovements and oscillations is sensitive to their assumed form and to details of the algorithm used to extract them. Some methods to address these challenges are presented. Some implications of this theoretical framework for locomotor rehabilitation are considered.
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
Recursion theory for metamathematics
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.
Vos, De Dirk
2003-01-01
Intensely realistic, piercingly beautiful, the art of the Flemish Primitives inspires powerful emotional responses. Painted during the fifteenth century in the southern Netherlands, these influential and enduring works helped establish the foundations of modern European painting.Sumptuously
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....
Recursive Algorithm For Linear Regression
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.
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.
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...
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...
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)
Srivastava, Amit Kumar; Kapoor, Kalpesh
2017-01-01
Let Q be the set of primitive words over a finite alphabet with at least two symbols. We characterize a class of primitive words, Q_I, referred to as ins-robust primitive words, which remain primitive on insertion of any letter from the alphabet and present some properties that characterizes words in the set Q_I. It is shown that the language Q_I is dense. We prove that the language of primitive words that are not ins-robust is not context-free. We also present a linear time algorithm to reco...
Recursion Relations for Conformal Blocks
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.
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.
Proof Rules for Recursive Procedures
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
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...
Lessons in Contingent, Recursive Humility
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…
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...
How Learning Logic Programming Affects Recursion Comprehension
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…
Optimal primitive reference frames
International Nuclear Information System (INIS)
Jennings, David
2011-01-01
We consider the smallest possible directional reference frames allowed and determine the best one can ever do in preserving quantum information in various scenarios. We find that for the preservation of a single spin state, two orthogonal spins are optimal primitive reference frames; and in a product state, they do approximately 22% as well as an infinite-sized classical frame. By adding a small amount of entanglement to the reference frame, this can be raised to 2(2/3) 5 =26%. Under the different criterion of entanglement preservation, a very similar optimal reference frame is found; however, this time it is for spins aligned at an optimal angle of 87 deg. In this case 24% of the negativity is preserved. The classical limit is considered numerically, and indicates under the criterion of entanglement preservation, that 90 deg. is selected out nonmonotonically, with a peak optimal angle of 96.5 deg. for L=3 spins.
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)
Unsupervised Learning of Action Primitives
DEFF Research Database (Denmark)
Baby, Sanmohan; Krüger, Volker; Kragic, Danica
2010-01-01
and scale, the use of the object can provide a strong invariant for the detection of motion primitives. In this paper we propose an unsupervised learning approach for action primitives that makes use of the human movements as well as the object state changes. We group actions according to the changes......Action representation is a key issue in imitation learning for humanoids. With the recent finding of mirror neurons there has been a growing interest in expressing actions as a combination meaningful subparts called primitives. Primitives could be thought of as an alphabet for the human actions....... In this paper we observe that human actions and objects can be seen as being intertwined: we can interpret actions from the way the body parts are moving, but as well from how their effect on the involved object. While human movements can look vastly different even under minor changes in location, orientation...
Motion Primitives for Action Recognition
DEFF Research Database (Denmark)
Fihl, Preben; Holte, Michael Boelstoft; Moeslund, Thomas B.
2007-01-01
the actions as a sequence of temporal isolated instances, denoted primitives. These primitives are each defined by four features extracted from motion images. The primitives are recognized in each frame based on a trained classifier resulting in a sequence of primitives. From this sequence we recognize......The number of potential applications has made automatic recognition of human actions a very active research area. Different approaches have been followed based on trajectories through some state space. In this paper we also model an action as a trajectory through a state space, but we represent...... different temporal actions using a probabilistic Edit Distance method. The method is tested on different actions with and without noise and the results show recognition rates of 88.7% and 85.5%, respectively....
Action Recognition using Motion Primitives
DEFF Research Database (Denmark)
Moeslund, Thomas B.; Fihl, Preben; Holte, Michael Boelstoft
the actions as a sequence of temporal isolated instances, denoted primitives. These primitives are each defined by four features extracted from motion images. The primitives are recognized in each frame based on a trained classifier resulting in a sequence of primitives. From this sequence we recognize......The number of potential applications has made automatic recognition of human actions a very active research area. Different approaches have been followed based on trajectories through some state space. In this paper we also model an action as a trajectory through a state space, but we represent...... different temporal actions using a probabilistic Edit Distance method. The method is tested on different actions with and without noise and the results show recognizing rates of 88.7% and 85.5%, respectively....
On the Relation between Spector's Bar Recursion and Modified Bar Recursion
DEFF Research Database (Denmark)
Oliva, Paulo Borges
2002-01-01
We introduce a variant of Spector's Bar Recursion in finite types to give a realizability interpretation of the classical axiom of dependent choice allowing for the extraction of witnesses from proofs of Sigma_1 formulas in classical analysis. We also give a bar recursive definition of the fan...... functional and study the relationship of our variant of Bar Recursion with others....
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.
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.
AGUA TIBIA PRIMITIVE AREA, CALIFORNIA.
Irwin, William P.; Thurber, Horace K.
1984-01-01
The Agua Tibia Primitive Area in southwestern California is underlain by igneous and metamorphic rocks that are siilar to those widely exposed throughout much of the Peninsular Ranges. To detect the presence of any concealed mineral deposits, samples of stream sediments were collected along the various creeks that head in the mountain. As an additional aid in evaluating the mineral potential, an aeromagnetic survey was made and interpreted. A search for records of past or existing mining claims within the primitive area was made but none was found. Evidence of deposits of metallic or nonmetallic minerals was not seen during the study.
Bounded queries in recursion theory
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.
Chemistry of primitive solar material
International Nuclear Information System (INIS)
Barshay, S.S.; Lewis, J.S.
1976-01-01
The chemical processes that occurred in the cooler, outer regions of the primitive solar nebula at the time of intimate chemical contact between preplanetary condensate and nebular gas constitute the subject matter of this review. Condensation models are described and tested against the observed properties of the planets, their satellites, and the asteroids. 6 figs., 2 tables, 48 refs
Cryptographic Primitives with Quasigroup Transformations
Mileva, Aleksandra
2010-01-01
Cryptology is the science of secret communication, which consists of two complementary disciplines: cryptography and cryptanalysis. Cryptography is dealing with design and development of new primitives, algorithms and schemas for data enciphering and deciphering. For many centuries cryptographic technics have been applied in protection of secrecy and authentication in diplomatic, political and military correspondences and communications. Cryptanalysis is dealing with different attacks on c...
Recursive sequences in first-year calculus
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.
From Realistic to Primitive Models: A Primitive Model of Methanol
Czech Academy of Sciences Publication Activity Database
Vlček, Lukáš; Nezbeda, Ivo
2003-01-01
Roč. 101, č. 19 (2003), s. 2987-2996 ISSN 0026-8976 R&D Projects: GA AV ČR IAA4072303; GA AV ČR IAA4072309 Grant - others:NATO(XX) PST.CLG 978178/6343 Institutional research plan: CEZ:AV0Z4072921 Keywords : primitive model * methanol Subject RIV: CF - Physical ; Theoretical Chemistry Impact factor: 1.591, year: 2003
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
Amalric, Marie; Wang, Liping; Figueira, Santiago; Sigman, Mariano; Dehaene, Stanislas
2017-01-01
During language processing, humans form complex embedded representations from sequential inputs. Here, we ask whether a “geometrical language” with recursive embedding also underlies the human ability to encode sequences of spatial locations. We introduce a novel paradigm in which subjects are exposed to a sequence of spatial locations on an octagon, and are asked to predict future locations. The sequences vary in complexity according to a well-defined language comprising elementary primitives and recursive rules. A detailed analysis of error patterns indicates that primitives of symmetry and rotation are spontaneously detected and used by adults, preschoolers, and adult members of an indigene group in the Amazon, the Munduruku, who have a restricted numerical and geometrical lexicon and limited access to schooling. Furthermore, subjects readily combine these geometrical primitives into hierarchically organized expressions. By evaluating a large set of such combinations, we obtained a first view of the language needed to account for the representation of visuospatial sequences in humans, and conclude that they encode visuospatial sequences by minimizing the complexity of the structured expressions that capture them. PMID:28125595
Vicari, Giuseppe; Adenzato, Mauro
2014-05-01
In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains. Copyright © 2014 Elsevier Inc. All rights reserved.
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 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.
Recursion theory computational aspects of definability
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.
SPANISH PEAKS PRIMITIVE AREA, MONTANA.
Calkins, James A.; Pattee, Eldon C.
1984-01-01
A mineral survey of the Spanish Peaks Primitive Area, Montana, disclosed a small low-grade deposit of demonstrated chromite and asbestos resources. The chances for discovery of additional chrome resources are uncertain and the area has little promise for the occurrence of other mineral or energy resources. A reevaluation, sampling at depth, and testing for possible extensions of the Table Mountain asbestos and chromium deposit should be undertaken in the light of recent interpretations regarding its geologic setting.
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
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.
Efficient Synchronization Primitives for GPUs
Stuart, Jeff A.; Owens, John D.
2011-01-01
In this paper, we revisit the design of synchronization primitives---specifically barriers, mutexes, and semaphores---and how they apply to the GPU. Previous implementations are insufficient due to the discrepancies in hardware and programming model of the GPU and CPU. We create new implementations in CUDA and analyze the performance of spinning on the GPU, as well as a method of sleeping on the GPU, by running a set of memory-system benchmarks on two of the most common GPUs in use, the Tesla...
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...
Compositional studies of primitive asteroids
International Nuclear Information System (INIS)
Vilas, F.
1988-01-01
The composition of primitive asteroids and their relationship to satellites in the solar system will be studied by analyzing existing narrowband charge coupled device (CCD) reflectance spectra, acquiring additional spectra of asteroids and small satellites in the 0.5 to 1.0 micrometer spectral range, and exploring possibilities for obtaining compositional information in the blue-UV spectral region. Comparison with laboratory spectra of terrestrial chlorites and serpentines (phyllosilicates) and the clay minerals found in carbonaceous chondrite meteorites will continue. During 1987, narrowband CCD reflectance spectra of 17 additional asteroids were acquired. These spectra and spectra of 34 other asteroids have been used primarily for two studies: weak absorption features similar to those due to Fe2(+) and Fe2(+) - Fe3(+) transitions in iron oxides f ound in terrestrial chlorites and serpentines and carbonaceous chondrites have been identified in some primitive asteroid spectra. There is a first indication that asteroids grouped by heliocentric distance show similar weak absorption features. Nonparametric statistics are being applied to test the hypothesis of discrete remnants of a gradation in composition of outer-belt asteroids
[Cranial trepanation in primitive cultures].
González-Darder, José Manuel
A review is presented on cranial trepanations performed by primitive cultures. The scientific interest in this topic began after the discovery in 1965 by Ephraim G. Squier of a pre-Columbian trepanated skull, and studied by Paul Broca in Paris. Pseudotrepanation and other types of cranial manipulation are reviewed. The techniques, technology, and instruments for every type of trepanation are well known. There are a surprisingly high percentage of cases showing signs of post-trepanation survival. Indications for trepanation are speculative, perhaps magic. Although trepanation in primitive cultures is widespread around the world, and throughout time, the main fields of interest are the Neolithic Period in Europe, the pre-Columbian Period in Andean South America, and some contemporaneous Pacific and African tribes. This particular trepanation procedure has no relationship with modern Neurosurgery, or with trepanations with therapeutic purposes performed since the Greco-Roman period in Europe, and afterwards around the world. Copyright © 2016 Sociedad Española de Neurocirugía. Publicado por Elsevier España, S.L.U. All rights reserved.
Breast metastases primitive extra mammary
International Nuclear Information System (INIS)
Terzieff, V.; Vázquez, A.; Alonso, I.; Sabini, G.
2004-01-01
Less than 3% of all breast cancers originate from a primitive extra mammary. In 40% of cases it is the first manifestation of the primitive properly studied but 80% are associated with widely disseminated disease. It typically presents as a nodule on external quadrant s painful in half the cases. The majority (60%) of metastases derived from breast contralateral breast tumors are believed to via the lymphatic system. of the ; extra mammary the most common tumors are melanoma; hematologic and neuroendocrine. Although some imaging characteristics can guide diagnosis is histological. Cytology has good performance in experienced hands; but up to 25% of cases there may be difficulty in establishing diagnosis. Treatment depends on the type of tumor. Mastectomy should not be practiced or axillary clearance routine as is generally the context of disease disseminated. Radiation therapy may be useful for local control. It has been proposed laser ablation but no experience with it. The overall prognosis is bad. For a man of 45 with a breast metastasis occurs only a clear cell carcinoma of the kidney
Adaptable Iterative and Recursive Kalman Filter Schemes
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.
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)
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
A foundation for real recursive function theory
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
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...
Adaptable recursive binary entropy coding technique
Kiely, Aaron B.; Klimesh, Matthew A.
2002-07-01
We present a novel data compression technique, called recursive interleaved entropy coding, that is based on recursive interleaving of variable-to variable length binary source codes. A compression module implementing this technique has the same functionality as arithmetic coding and can be used as the engine in various data compression algorithms. The encoder compresses a bit sequence by recursively encoding groups of bits that have similar estimated statistics, ordering the output in a way that is suited to the decoder. As a result, the decoder has low complexity. The encoding process for our technique is adaptable in that each bit to be encoded has an associated probability-of-zero estimate that may depend on previously encoded bits; this adaptability allows more effective compression. Recursive interleaved entropy coding may have advantages over arithmetic coding, including most notably the admission of a simple and fast decoder. Much variation is possible in the choice of component codes and in the interleaving structure, yielding coder designs of varying complexity and compression efficiency; coder designs that achieve arbitrarily small redundancy can be produced. We discuss coder design and performance estimation methods. We present practical encoding and decoding algorithms, as well as measured performance results.
Certified higher-order recursive path ordering
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
A Survey on Teaching and Learning Recursive Programming
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…
Primitive Based Action Representation and Recognition
DEFF Research Database (Denmark)
Baby, Sanmohan; Krüger, Volker
2009-01-01
a sequential and statistical learning algorithm for automatic detection of the action primitives and the action grammar based on these primitives. We model a set of actions using a single HMM whose structure is learned incrementally as we observe new types. Actions are modeled with sufficient...
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...
a Recursive Approach to Compute Normal Forms
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.
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.)
A recursive algorithm for trees and forests
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.
Discovery of Intrinsic Primitives on Triangle Meshes
Solomon, Justin; Ben-Chen, Mirela; Butscher, Adrian; Guibas, Leonidas
2011-01-01
The discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones
Discovery of Intrinsic Primitives on Triangle Meshes
Solomon, Justin
2011-04-01
The discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones as the building blocks of shapes, and thus to discover parts by fitting such primitives to a given surface. This approach, however, will break down if primitive parts have undergone almost-isometric deformations, as is the case, for example, for articulated human models. We suggest that parts can be discovered instead by finding intrinsic primitives, which we define as parts that posses an approximate intrinsic symmetry. We employ the recently-developed method of computing discrete approximate Killing vector fields (AKVFs) to discover intrinsic primitives by investigating the relationship between the AKVFs of a composite object and the AKVFs of its parts. We show how to leverage this relationship with a standard clustering method to extract k intrinsic primitives and remaining asymmetric parts of a shape for a given k. We demonstrate the value of this approach for identifying the prominent symmetry generators of the parts of a given shape. Additionally, we show how our method can be modified slightly to segment an entire surface without marking asymmetric connecting regions and compare this approach to state-of-the-art methods using the Princeton Segmentation Benchmark. © 2011 The Author(s).
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 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...
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
Primitive and definitive erythropoiesis in mammals
Directory of Open Access Journals (Sweden)
James ePalis
2014-01-01
Full Text Available Red blood cells (RBCs, which constitute the most abundant cell type in the body, come in two distinct flavors- primitive and definitive. Definitive RBCs in mammals circulate as smaller, anucleate cells during fetal and postnatal life, while primitive RBCs circulate transiently in the early embryo as large, nucleated cells before ultimately enucleating. Both cell types are formed from lineage-committed progenitors that generate a series of morphologically identifiable precursors that enucleate to form mature RBCs. While definitive erythroid precursors mature extravascularly in the fetal liver and postnatal marrow in association with macrophage cells, primitive erythroid precursors mature as a semi-synchronous cohort in the embryonic bloodstream. While the cytoskeletal network is critical for the maintenance of cell shape and the deformability of definitive RBCs, little is known about the components and function of the cytoskeleton in primitive erythroblasts. Erythropoietin (EPO is a critical regulator of late-stage definitive, but not primitive, erythroid progenitor survival. However, recent studies indicate that EPO regulates multiple aspects of terminal maturation of primitive murine and human erythroid precursors, including cell survival, proliferation, and the rate of terminal maturation. Primitive and definitive erythropoiesis share central transcriptional regulators, including Gata1 and Klf1, but are also characterized by the differential expression and function of other regulators, including myb, Sox6, and Bcl11A. Flow cytometry-based methodologies, developed to purify murine and human stage-specific erythroid precursors, have enabled comparative global gene expression studies and are providing new insights into the biology of erythroid maturation.
Recursive deconvolution of combinatorial chemical libraries.
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...
The Lehmer Matrix and Its Recursive Analogue
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
Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind
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
Primitive Based Action Representation and recognition
DEFF Research Database (Denmark)
Baby, Sanmohan
The presented work is aimed at designing a system that will model and recognize actions and its interaction with objects. Such a system is aimed at facilitating robot task learning. Activity modeling and recognition is very important for its potential applications in surveillance, human-machine i......The presented work is aimed at designing a system that will model and recognize actions and its interaction with objects. Such a system is aimed at facilitating robot task learning. Activity modeling and recognition is very important for its potential applications in surveillance, human......-machine interface, entertainment, biomechanics etc. Recent developments in neuroscience suggest that all actions are a compositions of smaller units called primitives. Current works based on primitives for action recognition uses a supervised framework for specifying the primitives. We propose a method to extract...... primitives automatically. These primitives are to be used to generate actions based on certain rules for combining. These rules are expressed as a stochastic context free grammar. A model merging approach is adopted to learn a Hidden Markov Model to t the observed data sequences. The states of the HMM...
Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms
Directory of Open Access Journals (Sweden)
Gregorio de Miguel Casado
2007-01-01
Full Text Available This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trade-off between time delay, area costs, and stability. The method is particularly suitable for the mathematical transforms used in signal processing applications. A generic calculation scheme is developed for the discrete fast Fourier transform (DFT and then applied to other integral transforms such as the discrete Hartley transform (DHT, the discrete cosine transform (DCT, and the discrete sine transform (DST. Some comparisons with other well-known proposals are also provided.
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.
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)
Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning
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,…
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.
MR imaging of persistent primitive trigeminal artery
International Nuclear Information System (INIS)
Ashikaga, Ryuichiro; Araki, Yutaka; Ono, Yukihiko; Ishida, Osamu; Mabuchi, Nobuhisa.
1997-01-01
The persistent trigeminal artery is the most common anomaly of the primitive carotid-vertebrobasilar anastomoses. We reviewed MR images and MR angiographies of 11 patients with primitive trigeminal artery. In 8 of the 11 cases, PTA were identified with conventional long TR spin-echo images. In 8 of 11 cases, a hypoplastic basilar trunk associated with PTA was seen on both MR images and MR angiographies. In 7 of 11 cases, a hypoplasia or agenesis of the ipsilateral posterior communicating artery was seen on MR angiographies. (author)
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
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...
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...
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...
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.
Evolution of Computational Toxicology-from Primitive ...
Presentation at the Health Canada seminar in Ottawa, ON, Canada on Nov. 15. 2016 Presentation at the Health Canada seminar in Ottawa, ON, Canada on Nov. 15. 2016 on the Evolution of Computational Toxicology-from Primitive Beginnings to Sophisticated Application
Melville and the Tradition of Primitive Utopia.
Beauchamp, Gorman
1981-01-01
Discusses the relationships among the myth of the Golden Age, the concept of the Noble Savage, and the dream of Utopia. Uses Lewis Mumford's division of utopias into two basic types, i.e., reconstruction and escape utopias, to examine Herman Melville's "Typee" as an example of the primitive escapist utopia. (Editor/DMM)
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.
Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind
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
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.
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.
Semantic Primitives of Time and Space in Hong Kong Cantonese.
Tong, Malindy; And Others
1997-01-01
Semantic primitives for time and space, as proposed in Natural Semantic Metalanguage theory, are examined for lexical equivalents in Hong Kong Cantonese. Temporal primitives are all found to have clear Cantonese exponents that can be combined as predicted with other metalanguage elements, with two exceptions. Spatial primitives all appear to have…
Survival of the primitive mantle reservoir?
Huang, S.; Jacobsen, S. B.; Mukhopadhyay, S.
2010-12-01
The high-3He lavas are thought to originate from a deep primitive mantle source that has not been much modified since the formation of Earth’s core. Comparison of 4He/3He in MORBs and plume lavas indicate that the plume sources must be a lower mantle feature, in agreement with most geophysical inferences. However, the lithophile element isotope systems of plume lavas are not primitive. The idea that the high-3He source is significantly less processed and more primitive than MORB source is clearly supported by mixing trends in plots of 4He/3He versus Sr, Nd and Pb isotope ratios, which have been extrapolated to an inferred 4He/3He of ~17,000 (~43x the atmospheric ratio), a mantle reservoir named PHEM (Primitive HElium Mantle). Slightly lower 4He/3He, ~15,000, were reported for Baffin Island picrites. Recently, Jackson et al. (2010) claimed that some Baffin Island and Greenland picrites with single-stage Pb model ages of ~4.5 Ga have low 4He/3He, and argued that “their source is the most ancient accessible reservoir in the Earth’s mantle, and it may be parental to all mantle reservoirs”. However, the available data are insufficient to make such a claim, and we suggest an alternative interpretation. Specially: 1. Four out of ten Baffin Island and Greenland picrites used by Jackson et al. (2010) have 4He/3He higher than average MORB value and all are far removed from the lowest measured value of 15,000. 2. Five Greenland picrites which cluster around the 4.50 Gyr geochron (Jackson et al., 2010) form a curved 207Pb*/206Pb*-4He/3He trend. This trend is best explained as a mixing line, implying that the single-stage Pb ages of these lavas are meaningless. 3. In a 207Pb*/206Pb*-4He/3He plot, Koolau lavas from Hawaii overlap with Baffin Island and Greenland picrites. If Baffin Island and Greenland picrites represent melts from the primitive mantle based on their Pb and He isotopes (Jackson et al., 2010), a similar argument can be applied to Koolau lavas. However, it
Hard Spheres on the Primitive Surface
Dotera, Tomonari; Takahashi, Yusuke
2015-03-01
Recently hierarchical structures associated with the gyroid in several soft-matter systems have been reported. One of fundamental questions is regular arrangement or tiling on minimal surfaces. We have found certain numbers of hard spheres per unit cell on the gyroid surface are entropically self-organized. Here, new results for the primitive surface are presented. 56/64/72 per unit cell on the primitive minimal surface are entropically self-organized. Numerical evidences for the fluid-solid transition as a function of hard sphere radius are obtained in terms of the acceptance ratio of Monte Carlo moves and order parameters. These arrangements, which are the extensions of the hexagonal arrangement on a flat surface, can be viewed as hyperbolic tiling on the Poincaré disk with a negative Gaussian curvature.
Primary primitive neuroectodermal tumor of the orbit
Directory of Open Access Journals (Sweden)
Das Dipankar
2009-01-01
Full Text Available Primitive neuroectodermal tumor (PNET is a small round cell malignant tumor of neuroectodermal origin. Most of the PNETs occur in the central nervous system (CNS. PNETs recognized outside of CNS are diagnosed as peripheral PNET (pPNET. This tumor which expresses MIC-2 gene (CD99 seems to be least aggressive after complete tumor resection. We describe a rare case of PNET in a young girl.
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.
Inner and Outer Recursive Neural Networks for Chemoinformatics Applications.
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.
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.
Accounting for primitive terms in mathematics
Directory of Open Access Journals (Sweden)
D.F.M. Strauss
2005-07-01
Full Text Available The philosophical problem of unity and diversity entails a challenge to the rationalist aim to define everything. Definitions of this kind surface in various academic disciplines in formulations like uniqueness, irreducibility, and what has acquired the designation “primitive terms”. Not even the most “exact” disciplines, such as mathematics, can avoid the implications entailed in giving an account of such primitive terms. A mere look at the historical development of mathematics highlights the fact that alternative perspectives prevailed – from the arithmeticism of Pythagoreanism, the eventual geometrisation of mathematics after the discovery of incommensurability up to the revival of arithmeticism in the mathematics of Cauchy, Weierstrass, Dedekind and Cantor (with the later orientation of Frege, who completed the circle by returning to the view that mathematics essentially is geometry. An assessment of logicism and axiomatic formalism is followed by looking at the primitive meaning of wholeness (and the whole-parts relation. With reference to the views of Hilbert, Weyl and Bernays the article concludes by suggesting that in opposition to arithmeticism and geometricism an alternative option ought to be pursued – one in which both the uniqueness and mutual coherence between the aspects of number and space are acknowledged.
Recursive stochastic effects in valley hybrid inflation
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.
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
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
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
Primary Ewing Sarcoma/Primitive Neuroectodermal Tumor of the Stomach
Directory of Open Access Journals (Sweden)
Safi Khuri
2016-11-01
Full Text Available Ewing sarcoma/primitive neuroectodermal tumor (ES/PNET is a tumor of small round cells arising in skeletal tissues. These tumors rarely arise in the stomach. We present a 31-year-old healthy female patient who was admitted to our surgical ward due to upper gastrointestinal hemorrhage. Upper endoscopy revealed a large ulcerated bleeding mass originating from the lesser curvature. Biopsy revealed tumor cell immunoreactivity positive for CD99, vimentin, and Ki67 (an index of proliferation. These findings were compatible with gastric ES/PNET. The fluorescence in situ hybridization analysis result for the EWSR1 gene rearrangement (11: 22 translocation was positive. The patient refused neoadjuvant treatment and thus underwent an operation during which a mass at the lesser curvature of the stomach was found. The mass was adhering to the pancreatic tail and to the mesentery of the transverse and descending colon. Total gastrectomy, distal pancreatectomy, splenectomy, and left adrenalectomy were done. The patient refused adjuvant treatment. She is free of disease 3 years after surgery.
Microfluidic assay of the deformability of primitive erythroblasts.
Zhou, Sitong; Huang, Yu-Shan; Kingsley, Paul D; Cyr, Kathryn H; Palis, James; Wan, Jiandi
2017-09-01
Primitive erythroblasts (precursors of red blood cells) enter vascular circulation during the embryonic period and mature while circulating. As a result, primitive erythroblasts constantly experience significant hemodynamic shear stress. Shear-induced deformation of primitive erythroblasts however, is poorly studied. In this work, we examined the deformability of primitive erythroblasts at physiologically relevant flow conditions in microfluidic channels and identified the regulatory roles of the maturation stage of primitive erythroblasts and cytoskeletal protein 4.1 R in shear-induced cell deformation. The results showed that the maturation stage affected the deformability of primitive erythroblasts significantly and that primitive erythroblasts at later maturational stages exhibited a better deformability due to a matured cytoskeletal structure in the cell membrane.
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
Recursion to food plants by free-ranging Bornean elephant.
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
Primitive Endoderm Differentiation: From Specification to Epithelialization.
Bassalert, Cécilia; Valverde-Estrella, Lorena; Chazaud, Claire
2018-01-01
At the time of implantation, the mouse blastocyst has developed three cell lineages: the epiblast (Epi), the primitive endoderm (PrE), and the trophectoderm (TE). The PrE and TE are extraembryonic tissues but their interactions with the Epi are critical to sustain embryonic growth, as well as to pattern the embryo. We review here the cellular and molecular events that lead to the production of PrE and Epi lineages and discuss the different hypotheses that are proposed for the induction of these cell types. In the second part, we report the current knowledge about the epithelialization of the PrE. © 2018 Elsevier Inc. All rights reserved.
Primary primitive neuroectodermal tumor of the cervix
Li, Bo; Ouyang, Ling; Han, Xue; Zhou, Yang; Tong, Xin; Zhang, Shulang; Zhang, Qingfu
2013-01-01
Primary primitive neuroectodermal tumors (PNETs) are rare and high-grade malignant tumors that mostly occur in children and young adults. The most common sites are the trunk, limbs, and retroperitoneum. Herein, we present a case of a PNET involving the cervix uteri in a 27-year-old woman. The lesion showed characteristic histologic features of a PNET and was positive for the immunohistochemical markers cluster of differentiation (CD) 99, vimentin, neuron-specific enolase, neural cell adhesion molecule 1 (CD56), and CD117 (c-kit), further defining the tumor while helping to confirm PNET. The clinical Stage IIIB tumor was treated with chemotherapy and radiotherapy. PMID:23836982
An Overview of DRAM-Based Security Primitives
Directory of Open Access Journals (Sweden)
Nikolaos Athanasios Anagnostopoulos
2018-03-01
Full Text Available Recent developments have increased the demand for adequate security solutions, based on primitives that cannot be easily manipulated or altered, such as hardware-based primitives. Security primitives based on Dynamic Random Access Memory (DRAM can provide cost-efficient and practical security solutions, especially for resource-constrained devices, such as hardware used in the Internet of Things (IoT, as DRAMs are an intrinsic part of most contemporary computer systems. In this work, we present a comprehensive overview of the literature regarding DRAM-based security primitives and an extended classification of it, based on a number of different criteria. In particular, first, we demonstrate the way in which DRAMs work and present the characteristics being exploited for the implementation of security primitives. Then, we introduce the primitives that can be implemented using DRAM, namely Physical Unclonable Functions (PUFs and True Random Number Generators (TRNGs, and present the applications of each of the two types of DRAM-based security primitives. We additionally proceed to assess the security such primitives can provide, by discussing potential attacks and defences, as well as the proposed security metrics. Subsequently, we also compare these primitives to other hardware-based security primitives, noting their advantages and shortcomings, and proceed to demonstrate their potential for commercial adoption. Finally, we analyse our classification methodology, by reviewing the criteria employed in our classification and examining their significance.
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.
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
Primitive Accumulation and Temporalities of Capitalism
Directory of Open Access Journals (Sweden)
Joanna Bednarek
2015-04-01
Full Text Available The main thesis of the article is the statement that capitalism is composed of many different, incoherent temporalities, as well as that apprehension of capitalism from the angle of primitive accumulation enables the more accurate grasp of the modes of its functioning, including the complexity created by the interactions of the temporalities mentionned. The problem of primitive accumulation is, as Sandro Mezzadra proves, a good starting point for analysing this issue. It allows us to pose two questions: first, the question of the relation between the historical dimension and the structural logic of capitalism; second, the question of hierarchical relation between the center and the periphery of the capitalist system.Dipesh Chakrabarty’s project of ‘provincializing Europe’ proves helpful here, as it’s goal is deconstruction of the categories of progress, modernization and the capital with its abstract structure. The aim is not to negate the fact that capitalist abstraction is a real force, but to show that this force develops by means of constant assimiliation of the other – redefined as ‘backward’ or archaic. The linear scheme is in force, because it is the main mechanism of imposing the power of capital; as such, it is not politically neutral.
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.)
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.
Primitive chain network simulations of probe rheology.
Masubuchi, Yuichi; Amamoto, Yoshifumi; Pandey, Ankita; Liu, Cheng-Yang
2017-09-27
Probe rheology experiments, in which the dynamics of a small amount of probe chains dissolved in immobile matrix chains is discussed, have been performed for the development of molecular theories for entangled polymer dynamics. Although probe chain dynamics in probe rheology is considered hypothetically as single chain dynamics in fixed tube-shaped confinement, it has not been fully elucidated. For instance, the end-to-end relaxation of probe chains is slower than that for monodisperse melts, unlike the conventional molecular theories. In this study, the viscoelastic and dielectric relaxations of probe chains were calculated by primitive chain network simulations. The simulations semi-quantitatively reproduced the dielectric relaxation, which reflects the effect of constraint release on the end-to-end relaxation. Fair agreement was also obtained for the viscoelastic relaxation time. However, the viscoelastic relaxation intensity was underestimated, possibly due to some flaws in the model for the inter-chain cross-correlations between probe and matrix chains.
Design and Analysis of Symmetric Primitives
DEFF Research Database (Denmark)
Lauridsen, Martin Mehl
. In the second part, we delve into the matter of the various aspects of designing a symmetric cryptographic primitive. We start by considering generalizations of the widely acclaimed Advanced Encryption Standard (AES) block cipher. In particular, our focus is on a component operation in the cipher which permutes...... analyze and implement modes recommended by the National Institute of Standards and Technology (NIST), as well as authenticated encryption modes from the CAESAR competition, when instantiated with the AES. The data processed in our benchmarking has sizes representative to that of typical Internet traffic...... linear cryptanalysis. We apply this model to the standardized block cipher PRESENT. Finally, we present very generic attacks on two authenticated encryption schemes, AVALANCHE and RBS, by pointing out severe design flaws that can be leveraged to fully recover the secret key with very low complexity...
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.
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)
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
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 ...
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
Recursive representation of the torus 1-point conformal block
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.
The Free Energy in the Derrida-Retaux Recursive Model
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.
Recursive subspace identification for in flight modal analysis of airplanes
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.
Differential constraints for bounded recursive identification with multivariate splines
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
Predicate Transformers for Recursive Procedures with Local Variables
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
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...
A bijection between phylogenetic trees and plane oriented recursive trees
Prodinger, Helmut
2017-01-01
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.
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...
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....
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...
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
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
Recursivity: A Working Paper on Rhetoric and "Mnesis"
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…
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...
Exploiting fine-grain parallelism in recursive LU factorization
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
Pedestrian Path Prediction with Recursive Bayesian Filters: A Comparative Study
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
Action Recognition in Semi-synthetic Images using Motion Primitives
DEFF Research Database (Denmark)
Fihl, Preben; Holte, Michael Boelstoft; Moeslund, Thomas B.
This technical report describes an action recognition approach based on motion primitives. A few characteristic time instances are found in a sequence containing an action and the action is classified from these instances. The characteristic instances are defined solely on the human motion, hence...... motion primitives. The motion primitives are extracted by double difference images and represented by four features. In each frame the primitive, if any, that best explains the observed data is identified. This leads to a discrete recognition problem since a video sequence will be converted into a string...... containing a sequence of symbols, each representing a primitive. After pruning the string a probabilistic Edit Distance classifier is applied to identify which action best describes the pruned string. The method is evaluated on five one-arm gestures. A test is performed with semi-synthetic input data...
A primitive Late Pliocene cheetah, and evolution of the cheetah lineage
Christiansen, Per; Mazák, Ji H.
2009-01-01
The cheetah lineage is a group of large, slender, and long-limbed cats with a distinctive skull and dental morphology, of which only the extant cheetah (Acinonyx jubatus) is present today. The lineage is characterized by having abbreviated, tall, and domed crania, and a trenchant dentition with a much reduced, posteriorly placed protocone on the upper carnassial. In this article, we report on a new discovery of a Late Pliocene specimen from China with an estimated age of ≈2.2–2.5 million years, making it one of the oldest specimens known to date. A cladistic analysis confirmed that it is the most primitive cheetah known, and it shares a number of unambiguous derived cranial traits with the Acinonyx lineage, but has more primitive dentition than previously known cheetahs, demonstrating that the many unusual skull and dental characters hitherto considered characteristic of cheetahs evolved in a gradual fashion. Isolated teeth of primitive cheetahs may not be recognizable as such, but can be confused with, for instance, those of leopards or other similar-sized pantherine cats or pumas. The age and morphology of the new specimen supports an Old World origin of the cheetah lineage, not a New World one, as has been suggested. We name the new species Acinonyx kurteni in honor of the late Björn Kurtén. PMID:19114651
A primitive Late Pliocene cheetah, and evolution of the cheetah lineage.
Christiansen, Per; Mazák, Ji H
2009-01-13
The cheetah lineage is a group of large, slender, and long-limbed cats with a distinctive skull and dental morphology, of which only the extant cheetah (Acinonyx jubatus) is present today. The lineage is characterized by having abbreviated, tall, and domed crania, and a trenchant dentition with a much reduced, posteriorly placed protocone on the upper carnassial. In this article, we report on a new discovery of a Late Pliocene specimen from China with an estimated age of approximately 2.2-2.5 million years, making it one of the oldest specimens known to date. A cladistic analysis confirmed that it is the most primitive cheetah known, and it shares a number of unambiguous derived cranial traits with the Acinonyx lineage, but has more primitive dentition than previously known cheetahs, demonstrating that the many unusual skull and dental characters hitherto considered characteristic of cheetahs evolved in a gradual fashion. Isolated teeth of primitive cheetahs may not be recognizable as such, but can be confused with, for instance, those of leopards or other similar-sized pantherine cats or pumas. The age and morphology of the new specimen supports an Old World origin of the cheetah lineage, not a New World one, as has been suggested. We name the new species Acinonyx kurteni in honor of the late Björn Kurtén.
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.
spib is required for primitive myeloid development in Xenopus.
Costa, Ricardo M B; Soto, Ximena; Chen, Yaoyao; Zorn, Aaron M; Amaya, Enrique
2008-09-15
Vertebrate blood formation occurs in 2 spatially and temporally distinct waves, so-called primitive and definitive hematopoiesis. Although definitive hematopoiesis has been extensively studied, the development of primitive myeloid blood has received far less attention. In Xenopus, primitive myeloid cells originate in the anterior ventral blood islands, the equivalent of the mammalian yolk sac, and migrate out to colonize the embryo. Using fluorescence time-lapse video microscopy, we recorded the migratory behavior of primitive myeloid cells from their birth. We show that these cells are the first blood cells to differentiate in the embryo and that they are efficiently recruited to embryonic wounds, well before the establishment of a functional vasculature. Furthermore, we isolated spib, an ETS transcription factor, specifically expressed in primitive myeloid precursors. Using spib antisense morpholino knockdown experiments, we show that spib is required for myeloid specification, and, in its absence, primitive myeloid cells retain hemangioblast-like characteristics and fail to migrate. Thus, we conclude that spib sits at the top of the known genetic hierarchy that leads to the specification of primitive myeloid cells in amphibians.
Action Recognition Using Motion Primitives and Probabilistic Edit Distance
DEFF Research Database (Denmark)
Fihl, Preben; Holte, Michael Boelstoft; Moeslund, Thomas B.
2006-01-01
In this paper we describe a recognition approach based on the notion of primitives. As opposed to recognizing actions based on temporal trajectories or temporal volumes, primitive-based recognition is based on representing a temporal sequence containing an action by only a few characteristic time...... into a string containing a sequence of symbols, each representing a primitives. After pruning the string a probabilistic Edit Distance classifier is applied to identify which action best describes the pruned string. The approach is evaluated on five one-arm gestures and the recognition rate is 91...
Algebraic computability and enumeration models recursion theory and descriptive complexity
Nourani, Cyrus F
2016-01-01
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...
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.
Recursive utility in a Markov environment with stochastic growth.
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.
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.
Recursive Neural Networks in Quark/Gluon Tagging
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.
Topological recursion for Gaussian means and cohomological field theories
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.
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)
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.
Recursive Bayesian recurrent neural networks for time-series modeling.
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.
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)
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
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.
Classification and Recursion Operators of Dark Burgers' Equation
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.
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.
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.
Model-based Recursive Partitioning for Subgroup Analyses
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...
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....
Live imaging of primitive endoderm precursors in the mouse blastocyst.
Grabarek, Joanna B; Plusa, Berenika
2012-01-01
The separation of two populations of cells-primitive endoderm and epiblast-within the inner cell mass (ICM) of the mammalian blastocyst is a crucial event during preimplantation development. However, many aspects of this process are still not very well understood. Recently, the identification of platelet derived growth factor receptor alpha (Pdgfrα) as an early-expressed protein that is also a marker of the later primitive endoderm lineage, together with the availability of the Pdgfra(H2B-GFP) mouse strain (Hamilton et al. Mol Cell Biol 23:4013-4025, 2003), has made in vivo imaging of primitive endoderm formation possible. In this chapter we present two different approaches that can be used to follow the behavior of primitive endoderm cells within the mouse blastocyst in real time.
Primitive polynomials selection method for pseudo-random number generator
Anikin, I. V.; Alnajjar, Kh
2018-01-01
In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.
Motion Primitives and Probabilistic Edit Distance for Action Recognition
DEFF Research Database (Denmark)
Fihl, Preben; Holte, Michael Boelstoft; Moeslund, Thomas B.
2009-01-01
the actions as a sequence of temporal isolated instances, denoted primitives. These primitives are each defined by four features extracted from motion images. The primitives are recognized in each frame based on a trained classifier resulting in a sequence of primitives. From this sequence we recognize......The number of potential applications has made automatic recognition of human actions a very active research area. Different approaches have been followed based on trajectories through some state space. In this paper we also model an action as a trajectory through a state space, but we represent...... different temporal actions using a probabilistic Edit Distance method. The method is tested on different actions with and without noise and the results show recognition rates of 88.7% and 85.5%, respectively....
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.
Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion
Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.
2018-06-01
A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2 D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.
Recursive regularization step for high-order lattice Boltzmann methods
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.
Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion
Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.
2017-12-01
A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.
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)
Recursive-operator method in vibration problems for rod systems
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.
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.
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.
Primitive myxoid mesenchymal tumor of infancy in a preterm infant.
Lam, Joseph; Lara-Corrales, Irene; Cammisuli, Salvatore; Somers, Gino R; Pope, Elena
2010-01-01
Primitive myxoid mesenchymal tumor of infancy is a recently recognized entity that has been added to the differential diagnosis of myxoid tumors of the soft tissue. Few cases have been reported of this entity in the literature, but none presenting in a preterm infant. We present the case and clinical course of a preterm boy with a primitive myxoid mesenchymal tumor of infancy that occurred following excision of a congenital juvenile xanthogranuloma. © 2010 Wiley Periodicals, Inc.
Peripheral Primitive Neuroectodermal Tumor of the Stomach: A Case Report
International Nuclear Information System (INIS)
Park, Woon Ju; Cho, June Sik; Shin, Kyung Sook; Jeong, Hyung Yong; Noh; Seung Moo; Song, Kyu Sang
2010-01-01
Peripheral primitive neuroectodermal tumors (peripheral PNETs) are very rare and highly aggressive soft tissue malignancies originating from the neural crest. To the best of our knowledge, only a few cases of peripheral PNETs of the stomach have been reported in the literature. We report a case of large peripheral primitive neuroectodermal tumor of the stomach with MDCT findings in a 22-year-old man presenting epigastric pain and vomiting
Cometary dust: the diversity of primitive refractory grains.
Wooden, D H; Ishii, H A; Zolensky, M E
2017-07-13
Comet dust is primitive and shows significant diversity. Our knowledge of the properties of primitive cometary particles has expanded significantly through microscale investigations of cosmic dust samples (anhydrous interplanetary dust particles (IDPs), chondritic porous (CP) IDPs and UltraCarbonaceous Antarctic micrometeorites, Stardust and Rosetta ), as well as through remote sensing ( Spitzer IR spectroscopy). Comet dust are aggregate particles of materials unequilibrated at submicrometre scales. We discuss the properties and processes experienced by primitive matter in comets. Primitive particles exhibit a diverse range of: structure and typology; distribution of constituents; concentration and form of carbonaceous and refractory organic matter; Mg- and Fe-contents of the silicate minerals; sulfides; existence/abundance of type II chondrule fragments; high-temperature calcium-aluminium inclusions and ameboid-olivine aggregates; and rarely occurring Mg-carbonates and magnetite, whose explanation requires aqueous alteration on parent bodies. The properties of refractory materials imply there were disc processes that resulted in different comets having particular selections of primitive materials. The diversity of primitive particles has implications for the diversity of materials in the protoplanetary disc present at the time and in the region where the comets formed.This article is part of the themed issue 'Cometary science after Rosetta'. © 2017 The Authors.
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
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.
Comet Dust: The Diversity of Primitive Particles and Implications
John Bradley; Zolensky, Michael E.
2016-01-01
Comet dust is primitive and shows significant diversity. Our knowledge of the properties of primitive particles has expanded significantly through microscale investigations of cosmic dust samples (IDPs and AMMs) and of comet dust samples (Stardust and Rosetta's COSIMA), as well as through remote sensing (spectroscopy and imaging) via Spitzer and via spacecraft encounters with 103P/Hartley 2 and 67P/Churyumov-Gerasimenko. Microscale investigations show that comet dust and cosmic dust are particles of unequilibrated materials, including aggregates of materials unequilibrated at submicron scales. We call unequilibrated materials "primitive" and we deduce they were incorporated into ice--rich (H2O-, CO2-, and CO-ice) parent bodies that remained cold, i.e., into comets, because of the lack of aqueous or thermal alteration since particle aggregation; yet some Stardust olivines suggest mild thermal metamorphism. Primitive particles exhibit a diverse range of: structure and typology; size and size distribution of constituents; concentration and form of carbonaceous and organic matter; D-, N-, and O- isotopic enhancements over solar; Mg-, Fe-contentsof thesilicate minerals; the compositions and concentrations of sulfides, and of less abundant mineral species such as chondrules, CAIs and carbonates. The unifomity within a group of samples points to: aerodynamic sorting of particles and/or particle constituents; the inclusion of a limited range of oxygen fugacities; the inclusion or exclusion of chondrules; a selection of organics. The properites of primitive particles imply there were disk processes that resulted in different comets having particular selections of primitive materials. The diversity of primitive particles has implications for the diversity of materials in the protoplanetary disk present at the time and in the region where the comets formed.
Comet Dust: The Diversity of "Primitive" Particles and Implications
Wooden, Diane H.; Ishii, Hope A.; Bradley, John P.; Zolensky, Michael E.
2016-01-01
Comet dust is primitive and shows significant diversity. Our knowledge of the properties of primitive particles has expanded significantly through microscale investigations of cosmic dust samples ( IDP's(Interplanetary Dust Particles) and AMM's (Antarctic Micrometeorites)) and of comet dust samples (Stardust and Rosetta's COSIMA), as well as through remote sensing (spectroscopy and imaging) via Spitzer and via spacecraft encounters with 103P/Hartley 2 and 67P/Churyumov-Gerasimenko. Microscale investigations show that comet dust and cosmic dust are particles of unequilibrated materials, including aggregates of materials unequilibrated at submicron scales. We call unequilibrated materials "primitive" and we deduce they were incorporated into ice-rich (H2O-, CO2-, and CO-ice) parent bodies that remained cold, i.e., into comets, because of the lack of aqueous or thermal alteration since particle aggregation; yet some Stardust olivines suggest mild thermal metamorphism. Primitive particles exhibit a diverse range of: structure and typology; size and size distribution of constituents; concentration and form of carbonaceous and organic matter; D-, N-, and O- isotopic enhancements over solar; Mg-, Fe-contents of the silicate minerals; the compositions and concentrations of sulfides, and of less abundant mineral species such as chondrules, CAIs and carbonates. The uniformity within a group of samples points to: aerodynamic sorting of particles and/or particle constituents; the inclusion of a limited range of oxygen fugacities; the inclusion or exclusion of chondrules; a selection of organics. The properties of primitive particles imply there were disk processes that resulted in different comets having particular selections of primitive materials. The diversity of primitive particles has implications for the diversity of materials in the protoplanetary disk present at the time and in the region where the comets formed.
Eutectic propeties of primitive Earth's magma ocean
Lo Nigro, G.; Andrault, D.; Bolfan-Casanova, N.; Perillat, J.-P.
2009-04-01
It is widely accepted that the early Earth was partially molten (if not completely) due to the high energy dissipated by terrestrial accretion [1]. After core formation, subsequent cooling of the magma ocean has led to fractional crystallization of the primitive mantle. The residual liquid corresponds to what is now called the fertile mantle or pyrolite. Melting relations of silicates have been extensively investigated using the multi-anvil press, for pressures between 3 and 25 GPa [2,3]. Using the quench technique, it has been shown that the pressure affects significantly the solidus and liquidus curves, and most probably the composition of the eutectic liquid. At higher pressures, up to 65 GPa, melting studies were performed on pyrolite starting material using the laser-heated diamond anvil cell (LH-DAC) technique [4]. However, the quench technique is not ideal to define melting criteria, and furthermore these studies were limited in pressure range of investigation. Finally, the use of pyrolite may not be relevant to study the melting eutectic temperature. At the core-mantle boundary conditions, melting temperature is documented by a single data point on (Mg,Fe)2SiO4 olivine, provided by shock wave experiments at around 130-140 GPa [5]. These previous results present large uncertainties of ~1000 K. The aim of this study is to determine the eutectic melting temperature in the chemically simplified system composed of the two major lower mantle phases, the MgSiO3 perovskite and MgO periclase. We investigated melting in-situ using the laser-heated diamond anvil cell coupled with angle dispersive X-ray diffraction at the ID27 beamline of the ESRF [6]. Melting relations were investigated in an extended P-T range comparable to those found in the Earth's lower mantle, i.e. from 25 to 120 GPa and up to more than 5000 K. Melting was evidenced from (a) disappearance of one of the two phases in the diffraction pattern, (b) drastic changes of the diffraction image itself, and
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)
The first trimester human placenta is a site for terminal maturation of primitive erythroid cells
Van Handel, Ben; Prashad, Sacha L.; Hassanzadeh-Kiabi, Nargess; Huang, Andy; Magnusson, Mattias; Atanassova, Boriana; Chen, Angela; Hamalainen, Eija I.; Mikkola, Hanna K. A.
2010-01-01
Embryonic hematopoiesis starts via the generation of primitive red blood cells (RBCs) that satisfy the embryo's immediate oxygen needs. Although primitive RBCs were thought to retain their nuclei, recent studies have shown that primitive RBCs in mice enucleate in the fetal liver. It has been unknown whether human primitive RBCs enucleate, and what hematopoietic site might support this process. Our data indicate that the terminal maturation and enucleation of human primitive RBCs occurs in fir...
Globfit: Consistently fitting primitives by discovering global relations
Li, Yangyan; Wu, Xiaokun; Chrysathou, Yiorgos; Sharf, Andrei Sharf; Cohen-Or, Daniel; Mitra, Niloy J.
2011-01-01
Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available. © 2011 ACM.
Globfit: Consistently fitting primitives by discovering global relations
Li, Yangyan
2011-07-01
Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available. © 2011 ACM.
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....
Chain of matrices, loop equations and topological recursion
Orantin, Nicolas
2009-01-01
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.
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)
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.
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
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...
Nucleation and condensation in the primitive solar nebula
International Nuclear Information System (INIS)
Cameron, A.G.W.; Fegley, M.B.
1982-01-01
It is pointed out that the primitive solar nebula may be modeled using the frictionally induced transport theory of Lynden-Bell and Pringle (1974) if the principal frictional mechanism within the nebula is turbulent viscosity. The present investigation is concerned with the construction of a model of a section of the primitive solar nebula as a basis for the study of nucleation and condensation processes within this section. The construction involves a relatively simple application of the Lynden-Bell and Pringle theory subject to steady mass flow conditions. The calculations which are conducted in connection with the investigation indicate that by the time the gas in the primitive solar nebula has become sufficiently supercooled to nucleate condensation centers, several different compounds, including the magnesium silicates forsterite and enstatite (MgSiO 3 ), will probably be able to condense on the growing condensation center
Primitive neuroectodermal tumor of the cervix: a case report
Directory of Open Access Journals (Sweden)
Boroujeni Parisa
2011-09-01
Full Text Available Abstract Introduction Peripheral primitive neuroectodermal tumor of the cervix uteri is extremely rare. Between 1987 and 2010, there were only nine cases reported in the English literature, with considerably different management policies. Case presentation A 45-year-old Iranian woman presented to our facility with a primitive neuroectodermal tumor of the cervix uteri. Her clinical stage IB2 tumor was treated successfully with chemotherapy. Our patient underwent radical hysterectomy. There was no trace of the tumor after four years of follow-up. Conclusions According to current knowledge, primitive neuroectodermal tumors belong to the Ewing's sarcoma family, and the improvement of treatment outcome in our patient was due to dose-intensive neoadjuvant chemotherapy, surgery and consolidation chemotherapy in accordance with the protocol for bony Ewing's sarcoma.
Context of culture: Critique of the primitive mind
Directory of Open Access Journals (Sweden)
Božilović Nikola
2010-01-01
Full Text Available The author of this paper has the intention to reach the new meaning and sense of the primitive mentality by analyzing it in early social communities. He also wants to point out the possible reflections of the spirit and consciousness of our ancestors on us, here and now. The first part of the paper is dedicated to a critical deliberation on anthropological conflicts which have arisen concerning the reasoning power of the so-called primitives. The crucial question lies in the following: Is the difference between the “primitive” and the “civilized” mentality fundamental or is it possible only to a certain degree. The author takes the notion of primitive mentality through time and points to the medieval understandings, which are occupied by teratological themes, then to the renaissance comprehension, which relies on the first experiential observations, and, finally, to the enlightenment ideas of exotic peoples out of which the myth of “the good savage” is born. The nineteenth and twentieth centuries introduce the notions of “people’s character” and “national spirit”. The opinions are polarized, on the one hand of ethnocentrism, carried by the prejudice of people and ethnic groups and, on the other hand, of cultural relativism, based on the understanding and appreciation of cultural differences. In the end, the author also recognizes the modern primitive man, one who is not ready to deal with the challenges of his age. The modern primitive recalls the spirits of the past, the surviving and anachronic models of behavior, unaware of the fact that these are the same models that he has ascribed to “savages”. However, while such thinking and acting was justified by the cultural level at which our ancestors had lived, the mental frame of the contemporary primitives is significantly in contrast with the high level of civilization development.
A new Bayesian recursive technique for parameter estimation
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.
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.
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.
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.
Exploiting fine-grain parallelism in recursive LU factorization
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.
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.
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...
The Paradigm Recursion: Is It More Accessible When Introduced in Middle School?
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…
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 (...
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
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…
The Syntax of Time and Space Primitives in French.
Peeters, Bert
1997-01-01
Explores the combinatorial possibilities of semantic primitives of time and space in French, as defined in the theory of Natural Semantic Metalanguage. Highlights the need for new ways to express the allolexical relationship in some combinations, particularly those expressing "when/time." (Author/MSE)
Primitive neuroectodermal tumour of the kidney: radiologic-pathological correlations.
Chea, Y W; Agrawal, Rashi; Poh, Angeline C C
2008-06-01
A primitive neuroectodermal tumour of the kidney is a rare malignancy. We report the computed tomographic features and the histopathological correlation of such a tumour occurring in a middle-aged man. Although the radiological appearance has significant overlap with other renal tumours, this tumour should be included in the differential diagnosis of a large renal mass in younger patients.
Letters of Gold: Enabling Primitive Accumulation through Neoliberal Conservation
B.E. Büscher (Bram)
2009-01-01
textabstractAbstract: In Capital I, Marx wrote that the history of the separation of the producers from the means of production “is written in the annals of mankind in letters of blood and fire” (Marx, 1976: 875). This ‘so-called primitive accumulation’, or ‘accumulation by dispossession’ in David
Addressing Nature Deficit Disorder through Primitive Camping Experiences
Allen, Kevin; Varner, Keegan; Sallee, Jeff
2011-01-01
Today's youth suffer from Nature Deficit Disorder, a condition that has been connected to ADHD, shortage of creativity, and general lack of knowledge about the outdoors. A team of educators and specialists are addressing this issue with primitive camping. County educators were trained using experiential learning and train-the-trainer techniques.…
Understanding and determining the variability of the primitive stress environment.
CSIR Research Space (South Africa)
Sellers, EJ
2002-10-01
Full Text Available The primitive stress state is an important input into the design of underground excavations. However, it is well known that the stress state varies considerably from place to place. The aim of this project was to determine the main causes...
COMPARATIVE STUDY OF RTOS AND PRIMITIVE INTERRUPT IN EMBEDDED SYSTEM
Directory of Open Access Journals (Sweden)
Dwi Purnomo
2015-03-01
Full Text Available Multitasking is one of the most challenging issues in the automation industry which is highly depended on the embedded system. There are two methods to perform multitasking in embedded system: RTOS and primitive interrupt. The main purpose of this research is to compare the performance of RÂ¬TOS with primitive method while concurrently undertaking multiple tasks. The system, which is able to perform various tasks, has been built to evaluate the performance of both methods. There are four tasks introduced in the system: servo task, sensor task, LED task, and LCD task. The performance of each method is indicated by the success rate of the sensor task detection. Sensor task detection will be compared with the true value which is calculated and measured manually during observation time. Observation time was varied after several iterations and the data of the iteration are recorded for both RTOS and primitive interrupt methods. The results of the conducted experiments have shown that, RTOS is more accurate than interrupt method. However, the data variance of the primitive interrupt method is narrower than RTOS. Therefore, to choose a better method, an optimization is needed to be done and each product has its own standard.
A Test of Durkheim's Theory of Suicide in Primitive Societies.
Lester, David
1992-01-01
Classified primitive societies as high, moderate, or low on independent measures of social integration and social regulation to test Durkheim's theory of suicide. Estimated frequency of suicide did not differ between those societies predicted to have high, moderate, and low suicide rates. Durkheim's theory was not confirmed. (Author/NB)
Primary extraskeletal Ewing's sarcoma/primitive neuroectodermal tumor of breast
Directory of Open Access Journals (Sweden)
Smita Srivastava
2016-01-01
Full Text Available Extraskeletal Ewing's sarcoma (EES is a rare soft tissue tumor that is morphologically indistinguishable from skeletal ES. We report a case of a 25-year-old female with recurrent EES/primitive neuroectodermal tumor of right breast with imaging findings on mammogram, ultrasound, magnetic resonance imaging breast, and positron emission tomography–computed tomography.
Cancer of unknown primitive metastatic. About two clinical cases
International Nuclear Information System (INIS)
Cawen, L; Cordoba, A.
2010-01-01
This work is about the two clinical cases about the unknown primitive metastatic cancer. The main techniques used for the diagnosis, treatment and monitoring of different s carcinomas are: Electronic microscope, molecular biology and genetics, especially histopathological study, topographic survey, ultrasound, radiography, chemotherapy, radiotherapy
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.
Geometrical interpretation of the topological recursion, and integrable string theories
Eynard, Bertrand
2009-01-01
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative geometry like maps, partitions, Hurwitz numbers, intersection numbers, Gromov-Witten invariants... The problem is thus to understand what they count, or in other words, given a spectral curve, construct an enumerative geometry problem. This is what we do in a semi-heuristic approach in this article. Starting from a spectral curve, i.e. an integrable system, we use its flat connection and flat coordinates, to define a family of worldsheets, whose enumeration is indeed solved by the topological recursion and symplectic invariants. In other words, for any spectral curve, we construct a corresponding string theory, whose target space is a submanifold of the Jacobian.
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.
Applying recursive numerical integration techniques for solving high dimensional integrals
International Nuclear Information System (INIS)
Ammon, Andreas; Genz, Alan; Hartung, Tobias; Jansen, Karl; Volmer, Julia; Leoevey, Hernan
2016-11-01
The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.
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.
Stochastic Recursive Algorithms for Optimization Simultaneous Perturbation Methods
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
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.
Applying recursive numerical integration techniques for solving high dimensional integrals
Energy Technology Data Exchange (ETDEWEB)
Ammon, Andreas [IVU Traffic Technologies AG, Berlin (Germany); Genz, Alan [Washington State Univ., Pullman, WA (United States). Dept. of Mathematics; Hartung, Tobias [King' s College, London (United Kingdom). Dept. of Mathematics; Jansen, Karl; Volmer, Julia [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Leoevey, Hernan [Humboldt Univ. Berlin (Germany). Inst. fuer Mathematik
2016-11-15
The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.
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.
Binary recursive partitioning: background, methods, and application to psychology.
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.
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...
Tracking of nuclear reactor parameters via recursive non linear estimation
International Nuclear Information System (INIS)
Pages Fita, J.; Alengrin, G.; Aguilar Martin, J.; Zwingelstein, M.
1975-01-01
The usefulness of nonlinear estimation in the supervision of nuclear reactors, as well for reactivity determination as for on-line modelisation in order to detect eventual and unwanted changes in working operation is illustrated. It is dealt with the reactivity estimation using an a priori dynamical model under the hypothesis of one group of delayed neutrons (measurements were done with an ionisation chamber). The determination of the reactivity using such measurements appears as a nonlinear estimation procedure derived from a particular form of nonlinear filter. Observed inputs being demand of power and inside temperature, and output being the reactivity balance, a recursive algorithm is derived for the estimation of the parameters that define the actual behavior of the reactor. Example of treatment of real data is given [fr
Primitive neuroectodermal tumor of the orbit in a 5-year-old girl with microphthalmia
DEFF Research Database (Denmark)
Alyahya, Ghassan Ayish Jabur; Heegaard, Steffen; Fledelius, Hans C.
2000-01-01
ophthalmology, primitive neuroectodermal tumor (PNET), Ewing's sarcoma, small round-cell tumors, retinoblastoma, medulloepithelioma, microphthalmia, orbitotomy......ophthalmology, primitive neuroectodermal tumor (PNET), Ewing's sarcoma, small round-cell tumors, retinoblastoma, medulloepithelioma, microphthalmia, orbitotomy...
Directory of Open Access Journals (Sweden)
Zhiqiang Zheng
Full Text Available BACKGROUND: Embryonic stem (ES cells hold considerable promise as a source of cells with therapeutic potential, including cells that can be used for drug screening and in cell replacement therapies. Differentiation of ES cells into the somatic lineages is a regulated process; before the promise of these cells can be realised robust and rational methods for directing differentiation into normal, functional and safe cells need to be developed. Previous in vivo studies have implicated fibroblast growth factor (FGF signalling in lineage specification from pluripotent cells. Although FGF signalling has been suggested as essential for specification of mesoderm and endoderm in vivo and in culture, the exact role of this pathway remains unclear. METHODOLOGY/PRINCIPAL FINDINGS: Using a culture model based on early primitive ectoderm-like (EPL cells we have investigated the role of FGF signalling in the specification of mesoderm. We were unable to demonstrate any mesoderm inductive capability associated with FGF1, 4 or 8 signalling, even when the factors were present at high concentrations, nor any enhancement in mesoderm formation induced by exogenous BMP4. Furthermore, there was no evidence of alteration of mesoderm sub-type formed with addition of FGF1, 4 or 8. Inhibition of endogenous FGF signalling, however, prevented mesoderm and favoured neural differentiation, suggesting FGF signalling was required but not sufficient for the differentiation of primitive ectoderm into primitive streak-like intermediates. The maintenance of ES cell/early epiblast pluripotent marker expression was also observed in cultures when FGF signalling was inhibited. CONCLUSIONS/SIGNIFICANCE: FGF signalling has been shown to be required for the differentiation of primitive ectoderm to neurectoderm. This, coupled with our observations, suggest FGF signalling is required for differentiation of the primitive ectoderm into the germ lineages at gastrulation.
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
Indoor objects and outdoor urban scenes recognition by 3D visual primitives
DEFF Research Database (Denmark)
Fu, Junsheng; Kämäräinen, Joni-Kristian; Buch, Anders Glent
2014-01-01
, we propose an alternative appearance-driven approach which rst extracts 2D primitives justi ed by Marr's primal sketch, which are \\accumulated" over multiple views and the most stable ones are \\promoted" to 3D visual primitives. The 3D promoted primitives represent both structure and appearance...
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
High water content in primitive continental flood basalts.
Xia, Qun-Ke; Bi, Yao; Li, Pei; Tian, Wei; Wei, Xun; Chen, Han-Lin
2016-05-04
As the main constituent of large igneous provinces, the generation of continental flood basalts (CFB) that are characterized by huge eruption volume (>10(5) km(3)) within short time span (primitive CFB in the early Permian Tarim large igneous province (NW China), using the H2O content of ten early-formed clinopyroxene (cpx) crystals that recorded the composition of the primitive Tarim basaltic melts and the partition coefficient of H2O between cpx and basaltic melt. The arc-like H2O content (4.82 ± 1.00 wt.%) provides the first clear evidence that H2O plays an important role in the generation of CFB.
Primitive Path Analysis and Stress Distribution in Highly Strained Macromolecules.
Hsu, Hsiao-Ping; Kremer, Kurt
2018-01-16
Polymer material properties are strongly affected by entanglement effects. For long polymer chains and composite materials, they are expected to be at the origin of many technically important phenomena, such as shear thinning or the Mullins effect, which microscopically can be related to topological constraints between chains. Starting from fully equilibrated highly entangled polymer melts, we investigate the effect of isochoric elongation on the entanglement structure and force distribution of such systems. Theoretically, the related viscoelastic response usually is discussed in terms of the tube model. We relate stress relaxation in the linear and nonlinear viscoelastic regimes to a primitive path analysis (PPA) and show that tension forces both along the original paths and along primitive paths, that is, the backbone of the tube, in the stretching direction correspond to each other. Unlike homogeneous relaxation along the chain contour, the PPA reveals a so far not observed long-lived clustering of topological constraints along the chains in the deformed state.
Formalizing the Relationship Between Commitment and Basic Cryptographic Primitives
Directory of Open Access Journals (Sweden)
S. Sree Vivek
2016-11-01
Full Text Available Signcryption is a cryptographic primitive which offers the functionality of both digital signature and encryption with lower combined computational cost. On the other hand, commitment scheme allows an entity to commit to a value, where the entity reveals the committed value later during a decommit phase. In this paper, we explore the connection between commitment schemes, public key encryption, digital signatures and signcryption. We establish formal relationship between commitment and the other primitives. Our main result is that we show signcryption can be used as a commitment scheme with appropriate security notions. We show that if the underlying signcryption scheme is IND-CCA2 secure, then the hiding property of the commitment scheme is satisfied. Similarly, we show that if the underlying signcryption scheme is unforgeable, then the relaxed biding property of the commitment scheme is satisfied. Moreover, we prove that if the underlying signcryption scheme is NM-CCA2, then the commitment scheme is non-malleable.
Search for Primitive Matter in the Solar System
Libourel, G.; Michel, P.; Delbo, M.; Ganino, C.; Recio-Blanco, A.; de Laverny, P.; Zolensky, M. E.; Krot, A. N.
2017-01-01
Recent astronomical observations and theoretical modeling led to a consensus regarding the global scenario of the formation of young stellar objects (YSO) from a cold molecular cloud of interstellar dust (organics and minerals) and gas that, in some cases, leads to the formation of a planetary system. In the case of our Solar System, which has already evolved for approximately 4567 Ma, the quest is to access, through the investigation of planets, moons, cometary and asteroidal bodies, meteorites, micrometeorites, and interplanetary dust particles, the primitive material that contains the key information about the early Solar System processes and its evolution. However, laboratory analyses of extraterrestrial samples, astronomical observations and dynamical models of the Solar System evolution have not brought yet any conclusive evidence on the nature and location of primitive matter in the Solar System, preventing a clear understanding of its early stages.
Morphological Study of Insoluble Organic Matter Residues from Primitive
Changela, H. G.; Stroud, R. M.; Peeters, Z.; Nittler, L. R.; Alexander, C. M. O'D.; DeGregorio, B. T.; Cody, G. D.
2012-01-01
Insoluble organic matter (IOM) constitutes a major proportion, 70-99%, of the total organic carbon found in primitive chondrites [1, 2]. One characteristic morphological component of IOM is nanoglobules [3, 4]. Some nanoglobules exhibit large N-15 and D enrichments relative to solar values, indicating that they likely originated in the ISM or the outskirts of the protoplanetary disk [3]. A recent study of samples from the Tagish Lake meteorite with varying levels of hydrothermal alteration suggest that nanoglobule abundance decreases with increasing hydrothermal alteration [5]. The aim of this study is to further document the morphologies of IOM from a range of primitive chondrites in order to determine any correlation of morphology with petrographic grade and chondrite class that could constrain the formation and/or alteration mechanisms.
Primary intraspinal extradural primitive neuroectodermal tumor: A rare case.
Rege, Shrikant V; Tadghare, Jitendra; Patil, Harshad; Narayan, Sharadendu
2016-01-01
Primitive neuroectodermal tumors (PNETs) are aggressive childhood malignancies and are difficult to treat. Primary intraspinal PNETs are rare. These patients have poor prognosis with short survival time even after surgery and chemoradiation. As there are no standard guidelines exist for the management of these tumors, a multidisciplinary approach has been employed with varying success. According to the review of literature, only few cases of primary intraspinal extradural PNETs have been reported. Herein, author has described a case of intraspinal, extradural PNET.
Transitions between discrete and rhythmic primitives in a unimanual task
Sternad, Dagmar; Marino, Hamal; Charles, Steven K.; Duarte, Marcos; Dipietro, Laura; Hogan, Neville
2013-01-01
Given the vast complexity of human actions and interactions with objects, we proposed that control of sensorimotor behavior may utilize dynamic primitives. However, greater computational simplicity may come at the cost of reduced versatility. Evidence for primitives may be garnered by revealing such limitations. This study tested subjects performing a sequence of progressively faster discrete movements in order to “stress” the system. We hypothesized that the increasing pace would elicit a transition to rhythmic movements, assumed to be computationally and neurally more efficient. Abrupt transitions between the two types of movements would support the hypothesis that rhythmic and discrete movements are distinct primitives. Ten subjects performed planar point-to-point arm movements paced by a metronome: starting at 2 s, the metronome intervals decreased by 36 ms per cycle to 200 ms, stayed at 200 ms for several cycles, then increased by similar increments. Instructions emphasized to insert explicit stops between each movement with a duration that equaled the movement time. The experiment was performed with eyes open and closed, and with short and long metronome sounds, the latter explicitly specifying the dwell duration. Results showed that subjects matched instructed movement times but did not preserve the dwell times. Rather, they progressively reduced dwell time to zero, transitioning to continuous rhythmic movements before movement times reached their minimum. The acceleration profiles showed an abrupt change between discrete and rhythmic profiles. The loss of dwell time occurred earlier with long auditory specification, when subjects also showed evidence of predictive control. While evidence for hysteresis was weak, taken together, the results clearly indicated a transition between discrete and rhythmic movements, supporting the proposal that representation is based on primitives rather than on veridical internal models. PMID:23888139
Transitions between Discrete and Rhythmic Primitives in a Unimanual Task
Directory of Open Access Journals (Sweden)
Dagmar eSternad
2013-07-01
Full Text Available Given the vast complexity of human actions and interactions with objects, we proposed that control of sensorimotor behavior may utilize dynamic primitives. However, greater computational simplicity may come at the cost of reduced versatility. Evidence for primitives may be garnered by revealing such limitations. This study tested subjects performing a sequence of progressively faster discrete movements, in order to stress the system. We hypothesized that the increasing pace would elicit a transition to rhythmic movements, assumed to be computationally and neurally more efficient. Abrupt transitions between the two types of movements would support the hypothesis that rhythmic and discrete movements are distinct primitives. Ten subjects performed planar point-to-point arm movements paced by a metronome: Starting at 2s the metronome intervals decreased by 36ms per cycle to 200ms, stayed at 200ms for several cycles, then increased by similar increments. Instructions emphasized to insert explicit stops between each movement with a duration that equaled the movement time. The experiment was performed with eyes open and closed, and with short and long metronome sounds, the latter explicitly specifying the dwell duration. Results showed that subjects matched instructed movement times but did not preserve the dwell times. Rather, they progressively reduced dwell time to zero, transitioning to continuous rhythmic movements before movement times reached their minimum. The acceleration profiles showed an abrupt change between discrete and rhythmic profiles. The loss of dwell time occurred earlier with long auditory specification, when subjects also showed evidence of predictive control. While evidence for hysteresis was weak, taken together, the results clearly indicated a transition between discrete and rhythmic movements, supporting the proposal that representation is based on primitives rather than on veridical internal models.
Post-Quantum Cryptography: Riemann Primitives and Chrysalis
Malloy, Ian; Hollenbeck, Dennis
2018-01-01
The Chrysalis project is a proposed method for post-quantum cryptography using the Riemann sphere. To this end, Riemann primitives are introduced in addition to a novel implementation of this new method. Chrysalis itself is the first cryptographic scheme to rely on Holomorphic Learning with Errors, which is a complex form of Learning with Errors relying on the Gauss Circle Problem within the Riemann sphere. The principle security reduction proposed by this novel cryptographic scheme applies c...
Polycomb enables primitive endoderm lineage priming in embryonic stem cells
DEFF Research Database (Denmark)
Illingworth, Robert S; Hölzenspies, Jurriaan J; Roske, Fabian V
2016-01-01
Mouse embryonic stem cells (ESCs), like the blastocyst from which they are derived, contain precursors of the epiblast (Epi) and primitive endoderm (PrEn) lineages. While transient in vivo, these precursor populations readily interconvert in vitro. We show that altered transcription is the driver...... polycomb with dynamic changes in transcription and stalled lineage commitment, allowing cells to explore alternative choices prior to a definitive decision....
Primary extraskeletal Ewing's sarcoma/primitive neuroectodermal tumour of breast
Ikhwan, S M; Kenneth, V K T; Seoparjoo, A; Zin, A A M
2013-01-01
Primary primitive neuroectodermal tumour (PNET) and extraskeletal Ewing's sarcoma belongs to the Ewing's family of tumours. Primary tumours arising from breast are very rare. There are only a few case reports published on primary extraskeletal Ewing's sarcoma and PNET arising from breast. We present an extremely rare case of an inoperable primary Ewing's sarcoma arising from left breast with contralateral breast, lymphatic and lung metastasis.
Primary extraskeletal Ewing's sarcoma/primitive neuroectodermal tumour of breast.
Ikhwan, S M; Kenneth, V K T; Seoparjoo, A; Zin, A A M
2013-06-21
Primary primitive neuroectodermal tumour (PNET) and extraskeletal Ewing's sarcoma belongs to the Ewing's family of tumours. Primary tumours arising from breast are very rare. There are only a few case reports published on primary extraskeletal Ewing's sarcoma and PNET arising from breast. We present an extremely rare case of an inoperable primary Ewing's sarcoma arising from left breast with contralateral breast, lymphatic and lung metastasis.
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
Directory of Open Access Journals (Sweden)
A. Beletsky
2014-04-01
Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.
On the Reduced Testing of a Primitive Element in ${\\\\mathbb Z}_n^\\\\times$
Suzuki, Hideo; スズキ, ヒデオ; Hideo, Suzuki
2015-01-01
The primitive roots in ${\\mathbb Z}_n^\\times$ are defined and exist iff $n = 2, 4, p^{\\alpha}, 2p^{\\alpha}$. Knuth gave the definition of the primitive roots in ${\\mathbb Z}_{p^\\alpha}^\\times$, and showed the necessary and sufficient condition for testing a primitive root in ${\\mathbb Z}_{p^\\alpha}^\\times$. In this paper we define the primitive elements in ${\\mathbb Z}_n^\\times$, which is a generalization of primitive roots, as elements that take the maximum multiplicative order.And we give t...
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.
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
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.
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.
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
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
Implicit learning of recursive context-free grammars.
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.
Recursive recovery of Markov transition probabilities from boundary value data
Energy Technology Data Exchange (ETDEWEB)
Patch, Sarah Kathyrn [Univ. of California, Berkeley, CA (United States)
1994-04-01
In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 x 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 x 2 x 2 problem, is solved.
Decision-Directed Recursive Least Squares MIMO Channels Tracking
Directory of Open Access Journals (Sweden)
Karami Ebrahim
2006-01-01
Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.
Implicit Learning of Recursive Context-Free Grammars
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
Guided wave tomography in anisotropic media using recursive extrapolation operators
Volker, Arno
2018-04-01
Guided wave tomography is an advanced technology for quantitative wall thickness mapping to image wall loss due to corrosion or erosion. An inversion approach is used to match the measured phase (time) at a specific frequency to a model. The accuracy of the model determines the sizing accuracy. Particularly for seam welded pipes there is a measurable amount of anisotropy. Moreover, for small defects a ray-tracing based modelling approach is no longer accurate. Both issues are solved by applying a recursive wave field extrapolation operator assuming vertical transverse anisotropy. The inversion scheme is extended by not only estimating the wall loss profile but also the anisotropy, local material changes and transducer ring alignment errors. This makes the approach more robust. The approach will be demonstrated experimentally on different defect sizes, and a comparison will be made between this new approach and an isotropic ray-tracing approach. An example is given in Fig. 1 for a 75 mm wide, 5 mm deep defect. The wave field extrapolation based tomography clearly provides superior results.
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.
Model-Based Recursive Partitioning for Subgroup Analyses.
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.
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
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.)
Chiodo formulas for the r-th roots and topological recursion
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...
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....
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 .....
Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind
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
Deducing trapdoor primitives in public key encryption schemes
Pandey, Chandra
2005-03-01
Semantic security of public key encryption schemes is often interchangeable with the art of building trapdoors. In the frame of reference of Random Oracle methodology, the "Key Privacy" and "Anonymity" has often been discussed. However to a certain degree the security of most public key encryption schemes is required to be analyzed with formal proofs using one-way functions. This paper evaluates the design of El Gamal and RSA based schemes and attempts to parallelize the trapdoor primitives used in the computation of the cipher text, thereby magnifying the decryption error δp in the above schemes.
Thoracoabdominal peripheral primitive neuroectodermal tumors in childhood: radiological features
International Nuclear Information System (INIS)
Schulman, H.; Laufer, L.; Newman-Heinman, N.; Kurtzbart, E.; Maor, E.; Zirkin, H.
2000-01-01
Peripheral primitive neuroectodermal tumors (PNET) are extremely uncommon, malignant neoplasms affecting mostly children and young adults. We retrospectively reviewed the clinical data and radiological studies of four such cases. All cases were pathologically proven. Plain films, US, and CT scans were used. The youngest child had a huge pelvic tumor and two adolescents each had a chest wall (Askin) tumor. The fourth patient had a most unusual location of the PNET in the anterior mediastinum. The CT findings are emphasized. We emphasize that the markedly abnormal CT findings are not specific for PNET. (orig.)
Characterizing Digital Light Processing (DLP) 3D Printed Primitives
DEFF Research Database (Denmark)
Tyge, Emil; Pallisgaard, Jens J.; Lillethorup, Morten
2015-01-01
The resolution and repeatability of 3D printing processes depends on a number of factors including the software, hardware, and material used. When printing parts with features that are near or below the nominal printing resolution, it is important to understand how the printer works. For example......, what is the smallest unit shape that can be produced? And what is the reproducibility of that process? This paper presents a method for automatically detecting and characterizing the height, width, and length of micro scale geometric primitives produced via a digital light processing (DLP) 3D printing...
Dust formation in a galaxy with primitive abundances.
Sloan, G C; Matsuura, M; Zijlstra, A A; Lagadec, E; Groenewegen, M A T; Wood, P R; Szyszka, C; Bernard-Salas, J; van Loon, J Th
2009-01-16
Interstellar dust plays a crucial role in the evolution of galaxies. It governs the chemistry and physics of the interstellar medium. In the local universe, dust forms primarily in the ejecta from stars, but its composition and origin in galaxies at very early times remain controversial. We report observational evidence of dust forming around a carbon star in a nearby galaxy with a low abundance of heavy elements, 25 times lower than the solar abundance. The production of dust by a carbon star in a galaxy with such primitive abundances raises the possibility that carbon stars contributed carbonaceous dust in the early universe.
CAD-based Monte Carlo automatic modeling method based on primitive solid
International Nuclear Information System (INIS)
Wang, Dong; Song, Jing; Yu, Shengpeng; Long, Pengcheng; Wang, Yongliang
2016-01-01
Highlights: • We develop a method which bi-convert between CAD model and primitive solid. • This method was improved from convert method between CAD model and half space. • This method was test by ITER model and validated the correctness and efficiency. • This method was integrated in SuperMC which could model for SuperMC and Geant4. - Abstract: Monte Carlo method has been widely used in nuclear design and analysis, where geometries are described with primitive solids. However, it is time consuming and error prone to describe a primitive solid geometry, especially for a complicated model. To reuse the abundant existed CAD models and conveniently model with CAD modeling tools, an automatic modeling method for accurate prompt modeling between CAD model and primitive solid is needed. An automatic modeling method for Monte Carlo geometry described by primitive solid was developed which could bi-convert between CAD model and Monte Carlo geometry represented by primitive solids. While converting from CAD model to primitive solid model, the CAD model was decomposed into several convex solid sets, and then corresponding primitive solids were generated and exported. While converting from primitive solid model to the CAD model, the basic primitive solids were created and related operation was done. This method was integrated in the SuperMC and was benchmarked with ITER benchmark model. The correctness and efficiency of this method were demonstrated.
Stochastic Ocean Predictions with Dynamically-Orthogonal Primitive Equations
Subramani, D. N.; Haley, P., Jr.; Lermusiaux, P. F. J.
2017-12-01
The coastal ocean is a prime example of multiscale nonlinear fluid dynamics. Ocean fields in such regions are complex and intermittent with unstationary heterogeneous statistics. Due to the limited measurements, there are multiple sources of uncertainties, including the initial conditions, boundary conditions, forcing, parameters, and even the model parameterizations and equations themselves. For efficient and rigorous quantification and prediction of these uncertainities, the stochastic Dynamically Orthogonal (DO) PDEs for a primitive equation ocean modeling system with a nonlinear free-surface are derived and numerical schemes for their space-time integration are obtained. Detailed numerical studies with idealized-to-realistic regional ocean dynamics are completed. These include consistency checks for the numerical schemes and comparisons with ensemble realizations. As an illustrative example, we simulate the 4-d multiscale uncertainty in the Middle Atlantic/New York Bight region during the months of Jan to Mar 2017. To provide intitial conditions for the uncertainty subspace, uncertainties in the region were objectively analyzed using historical data. The DO primitive equations were subsequently integrated in space and time. The probability distribution function (pdf) of the ocean fields is compared to in-situ, remote sensing, and opportunity data collected during the coincident POSYDON experiment. Results show that our probabilistic predictions had skill and are 3- to 4- orders of magnitude faster than classic ensemble schemes.
CT and MR findings of primitive neuroectodermal tumor
International Nuclear Information System (INIS)
Kook, Shin Ho; Kim, In One; Chang, Kee Hyun; Han, Moon Hee; Cho, Byung Kyu
1991-01-01
Cerebral primitive neuroectodermal tumor (PNET), consisting of undifferentiated primitive cells, is a neoplasm of children and young adults that occurs predominantly in the supratentorial compartment. In this report, we retrospectively reviewed and analyzed 18 CT and 6 MR findings in 18 patients with pathologically-proven PNET to discover the characteristic findings, if may. The most characteristic feature of the PNETs was a well-defined multilobular oval or round large mass with components of peripheral cystic change or calcification in the cerebral hemisphere, especially in the parietal lobe. Usually there was only minimal surrounding edema. The CT density of the tumor was iso - or slightly high density with homogeneous contrast enhancement in the solid portion and low density in the cystic area. MR findings demonstrated iso - signal intensity on both T1 - weighted (T1WI) and T2-weighted (T2WI) images and dense enhancement in the solid element. The cystic portion revealed low intensity on T1WI and high intensity on T2WI
Effects of primitive photosynthesis on Earth's early climate system
Ozaki, Kazumi; Tajika, Eiichi; Hong, Peng K.; Nakagawa, Yusuke; Reinhard, Christopher T.
2018-01-01
The evolution of different forms of photosynthetic life has profoundly altered the activity level of the biosphere, radically reshaping the composition of Earth's oceans and atmosphere over time. However, the mechanistic impacts of a primitive photosynthetic biosphere on Earth's early atmospheric chemistry and climate are poorly understood. Here, we use a global redox balance model to explore the biogeochemical and climatological effects of different forms of primitive photosynthesis. We find that a hybrid ecosystem of H2-based and Fe2+-based anoxygenic photoautotrophs—organisms that perform photosynthesis without producing oxygen—gives rise to a strong nonlinear amplification of Earth's methane (CH4) cycle, and would thus have represented a critical component of Earth's early climate system before the advent of oxygenic photosynthesis. Using a Monte Carlo approach, we find that a hybrid photosynthetic biosphere widens the range of geochemical conditions that allow for warm climate states well beyond either of these metabolic processes acting in isolation. Our results imply that the Earth's early climate was governed by a novel and poorly explored set of regulatory feedbacks linking the anoxic biosphere and the coupled H, C and Fe cycles. We suggest that similar processes should be considered when assessing the potential for sustained habitability on Earth-like planets with reducing atmospheres.
Medulloblastomas - primitive neuroectodermal tumours in the adult population
International Nuclear Information System (INIS)
Smee, R.I.; Williams, J.R.
2008-01-01
Medulloblastomas - primitive neuroectodermal tumours are rare in adults. This review will evaluate a single centre's experience with this malignancy. The medulloblastoma - primitive neuroectodermal tumour database was evaluated for all patients aged more than 18 years who were referred for management. Relevant information from the database was abstracted to provide a descriptive record of this malignancy. Between 1977-2004 there were 11 patients referred, 1 with persistent disease and 10 were eligible, presenting with initial diagnosis. There was increased intracranial pressure in 50% of patients. Most patients had symptoms >3 months, with three having symptoms 1-3 months before diagnosis and one patient having thoracic dural metastases at presentation. Complete resection was recorded in four patients and six had 50-90% resection. All patients completed craniospinal radiotherapy (35-36 Gy at 1.8-2.0 Gy fractions) barring one patient, who died of surgical complications during his radiotherapy. Chemotherapy was given in five of the nine patients postradiotherapy. There were two posterior fossa recurrences, with associated supratentorial and extra central nervous system disease. Of the 10 primary patients 7 are alive with no evidence of diease, 2 died because of disease, with 1 intercurrent death. One patient developed a second malignancy. The outcome for adults matches that of the more common paediatric patients. Radiotherapy could control local disease even where complete resection was not achieved.
Identifying the primitive path mesh in entangled polymer liquids
International Nuclear Information System (INIS)
Sukumaran, Sathish K.; Kremer, Kurt; Grest, Gary Stephen; Everaers, Ralf
2004-01-01
Similar to entangled ropes, polymer chains cannot slide through each other. These topological constraints, the so-called entanglements, dominate the viscoelastic behavior of high-molecular-weight polymeric liquids. Tube models of polymer dynamics and rheology are based on the idea that entanglements confine a chain to small fluctuations around a primitive path which follows the coarse-grained chain contour. To establish the microscopic foundation for these highly successful phenomenological models, we have recently introduced a method for identifying the primitive path mesh that characterizes the microscopic topological state of computer-generated conformations of long-chain polymer melts and solutions. Here we give a more detailed account of the algorithm and discuss several key aspects of the analysis that are pertinent for its successful use in analyzing the topology of the polymer configurations. We also present a slight modification of the algorithm that preserves the previously neglected self-entanglements and allows us to distinguish between local self-knots and entanglements between distant sections of the same chain. Our results indicate that the latter make a negligible contribution to the tube and that the contour length between local self-knots, N 1k is significantly larger than the entanglement length N e
An online gait generator for quadruped walking using motor primitives
Directory of Open Access Journals (Sweden)
Chunlin Zhou
2016-11-01
Full Text Available This article presents implementation of an online gait generator on a quadruped robot. Firstly, the design of a quadruped robot is presented. The robot contains four leg modules each of which is constructed by a 2 degrees of freedom (2-DOF five-bar parallel linkage mechanism. Together with other two rotational DOF, the leg module is able to perform 4-DOF movement. The parallel mechanism of the robot allows all the servos attached on the body frame, so that the leg mass is decreased and motor load can be balanced. Secondly, an online gait generator based on dynamic movement primitives for the walking control is presented. Dynamic movement primitives provide an approach to generate periodic trajectories and they can be modulated in real time, which makes the online adjustment of walking gaits possible. This gait controller is tested by the quadruped robot in regulating walking speed, switching between forward\\backward movements and steering. The controller is easy to apply, expand and is quite effective on phase coordination and online trajectory modulation. Results of simulated experiments are presented.
Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.
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.
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
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.
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
International Nuclear Information System (INIS)
Cataldi, S.; Ximenez; Carzoglio, J.
2010-01-01
Introduction: Colon carcinoid tumors are primary tumors in the colon, a rare histology. The lung tumour Si mil - Amyloid is within primary lung tumours, infrequent histology and often behaves like a benign tumour. In this paper we present the case of a patient with a history of having undergone colon surgery for a malignant carcinoid. Two years after developing a lung salivary tumour simile initially presented as metastasis Colonic carcinoid lung tumour. Clinical case: It is about a female patient of 64 years, who in September 2008 he makes a right hemicolectomy extended by an occlusive syndrome sub. Anatomic Pathology (A P) accounted for Carcinoid Tumor Malignant one that committed the entire wall and 50 lymph nodes are resected, all free metastasis. The patient does not receive complementary treatments and an imaging over in December 2009 is evident in a tomographic study a bulky upper lobe pulmonary parenchymal process right. The fiberoptic bronchoscopy (Fob) showed complete obstruction of the right upper lobe bronchus by a vegetating process whose biopsy reported a malignant lung tumor commitment carcinoid support primitive colonic confirmed by immunohistochemistry (IHC). The March 23, 2010 takes place the right upper lobectomy with lymphadenectomy. The A P and IHC study confirmed adenosquamous carcinoma with stroma simile amiloide low degree of malignancy. This injury can be approved to a salivary tumour early lung simile. Bronchial compromised by tumor margin and 22 negative lymph nodes. The patient is referred for additional radiation treatment. Discussion: Tumours of salivary gland type of primitive lung is a very rare condition and diagnosis is a r arity . Usually they originate in the bronchial epithelium submucosal gland. Endo luminal lesions usually occur as infrequently and develop in outlying areas. The development of lung tumours unrelated bronchial structure has been explained by a possible origin from a primitive stem cell that can differentiate a
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...
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 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 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
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)
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
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.
Evidence for extreme Ti-50 enrichments in primitive meteorites
International Nuclear Information System (INIS)
Fahey, A.; Mckeegan, K.D.; Zinner, E.; Goswami, J.N.; Physical Research Lab., Ahmedabad, India)
1985-01-01
The results of the first high mass resolution ion microprobe study of Ti isotopic compositions in individual refractory grains from primitive carbonaceous meteorites are reported. One hibonite from the Murray carbonaceous chondrite has a 10 percent excess of Ti-50, 25 times higher than the maximum value previously reported for bulk samples of refractory inclusions from carbonaceous chondrites. The variation of the Ti compositions between different hibonite grains, and among pyroxenes from a single Allende refractory inclusion, indicates isotopic inhomogeneities over small scale lengths in the solar nebula and emphasizes the importance of the analysis of small individual phases. This heterogeneity makes it unlikely that the isotopic anomalies were carried into the solar system in the gas phase. 20 references
The CHY representation of tree-level primitive QCD amplitudes
International Nuclear Information System (INIS)
Cruz, Leonardo de la; Kniss, Alexander; Weinzierl, Stefan
2015-01-01
In this paper we construct a CHY representation for all tree-level primitive QCD amplitudes. The quarks may be massless or massive. We define a generalised cyclic factor Ĉ(w,z) and a generalised permutation invariant function Ê(z,p,ε). The amplitude is then given as a contour integral encircling the solutions of the scattering equations with the product ĈÊ as integrand. Equivalently, it is given as a sum over the inequivalent solutions of the scattering equations, where the summand consists of a Jacobian times the product ĈÊ. This representation separates information: The generalised cyclic factor does not depend on the helicities of the external particles, the generalised permutation invariant function does not depend on the ordering of the external particles.
Evolution of lung breathing from a lungless primitive vertebrate.
Hoffman, M; Taylor, B E; Harris, M B
2016-04-01
Air breathing was critical to the terrestrial radiation and evolution of tetrapods and arose in fish. The vertebrate lung originated from a progenitor structure present in primitive boney fish. The origin of the neural substrates, which are sensitive to metabolically produced CO2 and which rhythmically activate respiratory muscles to match lung ventilation to metabolic demand, is enigmatic. We have found that a distinct periodic centrally generated rhythm, described as "cough" and occurring in lamprey in vivo and in vitro, is modulated by central sensitivity to CO2. This suggests that elements critical for the evolution of breathing in tetrapods, were present in the most basal vertebrate ancestors prior to the evolution of the lung. We propose that the evolution of breathing in all vertebrates occurred through exaptations derived from these critical basal elements. Copyright © 2015 Elsevier B.V. All rights reserved.
Amylose primitive médiastinale d'aspect pseudotumoral
Mahfoudhi, Madiha; Mamlouk, Habiba; Turki, Sami; Kheder, Adel
2015-01-01
L'amylose primitive médiastinale isolée est rare et de diagnostic difficile. Nous rapportons l'observation d'un patient âgé de 41 ans ayant présenté une dyspnée et des crachats hémoptoïques. A l'examen physique il n'avait pas d'hypotension orthostatique. Les aires ganglionnaires périphériques étaient libres. La tomodensitométrie thoracique a objectivé un magma d'adénopathies médiastinales réalisant une masse de 45 mm x 60 mm. L'examen anatomopathologique d'une biopsie ganglionnaire guidée par médiastinoscopie a conclut a une amylose médiastinale de type AL. Il n'avait pas d'autres localisations amyloïdes. Un myélome multiple a été éliminé. Le diagnostic d'amylose primitive médiastinale de type AL a été retenu. Le traitement s'est basé sur des cures de Melphalan-prednisone. La chirurgie était évitée vu le risque hémorragique élevé. L’évolution était marquée par l'amélioration de la dyspnée, la disparition de l'hémoptysie et la diminution de la taille de la masse ganglionnaire devenant 25 mm x 20 mm. PMID:26308913
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.
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)
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.
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)
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.
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.
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
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 techniques for detection of small objects in infrared image data
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.
A new design for SLAM front-end based on recursive SOM
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.
The first trimester human placenta is a site for terminal maturation of primitive erythroid cells.
Van Handel, Ben; Prashad, Sacha L; Hassanzadeh-Kiabi, Nargess; Huang, Andy; Magnusson, Mattias; Atanassova, Boriana; Chen, Angela; Hamalainen, Eija I; Mikkola, Hanna K A
2010-10-28
Embryonic hematopoiesis starts via the generation of primitive red blood cells (RBCs) that satisfy the embryo's immediate oxygen needs. Although primitive RBCs were thought to retain their nuclei, recent studies have shown that primitive RBCs in mice enucleate in the fetal liver. It has been unknown whether human primitive RBCs enucleate, and what hematopoietic site might support this process. Our data indicate that the terminal maturation and enucleation of human primitive RBCs occurs in first trimester placental villi. Extravascular ζ-globin(+) primitive erythroid cells were found in placental villi between 5-7 weeks of development, at which time the frequency of enucleated RBCs was higher in the villous stroma than in circulation. RBC enucleation was further evidenced by the presence of primitive reticulocytes and pyrenocytes (ejected RBC nuclei) in the placenta. Extravascular RBCs were found to associate with placental macrophages, which contained ingested nuclei. Clonogenic macrophage progenitors of fetal origin were present in the chorionic plate of the placenta before the onset of fetoplacental circulation, after which macrophages had migrated to the villi. These findings indicate that placental macrophages may assist the enucleation process of primitive RBCs in placental villi, implying an unexpectedly broad role for the placenta in embryonic hematopoiesis.
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Fuji, Hiroyuki; Penner, Robert C.
relation, which combined with an initial condition determines these numbers uniquely. This recursion relation is equivalent to a second order, non-linear, algebraic partial differential equation for the generating function of the numbers of partial chord diagrams filtered by the boundary length and point...
Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing
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.
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...
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
Real-time recursive motion segmentation of video data on a programmable device
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
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
Hurwitz numbers, moduli of curves, topological recursion, Givental's theory and their relations
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
Chiodo formulas for the r-th roots and topological recursion
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
Using metrics for proof rules for recursively defined delay-insensitive specifications
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
The Monge-Ampère equation: Hamiltonian and symplectic structures, recursions, and hierarchies
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
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...
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
Cross-Validation of Survival Bump Hunting by Recursive Peeling Methods.
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.
The Central Nervous in system Rhabdoid tumor primitive
International Nuclear Information System (INIS)
Manana, G.; Bernachin, J.; Waskoff, S.; Panuncio, A.
2004-01-01
Primitive Rhabdoid tumors of the Central Nervous system are entities of very low frequency and since 1942 is the first event observed in a total of 16,000 cases studied in the Laboratory of Neuropathology, Clinical Hospital. Until 2003 were described 118 case in the literature. The case is about the 3 years old child with no previous medical history consulted for 3 months with headaches, repeated vomiting, irritability and non specific abnormal gait. On examination is found a physical waking depression and great hydrocephalus in V I bilateral pair so is submitted to a emergency surgery. RMI CT and MRI performed reveals large frontal tumor that reaches the oval center with cystic and calcifications areas. Three days after is operates for the intraventricular tumor without post operative complications. Receive chemotherapy and the patient died 2 years later. The neuro pathological and ultrastructural study reveals a Rhabdoid malignancy brain tumor of grade IV as well as were analyzed histopathological and ultrastructural aspects of this entity
Modeling discrete and rhythmic movements through motor primitives: a review.
Degallier, Sarah; Ijspeert, Auke
2010-10-01
Rhythmic and discrete movements are frequently considered separately in motor control, probably because different techniques are commonly used to study and model them. Yet the increasing interest in finding a comprehensive model for movement generation requires bridging the different perspectives arising from the study of those two types of movements. In this article, we consider discrete and rhythmic movements within the framework of motor primitives, i.e., of modular generation of movements. In this way we hope to gain an insight into the functional relationships between discrete and rhythmic movements and thus into a suitable representation for both of them. Within this framework we can define four possible categories of modeling for discrete and rhythmic movements depending on the required command signals and on the spinal processes involved in the generation of the movements. These categories are first discussed in terms of biological concepts such as force fields and central pattern generators and then illustrated by several mathematical models based on dynamical system theory. A discussion on the plausibility of theses models concludes the work.
Primitive neuroectodermal tumor of adrenal: Clinical presentation and outcomes
Directory of Open Access Journals (Sweden)
Deep Dutta
2013-01-01
Full Text Available Primitive neuroectodermal tumor (PNET of adrenal is an extremely rare tumor of neural crest origin. A nonfunctional left adrenal mass (14.6 × 10.5 × 10.0 cm on computed tomography (CT was detected in a 40-year-old lady with abdominal pain, swelling, and left pleural effusion. She underwent left adrenalectomy and left nephrectomy with retroperitoneal resection. Histopathology revealed sheets and nest of oval tumor cells with hyperchromatic nuclei, prominent nucleoli, scanty cytoplasm, brisk mitotic activity, necrosis, lymphovascular invasion, capsular invasion, and extension to the surrounding muscles; staining positive for Mic-2 (CD-99 antigen, vimentin, synaptophysin, and Melan-A. Thoracocentesis, pleural fluid study, and pleural biopsy did not show metastasis. She responded well to vincristine, adriamycin, and cyclophosphamide followed by ifosfamide and etoposide (IE. This is the first report of adrenal peripheral PNET (pPNET from India. This report intends to highlight that pPNET should be suspected in a patient presenting with huge nonfunctional adrenal mass which may be confused with adrenocortical carcinoma.
Multiple Ewing Sarcoma/Primitive Neuroectodermal Tumors in the Mediastinum
Bae, Sung Hwan; Hwang, Jung Hwa; Da Nam, Bo; Kim, Hyun Jo; Kim, Ki-Up; Kim, Dong Won; Choi, In Ho
2016-01-01
Abstract Ewing sarcoma/primitive neuroectodermal tumors (ES/PNET) are high-grade malignant neoplasms. These malignancies present very rare tumors of thoracopulmonary area and even rarer in the mediastinum. In our knowledge, ES/PNET presented with multiple mediastinal masses has not been reported previously. We experienced a case of a 42-year-old man presented with gradual onset of left-side pleuritic chest pain. A contrast-enhanced chest computed tomography (CT) scan showed separate 2 large heterogeneously enhancing masses in each anterior and middle mediastinum of the left hemithorax. Positron emission tomography-computed tomography (PET-CT) scan revealed high fluorodeoxyglucose (FDG) uptake in the mediastinal masses. After surgical excision for the mediastinal masses, both of the masses were diagnosed as the ES/PNET group of tumors on the histopathologic examination. The patient refused postoperative adjuvant chemotherapy and came back with local tumor recurrence and distant metastasis on 4-month follow-up after surgical resection. We report this uncommon form of ES/PNET. We are to raise awareness that this rare malignancy should be considered as a differential diagnosis of the malignant mediastinal tumors and which can be manifested as multiple masses in a patient. Understanding this rare entity of extra-skeletal ES/PNET and characteristic imaging findings can help radiologists and clinicians to approach proper diagnosis and better management for this highly malignant tumor. PMID:26886614
Rapid world modeling: Fitting range data to geometric primitives
International Nuclear Information System (INIS)
Feddema, J.; Little, C.
1996-01-01
For the past seven years, Sandia National Laboratories has been active in the development of robotic systems to help remediate DOE's waste sites and decommissioned facilities. Some of these facilities have high levels of radioactivity which prevent manual clean-up. Tele-operated and autonomous robotic systems have been envisioned as the only suitable means of removing the radioactive elements. World modeling is defined as the process of creating a numerical geometric model of a real world environment or workspace. This model is often used in robotics to plan robot motions which perform a task while avoiding obstacles. In many applications where the world model does not exist ahead of time, structured lighting, laser range finders, and even acoustical sensors have been used to create three dimensional maps of the environment. These maps consist of thousands of range points which are difficult to handle and interpret. This paper presents a least squares technique for fitting range data to planar and quadric surfaces, including cylinders and ellipsoids. Once fit to these primitive surfaces, the amount of data associated with a surface is greatly reduced up to three orders of magnitude, thus allowing for more rapid handling and analysis of world data
Primitive Neuroectodermal Tumor (PNET) of the kidney: a case report
International Nuclear Information System (INIS)
Pomara, Giorgio; Cappello, Francesco; Cuttano, Maria G; Rappa, Francesca; Morelli, Girolamo; Mancini, Pierantonio; Selli, Cesare
2004-01-01
A case of Primitive Neuroectodermal Tumor (PNET) of the kidney in a 27-year-old woman is presented. Few cases are reported in the literature with a variable, nonspecific presentation and an aggressive behaviour. In our case, a radical nephrectomy with lymphadenectomy was performed and there was no residual or recurrent tumour at 24-month follow-up. The surgical specimens were formalin-fixed and paraffin embedded. The sections were stained with routinary H&E. Immunohistochemistry was performed. The immunohistochemical evaluation revealed a diffuse CD99 positivity in the cytoplasm of the neoplastic cells. Pankeratin, cytokeratin AE1/AE3, vimentin, desmin, S100, cromogranin were negative. The clinical presentation and the macroscopic aspect, together with the histological pattern, the cytological characteristic and the cellular immunophenotype addressed the diagnosis towards primary PNET of kidney. Since sometimes it is difficult to discriminate between PNET and Ewing's tumour, we reviewed the difficulties in differential diagnosis. These tumors have a common precursor but the stage of differentiation in which it is blocked is probably different. This could also explain their different biological behaviour and prognosis
Primitive object love in Melanie Klein's thinking; early theoretical influences.
Likierman, M
1993-04-01
Melanie Klein's thinking on early object love is pivotal to her vision of development. Yet within her texts it is often enmeshed in complex formulations that obscure its full significance. A greater clarity in viewing Klein's concept of early object love is achieved through tracing some of its historical origins. The author notes that it was inspired by aspects of Ferenczi's theory, hence its similarities with the concept of 'primary love' formulated by another of Ferenczi's analysands, Michael Balint. Ferenczi's thinking on the subject formed part of a broader network of theoretical developments in the history of psychoanalytic ideas. These are shown to have origins in Freud's fluctuations between a 'passive' and a 'genital' characterisation of infantile sexuality. A dialectical tension between these two possibilities, as maintained in the Freudian texts, was partly embodied in the differing outlooks of Klein's two psychoanalysts, Abraham and Ferenczi. The author suggests that it is a mixture of their approaches that partly shaped Klein's thinking on the earliest experiences of love. After outlining these developments the author analyses the nature of early object love as it emerges from Klein's powerful, if intermittent descriptions in the texts. The analysis also tackles a textual ambiguity in Klein's formulations, showing that she explored two kinds of primitive ideal experience without explicitly differentiating them. Such differentiation is important inasmuch as it highlights negative and positive aspects of Kleinian theory at root.
Ngwa, Caroline N.; Hansteen, Thor H.; Devey, Colin W.; van der Zwan, Froukje M.; Suh, Cheo E.
2017-09-01
Debunscha Maar is a monogenetic volcano forming part of the Mt. Cameroon volcanic field, located within the Cameroon Volcanic Line (CVL). Partly glassy cauliflower bombs have primitive basanite-picrobasalt compositions and contain abundant normally and reversely zoned olivine (Fo 77-87) and clinopyroxene phenocrysts. Naturally quenched melt inclusions in the most primitive olivine phenocrysts show compositions which, when corrected for post-entrapment modification, cover a wide range from basanite to alkali basalt (MgO 6.9-11.7 wt%), and are generally more primitive than the matrix glasses (MgO 5.0-5.5 wt%) and only partly fall on a common liquid line of descent with the bulk rock samples and matrix glasses. Melt inclusion trace element compositions lie on two distinct geochemical trends: one (towards high Ba/Nb) is thought to represent the effect of various proportions of anhydrous lherzolite and amphibole-bearing peridotite in the source, while the other (for example, high La/Y) reflects variable degrees of partial melting. Comparatively low fractionation-corrected CaO in the melt inclusions with the highest La/Y suggests minor involvement of a pyroxenite source component that is only visible at low degrees of melting. Most of the samples show elevated Gd/Yb, indicating up to 8% garnet in the source. The range of major and trace elements represented by the melt inclusions covers the complete geochemical range given by basalts from different volcanoes of the Cameroon volcanic line, indicating that geochemical signatures that were previously thought to be volcano-specific in fact are probably present under all volcanoes. Clinopyroxene-melt barometry strongly indicates repeated mixing of compositionally diverse melts within the upper mantle at 830 ± 170 MPa prior to eruption. Mantle potential temperatures estimated for the primitive melt inclusions suggest that the thermal influence of a mantle plume is not required to explain the magma petrogenesis.
The divergent fates of primitive hydrospheric water on Earth and Mars
Wade, Jon; Dyck, Brendan; Palin, Richard M.; Moore, James D. P.; Smye, Andrew J.
2017-12-01
Despite active transport into Earth’s mantle, water has been present on our planet’s surface for most of geological time. Yet water disappeared from the Martian surface soon after its formation. Although some of the water on Mars was lost to space via photolysis following the collapse of the planet’s magnetic field, the widespread serpentinization of Martian crust suggests that metamorphic hydration reactions played a critical part in the sequestration of the crust. Here we quantify the relative volumes of water that could be removed from each planet’s surface via the burial and metamorphism of hydrated mafic crusts, and calculate mineral transition-induced bulk-density changes at conditions of elevated pressure and temperature for each. The metamorphic mineral assemblages in relatively FeO-rich Martian lavas can hold about 25 per cent more structurally bound water than those in metamorphosed terrestrial basalts, and can retain it at greater depths within Mars. Our calculations suggest that in excess of 9 per cent by volume of the Martian mantle may contain hydrous mineral species as a consequence of surface reactions, compared to about 4 per cent by volume of Earth’s mantle. Furthermore, neither primitive nor evolved hydrated Martian crust show noticeably different bulk densities compared to their anhydrous equivalents, in contrast to hydrous mafic terrestrial crust, which transforms to denser eclogite upon dehydration. This would have allowed efficient overplating and burial of early Martian crust in a stagnant-lid tectonic regime, in which the lithosphere comprised a single tectonic plate, with only the warmer, lower crust involved in mantle convection. This provided an important sink for hydrospheric water and a mechanism for oxidizing the Martian mantle. Conversely, relatively buoyant mafic crust and hotter geothermal gradients on Earth reduced the potential for upper-mantle hydration early in its geological history, leading to water being retained
Recurrent spinal primitive neuroectodermal tumor with brain and bone metastases: A case report.
Chen, Frank; Chiou, Shyh-Shin; Lin, Sheng-Fung; Lieu, Ann-Shung; Chen, Yi-Ting; Huang, Chih-Jen
2017-11-01
Primary spinal primitive neuroectodermal tumor (PNET) is relatively rare in all age groups, and the prognosis in most cases of spinal PNETs appears to be poor, with a median patient survival of 1 to 2 years. We present a case with recurrent spinal PNET with brain and bone metastases that was successfully treated by multimodality treatment. A 14-year-old teenage girl had suffered from progressive left upper back pain with bilateral lower legs weakness and numbness for 1 year. After treatment, left neck mass was noted 3 years later. Initially, magnetic resonance imaging (MRI) showed neurogenic tumor involving intradural extramedullary space of T5-T10. Pathology report showed PNET (World Health Organization grade IV) featuring lobules of neoplastic cells with round regular nuclei, high nucleus-to-cytoplasm ratio, and fibrillary cytoplasm. At the time of tumor recurrence, chest MRI then showed recurrent tumor at T2-T3 level of the epidural space with right neural foramina invasion. Brain MRI showed extensive bilateral calvarial metastases and leptomeningeal metastases in the right frontoparietal regions. Bone scan showed multiple bone metastases. T-spine tumor removal and adjuvant radiotherapy (RT) to T-spine tumor bed were performed in the initial treatment. After clinical tumor recurrence, tumor removal was done again. She then received chemotherapy followed by whole brain irradiation with hippocampal sparing with 35 gray in 20 fractions. After treatment, follow-up images showed that the disease was under control. There was no neurological sequela. She has survived more than 7 years from diagnosis and more than 4 years from recurrence to date. Multimodality treatments including operation, RT, and chemotherapy should be considered in the initial treatment planning, and salvage chemotherapy was useful in this case.
The divergent fates of primitive hydrospheric water on Earth and Mars.
Wade, Jon; Dyck, Brendan; Palin, Richard M; Moore, James D P; Smye, Andrew J
2017-12-20
Despite active transport into Earth's mantle, water has been present on our planet's surface for most of geological time. Yet water disappeared from the Martian surface soon after its formation. Although some of the water on Mars was lost to space via photolysis following the collapse of the planet's magnetic field, the widespread serpentinization of Martian crust suggests that metamorphic hydration reactions played a critical part in the sequestration of the crust. Here we quantify the relative volumes of water that could be removed from each planet's surface via the burial and metamorphism of hydrated mafic crusts, and calculate mineral transition-induced bulk-density changes at conditions of elevated pressure and temperature for each. The metamorphic mineral assemblages in relatively FeO-rich Martian lavas can hold about 25 per cent more structurally bound water than those in metamorphosed terrestrial basalts, and can retain it at greater depths within Mars. Our calculations suggest that in excess of 9 per cent by volume of the Martian mantle may contain hydrous mineral species as a consequence of surface reactions, compared to about 4 per cent by volume of Earth's mantle. Furthermore, neither primitive nor evolved hydrated Martian crust show noticeably different bulk densities compared to their anhydrous equivalents, in contrast to hydrous mafic terrestrial crust, which transforms to denser eclogite upon dehydration. This would have allowed efficient overplating and burial of early Martian crust in a stagnant-lid tectonic regime, in which the lithosphere comprised a single tectonic plate, with only the warmer, lower crust involved in mantle convection. This provided an important sink for hydrospheric water and a mechanism for oxidizing the Martian mantle. Conversely, relatively buoyant mafic crust and hotter geothermal gradients on Earth reduced the potential for upper-mantle hydration early in its geological history, leading to water being retained close to
Examination of Multiple Lithologies Within the Primitive Ordinary Chondrite NWA 5717
Cato, M. J.; Simon, J. I.; Ross, D. K.; Morris, R. V.
2017-01-01
Northwest Africa 5717 is a primitive (subtype 3.05) ungrouped ordinary chondrite which contains two apparently distinct lithologies. In large cut meteorite slabs, the darker of these, lithology A, looks to host the second, much lighter in color, lithology B (upper left, Fig. 1). The nature of the boundary between the two is uncertain, ranging from abrupt to gradational and not always following particle boundaries. The distinction between the lithologies, beyond the obvious color differences, has been supported by a discrepancy in oxygen isotopes and an incongruity in the magnesium contents of chondrule olivine. Here, quantitative textural analysis and mineralogical methods have been used to investigate the two apparent lithologies within NWA 5717. Olivine grains contained in a thin section from NWA 7402, thought to be paired to 5717, were also measured to re-examine the distinct compositional range among the light and dark areas. Procedure: Particles from a high-resolution mosaic image of a roughly 13x15cm slice of NWA 5717 were traced in Adobe Photoshop. Due to the large size of the sample, visually representative regions of each lithology were chosen to be analyzed. The resulting layers of digitized particles were imported into ImageJ, which was used to measure their area, along with the axes, the angle from horizontal, and the centroid coordinates of ellipses fitted to each particle following the approach. Resulting 2D pixel areas were converted to spherical diameters employing the unfolding algorithm, which outputs a 3D particle size distribution based on digitized 2D size frequency data. Spatstat was used to create kernel density plots of the centroid coordinates for each region. X-ray compositional maps, microprobe analyses, and Mossbauer spectroscopy was conducted on a thin section of NWA 7402, tentatively paired to NWA 5717.
Enhanced Matrix Power Function for Cryptographic Primitive Construction
Directory of Open Access Journals (Sweden)
Eligijus Sakalauskas
2018-02-01
Full Text Available A new enhanced matrix power function (MPF is presented for the construction of cryptographic primitives. According to the definition in previously published papers, an MPF is an action of two matrices powering some base matrix on the left and right. The MPF inversion equations, corresponding to the MPF problem, are derived and have some structural similarity with classical multivariate quadratic (MQ problem equations. Unlike the MQ problem, the MPF problem seems to be more complicated, since its equations are not defined over the field, but are represented as left–right action of two matrices defined over the infinite near-semiring on the matrix defined over the certain infinite, additive, noncommuting semigroup. The main results are the following: (1 the proposition of infinite, nonsymmetric, and noncommuting algebraic structures for the construction of the enhanced MPF, satisfying associativity conditions, which are necessary for cryptographic applications; (2 the proof that MPF inversion is polynomially equivalent to the solution of a certain kind of generalized multivariate quadratic (MQ problem which can be reckoned as hard; (3 the estimation of the effectiveness of direct MPF value computation; and (4 the presentation of preliminary security analysis, the determination of the security parameter, and specification of its secure value. These results allow us to make a conjecture that enhanced MPF can be a candidate one-way function (OWF, since the effective (polynomial-time inversion algorithm for it is not yet known. An example of the application of the proposed MPF for the Key Agreement Protocol (KAP is presented. Since the direct MPF value is computed effectively, the proposed MPF is suitable for the realization of cryptographic protocols in devices with restricted computation resources.
Isotopic and chemical variation of organic nanoglobules in primitive meteorites
de Gregorio, Bradley T.; Stroud, Rhonda M.; Nittler, Larry R.; Alexander, Conel M. O'd.; Bassim, Nabil D.; Cody, George D.; Kilcoyne, A. L. David; Sandford, Scott A.; Milam, Stefanie N.; Nuevo, Michel; Zega, Thomas J.
2013-05-01
Organic nanoglobules are microscopic spherical carbon-rich objects present in chondritic meteorites and other astromaterials. We performed a survey of the morphology, organic functional chemistry, and isotopic composition of 184 nanoglobules in insoluble organic matter (IOM) residues from seven primitive carbonaceous chondrites. Hollow and solid nanoglobules occur in each IOM residue, as well as globules with unusual shapes and structures. Most nanoglobules have an organic functional chemistry similar to, but slightly more carboxyl-rich than, the surrounding IOM, while a subset of nanoglobules have a distinct, highly aromatic functionality. The range of nanoglobule N isotopic compositions was similar to that of nonglobular 15N-rich hotspots in each IOM residue, but nanoglobules account for only about one third of the total 15N-rich hotspots in each sample. Furthermore, many nanoglobules in each residue contained no 15N enrichment above that of bulk IOM. No morphological indicators were found to robustly distinguish the highly aromatic nanoglobules from those that have a more IOM-like functional chemistry, or to distinguish 15N-rich nanoglobules from those that are isotopically normal. The relative abundance of aromatic nanoglobules was lower, and nanoglobule diameters were greater, in more altered meteorites, suggesting the creation/modification of IOM-like nanoglobules during parent-body processing. However, 15N-rich nanoglobules, including many with highly aromatic functional chemistry, likely reflect preaccretionary isotopic fractionation in cold molecular cloud or protostellar environments. These data indicate that no single formation mechanism can explain all of the observed characteristics of nanoglobules, and their properties are likely a result of multiple processes occurring in a variety of environments.
Deep Interior: Probing the Structure of Primitive Bodies
Asphaug, Erik; Scheeres, Daniel; Safaeinili, Ali
Deep Interior is a mature Discovery-class mission concept focused on probing the geophysical behavior of primitive bodies, from the mechanics of their exterior materials to the structures of their interiors. Its theme is to discover how small bodies work - to learn the natural origin and evolution of asteroids, comets and other primitive bodies through radar reflection tomography and through detailed observations of the local and global effects of cratering. Learning the structure and mechanical response of asteroids and comets is also a precursor to resource utilization and hazardous asteroid mitigation. Overall the mission is aligned with NASA strategic sub-goal 3C, to advance scientific knowledge of the origin and history of the solar system ... and the hazards and resources present as humans explore space. Deep Interior deploys no complex landers or sub-spacecraft; the scientific instruments are a radar and a camera. A blast cratering experiments triggered by grenades leads to a low cost seismological investigation which complements the radar investigation. A desired addition is an imaging spectrometer. The science instruments are high heritage, as are the navigation techniques for orbiting and station-keeping. The mission conducts the following investigations at one or more asteroids: Radar Reflection Tomography (RRT). The first science phase is to operate a penetrating radar during each several-month rendezvous, deployed in reflection mode in the manner of ongoing radar investigations underway by Mars Express, Mars Reconnaissance Orbiter, and Kaguya. The RRT technique (Safaeinili et al., MAPS 2002) is analogous to performing a "CAT scan" from orbit: closely sampled radar echoes are processed to yield volumetric maps of mechanical and compositional boundaries, and to measure interior dielectric properties. Deep Interior utilizes a polar orbit (or station keeping) while the asteroid spins underneath; the result is to "peel the apple" with thousands of unique
MRI diagnosis of supratentorial and intraspinal primitive neuroectodermal tumors
International Nuclear Information System (INIS)
Liu Meili; Cui Shimin; Han Tong; Li Tao; Liu Li; Lei Jing; Qing Jingxi; Yan Xiaoling; Kong Fanming
2004-01-01
Objective: To analyze the MRI features of supratentorial and intraspinal primitive neuroectodermal tumors (PNET) and improve the diagnostic accuracy. Methods: MRI manifestations of 9 PNET diagnosed via operation and pathological examination were analyzed. There were 6 men and 3 women, and the mean age was 32.6 years. In all 9 cases, conventional plain MR scans were performed, including spin echo (SE), fast spin echo (FSE), and fluid attenuated inversion recovery (FLAIR) sequences. Diffusion weighted images (DWIs) and postcontrast MR images were obtained in 2 and 4 cases, respectively. Results: The 8 cases with supratentorial lesions included fronto-temporal lesion in 2 cases, occipital lesion in 2 cases, fronto-parietal lobe, parietal lobe, frontal lobe lesion in each 1 case, and posterior part of third ventricle in 1 case, and the lesion located in the thoracic spinal canal in 1 case. All the lesions were quite large in volume, and the largest one was 6.0 cm x 6.9 cm x 4.9 cm. Except for the round-like lesion in the posterior part of third ventricle, the other 7 supratentorial lesions were irregular in shape, well demarked, and often with solid consistency and slight peritumoral edema. The lesions demonstrated long T 1 and long or slightly long T 2 signal intensity in 4 cases, mixed signal intensity on T 1 WI, T 2 WI, and FLAIR images in 4 cases. Small cystic degeneration could be seen in 2 cases, hemorrhage in 4 cases, and flow void vessels in 3 cases. 3 cases demonstrated irregular ring-like enhancement and ependymal dissemination. The lesion in the thoracic canal demonstrated as a slightly enhanced soft tissue mass with adjacent bony destruction and muscle infiltration. Conclusion: MR findings of PNET are rather characteristic, but the final diagnosis relies on pathology
National Research Council Canada - National Science Library
Mott, Stephen
2007-01-01
This research explores how hardware-based primitives can be implemented to perform security-related monitoring in real-time, offer better security, and increase performance compared to software-based approaches...
The genomes of two key bumblebee species with primitive eusocial organization
DEFF Research Database (Denmark)
Sadd, Ben M.; Barribeau, Seth M.; Bloch, Guy
2015-01-01
BACKGROUND: The shift from solitary to social behavior is one of the major evolutionary transitions. Primitively eusocial bumblebees are uniquely placed to illuminate the evolution of highly eusocial insect societies. Bumblebees are also invaluable natural and agricultural pollinators, and there ...
From primitive identity to the non-individuality of quantum objects
Arenhart, Jonas Becker; Krause, Décio
2014-05-01
We consider the claim by Dorato and Morganti (Grades of individuality. A pluralistic view of identity in quantum mechanics and in the sciences. Philosophical Studies, 163 (2013) 591-610) that primitive individuality should be attributed to the entities dealt with by non-relativistic quantum mechanics. There are two central ingredients in the proposal: (i) in the case of non-relativistic quantum mechanics, individuality should be taken as a primitive notion and (ii) primitive individuality is naturalistically acceptable. We argue that, strictly understood, naturalism faces difficulties in helping to provide a theory with a unique principle of individuation. We also hold that even when taken in a loose sense, naturalism does not provide any sense in which one could hold that quantum mechanics endorses primitive individuality over non-individuality. Rather, we argue that non-individuality should be preferred based on the grounds that such a view fits better the claims of the theory.
Retinoic acid signaling plays a restrictive role in zebrafish primitive myelopoiesis.
Directory of Open Access Journals (Sweden)
Dong Liang
Full Text Available Retinoic acid (RA is known to regulate definitive myelopoiesis but its role in vertebrate primitive myelopoiesis remains unclear. Here we report that zebrafish primitive myelopoiesis is restricted by RA in a dose dependent manner mainly before 11 hpf (hours post fertilization when anterior hemangioblasts are initiated to form. RA treatment significantly reduces expressions of anterior hemangioblast markers scl, lmo2, gata2 and etsrp in the rostral end of ALPM (anterior lateral plate mesoderm of the embryos. The result indicates that RA restricts primitive myelopoiesis by suppressing formation of anterior hemangioblasts. Analyses of ALPM formation suggest that the defective primitive myelopoiesis resulting from RA treatment before late gastrulation may be secondary to global loss of cells for ALPM fate whereas the developmental defect resulting from RA treatment during 10-11 hpf should be due to ALPM patterning shift. Overexpressions of scl and lmo2 partially rescue the block of primitive myelopoiesis in the embryos treated with 250 nM RA during 10-11 hpf, suggesting RA acts upstream of scl to control primitive myelopoiesis. However, the RA treatment blocks the increased primitive myelopoiesis caused by overexpressing gata4/6 whereas the abolished primitive myelopoiesis in gata4/5/6 depleted embryos is well rescued by 4-diethylamino-benzaldehyde, a retinal dehydrogenase inhibitor, or partially rescued by knocking down aldh1a2, the major retinal dehydrogenase gene that is responsible for RA synthesis during early development. Consistently, overexpressing gata4/6 inhibits aldh1a2 expression whereas depleting gata4/5/6 increases aldh1a2 expression. The results reveal that RA signaling acts downstream of gata4/5/6 to control primitive myelopoiesis. But, 4-diethylamino-benzaldehyde fails to rescue the defective primitive myelopoiesis in either cloche embryos or lycat morphants. Taken together, our results demonstrate that RA signaling restricts
Une tumeur neuroectodermique primitive périphérique à localisation ...
African Journals Online (AJOL)
Les tumeurs neuro-ectodermiques primitives ou sarcome d'Ewing sont classiquement des néoplasmes se développant aux dépends des tissus mous et des os. Les tumeurs neuro-ectodermiques primitives gastriques (pPNETs) sont extrêmement rares. Nous nous proposons, à travers le cas d'un patient, opéré pour une ...
Driving Style Analysis Using Primitive Driving Patterns With Bayesian Nonparametric Approaches
Wang, Wenshuo; Xi, Junqiang; Zhao, Ding
2017-01-01
Analysis and recognition of driving styles are profoundly important to intelligent transportation and vehicle calibration. This paper presents a novel driving style analysis framework using the primitive driving patterns learned from naturalistic driving data. In order to achieve this, first, a Bayesian nonparametric learning method based on a hidden semi-Markov model (HSMM) is introduced to extract primitive driving patterns from time series driving data without prior knowledge of the number...
A mutli-technique search for the most primitive CO chondrites
Alexander, C. M. O'D.; Greenwood, R. C.; Bowden, R.; Gibson, J. M.; Howard, K. T.; Franchi, I. A.
2018-01-01
As part of a study to identify the most primitive COs and to look for weakly altered CMs amongst the COs, we have conducted a multi-technique study of 16 Antarctic meteorites that had been classified as primitive COs. For this study, we have determined: (1) the bulk H, C and N abundances and isotopes, (2) bulk O isotopic compositions, (3) bulk modal mineralogies, and (4) for some selected samples the abundances and compositions of their insoluble organic matter (IOM). Two of the 16 meteorites do appear to be CMs - BUC 10943 seems to be a fairly typical CM, while MIL 090073 has probably been heated. Of the COs, DOM 08006 appears to be the most primitive CO identified to date and is quite distinct from the other members of its pairing group. The other COs fall into two groups that are less primitive than DOM 08006 and ALH 77307, the previously most primitive CO. The first group is composed of members of the DOM 08004 pairing group, except DOM 08006. The second group is composed of meteorites belonging to the MIL 03377 and MIL 07099 pairing groups. These two pairing groups should probably be combined. There is a dichotomy in the bulk O isotopes between the primitive (all Antarctic finds) and the more metamorphosed COs (mostly falls). This dichotomy can only partly be explained by the terrestrial weathering experienced by the primitive Antarctic samples. It seems that the more equilibrated samples interacted to a greater extent with 16O-poor material, probably water, than the more primitive meteorites.
Kerketta, A S; Bulliyya, G; Babu, B V; Mohapatra, S S S; Nayak, R N
2009-02-01
Primitive tribal groups (PTGs) are the most marginalised and vulnerable communities in India. Clinico-epidemiological studies on morbidity patterns among the elderly primitive tribe members are essential to recommend special intervention programmes to improve the health of the elderly in these communities. A community-based cross-sectional study was carried out among the elderly populations of four different PTGs, namely Langia Saora (LS), Paudi Bhuiyan (PB), Kutia Kondh (KK) and Dongria Kondh (DK) living in the forests of Orissa, India. Clinical and anthropometric data were collected using standard methods and haemoglobin was estimated by the cyanomethaemoglobin method. The average number of illnesses per person was 3.0. Common disabilities like vision and hearing impairment and mobility-related problems were found in considerable numbers. Gastrointestinal problems like acid peptic disease were found among 2.6% to 20% of cases. Non-specific fever was marked in 10.2% to 24.2% of individuals. The iodine deficiency disorder, namely goitre, was found among 4.2% to 6.0% of individuals. Diseases of the respiratory tract, like upper and lower respiratory tract infection, asthma, tuberculosis and leprosy, were found in small numbers. The prevalence of hypertension among males and females was 31.8% and 42.2%, respectively. The LS had the highest prevalence of hypertension (63% among men and 68% among women). With regard to anaemia status, severe anaemia was marked in 70% of males and 76.7% of females in the LS, while in other groups the prevalence of severe anaemia ranged from 15% to 33%. Although the prevalence of severe anaemia in other tribal communities is lower than in the LS, mild to moderate anaemia was found to range from 60% to 80%. The present study revealed a high prevalence of physical disabilities with both non-communicable as well as communicable diseases among the elderly primitive tribal members. This warrants the implementation of a special health care
Henkels, Julia; Oh, Jaeho; Xu, Wenwei; Owen, Drew; Sulchek, Todd; Zamir, Evan
2013-02-01
Large-scale morphogenetic movements during early embryo development are driven by complex changes in biochemical and biophysical factors. Current models for amniote primitive streak morphogenesis and gastrulation take into account numerous genetic pathways but largely ignore the role of mechanical forces. Here, we used atomic force microscopy (AFM) to obtain for the first time precise biomechanical properties of the early avian embryo. Our data reveal that the primitive streak is significantly stiffer than neighboring regions of the epiblast, and that it is stiffer than the pre-primitive streak epiblast. To test our hypothesis that these changes in mechanical properties are due to a localized increase of actomyosin contractility, we inhibited actomyosin contractility via the Rho kinase (ROCK) pathway using the small-molecule inhibitor Y-27632. Our results using several different assays show the following: (1) primitive streak formation was blocked; (2) the time-dependent increase in primitive streak stiffness was abolished; and (3) convergence of epiblast cells to the midline was inhibited. Taken together, our data suggest that actomyosin contractility is necessary for primitive streak morphogenesis, and specifically, ROCK plays a critical role. To better understand the underlying mechanisms of this fundamental process, future models should account for the findings presented in this study.
Evaluating structural pattern recognition for handwritten math via primitive label graphs
Zanibbi, Richard; MoucheÌre, Harold; Viard-Gaudin, Christian
2013-01-01
Currently, structural pattern recognizer evaluations compare graphs of detected structure to target structures (i.e. ground truth) using recognition rates, recall and precision for object segmentation, classification and relationships. In document recognition, these target objects (e.g. symbols) are frequently comprised of multiple primitives (e.g. connected components, or strokes for online handwritten data), but current metrics do not characterize errors at the primitive level, from which object-level structure is obtained. Primitive label graphs are directed graphs defined over primitives and primitive pairs. We define new metrics obtained by Hamming distances over label graphs, which allow classification, segmentation and parsing errors to be characterized separately, or using a single measure. Recall and precision for detected objects may also be computed directly from label graphs. We illustrate the new metrics by comparing a new primitive-level evaluation to the symbol-level evaluation performed for the CROHME 2012 handwritten math recognition competition. A Python-based set of utilities for evaluating, visualizing and translating label graphs is publicly available.
In search of a primitive ontology for relativistic quantum field theory
Energy Technology Data Exchange (ETDEWEB)
Lam, Vincent [University of Lausanne, CH-1015 Lausanne (Switzerland)
2014-07-01
There is a recently much discussed approach to the ontology of quantum mechanics according to which the theory is ultimately about entities in 3-dimensional space and their temporal evolution. Such an ontology postulating from the start matter localized in usual physical space or spacetime, by contrast to an abstract high-dimensional space such as the configuration space of wave function realism, is called primitive ontology in the recent literature on the topic and finds its roots in Bell's notion of local beables. The main motivation for a primitive ontology lies in its explanatory power: the primitive ontology allows for a direct account of the behaviour and properties of familiar macroscopic objects. In this context, it is natural to look for a primitive ontology for relativistic quantum field theory (RQFT). The aim of this talk is to critically discuss this interpretative move within RQFT, in particular with respect to the foundational issue of the existence of unitarily inequivalent representations. Indeed the proposed primitive ontologies for RQFT rely either on a Fock space representation or a wave functional representation, which are strictly speaking only unambiguously available for free systems in flat spacetime. As a consequence, it is argued that these primitive ontologies constitute only effective ontologies and are hardly satisfying as a fundamental ontology for RQFT.
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...
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.
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 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.
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
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)
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.
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.
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
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.
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.
Recursive approach for non-Markovian time-convolutionless master equations
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.
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...
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.
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.
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...
Recursive parameter estimation for Hammerstein-Wiener systems using modified EKF algorithm.
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.
Nonparametric bootstrap procedures for predictive inference based on recursive estimation schemes
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...
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.
Separating the Classes of Recursively Enumerable Languages Based on Machine Size
Czech Academy of Sciences Publication Activity Database
van Leeuwen, J.; Wiedermann, Jiří
2015-01-01
Roč. 26, č. 6 (2015), s. 677-695 ISSN 0129-0541 R&D Projects: GA ČR GAP202/10/1333 Grant - others:GA ČR(CZ) GA15-04960S Institutional support: RVO:67985807 Keywords : recursively enumerable languages * RE hierarchy * finite languages * machine size * descriptional complexity * Turing machines with advice Subject RIV: IN - Informatics, Computer Science Impact factor: 0.467, year: 2015
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
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.
All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials
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...
Local Stability Conditions for Two Types of Monetary Models with Recursive Utility
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...
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 ...
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 ...
Nobuoki, Eshima; Minoru, Tabata; Geng, Zhi; Department of Medical Information Analysis, Faculty of Medicine, Oita Medical University; Department of Applied Mathematics, Faculty of Engineering, Kobe University; Department of Probability and Statistics, Peking University
2001-01-01
This paper discusses path analysis of categorical variables with logistic regression models. The total, direct and indirect effects in fully recursive causal systems are considered by using model parameters. These effects can be explained in terms of log odds ratios, uncertainty differences, and an inner product of explanatory variables and a response variable. A study on food choice of alligators as a numerical exampleis reanalysed to illustrate the present approach.
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
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.
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.
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 case of the persistence of the primitive hypoglossal artery with an enlarged hypoglossal canal
International Nuclear Information System (INIS)
Tomura, Noriaki; Inugami, Atsushi; Uemura, Kazuo; Asakura, Ken
1987-01-01
A case of the persistence of the primitive hypoglossal artery is reported, with a roentgenographic demonstration of the enlarged hypoglossal canal. A 63-year-old man was admitted to this hospital as a result of a malfunction of the ventriculo-peritoneal shunt. At the age of 51, the patient had been operated on in this hospital for an aneurysm of the right middle cerebral artery; at that time, the right primitive hypoglossal artery was observed on right carotid angiograms. On the day following admission, bilateral retrograde vertebral angiography was performed and the right persistent primitive hypoglossal artery was recognized again. Stenvers views of the skull demonstrated an enlargement of the hypoglossal canal, with a smooth sclerotic rim. High-resolution computed tomography with a contrast infusion delineated the right primitive hypoglossal artery through the enlarged hypoglossal canal. The diameter of the enlarged right hypoglossal canal and that of the left one were found to be 8 mm and 4 mm respectively on the CT. When an enlargement of the hypoglossal canal with a sclerotic rim is observed, the persistence of the primitive hypoglossal artery should be considered in the differential diagnosis. (author)
Physically Unclonable Cryptographic Primitives by Chemical Vapor Deposition of Layered MoS2.
Alharbi, Abdullah; Armstrong, Darren; Alharbi, Somayah; Shahrjerdi, Davood
2017-12-26
Physically unclonable cryptographic primitives are promising for securing the rapidly growing number of electronic devices. Here, we introduce physically unclonable primitives from layered molybdenum disulfide (MoS 2 ) by leveraging the natural randomness of their island growth during chemical vapor deposition (CVD). We synthesize a MoS 2 monolayer film covered with speckles of multilayer islands, where the growth process is engineered for an optimal speckle density. Using the Clark-Evans test, we confirm that the distribution of islands on the film exhibits complete spatial randomness, hence indicating the growth of multilayer speckles is a spatial Poisson process. Such a property is highly desirable for constructing unpredictable cryptographic primitives. The security primitive is an array of 2048 pixels fabricated from this film. The complex structure of the pixels makes the physical duplication of the array impossible (i.e., physically unclonable). A unique optical response is generated by applying an optical stimulus to the structure. The basis for this unique response is the dependence of the photoemission on the number of MoS 2 layers, which by design is random throughout the film. Using a threshold value for the photoemission, we convert the optical response into binary cryptographic keys. We show that the proper selection of this threshold is crucial for maximizing combination randomness and that the optimal value of the threshold is linked directly to the growth process. This study reveals an opportunity for generating robust and versatile security primitives from layered transition metal dichalcogenides.
Marín Gabriel, Miguel A; Olza Fernández, Ibone; Malalana Martínez, Ana M; González Armengod, Carmen; Costarelli, Valeria; Millán Santos, Isabel; Fernández-Cañadas Morillo, Aurora; Pérez Riveiro, Pilar; López Sánchez, Francisco; García Murillo, Lourdes
2015-05-01
Several synthetic peptide manipulations during the time surrounding birth can alter the specific neurohormonal status in the newborn brain. This study is aimed at assessing whether intrapartum oxytocin administration has any effect on primitive neonatal reflexes and determining whether such an effect is dose-dependent. A cohort prospective study was conducted at a tertiary hospital. Mother-infant dyads who received intrapartum oxytocin (n=53) were compared with mother-infant dyads who did not receive intrapartum oxytocin (n=45). Primitive neonatal reflexes (endogenous, antigravity, motor, and rhythmic reflexes) were quantified by analyzing videotaped breastfeeding sessions in a biological nurturing position. Two observers blind to the group assignment and the oxytocin dose analyzed the videotapes and assesed the newborn's state of consciousness according to the Brazelton scale. The release of all rhythmic reflexes (p=0.01), the antigravity reflex (p=0.04), and total primitive neonatal reflexes (p=0.02) in the group exposed to oxytocin was lower than in the group not exposed to oxytocin. No correlations were observed between the dose of oxytocin administered and the percentage of primitive neonatal reflexes released (r=0.03; p=0.82). Intrapartum oxytocin administration might inhibit the expression of several primitive neonatal reflexes associated with breastfeeding. This correlation does not seem to be dose-dependent.
You, Bo; Li, Fang
2016-01-01
This paper is concerned with the long-time behavior of solutions for the three dimensional viscous primitive equations of large-scale moist atmosphere. We prove the existence of a global attractor for the three dimensional viscous primitive equations of large-scale moist atmosphere by asymptotic a priori estimate and construct an exponential attractor by using the smoothing property of the semigroup generated by the three dimensional viscous primitive equations of large-scale moist atmosphere...
Magnin , Loïck
2011-01-01
This dissertation studies two different aspects of two-player interaction in the model of quantum communication and quantum computation.First, we study two cryptographic primitives, that are used as basic blocks to construct sophisticated cryptographic protocols between two players, e.g. identification protocols.The first primitive is ``quantum bit commitment''. This primitive cannot be done in an unconditionally secure way. However, security can be obtained by restraining the power of the tw...
Changes of coat cover in primitive horses living on a reserve.
Stachurska, A; Robovský, J; Bocian, K; Janczarek, I
2015-03-01
Changes in the coat cover are important for mammalian thermoregulation. This is especially true where variable environmental conditions exist throughout the seasons. Coat cover shedding is the replacement of old coat hair with new hair. The process differs in various equids. The aim of the study was to examine the changes in the coat of primitive Polish Konik horses living on a reserve in southeast Poland (50.6319° N). The reserve is located in a temperate climate. The mean temperature is below 0°C in winter (December 8 to March 9) and over 15°C in summer (June 8 to September 8). Five adult mares were included in the study. The study used a specific methodical approach to quantitatively assess coat cover changes. Photos were taken once every 2 wk throughout the whole year to document the state of the mares' coat. MultiScanBase software was used to analyze 260 photos. The percentage of the skin surface covered with short hair in relation to the surface of the body (without the head, neck, and limbs; short hair body [SHB]) was determined. To assess the topography of coat changes, surface parts covered with short hair within 6 regions of the body (shoulder, back, chest, loins, belly, and hindquarters; short hair part [SHP]) were considered separately. The regression coefficient was calculated for the SHB and the air temperature. Correlations in SHP and SHB between the left and right sides of the body were determined. The correlations within the right side of the body concerned particular SHP. As the results show, the coat changes take place at the same time on both sides of the horse's body. In spring, the winter hair is shed, and in the fall, the winter hair grows in longer. High regression (0.901; coat changes. The most important increase of SHB occurs in April and the first half of May, whereas the main decrease of SHB takes place in September. Changes between SHP are highly correlated (0.967-0.994; coat changes demonstrate that the shoulders, back, and loins
Cave men: stone tools, Victorian science, and the 'primitive mind' of deep time.
Pettitt, Paul B; White, Mark J
2011-03-20
Palaeoanthropology, the study of the evolution of humanity, arose in the nineteenth century. Excavations in Europe uncovered a series of archaeological sediments which provided proof that the antiquity of human life on Earth was far longer than the biblical six thousand years, and by the 1880s authors had constructed a basic paradigm of what 'primitive' human life was like. Here we examine the development of Victorian palaeoanthropology for what it reveals of the development of notions of cognitive evolution. It seems that Victorian specialists rarely addressed cognitive evolution explicitly, although several assumptions were generally made that arose from preconceptions derived from contemporary 'primitive' peoples. We identify three main phases of development of notions of the primitive mind in the period.
Caspase-9 has a nonapoptotic function in Xenopus embryonic primitive blood formation.
Tran, Hong Thi; Fransen, Mathias; Dimitrakopoulou, Dionysia; Van Imschoot, Griet; Willemarck, Nicolas; Vleminckx, Kris
2017-07-15
Caspases constitute a family of cysteine proteases centrally involved in programmed cell death, which is an integral part of normal embryonic and fetal development. However, it has become clear that specific caspases also have functions independent of cell death. In order to identify novel apoptotic and nonapoptotic developmental caspase functions, we designed and transgenically integrated novel fluorescent caspase reporter constructs in developing Xenopus embryos and tadpoles. This model organism has an external development, allowing direct and continuous monitoring. These studies uncovered a nonapoptotic role for the initiator caspase-9 in primitive blood formation. Functional experiments further corroborated that caspase-9, but possibly not the executioners caspase-3 and caspase-7, are required for primitive erythropoiesis in the early embryo. These data reveal a novel nonapoptotic function for the initiator caspase-9 and, for the first time, implicate nonapoptotic caspase activity in primitive blood formation. © 2017. Published by The Company of Biologists Ltd.
A close look at the mammalian blastocyst: epiblast and primitive endoderm formation.
Artus, Jérôme; Chazaud, Claire
2014-09-01
During early development, the mammalian embryo undergoes a series of profound changes that lead to the formation of two extraembryonic tissues--the trophectoderm and the primitive endoderm. These tissues encapsulate the pluripotent epiblast at the time of implantation. The current model proposes that the formation of these lineages results from two consecutive binary cell fate decisions. The first controls the formation of the trophectoderm and the inner cell mass, and the second controls the formation of the primitive endoderm and the epiblast within the inner cell mass. While early mammalian embryos develop with extensive plasticity, the embryonic pattern prior to implantation is remarkably reproducible. Here, we review the molecular mechanisms driving the cell fate decision between primitive endoderm and epiblast in the mouse embryo and integrate data from recent studies into the current model of the molecular network regulating the segregation between these lineages and their subsequent differentiation.
Wenz, Holger; Wenz, Ralf; Förster, Alex; Fontana, Johann; Kerl, Hans Ulrich; Groden, Christoph; Scharf, Johann
2015-11-01
Previous studies found higher incidence of persistent primitive arteries in Asian moyamoya (MM) patients than in the general population, which was thought to be a characteristic trait of the MM entity in general. We analyzed incidence of persistent primitive arteries and demographics of patients with European MM treated in one single center. First, we compared our large dataset to existing literature and second, we raised the question whether European MM demonstrates similar high prevalence of persistent primitive arteries as it was previously presented within Asian MM. All European MM on whom revascularization surgery was performed from 1999 to 2013 were included. Demographics and associated diseases were obtained by retrospective chart review. Two independent readers evaluated 122 MM angiograms to determine the occurrence of persistent primitive arteries as well as the Suzuki score. We identified 112 cases with MM disease, 10 with MM syndrome. Mean age at time of diagnosis was 38.2 (range 6-64 years); a peak incidence in early childhood was not observed. Ninety (73.8%) were women, associated systemic diseases were found in four patients. Seven cases (5.7%) presented with unilaterally affected vessels. The majority of patients (71; 58.2%) were graded Suzuki Score 3. One 14-year-old boy with moyamoya presented with a primitive trigeminal artery (0.89%). We did not find a bimodal age distribution, but only a second peak during adulthood. Unlike previous studies on Asian moyamoya patients, our collective does not exhibit a higher prevalence of persistent primitive arteries than the normal population.
Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces
DEFF Research Database (Denmark)
Andersen, Jørgen Ellegaard; Chekhov, Leonid O.; Penner, Robert
2013-01-01
and free energies are convergent for small t and all s as a perturbation of the Gaussian potential, which arises for st=0. This perturbation is computed using the formalism of the topological recursion. The corresponding enumeration of chord diagrams gives at once the number of RNA complexes of a given...... topology as well as the number of cells in Riemann's moduli spaces for bordered surfaces. The free energies are computed here in principle for all genera and explicitly for genera less than four....
Loop equations and topological recursion for the arbitrary-$\\beta$ two-matrix model
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
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.
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
A novel noncommutative KdV-type equation, its recursion operator, and solitons
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.
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.
Presti, Giovambattista; Premarini, Claudio; Leuzzi, Martina; Di Blasi, Melina; Squatrito, Valeria
2017-11-01
The operant was conceptualized by Skinner as a class of behaviors which have common effect on the environment and that, as a class can be shown to vary lawfully in their relations to the other environmental variables, namely antecedents and consequences. And Skinner himself underlined the fact that "operant field is the very field purpose of behavior". The operant offers interesting basic and applied characteristic to conceptualize complex behavior as a recursive process of learning. In this paper we will discuss how the operant concept can be applied in the implementation of software oriented to increase cognitive skills in autistic children and provide an example.
Recursive Utility and the Superneutrality of Money on the Transition Path
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...
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
Painlevé equations, topological type property and reconstruction by the topological recursion
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.
International Nuclear Information System (INIS)
Schek, I.; Wyatt, R.E.
1986-01-01
Molecular multiphoton processes are treated in the Recursive Residue Generation Method (A. Nauts and R.E. Wyatt, Phys. Rev. Lett 51, 2238 (1983)) by converting the molecular-field Hamiltonian matrix into tridiagonal form, using the Lanczos equations. In this study, the self-energies (diagonal) and linking (off-diagaonal) terms in the tridiagonal matrix are obtained by comparing linked moment diagrams in both representations. The dynamics of the source state is introduced and computed in terms of the linked and the irreducible moments
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.)
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
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.
Speed control of induction motor using fuzzy recursive least squares technique
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...
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.
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...
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
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
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.
Earth's early O2 cycle suppressed by primitive continents
Smit, Matthijs A.; Mezger, Klaus
2017-10-01
Free oxygen began to accumulate in Earth's surface environments between 3.0 and 2.4 billion years ago. Links between oxygenation and changes in the composition of continental crust during this time are suspected, but have been difficult to demonstrate. Here we constrain the average composition of the exposed continental crust since 3.7 billion years ago by compiling records of the Cr/U ratio of terrigenous sediments. The resulting record is consistent with a predominantly mafic crust prior to 3.0 billion years ago, followed by a 500- to 700-million-year transition to a crust of modern andesitic composition. Olivine and other Mg-rich minerals in the mafic Archaean crust formed serpentine minerals upon hydration, continuously releasing O2-scavenging agents such as dihydrogen, hydrogen sulfide and methane to the environment. Temporally, the decline in mafic crust capable of such process coincides with the first accumulation of O2 in the oceans, and subsequently the atmosphere. We therefore suggest that Earth's early O2 cycle was ultimately limited by the composition of the exposed upper crust, and remained underdeveloped until modern andesitic continents emerged.
Reexamination of Induction Heating of Primitive Bodies in Protoplanetary Disks
Menzel, Raymond L.; Roberge, Wayne G.
2013-10-01
We reexamine the unipolar induction mechanism for heating asteroids originally proposed in a classic series of papers by Sonett and collaborators. As originally conceived, induction heating is caused by the "motional electric field" that appears in the frame of an asteroid immersed in a fully ionized, magnetized solar wind and drives currents through its interior. However, we point out that classical induction heating contains a subtle conceptual error, in consequence of which the electric field inside the asteroid was calculated incorrectly. The problem is that the motional electric field used by Sonett et al. is the electric field in the freely streaming plasma far from the asteroid; in fact, the motional field vanishes at the asteroid surface for realistic assumptions about the plasma density. In this paper we revisit and improve the induction heating scenario by (1) correcting the conceptual error by self-consistently calculating the electric field in and around the boundary layer at the asteroid-plasma interface; (2) considering weakly ionized plasmas consistent with current ideas about protoplanetary disks; and (3) considering more realistic scenarios that do not require a fully ionized, powerful T Tauri wind in the disk midplane. We present exemplary solutions for two highly idealized flows that show that the interior electric field can either vanish or be comparable to the fields predicted by classical induction depending on the flow geometry. We term the heating driven by these flows "electrodynamic heating," calculate its upper limits, and compare them to heating produced by short-lived radionuclides.
REEXAMINATION OF INDUCTION HEATING OF PRIMITIVE BODIES IN PROTOPLANETARY DISKS
International Nuclear Information System (INIS)
Menzel, Raymond L.; Roberge, Wayne G.
2013-01-01
We reexamine the unipolar induction mechanism for heating asteroids originally proposed in a classic series of papers by Sonett and collaborators. As originally conceived, induction heating is caused by the 'motional electric field' that appears in the frame of an asteroid immersed in a fully ionized, magnetized solar wind and drives currents through its interior. However, we point out that classical induction heating contains a subtle conceptual error, in consequence of which the electric field inside the asteroid was calculated incorrectly. The problem is that the motional electric field used by Sonett et al. is the electric field in the freely streaming plasma far from the asteroid; in fact, the motional field vanishes at the asteroid surface for realistic assumptions about the plasma density. In this paper we revisit and improve the induction heating scenario by (1) correcting the conceptual error by self-consistently calculating the electric field in and around the boundary layer at the asteroid-plasma interface; (2) considering weakly ionized plasmas consistent with current ideas about protoplanetary disks; and (3) considering more realistic scenarios that do not require a fully ionized, powerful T Tauri wind in the disk midplane. We present exemplary solutions for two highly idealized flows that show that the interior electric field can either vanish or be comparable to the fields predicted by classical induction depending on the flow geometry. We term the heating driven by these flows 'electrodynamic heating', calculate its upper limits, and compare them to heating produced by short-lived radionuclides
A mutli-technique search for the most primitive CO chondrites
Alexander, C.M.O'D.; Greenwood, R.C.; Bowden, R.; Gibson, J.M.; Howard, K.T.; Franchi, I.A.
2018-01-01
As part of a study to identify the most primitive COs and to look for weakly altered CMs amongst the COs, we have conducted a multi-technique study of 16 Antarctic meteorites that had been classified as primitive COs. For this study, we have determined: (1) the bulk H, C and N abundances and isotopes, (2) bulk O isotopic compositions, (3) bulk modal mineralogies, and (4) for some selected samples the abundances and compositions of their insoluble organic matter (IOM). Two of the 16 meteorites...
Directory of Open Access Journals (Sweden)
Satyashiva Munjal
2017-01-01
Full Text Available Primary spinal primitive neuroectodermal tumor (psPNET is a rare entity with few cases reported in literature. We report a case of a 50-year-old female who presented to us with paraplegia and was diagnosed with extradural dorsal spine psPNET. The diagnosis was not suspected at presentation or on radiology but was established on histopathological examination. It is important to distinguish it from central nervous system primitive neuroectodermal tumors and from other spinal tumors since it follows a different clinical course and therapeutic outcome.
A Synoptic of Software Implementation for Shift Registers Based on 16th Degree Primitive Polynomials
Directory of Open Access Journals (Sweden)
Mirella Amelia Mioc
2016-08-01
Full Text Available Almost all of the major applications in the specific Fields of Communication used a well-known device called Linear Feedback Shift Register. Usually LFSR functions in a Galois Field GF(2n, meaning that all the operations are done with arithmetic modulo n degree Irreducible and especially Primitive Polynomials. Storing data in Galois Fields allows effective and manageable manipulation, mainly in computer cryptographic applications. The analysis of functioning for Primitive Polynomials of 16th degree shows that almost all the obtained results are in the same time distribution.
Zanotti, Olindo; Dumbser, Michael
2016-01-01
We present a new version of conservative ADER-WENO finite volume schemes, in which both the high order spatial reconstruction as well as the time evolution of the reconstruction polynomials in the local space-time predictor stage are performed in primitive variables, rather than in conserved ones. To obtain a conservative method, the underlying finite volume scheme is still written in terms of the cell averages of the conserved quantities. Therefore, our new approach performs the spatial WENO reconstruction twice: the first WENO reconstruction is carried out on the known cell averages of the conservative variables. The WENO polynomials are then used at the cell centers to compute point values of the conserved variables, which are subsequently converted into point values of the primitive variables. This is the only place where the conversion from conservative to primitive variables is needed in the new scheme. Then, a second WENO reconstruction is performed on the point values of the primitive variables to obtain piecewise high order reconstruction polynomials of the primitive variables. The reconstruction polynomials are subsequently evolved in time with a novel space-time finite element predictor that is directly applied to the governing PDE written in primitive form. The resulting space-time polynomials of the primitive variables can then be directly used as input for the numerical fluxes at the cell boundaries in the underlying conservative finite volume scheme. Hence, the number of necessary conversions from the conserved to the primitive variables is reduced to just one single conversion at each cell center. We have verified the validity of the new approach over a wide range of hyperbolic systems, including the classical Euler equations of gas dynamics, the special relativistic hydrodynamics (RHD) and ideal magnetohydrodynamics (RMHD) equations, as well as the Baer-Nunziato model for compressible two-phase flows. In all cases we have noticed that the new ADER
A PICKED SAMPLE TO THE FOOTPRINT OF PRIMITIVE INDIVIDUALISM OF RECENT DATE ART: BASQUIAT
Directory of Open Access Journals (Sweden)
Ozgur TOSUN
2015-09-01
Full Text Available Through the culturel history, meaning of art and art object have been queried and these researchs have emerged thesis and antithesis. Fundamentaly, this article aim to comparison interaction and/or conflict with mathematical rationalist art and primitive/heuristical/romantic art. In this context, effects of primitive and experssive art to the nowadays’ art perception are examined to envolve out of Basquiat and neo expressionism. Entailment of expressive art in contemporary art is researched for answers for questions in terms of cultural and genetic heritage of art and instinctive origins of making art object.
National Research Council Canada - National Science Library
Cook, James
1998-01-01
...; all the other voyagers are tried and true initiates. His brotherhood lives under arcane rules -- one may not eat beans, for instance -- and dedicates itself to discovering mathematical regularity in nature...
International Nuclear Information System (INIS)
Berg, B.A.
1996-01-01
Recently multicanonical Monte Carlo (MC) sampling and closely related methods have received much attention. Considerable gains have been achieved in situations with open-quotes supercriticalclose quotes slowing down, such as first-order transition, and systems with conflicting constrains, for instance, spin glasses or proteins. In the multicanonical ensemble one samples configurations such that exact reconstruction of canonical expectation values becomes feasible for a desired temperature range. This requires a broad energy distribution, and leaves innovative freedom concerning the optimal shape. Considerable practical experience exists only for the uniform energy distribution
Smith, Scott G.
2015-01-01
In this article, Scott Smith presents an innocent problem (Problem 12 of the May 2001 Calendar from "Mathematics Teacher" ("MT" May 2001, vol. 94, no. 5, p. 384) that was transformed by several timely "what if?" questions into a rewarding investigation of some interesting mathematics. These investigations led to two…
Upper Gastrointestinal (GI) Series
... standard barium upper GI series, which uses only barium a double-contrast upper GI series, which uses both air and ... evenly coat your upper GI tract with the barium. If you are having a double-contrast study, you will swallow gas-forming crystals that ...
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.
Directory of Open Access Journals (Sweden)
Reem Yassine
2016-12-01
Full Text Available The frequency response function is a quantitative measure used in structural analysis and engineering design; hence, it is targeted for accuracy. For a large structure, a high number of substructures, also called cells, must be considered, which will lead to a high amount of computational time. In this paper, the recursive method, a finite element method, is used for computing the frequency response function, independent of the number of cells with much lesser time costs. The fundamental principle is eliminating the internal degrees of freedom that are at the interface between a cell and its succeeding one. The method is applied solely for free (no load nodes. Based on the boundary and interior degrees of freedom, the global dynamic stiffness matrix is computed by means of products and inverses resulting with a dimension the same as that for one cell. The recursive method is demonstrated on periodic structures (cranes and buildings under harmonic vibrations. The method yielded a satisfying time decrease with a maximum time ratio of 1 18 and a percentage difference of 19%, in comparison with the conventional finite element method. Close values were attained at low and very high frequencies; the analysis is supported for two types of materials (steel and plastic. The method maintained its efficiency with a high number of forces, excluding the case when all of the nodes are under loads.
Image defog algorithm based on open close filter and gradient domain recursive bilateral filter
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.
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
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.
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.
WKB solutions of difference equations and reconstruction by the topological recursion
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 .
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.
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.
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)
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
Stability of recursive out-of-sequence measurement filters: an open problem
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.
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.
Ball, Ian R.
1977-01-01
A primitive freshwater planarian, Eviella hynesae gen. et sp. nov. is described from Australia. It is characterized by its lack of eyes and pigment, possession of caudally branched oviducts, and fully fused testes. Although a primary bursa is absent, its function being taken over by the modified
Growth and sedimentation of dust grains in the primitive solar nebular
International Nuclear Information System (INIS)
Battaglia, A.
1987-01-01
Formation of the planets in the solar system is envisioned to occur via a gravitational instability in a thin layer of dust located at the midplane of the primitive solar nebula. The break-up of the dust layer gives rise to seed plants (planetesimals) that, through successive collisions, eventually form the present-day planets. This thesis addresses the problem of the formation of the dust layer, beginning with a configuration in which the dust particles are uniformly mixed with the nebula's turbulent gas. To describe the properties of turbulence in the primitive solar nebula, models by Canuto et al. (1987) and by Cabot et al. (1987) are used. The available results concerning calculation of the velocity of particles embedded in a turbulent fluid were found to be unsatisfactory; therefore, a new formalism was developed to express the latter quantity in terms of the properties of the turbulence in the fluid. Following the space-time evolution of the grains, formalism was developed that simulates the simultaneous processes of collisions and sedimentation of the dust grains in the primitive solar nebula. It is concluded that, for the model of the primitive solar nebula considered, the formation of a dust layer at midplane is very unlikely
Aguayo-Ortiz, A; Mendoza, S; Olvera, D
2018-01-01
In this article we develop a Primitive Variable Recovery Scheme (PVRS) to solve any system of coupled differential conservative equations. This method obtains directly the primitive variables applying the chain rule to the time term of the conservative equations. With this, a traditional finite volume method for the flux is applied in order avoid violation of both, the entropy and "Rankine-Hugoniot" jump conditions. The time evolution is then computed using a forward finite difference scheme. This numerical technique evades the recovery of the primitive vector by solving an algebraic system of equations as it is often used and so, it generalises standard techniques to solve these kind of coupled systems. The article is presented bearing in mind special relativistic hydrodynamic numerical schemes with an added pedagogical view in the appendix section in order to easily comprehend the PVRS. We present the convergence of the method for standard shock-tube problems of special relativistic hydrodynamics and a graphical visualisation of the errors using the fluctuations of the numerical values with respect to exact analytic solutions. The PVRS circumvents the sometimes arduous computation that arises from standard numerical methods techniques, which obtain the desired primitive vector solution through an algebraic polynomial of the charges.
Farey Statistics in Time n^{2/3} and Counting Primitive Lattice Points in Polygons
Patrascu, Mihai
2007-01-01
We present algorithms for computing ranks and order statistics in the Farey sequence, taking time O (n^{2/3}). This improves on the recent algorithms of Pawlewicz [European Symp. Alg. 2007], running in time O (n^{3/4}). We also initiate the study of a more general algorithmic problem: counting primitive lattice points in planar shapes.
Vermeulen, Jeroen F; van Hecke, Wim; Spliet, Wim G M; Villacorta Hidalgo, José; Fisch, Paul; Broekhuizen, Roel; Bovenschen, Niels
2016-01-01
BACKGROUND: Central nervous system (CNS) primitive neuroectodermal tumors (PNETs) are malignant primary brain tumors that occur in young infants. Using current standard therapy, up to 80% of the children still dies from recurrent disease. Cellular immunotherapy might be key to improve overall
On the small time asymptotics of 3D stochastic primitive equations
Dong, Zhao; Zhang, Rangrang
2017-01-01
In this paper, we establish a small time large deviation principle for the strong solution of 3D stochastic primitive equations driven by multiplicative noise. Both the small noise and the small, but highly nonlinear, unbounded nonlinear terms should be taken into consideration.
de Bont, Judith M.; den Boer, Monique L.; Kros, Johan M.; Passier, Monique M. C. J.; Reddinglus, Roel E.; Smitt, Peter A. E. Sillevis; Luider, Theo M.; Pieters, Rob
The aim of this study was to identify aberrantly expressed proteins in pediatric primitive neuroectodermal tumors (PNETs) and ependymornas. Tumor tissue of 29 PNET and 12 ependymoma patients was subjected to 2-dimensional difference gel electrophoresis. Gel analysis resulted in 79 protein spots
the reception of the deuteronomic social law in the primitive church
African Journals Online (AJOL)
of the Primitive Church's social and ecclesiological (self-)understanding, this study highlights ... have been written by Moses as well, the Book of Deuteronomy presents itself overall as a .... to reform society reached their limits when they became economically, socially and ..... sins of adultery and prostitution. In light of these ...
Primitive Liquid Water of the Solar System in an Aqueous Altered Carbonaceous Chondrite
Tsuchiyama, A.; Miyake, A.; Kitayama, A.; Matsuno, J.; Takeuchi, A.; Uesugi, K.; Suzuki, Y.; Nakano, T.; Zolensky, M. E.
2016-01-01
Non-destructive 3D observations of the aqueous altered CM chondrite Sutter's Mill using scanning imaging x-ray microscopy (SIXM) showed that some of calcite and enstatite grains contain two-phase inclusion, which is most probably composed of liquid water and bubbles. This water should be primitive water responsible for aqueous alteration in an asteroid in the early solar system.
Primitivity and weak distributivity in near rings and matrix near rings
International Nuclear Information System (INIS)
Abbasi, S.J.
1993-08-01
This paper shows the structure of matrix near ring constructed over a weakly distributive and primative near ring. It is proved that a weakly distributive primitive near ring is a ring and the matrix near rings constructed over it is also a bag. (author). 14 refs
Fermat’s ‘primitive solutions’ and some arithmetic of elliptic curves
Top, Jaap
1993-01-01
In his work on Diophantine equations of the form y2=ax4+bx3+cx2+dx+e, Fermat introduced the notion of primitive solutions. In this expository note we intend to interpret this notion more geometrically, and explain what it means in terms of the arithmetic of elliptic curves. The specific equation
Cohesion between two clay lamellae: From Primitive Model to Full Molecular Simulation
International Nuclear Information System (INIS)
Carrier, Benoit; Vandamme, Matthieu; Pellenq, Roland; Van Damme, Henri
2012-01-01
Document available in extended abstract form only. The objective of this work is to investigate the range of validity of various models to describe accurately the cohesion between two charged clay lamellae. These models, in order of increasing complexity, are the Derjaguin-Landau-Verwey-Overbeek (DLVO) theory, the primitive model, the explicit solvent primitive model and the full molecular model. We aim at providing a clear picture of which physical mechanisms play a significant role for various interlayer spacings, surface charges and cationic charges. The up-scaling of the mechanical properties starting from the lamellar microstructure of a smectite is usually performed within the framework of the DLVO theory. In this case, the interaction between two charged lamellae with cations between them is the sum of the repulsive double layer electrostatic interaction and of the attractive Van der Waals interaction. However, the Primitive Model shows that concentration fluctuations of counter-ions can generate a strongly attractive ionic correlation force. The Primitive Model is a Monte-Carlo simulation of hydrated counter-ions between two infinite charges surfaces and the water is implicitly modeled by scaling all electrostatic interactions by the dielectric permittivity of bulk water. Nevertheless, for very small inter-layer spacings (1 nm), molecular simulations and experiments show that water is organized in a layered structure and does not behave like bulk water. Therefore, we investigate the role of the solvent in the cohesion of clay lamellae. For this purpose, we use a modified version of the original Primitive Model in which the solvent is modeled by point-dipoles: This model is called the Explicit Solvent Primitive Model. We consider four different systems: A Na + -montmorillonite, a Ca 2+ -montmorillonite, a Na + -vermiculite, a Ca 2+ -vermiculite. The vermiculite layers are twice as charged as the montmorillonite layers. We use a full molecular model as a
International Nuclear Information System (INIS)
Kara, Ismail O.; Sahin, B.; Gonlusen, G.; Ergin, M.; Erdogan, S.
2005-01-01
Within soft-tissue sarcoma, primitive neuroectodermal tumors have been shown to cover a wide spectrum of small round cell sarcomas, including Ewings sarcomas (Es) and primitive neuroectodermal tumors (PET). The role of the stem cell factor/kit pathway has been investigated in different human tumors especially in chronic metallically leukemia and gastrointestinal stromal tumor and an autocrine loop has been assumed in small cell lung carcinoma, and recently in Es and PET. Our aim is to investigate the c-kit expression in Es and PET and also to assessed if c-kit has any role in disease process. We thoroughly searched the archives of the Department of Pathology, Faculty of Medicine, Cukurova University Turkey, between 2000 and 2004; and found 14 ES and 14 PNET paraffin embedded tissues. We carried out the detection of the c-kit expression by immunohistochemical staining. The patients median age was 23.7 +/-14.6 (12 male and 16 female). Five were diagnosed as metastatic disease whereas 23 were diagnosed as non-metastatic disease at admission. The mean follow up period was 38.9 +/- 22.3 months. The main localization of the disease was lower extremity (32.1%), and others were as follows: head and neck 25%, thorax and abdomen 14.3%, pelvic and upper extremity 7.1% (11 were localized skeletal and 17 were extraskeletal). According to treatment modalities, 10 were treated with surgery alone, 11 with surgery and chemotherapy, and 7 with surgery, radiation therapy and also with chemotherapy. The primary tumor was lower than 5 cm in its dimension in 21 patients. While in 5 patients, tumor was more than 5 cm but did not exceed 10 cm, it was >10 cm in 2 patients. The c-kit expression was positive in 7 patients both cytoplasmic and membranously, whereas 8 patients were positive cytoplasmically. In 5 PNET patients, c-kit expression were stained immunohistochemically in over 50% and in 3 of ES patients. There was no significant correlation between c-kit expression and gender
New hybrid voxelized/analytical primitive in Monte Carlo simulations for medical applications
International Nuclear Information System (INIS)
Bert, Julien; Lemaréchal, Yannick; Visvikis, Dimitris
2016-01-01
Monte Carlo simulations (MCS) applied in particle physics play a key role in medical imaging and particle therapy. In such simulations, particles are transported through voxelized phantoms derived from predominantly patient CT images. However, such voxelized object representation limits the incorporation of fine elements, such as artificial implants from CAD modeling or anatomical and functional details extracted from other imaging modalities. In this work we propose a new hYbrid Voxelized/ANalytical primitive (YVAN) that combines both voxelized and analytical object descriptions within the same MCS, without the need to simultaneously run two parallel simulations, which is the current gold standard methodology. Given that YVAN is simply a new primitive object, it does not require any modifications on the underlying MC navigation code. The new proposed primitive was assessed through a first simple MCS. Results from the YVAN primitive were compared against an MCS using a pure analytical geometry and the layer mass geometry concept. A perfect agreement was found between these simulations, leading to the conclusion that the new hybrid primitive is able to accurately and efficiently handle phantoms defined by a mixture of voxelized and analytical objects. In addition, two application-based evaluation studies in coronary angiography and intra-operative radiotherapy showed that the use of YVAN was 6.5% and 12.2% faster than the layered mass geometry method, respectively, without any associated loss of accuracy. However, the simplification advantages and differences in computational time improvements obtained with YVAN depend on the relative proportion of the analytical and voxelized structures used in the simulation as well as the size and number of triangles used in the description of the analytical object meshes. (paper)
New hybrid voxelized/analytical primitive in Monte Carlo simulations for medical applications.
Bert, Julien; Lemaréchal, Yannick; Visvikis, Dimitris
2016-05-07
Monte Carlo simulations (MCS) applied in particle physics play a key role in medical imaging and particle therapy. In such simulations, particles are transported through voxelized phantoms derived from predominantly patient CT images. However, such voxelized object representation limits the incorporation of fine elements, such as artificial implants from CAD modeling or anatomical and functional details extracted from other imaging modalities. In this work we propose a new hYbrid Voxelized/ANalytical primitive (YVAN) that combines both voxelized and analytical object descriptions within the same MCS, without the need to simultaneously run two parallel simulations, which is the current gold standard methodology. Given that YVAN is simply a new primitive object, it does not require any modifications on the underlying MC navigation code. The new proposed primitive was assessed through a first simple MCS. Results from the YVAN primitive were compared against an MCS using a pure analytical geometry and the layer mass geometry concept. A perfect agreement was found between these simulations, leading to the conclusion that the new hybrid primitive is able to accurately and efficiently handle phantoms defined by a mixture of voxelized and analytical objects. In addition, two application-based evaluation studies in coronary angiography and intra-operative radiotherapy showed that the use of YVAN was 6.5% and 12.2% faster than the layered mass geometry method, respectively, without any associated loss of accuracy. However, the simplification advantages and differences in computational time improvements obtained with YVAN depend on the relative proportion of the analytical and voxelized structures used in the simulation as well as the size and number of triangles used in the description of the analytical object meshes.
Moore, Robert; Cai, Kathy Q; Escudero, Diogo O; Xu, Xiang-Xi
2009-09-01
The classical cell sorting experiments undertaken by Townes and Holtfreter described the intrinsic propensity of dissociated embryonic cells to self-organize and reconcile into their original embryonic germ layers with characteristic histotypic positioning. Steinberg presented the differential adhesion hypothesis to explain these patterning phenomena. Here, we have reappraised these issues by implementing embryoid bodies to model the patterning of epiblast and primitive endoderm layers. We have used combinations of embryonic stem (ES) cells and their derivatives differentiated by retinoic acid treatment to model epiblast and endoderm cells, and wild-type or E-cadherin null cells to represent strongly or weakly adherent cells, respectively. One cell type was fluorescently labeled and reconstituted with another heterotypically to generate chimeric embryoid bodies, and cell sorting was tracked by time-lapse video microscopy and confirmed by immunostaining. When undifferentiated wild-type and E-cadherin null ES cells were mixed, the resulting cell aggregates consisted of a core of wild-type cells surrounded by loosely associated E-cadherin null cells, consistent with the differential adhesion hypothesis. However, when mixed with undifferentiated ES cells, the differentiated primitive endoderm-like cells sorted to the surface to form a primitive endoderm layer irrespective of cell-adhesive strength, contradicting the differential adhesion hypothesis. We propose that the primitive endoderm cells reach the surface by random movement, and subsequently the cells generate an apical/basal polarity that prevents reentry. Thus, the ability to generate epithelial polarity, rather than adhesive affinity, determines the surface positioning of the primitive endoderm cells. (c) 2009 Wiley-Liss, Inc.
Modelling 3D spatial objects in a geo-DBMS using a 3D primitive
Arens, Călin; Stoter, Jantien; van Oosterom, Peter
2005-03-01
There is a growing interest in modelling the world in three dimensions, both in applications and in science. At the same time, geographical information systems are changing into integrated architecture in which administrative and spatial data are maintained in one environment. It is for this reason that mainstream Data Base Management Systems (DBMSs) have implemented spatial data types according to the 'Simple Feature Specifications for SQL', described by the OpenGeospatial Consortium. However, these specifications are 2D, as indeed are the implementations in DBMSs. At the Section GIS Technology of TU Delft, research has been carried out in which a 3D primitive was implemented in a DBMS (Oracle Spatial). To explore the possibilities and complications, a fairly simple 3D primitive was chosen to start with: a polyhedron. In the future the study will be extended with more complex primitives, the ultimate aim being to build 3D models with features closer to the real world. Besides the data structure, a validation function was developed to check the geometric accuracy of the data. Rules for validation were established and translated into prototype implementations with the aid of literature. In order to manipulate the data, a list of useful 3D functions was specified. Most of these were translated into algorithms, which were implemented in the DBMS. The algorithms for these functions were obtained from the relevant literature. The research also comprised a comparative performance test on spatial indexing in 2D and 3D, using an R-tree. Finally, existing software was used to visualize 3D objects structured with the implemented 3D primitive. This research is a first attempt to implement a true 3D primitive in a DBMS. Future research will focus on extending and improving the implementations and on optimizing maintenance and query of 3D objects in DBMSs.
Directory of Open Access Journals (Sweden)
Elmar eRückert
2013-10-01
Full Text Available A salient feature of human motor skill learning is the ability to exploitsimilarities across related tasks.In biological motor control, it has been hypothesized that muscle synergies,coherent activations of groups of muscles, allow for exploiting shared knowledge.Recent studies have shown that a rich set of complex motor skills can be generated bya combination of a small number of muscle synergies.In robotics, dynamic movement primitives are commonlyused for motor skill learning. This machine learning approach implements a stable attractor systemthat facilitates learning and it can be used in high-dimensional continuous spaces. However, it does not allow for reusing shared knowledge, i.e. for each task an individual set of parameters has to be learned.We propose a novel movement primitive representationthat employs parametrized basis functions, which combines the benefits of muscle synergiesand dynamic movement primitives. For each task asuperposition of synergies modulates a stable attractor system.This approach leads to a compact representation of multiple motor skills andat the same time enables efficient learning in high-dimensional continuous systems.The movement representation supports discrete and rhythmic movements andin particular includes the dynamic movement primitive approach as a special case.We demonstrate the feasibility of the movement representation in three multi-task learning simulated scenarios.First, the characteristics of the proposed representation are illustrated in a point-mass task.Second, in complex humanoid walking experiments,multiple walking patterns with different step heights are learned robustly and efficiently.Finally, in a multi-directional reaching task simulated with a musculoskeletal modelof the human arm, we show how the proposed movement primitives can be used tolearn appropriate muscle excitation patterns and to generalize effectively to new reaching skills.
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
Klein, Lauren R; Money, Joel; Maharaj, Kaveesh; Robinson, Aaron; Lai, Tarissa; Driver, Brian E
2017-11-01
Assessing the likelihood of a variceal versus nonvariceal source of upper gastrointestinal bleeding (UGIB) guides therapy, but can be difficult to determine on clinical grounds. The objective of this study was to determine if there are easily ascertainable clinical and laboratory findings that can identify a patient as low risk for a variceal source of hemorrhage. This was a retrospective cohort study of adult ED patients with UGIB between January 2008 and December 2014 who had upper endoscopy performed during hospitalization. Clinical and laboratory data were abstracted from the medical record. The source of the UGIB was defined as variceal or nonvariceal based on endoscopic reports. Binary recursive partitioning was utilized to create a clinical decision rule. The rule was internally validated and test characteristics were calculated with 1,000 bootstrap replications. A total of 719 patients were identified; mean age was 55 years and 61% were male. There were 71 (10%) patients with a variceal UGIB identified on endoscopy. Binary recursive partitioning yielded a two-step decision rule (platelet count > 200 × 10 9 /L and an international normalized ratio [INR] study must be externally validated before widespread use, patients presenting to the ED with an acute UGIB with platelet count of >200 × 10 9 /L and an INR of upper gastrointestinal hemorrhage. © 2017 by the Society for Academic Emergency Medicine.
Directory of Open Access Journals (Sweden)
Snezhana Georgieva Gocheva-Ilieva
2013-01-01
Full Text Available There are obtained integral form and recurrence representations for some Fourier series and connected with them Favard constants. The method is based on preliminary integration of Fourier series which permits to establish general recursion formulas for Favard constants. This gives the opportunity for effective summation of infinite series and calculation of some classes of multiple singular integrals by the Favard constants.
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.
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…
Mori, Miki
2013-01-01
This article discusses my (recursive) process of theory building and the relationship between research, teaching, and theory development for graduate students. It shows how graduate students can reshape their conceptual frameworks not only through course work, but also through researching classes they teach. Specifically, while analyzing the…
Packet loss replacement in voip using a recursive low-order autoregressive modelbased speech
International Nuclear Information System (INIS)
Miralavi, Seyed Reza; Ghorshi, Seyed; Mortazavi, Mohammad; Choupan, Jeiran
2011-01-01
In real-time packet-based communication systems one major problem is misrouted or delayed packets which results in degraded perceived voice quality. When some speech packets are not available on time, the packet is known as lost packet in real-time communication systems. The easiest task of a network terminal receiver is to replace silence for the duration of lost speech segments. In a high quality communication system in order to avoid quality reduction due to packet loss a suitable method and/or algorithm is needed to replace the missing segments of speech. In this paper, we introduce a recursive low order autoregressive (AR) model for replacement of lost speech segment. The evaluation results show that this method has a lower mean square error (MSE) and low complexity compared to the other efficient methods like high-order AR model without any substantial degradation in perceived voice quality.
TouchGrid: Touchpad pointing by recursively mapping taps to smaller display regions
DEFF Research Database (Denmark)
Hertzum, Morten; Hornbæk, Kasper
2005-01-01
Touchpad devices are widely used but lacking in pointing efficiency. The TouchGrid, an instance of what we term cell cursors, replaces moving the cursor through dragging the finger on a touchpad with tapping in different regions of the touchpad. The touchpad regions are recursively mapped...... to smaller display regions and thereby enable high-precision pointing without requiring high tapping precision. In an experiment, six subjects used the TouchGrid and a standard touchpad across different numbers of targets, distances to targets, and target widths. Whereas standard touchpad operation follows...... Fitts law, target selection time with the TouchGrid is a linear function of the required number of taps. The TouchGrid was significantly faster for small targets and for tasks requiring one tap, and marginally faster for two-tap tasks. Error rates tended to be higher with the TouchGrid than...
Towards Interactive Construction of Topical Hierarchy: A Recursive Tensor Decomposition Approach.
Wang, Chi; Liu, Xueqing; Song, Yanglei; Han, Jiawei
2015-08-01
Automatic construction of user-desired topical hierarchies over large volumes of text data is a highly desirable but challenging task. This study proposes to give users freedom to construct topical hierarchies via interactive operations such as expanding a branch and merging several branches. Existing hierarchical topic modeling techniques are inadequate for this purpose because (1) they cannot consistently preserve the topics when the hierarchy structure is modified; and (2) the slow inference prevents swift response to user requests. In this study, we propose a novel method, called STROD, that allows efficient and consistent modification of topic hierarchies, based on a recursive generative model and a scalable tensor decomposition inference algorithm with theoretical performance guarantee. Empirical evaluation shows that STROD reduces the runtime of construction by several orders of magnitude, while generating consistent and quality hierarchies.
Efficient Implementation of the Riccati Recursion for Solving Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is typically the main computational effort at each iteration....... In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky...... factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver....
Schilder, J.; Ellenbroek, M.; de Boer, A.
2017-12-01
In this work, the floating frame of reference formulation is used to create a flexible multibody model of slender offshore structures such as pipelines and risers. It is shown that due to the chain-like topology of the considered structures, the equation of motion can be expressed in terms of absolute interface coordinates. In the presented form, kinematic constraint equations are satisfied explicitly and the Lagrange multipliers are eliminated from the equations. Hence, the structures can be conveniently coupled to finite element or multibody models of for example seabed and vessel. The chain-like topology enables the efficient use of recursive solution procedures for both transient dynamic analysis and equilibrium analysis. For this, the transfer matrix method is used. In order to improve the convergence of the equilibrium analysis, the analytical solution of an ideal catenary is used as an initial configuration, reducing the number of required iterations.
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.
A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems
Directory of Open Access Journals (Sweden)
White Michael S
2003-01-01
Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.
Design of 2-D Recursive Filters Using Self-adaptive Mutation Differential Evolution Algorithm
Directory of Open Access Journals (Sweden)
Lianghong Wu
2011-08-01
Full Text Available This paper investigates a novel approach to the design of two-dimensional recursive digital filters using differential evolution (DE algorithm. The design task is reformulated as a constrained minimization problem and is solved by an Self-adaptive Mutation DE algorithm (SAMDE, which adopts an adaptive mutation operator that combines with the advantages of the DE/rand/1/bin strategy and the DE/best/2/bin strategy. As a result, its convergence performance is improved greatly. Numerical experiment results confirm the conclusion. The proposedSAMDE approach is effectively applied to test a numerical example and is compared with previous design methods. The computational experiments show that the SAMDE approach can obtain better results than previous design methods.
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.
Tilton, James C.; Plaza, Antonio J. (Editor); Chang, Chein-I. (Editor)
2008-01-01
The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.
Zhang, Ling; Cai, Yunlong; Li, Chunguang; de Lamare, Rodrigo C.
2017-12-01
In this work, we present low-complexity variable forgetting factor (VFF) techniques for diffusion recursive least squares (DRLS) algorithms. Particularly, we propose low-complexity VFF-DRLS algorithms for distributed parameter and spectrum estimation in sensor networks. For the proposed algorithms, they can adjust the forgetting factor automatically according to the posteriori error signal. We develop detailed analyses in terms of mean and mean square performance for the proposed algorithms and derive mathematical expressions for the mean square deviation (MSD) and the excess mean square error (EMSE). The simulation results show that the proposed low-complexity VFF-DRLS algorithms achieve superior performance to the existing DRLS algorithm with fixed forgetting factor when applied to scenarios of distributed parameter and spectrum estimation. Besides, the simulation results also demonstrate a good match for our proposed analytical expressions.
Probabilistic forecasting of the solar irradiance with recursive ARMA and GARCH models
DEFF Research Database (Denmark)
David, M.; Ramahatana, F.; Trombe, Pierre-Julien
2016-01-01
Forecasting of the solar irradiance is a key feature in order to increase the penetration rate of solar energy into the energy grids. Indeed, the anticipation of the fluctuations of the solar renewables allows a better management of the production means of electricity and a better operation...... sky index show some similarities with that of financial time series. The aim of this paper is to assess the performances of a commonly used combination of two linear models (ARMA and GARCH) in econometrics in order to provide probabilistic forecasts of solar irradiance. In addition, a recursive...... regarding the statistical distribution of the error, the reliability of the probabilistic forecasts stands in the same order of magnitude as other works done in the field of solar forecasting....
Estimation of the blood velocity spectrum using a recursive lattice filter
DEFF Research Database (Denmark)
Jensen, Jørgen Arendt; Buelund, Claus; Jørgensen, Allan
1996-01-01
acquired for showing the blood velocity distribution are inherently non-stationary, due to the pulsatility of the flow. All current signal processing schemes assume that the signal is stationary within the window of analysis, although this is an approximation. In this paper a recursive least......-stationarity are incorporated through an exponential decay factor, that sets the exponential horizon of the filter. A factor close to 1 gives a long horizon with low variance estimates, but can not track a highly non-stationary flow. Setting the factor is therefore a compromise between estimate variance and the filter...... with the actual distributions that always will be smooth. Setting the exponential decay factor to 0.99 gives satisfactory results for in-vivo data from the carotid artery. The filter can easily be implemented using a standard fixed-point signal processing chip for real-time processing...
System Simulation by Recursive Feedback: Coupling a Set of Stand-Alone Subsystem Simulations
Nixon, D. D.
2001-01-01
Conventional construction of digital dynamic system simulations often involves collecting differential equations that model each subsystem, arran g them to a standard form, and obtaining their numerical gin solution as a single coupled, total-system simultaneous set. Simulation by numerical coupling of independent stand-alone subsimulations is a fundamentally different approach that is attractive because, among other things, the architecture naturally facilitates high fidelity, broad scope, and discipline independence. Recursive feedback is defined and discussed as a candidate approach to multidiscipline dynamic system simulation by numerical coupling of self-contained, single-discipline subsystem simulations. A satellite motion example containing three subsystems (orbit dynamics, attitude dynamics, and aerodynamics) has been defined and constructed using this approach. Conventional solution methods are used in the subsystem simulations. Distributed and centralized implementations of coupling have been considered. Numerical results are evaluated by direct comparison with a standard total-system, simultaneous-solution approach.
International Nuclear Information System (INIS)
Rodrigues, George; Lukka, Himu; Warde, Padraig; Brundage, Michael; Souhami, Luis; Crook, Juanita; Cury, Fabio; Catton, Charles; Mok, Gary; Martin, Andre-Guy; Vigneault, Eric; Morris, Jim; Warner, Andrew; Gonzalez Maldonado, Sandra; Pickles, Tom
2013-01-01
Background: The Genitourinary Radiation Oncologists of Canada (GUROC) published a three-group risk stratification (RS) system to assist prostate cancer decision-making in 2001. The objective of this project is to use the ProCaRS database to statistically model the predictive accuracy and clinical utility of a proposed new multi-group RS schema. Methods: The RS analyses utilized the ProCaRS database that consists of 7974 patients from four Canadian institutions. Recursive partitioning analysis (RPA) was utilized to explore the sub-stratification of groups defined by the existing three-group GUROC scheme. 10-fold cross-validated C-indices and the Net Reclassification Index were both used to assess multivariable models and compare the predictive accuracy of existing and proposed RS systems, respectively. Results: The recursive partitioning analysis has suggested that the existing GUROC classification system could be altered to accommodate as many as six separate and statistical unique groups based on differences in BFFS (C-index 0.67 and AUC 0.70). GUROC low-risk patients would be divided into new favorable-low and low-risk groups based on PSA ⩽6 and PSA >6. GUROC intermediate-risk patients can be subclassified into low-intermediate and high-intermediate groups. GUROC high-intermediate-risk is defined as existing GUROC intermediate-risk with PSA >=10 AND either T2b/c disease or T1T2a disease with Gleason 7. GUROC high-risk patients would be subclassified into an additional extreme-risk group (GUROC high-risk AND (positive cores ⩾87.5% OR PSA >30). Conclusions: Proposed RS subcategories have been identified by a RPA of the ProCaRS database
Exact Calculation of the Thermodynamics of Biomacromolecules on Cubic Recursive Lattice.
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.
Directory of Open Access Journals (Sweden)
Man Zhu
2017-03-01
Full Text Available Determination of ship maneuvering models is a tough task of ship maneuverability prediction. Among several prime approaches of estimating ship maneuvering models, system identification combined with the full-scale or free- running model test is preferred. In this contribution, real-time system identification programs using recursive identification method, such as the recursive least square method (RLS, are exerted for on-line identification of ship maneuvering models. However, this method seriously depends on the objects of study and initial values of identified parameters. To overcome this, an intelligent technology, i.e., support vector machines (SVM, is firstly used to estimate initial values of the identified parameters with finite samples. As real measured motion data of the Mariner class ship always involve noise from sensors and external disturbances, the zigzag simulation test data include a substantial quantity of Gaussian white noise. Wavelet method and empirical mode decomposition (EMD are used to filter the data corrupted by noise, respectively. The choice of the sample number for SVM to decide initial values of identified parameters is extensively discussed and analyzed. With de-noised motion data as input-output training samples, parameters of ship maneuvering models are estimated using RLS and SVM-RLS, respectively. The comparison between identification results and true values of parameters demonstrates that both the identified ship maneuvering models from RLS and SVM-RLS have reasonable agreements with simulated motions of the ship, and the increment of the sample for SVM positively affects the identification results. Furthermore, SVM-RLS using data de-noised by EMD shows the highest accuracy and best convergence.
Recursive SVM feature selection and sample classification for mass-spectrometry and microarray data
Directory of Open Access Journals (Sweden)
Harris Lyndsay N
2006-04-01
Full Text Available Abstract Background Like microarray-based investigations, high-throughput proteomics techniques require machine learning algorithms to identify biomarkers that are informative for biological classification problems. Feature selection and classification algorithms need to be robust to noise and outliers in the data. Results We developed a recursive support vector machine (R-SVM algorithm to select important genes/biomarkers for the classification of noisy data. We compared its performance to a similar, state-of-the-art method (SVM recursive feature elimination or SVM-RFE, paying special attention to the ability of recovering the true informative genes/biomarkers and the robustness to outliers in the data. Simulation experiments show that a 5 %-~20 % improvement over SVM-RFE can be achieved regard to these properties. The SVM-based methods are also compared with a conventional univariate method and their respective strengths and weaknesses are discussed. R-SVM was applied to two sets of SELDI-TOF-MS proteomics data, one from a human breast cancer study and the other from a study on rat liver cirrhosis. Important biomarkers found by the algorithm were validated by follow-up biological experiments. Conclusion The proposed R-SVM method is suitable for analyzing noisy high-throughput proteomics and microarray data and it outperforms SVM-RFE in the robustness to noise and in the ability to recover informative features. The multivariate SVM-based method outperforms the univariate method in the classification performance, but univariate methods can reveal more of the differentially expressed features especially when there are correlations between the features.
Cross-validation and Peeling Strategies for Survival Bump Hunting using Recursive Peeling Methods
Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J. Sunil
2015-01-01
We introduce a framework to build a survival/risk bump hunting model with a censored time-to-event response. Our Survival Bump Hunting (SBH) method is based on a recursive peeling procedure that uses a specific survival peeling criterion derived from non/semi-parametric statistics such as the hazards-ratio, the log-rank test or the Nelson--Aalen estimator. To optimize the tuning parameter of the model and validate it, we introduce an objective function based on survival or prediction-error statistics, such as the log-rank test and the concordance error rate. We also describe two alternative cross-validation techniques adapted to the joint task of decision-rule making by recursive peeling and survival estimation. Numerical analyses show the importance of replicated cross-validation and the differences between criteria and techniques in both low and high-dimensional settings. Although several non-parametric survival models exist, none addresses the problem of directly identifying local extrema. We show how SBH efficiently estimates extreme survival/risk subgroups unlike other models. This provides an insight into the behavior of commonly used models and suggests alternatives to be adopted in practice. Finally, our SBH framework was applied to a clinical dataset. In it, we identified subsets of patients characterized by clinical and demographic covariates with a distinct extreme survival outcome, for which tailored medical interventions could be made. An R package PRIMsrc (Patient Rule Induction Method in Survival, Regression and Classification settings) is available on CRAN (Comprehensive R Archive Network) and GitHub. PMID:27034730
[The cultural history of palliative care in primitive societies: an integrative review].
Siles González, José; Solano Ruiz, Maria Del Carmen
2012-08-01
The objective of this study is to describe the evolution of palliative care in order to reflect on the possibility of its origin in primitive cultures and their relationship with the beginnings of the cult of the dead. It describes the change in the symbolic structures and social interactions involved in palliative care during prehistory: functional unit, functional framework and functional element. The theoretical framework is based on cultural history, the dialectical structural model and symbolic interactionism. Categorization techniques, cultural history and dialectic structuralism analyses were performed. Palliative care existed in primitive societies, mostly associated with the rites of passage with a high symbolic content. The social structures - functional unit, functional framework and functional element - are the pillars that supported palliative care in prehistory societies.
CERN. Geneva
2012-01-01
We present our effort for the creation of a new software library of geometrical primitives, which are used for solid modelling in Monte Carlo detector simulations. We plan to replace and unify current geometrical primitive classes in the CERN software projects Geant4 and ROOT with this library. Each solid is represented by a C++ class with methods suited for measuring distances of particles from the surface of a solid and for determination as to whether the particles are located inside, outside or on the surface of the solid. We use numerical tolerance for determining whether the particles are located on the surface. The class methods also contain basic support for visualization. We use dedicated test suites for validation of the shape codes. These include also special performance and numerical value comparison tests for help with analysis of possible candidates of class methods as well as to verify that our new implementation proposals were designed and implemented properly. Currently, bridge classes are u...
Listening to Quackery: Reading John Wesley's Primitive Physic in an Age of Health Care Reform.
Skinner, Daniel; Schneider, Adam
2016-11-25
This article uses a reading of John Wesley's Primitive Physic, or An Easy and Natural Method of Curing Most Diseases (1747) to resist the common rejection-often as "quackery"-of Wesley's treatments for common maladies. We engage Wesley not because he was right but because his approach offers useful moments of pause in light of contemporary medical epistemology. Wesley's recommendations were primarily oriented towards the categories of personal responsibility and capability, but he also sought to empower individuals-especially the poor-with the knowledge to safely and affordably treat maladies of their own. We leverage Primitive Physic to rethink contemporary medical knowledge production, especially as sanctioned by randomized clinical trials and legitimate views of experience and contemporary institutions such as the AMA. Ultimately, we suggest that the medical humanities has a key role to play in mining the discarded and dismissed for what they can tell scholars about medical knowledge.
Western Imperialism Against Primitive Communism. A New Reading of Rosa Luxemburg’s Economic Writings
Directory of Open Access Journals (Sweden)
Michael Löwy
2012-01-01
Full Text Available The discussion on Rosa Luxemburg’s theories of imperialism hasmainly focused on the economic argument - the schemes of reproduction, theprocess of circulation, the need for “external” markets, etc. There is howeveranother dimension, at least as important : the struggle of imperialism againstpre-capitalist economies, the ruthless destruction of “natural” and peasant economies,many of them being forms of primitive communism. Luxemburg’sinterest for primitive communist societies is documented by her Introductionto Political Economy and the imperialist war against them is discussed both inthis work and in the last chapters of The Accumulation of Capital. A whollyoriginal approach to the evolution of social formations, running counter tolinear “progressive” views of bourgeois ideology, is outlined in these reflections. Present indigenous struggles e.g. in Latin America, against multinational oil or mining companies, illustrate the topicality of Rosa Luxemburg’s argument in the 21th century.
Clinical and pathological characteristics of primitive neuroectodermal tumor of the cerebral
International Nuclear Information System (INIS)
Fu Jun; Zhou Youxin; Xu Feng; Ye Ming; Zhou Dai; Bao Yaodong; Kang Suya
2004-01-01
Objective: To study the features of the cerebral primitive neuroectodermal tumor (PNET) in the clinical manifestation and in the histogenesis, morphology. Methods: Seven cases of cerebral PNET was analyzed with their clinical manifestations, histologic and immunohistochemical results. Results: Five patients of this group were children or young adults. Seven tumors were composed of primitive cells with focal evidence of glial or neuronal differentiation. Five out seven expressed NSE, one out seven expressed Syn, two out seven expressed CD99 and only one case expressed Vimentin, None expressed GFAP and S-100. CT findings were a homogeneous high density or heterogeneous mass. MR findings were high signal intensity both on T1 and T2 images. Conclusion: To diagnose the cerebral PNET depends on pathology and cerebral PNET have poor prognosis
Ji, Hong-Fang; Chen, Lei; Zhang, Hong-Yu
2008-08-01
Protein redox reactions are one of the most basic and important biochemical actions. As amino acids are weak redox mediators, most protein redox functions are undertaken by protein cofactors, which include organic ligands and transition metal ions. Since both kinds of redox cofactors were available in the pre-protein RNA world, it is challenging to explore which one was more involved in redox processes of primitive proteins? In this paper, using an examination of the redox cofactor usage of putative ancient proteins, we infer that organic ligands participated more frequently than transition metals in redox reactions of primitive proteins, at least as protein cofactors. This is further supported by the relative abundance of amino acids in the primordial world. Supplementary material for this article can be found on the BioEssays website. (c) 2008 Wiley Periodicals, Inc.
John Wesley’s medical guide Primitive Physick from 1747: science, charlatanism or social medicine?
Directory of Open Access Journals (Sweden)
Helmut Renders
2011-05-01
Full Text Available In 1747, John Wesley, spiritus rector of the Methodist movement, published the first edition of his medical guide Primitive Physic[k]. What was its purpose in a world where the Royal Academy, herbalists, healers / as, exorcists and quacks competed for the attention of the population? What is its legacy and limitation, considering the different interests of contemporary religious movements in Brazil? The article introduces the different groups who promoted or pretended to promote health in 18th century England and compares the contents of the guide Primitive Physic [k] with their proposals and therapeutic strategies. The conclusion is that a significant portion of the guide consists of guidelines of the Royal Academy of Medicine, but that it always favors homemade remedies with ingredients available to humbler classes. In relation to the socalled Spiritual Physick, prayer is mentioned as a complementary measure, but the practice of exorcism is totally ignored.
Nonvariceal upper gastrointestinal bleeding
International Nuclear Information System (INIS)
Burke, Stephen J.; Weldon, Derik; Sun, Shiliang; Golzarian, Jafar
2007-01-01
Nonvariceal upper gastrointestinal bleeding (NUGB) remains a major medical problem even after advances in medical therapy with gastric acid suppression and cyclooxygenase (COX-2) inhibitors. Although the incidence of upper gastrointestinal bleeding presenting to the emergency room has slightly decreased, similar decreases in overall mortality and rebleeding rate have not been experienced over the last few decades. Many causes of upper gastrointestinal bleeding have been identified and will be reviewed. Endoscopic, radiographic and angiographic modalities continue to form the basis of the diagnosis of upper gastrointestinal bleeding with new research in the field of CT angiography to diagnose gastrointestinal bleeding. Endoscopic and angiographic treatment modalities will be highlighted, emphasizing a multi-modality treatment plan for upper gastrointestinal bleeding. (orig.)
Nonvariceal upper gastrointestinal bleeding
Energy Technology Data Exchange (ETDEWEB)
Burke, Stephen J.; Weldon, Derik; Sun, Shiliang [University of Iowa, Department of Radiology, Iowa, IA (United States); Golzarian, Jafar [University of Iowa, Department of Radiology, Iowa, IA (United States); University of Iowa, Department of Radiology, Carver College of Medicine, Iowa, IA (United States)
2007-07-15
Nonvariceal upper gastrointestinal bleeding (NUGB) remains a major medical problem even after advances in medical therapy with gastric acid suppression and cyclooxygenase (COX-2) inhibitors. Although the incidence of upper gastrointestinal bleeding presenting to the emergency room has slightly decreased, similar decreases in overall mortality and rebleeding rate have not been experienced over the last few decades. Many causes of upper gastrointestinal bleeding have been identified and will be reviewed. Endoscopic, radiographic and angiographic modalities continue to form the basis of the diagnosis of upper gastrointestinal bleeding with new research in the field of CT angiography to diagnose gastrointestinal bleeding. Endoscopic and angiographic treatment modalities will be highlighted, emphasizing a multi-modality treatment plan for upper gastrointestinal bleeding. (orig.)
Dispossessing Urbanization: Urban Marxism in the Face of the Problem of Primitive Accumulation
Piotr Juskowiak
2015-01-01
The article is a complex attempt to present the achievements of the broadly understood urban Marxism in the field of reinterpretation of the classic concept from the cards of Capital – “primitive accumulation”. Drawing on theories of such scholars as David Harvey (“accumulation by dispossession”) or Saskia Sassen (“expulsions”), the author points to the possible ways to operationalize the concept of “dispossessing urbanization”. Inspired by the theorizations of autonomist Marxists (Antonio Ne...
Abundances of presolar silicon carbide grains in primitive meteorites determined by NanoSIMS
Davidson, Jemma; Busemann, Henner; Nittler, Larry R.; Alexander, Conel M. O.'D.; Orthous-Daunay, François-Régis; Franchi, Ian A.; Hoppe, Peter
2014-08-01
It has been suggested that the matrices of all chondrites are dominated by a common material with Ivuna-like (CI) abundances of volatiles, presolar grains and insoluble organic matter (IOM) (e.g., Alexander, 2005). However, matrix-normalized abundances of presolar silicon carbide (SiC) grains estimated from their noble gas components show significant variations in even the most primitive chondrites (Huss and Lewis, 1995; Huss et al., 2003), in contradiction to there being a common chondrite matrix material. Here we report presolar SiC abundances determined by NanoSIMS raster ion imaging of IOM extracted from primitive members of different meteorite groups. We show that presolar SiC abundance determinations are comparable between NanoSIMS instruments located at three different institutes, between residues prepared by different demineralization techniques, and between microtomed and non-microtomed samples. Our derived SiC abundances in CR chondrites are comparable to those found in the CI chondrites (∼30 ppm) and are much higher than previously determined by noble gas analyses. The revised higher CR SiC abundances are consistent with the CRs being amongst the most primitive chondrites in terms of the isotopic compositions and disordered nature of their organic matter. Similar abundances between CR1, CR2, and CR3 chondrites indicate aqueous alteration on the CR chondrite parent body has not progressively destroyed SiC grains in them. A low SiC abundance for the reduced CV3 RBT 04133 can be explained by parent body thermal metamorphism at an estimated temperature of ∼440 °C. Minor differences between primitive members of other meteorite classes, which did not experience such high temperatures, may be explained by prolonged oxidation at lower temperatures under which SiC grains formed outer layers of SiO2 that were not thermodynamically stable, leading to progressive degassing/destruction of SiC.