Graphic design education has a long history of practitioners leading the development of teaching environments. While these practitioners may develop innovative teaching methods during their educational career, many will never engage with the discipline and literature of pedagogy. Ramsden (2003) asserts that pedagogical principles can help create deeper teaching/learning environments, but this research is all too often disseminated in a lexicon that is not familiar to new graphic design teachers. The research just does not get the message across to those who could benefit most from it. Although graphic design has had difficulties in translating the pedagogical lexicon to its context, it could use its expertise in the visual language to help create a broader understanding of teaching and learning theories and principles for itself and others. The very visual communication skills that we teach could be a more effective way to communicate to educators the necessary pedagogical theory that is to be used in the classroom. This exegesis documents my exploration of pedagogical awareness in graphic design education and how graphic literacy can facilitate this awareness. Through a reflective practice of reading, designing, teaching and conversation, I have uncovered my perceptions and conceptions as a teacher and discovered how some pedagogical principles can help the teaching and learning environment. I have used this knowledge to create an awareness of these principles through the comic language.

Thesis (M.F.A.)--Rochester Institute of Technology, 1993. / Typescript. Includes bibliographical references (leaves 49-57).

Thesis (M.F.A.)--Rochester Institute of Technology, 2008. / Typescript. Includes bibliographical references (leaves 109-110).

Thesis (M.F.A.)--Rochester Institute of Technology, 1992. / Typescript. Includes bibliographical references (leaves 28).

Thesis (Ph. D.) University of Missouri-Columbia, 2006. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 9, 2007) Vita. Includes bibliographical references.

Thesis PlanB (M.S.)--University of Wisconsin--Stout, 2007. / Includes bibliographical references.

This study proposes to illustrate that the twentieth century passage from modernity to postmodernity, with its induction of socio-cultural development and attitudinal change, exists as a fundamental means of informing the character of contemporary graphic design practice1. Today, in contrast to the intentions of this study, many appraisals of graphic design work would seem to place too much emphasis on the analyses and evaluation of the stylistic character of creative practices and not enough on the theoretical, historical and attitudinal issues surrounding them. As such, this study attempts to reveal the meaning and moreover the relevance of philosophical, social, cultural and critical theory for contemporary, postmodern graphic design practices. This is done in order to provide graphic designers with a reflective awareness of the structure of the cultural context within which they work, and takes into account twentieth century cultural theory and twentieth century, western graphic design practice, within the framework of the passage from modernity to postmodernity.

Plant location as a centralized planning objective in which some agency has control over most of the system elements can be reduced, in many circumstances, to the problem of finding the medians of a weighted graph. This concept is feasible if it can be assumed that each location sought is constrained to a subset of p nodes on an n node network. This combinatorial programming problem can be formally stated as follows: if G is a weighted graph, [formula omitted] the weighted distance of node [symbol omitted] to node [symbol omitted], and Xp is any set of p nodes on G (x₁, x₂, •••,Xp), then the required set of p nodes Xp∗ on G is the p median of the graph if it satisfies the expression [formula omitted]. Although this objective can be explicitly optimized by branch bound algorithms, those developed to date can become computationally infeasible for some large scale problems. A fast method for estimating the medians of a weighted graph is given which will provide optimal or near optimal solutions on any type of network. The heuristic procedures adopted in this study can be generalized in terms of three basic steps; 1) partition the graph to obtain an initial feasible solution, 2) re-iterate over; step 1 to achieve a local minimum, and 3) perturb this convergence to test for a lower bound. The design of steps 1 and 3 are crucial to the success of the algorithmic method. Two procedures are given for the basic partitioning of the graph, one of which is a modification of a criterion originally developed by Singer (1968) . The other method introduces a node elimination recursion which appears, experimentally, to be the more efficient procedure for certain types of weighted networks. Efficient perturbation methods are developed for testing the lower bounds obtained. The basic model structure is modified by the introduction of heuristics for the constrained plant location problem under a wide variety of restrictions. Numerical procedures are suggested for restricting the search to a subset of m potential plant sites among all n nodes on the network. Heuristics are developed for forcing certain locations into solution, for placing upper bound constraints on plant sizes, and for restricting the maximum link distance over which a particular allocation might be made. Attention is given to the problem of estimating the joint minimization of plant and transportation cost functions over a network surface. For dynamic location-allocation systems an explicit dynamic programming formulation is developed for the optimal sequencing of plant locations over time subject, if necessary, to periodic variations in all cost functions and node weights. An application of the basic median algorithm to the problem of rural hospital locations in Southeast British Columbia is demonstrated, and computer codes are listed for all the specified models. / Arts, Faculty of / Geography, Department of / Graduate

No description available.

No description available.