The increasingly adapted technology called blockchain can be viewed as a distributed append-only time-stamped data structure which is made possible by a distributed peer-to-peer network. The network uses cryptography and different consensus mechanisms to ensure immutability, security, transparency, and speed in a decentralized fashion. A permissionless decentralized autonomous organization (DAO) is an application deployed on a blockchain that enables people to govern and coordinate themselves in a decentralized manner through self-executing rules where anyone can join. A foundational function of a DAO is the voting system which dictates how the governance of the DAO is conducted. Voting systems in DAOs are currently not well researched and the currently used solutions have flaws, they are either not secure or they have the risk of resulting in unfair outcomes. This is the problem that this project focuses on. The problem was approached by conducting research in the field and through the conclusions of the research a new solution for a voting system was proposed and implemented. The proposed solution can be used to gain inspiration in further studies or be tested and developed to evaluate it in practice.

Background. In the pursuit of realism in rendering, a feature that may get overlooked is the sky and atmosphere—especially the consumer who might suspect that something is off without identifying it. A critical aspect of sky rendering is the color that should be dynamic with the time of day to be realistic. With multiple ways of rendering a sky and atmosphere, it is unclear which method best suits the circumstance. Objectives. The objective of this study was to make that decision clearer with both the visual aspect and the realism. It was also crucial that performance was not affected too heavily by the techniques. Methods. As the first objective can be subjective, we decided to ask several people through a survey to get a more objective answer. In the survey, we presented the participants with two images of identical scenes where the only difference between them was the method of rendering the sky. We then asked them which picture they thought was the most aesthetically pleasing and which they thought was the most realistic. The second part of the study was to test the performance of the techniques. We recorded the average frame time through a C\# script over all of the scenes. Results. When using the settings we established, the Physically-based atmosphere scored lower in both realism and aesthetics in the first visual test but scored higher in realism in all of the scenarios for the second visual test. Both the average frame rate and frame time did end up in favor of the Physically based atmosphere. Conclusions. The outcome of this study was surprising, we had thought that the Physically-based atmosphere would score higher in both realism and aesthetics. The performance of the Physically based atmosphere method proved to be much more optimized than the Unity procedural skybox than we would have thought.

The job scheduling problem is a type of scheduling problem where a list of jobs and machines are given. A solution consists of a schedule where each job is assigned to one or multiple machines at a certain time. In this study, a multiobjective evolutionary algorithm called NSGA-II was applied to optimize schedules for a particular scheduling problem given by a board game made by the Swedish educative company INSU. The scheduling problem features novel restrictions on the schedules, such as transportation delay between the jobs, skill requirements for the machines to fulfill. The board game also allows pre-emption, i.e., that the jobs can be paused and resumed by the same or other machines. These restrictions impose a challenge for creating a genetic representation for the evolutionary algorithm and a decoder which decodes the representation into a schedule. This problem was solved by proposing a new genetic representation based on previous work and testing it with a few crossover and mutation methods in two experiments. The experiments found that the new representation is effective in creating high-quality schedules, but it is inconclusive as to which crossover and mutation method is the most effective. The decoder’s execution time was also measured, which showed that the decoder scales rapidly with an increasing number of jobs. Despite this, the new representation and decoder are useful for optimizing other scheduling problems with pre-emption and other restrictions.

Den teknologiska framfarten har föranlett dagens situation där datorer med tillhörande datorskärmar utav olika slag är en del utav vardagen. De används i många olika fall, dels då statliga myndigheter och stora organisationer skall utföra diverse ärenden. Hantering av dessa datorskärmar utförs med hjälp utav olika skärmhanteringsmetoder som försätter dessa i viloläge. Att särskilja skärmhanteringsmetoder baserat på dess egenskaper är dock svårt då det idag inte finns någon anpassad utvärderingsmodell för att utvärdera skärmhanteringsmetoder.   Denna studie tillhandahåller en utvärderingsmodell för att med hjälp utav denna kunna välja den mest optimala skärmhanteringsmetoden. Syftet med att välja en optimal skärmhanteringsmetod är att samtidigt kunna minska strömförbrukningen hos datorskärmar. Studien är av kvalitativ karaktär med induktiv ansats. Det har skett ett framtagande av “MUSk”-modellen (Modell för Utvärdering av Skärmhanteringsmetoder). Det gjordes i samband med en litteraturstudie samt intervjuer där data samlades in. De hölls med personer inom statliga myndigheter vars kompetens var relevant för området. MUSk-modellen är resultatet för denna studie och kan tillämpas på skärmhanteringsmetoder för att särskilja dem. För att verifiera MUSk-modellens legitimitet så utvärderades den. Valda skärmhanteringsmetoder utvärderades genom att tillämpa MUSk-modellen för att erhålla en slutsats om vilken metod som är den mest optimal. Baserat på elementen i den framtagan MUSk-modellen erhöll Windows egna Power Management System det bästa utfallet.Denna studie skall tillhandahålla en utvärderingsmodell för att med hjälp utav denna kunna välja den mest optimala skärmhanteringsmetoden. Syftet med att välja en optimal skärmhanteringsmetod är att samtidigt kunna minska strömförbrukningen hos datorskärmar. Studien är av kvalitativ karaktär med induktiv ansats. Det har skett ett framtagande av “MUSk”-modellen (Modell för Utvärdering av Skärmhanteringsmetoder). Det gjordes i samband med en litteraturstudie samt intervjuer där data samlades in. De hölls med personer inom statliga myndigheter vars kompetens var relevant för området. MUSk-modellen är resultatet för denna studie och kan tillämpas på skärmhanteringsmetoder för att särskilja dem. För att verifiera MUSk- modellens legitimitet så utvärderades den. Valda skärmhanteringsmetoder utvärderades genom att tillämpa MUSk-modellen för att erhålla en slutsats om vilken metod som är den mest optimal. Baserat på elementen i den framtagan MUSk-modellen erhöll Windows egna Power Management System det bästa utfallet. / Forward-thinking technology has led to the situation today where computers and belonging computer screens are a part of everyday life. They are used in many different cases, as well as government agencies and organizations to accomplish various assignments. Management of these computer screens are done with the help of screen management methods that put them to sleep mode. Distinguishing these management methods based on their characteristics is difficult and presently there is no custom evaluation model for this.   This study provides an evaluation model that is able to choose an optimal screen management method by applying it. The purpose of choosing an optimal screen management method is to simultaneously decrease the power consumption of computer screens. The study is of qualitative nature with an inductive approach.  This led to the production of an evaluation model "MUSk" (Model for Evaluating Screen management methods). It was created in relation with interviews and litterature studies that were used to collect data. To verify the legitimacy of the MUSk-model it was evaluated. Screen management methods evaluated by applying MUSk-model to then give an opinion on the display management method that was most optimal. The MUSk-model is presented as a result of this study and can be applied to distinguish screen management methods. Based on the elements of the MUSk-model it was determined that Windows Power Management was the most optimal screen management method.

Modern computer architectures expose an increasing number of parallel features supported by complex memory access and communication structures. Currently used task scheduling techniques perform poorly since they focus solely on balancing computation load across parallel features and remain oblivious to locality properties of support structures. We contribute with locality-aware task scheduling mechanisms which improve execution time performance on average by 44\% and 11\% respectively on two locality-sensitive architectures - the Tilera TILEPro64 manycore processor and an AMD Opteron 6172 processor based four socket SMP machine. Programmers need task performance metrics such as amount of task parallelism and task memory hierarchy utilization to analyze performance of task-based programs. However, existing tools indicate performance mainly using thread-centric metrics. Programmers therefore resort to using low-level and tedious thread-centric analysis methods to infer task performance. We contribute with tools and methods to characterize task-based OpenMP programs at the level of tasks using which programmers can quickly understand important properties of the task graph such as critical path and parallelism as well as properties of individual tasks such as instruction count and memory behavior. / <p>QC 20140212</p>

The increasing usage of electronics and software in a modern automobile enables realization of many advanced features. One such feature is autonomous driving. Autonomous driving means that a human driver’s intervention is not required to drive the automobile; rather, theautomobile is capable of driving itself. Achieving automobile autonomyrequires research in several areas, one of which is the area of automotive electrical/electronics (E/E) architectures. These architectures deal with the design of the computer hardware and software present inside various subsystems of the vehicle, with particular attention to their interaction and modularization. The aim of this thesis is to investigate how automotive E/E architectures should be designed so that 1) it ispossible to realize autonomous features and 2) a smooth transition canbe made from existing E/E architectures, which have no explicit support for autonomy, to future E/E architectures that are explicitly designed for autonomy.The thesis begins its investigation by considering the specific problem of creating autonomous behavior under cooperative driving condi-tions. Cooperative driving conditions are those where continuous wireless communication exists between a vehicle and its surroundings, which consist of the local road infrastructure as well as the other vehicles in the vicinity. In this work, we define an original reference architecture for cooperative driving. The reference architecture demonstrates how a subsystem with specific autonomy features can be plugged into an existing E/E architecture, in order to realize autonomous driving capabilities. Two salient features of the reference architecture are that it isminimally invasive and that it does not dictate specific implementation technologies. The reference architecture has been instantiated on two separate occasions and is the main contribution of this thesis. Another contribution of this thesis is a novel approach to the design of general, autonomous, embedded systems architectures. The approach introduces an artificial consciousness within the architecture, that understands the overall purpose of the system and also how the different existing subsystems should work together in order to meet that purpose.This approach can enable progressive autonomy in existing embedded systems architectures, over successive design iterations. / <p>QC 20130412</p>

Background. In the field of risk management, focusing on digital infrastructure, there is an uncertainty about which methods and algorithms are relevant and correct. Behind this uncertainty lies a need for testing and evaluation of different risk management analysis methods in order to determine how effective they are in relation to each other. Purpose. The purpose of this thesis is to manufacture a reproducible and universal method of comparison between risk management analysis methods. This is based on the need to compare two risk assessment analysis methods. One method relies solely on impact information and the other expands on that concept by also utilizing information about the network environment. Method. A network is modeled into a scenario. A risk assessment is conducted on the scenario by risk assessment experts which will be used as the correct solution. The tested risk management analysis methods are applied to the scenario and the results are compared with the expert risk assessment. The distance between the assessments are measured with Mean Square Error; A smaller distance between one assessment and the experts assessment indicates that it is more correct. Result. The result shows that it is possible to reproducibly compare risk management analysis methods by comparing the respective output with an established truth. The conducted comparison shows that a method that use network environment data is capable of producing a more correct assessment than one which simply uses impact data. Conclusion. A scenario based approach to compare risk management analysis methods for risk assessment has been proven effective.

Prevas Development AB vill effektivisera service, underhåll, utveckling, och felsökning genom att simulera en anodiseringsprocess på en enkortsdator. Genom att simulera denna process kan Prevas undvika de kemiska substanser som ingår i en verklig anodiseringsprocess. Svårigheten i projektet ligger i att leverera rätt information till rätt plats och i rätt tid. Syftet med vårt examensarbete var att välja en lämplig simuleringsplattform och på denna plattform bygga en prototyp av en simulator. Det ingick också i vårt arbete att välja utvecklingsmiljö. Efter en kombinerad teoretisk och praktisk utvärdering av ett antal möjliga plattformar och utvecklingsmiljöer föll valet på BeagleBone Black och att köra lastsimulatorn på enkortsdatorns huvudprocessor A8. Vi valde programmeringsspråket Python till det grafiska gränssnittet och informationshanteringen då det lämpar sig väl till dessa ändamål. Till datakommunikationen valdes C för dess snabbhet. Vi lyckades att få fram en simulator som kan plocka ut rätt information och sända den till rätt plats i rätt tidsintervall. Detta bevisades genom att mäta över den last som simulatorn skall leverera information till och jämföra detta mot en verklig anodiseringsprocess. / <p>Presentation över Zoom i enlighet med Folkhälsomyndighetens rekommendationer om distansstudier.</p>

Historically virtual machines have been the backbone of the cloud-industry, allowing cloud-providers to offer virtualized multi-tenant solutions. A key aspect of the cloud is its flexibility and abstraction of the underlying hardware. Virtual machines can enhance this aspect by enabling support for live migration and failover. Live migration is the process of moving a running virtual machine from one host to another and failover ensures that a failed virtual machine will automatically be restarted (possibly on another host). Today, as containers continue to increase in popularity and make up a larger portion of the cloud, often replacing virtual machines, it becomes increasingly important for these processes to be available to containers as well. However, little support for container live migration and failover exists and remains largely experimental. Furthermore, no solution seems to exists that offers both live migration and failover for containers in a unified solution. The thesis presents a proof-of-concept implementation and description of a system that enables support for both live migration and failover for containers by extending current container migration techniques. It is able to offer this to any OCI-compliant container, and could therefore potentially be integrated into current container and container orchestration frameworks. In addition, measurements for the proof-of-concept implementation are provided and used to compare the proof-of-concept implementation to a current container migration technique. Furthermore, the thesis presents an overview of the history and implementation of containers, current migration techniques, and metrics that can be used for measuring different migration techniques are introduced. The paper concludes that current container migration techniques can be extended in order to support both live migration and failover, and that in doing so one might expect to achieve a downtime equal to, and total migration time lower than that of pre-copy migration. Supporting both live migration and failover, however, comes at a cost of an increased amount of data needed to be transferred between the hosts.

With an ever-increasing percentage of the human population connected to the internet, the amount of data produced and processed is at an all-time high. Edge Computing has emerged as a paradigm to handle this growth and, combined with 5G, enables complex time-sensitive applications running on resource-restricted devices. This master thesis investigates the use of WebAssembly in the context of computa¬tional offloading at the Edge. The focus is on utilizing WebAssembly to move computa¬tional heavy parts of a system from an end device to an Edge Server. An objective is to improve program performance by reducing the execution time and energy consumption on the end device. A proof-of-concept offloading system is developed to research this. The system is evaluated on three different use cases; calculating Fibonacci numbers, matrix multipli¬cation, and image recognition. Each use case is tested on a Raspberry Pi 3 and Pi 4 comparing execution of the WebAssembly module both locally and offloaded. Each test will also run natively on both the server and the end device to provide some baseline for comparison.