Signal Processing and patternrecognition algorithm for monitoringParkinson’s disease.

This masters thesis describes the development of signal processing and patternrecognition in monitoring Parkison’s disease. It involves the development of a signalprocess algorithm and passing it into a pattern recogniton algorithm also. Thesealgorithms are used to determine , predict and make a conclusion on the study ofparkison’s disease. We get to understand the nature of how the parkinson’s disease isin humans.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

A Genetic Algorithm for Solar Boat

Genetic algorithm has been widely used in different areas of optimization problems. Ithas been combined with renewable energy domain, photovoltaic system, in this thesis.To participate and win the solar boat race, a control program is needed and C++ hasbeen chosen for programming. To implement the program, the mathematic model hasbeen built. Besides, the approaches to calculate the boundaries related to conditionhave been explained. Afterward, the processing of the prediction and real time controlfunction are offered. The program has been simulated and the results proved thatgenetic algorithm is helpful to get the good results but it does not improve the resultstoo much since the particularity of the solar driven boat project such as the limitationof energy production

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

University Scheduling using Genetic Algorithm

The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible and optimizedschedule, and it is already proved as an NP Complete (1) [1]. The basic idea behind this studyis to investigate the performance of Genetic Algorithm on general scheduling problem underpredefined constraints and check the validity of results, and then having comparative analysiswith other available approaches like Tabu search, simulated annealing, direct and indirectheuristics [2] and expert system. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems and later analysis will prove this argument. The programis written in C++ and analysis is done by using variation in various parameters.

University Timetabling using Genetic Algorithm

The field of automated timetabling and scheduling meeting all the requirementsthat we call constraints is always difficult task and already proved as NPComplete. The idea behind my research is to implement Genetic Algorithm ongeneral scheduling problem under predefined constraints and check the validityof results, and then I will explain the possible usage of other approaches likeexpert systems, direct heuristics, network flows, simulated annealing and someother approaches. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems. The program written in C++ and analysisis done with using various tools explained in details later.

Reklambyråanställdas åsikter om yrkesrollen med fokus på kreativitet och kundrelationer : Semi-strukturerade djupintervjuer med art directors och originalare

Studiens syfte var att undersöka byråanställda art directors och originalares olika perspektiv på och förhållningssätt till sin yrkesroll med särskilt fokus på kreativitet och kundrelationer.Nio semi-strukturerade djupintervjuer genomfördes med sex art directors och fyra originalare. Respondenterna valdes ut genom ett kombinerat strategiskt bekvämlighetsurval från nio reklambyråer.Professionalism inom yrkesrollen visade sig vara något som respondenterna inte reflekterat över men det framkom att det främst handlar om hur art directors och originalare förhåller sig till kunden. Dessutom framkom det att respondenterna såg variation i arbetet som en positiv aspekt av yrket medan de såg prestationsångest och utomståendes oförståelse av yrket som negativa.Det framkom även att art directors och originalare i första hand ser på kreativitet som problemlösning, dock såg de olika på problemlösning i sina respektive roller. De använde sig av samma metoder för att finna inspirationsamt hanterade ångest på liknande sätt.Studien visade även att kunden och kundrelationen spelade en stor roll för yrket och ämnet berördes återkommande i respondenternas svar under intervjuernas gång. De använde sig av samma metoder för att finna inspiration

Pro-premiär eller pro-president? : Om distinktionen mellan parlamentarism, presidentialism och semi-presidentialism

Propremiar or pro-president? On the distinction between parliamentarism, presitentialism and semi-presidentialism. From comparative research on the constitutional development in Central and Eastern Europe and also from the longstanding debate on whether parliamentarism or presidentialism best facilitates democracy, it is apparent that there has been and continues to be, a certain degree of confusion concerning the concepts of semi-presidentialism and presidentialism. Different scholars mean different things by the terms and therefore classify countries differently. In this article I argue that the conceptual dichotomy between pro-premiär (premier-presidentialism) and pro-president systems (presidentparliamentary systems) provide the best solution to several of the problems related to categorising constitutional types, most importantly perhaps to the presidential power dilemma. I, furthermore, employ these concepts on the post-communist constitutional systems and try to reveal patterns with regard to presidential power, geographical region and democratisation.

Towards Presidential Rule in Ukraine : Hybrid Regime Dynamics under Semi-Presidentialism

This article sets out to analyse recent regime developments in Ukraine in relation to semi-presidentialism. The article asks: to what extent and in what ways theoretical arguments against semi-presidentialism (premier-presidential and president-parliamentary systems) are relevant for understanding the changing directions of the Ukrainian regime since the 1990s? The article also reviews the by now overwhelming evidence suggesting that President Yanukovych is turning Ukraine into a more authoritarian hybrid regime and raises the question to what extent the president-parliamentary system might serve this end. The article argues that both kinds of semi-presidentialism have, in different ways, exacerbated rather than mitigated institutional conflict and political stalemate. The return to the president-parliamentary system in 2010 – the constitutional arrangement with the most dismal record of democratisation – was a step in the wrong direction. The premier-presidential regime was by no means ideal, but it had at least two advantages. It weakened the presidential dominance and it explicitly anchored the survival of the government in parliament. The return to the 1996 constitution ties in well with the notion that President Viktor Yanukovych has embarked on an outright authoritarian path.