No description available.

The problem of correlating unit hydrograph features to topographic and man-made basin characteristics received attention in this report. The unit graph features considered herein were the peak discharge and the time lag of basin response. In order to facilitate the desired regression analysis, the two-parameter gamma model proposed by Edson was utilized in the investigation. The parameters of the model were obtained by the simultaneous solution of the equations for unit graph peak and lag using observed unit hydrographs for 16 basins in the Piedmont region of North Carolina and 14 basins located in Northern Virginia. In the opinion of many, these parameters are a better measure of the complex relationship which exists between the runoff from a basin and the topographic features of that basin than are the values of the unit graph peak and lag time themselves. The basin characteristics utilized in the investigation were: basin area, length of the longest streamcourse in the basin, average stream slope between points 10 percent and 85 percent downstream of the headwaters, and the percent of the impervious area contained in the basin. This last factor served as a measure of the amount of urban development present in the watershed. The investigation was hampered by a regrettable lack of sufficient data to derive regression equations of good reliability. This fact was due to the reduction of the data into groups by narrow geographical ranges. Thus, the number of stations available for analysis in anyone group was insufficient for purposes of a reliable regression analysis. From the investigation, it appears that the most significant basin characteristics affecting runoff are length, slope, and urban development. The strongest regression equations were derived using those three characteristics. It appears that the length and slope factors give better results when combined in the form (L/√S). / Master of Science

Graphical user interfaces (GUIs) are defining what the interface to a program should look like. Unfortunately for programmers who need to use three-dimensional graphics found in environments like PHIGS, there is no convenient way the to use the features found in existing GUI's. This thesis describes the implementation of an interface framework running totally under PHIGS. The framework is designed using object-oriented principles and is coded in C++. The tools provided by the interface emulate the look and feel of the objects found in Motif. The interface is designed in such a way that new objects (such as windows and menu items) can be added in the future without modification to existing code. This flexibility allows programmers to specialize interfaces for their programs while maintaining complete compatibility with the base code. This also allows the framework to emulate other GUIs (such as OS/2 or Macintosh) in addition to Motif. The interface software is therefore referred to as an interface framework rather than a tool kit. The windows and menu items provided in this implementation are samples of the objects that can be created with the framework. / Master of Science

The purpose of this study was to investigate the interpretation of numerical data when presented in four different graphic formats to different age groups and sexes. Fifth and sixth grade students (N=129) and eleventh and twelfth grade students (N=129) were assigned to four treatment groups. Each group viewed a different treatment slide with the same data displayed in one of four formats: table, line, Iine·tabIe, or bar. After a narrative introduction, the students, while viewing the treatment graph, were asked to answer three types of questions: specific amount, static, and dynamic comparison. The students were then asked to continue viewing the graph for one full minute. After the minute elapsed, the projector was turned off and the students were asked to answer questions concerning the data presented on the graph. A 4 (Graph Type) X 2 (Age) X 2 (Gender) multivariate analysis of l variance (MANOVA) with repeated measures for the four types of questions was implemented to determine the relations among graph type, age, gender, and four types of questions. The independent variables were type of graph (between), age (between), gender (between), and type of question (within). The dependent variable was the interpretation of quantitative information as measured by the test questions. The findings indicated that graphic format, age, and gender did affect the ability to interpret numerical data. The analysis demonstrated several statistically significant interaction effects: age and type of questions, graph and type of questions, and graph, age and type of questions. High-school students scored higher than elementary-school children on all four questions. Table graphs were effective for answering amount and static questions. As the questions became more complex, such as in a dynamic question, the table graph was one of the least effective means of graphic communication. For recall, the line-table format and line format were the most effective graphs. Age and gender differences emerged for particular graphs. Findings were discussed with regard to cognitive development implications. / Ed. D.

No description available.

Thesis (M. Tech.) - Central University of Technology, Free State, 2009 / The aim of health communication campaigns and visual communication material (VCM) is to positively influence audience health behaviour and attitude. VCM has been used in this respect effectively as a vehicle to convey information about HIV/AIDS over the past three decades. It has been used to promote health knowledge and awareness in order to reduce the transmission of the virus. The aim of this study was to determine the efficacy of graphic imagery in HIV/AIDS VCM. To realise this aim, the researcher set the following objectives: * To review relevant literature in order to isolate key features and process those that communicators must consider/follow when developing HIV/AIDS VCM; * To determine the comprehension of selected outdoor HIV/AIDS messages, the graphics used in these messages, illustration preferences, and an evaluation of the self-efficacy of selected loveLife outdoor visual messages; and * To propose a model that communicators can use as a guideline when developing VCM. The outcome of the review suggests a compilation of features, design guidelines and variables that may contribute to the effectiveness of VCM. The results of the empirical study indicate that suitable graphic imagery fosters message comprehension, while inappropriate imagery inhibits comprehension, and realistic and appropriate imagery is preferred to abstract and representational imagery. Familiar images can contribute towards improved comprehension of HIV/AIDS messages. These findings also gave birth to the proposed ‘O’ communication model, which is a reflection of the results of the empirical study.

The closed neighbourhood of a vertex in a graph is the vertex together with the set of adjacent vertices. A di®erentiating-dominating set, or identifying code, is a collection of vertices whose intersection with the closed neighbour- hoods of each vertex is distinct and nonempty. A di®erentiating-dominating set in a graph serves to uniquely identify all the vertices in the graph. Chapter 1 begins with the necessary de¯nitions and background results and provides motivation for the following chapters. Chapter 1 includes a summary of the lower identi¯cation parameters, °L and °d. Chapter 2 de- ¯nes co-distinguishable graphs and determines bounds on the number of edges in graphs which are distinguishable and co-distinguishable while Chap- ter 3 describes the maximum number of vertices needed in order to identify vertices in a graph, and includes some Nordhaus-Gaddum type results for the sum and product of the di®erentiating-domination number of a graph and its complement. Chapter 4 explores criticality, in which any minor modi¯cation in the edge or vertex set of a graph causes the di®erentiating-domination number to change. Chapter 5 extends the identi¯cation parameters to allow for orientations of the graphs in question and considers the question of when adding orientation helps reduce the value of the identi¯cation parameter. We conclude with a survey of complexity results in Chapter 6 and a collection of interesting new research directions in Chapter 7. / Mathematical Sciences / PhD (Mathematics)

Objects can be said to be structured when their representation also contains their parts. While OWL in general can describe structured objects, description graphs are a recent, decidable extension to OWL which support the description of classes of structured objects whose parts are related in complex ways. Classes of chemical entities such as molecules, ions and groups (parts of molecules) are often characterised by the way in which the constituent atoms of their instances are connected via chemical bonds. For chemoinformatics tools and applications, this internal structure is represented using chemical graphs. We here present a chemical knowledge base based on the standard chemical graph model using description graphs, OWL and rules. We include in our ontology chemical classes, groups, and molecules, together with their structures encoded as description graphs. We show how role-safe rules can be used to determine parthood between groups and molecules based on the graph structures and to determine basic chemical properties. Finally, we investigate the scalability of the technology used through the development of an automatic utility to convert standard chemical graphs into description graphs, and converting a large number of diverse graphs obtained from a publicly available chemical database. / Computer Science (School of Computing) / M. Sc. (Computer Science)

The lower and upper independent, domination and irredundant numbers of the graph G = (V, E) are denoted by i ( G) , f3 ( G), 'Y ( G), r ( G), ir ( G) and IR ( G) respectively. These six numbers are called the domination parameters. For each of these parameters n:, we define six types of criticality. The graph G is n:-critical (n:+ -critical) if the removal of any vertex of G causes n: (G) to decrease (increase), G is n:-edge-critical (n:+-edge-critical) if the addition of any missing edge causes n: (G) to decrease (increase), and G is Ir-ER-critical (n:- -ER-critical) if the removal of any edge causes n: (G) to increase (decrease). For all the above-mentioned parameters n: there exist graphs which are n:-critical, n:-edge-critical and n:-ER-critical. However, there do not exist any n:+-critical graphs for n: E {ir,"f,i,/3,IR}, no n:+-edge-critical graphs for n: E {ir,"f,i,/3} and non:--ER-critical graphs for: E {'Y,/3,r,IR}. Graphs which are "I-critical, i-critical, "I-edge-critical and i-edge-critical are well studied in the literature. In this thesis we explore the remaining types of criticality. We commence with the determination of the domination parameters of some wellknown classes of graphs. Each class of graphs we consider will turn out to contain a subclass consisting of graphs that are critical according to one or more of the definitions above. We present characterisations of "I-critical, i-critical, "I-edge-critical and i-edge-critical graphs, as well as ofn:-ER-critical graphs for n: E {/3,r,IR}. These characterisations are useful in deciding which graphs in a specific class are critical. Our main results concern n:-critical and n:-edge-critical graphs for n: E {/3, r, IR}. We show that the only /3-critical graphs are the edgeless graphs and that a graph is IRcritical if and only if it is r-critical, and proceed to investigate the r-critical graphs which are not /3-critical. We characterise /3-edge-critical and r-edge-critical graphs and show that the classes of IR-edge-critical and r-edge-critical graphs coincide. We also exhibit classes of r+ -critical, r+ -edge-critical and i- -ER-critical graphs. / Mathematical Sciences / D. Phil. (Mathematics)

G-Net system is being developed by the members of the G-Net research group under the supervision of Dr. K. Jay Bagga. The principle objective of the G-Net system is to provide an integrated tool for dealing with various aspects of graph theory. G-Net system is divided into two parts. GETS (Graph theory Experiments Tool Set) will provide a set of tools to experiment with graph theory, and HYGRES (HYpertext Graph theory Reference Service), the second subcomponent of the G-Net system to aid graph theory study and research. In this research a hypertext application is built to present the graph theory concepts, graph models and the algorithms. In other words, HYGRES (Guide Version) provides the hypertext facilities for organizing a graph theory database in a very natural and interactive way. An hypertext application development tool, called Guide, is used to implement this version of HYGRES. This project integrates the existing version of GETS so that it can also provide important services to HYGRES. The motivation behind this project is to study the initial criterion for developing a hypertext system, which can be used for future development of a stand alone version of the G-Net system. / Department of Computer Science