Yahtzee is a game based on luck. Yet there are algorithms designed to give an optimal result and succeeds in doing so. This report compares the end result of an optimal algorithm to an algorithm that has been modified for the multiplayer scenario. The modified algorithm tries to win over the optimal algorithm through taking greater risks in its decisions when falling behind in points. The results show that it is not favorable to do so.

A key part in the development and verification of digital systems is simulation. But hardware simulators are expensive, and software simulation is not fast enough for designs with a large number of gates. As today?s digital zesigns constantly grow in size (number of gates), and that trend shows no signs to end, faster simulators handling millions of gates are needed. We investigate how to create a software gate-level simulator able to simulate a high number of gates fast.

Sudoku is a popular game of logic in the form of a puzzle. Sudoku puzzles are printed daily in Swedish newspapers. The challenge of solving these puzzles have inspired many programmers to develop Sudokusolving algorithms. These algorithms use different approaches in order to quickly and efficiently solve the puzzles. One such approach is the use of logical strategies initially developed for human players.

I denna rapport predikteras livslängden, med avseende på utmattning, för en hjullastarskopa. Två av de mest kritiska svetsarna utvärderas enligt IIW:s (International Institute of Welding) rekommendationer genom nominella spänningsmetoden, hot spot-metoden och effective notch-metoden. Beräkningarna utförs med hjälp av finita elementmetoden. Genom att utföra töjningsmätningar på hjullastarskopan i drift erhålls spänningsdiagram. Dessa uppmätta spänningsdiagram analyseras med rain-flow count-metoden.

IDCT (Inverse Discrete Cosine Transform) is a common algorithm being used with image and sound decompression. The algorithm is a Fourier related transform which can occur in many different types like, one-dimensional, two-dimensional, three-dimensional and many more.The goal with this thesis is to create a fast and low effect version of two-dimensional IDCT algorithm, where techniques as multiple-constant multiplication and subexpression sharing plus bit-serial and bit-parallel arithmetic are used.The result is a hardware implementation with power consumption at 19,56 mW..

The aim of this thesis project is to produce an algorithm for finding a topologicalrepresentation of a polygon, called a straight skeleton, using floating pointarithmetic. Various straight skeleton algorithms are examined and discussed witha focus on time complexity and one is chosen for implementation. This implementationis then compared with the open source library CGAL with regards torunning time. The result is an algorithm which is based on an algorithm by Felkeland Obdrzalek and which, for polygons with more than five thousand vertices andthree significant digits representing points, runs around 25% faster than CGALsimplementation. Complications regarding the use of floating-point arithmetic arealso discussed..

Randomness is a complex area of computer science, where only pseudo random numbers are possible to generate algorithmically.This report presents established algorithms for random number generation by conducting a basic study of relevant literature, while testing distribution and speed of the algorithms contained within the C++11 Random library. The results are compared to the algorithm XORShift and a modified version of it. The study shows that the modified algorithm passes all tests in Small Crush, andthat the run time is shorter than for those in the Random library. The conclusion is that it is possible to, with simple means, modify an algorithm to outperform the algorithms of the C++11 Random library..

The objective of this work was to evaluate and compare three field methods for detection of mastitis, California Mastits Test (CMT), DeLaval cell counter DCC (DCC) and FMA2001 Farm Milk Analyzer (FMA2001). Furthermore, to investigate at what cell count level clinical symptoms of mastitis are seen, and finally to check if the clinical findings and cell counts could be related to bacteriological findings. DCC and FMA2001 are new analytic instruments to be used on dairy farms for detection of mastitis. CMT has been a widely used cow-side-test of milk quality in mastitis control efforts, but it cannot be used for estimating cell counts in scientific studies or investigations. Two hundred and eight quarter milk samples from 52 cows were analysed with DCC and CMT, and 168 of these samples with FMA2001. Microbiological examination was done on 38 milk samples with CMT scores of 4 and 5.

 Conclusion:Medical treatment may have a role in platelet count after transfusion. Since the TACSI platelets passed the quality requirements, and the vast majority of patients platelet count increased after TACSI platelet transfusion, the TACSI platelets will replace the old method to produce platelets at the Uppsala University hospital.  Methods: A new approach that pools 8 buffy coats (TACSI platelets) that were separated into 2 units instead of 4-6 buffy coats pooled to 1 unit was investigated in this study. After the platelets were extracted from the buffy coats their quality was controlled and subsequently the platelet product was evaluated in 96 patients. Results: The results showed that 80 % of the platelet units passed the European quality requirements. Further, the platelet count was increased in most patients that received TACSI platelets. Conclusion: Medical treatment may have a role in platelet count after transfusion.

In our modern society, time is important. Technology is used in countless ways to faster get us from one point to another. The purpose of this report is to inquire whether there is a way to implement an option for personnel at Swedish hospitals to claim priority on an elevator call, and to do this in an efficient way. An ordinary elevator system has been simulated with an implementation of textit{Nearest Car algorithm}, an algorithm which calculates the most suitable elevator car to serve a specific call considering the distance between the call floor and the car and the direction. Along with this algorithm, different ways to handle priority calls has been implemented to see how they affect the mean transport time for both passengers with priority and regular passengers in the elevator.

Two haematological instruments intended for small animal clinic use were evaluated at the Department of Clinical Chemistry, Swedish University of Agricultural Sciences (SLU), Uppsala, Sweden. The QBC-V and Vet abc were compared to a reference instrument, the Cell-Dyn 3500. Fresh blood samples were obtained from canine and feline patients from the University Veterinary Hospital, SLU. The QBC-V was used for 111 canine samples and 78 canine blood samples were analysed with Vet abc. From cats, 23 samples were analysed with both instruments.

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..

This thesis processes the work of developing CPU code and GPU code for Thomas Kaijsers algorithm for calculating the kantorovich distance and the performance between the two is compared. Initially there is a rundown of the algorithm which calculates the kantorovich distance between two images. Thereafter we go through the CPU implementation followed by GPGPU written in CUDA. Then the results are presented. Lastly, an analysis about the results and a discussion with possible improvements is presented for possible future applications..