Investigations into phosphorus removal by constructed wetlands : root bed media modifications /

A study has been conducted focusing on how the phosphorus renrx)val efficiency of a constructed wetland (CW) can be optimized through the selective enrichment of the substratum. Activated alumina and powdered iron were examined as possible enrichment compounds. Using packed glass column trials it was found that alumina was not suitable for the renx)val of ortho-phosphate from solution, while mixtures of powdered iron and quartz sand proved to be very efficient. The evaluation of iron/sand mixtures in CWs planted with cattails was performed in three stages; first using an indoor lab scale wetland, then an outdoor lab scale wetland, and finally in a small scale pilot project. For the lab scale tests, three basic configurations were evaluated: using the iron/sand as a pre-filter, in the root bed. and as a post filter. Primary lagoon effluent was applied to the test cells to simulate actual CW conditions, and the total phosphorus and iron concentrations of the influent and effluent were nfK)nitored. The pilot scale trials were limited to using only a post filter design, due to in-progress research at the pilot site. The lab scale tests achieved average renrK>val efficiencies greater than 91% for all indoor configurations, and greater than 97% for all outdoor configurations. The pilot scale tests had an average renK)val efficiency of 60%. This relatively low efficiency in the pilot scale can be attributed to the post filters being only one tenth the size of the lab scale test in terms of hydraulic loading (6 cm/day vs. 60 cm/day).

Geological image processing of petrographic thin sections using the rotating polarizer stage

One of the fundamental problems with image processing of petrographic thin sections is that the appearance (colour I intensity) of a mineral grain will vary with the orientation of the crystal lattice to the preferred direction of the polarizing filters on a petrographic microscope. This makes it very difficult to determine grain boundaries, grain orientation and mineral species from a single captured image. To overcome this problem, the Rotating Polarizer Stage was used to replace the fixed polarizer and analyzer on a standard petrographic microscope. The Rotating Polarizer Stage rotates the polarizers while the thin section remains stationary, allowing for better data gathering possibilities. Instead of capturing a single image of a thin section, six composite data sets are created by rotating the polarizers through 900 (or 1800 if quartz c-axes measurements need to be taken) in both plane and cross polarized light. The composite data sets can be viewed as separate images and consist of the average intensity image, the maximum intensity image, the minimum intensity image, the maximum position image, the minimum position image and the gradient image. The overall strategy used by the image processing system is to gather the composite data sets, determine the grain boundaries using the gradient image, classify the different mineral species present using the minimum and maximum intensity images and then perform measurements of grain shape and, where possible, partial crystallographic orientation using the maximum intensity and maximum position images.

Histogram filtering as a tool in variational Monte Carlo optimization

Optimization of wave functions in quantum Monte Carlo is a difficult task because the statistical uncertainty inherent to the technique makes the absolute determination of the global minimum difficult. To optimize these wave functions we generate a large number of possible minima using many independently generated Monte Carlo ensembles and perform a conjugate gradient optimization. Then we construct histograms of the resulting nominally optimal parameter sets and "filter" them to identify which parameter sets "go together" to generate a local minimum. We follow with correlated-sampling verification runs to find the global minimum. We illustrate this technique for variance and variational energy optimization for a variety of wave functions for small systellls. For such optimized wave functions we calculate the variational energy and variance as well as various non-differential properties. The optimizations are either on par with or superior to determinations in the literature. Furthermore, we show that this technique is sufficiently robust that for molecules one may determine the optimal geometry at tIle same time as one optimizes the variational energy.

Lighting recommendations for the Ryan Electric Scintillator and Fireworks Program for the official dedication Niagara Falls illumination, 1925

Walter D’Arcy Ryan was born in 1870 in Kentville, Nova Scotia. He became the chief of the department of illumination at the General Electric Company of Schenectady, New York. He was a founder in the field of electrical illumination. He built the electric steam scintillator which had numerous nozzles and valves. The operator would release steam through the valves. The nozzles all had names which included: Niagara, fan, snake, plume, column, pinwheel and sunburst. The steam scintillator was combined with projectors, prismatic reflectors, flashers and filters to produce the desired effects. In 1920 a group of businessmen from Niagara Falls, New York formed a group who called themselves the “generators’. They lobbied the American and Canadian governments to improve the illumination of the Falls. They were able to raise $58, 000 for the purchase and installation of 24 arc lights to illuminate the Falls. On February 24th, 1925 the Niagara Falls Illumination Board was formed. Initially, the board had a budget of $28,000 for management, operation and maintenance of the lights. The power was supplied free by the Ontario Power Company. They had 24 lights installed in a row on the Ontario Power Company surge tank which was next to the Refectory in Victoria Park on the Canadian side. The official opening ceremony took place on June 8th, 1925 and included a light parade in Niagara Falls, New York and an international ceremony held in the middle of the Upper Steel Arch Bridge. Walter D’Arcy Ryan was the illuminating engineer and A.D. Dickerson who was his New York field assistant directed the scintillator. with information from American Technological Sublime by David E. Nye and the Niagara Falls info website Location: Brock University Archives Source Information: Subject Headings: Added Entries: 100 Ryan, W. D’A. |q (Walter D’Arcy), |d 1870-1934 610 General Electric Company 650 Lighting, Architectural and decorative 650 Lighting |z New York (State) |z Niagara Falls 700 Dickerson, A.F. 700 Schaffer, J.W. Related material held at other repositories: The Niagara Falls Museum in Niagara Falls, Ontario has a program (pamphlet) dedicating new lighting in 1958 and it has postcards depicting the illumination of the Falls. Some of Ryan’s accomplishments can be seen at The Virtual Museum of the City of San Francisco. Described by: Anne Adams Date: Sept 26,Upper Steel Arch Bridge. Walter D’Arcy Ryan was the illuminating engineer and A.D. Dickerson who was his New York field assistant directed the scintillator. with information from American Technological Sublime by David E. Nye and the Niagara Falls info website

Genetic Programming for Non-Photorealistic Rendering

This thesis focuses on developing an evolutionary art system using genetic programming. The main goal is to produce new forms of evolutionary art that filter existing images into new non-photorealistic (NPR) styles, by obtaining images that look like traditional media such as watercolor or pencil, as well as brand new effects. The approach permits GP to generate creative forms of NPR results. The GP language is extended with different techniques and methods inspired from NPR research such as colour mixing expressions, image processing filters and painting algorithm. Colour mixing is a major new contribution, as it enables many familiar and innovative NPR effects to arise. Another major innovation is that many GP functions process the canvas (rendered image), while is dynamically changing. Automatic fitness scoring uses aesthetic evaluation models and statistical analysis, and multi-objective fitness evaluation is used. Results showed a variety of NPR effects, as well as new, creative possibilities.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.