The interest in tiny wireless applications raises the demand for an integrated reference oscillator with the same performance as the macroscopic quartz crystal reference oscillators. The main challenge of the thesis is to prove that it is possible to build a MEMS based oscillator that approaches the accuracy level of existing quartz crystal oscillators. The MEMS resonator samples which Philips provides are measured and an equivalent electrical model is designed for them. This model is used in the simulations of the Pierce oscillator and the transresistance amplifier oscillator that are evaluated in this thesis. Finally the Pierce oscillator is implemented in the A BCD2 process and manufactured at Philips Semiconductors in Nijmegen, The Netherlands.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The Armed Forces is looking to improve control of where articles are and the monitoring of their condition within its clothing supply. That is why Försvarets Materielverk is working on a motion to tag the Armed Forces clothing with passive RFID-tags. A cost/benefit analysis has been made in this report in order to find out whether the investment is economical justifiable and what costs and benefits arose. The analysis tool that was used is based on the PENG-model. The analysis had three scenarios with the difference that each scenario included various amounts of clothing to tag.  There has also been made an analysis where only the benefits regarding decreasing amount of lost clothes and simplified inventory were included.The result of the first analysis was that none of the scenarios was profitable during the first year.

In Sweden, the County Administration board is responsible for improving the water quality in lakes and watercourses according to the European Union Water Framework Directive. In Västmanland county, where river Lillån is situated, the County Administration of Västmanland have the main responsibility for the aquatic environment in that area. The knowledge about the different watercourses in the chatchment of river Lillån is today limited. The aim with this study was to evaluate the ecological quality of River Lillån based on water chemistry analyses and benthic fauna investigations. The aim was also for the benthic fauna to compere different samplingsites and sampling methods with each other in order to see how the species composition changes in the river, and to see the advantages and disadvantages with different sampling tecniques.

The urgency of sustanible development is world-over issue. This essay focuses on the relations of enviromental ethics in the context of the Swedish upper secondary school and the subject of geography, by analysing different educational texts.The purpose of this essay is to reveal and identify discourses of enviromental ethics in curriculum documents; Lgr 11 and the plan- and the coursedocuments for the subject of geography, in educational publisher?s textbooks and in sponsored texts related to the subject of geography and finally to discuss potential consequences this might implicate for education. For this have the methodology of Norman Fairclough´s critical discourse theory, CDA, as well as a matrix of environmental ethics, based upon Mikael Stenmarks classifications of enviromental ethics, been used.In the Cirriculum, Lgr 11 and documents for the subject of Geography, and in the educational textbooks from ?Liber? and ?Gleerups?, are the environmental ethics of intergenerational anthropocentrism the dominant.

This study deals with the concept of ?integration?. Starting from the concept of reality as socially and linguistically constructed, it is an attempt to see how lingual constructions and perceptions affect the official structures of society and vice versa. The main purpose is to compare the different meanings integration has in a sociological context and in a political one. Further, the purpose is to see how the relationship between the sociological and political concepts affects the integrational work in the Swedish County Administrative Boards, and which consequences these effects might have.

Environmental issues and ecology is something that is discussed by the Climate board of the UN and by our Swedish politicians. The first part of the thesis deals with the effects of emissions of greenhouse gases in our atmosphere. There is a discussion about what counts as greenhouse gas. Interviews have been made with two growers of annual plants and one interview with a person who has worked hard to increase the use of perennials in his work place, Mjösund?s cemetery.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.