Results 21  30
of
114
Preface
, 2008
"... These are lecture notes for AME60634: Intermediate Heat Transfer, a second course on heat transfer for undergraduate seniors and beginning graduate students. At this stage the student can begin to apply knowledge of mathematics and computational methods to the problems of heat transfer. Thus, in add ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
These are lecture notes for AME60634: Intermediate Heat Transfer, a second course on heat transfer for undergraduate seniors and beginning graduate students. At this stage the student can begin to apply knowledge of mathematics and computational methods to the problems of heat transfer. Thus, in addition to some undergraduate knowledge of heat transfer, students taking this course are expected to be familiar with vector algebra, linear algebra, ordinary differential equations, particle and rigidbody dynamics, thermodynamics, and integral and differential analysis in fluid mechanics. The use of computers is essential both for the purpose of computation as well as for display and visualization of results. At present these notes are in the process of being written; the student is encouraged to make extensive use of the literature listed in the bibliography. The students are also expected to attempt the problems at the end of each chapter to reinforce their learning. I will be glad to receive comments on these notes, and have mistakes brought to my attention.
Emergence and complex systems: Towards new practices for industrial automation // Intelligent processing and manufacturing of materials
"... There exist various complex systems theories. Common to these ideas is that they construct fancy abstractions about complexity – so fancy that it is difficult to see the underlying domain fields any more. However, there will not exist applications of the theories if the abstractions cannot be concre ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
There exist various complex systems theories. Common to these ideas is that they construct fancy abstractions about complexity – so fancy that it is difficult to see the underlying domain fields any more. However, there will not exist applications of the theories if the abstractions cannot be concretized. This paper tries to show that something practical can really be reached: New approaches and conceptual tools can be developed, the application field here being industrial automation systems.
Quantum walks and reversible cellular automata
 PHYS LETT. A
, 2004
"... In this paper we study complexvalued reversible cellular automata (RCA) starting from a suitable initial state given by the first two time steps. The evolution of the amplitudes for each of the two chiralities for onedimensional discretetime quantum walk is equivalent to the RCA starting from a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we study complexvalued reversible cellular automata (RCA) starting from a suitable initial state given by the first two time steps. The evolution of the amplitudes for each of the two chiralities for onedimensional discretetime quantum walk is equivalent to the RCA starting from a special initial state. We give necessary and sufficient conditions on initial states for symmetry of distributions of RCA. In addition, necessary and sufficient conditions on initial states for a conserved quantity of RCA. In consequence of our results, we can show that any RCA with symmetric distribution does not have the conserved quantity, in particular, probability distribution.
A SIMPLE PRIMEGENERATING RECURRENCE
"... Abstract. For the sequence defined by f(n) = f(n − 1) + gcd(n, f(n − 1)) with f(1) = 7 we prove that gcd(n, f(n−1)) takes on only 1s and primes, making this recurrence a rare “naturally occurring ” generator of primes. Toward a generalization of this result to an arbitrary initial condition, the l ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. For the sequence defined by f(n) = f(n − 1) + gcd(n, f(n − 1)) with f(1) = 7 we prove that gcd(n, f(n−1)) takes on only 1s and primes, making this recurrence a rare “naturally occurring ” generator of primes. Toward a generalization of this result to an arbitrary initial condition, the limiting behavior of f(n)/n and a transience of the evolution are also studied. 1.
LOCAL NESTED STRUCTURE IN RULE 30
"... Abstract. At row 2 n in the cellular automaton rule 30, a region of the initial condition reappears on the right side, which causes the automaton to “begin again ” locally. As a result, local nested structure is produced. This phenomenon is ultimately due to the property that rule 30 is reversible i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. At row 2 n in the cellular automaton rule 30, a region of the initial condition reappears on the right side, which causes the automaton to “begin again ” locally. As a result, local nested structure is produced. This phenomenon is ultimately due to the property that rule 30 is reversible in time under the condition that the right half of each row is white. The main result of the paper establishes the presence of local nested structure in kcolor rules with this bijectivity property, and we explore a class of integer sequences characterizing the nested structure. We also prove an observation of Wolfram regarding the period length doubling of diagonals on the left side of rule 30. 1.
Information processing, computation, and cognition
 JOURNAL OF BIOLOGICAL PHYSICS
"... Computation and information processing are among the most fundamental notions in cognitive science. They are also among the most imprecisely discussed. Many cognitive scientists take it for granted that cognition involves computation, information processing, or both – although others disagree veheme ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Computation and information processing are among the most fundamental notions in cognitive science. They are also among the most imprecisely discussed. Many cognitive scientists take it for granted that cognition involves computation, information processing, or both – although others disagree vehemently. Yet different cognitive scientists use ‘computation ’ and ‘information processing ’ to mean different things, sometimes without realizing that they do. In addition, computation and information processing are surrounded by several myths; first and foremost, that they are the same thing. In this paper, we address this unsatisfactory state of affairs by presenting a general and theoryneutral account of computation and information processing. We also apply our framework by analyzing the relations between computation and information processing on one hand and classicism and connectionism/computational neuroscience on the other. We defend the relevance to cognitive science of both computation, at least in a generic sense, and information processing, in three important senses of the term. Our account advances several foundational debates in cognitive science by untangling some of their conceptual knots in a theoryneutral way. By leveling the playing field, we pave the way for the future resolution of the debates ’ empirical aspects.
Complexity science challenges
 in cybersecurity”, Sandia National Laboratories SAND Report
, 2009
"... Sandia is a multiprogram laboratory operated by Sandia Corporation, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Sandia is a multiprogram laboratory operated by Sandia Corporation,