Syfte: Studiens syfte var att undersöka om BKC-tavlans ackommodativa stimulus ändras av att tillsätta optotyper av olika form, storlek och placering till den klassiska BKCtavlan.Metod: Fem olika tavlor tillverkades och jämfördes dels subjektivt med ett högneutralt BKC-test och dels objektivt med en vågfrontssensor av märket Complete Ophtalmic Analysis System (COAS HD VR?). En av tavlorna var den traditionella BKC-tavlan, de andra hade optotyper med varierande storlek, form och placering. Mätningarna utfördes på 40 cm. Mätningarna gjordes på 30 personer mellan 18 och 40 år.Resultat: De fem tavlorna visade ingen statistiskt signifikant skillnad i ackommodativ respons, vare sig med BKC eller COAS?.

Denna rapport sammanfattar resultat av ett examensarbete på en högskoleingenjörsutbildning som utfördes av två studenter på Malmö högskola. Arbetets syfte var att genomföra en mängd olika experiment med accelerometer, barometer och GPS i en modern smarttelefon. Ett antal scenarier för en tänkbar sensoranvändning i applikationer formulerades för att vägleda olika experiment. Experimentdata dokumenterades noggrant och analyserades med avsikten att skapa en databank med information för framtida studier. Analys av data inkluderar höjdbestämning i naturen och i byggnader med hjälp av barometersensor, geografisk position med hjälp av GPS, hastighet och acceleration under en hissfärd med hjälp av accelerometer. Rapporten innehåller en omfattande litteraturstudie om användning av sensorer vid inomhuspositionering. Från analys av mätdata, kom vi fram till slutsatsen att är möjligt att beräkna höjden från barometerdata med bra noggrannhet under optimala omständigheter. GPS höjden från mätningarna har stor felmarginal jämfört med den verkliga höjden samt när den jämförs med den beräknade höjden från barometern. Genom att utföra en numerisk integration på accelerometer-data kom vi fram till att det är möjligt att beräkna ungefär hur långt man har färdats med en hiss, dock att vissa detaljer måste tas i beaktning..

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 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.

Syfte: Uppsatsens syfte är att undersöka huruvida det går att skapa överavkastning påden svenska aktiemarknaden genom att använda sig av strategin 52?week highmomentum. Uppsatsen syftar även till att undersöka huruvida eventuell överavkastningkan härledas till bolagsstorlek. Metod: Aktierna i dataurvalet rangordnas i förhållande till sina årshögsta. Portföljenkonstrueras genom att gå lång i de 30 % av aktierna som ligger närmast sitt årshögstaoch gå kort i de 30 % av aktierna som ligger längst ifrån sitt årshögsta.

Idrottsskador har konstaterats vara både fysiskt och psykiskt fenomen, och under de senaste åren har ett ökat intresse för den psykologiska faktorn visat sig. Syftet med studien var att undersöka om det finns något samband mellan upplevd stress och frekvensen idrottsskador hos elithandbollsspelare samt att undersöka om det finns något samband mellan grundanspänning (trait anxiety) och situationsspecifik anspänning (state anxiety). Ett tredje syfte är att undersöka huruvida en idrottares stressnivå varierar över tid och jämföra detta med de aktuella spelarnas skadefrekvens. Informanterna var 20 manliga elithandbollsspelare (19-32 år) i elitserien i Sverige, under säsongen 06/07, fördelat på två klubbar. Urvalet som gjordes var ett strategiskt urval, baserat på klubbarnas geografiska lokalisering.

Abstract Title: Yes logo! What defines a good logo? Authors: Fredrik Dahlin and Vladimir Zunkovic Supervisor: Klaus Solberg Söilen. Department: School of Management, Blekinge Institute of Technology. Course: Bachelor?s thesis in Business Administration, 10 credits. Purpose: To find out which are the defining characteristics of a good logo, from a scientific point of view. Method: We have used a qualitative method consisting of interviews with experts within the marketing area with the goal to test the Swedish point of view against the one in the litterature. We also used a quantitative method to investigate the publics attitude towards the testlogos we created. The purpouse of this poll is to test different colourcombinations and how the marketsegments feel about them. In this poll we used statistical methods to make sure that the agelimits and the number of male and female respondents are correct. We executed another quantitative study towards Swedish marketing companies to create an idea of the businesses thoughts about a good logo are. Results: A good logo is a simple symbol or geometrical form consisting of a combination of colours that reflect the company?s core values, visions and goals.

The aim of this paper is to examine the capacity for ethical reasoning of Swedish certi-fied auditors in the five largest accounting firms in Stockholm, and also how ethics courses affect the auditors' ability to ethically statement. To calculate the auditors ability to ethical statement, questionnaire has been used. The questionnaire is based on a psychological instrument, the so-called Defining Issues Test. At the beginning of the questionnaire some questions are asked about the ethics courses. From the questionnaire a calculation was made of an average index called p-score (Principled score).

The aim of the study was to investigate if the Grazemore Decision Support System (DSS) is able to provide a grazing management strategy that gives a high utilisation of grazed grass in milk production in the north of Scandinavia. To do this, a grazing experiment was planed and performed during the summer 2005. Simulations in the DSS were run to get a suggestion of how the cows should graze, grazing calendar 1. Deviations and updates during the season resulted in the simulated grazing calendar 2. During the experiment, the actual milk yield was recorded twice weekly. The difference between actual and predicted milk yield by Grazemore DSS was analysed statistically with regression analysis and the mean square prediction error (MSPE) was estimated.