Improvement of Energy Efficiency in a Gold Mining Industry: Case Study of a Russian Gold Mining Company

The issue of energy efficiency is attracting more and more attention of academia, business and policy makers worldwide due to increasing environmental concerns, depletion of non-renewable energy resources and unstable energy prices. The significant importance of energy efficiency within gold mining industry is justified by considerable energy intensity of this industry as well as by the high share of energy costs in the total operational costs. In the context of increasing industrial energy consumption energy efficiency improvement may provide significant energy savings and reduction of CO2 emission that is highly important in order to contribute to the global goal of sustainability. The purpose of this research is to identify the ways of energy efficiency improvement relevant for a gold mining company. The study implements single holistic case study research strategy focused on a Russian gold mining company. The research involves comprehensive analysis of company’s energy performance including analysis of energy efficiency and energy management practices. This study provides following theoretical and managerial contributions. Firstly, it proposes a methodology for comparative analysis of energy performance of Russian and foreign gold mining companies. Secondly, this study provides comprehensive analysis of main energy efficiency challenges relevant for a Russian gold mining company. Finally, in order to overcome identified challenges this research conceives a guidance for a gold mining company for implementation of energy management system based on the ISO standard.

Investigating the potential of thecamoebians (testate amoebae) as bio-indicators of impact of oil sands mining operations on freshwater environments in Northeastern Alberta, Canada

Thecamoebian (testate amoeba) species diversity and assemblages in reclamation wetlands and lakes in northeastern Alberta respond to chemical and physical parameters associated with oil sands extraction. Ecosystems more impacted by OSPM (oil sands process-affected material) contain sparse, low-diversity populations dominated by centropyxid taxa and Arcella vulgaris. More abundant and diverse thecamoebian populations rich in difflugiid species characterize environments with lower OSPM concentrations. These shelled protists respond quickly to environmental change, allowing year-to-year variations in OSPM impact to be recorded. Their fossil record thus provides corporations with interests in the Athabasca Oil Sands with a potential means of measuring the progression of highlyimpacted aquatic environments to more natural wetlands. Development of this metric required investigation of controls on their fossil assemblage (e.g. seasonal variability, fossilization potential) and their biogeographic distribution, not only in the constructed lakes and wetlands on the oil sands leases, but also in natural environments across Alberta.

The Salmon Algorithm - A New Population Based Search Metaheuristic

This thesis introduces the Salmon Algorithm, a search meta-heuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming upstream to spawn. There are a number of tunable parameters in the algorithm, so experiments were conducted to find the optimum parameter settings for different search spaces. The algorithm was tested on one instance of the Traveling Salesman Problem and found to have superior performance to an Ant Colony Algorithm and a Genetic Algorithm. It was then tested on three coding theory problems - optimal edit codes, optimal Hamming distance codes, and optimal covering codes. The algorithm produced improvements on the best known values for five of six of the test cases using edit codes. It matched the best known results on four out of seven of the Hamming codes as well as three out of three of the covering codes. The results suggest the Salmon Algorithm is competitive with established guided random search techniques, and may be superior in some search spaces.

A Multi-Objective Genetic Algorithm with Side Effect Machines for Motif Discovery

Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multi-objective genetic algorithm to evolve a specialized version of side effect machines for degenerate motif discovery. We compare some suggested objectives for the motifs they find, test different multi-objective scoring schemes and probabilistic models for the background sequence models and report our results on a synthetic dataset and some biological benchmarking suites. We conclude with a comparison of our algorithm with some widely used motif discovery algorithms in the literature and suggest future directions for research in this area.

New Contig Creation Algorithm for the de novo DNA Assembly Problem

DNA assembly is among the most fundamental and difficult problems in bioinformatics. Near optimal assembly solutions are available for bacterial and small genomes, however assembling large and complex genomes especially the human genome using Next-Generation-Sequencing (NGS) technologies is shown to be very difficult because of the highly repetitive and complex nature of the human genome, short read lengths, uneven data coverage and tools that are not specifically built for human genomes. Moreover, many algorithms are not even scalable to human genome datasets containing hundreds of millions of short reads. The DNA assembly problem is usually divided into several subproblems including DNA data error detection and correction, contig creation, scaffolding and contigs orientation; each can be seen as a distinct research area. This thesis specifically focuses on creating contigs from the short reads and combining them with outputs from other tools in order to obtain better results. Three different assemblers including SOAPdenovo [Li09], Velvet [ZB08] and Meraculous [CHS+11] are selected for comparative purposes in this thesis. Obtained results show that this thesis’ work produces comparable results to other assemblers and combining our contigs to outputs from other tools, produces the best results outperforming all other investigated assemblers.

Glacial stratigraphy and micromorphology of the Pine Point Pb-­‐Zn mining district, Northwest Territories

This investigation aims to gain a better understanding of the glacial history of the Pine Point Mining district, Northwest Territories, by examining the sedimentological properties of the glacial sediments including, geochemical analysis, heavy mineral concentrate analysis, clast macro-­‐fabrics, pebble lithologies, and micromorphological investigation. Four till units were identified, and three were associated with identified erosional bedrock features and streamlined landforms in the area, indicating a minimum of three ice flow directions. Sedimentological properties suggest that these units were all Type-­B tectomict/mélange till, emplaced as part of a soft subglacial deformable bed. The lack of ice-­‐marginal advance and retreat sequences within the studied till, suggests the Middle Wisconsinan Laurentide Ice margin was likely north and west of the Pine Point area, as opposed to along the margin of the Canadian Shield and Western Sedimentary Basin where it has been suggested to have existed.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.

Disease-Gene Association Using a Genetic Algorithm

Understanding the relationship between genetic diseases and the genes associated with them is an important problem regarding human health. The vast amount of data created from a large number of high-throughput experiments performed in the last few years has resulted in an unprecedented growth in computational methods to tackle the disease gene association problem. Nowadays, it is clear that a genetic disease is not a consequence of a defect in a single gene. Instead, the disease phenotype is a reflection of various genetic components interacting in a complex network. In fact, genetic diseases, like any other phenotype, occur as a result of various genes working in sync with each other in a single or several biological module(s). Using a genetic algorithm, our method tries to evolve communities containing the set of potential disease genes likely to be involved in a given genetic disease. Having a set of known disease genes, we first obtain a protein-protein interaction (PPI) network containing all the known disease genes. All the other genes inside the procured PPI network are then considered as candidate disease genes as they lie in the vicinity of the known disease genes in the network. Our method attempts to find communities of potential disease genes strongly working with one another and with the set of known disease genes. As a proof of concept, we tested our approach on 16 breast cancer genes and 15 Parkinson's Disease genes. We obtained comparable or better results than CIPHER, ENDEAVOUR and GPEC, three of the most reliable and frequently used disease-gene ranking frameworks.

Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.

GA approach for finding Rough Set decision rules based on bireducts

Feature selection plays an important role in knowledge discovery and data mining nowadays. In traditional rough set theory, feature selection using reduct - the minimal discerning set of attributes - is an important area. Nevertheless, the original definition of a reduct is restrictive, so in one of the previous research it was proposed to take into account not only the horizontal reduction of information by feature selection, but also a vertical reduction considering suitable subsets of the original set of objects. Following the work mentioned above, a new approach to generate bireducts using a multi--objective genetic algorithm was proposed. Although the genetic algorithms were used to calculate reduct in some previous works, we did not find any work where genetic algorithms were adopted to calculate bireducts. Compared to the works done before in this area, the proposed method has less randomness in generating bireducts. The genetic algorithm system estimated a quality of each bireduct by values of two objective functions as evolution progresses, so consequently a set of bireducts with optimized values of these objectives was obtained. Different fitness evaluation methods and genetic operators, such as crossover and mutation, were applied and the prediction accuracies were compared. Five datasets were used to test the proposed method and two datasets were used to perform a comparison study. Statistical analysis using the one-way ANOVA test was performed to determine the significant difference between the results. The experiment showed that the proposed method was able to reduce the number of bireducts necessary in order to receive a good prediction accuracy. Also, the influence of different genetic operators and fitness evaluation strategies on the prediction accuracy was analyzed. It was shown that the prediction accuracies of the proposed method are comparable with the best results in machine learning literature, and some of them outperformed it.

Union Pacific Railway from Kansas City , Omaha, St. Joseph to Denver, San Francisco, Portland, Helena, Butte, Boise, Leadville, Durango, Deadwood and all cities and mining camps in the west schedule

Union Pacific Railway from Kansas City , Omaha, St. Joseph to Denver, San Francisco, Portland, Helena, Butte, Boise, Leadville, Durango, Deadwood and all cities and mining camps in the west schedule, Jan. 15, 1882.

Travels in México, during the years 1843 and 44 ; including a description of California, the principal cities and mining districts of that republic the Oregón territory, etc.

UANL

McNeill's code : Arranged to meet the requirements of mi ning, metallurgical and civil engineers ; directors of mining, smetling and other companies...

UANL

Constituting "Community" at the onset of the Pascua Lama Mining Project

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.