Swedish Institute of Computer Science Publications Database
Not a member yet
2787 research outputs found
Sort by
A probabilistic approach to IT risk management in the Basel regulatory framework
No full textPurpose
This paper aims to examine the connection between information system (IS) availability and operational risk losses and the capital requirements. As most businesses today become increasingly dependent on information technology (IT) services for continuous operations, IS availability is becoming more important for most industries. However, the banking sector has particular sector-specific concerns that go beyond the direct and indirect losses resulting from unavailability. According to the first pillar of the Basel II accord, IT outages in the banking sector lead to increased capital requirements and thus create an additional regulatory cost, over and above the direct and indirect costs of an outage.
Design/methodology/approach
A Bayesian belief network (BBN) with nodes representing causal factors has been used for identification of the factors with the greatest influence on IS availability, thus helping in investment decisions.
Findings
Using the BBN model for making IS availability-related decisions action (e.g. bringing a causal factor up to the best practice level), organization, according to the presented mapping table, would have less operational risk events related to IS availability. This would have direct impact by decreasing losses, related to those events, as well as to decrease the capital requirements, prescribed by the Basel II accord, for covering operational risk losses.
Practical implications
An institution using the proposed framework can use the mapping table to see which measures for improving IS availability will have a direct impact on operational risk events, thus improving operational risk management.
Originality/value
The authors mapped the factors causing unavailability of IS system to the rudimentary IT risk management framework implied by the Basel II regulations and, thus, established an otherwise absent link from the IT availability management to operational risk management according to the Basel II framework
Axiom - DTLS-based secure IoT group communication
No full textThis paper presents Axiom, a DTLS-based approach to efficiently secure multicast group communication among IoT constrained devices. Axiom provides an adaptation of the DTLS record layer, relies on key material commonly shared among the group members, and does not require to perform any DTLS handshake. We made a proof of concept implementation of Axiom based on the tinyDTLS library for the Contiki OS, and used it to experimentally evaluate performance of our approach on real IoT hardware. Results show that Axiom is affordable on resource constrained platforms, and performs significantly better than related alternative approaches
Teknisk slutrapport för FLTP - Framtidens LeveransTågplaneProcess
No full textSlutrapporten sammanfattar arbetet som gjorts i projektet FLTP-Framtidens LeveransTågplaneProcess. FLTP har utförts av RISE SICS AB på uppdrag av Trafikverket under åren 2014-2016. Syftet med projektet har varit att undersöka
planeringsmetoder för att ta fram leveransåtagande i en tänkt framtida långtidsprocess när Successiv Planering är fullt genomfört. Projektet har tagit fram ett planeringskoncept där alla kördagars individuella trafiksituation beaktas, och matematiska modeller och heuristiker som kan stödja den föreslagna planeringsmetoden har utformats och testats.
Rapporten presenterar övergripande de metoder, resultat och slutsatser som
projektet levererat, och ger också sammanhang till projektets övriga publikationer.
Slutrapporten presenterar även i stora drag de mål som projektet satte upp,
samt till vilken grad dessa har uppfyllts
Delete by Haiku: Poetry from Old SMS Messages
No full textThe work draws on repurposing practices to inform design for deletion and handling of digital waste -- a way of letting go -- in graceful and aesthetically appealing ways.
Delete by Haiku is a mobile phone application that explores how deleting old text messages can become an enjoyable and creative practice by turning messages into haiku poetry. Through the application users interactively repurpose selected old text messages on their mobile phone into a haiku poem aided by a haiku-generating algorithm. By repeatedly pinching the selected messages they break apart into words that tumble down in a Tetris like manner. Gradually words are deleted until the remaining words find their position and form a haiku.
The video presents a walkthrough of how to interact with the application to select messages in various ways, how to apply "themes" to gain some control over the generation process, and eventually share created poems with others through social media
Multi-Objective Testing Resource Allocation under Uncertainty
No full textTesting resource allocation is the problem of planning the assignment of resources to testing activities of software components so as to achieve a target goal under given constraints. Existing methods build on Software Reliability Growth Models (SRGMs), aiming at maximizing reliability given time/cost constraints, or at minimizing cost given quality/time constraints. We formulate it as a multi-objective debug-aware and robust optimization problem under uncertainty of data, advancing the stateof- the-art in the following ways. Multi-objective optimization produces a set of solutions, allowing to evaluate alternative tradeoffs among reliability, cost and release time. Debug awareness relaxes the traditional assumptions of SRGMs – in particular the very unrealistic immediate repair of detected faults – and incorporates the bug assignment activity. Robustness provides solutions valid in spite of a degree of uncertainty on input parameters. We show results with a real-world case study
Run-Time Component Allocation in CPU-GPU Embedded Systems
No full textNowadays, many of the modern embedded applications such as vehicles and robots, interact with the environment and receive huge amount of data through various sensors such as cameras and radars. The challenge of processing large amount of data, within an acceptable performance, is solvedby employing embedded systems that incorporate complementary attributes of CPUs and Graphics Processing Units (GPUs), i.e., sequential and parallel execution models. Component-based development (CBD) is a software engineering methodology that augments the applications development through reuse of software blocks known as components. In developing a CPU-GPU embedded application using CBD, allocation of components to different processing units of the platform is an important activity which can affect the overall performance of the system. In this context, there is also often the need to support and achieve run-time component allocation due to various factors and situations that can happen during system execution, such as switching off parts of the system for energy saving. In this paper, we provide a solution that dynamically allocates components using various system information such as the available resources (e.g., available GPU memory) and the software behavior (e.g., in terms of GPU memory usage). The novelty of our work is a formal allocation model that considers GPU system characteristics computed on-the-fly through software monitoring solutions. For the presentation and validation of our solution, we utilize an existing underwater robot demonstrator
Trust but Verify - Trust Establishment Mechanisms in Infrastructure Clouds
No full textThe past two decades have witnessed a transformation of the status and role of comput- ing: from a commodity supporting essential societal functions to a utility permeating all aspects of daily life. This transformation was accompanied by the emergence of so- called cloud computing – a service model that made computation infrastructure reliable, scalable and easily accessible. Increasingly, cloud computing displays the characterist- ics common to utility services, such as: necessity, reliability, usability, low utilization rates, scalability and (in some cases) service exclusivity.
In the cloud computing service model, users consume computation resources provided through the Internet, often without any awareness of the cloud service provider that owns and operates the supporting hardware infrastructure. This marks an important change compared to earlier models of computation, for example when such supporting hardware infrastructure was under the control of the user. Given the ever increasing importance of computing, the shift to cloud computing introduces several challenging issues, which include ensuring the integrity and confidentiality of the computation itself, along with integrity and confidentiality of ancillary resources such as network commu- nication and the stored or produced data.
While the potential risks for data isolation and confidentiality in cloud infrastructure are somewhat known, they are obscured by the convenience of the service model and claimed trustworthiness of cloud service providers, backed by reputation and contractual agreements. Ongoing research on cloud infrastructure has the potential to strengthen the security guarantees of computation, data and communication for users of cloud computing. This thesis is part of such research efforts, focusing on assessing the trust- worthiness of components of the cloud network infrastructure and cloud computing infrastructure and controlling access to data and network resources.
The seven papers included in this thesis present a collection of contributions address- ing select aspects of the focus areas above. The contributions include mechanisms to verify or enforce security in cloud infrastructure. Such mechanisms have the potential to both help cloud service providers strengthen the security of their deployments, and empower users to obtain guarantees regarding security aspects of service level agree- ments. By leveraging functionality of components such as the Trusted Platform Module, we describe mechanisms to provide user guarantees regarding integrity of the comput- ing environment and geographic location of plaintext data, as well as to allow users maintain control over the cryptographic keys for integrity and confidentiality protec- tion of data stored in remote infrastructure. Next, by leveraging recent innovations for platform security such as Software Guard Extensions, we describe mechanisms to verify the integrity of the network infrastructure in the Software-Defined Networking model. Finally, we propose an innovative scheme for access control of resources in Software-Defined Networking deployments
Community-based Innovation Among Elite Orienteers
No full textWe have studied a form of community innovation within the sport of orienteering, which in the Nordic countries consist of a closely knit group with a strong sense of community. This study shows how the processes for developing new technologies are driven by a strong sense of idealism, with little or no commercial motivation. Thus, this represents a kind of community development and sharing with a number of unique characteristics. While the community is central to participants’ endeavours of developing their systems, the participants are not representative of the typical member. On the contrary, they are examples of a minority that put in significant efforts of contributing to the larger group. What we argue is unique about the case we have presented is that the technology development starts out from a few number of highly motivated individuals that through limited collaboration with others builds technologies that get extensive proliferation and use within the communit
Time-Aware Test Case Execution Scheduling for Cyber-Physical Systems
No full textTesting cyber-physical systems involves the execution of test cases on target-machines equipped with the latest release of a software control system. When testing industrial robots, it is common that the target machines need to share some common resources, e.g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources. With a large number of such tests executed on a regular basis, this scheduling becomes difficult to manage manually. In fact, with manual test execution planning and scheduling, some robots may remain unoccupied for long periods of time and some test cases may not be executed.
This paper introduces TC-Sched, a time-aware method for automated test case execution scheduling. TC-Sched uses Constraint Programming to schedule tests to run on multiple machines constrained by the tests’ access to shared resources, such as measurement or networking devices. The CP model is written in SICStus Prolog and uses the Cumulatives global constraint. Given a set of test cases, a set of machines, and a set of shared resources, TC-Sched produces an execution schedule where each test is executed once with minimal time between when a source code change is committed and the test results are reported to the developer. Experiments reveal that TC-Sched can schedule 500 test cases over 100 machines in less than 4 min for 99.5% of the instances. In addition, TC-Sched largely outperforms simpler methods based on a greedy algorithm and is suitable for deployment on industrial robot testing
