Thesis (M.S.)--Miami University, Dept. of Botany, 2003. / Title from first page of PDF document. Document formatted into pages; contains v, 53 p. : ill. Includes bibliographical references (p. 24-26).

No description available.

Several of the methods of numerical taxonomy are compared and shown to be variants of a tripartite grouping procedure associated with a generalised intercluster similarity function involving ten computational parameters. Clustering by the techniques of hierarchic fusion, monothetic division and iterative relocation is obtained using different arithmetic combinations of the function parameters to both compute similarities and effect changes in cluster membership. The combinatorial solution for Ward's method is found, and the centroid sorting combinatorial solution is extended for size difference, shape difference, dispersion and dot product coefficients. It is suggested that clusters are characterised more by the choice of similarity criterion than by the choice of method, and it is demonstrated that some common criteria such as distance and the error sum of squares are inclined to force spherical 'minimum-variance' classes. These are contrasted by 'natural' classes, which correspond to closed density surfaces defined for a multi-variate sample space by the underlying probability density function. A method for mode-seeking is developed from this probabilistic model through various theoretical and experimental phases, and it is shown to perform slightly better than iterative relocation with the minimum-variance criteria using several Gaussian test populations. A fast algorithm is proposed for the solution of the Jardine-Sibson method for generating overlapping classes, and it is observed that this technique finds natural classes and is closely related to the probabilistic model. Some aspects of computational procedures are discussed, and in particular, it is proposed that a generalised system involving a statistical language, conversational mode package and program suite could be developed from a basic subroutine system. Paging and simulation techniques for the organisation of direct-access data files are suggested, and a comprehensive package of computer programs for cluster analysis is described.

The aim of this thesis was to review the current state of knowledge, occurrence and distribution of two polydorid (Polychaeta: Spionidae) genera, Polydora and Dipolydora, in estuaries of subtropical eastern Australia. The existing taxonomy of the polydorid group is confused and descriptions include many relative terms. A numerical taxonomy approach using Primer 6 was taken to identify species groups and characters. A standardized set of multivariate morphological characters was developed and resemblance analysis functions used to create species cluster groups. SIMPER (similarity percentages) analysis on the same dataset was used to identify the diagnostic characters for each of these species cluster groups and to identify new characters which could be useful in species diagnosis, particularly for frequently occurring incomplete specimens.Prior to this study 3 Polydora species and 4 Dipolydora species were recorded from subtropical eastern Australia. The present study found 12 Polydora species and 10 Dipolydora species from estuaries and bays of subtropical eastern Australia.Two Polydora species are new (Polydora sp. P1 and Polydora cf. woodwicki) and 7 are potentially new species (P. cf. latispinosa; P. cf. websteri; P. sp. P2S; P. sp. P3S; P. sp. P4S; P. sp. P5S and P. sp. P6S) having been described from single specimens. Polydora cornuta Bosc, 1902 is recorded from New South Wales for the first time. Polydora cf. calcarea is reported from mudblisters in oysters. The Australian form of Polydora hoplura Claparède, 1870 and P. haswelli Blake and Kudenov, 1978 are described more fully than in existing literature.Three Dipolydora species are new (Dipolydora sp. D1; D. cf. flava and D. sp. D2) and 4 from single specimens are potentially new (D. cf. aciculata/ cf. giardi; D. sp. D3S; D. sp. D4S and D. sp. D5S). Dipolydora tentaculata (Blake and Kudenov, 1978) and Australian forms of Dipolydora flava (Claparède, 1870) and Dipolydora socialis (Schmarda, 1861) are described more fully than in existing literature.Prior to this study one Dipolydora and no Polydora were recorded from the Tweed- Moreton bioregion. This study reports 6 species of Dipolydora and 5 species of Polydora from this bioregion.Dipolydora penicillata (Hutchings and Rainer, 1979) and Carazziella victoriensis Blake and Kudenov, 1978 are recommended for synonymy.It is recommended that Polydora ciliata (Johnston, 1838) be reinstated and Dipolydora ciliata (Johnson, 1838) removed from the Australian polychaete checklist following identification of an error in description translation.Important gaps in collections were identified for polydorids associated with oysters from estuaries over the whole subtropical region; and for polydorids from the Tweed-Moreton IMCRA bioregion.

The aim of this thesis was to review the current state of knowledge, occurrence and distribution of two polydorid (Polychaeta: Spionidae) genera, Polydora and Dipolydora, in estuaries of subtropical eastern Australia. The existing taxonomy of the polydorid group is confused and descriptions include many relative terms. A numerical taxonomy approach using Primer 6 was taken to identify species groups and characters. A standardized set of multivariate morphological characters was developed and resemblance analysis functions used to create species cluster groups. SIMPER (similarity percentages) analysis on the same dataset was used to identify the diagnostic characters for each of these species cluster groups and to identify new characters which could be useful in species diagnosis, particularly for frequently occurring incomplete specimens.Prior to this study 3 Polydora species and 4 Dipolydora species were recorded from subtropical eastern Australia. The present study found 12 Polydora species and 10 Dipolydora species from estuaries and bays of subtropical eastern Australia.Two Polydora species are new (Polydora sp. P1 and Polydora cf. woodwicki) and 7 are potentially new species (P. cf. latispinosa; P. cf. websteri; P. sp. P2S; P. sp. P3S; P. sp. P4S; P. sp. P5S and P. sp. P6S) having been described from single specimens. Polydora cornuta Bosc, 1902 is recorded from New South Wales for the first time. Polydora cf. calcarea is reported from mudblisters in oysters. The Australian form of Polydora hoplura Claparède, 1870 and P. haswelli Blake and Kudenov, 1978 are described more fully than in existing literature.Three Dipolydora species are new (Dipolydora sp. D1; D. cf. flava and D. sp. D2) and 4 from single specimens are potentially new (D. cf. aciculata/ cf. giardi; D. sp. D3S; D. sp. D4S and D. sp. D5S). Dipolydora tentaculata (Blake and Kudenov, 1978) and Australian forms of Dipolydora flava (Claparède, 1870) and Dipolydora socialis (Schmarda, 1861) are described more fully than in existing literature.Prior to this study one Dipolydora and no Polydora were recorded from the Tweed- Moreton bioregion. This study reports 6 species of Dipolydora and 5 species of Polydora from this bioregion.Dipolydora penicillata (Hutchings and Rainer, 1979) and Carazziella victoriensis Blake and Kudenov, 1978 are recommended for synonymy.It is recommended that Polydora ciliata (Johnston, 1838) be reinstated and Dipolydora ciliata (Johnson, 1838) removed from the Australian polychaete checklist following identification of an error in description translation.Important gaps in collections were identified for polydorids associated with oysters from estuaries over the whole subtropical region; and for polydorids from the Tweed-Moreton IMCRA bioregion.

Thesis (Ph. D.)--Ohio State University, 2007.

Thesis (Ph.D.)(Computer Science)--University of Pretoria, 2007. / Includes summary. Includes bibliographical references. Available on the Internet via the World Wide Web.

Graphs are mathematical abstractions that are useful for solving many types of problems in computer science. In this dissertation, when we talk of graphs we refer to directed graphs (digraphs), which consist of a set of nodes and a set of edges between the nodes, where each edge has a direction. Numerous implementations of graphs exist in computer science however, there is a need for more systematic and complete categorisation of implementations together with some proof of correctness. Completeness is an issue because other studies only tend to discuss the useful implementations and completely or partially ignore the rest. There is also a need for a treatment of graph representations using triples instead pairs as the base component. In this dissertation, a solution to each of these deficiencies is presented. This dissertation is a taxonomic approach towards a comprehensive treatment of digraph representations. The difficulty of comparing implementations with each other is overcome by a creating a taxonomy of digraph implementations. Taxonomising digraph representations requires a systematic analysis of the two main building blocks of digraphs implementations namely maps and sets. The analysis presented in the first part of the dissertation includes a definition of the abstract data types to represent maps and sets together with a comprehensive and systematic collection of algorithms and data-structures required for the implementations thereof. These algorithms are then written and re-written in a common notation and are examined for any essential com¬ponents, differences, variations and common features. Based on this analysis the maps and sets taxonomies are presented. After the completion of maps and sets implementation foundations the dissertation continues with the main contribution: a systematic collection and implementation of other operators used for the manipulation of the base triple components of digraphs and the derivation of the the final taxonomy of digraphs by integrating the maps and sets implementations with the operators on the sets of triples. With the digraph taxonomy we can finally see relationships between implementations and we also can easily establish their similarities and differences. Furthermore, the taxonomy is also useful for further discussions, analysis and visualisation of the complete implementation topography of digraph implementations. / Dissertation (MSc (Computer Science))--University of Pretoria, 2006. / Computer Science / unrestricted

In this study, current infrageneric taxonomic status of Limonium Mill. in Turkey was assessed by using numerical taxonomy (phenetics) method. Herbarium materials belong to 21 species of Limonium Mill., collected all around Turkey, and were examined. In order to evaluate the infrageneric status, 52 characters based on ecological and morphological features of the genus were determined and recorded to construct a data matrix which was analyzed by MultiVariate Statistical Package (MVSP) and Statistica software with Unweighted Pair Group Method with Arithmetic Mean (UPGMA) method to construct phenograms. Then, by assesing the phenograms, an overall comparison of Limonium Mill. species were made and infrageneric taxonomic status of the genus was discussed. The result of this study indicated that 5 sections of the genus are represented in phenograms which was a compatible result with theoretical information written in 7th Volume of &ldquo / Flora of Turkey&rdquo / . Moreover, in UPGMA trees, a new section (belonging Section Limonium) is observed. Section nova species live only near seashore and distinctively separated from other Section Limonium species in phenograms and Principle Component Analysis (PCA). PCA was carried out to indicate most important characters used in this study. In addition, in this study, a dichotomous key comprising all the species of Limonium Mill. in Turkey was also presented. In appendix part, brief information about each species such as distribution, habitat, conservation status, habit, endemism ratio, flowering period, IUCN categories was given to review all Limonium Mill. species in Turkey.

A Distributed Shared Memory(DSM) system consists of several computers that share a memory area and has no global clock. Therefore, an ordering of events in the system is necessary. Synchronization is a mechanism for coordinating activities between processes, which are program instantiations in a system.