When shortening release cycles and moving towards continuous delivery, a different approach for quality assurance may be needed than in traditional release management. To allow the transition, all stakeholders must retain a sense of confidence in the quality of release candidates. This thesis proposes a definition for confidence consisting of 30 confidence factors to take into account to ensure confidence from all stakeholders. Confidence factors have been found through interviews with 11 stakeholders, analyzed and categorized using grounded theory analysis. The found factors are grouped into two main categories: Process and Verification Results.

The thesis additionally contains a literature review of quality measurements and explores how confidence can be expressed in a continuous delivery pipeline. It is found that it is not possible to comprehensively express confidence only with metrics displayable in a pipeline when including only currently well-researched metrics, but with the combination of processes known to be followed in the organization some metrics provide coverage for many of the confidence factors.

Virtual reality (VR) provides many exciting new application opportunities, but also present new challenges. In contrast to 360° videos that only allow a user to select its viewing direction, in fully immersive VR, users can also move around and interact with objects in the virtual world. To most effectively deliver such services it is therefore important to understand how users move around in relation to such objects. In this paper, we present a methodology and software tool for generating run-time datasets capturing a user’s interactions with such 3D environments, evaluate and compare different object identification methods that we implement within the tool, and use datasets collected with the tool to demonstrate example uses. The tool was developed in Unity, easily integrates with existing Unity applications through the use of periodic calls that extracts information about the environment using different ray-casting methods. The software tool and example datasets are made available with this paper. 

Under det senaste decenniet har det i Sverige blivit allt populärare att åka motorcykel. Enobligatorisk riskutbildning för behörighet A och A1 infördes från och med den 1 november2009. Då riskutbildningen är ny har få utvärderingar gjorts.Denna studie utvärderar riskutbildningen för motorcyklister utifrån trafikskolläraresperspektiv. Målet har varit att sammanställa synpunkter och erfarenheter från lärarna påutbildningen. Ett ytterligare mål har varit att undersöka trafikskollärarnas upplevda effekter avutbildningen på elevers trafikbeteende. Sex semistrukturerade intervjuer med trafikskolläraresamt en observationsstudie på olika trafikskolor genomfördes. Utöver detta genomfördesdeltagande observation av en fortbildning där 15 trafikskollärare deltog. Resultatet frånstudien visar att lärarna anser att behovet av riskutbildningen är stort och attimplementationen av den nya riskutbildningen gått bra. Förutom att elever efter utbildningenrefererar till den, vilket enligt lärarna indikerar att de tagit till sig vad som sagts, märks det nui större utsträckning än tidigare att elever kör lugnare och tänker sig mer för i vissasituationer. Detta påtalades vara ett klart önskvärt resultat.

During the 80’s, the first train simulator was introduced in Swedish train driver education and is still the only full scale simulator being used to educate train drivers in Sweden. The reason for this seems to be a lack of educational and economic motives for an expanded usage of simulators within education and training. Energy savings within the railway domain, i.e. energy-efficient driving, is currently a topic for all train operators in Sweden. Some operators already educate their drivers in energy efficient driving and tests of energy efficiency in real traffic has shown a potential energy saving of 16 %, after drivers have completed a theoretical education in energy-efficient driving. Because there were some uncertainties in the data from the tests carried out in real traffic, where conditions and experimental procedures varied between the drivers and it also turned out that education and access to a support system while driving resulted in a small saving in energy (13 %) there was a need to examine the potential savings under controlled conditions. Therefore, a study was conducted using a train simulator. In the simulator, the researcher has full control over the data and conditions are the same for all drivers. The simulator used in the study was developed by VTI (Swedish National Road and Transport Research Institute) and modeled after an X50 Regina. The purpose of this study was to investigate whether the same theoretical education in energy-efficient driving, in combination with simulator training under ideal conditions, could contribute to the same, or better energy saving compared to the results of the tests from real traffic. Furthermore, the effect of feedback during training with regard to energy savings was also investigated. 24 train driver students were divided into three groups with 8 students in each. Two of these groups completed two sessions (reference and test session) with theoretical education and simulator training between the sessions. The last group (control group) completed two sessions (reference and test session) without education and training between the sessions. The two groups that were given theoretical education conducted their simulator training under two different conditions, where one group trained with feedback (energy consumption and rail gradient) and the other group trained without feedback. It turns out that a theoretical education in energy efficient driving, combined with 30 minutes of simulator training, resulted in a total saving of about 24 % energy for both groups. Also, considering that the control group improved their energy consumption by simply driving the simulator two times (8 % total energy saving), the energy saving was almost equal to the result of the tests in real traffic. Since the results were equal even though the conditions differed, there is reason to investigate how different driving conditions affect the outcome. There is also a need to better understand why education in combination with a support system resulted in a lower energy saving than for those who were only given education during the tests in real traffic, and also why feedback during training in the simulator did not give a detectable effect. Basically, there are many reasons to further investigate how to design simulator training and support systems for train drivers. In addition to the energy savings, the results showed that drivers improved their arrival times i.e. arrive more accurate in relation to the time table. The results suggest that there is great potential for train simulators in the Swedish train driver education, both for training and for evaluating the effects of the training.

In this thesis report we conducted research study on driver's behavior in T-Intersections using simulated environment. This report describes and discusses correlation analysis of driver's personality traits and style while driving at T-Intersections.

The experiments were performed on multi user driving simulator under controlled settings, at Linköping University. A total of forty-eight people participated in the study and were divided into groups of four, all driving in the same simulated world.

During the experiments participants were asked to fill a series of well-known self-report questionnaires. We evaluated questionnaires to get the insight in driver's personality traits and driving style. The self-report questionnaires consist of Schwartz's configural model of 10 values types and NEO-five factor inventory. Also driver's behavior was studied with the help of questionnaires based on driver's behavior, style, conflict avoidance, time horizon and tolerance of uncertainty. Then these 10 Schwartz's values are correlated with the other questionnaires to give the detail insight of the driving habits and personality traits of the drivers.

The Ontology Alignment Evaluation Initiative (OAEI) aims at comparing ontology matching systems on precisely defined test cases. These test cases can be based on ontologies of different levels of complexity and use different evaluation modalities (e.g., blind evaluation, open evaluation, or consensus). The OAEI 2021 campaign offered 13 tracks and was attended by 21 participants.This paper is an overall presentation of that campaign.

The Ontology Alignment Evaluation Initiative (OAEI) aims at comparing ontology matching systems on precisely defined test cases. These test cases can be based on ontologies of different levels of complexity and use different evaluation modalities (e.g., blind evaluation, open evaluation, or consensus).The OAEI 2020 campaign offered 12 tracks with 36 test cases, and was attended by 19 participants. This paper is an overall presentation of that campaign. 

The Ontology Alignment Evaluation Initiative (OAEI) aims at comparing ontology matching systems on precisely defined test cases. These test cases can be based on ontologies of different levels of complexity and use different evaluation modalities. The OAEI 2022 campaign offered 14 tracks and was attended by18 participants. This paper is an overall presentation of that campaign

Ontologies have been proposed as a means towards making data FAIR (Findable, Accessible, Interoperable, Reusable). This has attracted much interest in several communities and ontologies are being developed. However, to obtain good results when using ontologies in semantically-enabled applications, the ontologies need to be of high quality. One of the quality aspects is that the ontologies should be as complete as possible. In this paper we propose a first version of a tool that supports users in extending ontologies using a phrase-based approach.  To demonstrate the usefulness of our proposed tool, we exemplify the use by extending the Materials Design Ontology.

Ontologies have been proposed as a means towards making data FAIR (Findable, Accessible, Interoperable, Reusable) and has recently attracted much interest in the materials science community. Ontologies for this domain are being developed and one such effort is the Materials Design Ontology. However, to obtain good results when using ontologies in semantically-enabled applications, the ontologies need to be of high quality. One of the quality aspects is that the ontologies should be as complete as possible. In this paper we show preliminary results regarding extending the Materials Design Ontology using a phrase-based topic model.

Detta examensarbete utfördes på IDA (Institutionen för datavetenskap) vid Linköpings universitet. 

Syftet med det här examensarbetet var att utveckla ett program som skulle skapa förutsättningar för generativ konst med hjälp av MyPaint som är ett digitalt rit/målarverktyg. Metoden gick ut på att registrera vad användaren skapat för komponenter, dvs. musinteraktioner och kortkommandon, och därefter använda dem algoritmiskt.

Examensarbetet resulterades i ett program (SharpArt), som fångar musinteraktioner samt simulerar tangentbordstryckningar (kortkommandon) från och till Mypaint, vilket i sin tur skapar komponenter som används algoritmiskt. Programmet kan även positionera objektet på canvasen enligt det önskade koordinatvärdet.

Ontologies have become an important tool for representing data in a structured manner. Merging ontologies allows for the creation of ontologies that later can be composed into larger ontologies as well as for recognizing patterns and similarities between ontologies. Ontologies are being used nowadays in many areas, including bioinformatics. In this thesis, we present a desktop version of SAMBO, a system for merging ontologies that are represented in the languages OWL and DAML+OIL. The system has been developed in the programming language JAVA with JDK (Java Development Kit) 1.4.2. The user can open a file locally or from the network and can merge ontologies using suggestions generated by the SAMBO algorithm. SAMBO provides a user-friendly graphical interface, which guides the user through the merging process.

We present a decision procedure for a logic that combines (i) word equations over string variables denoting words of arbitrary lengths, together with (ii) constraints on the length of words, and on (iii) the regular languages to which words belong. Decidability of this general logic is still open. Our procedure is sound for the general logic, and a decision procedure for a particularly rich fragment that restricts the form in which word equations are written. In contrast to many existing procedures, our method does not make assumptions about the maximum length of words. We have developed a prototypical implementation of our decision procedure, and integrated it into a CEGAR-based model checker for the analysis of programs encoded as Horn clauses. Our tool is able to automatically establish the correctness of several programs that are beyond the reach of existing methods.

We propose an automatic fence insertion and verification framework for concurrent programs running under relaxed memory. Unlike previous approaches to this problem, which allow only variables of finite domain, we target programs with (unbounded) integer variables. The problem is difficult because it has two different sources of infiniteness: unbounded store buffers and unbounded integer variables. Our framework consists of three main components: (1) a finite abstraction technique for the store buffers, (2) a finite abstraction technique for the integer variables, and (3) a counterexample guided abstraction refinement loop of the model obtained from the combination of the two abstraction techniques. We have implemented a prototype based on the framework and run it successfully on all standard benchmarks together with several challenging examples that are beyond the applicability of existing methods.

We give a sound and complete fence insertion procedure for concurrentfinite-state programs running under the classical TSO memory model. Thismodel allows “write to read” relaxation corresponding to the addition of an unboundedstore buffer between each processor and the main memory. We introducea novel machine model, called the Single-Buffer (SB) semantics, and show thatthe reachability problem for a program under TSO can be reduced to the reachabilityproblem under SB. We present a simple and effective backward reachabilityanalysis algorithm for the latter, and propose a counter-example guided fence insertionprocedure. The procedure is augmented by a placement constraint thatallows the user to choose places inside the program where fences may be inserted.For a given placement constraint, we automatically infer all minimal setsof fences that ensure correctness. We have implemented a prototype and run itsuccessfully on all standard benchmarks together with several challenging examplesthat are beyond the applicability of existing methods.

We introduce MEMORAX, a tool for the verification of control state reachability (i.e., safety properties) of concurrent programs manipulating finite range and integer variables and running on top of weak memory models. The verification task is non-trivial as it involves exploring state spaces of arbitrary or even infinite sizes. Even for programs that only manipulate finite range variables, the sizes of the store buffers could grow unboundedly, and hence the state spaces that need to be explored could be of infinite size. In addition, MEMORAX in- corporates an interpolation based CEGAR loop to make possible the verification of control state reachability for concurrent programs involving integer variables. The reachability procedure is used to automatically compute possible memory fence placements that guarantee the unreachability of bad control states under TSO. In fact, for programs only involving finite range variables and running on TSO, the fence insertion functionality is complete, i.e., it will find all minimal sets of memory fence placements (minimal in the sense that removing any fence would result in the reachability of the bad control states). This makes MEMORAX the first freely available, open source, push-button verification and fence insertion tool for programs running under TSO with integer variables.

We address the problem of parameterized verification of cache coherence protocols for hardware accelerated transactional memories. In this setting, transactional memories leverage on the versioning capabilities of the underlying cache coherence protocol. The length of the transactions, their number, and the number of manipulated variables (i.e., cache lines) are parameters of the verification problem. Caches in such systems are finite-state automata communicating via broadcasts and shared variables. We augment our system with filters that restrict the set of possible executable traces according to existing conflict resolution policies. We show that the verification of coherence for parameterized cache protocols with filters can be reduced to systems with only a finite number of cache lines. For verification, we show how to account for the effect of the adopted filters in a symbolic backward reachability algorithm based on the framework of constrained monotonic abstraction. We have implemented our method and used it to verify transactional memory coherence protocols with respect to different conflict resolution policies.

We consider the verification of safety (strict se- rializability and abort consistency) and liveness (obstruction and livelock freedom) for the hybrid transactional memory framework FLEXTM. This framework allows for flexible imple- mentations of transactional memories based on an adaptation of the MESI coherence protocol. FLEXTM allows for both eager and lazy conflict resolution strategies. Like in the case of Software Transactional Memories, the verification problem is not trivial as the number of concurrent transactions, their size, and the number of accessed shared variables cannot be a priori bounded. This complexity is exacerbated by aspects that are specific to hardware and hybrid transactional memories. Our work takes into account intricate behaviours such as cache line based conflict detection, false sharing, invisible reads or non-transactional instructions. We carry out the first automatic verification of a hybrid transactional memory and establish, by adopting a small model approach, challenging properties such as strict serializability, abort consistency, and obstruction freedom for both an eager and a lazy conflict resolution strategies. We also detect an example that refutes livelock freedom. To achieve this, our prototype tool makes use the latest antichain based techniques to handle systems with tens of thousands of states.

We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded number of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification.We extend this approach by allowing specifications to be given by a class of infinite-state automata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verification, we develop a shape analysis, which tracks correlations between pairs of threads, and a novel abstraction to make the analysis practical. We have implemented our method and used it to verify programs, some of which have not been verified by any other automatic method before.

3D television using multiple views rendering is receiving increasing interest. In this technology a number of video sequences are transmitted simultaneously and provides a larger view of the scene or stereoscopic viewing experience. With two views stereoscopic rendition is possible. Nowadays 3D displays are available that are capable of displaying several views simultaneously and the user is able to see different views by moving his head.

The thesis work aims at implementing a demonstration system with a number of simultaneous views. The system will include two cameras, computers at both the transmitting and receiving end and a multi-view display. Besides setting up the hardware, the main task is to implement software so that the transmission can be done over an IP-network.

This thesis report includes an overview and experiences of similar published systems, the implementation of real time video, its compression, encoding, and transmission over the internet with the help of socket programming and finally the multi-view display in 3D format.  This report also describes the design considerations more precisely regarding the video coding and network protocols.

In this white paper, experts from the Digital Pathology Association (DPA) define terminology and concepts in the emerging field of computational pathology, with a focus on its application to histology images analyzed together with their associated patient data to extract information. This review offers a historical perspective and describes the potential clinical benefits from research and applications in this field, as well as significant obstacles to adoption. Best practices for implementing computational pathology workflows are presented. These include infrastructure considerations, acquisition of training data, quality assessments, as well as regulatory, ethical, and cyber-security concerns. Recommendations are provided for regulators, vendors, and computational pathology practitioners in order to facilitate progress in the field. (c) 2019 The Authors. The Journal of Pathology published by John Wiley amp; Sons Ltd on behalf of Pathological Society of Great Britain and Ireland.

Cars are getting more technically advanced and more ECUs are being developed that results in increased safety and comfort, and a lower environmental impact. This leads to a complex work to test and verify that all the different ECUs are functioning as intended in various situations. Vehicle diagnostics often requires software from third parties that are often expensive. Syntronic AB are currently using software with a much larger functionality than needed to perform vehicle diagnostics and much of the unneces-sary functionality in the software leads to unnecessarily long runtimes for the program. By studying CAN and UDS and analyzing how they interact, I was able to create a software by systematically developing the software with two interfaces connected to each computer and continuously testing the implementation against the theoretical basis and then finally testing the software in a vehicle. The created software was better suited to the needs of the company and the more functionality-adapted software could perform the same diagnostics faster than the company’s current software. The most used UDS-service by the company could be implemented and the created software enabled more UDS services to be added without modifications of the main program or its features.

This thesis investigates architectures for multiplying elements in Galois rings of the size 4^m, where m is an integer.

The main question is whether known architectures for multiplying in Galois fields can be used for Galois rings also, with small modifications, and the answer to that question is that they can.

Different representations for elements in Galois rings are also explored, and the performance of multipliers for the different representations is investigated.

Many embedded systems are complex, and it is often required that the firmware in these systems are updatable by the end-user. For economical and confidentiality reasons, it is important that these systems only accept firmware approved by the firmware producer.

This thesis work focuses on creating a security enhanced firmware update procedure that is suitable for use in embedded systems. The common elements of embedded systems are described and various candidate algorithms are compared as candidates for firmware verification. Patents are used as a base for the proposal of a security enhanced update procedure. We also use attack trees to perform a threat analysis on an update procedure.

The results are a threat analysis of a home office router and the proposal of an update procedure. The update procedure will only accept approved firmware and prevents reversion to old, vulnerable, firmware versions. The firmware verification is performed using the hash function SHA-224 and the digital signature algorithm RSA with a key length of 2048. The selection of algorithms and key lengths mitigates the threat of brute-force and cryptanalysis attacks on the verification algorithms and is believed to be secure through 2030.

The purpose of this thesis is to document the development of the graphics part of an extremely pluggable game engine/lab environment for a course in advanced game programming. This thesis is one out of five, and concerns indoor, realtime computer 3D graphics. It covers state-of-the-art techniques such as GLSL - the OpenGL Shading Language - and more well known techniques such as portal based rendering.

Requirements Engineering (RE) in Agile Software Development (ASD) is a challenge thatmany face and several techniques exist when doing so. One such technique is prototyping, when a model of a product is used to gather important information in software develop-ment. To describe how much a prototype resembles the product the notion of fidelity is used. The aim of this study is to contribute to research regarding prototyping in ASD,and to examine the effect of a prototype’s fidelity when using prototypes in discussionsduring RE. A case study is performed at the company Exsitec where staff are interviewedregarding prototyping in software development. Thereafter, two prototypes of low andhigh fidelity are developed and used in interviews as a basis for discussion. Based on thisstudy, the use of prototypes in software projects can help customers trust the process,improve communication with customers, and facilitate when trying to reach consensusamong different stakeholders. Furthermore, depending on how they are used, prototypescan contribute to understanding the big picture of the requirements and can also serve asdocumentation. The study also shows some, albeit subtle, differences in the informationcollected using prototypes with low and high fidelity. The use of a high fidelity prototypeseems to generate more requirements, but makes interviewees less likely to come up withlarger, more comprehensive requirement changes.

A trend seen on the web today is to create a platform where externally developed applications can run inside some kind of main application. This is often done by providing an API to access data and business logic of your service and a sandbox environment in which third-party applications can run. By providing this, it is made possible for external developers to come up with new ideas based on your service. Some good examples on this are Spotify Apps, Apps on Facebook and SalesForce.com.

Ipendo Systems AB is a company that develops a web platform for intellectual properties. Currently most things on this platform are developed by developers at Ipendo Systems AB. Some interest has though risen to enable external developers to create applications that will in some way run inside the main platform.

In this thesis an analysis of already existing solutions has been done. These solutions were Spotify Apps and Apps on Facebook. The two have different approaches on how to enable third-party applications to run inside their own service. Facebook’s solution builds mainly on iframe embedded web pages where data access is provided through a web API. Spotify on the other hand hosts the third-party applications themselves but the applications may only consist of HTML5, CSS3 and JavaScript.

In addition to the analysis a prototype was developed. The purpose of the prototype was to show possible ways to enable third-party applications to run inside your own service. Two solutions showing this were developed. The first one was based on Facebook’s approach with iframing of external web pages. The second was a slightly modified version of Spotify’s solution with only client-side code hosted by the main application. To safely embed the client side code in the main application a sandboxing tool for JavaScript called Caja was used.

Of the two versions implemented in the prototype was the Iframe solution considered more ready to be utilized in a production environment than Caja. Caja could be seen as an interesting technique for the future but might not be ready to use today. The reason behind this conclusion was that Caja decreased the performance of the written JavaScript as well as adding complexity while developing the third-party applications.

We study opinion dynamics in a social network with stubborn agents who influence their neighbors but who themselves always stick to their initial opinion. We consider first the well-known DeGroot model. While it is known in the literature that this model can lead to consensus even in the presence of a stubborn agent, we show that the same result holds under weaker assumptions than has been previously reported. We then consider a recent extension of the DeGroot model in which the opinion of each agent is a random Bernoulli distributed variable, and by leveraging on the first result we establish that this model also leads to consensus, in the sense of convergence in probability, in the presence of a stubborn agent. Moreover, all agents opinions converge to that of the stubborn agent.

Det svenska språket ska finnas tillgängligt för alla som bor och verkar i Sverige. Därförär det viktigt att det finns lättlästa alternativ för dem som har svårighet att läsa svensktext. Detta arbete bygger vidare på att visa att det är möjligt att skapa ett automatisktomskrivningsprogram som gör texter mer lättlästa. Till grund för arbetet liggerCogFLUX som är ett verktyg för automatisk omskrivning till lätt svenska. CogFLUXinnehåller funktioner för att syntaktiskt skriva om texter till mer lättläst svenska.Omskrivningarna görs med hjälp av omskrivningsregler framtagna i ett tidigare projekt.I detta arbete implementeras ytterligare omskrivningsregler och även en ny modul förhantering av synonymer. Med dessa nya regler och modulen ska arbetet undersöka omdet är det är möjligt att skapa system som ger en mer lättläst text enligt etableradeläsbarhetsmått som LIX, OVIX och Nominalkvot. Omskrivningsreglerna ochsynonymhanteraren testas på tre olika texter med en total lägnd på ungefär hundra tusenord. Arbetet visar att det går att sänka både LIX-värdet och Nominalkvoten signifikantmed hjälp av omskrivningsregler och synonymhanterare. Arbetet visar även att det finnsfler saker kvar att göra för att framställa ett riktigt bra program för automatiskomskrivning till lätt svenska.

Creating native mobile application on multiple platforms generate a lot of duplicate code. This thesis has evaluated if the code quality attribute modifiability improves when migrating to React Native. One Android and one iOS codebase existed for an application and a third codebase was developed with React Native. The measurements of the codebases were based on the SQMMA-model. The metrics for the model were collected with static analyzers created specifically for this project. The results created consists of graphs that show the modifiability for some specific components over time and graphs that show the stability of the platforms. These graphs show that when measuring code metrics on applications over time it is better to do this on a large codebase that has been developed for some time. When calculating a modifiability value the sum of the metrics and the average value of the metrics between files should be used and it is shown that the React Native platform seems to be more stable than native.

Despite a constantly growing selection of front-end JavaScript frameworks, there is a lack of research to guide the choice of which one to use in a software project. Instead, the decision is generally based on experience and personal preferences within the team. The aim of this thesis is therefore to present a structured evaluation model to provide for more informed decisions. A preliminary study is carried out where the most important qualities of a framework are identified, both according to previous literature and to practitioners. The pre-study result is used to construct a structured model to assess framework performance for the identified qualities. Finally, a test of the model is carried out to see if it can guide the choice of framework in a specific project. The study shows that the design of the model does contribute with important insights on framework performance in prioritized quality areas and the trade-offs that this entails for other important qualities. Thus, the model provides necessary information to make well-founded decisions. Furthermore, it fills the gap in contemporary research by providing an understanding of what is important in a framework according to practitioners.

Students’ learning processes can be affected negatively by long waiting times to get assistance on lesson- and lab-sessions. Studies show that digital queuing systems decrease the waiting time. Thus, the purpose of this report is to investigate how to design a web-based queuing application to achieve a high perceived usability for students and tutors. Especially based on navigability and design which in accordance with research in the area has a direct impact on the usability. To achieve a high perceived usability the application was developed iteratively. In the first version the implemented functionality was built upon the result from the feasibility study combined with research in the area. After a set of user evaluations, changes from the first version were implemented to further improve the perceived usability. Lastly, another set of evaluations were performed to confirm the improvement in the final version. The results showed that the first version of the system was perceived as 84 out of 100 on the System Usability Scale (SUS) and the final version as 88 out of 100, an improvement by four units. Uniform design, no irrelevant functionality, placing buttons in conspicuous positions and having double checks to “dangerous actions” all seem to be factors contributing to the navigability, desirability and thus the usability on a queuing-application.

Anonymization of medical images is necessary for protecting the identity of the test subjects, and is therefore an essential step in data sharing. However, recent developments in deep learning may raise the bar on the amount of distortion that needs to be applied to guarantee anonymity. To test such possibilities, we have applied the novel CycleGAN unsupervised image-to-image translation framework on sagittal slices of T1 MR images, in order to reconstruct, facial features from anonymized data. We applied the CycleGAN framework on both face-blurred and face-removed images. Our results show that face blurring may not provide adequate protection against malicious attempts at identifying the subjects, while face removal provides more robust anonymization, but is still partially reversible.

This chapter provides examples of how arrangements for collection and analyses of video data were organized across different sites. The common approach to data collection builds on established methods for recording of audiovisual materials in the social sciences with a focus on interaction and learning. The chapter describes how arrangements for data collection across different sites were organised, and how video analysis can be used as a method for collaborative analysis of practices. One approach is entitled purposeful approach to collaborative data analysis. A second approach draws on video-based studies of situated action, and a third approach of analysis is the use of qualitatively different readings of the same data. One does not replace the other, but rather draws out different features.

Topological and geometric segmentation methods provide powerful concepts for detailed field analysis and visualization. However, when it comes to a quantitative analysis that requires highly accurate geometric segmentation, there is a large discrepancy between the promising theory and the available computational approaches. In this paper, we compare and evaluate various segmentation methods with the aim to identify and quantify the extent of these discrepancies. Thereby, we focus on an application from quantum chemistry: the analysis of electron density fields. It is a scalar quantity that can be experimentally measured or theoretically computed. In the evaluation we consider methods originating from the domain of quantum chemistry and computational topology. We apply the methods to the charge density of a set of crystals and molecules. Therefore, we segment the volumes into atomic regions and derive and compare quantitative measures such as total charge and dipole moments from these regions. As a result, we conclude that an accurate geometry determination can be crucial for correctly segmenting and analyzing a scalar field, here demonstrated on the electron density field.

Software prototyping is considered to be one of the most important tools that are used by software engineersnowadays to be able to understand the customer’s requirements, and develop software products that are efficient,reliable, and acceptable economically. Software engineers can choose any of the available prototyping approaches tobe used, based on the software that they intend to develop and how fast they would like to go during the softwaredevelopment. But generally speaking all prototyping approaches are aimed to help the engineers to understand thecustomer’s true needs, examine different software solutions and quality aspect, verification activities…etc, that mightaffect the quality of the software underdevelopment, as well as avoiding any potential development risks.A combination of several prototyping approaches, and brainstorming techniques which have fulfilled the aim of theknowledge extraction approach, have resulted in developing a prototyping approach that the engineers will use todevelop one and only one throwaway prototype to extract more knowledge than expected, in order to improve thequality of the software underdevelopment by spending more time studying it from different points of view.The knowledge extraction approach, then, was applied to the developed prototyping approach in which thedeveloped model was treated as software prototype, in order to gain more knowledge out of it. This activity hasresulted in several points of view, and improvements that were implemented to the developed model and as a resultAgile Prototyping AP, was developed. AP integrated more development approaches to the first developedprototyping model, such as: agile, documentation, software configuration management, and fractional factorialdesign, in which the main aim of developing one, and only one prototype, to help the engineers gaining moreknowledge, and reducing effort, time, and cost of development was accomplished but still developing softwareproducts with satisfying quality is done by developing an evolutionary prototyping and building throwawayprototypes on top of it.

A prerequisite for improving road safety are reliable and consistent sources of information about traffic and accidents, which will help assess the prevailing situation and give a good indication of their severity. In many countries there is under-reporting of road accidents, deaths and injuries, no collection of data at all, or low quality of information. Potential knowledge is hidden, due to the large accumulation of traffic and accident data. This limits the investigative tasks of road safety experts and thus decreases the utilization of databases. All these factors can have serious effects on the analysis of the road safety situation, as well as on the results of the analyses.

This dissertation presents a three-tiered conceptual model to support the sharing of road safety–related information and a set of applications and analysis tools. The overall aim of the research is to build and maintain an information-sharing platform, and to construct mechanisms that can support road safety professionals and researchers in their efforts to prevent road accidents. GLOBESAFE is a platform for information sharing among road safety organizations in different countries developed during this research.

Several approaches were used, First, requirement elicitation methods were used to identify the exact requirements of the platform. This helped in developing a conceptual model, a common vocabulary, a set of applications, and various access modes to the system. The implementation of the requirements was based on iterative prototyping. Usability methods were introduced to evaluate the users’ interaction satisfaction with the system and the various tools. Second, a system-thinking approach and a technology acceptance model were used in the study of the Swedish traffic data acquisition system. Finally, visual data mining methods were introduced as a novel approach to discovering hidden knowledge and relationships in road traffic and accident databases. The results from these studies have been reported in several scientific articles.

Nowadays, virtually all industries are impacted by the digitalization of business enabled by information and communication technologies. Consequently, it is a major challenge to any business to increase its ability to innovate through information systems. However the effort and the investments of companies are extremely varied, they do not have the same level of maturity with respect to their innovation strategy. While some highly mature use effective approaches, others still act as novices or use inadequate practices. The question raised in this paper is how to evaluate the level of maturity of an organization with respect to information systems based innovation. Also, the question concerns the identification of the salient features of ICT centred innovation maturity models. Taking these issues into account, the paper makes the following contributions: (i) a review of sixteen innovation maturity models collected from the research and the practitioners community, gathering facts about the models and about their effectiveness; (ii) a comparative analysis of these models.

Since Dengue fever (DF) and its related forms, Dengue Hemorrhagic fever (DHF) and Dengue Shock Syndrome (DSS) have become important health concerns worldwide, it is also imperative to develop methods which will help in the analysis of the incidences. Dengue fever cases are growing in number as it also invades widely, affecting larger number of countries and crossing climatic boundaries. Considering that the disease as of now has neither an effective vaccine nor a cure, monitoring in order to prevent or control is the resorted alternative. GIS and its related technologies offer a wealth of interesting capabilities towards achieving this goal.

The intention of this study was to develop methods to describe dengue fever outbreaks taking Rio de Janeiro, Brazil as a case study. Careful study of Census data with appropriate attributes was made to find out their potential influence on dengue fever incidence in the various regions or census districts. Dengue incidence data from year 2000 to year 2008 reported by the municipal secretariat of Rio was used to extract the necessary census districts. Base map files in MapInfo format were converted to shape files.  Using ArcGIS it was possible to merge the dengue fever incidence data with the available base map file of the City of Rio according to corresponding census districts. Choropleth maps were then created using different attributes from which patterns and trends could be used to describe the characteristic of the outbreak with respect to the socio-economic conditions. Incidence data were also plotted in Excel to see temporal variations. Cluster analysis were performed with the Moran I technique on critical periods and years of dengue outbreak. Using the square root of dengue incidence from January to April 2002 and 2008, inverse distance was selected as the conceptualised spatial relationship, Euclidean distance as the distance method. More detailed analyses were then done on the selected critical years of dengue outbreak, (years 2002 and 2008), to investigate the influence of socio-economic variables on dengue incidence per census district.

Dengue incidence rate appeared to be higher during the rainy and warmer months between December and May. Outbreaks of dengue occurred in years 2002 and 2008 over the study period of year 2000 to 2008. Some factors included in the census data were influential in the dengue prevalence according to districts. Satisfactory results can be achieved by using this strategy as a quick method for assessing potential dengue attack, spread and possible enabling conditions. The method has the advantage where there is limited access to field work, less financial means for acquisition of data and other vital resources.

A number of difficulties were encountered during the study however and leaves areas where further work can be done for improvements. More variables would be required in order to make a complete and comprehensive description of influential conditions and factors.  There is still a gap in the analytical tools required for multi-dimensional investigations as the ones encountered in this study.  It is vital to integrate ‘GPS’ and ‘Remote Sensing’ in order to obtain a variety of up-to-date data with higher resolution.

Federated RDF query processing is concerned with querying a federation of RDF data sources where the queries are expressed using a declarative query language (typically, the RDF query language SPARQL), and the data sources are autonomous and heterogeneous. The current literature in this context assumes that the data and the data sources are semantically homogeneous, while heterogeneity occurs at the level of data formats and access protocols.

This report presents the work of our Master´s thesis carried out remotely at the Community Coordinated Modeling Center at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center. In collaboration with the American Museum of Natural History (AMNH), Linköping University and Predictive Science Inc. The report presents and evaluates an implementation of an interactive 3D visualization of a Solar Particle Event in OpenSpace, an open source astrovisualization software. Data from a model developed by Predictive Science Inc. was used to implement the visualization. The visualization is done by visualizing fluxes of particles as points and utilizing a volumetric data set by applying 2D textures to geometrical shapes. The goal of these visualizations is to help describe the effect of space weather phenomena to the general public. The research conducted is focused on how to visualize a big Solar Particle Event to emphasize or showcase different aspects, such as the radiation exposure close to Earth. The result of the work is an interactive real-time visualization of a Solar Particle Event designed for public outreach. The project culminated in two live streamed events with AMNH, in collaboration with NASA and Predictive Science Inc. 

Distance field text rendering has many advantages compared to most other text renderingsolutions. Two of the advantages are the possibility  to scale the glyphs without losing the crisp edge and less memory consumption. A drawback with distance field text renderingcan be high distance field generation time. The solution for fast distance field text renderingin this thesis generates the distance fields by drawing distance gradients locally over the outlines of the glyphs. This method is much faster than the old exact methods for generating distance fields that often includes multiple passes over the whole image.

Using the solution for text rendering proposed in this thesis results in good looking text that is generated on the fly. The distance fields are generated on a mobile device in less than 10 ms for most of the glyphs in good quality which is less than the time between two frames.

Förvaltningsrapporten fokuserar på Snomed CT, eftersom det redan i dag finns rutiner för förvaltningar av termbanken och nationella hälsorelaterade klassifikationer. Ett särskilt utvecklingsarbete kommer att krävas för dessa delar.

Rapporten tar upp syfte och mål med förvaltningen. Utöver det redogör rapporten för vilka konkreta ansvarsområden som ingår i förvaltningen av Snomed CT. Målet för förvaltningen är att Socialstyrelsen regelbundet ska kunna tillhandahålla en kontrollerad och uppdaterad release av Snomed CT. Det skulle möjliggöra användning inom vård och omsorg. Rapporten tar även upp behovet av kompetens, utbildning och finansiella resurser.

The existing approaches to design efficient safety critical control applications is constrained by limited in-vehicle sensing and computational capabilities. In the context of automated driving, we argue that there is a need to leverage resources "out-of-the-vehicle" to meet the sensing and powerful processing requirements of sophisticated algorithms (e.g., deep neural networks). To realize the need, a suitable computation offloading technique that meets the vehicle safety and stability requirements, even in the presence of unreliable communication network, has to be identified. In this work, we propose an adaptive offloading technique for control computations into the cloud. The proposed approach considers both current network conditions and control application requirements to determine the feasibility of leveraging remote computation and storage resources. As a case study, we describe a cloud-based path following controller application that leverages crowdsensed data for path planning.