A multi-capability sensor for hydrocarbons, synthetic-based fluids and heavy metals:Applications for environmental monitoring during removal of drill cuttings piles

As part of any drilling cuttings pile removal process the requirement for monitoring the release of contaminants into the marine environment will be critical. Traditional methods for such monitoring involve taking samples for laboratory analysis. This process is time consuming and only provides data on spot samples taken from a limited number of locations and time frames. Such processes, therefore, offer very restricted information. The need for improved marine sensors for monitoring contaminants is established. We report here the development and application of a multi-capability optical sensor for the real-time in situ monitoring of three key marine environmental and offshore/oil parameters: hydrocarbons, synthetic-based fluids and heavy metal concentrations. The use of these sensors will be a useful tool for real-time in situ environmental monitoring during the process of decommissioning offshore structures. Multi-capability array sensors could also provide information on the dispersion of contamination from drill cuttings piles either while they are in situ or during their removal.

Maxwell perturbations on asymptotically Anti-de-Sitter spacetimes: generic boundary conditions and a new branch of quasinormal modes

Perturbations of asymptotically Anti-de-Sitter (AdS) spacetimes are often considered by imposing field vanishing boundary conditions (BCs) at the AdS boundary. Such BCs, of Dirichlet-type, imply a vanishing energy flux at the boundary, but the converse is, generically, not true. Regarding AdS as a gravitational box, we consider vanishing energy flux (VEF) BCs as a more fundamental physical requirement and we show that these BCs can lead to a new branch of modes. As a concrete example, we consider Maxwell perturbations on Kerr-AdS black holes in the Teukolsky formalism, but our formulation applies also for other spin fields. Imposing VEF BCs, we find a set of two Robin BCs, even for Schwarzschild-AdS black holes. The Robin BCs on the Teukolsky variables can be used to study quasinormal modes, superradiant instabilities and vector clouds. As a first application, we consider here the quasinormal modes of Schwarzschild-AdS black holes. We find that one of the Robin BCs yields the quasinormal spectrum reported in the literature, while the other one unveils a new branch for the quasinormal spectrum.

Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers

Discrete optimization problems are very difficult to solve, even if the dimention is small. For most of them the problem of finding an ε-approximate solution is already NP-hard. The branch-and-bound algorithms are the most used algorithms for solving exactly this sort of problems.

A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers

Discrete optimization problems are very difficult to solve, even if the dimantion is small. For most of them the problem of finding an ε-approximate solution is already NP-hard.

Colonel John Butler (Niagara)/St. Catharines District Branch of the United Empire Loyalists fonds

United Empire Loyalist is an honour given to American Loyalists who came to British North America and the British Colonies to show their loyalty to King George III after the British defeat in the American Revolution. The Loyalists settled in Quebec, Ontario, Nova Scotia and modern day New Brunswick. The Colonel John Butler (Niagara) Branch (formerly the St. Catharines and District Branch) has origins which date as far back as 1898. A branch was organized in Virgil by Captain John D. Servos, but was unsuccessful. In 1905 there was another attempt to form a branch, but the war of 1914-1918 resulted in this branch becoming inactive. In 1914, an Act of Parliament incorporated the United Empire Loyalists’ Association of Canada. The St. Catharines and District Branch was formed in 1921. This branch remained active, and in 1992 they changed their name to The Colonel John Butler (Niagara) Branch. The Loyalists also have a strong focus on genealogy. All descendants are eligible to use UE (which stands for Unity of the Empire) after their names. source: http://www.coljohnbutleruel.com

Retired Women Teachers of Ontario—St. Catharines branch fonds, 1970-2013.

The Retired Women Teachers of Ontario (RWTO) was founded in Toronto by a small group of retired women teachers known as the Rendezvous Club. This group brought together several branches in 1956 to form the Ontario Association of Superannuated Teachers (OAWST), which was changed to the RWTO in 1999. The group was initially formed in order to provide retired women teachers with the same pension that was received by their male colleagues. The group came to the realization that they would have a better chance of success if they had a larger group of supporters. As a result, new branches were formed throughout Ontario. In 1967, the government concurred that the pension should be raised, and the minimum pension level was increased to $1200 a year. The following year the Retired Teachers of Ontario was formed, representing both male and female retired teachers. This new group was now responsible for communicating and negotiating with the government concerning pension matters. However, the RWTO continued to exist with a focus on the special interests and well-being of retired women teachers. There are currently 53 branches throughout Ontario.

Memoranda booklet (soft cover) compliments of the Canadian Bank of Commerce, St. Catharines Branch

Memoranda booklet (soft cover) compliments of the Canadian Bank of Commerce, St. Catharines Branch. Only one page has writing on it. It appears to be a shopping list, n.d.

Certificate from the Accounts Branch of Crown Lands, Ontario

Certificate from the Accounts Branch of Crown Lands, Ontario in receipt of $72 for renewal of license made out to S.D. Woodruff and signed by Thomas H. Johnson, Assistant Commissioner, May 23, 1881.

List (4 pages, handwritten) of titles on the Sarnia Branch subject to mortgages

List (4 pages, handwritten) of titles on the Sarnia Branch subject to mortgages, n.d.

List (1 page, handwritten) of Sarnia Branch for which no abstract of the title has been furnished

List (1 page, handwritten) of Sarnia Branch for which no abstract of the title has been furnished. This was signed by H. [illegible] in 1839 and a note was added to this list on Nov. 15, 1859.

List (1 page, handwritten) of taxes paid for lands on the Sarnia Branch

List (1 page, handwritten) of taxes paid for lands on the Sarnia Branch, n.d.

Heterotachy and long-branch attraction in phylogenetics

Affiliation: Département de Biochimie, Faculté de médecine, Université de Montréal

Suppression of long-branch attraction artefacts in the animal phylogeny using a site-heterogeneous model

Affiliation: Département de Biochimie, Université de Montréal

Développement d’un algorithme de branch-and-price-and-cut pour le problème de conception de réseau avec coûts fixes et capacités

De nombreux problèmes en transport et en logistique peuvent être formulés comme des modèles de conception de réseau. Ils requièrent généralement de transporter des produits, des passagers ou encore des données dans un réseau afin de satisfaire une certaine demande tout en minimisant les coûts. Dans ce mémoire, nous nous intéressons au problème de conception de réseau avec coûts fixes et capacités. Ce problème consiste à ouvrir un sous-ensemble des liens dans un réseau afin de satisfaire la demande, tout en respectant les contraintes de capacités sur les liens. L'objectif est de minimiser les coûts fixes associés à l'ouverture des liens et les coûts de transport des produits. Nous présentons une méthode exacte pour résoudre ce problème basée sur des techniques utilisées en programmation linéaire en nombres entiers. Notre méthode est une variante de l'algorithme de branch-and-bound, appelée branch-and-price-and-cut, dans laquelle nous exploitons à la fois la génération de colonnes et de coupes pour la résolution d'instances de grande taille, en particulier, celles ayant un grand nombre de produits. En nous comparant à CPLEX, actuellement l'un des meilleurs logiciels d'optimisation mathématique, notre méthode est compétitive sur les instances de taille moyenne et supérieure sur les instances de grande taille ayant un grand nombre de produits, et ce, même si elle n'utilise qu'un seul type d'inégalités valides.

L'algorithme de Branch and Price and Cut pour le problème de conception de réseaux avec coûts fixes et sans capacité

Le problème de conception de réseaux est un problème qui a été beaucoup étudié dans le domaine de la recherche opérationnelle pour ses caractéristiques, et ses applications dans des nombreux domaines tels que le transport, les communications, et la logistique. Nous nous intéressons en particulier dans ce mémoire à résoudre le problème de conception de réseaux avec coûts fixes et sans capacité, en satisfaisant les demandes de tous les produits tout en minimisant la somme des coûts de transport de ces produits et des coûts fixes de conception du réseau. Ce problème se modélise généralement sous la forme d’un programme linéaire en nombres entiers incluant des variables continues. Pour le résoudre, nous avons appliqué la méthode exacte de Branch-and-Bound basée sur une relaxation linéaire du problème avec un critère d’arrêt, tout en exploitant les méthodes de génération de colonnes et de génération de coupes. Nous avons testé la méthode de Branch-and-Price-and-Cut sur 156 instances divisées en cinq groupes de différentes tailles, et nous l’avons comparée à Cplex, l’un des meilleurs solveurs d’optimisation mathématique, ainsi qu’à la méthode de Branch-and- Cut. Notre méthode est compétitive et plus performante sur les instances de grande taille ayant un grand nombre de produits.