There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph is developed in java to implement the graph algorithms in future. One of the unique features of this graph editor is that it can be used as stand-alone application or as an applet for the Web. In addition, it also provides a friendly user interface. / Department of Computer Science

With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms. / Department of Computer Science

There is an increasing demand for a computer graphics - oriented software package for graph theory teaching and research. G-Net, a department research project headed by Dr. Kunwarjit Bagga, is an effort to create a computer software that contains a graph theory database, a graph editor, and a collection of algorithms to be executed on the graphs. This thesis concentrates on the design and implementation of a graph editor - GrapliPerfect. Graphs have been widely used to model many other phenomena. In this thesis, computer generated graphics images are used to represent graphs. This modeling relation between graphs and graphics is analyzed, and its role in the design and implementation of GraphPerfect is discussed in the thesis. To enhance the friendliness of the user interface, a simplified window system is presented. / Department of Computer Science

No description available.

Least squares linear regression is a common tool in ecological research. One of the central assumptions of least squares linear regression is that the independent variable is measured without error. But this variable is measured with error whenever it is a sample mean. The significance of such contraventions is not regularly assessed in ecological studies. A simulation program was made to provide such an assessment. The program requires a hypothetical data set, and using estimates of S$ sp2$ it scatters the hypothetical data to simulate the effect of sampling error. A regression line is drawn through the scattered data, and SSE and r$ sp2$ are measured. This is repeated numerous times (e.g. 1000) to generate probability distributions for r$ sp2$ and SSE. From these distributions it is possible to assess the likelihood of the hypothetical data resulting in a given SSE or r$ sp2$. The method was applied to survey data used in a published TP-CHLa regression (Pace 1984). Beginning with a hypothetical, linear data set (r$ sp2$ = 1), simulated scatter due to sampling exceeded the SSE from the regression through the survey data about 30% of the time. Thus chances are 3 out of 10 that the level of uncertainty found in the surveyed TP-CHLa relationship would be observed if the true relationship were perfectly linear. If this is so, more precise and more comprehensive models will only be possible when better estimates of the means are available. This simulation approach should apply to all least squares regression studies that use sampled means, and should be especially relevant to studies that use log-transformed values.

This thesis treats some of the problems related to the good drawings D$ sb{ rm n}$ of the complete graph K$ sb{ rm n}$. The first of these problems is obtaining all the non-isomorphic good drawings D$ sb{ rm n}$ of K$ sb{ rm n}$. After conjecturing that any good drawing D$ sb{ rm n}$ of K$ sb{ rm n}$ has at least one crossing-free Hamiltonian Circuit, an algorithm generating all the non-isomorphic good drawings D$ sb{ rm n}$ of K$ sb{ rm n}$ is developed. The second problem, determining the existence of a rectilinear drawing D$ sb{ rm n}$ of K$ sb{ rm n}$ with a given set of crossings, is solved by finding a characteristic of the rectilinear drawings D$ sb{ rm n}$ of K$ sb{ rm n}$. An algorithm using this characteristic determines whether a given set of crossing defines a rectilinear drawing D$ sb{ rm n}$ of K$ sb{ rm n}$. The last problem, to generate all the non-isomorphic rectilinear drawings D$ sb{ rm n}$ of K$ sb{ rm n}$, is solved by an algorithm using a set of rectilinear drawings D$ sb{ rm n-1}$ of K$ sb{ rm n-1}$.

Location-based service (LBS) is a geographical location-related service that provides highly personalized services for users. It is a platform for network operators to provide new and innovative ways of increasing profits from new services. With the rapidly growing trend toward LBS, there is a need for standard LBS protocols. This thesis started with introducing the Internet Engineering Task Force GEOPRIV working group, which endeavors to provide standard LBS protocols capable of transferring geographic location information for diverse location-aware applications. Through careful observation, it was found that Session Initiation Protocol (SIP) is well suited to the GEOPRIV requirements. The aim of this research was therefore to explore the possibility of the integration of LBS and the SIP protocol and, to some extent fulfill the GEOPRIV requirements.

Thesis (Ph. D.)--University of Adelaide, 1985. / Includes bibliographical references (leaves [238]-244).

Thesis (Ph. D.)--School of Nursing. University of Missouri--Kansas City, 2006. / "A dissertation in nursing." Advisor: Peggy Ward-Smith. Typescript. Vita. Description based on contents viewed Nov. 13, 2007; title from "catalog record" of the print edition. Includes bibliographical references (leaves 103-119). Online version of the print edition.

Thesis (M.S.)--University of Texas at El Paso, 2008. / Title from title screen. Vita. CD-ROM. Includes bibliographical references. Also available online.