Data and Inventory Management in Spare Part Business: Developing Operations in the Case Company

After sales business is an effective way to create profit and increase customer satisfaction in manufacturing companies. Despite this, some special business characteristics that are linked to these functions, make it exceptionally challenging in its own way. This Master’s Thesis examines the current situation of the data and inventory management in the case company regarding possibilities and challenges related to the consolidation of current business operations. The research examines process steps, procedures, data requirements, data mining practices and data storage management of spare part sales process, whereas the part focusing on inventory management is reviewing the current stock value and examining current practices and operational principles. There are two global after sales units which supply spare parts and issues reviewed in this study are examined from both units’ perspective. The analysis is focused on the operations of that unit where functions would be centralized by default, if change decisions are carried out. It was discovered that both data and inventory management include clear shortcomings, which result from lack of internal instructions and established processes as well as lack of cooperation with other stakeholders related to product’s lifecycle. The main product of data management was a guideline for consolidating the functions, tailored for the company’s needs. Additionally, potentially scrapped spare part were listed and a proposal of inventory management instructions was drafted. If the suggested spare part materials will be scrapped, stock value will decrease 46 percent. A guideline which was reviewed and commented in this thesis was chosen as the basis of the inventory management instructions.

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.

Greener Golf Operations: A Comparative Case Study of Ontario Golf Courses Engaged in Environmental Sustainability Initiatives

This research explored environmental sustainability (ES) initiatives at five top-ranked Ontario golf courses that were members of the Audubon Cooperative Sanctuary Program for Golf (ACSP). Research Questions: (1) How are golf courses adapting to safeguard the natural environment? (2) Why or why not are golf courses moving to ES? and (3) What are the arising barriers to ES in golf and how can they be overcome; what role does communication play? Overall, the research was framed with an adaptation of the dimensions of convergence by Houlihan (2012), including the motives, inputs, implementation, momentum, and impact. Additionally, impression management and message framing constructs were utilized to address the issue of communicating ES initiatives. Data collection involved in-depth interviews, observations, and unobtrusive document collection. Environmental aspects of the examination were guided by the Canadian Standards Association (CSA) Requirements and Guidance for Organizers of Sustainable Events and Sustainable Sport and Event Toolkit (SSET).

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.

Memorandum - Report on operations of 1st Division against St. Mihiel Salient, 1918

A memorandum describing the days leading up to the Battle of Saint-Mihiel. The document describes 1. Statement of Operation, 2. Character of Terrain, 3. Initial Dispositions, 4. Suitability of Formations, 5. How such formations were, or could have been, best adapted to meet the changing conditions of combat and terrain, 6. Employment of Infantry Weapons, 7. Artillery Support, 8. Passage of Obstacles, 9. Passage of Lines, 10. Destruction of Opposition, 11. Fighting in Intermediate Zone, 12. Organization of Ground, 13. Liaison, 14. General Observations.

Journal of Cantigny Operations, 28 May 1918

A "journal of Cantigny operations" starting at 12:15 a.m. May 28th through May 30th. The final entry reads: "May 30th: Colonel Holbrook reports that the Germans started another Counter Attack about 3:30A.M. that the first wave got through our barrage, but did not reach our lines and that the second wave was destroyed by our barrage."

Report of Operations in Mouzon Area, 1918

A report on the operations in Mouzon starting October 12 through November 6th. The attack took place November 6th according to the report. Also included is a list of prisoners from enemy units.

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.

The mexican war and its warriors : comprising a complete history of all the operations of the American armies in Mexic...

UANL

The battle of Buena Vista ; with the operations of the Army of occupation for one month

UANL

Report of the Secretary of War, communicating; in compliance witha resolution of the Senate, a map showing the operations of the army of the United States in Texas and the adjacent Mexican Stateson the Rio Grande, accompanied by astronomical observations, and descriptive and military memoirs of the country.

UANL

Analysis of Some Queueing Models Related To N-Policy: Operations Research

This study is about the analysis of some queueing models related to N-policy.The optimal value the queue size has to attain in order to turn on a single server, assuming that the policy is to turn on a single server when the queue size reaches a certain number, N, and turn him off when the system is empty.The operating policy is the usual N-policy, but with random N and in model 2, a system similar to the one described here.This study analyses “ Tandem queue with two servers”.Here assume that the first server is a specialized one.In a queueing system,under N-policy ,the server will be on vacation until N units accumulate for the first time after becoming idle.A modified version of the N-policy for an M│M│1 queueing system is considered here.The novel feature of this model is that a busy service unit prevents the access of new customers to servers further down the line.It is deals with a queueing model consisting of two servers connected in series with a finite intermediate waiting room of capacity k.Here assume that server I is a specialized server.For this model ,the steady state probability vector and the stability condition are obtained using matrix – geometric method.