Already in the late 1970´s it became clear that the traditional catalogs in libraries were not suited for children, neither their interests nor their way expressing themselves were accounted for. The goal of this thesis is to investigate if and how children?s OPACs (Open public access catalogs) interface design is at present adapted to the presumed audience of children. My method consists of literature studies and an investigation on the graphical interfaces in OPACs for children, according to the five criteria formulated by childrens library consultant Lena Lundgren and IT-consultant Kia Gumbel. The aims are to find out: a) what requirements for children?s OPAC interfaces and their usability are defined in literature and b) what the actual (real) features of the children?s OPAC interfaces are.

The aim of this Master thesis is, from a sociocultural perspective, to investigate the views the teaching librarians at Södertörn University Library (SHB) have on learning, information literacy, and their own pedagogical role, and how their views affect user education and their ideas about the future of user education.The research questions used were: How do the teaching librarians view learning? How is this view reflected in their work with user education? How do the teaching librarians envisage user education in the future, and how do they work to reach that goal?Five semi-structured interviews were conducted with the teaching librarians at SHB. The interviews were then analysed using qualitative content analysis.The results of the study show that the teaching librarians at SHB share a sociocultural view on learning, and take a communicative oriented approach to user education. They believe that communication and interaction support learning, and in the classroom they stimulate discussions both between librarian and student, and between the students themselves. In the future, they hope for improved collaboration between librarians and academic staff, and that user education will become a natural element of the curriculum..

This bachelor thesis includes two different manuals and design of an interface box between a test object and a general test station (computer) with ARINC429 communication.There are three different purposes with this project:The first is to setup a general test station with ARINC429 communication using a communications card from DDC (DD-42916i3-300) and software from Ampol Technologies (dataSIMS).The second is to design a new interface between the test computer and the test object. As well as implementing two components in the equipment.The third is to write two separate manuals to guide the users of this equipment. There are two different kinds of users of this equipment, technicians and system engineers. Technicians use the equipment to test and repair flight components. System engineers will implement new components in the equipment.The result of this project is a working test station with a new interface and two manuals..

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.

Water is vital for all life on earth. But it can also be dangerous, even fatal, if it is polluted water. 60 percent of child mortality can directly be deduced to dirty water. Not only developing countries are affected, even in the western world epidemics are breaking out by partake or bathing in dirty/polluted water.MIP, Molecularly Imprinted Polymers, is a biosensor technology that can provide faster and more reliable response than the current methods of water analysis. It is also cheaper and due to that more samples can be taken and analyzed.

When traffic in large cities increases, it becomes more vulnerable to disturbances such as accidents, stalled vehicles or construction; therefore, traffic jams are more likely to occur. For better control of the traffic at a disturbance the Swedish National Road Administration (SNRA) has traffic equipment which can be controlled from a command centre. This traffic equipment consists of gates and signs with variable messages. This report will discuss the system used for traffic control in Stockholm. It will present proposals designed to improve it.

Boberg at Scania CV AB. The purpose was to investigate the technical and customer oriented possibilities for the development of a transport security measure against cargo crime, which is a growing problem in Europe. The main goal was to develop a concept that is possible to implement in the Scania CV AB Fleet Management System. Another goal was to develop a security model that will be used as a tool during Scania CV AB?s future development projects of transport security concepts.The work was divided into three main parts: a background study, handling cargo crime, transport security Scania CV AB trucks and market analysis, a stakeholder investigation including a questionnaire and interviews, and a concept development session.

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.