Determinants of capital expenditures: Evidence from oil and mining sectors in Russia

This master’s thesis investigates the significant macroeconomic and firm level determinants of CAPEX in Russian oil and mining sectors. It also studies the Russian oil and mining sectors, its development, characteristics and current situation. The panel data methodology was implemented to identify the determinants of CAPEX in Russian oil and mining sectors and to test derived hypotheses. The core sample consists of annual financial data of 45 publicly listed Russian oil and mining sector companies. The timeframe of the thesis research is a six year period from 2007 to 2013. The findings of the master’s thesis have shown that Gross Sales, Return On Assets, Free Cash Flow and Long Term Debt are firm level performance variables along with Russian GDP, Export, Urals and the Reserve Fund are macroeconomic variables that determine the magnitude of new capital expenditures reported by publicly listed Russian oil and mining sector companies. These results are not controversial to the previous research paper, indeed they confirm them. Furthermore, the findings from the emerging countries, such as Malaysia, India and Portugal, are analogous to Russia. The empirical research is edifying and novel. Findings from this master’s thesis are highly valuable for the scientific community, especially, for researchers who investigate the determinant of CAPEX in developing countries. Moreover, the results can be utilized as a cogent argument, when companies and investors are doing strategic decisions, considering the Russian oil and mining sectors.

Heat Demand Forecasting Models’ Development: Use of Data Mining Tools in SQL Server Analysis Services

This thesis introduces heat demand forecasting models which are generated by using data mining algorithms. The forecast spans one full day and this forecast can be used in regulating heat consumption of buildings. For training the data mining models, two years of heat consumption data from a case building and weather measurement data from Finnish Meteorological Institute are used. The thesis utilizes Microsoft SQL Server Analysis Services data mining tools in generating the data mining models and CRISP-DM process framework to implement the research. Results show that the built models can predict heat demand at best with mean average percentage errors of 3.8% for 24-h profile and 5.9% for full day. A deployment model for integrating the generated data mining models into an existing building energy management system is also discussed.

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.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Automatic Inference of Graph Models for Complex Networks with Genetic Programming

Complex networks can arise naturally and spontaneously from all things that act as a part of a larger system. From the patterns of socialization between people to the way biological systems organize themselves, complex networks are ubiquitous, but are currently poorly understood. A number of algorithms, designed by humans, have been proposed to describe the organizational behaviour of real-world networks. Consequently, breakthroughs in genetics, medicine, epidemiology, neuroscience, telecommunications and the social sciences have recently resulted. The algorithms, called graph models, represent significant human effort. Deriving accurate graph models is non-trivial, time-intensive, challenging and may only yield useful results for very specific phenomena. An automated approach can greatly reduce the human effort required and if effective, provide a valuable tool for understanding the large decentralized systems of interrelated things around us. To the best of the author's knowledge this thesis proposes the first method for the automatic inference of graph models for complex networks with varied properties, with and without community structure. Furthermore, to the best of the author's knowledge it is the first application of genetic programming for the automatic inference of graph models. The system and methodology was tested against benchmark data, and was shown to be capable of reproducing close approximations to well-known algorithms designed by humans. Furthermore, when used to infer a model for real biological data the resulting model was more representative than models currently used in the literature.

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.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.

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