TITLE

Periodic patterning in materials deposition by self-regulating diffusion-reaction processes

AUTHOR(S)
Bhattacharya, M.; Vlachos, D. G.; Tsapatsis, M.
PUB. DATE
May 2003
SOURCE
Applied Physics Letters;5/12/2003, Vol. 82 Issue 19, p3357
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
A mechanism is proposed and validated through numerical simulations to explain periodic patterning of materials as a result of self-organization caused via Turing instability. The proposed model includes autocatalytic chemistry of the activator-inhibitor type to form a precursor followed by nucleation and growth. Critical parameters affecting deposit pattern formation and sharpness include the critical concentration for nucleation, the growth rate, and the diffusion of the growth precursor. The proposed mechanism offers a possible explanation for the recently observed periodicity of TiO[SUB2] bands formed in microporous Vycor[SUPTM] glass. Conditions for the spontaneous self-organization of materials, such as semiconductor quantum dots and photocatalytic materials, are discussed.
ACCESSION #
9697684

 

Related Articles

  • Formation of Carbon Particles from a Gas Phase: Nucleation Phenomenon Lahaye, J.; Prado, G. // Water, Air & Soil Pollution;Dec1974, Vol. 3 Issue 4, p473 

    No abstract available.

  • Assessment of the theoretical basis of the rule of additivity for the nucleation incubation time... Zhu, Y.T.; Lowe, T.C.; Asaro, R. J. // Journal of Applied Physics;8/1/1997, Vol. 82 Issue 3, p1129 

    Investigates the additivity of the consumption of the incubation time for nucleation during continuous cooling through an analysis based upon classical nucleation theory. Demonstration of the invalidity of the rule of additivity for incubation time for nucleation; Requirements during phase...

  • On finite automata with limited nondeterminism. Leung, Hing // Acta Informatica;1998, Vol. 35 Issue 7, p595 

    Abstract. We develop a new algorithm for determining if a given nondeterministic finite automaton is limited in nondeterminism. From this, we show that the number of nondeterministic moves of a finite automaton, if limited, is bounded by 2[sup n] - 2 where n is the number of states. If the...

  • Comparing Verboseness for Finite Automata and Turing Machines. Tantau, Till // Theory of Computing Systems;Jan/Feb2004, Vol. 37 Issue 1, p95 

    A language is called (m,n)-verbose if there exists a Turing machine that enumerates for any n words at most m possibilities for their characteristic string. This notion is compared with (m,n)-fa-verboseness, where instead of a Turing machine a finite automaton is used. By use of a new...

  • Is this magazine "reader, friendly"? Haber, Amy; Washington, Cathy; Ippolito, Vito; Dreyfus, Richard Kurt; Larman, Keith // Psychology Today;Mar84, Vol. 18 Issue 3, p5 

    A letter to the editor is presented in response to the article "User Friendly" that was published in the December, 1983 issue of the journal.

  • Robust Reductions. Cai, J.-Y.; Hemaspaandra, L. A.; Wechsung, G. // Theory of Computing Systems;Nov/Dec99, Vol. 32 Issue 6, p625 

    Reestablishes the theorem Gavalda and Balcazar on robust reductions. Robust underproductivity; Robust underproductivity; Extent to which each restriction weakens the power of reduction; Karp-Lipton theorem.

  • Corrigendum Learning Two-Type Automata from Queries and Counterexamples. Yokomori, Takashi // Theory of Computing Systems;2002, Vol. 35 Issue 4, p465 

    Reveals errors in the author's article 'Learning two-tape automata from queries and counterexamplaes,' which appeared in 'Mathematical Systems Theory.' Defect from the definitions of 'nondeterministic 2-tape automata' (2-tape NFAs); Deterministic versions of 2-tape DFAs; Validity of the algorithm.

  • Picking up on pork.  // Food Manufacture;Sep96, Vol. 71 Issue 9, p41 

    Reports that the meat processing industry in Great Britain is about to implementing robotic production in an industry that is dominated by manual production techniques. Advantages that the meat processing industry can gain from the implementation of robotics; Comments from Gordon Semple, an...

  • Accepting Zeno words: a way toward timed refinements. Bérard, Béatrice; Picaronny, Claudine // Acta Informatica;2000, Vol. 37 Issue 1, p45 

    Abstract. Timed models were introduced to describe the behaviors of realtime systems and they were usually required to produce only executions with divergent sequences of times, However, when some physical phenomena are represented by convergent executions, Zeno words appear in a natural way....

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics