Environment friendly transports are one of the main topics in the industry and society today.Shell organizes an annual university competition called Shell Eco Marathon. The goal is to buildthe car that consumes the least fuel during a race. KTH participated for the first time in 2006.The engine for this competition, DoubleTwo, has been developed within the school. Theprinciple is a two stroke counter piston HCCI engine with variable compression ratio. HCCIstands for homogenous charge compression ignition.

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.

This thesis explores the possibilities of avoiding the issues generally associated with compression of noisy imagery, through the usage of vector quantization. By utilizing the learning aspects of vector quantization, image processing operations such as noise reduction could be implemented in a straightforward way. Several techniques are presented and evaluated. A direct comparison shows that for noisy imagery, vector quantization, in spite of it's simplicity, has clear advantages over MPEG-4 encoding..

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.

Modern semiconductor design methods makes it possible to design increasingly complex system-on-a-chips (SOCs). Testing such SOCs becomes highly expensive due to the rapidly increasing test data volumes with longer test times as a result. Several approaches exist to compress the test stimuli and where hardware is added for decompression. This master?s thesis presents a test data compression method based on a modified facsimile code.

This report is a thesis work for a B.Sc. in Forestry exam at the School for Forest Engineers, SLU. The work was an assignment from Sydved Energy AB. The aim of the work was to compare the operational productivity between two kinds of forwarders for extraction of harvesting residues, one forwarder with a special compression device and one ordinary, slightly modified forwarder. Two sites were studied for each forwarder. The study shows that the annual production was about 11,000 m3 higher for the traditional forwarder. The cost for the traditional forwarder was SEK 0.9 lower per m3.

With the advance in computer and network technologies, multimedia systems and Internet applications are becoming more popular. As broadband network is prevailing, more clients are able to watch streaming videos or to play multimedia data over the Internet in real-time. Consequently, there is an increasing demand in the Internet for streaming video systems. As the run-time environment of such applications tends to be dynamic, it is imperative to handle transient overloads effectively. The goal of this work is to develop an algorithm that would provide a robust and controlled behavior of the video system so that important data is delivered on time to the video clients.

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

Clustered Columnstore Indexes (CCI) and In-Memory Online Transaction Processing (OLTP) are two new techniques that were introduced with Microsoft?s new database management system SQL Server 2014.The thesis analyzes these two techniques, describes the theory behind them and also the background information that needs to be known to understand more of the new techniques. Performance tests of the new techniques have been performed to see how much faster response time we can get and less storage we need to use where the result is represented by performance diagrams and a compression diagram. This thesis is a cooperative work with a company called Trimma and the result is used as support to decide if these new techniques could be of advantage for the company.The test consists of five test queries with different purposes. The result is illustrated by diagrams that show the result and another diagram that shows how much the data gets compressed with the different techniques.

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

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.

Detta är ett 10-poängs examensarbete på C-nivå, som vi under vårterminen avlagt vid Karlstads universitet. Målet med vårt projekt var att skapa ett nytt grafiskt gränssnitt till en komprimeringsalgoritm vid namn PAZ. Nuförtiden finns en hel uppsjö av grafiska gränssnitt till komprimeringsalgoritmer, men inget av dem stöder möjligheten att plugga in en egenutvecklad algoritm. Därför var vi tvungna att skapa vårt eget gränssnitt, som förutom PAZ också skulle stödja ZIP, RAR och andra etablerade algoritmer. Vi har alltså skapat ett grafiskt gränssnitt, vilket är anpassat för en implementation av den nya PAZ-algoritmen.Algoritmen har utvecklats av vår uppdragsgivare Martin Larsson.

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