Physical Sciences and Mathematics Commons^™

Distances Associated With Subgraphs And Subdigraphs, Steven John Winters

Dissertations

The defining properties of several important subgraphs and subdigraphs rely on the concept of distance in graphs and digraphs. In this dissertation, we investigate many of these subgraphs and subdigraphs.

In Chapter I, we present some preliminary definitions and examples. In addition, many known results are recalled. We then introduce several new induced subgraphs and subdigraphs.

In Chapter n, we investigate the general structure of the center and periphery of a graph. We introduce two new induced subgraphs of the center along with a new induced subgraph of the periphery of a graph in order to study these structures.

For …

Algorithms For Generation Of Path-Methods In Object-Oriented Databases, Ashish Mehta

Dissertations

A path-method is a mechanism in object-oriented databases (OODBs) to retrieve or to update information relevant to one class that is not stored with that class but with some other class. A path-method is a method which traverses from one class through a chain of connections between classes to access information at another class. However, it is a difficult task for a user to write path-methods, because it might require comprehensive knowledge of many classes of the conceptual schema, while a typical user has often incomplete or even inconsistent knowledge of the schema.

This dissertation proposes an approach to the …

Dmodel And Dalgebra : A Data Model And Algebra For Office Documents, Fortune Solani Mhlanga

Dissertations

This dissertation presents a data model (called D_model) and an algebra (called D_ algebra) for office documents. The data model adopts a very natural view of modeling office documents. Documents are grouped into classes; each class is characterized by a "frame template", which describes the properties (or attributes) for the class of documents. A frame template is instantiated by providing it with values to form a "frame instance" which becomes the synopsis of the document of the class associated with the frame template. Different frame instances can be grouped into a folder. Therefore, a folder is a set of frame …

Megsdf Mega-System Development Framework, Tamar Zemel

Dissertations

A framework for developing large, complex software systems, called Mega-Systems, is specified. The framework incorporates engineering, managerial, and technological aspects of development, concentrating on an engineering process. MegSDF proposes developing Mega-Systems as open distributed systems, pre-planned to be integrated with other systems, and designed for change.

At the management level, MegSDF divides the development of a Mega-System into multiple coordinated projects, distinguishing between a meta-management for the whole development effort, responsible for long-term, global objectives, and local managements for the smaller projects, responsible for local, temporary objectives.

At the engineering level, MegSDF defines a process model which specifies the tasks …

Robust Rank-Based Inference Procedures In The Heteroscedastic Linear Model, Sherry L. Dixon

Dissertations

No abstract provided.

The Interaction Of Sickle Hemoglobin With Phosphatidylserine Vesicles ; Fourier Transform Infrared Spectroscopic Studies Of Human Erythrocyte Spectrin, Cynthia C. Labrake

Dissertations

No abstract provided.

Polynuclear Mixed-Valence Complexes, David A. Rockcliffe

Dissertations

No abstract provided.

A Facile Route To Allylic Phosphonates Via Base-Catalyzed Isomerization Of The Corresponding Vinyl Phosphonates : Remote Dianions In Synthesis, Synthetic Approaches To The Indolizidines, James J. Kiddle

Dissertations

No abstract provided.

Effect Of Solvent On 1,3-Dipolar Cycloaddition Transition States, Sheila Louise Celsor

Dissertations

No abstract provided.

Multivariate Quadrature On Mimd Machines With Shared Or Distributed Memory, Ignatios E. Vakalis

Dissertations

For a procedure as numerical integration, of high computational expense which is used extensively in large-scale computations, it is natural to aim at the design of algorithms which can be used on parallel computes. This work deeds with the design of efficient and portable parallel algorithms on MIMD (Multiple Instruction Multiple Data) architectures with shared memory, and on distributed memory systems.

A parallel global adaptive algorithm is presented for multivariate integration over simplex type regions. Process synchronization is achieved through the use of monitors. Macros were developed, for managing the task pool with a heap data structure. Layered over the …

A Critical Examination Of The Use Of Preliminary Tests In Two-Sample Tests Of Location, Kimberly Tucker Perry

Dissertations

The purpose of this dissertation was to explore the appropriateness of testing the equality of two means using either a t test, the Welch test, or the Mann-Whitney-Wilcoxon test for two independent samples based on the results of using two classes of preliminary tests. One class of preliminary tests determines whether the population variances differ, and the other class ascertains if the underlying distributions are symmetric or skewed. The F-ratio test and the Levene test (using the median) were compared as preliminary tests for variance homogeneity; and the DAgostino Sy and the Triples tests were also compared as preliminary tests …

Computational Neural Networks In Chemistry: Model Free Mapping Devices For Predicting Chemical Reactivity From Molecular Structure, David Wayne Elrod

Dissertations

Computational neural networks (CNNs) are a computational paradigm inspired by the brain’s massively parallel network of highly interconnected neurons. The power of computational neural networks derives not so much from their ability to model the brain as from their ability to learn by example and to map highly complex, nonlinear functions, without the need to explicitly specify the functional relationship. Two central questions about CNNs were investigated in the context of predicting chemical reactions: (1) the mapping properties of neural networks and (2) the representation of chemical information for use in CNNs.

Chemical reactivity is here considered an example of …

Maximal And Maximum Independent Sets In Graphs, Jiuqiang Liu

Dissertations

A maximal independent set of a graph G is an independent set which is not contained properly in any other independent set of G. An independent set is called maximum if it is of largest cardinality. Denote i(G) to be the number of maximal independent sets of G. These special sets and the parameter i(G) have interested many researchers leading to a number of properties and results. One of these is the determination of the maximum number of maximal independent sets among all graphs of order n, and the external graphs. In this investigation,we develop new properties for …

Common Moment Sets Of Complementary Graphs, Hang Chen

Dissertations

Two sequences of nonnegative integers have the k^th common moment if they have equal sums of k^th powers. We intend to study common moment sets of the degree sequences of complementary graphs, and similarly, of the score sequences of complementary tournaments.

In Chapter I, we first study common moment sets of arbitrary sequences of nonnegative integers. Some basic concepts are introduced. The relations between characteristic functions and initial common moments are discovered. We extend Hua’s discussion of the Tarry-Escott problem. We conclude that any finite subset of nonnegative integers can be a common moment set of some sequences, and conversely, …

A Progressive Disease Model For Doubly-Censred Bivariate Survival Data That Accommodates Covariate Information, Hilmi F. Yahya

Dissertations

A model for the natural history of a progressive disease is developed. The model has three disease states and can be expressed as the joint distribution of two survival random variables.

Covariate information is incorporated into the model using the proportional hazards model for the marginal distributions. The model will also accommodate data with observations which are censored on one or both of the survival random variables.

The likelihood function for censored data is exhibited for finding the maximum likelihood estimates of the parameters and their standard errors for testing the effects of the covariates. The method used to obtain …

Multinuclear Magnetic Resonance Study Of Chlorine And Cesium Ion Distribution In Human Erythrocyte Suspensions, Lisa Wittenkeller

Dissertations

No abstract provided.

Spin Label Studies Of Radical Reduction In Normal And Sickle Erythrocyte Membranes Associated With Antioxidants, Yin Zhang

Dissertations

No abstract provided.

Study Of The Hexamethylenetetramine, Ammonia, And Formaldehyde System: Quantitative Determinations, Gary Lee Madsen

Dissertations

No abstract provided.

Low Temperature Spectroscopic And Annealing Studies Of Disordered Organic Solids, Dwayne L. Labrake

Dissertations

No abstract provided.

Palladium(Ii) Catalysis, Glenn Noronha

Dissertations

No abstract provided.

Remote Dianions In The Synthesis Of Indolizidine Alkaloids, Diana L. C. Green Green

Dissertations

No abstract provided.

Lithium Transport, Mg2+ Competition, And Phospholipid Composition In Human Erythrocytes: A Multinuclear Magnetic Resonance Study, Aida Abraha

Dissertations

No abstract provided.

Syntheses Of Azure-B Neuropeptide Conjugates And A Novel Bicyclic Triene, Milind D. Choubal

Dissertations

No abstract provided.

Transformations Of Graphs And Digraphs, Elzbieta B. Jarrett

Dissertations

Some distances defined on graphs depend on transforming one graph into another. Two of these transformations are edge rotation and edge slide. In this dissertation, extensions and generalizations of these transformations are investigated.

Chapter I begins with some preliminary definitions and known results. Then two types of digraph transformations are introduced and their properties are studied.

Some measures of distance between graphs and distance between digraphs are defined in Chapter II. Also distance graphs and digraphs associated with these measures are introduced. Several known results concerning this topic are generalized and new results are presented.

Chapter III is devoted to …

A Representation Of Chemical Reactions By Labeled Graphs, Héctor Hevia

Dissertations

Graphs can be used to represent the atomic structure of chemical compounds where the vertices of the graph represent the individual atoms and the edges of the graph represent the valence bonds between a pair of atoms. M. A. Johnson (1991) introduced a graph-theoretic way to represent structural changes in chemical compounds. Thus, certain labelings of graphs called transitional labelings can be thought as representing chemical equations. Associated with these labelings, we introduce a new invariant of a graph G called the transitional value of G. The transitional value of a graph G gives an indication of how dramatic a …

Surgical Techniques For Constructing Minimal Orientable Imbeddings Of Joins And Compositions Of Graphs, David L. Craft

Dissertations

The various cases within the proof of the Heawood Map-Coloring Theorem, which established the genus of the complete graphs, utilized various techniques--some for the first time. This activity spurred interest in determining the genus of various other classes of graphs. However, very few generally applicable techniques have been developed, beyond those used in the proof of this famous theorem. Finding genera of arbitrary graphs remains a very difficult problem.

In this dissertation, we describe two surgical techniques for imbedding graphs. The first construction, called a graphical surface,views an orientable surface as a fattened graph, i.e., vertices become spheres and edges …

Dynamic And Spectroscopic Studies Of Triplet State Nitrogen, Scott M. Hurst

Dissertations

No abstract provided.

Intracellular Degradation Of Ribosomes In A Mesophilic And A Thermophilic Species Of Bacillus, Joe William Davis

Dissertations

The rates of intracellular degradation of ribosomal proteins were compared in a mesophilic and a thermophilic species of Bacillus. Cells were grown under various incubation conditions in the presence of a 14^C-protein hydrolysate m order to label the ribosomes. Rates of ribosome degradation were evaluated in terms of changes in the specific activity of in vivo ribosomes as a function of incubation time. The results indicated that, under most conditions, ribosomes were degraded (in vivo) at similar rates in both the mesophile and the thermophile. In some studies, ribosome degradation rates were slightly faster for the thermophile than for the …

Improving Networks Reliability, Jamal H. Nouh

Dissertations

No abstract provided.

Shape Preserving Piecewise Cubic Interpolation, Thomas Bradford Sprague

Dissertations

No abstract provided.