Sedimentology and taphonomy of storm-generated shell beds from the Verulam formation (Ordovician), Lakefield and Gamebridge quarries, Southern Ontario, Canada /

The Verulam Formation (Middle Ordovician) at the Lakefield Quarry and Gamebridge Quarry, southern Ontario, is comprised of five main lithofacies. These include shoal deposits consisting of Lithofacies 1, winnowed crinoidal grainstones and, shelf deposits consisting of: Lithofacies 2, wackestones, packstones, grainstones, and rudstones; Lithofacies 3, laminated calcisiltites; Lithofacies 4, nodular wackestones and mudstones; and, Lithofacies 5, laminated mudstones and shales. The distribution of the lithofacies was influenced by variations in storm frequency and intensity during a relative sea level fall. Predominant convex-up attitudes of concavo-convex shells within shell beds suggest syndepositional reworking during storm events. The bimodal orientations of shell axes on the upper surfaces of the shell beds indicates deposition under wave-generated currents. The sedimentary features and shell orientations indicate that the shell beds were deposited during storm events and not by the gradual accumulation of shelly material. Cluster and principal component analysis of relative abundance data of the taxa in the shell beds, interbedded nodular wackestones and mudstones, and laminated mudstones and shales, indicates one biofacies comprised of three main assemblages: a strophomenid (Sowerbyelladominated) assemblage, a transitional mixed strophomenid-atrypid assemblage and an atrypid (Zygospira-dominatQd) assemblage. The occurrence of the strophomenid, the strophomenid-atrypid and atrypid assemblages were controlled by storm-driven allogenic taphonomic feedback.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

The von Neumann Minimax Theorem and its relatives and a study of externality in on-line auctions

This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships with fundamental theorems of convex analysis. The second part is about externality in sponsored search auctions. It shows that in these auctions, advertisers have externality effects on each other which influence their bidding behavior. It proposes Hal R.Varian model and shows how adding externality to this model will affect its properties. In order to have a better understanding of the interaction among advertisers in on-line auctions, it studies the structure of the Google advertisements networ.k and shows that it is a small-world scale-free network.