Existing minefields left over from previous conflicts pose a grave threat to humanitarian relief operations, domestic everyday life, and future military operations. The remaining minefields in Afghanistan, from the decade long war with the Soviet Union, are just one example of this global problem. The purpose of this research is to develop a methodology that will predict areas where minefields are the most likely to exist through use of a GIS model. The concept is to combine geospatial data layers to produce a scored raster output of the most likely regions where minefields may exist. It is a "site suitability analysis" for minefield existence. The GIS model uses elevation and slope data, observer and defensive position locations, hydrographic features, transportation features, and trafficability estimates to form a minefield prediction surface. Through use of the NATO Reference Mobility Model (NRMMII) and the Digital Topographic Support System (DTSS), trafficability estimates are generated for specific vehicles under specific terrain and weather conditions in specific areas of interest. The model could be used to create prioritized maps for minefield detection sensors, demining teams, or for avoidance. These maps could define the "high payoff" search areas for remote sensors, such as ASTAMIDS, and positively identify minefields. These maps could also be used by humanitarian relief agencies for consideration when planning movement into areas that may contain minefields. The analysis includes a model calibration and sensitivity analysis procedure and compares the model output to known training minefield locations taken from two US Army training centers. The resultant Minefield Likelihood Surface has a 91% accuracy rate when compared to known training minefield data. / Master of Science

In this research, I analyze the effects of candidate nomination rules and campaign financing rules on elite recruitment into the national legislatures of Germany and the United States. This dissertation is both theory-driven and constitutes exploratory research, too. While the effects of electoral rules are frequently studied in political science, the emphasis is thereby on electoral rules that are set post-election. My focus, in contrast, is on electoral rules that have an effect prior to the election. Furthermore, my dissertation is comparative by design. The research question is twofold. Do electoral rules have an effect on elite recruitment, and does it matter? To answer these question, I create a large-N original data set, in which I code the behavior and recruitment paths and patterns of members of the American House of Representatives and the German Bundestag. Furthermore, I include interviews with members of the said two national legislatures. Both the statistical analyses and the interviews provide affirmative evidence for my working hypothesis that differences in electoral rules lead to a different type of elite recruitment. To that end, I use the active-politician concept, through which I dichotomously distinguish the economic behavior of politicians. Thanks to the exploratory nature of my research, I also discover the phenomenon of differential valence of local and state political office for entrance into national office in comparative perspective. By statistically identifying this hitherto unknown paradox, as well as evidencing the effects of electoral rules, I show that besides ideology and culture, institutional rules are key in shaping the ruling elite. The way institutional rules are set up, in particular electoral rules, does not only affect how the electorate will vote and how seats will be distributed, but it will also affect what type of people will end up in elected office.

This master's thesis deals with the measurement of soil temperature. In the theoretical part, optical fiber systems were explained, with a focus on DSTS systems and their use. In the practical part, a functional system was created to measure the soil temperature at depths of 0.1-1~m using the Arduino platform. Furthermore, the temperature measurement was demonstrated on the test polygon using the optical fiber of the FTB 2505 instrument in laboratories.

A wireless sensor network (WSN) is a collection of sensor nodes distributed over a geographical region to obtain the environmental data. It can have different types of applications ranging from low data rate event driven and monitoring applications to high data rate real time industry and military applications. Energy efficiency and reliability are the two major design issues which should be handled efficiently at all the layers of communication protocol stack, due to resource constraint sensor nodes and erroneous nature of wireless channel respectively. Media access control (MAC) is the protocol which deals with the problem of packet collision due to simultaneous transmissions by more than one neighboring sensor nodes. Time Division Multiple Access based (TDMA-based) and contention-based are the two major types of MAC protocols used in WSNs. In general, the TDMA-based channel access mechanisms perform better than the contention-based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). TDMA-based channel access employs a predefined schedule so that the nodes can transmit at their allotted time slots. Based on the frequency of scheduling requirement, the existing distributed TDMA-scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA-scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to generate such a schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA-scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. We suggest a new approach to TDMA-scheduling for WSNs, that can bridge the gap between these two extreme types of TDMA-scheduling techniques, by providing the flexibility to trade-off between the schedule length and the time required to generate the schedule, as per the requirements of the underlying applications and channel conditions. The suggested TDMA-scheduling works in two phases. In the first phase, we generate a valid TDMA schedule quickly, which need not have to be very efficient in terms of schedule length. In the second phase, we iteratively reduce the schedule length in a manner, such that the process of schedule length reduction can be terminated after the execution of an arbitrary number of iterations, and still be left with a valid schedule. This step provides the flexibility to trade-off the schedule length with the time required to generate the schedule. In the first phase of above TDMA-scheduling approach, we propose two randomized, distributed and parallel TDMA-scheduling algorithms viz., Distributed TDMA Slot Scheduling (DTSS) and Randomized and Distributed TDMA (RD-TDMA) scheduling algorithm. Both the algorithms are based on graph coloring approach, which generate a TDMA schedule quickly with a fixed schedule length ( Colouring), where is the maximum degree of any node in the graph to be colored. The two algorithms differ in the channel access mechanism used by them to transmit control messages, and in the generated schedule for different modes of communication, i.e., unicast, multicast and broadcast. The novelty of the proposed algorithms lies in the methods, by which an uncolored node detects that the slot picked by it is different from the slots picked by all the neighboring nodes, and the selection of probabilities with which the available slots can be picked up. Furthermore, to achieve faster convergence we introduce the idea of dynamic slot-probability update as per which the nodes update their slot-probability by considering the current slot-probability of their neighboring nodes. Under the second phase of the proposed TDMA-scheduling approach, we provide two randomized and distributed schedule compaction algorithms, viz., Distributed Schedule Compaction (DSC) and Distributed Schedule Length Reduction (DSLR) algorithm, as the mechanism to trade-off the scheduling time with the generated schedule length. These algorithms start with a valid TDMA schedule and progressively compress it in each round of execution. Additionally, Furthermore, the execution of these algorithms can be stopped after an arbitrary number of rounds as per the requirements of underlying applications. Even though TDMA-based MAC protocols avoid packet loss due to collision, due to erroneous nature of wireless medium, they alone are not sufficient to ensure the reliable transmission in WSNs. Automatic Repeat reQuest (ARQ) is the technique commonly used to provide error control for unicast data transmission. Unfortunately, ARQ mechanisms cannot be used for reliable multicast/broadcast transmission in WSNs. To solve this issue, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting in single-hop wireless networks. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade-off reliability with the delay as per the requirements of the underlying applications. Finally, by integrating all the works, viz., TDMA-scheduling algorithms (DTSS/RD-TDMA), schedule compaction algorithms and link layer feedback mechanism for reliable multicast/ broadcast, we propose a TDMA-based energy aware and reliable MAC protocol, named TEA-MAC for multi-hop WSNs. Similar to VTCAF, TEA-MAC protocol uses the combination of ACK-based and NACK-based approaches to ensure reliable communication. But, instead of using virtual token-based channel access, it uses contention-based channel access for NACK transmission. All the algorithms and protocols proposed in this thesis are distributed, parallel and fault tolerant against packet losses to support scalability, faster execution and robustness respectively. The simulations have been performed using Castalia network simulator to evaluate the performance of proposed algorithms/protocols and also to compare their performance with the existing algorithms/protocols. We have also performed theoretical analysis of these algorithms/protocols to evaluate their performance. Additionally, we have shown the correctness of proposed algorithms/protocols by providing the necessary proofs, whenever it was required. The simulation results together with theoretical analysis show that, in addition to the advantage of trading the runtime with schedule length, the proposed TDMA scheduling approach achieves better runtime and schedule length performance than existing algorithms. Additionally, the TEA-MAC protocol is able to considerably improve the reliability and delay performance of multicast communication in WSNs.