WorldWideScience

Sample records for hierarchically struc tured

  1. Fast lane recognition based on morphological multi-struc-ture element model

    Institute of Scientific and Technical Information of China (English)

    LEI Tao; FAN Yang-yu; HUANG Lian-bing

    2009-01-01

    This paper proposes a lane detection algorithm based on multi-structure element model of morphological. The innovative point of the algorithm lies in the facts that the flexible structure has the multi-structure elements that lane model features have, and that the algorithm adopts the morphological filtering principle to extract the pixels in the image, which is similar to the lane model. In the algorithm, the interested area is extracted by a model of trapezium from original image, which is detected by the operator of Canny, and the lanes are extracted by the structure elements, which have similar characteristics to that of lane model. Several lines are detected by Hough transformation, then the traffic lanes are reconstructed. Experi-ments show that this algorithm is simple and robust, and can efficiently detect the lane mask accurately and quickly.

  2. Synthesis and crystal struc- ture of hydroquinone-b-cyclo- dextrin complex

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The title inclusion complex with the formula [(C42H70O35)2·(C6O2H6)3·(H2O)21.2(CH3OH)2] has been crystallized and characterized by single crystal X-ray analy-sis. The complex crystallizes in the triclinic system, space group P1, with a = 1.5500 (1), b = 1.5536(1), c = 1.8246(1) nm, a = 113.17(2), b = 99.12(2), g = 103.37(3)o, V = 3.773 9 (4) nm3, Z = 1; Dc = 1.343 g/cm3, m = 0.124 mm-1, F(000) = 1594, R = 0.0795 and S = 0.9639. Two independent molecules of b-cyclodextrin (b-CD) form a "head-to-head" dimer. The fairly important factor of the position and stability of the guest in the host cavity is the solvation of the polar group of the guest.

  3. Reactive Turing machines

    NARCIS (Netherlands)

    Baeten, J.C.M.; Luttik, B.; Tilburg, P.J.A. van

    2013-01-01

    We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo diverge

  4. The principle of stability control of surrounding rock-bearing struc-tures in high stress soft rock roadways

    Institute of Scientific and Technical Information of China (English)

    WANG Wei-jun; ZHU Yong-jian; LI Shu-qing; ZHANG Peng

    2009-01-01

    Through the description of the deformational features of the surrounding rock around high stress engineering soft rock roadways,the coupling stabilization principle of inner and outer structures in surrounding rock was put forward.The supporting principles of high stress engineering soft rock roadway (high resistance and yielding support,timely support,high strength and high stiffness supports) were proposed,which were applied in engineering practices,and obtained better achievements.

  5. Hierarchical Porous ZSM-5 Zeolite Synthesized by in situ Zeolitization and Its Coke Deposition Resistance in Aromatization Reaction

    Institute of Scientific and Technical Information of China (English)

    张珂; 柳云骐; 赵晋翀; 刘晨光

    2012-01-01

    Hierarchical ZSM-5 zeolites with micro-, meso- and macroporosity were prepared from diatomite zeolitization through a vapor-phase transport process on solid surfaces. The aromatization performance of the catalysts was in- vestigated on a fixed bed reactor by using FCC gasoline as feedstock. The crystal phase, morphology, pore struc- tures, acidity and coke depositions of the hierarchical ZSM-5 zeolites were characterized by means of X-ray diffrac- tion (XRD), scanning electron microscope (SEM), N2 adsorption/desorption, Fourier transform infrared (FT-IR) and thermogravimetry-mass spectrogram (TG-MS), respectively. The results show that the prepared hierarchical ZSM-5 zeolite possesses excellent porosity and high crystallinity, displaying an improved aromatization performance and carbon deposition resistance due to its meso- and macroporous structures.

  6. Some relations between quantum Turing machines and Turing machines

    CERN Document Server

    Sicard, A; Sicard, Andrés; Vélez, Mario

    1999-01-01

    For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with deterministic Turing machines, the time evolution operator is related with reversible Turing machines and the local transition function is related with probabilistic and reversible Turing machines.

  7. Nanoscale Turing structures

    DEFF Research Database (Denmark)

    Dziekan, Piotr; Hansen, Jesper Schmidt; Nowakowski, Bogdan

    2014-01-01

    Formation of Turing patterns of nanoscopic length scale is simulated using molecular dynamics. Based on Fourier spectra of the concentrations of species, we compare stabilities of the structures of different wavelengths and for different intermolecular potentials. Long range attraction is shown t...

  8. The Turing guide

    CERN Document Server

    Copeland, Jack; Sprevak, Mark; Wilson, Robin

    2017-01-01

    This carefully edited resource brings together contributions from some of the world's leading experts on Alan Turing to create a comprehensive guide that will serve as a useful resource for researchers in the area as well as the increasingly interested general reader.

  9. Alan Turing the enigma

    CERN Document Server

    Hodges, Andrew

    1983-01-01

    It is only a slight exaggeration to say that the British mathematician Alan Turing (1912-1954) saved the Allies from the Nazis, invented the computer and artificial intelligence, and anticipated gay liberation by decades--all before his suicide at age forty-one. This classic biography of the founder of computer science, reissued on the centenary of his birth with a substantial new preface by the author, is the definitive account of an extraordinary mind and life. A gripping story of mathematics, computers, cryptography, and homosexual persecution, Andrew Hodges's acclaimed book captures bot

  10. Turing Instabilities in Homogeneous Systems

    Science.gov (United States)

    Méndez, Vicenç; Fedotov, Sergei; Horsthemke, Werner

    Alan Turing's paper entitled "The Chemical Basis of Morphogenesis" [440] ranks without doubt among the most important papers of the last century. In that seminal work Turing laid the foundation for the theory of chemical pattern formation. Turing showed that diffusion can have nontrivial effects in nonequilibrium systems. The interplay of diffusion with nonlinear kinetics can destabilize the uniform steady state of reaction-diffusion systems and generate stable, stationary concentration patterns.

  11. Turing Automata and Graph Machines

    Directory of Open Access Journals (Sweden)

    Miklós Bartha

    2010-06-01

    Full Text Available Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example.

  12. Turing, ciphers and quanta.

    Science.gov (United States)

    Ekert, Artur; Kay, Alastair; Pope, James

    2012-07-28

    Alan Turing has certainly contributed to a widespread belief that the quest for a perfect, unbreakable, cipher is a futile pursuit. The ancient art of concealing information has, in the past, been matched by the ingenuity of code-breakers, but no longer! With the advent of quantum cryptography, the hopes of would-be eavesdroppers have been dashed, perhaps for good. Moreover, recent research, building on schemes that were invented decades ago to perform quantum cryptography, shows that secure communication certified by a sufficient violation of a Bell inequality makes a seemingly insane scenario possible-devices of unknown or dubious provenance, even those that are manufactured by our enemies, can be safely used for secure communication, including key distribution. All that is needed to implement this bizarre and powerful form of cryptography is a loophole-free test of a Bell inequality, which is on the cusp of technological feasibility. We provide a brief overview of the intriguing connections between Bell inequalities and cryptography and describe how studies of quantum entanglement and the foundations of quantum theory influence the way we may protect information in the future.

  13. The April Fool Turing Test

    National Research Council Canada - National Science Library

    Dougherty, Mark; Dougherty, Sofi H; Westin, Jerker

    2006-01-01

    .... A standard diagonalisation argument toshow the non-computability of AI is extended to yields a socalled"April fool Turing test", which bears some relationship toWizard of Oz experiments and involves...

  14. Influences of Sintering Process of Sprayed Precursors on the Struc-ture and Electrochemical Properties of LiMn2O4 Cathode Material

    Institute of Scientific and Technical Information of China (English)

    Hui HUANG; Chen WANG; Lei ZHANG; Yongping GAN; Wenkui ZHANG

    2008-01-01

    Well-defined spinel LiMn2O4 powders were synthesized via sintering a precursor, which was prepared by spray-drying method. The effects of sintering process on the structure and electrochemical properties of LiMn2O4 were discussed. It was found that a single sintering could not synthesize a pure LiMn2O4 compound, while two-step sintering procedure consisting of decomposing sprayed precursors at 350℃ and further sintering at an elevated temperature leads to the formation of a single-phased LiMn2O4 with homogeneous particle size distribution. As compared to that sintered in air, the two-step sintered LiMn2O4 in oxygen shows tighter structure and more uniform particle size, as well as better electrochemical properties. It delivers an initial discharge capacity of 131 mAh·g-1 (1/10C), and still has excellent cycling stability at higher rate (1/5C).

  15. Turing on the "Imitation Game"

    Science.gov (United States)

    Chomsky, Noam

    Turing's paper has modest objectives. He dismisses the question of whether machines think as "too meaningless to deserve discussion". His "imitation game", he suggests, might stimulate inquiry into cognitive function and development of computers and software. His proposals are reminiscent of 17th century tests to investigate "other minds", but unlike Turing's, these fall within normal science, on Cartesian assumptions that minds have properties distinct from mechanism, assumptions that collapsed with Newton's undermining of "the mechanical philosophy", soon leading to the conclusion that thinking is a property of organized matter, on a par with other properties of the natural world.

  16. How to Hold a Turing Test Contest

    Science.gov (United States)

    Loebner, Hugh

    I have directed four Loebner Prize Competitions and observed ten others. Those experiences, together with my reading of Alan Turing's 1950 article 'Computing Machinery and Intelligence', led me to the following thoughts on how to conduct a Turing Test.

  17. Hierarchical Engineered Materials and Structures

    Science.gov (United States)

    2012-11-30

    Kheng, A. Kaushik, Y. Qi, H. Kim, S. Noh, E. Arruda, A. Waas, N. Kotov. Highly Ductile Multilayered Films by Layer-by-Layer Assembly of Oppositely...940, 1983. [2] Z. Bažant and B. Oh, "Crack band theory for fracture of concrete ," Materials and Struc- tures, Vol. 16, pp. 155-177, 1983. [3] W.E Baker... concrete ," Heron, Vol. 30, No. 1, 1985. [27] C. W. Schwingshackl, G. S. Aglietti and P. R. Cunningham, "Determination of honey- comb material properties

  18. What question would Turing pose today?

    National Research Council Canada - National Science Library

    Grosz, Barbara J

    2012-01-01

    ... well" in a game he defines and calls "the imitation game," and which we know as the Turing test. The Turing test poses the challenge of constructing a computer system able to carry on a dialogue with a person, potentially ranging over any subject matter and many subject matters, well enough to be indistinguishable from a person. Turing conject...

  19. Single Bacteria as Turing Machines

    Science.gov (United States)

    Bos, Julia; Zang, Qiucen; Vyawahare, Saurabh; Austin, Robert

    2014-03-01

    In Allan Turing's famous 1950 paper on Computing Machinery and Intelligence, he started with the provocative statement: ``I propose to consider the question, `Can machines think?' This should begin with definitions of the meaning of the terms `machine' and `think'.'' In our own work on exploring the way that organisms respond to stress and evolve, it seems at times as if they come to remarkably fast solutions to problems, indicating some sort of very clever computational machinery. I'll discuss how it would appear that bacteria can indeed create a form of a Turing Machine, the first example of a computer, and how they might use this algorithm to do rapid evolution to solve a genomics problem.

  20. Turing patterns and biological explanation

    DEFF Research Database (Denmark)

    Serban, Maria

    2017-01-01

    Turing patterns are a class of minimal mathematical models that have been used to discover and conceptualize certain abstract features of early biological development. This paper examines a range of these minimal models in order to articulate and elaborate a philosophical analysis of their episte......Turing patterns are a class of minimal mathematical models that have been used to discover and conceptualize certain abstract features of early biological development. This paper examines a range of these minimal models in order to articulate and elaborate a philosophical analysis......, promoting theory exploration, and acting as constitutive parts of empirically adequate explanations of naturally occurring phenomena, such as biological pattern formation. Focusing on the roles that minimal model explanations play in science motivates the adoption of a broader diachronic view of scientific...

  1. A survey of infinite time Turing machines

    NARCIS (Netherlands)

    Hamkins, J.D.

    2007-01-01

    Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time, thereby providing a natural model of infinitary computability, with robust notions of computability and decidability on the reals, while remaining close to classical concepts of computabilit

  2. Quantum chaos in quantum Turing machines

    CERN Document Server

    Kim, I; Kim, Ilki; Mahler, Guenter

    1999-01-01

    We investigate a 2-spin quantum Turing architecture, in which discrete local rotations $\\alpha_m$ of the Turing head spin alternate with quantum controlled NOT-opera-\\linebreak%%operations tions. We demonstrate that a single chaotic parameter input $\\alpha_m$ leads to a chaotic dynamics in the entire Hilbert-space.

  3. Alan Turing and the Origins of Complexity

    CERN Document Server

    Martin-Delgado, Miguel-Angel

    2011-01-01

    The 75th anniversary of Turing's seminal paper and his centennial year anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing's contributions in diverse fields in the light of new developments that his thoughts has triggered in many scientific communities. Here, the main idea is to discuss how the work of Turing allows us to change our views on the foundations of Mathematics, much like quantum mechanics changed our conception of the world of Physics. Basic notions like computability and universality are discussed in a broad context, making special emphasis on how the notion of complexity can be given a precise meaning after Turing, i.e., not just qualitative but also quantitative. Turing's work is given some historical perspective with respect to some of his precursors, contemporaries and mathematicians who took up his ideas farther.

  4. Chaotic Turing pattern formation in spatiotemporal systems

    Institute of Scientific and Technical Information of China (English)

    XIAO Jing-hua; LI Hai-hong; YANG Jun-zhong; HU Gang

    2006-01-01

    The problem of Turing pattern formation has attracted much attention in nonlinear science as well as physics,chemistry and biology.So far spatially ordered Turing patterns have been observed in stationary and oscillatory media only.In this paper we find that spatially ordered Turing patterns exist in chaotic extended systems.And chaotic Turing patterns are strikingly rich and surprisingly beautiful with their space structures.These findings are in sharp contrast with the intuition of pseudo-randomness of chaos.The richness and beauty of the chaotic Turing patterns are attributed to a large variety of symmetry properties realized by various types of self-organizations of partial chaos synchronizations.

  5. Establishing the Turing mechanism using synthetic cells

    Science.gov (United States)

    Girabawe, Camille; Tompkins, Nathan; Li, Ning; Bard Ermentrout, G.; Epstein, Irving R.; Fraden, Seth

    2013-03-01

    In 1952 Alan Turing published his seminal pape The Chemical Basis of Morphogenesiin which he described a basis for physical morphogenesis due solely to a reaction-diffusion system. His mechanism has been tested extensively but remains controversial and not fully demonstrated for cellular systems. Now 60 years after its debu, we describe an experimental system that demonstrates all six of his phenomenological predictions with additional support that these observations are due specifically to the Turing mechanism itsel. Further we demonstrate a nonlinear phenomena in the same system that was not predicted by Turing and which is not explained by a linear solution analysis of the governing system equations. Finally we also demonstrate that this system undergoes chemical and physical morphogenesis as Turing suggeste.

  6. Davidson on Turing: Rationality Misunderstood?

    Directory of Open Access Journals (Sweden)

    John-Michael Kuczynski

    2005-12-01

    Full Text Available Alan Turing advocated a kind of functionalism: A machine M is a thinker provided that it responds in certain ways to certain inputs. Davidson argues that Turing’s functionalism is inconsistent with a cer-tain kind of epistemic externalism, and is therefore false. In Davidson’s view, concepts consist of causal liasons of a certain kind between subject and object. Turing’s machine doesn’t have the right kinds of causal li-asons to its environment. Therefore it doesn’t have concepts. Therefore it doesn’t think. I argue that this reasoning is entirely fallacious. It is true that, in some cases, a causal liason between subject and object is part of one’s concept of that object. Consequently, to grasp certain propositions, one must have certain kids of causal ties to one’s environment. But this means that we must rethink some old views on what rationality is. It does not mean, pace Davidson, that a precondition for being rational is being causally embedded in one’s environment in a certain way. If Tur-ing’s machine isn’t capable of thinking (I leave it open whether it is or is not, that has nothing to do with its lacking certain kinds of causal con-nections to the environment. The larger significance of our discussion is this: rationality consists either in one’s ability to see the bearing of purely existential propositions on one another or rationality is simply not to be understood as the ability see the bearing that propositions have on one another.

  7. The Turing Test and the Zombie Argument

    OpenAIRE

    Kostic, Daniel

    2004-01-01

    In this paper I shall try to put some implications concerning the Turing's test and the so-called Zombie arguments into the context of philosophy of mind. My intention is not to compose a review of relevant concepts, but to discuss central problems, which originate from the Turing's test - as a paradigm of computational theory of mind - with the arguments, which refute sustainability of this thesis. In the first section (Section I), I expose the ...

  8. Turing pioneer of the information age

    CERN Document Server

    Copeland, Jack B

    2014-01-01

    Alan Turing is regarded as one of the greatest scientists of the 20th century. But who was Turing, and what did he achieve during his tragically short life of 41 years? Best known as the genius who broke Germany's most secret codes during the war of 1939-45, Turing was also the father of the modern computer. Today, all who 'click-to-open' are familiar with the impact of Turing's ideas. Here, B. Jack Copeland provides an account of Turing's life and work, exploring the key elements of his life-story in tandem with his leading ideas and contributions. The book highlights Turing's contributions to computing and to computer science, including Artificial Intelligence and Artificial Life, and the emphasis throughout is on the relevance of his work to modern developments. The story of his contributions to codebreaking during the Second World War is set in the context of his thinking about machines, as is the account of his work in the foundations of mathematics.

  9. The Ghost in the Quantum Turing Machine

    CERN Document Server

    Aaronson, Scott

    2013-01-01

    In honor of Alan Turing's hundredth birthday, I unwisely set out some thoughts about one of Turing's obsessions throughout his life, the question of physics and free will. I focus relatively narrowly on a notion that I call "Knightian freedom": a certain kind of in-principle physical unpredictability that goes beyond probabilistic unpredictability. Other, more metaphysical aspects of free will I regard as possibly outside the scope of science. I examine a viewpoint, suggested independently by Carl Hoefer, Cristi Stoica, and even Turing himself, that tries to find scope for "freedom" in the universe's boundary conditions rather than in the dynamical laws. Taking this viewpoint seriously leads to many interesting conceptual problems. I investigate how far one can go toward solving those problems, and along the way, encounter (among other things) the No-Cloning Theorem, the measurement problem, decoherence, chaos, the arrow of time, the holographic principle, Newcomb's paradox, Boltzmann brains, algorithmic info...

  10. The Imitation Game: Alan Turings enigmatiske imitationsspil

    DEFF Research Database (Denmark)

    Bentzen, Martin Mose

    2015-01-01

    Alan Turing revolutionerede computervidenskaben og modtog først verdens anerkendelse længe efter sin død. Nu sætter filmen 'The Imitation Game', der har premiere i Danmark 29. januar 2015, fokus på det oversete geni.......Alan Turing revolutionerede computervidenskaben og modtog først verdens anerkendelse længe efter sin død. Nu sætter filmen 'The Imitation Game', der har premiere i Danmark 29. januar 2015, fokus på det oversete geni....

  11. Turing Test for the Internet of Things

    OpenAIRE

    Rubens, Neil

    2014-01-01

    How smart is your kettle? How smart are things in your kitchen, your house, your neighborhood, on the internet? With the advent of Internet of Things, and the move of making devices `smart' by utilizing AI, a natural question arrises, how can we evaluate the progress. The standard way of evaluating AI is through the Turing Test. While Turing Test was designed for AI; the device that it was tailored to was a computer. Applying the test to variety of devices that constitute Internet of Things p...

  12. Relating Turing's Formula and Zipf's Law

    CERN Document Server

    Samuelsson, C

    1996-01-01

    An asymptote is derived from Turing's local reestimation formula for population frequencies, and a local reestimation formula is derived from Zipf's law for the asymptotic behavior of population frequencies. The two are shown to be qualitatively different asymptotically, but nevertheless to be instances of a common class of reestimation-formula-asymptote pairs, in which they constitute the upper and lower bounds of the convergence region of the cumulative of the frequency function, as rank tends to infinity. The results demonstrate that Turing's formula is qualitatively different from the various extensions to Zipf's law, and suggest that it smooths the frequency estimates towards a geometric distribution.

  13. A Computational Behaviorist Takes Turing's Test

    Science.gov (United States)

    Whalen, Thomas E.

    Behaviorism is a school of thought in experimental psychology that has given rise to powerful techniques for managing behavior. Because the Turing Test is a test of linguistic behavior rather than mental processes, approaching the test from a behavioristic perspective is worth examining. A behavioral approach begins by observing the kinds of questions that judges ask, then links the invariant features of those questions to pre-written answers. Because this approach is simple and powerful, it has been more successful in Turing competitions than the more ambitious linguistic approaches. Computational behaviorism may prove successful in other areas of Artificial Intelligence.

  14. Simulating Turing machines on Maurer machines

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2008-01-01

    In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to

  15. Alan Turing and the origins of complexity

    Directory of Open Access Journals (Sweden)

    Martin-Delgado, Miguel Angel

    2013-12-01

    Full Text Available The 75th anniversary of Turing’s seminal paper and his centennial anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing’s contributions in diverse fields in the light of new developments that his thought has triggered in many scientific communities. Here, the main idea is to discuss how the work of Turing allows us to change our views on the foundations of Mathematics, much as quantum mechanics changed our conception of the world of Physics. Basic notions like computability and universality are discussed in a broad context, placing special emphasis on how the notion of complexity can be given a precise meaning after Turing, i.e., not just qualitatively but also quantitatively Turing’s work is given some historical perspective with respect to some of his precursors, contemporaries and mathematicians who took his ideas further.El 75 aniversario del artículo seminal de Turing y el centenario de su nacimiento ocurren en 2011 y 2012, respectivamente. Es natural revisar y valorar las contribuciones que hizo Turing en campos muy diversos a la luz de los desarrollos que sus pensamientos han producido en muchas comunidades científicas. Aquí, la idea principal es discutir como el trabajo de Turing nos permite cambiar nuestra visión sobre los fundamentos de las Matemáticas, de forma similar a como la mecánica cuántica cambió nuestra concepción de la Física. Nociones básicas como compatibilidad y universalidad se discuten en un contexto amplio, haciendo énfasis especial en como a la noción de complejidad se le puede dar un significado preciso después de Turing, es decir, no solo cualitativo sino cuantitativo. Al trabajo de Turing se le da una perspectiva histórica en relación a algunos de sus precursores, contemporáneos y matemáticos que tomaron y llevaron sus ideas aún más allá.

  16. A language for easy and efficient modeling of Turing machines

    Institute of Scientific and Technical Information of China (English)

    Pinaki Chakraborty

    2007-01-01

    A Turing Machine Description Language (TMDL) is developed for easy and efficient modeling of Turing machines.TMDL supports formal symbolic representation of Turing machines. The grammar for the language is also provided. Then a fast singlepass compiler is developed for TMDL. The scope of code optimization in the compiler is examined. An interpreter is used to simulate the exact behavior of the compiled Turing machines. A dynamically allocated and resizable array is used to simulate the infinite tape of a Turing machine. The procedure for simulating composite Turing machines is also explained. In this paper, two sample Turing machines have been designed in TMDL and their simulations are discussed. The TMDL can be extended to model the different variations of the standard Turing machine.

  17. Practical Implementation of a Graphics Turing Test

    DEFF Research Database (Denmark)

    Borg, Mathias; Johansen, Stine Schmieg; Thomsen, Dennis Lundgaard

    2012-01-01

    We present a practical implementation of a variation of the Turing Test for realistic computer graphics. The test determines whether virtual representations of objects appear as real as genuine objects. Two experiments were conducted wherein a real object and a similar virtual object is presented...... graphics. Based on the results from these experiments, future versions of the Graphics Turing Test could ease the restrictions currently necessary in order to test object telepresence under more general conditions. Furthermore, the test could be used to determine the minimum requirements to achieve object...... to test subjects under specific restrictions. A criterion for passing the test is presented based on the probability for the subjects to be unable to recognise a computer generated object as virtual. The experiments show that the specific setup can be used to determine the quality of virtual reality...

  18. A Turing test of a timing theory.

    Science.gov (United States)

    Church, Russell M; Guilhardi, Paulo

    2005-04-29

    A quantitative theory of timing or conditioning can be evaluated with a Turing test in which the behavioral results of an experiment can be compared with the predicted results from the theory. An example is described based upon an experiment in which 12 rats were trained on three fixed-interval schedules of reinforcement, and a simulation of the predicted results from a packet theory of timing. An objective classification rule was used to determine whether a sample from the data or a sample from the theory was more similar to another sample from the theory. With an ideal theory, the expected probability of a correct classification would be 0.5. The observed probability of a correct classification was 0.6, which was slightly, but reliably, greater than 0.5. A Turing test provides a graded metric for the evaluation of a quantitative theory.

  19. Computing Beyond the Church-Turing Limit

    Science.gov (United States)

    Jones, Robert

    2009-05-01

    Dershowitz and Gurevich claim to have proven the Church-Turing theorem starting from a set of 4 reasonable postulates. (Bulletin of Symbolic Logic, vol. 14, num. 3, Sept. 2008, pg. 299) But their postulate II assumes fixed vocabulary. Humans, however, change their vocabulary words (and concepts) over time. My Asa H artificial intelligence also changes its vocabulary. (Trans. of the Kansas Acad. of Sci., vol. 109, no. 3/4, pg 159, 2006, www.bioone.org/archive/0022- 8443/109/3/pdf/i0022-8443-109-3-159.pdf) Their postulate I excludes nondeterministic transitions between states. I don't know how often humans flip a coin but my Asa H does employ random transitions under certain circumstances. Perhaps humans and Asa H go beyond the Church-Turing limit. (Trans. Kansas Acad. of Sci., 108, 3/4, pg. 169, 2005)

  20. A Turing test for free will

    CERN Document Server

    Lloyd, Seth

    2013-01-01

    Before Alan Turing made his crucial contributions to the theory of computation, he studied the question of whether quantum mechanics could throw light on the nature of free will. This article investigates the roles of quantum mechanics and computation in free will. Although quantum mechanics implies that events are intrinsically unpredictable, the `pure stochasticity' of quantum mechanics adds only randomness to decision making processes, not freedom. By contrast, the theory of computation implies that even when our decisions arise from a completely deterministic decision-making process, the outcomes of that process can be intrinsically unpredictable, even to -- especially to -- ourselves. I argue that this intrinsic computational unpredictability of the decision making process is what give rise to our impression that we possess free will. Finally, I propose a `Turing test' for free will: a decision maker who passes this test will tend to believe that he, she, or it possesses free will, whether the world is d...

  1. Practical Implementation of a Graphics Turing Test

    OpenAIRE

    Borg, Mathias; Johansen, Stine Schmieg; Thomsen, Dennis Lundgaard; Kraus, Martin

    2012-01-01

    We present a practical implementation of a variation of the Turing Test for realistic computer graphics. The test determines whether virtual representations of objects appear as real as genuine objects. Two experiments were conducted wherein a real object and a similar virtual object is presented to test subjects under specific restrictions. A criterion for passing the test is presented based on the probability for the subjects to be unable to recognise a computer generated object as virtual....

  2. Alternating Turing machines for inductive languages

    OpenAIRE

    Leivant, Daniel M

    2013-01-01

    We show that alternating Turing machines, with a novel and natural definition of acceptance, accept precisely the inductive (Pi-1-1) languages. Total alternating machines, that either accept or reject each input, accept precisely the hyper-elementary (Delta-1-1) languages. Moreover, bounding the permissible number of alternations yields a characterization of the levels of the arithmetical hierarchy. Notably, these results use simple finite computing devices, with finitary and discrete operati...

  3. Continual Learning through Evolvable Neural Turing Machines

    DEFF Research Database (Denmark)

    Lüders, Benno; Schläger, Mikkel; Risi, Sebastian

    2016-01-01

    Continual learning, i.e. the ability to sequentially learn tasks without catastrophic forgetting of previously learned ones, is an important open challenge in machine learning. In this paper we take a step in this direction by showing that the recently proposed Evolving Neural Turing Machine (ENTM......) approach is able to perform one-shot learning in a reinforcement learning task without catastrophic forgetting of previously stored associations....

  4. An Intensional Concurrent Faithful Encoding of Turing Machines

    Directory of Open Access Journals (Sweden)

    Thomas Given-Wilson

    2014-10-01

    Full Text Available The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect encodings of Turing Machines to demonstrate their ability to support arbitrary computation. However, these encodings are usually by simulating the entire Turing Machine within the language, or by encoding a language that does an encoding or simulation itself. This second category is typical for process calculi that show an encoding of lambda-calculus (often with restrictions that in turn simulates a Turing Machine. Such approaches lead to indirect encodings of Turing Machines that are complex, unclear, and only weakly equivalent after computation. This paper presents an approach to encoding Turing Machines into intensional process calculi that is faithful, reduction preserving, and structurally equivalent. The encoding is demonstrated in a simple asymmetric concurrent pattern calculus before generalised to simplify infinite terms, and to show encodings into Concurrent Pattern Calculus and Psi Calculi.

  5. Turing Trade: A Hybrid of a Turing Test and a Prediction Market

    Science.gov (United States)

    Farfel, Joseph; Conitzer, Vincent

    We present Turing Trade, a web-based game that is a hybrid of a Turing test and a prediction market. In this game, there is a mystery conversation partner, the “target,” who is trying to appear human, but may in reality be either a human or a bot. There are multiple judges (or “bettors”), who interrogate the target in order to assess whether it is a human or a bot. Throughout the interrogation, each bettor bets on the nature of the target by buying or selling human (or bot) securities, which pay out if the target is a human (bot). The resulting market price represents the bettors’ aggregate belief that the target is a human. This game offers multiple advantages over standard variants of the Turing test. Most significantly, our game gathers much more fine-grained data, since we obtain not only the judges’ final assessment of the target’s humanity, but rather the entire progression of their aggregate belief over time. This gives us the precise moments in conversations where the target’s response caused a significant shift in the aggregate belief, indicating that the response was decidedly human or unhuman. An additional benefit is that (we believe) the game is more enjoyable to participants than a standard Turing test. This is important because otherwise, we will fail to collect significant amounts of data. In this paper, we describe in detail how Turing Trade works, exhibit some example logs, and analyze how well Turing Trade functions as a prediction market by studying the calibration and sharpness of its forecasts (from real user data).

  6. Testing Turing's Theory of Morphogenesis in Chemical Cells

    Science.gov (United States)

    Tompkins, Nathan; Li, Ning; Girabawe, Camille; Heymann, Michael; Ermentrout, G. Bard; Epstein, Irving; Fraden, Seth

    2015-03-01

    Alan Turing's 1952 paper ``The Chemical Basis of Morphogenesis'' described how reaction-diffusion dynamics could create six spatiotemporal patterns including a stationary pattern that could lead to physical morphogenesis (which now bears his name). This stationary ``Turing pattern'' has been observed in continuous media of various chemical systems but never in diffusively coupled discrete reactors as Turing theorized. We have created a system of microfluidically produced chemical compartments containing the Belousov-Zhabotinsky reaction that are designed to fulfill the assumptions of Turing's theoretical system. This system demonstrates all six spatiotemporal patterns that Turing predicted. In particular, we observe the stationary case that bears Turing's name where the cells create a pattern of oxidized and reduced states. As Turing predicted, this chemical heterogeneity gives rise to physical heterogeneity by driving an osmotic flow, swelling the reduced cells and shrinking the oxidized cells. In addition to the six patterns and physical morphogenesis predicted by Turing we observe a seventh pattern of mixed stationary/oscillatory states that is not predicted by Turing. This seventh pattern requires modifying Turing's theory to include slight heterogeneity to match experiments.

  7. A 'Turing' Test for Landscape Evolution Models

    Science.gov (United States)

    Parsons, A. J.; Wise, S. M.; Wainwright, J.; Swift, D. A.

    2008-12-01

    Resolving the interactions among tectonics, climate and surface processes at long timescales has benefited from the development of computer models of landscape evolution. However, testing these Landscape Evolution Models (LEMs) has been piecemeal and partial. We argue that a more systematic approach is required. What is needed is a test that will establish how 'realistic' an LEM is and thus the extent to which its predictions may be trusted. We propose a test based upon the Turing Test of artificial intelligence as a way forward. In 1950 Alan Turing posed the question of whether a machine could think. Rather than attempt to address the question directly he proposed a test in which an interrogator asked questions of a person and a machine, with no means of telling which was which. If the machine's answer could not be distinguished from those of the human, the machine could be said to demonstrate artificial intelligence. By analogy, if an LEM cannot be distinguished from a real landscape it can be deemed to be realistic. The Turing test of intelligence is a test of the way in which a computer behaves. The analogy in the case of an LEM is that it should show realistic behaviour in terms of form and process, both at a given moment in time (punctual) and in the way both form and process evolve over time (dynamic). For some of these behaviours, tests already exist. For example there are numerous morphometric tests of punctual form and measurements of punctual process. The test discussed in this paper provides new ways of assessing dynamic behaviour of an LEM over realistically long timescales. However challenges remain in developing an appropriate suite of challenging tests, in applying these tests to current LEMs and in developing LEMs that pass them.

  8. Online encyclopedia entities tagging method based on page struc-ture and content%融合页面结构与内容的在线百科实体标注方法

    Institute of Scientific and Technical Information of China (English)

    李晓静; 林海伦; 贾岩涛; 王元卓; 程学旗

    2015-01-01

    Online encyclopedia entity tagging aims to label online encyclopedia pages with standard named entity tags such as person, location and organization. It is crucial for a wide range of applications such as entity disambigu-ation, entity relation inference and knowledge base construction and so on. Features of encyclopedia pages can be divided as structure features (e.g., Infobox, title, and category) and content features (i.e., page content). Existing methods that only take one feature or simply combine both features in one classification cause low F1 value. These methods don’t make full use of the difference of these features. This paper presents an online encyclopedia entities tagging method based on page structure and content. This method firstly builds two classifiers with the two kinds of features respectively, and then builds a new classifier by linear combination of these two classifiers, so this method can accurately realize entities tagging. The experimental results show that this method can achieve F1 value improve-ment over the baseline methods on the task of encyclopedia entity tagging.%在线百科实体标注目的是标注出属于特定类别(如人名、地名、机构名等)的实体。百科实体标注对大量的应用,诸如实体消歧、实体关系挖掘、知识库构建都很重要。百科实体特征可以分为结构特征(属性框、标题、类别等)和内容特征(页面正文)。现有的标注方法大多只考虑一种特征或者一种分类器,导致F1值较低,无法充分发挥两种特征的优势。因此,提出了融合页面结构特征和内容特征的在线百科实体标注方法。该方法考虑了两种特征对标注结果的影响,分别构造分类器,并且对结果进行线性组合,能够更准确地实现百科实体的实体标注。实验表明,该方法在实体标注中F1值较其他对比实验方法均有所提高。

  9. A Study on Evolution Characters and Countermeasures of Reigo nal Marine Indusrti al Struc ture in China%我国区域海洋经济产业结构的演变特征及对策研究

    Institute of Scientific and Technical Information of China (English)

    苏为华; 于俊; 陈玉娟

    2014-01-01

    本文立足于地区层面,分析了2001-2012年间我国海洋经济产业结构的演变特征,并进行了相应的对策研究。研究结果发现,我国区域海洋产业结构差异明显且发展模式不一。同时,基于资源禀赋差异和可持续发展的分析表明,各地区海洋产业结构存在不同程度的不合理。据此,本文将沿海11个地区划分为五个区域,“因地制宜”的提出了地区海洋产业结构的优化对策。%This paper presents a regional level analysis on the evolution characters of marine industrial structure in China from 2001 to 2012 with problem-addressing measures proposed accordingly.The result shows that there exists sharp differences in the structure and development model of the regional marine industry.Further more, an analysis based on sustainable devel-opment principles and resources endowment disparity indicates that different degrees of irrationality exist in the marine industri-al structures of different places.After classifying 11 coastal regions into five groups, this paper finally puts forward optimiza-tion strategies for marine industrial structure in accordance with the specific local conditions.

  10. Kairic Rhythmicity in the Turing-Galaxy

    DEFF Research Database (Denmark)

    Jensen, Sisse Siggaard

    2001-01-01

    This paper explores problems of time and timing in different spaces with refer-ence to two case studies from the epoch of the Turing-Galaxy. Case study 1 is on networked learning communities and case study 2 is an e-learning project in a small multimedia firm in Denmark. Basic assumptions...... the matrix of Time and Space Manifold suggested by Rämö (Rämö 1999) and the concept of "rhythmicity" as elaborated by Adam (Adam 1990, 1998) are introduced and dis-cussed in relation to the case studies....

  11. Bot, Cyborg and Automated Turing Test

    Science.gov (United States)

    Yan, Jeff

    The Automated Turing test (ATT) is almost a standard security technique for addressing the threat of undesirable or malicious bot programs. In this paper, we motivate an interesting adversary model, cyborgs, which are either humans assisted by bots or bots assisted by humans. Since there is always a human behind these bots, or a human can always be available on demand, ATT fails to differentiate such cyborgs from humans. The notion of “telling humans and cyborgs apart” is novel, and it can be of practical relevance in network security. Although it is a challenging task, we have had some success in telling cyborgs and humans apart automatically.

  12. A Turing test for free will.

    Science.gov (United States)

    Lloyd, Seth

    2012-07-28

    Before Alan Turing made his crucial contributions to the theory of computation, he studied the question of whether quantum mechanics could throw light on the nature of free will. This paper investigates the roles of quantum mechanics and computation in free will. Although quantum mechanics implies that events are intrinsically unpredictable, the 'pure stochasticity' of quantum mechanics adds randomness only to decision-making processes, not freedom. By contrast, the theory of computation implies that, even when our decisions arise from a completely deterministic decision-making process, the outcomes of that process can be intrinsically unpredictable, even to-especially to-ourselves. I argue that this intrinsic computational unpredictability of the decision-making process is what gives rise to our impression that we possess free will. Finally, I propose a 'Turing test' for free will: a decision-maker who passes this test will tend to believe that he, she, or it possesses free will, whether the world is deterministic or not.

  13. A Turing test for collective motion.

    Science.gov (United States)

    Herbert-Read, J E; Romenskyy, M; Sumpter, D J T

    2015-12-01

    A widespread problem in biological research is assessing whether a model adequately describes some real-world data. But even if a model captures the large-scale statistical properties of the data, should we be satisfied with it? We developed a method, inspired by Alan Turing, to assess the effectiveness of model fitting. We first built a self-propelled particle model whose properties (order and cohesion) statistically matched those of real fish schools. We then asked members of the public to play an online game (a modified Turing test) in which they attempted to distinguish between the movements of real fish schools or those generated by the model. Even though the statistical properties of the real data and the model were consistent with each other, the public could still distinguish between the two, highlighting the need for model refinement. Our results demonstrate that we can use 'citizen science' to cross-validate and improve model fitting not only in the field of collective behaviour, but also across a broad range of biological systems.

  14. Turing patterns in a modified Lotka-Volterra model

    Energy Technology Data Exchange (ETDEWEB)

    McGehee, Edward A. [Department of Chemistry, Williams College, Williamstown, MA 01267 (United States); Peacock-Lopez, Enrique [Department of Chemistry, Williams College, Williamstown, MA 01267 (United States)]. E-mail: epeacock@williams.edu

    2005-07-04

    In this Letter we consider a modified Lotka-Volterra model widely known as the Bazykin model, which is the MacArthur-Rosenzweig (MR) model that includes a prey-dependent response function and is modified with the inclusion of intraspecies interactions. We show that a quadratic intra-prey interaction term, which is the most realistic nonlinearity, yields sufficient conditions for Turing patterns. For the Bazykin model we find the Turing region in parameter space and Turing patterns in one dimension.

  15. Localized Turing patterns in nonlinear optical cavities

    Science.gov (United States)

    Kozyreff, G.

    2012-05-01

    The subcritical Turing instability is studied in two classes of models for laser-driven nonlinear optical cavities. In the first class of models, the nonlinearity is purely absorptive, with arbitrary intensity-dependent losses. In the second class, the refractive index is real and is an arbitrary function of the intracavity intensity. Through a weakly nonlinear analysis, a Ginzburg-Landau equation with quintic nonlinearity is derived. Thus, the Maxwell curve, which marks the existence of localized patterns in parameter space, is determined. In the particular case of the Lugiato-Lefever model, the analysis is continued to seventh order, yielding a refined formula for the Maxwell curve and the theoretical curve is compared with recent numerical simulation by Gomila et al. [D. Gomila, A. Scroggie, W. Firth, Bifurcation structure of dissipative solitons, Physica D 227 (2007) 70-77.

  16. Wittgensteinian Perspectives on the Turing Test

    Directory of Open Access Journals (Sweden)

    Ondřej Beran

    2014-04-01

    Full Text Available This paper discusses some difficulties in understanding the Turing test. It emphasizes the importance of distinguishing between conceptual and empirical perspectives and highlights the former as introducing more serious problems for the TT. Some objections against the Turingian framework stemming from the later Wittgenstein’s philosophy are exposed. The following serious problems are examined: 1 It considers a unique and exclusive criterion for thinking which amounts to their identification; 2 it misidentifies the relationship of speaking to thinking as that of a criterion; 3 it neglects the “natural” course of the development in semantics. However, these considerations suggest only that it is problematic to label a successful chatbot as a “thinking entity” without further qualifications, but not necessarily and once and for all incorrect. Philosophy has only little to say about the technical possibility of creating such an effective program.

  17. Turing instability in reaction-diffusion systems with nonlinear diffusion

    Energy Technology Data Exchange (ETDEWEB)

    Zemskov, E. P., E-mail: zemskov@ccas.ru [Russian Academy of Sciences, Dorodnicyn Computing Center (Russian Federation)

    2013-10-15

    The Turing instability is studied in two-component reaction-diffusion systems with nonlinear diffusion terms, and the regions in parametric space where Turing patterns can form are determined. The boundaries between super- and subcritical bifurcations are found. Calculations are performed for one-dimensional brusselator and oregonator models.

  18. Identifying network topologies that can generate turing pattern.

    Science.gov (United States)

    Zheng, M Mocarlo; Shao, Bin; Ouyang, Qi

    2016-11-07

    Turing pattern provides a paradigm of non-equilibrium self-organization in reaction-diffusion systems. On the basis of many mathematical studies, it has been proposed that various biological development processes use Turing instability to achieve periodic patterns. In this paper, we introduce a framework to systematic identify network topologies that are capable for Turing pattern formation. All possible 2, 3-node genetic regulatory networks are enumerated and linear stability analysis is applied to access their ability to generate Turing instability. We find that all 3-node networks that can achieve Turing pattern can be mapped to either pure or cross activator-inhibitor mechanisms, and the pure activator-inhibitor system is more robust for Turing pattern formation than the other one. Additional linkages can further increase the performance of the circuit by either introducing another core topology or complementing existing regulations. Moreover, we find that addition of a fixed node enables the formation of Turing pattern even when the diffusion coefficients of two morphogens are fairly close to each other. Our results provide the design principle of robust circuits for Turing pattern generation and can be further applied for systematically exploring other bifurcation phenomena.

  19. The complexity of small universal Turing machines: a survey

    CERN Document Server

    Neary, Turlough

    2011-01-01

    We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. In addition, another related result shows that Rule 110, a well-known elementary cellular automaton, is efficiently universal. We also discuss some old and new universal program size results, including the smallest known universal Turing machines. We finish the survey with results on generalised and restricted Turing machine models including machines with a periodic background on the tape (instead of a blank symbol), multiple tapes, multipl...

  20. Turing Systems: A General Model for Complex Patterns in Nature

    Science.gov (United States)

    Barrio, R. A.

    More than half a century ago Alan Turing showed that a system of nonlinear reaction-diffusion equations could produce spatial patterns that are stationary and robust, a phenomenon known as "diffusion driven instability". This remarkable fact was largely ignored for twenty years. However, in the last decade, Turing systems have been a matter of intense and active research, because they are suitable to model a wide variety of phenomena found in Nature, ranging from Turing's original idea of describing morphogenesis from an egg, and applications to the colouring of skins of animals, to the physics of chemical reactors and catalyzers, the physiology of the heart, semiconductor devices, and even to geological formations. In this paper I review the main properties of the Turing instability using a generic reaction-diffusion model, and I give examples of recent applications of Turing models to different problems of pattern formation.

  1. Alan Turing: person of the XXth century?

    Directory of Open Access Journals (Sweden)

    Sánchez Ron, José M.

    2013-12-01

    Full Text Available “Time” magazine chose Albert Einstein as “Person of the Century.” This was undoubtedly a reasonable choice, but as I will argue in this article, there are also good reasons for contending that Turing might have received this honor. One such reason I consider here is his purely scientific work, which stems from the greatest mathematical tradition, and how it affected the development of mathematics itself and was finally instrumental in shaping a new technological world. This is true both as regards the computation and treatment of information as well as the establishment of new forms of social relations. In relation to the foregoing, we have Turing’s contributions to the deciphering of secret codes during the Second World War, which in a somewhat metaphorical sense may be regarded as a new tool for undermining personal privacy, that civil right whose denial finally ruined his lifeEn diciembre de 1999, la revista Time eligió a Albert Einstein “The Person of the Century”. Fue, no cabe duda, una elección razonable, pero, como se argumenta en este artículo, existen también buenos argumentos para sostener que Turing podría haber recibido tal honor. En apoyo de semejante tesis están sus trabajos puramente científicos, que se esbozan aquí, trabajos que entroncan con la mejor tradición matemática, y cómo afectaron al desarrollo matemático, siendo finalmente instrumentales en la configuración de un nuevo mundo tecnológico, tanto en lo que al cálculo y manejo de información se refiere, como en lo relativo al establecimiento de nuevas formas de relaciones sociales. Relacionadas con lo anterior, se encuentran las aportaciones que hizo durante la Segunda Guerra Mundial al desciframiento de códigos secretos, que, en cierto sentido, metafórico, se pueden considerar como una nueva herramienta para socavar la privacidad, ese derecho civil cuya negación arruinó su propia vida.

  2. How My Program Passed the Turing Test

    Science.gov (United States)

    Humphrys, Mark

    In 1989, the author put an ELIZA-like chatbot on the Internet. The conversations this program had can be seen - depending on how one defines the rules (and how seriously one takes the idea of the test itself) - as a passing of the Turing Test. This is the first time this event has been properly written. This chatbot succeeded due to profanity, relentless aggression, prurient queries about the user, and implying that they were a liar when they responded. The element of surprise was also crucial. Most chatbots exist in an environment where people expectto find some bots among the humans. Not this one. What was also novel was the onlineelement. This was certainly one of the first AI programs online. It seems to have been the first (a) AI real-time chat program, which (b) had the element of surprise, and (c) was on the Internet. We conclude with some speculation that the future of all of AI is on the Internet, and a description of the "World- Wide-Mind" project that aims to bring this about.

  3. The universal computer the road from Leibniz to Turing

    CERN Document Server

    Davis, Martin

    2011-01-01

    The breathtakingly rapid pace of change in computing makes it easy to overlook the pioneers who began it all. Written by Martin Davis, respected logician and researcher in the theory of computation, The Universal Computer: The Road from Leibniz to Turing explores the fascinating lives, ideas, and discoveries of seven remarkable mathematicians. It tells the stories of the unsung heroes of the computer age -- the logicians. The story begins with Leibniz in the 17th century and then focuses on Boole, Frege, Cantor, Hilbert, and Godel, before turning to Turing. Turing's analysis of algorithmic pro

  4. Turing patterns in development: what about the horse part?

    Science.gov (United States)

    Marcon, Luciano; Sharpe, James

    2012-12-01

    For many years Turing patterns-the repetitive patterns which Alan Turing proved could arise from simple diffusing and interacting factors-have remained an interesting theoretical possibility, rather than a central concern of the developmental biology community. Recently however, this has started to change, with an increasing number of studies combining both experimental and theoretical work to reveal how Turing models may underlie a variety of patterning or morphogenetic processes. We review here the recent developments in this field across a wide range of model systems.

  5. Generating Turing Machines by Use of Other Computation Models

    Directory of Open Access Journals (Sweden)

    Leszek Dubiel

    2003-01-01

    Full Text Available For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. Because this is very simple model programs tend to be very complicated and hard to analyse by human. The best practice to solve given type of problems is to define a new model of computation that allows for quick and easy programming, and then to emulate its operation with Turing machine. This article shows how to define most suitable model for computation on natural numbers and defines Turing machine that emulates its operation.

  6. Testing the Turing Test — do Men Pass It?

    Science.gov (United States)

    Adam, Ruth; Hershberg, Uri; Schul, Yaacov; Solomon, Sorin

    We are fascinated by the idea of giving life to the inanimate. The fields of Artificial Life and Artificial Intelligence (AI) attempt to use a scientific approach to pursue this desire. The first steps on this approach hark back to Turing and his suggestion of an imitation game as an alternative answer to the question "can machines think?".1 To test his hypothesis, Turing formulated the Turing test1 to detect human behavior in computers. But how do humans pass such a test? What would you say if you would learn that they do not pass it well? What would it mean for our understanding of human behavior? What would it mean for our design of tests of the success of artificial life? We report below an experiment in which men consistently failed the Turing test.

  7. One Dimensional Turing-Like Handshake Test for Motor Intelligence

    OpenAIRE

    Karniel, Amir; Avraham, Guy; Peles, Bat-Chen; Levy-Tzedek, Shelly; Nisky, Ilana

    2010-01-01

    In the Turing test, a computer model is deemed to "think intelligently" if it can generate answers that are not distinguishable from those of a human. However, this test is limited to the linguistic aspects of machine intelligence. A salient function of the brain is the control of movement, and the movement of the human hand is a sophisticated demonstration of this function. Therefore, we propose a Turing-like handshake test, for machine motor intelligence. We administer the test through a te...

  8. Deciphering CAPTCHAs: What a Turing Test Reveals about Human Cognition

    OpenAIRE

    Thomas Hannagan; Maria Ktori; Myriam Chanceaux; Jonathan Grainger

    2012-01-01

    International audience; Turning Turing's logic on its head, we used widespread letter-based Turing Tests found on the internet CAPTCHAs) to shed light on human cognition. We examined the basis of the human ability to solve CAPTCHAs, where machines fail. We asked whether this is due to our use of slow-acting inferential processes that would not be available to machines, or whether fastacting automatic orthographic processing in humans has superior robustness to shape variations. A masked primi...

  9. Cooperativity to increase Turing pattern space for synthetic biology.

    Science.gov (United States)

    Diambra, Luis; Senthivel, Vivek Raj; Menendez, Diego Barcena; Isalan, Mark

    2015-02-20

    It is hard to bridge the gap between mathematical formulations and biological implementations of Turing patterns, yet this is necessary for both understanding and engineering these networks with synthetic biology approaches. Here, we model a reaction-diffusion system with two morphogens in a monostable regime, inspired by components that we recently described in a synthetic biology study in mammalian cells.1 The model employs a single promoter to express both the activator and inhibitor genes and produces Turing patterns over large regions of parameter space, using biologically interpretable Hill function reactions. We applied a stability analysis and identified rules for choosing biologically tunable parameter relationships to increase the likelihood of successful patterning. We show how to control Turing pattern sizes and time evolution by manipulating the values for production and degradation relationships. More importantly, our analysis predicts that steep dose-response functions arising from cooperativity are mandatory for Turing patterns. Greater steepness increases parameter space and even reduces the requirement for differential diffusion between activator and inhibitor. These results demonstrate some of the limitations of linear scenarios for reaction-diffusion systems and will help to guide projects to engineer synthetic Turing patterns.

  10. Nonlinear effects on Turing patterns: Time oscillations and chaos

    KAUST Repository

    Aragón, J. L.

    2012-08-08

    We show that a model reaction-diffusion system with two species in a monostable regime and over a large region of parameter space produces Turing patterns coexisting with a limit cycle which cannot be discerned from the linear analysis. As a consequence, the patterns oscillate in time. When varying a single parameter, a series of bifurcations leads to period doubling, quasiperiodic, and chaotic oscillations without modifying the underlying Turing pattern. A Ruelle-Takens-Newhouse route to chaos is identified. We also examine the Turing conditions for obtaining a diffusion-driven instability and show that the patterns obtained are not necessarily stationary for certain values of the diffusion coefficients. These results demonstrate the limitations of the linear analysis for reaction-diffusion systems. © 2012 American Physical Society.

  11. Chemical morphogenesis: turing patterns in an experimental chemical system.

    Science.gov (United States)

    Dulos, E; Boissonade, J; Perraud, J J; Rudovics, B; De Kepper, P

    1996-11-01

    Patterns resulting from the sole interplay between reaction and diffusion are probably involved in certain stages of morphogenesis in biological systems, as initially proposed by Alan Turing. Self-organization phenomena of this type can only develop in nonlinear systems (i.e. involving positive and negative feedback loops) maintained far from equilibrium. We present Turing patterns experimentally observed in a chemical system. An oscillating chemical reaction, the CIMA reaction, is operated in an open spatial reactor designed in order to obtain a pure reaction-diffusion system. The two types of Turing patterns observed, hexagonal arrays of spots and parallel stripes, are characterized by an intrinsic wavelength. We identify the origin of the necessary diffusivity between activator and inhibitor. We also describe a pattern growth mechanism by spot splitting that recalls cell division.

  12. Turing's three philosophical lessons and the philosophy of information.

    Science.gov (United States)

    Floridi, Luciano

    2012-07-28

    In this article, I outline the three main philosophical lessons that we may learn from Turing's work, and how they lead to a new philosophy of information. After a brief introduction, I discuss his work on the method of levels of abstraction (LoA), and his insistence that questions could be meaningfully asked only by specifying the correct LoA. I then look at his second lesson, about the sort of philosophical questions that seem to be most pressing today. Finally, I focus on the third lesson, concerning the new philosophical anthropology that owes so much to Turing's work. I then show how the lessons are learned by the philosophy of information. In the conclusion, I draw a general synthesis of the points made, in view of the development of the philosophy of information itself as a continuation of Turing's work.

  13. Stochastic Turing Patterns: Analysis of Compartment-Based Approaches

    KAUST Repository

    Cao, Yang

    2014-11-25

    © 2014, Society for Mathematical Biology. Turing patterns can be observed in reaction-diffusion systems where chemical species have different diffusion constants. In recent years, several studies investigated the effects of noise on Turing patterns and showed that the parameter regimes, for which stochastic Turing patterns are observed, can be larger than the parameter regimes predicted by deterministic models, which are written in terms of partial differential equations (PDEs) for species concentrations. A common stochastic reaction-diffusion approach is written in terms of compartment-based (lattice-based) models, where the domain of interest is divided into artificial compartments and the number of molecules in each compartment is simulated. In this paper, the dependence of stochastic Turing patterns on the compartment size is investigated. It has previously been shown (for relatively simpler systems) that a modeler should not choose compartment sizes which are too small or too large, and that the optimal compartment size depends on the diffusion constant. Taking these results into account, we propose and study a compartment-based model of Turing patterns where each chemical species is described using a different set of compartments. It is shown that the parameter regions where spatial patterns form are different from the regions obtained by classical deterministic PDE-based models, but they are also different from the results obtained for the stochastic reaction-diffusion models which use a single set of compartments for all chemical species. In particular, it is argued that some previously reported results on the effect of noise on Turing patterns in biological systems need to be reinterpreted.

  14. Stochastic Turing patterns: analysis of compartment-based approaches.

    Science.gov (United States)

    Cao, Yang; Erban, Radek

    2014-12-01

    Turing patterns can be observed in reaction-diffusion systems where chemical species have different diffusion constants. In recent years, several studies investigated the effects of noise on Turing patterns and showed that the parameter regimes, for which stochastic Turing patterns are observed, can be larger than the parameter regimes predicted by deterministic models, which are written in terms of partial differential equations (PDEs) for species concentrations. A common stochastic reaction-diffusion approach is written in terms of compartment-based (lattice-based) models, where the domain of interest is divided into artificial compartments and the number of molecules in each compartment is simulated. In this paper, the dependence of stochastic Turing patterns on the compartment size is investigated. It has previously been shown (for relatively simpler systems) that a modeler should not choose compartment sizes which are too small or too large, and that the optimal compartment size depends on the diffusion constant. Taking these results into account, we propose and study a compartment-based model of Turing patterns where each chemical species is described using a different set of compartments. It is shown that the parameter regions where spatial patterns form are different from the regions obtained by classical deterministic PDE-based models, but they are also different from the results obtained for the stochastic reaction-diffusion models which use a single set of compartments for all chemical species. In particular, it is argued that some previously reported results on the effect of noise on Turing patterns in biological systems need to be reinterpreted.

  15. Artificial Intelligence, Evolutionary Computing and Metaheuristics In the Footsteps of Alan Turing

    CERN Document Server

    2013-01-01

    Alan Turing pioneered many research areas such as artificial intelligence, computability, heuristics and pattern formation.  Nowadays at the information age, it is hard to imagine how the world would be without computers and the Internet. Without Turing's work, especially the core concept of Turing Machine at the heart of every computer, mobile phone and microchip today, so many things on which we are so dependent would be impossible. 2012 is the Alan Turing year -- a centenary celebration of the life and work of Alan Turing. To celebrate Turing's legacy and follow the footsteps of this brilliant mind, we take this golden opportunity to review the latest developments in areas of artificial intelligence, evolutionary computation and metaheuristics, and all these areas can be traced back to Turing's pioneer work. Topics include Turing test, Turing machine, artificial intelligence, cryptography, software testing, image processing, neural networks, nature-inspired algorithms such as bat algorithm and cuckoo sear...

  16. Faith in the algorithm, part 1: beyond the turing test

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez, Marko A [Los Alamos National Laboratory; Pepe, Alberto [UCLA

    2009-01-01

    Since the Turing test was first proposed by Alan Turing in 1950, the goal of artificial intelligence has been predicated on the ability for computers to imitate human intelligence. However, the majority of uses for the computer can be said to fall outside the domain of human abilities and it is exactly outside of this domain where computers have demonstrated their greatest contribution. Another definition for artificial intelligence is one that is not predicated on human mimicry, but instead, on human amplification, where the algorithms that are best at accomplishing this are deemed the most intelligent. This article surveys various systems that augment human and social intelligence.

  17. Competing Turing and Faraday Instabilities in Longitudinally Modulated Passive Resonators.

    Science.gov (United States)

    Copie, François; Conforti, Matteo; Kudlinski, Alexandre; Mussot, Arnaud; Trillo, Stefano

    2016-04-08

    We experimentally investigate the interplay of Turing (modulational) and Faraday (parametric) instabilities in a bistable passive nonlinear resonator. The Faraday branch is induced via parametric resonance owing to a periodic modulation of the resonator dispersion. We show that the bistable switching dynamics is dramatically affected by the competition between the two instability mechanisms, which dictates two completely novel scenarios. At low detunings from resonance, switching occurs between the stable stationary lower branch and the Faraday-unstable upper branch, whereas at high detunings we observe the crossover between the Turing and Faraday periodic structures. The results are well explained in terms of the universal Lugiato-Lefever model.

  18. Turing Machines for dummies: why representations do matter

    NARCIS (Netherlands)

    van Emde Boas, P.

    2012-01-01

    Various methods exists in the litearture for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer (mathematical representation) or is specified by writing the machine state next to the scanned tape symbol (intrinsic representation

  19. Transverse instabilities in chemical Turing patterns of stripes

    Science.gov (United States)

    Peña, B.; Pérez-García, C.; Sanz-Anchelergues, A.; Míguez, D. G.; Muñuzuri, A. P.

    2003-11-01

    We present a theoretical and experimental study of the sideband instabilities in Turing patterns of stripes. We compare numerical computations of the Brusselator model with experiments in a chlorine dioxide iodine malonic acid (CDIMA) reaction in a thin gel layer reactor in contact with a continuously refreshed reservoir of reagents. Spontaneously evolving Turing structures in both systems typically exhibit many defects that break the symmetry of the pattern. Therefore, the study of sideband instabilities requires a method of forcing perfect, spatially periodic Turing patterns with the desired wave number. This is easily achieved in numerical simulations. In experiments, the photosensitivity of the CDIMA reaction permits control and modulation of Turing structures by periodic spatial illumination with a wave number outside the stability region. When a too big wave number is imposed on the pattern, the Eckhaus instability may arise, while for too small wave numbers an instability sets in forming zigzags. By means of the amplitude equation formalism we show that, close to the hexagon-stripe transitions, these sideband instabilities may be preceded by an amplitude instability that grows transient spots locally before reconnecting with stripes. This prediction is tested in both the reaction-diffusion model and the experiment.

  20. Computing a Turing-Incomputable Problem from Quantum Computing

    CERN Document Server

    Sicard, A; Ospina, J; Sicard, Andr\\'es; V\\'elez, Mario; Ospina, Juan

    2003-01-01

    A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu quant-ph/0203034 and solves an Turing-incomputable problem. For the proposed model and problem, a simulation of its behavior is made. Furthermore, it is demonstrated that ISWHM is a universal quantum computation model.

  1. On reversible Turing machines and their function universality

    DEFF Research Database (Denmark)

    Axelsen, Holger Bock; Glück, Robert

    2016-01-01

    We provide a treatment of the reversible Turing machines (RTMs) under a strict function semantics. Unlike many existing reversible computation models, we distinguish strictly between computing the function backslashlambda x.f(x) $ x . f ( x ) and computing the function backslashlambda x. (x, f(x)...

  2. Distributed Cognition: Cognizing, Autonomy and the Turing Test

    OpenAIRE

    Harnad, Stevan; Dror, Itiel

    2006-01-01

    Some of the papers in this special issue [of Pragmatics & Cognition, on Cognitive Technology and Distributed Cognition] distribute cognition between what is going on inside individual cognizers’ heads and their outside worlds; others distribute cognition among different individual cognizers. Turing’s criterion for cognition was individual, autonomous input/output capacity. It is not clear that distributed cognition could pass the Turing Test.

  3. A note on the Turing machine theory of computation

    CERN Document Server

    Boyce, Stephen

    2011-01-01

    The notion of a Turing machine is commonly used to provide a method of precisely defining various intuitive ideas, such as the idea of an algorithm or a computable function. This paper demonstrates that the correctness of classical arithmetic implies that the orthodox account of Turing machines is false. The demonstration begins with the premise that if T is a Turing machine with Goedel number z that calculates the partial recursive function f(x) then f(x) = U [mu y W(z, x, y)] (where 'mu' is the unrestricted mu operator). It is then shown that the function g(x) = (vy){y = U [(vz) W(x, x, z)] + 1} is a total recursive function / recursive (where (vy) is the restricted mu operator). It is then shown that this implies there exists a natural number (U [ (v y) W(e, e, y)]) equal to its own successor (e being the Goedel number of the Turing machine that calculates g).

  4. Turing Patterns in Estuarine Sediments by Microbiological Activity

    Science.gov (United States)

    De Morais Mendonca Teles, Antonio

    2016-07-01

    The use of Turing mechanisms and lattice Lotka-Volterra model (LLV), also by means of the non-extensive statistical mechanics, can mathematically describe well the phenomena of clustering and their associated boundaries with fractal dimensionality, which occurs in various natural situations, among them, biogeochemical processes via microorganisms in estuarine and marine sediments on the planet Earth. The author did an experimental analysis in field work which took into account the spatial and temporal behavior of Turing patterns, in the form of microbial activity within estuarine subsurface sediments. We show we can find the characteristics of clustering and fractallity which are present in the dynamical LLV model and Turing patterns mechanisms, and the non-extensive statistical mechanics could be used to find the q-entropy (Sq), and other non-equilibrium statistical parameters of the studied estuarine (Caraís lagoon) subsurface biogeochemical system. In this paper, the author suggests that such kinds of subsurface ecological systems are of interest to Astrobiology because if we find Turing-type clustered geomorphological patterns, below meter scale, on the near subsurface and inside rocks at the surface of planet Mars, and also find non-equilibrium statistical parameters (temperature, [F], [C], [S], etc.), displaying Turing-type mechanism, in the aquatic environments of the internal seas of planets Jupiter's moon Europa and the internal global ocean of Saturn's moon Enceladus, that could mean that possible hypothetical biogeochemical activities are present in such places. This could be a bio-indicator tool. And with further studies we could find the q-entropy Sq to establish better defined statistical mechanical parameters for such environments and to refine models for their evolution, as we do on planet Earth.

  5. Deciphering CAPTCHAs: what a Turing test reveals about human cognition.

    Directory of Open Access Journals (Sweden)

    Thomas Hannagan

    Full Text Available Turning Turing's logic on its head, we used widespread letter-based Turing Tests found on the internet (CAPTCHAs to shed light on human cognition. We examined the basis of the human ability to solve CAPTCHAs, where machines fail. We asked whether this is due to our use of slow-acting inferential processes that would not be available to machines, or whether fast-acting automatic orthographic processing in humans has superior robustness to shape variations. A masked priming lexical decision experiment revealed efficient processing of CAPTCHA words in conditions that rule out the use of slow inferential processing. This shows that the human superiority in solving CAPTCHAs builds on a high degree of invariance to location and continuous transforms, which is achieved during the very early stages of visual word recognition in skilled readers.

  6. Deciphering CAPTCHAs: what a Turing test reveals about human cognition.

    Science.gov (United States)

    Hannagan, Thomas; Ktori, Maria; Chanceaux, Myriam; Grainger, Jonathan

    2012-01-01

    Turning Turing's logic on its head, we used widespread letter-based Turing Tests found on the internet (CAPTCHAs) to shed light on human cognition. We examined the basis of the human ability to solve CAPTCHAs, where machines fail. We asked whether this is due to our use of slow-acting inferential processes that would not be available to machines, or whether fast-acting automatic orthographic processing in humans has superior robustness to shape variations. A masked priming lexical decision experiment revealed efficient processing of CAPTCHA words in conditions that rule out the use of slow inferential processing. This shows that the human superiority in solving CAPTCHAs builds on a high degree of invariance to location and continuous transforms, which is achieved during the very early stages of visual word recognition in skilled readers.

  7. Turing Instability in a Boundary-fed System

    CERN Document Server

    Setayeshgar, S

    1998-01-01

    The formation of localized structures in the chlorine dioxide-idodine-malonic acid (CDIMA) reaction-diffusion system is investigated numerically using a realistic model of this system. We analyze the one-dimensional patterns formed along the gradients imposed by boundary feeds, and study their linear stability to symmetry-breaking perturbations (Turing instability) in the plane transverse to these gradients. We establish that an often-invoked simple local linear analysis which neglects longitudinal diffusion is inappropriate for predicting the linear stability of these patterns. Using a fully nonuniform analysis, we investigate the structure of the patterns formed along the gradients and their stability to transverse Turing pattern formation as a function of the values of two control parameters: the malonic acid feed concentration and the size of the reactor in the dimension along the gradients. The results from this investigation are compared with existing experiments.

  8. Template-Directed Biopolymerization: Tape-Copying Turing Machines

    Science.gov (United States)

    Sharma, Ajeet K.; Chowdhury, Debashish

    2012-10-01

    DNA, RNA and proteins are among the most important macromolecules in a living cell. These molecules are polymerized by molecular machines. These natural nano-machines polymerize such macromolecules, adding one monomer at a time, using another linear polymer as the corresponding template. The machine utilizes input chemical energy to move along the template which also serves as a track for the movements of the machine. In the Alan Turing year 2012, it is worth pointing out that these machines are "tape-copying Turing machines". We review the operational mechanisms of the polymerizer machines and their collective behavior from the perspective of statistical physics, emphasizing their common features in spite of the crucial differences in their biological functions. We also draw the attention of the physics community to another class of modular machines that carry out a different type of template-directed polymerization. We hope this review will inspire new kinetic models for these modular machines.

  9. Alan Turing´s work on morphogenesis

    Directory of Open Access Journals (Sweden)

    Herrero, Miguel A.

    2013-12-01

    Full Text Available In this work we will discuss on the contribution made by Alan Turing (1912-1954 towards a mathematical foundation of Developmental Biology. To do so, we will briefly review the approach he laid out in his only published work on the subject, and then describe the impact of his work on Mathematics on one hand, and on Biology on the other.En este artículo debatiremos la contribución hecha por Alan Turing (1912-1954 a la fundamentación matemática de la Biología del Desarrollo. Para ello, repasaremos brevemente su punto de vista en el único trabajo que publicó sobre este tema, y describiremos su impacto tanto en las Matemáticas como en la Biología.

  10. Evolving Neural Turing Machines for Reward-based Learning

    DEFF Research Database (Denmark)

    Jacobsen, Emil Juul; Risi, Sebastian; Greve, Rasmus Boll

    2016-01-01

    and integrating new information without losing previously acquired skills. Here we build on recent work by Graves et al. [5] who extended the capabilities of an ANN by combining it with an external memory bank trained through gradient descent. In this paper, we introduce an evolvable version of their Neural...... Turing Machine (NTM) and show that such an approach greatly simplifies the neural model, generalizes better, and does not require accessing the entire memory content at each time-step. The Evolvable Neural Turing Machine (ENTM) is able to solve a simple copy tasks and for the first time, the continuous...... version of the double T-Maze, a complex reinforcement-like learning problem. In the T-Maze learning task the agent uses the memory bank to display adaptive behavior that normally requires a plastic ANN, thereby suggesting a complementary and effective mechanism for adaptive behavior in NE....

  11. Turing instabilities in a mathematical model for signaling networks

    CERN Document Server

    Rätz, Andreas

    2011-01-01

    GTPase molecules are important regulators in cells that continuously run through an activation/deactivation and membrane-attachment/membrane-detachment cycle. Activated GTPase is able to localize in parts of the membranes and to induce cell polarity. As feedback loops contribute to the GTPase cycle and as the coupling between membrane-bound and cytoplasmic processes introduces different diffusion coefficients a Turing mechanism is a natural candidate for this symmetry breaking. We formulate a mathematical model that couples a reaction-diffusion system in the inner volume to a reaction-diffusion system on the membrane via a flux condition and an attachment/detachment law at the membrane. We present a reduction to a simpler non-local reaction-diffusion model and perform a stability analysis and numerical simulations for this reduction. Our model in principle does support Turing instabilities but only if the lateral diffusion of inactivated GTPase is much faster than the diffusion of activated GTPase.

  12. Template-directed biopolymerization: tape-copying Turing machines

    CERN Document Server

    Sharma, Ajeet K; 10.1142/S1793048012300083

    2013-01-01

    DNA, RNA and proteins are among the most important macromolecules in a living cell. These molecules are polymerized by molecular machines. These natural nano-machines polymerize such macromolecules, adding one monomer at a time, using another linear polymer as the corresponding template. The machine utilizes input chemical energy to move along the template which also serves as a track for the movements of the machine. In the Alan Turing year 2012, it is worth pointing out that these machines are "tape-copying Turing machines". We review the operational mechanisms of the polymerizer machines and their collective behavior from the perspective of statistical physics, emphasizing their common features in spite of the crucial differences in their biological functions. We also draw attention of the physics community to another class of modular machines that carry out a different type of template-directed polymerization. We hope this review will inspire new kinetic models for these modular machines.

  13. A TURING Test Scenario to Estimate an AI System's Validity

    OpenAIRE

    Jantke, Klaus P.; Knauf, Rainer; Abel, Thomas

    1997-01-01

    There is an urgent need to develop, to implement and to apply methodologies resp. tools for complex system validation. The inability to evaluate complex systems may become a crucial limiting factor to future technological progress. The authors are engaged in a quite comprehensive endeavour towards intelligent system validation. This paper deals with both the fundamentals of a so-called "TURING Test Methodology" for intelligent system validation and some ideas to make them practicable. First, ...

  14. Turing patterns and solitary structures under global control

    CERN Document Server

    Pismen, L M

    1994-01-01

    Striped Turing patterns and solitary band and disk structures are constructed using a three-variable multiscale model with cubic nonlinearity and global control. The existence and stability conditions of regular structures are analysed using the equation of motion of curved boundaries between alternative states of the short-range component. The combined picture of transitions between striped and spotted patterns with changing level of global control is in qualitative agreement with the results of the computer experiment by Middya and Luss

  15. Tweaks to Turing Patterns, Wavelength Transitions in CDIMA

    Science.gov (United States)

    Gaskins, Delora; Pruc, Emily; Dolnik, Milos; Epstein, Irving

    2015-03-01

    Alan Turing predicted that stationary patterns could arise from a uniform steady state in a system through the processes of reaction and diffusion. Beyond the Turing instability, there exist spatially periodic states with different wavelengths. Pattern transitions, including those transitions to patterns of differing wavelengths are of interest in reaction-diffusion systems including ecological systems with patterned biomass prone to desertification. We study pattern transitions in the chlorine dioxide-iodine-malonic acid (CDIMA) system which is the prototypical system for the study of Turing patterns in chemical systems. Additions of selected halides (bromides and chlorides) to the system in its patterned state have led to the observation of up to a five fold increase in wavelength. With the concentration of these halides as bifurcation parameter we observe that these large wavelength patterns are bistable with the uniform steady state. We explore the pattern wavelength selection of this system. Wavelength halving and super lattice structure formation result from transitions between patterns of different wavelengths.

  16. Diverse set of Turing nanopatterns coat corneae across insect lineages.

    Science.gov (United States)

    Blagodatski, Artem; Sergeev, Anton; Kryuchkov, Mikhail; Lopatina, Yuliya; Katanaev, Vladimir L

    2015-08-25

    Nipple-like nanostructures covering the corneal surfaces of moths, butterflies, and Drosophila have been studied by electron and atomic force microscopy, and their antireflective properties have been described. In contrast, corneal nanostructures of the majority of other insect orders have either been unexamined or examined by methods that did not allow precise morphological characterization. Here we provide a comprehensive analysis of corneal surfaces in 23 insect orders, revealing a rich diversity of insect corneal nanocoatings. These nanocoatings are categorized into four major morphological patterns and various transitions between them, many, to our knowledge, never described before. Remarkably, this unexpectedly diverse range of the corneal nanostructures replicates the complete set of Turing patterns, thus likely being a result of processes similar to those modeled by Alan Turing in his famous reaction-diffusion system. These findings reveal a beautiful diversity of insect corneal nanostructures and shed light on their molecular origin and evolutionary diversification. They may also be the first-ever biological example of Turing nanopatterns.

  17. Learning, Social Intelligence and the Turing Test - why an "out-of-the-box" Turing Machine will not pass the Turing Test

    CERN Document Server

    Edmonds, Bruce

    2012-01-01

    The Turing Test (TT) checks for human intelligence, rather than any putative general intelligence. It involves repeated interaction requiring learning in the form of adaption to the human conversation partner. It is a macro-level post-hoc test in contrast to the definition of a Turing Machine (TM), which is a prior micro-level definition. This raises the question of whether learning is just another computational process, i.e. can be implemented as a TM. Here we argue that learning or adaption is fundamentally different from computation, though it does involve processes that can be seen as computations. To illustrate this difference we compare (a) designing a TM and (b) learning a TM, defining them for the purpose of the argument. We show that there is a well-defined sequence of problems which are not effectively designable but are learnable, in the form of the bounded halting problem. Some characteristics of human intelligence are reviewed including it's: interactive nature, learning abilities, imitative tend...

  18. Analog models of computations \\& Effective Church Turing Thesis: Efficient simulation of Turing machines by the General Purpose Analog Computer

    CERN Document Server

    Pouly, Amaury; Graça, Daniel S

    2012-01-01

    \\emph{Are analog models of computations more powerful than classical models of computations?} From a series of recent papers, it is now clear that many realistic analog models of computations are provably equivalent to classical digital models of computations from a \\emph{computability} point of view. Take, for example, the probably most realistic model of analog computation, the General Purpose Analog Computer (GPAC) model from Claude Shannon, a model for Differential Analyzers, which are analog machines used from 1930s to early 1960s to solve various problems. It is now known that functions computable by Turing machines are provably exactly those that are computable by GPAC. This paper is about next step: understanding if this equivalence also holds at the \\emph{complexity} level. In this paper we show that the realistic models of analog computation -- namely the General Purpose Analog Computer (GPAC) -- can simulate Turing machines in a computationally efficient manner. More concretely we show that, modulo...

  19. Hierarchical photocatalysts.

    Science.gov (United States)

    Li, Xin; Yu, Jiaguo; Jaroniec, Mietek

    2016-05-01

    As a green and sustainable technology, semiconductor-based heterogeneous photocatalysis has received much attention in the last few decades because it has potential to solve both energy and environmental problems. To achieve efficient photocatalysts, various hierarchical semiconductors have been designed and fabricated at the micro/nanometer scale in recent years. This review presents a critical appraisal of fabrication methods, growth mechanisms and applications of advanced hierarchical photocatalysts. Especially, the different synthesis strategies such as two-step templating, in situ template-sacrificial dissolution, self-templating method, in situ template-free assembly, chemically induced self-transformation and post-synthesis treatment are highlighted. Finally, some important applications including photocatalytic degradation of pollutants, photocatalytic H2 production and photocatalytic CO2 reduction are reviewed. A thorough assessment of the progress made in photocatalysis may open new opportunities in designing highly effective hierarchical photocatalysts for advanced applications ranging from thermal catalysis, separation and purification processes to solar cells.

  20. Alan Turing and the origins of modern Gaussian elimination

    Directory of Open Access Journals (Sweden)

    Dopico, Froilán M.

    2013-12-01

    Full Text Available The solution of a system of linear equations is by far the most important problem in Applied Mathematics. It is important both in itself and because it is an intermediate step in many other important problems. Gaussian elimination is nowadays the standard method for solving this problem numerically on a computer and it was the first numerical algorithm to be subjected to rounding error analysis. In 1948, Alan Turing published a remarkable paper on this topic: “Rounding-off errors in matrix processes” (Quart. J. Mech. Appl. Math. 1, pp. 287-308. In this paper, Turing formulated Gaussian elimination as the matrix LU factorization and introduced the “condition number of a matrix”, both of them fundamental notions of modern Numerical Analysis. In addition, Turing presented an error analysis of Gaussian elimination for general matrices that deeply influenced the spirit of the definitive analysis developed by James Wilkinson in 1961. Alan Turing’s work on Gaussian elimination appears in a fascinating period for modern Numerical Analysis. Other giants of Mathematics, as John von Neumann, Herman Goldstine, and Harold Hotelling were also working in the mid-1940s on Gaussian elimination. The goal of these researchers was to find an efficient and reliable method for solving systems of linear equations in modern “automatic computers”. At that time, it was not clear at all whether Gaussian elimination was a right choice or not. The purpose of this paper is to revise, at an introductory level, the contributions of Alan Turing and other authors to the error analysis of Gaussian elimination, the historical context of these contributions, and their influence on modern Numerical Analysis.La resolución de sistemas de ecuaciones lineales es sin duda el problema más importante en Matemática Aplicada. Es importante en sí mismo y también porque es un paso intermedio en la resolución de muchos otros problemas de gran relevancia. La eliminaci

  1. Quantum turing machine and brain model represented by Fock space

    Science.gov (United States)

    Iriyama, Satoshi; Ohya, Masanori

    2016-05-01

    The adaptive dynamics is known as a new mathematics to treat with a complex phenomena, for example, chaos, quantum algorithm and psychological phenomena. In this paper, we briefly review the notion of the adaptive dynamics, and explain the definition of the generalized Turing machine (GTM) and recognition process represented by the Fock space. Moreover, we show that there exists the quantum channel which is described by the GKSL master equation to achieve the Chaos Amplifier used in [M. Ohya and I. V. Volovich, J. Opt. B 5(6) (2003) 639., M. Ohya and I. V. Volovich, Rep. Math. Phys. 52(1) (2003) 25.

  2. Turing's next steps: the mechanochemical basis of morphogenesis.

    Science.gov (United States)

    Howard, Jonathon; Grill, Stephan W; Bois, Justin S

    2011-06-01

    Nearly 60 years ago, Alan Turing showed theoretically how two chemical species, termed morphogens, diffusing and reacting with each other can generate spatial patterns. Diffusion plays a crucial part in transporting chemical signals through space to establish the length scale of the pattern. When coupled to chemical reactions, mechanical processes - forces and flows generated by motor proteins - can also define length scales and provide a mechanochemical basis for morphogenesis. forces and flows generated by motor proteins - can also define length scales and provide a mechanochemical basis for morphogenesis.

  3. The mechanism of Turing pattern formation in a positive feedback system with cross diffusion

    Science.gov (United States)

    Yang, Xiyan; Liu, Tuoqi; Zhang, Jiajun; Zhou, Tianshou

    2014-03-01

    In this paper, we analyze a reaction-diffusion (R-D) system with a double negative feedback loop and find cases where self diffusion alone cannot lead to Turing pattern formation but cross diffusion can. Specifically, we first derive a set of sufficient conditions for Turing instability by performing linear stability analysis, then plot two bifurcation diagrams that specifically identify Turing regions in the parameter phase plane, and finally numerically demonstrate representative Turing patterns according to the theoretical predictions. Our analysis combined with previous studies actually implies an interesting fact that Turing patterns can be generated not only in a class of monostable R-D systems where cross diffusion is not necessary but also in a class of bistable R-D systems where cross diffusion is necessary. In addition, our model would be a good candidate for experimentally testing Turing pattern formation from the viewpoint of synthetic biology.

  4. Rediscovery of Good-Turing estimators via Bayesian nonparametrics.

    Science.gov (United States)

    Favaro, Stefano; Nipoti, Bernardo; Teh, Yee Whye

    2016-03-01

    The problem of estimating discovery probabilities originated in the context of statistical ecology, and in recent years it has become popular due to its frequent appearance in challenging applications arising in genetics, bioinformatics, linguistics, designs of experiments, machine learning, etc. A full range of statistical approaches, parametric and nonparametric as well as frequentist and Bayesian, has been proposed for estimating discovery probabilities. In this article, we investigate the relationships between the celebrated Good-Turing approach, which is a frequentist nonparametric approach developed in the 1940s, and a Bayesian nonparametric approach recently introduced in the literature. Specifically, under the assumption of a two parameter Poisson-Dirichlet prior, we show that Bayesian nonparametric estimators of discovery probabilities are asymptotically equivalent, for a large sample size, to suitably smoothed Good-Turing estimators. As a by-product of this result, we introduce and investigate a methodology for deriving exact and asymptotic credible intervals to be associated with the Bayesian nonparametric estimators of discovery probabilities. The proposed methodology is illustrated through a comprehensive simulation study and the analysis of Expressed Sequence Tags data generated by sequencing a benchmark complementary DNA library.

  5. A Hitchhiker's Guide to the Turing Galaxy: on naming the age of the networked digital computer

    Directory of Open Access Journals (Sweden)

    GRASSMUCK, Volker

    2007-12-01

    Full Text Available The most commonly used name for our era is that of the `information society, which is a rather unexpressive and, strictly speaking, tautological term. The informatics & society scholar Wolfgang Coy, following the example of McLuhan`s Gutenberg Galaxy, has introduced the concept of the Turing Galaxy. The paper retraces the pre-history of the concept, its grounding in the fundamental breakthroughs of the British mathematician Alan M. Turing, the Turing Machine and the Turing Test, analyses the reception of the concept in a variety of fields of scholarship and asks for its value in the further debate on the knowledge environment of the networked computer.

  6. Noise-induced temporal dynamics in Turing systems

    KAUST Repository

    Schumacher, Linus J.

    2013-04-25

    We examine the ability of intrinsic noise to produce complex temporal dynamics in Turing pattern formation systems, with particular emphasis on the Schnakenberg kinetics. Using power spectral methods, we characterize the behavior of the system using stochastic simulations at a wide range of points in parameter space and compare with analytical approximations. Specifically, we investigate whether polarity switching of stochastic patterns occurs at a defined frequency. We find that it can do so in individual realizations of a stochastic simulation, but that the frequency is not defined consistently across realizations in our samples of parameter space. Further, we examine the effect of noise on deterministically predicted traveling waves and find them increased in amplitude and decreased in speed. © 2013 American Physical Society.

  7. Feedback control of subcritical Turing instability with zero mode.

    Science.gov (United States)

    Golovin, A A; Kanevsky, Y; Nepomnyashchy, A A

    2009-04-01

    A global feedback control of a system that exhibits a subcritical monotonic instability at a nonzero wave number (short-wave or Turing instability) in the presence of a zero mode is investigated using a Ginzburg-Landau equation coupled to an equation for the zero mode. This system is studied analytically and numerically. It is shown that feedback control, based on measuring the maximum of the pattern amplitude over the domain, can stabilize the system and lead to the formation of localized unipulse stationary states or traveling solitary waves. It is found that the unipulse traveling structures result from an instability of the stationary unipulse structures when one of the parameters characterizing the coupling between the periodic pattern and the zero mode exceeds a critical value that is determined by the zero mode damping coefficient.

  8. A case for weakening the Church-Turing Thesis

    CERN Document Server

    Anand, Bhupinder Singh

    2011-01-01

    We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable, but not algorithmically computable, if we assume that the negation of a universally quantified formula of the first-order predicate calculus is always indicative of the existence of a counter-example under the standard interpretation of PA. We conclude that the standard postulation of the Church-Turing Thesis does not hold if we define a number-theoretic formula as effectively computable if, and only if, it is algorithmically verifiable; and needs to be replaced by a weaker postulation of the Thesis as an equivalence.

  9. A mechanical Turing machine: blueprint for a biomolecular computer.

    Science.gov (United States)

    Shapiro, Ehud

    2012-08-06

    We describe a working mechanical device that embodies the theoretical computing machine of Alan Turing, and as such is a universal programmable computer. The device operates on three-dimensional building blocks by applying mechanical analogues of polymer elongation, cleavage and ligation, movement along a polymer, and control by molecular recognition unleashing allosteric conformational changes. Logically, the device is not more complicated than biomolecular machines of the living cell, and all its operations are part of the standard repertoire of these machines; hence, a biomolecular embodiment of the device is not infeasible. If implemented, such a biomolecular device may operate in vivo, interacting with its biochemical environment in a program-controlled manner. In particular, it may 'compute' synthetic biopolymers and release them into its environment in response to input from the environment, a capability that may have broad pharmaceutical and biological applications.

  10. Turing instability in reaction-diffusion models on complex networks

    Science.gov (United States)

    Ide, Yusuke; Izuhara, Hirofumi; Machida, Takuya

    2016-09-01

    In this paper, the Turing instability in reaction-diffusion models defined on complex networks is studied. Here, we focus on three types of models which generate complex networks, i.e. the Erdős-Rényi, the Watts-Strogatz, and the threshold network models. From analysis of the Laplacian matrices of graphs generated by these models, we numerically reveal that stable and unstable regions of a homogeneous steady state on the parameter space of two diffusion coefficients completely differ, depending on the network architecture. In addition, we theoretically discuss the stable and unstable regions in the cases of regular enhanced ring lattices which include regular circles, and networks generated by the threshold network model when the number of vertices is large enough.

  11. Wave-Based Turing Machine: Time Reversal and Information Erasing.

    Science.gov (United States)

    Perrard, S; Fort, E; Couder, Y

    2016-08-26

    The investigation of dynamical systems has revealed a deep-rooted difference between waves and objects regarding temporal reversibility and particlelike objects. In nondissipative chaos, the dynamic of waves always remains time reversible, unlike that of particles. Here, we explore the dynamics of a wave-particle entity. It consists in a drop bouncing on a vibrated liquid bath, self-propelled and piloted by the surface waves it generates. This walker, in which there is an information exchange between the particle and the wave, can be analyzed in terms of a Turing machine with waves as the information repository. The experiments reveal that in this system, the drop can read information backwards while erasing it. The drop can thus backtrack on its previous trajectory. A transient temporal reversibility, restricted to the drop motion, is obtained in spite of the system being both dissipative and chaotic.

  12. Wave-Based Turing Machine: Time Reversal and Information Erasing

    Science.gov (United States)

    Perrard, S.; Fort, E.; Couder, Y.

    2016-08-01

    The investigation of dynamical systems has revealed a deep-rooted difference between waves and objects regarding temporal reversibility and particlelike objects. In nondissipative chaos, the dynamic of waves always remains time reversible, unlike that of particles. Here, we explore the dynamics of a wave-particle entity. It consists in a drop bouncing on a vibrated liquid bath, self-propelled and piloted by the surface waves it generates. This walker, in which there is an information exchange between the particle and the wave, can be analyzed in terms of a Turing machine with waves as the information repository. The experiments reveal that in this system, the drop can read information backwards while erasing it. The drop can thus backtrack on its previous trajectory. A transient temporal reversibility, restricted to the drop motion, is obtained in spite of the system being both dissipative and chaotic.

  13. An experimental design method leading to chemical Turing patterns.

    Science.gov (United States)

    Horváth, Judit; Szalai, István; De Kepper, Patrick

    2009-05-08

    Chemical reaction-diffusion patterns often serve as prototypes for pattern formation in living systems, but only two isothermal single-phase reaction systems have produced sustained stationary reaction-diffusion patterns so far. We designed an experimental method to search for additional systems on the basis of three steps: (i) generate spatial bistability by operating autoactivated reactions in open spatial reactors; (ii) use an independent negative-feedback species to produce spatiotemporal oscillations; and (iii) induce a space-scale separation of the activatory and inhibitory processes with a low-mobility complexing agent. We successfully applied this method to a hydrogen-ion autoactivated reaction, the thiourea-iodate-sulfite (TuIS) reaction, and noticeably produced stationary hexagonal arrays of spots and parallel stripes of pH patterns attributed to a Turing bifurcation. This method could be extended to biochemical reactions.

  14. Turbulent patterns in wall-bounded flows: a Turing instability?

    CERN Document Server

    Manneville, Paul

    2012-01-01

    In their way to/from turbulence, plane wall-bounded flows display an interesting transitional regime where laminar and turbulent oblique bands alternate, the origin of which is still mysterious. In line with Barkley's recent work about the pipe flow transition involving reaction-diffusion concepts, we consider plane Couette flow in the same perspective and transform Waleffe's classical four-variable model of self-sustaining process into a reaction-diffusion model. We show that, upon fulfillment of a condition on the relative diffusivities of its variables, the featureless turbulent regime becomes unstable against patterning as the result of a Turing instability. A reduced two-variable model helps us to delineate the appropriate region of parameter space. An {\\it intrinsic} status is therefore given to the pattern's wavelength for the first time. Virtues and limitations of the model are discussed, calling for a microscopic support of the phenomenological approach.

  15. One Dimensional Turing-Like Handshake Test for Motor Intelligence

    Science.gov (United States)

    Karniel, Amir; Avraham, Guy; Peles, Bat-Chen; Levy-Tzedek, Shelly; Nisky, Ilana

    2010-01-01

    In the Turing test, a computer model is deemed to "think intelligently" if it can generate answers that are not distinguishable from those of a human. However, this test is limited to the linguistic aspects of machine intelligence. A salient function of the brain is the control of movement, and the movement of the human hand is a sophisticated demonstration of this function. Therefore, we propose a Turing-like handshake test, for machine motor intelligence. We administer the test through a telerobotic system in which the interrogator is engaged in a task of holding a robotic stylus and interacting with another party (human or artificial). Instead of asking the interrogator whether the other party is a person or a computer program, we employ a two-alternative forced choice method and ask which of two systems is more human-like. We extract a quantitative grade for each model according to its resemblance to the human handshake motion and name it "Model Human-Likeness Grade" (MHLG). We present three methods to estimate the MHLG. (i) By calculating the proportion of subjects' answers that the model is more human-like than the human; (ii) By comparing two weighted sums of human and model handshakes we fit a psychometric curve and extract the point of subjective equality (PSE); (iii) By comparing a given model with a weighted sum of human and random signal, we fit a psychometric curve to the answers of the interrogator and extract the PSE for the weight of the human in the weighted sum. Altogether, we provide a protocol to test computational models of the human handshake. We believe that building a model is a necessary step in understanding any phenomenon and, in this case, in understanding the neural mechanisms responsible for the generation of the human handshake. PMID:21206462

  16. A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-

    Directory of Open Access Journals (Sweden)

    Nachum Dershowitz

    2012-07-01

    Full Text Available We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.

  17. Human factors issues in the design of stereo-rendered photorealistic objects: a stereoscopic Turing test

    Science.gov (United States)

    Brack, Collin D.; Clewlow, John C.; Kessel, Ivan

    2010-02-01

    We present visual acuity metrics, human factors issues, and technical considerations in the construction of a stereorendered reality test in the spirit of the Turing test, Alan Turing's famous artificial intelligence test designed to explore the boundaries between human and machine interaction. The overall aim of this work is to provide guiding principles in the design of a stereoscopic reality test.

  18. Target Turing patterns and growth dynamics in the chlorine dioxide-iodine-malonic acid reaction.

    Science.gov (United States)

    Preska Steinberg, Asher; Epstein, Irving R; Dolnik, Milos

    2014-04-03

    We study the growth dynamics of Turing patterns in the chlorine dioxide-iodine-malonic acid reaction-diffusion system in response to perturbations with visible light. We describe several mechanisms by which Turing patterns reappear after they are suppressed by illumination with a disc-shaped geometry. We observe that under specific conditions the patterns reorganize from a random configuration of spots and stripes to a set of ordered, concentric rings, which we refer to as target Turing patterns. These patterns closely resemble the unit cells of the Turing hexagonal superlattices known as black eye patterns. However, these target Turing patterns are not part of a larger superlattice structure, and they usually have a larger number of concentric rings. Numerical simulations support the experimental findings.

  19. Dispersal-induced destabilization of metapopulations and oscillatory Turing patterns in ecological networks

    Science.gov (United States)

    Hata, Shigefumi; Nakao, Hiroya; Mikhailov, Alexander S.

    2014-01-01

    As shown by Alan Turing in 1952, differential diffusion may destabilize uniform distributions of reacting species and lead to emergence of patterns. While stationary Turing patterns are broadly known, the oscillatory instability, leading to traveling waves in continuous media and sometimes called the wave bifurcation, remains less investigated. Here, we extend the original analysis by Turing to networks and apply it to ecological metapopulations with dispersal connections between habitats. Remarkably, the oscillatory Turing instability does not lead to wave patterns in networks, but to spontaneous development of heterogeneous oscillations and possible extinction of species. We find such oscillatory instabilities for all possible food webs with three predator or prey species, under various assumptions about the mobility of individual species and nonlinear interactions between them. Hence, the oscillatory Turing instability should be generic and must play a fundamental role in metapopulation dynamics, providing a common mechanism for dispersal-induced destabilization of ecosystems.

  20. Chemical implementation of neural networks and Turing machines.

    Science.gov (United States)

    Hjelmfelt, A; Weinberger, E D; Ross, J

    1991-01-01

    We propose a reversible reaction mechanism with a single stationary state in which certain concentrations assume either high or low values dependent on the concentration of a catalyst. The properties of this mechanism are those of a McCulloch-Pitts neuron. We suggest a mechanism of interneuronal connections in which the stationary state of a chemical neuron is determined by the state of other neurons in a homogeneous chemical system and is thus a "hardware" chemical implementation of neural networks. Specific connections are determined for the construction of logic gates: AND, NOR, etc. Neural networks may be constructed in which the flow of time is continuous and computations are achieved by the attainment of a stationary state of the entire chemical reaction system, or in which the flow of time is discretized by an oscillatory reaction. In another article, we will give a chemical implementation of finite state machines and stack memories, with which in principle the construction of a universal Turing machine is possible. PMID:1763012

  1. Chemical Implementation of Neural Networks and Turing Machines

    Science.gov (United States)

    Hjelmfelt, Allen; Weinberger, Edward D.; Ross, John

    1991-12-01

    We propose a reversible reaction mechanism with a single stationary state in which certain concentrations assume either high or low values dependent on the concentration of a catalyst. The properties of this mechanism are those of a McCulloch-Pitts neuron. We suggest a mechanism of interneuronal connections in which the stationary state of a chemical neuron is determined by the state of other neurons in a homogeneous chemical system and is thus a "hardware" chemical implementation of neural networks. Specific connections are determined for the construction of logic gates: AND, NOR, etc. Neural networks may be constructed in which the flow of time is continuous and computations are achieved by the attainment of a stationary state of the entire chemical reaction system, or in which the flow of time is discretized by an oscillatory reaction. In another article, we will give a chemical implementation of finite state machines and stack memories, with which in principle the construction of a universal Turing machine is possible.

  2. Chemical implementation of neural networks and Turing machines.

    Science.gov (United States)

    Hjelmfelt, A; Weinberger, E D; Ross, J

    1991-12-15

    We propose a reversible reaction mechanism with a single stationary state in which certain concentrations assume either high or low values dependent on the concentration of a catalyst. The properties of this mechanism are those of a McCulloch-Pitts neuron. We suggest a mechanism of interneuronal connections in which the stationary state of a chemical neuron is determined by the state of other neurons in a homogeneous chemical system and is thus a "hardware" chemical implementation of neural networks. Specific connections are determined for the construction of logic gates: AND, NOR, etc. Neural networks may be constructed in which the flow of time is continuous and computations are achieved by the attainment of a stationary state of the entire chemical reaction system, or in which the flow of time is discretized by an oscillatory reaction. In another article, we will give a chemical implementation of finite state machines and stack memories, with which in principle the construction of a universal Turing machine is possible.

  3. How Turing and Wolf influenced my Decision Support Systems.

    Science.gov (United States)

    Richards, Bernard

    2013-01-01

    Decision Support Systems (DSS) have a vital role to play in today's scenario for Patient Care. They can embody a vast knowledge not normally found in one individual where diagnosis and treatment are involved. This paper highlights the training in minute details and precise mathematics needed in a successful DSS and indicates how such attention-to-detail was instilled into the writer as a result of working with Alan Turing and Emil Wolf who have both since achieved world-wide recognition in their own fields as a result of international publicity by the current writer. The article discusses four Decision Support Systems written by the present writer all of which have been shown to improve patient treatment and care, and which are of such complexity that, without their use, patient care would fall short of optimum. The Systems considered are those for Intensive Care Units, Cardiovascular Surgery, a Programmed Investigation Unit, and Diagnosis of Congenital Abnormalities. All these Systems have performed better than the human alternatives and have shown their value in the improvement of patient care.

  4. Spongiosa Primary Development: A Biochemical Hypothesis by Turing Patterns Formations

    Science.gov (United States)

    López-Vaca, Oscar Rodrigo; Garzón-Alvarado, Diego Alexander

    2012-01-01

    We propose a biochemical model describing the formation of primary spongiosa architecture through a bioregulatory model by metalloproteinase 13 (MMP13) and vascular endothelial growth factor (VEGF). It is assumed that MMP13 regulates cartilage degradation and the VEGF allows vascularization and advances in the ossification front through the presence of osteoblasts. The coupling of this set of molecules is represented by reaction-diffusion equations with parameters in the Turing space, creating a stable spatiotemporal pattern that leads to the formation of the trabeculae present in the spongy tissue. Experimental evidence has shown that the MMP13 regulates VEGF formation, and it is assumed that VEGF negatively regulates MMP13 formation. Thus, the patterns obtained by ossification may represent the primary spongiosa formation during endochondral ossification. Moreover, for the numerical solution, we used the finite element method with the Newton-Raphson method to approximate partial differential nonlinear equations. Ossification patterns obtained may represent the primary spongiosa formation during endochondral ossification. PMID:23193429

  5. Spongiosa Primary Development: A Biochemical Hypothesis by Turing Patterns Formations

    Directory of Open Access Journals (Sweden)

    Oscar Rodrigo López-Vaca

    2012-01-01

    Full Text Available We propose a biochemical model describing the formation of primary spongiosa architecture through a bioregulatory model by metalloproteinase 13 (MMP13 and vascular endothelial growth factor (VEGF. It is assumed that MMP13 regulates cartilage degradation and the VEGF allows vascularization and advances in the ossification front through the presence of osteoblasts. The coupling of this set of molecules is represented by reaction-diffusion equations with parameters in the Turing space, creating a stable spatiotemporal pattern that leads to the formation of the trabeculae present in the spongy tissue. Experimental evidence has shown that the MMP13 regulates VEGF formation, and it is assumed that VEGF negatively regulates MMP13 formation. Thus, the patterns obtained by ossification may represent the primary spongiosa formation during endochondral ossification. Moreover, for the numerical solution, we used the finite element method with the Newton-Raphson method to approximate partial differential nonlinear equations. Ossification patterns obtained may represent the primary spongiosa formation during endochondral ossification.

  6. Turing bifurcation in a reaction-diffusion system with density-dependent dispersal

    Science.gov (United States)

    Kumar, Niraj; Horsthemke, Werner

    2010-05-01

    Motivated by the recent finding [N. Kumar, G.M. Viswanathan, V.M. Kenkre, Physica A 388 (2009) 3687] that the dynamics of particles undergoing density-dependent nonlinear diffusion shows sub-diffusive behaviour, we study the Turing bifurcation in a two-variable system with this kind of dispersal. We perform a linear stability analysis of the uniform steady state to find the conditions for the Turing bifurcation and compare it with the standard Turing condition in a reaction-diffusion system, where dispersal is described by simple Fickian diffusion. While activator-inhibitor kinetics are a necessary condition for the Turing instability as in standard two-variable systems, the instability can occur even if the diffusion constant of the inhibitor is equal to or smaller than that of the activator. We apply these results to two model systems, the Brusselator and the Gierer-Meinhardt model.

  7. Turing patterns and apparent competition in predator-prey food webs on networks

    CERN Document Server

    Fernandes, Lucas D

    2012-01-01

    Reaction-diffusion systems may lead to the formation of steady state heterogeneous spatial patterns, known as Turing patterns. Their mathematical formulation is important for the study of pattern formation in general and play central roles in many fields of biology, such as ecology and morphogenesis. In the present study we focus on the role of Turing patterns in describing the abundance distribution of predator and prey species distributed in patches in a scale free network structure. We extend the original model proposed by Nakao and Mikhailov by considering food chains with several interacting pairs of preys and predators. We identify patterns of species distribution displaying high degrees of apparent competition driven by Turing instabilities. Our results provide further indication that differences in abundance distribution among patches may be, at least in part, due to self organized Turing patterns, and not necessarily to intrinsic environmental heterogeneity.

  8. Pigment cell movement is not required for generation of Turing patterns in zebrafish skin

    Science.gov (United States)

    Bullara, D.; de Decker, Y.

    2015-05-01

    The zebrafish is a model organism for pattern formation in vertebrates. Understanding what drives the formation of its coloured skin motifs could reveal pivotal to comprehend the mechanisms behind morphogenesis. The motifs look and behave like reaction-diffusion Turing patterns, but the nature of the underlying physico-chemical processes is very different, and the origin of the patterns is still unclear. Here we propose a minimal model for such pattern formation based on a regulatory mechanism deduced from experimental observations. This model is able to produce patterns with intrinsic wavelength, closely resembling the experimental ones. We mathematically prove that their origin is a Turing bifurcation occurring despite the absence of cell motion, through an effect that we call differential growth. This mechanism is qualitatively different from the reaction-diffusion originally proposed by Turing, although they both generate the short-range activation and the long-range inhibition required to form Turing patterns.

  9. Turing Patterns in a Predator-Prey System with Self-Diffusion

    Directory of Open Access Journals (Sweden)

    Hongwei Yin

    2013-01-01

    Full Text Available For a predator-prey system, cross-diffusion has been confirmed to emerge Turing patterns. However, in the real world, the tendency for prey and predators moving along the direction of lower density of their own species, called self-diffusion, should be considered. For this, we investigate Turing instability for a predator-prey system with nonlinear diffusion terms including the normal diffusion, cross-diffusion, and self-diffusion. A sufficient condition of Turing instability for this system is obtained by analyzing the linear stability of spatial homogeneous equilibrium state of this model. A series of numerical simulations reveal Turing parameter regions of the interaction of diffusion parameters. According to these regions, we further demonstrate dispersion relations and spatial patterns. Our results indicate that self-diffusion plays an important role in the spatial patterns.

  10. Turing patterns and long-time behavior in a three-species food-chain model

    KAUST Repository

    Parshad, Rana D.

    2014-08-01

    We consider a spatially explicit three-species food chain model, describing generalist top predator-specialist middle predator-prey dynamics. We investigate the long-time dynamics of the model and show the existence of a finite dimensional global attractor in the product space, L2(Ω). We perform linear stability analysis and show that the model exhibits the phenomenon of Turing instability, as well as diffusion induced chaos. Various Turing patterns such as stripe patterns, mesh patterns, spot patterns, labyrinth patterns and weaving patterns are obtained, via numerical simulations in 1d as well as in 2d. The Turing and non-Turing space, in terms of model parameters, is also explored. Finally, we use methods from nonlinear time series analysis to reconstruct a low dimensional chaotic attractor of the model, and estimate its fractal dimension. This provides a lower bound, for the fractal dimension of the attractor, of the spatially explicit model. © 2014 Elsevier Inc.

  11. A novel modification of the Turing test for artificial intelligence and robotics in healthcare.

    Science.gov (United States)

    Ashrafian, Hutan; Darzi, Ara; Athanasiou, Thanos

    2015-03-01

    The increasing demands of delivering higher quality global healthcare has resulted in a corresponding expansion in the development of computer-based and robotic healthcare tools that rely on artificially intelligent technologies. The Turing test was designed to assess artificial intelligence (AI) in computer technology. It remains an important qualitative tool for testing the next generation of medical diagnostics and medical robotics. Development of quantifiable diagnostic accuracy meta-analytical evaluative techniques for the Turing test paradigm. Modification of the Turing test to offer quantifiable diagnostic precision and statistical effect-size robustness in the assessment of AI for computer-based and robotic healthcare technologies. Modification of the Turing test to offer robust diagnostic scores for AI can contribute to enhancing and refining the next generation of digital diagnostic technologies and healthcare robotics. Copyright © 2014 John Wiley & Sons, Ltd.

  12. 颈椎椎动脉孔及其毗邻结构影像解剖学测量的临床意义%The measurement of image anatomy of vertebral artery foreman and adjacent bony struc-tures and its clinical significance

    Institute of Scientific and Technical Information of China (English)

    胡祖力; 荣威林; 马双; 陈荣; 李美华

    2015-01-01

    Objective To observe the anatomical relationship between vertebral arteries and its adjacent bony structures through radiography in order to prevent the injury of vertebral arteries during the cervical pedicle screw fixation .Methods Computed tomography angiography ( CTA) data of 57 patients whose vertebral arteries and cervical vertebra had no obvious abnormalities were se -lected.The maximum coronary diameter of transverse foramen ,the maximum sagittal diameter ,the maximum coronary diameter of verte-bral artery,the vertebral artery pedicle diameter ,the shortest/longest distance between vertebral artery and the edge of the pedicle ,the vertebral artery area ,and the transverse foramen area at the C 2 ~C6 left and right sides in transverse images were measured .The area percentage of the vertebral artery in transverse foramen was calculated .Results At the C2 ~C6 vertebral levels ,the sagittal and coro-nary diameters of the vertebral artery were greater in the left except one case that the diameters were smaller in the left .In the C2 ~C6 , coronary diameters of ipsilateral transverse foramen were greater than the sagittal diameters .The vertebral artery pedicle diameter in right side and both side of the shortest distance between the vertebral artery and the edge of the pedicle from C 2 to C6 were gradually increased .There was only one case whose right vertebral artery entered the C 5 transverse foramen .Conclusion The results of CTA are consistent with that of autopsy .CTA images can not only make a contribution to enhance the security of the cervical pedicle screw fixa -tion,but also help to design the personalized surgeries for different patients .%目的:通过影像学手段,观测椎动脉和颈椎骨性结构的毗邻关系,为预防颈椎椎弓根螺钉固定时术中椎动脉损伤提供相关解剖学参数。方法收集57例行CT血管成像( CTA)检查椎动脉无明显异常、颈椎无明显畸形的患者的影像学资料。测量横断位图像中C2~C6左右两侧椎动脉孔及其毗邻的相关数据,即横突孔最大冠状径、最大矢状径、椎动脉最大冠状径、椎动脉最大矢状径、椎弓根直径、椎动脉与椎弓根边缘的最短及最远距离、椎动脉面积、横突孔面积、并计算椎动脉占相应横突孔的面积百分比。结果在C2~C6同一椎体水平,除1例病例左侧椎动脉矢状径和冠状径小于右侧外,其余病例左侧椎动脉的矢状径和冠状径均大于右侧;C2~C6同侧横突孔冠状径大于矢状径;C2~C6节段右侧椎弓根的直径以及双侧椎动脉到椎弓根内侧的最短距离均从C2至C6呈逐渐增大趋势。仅1例患者右侧椎动脉从C5横突孔进入。结论本研究采用CTA影像测量颈椎椎动脉孔及其毗邻结构得到的结果与尸体标本上的解剖参数一致。颈椎CTA影像不仅对提高临床颈椎椎弓根螺钉的安全性有帮助,而且有助于对患者进行个性化的手术设计。

  13. Multilocus sequence typing and its application on population genetic struc-ture analysis of parasites%多位点序列分型及其在寄生虫群体遗传结构分析中的应用

    Institute of Scientific and Technical Information of China (English)

    梁伟涛; 刘华; 邓瑶

    2014-01-01

    Multilocus sequence typing MLST with high solution sensitivity and specificity is widely used to study the population genetic structure of pathogen by amplification and sequencing of the housekeeping genes. MLST also provides more evidence and plays an important role in parasite research. This paper reviews the principle and method of MLST and its applica-tion on population genetic structure analysis of parasites.%多位点序列分型技术(Multilocus sequence typing,MLST)具有分辨率、敏感性及特异性高等优点。在寄生虫学研究中,MLST通过扩增多个管家基因进行测序分析和对病原体进行群体遗传结构分析,可为研究虫种进化等提供更多的理论依据。本文就MLST技术的原理、方法和结果分析及其在几种寄生虫遗传结构分析方面的应用进行综述。

  14. Quantum Kolmogorov complexity and the quantum Turing machine

    Energy Technology Data Exchange (ETDEWEB)

    Mueller, M.

    2007-08-31

    The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity and rigorous mathematical proofs of its basic properties. Classical Kolmogorov complexity is a well-known and useful measure of randomness for binary strings. In recent years, several different quantum generalizations of Kolmogorov complexity have been proposed. The most natural generalization is due to A. Berthiaume et al. (2001), defining the complexity of a quantum bit (qubit) string as the length of the shortest quantum input for a universal quantum computer that outputs the desired string. Except for slight modifications, it is this definition of quantum Kolmogorov complexity that we study in this thesis. We start by analyzing certain aspects of the underlying quantum Turing machine (QTM) model in a more detailed formal rigour than was done previously. Afterwards, we apply these results to quantum Kolmogorov complexity. Our first result is a proof of the existence of a universal QTM which simulates every other QTM for an arbitrary number of time steps and than halts with probability one. In addition, we show that every input that makes a QTM almost halt can be modified to make the universal QTM halt entirely, by adding at most a constant number of qubits. It follows that quantum Kolmogorov complexity has the invariance property, i.e. it depends on the choice of the universal QTM only up to an additive constant. Moreover, the quantum complexity of classical strings agrees with classical complexity, again up to an additive constant. The proofs are based on several analytic estimates. Furthermore, we prove several incompressibility theorems for quantum Kolmogorov complexity. Finally, we show that for ergodic quantum information sources, complexity rate and entropy rate coincide with probability one. The thesis is finished with an outlook on a possible application of quantum Kolmogorov complexity in statistical mechanics. (orig.)

  15. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    of different types of hierarchical networks. This is supplemented by a review of ring network design problems and a presentation of a model allowing for modeling most hierarchical networks. We use methods based on linear programming to design the hierarchical networks. Thus, a brief introduction to the various....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...... linear programming based methods is included. The thesis is thus suitable as a foundation for study of design of hierarchical networks. The major contribution of the thesis consists of seven papers which are included in the appendix. The papers address hierarchical network design and/or ring network...

  16. Feasibility of Turing-Style Tests for Autonomous Aerial Vehicle "Intelligence"

    Science.gov (United States)

    Young, Larry A.

    2007-01-01

    A new approach is suggested to define and evaluate key metrics as to autonomous aerial vehicle performance. This approach entails the conceptual definition of a "Turing Test" for UAVs. Such a "UAV Turing test" would be conducted by means of mission simulations and/or tailored flight demonstrations of vehicles under the guidance of their autonomous system software. These autonomous vehicle mission simulations and flight demonstrations would also have to be benchmarked against missions "flown" with pilots/human-operators in the loop. In turn, scoring criteria for such testing could be based upon both quantitative mission success metrics (unique to each mission) and by turning to analog "handling quality" metrics similar to the well-known Cooper-Harper pilot ratings used for manned aircraft. Autonomous aerial vehicles would be considered to have successfully passed this "UAV Turing Test" if the aggregate mission success metrics and handling qualities for the autonomous aerial vehicle matched or exceeded the equivalent metrics for missions conducted with pilots/human-operators in the loop. Alternatively, an independent, knowledgeable observer could provide the "UAV Turing Test" ratings of whether a vehicle is autonomous or "piloted." This observer ideally would, in the more sophisticated mission simulations, also have the enhanced capability of being able to override the scripted mission scenario and instigate failure modes and change of flight profile/plans. If a majority of mission tasks are rated as "piloted" by the observer, when in reality the vehicle/simulation is fully- or semi- autonomously controlled, then the vehicle/simulation "passes" the "UAV Turing Test." In this regards, this second "UAV Turing Test" approach is more consistent with Turing s original "imitation game" proposal. The overall feasibility, and important considerations and limitations, of such an approach for judging/evaluating autonomous aerial vehicle "intelligence" will be discussed from a

  17. Hierarchical Multiagent Reinforcement Learning

    Science.gov (United States)

    2004-01-25

    In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multiagent tasks. We...introduce a hierarchical multiagent reinforcement learning (RL) framework and propose a hierarchical multiagent RL algorithm called Cooperative HRL. In

  18. Inter-dependent tissue growth and Turing patterning in a model for long bone development

    Science.gov (United States)

    Tanaka, Simon; Iber, Dagmar

    2013-10-01

    The development of long bones requires a sophisticated spatial organization of cellular signalling, proliferation, and differentiation programs. How such spatial organization emerges on the growing long bone domain is still unresolved. Based on the reported biochemical interactions we developed a regulatory model for the core signalling factors IHH, PTCH1, and PTHrP and included two cell types, proliferating/resting chondrocytes and (pre-)hypertrophic chondrocytes. We show that the reported IHH-PTCH1 interaction gives rise to a Schnakenberg-type Turing kinetics, and that inclusion of PTHrP is important to achieve robust patterning when coupling patterning and tissue dynamics. The model reproduces relevant spatiotemporal gene expression patterns, as well as a number of relevant mutant phenotypes. In summary, we propose that a ligand-receptor based Turing mechanism may control the emergence of patterns during long bone development, with PTHrP as an important mediator to confer patterning robustness when the sensitive Turing system is coupled to the dynamics of a growing and differentiating tissue. We have previously shown that ligand-receptor based Turing mechanisms can also result from BMP-receptor, SHH-receptor, and GDNF-receptor interactions, and that these reproduce the wildtype and mutant patterns during digit formation in limbs and branching morphogenesis in lung and kidneys. Receptor-ligand interactions may thus constitute a general mechanism to generate Turing patterns in nature.

  19. The dynamics of Turing patterns for morphogen-regulated growing domains with cellular response delays.

    Science.gov (United States)

    Seirin Lee, S; Gaffney, E A; Baker, R E

    2011-11-01

    Since its conception in 1952, the Turing paradigm for pattern formation has been the subject of numerous theoretical investigations. Experimentally, this mechanism was first demonstrated in chemical reactions over 20 years ago and, more recently, several examples of biological self-organisation have also been implicated as Turing systems. One criticism of the Turing model is its lack of robustness, not only with respect to fluctuations in the initial conditions, but also with respect to the inclusion of delays in critical feedback processes such as gene expression. In this work we investigate the possibilities for Turing patterns on growing domains where the morphogens additionally regulate domain growth, incorporating delays in the feedback between signalling and domain growth, as well as gene expression. We present results for the proto-typical Schnakenberg and Gierer-Meinhardt systems: exploring the dynamics of these systems suggests a reconsideration of the basic Turing mechanism for pattern formation on morphogen-regulated growing domains as well as highlighting when feedback delays on domain growth are important for pattern formation.

  20. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...

  1. Observability of Turing Machines: a Refinement of the Theory of Computation

    CERN Document Server

    Sergeyev, Yaroslav D

    2012-01-01

    The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) by different mathematical languages (the instruments of investigation). Together with traditional mathematical languages using such concepts as 'enumerable sets' and 'continuum' a new computational methodology allowing one to measure the number of elements of different infinite sets is used in this paper. It is shown how mathematical languages used to describe the machines limit our possibilities to observe them. In particular, notions of observable deterministic and non-deterministic T...

  2. Padrões de Turing em sistemas químicos

    Directory of Open Access Journals (Sweden)

    Raphael Nagao

    2016-05-01

    Full Text Available Spontaneous pattern formation in reaction-diffusion systems was theoretically proposed by Alan M. Turing in 1952. His breakthrough conceptions of chemical self-organization were able to explain how patterns emerge in nature and the symmetry breaking, which are of utmost importance, for instance, in the context of origin of life. Along with the experimental observations in the Belousov-Zhabotinsky reaction and the development of the nonequilibrium thermodynamics by Prigogine and co-workers, Turing predictions are considered the foundation of the field of Nonlinear Chemical Dynamics. This review aims to describe the basis of Turing structures with their consequent scientific achievements and to provide future directions in the development of this field.

  3. Is pigment patterning in fish skin determined by the Turing mechanism?

    Science.gov (United States)

    Watanabe, Masakatsu; Kondo, Shigeru

    2015-02-01

    More than half a century ago, Alan Turing postulated that pigment patterns may arise from a mechanism that could be mathematically modeled based on the diffusion of two substances that interact with each other. Over the past 15 years, the molecular and genetic tools to verify this prediction have become available. Here, we review experimental studies aimed at identifying the mechanism underlying pigment pattern formation in zebrafish. Extensive molecular genetic studies in this model organism have revealed the interactions between the pigment cells that are responsible for the patterns. The mechanism discovered is substantially different from that predicted by the mathematical model, but it retains the property of 'local activation and long-range inhibition', a necessary condition for Turing pattern formation. Although some of the molecular details of pattern formation remain to be elucidated, current evidence confirms that the underlying mechanism is mathematically equivalent to the Turing mechanism.

  4. Spontaneous tunable Turing pattern formation for coherent high-power THz radiation

    CERN Document Server

    Huang, Shu-Wei; Yang, Shang-Hua; Yu, Mingbin; Kwong, Dim-Lee; Zelevinsky, T; Jarrahi, Mona; Wong, Chee Wei

    2016-01-01

    The spontaneous breaking of symmetry and homogeneity through dissipative pattern formation is a fundamental question in developmental biology, molecular biochemistry, mathematics and nonlinear physics. Self-organized patterns arise in nature, such as pigmentation in animals, tree branching fractals, Prigogine non-equilibrium chemical bifurcations, and are postulated by Turing to occur from diffusion-reaction driven instabilities. In spite of the spontaneous nature, these threshold-dependent patterns - when formed - can potentially be remarkably robust in the presence of noise. Here we report the spontaneous Turing pattern formation in chip-scale nonlinear oscillators, developing a precision frequency comb in the solid-state. The stationary Turing pattern is discretely tunable across 430 GHz on a THz carrier, with a sideband non-uniformity measured down to 1 part in 1.5x10^15. Local mode hybridizations in the nonlinear ring oscillator seeds the coherent pattern formation and phase matching, to obtain a record ...

  5. Alan Turing's electronic brain the struggle to build the ACE, the world's fastest computer

    CERN Document Server

    Copeland, B Jack

    2012-01-01

    The mathematical genius Alan Turing, now well known for his crucial wartime role in breaking the ENIGMA code, was the first to conceive of the fundamental principle of the modern computer-the idea of controlling a computing machine's operations by means of a program of coded instructions, stored in the machine's 'memory'. In 1945 Turing drew up his revolutionary design for an electronic computing machine-his Automatic Computing Engine ('ACE'). A pilot model of the ACE ran its firstprogram in 1950 and the production version, the 'DEUCE', went on to become a cornerstone of the fledgling British

  6. Tomography of reaction-diffusion microemulsions reveals three-dimensional Turing patterns.

    Science.gov (United States)

    Bánsági, Tamás; Vanag, Vladimir K; Epstein, Irving R

    2011-03-11

    Spatially periodic, temporally stationary patterns that emerge from instability of a homogeneous steady state were proposed by Alan Turing in 1952 as a mechanism for morphogenesis in living systems and have attracted increasing attention in biology, chemistry, and physics. Patterns found to date have been confined to one or two spatial dimensions. We used tomography to study the Belousov-Zhabotinsky reaction in a microemulsion in which the polar reactants are confined to aqueous nanodroplets much smaller than the scale of the stationary patterns. We demonstrate the existence of Turing patterns that can exist only in three dimensions, including curved surfaces, hexagonally packed cylinders, spots, and labyrinthine and lamellar patterns.

  7. Alan Turing's Automatic Computing Engine The Master Codebreaker's Struggle to build the Modern Computer

    CERN Document Server

    Copeland, B Jack

    2005-01-01

    The mathematical genius Alan Turing (1912-1954) was one of the greatest scientists and thinkers of the 20th century. Now well known for his crucial wartime role in breaking the ENIGMA code, he was the first to conceive of the fundamental principle of the modern computer-the idea of controlling a computing machine's operations by means of a program of coded instructions, stored in the machine's 'memory'. In 1945 Turing drew up his revolutionary design for an electronic computingmachine-his Automatic Computing Engine ('ACE'). A pilot model of the ACE ran its first program in 1950 and the product

  8. The physical Church-Turing thesis and the principles of quantum theory

    CERN Document Server

    Arrighi, Pablo

    2011-01-01

    Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory. Yet several works have shown how quantum theory as it stands could breach the physical Church-Turing thesis. We draw a clear line as to when this is the case, in a way that is inspired by Gandy. Gandy formulates postulates about physics, such as homogeneity of space and time, bounded density and velocity of information --- and proves that the physical Church-Turing thesis is a consequence of these postulates. We provide a quantum version of the theorem. Thus this approach exhibits a formal non-trivial interplay between theoretical physics symmetries and computability assumptions.

  9. La Utopía de Turing: entre la imaginación y la cibercultura

    OpenAIRE

    von Mayer Chaves, Peggy

    2007-01-01

    Este artículo analiza la novela de ciencia ficción "dura" La Utopía de Turing ("The Turing Option"), del científico estadounidense Dr. Marvin Minsky, máxima autoridad en inteligencia artificial, y de Harry Harrison, renombrado escritor inglés de ciencia-ficción. La novela aborda importantes logros de la ciberciencia de finales del siglo XX, como la robótica, la inteligencia artificial, la nanotecnología aplicada a la medicina, etc. La trama policíaca conduce a cuestionar el espionaje científi...

  10. The sensitivity of Turing self-organization to biological feedback delays: 2D models of fish pigmentation

    KAUST Repository

    Gaffney, E. A.

    2013-10-01

    © The authors 2013. Turing morphogen models have been extensively explored in the context of large-scale self-organization in multicellular biological systems. However, reconciling the detailed biology of morphogen dynamics, while accounting for time delays associated with gene expression, reveals aberrant behaviours that are not consistent with early developmental self-organization, especially the requirement for exquisite temporal control. Attempts to reconcile the interpretation of Turing\\'s ideas with an increasing understanding of the mechanisms driving zebrafish pigmentation suggests that one should reconsider Turing\\'s model in terms of pigment cells rather than morphogens (Nakamasu et al., 2009, PNAS, 106, 8429-8434; Yamaguchi et al., 2007, PNAS, 104, 4790-4793). Here the dynamics of pigment cells is subject to response delays implicit in the cell cycle and apoptosis. Hence we explore simulations of fish skin patterning, focussing on the dynamical influence of gene expression delays in morphogen-based Turing models and response delays for cell-based Turing models. We find that reconciling the mechanisms driving the behaviour of Turing systems with observations of fish skin patterning remains a fundamental challenge.

  11. Is Turing's Thesis the Consequence of a More General Physical Principle?

    CERN Document Server

    Szudzik, Matthew P

    2012-01-01

    We discuss historical attempts to formulate a physical hypothesis from which Turing's thesis may be derived, and also discuss some related attempts to establish the computability of mathematical models in physics. We show that these attempts are all related to a single, unified hypothesis.

  12. Undecidability and temporal logic: some landmarks from Turing to the present

    DEFF Research Database (Denmark)

    Goranko, Valentin

    2012-01-01

    This is a selective survey and discussion of some of the landmark undecidability results in temporal logic, beginning with Turing's undecidability of the Halting problem which, in retrospect, can be regarded as the historically first undecidability result for a suitable temporal logic over config...

  13. The super-Turing computational power of plastic recurrent neural networks.

    Science.gov (United States)

    Cabessa, Jérémie; Siegelmann, Hava T

    2014-12-01

    We study the computational capabilities of a biologically inspired neural model where the synaptic weights, the connectivity pattern, and the number of neurons can evolve over time rather than stay static. Our study focuses on the mere concept of plasticity of the model so that the nature of the updates is assumed to be not constrained. In this context, we show that the so-called plastic recurrent neural networks (RNNs) are capable of the precise super-Turing computational power--as the static analog neural networks--irrespective of whether their synaptic weights are modeled by rational or real numbers, and moreover, irrespective of whether their patterns of plasticity are restricted to bi-valued updates or expressed by any other more general form of updating. Consequently, the incorporation of only bi-valued plastic capabilities in a basic model of RNNs suffices to break the Turing barrier and achieve the super-Turing level of computation. The consideration of more general mechanisms of architectural plasticity or of real synaptic weights does not further increase the capabilities of the networks. These results support the claim that the general mechanism of plasticity is crucially involved in the computational and dynamical capabilities of biological neural networks. They further show that the super-Turing level of computation reflects in a suitable way the capabilities of brain-like models of computation.

  14. Using a Graphics Turing Test to Evaluate the Effect of Frame Rate and Motion Blur on Telepresence of Animated Objects

    DEFF Research Database (Denmark)

    Borg, Mathias; Johansen, Stine Schmieg; Krog, Kim Srirat

    2013-01-01

    the test. The results of the experiments confirm previous results in psychophysics and show that the Graphics Turing Test is a useful tool in computer graphics. Even with simulated motion blur, our Graphics Turing Test could not be passed with frame rates of 30 and 20 frames per second. Our results suggest......A limited Graphics Turing Test is used to determine the frame rate that is required to achieve telepresence of an animated object. For low object velocities of 2.25 and 4.5 degrees of visual angle per second at 60 frames per second a rotating object with no added motion blur is able to pass...

  15. L'intelligence artificielle et la question du continu; Remarques sur le modèle de Turing

    OpenAIRE

    Lassègue, Jean

    1994-01-01

    The thesis has two goals : to describe the notion of a Turing machine as a concept on one hand and as a model on the other. The starting epistemological hypothesis is as follows : to make the notion of a Turing machine psychologically significant, one has to connect it to the notion of the continuum in the two directions already mentioned, concept and model. The notion of a Turing machine is described as a concept in the theory of computability. The epistemological context in which the concep...

  16. Alan Turing, le « jeu de l'imitation » et la première personne

    OpenAIRE

    Goutefangea, Patrick

    2016-01-01

    Notes sur les implications du test de Turing; In 1950, in his famous paper "Computing Machinery and Intelligence", Alan Turing, by way of an answer to the question "Can machines think ?", thinks of a fictional experiment called "The imitation game". The thesis defended here tries to establish that the Turing's experiment rely on the idea that a talk between a machine and human beings is possible in the same way as it is between human beings themselves. Talk requires the use of the first gramm...

  17. Complejidad descriptiva y computacional en m\\'aquinas de Turing peque\\~nas

    CERN Document Server

    Joosten, Joost J; Zenil, Hector

    2010-01-01

    En este trabajo ofrecemos algunos de los resultados obtenidos al estudiar las funciones calculadas por m\\'aquinas de Turing con un alfabeto de dos s\\'imbolos y un n\\'umero de estados entre 1 y 3. Presentamos detenidamente el modelo de m\\'aquina de Turing empleado, donde la cinta es ilimitada en un solo sentido, y no existe estado de parada. Mostramos gr\\'aficamente c\\'omo es posible representar la funci\\'on calculada por una m\\'aquina, as\\'i como las computaciones realizadas para ello. Vemos que al aumentar el n\\'umero de estados, si bien es posible que algunas funciones se calculen con mayor rapidez, por lo general aumenta considerablemente el tiempo medio de computaci\\'on.

  18. Turing Systems, Entropy, and Kinetic Models for Self-Healing Surfaces

    Directory of Open Access Journals (Sweden)

    Eugene Kagan

    2010-03-01

    Full Text Available The paper addresses the methods of description of friction-induced self-healing at the interface between two solid bodies. A macroscopic description of self-healing is based on a Turing system for the transfer of matter that leads to self-organization at the interface in the case of an unstable state. A microscopic description deals with a kinetic model of the process and entropy production during self-organization. The paper provides a brief overview of the Turing system approach and statistical kinetic models. The relation between these methods and the description of the self-healing surfaces is discussed, as well as results of their application. The analytical considerations are illustrated by numerical simulations.

  19. Early Salt-Marsh Development, an Example of a Turing Instability?

    Science.gov (United States)

    van de Koppel, J.

    2008-12-01

    In the past decades, regular spatial patterns have been described in a wide range of ecosystems, ranging from arid lands to boreal peat lands. Pattern formation mechanisms in many of these ecosystems are caused by scale-dependent interactions between organisms and geophysical processes, causing facilitation between organisms at small spatial scale, but inhibition at larger spatial scales. This conforms to the activation-inhibition principle laid out by Alan Turing in 1953. We present a combination of experimental and modeling studies on early salt-marsh development that indicate that similar scale-dependent interactions determine the establishment of salt-marsh vegetation and early geomorphological development of the marsh. Based on these studies, we argue that the early development of salt-marsh ecosystems is characterized by a Turing instability, placed into a complex landscape setting.

  20. Bifurcation and Turing patterns of reaction-diffusion activator-inhibitor model

    Science.gov (United States)

    Wu, Ranchao; Zhou, Yue; Shao, Yan; Chen, Liping

    2017-09-01

    Gierer-Meinhardt system is one of prototypical pattern formation models. Turing instability could induce various patterns in this system. Hopf bifurcation analysis and its direction are performed on such diffusive model in this paper, by employing normal form and center manifold reduction. The effects of diffusion on the stability of equilibrium point and the bifurcated limit cycle from Hopf bifurcation are investigated. It is found that under some conditions, diffusion-driven instability, i.e, Turing instability, about the equilibrium point and the bifurcated limit cycle will happen, which are stable without diffusion. Those diffusion-driven instabilities will lead to the occurrence of spatially nonhomogeneous solutions. As a result, some patterns, like stripe and spike solutions, will form. The explicit criteria about the stability and instability of the equilibrium point and the limit cycle in the system are derived, which could be readily applied. Further, numerical simulations are presented to illustrate theoretical analysis.

  1. A Series Solution of the Cauchy Problem for Turing Reaction-diffusion Model

    Directory of Open Access Journals (Sweden)

    L. Päivärinta

    2011-12-01

    Full Text Available In this paper, the series pattern solution of the Cauchy problem for Turing reaction-diffusion model is obtained by using the homotopy analysis method (HAM. Turing reaction-diffusion model is nonlinear reaction-diffusion system which usually has power-law nonlinearities or may be rewritten in the form of power-law nonlinearities. Using the HAM, it is possible to find the exact solution or an approximate solution of the problem. This technique provides a series of functions which converges rapidly to the exact solution of the problem. The efficiency of the approach will be shown by applying the procedure on two problems. Furthermore, the so-called homotopy-Pade technique (HPT is applied to enlarge the convergence region and rate of solution series given by the HAM.

  2. Turing pattern dynamics and adaptive discretization for a super-diffusive Lotka-Volterra model.

    Science.gov (United States)

    Bendahmane, Mostafa; Ruiz-Baier, Ricardo; Tian, Canrong

    2016-05-01

    In this paper we analyze the effects of introducing the fractional-in-space operator into a Lotka-Volterra competitive model describing population super-diffusion. First, we study how cross super-diffusion influences the formation of spatial patterns: a linear stability analysis is carried out, showing that cross super-diffusion triggers Turing instabilities, whereas classical (self) super-diffusion does not. In addition we perform a weakly nonlinear analysis yielding a system of amplitude equations, whose study shows the stability of Turing steady states. A second goal of this contribution is to propose a fully adaptive multiresolution finite volume method that employs shifted Grünwald gradient approximations, and which is tailored for a larger class of systems involving fractional diffusion operators. The scheme is aimed at efficient dynamic mesh adaptation and substantial savings in computational burden. A numerical simulation of the model was performed near the instability boundaries, confirming the behavior predicted by our analysis.

  3. Micromechanics of hierarchical materials

    DEFF Research Database (Denmark)

    Mishnaevsky, Leon, Jr.

    2012-01-01

    A short overview of micromechanical models of hierarchical materials (hybrid composites, biomaterials, fractal materials, etc.) is given. Several examples of the modeling of strength and damage in hierarchical materials are summarized, among them, 3D FE model of hybrid composites...... with nanoengineered matrix, fiber bundle model of UD composites with hierarchically clustered fibers and 3D multilevel model of wood considered as a gradient, cellular material with layered composite cell walls. The main areas of research in micromechanics of hierarchical materials are identified, among them......, the investigations of the effects of load redistribution between reinforcing elements at different scale levels, of the possibilities to control different material properties and to ensure synergy of strengthening effects at different scale levels and using the nanoreinforcement effects. The main future directions...

  4. Hierarchical auxetic mechanical metamaterials.

    Science.gov (United States)

    Gatt, Ruben; Mizzi, Luke; Azzopardi, Joseph I; Azzopardi, Keith M; Attard, Daphne; Casha, Aaron; Briffa, Joseph; Grima, Joseph N

    2015-02-11

    Auxetic mechanical metamaterials are engineered systems that exhibit the unusual macroscopic property of a negative Poisson's ratio due to sub-unit structure rather than chemical composition. Although their unique behaviour makes them superior to conventional materials in many practical applications, they are limited in availability. Here, we propose a new class of hierarchical auxetics based on the rotating rigid units mechanism. These systems retain the enhanced properties from having a negative Poisson's ratio with the added benefits of being a hierarchical system. Using simulations on typical hierarchical multi-level rotating squares, we show that, through design, one can control the extent of auxeticity, degree of aperture and size of the different pores in the system. This makes the system more versatile than similar non-hierarchical ones, making them promising candidates for industrial and biomedical applications, such as stents and skin grafts.

  5. Introduction into Hierarchical Matrices

    KAUST Repository

    Litvinenko, Alexander

    2013-12-05

    Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.

  6. Hierarchical Auxetic Mechanical Metamaterials

    Science.gov (United States)

    Gatt, Ruben; Mizzi, Luke; Azzopardi, Joseph I.; Azzopardi, Keith M.; Attard, Daphne; Casha, Aaron; Briffa, Joseph; Grima, Joseph N.

    2015-02-01

    Auxetic mechanical metamaterials are engineered systems that exhibit the unusual macroscopic property of a negative Poisson's ratio due to sub-unit structure rather than chemical composition. Although their unique behaviour makes them superior to conventional materials in many practical applications, they are limited in availability. Here, we propose a new class of hierarchical auxetics based on the rotating rigid units mechanism. These systems retain the enhanced properties from having a negative Poisson's ratio with the added benefits of being a hierarchical system. Using simulations on typical hierarchical multi-level rotating squares, we show that, through design, one can control the extent of auxeticity, degree of aperture and size of the different pores in the system. This makes the system more versatile than similar non-hierarchical ones, making them promising candidates for industrial and biomedical applications, such as stents and skin grafts.

  7. Applied Bayesian Hierarchical Methods

    CERN Document Server

    Congdon, Peter D

    2010-01-01

    Bayesian methods facilitate the analysis of complex models and data structures. Emphasizing data applications, alternative modeling specifications, and computer implementation, this book provides a practical overview of methods for Bayesian analysis of hierarchical models.

  8. Programming with Hierarchical Maps

    DEFF Research Database (Denmark)

    Ørbæk, Peter

    This report desribes the hierarchical maps used as a central data structure in the Corundum framework. We describe its most prominent features, ague for its usefulness and briefly describe some of the software prototypes implemented using the technology....

  9. Catalysis with hierarchical zeolites

    DEFF Research Database (Denmark)

    Holm, Martin Spangsberg; Taarning, Esben; Egeblad, Kresten

    2011-01-01

    Hierarchical (or mesoporous) zeolites have attracted significant attention during the first decade of the 21st century, and so far this interest continues to increase. There have already been several reviews giving detailed accounts of the developments emphasizing different aspects of this research...... topic. Until now, the main reason for developing hierarchical zeolites has been to achieve heterogeneous catalysts with improved performance but this particular facet has not yet been reviewed in detail. Thus, the present paper summaries and categorizes the catalytic studies utilizing hierarchical...... zeolites that have been reported hitherto. Prototypical examples from some of the different categories of catalytic reactions that have been studied using hierarchical zeolite catalysts are highlighted. This clearly illustrates the different ways that improved performance can be achieved with this family...

  10. Is It Real, or Is It Randomized?: A Financial Turing Test

    OpenAIRE

    Jasmina Hasanhodzic; Lo, Andrew W.; Emanuele Viola

    2010-01-01

    We construct a financial "Turing test" to determine whether human subjects can differentiate between actual vs. randomized financial returns. The experiment consists of an online video-game (http://arora.ccs.neu.edu) where players are challenged to distinguish actual financial market returns from random temporal permutations of those returns. We find overwhelming statistical evidence (p-values no greater than 0.5%) that subjects can consistently distinguish between the two types of time serie...

  11. Two-stage Turing model for generating pigment patterns on the leopard and the jaguar

    Science.gov (United States)

    Liu, R. T.; Liaw, S. S.; Maini, P. K.

    2006-07-01

    Based on the results of phylogenetic analysis, which showed that flecks are the primitive pattern of the felid family and all other patterns including rosettes and blotches develop from it, we construct a Turing reaction-diffusion model which generates spot patterns initially. Starting from this spotted pattern, we successfully generate patterns of adult leopards and jaguars by tuning parameters of the model in the subsequent phase of patterning.

  12. 计算机科学的奠基人:Alan Turing

    Institute of Scientific and Technical Information of China (English)

    刘瑞挺

    2002-01-01

    艾伦·图灵(Alan Mathison Turing,1912-1954)短暂的一生像谜一般神秘,使人感到他在时间上和空间上距离我们十分遥远,其实他的同龄人仍有健在者,今年不过90岁高龄。

  13. Improving Image Encryption Using 3D Cat Map and Turing Machine

    Directory of Open Access Journals (Sweden)

    Nehal A. Mohamed

    2016-01-01

    Full Text Available Security of data is of prime importance. Security is a very complex and vast topic. One of the common ways to protect this digital data from unauthorized eavesdropping is encryption. This paper introduces an improved image encryption technique based on a chaotic 3D cat map and Turing machine in the form of dynamic random growth technique. The algorithm consists of two main sections: The first does a preprocessing operation to shuffle the image using 3D chaotic map in the form of dynamic random growth technique. The second uses Turing machine simultaneous with shuffling pixels’ locations to diffuse pixels’ values using a random key that is generated by chaotic 3D cat map. The hybrid compound of a 3D chaotic system and Turing machine strengthen the encryption performance and enlarge the key space required to resist the brute force attacks. The main advantages of such a secure technique are the simplicity and efficiency. These good cryptographic properties prove that it is secure enough to use in image transmission systems.

  14. High-throughput mathematical analysis identifies Turing networks for patterning with equally diffusing signals.

    Science.gov (United States)

    Marcon, Luciano; Diego, Xavier; Sharpe, James; Müller, Patrick

    2016-04-08

    The Turing reaction-diffusion model explains how identical cells can self-organize to form spatial patterns. It has been suggested that extracellular signaling molecules with different diffusion coefficients underlie this model, but the contribution of cell-autonomous signaling components is largely unknown. We developed an automated mathematical analysis to derive a catalog of realistic Turing networks. This analysis reveals that in the presence of cell-autonomous factors, networks can form a pattern with equally diffusing signals and even for any combination of diffusion coefficients. We provide a software (available at http://www.RDNets.com) to explore these networks and to constrain topologies with qualitative and quantitative experimental data. We use the software to examine the self-organizing networks that control embryonic axis specification and digit patterning. Finally, we demonstrate how existing synthetic circuits can be extended with additional feedbacks to form Turing reaction-diffusion systems. Our study offers a new theoretical framework to understand multicellular pattern formation and enables the wide-spread use of mathematical biology to engineer synthetic patterning systems.

  15. Mirrored Language Structure and Innate Logic of the Human Brain as a Computable Model of the Oracle Turing Machine

    CERN Document Server

    Wen, Han Xiao

    2010-01-01

    We wish to present a mirrored language structure (MLS) and four logic rules determined by this structure for the model of a computable Oracle Turing machine. MLS has novel features that are of considerable biological and computational significance. It suggests an algorithm of relation learning and recognition (RLR) that enables the deterministic computers to simulate the mechanism of the Oracle Turing machine, or P = NP in a mathematical term.

  16. A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer

    CERN Document Server

    Wuthrich, Christian

    2014-01-01

    There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable (even in principle) can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, Istv\\'an N\\'emeti and Gyula D\\'avid (2006) have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this essay, I will honour Istv\\'an's seventieth birthday, as well as his longstanding interest in, and his seminal contributions to, this field going back to as early as 1987 by modestly proposing how the concrete implementation in N\\'emeti and D\\'avid (2006) might be complemented by a quantum-information-theoretic communication protocol between the computing device and the logician who sets the beyond-Turing ...

  17. The sensitivity of Turing self-organization to biological feedback delays: 2D models of fish pigmentation.

    Science.gov (United States)

    Gaffney, E A; Lee, S Seirin

    2015-03-01

    Turing morphogen models have been extensively explored in the context of large-scale self-organization in multicellular biological systems. However, reconciling the detailed biology of morphogen dynamics, while accounting for time delays associated with gene expression, reveals aberrant behaviours that are not consistent with early developmental self-organization, especially the requirement for exquisite temporal control. Attempts to reconcile the interpretation of Turing's ideas with an increasing understanding of the mechanisms driving zebrafish pigmentation suggests that one should reconsider Turing's model in terms of pigment cells rather than morphogens (Nakamasu et al., 2009, PNAS, 106: , 8429-8434; Yamaguchi et al., 2007, PNAS, 104: , 4790-4793). Here the dynamics of pigment cells is subject to response delays implicit in the cell cycle and apoptosis. Hence we explore simulations of fish skin patterning, focussing on the dynamical influence of gene expression delays in morphogen-based Turing models and response delays for cell-based Turing models. We find that reconciling the mechanisms driving the behaviour of Turing systems with observations of fish skin patterning remains a fundamental challenge. © The Authors 2013. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

  18. Parallel hierarchical radiosity rendering

    Energy Technology Data Exchange (ETDEWEB)

    Carter, M.

    1993-07-01

    In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.

  19. Neutrosophic Hierarchical Clustering Algoritms

    Directory of Open Access Journals (Sweden)

    Rıdvan Şahin

    2014-03-01

    Full Text Available Interval neutrosophic set (INS is a generalization of interval valued intuitionistic fuzzy set (IVIFS, whose the membership and non-membership values of elements consist of fuzzy range, while single valued neutrosophic set (SVNS is regarded as extension of intuitionistic fuzzy set (IFS. In this paper, we extend the hierarchical clustering techniques proposed for IFSs and IVIFSs to SVNSs and INSs respectively. Based on the traditional hierarchical clustering procedure, the single valued neutrosophic aggregation operator, and the basic distance measures between SVNSs, we define a single valued neutrosophic hierarchical clustering algorithm for clustering SVNSs. Then we extend the algorithm to classify an interval neutrosophic data. Finally, we present some numerical examples in order to show the effectiveness and availability of the developed clustering algorithms.

  20. El juego de imitación de Turing y el pensamiento humano

    Directory of Open Access Journals (Sweden)

    Leonardo Francisco Barón Birchenall

    2008-12-01

    Full Text Available In 1950, the English mathematician Alan Mathison Turing proposed the basis of what some authors consider the test that a machine must pass to establish that it can think. This test is basically a game; nevertheless, it has had great influence in the development of the theories of the mind performance. The game specifications and some of its repercussions in the conception of thinking, the consciousness and the human will, will be ramifications of the path that will take us through the beginning of the artificial intelligence, passing along some of its singular manifestations, to culminate in the posing of certain restrictions of its fundaments.

  1. Conditions for experimental Boson-sampling computer to disprove the Extended Church-Turing thesis

    CERN Document Server

    Shchesnovich, V S

    2014-01-01

    We consider the experimentally verifiable Extended Church-Turing thesis and derive sufficient conditions for an imperfect experimental realization of the Boson-sampling computer of Aaronson & Arkhipov to disprove it. Since the effect of the photon mode mismatch and the network imperfections (noise) are already known, we focus on the multi-photon and vacuum components of the input, the photons losses, and the detector dark counts. The main result is the complete set of sufficient conditions on the experimental imperfections for scalability of the experimental BS computer.

  2. Photonic information processing beyond Turing: an optoelectronic implementation of reservoir computing.

    Science.gov (United States)

    Larger, L; Soriano, M C; Brunner, D; Appeltant, L; Gutierrez, J M; Pesquera, L; Mirasso, C R; Fischer, I

    2012-01-30

    Many information processing challenges are difficult to solve with traditional Turing or von Neumann approaches. Implementing unconventional computational methods is therefore essential and optics provides promising opportunities. Here we experimentally demonstrate optical information processing using a nonlinear optoelectronic oscillator subject to delayed feedback. We implement a neuro-inspired concept, called Reservoir Computing, proven to possess universal computational capabilities. We particularly exploit the transient response of a complex dynamical system to an input data stream. We employ spoken digit recognition and time series prediction tasks as benchmarks, achieving competitive processing figures of merit.

  3. Programming Turing Machines as a game for technology sense-making

    DEFF Research Database (Denmark)

    Valente, Andrea; Marchetti, Emanuela

    2011-01-01

    To gain a better understanding of the process through which technology users become technology creators, we designed a paper-based, tangible Turing Machine and introduced it to 54 teenage students. The information collected through tinkering tasks and a questionnaire is discussed both via...... statistics and qualitative analysis. This initial study suggests that simple paper tangibles and tinkering have a place in future, technology-enhanced learning, and that central technological concepts can be discussed on the basis of low-cost tabletop-like games. We also notice a general interest...

  4. Dynamics of Turing and Faraday instabilities in a longitudinally modulated fiber-ring cavity.

    Science.gov (United States)

    Copie, F; Conforti, M; Kudlinski, A; Trillo, S; Mussot, A

    2017-02-01

    We experimentally investigate the round-trip-to-round-trip dynamics of the modulation instability spectrum in a passive fiber-ring cavity presenting an inhomogeneous dispersion profile. By implementing a real-time spectroscopy technique, we are able to record successive single-shot spectra, which display the evolution of the system toward a stationary state. We find that the two instability regimes (Turing and Faraday) that compete in this kind of inhomogeneous cavity not only differ by their characteristic frequency but also by their dynamical behavior. The dynamic transition between those two regimes of instability is also presented.

  5. Hierarchical Porous Structures

    Energy Technology Data Exchange (ETDEWEB)

    Grote, Christopher John [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2016-06-07

    Materials Design is often at the forefront of technological innovation. While there has always been a push to generate increasingly low density materials, such as aero or hydrogels, more recently the idea of bicontinuous structures has gone more into play. This review will cover some of the methods and applications for generating both porous, and hierarchically porous structures.

  6. Turing pattern formation in the chlorine dioxide-iodine- malonic acid reaction-diffusion system

    Science.gov (United States)

    Setayeshgar, Sima

    The formation of localized structures in the chlorine dioxide-idodine-malonic acid (CDIMA) reaction-diffusion system is investigated numerically using a realistic model of this system. We analyze the one-dimensional patterns formed along the gradients imposed by boundary feeds, and study their linear stability to symmetry- breaking perturbations (the Turing instability) in the plane transverse to these gradients. We establish that an often-invoked simple local linear analysis which neglects longitudinal diffusion is inappropriate for predicting the linear stability of these patterns. Using a fully nonuniform analysis, we investigate the structure of the patterns formed along the gradients and their stability to transverse Turing pattern formation as a function of the values of two control parameters: the malonic acid feed concentration and the size of the reactor in the dimension along the gradients. The results from this investigation are compared with existing experimental results. We also verify that the two-variable reduction of the chemical model employed in the linear stability analysis is justified. Finally, we present numerical solution of the CDIMA system in two dimensions which is in qualitative agreement with experiments. This result also confirms our linear stability analysis, while demonstrating the feasibility of numerical exploration of realistic chemical models.

  7. Helical Turing patterns in the Lengyel-Epstein model in thin cylindrical layers.

    Science.gov (United States)

    Bánsági, T; Taylor, A F

    2015-06-01

    The formation of Turing patterns was investigated in thin cylindrical layers using the Lengyel-Epstein model of the chlorine dioxide-iodine-malonic acid reaction. The influence of the width of the layer W and the diameter D of the inner cylinder on the pattern with intrinsic wavelength l were determined in simulations with initial random noise perturbations to the uniform state for W < l/2 and D ∼ l or lower. We show that the geometric constraints of the reaction domain may result in the formation of helical Turing patterns with parameters that give stripes (b = 0.2) or spots (b = 0.37) in two dimensions. For b = 0.2, the helices were composed of lamellae and defects were likely as the diameter of the cylinder increased. With b = 0.37, the helices consisted of semi-cylinders and the orientation of stripes on the outer surface (and hence winding number) increased with increasing diameter until a new stripe appeared.

  8. Toward Perceiving Robots as Humans: Three Handshake Models Face the Turing-Like Handshake Test.

    Science.gov (United States)

    Avraham, G; Nisky, I; Fernandes, H L; Acuna, D E; Kording, K P; Loeb, G E; Karniel, A

    2012-01-01

    In the Turing test a computer model is deemed to "think intelligently" if it can generate answers that are indistinguishable from those of a human. We developed an analogous Turing-like handshake test to determine if a machine can produce similarly indistinguishable movements. The test is administered through a telerobotic system in which an interrogator holds a robotic stylus and interacts with another party - artificial or human with varying levels of noise. The interrogator is asked which party seems to be more human. Here, we compare the human-likeness levels of three different models for handshake: (1) Tit-for-Tat model, (2) λ model, and (3) Machine Learning model. The Tit-for-Tat and the Machine Learning models generated handshakes that were perceived as the most human-like among the three models that were tested. Combining the best aspects of each of the three models into a single robotic handshake algorithm might allow us to advance our understanding of the way the nervous system controls sensorimotor interactions and further improve the human-likeness of robotic handshakes.

  9. Finite cell-size effects on protein variability in Turing patterned tissues.

    Science.gov (United States)

    Buceta, Javier

    2017-08-01

    Herein we present a framework to characterize different sources of protein expression variability in Turing patterned tissues. In this context, we introduce the concept of granular noise to account for the unavoidable fluctuations due to finite cell-size effects and show that the nearest-neighbours autocorrelation function provides the means to measure it. To test our findings, we perform in silico experiments of growing tissues driven by a generic activator-inhibitor dynamics. Our results show that the relative importance of different sources of noise depends on the ratio between the characteristic size of cells and that of the pattern domains and on the ratio between the pattern amplitude and the effective intensity of the biochemical fluctuations. Importantly, our framework provides the tools to measure and distinguish different stochastic contributions during patterning: granularity versus biochemical noise. In addition, our analysis identifies the protein species that buffer the stochasticity the best and, consequently, it can help to determine key instructive signals in systems driven by a Turing instability. Altogether, we expect our study to be relevant in developmental processes leading to the formation of periodic patterns in tissues. © 2017 The Author(s).

  10. Helical Turing patterns in the Lengyel-Epstein model in thin cylindrical layers

    Energy Technology Data Exchange (ETDEWEB)

    Bánsági, T.; Taylor, A. F., E-mail: A.F.Taylor@sheffield.ac.uk [Department of Chemical and Biological Engineering, University of Sheffield, Mappin Street, Sheffield, S1 3JD (United Kingdom)

    2015-06-15

    The formation of Turing patterns was investigated in thin cylindrical layers using the Lengyel-Epstein model of the chlorine dioxide-iodine-malonic acid reaction. The influence of the width of the layer W and the diameter D of the inner cylinder on the pattern with intrinsic wavelength l were determined in simulations with initial random noise perturbations to the uniform state for W < l/2 and D ∼ l or lower. We show that the geometric constraints of the reaction domain may result in the formation of helical Turing patterns with parameters that give stripes (b = 0.2) or spots (b = 0.37) in two dimensions. For b = 0.2, the helices were composed of lamellae and defects were likely as the diameter of the cylinder increased. With b = 0.37, the helices consisted of semi-cylinders and the orientation of stripes on the outer surface (and hence winding number) increased with increasing diameter until a new stripe appeared.

  11. Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines.

    Directory of Open Access Journals (Sweden)

    Fernando Soler-Toscano

    Full Text Available Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all Σ(n=1(11 2(n binary strings of length n<12 and for most strings of length 12≤n≤16 by running all ~2.5 x 10(13 Turing machines with 5 states and 2 symbols (8 x 22(9 with reduction techniques using the most standard formalism of Turing machines, used in for example the Busy Beaver problem. We address the question of stability and error estimation, the sensitivity of the continued application of the method for wider coverage and better accuracy, and provide statistical evidence suggesting robustness. As with compression algorithms, this work promises to deliver a range of applications, and to provide insight into the question of complexity calculation of finite (and short strings. Additional material can be found at the Algorithmic Nature Group website at http://www.algorithmicnature.org. An Online Algorithmic Complexity Calculator implementing this technique and making the data available to the research community is accessible at http://www.complexitycalculator.com.

  12. Niépce–Bell or Turing: how to test odour reproduction

    Science.gov (United States)

    2016-01-01

    Decades before the existence of anything resembling an artificial intelligence system, Alan Turing raised the question of how to test whether machines can think, or, in modern terminology, whether a computer claimed to exhibit intelligence indeed does so. This paper raises the analogous issue for olfaction: how to test the validity of a system claimed to reproduce arbitrary odours artificially, in a way recognizable to humans. Although odour reproduction systems are still far from being viable, the question of how to test candidates thereof is claimed to be interesting and non-trivial, and a novel method is proposed. Despite the similarity between the two questions and their surfacing long before the tested systems exist, the present question cannot be answered adequately by a Turing-like method. Instead, our test is very different: it is conditional, requiring from the artificial no more than is required from the original, and it employs a novel method of immersion that takes advantage of the availability of easily recognizable reproduction methods for sight and sound, a la Nicéphore Niépce and Alexander Graham Bell. PMID:28003527

  13. How animals get their skin patterns: fish pigment pattern as a live Turing wave.

    Science.gov (United States)

    Kondo, Shigeru; Iwashita, Motoko; Yamaguchi, Motoomi

    2009-01-01

    It is more than fifty years since Alan Turing first presented the reaction-diffusion (RD) model, to account for the mechanism of biological pattern formation. In the paper entitled "The chemical basis of morphogenesis", Turing concluded that spatial patterns autonomously made in the embryo are generated as the stationary wave of the chemical (cellular) reactions. Although this novel idea was paid little attention by experimental biologists, recent experimental data are suggesting that the RD mechanism really functions in some of the course of animal development. Among the phenomena in which involvement of the RD mechanism is suspected, the striped pigment pattern of zebrafish has been highlighted as an ideal model system for the following reasons: the stationary wave made by the RD mechanism stays alive and can be observed only in the fish skin; and in zebrafish, we can utilize genomic information and molecular genetic techniques to clarify the molecular basis of pattern formation. In this review, we summarize recent progresses in the study of zebrafish pigment pattern formation that is uncovering how the RD wave is made and maintained in the skin.

  14. Turing mechanism for homeostatic control of synaptic density during C. elegans growth

    Science.gov (United States)

    Brooks, Heather A.; Bressloff, Paul C.

    2017-07-01

    We propose a mechanism for the homeostatic control of synapses along the ventral cord of Caenorhabditis elegans during development, based on a form of Turing pattern formation on a growing domain. C. elegans is an important animal model for understanding cellular mechanisms underlying learning and memory. Our mathematical model consists of two interacting chemical species, where one is passively diffusing and the other is actively trafficked by molecular motors, which switch between forward and backward moving states (bidirectional transport). This differs significantly from the standard mechanism for Turing pattern formation based on the interaction between fast and slow diffusing species. We derive evolution equations for the chemical concentrations on a slowly growing one-dimensional domain, and use numerical simulations to demonstrate the insertion of new concentration peaks as the length increases. Taking the passive component to be the protein kinase CaMKII and the active component to be the glutamate receptor GLR-1, we interpret the concentration peaks as sites of new synapses along the length of C. elegans, and thus show how the density of synaptic sites can be maintained.

  15. Implications of the Turing machine model of computation for processor and programming language design

    Science.gov (United States)

    Hunter, Geoffrey

    2004-01-01

    A computational process is classified according to the theoretical model that is capable of executing it; computational processes that require a non-predeterminable amount of intermediate storage for their execution are Turing-machine (TM) processes, while those whose storage are predeterminable are Finite Automation (FA) processes. Simple processes (such as traffic light controller) are executable by Finite Automation, whereas the most general kind of computation requires a Turing Machine for its execution. This implies that a TM process must have a non-predeterminable amount of memory allocated to it at intermediate instants of its execution; i.e. dynamic memory allocation. Many processes encountered in practice are TM processes. The implication for computational practice is that the hardware (CPU) architecture and its operating system must facilitate dynamic memory allocation, and that the programming language used to specify TM processes must have statements with the semantic attribute of dynamic memory allocation, for in Alan Turing"s thesis on computation (1936) the "standard description" of a process is invariant over the most general data that the process is designed to process; i.e. the program describing the process should never have to be modified to allow for differences in the data that is to be processed in different instantiations; i.e. data-invariant programming. Any non-trivial program is partitioned into sub-programs (procedures, subroutines, functions, modules, etc). Examination of the calls/returns between the subprograms reveals that they are nodes in a tree-structure; this tree-structure is independent of the programming language used to encode (define) the process. Each sub-program typically needs some memory for its own use (to store values intermediate between its received data and its computed results); this locally required memory is not needed before the subprogram commences execution, and it is not needed after its execution terminates

  16. TURING MACHINE AS UNIVERSAL ALGORITHM EXECUTOR AND ITS APPLICATION IN THE PROCESS OF HIGH-SCHOOL STUDENTS` ADVANCED STUDY OF ALGORITHMIZATION AND PROGRAMMING FUNDAMENTALS

    Directory of Open Access Journals (Sweden)

    Oleksandr B. Yashchyk

    2016-05-01

    Full Text Available The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific research of modern scientists devoted to this issue and found the main principles of the Turing machine as an abstract mathematical model. The process of forming information competencies components, information culture and students` logical thinking development with the inclusion of the topic “Study and Application of Turing machine as Universal Algorithm Executor” in the course of Informatics was analyzed.

  17. Collaborative Hierarchical Sparse Modeling

    CERN Document Server

    Sprechmann, Pablo; Sapiro, Guillermo; Eldar, Yonina C

    2010-01-01

    Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is done by solving an l_1-regularized linear regression problem, usually called Lasso. In this work we first combine the sparsity-inducing property of the Lasso model, at the individual feature level, with the block-sparsity property of the group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the hierarchical Lasso, which shows important practical modeling advantages. We then extend this approach to the collaborative case, where a set of simultaneously coded signals share the same sparsity pattern at the higher (group) level but not necessarily at the lower one. Signals then share the same active groups, or classes, but not necessarily the same active set. This is very well suited for applications such as source separation. An efficient optimization procedure, which guarantees convergence to the global opt...

  18. Hierarchical manifold learning.

    Science.gov (United States)

    Bhatia, Kanwal K; Rao, Anil; Price, Anthony N; Wolz, Robin; Hajnal, Jo; Rueckert, Daniel

    2012-01-01

    We present a novel method of hierarchical manifold learning which aims to automatically discover regional variations within images. This involves constructing manifolds in a hierarchy of image patches of increasing granularity, while ensuring consistency between hierarchy levels. We demonstrate its utility in two very different settings: (1) to learn the regional correlations in motion within a sequence of time-resolved images of the thoracic cavity; (2) to find discriminative regions of 3D brain images in the classification of neurodegenerative disease,

  19. Hierarchically Structured Electrospun Fibers

    Directory of Open Access Journals (Sweden)

    Nicole E. Zander

    2013-01-01

    Full Text Available Traditional electrospun nanofibers have a myriad of applications ranging from scaffolds for tissue engineering to components of biosensors and energy harvesting devices. The generally smooth one-dimensional structure of the fibers has stood as a limitation to several interesting novel applications. Control of fiber diameter, porosity and collector geometry will be briefly discussed, as will more traditional methods for controlling fiber morphology and fiber mat architecture. The remainder of the review will focus on new techniques to prepare hierarchically structured fibers. Fibers with hierarchical primary structures—including helical, buckled, and beads-on-a-string fibers, as well as fibers with secondary structures, such as nanopores, nanopillars, nanorods, and internally structured fibers and their applications—will be discussed. These new materials with helical/buckled morphology are expected to possess unique optical and mechanical properties with possible applications for negative refractive index materials, highly stretchable/high-tensile-strength materials, and components in microelectromechanical devices. Core-shell type fibers enable a much wider variety of materials to be electrospun and are expected to be widely applied in the sensing, drug delivery/controlled release fields, and in the encapsulation of live cells for biological applications. Materials with a hierarchical secondary structure are expected to provide new superhydrophobic and self-cleaning materials.

  20. HDS: Hierarchical Data System

    Science.gov (United States)

    Pearce, Dave; Walter, Anton; Lupton, W. F.; Warren-Smith, Rodney F.; Lawden, Mike; McIlwrath, Brian; Peden, J. C. M.; Jenness, Tim; Draper, Peter W.

    2015-02-01

    The Hierarchical Data System (HDS) is a file-based hierarchical data system designed for the storage of a wide variety of information. It is particularly suited to the storage of large multi-dimensional arrays (with their ancillary data) where efficient access is needed. It is a key component of the Starlink software collection (ascl:1110.012) and is used by the Starlink N-Dimensional Data Format (NDF) library (ascl:1411.023). HDS organizes data into hierarchies, broadly similar to the directory structure of a hierarchical filing system, but contained within a single HDS container file. The structures stored in these files are self-describing and flexible; HDS supports modification and extension of structures previously created, as well as functions such as deletion, copying, and renaming. All information stored in HDS files is portable between the machines on which HDS is implemented. Thus, there are no format conversion problems when moving between machines. HDS can write files in a private binary format (version 4), or be layered on top of HDF5 (version 5).

  1. Hierarchical video summarization

    Science.gov (United States)

    Ratakonda, Krishna; Sezan, M. Ibrahim; Crinon, Regis J.

    1998-12-01

    We address the problem of key-frame summarization of vide in the absence of any a priori information about its content. This is a common problem that is encountered in home videos. We propose a hierarchical key-frame summarization algorithm where a coarse-to-fine key-frame summary is generated. A hierarchical key-frame summary facilitates multi-level browsing where the user can quickly discover the content of the video by accessing its coarsest but most compact summary and then view a desired segment of the video with increasingly more detail. At the finest level, the summary is generated on the basis of color features of video frames, using an extension of a recently proposed key-frame extraction algorithm. The finest level key-frames are recursively clustered using a novel pairwise K-means clustering approach with temporal consecutiveness constraint. We also address summarization of MPEG-2 compressed video without fully decoding the bitstream. We also propose efficient mechanisms that facilitate decoding the video when the hierarchical summary is utilized in browsing and playback of video segments starting at selected key-frames.

  2. Using a Graphics Turing Test to Evaluate the Effect of Frame Rate and Motion Blur on Telepresence of Animated Objects

    OpenAIRE

    Borg, Mathias; Johansen, Stine Schmieg; Krog, Kim Srirat; Thomsen, Dennis Lundgaard; Kraus, Martin

    2013-01-01

    A limited Graphics Turing Test is used to determine the frame rate that is required to achieve telepresence of an animated object. For low object velocities of 2.25 and 4.5 degrees of visual angle per second at 60 frames per second a rotating object with no added motion blur is able to pass the test. The results of the experiments confirm previous results in psychophysics and show that the Graphics Turing Test is a useful tool in computer graphics. Even with simulated motion blur, our Graphic...

  3. The Society of Brains: How Alan Turing and Marvin Minsky Were Both Right

    Science.gov (United States)

    Struzik, Zbigniew R.

    2015-04-01

    In his well-known prediction, Alan Turing stated that computer intelligence would surpass human intelligence by the year 2000. Although the Turing Test, as it became known, was devised to be played by one human against one computer, this is not a fair setup. Every human is a part of a social network, and a fairer comparison would be a contest between one human at the console and a network of computers behind the console. Around the year 2000, the number of web pages on the WWW overtook the number of neurons in the human brain. But these websites would be of little use without the ability to search for knowledge. By the year 2000 Google Inc. had become the search engine of choice, and the WWW became an intelligent entity. This was not without good reason. The basis for the search engine was the analysis of the ’network of knowledge’. The PageRank algorithm, linking information on the web according to the hierarchy of ‘link popularity’, continues to provide the basis for all of Google's web search tools. While PageRank was developed by Larry Page and Sergey Brin in 1996 as part of a research project about a new kind of search engine, PageRank is in its essence the key to representing and using static knowledge in an emergent intelligent system. Here I argue that Alan Turing was right, as hybrid human-computer internet machines have already surpassed our individual intelligence - this was done around the year 2000 by the Internet - the socially-minded, human-computer hybrid Homo computabilis-socialis. Ironically, the Internet's intelligence also emerged to a large extent from ‘exploiting’ humans - the key to the emergence of machine intelligence has been discussed by Marvin Minsky in his work on the foundations of intelligence through interacting agents’ knowledge. As a consequence, a decade and a half decade into the 21st century, we appear to be much better equipped to tackle the problem of the social origins of humanity - in particular thanks to the

  4. 20世纪最伟大的智者之一Alan Turing

    Institute of Scientific and Technical Information of China (English)

    宋方敏

    2000-01-01

    @@ 美国TIME杂志在1999年出版了专卷介绍20世纪100个最伟大的智者,数学有Kurt Godel,物理有 Albert Einstein,后来Einstein列为The person of the 20thcentury.在计算机科学领域中英国数理逻辑学家Alan Turing 被列入其中.Turing对于人类的杰出贡献,使他成为20世纪最有影响的科学家和思想家之一.本文介绍Alan Turing的生平和主要工作,以此纪念计算机科学的奠基人.

  5. Simple and Superlattice Turing Patterns in Reaction-Diffusion Systems Bifurcation, Bistability, and Parameter Collapse

    CERN Document Server

    Judd, S L; Judd, Stephen L.; Silber, Mary

    1998-01-01

    This paper investigates the competition between both simple (e.g. stripes, hexagons) and ``superlattice'' (super squares, super hexagons) Turing patterns in two-component reaction-diffusion systems. ``Superlattice'' patterns are formed from eight or twelve Fourier modes, and feature structure at two different length scales. Using perturbation theory, we derive simple analytical expressions for the bifurcation equation coefficients on both rhombic and hexagonal lattices. These expressions show that, no matter how complicated the reaction kinectics, the nonlinear reaction terms reduce to just four effective terms within the bifurcation equation coefficients. Moreover, at the hexagonal degeneracy -- when the quadratic term in the hexagonal bifurcation equation disappears -- the number of effective system parameters drops to two, allowing a complete characterization of the possible bifurcation results at this degeneracy. The general results are then applied to specific model equations, to investigate the stabilit...

  6. Turing Bifurcation and Pattern Formation of Stochastic Reaction-Diffusion System

    Directory of Open Access Journals (Sweden)

    Qianiqian Zheng

    2017-01-01

    Full Text Available Noise is ubiquitous in a system and can induce some spontaneous pattern formations on a spatially homogeneous domain. In comparison to the Reaction-Diffusion System (RDS, Stochastic Reaction-Diffusion System (SRDS is more complex and it is very difficult to deal with the noise function. In this paper, we have presented a method to solve it and obtained the conditions of how the Turing bifurcation and Hopf bifurcation arise through linear stability analysis of local equilibrium. In addition, we have developed the amplitude equation with a pair of wave vector by using Taylor series expansion, multiscaling, and further expansion in powers of small parameter. Our analysis facilitates finding regions of bifurcations and understanding the pattern formation mechanism of SRDS. Finally, the simulation shows that the analytical results agree with numerical simulation.

  7. Turing pattern formation on the sphere for a morphochemical reaction-diffusion model for electrodeposition

    Science.gov (United States)

    Lacitignola, Deborah; Bozzini, Benedetto; Frittelli, Massimo; Sgura, Ivonne

    2017-07-01

    The present paper deals with the pattern formation properties of a specific morpho-electrochemical reaction-diffusion model on a sphere. The physico-chemical background to this study is the morphological control of material electrodeposited onto spherical particles. The particular experimental case of interest refers to the optimization of novel metal-air flow batteries and addresses the electrodeposition of zinc onto inert spherical supports. Morphological control in this step of the high-energy battery operation is crucial to the energetic efficiency of the recharge process and to the durability of the whole energy-storage device. To rationalise this technological challenge within a mathematical modeling perspective, we consider the reaction-diffusion system for metal electrodeposition introduced in [Bozzini et al., J. Solid State Electr.17, 467-479 (2013)] and extend its study to spherical domains. Conditions are derived for the occurrence of the Turing instability phenomenon and the steady patterns emerging at the onset of Turing instability are investigated. The reaction-diffusion system on spherical domains is solved numerically by means of the Lumped Surface Finite Element Method (LSFEM) in space combined with the IMEX Euler method in time. The effect on pattern formation of variations in the domain size is investigated both qualitatively, by means of systematic numerical simulations, and quantitatively by introducing suitable indicators that allow to assign each pattern to a given morphological class. An experimental validation of the obtained results is finally presented for the case of zinc electrodeposition from alkaline zincate solutions onto copper spheres.

  8. Detecting Hierarchical Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard;

    2012-01-01

    a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure......Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....

  9. Context updates are hierarchical

    Directory of Open Access Journals (Sweden)

    Anton Karl Ingason

    2016-10-01

    Full Text Available This squib studies the order in which elements are added to the shared context of interlocutors in a conversation. It focuses on context updates within one hierarchical structure and argues that structurally higher elements are entered into the context before lower elements, even if the structurally higher elements are pronounced after the lower elements. The crucial data are drawn from a comparison of relative clauses in two head-initial languages, English and Icelandic, and two head-final languages, Korean and Japanese. The findings have consequences for any theory of a dynamic semantics.

  10. Forging patterns and making waves from biology to geology: a commentary on Turing (1952) 'The chemical basis of morphogenesis'.

    Science.gov (United States)

    Ball, Philip

    2015-04-19

    Alan Turing was neither a biologist nor a chemist, and yet the paper he published in 1952, 'The chemical basis of morphogenesis', on the spontaneous formation of patterns in systems undergoing reaction and diffusion of their ingredients has had a substantial impact on both fields, as well as in other areas as disparate as geomorphology and criminology. Motivated by the question of how a spherical embryo becomes a decidedly non-spherical organism such as a human being, Turing devised a mathematical model that explained how random fluctuations can drive the emergence of pattern and structure from initial uniformity. The spontaneous appearance of pattern and form in a system far away from its equilibrium state occurs in many types of natural process, and in some artificial ones too. It is often driven by very general mechanisms, of which Turing's model supplies one of the most versatile. For that reason, these patterns show striking similarities in systems that seem superficially to share nothing in common, such as the stripes of sand ripples and of pigmentation on a zebra skin. New examples of 'Turing patterns' in biology and beyond are still being discovered today. This commentary was written to celebrate the 350th anniversary of the journal Philosophical Transactions of the Royal Society.

  11. Hierarchical partial order ranking.

    Science.gov (United States)

    Carlsen, Lars

    2008-09-01

    Assessing the potential impact on environmental and human health from the production and use of chemicals or from polluted sites involves a multi-criteria evaluation scheme. A priori several parameters are to address, e.g., production tonnage, specific release scenarios, geographical and site-specific factors in addition to various substance dependent parameters. Further socio-economic factors may be taken into consideration. The number of parameters to be included may well appear to be prohibitive for developing a sensible model. The study introduces hierarchical partial order ranking (HPOR) that remedies this problem. By HPOR the original parameters are initially grouped based on their mutual connection and a set of meta-descriptors is derived representing the ranking corresponding to the single groups of descriptors, respectively. A second partial order ranking is carried out based on the meta-descriptors, the final ranking being disclosed though average ranks. An illustrative example on the prioritization of polluted sites is given.

  12. Trees and Hierarchical Structures

    CERN Document Server

    Haeseler, Arndt

    1990-01-01

    The "raison d'etre" of hierarchical dustering theory stems from one basic phe­ nomenon: This is the notorious non-transitivity of similarity relations. In spite of the fact that very often two objects may be quite similar to a third without being that similar to each other, one still wants to dassify objects according to their similarity. This should be achieved by grouping them into a hierarchy of non-overlapping dusters such that any two objects in ~ne duster appear to be more related to each other than they are to objects outside this duster. In everyday life, as well as in essentially every field of scientific investigation, there is an urge to reduce complexity by recognizing and establishing reasonable das­ sification schemes. Unfortunately, this is counterbalanced by the experience of seemingly unavoidable deadlocks caused by the existence of sequences of objects, each comparatively similar to the next, but the last rather different from the first.

  13. Hierarchical Affinity Propagation

    CERN Document Server

    Givoni, Inmar; Frey, Brendan J

    2012-01-01

    Affinity propagation is an exemplar-based clustering algorithm that finds a set of data-points that best exemplify the data, and associates each datapoint with one exemplar. We extend affinity propagation in a principled way to solve the hierarchical clustering problem, which arises in a variety of domains including biology, sensor networks and decision making in operational research. We derive an inference algorithm that operates by propagating information up and down the hierarchy, and is efficient despite the high-order potentials required for the graphical model formulation. We demonstrate that our method outperforms greedy techniques that cluster one layer at a time. We show that on an artificial dataset designed to mimic the HIV-strain mutation dynamics, our method outperforms related methods. For real HIV sequences, where the ground truth is not available, we show our method achieves better results, in terms of the underlying objective function, and show the results correspond meaningfully to geographi...

  14. Optimisation by hierarchical search

    Science.gov (United States)

    Zintchenko, Ilia; Hastings, Matthew; Troyer, Matthias

    2015-03-01

    Finding optimal values for a set of variables relative to a cost function gives rise to some of the hardest problems in physics, computer science and applied mathematics. Although often very simple in their formulation, these problems have a complex cost function landscape which prevents currently known algorithms from efficiently finding the global optimum. Countless techniques have been proposed to partially circumvent this problem, but an efficient method is yet to be found. We present a heuristic, general purpose approach to potentially improve the performance of conventional algorithms or special purpose hardware devices by optimising groups of variables in a hierarchical way. We apply this approach to problems in combinatorial optimisation, machine learning and other fields.

  15. How hierarchical is language use?

    Science.gov (United States)

    Frank, Stefan L.; Bod, Rens; Christiansen, Morten H.

    2012-01-01

    It is generally assumed that hierarchical phrase structure plays a central role in human language. However, considerations of simplicity and evolutionary continuity suggest that hierarchical structure should not be invoked too hastily. Indeed, recent neurophysiological, behavioural and computational studies show that sequential sentence structure has considerable explanatory power and that hierarchical processing is often not involved. In this paper, we review evidence from the recent literature supporting the hypothesis that sequential structure may be fundamental to the comprehension, production and acquisition of human language. Moreover, we provide a preliminary sketch outlining a non-hierarchical model of language use and discuss its implications and testable predictions. If linguistic phenomena can be explained by sequential rather than hierarchical structure, this will have considerable impact in a wide range of fields, such as linguistics, ethology, cognitive neuroscience, psychology and computer science. PMID:22977157

  16. How hierarchical is language use?

    Science.gov (United States)

    Frank, Stefan L; Bod, Rens; Christiansen, Morten H

    2012-11-22

    It is generally assumed that hierarchical phrase structure plays a central role in human language. However, considerations of simplicity and evolutionary continuity suggest that hierarchical structure should not be invoked too hastily. Indeed, recent neurophysiological, behavioural and computational studies show that sequential sentence structure has considerable explanatory power and that hierarchical processing is often not involved. In this paper, we review evidence from the recent literature supporting the hypothesis that sequential structure may be fundamental to the comprehension, production and acquisition of human language. Moreover, we provide a preliminary sketch outlining a non-hierarchical model of language use and discuss its implications and testable predictions. If linguistic phenomena can be explained by sequential rather than hierarchical structure, this will have considerable impact in a wide range of fields, such as linguistics, ethology, cognitive neuroscience, psychology and computer science.

  17. Associative Hierarchical Random Fields.

    Science.gov (United States)

    Ladický, L'ubor; Russell, Chris; Kohli, Pushmeet; Torr, Philip H S

    2014-06-01

    This paper makes two contributions: the first is the proposal of a new model-The associative hierarchical random field (AHRF), and a novel algorithm for its optimization; the second is the application of this model to the problem of semantic segmentation. Most methods for semantic segmentation are formulated as a labeling problem for variables that might correspond to either pixels or segments such as super-pixels. It is well known that the generation of super pixel segmentations is not unique. This has motivated many researchers to use multiple super pixel segmentations for problems such as semantic segmentation or single view reconstruction. These super-pixels have not yet been combined in a principled manner, this is a difficult problem, as they may overlap, or be nested in such a way that the segmentations form a segmentation tree. Our new hierarchical random field model allows information from all of the multiple segmentations to contribute to a global energy. MAP inference in this model can be performed efficiently using powerful graph cut based move making algorithms. Our framework generalizes much of the previous work based on pixels or segments, and the resulting labelings can be viewed both as a detailed segmentation at the pixel level, or at the other extreme, as a segment selector that pieces together a solution like a jigsaw, selecting the best segments from different segmentations as pieces. We evaluate its performance on some of the most challenging data sets for object class segmentation, and show that this ability to perform inference using multiple overlapping segmentations leads to state-of-the-art results.

  18. Modeling hierarchical structures - Hierarchical Linear Modeling using MPlus

    CERN Document Server

    Jelonek, M

    2006-01-01

    The aim of this paper is to present the technique (and its linkage with physics) of overcoming problems connected to modeling social structures, which are typically hierarchical. Hierarchical Linear Models provide a conceptual and statistical mechanism for drawing conclusions regarding the influence of phenomena at different levels of analysis. In the social sciences it is used to analyze many problems such as educational, organizational or market dilemma. This paper introduces the logic of modeling hierarchical linear equations and estimation based on MPlus software. I present my own model to illustrate the impact of different factors on school acceptation level.

  19. How much of quantum mechanics is really needed to defy Extended Church-Turing Thesis?

    CERN Document Server

    Gurvits, Leonid; Singh, Sudhir Kumar; Vatan, Farrokh

    2011-01-01

    Extended Church-Turing Thesis(ECT) asserts that any reasonable model of computation can be simulated by a BPP algorithm. Several fundamental questions arise when we take ECT seriously as a statement not just about mathematics but about the physical reality. In particular, what can we say about the validity of ECT when we take quantum mechanics aboard in our notion of efficient computability? We have a BQP algorithm for Abelian Hidden Subgroup Problem (HSP) but we do not know of any BPP algorithm for the same, so if quantum mechanics is true then HSP can potentially refute ECT. An immediate question is if there are other natural candidate problems potentially tenable to refute ECT. Recent results of Freedman et al and Aharonov et al shows that additively approximating Jones polynomials is exactly what BQP is capable of and therefore provides such an example. But do we really need the full power of quantum computers for ECT to be false? We ask, is there a natural subclass of BQP which is not even universal for ...

  20. The Landauer Resistance and Band Spectra for the Counting Quantum Turing Machine

    CERN Document Server

    Benioff, P

    1998-01-01

    The generalized counting quantum Turing machine (GCQTM) is a machine which, for any N, enumerates the first $2^{N}$ integers in succession as binary strings. The generalization consists of associating a potential with read-1 steps only. The Landauer Resistance (LR) and band spectra were determined for the tight binding Hamiltonians associated with the GCQTM for energies both above and below the potential height. For parameters and potentials in the electron region, the LR fluctuates rapidly between very high and very low values as a function of momentum. The rapidity and extent of the fluctuations increases rapidly with increasing N. For N=18, the largest value considered, the LR shows good transmission probability as a function of momentum with numerous holes of very high LR values present. This is true for energies above and below the potential height. It is suggested that the main features of the LR can be explained by coherent superposition of the component waves reflected from or transmitted through the ...

  1. Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems.

    Science.gov (United States)

    Braverman, Mark; Schneider, Jonathan; Rojas, Cristóbal

    2015-08-28

    We report a new limitation on the ability of physical systems to perform computation-one that is based on generalizing the notion of memory, or storage space, available to the system to perform the computation. Roughly, we define memory as the maximal amount of information that the evolving system can carry from one instant to the next. We show that memory is a limiting factor in computation even in lieu of any time limitations on the evolving system-such as when considering its equilibrium regime. We call this limitation the space-bounded Church-Turing thesis (SBCT). The SBCT is supported by a simulation assertion (SA), which states that predicting the long-term behavior of bounded-memory systems is computationally tractable. In particular, one corollary of SA is an explicit bound on the computational hardness of the long-term behavior of a discrete-time finite-dimensional dynamical system that is affected by noise. We prove such a bound explicitly.

  2. Archaeology in the Átures Rapids of the Middle Orinoco, Venezuela

    Directory of Open Access Journals (Sweden)

    Natalia Lozada Mendieta

    2016-12-01

    Full Text Available This paper briefly reports on the initial results of a new Leverhulme-sponsored four-year archaeological project (RPG 234- 2014 centred on the Átures Rapids area of the Middle Orinoco River, Amazonas State, Venezuela (Fig. 1. The Cotúa Island Reflexive Archaeology Project seeks to establish the longue durée historical processes that by early colonial times culminated in the region’s reputation for being a key crossroads – where diverse ethno-linguistic groups from far-flung regions converged to trade (Oliver et al. 2014. Harnessing new evi- dence, it aims to elucidate how interaction between such diverse indigenous groups unfolded and the role it played in forg- ing ethnogenesis. Through archaeological research, it seeks to gain new insights into its history and elucidate regional patterns of exchange through the study of technical andstylisticdimensionsofmaterialculture. It also aims to investigate the abundant pre-colonial rock art and its relationships to the landscape and aboriginal oral tradi- tions. Finally, it seeks to understand how Western and Non-western archaeological knowledge is produced by engaging with the current indigenous groups as partners in (reconstructing history.

  3. Forcing of Turing patterns in the chlorine dioxide-iodine-malonic acid reaction with strong visible light.

    Science.gov (United States)

    Nagao, Raphael; Epstein, Irving R; Dolnik, Milos

    2013-09-26

    We investigate the sensitivity of Turing patterns in the chlorine dioxide-iodine-malonic acid reaction to illumination by strong white light. Intense illumination results in an increase of [I(-)], in contrast to previous studies, which found only decreased [I(-)] for weak and intermediate intensities of illumination. We propose an expanded mechanism to explain the experimental observations. Both experimental and numerical results suggest that [ClO2] is the key parameter that determines whether the high iodide state is obtained under strong illumination. When strong illumination is applied through a spatially periodic mask with black and white stripes, a dark state with high [I(-)] is produced in the illuminated domain and a light state with low [I(-)] forms in the nonilluminated domain. Depending on the black:white ratio of the mask and its wavelength, Turing patterns can coexist with either the light or the dark state in the nonilluminated domain.

  4. Linear and Weakly Nonlinear Stability Analyses of Turing Patterns for Diffusive Predator-Prey Systems in Freshwater Marsh Landscapes.

    Science.gov (United States)

    Zhang, Li; Zhang, Fan; Ruan, Shigui

    2017-03-01

    We study a diffusive predator-prey model describing the interactions of small fishes and their resource base (small invertebrates) in the fluctuating freshwater marsh landscapes of the Florida Everglades. The spatial model is described by a reaction-diffusion system with Beddington-DeAngelis functional response. Uniform bound, local and global asymptotic stability of the steady state of the PDE model under the no-flux boundary conditions are discussed in details. Sufficient conditions on the Turing (diffusion-driven) instability which induces spatial patterns in the model are derived via linear analysis. Existence of one-dimensional and two-dimensional spatial Turing patterns, including rhombic and hexagonal patterns, are established by weakly nonlinear analyses. These results provide theoretical explanations and numerical simulations of spatial dynamical behaviors of the wetland ecosystems of the Florida Everglades.

  5. Modeling hierarchical structures - Hierarchical Linear Modeling using MPlus

    OpenAIRE

    Jelonek, Magdalena

    2006-01-01

    The aim of this paper is to present the technique (and its linkage with physics) of overcoming problems connected to modeling social structures, which are typically hierarchical. Hierarchical Linear Models provide a conceptual and statistical mechanism for drawing conclusions regarding the influence of phenomena at different levels of analysis. In the social sciences it is used to analyze many problems such as educational, organizational or market dilemma. This paper introduces the logic of m...

  6. 图灵机扫描子串技术%Technology of Scanning Substring by Turing Machine

    Institute of Scientific and Technical Information of China (English)

    陈文宇; 程小鸥; 孙世新

    2009-01-01

    某些语言中的所有句子必须包含有或者不能包含有特定的子串,或者需要将语言中句子所包含的子串进行替换.传统的方法是利用图灵机的存储技术处理该类语言.该文提出了一种图灵机扫描子串技术的新方法,即将特定子串当作一个整体,将扫描一个符号的图灵机的多个状态转换函数合并为一个,使得图灵机一次可以扫描多个符号,但图灵机的读/写头仅移动一个单元.该方法简便且有效,通过实例证明了扫描多个符号的图灵机与扫描一个符号的图灵机是等价的.%In some languages, all the sentences must include or exclude some specific substrings. Sometimes, the substrings must be replaced. It is difficult for a Turing machine to accept such languages. Traditional method is based on the storage technique. In this paper, we present a new method, the scanning substring techonology. In the method, the specific substring is treated as a single unit. Multiple status transition functions of the Turing machine are combined to scan multiple characters at one time, but the read/write head only moves one unit. Through some examples, the paper shows that the Turing machine which scans multiple characters is equivalent to a Turing machine scanning one character.

  7. 少儿图灵测试和常识处理%Children Turing test and commonsense knowledge processing

    Institute of Scientific and Technical Information of China (English)

    陆汝钤

    2008-01-01

    This talk presents our research work on children Turing test. It is implemented in a conversation system supported by a common.sense knowledge base. This system can talk to school children in a more or less natural way. The main differ-enee between it and many other conversation programs is its knowledge-based character. In this talk, motivation of children Turing test and the analysis of its results will be described. We will analyze the achievements and failures of children Turing test, its main bottlenecks, its modified versions and its relation to commonaense knowledge processing. In addition, we will propose some conjectures on Turing test under certain hypotheses and give some concluding remarks.%介绍了在少儿图灵测试方面做的一项研究.该测试用一个基于常识知识库的对话系统实现.它能用比较自然的方式和少儿对话.该系统与许多其他对话程序的区别在于它是基于常识的.介绍开展少儿图灵测试研究的动机以及对测试结果的分析.分析少儿图灵测试的成功与缺陷、其主要瓶颈、其变形版本以及它和常识处理的关系.还给出一些假设,并给出在这些假设下对图灵测试前途的一些猜想和一些结论.

  8. Hierarchical fringe tracking

    CERN Document Server

    Petrov, Romain G; Boskri, Abdelkarim; Folcher, Jean-Pierre; Lagarde, Stephane; Bresson, Yves; Benkhaldoum, Zouhair; Lazrek, Mohamed; Rakshit, Suvendu

    2014-01-01

    The limiting magnitude is a key issue for optical interferometry. Pairwise fringe trackers based on the integrated optics concepts used for example in GRAVITY seem limited to about K=10.5 with the 8m Unit Telescopes of the VLTI, and there is a general "common sense" statement that the efficiency of fringe tracking, and hence the sensitivity of optical interferometry, must decrease as the number of apertures increases, at least in the near infrared where we are still limited by detector readout noise. Here we present a Hierarchical Fringe Tracking (HFT) concept with sensitivity at least equal to this of a two apertures fringe trackers. HFT is based of the combination of the apertures in pairs, then in pairs of pairs then in pairs of groups. The key HFT module is a device that behaves like a spatial filter for two telescopes (2TSF) and transmits all or most of the flux of a cophased pair in a single mode beam. We give an example of such an achromatic 2TSF, based on very broadband dispersed fringes analyzed by g...

  9. Onboard hierarchical network

    Science.gov (United States)

    Tunesi, Luca; Armbruster, Philippe

    2004-02-01

    The objective of this paper is to demonstrate a suitable hierarchical networking solution to improve capabilities and performances of space systems, with significant recurrent costs saving and more efficient design & manufacturing flows. Classically, a satellite can be split in two functional sub-systems: the platform and the payload complement. The platform is in charge of providing power, attitude & orbit control and up/down-link services, whereas the payload represents the scientific and/or operational instruments/transponders and embodies the objectives of the mission. One major possibility to improve the performance of payloads, by limiting the data return to pertinent information, is to process data on board thanks to a proper implementation of the payload data system. In this way, it is possible to share non-recurring development costs by exploiting a system that can be adopted by the majority of space missions. It is believed that the Modular and Scalable Payload Data System, under development by ESA, provides a suitable solution to fulfil a large range of future mission requirements. The backbone of the system is the standardised high data rate SpaceWire network http://www.ecss.nl/. As complement, a lower speed command and control bus connecting peripherals is required. For instance, at instrument level, there is a need for a "local" low complexity bus, which gives the possibility to command and control sensors and actuators. Moreover, most of the connections at sub-system level are related to discrete signals management or simple telemetry acquisitions, which can easily and efficiently be handled by a local bus. An on-board hierarchical network can therefore be defined by interconnecting high-speed links and local buses. Additionally, it is worth stressing another important aspect of the design process: Agencies and ESA in particular are frequently confronted with a big consortium of geographically spread companies located in different countries, each one

  10. Hierarchical Reverberation Mapping

    CERN Document Server

    Brewer, Brendon J

    2013-01-01

    Reverberation mapping (RM) is an important technique in studies of active galactic nuclei (AGN). The key idea of RM is to measure the time lag $\\tau$ between variations in the continuum emission from the accretion disc and subsequent response of the broad line region (BLR). The measurement of $\\tau$ is typically used to estimate the physical size of the BLR and is combined with other measurements to estimate the black hole mass $M_{\\rm BH}$. A major difficulty with RM campaigns is the large amount of data needed to measure $\\tau$. Recently, Fine et al (2012) introduced a new approach to RM where the BLR light curve is sparsely sampled, but this is counteracted by observing a large sample of AGN, rather than a single system. The results are combined to infer properties of the sample of AGN. In this letter we implement this method using a hierarchical Bayesian model and contrast this with the results from the previous stacked cross-correlation technique. We find that our inferences are more precise and allow fo...

  11. Hierarchical materials: Background and perspectives

    DEFF Research Database (Denmark)

    2016-01-01

    Hierarchical design draws inspiration from analysis of biological materials and has opened new possibilities for enhancing performance and enabling new functionalities and extraordinary properties. With the development of nanotechnology, the necessary technological requirements for the manufactur...

  12. Hierarchical clustering for graph visualization

    CERN Document Server

    Clémençon, Stéphan; Rossi, Fabrice; Tran, Viet Chi

    2012-01-01

    This paper describes a graph visualization methodology based on hierarchical maximal modularity clustering, with interactive and significant coarsening and refining possibilities. An application of this method to HIV epidemic analysis in Cuba is outlined.

  13. Direct hierarchical assembly of nanoparticles

    Science.gov (United States)

    Xu, Ting; Zhao, Yue; Thorkelsson, Kari

    2014-07-22

    The present invention provides hierarchical assemblies of a block copolymer, a bifunctional linking compound and a nanoparticle. The block copolymers form one micro-domain and the nanoparticles another micro-domain.

  14. Functional annotation of hierarchical modularity.

    Directory of Open Access Journals (Sweden)

    Kanchana Padmanabhan

    Full Text Available In biological networks of molecular interactions in a cell, network motifs that are biologically relevant are also functionally coherent, or form functional modules. These functionally coherent modules combine in a hierarchical manner into larger, less cohesive subsystems, thus revealing one of the essential design principles of system-level cellular organization and function-hierarchical modularity. Arguably, hierarchical modularity has not been explicitly taken into consideration by most, if not all, functional annotation systems. As a result, the existing methods would often fail to assign a statistically significant functional coherence score to biologically relevant molecular machines. We developed a methodology for hierarchical functional annotation. Given the hierarchical taxonomy of functional concepts (e.g., Gene Ontology and the association of individual genes or proteins with these concepts (e.g., GO terms, our method will assign a Hierarchical Modularity Score (HMS to each node in the hierarchy of functional modules; the HMS score and its p-value measure functional coherence of each module in the hierarchy. While existing methods annotate each module with a set of "enriched" functional terms in a bag of genes, our complementary method provides the hierarchical functional annotation of the modules and their hierarchically organized components. A hierarchical organization of functional modules often comes as a bi-product of cluster analysis of gene expression data or protein interaction data. Otherwise, our method will automatically build such a hierarchy by directly incorporating the functional taxonomy information into the hierarchy search process and by allowing multi-functional genes to be part of more than one component in the hierarchy. In addition, its underlying HMS scoring metric ensures that functional specificity of the terms across different levels of the hierarchical taxonomy is properly treated. We have evaluated our

  15. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA.

    Science.gov (United States)

    Currin, Andrew; Korovin, Konstantin; Ababi, Maria; Roper, Katherine; Kell, Douglas B; Day, Philip J; King, Ross D

    2017-03-01

    The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman 'there's plenty of room at the bottom'. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world

  16. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA

    Science.gov (United States)

    Currin, Andrew; Korovin, Konstantin; Ababi, Maria; Roper, Katherine; Kell, Douglas B.; Day, Philip J.

    2017-01-01

    The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman ‘there's plenty of room at the bottom’. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world

  17. Hierarchical architecture of active knits

    Science.gov (United States)

    Abel, Julianna; Luntz, Jonathan; Brei, Diann

    2013-12-01

    Nature eloquently utilizes hierarchical structures to form the world around us. Applying the hierarchical architecture paradigm to smart materials can provide a basis for a new genre of actuators which produce complex actuation motions. One promising example of cellular architecture—active knits—provides complex three-dimensional distributed actuation motions with expanded operational performance through a hierarchically organized structure. The hierarchical structure arranges a single fiber of active material, such as shape memory alloys (SMAs), into a cellular network of interlacing adjacent loops according to a knitting grid. This paper defines a four-level hierarchical classification of knit structures: the basic knit loop, knit patterns, grid patterns, and restructured grids. Each level of the hierarchy provides increased architectural complexity, resulting in expanded kinematic actuation motions of active knits. The range of kinematic actuation motions are displayed through experimental examples of different SMA active knits. The results from this paper illustrate and classify the ways in which each level of the hierarchical knit architecture leverages the performance of the base smart material to generate unique actuation motions, providing necessary insight to best exploit this new actuation paradigm.

  18. Advanced hierarchical distance sampling

    Science.gov (United States)

    Royle, Andy

    2016-01-01

    In this chapter, we cover a number of important extensions of the basic hierarchical distance-sampling (HDS) framework from Chapter 8. First, we discuss the inclusion of “individual covariates,” such as group size, in the HDS model. This is important in many surveys where animals form natural groups that are the primary observation unit, with the size of the group expected to have some influence on detectability. We also discuss HDS integrated with time-removal and double-observer or capture-recapture sampling. These “combined protocols” can be formulated as HDS models with individual covariates, and thus they have a commonality with HDS models involving group structure (group size being just another individual covariate). We cover several varieties of open-population HDS models that accommodate population dynamics. On one end of the spectrum, we cover models that allow replicate distance sampling surveys within a year, which estimate abundance relative to availability and temporary emigration through time. We consider a robust design version of that model. We then consider models with explicit dynamics based on the Dail and Madsen (2011) model and the work of Sollmann et al. (2015). The final major theme of this chapter is relatively newly developed spatial distance sampling models that accommodate explicit models describing the spatial distribution of individuals known as Point Process models. We provide novel formulations of spatial DS and HDS models in this chapter, including implementations of those models in the unmarked package using a hack of the pcount function for N-mixture models.

  19. Hierarchical topic modeling with nested hierarchical Dirichlet process

    Institute of Scientific and Technical Information of China (English)

    Yi-qun DING; Shan-ping LI; Zhen ZHANG; Bin SHEN

    2009-01-01

    This paper deals with the statistical modeling of latent topic hierarchies in text corpora. The height of the topic tree is assumed as fixed, while the number of topics on each level as unknown a priori and to be inferred from data. Taking a nonparametric Bayesian approach to this problem, we propose a new probabilistic generative model based on the nested hierarchical Dirichlet process (nHDP) and present a Markov chain Monte Carlo sampling algorithm for the inference of the topic tree structure as welt as the word distribution of each topic and topic distribution of each document. Our theoretical analysis and experiment results show that this model can produce a more compact hierarchical topic structure and captures more free-grained topic relationships compared to the hierarchical latent Dirichlet allocation model.

  20. LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity

    Directory of Open Access Journals (Sweden)

    Santiago Figueira

    2013-03-01

    Full Text Available In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2 satisfying the following requirements: 1 to be simple enough so that the complexity of any given finite binary sequence can be computed, 2 to be based on tangible operations of human reasoning (printing, repeating,. . . , 3 to be sufficiently powerful to generate all possible sequences but not too powerful as to identify regularities which would be invisible to humans. We first formalize LT^2C^2, giving its syntax and semantics, and defining an adequate notion of program size. Our setting leads to a Kolmogorov complexity function relative to LT^2C^2 which is computable in polynomial time, and it also induces a prediction algorithm in the spirit of Solomonoff’s inductive inference theory. We then prove the efficacy of this language by investigating regularities in strings produced by participants attempting to generate random strings. Participants had a profound understanding of randomness and hence avoided typical misconceptions such as exaggerating the number of alternations. We reasoned that remaining regularities would express the algorithmic nature of human thoughts, revealed in the form of specific patterns. Kolmogorov complexity relative to LT^2C^2 passed three expected tests examined here: 1 human sequences were less complex than control PRNG sequences, 2 human sequences were not stationary showing decreasing values of complexity resulting from fatigue 3 each individual showed traces of algorithmic stability since fitting of partial data was more effective to predict subsequent data than average fits. This work extends on previous efforts to combine notions of Kolmogorov complexity theory and algorithmic information theory to psychology, by explicitly proposing a language which may describe the patterns of human thoughts.Received: 12

  1. Deliberate change without hierarchical influence?

    DEFF Research Database (Denmark)

    Nørskov, Sladjana; Kesting, Peter; Ulhøi, John Parm

    2017-01-01

    Purpose This paper aims to present that deliberate change is strongly associated with formal structures and top-down influence. Hierarchical configurations have been used to structure processes, overcome resistance and get things done. But is deliberate change also possible without formal...... reveals that deliberate change is indeed achievable in a non-hierarchical collaborative OSS community context. However, it presupposes the presence and active involvement of informal change agents. The paper identifies and specifies four key drivers for change agents’ influence. Originality....../value The findings contribute to organisational analysis by providing a deeper understanding of the importance of leadership in making deliberate change possible in non-hierarchical settings. It points to the importance of “change-by-conviction”, essentially based on voluntary behaviour. This can open the door...

  2. Static Correctness of Hierarchical Procedures

    DEFF Research Database (Denmark)

    Schwartzbach, Michael Ignatieff

    1990-01-01

    A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this property to enable type-safe hierarchical procedures, it is necessary to impose a static requirement on procedure calls....... We introduce an example language and prove the existence of a sound requirement which preserves static correctness while allowing hierarchical procedures. This requirement is further shown to be optimal, in the sense that it imposes as few restrictions as possible. This establishes the theoretical...... basis for a general type hierarchy with static type checking, which enables first-order polymorphism combined with multiple inheritance and specialization in a language with assignments. We extend the results to include opaque types. An opaque version of a type is different from the original but has...

  3. Multifold Increases in Turing Pattern Wavelength in the Chlorine Dioxide-Iodine-Malonic Acid Reaction-Diffusion System

    Science.gov (United States)

    Gaskins, Delora K.; Pruc, Emily E.; Epstein, Irving R.; Dolnik, Milos

    2016-07-01

    Turing patterns in the chlorine dioxide-iodine-malonic acid reaction were modified through additions of sodium halide salt solutions. The range of wavelengths obtained is several times larger than in the previously reported literature. Pattern wavelength was observed to significantly increase with sodium bromide or sodium chloride. A transition to a uniform state was found at high halide concentrations. The observed experimental results are qualitatively well reproduced in numerical simulations with the Lengyel-Epstein model with an additional chemically realistic kinetic term to account for the added halide and an adjustment of the activator diffusion rate to allow for interhalogen formation.

  4. A Cross-Cultural Perspective:An Integration of Traditional Chinese Cul-ture into College English Textbooks

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ni

    2014-01-01

    Teaching language is teaching culture. English is an international language with local and global significance.In“New Horizon College English”, Chinese culture elements are deficient, which is not conducive to our country ’s higher education and cross-cultural communication skills and to achieve the goal of innovation of Chinese culture. As an important part of world cul⁃ture, Chinese culture should be integrated into college English education. College English teaching materials should include not only western cultural elements but also fully present Chinese culture elements.

  5. The Essential Turing Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life Plus the Secrets of Enigma

    CERN Document Server

    2004-01-01

    The ideas that gave birth to the computer age. Alan Turing, pioneer of computing and WWII codebreaker, was one of the most important and influential thinkers of the twentieth century. In this volume for the first time his key writings are made available to a broad, non-specialist readership. They make fascinating reading both in their own right and for their historic significance: contemporary computational theory, cognitive science, artificial intelligence, and artificial life all spring from this ground-breaking work, which is also rich. in philosophical and logical insight. An introduction

  6. Structural integrity of hierarchical composites

    Directory of Open Access Journals (Sweden)

    Marco Paggi

    2012-01-01

    Full Text Available Interface mechanical problems are of paramount importance in engineering and materials science. Traditionally, due to the complexity of modelling their mechanical behaviour, interfaces are often treated as defects and their features are not explored. In this study, a different approach is illustrated, where the interfaces play an active role in the design of innovative hierarchical composites and are fundamental for their structural integrity. Numerical examples regarding cutting tools made of hierarchical cellular polycrystalline materials are proposed, showing that tailoring of interface properties at the different scales is the way to achieve superior mechanical responses that cannot be obtained using standard materials

  7. Sensory Hierarchical Organization and Reading.

    Science.gov (United States)

    Skapof, Jerome

    The purpose of this study was to judge the viability of an operational approach aimed at assessing response styles in reading using the hypothesis of sensory hierarchical organization. A sample of 103 middle-class children from a New York City public school, between the ages of five and seven, took part in a three phase experiment. Phase one…

  8. Memory Stacking in Hierarchical Networks.

    Science.gov (United States)

    Westö, Johan; May, Patrick J C; Tiitinen, Hannu

    2016-02-01

    Robust representations of sounds with a complex spectrotemporal structure are thought to emerge in hierarchically organized auditory cortex, but the computational advantage of this hierarchy remains unknown. Here, we used computational models to study how such hierarchical structures affect temporal binding in neural networks. We equipped individual units in different types of feedforward networks with local memory mechanisms storing recent inputs and observed how this affected the ability of the networks to process stimuli context dependently. Our findings illustrate that these local memories stack up in hierarchical structures and hence allow network units to exhibit selectivity to spectral sequences longer than the time spans of the local memories. We also illustrate that short-term synaptic plasticity is a potential local memory mechanism within the auditory cortex, and we show that it can bring robustness to context dependence against variation in the temporal rate of stimuli, while introducing nonlinearities to response profiles that are not well captured by standard linear spectrotemporal receptive field models. The results therefore indicate that short-term synaptic plasticity might provide hierarchically structured auditory cortex with computational capabilities important for robust representations of spectrotemporal patterns.

  9. Pattern Formation in the Turing-Hopf Codimension-2 Phase Space in a Reaction-Diffusion System

    Institute of Scientific and Technical Information of China (English)

    YUAN Xu-Jin; SHAO Xin; LIAO Hui-Min; OUYANG Qi

    2009-01-01

    We systematically investigate the behaviour of pattern formation in a reaction-diffusion system when the system is located near the Turing-Hopf codimension-2 point in phase space. The chloride-iodide-malonic acid (CIMA) reaction is used in this study. A phase diagram is obtained using the concentration of polyvinyl alcohol (PVA) and malonic acid (MA) as control parameters. It is found that the Turing-Hopf mixed state appears only in a small vicinity near the codimension-2 point, and has the form of hexagonal pattern overlapped with anti-target wave; the boundary line separating the Thring state and the wave state is independent of the concentration of MA, only relies on the concentration of PVA. The corresponding numerical simulation using the Lengyel-Epstein (LE) model gives a similar phase diagram as the experiment; it reproduces most patterns observed in the experiment. However, the mixed state we obtain in simulation only appears in the anti-wave tip area, implying that the 3-D effect in the experiments may change the pattern forming behaviour in the codimension-2 regime.

  10. Cross-Diffusion Induced Turing Instability and Amplitude Equation for a Toxic-Phytoplankton-Zooplankton Model with Nonmonotonic Functional Response

    Science.gov (United States)

    Han, Renji; Dai, Binxiang

    2017-06-01

    The spatiotemporal pattern induced by cross-diffusion of a toxic-phytoplankton-zooplankton model with nonmonotonic functional response is investigated in this paper. The linear stability analysis shows that cross-diffusion is the key mechanism for the formation of spatial patterns. By taking cross-diffusion rate as bifurcation parameter, we derive amplitude equations near the Turing bifurcation point for the excited modes in the framework of a weakly nonlinear theory, and the stability analysis of the amplitude equations interprets the structural transitions and stability of various forms of Turing patterns. Furthermore, we illustrate the theoretical results via numerical simulations. It is shown that the spatiotemporal distribution of the plankton is homogeneous in the absence of cross-diffusion. However, when the cross-diffusivity is greater than the critical value, the spatiotemporal distribution of all the plankton species becomes inhomogeneous in spaces and results in different kinds of patterns: spot, stripe, and the mixture of spot and stripe patterns depending on the cross-diffusivity. Simultaneously, the impact of toxin-producing rate of toxic-phytoplankton (TPP) species and natural death rate of zooplankton species on pattern selection is also explored.

  11. Hierarchical Prisoner's Dilemma in Hierarchical Public-Goods Game

    CERN Document Server

    Fujimoto, Yuma; Kaneko, Kunihiko

    2016-01-01

    The dilemma in cooperation is one of the major concerns in game theory. In a public-goods game, each individual pays a cost for cooperation, or to prevent defection, and receives a reward from the collected cost in a group. Thus, defection is beneficial for each individual, while cooperation is beneficial for the group. Now, groups (say, countries) consisting of individual players also play games. To study such a multi-level game, we introduce a hierarchical public-goods (HPG) game in which two groups compete for finite resources by utilizing costs collected from individuals in each group. Analyzing this HPG game, we found a hierarchical prisoner's dilemma, in which groups choose the defection policy (say, armaments) as a Nash strategy to optimize each group's benefit, while cooperation optimizes the total benefit. On the other hand, for each individual within a group, refusing to pay the cost (say, tax) is a Nash strategy, which turns to be a cooperation policy for the group, thus leading to a hierarchical d...

  12. Alan Turing et l'intelligence artificielle : le « jeu de l'imitation » et « l'IA forte »

    OpenAIRE

    Goutefangea, Patrick

    2016-01-01

    Note relative aux rapports de la démarche d'Alan Turing dans "Computing Machinery and Intelligence" avec la thèse dite de "l'IA forte".; "Computing Machinery and Intelligence", the 1950 paper in which Turing studies the question "Can machines think ?" and proposes to replace it with a test, the famous "imitation game", is often regarded as one of the founding text of Artificial Intelligence (AI). John Searle showed that the AI founding thesis - every precisely described human behaviour can be...

  13. Hierarchical structure of biological systems

    Science.gov (United States)

    Alcocer-Cuarón, Carlos; Rivera, Ana L; Castaño, Victor M

    2014-01-01

    A general theory of biological systems, based on few fundamental propositions, allows a generalization of both Wierner and Berthalanffy approaches to theoretical biology. Here, a biological system is defined as a set of self-organized, differentiated elements that interact pair-wise through various networks and media, isolated from other sets by boundaries. Their relation to other systems can be described as a closed loop in a steady-state, which leads to a hierarchical structure and functioning of the biological system. Our thermodynamical approach of hierarchical character can be applied to biological systems of varying sizes through some general principles, based on the exchange of energy information and/or mass from and within the systems. PMID:24145961

  14. Automatic Hierarchical Color Image Classification

    Directory of Open Access Journals (Sweden)

    Jing Huang

    2003-02-01

    Full Text Available Organizing images into semantic categories can be extremely useful for content-based image retrieval and image annotation. Grouping images into semantic classes is a difficult problem, however. Image classification attempts to solve this hard problem by using low-level image features. In this paper, we propose a method for hierarchical classification of images via supervised learning. This scheme relies on using a good low-level feature and subsequently performing feature-space reconfiguration using singular value decomposition to reduce noise and dimensionality. We use the training data to obtain a hierarchical classification tree that can be used to categorize new images. Our experimental results suggest that this scheme not only performs better than standard nearest-neighbor techniques, but also has both storage and computational advantages.

  15. Intuitionistic fuzzy hierarchical clustering algorithms

    Institute of Scientific and Technical Information of China (English)

    Xu Zeshui

    2009-01-01

    Intuitionistic fuzzy set (IFS) is a set of 2-tuple arguments, each of which is characterized by a mem-bership degree and a nonmembership degree. The generalized form of IFS is interval-valued intuitionistic fuzzy set (IVIFS), whose components are intervals rather than exact numbers. IFSs and IVIFSs have been found to be very useful to describe vagueness and uncertainty. However, it seems that little attention has been focused on the clus-tering analysis of IFSs and IVIFSs. An intuitionistic fuzzy hierarchical algorithm is introduced for clustering IFSs, which is based on the traditional hierarchical clustering procedure, the intuitionistic fuzzy aggregation operator, and the basic distance measures between IFSs: the Hamming distance, normalized Hamming, weighted Hamming, the Euclidean distance, the normalized Euclidean distance, and the weighted Euclidean distance. Subsequently, the algorithm is extended for clustering IVIFSs. Finally the algorithm and its extended form are applied to the classifications of building materials and enterprises respectively.

  16. Hierarchical Formation of Galactic Clusters

    CERN Document Server

    Elmegreen, B G

    2006-01-01

    Young stellar groupings and clusters have hierarchical patterns ranging from flocculent spiral arms and star complexes on the largest scale to OB associations, OB subgroups, small loose groups, clusters and cluster subclumps on the smallest scales. There is no obvious transition in morphology at the cluster boundary, suggesting that clusters are only the inner parts of the hierarchy where stars have had enough time to mix. The power-law cluster mass function follows from this hierarchical structure: n(M_cl) M_cl^-b for b~2. This value of b is independently required by the observation that the summed IMFs from many clusters in a galaxy equals approximately the IMF of each cluster.

  17. Hierarchical matrices algorithms and analysis

    CERN Document Server

    Hackbusch, Wolfgang

    2015-01-01

    This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...

  18. Hierarchical Cont-Bouchaud model

    CERN Document Server

    Paluch, Robert; Holyst, Janusz A

    2015-01-01

    We extend the well-known Cont-Bouchaud model to include a hierarchical topology of agent's interactions. The influence of hierarchy on system dynamics is investigated by two models. The first one is based on a multi-level, nested Erdos-Renyi random graph and individual decisions by agents according to Potts dynamics. This approach does not lead to a broad return distribution outside a parameter regime close to the original Cont-Bouchaud model. In the second model we introduce a limited hierarchical Erdos-Renyi graph, where merging of clusters at a level h+1 involves only clusters that have merged at the previous level h and we use the original Cont-Bouchaud agent dynamics on resulting clusters. The second model leads to a heavy-tail distribution of cluster sizes and relative price changes in a wide range of connection densities, not only close to the percolation threshold.

  19. 瑞敏系列和TURE TEST系列斑贴试剂检测结果比较%Comparison of Patch Test Results Useing IQ Chamber System and TURE TEST

    Institute of Scientific and Technical Information of China (English)

    曹晓佳; 张理涛

    2012-01-01

    目的 分析瑞敏系列(R)和TURE TEST系列(T)斑贴试剂检测结果及一致性.方法 分别用这两个系列斑贴试剂检测196例慢性湿疹和接触性皮炎患者,对其检测结果进行比较.结果 瑞敏系列和TURE TEST系列斑贴试剂对各变应原检测阳性率不完全相同,它们检测常见变应原种类均与国内已有报道类似;两个系列中相同的16种变应原的检测反应强度一致性较好,检测的阳性率差异无统计学意义(P>0.05).结论 两个系列斑贴试剂的一致性较好,临床上可根据患者情况选择应用.%Objective To study the patch test reactions and the concordance of IQ chamber system (R) and TRUE Test (T). Methods Two different series patch test reagents were performed to detect 196 patients with chronic eczema and contact dermatitis, then the results were compared. Results The positive rates of every allergen were not completely the same,the most common allergens known from two series reagents were similar with the past reported of inland. The strength of allergic reaction of the same 16 allergens of two series reagents had good consistence and the positive rates of R and T were statistically insignificance. Conclusion This two different patch test series exhibited a high level of consistence, and doctors could choose suitable series according to the conditions of patients in clinic.

  20. Hierarchical Clustering and Active Galaxies

    CERN Document Server

    Hatziminaoglou, E; Manrique, A

    2000-01-01

    The growth of Super Massive Black Holes and the parallel development of activity in galactic nuclei are implemented in an analytic code of hierarchical clustering. The evolution of the luminosity function of quasars and AGN will be computed with special attention paid to the connection between quasars and Seyfert galaxies. One of the major interests of the model is the parallel study of quasar formation and evolution and the History of Star Formation.

  1. Hybrid and hierarchical composite materials

    CERN Document Server

    Kim, Chang-Soo; Sano, Tomoko

    2015-01-01

    This book addresses a broad spectrum of areas in both hybrid materials and hierarchical composites, including recent development of processing technologies, structural designs, modern computer simulation techniques, and the relationships between the processing-structure-property-performance. Each topic is introduced at length with numerous  and detailed examples and over 150 illustrations.   In addition, the authors present a method of categorizing these materials, so that representative examples of all material classes are discussed.

  2. Treatment Protocols as Hierarchical Structures

    Science.gov (United States)

    Ben-Bassat, Moshe; Carlson, Richard W.; Puri, Vinod K.; Weil, Max Harry

    1978-01-01

    We view a treatment protocol as a hierarchical structure of therapeutic modules. The lowest level of this structure consists of individual therapeutic actions. Combinations of individual actions define higher level modules, which we call routines. Routines are designed to manage limited clinical problems, such as the routine for fluid loading to correct hypovolemia. Combinations of routines and additional actions, together with comments, questions, or precautions organized in a branching logic, in turn, define the treatment protocol for a given disorder. Adoption of this modular approach may facilitate the formulation of treatment protocols, since the physician is not required to prepare complex flowcharts. This hierarchical approach also allows protocols to be updated and modified in a flexible manner. By use of such a standard format, individual components may be fitted together to create protocols for multiple disorders. The technique is suited for computer implementation. We believe that this hierarchical approach may facilitate standarization of patient care as well as aid in clinical teaching. A protocol for acute pancreatitis is used to illustrate this technique.

  3. Forging patterns and making waves from biology to geology: a commentary on Turing (1952) ‘The chemical basis of morphogenesis’

    Science.gov (United States)

    Ball, Philip

    2015-01-01

    Alan Turing was neither a biologist nor a chemist, and yet the paper he published in 1952, ‘The chemical basis of morphogenesis’, on the spontaneous formation of patterns in systems undergoing reaction and diffusion of their ingredients has had a substantial impact on both fields, as well as in other areas as disparate as geomorphology and criminology. Motivated by the question of how a spherical embryo becomes a decidedly non-spherical organism such as a human being, Turing devised a mathematical model that explained how random fluctuations can drive the emergence of pattern and structure from initial uniformity. The spontaneous appearance of pattern and form in a system far away from its equilibrium state occurs in many types of natural process, and in some artificial ones too. It is often driven by very general mechanisms, of which Turing's model supplies one of the most versatile. For that reason, these patterns show striking similarities in systems that seem superficially to share nothing in common, such as the stripes of sand ripples and of pigmentation on a zebra skin. New examples of ‘Turing patterns' in biology and beyond are still being discovered today. This commentary was written to celebrate the 350th anniversary of the journal Philosophical Transactions of the Royal Society. PMID:25750229

  4. Hierarchical Control for Smart Grids

    DEFF Research Database (Denmark)

    Trangbæk, K; Bendtsen, Jan Dimon; Stoustrup, Jakob

    2011-01-01

    This paper deals with hierarchical model predictive control (MPC) of smart grid systems. The design consists of a high level MPC controller, a second level of so-called aggregators, which reduces the computational and communication-related load on the high-level control, and a lower level...... of autonomous consumers. The control system is tasked with balancing electric power production and consumption within the smart grid, and makes active use of the flexibility of a large number of power producing and/or power consuming units. The objective is to accommodate the load variation on the grid, arising...

  5. Hierarchical Structures in Hypertext Learning Environments

    NARCIS (Netherlands)

    Bezdan, Eniko; Kester, Liesbeth; Kirschner, Paul A.

    2011-01-01

    Bezdan, E., Kester, L., & Kirschner, P. A. (2011, 9 September). Hierarchical Structures in Hypertext Learning Environments. Presentation for the visit of KU Leuven, Open University, Heerlen, The Netherlands.

  6. Dynamic Organization of Hierarchical Memories.

    Science.gov (United States)

    Kurikawa, Tomoki; Kaneko, Kunihiko

    2016-01-01

    In the brain, external objects are categorized in a hierarchical way. Although it is widely accepted that objects are represented as static attractors in neural state space, this view does not take account interaction between intrinsic neural dynamics and external input, which is essential to understand how neural system responds to inputs. Indeed, structured spontaneous neural activity without external inputs is known to exist, and its relationship with evoked activities is discussed. Then, how categorical representation is embedded into the spontaneous and evoked activities has to be uncovered. To address this question, we studied bifurcation process with increasing input after hierarchically clustered associative memories are learned. We found a "dynamic categorization"; neural activity without input wanders globally over the state space including all memories. Then with the increase of input strength, diffuse representation of higher category exhibits transitions to focused ones specific to each object. The hierarchy of memories is embedded in the transition probability from one memory to another during the spontaneous dynamics. With increased input strength, neural activity wanders over a narrower state space including a smaller set of memories, showing more specific category or memory corresponding to the applied input. Moreover, such coarse-to-fine transitions are also observed temporally during transient process under constant input, which agrees with experimental findings in the temporal cortex. These results suggest the hierarchy emerging through interaction with an external input underlies hierarchy during transient process, as well as in the spontaneous activity.

  7. Discovering hierarchical structure in normal relational data

    DEFF Research Database (Denmark)

    Schmidt, Mikkel Nørgaard; Herlau, Tue; Mørup, Morten

    2014-01-01

    Hierarchical clustering is a widely used tool for structuring and visualizing complex data using similarity. Traditionally, hierarchical clustering is based on local heuristics that do not explicitly provide assessment of the statistical saliency of the extracted hierarchy. We propose a non-param...

  8. Discursive Hierarchical Patterning in Economics Cases

    Science.gov (United States)

    Lung, Jane

    2011-01-01

    This paper attempts to apply Lung's (2008) model of the discursive hierarchical patterning of cases to a closer and more specific study of Economics cases and proposes a model of the distinct discursive hierarchical patterning of the same. It examines a corpus of 150 Economics cases with a view to uncovering the patterns of discourse construction.…

  9. A Model of Hierarchical Key Assignment Scheme

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhigang; ZHAO Jing; XU Maozhi

    2006-01-01

    A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.

  10. Galaxy formation through hierarchical clustering

    Science.gov (United States)

    White, Simon D. M.; Frenk, Carlos S.

    1991-01-01

    Analytic methods for studying the formation of galaxies by gas condensation within massive dark halos are presented. The present scheme applies to cosmogonies where structure grows through hierarchical clustering of a mixture of gas and dissipationless dark matter. The simplest models consistent with the current understanding of N-body work on dissipationless clustering, and that of numerical and analytic work on gas evolution and cooling are adopted. Standard models for the evolution of the stellar population are also employed, and new models for the way star formation heats and enriches the surrounding gas are constructed. Detailed results are presented for a cold dark matter universe with Omega = 1 and H(0) = 50 km/s/Mpc, but the present methods are applicable to other models. The present luminosity functions contain significantly more faint galaxies than are observed.

  11. Groups possessing extensive hierarchical decompositions

    CERN Document Server

    Januszkiewicz, T; Leary, I J

    2009-01-01

    Kropholler's class of groups is the smallest class of groups which contains all finite groups and is closed under the following operator: whenever $G$ admits a finite-dimensional contractible $G$-CW-complex in which all stabilizer groups are in the class, then $G$ is itself in the class. Kropholler's class admits a hierarchical structure, i.e., a natural filtration indexed by the ordinals. For example, stage 0 of the hierarchy is the class of all finite groups, and stage 1 contains all groups of finite virtual cohomological dimension. We show that for each countable ordinal $\\alpha$, there is a countable group that is in Kropholler's class which does not appear until the $\\alpha+1$st stage of the hierarchy. Previously this was known only for $\\alpha= 0$, 1 and 2. The groups that we construct contain torsion. We also review the construction of a torsion-free group that lies in the third stage of the hierarchy.

  12. Quantum transport through hierarchical structures.

    Science.gov (United States)

    Boettcher, S; Varghese, C; Novotny, M A

    2011-04-01

    The transport of quantum electrons through hierarchical lattices is of interest because such lattices have some properties of both regular lattices and random systems. We calculate the electron transmission as a function of energy in the tight-binding approximation for two related Hanoi networks. HN3 is a Hanoi network with every site having three bonds. HN5 has additional bonds added to HN3 to make the average number of bonds per site equal to five. We present a renormalization group approach to solve the matrix equation involved in this quantum transport calculation. We observe band gaps in HN3, while no such band gaps are observed in linear networks or in HN5. We provide a detailed scaling analysis near the edges of these band gaps.

  13. Hierarchical networks of scientific journals

    CERN Document Server

    Palla, Gergely; Mones, Enys; Pollner, Péter; Vicsek, Tamás

    2015-01-01

    Scientific journals are the repositories of the gradually accumulating knowledge of mankind about the world surrounding us. Just as our knowledge is organised into classes ranging from major disciplines, subjects and fields to increasingly specific topics, journals can also be categorised into groups using various metrics. In addition to the set of topics characteristic for a journal, they can also be ranked regarding their relevance from the point of overall influence. One widespread measure is impact factor, but in the present paper we intend to reconstruct a much more detailed description by studying the hierarchical relations between the journals based on citation data. We use a measure related to the notion of m-reaching centrality and find a network which shows the level of influence of a journal from the point of the direction and efficiency with which information spreads through the network. We can also obtain an alternative network using a suitably modified nested hierarchy extraction method applied ...

  14. Adaptive Sampling in Hierarchical Simulation

    Energy Technology Data Exchange (ETDEWEB)

    Knap, J; Barton, N R; Hornung, R D; Arsenlis, A; Becker, R; Jefferson, D R

    2007-07-09

    We propose an adaptive sampling methodology for hierarchical multi-scale simulation. The method utilizes a moving kriging interpolation to significantly reduce the number of evaluations of finer-scale response functions to provide essential constitutive information to a coarser-scale simulation model. The underlying interpolation scheme is unstructured and adaptive to handle the transient nature of a simulation. To handle the dynamic construction and searching of a potentially large set of finer-scale response data, we employ a dynamic metric tree database. We study the performance of our adaptive sampling methodology for a two-level multi-scale model involving a coarse-scale finite element simulation and a finer-scale crystal plasticity based constitutive law.

  15. Multicollinearity in hierarchical linear models.

    Science.gov (United States)

    Yu, Han; Jiang, Shanhe; Land, Kenneth C

    2015-09-01

    This study investigates an ill-posed problem (multicollinearity) in Hierarchical Linear Models from both the data and the model perspectives. We propose an intuitive, effective approach to diagnosing the presence of multicollinearity and its remedies in this class of models. A simulation study demonstrates the impacts of multicollinearity on coefficient estimates, associated standard errors, and variance components at various levels of multicollinearity for finite sample sizes typical in social science studies. We further investigate the role multicollinearity plays at each level for estimation of coefficient parameters in terms of shrinkage. Based on these analyses, we recommend a top-down method for assessing multicollinearity in HLMs that first examines the contextual predictors (Level-2 in a two-level model) and then the individual predictors (Level-1) and uses the results for data collection, research problem redefinition, model re-specification, variable selection and estimation of a final model.

  16. Hierarchically Nanostructured Materials for Sustainable Environmental Applications

    Science.gov (United States)

    Ren, Zheng; Guo, Yanbing; Liu, Cai-Hong; Gao, Pu-Xian

    2013-11-01

    This article presents a comprehensive overview of the hierarchical nanostructured materials with either geometry or composition complexity in environmental applications. The hierarchical nanostructures offer advantages of high surface area, synergistic interactions and multiple functionalities towards water remediation, environmental gas sensing and monitoring as well as catalytic gas treatment. Recent advances in synthetic strategies for various hierarchical morphologies such as hollow spheres and urchin-shaped architectures have been reviewed. In addition to the chemical synthesis, the physical mechanisms associated with the materials design and device fabrication have been discussed for each specific application. The development and application of hierarchical complex perovskite oxide nanostructures have also been introduced in photocatalytic water remediation, gas sensing and catalytic converter. Hierarchical nanostructures will open up many possibilities for materials design and device fabrication in environmental chemistry and technology.

  17. A neural signature of hierarchical reinforcement learning.

    Science.gov (United States)

    Ribas-Fernandes, José J F; Solway, Alec; Diuk, Carlos; McGuire, Joseph T; Barto, Andrew G; Niv, Yael; Botvinick, Matthew M

    2011-07-28

    Human behavior displays hierarchical structure: simple actions cohere into subtask sequences, which work together to accomplish overall task goals. Although the neural substrates of such hierarchy have been the target of increasing research, they remain poorly understood. We propose that the computations supporting hierarchical behavior may relate to those in hierarchical reinforcement learning (HRL), a machine-learning framework that extends reinforcement-learning mechanisms into hierarchical domains. To test this, we leveraged a distinctive prediction arising from HRL. In ordinary reinforcement learning, reward prediction errors are computed when there is an unanticipated change in the prospects for accomplishing overall task goals. HRL entails that prediction errors should also occur in relation to task subgoals. In three neuroimaging studies we observed neural responses consistent with such subgoal-related reward prediction errors, within structures previously implicated in reinforcement learning. The results reported support the relevance of HRL to the neural processes underlying hierarchical behavior.

  18. Hierarchical Identity-Based Lossy Trapdoor Functions

    CERN Document Server

    Escala, Alex; Libert, Benoit; Rafols, Carla

    2012-01-01

    Lossy trapdoor functions, introduced by Peikert and Waters (STOC'08), have received a lot of attention in the last years, because of their wide range of applications in theoretical cryptography. The notion has been recently extended to the identity-based scenario by Bellare et al. (Eurocrypt'12). We provide one more step in this direction, by considering the notion of hierarchical identity-based lossy trapdoor functions (HIB-LTDFs). Hierarchical identity-based cryptography generalizes identitybased cryptography in the sense that identities are organized in a hierarchical way; a parent identity has more power than its descendants, because it can generate valid secret keys for them. Hierarchical identity-based cryptography has been proved very useful both for practical applications and to establish theoretical relations with other cryptographic primitives. In order to realize HIB-LTDFs, we first build a weakly secure hierarchical predicate encryption scheme. This scheme, which may be of independent interest, is...

  19. Hierarchically nanostructured materials for sustainable environmental applications

    Science.gov (United States)

    Ren, Zheng; Guo, Yanbing; Liu, Cai-Hong; Gao, Pu-Xian

    2013-01-01

    This review presents a comprehensive overview of the hierarchical nanostructured materials with either geometry or composition complexity in environmental applications. The hierarchical nanostructures offer advantages of high surface area, synergistic interactions, and multiple functionalities toward water remediation, biosensing, environmental gas sensing and monitoring as well as catalytic gas treatment. Recent advances in synthetic strategies for various hierarchical morphologies such as hollow spheres and urchin-shaped architectures have been reviewed. In addition to the chemical synthesis, the physical mechanisms associated with the materials design and device fabrication have been discussed for each specific application. The development and application of hierarchical complex perovskite oxide nanostructures have also been introduced in photocatalytic water remediation, gas sensing, and catalytic converter. Hierarchical nanostructures will open up many possibilities for materials design and device fabrication in environmental chemistry and technology. PMID:24790946

  20. Hierarchically Nanostructured Materials for Sustainable Environmental Applications

    Directory of Open Access Journals (Sweden)

    Zheng eRen

    2013-11-01

    Full Text Available This article presents a comprehensive overview of the hierarchical nanostructured materials with either geometry or composition complexity in environmental applications. The hierarchical nanostructures offer advantages of high surface area, synergistic interactions and multiple functionalities towards water remediation, environmental gas sensing and monitoring as well as catalytic gas treatment. Recent advances in synthetic strategies for various hierarchical morphologies such as hollow spheres and urchin-shaped architectures have been reviewed. In addition to the chemical synthesis, the physical mechanisms associated with the materials design and device fabrication have been discussed for each specific application. The development and application of hierarchical complex perovskite oxide nanostructures have also been introduced in photocatalytic water remediation, gas sensing and catalytic converter. Hierarchical nanostructures will open up many possibilities for materials design and device fabrication in environmental chemistry and technology.

  1. Hierarchically Nanoporous Bioactive Glasses for High Efficiency Immobilization of Enzymes

    DEFF Research Database (Denmark)

    He, W.; Min, D.D.; Zhang, X.D.

    2014-01-01

    Bioactive glasses with hierarchical nanoporosity and structures have been heavily involved in immobilization of enzymes. Because of meticulous design and ingenious hierarchical nanostructuration of porosities from yeast cell biotemplates, hierarchically nanostructured porous bioactive glasses can...

  2. Hierarchical mutual information for the comparison of hierarchical community structures in complex networks

    CERN Document Server

    Perotti, Juan Ignacio; Caldarelli, Guido

    2015-01-01

    The quest for a quantitative characterization of community and modular structure of complex networks produced a variety of methods and algorithms to classify different networks. However, it is not clear if such methods provide consistent, robust and meaningful results when considering hierarchies as a whole. Part of the problem is the lack of a similarity measure for the comparison of hierarchical community structures. In this work we give a contribution by introducing the {\\it hierarchical mutual information}, which is a generalization of the traditional mutual information, and allows to compare hierarchical partitions and hierarchical community structures. The {\\it normalized} version of the hierarchical mutual information should behave analogously to the traditional normalized mutual information. Here, the correct behavior of the hierarchical mutual information is corroborated on an extensive battery of numerical experiments. The experiments are performed on artificial hierarchies, and on the hierarchical ...

  3. Turing Revisited: Decoding the microRNA Messages in Brain Extracellular Vesicles for Early Detection of Neurodevelopmental Disorders.

    Science.gov (United States)

    Gillet, Virginie; Hunting, Darel John; Takser, Larissa

    2016-09-01

    The prevention of neurodevelopmental disorders (NDD) of prenatal origin suffers from the lack of objective tools for early detection of susceptible individuals and the long time lag, usually in years, between the neurotoxic exposure and the diagnosis of mental dysfunction. Human data on the effects of alcohol, lead, and mercury and experimental data from animals on developmental neurotoxins and their long-term behavioral effects have achieved a critical mass, leading to the concept of the Developmental Origin of Health and Disease (DOHaD). However, there is currently no way to evaluate the degree of brain damage early after birth. We propose that extracellular vesicles (EVs) and particularly exosomes, released by brain cells into the fetal blood, may offer us a non-invasive means of assessing brain damage by neurotoxins. We are inspired by the strategy applied by Alan Turing (a cryptanalyst working for the British government), who created a first computer to decrypt German intelligence communications during World War II. Given the growing evidence that microRNAs (miRNAs), which are among the molecules carried by EVs, are involved in cell-cell communication, we propose that decrypting messages from EVs can allow us to detect damage thus offering an opportunity to cure, reverse, or prevent the development of NDD. This review summarizes recent findings on miRNAs associated with selected environmental toxicants known to be involved in the pathophysiology of NDD.

  4. Turing's theory of morphogenesis of 1952 and the subsequent discovery of the crucial role of local self-enhancement and long-range inhibition.

    Science.gov (United States)

    Meinhardt, Hans

    2012-08-06

    In his pioneering work, Alan Turing showed that de novo pattern formation is possible if two substances interact that differ in their diffusion range. Since then, we have shown that pattern formation is possible if, and only if, a self-enhancing reaction is coupled with an antagonistic process of longer range. Knowing this crucial condition has enabled us to include nonlinear interactions, which are required to design molecularly realistic interactions. Different reaction schemes and their relation to Turing's proposal are discussed and compared with more recent observations on the molecular-genetic level. The antagonistic reaction may be accomplished by an inhibitor that is produced in the activated region or by a depletion of a component that is used up during the self-enhancing reaction. The autocatalysis may be realized by an inhibition of an inhibition. Activating molecules can be processed into molecules that have an inhibiting function; patterning of the Wnt pathway is proposed to depend on such a mechanism. Three-component systems, as discussed in Turing's paper, are shown to play a major role in the generation of highly dynamic patterns that never reach a stable state.

  5. Prediction Based on Statistical Fundamental Information of Turing Award%图灵奖的基础信息统计与预测

    Institute of Scientific and Technical Information of China (English)

    赵芳; 吴琼; 刘彦君

    2016-01-01

    借鉴以往的研究成果,以图灵奖获奖者为中心,从图灵奖官网、维基百科、百度百科、万方数据库等采集信息,对基础数据统计后,从历年获奖人数、获奖人年龄\\工作机构\\年龄\\研究领域、图灵奖分布的领域等角度对概况进行描述,在此基础上,对数据作进一步分析,对图灵奖未来若干年的获奖趋势作出预测。%After collecting data from Turing Award official website, Wikipedia, Baidu encyclopedia, Wanfang Database, this pa-per carries out statistics on fundamental information of Turing Award winners by drawing on the academic results of previous stud-ies. Then it describes the general situation of the total number of prize winners, organizations, research fields and so on. It also fur-ther analyzes the data and makes prediction for the future Turing Award winners.

  6. Hierarchically structured, nitrogen-doped carbon membranes

    KAUST Repository

    Wang, Hong

    2017-08-03

    The present invention is a structure, method of making and method of use for a novel macroscopic hierarchically structured, nitrogen-doped, nano-porous carbon membrane (HNDCMs) with asymmetric and hierarchical pore architecture that can be produced on a large-scale approach. The unique HNDCM holds great promise as components in separation and advanced carbon devices because they could offer unconventional fluidic transport phenomena on the nanoscale. Overall, the invention set forth herein covers a hierarchically structured, nitrogen-doped carbon membranes and methods of making and using such a membranes.

  7. A Model for Slicing JAVA Programs Hierarchically

    Institute of Scientific and Technical Information of China (English)

    Bi-Xin Li; Xiao-Cong Fan; Jun Pang; Jian-Jun Zhao

    2004-01-01

    Program slicing can be effectively used to debug, test, analyze, understand and maintain objectoriented software. In this paper, a new slicing model is proposed to slice Java programs based on their inherent hierarchical feature. The main idea of hierarchical slicing is to slice programs in a stepwise way, from package level, to class level, method level, and finally up to statement level. The stepwise slicing algorithm and the related graph reachability algorithms are presented, the architecture of the Java program Analyzing Tool (JATO) based on hierarchical slicing model is provided, the applications and a small case study are also discussed.

  8. Hierarchical analysis of acceptable use policies

    Directory of Open Access Journals (Sweden)

    P. A. Laughton

    2008-01-01

    Full Text Available Acceptable use policies (AUPs are vital tools for organizations to protect themselves and their employees from misuse of computer facilities provided. A well structured, thorough AUP is essential for any organization. It is impossible for an effective AUP to deal with every clause and remain readable. For this reason, some sections of an AUP carry more weight than others, denoting importance. The methodology used to develop the hierarchical analysis is a literature review, where various sources were consulted. This hierarchical approach to AUP analysis attempts to highlight important sections and clauses dealt with in an AUP. The emphasis of the hierarchal analysis is to prioritize the objectives of an AUP.

  9. Hierarchical modeling and analysis for spatial data

    CERN Document Server

    Banerjee, Sudipto; Gelfand, Alan E

    2003-01-01

    Among the many uses of hierarchical modeling, their application to the statistical analysis of spatial and spatio-temporal data from areas such as epidemiology And environmental science has proven particularly fruitful. Yet to date, the few books that address the subject have been either too narrowly focused on specific aspects of spatial analysis, or written at a level often inaccessible to those lacking a strong background in mathematical statistics.Hierarchical Modeling and Analysis for Spatial Data is the first accessible, self-contained treatment of hierarchical methods, modeling, and dat

  10. Image meshing via hierarchical optimization

    Institute of Scientific and Technical Information of China (English)

    Hao XIE; Ruo-feng TONG‡

    2016-01-01

    Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., defi nition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to fi nd a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to fi nd a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to fi ner ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.

  11. Image meshing via hierarchical optimization*

    Institute of Scientific and Technical Information of China (English)

    Hao XIE; Ruo-feng TONGS

    2016-01-01

    Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., definition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to find a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to find a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to finer ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.

  12. Hierarchical Bayes Ensemble Kalman Filtering

    CERN Document Server

    Tsyrulnikov, Michael

    2015-01-01

    Ensemble Kalman filtering (EnKF), when applied to high-dimensional systems, suffers from an inevitably small affordable ensemble size, which results in poor estimates of the background error covariance matrix ${\\bf B}$. The common remedy is a kind of regularization, usually an ad-hoc spatial covariance localization (tapering) combined with artificial covariance inflation. Instead of using an ad-hoc regularization, we adopt the idea by Myrseth and Omre (2010) and explicitly admit that the ${\\bf B}$ matrix is unknown and random and estimate it along with the state (${\\bf x}$) in an optimal hierarchical Bayes analysis scheme. We separate forecast errors into predictability errors (i.e. forecast errors due to uncertainties in the initial data) and model errors (forecast errors due to imperfections in the forecast model) and include the two respective components ${\\bf P}$ and ${\\bf Q}$ of the ${\\bf B}$ matrix into the extended control vector $({\\bf x},{\\bf P},{\\bf Q})$. Similarly, we break the traditional backgrou...

  13. A Hierarchical Joint Optimized Bit—allocation Strategy for HDTV Encoder with Parallel Coding Architecture

    Institute of Scientific and Technical Information of China (English)

    XIONGHongkai; YUSongyu; YEWei

    2003-01-01

    Because real-time compression and high-speed digital processing circuitry are crucial for digital high definition television (HDTV) coding, parallel processing has become a feasible scheme in most applications as yet. This paper presents a novel bit-allocation strategy for an HDTV encoder system with parallel architecture, in which the original HDTV-picture is divided into six hor-izontal sub-pictures. It is shown that the MPEG-2 Test Model 5 (TMS) rate control scheme would not only give rise to non-consistent sub-pictures visual quality in a com-posite HDTV frame, but also make the coding quality de-grade abruptly and the buffer underfiow at scene changes.How to allocate bit-rates among sub-pictures becomes a great challenge in literatures. The proposed strategy is dedicated to a hierarchical joint optimized bit-allocation with sub-pictures' average complexity and average bits measure, and moreover, capable of alleviating serious pic-ture quality inconsistence at scene changes. The optimized bit-allocation and its complementary rate adaptive proce-dures are formulated and described. In the paper, the pro-posed strategy is compared with the independent coding,in which each sub-picture sequence is assigned the same proportion of the channel bandwidth. Experimental re-suits demonstrate the effectiveness of the proposed scheme not only alleviates the boundary effect but also promises the sub-pictures quality consistency.

  14. An Automatic Hierarchical Delay Analysis Tool

    Institute of Scientific and Technical Information of China (English)

    FaridMheir-El-Saadi; BozenaKaminska

    1994-01-01

    The performance analysis of VLSI integrated circuits(ICs) with flat tools is slow and even sometimes impossible to complete.Some hierarchical tools have been developed to speed up the analysis of these large ICs.However,these hierarchical tools suffer from a poor interaction with the CAD database and poorly automatized operations.We introduce a general hierarchical framework for performance analysis to solve these problems.The circuit analysis is automatic under the proposed framework.Information that has been automatically abstracted in the hierarchy is kept in database properties along with the topological information.A limited software implementation of the framework,PREDICT,has also been developed to analyze the delay performance.Experimental results show that hierarchical analysis CPU time and memory requirements are low if heuristics are used during the abstraction process.

  15. Packaging glass with hierarchically nanostructured surface

    KAUST Repository

    He, Jr-Hau

    2017-08-03

    An optical device includes an active region and packaging glass located on top of the active region. A top surface of the packaging glass includes hierarchical nanostructures comprised of honeycombed nanowalls (HNWs) and nanorod (NR) structures extending from the HNWs.

  16. Generation of hierarchically correlated multivariate symbolic sequences

    CERN Document Server

    Tumminello, Mi; Mantegna, R N

    2008-01-01

    We introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained by some hierarchical clustering procedure as applied to an empirical matrix of Hamming distances. The algorithm can be interpreted as the finite alphabet equivalent of the recently introduced hierarchically nested factor model (M. Tumminello et al. EPL 78 (3) 30006 (2007)). The algorithm is based on a generating mechanism that is different from the one used in the mutation rate approach. We apply the proposed methodology for investigating the relationship between the bootstrap value associated with a node of a phylogeny and the probability of finding that node in the true phylogeny.

  17. Hierarchical modularity in human brain functional networks

    CERN Document Server

    Meunier, D; Fornito, A; Ersche, K D; Bullmore, E T; 10.3389/neuro.11.037.2009

    2010-01-01

    The idea that complex systems have a hierarchical modular organization originates in the early 1960s and has recently attracted fresh support from quantitative studies of large scale, real-life networks. Here we investigate the hierarchical modular (or "modules-within-modules") decomposition of human brain functional networks, measured using functional magnetic resonance imaging (fMRI) in 18 healthy volunteers under no-task or resting conditions. We used a customized template to extract networks with more than 1800 regional nodes, and we applied a fast algorithm to identify nested modular structure at several hierarchical levels. We used mutual information, 0 < I < 1, to estimate the similarity of community structure of networks in different subjects, and to identify the individual network that is most representative of the group. Results show that human brain functional networks have a hierarchical modular organization with a fair degree of similarity between subjects, I=0.63. The largest 5 modules at ...

  18. HIERARCHICAL ORGANIZATION OF INFORMATION, IN RELATIONAL DATABASES

    Directory of Open Access Journals (Sweden)

    Demian Horia

    2008-05-01

    Full Text Available In this paper I will present different types of representation, of hierarchical information inside a relational database. I also will compare them to find the best organization for specific scenarios.

  19. Hierarchical Network Design Using Simulated Annealing

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Clausen, Jens

    2002-01-01

    The hierarchical network problem is the problem of finding the least cost network, with nodes divided into groups, edges connecting nodes in each groups and groups ordered in a hierarchy. The idea of hierarchical networks comes from telecommunication networks where hierarchies exist. Hierarchical...... networks are described and a mathematical model is proposed for a two level version of the hierarchical network problem. The problem is to determine which edges should connect nodes, and how demand is routed in the network. The problem is solved heuristically using simulated annealing which as a sub......-algorithm uses a construction algorithm to determine edges and route the demand. Performance for different versions of the algorithm are reported in terms of runtime and quality of the solutions. The algorithm is able to find solutions of reasonable quality in approximately 1 hour for networks with 100 nodes....

  20. When to Use Hierarchical Linear Modeling

    National Research Council Canada - National Science Library

    Veronika Huta

    2014-01-01

    Previous publications on hierarchical linear modeling (HLM) have provided guidance on how to perform the analysis, yet there is relatively little information on two questions that arise even before analysis...

  1. An introduction to hierarchical linear modeling

    National Research Council Canada - National Science Library

    Woltman, Heather; Feldstain, Andrea; MacKay, J. Christine; Rocchi, Meredith

    2012-01-01

    This tutorial aims to introduce Hierarchical Linear Modeling (HLM). A simple explanation of HLM is provided that describes when to use this statistical technique and identifies key factors to consider before conducting this analysis...

  2. Conservation Laws in the Hierarchical Model

    NARCIS (Netherlands)

    Beijeren, H. van; Gallavotti, G.; Knops, H.

    1974-01-01

    An exposition of the renormalization-group equations for the hierarchical model is given. Attention is drawn to some properties of the spin distribution functions which are conserved under the action of the renormalization group.

  3. Hierarchical DSE for multi-ASIP platforms

    DEFF Research Database (Denmark)

    Micconi, Laura; Corvino, Rosilde; Gangadharan, Deepak;

    2013-01-01

    This work proposes a hierarchical Design Space Exploration (DSE) for the design of multi-processor platforms targeted to specific applications with strict timing and area constraints. In particular, it considers platforms integrating multiple Application Specific Instruction Set Processors (ASIPs...

  4. Hierarchical organization versus self-organization

    OpenAIRE

    Busseniers, Evo

    2014-01-01

    In this paper we try to define the difference between hierarchical organization and self-organization. Organization is defined as a structure with a function. So we can define the difference between hierarchical organization and self-organization both on the structure as on the function. In the next two chapters these two definitions are given. For the structure we will use some existing definitions in graph theory, for the function we will use existing theory on (self-)organization. In the t...

  5. Hierarchical decision making for flood risk reduction

    DEFF Research Database (Denmark)

    Custer, Rocco; Nishijima, Kazuyoshi

    2013-01-01

    . In current practice, structures are often optimized individually without considering benefits of having a hierarchy of protection structures. It is here argued, that the joint consideration of hierarchically integrated protection structures is beneficial. A hierarchical decision model is utilized to analyze...... and compare the benefit of large upstream protection structures and local downstream protection structures in regard to epistemic uncertainty parameters. Results suggest that epistemic uncertainty influences the outcome of the decision model and that, depending on the magnitude of epistemic uncertainty...

  6. Hierarchical self-organization of tectonic plates

    OpenAIRE

    2010-01-01

    The Earth's surface is subdivided into eight large tectonic plates and many smaller ones. We reconstruct the plate tessellation history and demonstrate that both large and small plates display two distinct hierarchical patterns, described by different power-law size-relationships. While small plates display little organisational change through time, the structure of the large plates oscillate between minimum and maximum hierarchical tessellations. The organization of large plates rapidly chan...

  7. Angelic Hierarchical Planning: Optimal and Online Algorithms

    Science.gov (United States)

    2008-12-06

    restrict our attention to plans in I∗(Act, s0). Definition 2. ( Parr and Russell , 1998) A plan ah∗ is hierarchically optimal iff ah∗ = argmina∈I∗(Act,s0):T...Murdock, Dan Wu, and Fusun Yaman. SHOP2: An HTN planning system. JAIR, 20:379–404, 2003. Ronald Parr and Stuart Russell . Reinforcement Learning with...Angelic Hierarchical Planning: Optimal and Online Algorithms Bhaskara Marthi Stuart J. Russell Jason Wolfe Electrical Engineering and Computer

  8. Hierarchical Needs, Income Comparisons and Happiness Levels

    OpenAIRE

    Drakopoulos, Stavros

    2011-01-01

    The cornerstone of the hierarchical approach is that there are some basic human needs which must be satisfied before non-basic needs come into the picture. The hierarchical structure of needs implies that the satisfaction of primary needs provides substantial increases to individual happiness compared to the subsequent satisfaction of secondary needs. This idea can be combined with the concept of comparison income which means that individuals compare rewards with individuals with similar char...

  9. Evaluating Hierarchical Structure in Music Annotations.

    Science.gov (United States)

    McFee, Brian; Nieto, Oriol; Farbood, Morwaread M; Bello, Juan Pablo

    2017-01-01

    Music exhibits structure at multiple scales, ranging from motifs to large-scale functional components. When inferring the structure of a piece, different listeners may attend to different temporal scales, which can result in disagreements when they describe the same piece. In the field of music informatics research (MIR), it is common to use corpora annotated with structural boundaries at different levels. By quantifying disagreements between multiple annotators, previous research has yielded several insights relevant to the study of music cognition. First, annotators tend to agree when structural boundaries are ambiguous. Second, this ambiguity seems to depend on musical features, time scale, and genre. Furthermore, it is possible to tune current annotation evaluation metrics to better align with these perceptual differences. However, previous work has not directly analyzed the effects of hierarchical structure because the existing methods for comparing structural annotations are designed for "flat" descriptions, and do not readily generalize to hierarchical annotations. In this paper, we extend and generalize previous work on the evaluation of hierarchical descriptions of musical structure. We derive an evaluation metric which can compare hierarchical annotations holistically across multiple levels. sing this metric, we investigate inter-annotator agreement on the multilevel annotations of two different music corpora, investigate the influence of acoustic properties on hierarchical annotations, and evaluate existing hierarchical segmentation algorithms against the distribution of inter-annotator agreement.

  10. Evaluating Hierarchical Structure in Music Annotations

    Directory of Open Access Journals (Sweden)

    Brian McFee

    2017-08-01

    Full Text Available Music exhibits structure at multiple scales, ranging from motifs to large-scale functional components. When inferring the structure of a piece, different listeners may attend to different temporal scales, which can result in disagreements when they describe the same piece. In the field of music informatics research (MIR, it is common to use corpora annotated with structural boundaries at different levels. By quantifying disagreements between multiple annotators, previous research has yielded several insights relevant to the study of music cognition. First, annotators tend to agree when structural boundaries are ambiguous. Second, this ambiguity seems to depend on musical features, time scale, and genre. Furthermore, it is possible to tune current annotation evaluation metrics to better align with these perceptual differences. However, previous work has not directly analyzed the effects of hierarchical structure because the existing methods for comparing structural annotations are designed for “flat” descriptions, and do not readily generalize to hierarchical annotations. In this paper, we extend and generalize previous work on the evaluation of hierarchical descriptions of musical structure. We derive an evaluation metric which can compare hierarchical annotations holistically across multiple levels. sing this metric, we investigate inter-annotator agreement on the multilevel annotations of two different music corpora, investigate the influence of acoustic properties on hierarchical annotations, and evaluate existing hierarchical segmentation algorithms against the distribution of inter-annotator agreement.

  11. Hierarchical Nanoceramics for Industrial Process Sensors

    Energy Technology Data Exchange (ETDEWEB)

    Ruud, James, A.; Brosnan, Kristen, H.; Striker, Todd; Ramaswamy, Vidya; Aceto, Steven, C.; Gao, Yan; Willson, Patrick, D.; Manoharan, Mohan; Armstrong, Eric, N., Wachsman, Eric, D.; Kao, Chi-Chang

    2011-07-15

    This project developed a robust, tunable, hierarchical nanoceramics materials platform for industrial process sensors in harsh-environments. Control of material structure at multiple length scales from nano to macro increased the sensing response of the materials to combustion gases. These materials operated at relatively high temperatures, enabling detection close to the source of combustion. It is anticipated that these materials can form the basis for a new class of sensors enabling widespread use of efficient combustion processes with closed loop feedback control in the energy-intensive industries. The first phase of the project focused on materials selection and process development, leading to hierarchical nanoceramics that were evaluated for sensing performance. The second phase focused on optimizing the materials processes and microstructures, followed by validation of performance of a prototype sensor in a laboratory combustion environment. The objectives of this project were achieved by: (1) synthesizing and optimizing hierarchical nanostructures; (2) synthesizing and optimizing sensing nanomaterials; (3) integrating sensing functionality into hierarchical nanostructures; (4) demonstrating material performance in a sensing element; and (5) validating material performance in a simulated service environment. The project developed hierarchical nanoceramic electrodes for mixed potential zirconia gas sensors with increased surface area and demonstrated tailored electrocatalytic activity operable at high temperatures enabling detection of products of combustion such as NOx close to the source of combustion. Methods were developed for synthesis of hierarchical nanostructures with high, stable surface area, integrated catalytic functionality within the structures for gas sensing, and demonstrated materials performance in harsh lab and combustion gas environments.

  12. HIERARCHICAL OPTIMIZATION MODEL ON GEONETWORK

    Directory of Open Access Journals (Sweden)

    Z. Zha

    2012-07-01

    Full Text Available In existing construction experience of Spatial Data Infrastructure (SDI, GeoNetwork, as the geographical information integrated solution, is an effective way of building SDI. During GeoNetwork serving as an internet application, several shortcomings are exposed. The first one is that the time consuming of data loading has been considerately increasing with the growth of metadata count. Consequently, the efficiency of query and search service becomes lower. Another problem is that stability and robustness are both ruined since huge amount of metadata. The final flaw is that the requirements of multi-user concurrent accessing based on massive data are not effectively satisfied on the internet. A novel approach, Hierarchical Optimization Model (HOM, is presented to solve the incapability of GeoNetwork working with massive data in this paper. HOM optimizes the GeoNetwork from these aspects: internal procedure, external deployment strategies, etc. This model builds an efficient index for accessing huge metadata and supporting concurrent processes. In this way, the services based on GeoNetwork can maintain stable while running massive metadata. As an experiment, we deployed more than 30 GeoNetwork nodes, and harvest nearly 1.1 million metadata. From the contrast between the HOM-improved software and the original one, the model makes indexing and retrieval processes more quickly and keeps the speed stable on metadata amount increasing. It also shows stable on multi-user concurrent accessing to system services, the experiment achieved good results and proved that our optimization model is efficient and reliable.

  13. Korte ture i bil

    DEFF Research Database (Denmark)

    Christensen, Linda; Jensen, Thomas Christian

    choice turn out to be car ownership, gender, travel time, topography and outdoor temperatures. But also travel purposes are impor-tant – especially escorting and shopping tends to increase the share of car driving. It is often claimed that the extensive bicycling in The Netherlands and Denmark is due...... of the trip reflecting rush hours and congestion. The socio-economic data includes age, gender, family size, children of different age, income and position. Travel costs could not be included because of the high correlation with the travel time. Among other variables missing in the analyses are the access...... cities. Further it will reduce the risk of death with 2 % for all adults and 5-7 % for the workforce. CO2 emissions will only be reduced 2 - 2½ % equal to the reduction in car kilometres. To conclude, a bicycle friendly policy cannot make passenger travel sustainable. But it could be one of many...

  14. Gap junctions mediate large-scale Turing structures in a mean-field cortex driven by subcortical noise

    Science.gov (United States)

    Steyn-Ross, Moira L.; Steyn-Ross, D. A.; Wilson, M. T.; Sleigh, J. W.

    2007-07-01

    One of the grand puzzles in neuroscience is establishing the link between cognition and the disparate patterns of spontaneous and task-induced brain activity that can be measured clinically using a wide range of detection modalities such as scalp electrodes and imaging tomography. High-level brain function is not a single-neuron property, yet emerges as a cooperative phenomenon of multiply-interacting populations of neurons. Therefore a fruitful modeling approach is to picture the cerebral cortex as a continuum characterized by parameters that have been averaged over a small volume of cortical tissue. Such mean-field cortical models have been used to investigate gross patterns of brain behavior such as anesthesia, the cycles of natural sleep, memory and erasure in slow-wave sleep, and epilepsy. There is persuasive and accumulating evidence that direct gap-junction connections between inhibitory neurons promote synchronous oscillatory behavior both locally and across distances of some centimeters, but, to date, continuum models have ignored gap-junction connectivity. In this paper we employ simple mean-field arguments to derive an expression for D2 , the diffusive coupling strength arising from gap-junction connections between inhibitory neurons. Using recent neurophysiological measurements reported by Fukuda [J. Neurosci. 26, 3434 (2006)], we estimate an upper limit of D2≈0.6cm2 . We apply a linear stability analysis to a standard mean-field cortical model, augmented with gap-junction diffusion, and find this value for the diffusive coupling strength to be close to the critical value required to destabilize the homogeneous steady state. Computer simulations demonstrate that larger values of D2 cause the noise-driven model cortex to spontaneously crystalize into random mazelike Turing structures: centimeter-scale spatial patterns in which regions of high-firing activity are intermixed with regions of low-firing activity. These structures are consistent with the

  15. Hierarchical linear regression models for conditional quantiles

    Institute of Scientific and Technical Information of China (English)

    TIAN Maozai; CHEN Gemai

    2006-01-01

    The quantile regression has several useful features and therefore is gradually developing into a comprehensive approach to the statistical analysis of linear and nonlinear response models,but it cannot deal effectively with the data with a hierarchical structure.In practice,the existence of such data hierarchies is neither accidental nor ignorable,it is a common phenomenon.To ignore this hierarchical data structure risks overlooking the importance of group effects,and may also render many of the traditional statistical analysis techniques used for studying data relationships invalid.On the other hand,the hierarchical models take a hierarchical data structure into account and have also many applications in statistics,ranging from overdispersion to constructing min-max estimators.However,the hierarchical models are virtually the mean regression,therefore,they cannot be used to characterize the entire conditional distribution of a dependent variable given high-dimensional covariates.Furthermore,the estimated coefficient vector (marginal effects)is sensitive to an outlier observation on the dependent variable.In this article,a new approach,which is based on the Gauss-Seidel iteration and taking a full advantage of the quantile regression and hierarchical models,is developed.On the theoretical front,we also consider the asymptotic properties of the new method,obtaining the simple conditions for an n1/2-convergence and an asymptotic normality.We also illustrate the use of the technique with the real educational data which is hierarchical and how the results can be explained.

  16. Self-assembled biomimetic superhydrophobic hierarchical arrays.

    Science.gov (United States)

    Yang, Hongta; Dou, Xuan; Fang, Yin; Jiang, Peng

    2013-09-01

    Here, we report a simple and inexpensive bottom-up technology for fabricating superhydrophobic coatings with hierarchical micro-/nano-structures, which are inspired by the binary periodic structure found on the superhydrophobic compound eyes of some insects (e.g., mosquitoes and moths). Binary colloidal arrays consisting of exemplary large (4 and 30 μm) and small (300 nm) silica spheres are first assembled by a scalable Langmuir-Blodgett (LB) technology in a layer-by-layer manner. After surface modification with fluorosilanes, the self-assembled hierarchical particle arrays become superhydrophobic with an apparent water contact angle (CA) larger than 150°. The throughput of the resulting superhydrophobic coatings with hierarchical structures can be significantly improved by templating the binary periodic structures of the LB-assembled colloidal arrays into UV-curable fluoropolymers by a soft lithography approach. Superhydrophobic perfluoroether acrylate hierarchical arrays with large CAs and small CA hysteresis can be faithfully replicated onto various substrates. Both experiments and theoretical calculations based on the Cassie's dewetting model demonstrate the importance of the hierarchical structure in achieving the final superhydrophobic surface states. Copyright © 2013 Elsevier Inc. All rights reserved.

  17. Analysis hierarchical model for discrete event systems

    Science.gov (United States)

    Ciortea, E. M.

    2015-11-01

    The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.

  18. Hierarchical models and chaotic spin glasses

    Science.gov (United States)

    Berker, A. Nihat; McKay, Susan R.

    1984-09-01

    Renormalization-group studies in position space have led to the discovery of hierarchical models which are exactly solvable, exhibiting nonclassical critical behavior at finite temperature. Position-space renormalization-group approximations that had been widely and successfully used are in fact alternatively applicable as exact solutions of hierarchical models, this realizability guaranteeing important physical requirements. For example, a hierarchized version of the Sierpiriski gasket is presented, corresponding to a renormalization-group approximation which has quantitatively yielded the multicritical phase diagrams of submonolayers on graphite. Hierarchical models are now being studied directly as a testing ground for new concepts. For example, with the introduction of frustration, chaotic renormalization-group trajectories were obtained for the first time. Thus, strong and weak correlations are randomly intermingled at successive length scales, and a new microscopic picture and mechanism for a spin glass emerges. An upper critical dimension occurs via a boundary crisis mechanism in cluster-hierarchical variants developed to have well-behaved susceptibilities.

  19. Biased trapping issue on weighted hierarchical networks

    Indian Academy of Sciences (India)

    Meifeng Dai; Jie Liu; Feng Zhu

    2014-10-01

    In this paper, we present trapping issues of weight-dependent walks on weighted hierarchical networks which are based on the classic scale-free hierarchical networks. Assuming that edge’s weight is used as local information by a random walker, we introduce a biased walk. The biased walk is that a walker, at each step, chooses one of its neighbours with a probability proportional to the weight of the edge. We focus on a particular case with the immobile trap positioned at the hub node which has the largest degree in the weighted hierarchical networks. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping issue. Let parameter (0 < < 1) be the weight factor. We show that the efficiency of the trapping process depends on the parameter a; the smaller the value of a, the more efficient is the trapping process.

  20. Improving broadcast channel rate using hierarchical modulation

    CERN Document Server

    Meric, Hugo; Arnal, Fabrice; Lesthievent, Guy; Boucheret, Marie-Laure

    2011-01-01

    We investigate the design of a broadcast system where the aim is to maximise the throughput. This task is usually challenging due to the channel variability. Forty years ago, Cover introduced and compared two schemes: time sharing and superposition coding. The second scheme was proved to be optimal for some channels. Modern satellite communications systems such as DVB-SH and DVB-S2 mainly rely on time sharing strategy to optimize throughput. They consider hierarchical modulation, a practical implementation of superposition coding, but only for unequal error protection or backward compatibility purposes. We propose in this article to combine time sharing and hierarchical modulation together and show how this scheme can improve the performance in terms of available rate. We present the gain on a simple channel modeling the broadcasting area of a satellite. Our work is applied to the DVB-SH standard, which considers hierarchical modulation as an optional feature.

  1. Incentive Mechanisms for Hierarchical Spectrum Markets

    CERN Document Server

    Iosifidis, George; Alpcan, Tansu; Koutsopoulos, Iordanis

    2011-01-01

    We study spectrum allocation mechanisms in hierarchical multi-layer markets which are expected to proliferate in the near future based on the current spectrum policy reform proposals. We consider a setting where a state agency sells spectrum to Primary Operators (POs) and in turn these resell it to Secondary Operators (SOs) through auctions. We show that these hierarchical markets do not result in a socially efficient spectrum allocation which is aimed by the agency, due to lack of coordination among the entities in different layers and the inherently selfish revenue-maximizing strategy of POs. In order to reconcile these opposing objectives, we propose an incentive mechanism which aligns the strategy and the actions of the POs with the objective of the agency, and thus it leads to system performance improvement in terms of social welfare. This pricing based mechanism constitutes a method for hierarchical market regulation and requires the feedback provision from SOs. A basic component of the proposed incenti...

  2. Hierarchical self-organization of tectonic plates

    CERN Document Server

    Morra, Gabriele; Müller, R Dietmar

    2010-01-01

    The Earth's surface is subdivided into eight large tectonic plates and many smaller ones. We reconstruct the plate tessellation history and demonstrate that both large and small plates display two distinct hierarchical patterns, described by different power-law size-relationships. While small plates display little organisational change through time, the structure of the large plates oscillate between minimum and maximum hierarchical tessellations. The organization of large plates rapidly changes from a weak hierarchy at 120-100 million years ago (Ma) towards a strong hierarchy, which peaked at 65-50, Ma subsequently relaxing back towards a minimum hierarchical structure. We suggest that this fluctuation reflects an alternation between top and bottom driven plate tectonics, revealing a previously undiscovered tectonic cyclicity at a timescale of 100 million years.

  3. Towards a sustainable manufacture of hierarchical zeolites.

    Science.gov (United States)

    Verboekend, Danny; Pérez-Ramírez, Javier

    2014-03-01

    Hierarchical zeolites have been established as a superior type of aluminosilicate catalysts compared to their conventional (purely microporous) counterparts. An impressive array of bottom-up and top-down approaches has been developed during the last decade to design and subsequently exploit these exciting materials catalytically. However, the sustainability of the developed synthetic methods has rarely been addressed. This paper highlights important criteria to ensure the ecological and economic viability of the manufacture of hierarchical zeolites. Moreover, by using base leaching as a promising case study, we verify a variety of approaches to increase reactor productivity, recycle waste streams, prevent the combustion of organic compounds, and minimize separation efforts. By reducing their synthetic footprint, hierarchical zeolites are positioned as an integral part of sustainable chemistry. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  4. Classification using Hierarchical Naive Bayes models

    DEFF Research Database (Denmark)

    Langseth, Helge; Dyhre Nielsen, Thomas

    2006-01-01

    Classification problems have a long history in the machine learning literature. One of the simplest, and yet most consistently well-performing set of classifiers is the Naïve Bayes models. However, an inherent problem with these classifiers is the assumption that all attributes used to describe...... an instance are conditionally independent given the class of that instance. When this assumption is violated (which is often the case in practice) it can reduce classification accuracy due to “information double-counting” and interaction omission. In this paper we focus on a relatively new set of models......, termed Hierarchical Naïve Bayes models. Hierarchical Naïve Bayes models extend the modeling flexibility of Naïve Bayes models by introducing latent variables to relax some of the independence statements in these models. We propose a simple algorithm for learning Hierarchical Naïve Bayes models...

  5. Hierarchical Neural Network Structures for Phoneme Recognition

    CERN Document Server

    Vasquez, Daniel; Minker, Wolfgang

    2013-01-01

    In this book, hierarchical structures based on neural networks are investigated for automatic speech recognition. These structures are evaluated on the phoneme recognition task where a  Hybrid Hidden Markov Model/Artificial Neural Network paradigm is used. The baseline hierarchical scheme consists of two levels each which is based on a Multilayered Perceptron. Additionally, the output of the first level serves as a second level input. The computational speed of the phoneme recognizer can be substantially increased by removing redundant information still contained at the first level output. Several techniques based on temporal and phonetic criteria have been investigated to remove this redundant information. The computational time could be reduced by 57% whilst keeping the system accuracy comparable to the baseline hierarchical approach.

  6. Universal hierarchical behavior of citation networks

    CERN Document Server

    Mones, Enys; Vicsek, Tamás

    2014-01-01

    Many of the essential features of the evolution of scientific research are imprinted in the structure of citation networks. Connections in these networks imply information about the transfer of knowledge among papers, or in other words, edges describe the impact of papers on other publications. This inherent meaning of the edges infers that citation networks can exhibit hierarchical features, that is typical of networks based on decision-making. In this paper, we investigate the hierarchical structure of citation networks consisting of papers in the same field. We find that the majority of the networks follow a universal trend towards a highly hierarchical state, and i) the various fields display differences only concerning their phase in life (distance from the "birth" of a field) or ii) the characteristic time according to which they are approaching the stationary state. We also show by a simple argument that the alterations in the behavior are related to and can be understood by the degree of specializatio...

  7. Static and dynamic friction of hierarchical surfaces

    Science.gov (United States)

    Costagliola, Gianluca; Bosia, Federico; Pugno, Nicola M.

    2016-12-01

    Hierarchical structures are very common in nature, but only recently have they been systematically studied in materials science, in order to understand the specific effects they can have on the mechanical properties of various systems. Structural hierarchy provides a way to tune and optimize macroscopic mechanical properties starting from simple base constituents and new materials are nowadays designed exploiting this possibility. This can be true also in the field of tribology. In this paper we study the effect of hierarchical patterned surfaces on the static and dynamic friction coefficients of an elastic material. Our results are obtained by means of numerical simulations using a one-dimensional spring-block model, which has previously been used to investigate various aspects of friction. Despite the simplicity of the model, we highlight some possible mechanisms that explain how hierarchical structures can significantly modify the friction coefficients of a material, providing a means to achieve tunability.

  8. Hierarchical control of electron-transfer

    DEFF Research Database (Denmark)

    Westerhoff, Hans V.; Jensen, Peter Ruhdal; Egger, Louis;

    1997-01-01

    In this chapter the role of electron transfer in determining the behaviour of the ATP synthesising enzyme in E. coli is analysed. It is concluded that the latter enzyme lacks control because of special properties of the electron transfer components. These properties range from absence of a strong...... back pressure by the protonmotive force on the rate of electron transfer to hierarchical regulation of the expression of the gens that encode the electron transfer proteins as a response to changes in the bioenergetic properties of the cell.The discussion uses Hierarchical Control Analysis...

  9. Genetic Algorithm for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sajid Hussain

    2007-09-01

    Full Text Available Large scale wireless sensor networks (WSNs can be used for various pervasive and ubiquitous applications such as security, health-care, industry automation, agriculture, environment and habitat monitoring. As hierarchical clusters can reduce the energy consumption requirements for WSNs, we investigate intelligent techniques for cluster formation and management. A genetic algorithm (GA is used to create energy efficient clusters for data dissemination in wireless sensor networks. The simulation results show that the proposed intelligent hierarchical clustering technique can extend the network lifetime for different network deployment environments.

  10. DC Hierarchical Control System for Microgrid Applications

    OpenAIRE

    Lu, Xiaonan; Sun, Kai; Guerrero, Josep M.; Huang, Lipei

    2013-01-01

    In order to enhance the DC side performance of AC-DC hybrid microgrid,a DC hierarchical control system is proposed in this paper.To meet the requirement of DC load sharing between the parallel power interfaces,droop method is adopted.Meanwhile,DC voltage secondary control is employed to restore the deviation in the DC bus voltage.The hierarchical control system is composed of two levels.DC voltage and AC current controllers are achieved in the primary control level.

  11. Hierarchical social networks and information flow

    Science.gov (United States)

    López, Luis; F. F. Mendes, Jose; Sanjuán, Miguel A. F.

    2002-12-01

    Using a simple model for the information flow on social networks, we show that the traditional hierarchical topologies frequently used by companies and organizations, are poorly designed in terms of efficiency. Moreover, we prove that this type of structures are the result of the individual aim of monopolizing as much information as possible within the network. As the information is an appropriate measurement of centrality, we conclude that this kind of topology is so attractive for leaders, because the global influence each actor has within the network is completely determined by the hierarchical level occupied.

  12. Analyzing security protocols in hierarchical networks

    DEFF Research Database (Denmark)

    Zhang, Ye; Nielson, Hanne Riis

    2006-01-01

    Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus...... capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series...

  13. Hierarchic Models of Turbulence, Superfluidity and Superconductivity

    CERN Document Server

    Kaivarainen, A

    2000-01-01

    New models of Turbulence, Superfluidity and Superconductivity, based on new Hierarchic theory, general for liquids and solids (physics/0102086), have been proposed. CONTENTS: 1 Turbulence. General description; 2 Mesoscopic mechanism of turbulence; 3 Superfluidity. General description; 4 Mesoscopic scenario of fluidity; 5 Superfluidity as a hierarchic self-organization process; 6 Superfluidity in 3He; 7 Superconductivity: General properties of metals and semiconductors; Plasma oscillations; Cyclotron resonance; Electroconductivity; 8. Microscopic theory of superconductivity (BCS); 9. Mesoscopic scenario of superconductivity: Interpretation of experimental data in the framework of mesoscopic model of superconductivity.

  14. Hierarchical Analysis of the Omega Ontology

    Energy Technology Data Exchange (ETDEWEB)

    Joslyn, Cliff A.; Paulson, Patrick R.

    2009-12-01

    Initial delivery for mathematical analysis of the Omega Ontology. We provide an analysis of the hierarchical structure of a version of the Omega Ontology currently in use within the US Government. After providing an initial statistical analysis of the distribution of all link types in the ontology, we then provide a detailed order theoretical analysis of each of the four main hierarchical links present. This order theoretical analysis includes the distribution of components and their properties, their parent/child and multiple inheritance structure, and the distribution of their vertical ranks.

  15. Implications of the Turing completeness of reaction-diffusion models, informed by GPGPU simulations on an XBox 360: cardiac arrhythmias, re-entry and the Halting problem.

    Science.gov (United States)

    Scarle, Simon

    2009-08-01

    In the arsenal of tools that a computational modeller can bring to bare on the study of cardiac arrhythmias, the most widely used and arguably the most successful is that of an excitable medium, a special case of a reaction-diffusion model. These are used to simulate the internal chemical reactions of a cardiac cell and the diffusion of their membrane voltages. Via a number of different methodologies it has previously been shown that reaction-diffusion systems are at multiple levels Turing complete. That is, they are capable of computation in the same manner as a universal Turing machine. However, all such computational systems are subject to a limitation known as the Halting problem. By constructing a universal logic gate using a cardiac cell model, we highlight how the Halting problem therefore could limit what it is possible to predict about cardiac tissue, arrhythmias and re-entry. All simulations for this work were carried out on the GPU of an XBox 360 development console, and we also highlight the great gains in computational power and efficiency produced by such general purpose processing on a GPU for cardiac simulations.

  16. Hierarchical machining materials and their performance

    DEFF Research Database (Denmark)

    Sidorenko, Daria; Loginov, Pavel; Levashov, Evgeny

    2016-01-01

    as nanoparticles in the binder, or polycrystalline, aggregate-like reinforcements, also at several scale levels). Such materials can ensure better productivity, efficiency, and lower costs of drilling, cutting, grinding, and other technological processes. This article reviews the main groups of hierarchical...

  17. Hierarchical Optimization of Material and Structure

    DEFF Research Database (Denmark)

    Rodrigues, Helder C.; Guedes, Jose M.; Bendsøe, Martin P.

    2002-01-01

    This paper describes a hierarchical computational procedure for optimizing material distribution as well as the local material properties of mechanical elements. The local properties are designed using a topology design approach, leading to single scale microstructures, which may be restricted...... in various ways, based on design and manufacturing criteria. Implementation issues are also discussed and computational results illustrate the nature of the procedure....

  18. Hierarchical structure of nanofibers by bubbfil spinning

    Directory of Open Access Journals (Sweden)

    Liu Chang

    2015-01-01

    Full Text Available A polymer bubble is easy to be broken under a small external force, various different fragments are formed, which can be produced to different morphologies of products including nanofibers and plate-like strip. Polyvinyl-alcohol/honey solution is used in the experiment to show hierarchical structure by the bubbfil spinning.

  19. Sharing the proceeds from a hierarchical venture

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Tvede, Mich;

    2017-01-01

    We consider the problem of distributing the proceeds generated from a joint venture in which the participating agents are hierarchically organized. We introduce and characterize a family of allocation rules where revenue ‘bubbles up’ in the hierarchy. The family is flexible enough to accommodate...

  20. Metal oxide nanostructures with hierarchical morphology

    Science.gov (United States)

    Ren, Zhifeng; Lao, Jing Yu; Banerjee, Debasish

    2007-11-13

    The present invention relates generally to metal oxide materials with varied symmetrical nanostructure morphologies. In particular, the present invention provides metal oxide materials comprising one or more metallic oxides with three-dimensionally ordered nanostructural morphologies, including hierarchical morphologies. The present invention also provides methods for producing such metal oxide materials.

  1. Hierarchical Scaling in Systems of Natural Cities

    CERN Document Server

    Chen, Yanguang

    2016-01-01

    Hierarchies can be modeled by a set of exponential functions, from which we can derive a set of power laws indicative of scaling. These scaling laws are followed by many natural and social phenomena such as cities, earthquakes, and rivers. This paper is devoted to revealing the scaling patterns in systems of natural cities by reconstructing the hierarchy with cascade structure. The cities of America, Britain, France, and Germany are taken as examples to make empirical analyses. The hierarchical scaling relations can be well fitted to the data points within the scaling ranges of the size and area of the natural cities. The size-number and area-number scaling exponents are close to 1, and the allometric scaling exponent is slightly less than 1. The results suggest that natural cities follow hierarchical scaling laws and hierarchical conservation law. Zipf's law proved to be one of the indications of the hierarchical scaling, and the primate law of city-size distribution represents a local pattern and can be mer...

  2. Semiparametric Quantile Modelling of Hierarchical Data

    Institute of Scientific and Technical Information of China (English)

    Mao Zai TIAN; Man Lai TANG; Ping Shing CHAN

    2009-01-01

    The classic hierarchical linear model formulation provides a considerable flexibility for modelling the random effects structure and a powerful tool for analyzing nested data that arise in various areas such as biology, economics and education. However, it assumes the within-group errors to be independently and identically distributed (i.i.d.) and models at all levels to be linear. Most importantly, traditional hierarchical models (just like other ordinary mean regression methods) cannot characterize the entire conditional distribution of a dependent variable given a set of covariates and fail to yield robust estimators. In this article, we relax the aforementioned and normality assumptions, and develop a so-called Hierarchical Semiparametric Quantile Regression Models in which the within-group errors could be heteroscedastic and models at some levels are allowed to be nonparametric. We present the ideas with a 2-level model. The level-l model is specified as a nonparametric model whereas level-2 model is set as a parametric model. Under the proposed semiparametric setting the vector of partial derivatives of the nonparametric function in level-1 becomes the response variable vector in level 2. The proposed method allows us to model the fixed effects in the innermost level (i.e., level 2) as a function of the covariates instead of a constant effect. We outline some mild regularity conditions required for convergence and asymptotic normality for our estimators. We illustrate our methodology with a real hierarchical data set from a laboratory study and some simulation studies.

  3. Hierarchical Context Modeling for Video Event Recognition.

    Science.gov (United States)

    Wang, Xiaoyang; Ji, Qiang

    2016-10-11

    Current video event recognition research remains largely target-centered. For real-world surveillance videos, targetcentered event recognition faces great challenges due to large intra-class target variation, limited image resolution, and poor detection and tracking results. To mitigate these challenges, we introduced a context-augmented video event recognition approach. Specifically, we explicitly capture different types of contexts from three levels including image level, semantic level, and prior level. At the image level, we introduce two types of contextual features including the appearance context features and interaction context features to capture the appearance of context objects and their interactions with the target objects. At the semantic level, we propose a deep model based on deep Boltzmann machine to learn event object representations and their interactions. At the prior level, we utilize two types of prior-level contexts including scene priming and dynamic cueing. Finally, we introduce a hierarchical context model that systematically integrates the contextual information at different levels. Through the hierarchical context model, contexts at different levels jointly contribute to the event recognition. We evaluate the hierarchical context model for event recognition on benchmark surveillance video datasets. Results show that incorporating contexts in each level can improve event recognition performance, and jointly integrating three levels of contexts through our hierarchical model achieves the best performance.

  4. Managing Clustered Data Using Hierarchical Linear Modeling

    Science.gov (United States)

    Warne, Russell T.; Li, Yan; McKyer, E. Lisako J.; Condie, Rachel; Diep, Cassandra S.; Murano, Peter S.

    2012-01-01

    Researchers in nutrition research often use cluster or multistage sampling to gather participants for their studies. These sampling methods often produce violations of the assumption of data independence that most traditional statistics share. Hierarchical linear modeling is a statistical method that can overcome violations of the independence…

  5. Strategic games on a hierarchical network model

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Among complex network models, the hierarchical network model is the one most close to such real networks as world trade web, metabolic network, WWW, actor network, and so on. It has not only the property of power-law degree distribution, but growth based on growth and preferential attachment, showing the scale-free degree distribution property. In this paper, we study the evolution of cooperation on a hierarchical network model, adopting the prisoner's dilemma (PD) game and snowdrift game (SG) as metaphors of the interplay between connected nodes. BA model provides a unifying framework for the emergence of cooperation. But interestingly, we found that on hierarchical model, there is no sign of cooperation for PD game, while the frequency of cooperation decreases as the common benefit decreases for SG. By comparing the scaling clustering coefficient properties of the hierarchical network model with that of BA model, we found that the former amplifies the effect of hubs. Considering different performances of PD game and SG on complex network, we also found that common benefit leads to cooperation in the evolution. Thus our study may shed light on the emergence of cooperation in both natural and social environments.

  6. Endogenous Effort Norms in Hierarchical Firms

    NARCIS (Netherlands)

    J. Tichem (Jan)

    2013-01-01

    markdownabstract__Abstract__ This paper studies how a three-layer hierarchical firm (principal-supervisor-agent) optimally creates effort norms for its employees. The key assumption is that effort norms are affected by the example of superiors. In equilibrium, norms are eroded as one moves down

  7. Complex Evaluation of Hierarchically-Network Systems

    CERN Document Server

    Polishchuk, Dmytro; Yadzhak, Mykhailo

    2016-01-01

    Methods of complex evaluation based on local, forecasting, aggregated, and interactive evaluation of the state, function quality, and interaction of complex system's objects on the all hierarchical levels is proposed. Examples of analysis of the structural elements of railway transport system are used for illustration of efficiency of proposed approach.

  8. A Hierarchical Grouping of Great Educators

    Science.gov (United States)

    Barker, Donald G.

    1977-01-01

    Great educators of history were categorized on the basis of their: aims of education, fundamental ideas, and educational theories. They were classed by Ward's method of hierarchical analysis into six groupings: Socrates, Ausonius, Jerome, Abelard; Quintilian, Origen, Melanchthon, Ascham, Loyola; Alciun, Comenius; Vittorino, Basedow, Pestalozzi,…

  9. Ultrafast Hierarchical OTDM/WDM Network

    Directory of Open Access Journals (Sweden)

    Hideyuki Sotobayashi

    2003-12-01

    Full Text Available Ultrafast hierarchical OTDM/WDM network is proposed for the future core-network. We review its enabling technologies: C- and L-wavelength-band generation, OTDM-WDM mutual multiplexing format conversions, and ultrafast OTDM wavelengthband conversions.

  10. Hierarchical fuzzy identification of MR damper

    Science.gov (United States)

    Wang, Hao; Hu, Haiyan

    2009-07-01

    Magneto-rheological (MR) dampers, recently, have found many successful applications in civil engineering and numerous area of mechanical engineering. When an MR damper is to be used for vibration suppression, an inevitable problem is to determine the input voltage so as to gain the desired restoring force determined from the control law. This is the so-called inverse problem of MR dampers and is always an obstacle in the application of MR dampers to vibration control. It is extremely difficult to get the inverse model of MR damper because MR dampers are highly nonlinear and hysteretic. When identifying the inverse model of MR damper with simple fuzzy system, there maybe exists curse of dimensionality of fuzzy system. Therefore, it will take much more time, and even the inverse model may not be identifiable. The paper presents two-layer hierarchical fuzzy system, that is, two-layer hierarchical ANFIS to deal with the curse of dimensionality of the fuzzy identification of MR damper and to identify the inverse model of MR damper. Data used for training the model are generated from numerical simulation of nonlinear differential equations. The numerical simulation proves that the proposed hierarchical fuzzy system can model the inverse model of MR damper much more quickly than simple fuzzy system without any reduction of identification precision. Such hierarchical ANFIS shows the higher priority for the complicated system, and can also be used in system identification and system control for the complicated system.

  11. Statistical theory of hierarchical avalanche ensemble

    OpenAIRE

    Olemskoi, Alexander I.

    1999-01-01

    The statistical ensemble of avalanche intensities is considered to investigate diffusion in ultrametric space of hierarchically subordinated avalanches. The stationary intensity distribution and the steady-state current are obtained. The critical avalanche intensity needed to initiate the global avalanche formation is calculated depending on noise intensity. The large time asymptotic for the probability of the global avalanche appearance is derived.

  12. Managing Clustered Data Using Hierarchical Linear Modeling

    Science.gov (United States)

    Warne, Russell T.; Li, Yan; McKyer, E. Lisako J.; Condie, Rachel; Diep, Cassandra S.; Murano, Peter S.

    2012-01-01

    Researchers in nutrition research often use cluster or multistage sampling to gather participants for their studies. These sampling methods often produce violations of the assumption of data independence that most traditional statistics share. Hierarchical linear modeling is a statistical method that can overcome violations of the independence…

  13. Equivalence Checking of Hierarchical Combinational Circuits

    DEFF Research Database (Denmark)

    Williams, Poul Frederick; Hulgaard, Henrik; Andersen, Henrik Reif

    1999-01-01

    This paper presents a method for verifying that two hierarchical combinational circuits implement the same Boolean functions. The key new feature of the method is its ability to exploit the modularity of circuits to reuse results obtained from one part of the circuits in other parts. We demonstrate...... our method on large adder and multiplier circuits....

  14. Generic hierarchical engine for mask data preparation

    Science.gov (United States)

    Kalus, Christian K.; Roessl, Wolfgang; Schnitker, Uwe; Simecek, Michal

    2002-07-01

    Electronic layouts are usually flattened on their path from the hierarchical source downstream to the wafer. Mask data preparation has certainly been identified as a severe bottleneck since long. Data volumes are not only doubling every year along the ITRS roadmap. With the advent of optical proximity correction and phase-shifting masks data volumes are escalating up to non-manageable heights. Hierarchical treatment is one of the most powerful means to keep memory and CPU consumption in reasonable ranges. Only recently, however, has this technique acquired more public attention. Mask data preparation is the most critical area calling for a sound infrastructure to reduce the handling problem. Gaining more and more attention though, are other applications such as large area simulation and manufacturing rule checking (MRC). They all would profit from a generic engine capable to efficiently treat hierarchical data. In this paper we will present a generic engine for hierarchical treatment which solves the major problem, steady transitions along cell borders. Several alternatives exist how to walk through the hierarchy tree. They have, to date, not been thoroughly investigated. One is a bottom-up attempt to treat cells starting with the most elementary cells. The other one is a top-down approach which lends itself to creating a new hierarchy tree. In addition, since the variety, degree of hierarchy and quality of layouts extends over a wide range a generic engine has to take intelligent decisions when exploding the hierarchy tree. Several applications will be shown, in particular how far the limits can be pushed with the current hierarchical engine.

  15. Hierarchical organisation in perception of orientation.

    Science.gov (United States)

    Spinelli, D; Antonucci, G; Daini, R; Martelli, M L; Zoccolotti, P

    1999-01-01

    According to Rock [1990, in The Legacy of Solomon Asch (Hillsdale, NJ: Lawrence Erlbaum Associates)], hierarchical organisation of perception describes cases in which the orientation of an object is affected by the immediately surrounding elements in the visual field. Various experiments were performed to study the hierarchical organisation of orientation perception. In most of them the rod-and-frame-illusion (RFI: change of the apparent vertical measured on a central rod surrounded by a tilted frame) was measured in the presence/absence of a second inner frame. The first three experiments showed that, when the inner frame is vertical, the direction and size of the illusion are consistent with expectancies based on the hierarchical organisation hypothesis. An analysis of published and unpublished data collected on a large number of subjects showed that orientational hierarchical effects are independent from the absolute size of the RFI. In experiments 4 to 7 we examined the perceptual conditions of the inner stimulus (enclosure, orientation, and presence of luminance borders) critical for obtaining a hierarchical organisation effect. Although an inner vertical square was effective in reducing the illusion (experiment 3), an inner circle enclosing the rod was ineffective (experiment 4). This indicates that definite orientation is necessary to modulate the illusion. However, orientational information provided by a vertical or horizontal rectangle presented near the rod, but not enclosing it, did not modulate the RFI (experiment 5). This suggests that the presence of a figure with oriented contours enclosing the rod is critical. In experiments 6 and 7 we studied whether the presence of luminance borders is important or whether the inner upright square might be effective also if made of subjective contours. When the subjective contour figure was salient and the observers perceived it clearly, its effectiveness in modulating the RFI was comparable to that observed with

  16. A general strategy to determine the congruence between a hierarchical and a non-hierarchical classification

    Directory of Open Access Journals (Sweden)

    Marín Ignacio

    2007-11-01

    Full Text Available Abstract Background Classification procedures are widely used in phylogenetic inference, the analysis of expression profiles, the study of biological networks, etc. Many algorithms have been proposed to establish the similarity between two different classifications of the same elements. However, methods to determine significant coincidences between hierarchical and non-hierarchical partitions are still poorly developed, in spite of the fact that the search for such coincidences is implicit in many analyses of massive data. Results We describe a novel strategy to compare a hierarchical and a dichotomic non-hierarchical classification of elements, in order to find clusters in a hierarchical tree in which elements of a given "flat" partition are overrepresented. The key improvement of our strategy respect to previous methods is using permutation analyses of ranked clusters to determine whether regions of the dendrograms present a significant enrichment. We show that this method is more sensitive than previously developed strategies and how it can be applied to several real cases, including microarray and interactome data. Particularly, we use it to compare a hierarchical representation of the yeast mitochondrial interactome and a catalogue of known mitochondrial protein complexes, demonstrating a high level of congruence between those two classifications. We also discuss extensions of this method to other cases which are conceptually related. Conclusion Our method is highly sensitive and outperforms previously described strategies. A PERL script that implements it is available at http://www.uv.es/~genomica/treetracker.

  17. 图灵测试:哲学争论及历史地位%The Turing Test: Philosophical Debates and Historical Significance

    Institute of Scientific and Technical Information of China (English)

    宋勇刚

    2011-01-01

    The Turing Test is essentially an operational definition for human intelligence. Being fully aware of the possible objections that his definition might rise,, Alan Turing refuted in advance the nine critics he could then envisage. As to this definition itself, related philosophical debates that were profuse in the following 60 years have all pointed to its three basic elements, i. e., language, reasoningand imitation. Turing' s Test has been considered to represent the "beginning" of artificial intelligence, and of which field it remains to be one of the central goals, if not the ultimate one. Traditional concepts of "intelligence" are still facing challenge in the process of developing newer machines whose designed aim is to pass the Turing Test.%图灵测试本质上是对人类智能的一种操作性定义。图灵本人充分意识到这一定义可能会遇到各种诘难,并对自己设想中的9类反对意见逐一作了辩驳。60年来围绕图灵测试的大量哲学争论,直接指向这一定义的3个核心要素,即语言、推理和模仿。古老的哲学问题,正在慢慢步入科学探讨的轨道。图灵测试的提出被公认为是人工智能学科兴起的标志,如今它虽然不能说是人工智能的终极目标,但至少是该领域的核心目标之一。以通过图灵测试为目标的智能机的研制,也向传统的智能概念提出了挑战。

  18. On the geostatistical characterization of hierarchical media

    Science.gov (United States)

    Neuman, Shlomo P.; Riva, Monica; Guadagnini, Alberto

    2008-02-01

    The subsurface consists of porous and fractured materials exhibiting a hierarchical geologic structure, which gives rise to systematic and random spatial and directional variations in hydraulic and transport properties on a multiplicity of scales. Traditional geostatistical moment analysis allows one to infer the spatial covariance structure of such hierarchical, multiscale geologic materials on the basis of numerous measurements on a given support scale across a domain or "window" of a given length scale. The resultant sample variogram often appears to fit a stationary variogram model with constant variance (sill) and integral (spatial correlation) scale. In fact, some authors, who recognize that hierarchical sedimentary architecture and associated log hydraulic conductivity fields tend to be nonstationary, nevertheless associate them with stationary "exponential-like" transition probabilities and variograms, respectively, the latter being a consequence of the former. We propose that (1) the apparent ability of stationary spatial statistics to characterize the covariance structure of nonstationary hierarchical media is an artifact stemming from the finite size of the windows within which geologic and hydrologic variables are ubiquitously sampled, and (2) the artifact is eliminated upon characterizing the covariance structure of such media with the aid of truncated power variograms, which represent stationary random fields obtained upon sampling a nonstationary fractal over finite windows. To support our opinion, we note that truncated power variograms arise formally when a hierarchical medium is sampled jointly across all geologic categories and scales within a window; cite direct evidence that geostatistical parameters (variance and integral scale) inferred on the basis of traditional variograms vary systematically with support and window scales; demonstrate the ability of truncated power models to capture these variations in terms of a few scaling parameters

  19. Application of hierarchical matrices for partial inverse

    KAUST Repository

    Litvinenko, Alexander

    2013-11-26

    In this work we combine hierarchical matrix techniques (Hackbusch, 1999) and domain decomposition methods to obtain fast and efficient algorithms for the solution of multiscale problems. This combination results in the hierarchical domain decomposition (HDD) method, which can be applied for solution multi-scale problems. Multiscale problems are problems that require the use of different length scales. Using only the finest scale is very expensive, if not impossible, in computational time and memory. Domain decomposition methods decompose the complete problem into smaller systems of equations corresponding to boundary value problems in subdomains. Then fast solvers can be applied to each subdomain. Subproblems in subdomains are independent, much smaller and require less computational resources as the initial problem.

  20. First-passage phenomena in hierarchical networks

    CERN Document Server

    Tavani, Flavia

    2016-01-01

    In this paper we study Markov processes and related first passage problems on a class of weighted, modular graphs which generalize the Dyson hierarchical model. In these networks, the coupling strength between two nodes depends on their distance and is modulated by a parameter $\\sigma$. We find that, in the thermodynamic limit, ergodicity is lost and the "distant" nodes can not be reached. Moreover, for finite-sized systems, there exists a threshold value for $\\sigma$ such that, when $\\sigma$ is relatively large, the inhomogeneity of the coupling pattern prevails and "distant" nodes are hardly reached. The same analysis is carried on also for generic hierarchical graphs, where interactions are meant to involve $p$-plets ($p>2$) of nodes, finding that ergodicity is still broken in the thermodynamic limit, but no threshold value for $\\sigma$ is evidenced, ultimately due to a slow growth of the network diameter with the size.

  1. An Hierarchical Approach to Big Data

    CERN Document Server

    Allen, M G; Boch, T; Durand, D; Oberto, A; Merin, B; Stoehr, F; Genova, F; Pineau, F-X; Salgado, J

    2016-01-01

    The increasing volumes of astronomical data require practical methods for data exploration, access and visualisation. The Hierarchical Progressive Survey (HiPS) is a HEALPix based scheme that enables a multi-resolution approach to astronomy data from the individual pixels up to the whole sky. We highlight the decisions and approaches that have been taken to make this scheme a practical solution for managing large volumes of heterogeneous data. Early implementors of this system have formed a network of HiPS nodes, with some 250 diverse data sets currently available, with multiple mirror implementations for important data sets. This hierarchical approach can be adapted to expose Big Data in different ways. We describe how the ease of implementation, and local customisation of the Aladin Lite embeddable HiPS visualiser have been keys for promoting collaboration on HiPS.

  2. Non-homogeneous fractal hierarchical weighted networks.

    Science.gov (United States)

    Dong, Yujuan; Dai, Meifeng; Ye, Dandan

    2015-01-01

    A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r1, r2, · · · rM. We also study the average weighted shortest path (AWSP), the average degree and the average node strength, taking place on the non-homogeneous hierarchical weighted networks. Moreover the AWSP is scrupulously calculated. We show that the AWSP depends on the number of copies and the sum of all non-homogeneous weight scaling factors in the infinite network order limit.

  3. Noise enhances information transfer in hierarchical networks.

    Science.gov (United States)

    Czaplicka, Agnieszka; Holyst, Janusz A; Sloot, Peter M A

    2013-01-01

    We study the influence of noise on information transmission in the form of packages shipped between nodes of hierarchical networks. Numerical simulations are performed for artificial tree networks, scale-free Ravasz-Barabási networks as well for a real network formed by email addresses of former Enron employees. Two types of noise are considered. One is related to packet dynamics and is responsible for a random part of packets paths. The second one originates from random changes in initial network topology. We find that the information transfer can be enhanced by the noise. The system possesses optimal performance when both kinds of noise are tuned to specific values, this corresponds to the Stochastic Resonance phenomenon. There is a non-trivial synergy present for both noisy components. We found also that hierarchical networks built of nodes of various degrees are more efficient in information transfer than trees with a fixed branching factor.

  4. Design of Hierarchical Structures for Synchronized Deformations

    Science.gov (United States)

    Seifi, Hamed; Javan, Anooshe Rezaee; Ghaedizadeh, Arash; Shen, Jianhu; Xu, Shanqing; Xie, Yi Min

    2017-01-01

    In this paper we propose a general method for creating a new type of hierarchical structures at any level in both 2D and 3D. A simple rule based on a rotate-and-mirror procedure is introduced to achieve multi-level hierarchies. These new hierarchical structures have remarkably few degrees of freedom compared to existing designs by other methods. More importantly, these structures exhibit synchronized motions during opening or closure, resulting in uniform and easily-controllable deformations. Furthermore, a simple analytical formula is found which can be used to avoid collision of units of the structure during the closing process. The novel design concept is verified by mathematical analyses, computational simulations and physical experiments.

  5. Hierarchical model of vulnerabilities for emotional disorders.

    Science.gov (United States)

    Norton, Peter J; Mehta, Paras D

    2007-01-01

    Clark and Watson's (1991) tripartite model of anxiety and depression has had a dramatic impact on our understanding of the dispositional variables underlying emotional disorders. More recently, calls have been made to examine not simply the influence of negative affectivity (NA) but also mediating factors that might better explain how NA influences anxious and depressive syndromes (e.g. Taylor, 1998; Watson, 2005). Extending preliminary projects, this study evaluated two hierarchical models of NA, mediating factors of anxiety sensitivity and intolerance of uncertainty, and specific emotional manifestations. Data provided a very good fit to a model elaborated from preliminary studies, lending further support to hierarchical models of emotional vulnerabilities. Implications for classification and diagnosis are discussed.

  6. Hierarchical Self-organization of Complex Systems

    Institute of Scientific and Technical Information of China (English)

    CHAI Li-he; WEN Dong-sheng

    2004-01-01

    Researches on organization and structure in complex systems are academic and industrial fronts in modern sciences. Though many theories are tentatively proposed to analyze complex systems, we still lack a rigorous theory on them. Complex systems possess various degrees of freedom, which means that they should exhibit all kinds of structures. However, complex systems often show similar patterns and structures. Then the question arises why such similar structures appear in all kinds of complex systems. The paper outlines a theory on freedom degree compression and the existence of hierarchical self-organization for all complex systems is found. It is freedom degree compression and hierarchical self-organization that are responsible for the existence of these similar patterns or structures observed in the complex systems.

  7. Bayesian hierarchical modeling of drug stability data.

    Science.gov (United States)

    Chen, Jie; Zhong, Jinglin; Nie, Lei

    2008-06-15

    Stability data are commonly analyzed using linear fixed or random effect model. The linear fixed effect model does not take into account the batch-to-batch variation, whereas the random effect model may suffer from the unreliable shelf-life estimates due to small sample size. Moreover, both methods do not utilize any prior information that might have been available. In this article, we propose a Bayesian hierarchical approach to modeling drug stability data. Under this hierarchical structure, we first use Bayes factor to test the poolability of batches. Given the decision on poolability of batches, we then estimate the shelf-life that applies to all batches. The approach is illustrated with two example data sets and its performance is compared in simulation studies with that of the commonly used frequentist methods. (c) 2008 John Wiley & Sons, Ltd.

  8. Hierarchical Boltzmann simulations and model error estimation

    Science.gov (United States)

    Torrilhon, Manuel; Sarna, Neeraj

    2017-08-01

    A hierarchical simulation approach for Boltzmann's equation should provide a single numerical framework in which a coarse representation can be used to compute gas flows as accurately and efficiently as in computational fluid dynamics, but a subsequent refinement allows to successively improve the result to the complete Boltzmann result. We use Hermite discretization, or moment equations, for the steady linearized Boltzmann equation for a proof-of-concept of such a framework. All representations of the hierarchy are rotationally invariant and the numerical method is formulated on fully unstructured triangular and quadrilateral meshes using a implicit discontinuous Galerkin formulation. We demonstrate the performance of the numerical method on model problems which in particular highlights the relevance of stability of boundary conditions on curved domains. The hierarchical nature of the method allows also to provide model error estimates by comparing subsequent representations. We present various model errors for a flow through a curved channel with obstacles.

  9. Hierarchical State Machines as Modular Horn Clauses

    Directory of Open Access Journals (Sweden)

    Pierre-Loïc Garoche

    2016-07-01

    Full Text Available In model based development, embedded systems are modeled using a mix of dataflow formalism, that capture the flow of computation, and hierarchical state machines, that capture the modal behavior of the system. For safety analysis, existing approaches rely on a compilation scheme that transform the original model (dataflow and state machines into a pure dataflow formalism. Such compilation often result in loss of important structural information that capture the modal behaviour of the system. In previous work we have developed a compilation technique from a dataflow formalism into modular Horn clauses. In this paper, we present a novel technique that faithfully compile hierarchical state machines into modular Horn clauses. Our compilation technique preserves the structural and modal behavior of the system, making the safety analysis of such models more tractable.

  10. Hierarchical community structure in complex (social) networks

    CERN Document Server

    Massaro, Emanuele

    2014-01-01

    The investigation of community structure in networks is a task of great importance in many disciplines, namely physics, sociology, biology and computer science where systems are often represented as graphs. One of the challenges is to find local communities from a local viewpoint in a graph without global information in order to reproduce the subjective hierarchical vision for each vertex. In this paper we present the improvement of an information dynamics algorithm in which the label propagation of nodes is based on the Markovian flow of information in the network under cognitive-inspired constraints \\cite{Massaro2012}. In this framework we have introduced two more complex heuristics that allow the algorithm to detect the multi-resolution hierarchical community structure of networks from a source vertex or communities adopting fixed values of model's parameters. Experimental results show that the proposed methods are efficient and well-behaved in both real-world and synthetic networks.

  11. Object tracking with hierarchical multiview learning

    Science.gov (United States)

    Yang, Jun; Zhang, Shunli; Zhang, Li

    2016-09-01

    Building a robust appearance model is useful to improve tracking performance. We propose a hierarchical multiview learning framework to construct the appearance model, which has two layers for tracking. On the top layer, two different views of features, grayscale value and histogram of oriented gradients, are adopted for representation under the cotraining framework. On the bottom layer, for each view of each feature, three different random subspaces are generated to represent the appearance from multiple views. For each random view submodel, the least squares support vector machine is employed to improve the discriminability for concrete and efficient realization. These two layers are combined to construct the final appearance model for tracking. The proposed hierarchical model assembles two types of multiview learning strategies, in which the appearance can be described more accurately and robustly. Experimental results in the benchmark dataset demonstrate that the proposed method can achieve better performance than many existing state-of-the-art algorithms.

  12. Assembling hierarchical cluster solids with atomic precision.

    Science.gov (United States)

    Turkiewicz, Ari; Paley, Daniel W; Besara, Tiglet; Elbaz, Giselle; Pinkard, Andrew; Siegrist, Theo; Roy, Xavier

    2014-11-12

    Hierarchical solids created from the binary assembly of cobalt chalcogenide and iron oxide molecular clusters are reported. Six different molecular clusters based on the octahedral Co6E8 (E = Se or Te) and the expanded cubane Fe8O4 units are used as superatomic building blocks to construct these crystals. The formation of the solid is driven by the transfer of charge between complementary electron-donating and electron-accepting clusters in solution that crystallize as binary ionic compounds. The hierarchical structures are investigated by single-crystal X-ray diffraction, providing atomic and superatomic resolution. We report two different superstructures: a superatomic relative of the CsCl lattice type and an unusual packing arrangement based on the double-hexagonal close-packed lattice. Within these superstructures, we demonstrate various compositions and orientations of the clusters.

  13. Hierarchical Robot Control In A Multisensor Environment

    Science.gov (United States)

    Bhanu, Bir; Thune, Nils; Lee, Jih Kun; Thune, Mari

    1987-03-01

    Automatic recognition, inspection, manipulation and assembly of objects will be a common denominator in most of tomorrow's highly automated factories. These tasks will be handled by intelligent computer controlled robots with multisensor capabilities which contribute to desired flexibility and adaptability. The control of a robot in such a multisensor environment becomes of crucial importance as the complexity of the problem grows exponentially with the number of sensors, tasks, commands and objects. In this paper we present an approach which uses CAD (Computer-Aided Design) based geometric and functional models of objects together with action oriented neuroschemas to recognize and manipulate objects by a robot in a multisensor environment. The hierarchical robot control system is being implemented on a BBN Butterfly multi processor. Index terms: CAD, Hierarchical Control, Hypothesis Generation and Verification, Parallel Processing, Schemas

  14. TRANSIMS and the hierarchical data format

    Energy Technology Data Exchange (ETDEWEB)

    Bush, B.W.

    1997-06-12

    The Hierarchical Data Format (HDF) is a general-purposed scientific data format developed at the National Center for Supercomputing Applications. It supports metadata, compression, and a variety of data structures (multidimensional arrays, raster images, tables). FORTRAN 77 and ANSI C programming interfaces are available for it and a wide variety of visualization tools read HDF files. The author discusses the features of this file format and its possible uses in TRANSIMS.

  15. Modular, Hierarchical Learning By Artificial Neural Networks

    Science.gov (United States)

    Baldi, Pierre F.; Toomarian, Nikzad

    1996-01-01

    Modular and hierarchical approach to supervised learning by artificial neural networks leads to neural networks more structured than neural networks in which all neurons fully interconnected. These networks utilize general feedforward flow of information and sparse recurrent connections to achieve dynamical effects. The modular organization, sparsity of modular units and connections, and fact that learning is much more circumscribed are all attractive features for designing neural-network hardware. Learning streamlined by imitating some aspects of biological neural networks.

  16. The Infinite Hierarchical Factor Regression Model

    CERN Document Server

    Rai, Piyush

    2009-01-01

    We propose a nonparametric Bayesian factor regression model that accounts for uncertainty in the number of factors, and the relationship between factors. To accomplish this, we propose a sparse variant of the Indian Buffet Process and couple this with a hierarchical model over factors, based on Kingman's coalescent. We apply this model to two problems (factor analysis and factor regression) in gene-expression data analysis.

  17. Superhydrophobicity of Hierarchical and ZNO Nanowire Coatings

    Science.gov (United States)

    2014-01-01

    KOH (3 wt%), distilled water and isopropyl alcohol (10% vol%) at 95 C for 50 min. Subsequently, a 10 nm ZnO seed layer wasThis journal is © The Royal...ZnO have been widely used in sensors, piezo-nanogenerators, and solar cells. The hierarchical structures of ZnO nanowires grown on Si pyramid surfaces...exhibiting superhydrophobicity in this work will have promising applications in the next generation photovoltaic devices and solar cells

  18. Hierarchical Parallel Evaluation of a Hamming Code

    Directory of Open Access Journals (Sweden)

    Shmuel T. Klein

    2017-04-01

    Full Text Available The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding logn parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in logn layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.

  19. Hierarchical mixture models for assessing fingerprint individuality

    OpenAIRE

    Dass, Sarat C.; Li, Mingfei

    2009-01-01

    The study of fingerprint individuality aims to determine to what extent a fingerprint uniquely identifies an individual. Recent court cases have highlighted the need for measures of fingerprint individuality when a person is identified based on fingerprint evidence. The main challenge in studies of fingerprint individuality is to adequately capture the variability of fingerprint features in a population. In this paper hierarchical mixture models are introduced to infer the extent of individua...

  20. Metal hierarchical patterning by direct nanoimprint lithography.

    Science.gov (United States)

    Radha, Boya; Lim, Su Hui; Saifullah, Mohammad S M; Kulkarni, Giridhar U

    2013-01-01

    Three-dimensional hierarchical patterning of metals is of paramount importance in diverse fields involving photonics, controlling surface wettability and wearable electronics. Conventionally, this type of structuring is tedious and usually involves layer-by-layer lithographic patterning. Here, we describe a simple process of direct nanoimprint lithography using palladium benzylthiolate, a versatile metal-organic ink, which not only leads to the formation of hierarchical patterns but also is amenable to layer-by-layer stacking of the metal over large areas. The key to achieving such multi-faceted patterning is hysteretic melting of ink, enabling its shaping. It undergoes transformation to metallic palladium under gentle thermal conditions without affecting the integrity of the hierarchical patterns on micro- as well as nanoscale. A metallic rice leaf structure showing anisotropic wetting behavior and woodpile-like structures were thus fabricated. Furthermore, this method is extendable for transferring imprinted structures to a flexible substrate to make them robust enough to sustain numerous bending cycles.

  1. Hierarchical unilamellar vesicles of controlled compositional heterogeneity.

    Directory of Open Access Journals (Sweden)

    Maik Hadorn

    Full Text Available Eukaryotic life contains hierarchical vesicular architectures (i.e. organelles that are crucial for material production and trafficking, information storage and access, as well as energy production. In order to perform specific tasks, these compartments differ among each other in their membrane composition and their internal cargo and also differ from the cell membrane and the cytosol. Man-made structures that reproduce this nested architecture not only offer a deeper understanding of the functionalities and evolution of organelle-bearing eukaryotic life but also allow the engineering of novel biomimetic technologies. Here, we show the newly developed vesicle-in-water-in-oil emulsion transfer preparation technique to result in giant unilamellar vesicles internally compartmentalized by unilamellar vesicles of different membrane composition and internal cargo, i.e. hierarchical unilamellar vesicles of controlled compositional heterogeneity. The compartmentalized giant unilamellar vesicles were subsequently isolated by a separation step exploiting the heterogeneity of the membrane composition and the encapsulated cargo. Due to the controlled, efficient, and technically straightforward character of the new preparation technique, this study allows the hierarchical fabrication of compartmentalized giant unilamellar vesicles of controlled compositional heterogeneity and will ease the development of eukaryotic cell mimics that resemble their natural templates as well as the fabrication of novel multi-agent drug delivery systems for combination therapies and complex artificial microreactors.

  2. A New Metrics for Hierarchical Clustering

    Institute of Scientific and Technical Information of China (English)

    YANGGuangwen; SHIShuming; WANGDingxing

    2003-01-01

    Hierarchical clustering is a popular method of performing unsupervised learning. Some metric must be used to determine the similarity between pairs of clusters in hierarchical clustering. Traditional similarity metrics either can deal with simple shapes (i.e. spherical shapes) only or are very sensitive to outliers (the chaining effect). The main contribution of this paper is to propose some potential-based similarity metrics (APES and AMAPES) between clusters in hierarchical clustering, inspired by the concepts of the electric potential and the gravitational potential in electromagnetics and astronomy. The main features of these metrics are: the first, they have strong antijamming capability; the second, they are capable of finding clusters of different shapes such as spherical, spiral, chain, circle, sigmoid, U shape or other complex irregular shapes; the third, existing algorithms and research fruits for classical metrics can be adopted to deal with these new potential-based metrics with no or little modification. Experiments showed that the new metrics are more superior to traditional ones. Different potential functions are compared, and the sensitivity to parameters is also analyzed in this paper.

  3. A secure solution on hierarchical access control

    CERN Document Server

    Wei, Chuan-Sheng; Huang, Tone-Yau; Ong, Yao Lin

    2011-01-01

    Hierarchical access control is an important and traditional problem in information security. In 2001, Wu et.al. proposed an elegant solution for hierarchical access control by the secure-filter. Jeng and Wang presented an improvement of Wu et. al.'s method by the ECC cryptosystem. However, secure-filter method is insecure in dynaminc access control. Lie, Hsu and Tripathy, Paul pointed out some secure leaks on the secure-filter and presented some improvements to eliminate these secure flaws. In this paper, we revise the secure-filter in Jeng-Wang method and propose another secure solutions in hierarchical access control problem. CA is a super security class (user) in our proposed method and the secure-filter of $u_i$ in our solutions is a polynomial of degree $n_i+1$ in $\\mathbb{Z}_p^*$, $f_i(x)=(x-h_i)(x-a_1)...(x-a_{n_i})+L_{l_i}(K_i)$. Although the degree of our secure-filter is larger than others solutions, our solution is secure and efficient in dynamics access control.

  4. SORM applied to hierarchical parallel system

    DEFF Research Database (Denmark)

    Ditlevsen, Ove Dalager

    2006-01-01

    The old hierarchical stochastic load combination model of Ferry Borges and Castanheta and the corresponding problem of determining the distribution of the extreme random load effect is the inspiration to this paper. The evaluation of the distribution function of the extreme value by use of a part......The old hierarchical stochastic load combination model of Ferry Borges and Castanheta and the corresponding problem of determining the distribution of the extreme random load effect is the inspiration to this paper. The evaluation of the distribution function of the extreme value by use...... of a particular first order reliability method (FORM) was first described in a celebrated paper by Rackwitz and Fiessler more than a quarter of a century ago. The method has become known as the Rackwitz-Fiessler algorithm. The original RF-algorithm as applied to a hierarchical random variable model...... is recapitulated so that a simple but quite effective accuracy improving calculation can be explained. A limit state curvature correction factor on the probability approximation is obtained from the final stop results of the RF-algorithm. This correction factor is based on Breitung’s asymptotic formula for second...

  5. Anisotropic and Hierarchical Porosity in Multifunctional Ceramics

    Science.gov (United States)

    Lichtner, Aaron Zev

    The performance of multifunctional porous ceramics is often hindered by the seemingly contradictory effects of porosity on both mechanical and non-structural properties and yet a sufficient body of knowledge linking microstructure to these properties does not exist. Using a combination of tailored anisotropic and hierarchical materials, these disparate effects may be reconciled. In this project, a systematic investigation of the processing, characterization and properties of anisotropic and isotropic hierarchically porous ceramics was conducted. The system chosen was a composite ceramic intended as the cathode for a solid oxide fuel cell (SOFC). Comprehensive processing investigations led to the development of approaches to make hierarchical, anisotropic porous microstructures using directional freeze-casting of well dispersed slurries. The effect of all the important processing parameters was investigated. This resulted in an ability to tailor and control the important microstructural features including the scale of the microstructure, the macropore size and total porosity. Comparable isotropic porous ceramics were also processed using fugitive pore formers. A suite of characterization techniques including x-ray tomography and 3-D sectional scanning electron micrographs (FIB-SEM) was used to characterize and quantify the green and partially sintered microstructures. The effect of sintering temperature on the microstructure was quantified and discrete element simulations (DEM) were used to explain the experimental observations. Finally, the comprehensive mechanical properties, at room temperature, were investigated, experimentally and using DEM, for the different microstructures.

  6. Resilient 3D hierarchical architected metamaterials.

    Science.gov (United States)

    Meza, Lucas R; Zelhofer, Alex J; Clarke, Nigel; Mateos, Arturo J; Kochmann, Dennis M; Greer, Julia R

    2015-09-15

    Hierarchically designed structures with architectural features that span across multiple length scales are found in numerous hard biomaterials, like bone, wood, and glass sponge skeletons, as well as manmade structures, like the Eiffel Tower. It has been hypothesized that their mechanical robustness and damage tolerance stem from sophisticated ordering within the constituents, but the specific role of hierarchy remains to be fully described and understood. We apply the principles of hierarchical design to create structural metamaterials from three material systems: (i) polymer, (ii) hollow ceramic, and (iii) ceramic-polymer composites that are patterned into self-similar unit cells in a fractal-like geometry. In situ nanomechanical experiments revealed (i) a nearly theoretical scaling of structural strength and stiffness with relative density, which outperforms existing nonhierarchical nanolattices; (ii) recoverability, with hollow alumina samples recovering up to 98% of their original height after compression to ≥ 50% strain; (iii) suppression of brittle failure and structural instabilities in hollow ceramic hierarchical nanolattices; and (iv) a range of deformation mechanisms that can be tuned by changing the slenderness ratios of the beams. Additional levels of hierarchy beyond a second order did not increase the strength or stiffness, which suggests the existence of an optimal degree of hierarchy to amplify resilience. We developed a computational model that captures local stress distributions within the nanolattices under compression and explains some of the underlying deformation mechanisms as well as validates the measured effective stiffness to be interpreted as a metamaterial property.

  7. The Hourglass Effect in Hierarchical Dependency Networks

    CERN Document Server

    Sabrin, Kaeser M

    2016-01-01

    Many hierarchically modular systems are structured in a way that resembles a bow-tie or hourglass. This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system (the waist of the hourglass). We investigate the hourglass effect in general (not necessarily layered) hierarchical dependency networks. Our analysis focuses on the number of source-to-target dependency paths that traverse each vertex, and it identifies the core of a dependency network as the smallest set of vertices that collectively cover almost all dependency paths. We then examine if a given network exhibits the hourglass property or not, comparing its core size with a "flat" (i.e., non-hierarchical) network that preserves the source dependencies of each target in the original network. As a possible explanation for the hourglass effect, we propose the Reuse Preference (RP) model that captures the bias of new mo...

  8. Semantic Image Segmentation with Contextual Hierarchical Models.

    Science.gov (United States)

    Seyedhosseini, Mojtaba; Tasdizen, Tolga

    2016-05-01

    Semantic segmentation is the problem of assigning an object label to each pixel. It unifies the image segmentation and object recognition problems. The importance of using contextual information in semantic segmentation frameworks has been widely realized in the field. We propose a contextual framework, called contextual hierarchical model (CHM), which learns contextual information in a hierarchical framework for semantic segmentation. At each level of the hierarchy, a classifier is trained based on downsampled input images and outputs of previous levels. Our model then incorporates the resulting multi-resolution contextual information into a classifier to segment the input image at original resolution. This training strategy allows for optimization of a joint posterior probability at multiple resolutions through the hierarchy. Contextual hierarchical model is purely based on the input image patches and does not make use of any fragments or shape examples. Hence, it is applicable to a variety of problems such as object segmentation and edge detection. We demonstrate that CHM performs at par with state-of-the-art on Stanford background and Weizmann horse datasets. It also outperforms state-of-the-art edge detection methods on NYU depth dataset and achieves state-of-the-art on Berkeley segmentation dataset (BSDS 500).

  9. A Comparison of Hierarchical and Non-Hierarchical Bayesian Approaches for Fitting Allometric Larch (Larix.spp. Biomass Equations

    Directory of Open Access Journals (Sweden)

    Dongsheng Chen

    2016-01-01

    Full Text Available Accurate biomass estimations are important for assessing and monitoring forest carbon storage. Bayesian theory has been widely applied to tree biomass models. Recently, a hierarchical Bayesian approach has received increasing attention for improving biomass models. In this study, tree biomass data were obtained by sampling 310 trees from 209 permanent sample plots from larch plantations in six regions across China. Non-hierarchical and hierarchical Bayesian approaches were used to model allometric biomass equations. We found that the total, root, stem wood, stem bark, branch and foliage biomass model relationships were statistically significant (p-values < 0.001 for both the non-hierarchical and hierarchical Bayesian approaches, but the hierarchical Bayesian approach increased the goodness-of-fit statistics over the non-hierarchical Bayesian approach. The R2 values of the hierarchical approach were higher than those of the non-hierarchical approach by 0.008, 0.018, 0.020, 0.003, 0.088 and 0.116 for the total tree, root, stem wood, stem bark, branch and foliage models, respectively. The hierarchical Bayesian approach significantly improved the accuracy of the biomass model (except for the stem bark and can reflect regional differences by using random parameters to improve the regional scale model accuracy.

  10. Hierarchical Parallelization of Gene Differential Association Analysis

    Directory of Open Access Journals (Sweden)

    Dwarkadas Sandhya

    2011-09-01

    Full Text Available Abstract Background Microarray gene differential expression analysis is a widely used technique that deals with high dimensional data and is computationally intensive for permutation-based procedures. Microarray gene differential association analysis is even more computationally demanding and must take advantage of multicore computing technology, which is the driving force behind increasing compute power in recent years. In this paper, we present a two-layer hierarchical parallel implementation of gene differential association analysis. It takes advantage of both fine- and coarse-grain (with granularity defined by the frequency of communication parallelism in order to effectively leverage the non-uniform nature of parallel processing available in the cutting-edge systems of today. Results Our results show that this hierarchical strategy matches data sharing behavior to the properties of the underlying hardware, thereby reducing the memory and bandwidth needs of the application. The resulting improved efficiency reduces computation time and allows the gene differential association analysis code to scale its execution with the number of processors. The code and biological data used in this study are downloadable from http://www.urmc.rochester.edu/biostat/people/faculty/hu.cfm. Conclusions The performance sweet spot occurs when using a number of threads per MPI process that allows the working sets of the corresponding MPI processes running on the multicore to fit within the machine cache. Hence, we suggest that practitioners follow this principle in selecting the appropriate number of MPI processes and threads within each MPI process for their cluster configurations. We believe that the principles of this hierarchical approach to parallelization can be utilized in the parallelization of other computationally demanding kernels.

  11. Three Layer Hierarchical Model for Chord

    Directory of Open Access Journals (Sweden)

    Waqas A. Imtiaz

    2012-12-01

    Full Text Available Increasing popularity of decentralized Peer-to-Peer (P2P architecture emphasizes on the need to come across an overlay structure that can provide efficient content discovery mechanism, accommodate high churn rate and adapt to failures in the presence of heterogeneity among the peers. Traditional p2p systems incorporate distributed client-server communication, which finds the peer efficiently that store a desires data item, with minimum delay and reduced overhead. However traditional models are not able to solve the problems relating scalability and high churn rates. Hierarchical model were introduced to provide better fault isolation, effective bandwidth utilization, a superior adaptation to the underlying physical network and a reduction of the lookup path length as additional advantages. It is more efficient and easier to manage than traditional p2p networks. This paper discusses a further step in p2p hierarchy via 3-layers hierarchical model with distributed database architecture in different layer, each of which is connected through its root. The peers are divided into three categories according to their physical stability and strength. They are Ultra Super-peer, Super-peer and Ordinary Peer and we assign these peers to first, second and third level of hierarchy respectively. Peers in a group in lower layer have their own local database which hold as associated super-peer in middle layer and access the database among the peers through user queries. In our 3-layer hierarchical model for DHT algorithms, we used an advanced Chord algorithm with optimized finger table which can remove the redundant entry in the finger table in upper layer that influences the system to reduce the lookup latency. Our research work finally resulted that our model really provides faster search since the network lookup latency is decreased by reducing the number of hops. The peers in such network then can contribute with improve functionality and can perform well in

  12. Hierarchical bismuth phosphate microspheres with high photocatalytic performance

    Energy Technology Data Exchange (ETDEWEB)

    Pei, Lizhai; Wei, Tian; Lin, Nan; Yu, Haiyun [Anhui University of Technology, Ma' anshan (China). Key Laboratory of Materials Science and Processing of Anhui Province

    2016-05-15

    Hierarchical bismuth phosphate microspheres have been prepared by a simple hydrothermal process with polyvinyl pyrrolidone. Scanning electron microscopy observations show that the hierarchical bismuth phosphate microspheres consist of nanosheets with a thickness of about 30 nm. The diameter of the microspheres is about 1 - 3 μm. X-ray diffraction analysis shows that the microspheres are comprised of triclinic Bi{sub 23}P{sub 4}O{sub 44.5} phase. The formation of the hierarchical microspheres depends on polyvinyl pyrrolidone concentration, hydrothermal temperature and reaction time. Gentian violet acts as the pollutant model for investigating the photocatalytic activity of the hierarchical bismuth phosphate microspheres under ultraviolet-visible light irradiation. Irradiation time, dosage of the hierarchical microspheres and initial gentian violet concentration on the photocatalytic efficiency are also discussed. The hierarchical bismuth phosphate microspheres show good photocatalytic performance for gentian violet removal in aqueous solution.

  13. Electronic Properties in a Hierarchical Multilayer Structure

    Institute of Scientific and Technical Information of China (English)

    ZHU Chen-Ping; XIONG Shi-Jie

    2001-01-01

    We investigate electronic properties of a hierarchical multilayer structure consisting of stacking of barriers and wells. The structure is formed in a sequence of generations, each of which is constructed with the same pattern but with the previous generation as the basic building blocks. We calculate the transmission spectrum which shows the multifractal behavior for systems with large generation index. From the analysis of the average resistivity and the multifractal structure of the wavefunctions, we show that there exist different types of states exhibiting extended, localized and intermediate characteristics. The degree of localization is sensitive to the variation of the structural parameters.Suggestion of the possible experimental realization is discussed.

  14. Mechanics of hierarchical 3-D nanofoams

    Science.gov (United States)

    Chen, Q.; Pugno, N. M.

    2012-01-01

    In this paper, we study the mechanics of new three-dimensional hierarchical open-cell foams, and, in particular, its Young's modulus and plastic strength. We incorporate the effects of the surface elasticity and surface residual stress in the linear elastic and plastic analyses. The results show that, as the cross-sectional dimension decreases, the influences of the surface effect on Young's modulus and plastic strength increase, and the surface effect makes the solid stiffer and stronger; similarly, as level n increases, these quantities approach to those of the classical theory as lower bounds.

  15. Hierarchical Control for Multiple DC Microgrids Clusters

    DEFF Research Database (Denmark)

    Shafiee, Qobad; Dragicevic, Tomislav; Vasquez, Juan Carlos;

    2014-01-01

    This paper presents a distributed hierarchical control framework to ensure reliable operation of dc Microgrid (MG) clusters. In this hierarchy, primary control is used to regulate the common bus voltage inside each MG locally. An adaptive droop method is proposed for this level which determines....... Another distributed policy is employed then to regulate the power flow among the MGs according to their local SOCs. The proposed distributed controllers on each MG communicate with only the neighbor MGs through a communication infrastructure. Finally, the small signal model is expanded for dc MG clusters...

  16. A Hierarchical Framework for Facial Age Estimation

    Directory of Open Access Journals (Sweden)

    Yuyu Liang

    2014-01-01

    Full Text Available Age estimation is a complex issue of multiclassification or regression. To address the problems of uneven distribution of age database and ignorance of ordinal information, this paper shows a hierarchic age estimation system, comprising age group and specific age estimation. In our system, two novel classifiers, sequence k-nearest neighbor (SKNN and ranking-KNN, are introduced to predict age group and value, respectively. Notably, ranking-KNN utilizes the ordinal information between samples in estimation process rather than regards samples as separate individuals. Tested on FG-NET database, our system achieves 4.97 evaluated by MAE (mean absolute error for age estimation.

  17. Effective Hierarchical Information Management in Mobile Environment

    Directory of Open Access Journals (Sweden)

    Hanmin Jung

    2012-01-01

    Full Text Available Problem statement: As the performance of mobile devices is developed highly, several kinds of data is stored on mobile devices. For effective data management and information retrieval, some researches applying ontology concept to mobile devices are progressed. However, in conventional researches, they apply conventional ontology storage structure used in PC environment to mobile platform. Conclusion/Recommendations: Therefore, performance of search about data is low and not effective. Therefore, we suggested new ontology storage schema with ontology path for effective hierarchical information in mobile environment.

  18. A hierarchical classification scheme of psoriasis images

    DEFF Research Database (Denmark)

    Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær

    2003-01-01

    the normal skin in the second stage. These tools are the Expectation-Maximization Algorithm, the quadratic discrimination function and a classification window of optimal size. Extrapolation of classification parameters of a given image to other images of the set is evaluated by means of Cohen's Kappa......A two-stage hierarchical classification scheme of psoriasis lesion images is proposed. These images are basically composed of three classes: normal skin, lesion and background. The scheme combines conventional tools to separate the skin from the background in the first stage, and the lesion from...

  19. Renormalization of Hierarchically Interacting Isotropic Diffusions

    Science.gov (United States)

    den Hollander, F.; Swart, J. M.

    1998-10-01

    We study a renormalization transformation arising in an infinite system of interacting diffusions. The components of the system are labeled by the N-dimensional hierarchical lattice ( N≥2) and take values in the closure of a compact convex set bar D subset {R}^d (d ≥slant 1). Each component starts at some θ ∈ D and is subject to two motions: (1) an isotropic diffusion according to a local diffusion rate g: bar D to [0,infty ] chosen from an appropriate class; (2) a linear drift toward an average of the surrounding components weighted according to their hierarchical distance. In the local mean-field limit N→∞, block averages of diffusions within a hierarchical distance k, on an appropriate time scale, are expected to perform a diffusion with local diffusion rate F ( k) g, where F^{(k)} g = (F_{c_k } circ ... circ F_{c_1 } ) g is the kth iterate of renormalization transformations F c ( c>0) applied to g. Here the c k measure the strength of the interaction at hierarchical distance k. We identify F c and study its orbit ( F ( k) g) k≥0. We show that there exists a "fixed shape" g* such that lim k→∞ σk F ( k) g = g* for all g, where the σ k are normalizing constants. In terms of the infinite system, this property means that there is complete universal behavior on large space-time scales. Our results extend earlier work for d = 1 and bar D = [0,1], resp. [0, ∞). The renormalization transformation F c is defined in terms of the ergodic measure of a d-dimensional diffusion. In d = 1 this diffusion allows a Yamada-Watanabe-type coupling, its ergodic measure is reversible, and the renormalization transformation F c is given by an explicit formula. All this breaks down in d≥2, which complicates the analysis considerably and forces us to new methods. Part of our results depend on a certain martingale problem being well-posed.

  20. Hierarchical silica particles by dynamic multicomponent assembly

    DEFF Research Database (Denmark)

    Wu, Z. W.; Hu, Q. Y.; Pang, J. B.

    2005-01-01

    Abstract: Aerosol-assisted assembly of mesoporous silica particles with hierarchically controllable pore structure has been prepared using cetyltrimethylammonium bromide (CTAB) and poly(propylene oxide) (PPO, H[OCH(CH3)CH2],OH) as co-templates. Addition of the hydrophobic PPO significantly influe......-silicate assembling system was discussed. The mesostructure of these particles was characterized by transmission electron microscope (TEM), scanning electron microscope (SEM), X-ray diffraction (XRD), and N-2 sorption. (c) 2005 Elsevier Inc. All rights reserved....

  1. Constructing storyboards based on hierarchical clustering analysis

    Science.gov (United States)

    Hasebe, Satoshi; Sami, Mustafa M.; Muramatsu, Shogo; Kikuchi, Hisakazu

    2005-07-01

    There are growing needs for quick preview of video contents for the purpose of improving accessibility of video archives as well as reducing network traffics. In this paper, a storyboard that contains a user-specified number of keyframes is produced from a given video sequence. It is based on hierarchical cluster analysis of feature vectors that are derived from wavelet coefficients of video frames. Consistent use of extracted feature vectors is the key to avoid a repetition of computationally-intensive parsing of the same video sequence. Experimental results suggest that a significant reduction in computational time is gained by this strategy.

  2. Technique for fast and efficient hierarchical clustering

    Science.gov (United States)

    Stork, Christopher

    2013-10-08

    A fast and efficient technique for hierarchical clustering of samples in a dataset includes compressing the dataset to reduce a number of variables within each of the samples of the dataset. A nearest neighbor matrix is generated to identify nearest neighbor pairs between the samples based on differences between the variables of the samples. The samples are arranged into a hierarchy that groups the samples based on the nearest neighbor matrix. The hierarchy is rendered to a display to graphically illustrate similarities or differences between the samples.

  3. Robust Pseudo-Hierarchical Support Vector Clustering

    DEFF Research Database (Denmark)

    Hansen, Michael Sass; Sjöstrand, Karl; Olafsdóttir, Hildur

    2007-01-01

    Support vector clustering (SVC) has proven an efficient algorithm for clustering of noisy and high-dimensional data sets, with applications within many fields of research. An inherent problem, however, has been setting the parameters of the SVC algorithm. Using the recent emergence of a method...... for calculating the entire regularization path of the support vector domain description, we propose a fast method for robust pseudo-hierarchical support vector clustering (HSVC). The method is demonstrated to work well on generated data, as well as for detecting ischemic segments from multidimensional myocardial...

  4. Additive Manufacturing of Hierarchical Porous Structures

    Energy Technology Data Exchange (ETDEWEB)

    Grote, Christopher John [Los Alamos National Lab. (LANL), Los Alamos, NM (United States). Materials Science and Technology Division. Polymers and Coatings

    2016-08-30

    Additive manufacturing has become a tool of choice for the development of customizable components. Developments in this technology have led to a powerful array of printers that t serve a variety of needs. However, resin development plays a crucial role in leading the technology forward. This paper addresses the development and application of printing hierarchical porous structures. Beginning with the development of a porous scaffold, which can be functionalized with a variety of materials, and concluding with customized resins for metal, ceramic, and carbon structures.

  5. An introduction to hierarchical linear modeling

    Directory of Open Access Journals (Sweden)

    Heather Woltman

    2012-02-01

    Full Text Available This tutorial aims to introduce Hierarchical Linear Modeling (HLM. A simple explanation of HLM is provided that describes when to use this statistical technique and identifies key factors to consider before conducting this analysis. The first section of the tutorial defines HLM, clarifies its purpose, and states its advantages. The second section explains the mathematical theory, equations, and conditions underlying HLM. HLM hypothesis testing is performed in the third section. Finally, the fourth section provides a practical example of running HLM, with which readers can follow along. Throughout this tutorial, emphasis is placed on providing a straightforward overview of the basic principles of HLM.

  6. Magnetic susceptibilities of cluster-hierarchical models

    Science.gov (United States)

    McKay, Susan R.; Berker, A. Nihat

    1984-02-01

    The exact magnetic susceptibilities of hierarchical models are calculated near and away from criticality, in both the ordered and disordered phases. The mechanism and phenomenology are discussed for models with susceptibilities that are physically sensible, e.g., nondivergent away from criticality. Such models are found based upon the Niemeijer-van Leeuwen cluster renormalization. A recursion-matrix method is presented for the renormalization-group evaluation of response functions. Diagonalization of this matrix at fixed points provides simple criteria for well-behaved densities and response functions.

  7. Universality: Accurate Checks in Dyson's Hierarchical Model

    Science.gov (United States)

    Godina, J. J.; Meurice, Y.; Oktay, M. B.

    2003-06-01

    In this talk we present high-accuracy calculations of the susceptibility near βc for Dyson's hierarchical model in D = 3. Using linear fitting, we estimate the leading (γ) and subleading (Δ) exponents. Independent estimates are obtained by calculating the first two eigenvalues of the linearized renormalization group transformation. We found γ = 1.29914073 ± 10 -8 and, Δ = 0.4259469 ± 10-7 independently of the choice of local integration measure (Ising or Landau-Ginzburg). After a suitable rescaling, the approximate fixed points for a large class of local measure coincide accurately with a fixed point constructed by Koch and Wittwer.

  8. Hierarchical Classification of Chinese Documents Based on N-grams

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    We explore the techniques of utilizing N-gram informatio n tocategorize Chinese text documents hierarchically so that the classifier can shak e off the burden of large dictionaries and complex segmentation processing, and subsequently be domain and time independent. A hierarchical Chinese text classif ier is implemented. Experimental results show that hierarchically classifying Chinese text documents based N-grams can achieve satisfactory performance and outperforms the other traditional Chinese text classifiers.

  9. Fractal image perception provides novel insights into hierarchical cognition.

    Science.gov (United States)

    Martins, M J; Fischmeister, F P; Puig-Waldmüller, E; Oh, J; Geissler, A; Robinson, S; Fitch, W T; Beisteiner, R

    2014-08-01

    Hierarchical structures play a central role in many aspects of human cognition, prominently including both language and music. In this study we addressed hierarchy in the visual domain, using a novel paradigm based on fractal images. Fractals are self-similar patterns generated by repeating the same simple rule at multiple hierarchical levels. Our hypothesis was that the brain uses different resources for processing hierarchies depending on whether it applies a "fractal" or a "non-fractal" cognitive strategy. We analyzed the neural circuits activated by these complex hierarchical patterns in an event-related fMRI study of 40 healthy subjects. Brain activation was compared across three different tasks: a similarity task, and two hierarchical tasks in which subjects were asked to recognize the repetition of a rule operating transformations either within an existing hierarchical level, or generating new hierarchical levels. Similar hierarchical images were generated by both rules and target images were identical. We found that when processing visual hierarchies, engagement in both hierarchical tasks activated the visual dorsal stream (occipito-parietal cortex, intraparietal sulcus and dorsolateral prefrontal cortex). In addition, the level-generating task specifically activated circuits related to the integration of spatial and categorical information, and with the integration of items in contexts (posterior cingulate cortex, retrosplenial cortex, and medial, ventral and anterior regions of temporal cortex). These findings provide interesting new clues about the cognitive mechanisms involved in the generation of new hierarchical levels as required for fractals.

  10. Geometrical phase transitions on hierarchical lattices and universality

    Science.gov (United States)

    Hauser, P. R.; Saxena, V. K.

    1986-12-01

    In order to examine the validity of the principle of universality for phase transitions on hierarchical lattices, we have studied percolation on a variety of hierarchical lattices, within exact position-space renormalization-group schemes. It is observed that the percolation critical exponent νp strongly depends on the topology of the lattices, even for lattices with the same intrinsic dimensions and connectivities. These results support some recent similar results on thermal phase transitions on hierarchical lattices and point out the possible violation of universality in phase transitions on hierarchical lattices.

  11. Hierarchical prisoner’s dilemma in hierarchical game for resource competition

    Science.gov (United States)

    Fujimoto, Yuma; Sagawa, Takahiro; Kaneko, Kunihiko

    2017-07-01

    Dilemmas in cooperation are one of the major concerns in game theory. In a public goods game, each individual cooperates by paying a cost or defecting without paying it, and receives a reward from the group out of the collected cost. Thus, defecting is beneficial for each individual, while cooperation is beneficial for the group. Now, groups (say, countries) consisting of individuals also play games. To study such a multi-level game, we introduce a hierarchical game in which multiple groups compete for limited resources by utilizing the collected cost in each group, where the power to appropriate resources increases with the population of the group. Analyzing this hierarchical game, we found a hierarchical prisoner’s dilemma, in which groups choose the defecting policy (say, armament) as a Nash strategy to optimize each group’s benefit, while cooperation optimizes the total benefit. On the other hand, for each individual, refusing to pay the cost (say, tax) is a Nash strategy, which turns out to be a cooperation policy for the group, thus leading to a hierarchical dilemma. Here the group reward increases with the group size. However, we find that there exists an optimal group size that maximizes the individual payoff. Furthermore, when the population asymmetry between two groups is large, the smaller group will choose a cooperation policy (say, disarmament) to avoid excessive response from the larger group, and the prisoner’s dilemma between the groups is resolved. Accordingly, the relevance of this hierarchical game on policy selection in society and the optimal size of human or animal groups are discussed.

  12. Hierarchical Star Formation in Nearby LEGUS Galaxies

    CERN Document Server

    Elmegreen, Debra Meloy; Adamo, Angela; Aloisi, Alessandra; Andrews, Jennifer; Annibali, Francesca; Bright, Stacey N; Calzetti, Daniela; Cignoni, Michele; Evans, Aaron S; Gallagher, John S; Gouliermis, Dimitrios A; Grebel, Eva K; Hunter, Deidre A; Johnson, Kelsey; Kim, Hwi; Lee, Janice; Sabbi, Elena; Smith, Linda; Thilker, David; Tosi, Monica; Ubeda, Leonardo

    2014-01-01

    Hierarchical structure in ultraviolet images of 12 late-type LEGUS galaxies is studied by determining the numbers and fluxes of nested regions as a function of size from ~1 to ~200 pc, and the number as a function of flux. Two starburst dwarfs, NGC 1705 and NGC 5253, have steeper number-size and flux-size distributions than the others, indicating high fractions of the projected areas filled with star formation. Nine subregions in 7 galaxies have similarly steep number-size slopes, even when the whole galaxies have shallower slopes. The results suggest that hierarchically structured star-forming regions several hundred parsecs or larger represent common unit structures. Small galaxies dominated by only a few of these units tend to be starbursts. The self-similarity of young stellar structures down to parsec scales suggests that star clusters form in the densest parts of a turbulent medium that also forms loose stellar groupings on larger scales. The presence of super star clusters in two of our starburst dwarf...

  13. PERFORMANCE OF SELECTED AGGLOMERATIVE HIERARCHICAL CLUSTERING METHODS

    Directory of Open Access Journals (Sweden)

    Nusa Erman

    2015-01-01

    Full Text Available A broad variety of different methods of agglomerative hierarchical clustering brings along problems how to choose the most appropriate method for the given data. It is well known that some methods outperform others if the analysed data have a specific structure. In the presented study we have observed the behaviour of the centroid, the median (Gower median method, and the average method (unweighted pair-group method with arithmetic mean – UPGMA; average linkage between groups. We have compared them with mostly used methods of hierarchical clustering: the minimum (single linkage clustering, the maximum (complete linkage clustering, the Ward, and the McQuitty (groups method average, weighted pair-group method using arithmetic averages - WPGMA methods. We have applied the comparison of these methods on spherical, ellipsoid, umbrella-like, “core-and-sphere”, ring-like and intertwined three-dimensional data structures. To generate the data and execute the analysis, we have used R statistical software. Results show that all seven methods are successful in finding compact, ball-shaped or ellipsoid structures when they are enough separated. Conversely, all methods except the minimum perform poor on non-homogenous, irregular and elongated ones. Especially challenging is a circular double helix structure; it is being correctly revealed only by the minimum method. We can also confirm formerly published results of other simulation studies, which usually favour average method (besides Ward method in cases when data is assumed to be fairly compact and well separated.

  14. Quark flavor mixings from hierarchical mass matrices

    Energy Technology Data Exchange (ETDEWEB)

    Verma, Rohit [Chinese Academy of Sciences, Institute of High Energy Physics, Beijing (China); Rayat Institute of Engineering and Information Technology, Ropar (India); Zhou, Shun [Chinese Academy of Sciences, Institute of High Energy Physics, Beijing (China); Peking University, Center for High Energy Physics, Beijing (China)

    2016-05-15

    In this paper, we extend the Fritzsch ansatz of quark mass matrices while retaining their hierarchical structures and show that the main features of the Cabibbo-Kobayashi-Maskawa (CKM) matrix V, including vertical stroke V{sub us} vertical stroke ≅ vertical stroke V{sub cd} vertical stroke, vertical stroke V{sub cb} vertical stroke ≅ vertical stroke V{sub ts} vertical stroke and vertical stroke V{sub ub} vertical stroke / vertical stroke V{sub cb} vertical stroke < vertical stroke V{sub td} vertical stroke / vertical stroke V{sub ts} vertical stroke can be well understood. This agreement is observed especially when the mass matrices have non-vanishing (1, 3) and (3, 1) off-diagonal elements. The phenomenological consequences of these for the allowed texture content and gross structural features of 'hierarchical' quark mass matrices are addressed from a model-independent prospective under the assumption of factorizable phases in these. The approximate and analytical expressions of the CKM matrix elements are derived and a detailed analysis reveals that such structures are in good agreement with the observed quark flavor mixing angles and the CP-violating phase at the 1σ level and call upon a further investigation of the realization of these structures from a top-down prospective. (orig.)

  15. Bimodal Color Distribution in Hierarchical Galaxy Formation

    CERN Document Server

    Menci, N; Giallongo, E; Salimbeni, S

    2005-01-01

    We show how the observed bimodality in the color distribution of galaxies can be explained in the framework of the hierarchical clustering picture in terms of the interplay between the properties of the merging histories and the feedback/star-formation processes in the progenitors of local galaxies. Using a semi-analytic model of hierarchical galaxy formation, we compute the color distributions of galaxies with different luminosities and compare them with the observations. Our fiducial model matches the fundamental properties of the observed distributions, namely: 1) the distribution of objects brighter than M_r = -18 is clearly bimodal, with a fraction of red objects increasing with luminosity; 2) for objects brighter than M_r = -21 the color distribution is dominated by red objects with color u-r = 2.2-2.4; 3) the spread on the distribution of the red population is smaller than that of the blue population; 4) the fraction of red galaxies is larger in denser environments, even for low-luminosity objects; 5) ...

  16. A Hierarchical Bayesian Model for Crowd Emotions

    Science.gov (United States)

    Urizar, Oscar J.; Baig, Mirza S.; Barakova, Emilia I.; Regazzoni, Carlo S.; Marcenaro, Lucio; Rauterberg, Matthias

    2016-01-01

    Estimation of emotions is an essential aspect in developing intelligent systems intended for crowded environments. However, emotion estimation in crowds remains a challenging problem due to the complexity in which human emotions are manifested and the capability of a system to perceive them in such conditions. This paper proposes a hierarchical Bayesian model to learn in unsupervised manner the behavior of individuals and of the crowd as a single entity, and explore the relation between behavior and emotions to infer emotional states. Information about the motion patterns of individuals are described using a self-organizing map, and a hierarchical Bayesian network builds probabilistic models to identify behaviors and infer the emotional state of individuals and the crowd. This model is trained and tested using data produced from simulated scenarios that resemble real-life environments. The conducted experiments tested the efficiency of our method to learn, detect and associate behaviors with emotional states yielding accuracy levels of 74% for individuals and 81% for the crowd, similar in performance with existing methods for pedestrian behavior detection but with novel concepts regarding the analysis of crowds. PMID:27458366

  17. Hierarchical majorana neutrinos from democratic mass matrices

    Science.gov (United States)

    Yang, Masaki J. S.

    2016-09-01

    In this paper, we obtain the light neutrino masses and mixings consistent with the experiments, in the democratic texture approach. The essential ansatz is that νRi are assumed to transform as "right-handed fields" 2R +1R under the S3L ×S3R symmetry. The symmetry breaking terms are assumed to be diagonal and hierarchical. This setup only allows the normal hierarchy of the neutrino mass, and excludes both of inverted hierarchical and degenerated neutrinos. Although the neutrino sector has nine free parameters, several predictions are obtained at the leading order. When we neglect the smallest parameters ζν and ζR, all components of the mixing matrix UPMNS are expressed by the masses of light neutrinos and charged leptons. From the consistency between predicted and observed UPMNS, we obtain the lightest neutrino masses m1 = (1.1 → 1.4) meV, and the effective mass for the double beta decay ≃ 4.5 meV.

  18. Efficient scalable algorithms for hierarchically semiseparable matrices

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Shen; Xia, Jianlin; Situ, Yingchong; Hoop, Maarten V. de

    2011-09-14

    Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.

  19. A Hierarchical Bayes Ensemble Kalman Filter

    Science.gov (United States)

    Tsyrulnikov, Michael; Rakitko, Alexander

    2017-01-01

    A new ensemble filter that allows for the uncertainty in the prior distribution is proposed and tested. The filter relies on the conditional Gaussian distribution of the state given the model-error and predictability-error covariance matrices. The latter are treated as random matrices and updated in a hierarchical Bayes scheme along with the state. The (hyper)prior distribution of the covariance matrices is assumed to be inverse Wishart. The new Hierarchical Bayes Ensemble Filter (HBEF) assimilates ensemble members as generalized observations and allows ordinary observations to influence the covariances. The actual probability distribution of the ensemble members is allowed to be different from the true one. An approximation that leads to a practicable analysis algorithm is proposed. The new filter is studied in numerical experiments with a doubly stochastic one-variable model of "truth". The model permits the assessment of the variance of the truth and the true filtering error variance at each time instance. The HBEF is shown to outperform the EnKF and the HEnKF by Myrseth and Omre (2010) in a wide range of filtering regimes in terms of performance of its primary and secondary filters.

  20. A hierarchical model of temporal perception.

    Science.gov (United States)

    Pöppel, E

    1997-05-01

    Temporal perception comprises subjective phenomena such as simultaneity, successiveness, temporal order, subjective present, temporal continuity and subjective duration. These elementary temporal experiences are hierarchically related to each other. Functional system states with a duration of 30 ms are implemented by neuronal oscillations and they provide a mechanism to define successiveness. These system states are also responsible for the identification of basic events. For a sequential representation of several events time tags are allocated, resulting in an ordinal representation of such events. A mechanism of temporal integration binds successive events into perceptual units of 3 s duration. Such temporal integration, which is automatic and presemantic, is also operative in movement control and other cognitive activities. Because of the omnipresence of this integration mechanism it is used for a pragmatic definition of the subjective present. Temporal continuity is the result of a semantic connection between successive integration intervals. Subjective duration is known to depend on mental load and attentional demand, high load resulting in long time estimates. In the hierarchical model proposed, system states of 30 ms and integration intervals of 3 s, together with a memory store, provide an explanatory neuro-cognitive machinery for differential subjective duration.

  1. Hierarchical video summarization for medical data

    Science.gov (United States)

    Zhu, Xingquan; Fan, Jianping; Elmagarmid, Ahmed K.; Aref, Walid G.

    2001-12-01

    To provide users with an overview of medical video content at various levels of abstraction which can be used for more efficient database browsing and access, a hierarchical video summarization strategy has been developed and is presented in this paper. To generate an overview, the key frames of a video are preprocessed to extract special frames (black frames, slides, clip art, sketch drawings) and special regions (faces, skin or blood-red areas). A shot grouping method is then applied to merge the spatially or temporally related shots into groups. The visual features and knowledge from the video shots are integrated to assign the groups into predefined semantic categories. Based on the video groups and their semantic categories, video summaries for different levels are constructed by group merging, hierarchical group clustering and semantic category selection. Based on this strategy, a user can select the layer of the summary to access. The higher the layer, the more concise the video summary; the lower the layer, the greater the detail contained in the summary.

  2. Hierarchical Cluster Assembly in Globally Collapsing Clouds

    CERN Document Server

    Vazquez-Semadeni, Enrique; Colin, Pedro

    2016-01-01

    We discuss the mechanism of cluster formation in a numerical simulation of a molecular cloud (MC) undergoing global hierarchical collapse (GHC). The global nature of the collapse implies that the SFR increases over time. The hierarchical nature of the collapse consists of small-scale collapses within larger-scale ones. The large-scale collapses culminate a few Myr later than the small-scale ones and consist of filamentary flows that accrete onto massive central clumps. The small-scale collapses form clumps that are embedded in the filaments and falling onto the large-scale collapse centers. The stars formed in the early, small-scale collapses share the infall motion of their parent clumps. Thus, the filaments feed both gaseous and stellar material to the massive central clump. This leads to the presence of a few older stars in a region where new protostars are forming, and also to a self-similar structure, in which each unit is composed of smaller-scale sub-units that approach each other and may merge. Becaus...

  3. Pattern formation, long-term transients, and the Turing-Hopf bifurcation in a space- and time-discrete predator-prey system.

    Science.gov (United States)

    Rodrigues, Luiz Alberto Díaz; Mistro, Diomar Cristina; Petrovskii, Sergei

    2011-08-01

    Understanding of population dynamics in a fragmented habitat is an issue of considerable importance. A natural modelling framework for these systems is spatially discrete. In this paper, we consider a predator-prey system that is discrete both in space and time, and is described by a Coupled Map Lattice (CML). The prey growth is assumed to be affected by a weak Allee effect and the predator dynamics includes intra-specific competition. We first reveal the bifurcation structure of the corresponding non-spatial system. We then obtain the conditions of diffusive instability on the lattice. In order to reveal the properties of the emerging patterns, we perform extensive numerical simulations. We pay a special attention to the system properties in a vicinity of the Turing-Hopf bifurcation, which is widely regarded as a mechanism of pattern formation and spatiotemporal chaos in space-continuous systems. Counter-intuitively, we obtain that the spatial patterns arising in the CML are more typically stationary, even when the local dynamics is oscillatory. We also obtain that, for some parameter values, the system's dynamics is dominated by long-term transients, so that the asymptotical stationary pattern arises as a sudden transition between two different patterns. Finally, we argue that our findings may have important ecological implications.

  4. Using Hierarchical Folders and Tags for File Management

    Science.gov (United States)

    Ma, Shanshan

    2010-01-01

    Hierarchical folders have been widely used for managing digital files. A well constructed hierarchical structure can keep files organized. A parent folder can have several subfolders and one subfolder can only reside in one parent folder. Files are stored in folders or subfolders. Files can be found by traversing a given path, going through…

  5. Hierarchical clustering using correlation metric and spatial continuity constraint

    Science.gov (United States)

    Stork, Christopher L.; Brewer, Luke N.

    2012-10-02

    Large data sets are analyzed by hierarchical clustering using correlation as a similarity measure. This provides results that are superior to those obtained using a Euclidean distance similarity measure. A spatial continuity constraint may be applied in hierarchical clustering analysis of images.

  6. Higher-Order Item Response Models for Hierarchical Latent Traits

    Science.gov (United States)

    Huang, Hung-Yu; Wang, Wen-Chung; Chen, Po-Hsi; Su, Chi-Ming

    2013-01-01

    Many latent traits in the human sciences have a hierarchical structure. This study aimed to develop a new class of higher order item response theory models for hierarchical latent traits that are flexible in accommodating both dichotomous and polytomous items, to estimate both item and person parameters jointly, to allow users to specify…

  7. Robust central pattern generators for embodied hierarchical reinforcement learning

    NARCIS (Netherlands)

    Snel, M.; Whiteson, S.; Kuniyoshi, Y.

    2011-01-01

    Hierarchical organization of behavior and learning is widespread in animals and robots, among others to facilitate dealing with multiple tasks. In hierarchical reinforcement learning, agents usually have to learn to recombine or modulate low-level behaviors when facing a new task, which costs time t

  8. Hierarchical Data Structures, Institutional Research, and Multilevel Modeling

    Science.gov (United States)

    O'Connell, Ann A.; Reed, Sandra J.

    2012-01-01

    Multilevel modeling (MLM), also referred to as hierarchical linear modeling (HLM) or mixed models, provides a powerful analytical framework through which to study colleges and universities and their impact on students. Due to the natural hierarchical structure of data obtained from students or faculty in colleges and universities, MLM offers many…

  9. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers...

  10. Hierarchical structure of moral stages assessed by a sorting task

    NARCIS (Netherlands)

    Boom, J.; Brugman, D.; Van der Heijden, P.G.M.

    2001-01-01

    Following criticism of Kohlberg’s theory of moral judgment, an empirical re-examination of hierarchical stage structure was desirable. Utilizing Piaget’s concept of reflective abstraction as a basis, the hierarchical stage structure was investigated using a new method. Study participants (553 Dutch

  11. Hierarchical Problem Solving with the Linkage Tree Genetic Algorithm

    NARCIS (Netherlands)

    Thierens, D.; Bosman, P.A.N.; Blum, C.; Alba, E.

    2013-01-01

    Hierarchical problems represent an important class of nearly decomposable problems. The concept of near decomposability is central to the study of complex systems. When little a priori information is available, a black box problem solver is needed to optimize these hierarchical problems. The solver

  12. On the renormalization group transformation for scalar hierarchical models

    Energy Technology Data Exchange (ETDEWEB)

    Koch, H. (Texas Univ., Austin (USA). Dept. of Mathematics); Wittwer, P. (Geneva Univ. (Switzerland). Dept. de Physique Theorique)

    1991-06-01

    We give a new proof for the existence of a non-Gaussian hierarchical renormalization group fixed point, using what could be called a beta-function for this problem. We also discuss the asymptotic behavior of this fixed point, and the connection between the hierarchical models of Dyson and Gallavotti. (orig.).

  13. Efficient promotion strategies in hierarchical organizations

    Science.gov (United States)

    Pluchino, Alessandro; Rapisarda, Andrea; Garofalo, Cesare

    2011-10-01

    The Peter principle has recently been investigated by means of an agent-based simulation, and its validity has been numerically corroborated. It has been confirmed that, within certain conditions, it can really influence in a negative way the efficiency of a pyramidal organization adopting meritocratic promotions. It was also found that, in order to bypass these effects, alternative promotion strategies should be adopted, as for example a random selection choice. In this paper, within the same line of research, we study promotion strategies in a more realistic hierarchical and modular organization, and we show the robustness of our previous results, extending their validity to a more general context. We also discuss why the adoption of these strategies could be useful for real organizations.

  14. Hesitant fuzzy agglomerative hierarchical clustering algorithms

    Science.gov (United States)

    Zhang, Xiaolu; Xu, Zeshui

    2015-02-01

    Recently, hesitant fuzzy sets (HFSs) have been studied by many researchers as a powerful tool to describe and deal with uncertain data, but relatively, very few studies focus on the clustering analysis of HFSs. In this paper, we propose a novel hesitant fuzzy agglomerative hierarchical clustering algorithm for HFSs. The algorithm considers each of the given HFSs as a unique cluster in the first stage, and then compares each pair of the HFSs by utilising the weighted Hamming distance or the weighted Euclidean distance. The two clusters with smaller distance are jointed. The procedure is then repeated time and again until the desirable number of clusters is achieved. Moreover, we extend the algorithm to cluster the interval-valued hesitant fuzzy sets, and finally illustrate the effectiveness of our clustering algorithms by experimental results.

  15. Hierarchical organisation of Britain through percolation theory

    CERN Document Server

    Arcaute, Elsa; Hatna, Erez; Murcio, Roberto; Vargas-Ruiz, Camilo; Masucci, Paolo; Wang, Jiaqiu; Batty, Michael

    2015-01-01

    Urban systems present hierarchical structures at many different scales. These are observed as administrative regional delimitations, which are the outcome of geographical, political and historical constraints. Using percolation theory on the street intersections and on the road network of Britain, we obtain hierarchies at different scales that are independent of administrative arrangements. Natural boundaries, such as islands and National Parks, consistently emerge at the largest/regional scales. Cities are devised through recursive percolations on each of the emerging clusters, but the system does not undergo a phase transition at the distance threshold at which cities can be defined. This specific distance is obtained by computing the fractal dimension of the clusters extracted at each distance threshold. We observe that the fractal dimension presents a maximum over all the different distance thresholds. The clusters obtained at this maximum are in very good correspondence to the morphological definition of...

  16. The hierarchical structure of chemical engineering

    Institute of Scientific and Technical Information of China (English)

    Mooson; KWAUK

    2007-01-01

    Around the turn of the present century,scholars began to recognize chemical engineering as a com-plex system,and have been searching for a convenient point of entry for refreshing its knowledge base.From our study of the dynamic structures of dispersed particles in fluidization and the resultingmulti-scale method,we have been attempting to extend our findings to structures prevailing in othermultiphase systems as well as in the burgeoning industries producing functional materials.Chemicalengineering itself is hierarchically structured.Besides structures based on space and time,such hier-archy could be built from ChE history scaled according to science content,or from ChE operation ac-cording to the expenditure of manpower and capital investment.

  17. The hierarchical structure of chemical engineering

    Institute of Scientific and Technical Information of China (English)

    Mooson KWAUK

    2007-01-01

    Around the turn of the present century, scholars began to recognize chemical engineering as a complex system, and have been searching for a convenient point of entry for refreshing its knowledge base. From our study of the dynamic structures of dispersed particles in fluidization and the resulting multi-scale method, we have been attempting to extend our findings to structures prevailing in other multiphase systems as well as in the burgeoning industries producing functional materials. Chemical engineering itself is hierarchically structured. Besides structures based on space and time, such hierarchy could be built from ChE history scaled according to science content, or from ChE operation according to the expenditure of manpower and capital investment.

  18. Hierarchical probabilistic inference of cosmic shear

    CERN Document Server

    Schneider, Michael D; Marshall, Philip J; Dawson, William A; Meyers, Joshua; Bard, Deborah J; Lang, Dustin

    2014-01-01

    Point estimators for the shearing of galaxy images induced by gravitational lensing involve a complex inverse problem in the presence of noise, pixelization, and model uncertainties. We present a probabilistic forward modeling approach to gravitational lensing inference that has the potential to mitigate the biased inferences in most common point estimators and is practical for upcoming lensing surveys. The first part of our statistical framework requires specification of a likelihood function for the pixel data in an imaging survey given parameterized models for the galaxies in the images. We derive the lensing shear posterior by marginalizing over all intrinsic galaxy properties that contribute to the pixel data (i.e., not limited to galaxy ellipticities) and learn the distributions for the intrinsic galaxy properties via hierarchical inference with a suitably flexible conditional probabilitiy distribution specification. We use importance sampling to separate the modeling of small imaging areas from the glo...

  19. Power Efficient Hierarchical Scheduling for DSP Transformations

    Directory of Open Access Journals (Sweden)

    P. K. Merakos

    2002-01-01

    Full Text Available In this paper, the problem of scheduling the computation of partial products in transformational Digital Signal Processing (DSP algorithms, aiming at the minimization of the switching activity in data and address buses, is addressed. The problem is stated as a hierarchical scheduling problem. Two different optimization algorithms, which are based on the Travelling Salesman Problem (TSP, are defined. The proposed optimization algorithms are independent on the target architecture and can be adapted to take into account it. Experimental results obtained from the application of the proposed algorithms in various widely used DSP transformations, like Discrete Cosine Transform (DCT and Discrete Fourier Transform (DFT, show that significant switching activity savings in data and address buses can be achieved, resulting in corresponding power savings. In addition, the differences between the two proposed methods are underlined, providing envisage for their suitable selection for implementation, in particular transformational algorithms and architectures.

  20. Antiferromagnetic Ising Model in Hierarchical Networks

    Science.gov (United States)

    Cheng, Xiang; Boettcher, Stefan

    2015-03-01

    The Ising antiferromagnet is a convenient model of glassy dynamics. It can introduce geometric frustrations and may give rise to a spin glass phase and glassy relaxation at low temperatures [ 1 ] . We apply the antiferromagnetic Ising model to 3 hierarchical networks which share features of both small world networks and regular lattices. Their recursive and fixed structures make them suitable for exact renormalization group analysis as well as numerical simulations. We first explore the dynamical behaviors using simulated annealing and discover an extremely slow relaxation at low temperatures. Then we employ the Wang-Landau algorithm to investigate the energy landscape and the corresponding equilibrium behaviors for different system sizes. Besides the Monte Carlo methods, renormalization group [ 2 ] is used to study the equilibrium properties in the thermodynamic limit and to compare with the results from simulated annealing and Wang-Landau sampling. Supported through NSF Grant DMR-1207431.

  1. Crack Propagation in Bamboo's Hierarchical Cellular Structure

    Science.gov (United States)

    Habibi, Meisam K.; Lu, Yang

    2014-07-01

    Bamboo, as a natural hierarchical cellular material, exhibits remarkable mechanical properties including excellent flexibility and fracture toughness. As far as bamboo as a functionally graded bio-composite is concerned, the interactions of different constituents (bamboo fibers; parenchyma cells; and vessels.) alongside their corresponding interfacial areas with a developed crack should be of high significance. Here, by using multi-scale mechanical characterizations coupled with advanced environmental electron microscopy (ESEM), we unambiguously show that fibers' interfacial areas along with parenchyma cells' boundaries were preferred routes for crack growth in both radial and longitudinal directions. Irrespective of the honeycomb structure of fibers along with cellular configuration of parenchyma ground, the hollow vessels within bamboo culm affected the crack propagation too, by crack deflection or crack-tip energy dissipation. It is expected that the tortuous crack propagation mode exhibited in the present study could be applicable to other cellular natural materials as well.

  2. Secular Evolution of Hierarchical Triple Star Systems

    CERN Document Server

    Ford, E B; Kozinsky, B

    1999-01-01

    We derive octupole-level secular perturbation equations for hierarchical triple systems, using classical Hamiltonian perturbation techniques. Our equations describe the secular evolution of the orbital eccentricities and inclinations over timescales long compared to the orbital periods. By extending previous work done to leading (quadrupole) order to octupole level (i.e., including terms of order $\\alpha^3$, where $\\alpha\\equiv a_1/a_2<1$ is the ratio of semimajor axes) we obtain expressions that are applicable to a much wider range of parameters. For triple systems containing a close inner binary, we also discuss the possible interaction between the classical Newtonian perturbations and the general relativistic precession of the inner orbit. In some cases we show that this interaction can lead to resonances and a significant increase in the maximum amplitude of eccentricity perturbations. We establish the validity of our analytic expressions by providing detailed comparisons with the results of direct num...

  3. Hierarchical Codebook Design for Massive MIMO

    Directory of Open Access Journals (Sweden)

    Xin Su

    2015-02-01

    Full Text Available The Research of Massive MIMO is an emerging area, since the more antennas the transmitters or receivers equipped with, the higher spectral efficiency and link reliability the system can provide. Due to the limited feedback channel, precoding and codebook design are important to exploit the performance of massive MIMO. To improve the precoding performance, we propose a novel hierarchical codebook with the Fourier-based perturbation matrices as the subcodebook and the Kerdock codebook as the main codebook, which could reduce storage and search complexity due to the finite a lphabet. Moreover, t o f urther r educe t he search complexity and feedback overhead without noticeable performance degradation, we use an adaptive selection algorithm to decide whether to use the subcodebook. Simulation results show that the proposed codebook has remarkable performance gain compared to the conventional Kerdock codebook, without significant increase in feedback overhead and search complexity.

  4. Optimization of Hierarchical System for Data Acquisition

    Directory of Open Access Journals (Sweden)

    V. Novotny

    2011-04-01

    Full Text Available Television broadcasting over IP networks (IPTV is one of a number of network applications that are except of media distribution also interested in data acquisition from group of information resources of variable size. IP-TV uses Real-time Transport Protocol (RTP protocol for media streaming and RTP Control Protocol (RTCP protocol for session quality feedback. Other applications, for example sensor networks, have data acquisition as the main task. Current solutions have mostly problem with scalability - how to collect and process information from large amount of end nodes quickly and effectively? The article deals with optimization of hierarchical system of data acquisition. Problem is mathematically described, delay minima are searched and results are proved by simulations.

  5. When to Use Hierarchical Linear Modeling

    Directory of Open Access Journals (Sweden)

    Veronika Huta

    2014-04-01

    Full Text Available Previous publications on hierarchical linear modeling (HLM have provided guidance on how to perform the analysis, yet there is relatively little information on two questions that arise even before analysis: Does HLM apply to one’s data and research question? And if it does apply, how does one choose between HLM and other methods sometimes used in these circumstances, including multiple regression, repeated-measures or mixed ANOVA, and structural equation modeling or path analysis? The purpose of this tutorial is to briefly introduce HLM and then to review some of the considerations that are helpful in answering these questions, including the nature of the data, the model to be tested, and the information desired on the output. Some examples of how the same analysis could be performed in HLM, repeated-measures or mixed ANOVA, and structural equation modeling or path analysis are also provided. .

  6. Hierarchical manifold learning for regional image analysis.

    Science.gov (United States)

    Bhatia, Kanwal K; Rao, Anil; Price, Anthony N; Wolz, Robin; Hajnal, Joseph V; Rueckert, Daniel

    2014-02-01

    We present a novel method of hierarchical manifold learning which aims to automatically discover regional properties of image datasets. While traditional manifold learning methods have become widely used for dimensionality reduction in medical imaging, they suffer from only being able to consider whole images as single data points. We extend conventional techniques by additionally examining local variations, in order to produce spatially-varying manifold embeddings that characterize a given dataset. This involves constructing manifolds in a hierarchy of image patches of increasing granularity, while ensuring consistency between hierarchy levels. We demonstrate the utility of our method in two very different settings: 1) to learn the regional correlations in motion within a sequence of time-resolved MR images of the thoracic cavity; 2) to find discriminative regions of 3-D brain MR images associated with neurodegenerative disease.

  7. Hierarchical analysis of the quiet Sun magnetism

    CERN Document Server

    Ramos, A Asensio

    2014-01-01

    Standard statistical analysis of the magnetic properties of the quiet Sun rely on simple histograms of quantities inferred from maximum-likelihood estimations. Because of the inherent degeneracies, either intrinsic or induced by the noise, this approach is not optimal and can lead to highly biased results. We carry out a meta-analysis of the magnetism of the quiet Sun from Hinode observations using a hierarchical probabilistic method. This model allows us to infer the statistical properties of the magnetic field vector over the observed field-of-view consistently taking into account the uncertainties in each pixel due to noise and degeneracies. Our results point out that the magnetic fields are very weak, below 275 G with 95% credibility, with a slight preference for horizontal fields, although the distribution is not far from a quasi-isotropic distribution.

  8. Entrepreneurial intention modeling using hierarchical multiple regression

    Directory of Open Access Journals (Sweden)

    Marina Jeger

    2014-12-01

    Full Text Available The goal of this study is to identify the contribution of effectuation dimensions to the predictive power of the entrepreneurial intention model over and above that which can be accounted for by other predictors selected and confirmed in previous studies. As is often the case in social and behavioral studies, some variables are likely to be highly correlated with each other. Therefore, the relative amount of variance in the criterion variable explained by each of the predictors depends on several factors such as the order of variable entry and sample specifics. The results show the modest predictive power of two dimensions of effectuation prior to the introduction of the theory of planned behavior elements. The article highlights the main advantages of applying hierarchical regression in social sciences as well as in the specific context of entrepreneurial intention formation, and addresses some of the potential pitfalls that this type of analysis entails.

  9. Image Segmentation Using Hierarchical Merge Tree

    Science.gov (United States)

    Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga

    2016-10-01

    This paper investigates one of the most fundamental computer vision problems: image segmentation. We propose a supervised hierarchical approach to object-independent image segmentation. Starting with over-segmenting superpixels, we use a tree structure to represent the hierarchy of region merging, by which we reduce the problem of segmenting image regions to finding a set of label assignment to tree nodes. We formulate the tree structure as a constrained conditional model to associate region merging with likelihoods predicted using an ensemble boundary classifier. Final segmentations can then be inferred by finding globally optimal solutions to the model efficiently. We also present an iterative training and testing algorithm that generates various tree structures and combines them to emphasize accurate boundaries by segmentation accumulation. Experiment results and comparisons with other very recent methods on six public data sets demonstrate that our approach achieves the state-of-the-art region accuracy and is very competitive in image segmentation without semantic priors.

  10. Fluorocarbon Adsorption in Hierarchical Porous Frameworks

    Energy Technology Data Exchange (ETDEWEB)

    Motkuri, Radha K.; Annapureddy, Harsha V.; Vijayakumar, M.; Schaef, Herbert T.; Martin, P F.; McGrail, B. Peter; Dang, Liem X.; Krishna, Rajamani; Thallapally, Praveen K.

    2014-07-09

    The adsorption behavior of a series of fluorocarbon derivatives was examined on a set of microporous metal organic framework (MOF) sorbents and another set of hierarchical mesoporous MOFs. The microporous M-DOBDC (M = Ni, Co) showed a saturation uptake capacity for R12 of over 4 mmol/g at a very low relative saturation pressure (P/Po) of 0.02. In contrast, the mesoporous MOF MIL-101 showed an exceptionally high uptake capacity reaching over 14 mmol/g at P/Po of 0.4. Adsorption affinity in terms of mass loading and isosteric heats of adsorption were found to generally correlate with the polarizability of the refrigerant with R12 > R22 > R13 > R14 > methane. These results suggest the possibility of exploiting MOFs for separation of azeotropic mixtures of fluorocarbons and use in eco-friendly fluorocarbon-based adsorption cooling and refrigeration applications.

  11. Hierarchical image segmentation for learning object priors

    Energy Technology Data Exchange (ETDEWEB)

    Prasad, Lakshman [Los Alamos National Laboratory; Yang, Xingwei [TEMPLE UNIV.; Latecki, Longin J [TEMPLE UNIV.; Li, Nan [TEMPLE UNIV.

    2010-11-10

    The proposed segmentation approach naturally combines experience based and image based information. The experience based information is obtained by training a classifier for each object class. For a given test image, the result of each classifier is represented as a probability map. The final segmentation is obtained with a hierarchial image segmentation algorithm that considers both the probability maps and the image features such as color and edge strength. We also utilize image region hierarchy to obtain not only local but also semi-global features as input to the classifiers. Moreover, to get robust probability maps, we take into account the region context information by averaging the probability maps over different levels of the hierarchical segmentation algorithm. The obtained segmentation results are superior to the state-of-the-art supervised image segmentation algorithms.

  12. Hierarchical Subtopic Segmentation of Web Document

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    The paper proposes a novel method for subtopics segmentation of Web document. An effective retrieval results may be obtained by using subtopics segmentation. The proposed method can segment hierarchically subtopics and identify the boundary of each subtopic. Based on the term frequency matrix, the method measures the similarity between adjacent blocks, such as paragraphs, passages. In the real-world sample experiment, the macro-averaged precision and recall reach 73.4% and 82.5%, and the micro-averaged precision and recall reach 72.9% and 83.1%. Moreover, this method is equally efficient to other Asian languages such as Japanese and Korean, as well as other western languages.

  13. Improved Adhesion and Compliancy of Hierarchical Fibrillar Adhesives.

    Science.gov (United States)

    Li, Yasong; Gates, Byron D; Menon, Carlo

    2015-08-01

    The gecko relies on van der Waals forces to cling onto surfaces with a variety of topography and composition. The hierarchical fibrillar structures on their climbing feet, ranging from mesoscale to nanoscale, are hypothesized to be key elements for the animal to conquer both smooth and rough surfaces. An epoxy-based artificial hierarchical fibrillar adhesive was prepared to study the influence of the hierarchical structures on the properties of a dry adhesive. The presented experiments highlight the advantages of a hierarchical structure despite a reduction of overall density and aspect ratio of nanofibrils. In contrast to an adhesive containing only nanometer-size fibrils, the hierarchical fibrillar adhesives exhibited a higher adhesion force and better compliancy when tested on an identical substrate.

  14. Hierarchical imaging of the human knee

    Science.gov (United States)

    Schulz, Georg; Götz, Christian; Deyhle, Hans; Müller-Gerbl, Magdalena; Zanette, Irene; Zdora, Marie-Christine; Khimchenko, Anna; Thalmann, Peter; Rack, Alexander; Müller, Bert

    2016-10-01

    Among the clinically relevant imaging techniques, computed tomography (CT) reaches the best spatial resolution. Sub-millimeter voxel sizes are regularly obtained. For investigations on true micrometer level lab-based μCT has become gold standard. The aim of the present study is the hierarchical investigation of a human knee post mortem using hard X-ray μCT. After the visualization of the entire knee using a clinical CT with a spatial resolution on the sub-millimeter range, a hierarchical imaging study was performed using a laboratory μCT system nanotom m. Due to the size of the whole knee the pixel length could not be reduced below 65 μm. These first two data sets were directly compared after a rigid registration using a cross-correlation algorithm. The μCT data set allowed an investigation of the trabecular structures of the bones. The further reduction of the pixel length down to 25 μm could be achieved by removing the skin and soft tissues and measuring the tibia and the femur separately. True micrometer resolution could be achieved after extracting cylinders of several millimeters diameters from the two bones. The high resolution scans revealed the mineralized cartilage zone including the tide mark line as well as individual calcified chondrocytes. The visualization of soft tissues including cartilage, was arranged by X-ray grating interferometry (XGI) at ESRF and Diamond Light Source. Whereas the high-energy measurements at ESRF allowed the simultaneous visualization of soft and hard tissues, the low-energy results from Diamond Light Source made individual chondrocytes within the cartilage visual.

  15. Hierarchical structures in fully developed turbulence

    Science.gov (United States)

    Liu, Li

    Analysis of the probability density functions (PDFs) of the velocity increment dvl and of their deformation is used to reveal the statistical structure of the intermittent energy cascade dynamics of turbulence. By analyzing a series of turbulent data sets including that of an experiment of fully developed low temperature helium turbulent gas flow (Belin, Tabeling, & Willaime, Physica D 93, 52, 1996), of a three-dimensional isotropic Navier-Stokes simulation with a resolution of 2563 (Cao, Chen, & She, Phys. Rev. Lett. 76, 3711, 1996) and of a GOY shell model simulation (Leveque & She, Phys. Rev. E 55, 1997) of a very big sample size (up to 5 billions), the validity of the Hierarchical Structure model (She & Leveque, Phys. Rev. Lett. 72, 366, 1994) for the inertial-range is firmly demonstrated. Furthermore, it is shown that parameters in the Hierarchical Structure model can be reliably measured and used to characterize the cascade process. The physical interpretations of the parameters then allow to describe differential changes in different turbulent systems so as to address non-universal features of turbulent systems. It is proposed that the above study provides a framework for the study of non-homogeneous turbulence. A convergence study of moments and scaling exponents is also carried out with detailed analysis of effects of finite statistical sample size. A quantity Pmin is introduced to characterize the resolution of a PDF, and hence the sample size. The fact that any reported scaling exponent depends on the PDF resolution suggests that the validation (or rejection) of a model of turbulence needs to carry out a resolution dependence analysis on its scaling prediction.

  16. Classifying hospitals as mortality outliers: logistic versus hierarchical logistic models.

    Science.gov (United States)

    Alexandrescu, Roxana; Bottle, Alex; Jarman, Brian; Aylin, Paul

    2014-05-01

    The use of hierarchical logistic regression for provider profiling has been recommended due to the clustering of patients within hospitals, but has some associated difficulties. We assess changes in hospital outlier status based on standard logistic versus hierarchical logistic modelling of mortality. The study population consisted of all patients admitted to acute, non-specialist hospitals in England between 2007 and 2011 with a primary diagnosis of acute myocardial infarction, acute cerebrovascular disease or fracture of neck of femur or a primary procedure of coronary artery bypass graft or repair of abdominal aortic aneurysm. We compared standardised mortality ratios (SMRs) from non-hierarchical models with SMRs from hierarchical models, without and with shrinkage estimates of the predicted probabilities (Model 1 and Model 2). The SMRs from standard logistic and hierarchical models were highly statistically significantly correlated (r > 0.91, p = 0.01). More outliers were recorded in the standard logistic regression than hierarchical modelling only when using shrinkage estimates (Model 2): 21 hospitals (out of a cumulative number of 565 pairs of hospitals under study) changed from a low outlier and 8 hospitals changed from a high outlier based on the logistic regression to a not-an-outlier based on shrinkage estimates. Both standard logistic and hierarchical modelling have identified nearly the same hospitals as mortality outliers. The choice of methodological approach should, however, also consider whether the modelling aim is judgment or improvement, as shrinkage may be more appropriate for the former than the latter.

  17. Forecasting the Effects of Raising the Retirement Age on Russia’s Demographic Struc

    Directory of Open Access Journals (Sweden)

    Elena Vital’evna Chistova

    2016-07-01

    Full Text Available The paper assesses the possibility of raising the retirement age to mitigate the effects of ageing on the pension system of Russia. The authors make demographic forecasts based on hypotheses about the presence of global demographic trends in population reproduction and manifestations of development features specific for Russia. The demographic forecast is based on the age shifting method according to three scenarios. The forecast takes into account the provisions of a draft law that has already been approved and that provides for a gradual increase in age limit for civil servants, both men and women, to 65 years (by six months each year. The following assumption is made for the purpose of studying the effects of raising the retirement age to 65 years for all categories of Russian citizens. The increase in the retirement age begins in 2016 at the rate of 6 months per year, and it will end for men in 2026 and for women – in 2036. Thus, by 2036, the official retirement age will be 65 years for both sexes. The resulting forecasts show that population ageing in Russia is an inevitable process. Depending on whether demographic processes are in line with global trends or whether certain specific Russian features of development are revealed, ageing process will occur in the first case – “from above”, in the second case – “from below”. The forecast has confirmed a well-known paradox that if the situation regarding the decline in mortality is improved further, as has happened in recent years, then the pace of ageing that negatively affects the balance of the pension system will be even higher, at least in the medium term. Forecast calculations have shown that, first, demographic burden on the working population will continue to increase under any demographic development scenario implemented in Russia, and most significantly, under a scenario that describes a successful demographic policy. Second, the number of retirement age women is a significant potential reserve for decreasing the demographic burden on able-bodied population. It appears that raising the retirement age is feasible but it should be carefully prepared so as to be implemented gradually and accompanied by several additional measures

  18. CODE-CROSSING: HIERARCHICAL POLITENESS IN JAVANESE

    Directory of Open Access Journals (Sweden)

    Majid Wajdi

    2015-02-01

    Full Text Available Javanese is a well known for its speech levels called ngoko ‘low’ and krama ‘high’ which enable its speakers to show intimacy, deference, and hierarchy among the society members. This research applied critically Brown and Gilman (1960’s theory of terms of address to analyze the asymmetrical, factors which influence, and politeness of the use of speech levels in Javanese.                                                                                                   Method of observation, in depth interview, and document study were applied to collect the data. Recorded conversation was then transcribed into written form, classified and codified according to the speech levels, and analyzed using politeness system (Scollon and Scollon, 2001 and status scale (Homes, 2001.                                                                       The use of speech levels shows asymmetric communication: two speakers use two different codes, i.e. ngoko and krama because of power (+P and with/without distance (+/-D, and it is the reflection of hierarchical politeness. The asymmetrical use of ngoko and krama by God and His Angel, God and human beings strongly explicated the asymmetrical communication between superiors and inferiors. The finding of the research shows that the use of ngoko and krama could present the phenomena of code-switching, code-mixing, and the fundamental phenomenon is ‘code-crossing’. It is concluded that hierarchical politeness in Javanese is ‘social contract’ i.e. the acknowledgment of the existence of high class (superior and low class (inferior  implemented in ‘communications contract’  using speech levels of the Javanese language  in line with status scale. Asymmetrical use of ngoko and krama indexed inequality, hierarchy, and harmony

  19. HIERARCHICAL FRAGMENTATION OF THE ORION MOLECULAR FILAMENTS

    Energy Technology Data Exchange (ETDEWEB)

    Takahashi, Satoko; Ho, Paul T. P.; Su, Yu-Nung [Academia Sinica Institute of Astronomy and Astrophysics, P.O. Box 23-141, Taipei 10617, Taiwan (China); Teixeira, Paula S. [Institut fuer Astrophysik, Universitaet Wien, Tuerkenschanzstrasse 17, A-1180, Wien (Austria); Zapata, Luis A., E-mail: satoko_t@asiaa.sinica.edu.tw [Centro de Radioastronomia y Astrofisica, Universidad Nacional Autonoma de Mexico, Morelia, Michoacan 58090 (Mexico)

    2013-01-20

    We present a high angular resolution map of the 850 {mu}m continuum emission of the Orion Molecular Cloud-3 (OMC 3) obtained with the Submillimeter Array (SMA); the map is a mosaic of 85 pointings covering an approximate area of 6.'5 Multiplication-Sign 2.'0 (0.88 Multiplication-Sign 0.27 pc). We detect 12 spatially resolved continuum sources, each with an H{sub 2} mass between 0.3-5.7 M {sub Sun} and a projected source size between 1400-8200 AU. All the detected sources are on the filamentary main ridge (n{sub H{sub 2}}{>=}10{sup 6} cm{sup -3}), and analysis based on the Jeans theorem suggests that they are most likely gravitationally unstable. Comparison of multi-wavelength data sets indicates that of the continuum sources, 6/12 (50%) are associated with molecular outflows, 8/12 (67%) are associated with infrared sources, and 3/12 (25%) are associated with ionized jets. The evolutionary status of these sources ranges from prestellar cores to protostar phase, confirming that OMC-3 is an active region with ongoing embedded star formation. We detect quasi-periodical separations between the OMC-3 sources of Almost-Equal-To 17''/0.035 pc. This spatial distribution is part of a large hierarchical structure that also includes fragmentation scales of giant molecular cloud ( Almost-Equal-To 35 pc), large-scale clumps ( Almost-Equal-To 1.3 pc), and small-scale clumps ( Almost-Equal-To 0.3 pc), suggesting that hierarchical fragmentation operates within the Orion A molecular cloud. The fragmentation spacings are roughly consistent with the thermal fragmentation length in large-scale clumps, while for small-scale cores it is smaller than the local fragmentation length. These smaller spacings observed with the SMA can be explained by either a helical magnetic field, cloud rotation, or/and global filament collapse. Finally, possible evidence for sequential fragmentation is suggested in the northern part of the OMC-3 filament.

  20. A Reexamination of Methods of Hierarchic Composition in the AHP

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhi-yong

    2002-01-01

    This paper demonstrates that we should use two different hierarchic composition methods for the two different types of levels in the AHP. The first method is using the weighted geometric mean to synthesize the judgments of alternative-type-level elements, which is the only hierarchic composition method for the alternative-type level in an AHP hierarchy, and the rank is preserved automatically. The second one is using the weighted arithmetic mean to synthesize the priorities of the criteria-type-level elements, which is the only hierarchic composition method for all the criteria-type levels, and rank reversals are allowed.

  1. Study on Synthesis and Catalytic Performance of Hierarchical Zeolite

    Institute of Scientific and Technical Information of China (English)

    Zhang Lingling; Li Fengyan; ZhaoTianbo; Sun Guida

    2007-01-01

    A kind of hierarchical zeolite catalyst was synthesized by hydrothermal method.X-ray diffraction (XRD)and nitrogen adsorption-desorption method were used to study the phase and aperture structure of the prepared catalyst.Infrared(IR)spectra of pyridine adsorbed on the sample showed that the hierarchical zeolite really had much more Bronsted and Lewis acidic sites than the HZSM-5 zeolite.The catalytic cracking of large hydrocarbon molecules showed that the hierarchical zeolite had a higher catalytic activity than the HZSM-5 zeolite.

  2. Adaptive mobility management scheme in hierarchical mobile IPv6

    Science.gov (United States)

    Fang, Bo; Song, Junde

    2004-04-01

    Hierarchical mobile IPv6 makes the mobility management localized. Registration with HA is only needed while MN moving between MAP domains. This paper proposed an adaptive mobility management scheme based on the hierarchical mobile IPv6. The scheme focuses on the MN operation as well as MAP operation during the handoff. Adaptive MAP selection algorithm can be used to select a suitable MAP to register with once MN moves into a new subnet while MAP can thus adaptively changing his management domain. Furthermore, MAP can also adaptively changes its level in the hierarchical referring on the service load or other related information. Detailed handoff algorithm is also discussed in this paper.

  3. Mechanically robust superhydrophobicity on hierarchically structured Si surfaces

    Energy Technology Data Exchange (ETDEWEB)

    Xiu Yonghao; Hess, Dennis W [School of Chemical and Biomolecular Engineering, Georgia Institute of Technology, 311 Ferst Drive, Atlanta, GA 30332-0100 (United States); Liu Yan; Wong, C P, E-mail: dennis.hess@chbe.gatech.edu, E-mail: cp.wong@mse.gatech.edu [School of Materials Science and Engineering, Georgia Institute of Technology, 771 Ferst Drive, Atlanta, GA 30332-0245 (United States)

    2010-04-16

    Improvement of the robustness of superhydrophobic surfaces is critical in order to achieve commercial applications of these surfaces in such diverse areas as self-cleaning, water repellency and corrosion resistance. In this study, the mechanical robustness of superhydrophobic surfaces was evaluated on hierarchically structured silicon surfaces. The effect of two-scale hierarchical structures on robustness was investigated using an abrasion test and the results compared to those of superhydrophobic surfaces fabricated from polymeric materials and from silicon that contains only nanostructures. Unlike the polymeric and nanostructure-only surfaces, the hierarchical structures retained superhydrophobic behavior after mechanical abrasion.

  4. Hierarchically Structured Monolithic ZSM-5 through Macroporous Silica Gel Zeolitization

    Institute of Scientific and Technical Information of China (English)

    Lei Qian; Zhao Tianbo; Li Fengyan; Zong Baoning; Tong Yangchuan

    2006-01-01

    The hierarchically structured ZSM-5 monolith was prepared through transforming the skeletons of the macroporous silica gel into ZSM-5 by the steam-assisted conversion method. The morphology and monolithic shapes of macroporous silica gel were well preserved. The hierarchically structured ZSM-5 monolith exhibited the hierarchical porosity, with mesopores and macropores existing inside the macroporous silica gel, and micropores formed by the ZSM-5. The products have been characterized properly by using the XRD, SEM and N2 adsorption-desorption methods.

  5. Synthesis and Characterization of ZnTe Hierarchical Nanostructures

    Directory of Open Access Journals (Sweden)

    Baohua Zhang

    2012-01-01

    Full Text Available Single-crystalline ZnTe hierarchical nanostructures have been successfully synthesized by a simple thermal evaporation technology. The as-prepared products were characterized with X-ray diffraction (XRD, scanning electron microcopy (SEM, transmission electron microscope (TEM, and photoluminescence spectrum (PL. These results showed that the ZnTe hierarchical nanostructures consisted of nanowires and nanolumps. The room temperature PL spectrum exhibited a pure green luminescence centered at 545nm. The growth mechanism of hierarchical nanostructure was also discussed.

  6. Hierarchical theory of quantum adiabatic evolution

    Science.gov (United States)

    Zhang, Qi; Gong, Jiangbin; Wu, Biao

    2014-12-01

    Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between nondegenerate instantaneous energy eigenstates in such a dynamical evolution. However, this is true only when the driving rate is infinitesimally small. For a small nonzero driving rate, there are generally small transition probabilities between the energy eigenstates. We develop a classical mechanics framework to address the small deviations from the quantum adiabatic theorem order by order. A hierarchy of Hamiltonians is constructed iteratively with the zeroth-order Hamiltonian being determined by the original system Hamiltonian. The kth-order deviations are governed by a kth-order Hamiltonian, which depends on the time derivatives of the adiabatic parameters up to the kth-order. Two simple examples, the Landau-Zener model and a spin-1/2 particle in a rotating magnetic field, are used to illustrate our hierarchical theory. Our analysis also exposes a deep, previously unknown connection between classical adiabatic theory and quantum adiabatic theory.

  7. HIERARCHICAL PROBABILISTIC INFERENCE OF COSMIC SHEAR

    Energy Technology Data Exchange (ETDEWEB)

    Schneider, Michael D.; Dawson, William A. [Lawrence Livermore National Laboratory, Livermore, CA 94551 (United States); Hogg, David W. [Center for Cosmology and Particle Physics, New York University, New York, NY 10003 (United States); Marshall, Philip J.; Bard, Deborah J. [SLAC National Accelerator Laboratory, Menlo Park, CA 94025 (United States); Meyers, Joshua [Kavli Institute for Particle Astrophysics and Cosmology, Stanford University, 452 Lomita Mall, Stanford, CA 94035 (United States); Lang, Dustin, E-mail: schneider42@llnl.gov [Department of Physics, Carnegie Mellon University, Pittsburgh, PA 15213 (United States)

    2015-07-01

    Point estimators for the shearing of galaxy images induced by gravitational lensing involve a complex inverse problem in the presence of noise, pixelization, and model uncertainties. We present a probabilistic forward modeling approach to gravitational lensing inference that has the potential to mitigate the biased inferences in most common point estimators and is practical for upcoming lensing surveys. The first part of our statistical framework requires specification of a likelihood function for the pixel data in an imaging survey given parameterized models for the galaxies in the images. We derive the lensing shear posterior by marginalizing over all intrinsic galaxy properties that contribute to the pixel data (i.e., not limited to galaxy ellipticities) and learn the distributions for the intrinsic galaxy properties via hierarchical inference with a suitably flexible conditional probabilitiy distribution specification. We use importance sampling to separate the modeling of small imaging areas from the global shear inference, thereby rendering our algorithm computationally tractable for large surveys. With simple numerical examples we demonstrate the improvements in accuracy from our importance sampling approach, as well as the significance of the conditional distribution specification for the intrinsic galaxy properties when the data are generated from an unknown number of distinct galaxy populations with different morphological characteristics.

  8. HIDEN: Hierarchical decomposition of regulatory networks

    Directory of Open Access Journals (Sweden)

    Gülsoy Günhan

    2012-09-01

    Full Text Available Abstract Background Transcription factors regulate numerous cellular processes by controlling the rate of production of each gene. The regulatory relations are modeled using transcriptional regulatory networks. Recent studies have shown that such networks have an underlying hierarchical organization. We consider the problem of discovering the underlying hierarchy in transcriptional regulatory networks. Results We first transform this problem to a mixed integer programming problem. We then use existing tools to solve the resulting problem. For larger networks this strategy does not work due to rapid increase in running time and space usage. We use divide and conquer strategy for such networks. We use our method to analyze the transcriptional regulatory networks of E. coli, H. sapiens and S. cerevisiae. Conclusions Our experiments demonstrate that: (i Our method gives statistically better results than three existing state of the art methods; (ii Our method is robust against errors in the data and (iii Our method’s performance is not affected by the different topologies in the data.

  9. Relativized hierarchical decomposition of Markov decision processes.

    Science.gov (United States)

    Ravindran, B

    2013-01-01

    Reinforcement Learning (RL) is a popular paradigm for sequential decision making under uncertainty. A typical RL algorithm operates with only limited knowledge of the environment and with limited feedback on the quality of the decisions. To operate effectively in complex environments, learning agents require the ability to form useful abstractions, that is, the ability to selectively ignore irrelevant details. It is difficult to derive a single representation that is useful for a large problem setting. In this chapter, we describe a hierarchical RL framework that incorporates an algebraic framework for modeling task-specific abstraction. The basic notion that we will explore is that of a homomorphism of a Markov Decision Process (MDP). We mention various extensions of the basic MDP homomorphism framework in order to accommodate different commonly understood notions of abstraction, namely, aspects of selective attention. Parts of the work described in this chapter have been reported earlier in several papers (Narayanmurthy and Ravindran, 2007, 2008; Ravindran and Barto, 2002, 2003a,b; Ravindran et al., 2007).

  10. GEODESIC RECONSTRUCTION, SADDLE ZONES & HIERARCHICAL SEGMENTATION

    Directory of Open Access Journals (Sweden)

    Serge Beucher

    2011-05-01

    Full Text Available The morphological reconstruction based on geodesic operators, is a powerful tool in mathematical morphology. The general definition of this reconstruction supposes the use of a marker function f which is not necessarily related to the function g to be built. However, this paper deals with operations where the marker function is defined from given characteristic regions of the initial function f, as it is the case, for instance, for the extrema (maxima or minima but also for the saddle zones. Firstly, we show that the intuitive definition of a saddle zone is not easy to handle, especially when digitised images are involved. However, some of these saddle zones (regional ones also called overflow zones can be defined, this definition providing a simple algorithm to extract them. The second part of the paper is devoted to the use of these overflow zones as markers in image reconstruction. This reconstruction provides a new function which exhibits a new hierarchy of extrema. This hierarchy is equivalent to the hierarchy produced by the so-called waterfall algorithm. We explain why the waterfall algorithm can be achieved by performing a watershed transform of the function reconstructed by its initial watershed lines. Finally, some examples of use of this hierarchical segmentation are described.

  11. Hierarchical structure and biomineralization in cricket tooth

    CERN Document Server

    Xing, Xueqing; Cai, Quan; Mo, Guang; Du, Rong; Chen, Zhongjun; Wu, Zhonghua

    2012-01-01

    Cricket is a truculent insect with stiff and sharp teeth as a fighting weapon. The structure and possible biomineralization of the cricket teeth are always interested. Synchrotron radiation X-ray fluorescence, X-ray diffraction and small angle X-ray scattering techniques were used to probe the element distribution, possible crystalline structures and size distribution of scatterers in cricket teeth. Scanning electron microscope was used to observe the nanoscaled structure. The results demonstrate that Zn is the main heavy element in cricket teeth. The surface of the cricket teeth has a crystalline compound like ZnFe2(AsO4)2(OH)2(H2O)4. While, the interior of the teeth has a crystalline compound like ZnCl2, which is from the biomineralization. The ZnCl2-like biomineral forms nanoscaled microfibrils and their axial direction points at the top of tooth cusp. The microfibrils aggregate random into intermediate filaments, forming a hierarchical structure. A sketch map of the cricket tooth cusp was proposed and a d...

  12. Expectation and attention in hierarchical auditory prediction.

    Science.gov (United States)

    Chennu, Srivas; Noreika, Valdas; Gueorguiev, David; Blenkmann, Alejandro; Kochen, Silvia; Ibáñez, Agustín; Owen, Adrian M; Bekinschtein, Tristan A

    2013-07-03

    Hierarchical predictive coding suggests that attention in humans emerges from increased precision in probabilistic inference, whereas expectation biases attention in favor of contextually anticipated stimuli. We test these notions within auditory perception by independently manipulating top-down expectation and attentional precision alongside bottom-up stimulus predictability. Our findings support an integrative interpretation of commonly observed electrophysiological signatures of neurodynamics, namely mismatch negativity (MMN), P300, and contingent negative variation (CNV), as manifestations along successive levels of predictive complexity. Early first-level processing indexed by the MMN was sensitive to stimulus predictability: here, attentional precision enhanced early responses, but explicit top-down expectation diminished it. This pattern was in contrast to later, second-level processing indexed by the P300: although sensitive to the degree of predictability, responses at this level were contingent on attentional engagement and in fact sharpened by top-down expectation. At the highest level, the drift of the CNV was a fine-grained marker of top-down expectation itself. Source reconstruction of high-density EEG, supported by intracranial recordings, implicated temporal and frontal regions differentially active at early and late levels. The cortical generators of the CNV suggested that it might be involved in facilitating the consolidation of context-salient stimuli into conscious perception. These results provide convergent empirical support to promising recent accounts of attention and expectation in predictive coding.

  13. Hierarchical characterization procedures for dimensional metrology

    Science.gov (United States)

    MacKinnon, David; Beraldin, Jean-Angelo; Cournoyer, Luc; Carrier, Benjamin

    2011-03-01

    We present a series of dimensional metrology procedures for evaluating the geometrical performance of a 3D imaging system that have either been designed or modified from existing procedures to ensure, where possible, statistical traceability of each characteristic value from the certified reference surface to the certifying laboratory. Because there are currently no internationally-accepted standards for characterizing 3D imaging systems, these procedures have been designed to avoid using characteristic values provided by the vendors of 3D imaging systems. For this paper, we focus only on characteristics related to geometric surface properties, dividing them into surface form precision and surface fit trueness. These characteristics have been selected to be familiar to operators of 3D imaging systems that use Geometrical Dimensioning and Tolerancing (GD&T). The procedures for generating characteristic values would form the basis of either a volumetric or application-specific analysis of the characteristic profile of a 3D imaging system. We use a hierarchical approach in which each procedure builds on either certified reference values or previously-generated characteristic values. Starting from one of three classes of surface forms, we demonstrate how procedures for quantifying for flatness, roundness, angularity, diameter error, angle error, sphere-spacing error, and unidirectional and bidirectional plane-spacing error are built upon each other. We demonstrate how these procedures can be used as part of a process for characterizing the geometrical performance of a 3D imaging system.

  14. Hierarchical Object Parsing from Noisy Point Clouds

    CERN Document Server

    Barbu, Adrian

    2011-01-01

    Object parsing and segmentation from point clouds are challenging tasks because the relevant data is available only as thin structures along object boundaries or other object features and is corrupted by large amounts of noise. One way to handle this kind of data is by employing shape models that can accurately follow the object boundaries. Popular models such as Active Shape and Active Appearance models lack the necessary flexibility for this task. While more flexible models such as Recursive Compositional Models have been proposed, this paper builds on the Active Shape models and makes three contributions. First, it presents a flexible, mid-entropy, hierarchical generative model of object shape and appearance in images. The input data is explained by an object parsing layer, which is a deformation of a hidden PCA shape model with Gaussian prior. Second, it presents a novel efficient inference algorithm that uses a set of informed data-driven proposals to initialize local searches for the hidden variables. T...

  15. Hierarchical Design Method for Micro Device

    Directory of Open Access Journals (Sweden)

    Zheng Liu

    2013-05-01

    Full Text Available Traditional mask-beginning design flow of micro device is unintuitive and fussy for designers. A hierarchical design method and involved key technologies for features mapping procedure are presented. With the feature-based design framework, the model of micro device is organized by various features in different designing stages, which can be converted into each other based on the mapping rules. The feature technology is the foundation of the three-level design flow that provides a more efficient design way. In system level, functional features provide the top level of schematic and functional description. After the functional mapping procedure, on the other hand, parametric design features construct the 3D model of micro device in device level, which is based on Hybird Model representation. By means of constraint features, the corresponding revision rules are applied to the rough model to optimize the original structure. As a result, the model reconstruction algorithm makes benefit for the model revision and constraint features mapping process. Moreover, the formulating description of manufacturing features derivation provides the automatic way for model conversion.

  16. Fluorocarbon adsorption in hierarchical porous frameworks

    Science.gov (United States)

    Motkuri, Radha Kishan; Annapureddy, Harsha V. R.; Vijaykumar, M.; Schaef, H. Todd; Martin, Paul F.; McGrail, B. Peter; Dang, Liem X.; Krishna, Rajamani; Thallapally, Praveen K.

    2014-07-01

    Metal-organic frameworks comprise an important class of solid-state materials and have potential for many emerging applications such as energy storage, separation, catalysis and bio-medical. Here we report the adsorption behaviour of a series of fluorocarbon derivatives on a set of microporous and hierarchical mesoporous frameworks. The microporous frameworks show a saturation uptake capacity for dichlorodifluoromethane of >4 mmol g-1 at a very low relative saturation pressure (P/Po) of 0.02. In contrast, the mesoporous framework shows an exceptionally high uptake capacity reaching >14 mmol g-1 at P/Po of 0.4. Adsorption affinity in terms of mass loading and isosteric heats of adsorption is found to generally correlate with the polarizability and boiling point of the refrigerant, with dichlorodifluoromethane >chlorodifluoromethane >chlorotrifluoromethane >tetrafluoromethane >methane. These results suggest the possibility of exploiting these sorbents for separation of azeotropic mixtures of fluorocarbons and use in eco-friendly fluorocarbon-based adsorption cooling.

  17. Hierarchical Bayesian inference in the visual cortex

    Science.gov (United States)

    Lee, Tai Sing; Mumford, David

    2003-07-01

    Traditional views of visual processing suggest that early visual neurons in areas V1 and V2 are static spatiotemporal filters that extract local features from a visual scene. The extracted information is then channeled through a feedforward chain of modules in successively higher visual areas for further analysis. Recent electrophysiological recordings from early visual neurons in awake behaving monkeys reveal that there are many levels of complexity in the information processing of the early visual cortex, as seen in the long-latency responses of its neurons. These new findings suggest that activity in the early visual cortex is tightly coupled and highly interactive with the rest of the visual system. They lead us to propose a new theoretical setting based on the mathematical framework of hierarchical Bayesian inference for reasoning about the visual system. In this framework, the recurrent feedforward/feedback loops in the cortex serve to integrate top-down contextual priors and bottom-up observations so as to implement concurrent probabilistic inference along the visual hierarchy. We suggest that the algorithms of particle filtering and Bayesian-belief propagation might model these interactive cortical computations. We review some recent neurophysiological evidences that support the plausibility of these ideas. 2003 Optical Society of America

  18. Hierarchical group dynamics in pigeon flocks.

    Science.gov (United States)

    Nagy, Máté; Akos, Zsuzsa; Biro, Dora; Vicsek, Tamás

    2010-04-08

    Animals that travel together in groups display a variety of fascinating motion patterns thought to be the result of delicate local interactions among group members. Although the most informative way of investigating and interpreting collective movement phenomena would be afforded by the collection of high-resolution spatiotemporal data from moving individuals, such data are scarce and are virtually non-existent for long-distance group motion within a natural setting because of the associated technological difficulties. Here we present results of experiments in which track logs of homing pigeons flying in flocks of up to 10 individuals have been obtained by high-resolution lightweight GPS devices and analysed using a variety of correlation functions inspired by approaches common in statistical physics. We find a well-defined hierarchy among flock members from data concerning leading roles in pairwise interactions, defined on the basis of characteristic delay times between birds' directional choices. The average spatial position of a pigeon within the flock strongly correlates with its place in the hierarchy, and birds respond more quickly to conspecifics perceived primarily through the left eye-both results revealing differential roles for birds that assume different positions with respect to flock-mates. From an evolutionary perspective, our results suggest that hierarchical organization of group flight may be more efficient than an egalitarian one, at least for those flock sizes that permit regular pairwise interactions among group members, during which leader-follower relationships are consistently manifested.

  19. Automatic Construction of Hierarchical Road Networks

    Science.gov (United States)

    Yang, Weiping

    2016-06-01

    This paper describes an automated method of constructing a hierarchical road network given a single dataset, without the presence of thematic attributes. The method is based on a pattern graph which maintains nodes and paths as junctions and through-traffic roads. The hierarchy is formed incrementally in a top-down fashion for highways, ramps, and major roads directly connected to ramps; and bottom-up for the rest of major and minor roads. Through reasoning and analysis, ramps are identified as unique characteristics for recognizing and assembling high speed roads. The method makes distinctions on the types of ramps by articulating their connection patterns with highways. Major and minor roads will be identified by both quantitative and qualitative analysis of spatial properties and by discovering neighbourhood patterns revealed in the data. The result of the method would enrich data description and support comprehensive queries on sorted exit or entry points on highways and their related roads. The enrichment on road network data is important to a high successful rate of feature matching for road networks and to geospatial data integration.

  20. Hierarchical spatiotemporal matrix models for characterizing invasions.

    Science.gov (United States)

    Hooten, Mevin B; Wikle, Christopher K; Dorazio, Robert M; Royle, J Andrew

    2007-06-01

    The growth and dispersal of biotic organisms is an important subject in ecology. Ecologists are able to accurately describe survival and fecundity in plant and animal populations and have developed quantitative approaches to study the dynamics of dispersal and population size. Of particular interest are the dynamics of invasive species. Such nonindigenous animals and plants can levy significant impacts on native biotic communities. Effective models for relative abundance have been developed; however, a better understanding of the dynamics of actual population size (as opposed to relative abundance) in an invasion would be beneficial to all branches of ecology. In this article, we adopt a hierarchical Bayesian framework for modeling the invasion of such species while addressing the discrete nature of the data and uncertainty associated with the probability of detection. The nonlinear dynamics between discrete time points are intuitively modeled through an embedded deterministic population model with density-dependent growth and dispersal components. Additionally, we illustrate the importance of accommodating spatially varying dispersal rates. The method is applied to the specific case of the Eurasian Collared-Dove, an invasive species at mid-invasion in the United States at the time of this writing.

  1. Electroanalysis using modified hierarchical nanoporous carbon materials.

    Science.gov (United States)

    Rodriguez, Rusbel Coneo; Moncada, Angelica Baena; Acevedo, Diego F; Planes, Gabriel A; Miras, Maria C; Barbero, Cesar A

    2013-01-01

    The role of the electrode nanoporosity in electroanalytical processes is discussed and specific phenomena (slow double layer charging, local pH effects) which can be present in porous electrode are described. Hierarchical porous carbon (HPC) materials are synthesized using a hard template method. The three dimensional carbon porosity is examined using scanning electron microscopy on flat surfaces cut using a focused ion beam (FIB-SEM). The electrochemical properties of the HPC are measured using cyclic voltammetry, AC impedance, chronoamperometry and Probe Beam Deflection (PBD) techniques. Chronoamperometry measurements of HPC seems to fit a transmission line model. PBD data show evidence of local pH changes inside the pores, during double layer charging. The HPC are modified by in situ (chemical or electrochemical) formation of metal (Pt/Ru) or metal oxide (CoOx, Fe3O4) nanoparticles. Additionally, HPC loaded with Pt decorated magnetite (Fe3O4) nanoparticles is produced by galvanic displacement. The modified HPC materials are used for the electroanalysis of different substances (CO, O2, AsO3(-3)). The role of the nanoporous carbon substrate in the electroanalytical data is evaluated.

  2. Automatic layout of structured hierarchical reports.

    Science.gov (United States)

    Bakke, Eirik; Karger, David R; Miller, Robert C

    2013-12-01

    Domain-specific database applications tend to contain a sizable number of table-, form-, and report-style views that must each be designed and maintained by a software developer. A significant part of this job is the necessary tweaking of low-level presentation details such as label placements, text field dimensions, list or table styles, and so on. In this paper, we present a horizontally constrained layout management algorithm that automates the display of structured hierarchical data using the traditional visual idioms of hand-designed database UIs: tables, multi-column forms, and outline-style indented lists. We compare our system with pure outline and nested table layouts with respect to space efficiency and readability, the latter with an online user study on 27 subjects. Our layouts are 3.9 and 1.6 times more compact on average than outline layouts and horizontally unconstrained table layouts, respectively, and are as readable as table layouts even for large datasets.

  3. Hierarchical Picture Coding Using Quadtree Decomposition

    Science.gov (United States)

    Buhler, Yves; Fortier, Michel

    1987-10-01

    A new hierarchical encoding scheme for grey-level pictures is presented here. The picture field is split by a modified quadtree algorithm into blocks of size 32 x 32, 16 x 16, 8 x 8 and 4 x 4 pels, according to their subjective importance in the picture. The larger cells, of size 32 x 32, 16 x 16 and 8 x 8 pels, corresponding to uniform or low-detailed areas, are coded at a very low rates by block truncation in the Discrete Cosine Transform field. The smallest blocks, representing mainly high-detailed areas of the like edges or textures are coded with a multi-codebook vector quantization scheme. Due to its structure, such an encoding scheme is especially well adapted for coding "head and shoulders" pictures, mostly encountered in videophone or videoconference application, where large areas of background may appear. Concerning the vector quantization, several techniques were investigated in order to improve the subjective quality and to reduce the search time through the codebooks. This permits a faster elaboration of the codebooks. Results are presented with bit-rates ranging from 0.4 to 0.8 bits/pel depending on the picture complexity.

  4. The hierarchical brain network for face recognition.

    Science.gov (United States)

    Zhen, Zonglei; Fang, Huizhen; Liu, Jia

    2013-01-01

    Numerous functional magnetic resonance imaging (fMRI) studies have identified multiple cortical regions that are involved in face processing in the human brain. However, few studies have characterized the face-processing network as a functioning whole. In this study, we used fMRI to identify face-selective regions in the entire brain and then explore the hierarchical structure of the face-processing network by analyzing functional connectivity among these regions. We identified twenty-five regions mainly in the occipital, temporal and frontal cortex that showed a reliable response selective to faces (versus objects) across participants and across scan sessions. Furthermore, these regions were clustered into three relatively independent sub-networks in a face-recognition task on the basis of the strength of functional connectivity among them. The functionality of the sub-networks likely corresponds to the recognition of individual identity, retrieval of semantic knowledge and representation of emotional information. Interestingly, when the task was switched to object recognition from face recognition, the functional connectivity between the inferior occipital gyrus and the rest of the face-selective regions were significantly reduced, suggesting that this region may serve as an entry node in the face-processing network. In sum, our study provides empirical evidence for cognitive and neural models of face recognition and helps elucidate the neural mechanisms underlying face recognition at the network level.

  5. Computing nature turing centenary perspective

    CERN Document Server

    Giovagnoli, Raffaela

    2013-01-01

    This book is about nature considered as the totality of physical existence, the universe, and our present day attempts to understand it. If we see the universe as a network of networks of computational processes at many different levels of organization, what can we learn about physics, biology, cognition, social systems, and ecology expressed through interacting networks of elementary particles, atoms, molecules, cells, (and especially neurons when it comes to understanding of cognition and intelligence), organs, organisms and their ecologies? Regarding our computational models of natural phenomena Feynman famously wondered: “Why should it take an infinite amount of logic to figure out what one tiny piece of space/time is going to do?” Phenomena themselves occur so quickly and automatically in nature. Can we learn how to harness nature’s computational power as we harness its energy and materials? This volume includes a selection of contributions from the Symposium on Natural Computing/Unconventional Com...

  6. School Of Agricul_ture, '

    African Journals Online (AJOL)

    new agricultural technologies as the local farmer is endowed with a considerable ... cropping systems, biodiversity conservation and health delivery system as ... marshy soils in the dry season production of vegetable such as okro, garden.

  7. Tree Representations: Graphics Libraries for Displaying Hierarchical Data

    Directory of Open Access Journals (Sweden)

    Mark Wilhelm

    2009-03-01

    Full Text Available Tree representations can be useful for presenting hierarchical data on the screen. In this article I’ll briefly describe building trees using the Dojo, Yahoo User Interface, Java Server Faces, and Google Web Toolkit libraries.

  8. Fractal Analysis Based on Hierarchical Scaling in Complex Systems

    CERN Document Server

    Chen, Yanguang

    2016-01-01

    A fractal is in essence a hierarchy with cascade structure, which can be described with a set of exponential functions. From these exponential functions, a set of power laws indicative of scaling can be derived. Hierarchy structure and spatial network proved to be associated with one another. This paper is devoted to exploring the theory of fractal analysis of complex systems by means of hierarchical scaling. Two research methods are utilized to make this study, including logic analysis method and empirical analysis method. The main results are as follows. First, a fractal system such as Cantor set is described from the hierarchical angle of view; based on hierarchical structure, three approaches are proposed to estimate fractal dimension. Second, the hierarchical scaling can be generalized to describe multifractals, fractal complementary sets, and self-similar curve such as logarithmic spiral. Third, complex systems such as urban system are demonstrated to be a self-similar hierarchy. The human settlements i...

  9. 1 Hierarchical Approaches to the Analysis of Genetic Diversity in ...

    African Journals Online (AJOL)

    2015-04-14

    Apr 14, 2015 ... Keywords: Genetic diversity, Hierarchical approach, Plant, Clustering,. Descriptive ... utilization) or by clustering (based on a phonetic analysis of individual ...... Improvement of Food Crop Preservatives for the next Millennium.

  10. Field experiment on a robust hierarchical metropolitan quantum cryptography network

    Institute of Scientific and Technical Information of China (English)

    XU FangXing; CHEN Wei; WANG Shuang; YIN ZhenQiang; ZHANG Yang; LIU Yun; ZHOU Zheng; ZHAO YiBo; LI HongWei; LIU Dong; HAN ZhengFu; GUO GuangCan

    2009-01-01

    these bureaus.The whole implementation including the hierarchical quantum cryptographic communication network links and the corresponding application software shows a big step toward the practical user-oriented network with a high security level.

  11. Modeling the deformation behavior of nanocrystalline alloy with hierarchical microstructures

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Hongxi; Zhou, Jianqiu, E-mail: zhouj@njtech.edu.cn [Nanjing Tech University, Department of Mechanical Engineering (China); Zhao, Yonghao, E-mail: yhzhao@njust.edu.cn [Nanjing University of Science and Technology, Nanostructural Materials Research Center, School of Materials Science and Engineering (China)

    2016-02-15

    A mechanism-based plasticity model based on dislocation theory is developed to describe the mechanical behavior of the hierarchical nanocrystalline alloys. The stress–strain relationship is derived by invoking the impeding effect of the intra-granular solute clusters and the inter-granular nanostructures on the dislocation movements along the sliding path. We found that the interaction between dislocations and the hierarchical microstructures contributes to the strain hardening property and greatly influence the ductility of nanocrystalline metals. The analysis indicates that the proposed model can successfully describe the enhanced strength of the nanocrystalline hierarchical alloy. Moreover, the strain hardening rate is sensitive to the volume fraction of the hierarchical microstructures. The present model provides a new perspective to design the microstructures for optimizing the mechanical properties in nanostructural metals.

  12. Hierarchical Ag mesostructures for single particle SERS substrate

    Science.gov (United States)

    Xu, Minwei; Zhang, Yin

    2017-01-01

    Hierarchical Ag mesostructures with highly rough surface morphology have been synthesized at room temperature through a simple seed-mediated approach. Electron microscopy characterizations indicate that the obtained Ag mesostructures exhibit a textured surface morphology with the flower-like architecture. Moreover, the particle size can be tailored easily in the range of 250-500 nm. For the growth process of the hierarchical Ag mesostructures, it is believed that the self-assembly mechanism is more reasonable rather than the epitaxial overgrowth of Ag seed. The oriented attachment of nanoparticles is revealed during the formation of Ag mesostructures. Single particle surface enhanced Raman spectra (sp-SERS) of crystal violet adsorbed on the hierarchical Ag mesostructures were measured. Results reveal that the hierarchical Ag mesostructures can be highly sensitive sp-SERS substrates with good reproducibility. The average enhancement factors for individual Ag mesostructures are estimated to be about 106.

  13. Facile synthesis and photocatalytic activity of zinc oxide hierarchical microcrystals

    KAUST Repository

    Xu, Xinjiang

    2013-04-04

    ZnO microcrystals with hierarchical structure have been synthesized by a simple solvothermal approach. The microcrystals were studied by means of X-ray diffraction, transmission electron microscopy, and scanning electron microscopy. Research on the formation mechanism of the hierarchical microstructure shows that the coordination solvent and precursor concentration have considerable influence on the size and morphology of the microstructures. A possible formation mechanism of the hierarchical structure was suggested. Furthermore, the catalytic activity of the ZnO microcrystals was studied by treating low concentration Rhodamine B (RhB) solution under UV light, and research results show the hierarchical microstructures of ZnO display high catalytic activity in photocatalysis, the catalysis process follows first-order reaction kinetics, and the apparent rate constant k = 0.03195 min-1.

  14. An Unsupervised Model for Exploring Hierarchical Semantics from Social Annotations

    Science.gov (United States)

    Zhou, Mianwei; Bao, Shenghua; Wu, Xian; Yu, Yong

    This paper deals with the problem of exploring hierarchical semantics from social annotations. Recently, social annotation services have become more and more popular in Semantic Web. It allows users to arbitrarily annotate web resources, thus, largely lowers the barrier to cooperation. Furthermore, through providing abundant meta-data resources, social annotation might become a key to the development of Semantic Web. However, on the other hand, social annotation has its own apparent limitations, for instance, 1) ambiguity and synonym phenomena and 2) lack of hierarchical information. In this paper, we propose an unsupervised model to automatically derive hierarchical semantics from social annotations. Using a social bookmark service Del.icio.us as example, we demonstrate that the derived hierarchical semantics has the ability to compensate those shortcomings. We further apply our model on another data set from Flickr to testify our model's applicability on different environments. The experimental results demonstrate our model's efficiency.

  15. Hierarchical Planning Methodology for a Supply Chain Management

    National Research Council Canada - National Science Library

    Virna Ortiz-Araya; Víctor M Albornoz

    2012-01-01

      Hierarchical production planning is a widely utilized methodology for real world capacitated production planning systems with the aim of establishing different decision-making levels of the planning...

  16. A Hierarchical Clustering Methodology for the Estimation of Toxicity

    Science.gov (United States)

    A Quantitative Structure Activity Relationship (QSAR) methodology based on hierarchical clustering was developed to predict toxicological endpoints. This methodology utilizes Ward's method to divide a training set into a series of structurally similar clusters. The structural sim...

  17. Neural Mechanisms of Hierarchical Planning in a Virtual Subway Network.

    Science.gov (United States)

    Balaguer, Jan; Spiers, Hugo; Hassabis, Demis; Summerfield, Christopher

    2016-05-18

    Planning allows actions to be structured in pursuit of a future goal. However, in natural environments, planning over multiple possible future states incurs prohibitive computational costs. To represent plans efficiently, states can be clustered hierarchically into "contexts". For example, representing a journey through a subway network as a succession of individual states (stations) is more costly than encoding a sequence of contexts (lines) and context switches (line changes). Here, using functional brain imaging, we asked humans to perform a planning task in a virtual subway network. Behavioral analyses revealed that humans executed a hierarchically organized plan. Brain activity in the dorsomedial prefrontal cortex and premotor cortex scaled with the cost of hierarchical plan representation and unique neural signals in these regions signaled contexts and context switches. These results suggest that humans represent hierarchical plans using a network of caudal prefrontal structures. VIDEO ABSTRACT.

  18. Fast, Linear Time Hierarchical Clustering using the Baire Metric

    CERN Document Server

    Contreras, Pedro

    2011-01-01

    The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. In this work we evaluate empirically this new approach to hierarchical clustering. We compare hierarchical clustering based on the Baire metric with (i) agglomerative hierarchical clustering, in terms of algorithm properties; (ii) generalized ultrametrics, in terms of definition; and (iii) fast clustering through k-means partititioning, in terms of quality of results. For the latter, we carry out an in depth astronomical study. We apply the Baire distance to spectrometric and photometric redshifts from the Sloan Digital Sky Survey using, in this work, about half a million astronomical objects. We want to know how well the (more costly to determine) spectrometric redshifts can predict the (more easily obtained) photometric redshifts, i.e. we seek to regress the spectrometric on the photometric redshifts, and we use clusterwi...

  19. Cortical tracking of hierarchical linguistic structures in connected speech.

    Science.gov (United States)

    Ding, Nai; Melloni, Lucia; Zhang, Hang; Tian, Xing; Poeppel, David

    2016-01-01

    The most critical attribute of human language is its unbounded combinatorial nature: smaller elements can be combined into larger structures on the basis of a grammatical system, resulting in a hierarchy of linguistic units, such as words, phrases and sentences. Mentally parsing and representing such structures, however, poses challenges for speech comprehension. In speech, hierarchical linguistic structures do not have boundaries that are clearly defined by acoustic cues and must therefore be internally and incrementally constructed during comprehension. We found that, during listening to connected speech, cortical activity of different timescales concurrently tracked the time course of abstract linguistic structures at different hierarchical levels, such as words, phrases and sentences. Notably, the neural tracking of hierarchical linguistic structures was dissociated from the encoding of acoustic cues and from the predictability of incoming words. Our results indicate that a hierarchy of neural processing timescales underlies grammar-based internal construction of hierarchical linguistic structure.

  20. What are hierarchical models and how do we analyze them?

    Science.gov (United States)

    Royle, Andy

    2016-01-01

    In this chapter we provide a basic definition of hierarchical models and introduce the two canonical hierarchical models in this book: site occupancy and N-mixture models. The former is a hierarchical extension of logistic regression and the latter is a hierarchical extension of Poisson regression. We introduce basic concepts of probability modeling and statistical inference including likelihood and Bayesian perspectives. We go through the mechanics of maximizing the likelihood and characterizing the posterior distribution by Markov chain Monte Carlo (MCMC) methods. We give a general perspective on topics such as model selection and assessment of model fit, although we demonstrate these topics in practice in later chapters (especially Chapters 5, 6, 7, and 10 Chapter 5 Chapter 6 Chapter 7 Chapter 10)