Thesis (M.S.)--Missouri State University, 2008. / "August 2008." Includes bibliographical references (leaf 37). Also available online.

Thesis (M.F.A.)--Rochester Institute of Technology, 1996. / Typescript. Includes bibliographical references (leaves 39-40).

Thesis (Ph.D.) - University of St Andrews, May 2009. / Electronic version restricted until 29th May 2011.

Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, August 1999. / Includes bibliographical references. Also available on the Internet.

Thesis (M.A.)--Ohio State University, 1986. / Includes bibliographical references (leaves 94-97). Available online via OhioLINK's ETD Center

The study of abstract machines such as Turing machines, push down automata and finite state machines has played an important role in the advancement of computer science. It has led to developments in the theory of general purpose computers, compilers and string manipulation as well as many other areas. The language associated with an abstract machine characterises an important aspect of the behaviour of that machine. It is therefore the principal object of interest when studying such a machine. In this thesis we consider abstract container data types to be abstract machines. We define the concept of a language associated with an abstract container data type and investigate this in the same spirit as for other abstract machines. We also consider a model which allows us to describe various abstract container data types. This model is studied in a similar manner. There is a rich selection of problems to investigate. For instance, the data items which the abstract container data types operate on can take many forms. The input stream could consist of distinct data items, say 1, 2,..., n, or it could be a word over the binary alphabet. Alternatively it could be a sequence formed from the data items in some arbitrary multiset. Another consideration is whether or not an abstract data type has a finite storage capacity. It is shown how to construct a regular grammar which generates (an encoded form of) the set of permutations which can be realised by moving tokens through a network. A one to one correspondence is given between ordered forests of bounded height and members of the language associated with a bounded capacity priority queue operating on binary data. A number of related results are also proved; in particular for networks operating on binary data, and priority queues of capacity 2.

A series of abstract thinking and reasoning tasks was administered to patients with Alzheimer's disease (AD) and a sample of nondemented older adults matched on age, education, and gender variables. The performance of the AD patients was inferior to control subjects on all verbal and nonverbal reasoning tests, including a newly developed test of analogical reasoning, the Goranson Analogy Test (GAT). Preliminary psychometric analyses of the GAT revealed very high internal consistency, good convergent and divergent validity, and adequate predictive validity. Further analyses revealed that reasoning with pictures was just as easy as reasoning with words for AD patients, indicating that modality of presentation has little effect on reasoning performance. Error analyses revealed no qualitative differences in performance between AD patients and nondemented controls. Taken together, the findings suggest that abstract thinking and reasoning abilities decline with the onset of Alzheimer's dementia. A neurocognitive model of analogical reasoning is proposed to account for the study findings. / Graduate

My installation is an exploration of the subconscious ventures within dreams, focusing on aspects of identity, anxiety, and intimacy. The personal disposition of an ‘active’ imagination, even while I sleep, has made me both fascinated and exasperated by my dreamed experiences. By documenting my dreams through animation I am able to explore this power dynamic between my consciousness and subconscious which orchestrates these scenes. Tension between the audio, content, and aesthetic of the work explore the grey emotional areas of dreams that leave residue in the back of our head as we navigate the real world. Time, form, and the scientific and societal laws that govern our lived experiences may be distorted beyond recognition within a dream, and mankind’s proclivity to fantastical dreams makes sleep a gateway to something otherworldly and freeing, all-consuming and overwhelming.

O objetivo deste trabalho é fazer um estudo amplo e sequencial sobre combinatória. Iniciase com os fundamentos da combinatória enumerativa, tais como permutações, combinações simples, combinações completas e os lemas de Kaplanski. Num segundo momento é apresentado uma abordagem aos problemas de contagem utilizando a teoria de conjuntos; são abordados o princípio da inclusão-exclusão, permutações caóticas e a contagem de funções. No terceiro momento é feito um aprofundamento do conceito de permutação sob a ótica da álgebra abstrata. É explorado o conceito de grupo de permutações e resultados importantes relacionados. Na sequência propõe-se uma relação de ordem completa e estrita para o grupo de permutações. Por fim, investiga-se dois problemas interessantes da combinatória: a determinação do número de caminhos numa malha quadriculada e a contagem de permutações que desconhecem padrões de comprimento três. / The objective of this work is to make a broad and sequential study on combinatorics. It begins with the foundations of enumerative combinatorics, such as permutations, simple combinations, complete combinations, and Kaplanskis lemmas. In a second moment an approach is presented to the counting problems using set theory; the principle of inclusion-exclusion, chaotic permutations and the counting of functions are addressed. In the third moment a deepening of the concept of permutation is made from the perspective of abstract algebra. The concept of group of permutations and related important results is explored. A strict total order relation for the permutation group is proposed. Finally, we investigate two interesting combinatorial problems: the determination of the number of paths in a grid and the number of permutations that avoids patterns of length three.

Robert Goodnough was an American artist (painter and sculptor) and writer, who was active during the second half of the twentieth century. He became involved in the discussions on the subject matter of the artists which took place in the 1940s and early 1950s. He contributed to the debate through organising discussion sessions amongst contemporary artists, who later became known as Abstract Expressionists. / Abstract Expressionism was the label given to an emblematic period in American painting, which emerged after World War II and was the subject of much debate in the 1940s and 1950s in New York art circles. / Doctorat en Histoire, histoire de l'art et archéologie / info:eu-repo/semantics/nonPublished