Real-time systems are required to answer to external stimuli within a specified time-period. For this to be possible, the systems behaviour must be predictable. The use of active databases in real-time systems introduces unpredictability in the system, e.g. due to their use of active rules. The behaviour in active databases is usually specified in ECA-rules.

The aim of this thesis is to compare two time periods in thehistory of the university library in Lund and to see whatsimilarities and differences can be found. The two timeperiods will be 1883-1900 and 1933-1950. The methodsused to achieve this will be comparative method with theactor- and structure model and document analysis. Thesubjects that will be analyzed with these methods will bepersonnel and the facilities. The two questions I will try toanswer in this thesis will be: A) What similarities anddifferences can be found concerning the personnel and thefacilities in the two time periods? B) What is therelationship between the actors and the structureconcerning the personnel and the facilities like in the twoperiods?A brief background of what took place in Sweden, LundUniversity and the university library of Lund itself duringour two periods is provided.

In this essay the renewal of the modern sacred art has been examined through the creation of three works of art from the art project ?Kyrkorummet?. The aim has been to show that renewal of the modern sacred art is best accomplished by the combination of the artist history and Bible knowledge and the open mindness of the beholder towards the new and creative, in order to communicate the gospel in modern time.The large extend of the art project demanded a selection of the art works. Therefore, three were chosen and they show the last supper and the baptism in a renewal way including both symbolism and creativity. To complete and facilitate the analyses, a theme, light and water, have been used as well as relevant theories in art history with Kandinsky as main art critic.Through the art project and it?s teaching, history in combination with present time through visits in different and modern churches, thoughts have been stimulated and the result has been new works of art that speaks of our time.

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 survey aims to investigate and analyze how the image of Sweden and "Swedish character? is produced in the correspondence between Swedish immigrants and family at home, compared to how the image of America and the U.S. is produced. The starting point is the concept of identity, which is shaped by the social group a person belongs, which can lead to stereotypes are formed. How does the Emigrant describe his new life in letters home to Sweden? What comparisons are made? What memories are passed from the time at home? How does the picture changes over time? How does the stereotypes change over time? The material used are remnants and secondary sources in the form of correspondence between emigrants and their relatives back home.

BackgroundToday a common approach to solve a complicated problem is to assemble a temporary workforce in order to solve the problem by working together within a project. One of the difficulties with working in projects is to maintain the planned budget. Working hours and costs are often exceeded. Many companies presume that any certain project will succeed, a presumption that leads companies not to anticipate risks involved in a project. In companies today there is seldom time for evaluation or moderation of a project, in order to have time for evaluation there is a great need for an adequate planning of the project.IntentThe intention with this study is to create a model for planning, budgeting and evaluation of projects within consultancy companies.MethodWith the help of interviews and discussions within the group Hamnar och Byggkonstruktioner at Sweco has evidence to present a proposal on planning, budgeting and monitoring been developed.ResultsA model has been developed to ease for consultancy companies to plan, budget, monitor and evaluate projects.

Benthic diatoms are used in Sweden for monitoring water quality in run-ning water; the method is also frequently used in other countries in Europe. One of the problems of the diatom method is the need for sedimentation of the fresh sample, to be able to decant the over standing water and add alco-hol as a preservations solution. To my knowledge, no results have been published about how long the settling time must be to ensure that the ben-thic diatoms really have settled down to avoid a loss of the diatoms when decanting the over standing water. The aim of my investigation was to improve the Swedish method where the benthic diatoms are used for water quality monitoring. I wanted to find out the appropriate time necessary to wait until all diatoms have settled down before decanting the over standing water. First, fresh benthic diatom samples were taken in the river Fyrisån and the lake Mälaren on different days. After arriving in the laboratory, I waited three different times (30 min, 60 and 180 min) for the diatoms to settle.

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.

To be able to provide the growing human population with food, the productivity of the animals as well as land use needs to be improved and intensified. Hence, understanding the behavior of animals is crucial both for animal welfare and productivity as well as the management of the cattle. There are many factors affecting the grazing behavior of cattle in tropical conditions, such as human-animal interactions, herd management, breed, season and temperature. The purpose of this study was to investigate the grazing behavior of two tropical cattle breeds, Ankole and Boran cattle. Kenyan Boran belongs to a zebu type of cattle and is preferred to many other breeds due to the higher productive and reproductive capacity and adaptability to tropical conditions.

What is creativity? Why is it important? How can you stimulate pupils to becomemore creative? These are some of the questions that are studied in this thesis.The discussion is focused on programming as the medium of creativity and theresult is a setup for a course book that teaches programming at the same time asit makes the reader more creative. The results are based on literature study aswell as observations and interviews with teachers and pupils from three differentschools in Stockholm, Sweden. The study shows that gets more important everyday as more and more jobs are replaced by computers and we live in an age ofabundance. The teachers would like the pupils to be more creative but don?tknow how achieve that at the same time as they have to teach them everythingthat they are supposed to know when the course ends..