by Cheng Kar Wai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1990. / Bibliography: leaves [195-199] / ABSTRACT / Chapter CHAPTER 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- Problem --- p.2 / Chapter 1 .2 --- Approach --- p.3 / Chapter 1.2.1 --- Programming Approach --- p.4 / Chapter 1.2.2 --- Specification Approach --- p.5 / Chapter 1.3 --- Thesis Organization --- p.11 / Chapter CHAPTER 2 --- MODEL SPECIFICATION APPROACH --- p.12 / Chapter 2 .1 --- Overview --- p.14 / Chapter 2.2 --- Compilation Phases --- p.17 / Chapter 2.3 --- Array Graph --- p.22 / Chapter 2.4 --- Scheduling --- p.25 / Chapter CHAPTER 3 --- SURVEY --- p.31 / Chapter 3.1 --- Goodenough's Proposal --- p.31 / Chapter 3.2 --- Exception Handling Models --- p.34 / Chapter 3.3 --- Programming Languages --- p.40 / Chapter 3.4 --- Data-Oriented Exception Handling --- p.49 / Chapter 3.5 --- Specification Languages --- p.50 / Chapter CHAPTER 4 --- EXCEPTION HANDLING SPECIFICATION --- p.55 / Chapter 4.1 --- Data-Oriented Exceptions Specification --- p.55 / Chapter 4.2 --- Assertions for Exception Handling --- p.59 / Chapter 4.2.1 --- User-defined Exception Condition Assertion --- p.61 / Chapter 4.2.2 --- Fatal Condition Assertion --- p.62 / Chapter 4.2.3 --- Replacement Assertion --- p.64 / Chapter 4.2.3.1 --- Scenario 1: Immediate Replacement --- p.68 / Chapter 4.2.3.2 --- Scenario 2: Direct Dependency --- p.71 / Chapter 4.2.3.3 --- Scenario 3: Indirect Dependency --- p.72 / Chapter 4.2.3.4 --- Scenario 4: Lower Dimensionality --- p.74 / Chapter 4.2.4 --- Message Vector Assertion --- p.76 / Chapter CHAPTER 5 --- ARRAY GRAPH FOR EXCEPTION HANDLING --- p.78 / Chapter 5.1 --- Subgraph Embedding --- p.78 / Chapter 5.1.1 --- User-Defined Exception Conditions --- p.80 / Chapter 5.1.2 --- Fatal Conditions --- p.82 / Chapter 5.1.3 --- Pre-Defined Exception Conditions --- p.83 / Chapter 5.1.4 --- Replacement Assertions --- p.85 / Chapter 5.1.5 --- Message Vector Assertions --- p.89 / Chapter 5.2 --- Data Dependency Interpretation --- p.91 / Chapter 5.2.1 --- Immediate Replacement --- p.92 / Chapter 5.2.2 --- Direct Dependency --- p.92 / Chapter 5.2.3 --- Indirect Dependency --- p.93 / Chapter 5.2.4 --- Shared Data Variable --- p.99 / Chapter CHAPTER 6 --- SCHEDULING FOR EXCEPTION HANDLING --- p.104 / Chapter 6.1 --- Backward Path Tracing --- p.106 / Chapter 6.1.1 --- Forward Versus Backward Tracing --- p.106 / Chapter 6.1.2 --- Assertion-Marking Strategy --- p.113 / Chapter 6.2 --- Grain Scheduling --- p.116 / Chapter 6.2.1 --- New Constraints --- p.120 / Chapter 6.3 --- Delayed Exception Raise Event --- p.125 / Chapter 6.4 --- Enhancement of Scheduling Algorithm --- p.126 / Chapter 6.5 --- Control Flow Issues --- p.128 / Chapter 6.5.1 --- Immediate Replacement --- p.130 / Chapter 6.5.2 --- Direct Dependency --- p.131 / Chapter 6.5.3 --- Indirect Dependency --- p.132 / Chapter 6.5.4 --- Lower Dimensionality --- p.133 / Chapter CHAPTER 7 --- MORE COMPLICATED SCHEDULING --- p.135 / Chapter 7.1 --- Multiple Exception Handling Assertions --- p.137 / Chapter 7.1.1 --- Overlapped Scopes of Exception Grain --- p.138 / Chapter 7.1.2 --- Priorities in Scheduling --- p.156 / Chapter 7.2 --- Single Replacement Assertion --- p.160 / Chapter 7.2.1 --- Multiple Exception Conditions --- p.160 / Chapter 7.2.2 --- Conditional Replacement --- p.163 / Chapter 7 .3 --- Loop Optimization --- p.164 / Chapter 7.4 --- Modifications to the Scheduling Algorithm --- p.177 / Chapter 7.5 --- Implementation --- p.180 / Chapter 7.5.1 --- Syntax Checking --- p.180 / Chapter 7.5.2 --- Array Graph Construction --- p.182 / Chapter 7.5.3 --- Array Graph Analysis --- p.185 / Chapter 7.5.4 --- Generation of Schedule with Exception Handling Subgraph --- p.186 / Chapter CHAPTER 8 --- CONCLUSIONS --- p.187 / Chapter 8 .1 --- Future Work --- p.188 / APPENDIX / Chapter 1. --- Backward Tracing/Assertion Marking Strategy / REFERENCE

The way in which computers are used is important in the theory, philosophy and practice of architecture. Architects are already using computers to construct complex three dimensional geometric models of their buildings and are beginning to analyse these models using environmental and structural software, a development which raises new questions about the role of architects and engineers. This dissertation puts forward the hypothesis that architects will at times need to be actively involved in computer programming by writing or modifying software. The hypothesis is based on the assumption that the form of a building and its spatial configuration are influenced by the nature of the design process itself. If architects are to have a complete and subtle control over design and to identify their own personal aesthetic language, they must also have control over the design process including the way computer software tools are developed and used. The hypothesis is tested using the example of a ferry terminal, a building type whose function is largely dominated by passenger circulation. Even thought passengers have a very straightforward aim to reach their final destination, the rules governing the way passengers move around the building are complex and a single computer program will not be able to cover all possible aspects of such behaviour. Thus, architects must have the freedom to formulate different rules and study the effects they have on their design. This particularly applies in non-emergency situations when each individual moves inside the building according to different needs and desires. A program was written which runs in real time so that the architect can see the effect of changing the parameters that control the process. The program can be used as evaluation mechanism to study the performance of postulated design or it can be use as creative mechanism where the design may emerge out of the process in the same way that animals create paths in the woods. Either way, the general aim is to optimize the design according to criteria over which the architect, again, must have complete control.

Typescript, etc. / Digitized by Kansas Correctional Industries

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Digitized by Kansas Correctional Industries

Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.

Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search-based methods for graph drawing that are based on optimising a fitness function which is formed from a weighted sum of multiple criteria. This thesis proposes a new neighbourhood search-based method that uses a tabu search coupled with path relinking in order to optimise such fitness functions for general graph layouts with undirected straight lines. None of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimisation techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (fitness function's value) and the speed of the layout in terms of the number of the evaluated solutions required to draw a graph. We also examine the relative scalability of our method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can lay out larger graphs than the state-of-the-art neighbourhood search-based methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.

This thesis examines the concept of graduateness in computing education. Graduateness is related to efforts to articulate the outcomes of a university education. It is commonly defined as the attributes all graduates should develop by the time they graduate regardless of university attended or discipline studied (Glover, Law and Youngman 2002). This work takes a different perspective grounded in disciplinary and institutional contexts. It aims to explore how graduates make sense of their experiences studying computing within their wider learning trajectories. The research presented here uses a narrative approach. Whilst narrative methodologies are not commonly used in computing education, people construct stories both to make sense of their experiences and to integrate the "past, present, and an anticipated future" (McAdams 1985, p.120). Stories are then a particularly appropriate way of examining the sense people make of their learning experiences. This work draws on narrative interviews with graduates from the School of Computing at the University of Kent and Olin College of Engineering in the United States. It contributes a new perspective about the effect of a computing education beyond short-term outcome measures and proposes several analytic constructs that expose significant aspects in participants' learning experiences. In this, it describes themes related to students' acquisition of disciplinary knowledge and examines the evolution of their stories of learning computing over time.