Scheduling forest road maintenance using the analytic hierarchy process and heuristics

Abstract

Synchronous Digital Hierarchy implementation to a Radio Transmission Node

Kiristyville markkinoille on aina tuotava jotain uutta tarjottavaa ja SDH-kortti on yksi sellainen tuote jonka Nokia Networks julkistaa osaksi uutta Nokia Flexihub Nodea. Tavoitteena on suunnitella VC-12kanavoitu STM-1 kortti yhdistämään ylemmän tason tietoliikenneverkko suuren kapasiteetin radioon. Ennen kuin markkinoilla on valmis tuote, on sen takana valtaisa määrä työtä. Erilaisia dokumentteja on pitänyt tuottaa ja sopimuksia tehdä. Esimerkiksi vaatimusmäärittelyt on oltava selvät, jotta tiedetään mitä tuotteelta halutaan. Tätä ennen on kuitenkin pitänyt ymmärtää miten SDHtoimii ja miten otsikkotavuja käsitellään. Myös erilaiset piirivalinnat aiheuttavat miettimistä, sillä markkinoilla on runsaasti valmiita piirejä SDH signaalinkäsittelyyn. Varma tiedonsiirto on tärkeää puhelinoperaattorille ja siksi joudutaan miettimään varmennuksia ja niiden toteuttamista. Myös synkronointi on tärkeä osa SDH järjestelmää ja sen toteuttaminen hyvin on tärkeää. Hälytykset on otettava huomioon ja mietittävä, miten niiden käsittely saadaan hoidettua järkevästi, ilman että mikään järjestelmän osa ruuhkautuu kohtuuttomasti. Tässä Diplomityössä on tutustuttu SDH-järjestelmään, otsikkotavujen käsittelyyn ja vaatimusmäärittelyihin.

Supplier Evaluation Using Analytical Hierarchy Process

The goal of the thesis is to make a supplier evaluation using analytical hierarchy process. Before the supplier evaluation is performed there will be introduced the principles of purchasing which gives a viewpoint to the supplier evaluation and management. The thesis will also give an overview on quality, performance and forecasts which are very important to the supplier evaluation and future improvements. The chapter which describes analytical hierarchy process will show the reader what exactly is analytical hierarchy process and how can it be utilized in supplier evaluation. In the later stages, thesis will provide information about the case company EADS Secure Networks Oy, the processes applied there towards purchasing and how the analytical hierarchy process is applied in practise. In the end of the thesis there will be an overview about each supplier’s strong and weak points as well as some comments and ideas about developing also EADS Secure Networks procedures to a direction which would benefit the whole customer–supplier–chain.

Conservation Laws in Cellular Automata

Conservation laws in physics are numerical invariants of the dynamics of a system. In cellular automata (CA), a similar concept has already been defined and studied. To each local pattern of cell states a real value is associated, interpreted as the “energy” (or “mass”, or . . . ) of that pattern.The overall “energy” of a configuration is simply the sum of the energy of the local patterns appearing on different positions in the configuration. We have a conservation law for that energy, if the total energy of each configuration remains constant during the evolution of the CA. For a given conservation law, it is desirable to find microscopic explanations for the dynamics of the conserved energy in terms of flows of energy from one region toward another. Often, it happens that the energy values are from non-negative integers, and are interpreted as the number of “particles” distributed on a configuration. In such cases, it is conjectured that one can always provide a microscopic explanation for the conservation laws by prescribing rules for the local movement of the particles. The onedimensional case has already been solved by Fuk´s and Pivato. We extend this to two-dimensional cellular automata with radius-0,5 neighborhood on the square lattice. We then consider conservation laws in which the energy values are chosen from a commutative group or semigroup. In this case, the class of all conservation laws for a CA form a partially ordered hierarchy. We study the structure of this hierarchy and prove some basic facts about it. Although the local properties of this hierarchy (at least in the group-valued case) are tractable, its global properties turn out to be algorithmically inaccessible. In particular, we prove that it is undecidable whether this hierarchy is trivial (i.e., if the CA has any non-trivial conservation law at all) or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. We show that positively expansive CA do not have non-trivial conservation laws. We also investigate a curious relationship between conservation laws and invariant Gibbs measures in reversible and surjective CA. Gibbs measures are known to coincide with the equilibrium states of a lattice system defined in terms of a Hamiltonian. For reversible cellular automata, each conserved quantity may play the role of a Hamiltonian, and provides a Gibbs measure (or a set of Gibbs measures, in case of phase multiplicity) that is invariant. Conversely, every invariant Gibbs measure provides a conservation law for the CA. For surjective CA, the former statement also follows (in a slightly different form) from the variational characterization of the Gibbs measures. For one-dimensional surjective CA, we show that each invariant Gibbs measure provides a conservation law. We also prove that surjective CA almost surely preserve the average information content per cell with respect to any probability measure.

Hierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type

Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. In this thesis, we study two-dimensional subshifts offinite type (2D SFTs), where the underlying grid is Z2 and the set of for-bidden patterns is finite. We are mainly interested in the interplay between the computational power of 2D SFTs and their geometry, examined through the concept of expansive subdynamics. 2D SFTs with expansive directions form an interesting and natural class of subshifts that lie between dimensions 1 and 2. An SFT that has only one non-expansive direction is called extremely expansive. We prove that in many aspects, extremely expansive 2D SFTs display the totality of behaviours of general 2D SFTs. For example, we construct an aperiodic extremely expansive 2D SFT and we prove that the emptiness problem is undecidable even when restricted to the class of extremely expansive 2D SFTs. We also prove that every Medvedev class contains an extremely expansive 2D SFT and we provide a characterization of the sets of directions that can be the set of non-expansive directions of a 2D SFT. Finally, we prove that for every computable sequence of 2D SFTs with an expansive direction, there exists a universal object that simulates all of the elements of the sequence. We use the so called hierarchical, self-simulating or fixed-point method for constructing 2D SFTs which has been previously used by Ga´cs, Durand, Romashchenko and Shen.