Sökresultat:
1325 Uppsatser om Implemented - Sida 54 av 89
Hur ofta bör småhus sotas? : En samhällsekonomisk analys av ändrade sotningsfrister
Sweden recently changed the national regulation of chimney sweeping. This study has two purposes. The first purpose is to evaluate the effect of this reform to see if the new regulation has led to an effect in terms of increased chimney fires in single-family houses and for the wood-burning and oil-burning stoves, respectively. The second purpose is an updating of a previous study (Mattsson 1994) of analysis of society´s benefits and costs of different alternative sweeping frequencies for wood-burning and oil-burning stoves. This study also has a secondary purpose to examine the extent to which the local sweeping rules vary with climate conditions. Mattsson, based on his results, proposed that the sweeping requirements for oil-burning stoves should be reduced from twice a year to once every second year and for wood-burning stoves the sweeping should be reduced from four times to once each year.
Invandrares väg till arbete genom Arbets- och Integrationscenter
ABSTRACT
This research explores how the Work Integration Center (AIC) supports unemployed immigrants in acquiring jobs and how the practical work helps immigrants in entering the labour market. It employs qualitative research approach through semi-structured interviews staff members at AIC and municipal commissioners of education and labour market in the municipality of Malmö. Its aim is to examine how governmental setup guidelines were represented in the practical work. These guiding principles of the organization are presented at the top of municipality. The findings suggest that even if the staff has no knowledge of the official measures of the integration plans, they have Implemented the aims and criteria in their work with the immigrants.
Det vardagliga arbetet på ett bemanningsföretag : - samt hur dess ledare hanterar de problem som uppstår En fallstudie på Maxkompetens
The everyday work at a staffing agency and how its leaders deal with the problems that appears: A case study at Maxkompetens.The purpose of this paper is to increase the understanding of how leaders at a staffing company deal with the everyday problems that arise from a geographically dispersed workforce.The staffing industry has grown by 30-40 percent annually and has over the past 15 years been the fastest growing industry in Sweden. This shows that the interest and demand for the staffing industry and its activities are now rising at an increasingly faster pace. This is an industry that is operating under specific conditions and with a geographically dispersed workforce. This will make the leaders of a staffing company to an important link between the staffing leaders and the staffing personnel.The relationship between the staffing company's leaders and its personnel is important, but not completely trouble free. Difficulties arise in that the employees may be located in different places and at various client companies with the result that the leaders of the staffing company cannot have a daily personal contact with their geographically dispersed personnel.We have used a qualitative approach on our paper and our empirical methodology has been a case study with ethnography and interviews.
Det virtuella studierummet : kvantitativ studie av ABF:s DVS
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.
Att äta kakan och ha den kvar : En hållbarhetsprövning av John Haughts evolutionsteologi
From underwater boat to submarine ? The development of the Swedish submarine service 1945-1960 The scope of this essay is the development of the Swedish submarine service during the period 1945-1960. The aim is to answer the following questions:- What kind of new technology did Sweden acquire when salvaging the German type XXI submarine off Gothenburg at the end of World War II?- In what respect did this technology differ from that of the Royal Swedish Navy and did it subsequently contribute to the tactical and operational development?- What tactical and operational development was accomplished between 1945-1960?The timeframe, 1945-1960, was chosen since this is when the analysis of the salvaged type XXI submarine and related effects was conducted. Furthermore, it is also during this time that the Swedish submarine service is beginning to evolve as a result of the new knowledge mentioned above and the experiences made by both the allies and the Germans during World War II.The theoretical framework primarily refers to the theories on naval warfare by Sir Julian Corbett.
Kommunikation och samarbete vid distansundervisning : ur den administrativa och tekniska personalens synvinkel
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.
Leverantörsrelaterade produktionsstörningar : en kvalitativ undersökning på Volvo Cars Uddevalla
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.
Attityder om programutveckling : en förstudie i hur programvaruutvecklares inställning påverkar deras arbete
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.
GIS-analys för framtagning av korridorer som visar lämplig lokalisering av gasledning
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.
Talsyntesen ? Dyslektikerns glasögonoch ett stöd för många läs- och skrivsvaga
According to the National Agency for Education 06-06-2010 are approximately 115 000 students graduating from Secondary School in the year of 2010.Out of these students, we know that thousands of them are hampered by reading and writing disabilities in various degrees. Have these students been given the best support needed when it comes to writing and reading?Compensation may be perceived as a goal for the pupil to catch up with the rest of the educational group or as a vehicle to go round the difficulties. In Sweden, diagnosed dyslexics are not allowed to use speech synthesis, a compensatory technical aid, during the 9th degree national tests.This study?s purpose is to discover if the usage of speech synthesis during the national test of Swedish and reading comprehension might work as a motivation booster for the students and consequently increase their test scores.This is a quantitative study including study including 15 pupils with diagnosed reading and writing disabilities.
Affärssystem som stöd för ledningssystem samt motiv för att integrera ledningssystem
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.
Användarvänlighet i GNOME : en utvärdering av studenters inställning
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.
Indirekta miljöaspekter på kontoret för Hållbart Samhälle, Trollhättans Stad
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.
Fysikalisk modellering av klimat i entreprenadmaskin
This masters thesis concerns a modeling project performed at Volvo Technology in Gothenburg, Sweden. The main purpose of the project has been to develop a physical model of the climate in construction vehicles that later on can be used in the development of an electronic climate controller. The focus of the work has been on one type of wheel loader and one type of excavator. The temperature inside the compartment has been set equal to the notion climate. With physical theories about air flow and heat transfer in respect, relations between the components in the climate unit and the compartment has been calculated.
Vilka möjligheter uppstår vid kombinationen visionsystem - "touch screen" panel
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.