The new information society has revolutionised almost the entire world. But the new technique does not only bring good. That which was before only available on paper may today only be available on a computer system. This makes it possible to send data electronically. In the wrong hands that information can become a threat against the security of an individual, a company or even a nation. The possibility to protect oneself against attacks from the outside becomes increasingly difficult.

I have worked with Bergum in different courses on the IntegratedConservation of Built Environments program and I thought it was a veryinteresting subject. This is the main reason why I chosen to write mybachelor paper about Bergum.In 1650s Bergum was situated on the border between Sweden and Norway,because of that it occurred some war conflicts.Today Bergum is a socioeconomic border and is situated in an areabetween the city?s concrete suburb and the countryside.The difference between the city?s concrete suburb and the countryside mayfeel like two different worlds, were the social contact is fractional.With this paper, I will indicate a countryside area on the boundary to the citythrough time and try to survey the building history. I will also try todemonstrate the socioeconomic differences between the areas.I will demonstrate Bergum history from prehistory to present time, were I willdiscuss the agriculture history, Vättlefjäll?s forest history and also thedeforestation and replanting.

The Aquatic Ape theory was first formulated by Alister Hardy in year 1960. All from the beginning the theory has been criticized, ridiculed, ignored and a source to strong feelings in the anthropological community. The purpose of this essay is to investigate why the Aquatic Ape theory is so controversial and why it is understood so differently by scientists. After interviews with Swedish scientists and the general community, and after reading of anthropological books, I have tried to show that the aquatic ape-coldness depends on it challenging nature against the anthropological paradigm, which describes human beings as strong, hunting creatures who can live in any environment. The Aquatic Ape theory - on the other hand - picks out one of all these environments and says: "here has our evolution occurred: we have been aquatic apes".

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.

This thesis will describe the redesign of the manure fork SverigeGrepen. The productis available for purchase in Scandinavia and and parts of the rest of Europe.The product is available in stores but the companys goal is to start distribute it overthe internet. A problem today with a purchase over the internet is that the costumerhas to pay a high shipping-fee due to the products unique form. The long handlecontributes to the high shipping-fee which makes it hard to attract costumers topurchase the product online. Deficiencies have been found at the manure forks basketand needs to be examined.

There's a good adherence to the vaccination of children, about 98% of all two year olds are vaccinated. Despite this, there are cases of whooping cough and measles in Sweden. The purpose of the study was to describe what motivates parents to not vaccinate and reflections and attiudes about vaccinations. The study had a descriptive design with qualitative approach. Eight parents who had chosen not to follow the National Board of Health?s vaccination program or whom had decided to completely abandon, participated in the study.

Public participation is a key aspect in the planning of Swedish municipalities. It is probably the most important tool of them all in the planning towards a sustainable future within the cities and the municipalities as a whole. Participation from the public can take on several different forms. In this paper I focus to research and discuss in and around the usage of a web-based 3D platform called City Planner. The tool allows the user (the public) to view the municipalities planning in a fairly new (but quickly growing) environment.

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.