The aim of the study was to compare different types and ages of restoration from the small mammal biodiversity perspective. In 2004, three linear and two quadratic trappings of small terrestrial mammals were performed at the Velká podkrušnohorská spoil heap. Linear trappings were repeated in 2009 and quadratic were repeated in 2010. In 2004, 174 small mammals in the linear trappings and 199 small mammals in the quadratic trappings were captured. We found, that the wetland localities were the richest in small mammal diversity, the forestry restored areas were second ones, and the agriculturally restored areas were the poorest ones. During the repeated trappings, 45 small mammals in linear trappings and 64 small mammals in quadratic trappings were captured. A decrease of both abundance and biodiversity was recorded in the both types of trappings. The highest biodiversity was on wetland and forestry restored areas. The lowest biodiversity was on agriculturally restored areas. The highest abundance was on forestry sites during the linear trappings. The wetland areas were second ones and the lowest abundance was on agriculturally restored areas. Value of abundance in quadratic trappings was almost the same in wetland and forest habitats, whilst the abundance of agricultural areas was significantly lower. The results show the importance of wetland habitats, which are very important part of restoration and have a positive impact on the overall biodiversity in the landscape.

Die Rückstandshalden des Kalibergbaus bestehen überwiegend aus Steinsalz. In Abhängigkeit der Stabilität des Untergrundes sowie der Haldenhöhe neigen diese Halden dazu sich plastisch zu verformen. Diese Deformationen gilt es frühzeitig zu erkennen und zu bewerten. Das neue gestaffelte Monitoringkonzept beruht auf langjährigen Erfahrungen, die ebenso kurz vorgestellt werden. / Tailing heaps of potash mining consist predominantly of rock salt. Depending on the stability of the underground, as well as the heights of the heaps, these heaps tend to deform plastically. These deformations must be recognized and assessed at an early stage. The new graduated monitoring concept is based on many years of experience, which are also briefly presented.

This thesis presents strategies to improve the query evaluation performance over huge volumes of relational-like data that is stored in the memory space of managed applications. Storing and processing application data in the memory space of managed applications is motivated by the convergence of two recent trends in data management. First, dropping DRAM prices have led to memory capacities that allow the entire working set of an application to fit into main memory and to the emergence of in-memory database systems (IMDBs). Second, language-integrated query transparently integrates query processing syntax into programming languages and, therefore, allows complex queries to be composed in the application. IMDBs typically serve as data stores to applications written in an object-oriented language running on a managed runtime. In this thesis, we propose a deeper integration of the two by storing all application data in the memory space of the application and using language-integrated query, combined with query compilation techniques, to provide fast query processing. As a starting point, we look into storing data as runtime-managed objects in collection types provided by the programming language. Queries are formulated using language-integrated query and dynamically compiled to specialized functions that produce the result of the query in a more efficient way by leveraging query compilation techniques similar to those used in modern database systems. We show that the generated query functions significantly improve query processing performance compared to the default execution model for language-integrated query. However, we also identify additional inefficiencies that can only be addressed by processing queries using low-level techniques which cannot be applied to runtime-managed objects. To address this, we introduce a staging phase in the generated code that makes query-relevant managed data accessible to low-level query code. Our experiments in .NET show an improvement in query evaluation performance of up to an order of magnitude over the default language-integrated query implementation. Motivated by additional inefficiencies caused by automatic garbage collection, we introduce a new collection type, the black-box collection. Black-box collections integrate the in-memory storage layer of a relational database system to store data and hide the internal storage layout from the application by employing existing object-relational mapping techniques (hence, the name black-box). Our experiments show that black-box collections provide better query performance than runtime-managed collections by allowing the generated query code to directly access the underlying relational in-memory data store using low-level techniques. Black-box collections also outperform a modern commercial database system. By removing huge volumes of collection data from the managed heap, black-box collections further improve the overall performance and response time of the application and improve the application’s scalability when facing huge volumes of collection data. To enable a deeper integration of the data store with the application, we introduce self-managed collections. Self-managed collections are a new type of collection for managed applications that, in contrast to black-box collections, store objects. As the data elements stored in the collection are objects, they are directly accessible from the application using references which allows for better integration of the data store with the application. Self-managed collections manually manage the memory of objects stored within them in a private heap that is excluded from garbage collection. We introduce a special collection syntax and a novel type-safe manual memory management system for this purpose. As was the case for black-box collections, self-managed collections improve query performance by utilizing a database-inspired data layout and allowing the use of low-level techniques. By also supporting references between collection objects, they outperform black-box collections.

J'ai étudié trois problèmes d'optimisation dans les graphes et les jeux combinatoires.Tout d'abord, les codes identifiants dans les graphes où les sommets font faces à des failles: les codes cherchent à repérer les failles pour les réparer. On s'est intéressé aux codes identifiants dans les graphes circulants en utilisant des plongements de ces graphes dans des grilles infinies.Ensuite, j'ai étudié le jeu de marquage de sommets et le jeu de coloration d'arêtes: ici deux joueurs se font face, le premier cherche à construire une coloration correcte (ou un marquage correct) et le deuxième cherche à l'en empêcher. Pour le jeu de marquage on s'est intéressé aux changements de stratégie gagnante lorsqu'on modifie le graphe. Pour le jeu de coloration d'arêtes on a donné une stratégie gagnante pour le premier joueur pourvu que le graphe considéré admette une certaine décomposition sur les arêtes. On améliore notamment des résultats sur les graphes planaires.Enfin j'ai étudié les jeux à tas purement de casse: deux joueurs à tour de rôle prennent un tas et le cassent en un certain nombre de tas non vides. On s'intéresse aux stratégies gagnantes lorsque les joueurs jouent sur un unique tas contenant n jetons. Ces jeux de pure casse semblent, à l'oeil nu, être réguliers. On a montré que c'est effectivement le cas pour certains et on a donné un test qui permet de déterminer la régularité cas par cas. Un seul cas ne semble pas correspondre à cette régularité: son comportement reste un mystère.En conclusion, je me suis intéressé à trois problèmes bilatéraux qui utilisent différentes méthodes et qui remplissent des propos différents dans le domaine de la combinatoire / I studied three optimization problems on graphs and combinatorial games.First, identifying codes were studied : vertices couteract faults. Identifying codes help locate the fault to repare it. We focused on circulant graphs by embedding them on infinite grids.Then, the marking and the coloring games were studied : two player games were one player wants to build something (a proper coloration or a proper marking) and the other wants to prevent the first player from doing so. For the marking game we studied the evolution of the strategy when modifying the graph. For the coloring game we defined a new edge-wise decomposition of graphs and we defined a new strategy on this decomposition that improves known results on planar graphs.In the end, I studied pure breaking games : two players take turns to break a heap of tokens in a given number of non-empty heaps. We focused on winning strategies for the game starting with a unique heap on n tokens. These games seem, on first sight, to be all regular : we showed this is the case for some of them and we gave a test to study one game at a time. Only one of these games does not seem to be regular, its behavior remains a mystery.To sum up, I studied three bilateral problems that use different methods and have different purposes in combinatorics

The aim of my thesis was to describe the biodiversity and try to outline the population dynamics of small terrestrial mammals on the Great podkrušnohorská spoil heap. We captured small mammals six times during the 2009 and 2010 seasons. We used the standard capture-mark-release method (CMR) with live traps in quadrates at five sites with different restoration type- wetland, forestry (alderwood and pinewood), agricultural and controlled succession. The observed data were processed in Microsoft Office Excel and by canonical correspondence analysis (CCA) in Canoco for Windows. In 2009 a total of 67 individuals of five small mammals´species were captured: Apodemus flavicollis, Microtus arvalis, M. agrestis, Myodes glareolus and Sorex araneus. The highest biodiversity (3 species) was recorded in wetland restoration. The highest abundance (20 individuals) was recorded in alderwood forestry restoration. In 2010 258 individuals of 7 species were captured: Apodemus flavicollis, A. sylvaticus, Microtus arvalis, M. agrestis, Myodes glareolus, S. araneus and Micromys minutus. As in 2009 the highest abundance was recorded in alderwood forestry restoration(60 individuals) and the highest biodiversity (7 species) was recorded in wetland restoration.

This thesis examines some of the best known algorithms for solving the shortest point-to-point path problem, and evaluates their performance on real metropolitan area networks. The focus has mainly been on Dijkstra‟s algorithm and different variations of it, and the algorithms have been implemented in C# for the practical tests. The size of the networks used in this study varied between 358 and 2464 nodes, and both running time and representative operation counts were measured. The results show that many different factors besides the network size affect the running time of an algorithm, such as arc-to-node ratio, path length and network structure. The queue implementation of Dijkstra‟s algorithm showed the worst performance and suffered heavily when the problem size increased. Two techniques for increasing the performance were examined: optimizing the management of labelled nodes and reducing the search space. A bidirectional Dijkstra‟s algorithm using a binary heap to store temporarily labelled nodes combines both of these techniques, and it was the algorithm that performed best of all the tested algorithms in the practical tests. This project was initiated by Netadmin Systems i Sverige AB who needed a new path finding module for their network management system NETadmin. While this study is primarily of interest for researchers dealing with path finding problems in computer networks, it may also be useful in evaluations of path finding algorithms for road networks since the two networks share some common characteristics.

Data från positioneringssystem som GPS är alltmer vanlig, men är svårhanterlig i traditionella datalagringssystem. Sådan data består av spatiala och temporala attribut och representeras i vissa fall i JSON-format. Sortering av JSON objekt sker via inbyggda sorteringsfunktioner, vilka kräver att hela JSON objektet finns avserialiserat i minnet. Om datan strömmas måste hela datamängden tas emot innan sortering kan ske. För att förebygga detta krävs att en utvecklare utvecklar metoder för sortering av strömmad data medans strömmen pågår. Den här studien identifierar tre lämpliga sorteringsalgoritmer, och jämför dessa på hur snabbt de sorterar den strömmade datan samt deras minnesanvändning. En klientapplikation och en serverapplikation jämfördes även för att se om sortering på servern genererade bättre resultat. De slutsatser som drogs av experimentets resultat var att merge sort var snabbast men använde mest minne, medans heap sort var långsammast men hade lägst minesanvändning. Klientapplikationens sorteringstider var något snabbare än serverapplikationens.

In this thesis the influence of existing vegetation, the distance from the north border of the spoil heap, animal grazing, terrain bumpiness, and soil pH on the distribution and rooting of European Beech (Fagus sylvatica) at spoil heap Velká podkrušnohorská výsypka (50ř14'09 N, 12ř39'05 E) was examined. To accomplish this, beech seedlings within chosen areas overgrown by spontaneous succession or alder restoration were mapped using GPS. A rooting position on the wave-like terrain was recorded for a proportion of the total number of seedlings. Soil pH was also measured on the wave-like terrain. The majority of seedlings (183) were found at the succession sites; only one seedling was found in the alder restoration site. The GLM analysis proved significantly more seedlings in succession sites compared to alder restoration sites (p = 0.0169) and the negative dependence on distance from the north border of the heap (p < 0.0001). Within the wave-like terrain, 46% of seedlings were growing on the north slopes. In 2009, small seedlings were planted into the fresh restoration site and the adjacent succession site, in both cases inside the fencing and outside of it. The seedlings were growing significantly better in the succession site compared to the restoration site, and they were growing better inside the...

Det finns två huvudområden för hällristningar i Västmanlands län med nära relation till de forntida strandlinjerna. I båda dessa områden finns det fornborgar som hittills inte har daterats. Syftet är att datera Näsborgen och Kastena Skans i östra och västra Västmanland genom att använda geografiska informationssystemet QGIS och forntida strandlinjedata hämtad från Sveriges Geologiska Undersökning (SGU). Dessutom betraktas fornborgarna ur ett landskapsperspektiv och deras relation till hällristningar och skärvstenshögar som styrker en bronsåldersdatering för dessa fornborgar. Analysen använder tidigare bekräftade bronsåldersdateringar av tre fornborgar i Uppland som referens för Västmanlands fornborgar och överblickar andra närliggande fornborgar. Både Näsborgen och Kastena Skans konstateras vara konstruerade under bronsåldern. / There are two main areas of rock art in Västmanland county with a close relation to the ancient shorelines. In both areas, there are hillforts that have not yet been dated. The aim is to date Näsborgen and Kastena Skans in eastern and western Västmanland by using the geographic information system QGIS and ancient shoreline data obtained from Geological Survey of Sweden (SGU). Additionally, the hillforts are considered from a landscape perspective and their relation to rock art sites and heaps of fire-cracked stones, which support Bronze Age datings for these hillforts. The analysis uses previously confirmed Bronze Age datings of three hillforts in Uppland as a reference for the hillforts in Västmanland and provides an overview of other nearby hillforts. Both Näsborgen and Kastena Skans are determined to have been constructed during the Bronze Age.

This study investigates six theoretical approaches offered as solutions to the paradox of the heap (sorites paradox), a logic puzzle dating back to the ancient Greek philosopher Eubulides. Those considered are: Incoherence Theory, Epistemic Theory, Supervaluation Theory, Many-Valued Logic, Fuzzy Logic, and Non-Classical Semantics. After critically examining all of these, it is concluded that none of the attempts to explain the sorites are fully adequate, and the paradox remains unresolved. / Philosophy / M.A. (Philosophy)