Ändra sökning
Avgränsa sökresultatet
1234567 101 - 150 av 1929
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 101.
    Ardelius, John
    et al.
    RISE, Swedish ICT, SICS. RISE, Swedish ICT, SICS, Computer Systems Laboratory. CNS.
    Mejıas, Boris
    Modeling the Performance of Ring Based DHTs in the Presence of Network Address Translators2011Ingår i: DAIS 2011Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Dealing with Network Address Translators (NATs) is a central prob- lem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay networks assume the underlying network to be a complete graph, an assumption that might hold in evaluation environments such as PlanetLab but turns out to be simplistic in practice. In this work we introduce an analytical network model where a fraction of the communication links are un- available due to NATs. We investigate how the topology induced by the model affects the performance of ring based DHTs. We quantify two main performance is- sues induced by NATs namely large lookup inconsistencies and increased break- up probability, and suggest how theses issues can be addressed. The model is evaluated using discrete based simulation for a wide range of parameters.

  • 102. Argamon, Shlomo
    et al.
    Karlgren, Jussi
    RISE, Swedish ICT, SICS. Userware.
    Shanahan, James G.
    Future short term goals of research in computational analysis of stylistics in text2005Ingår i: SIGIR Forum, Vol. 39, s. 17-18Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A short summary of findings from the 2005 SIGIR workshop on stylistics in text.

  • 103. Argaw, Atelach Alemu
    et al.
    Asker, Lars
    Cöster, Rickard
    RISE, Swedish ICT, SICS.
    Karlgren, Jussi
    RISE, Swedish ICT, SICS.
    Dictionary-based Amharic-English information retrieval2005Ingår i: Multilingual Information Access for Text, Speech and Images, Third Workshop of the Cross-Language Evaluation (CLEF), 2005, 1Konferensbidrag (Refereegranskat)
  • 104. Argaw, Atelach Alemu
    et al.
    Asker, Lars
    Cöster, Rickard
    RISE., Swedish ICT, SICS.
    Karlgren, Jussi
    RISE., Swedish ICT, SICS.
    Sahlgren, Magnus
    RISE - Research Institutes of Sweden, ICT, SICS.
    Dictionary-based Amharic-French Information Retrieval2006Konferensbidrag (Refereegranskat)
  • 105.
    Armstrong, Joe
    RISE., Swedish ICT, SICS.
    Getting Erlang to talk to the outside world2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    We propose a simple method for allowing different programming languages to communicate in a distributed environment. Our solution proposes a new language UBF, (Universal Binary Format) which we argue is equivalent in semantic power to XML, XML-schemas, SOAP and WSDL. We arge that our solution is much more efficient than solutions based on the XML series of standards.

  • 106.
    Armstrong, Joe
    RISE., Swedish ICT, SICS.
    Making reliable distributed systems in the presence of software errors2003Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    The work described in this thesis is the result of a research program started in 1981 to find better ways of programming Telecom applications. These applications are large programs which despite careful testing will probably contain many errors when the program is put into service. We assume that such programs do contain errors, and investigate methods for building reliable systems despite such errors. The research has resulted in the development of a new programming language (called Erlang), together with a design methodology, and set of libraries for building robust systems (called OTP). At the time of writing the technology described here is used in a number of major Ericsson, and Nortel products. A number of small companies have also been formed which exploit the technology. The central problem addressed by this thesis is the problem of constructing reliable systems from programs which may themselves contain errors. Constructing such systems imposes a number of requirements on any programming language that is to be used for the construction. I discuss these language requirements, and show how they are satisfied by Erlang. Problems can be solved in a programming language, or in the standard libraries which accompany the language. I argue how certain of the requirements necessary to build a fault-tolerant system are solved in the language, and others are solved in the standard libraries. Together these form a basis for building fault-tolerant software systems. No theory is complete without proof that the ideas work in practice. To demonstrate that these ideas work in practice I present a number of case studies of large commercially successful products which use this technology. At the time of writing the largest of these projects is a major Ericsson product, having over a million lines of Erlang code. This product (the AXD301) is thought to be one of the most reliable products ever made by Ericsson. Finally, I ask if the goal of finding better ways to program Telecom applications was fulfilled --- I also point to areas where I think the system could be improved.

  • 107. Arnfalk, Peter
    et al.
    Hambreaus-Björling, Ylva
    Otterskog, Carolina
    Asp, Kenneth
    Aspegren, Anita
    Karagianni, Catherine
    Karlgren, Jussi
    RISE, Swedish ICT, SICS. Userware.
    Leckström, Marianne
    Lindberg, Emma
    Pamlin, Dennis
    Thorslund, Ewa
    Lindquist, Margareta
    Klingspor, Karin
    Ett miljöanpassat informationssamhälle 20202006Övrigt (Övrigt vetenskapligt)
    Abstract [en]

    Rapport från regeringens IT-politiska strategigrupp.

  • 108.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A Definitional approach to the combination of functional and relational programming1991Rapport (Övrigt vetenskapligt)
    Abstract [en]

    We show how the programming language GCLA can be used to naturally express both relational and functional programs in an integrated framework. We give a short introduction to GCLA, and to the theory of partial inductive definitions on which GCLA is based. GCLA is best regarded as a logic programming language, but instead of saying that the query follows from the program in some a priori given logic, we say that the program defines the logic in which the query is proved. We then demonstrate how to implement both relational and functional programs as well as a combination of them in GCLA.

  • 109.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A parser for GDL written in Sicstus Prolog1991Rapport (Övrigt vetenskapligt)
    Abstract [en]

    A parser for a language called GDL (Graphical Description Language, a Basic-like language) is presented. GDL is a language used in the CAD system ArchiCAD, which is a CAD system used by architects for drawing buildings. GDL is the language used by ArchiCAD for plotting 3D views. The parser described here has been implemented in a project for planning the erection of buildings, where the GDL programs are used to get the coordinates and the different materials of different parts of the building. The report describes the general, basic plotting features of GDL and does not go into details about the more architectural features of GDL and ArchiCAD. The parser is presented in detail, and an interpreter that runs the parsed code is also presented. The report contains three appendix, which present GDL and the programs implementing the parser and the interpreter.

  • 110.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Efficient utilisation of resources in the railway industry by levelling departures and arrivals of trains2004Ingår i: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, s. 27-28Artikel i tidskrift (Refereegranskat)
  • 111.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    GAM: An abstract machine for GCLA1989Rapport (Övrigt vetenskapligt)
    Abstract [en]

    GCLA is a new programming language, which increases expressiveness compared with traditional logic programming languages and functional programming languages. The basis for the language is a generalization of the concept inductive definitions, called partial inductive definitions. The program defines a logic, which is used to make inferences to prove if a query holds or not. This report first presents a short introduction to these ideas. Then, an abstract machine, called GAM, for GCLA is presented; the instructions as well as an introduction to the compiling schema is given together with some examples. The main idea is to extend the Warren Abstract Machine (WAM), which is an abstract machine for the language Prolog.

  • 112.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Implementational Issues in GCLA: A-Sufficiency and the Definiens Operation1993Rapport (Refereegranskat)
    Abstract [en]

    We present algorithms for computing A-sufficient substitutions and constraint sets together with the definiens operation. These operations are primitive operations in the language GCLA. The paper first defines those primitives, which together form a dual rule to SLD resolution, and then describes the different algorithms and some of their properties together with examples. One of the algorithms shows how a definition can be compiled into a representation holding all possible A-sufficient substitutions/constraint sets together with their corresponding definiens. This representation makes the computation at runtime of a definiens and an A-sufficient substitution/constraint set have the same complexity as the table lookup operation clause/2 in Prolog. The paper also describes the generalisation from unification (sets of equalities) to constraint sets and satisfiability of systems of equalities and inequalities.

  • 113.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Implementational Issues in GCLA: Compiling Control1993Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The paper describes the basic implementation of GCLA II's control level. The basis of the implementation is a compiling scheme for transforming inference rules and strategies operating on the object level to an interpreter in Prolog, where the inference rules of the control level are coded inline. This is possible since the operational semantics of the control level is deterministic, i.e. the choice of inference rule to apply on a control level goal is determined solely by the parts of the goal. To handle dynamic clauses, a context list, accessible through some new C-functions linked together with the Prolog system. GCLA I and GCLA II are described shortly, followed by a discussion of a Horn clause representation of inference rules versus functions coding inference rules. Then the transformation of inference rules and strategies is described followed by some examples.

  • 114.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Methodology and Programming Techniques in GCLA II1992Rapport (Övrigt vetenskapligt)
    Abstract [en]

    We will demonstrate various implementation techniques in the language GCLA. First an introduction to GCLA is given, followed by some examples of program developments, to demonstrate the development methodology. Other examples are also given to show various implementation techniques and properties of the system.

  • 115.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Planning the Construction of a Building1993Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The paper describes a tool for generating plans for the construction of a building. The application is implemented in GCLA, together with a simple constraint solving system. The main idea is that experiences from other plans are stored in methods; which are a systematic way of grouping activities together as higher level activities that can solve more complex tasks. Activities are entities that perform some action on a model of the real world, called the global state. Activities have preconditions, i.e. starting conditions, some representation of time and resource consumption, and postconditions, i.e. how and what to change in the global state. Scheduling activities amounts to allocating resources and placing the activities in time. The goal of the planning process, i.e what we want the planning process to achieve, is represented by a geometric model of the changed global state, i.e. a design of the specified building that one wants to build. To create plans, the system is divided into two main phases; the choice-of-method phase and the scheduling phase. In the choice-of-method phase suitable methods are chosen based on experience from the past. Such methods already exists in the building industry, although not in an explicit formal representation. Then the scheduling phase allocates resources and places the activities in time by reasoning about the activities' change of the global state. The goal of the planning process is that the objects of the specified design should be produced and represented in the global state. The user can change most of the behaviour of the system by indicating what he wants it to do. He can change activities, their preconditions, calculations and postconditions, he can change methods, or add or remove activities to them, he can change resources etc. By this flexibility, the user can form his system to reflect his own preferences about how to plan and what to plan.

  • 116.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Slutrapport för projektet TUFF, TågplaneUtveckling För Framtiden2006Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    Denna rapport sammanfattar arbetet i projektet TUFF, TågplaneUtveckling För Framtiden, finansierat av Banverkets FoU-program. Projektet har pågått under åren 2004 och 2005, och syftet med projektet har varit att studera beräkningsmodeller och beräkningsaspekter för tågplanekonstruktion. Rapporten presenterar en beräkningsmodell för tågplanekonstruktion som skalar väl upp till storleken på konstruktionsområden som används idag och är således lämplig att basera ett stödsystem åt tidtabellkonstruktörer på. Rapporten beskriver den operationsalanytiska modellen samt sammanfattar de tester som utförts. Utöver detta presenteras en del förslag och ansatser till nyckeltal att mäta tågplaners egenskaper.

  • 117.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    STRIPS-Like planning using GCLA1989Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This report describes how a STRIPS planning system can be implemented in GCLA. A short introduction to the problem of the blocks world is given, as well as an introduction to STRIPS. Then the GCLA program implementing the planning system is presented, together with queries concerning planning and simulation problems.

  • 118.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    The GCLA user's manual1991Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    GCLA is best regarded as a logic programming language, although it shares some features commonly found among functional languages. One of the main objective is to provide a powerful tool which supports the development of Knowledge Based Systems. For an introduction of how to program the GLCA system, the reader is recommended to consult "A survey of GLCA : A Definitional Approach to Logic Programming" [Aro91], "GLCAII, A Definitional Approach to Control " [Kre91], and "Programming methodology and techniques in GCLA" [Aro92]. This manual describes the system developed at SICS. The system consist of a library and a runtime system written in Prolog and GLCA and a Preprocessor/Compiler written in Prolog. This manual is based on the Industrial SICStus Prolog User's Manual by Mats Carlsson et.al. This manual is based where possible on SICStus Prolog User's Manual by Mats Carlsson and Johan Widén.

  • 119.
    Aronsson, Martin
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    The Instruction Set for the GCLA Abstract Machine1989Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The basis for the language GCLA is a generalization of the concept inductive definitions, called partial inductive definitions. The program defines a logic, which is used to make inferences to prove if a query holds or not. This report first presents a short introduction to these ideas. Then, an abstract machine, called GAM, for GCLA is presented; the instructions as well as an introduction to the compiling schema is given together with some examples. The GAM instructions are also presented as transitions in an appendix.

  • 120.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Bohlin, Markus
    RISE - Research Institutes of Sweden, ICT, SICS.
    Doganay, Kivanc
    RISE., Swedish ICT, SICS.
    Holst, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kjellqvist, Tommy
    Östlund, Stefan
    An Integrated Adaptive Maintenance Concept2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we present a novel maintenance concept based on condition monitoring and dynamic maintenance packaging, by showing how to connect the information flow from low-level sensors to high-level operations and planning under uncertainty. Today, condition-based maintenance systems are focused on data collection and custom-made rule based systems for data analysis. In many cases, the focus is on measuring "everything" without considering how to use the measurements. In addition, the measurements are often noisy and the future is unpredictable which adds a lot of uncertainty. As a consequence, maintenance is often planned in advance and not replanned when new condition data is available. This often reduces the benefits of condition monitoring. The concept is based on the combination of robust, dynamically adapted maintenance optimization and statistical data analysis where the uncertainty is considered. This approach ties together low-level data acquisition and high-level planning and optimization. The concept has been illustrated in a context of rail vehicle maintenance, where measurements of brake pad and pantograph contact strip wear is used to predict the near future condition, and plan the maintenance activities.

  • 121.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Bohlin, Markus
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    MILP formulations of cumulative constraints for railway scheduling - A comparative study2009Ingår i: The Proceedings of the 9th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS), Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany , 2009, 13Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper introduces two Mixed Integer Linear Programming (MILP) models for railway traffic planning using a cumulative scheduling constraint and associated pre-processing filters. We compare standard solver performance for these models on three sets of problems from the railway domain and for two of them, where tasks have unitary resource consumption, we also compare them with two more conventional models. In the experiments, the solver performance of one of the cumulative models is clearly the best and is also shown to scale very well for a large scale practical railway scheduling problem.

  • 122.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Bohlin, Markus
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Mixed integer-linear formulations of cumulative scheduling constraints - A comparative study2007Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper introduces two MILP models for the cumulative scheduling constraint and associated pre-processing filters. We compare standard solver performance for these models on three sets of problems and for two of them, where tasks have unitary resource consumption, we also compare them with two models based on a geometric placement constraint. In the experiments, the solver performance of one of the cumulative models, is clearly the best and is also shown to scale very well for a large scale industrial transportation scheduling problem.

  • 123.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    TUFF-PO, Kravsättning av tidplaner utifrån personalplaneringsbehov2002Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    TUFF-PO rör personalplaneringsarbetet, specifikt planering för bemanning av tåg med lokförare, i tidiga faser då tidtabellen ännu inte är fastställd men då ett antal villkor och begränsningar på tågen och deras rörelser är kända. TUFF-PO genererar förslag och data som möjliggör effektiv personalplanering i senare skeden, genom att skapa begränsningar på tidtabelläggningen, begränsningar som tar bort dåliga och ineffektiva lösningar ur personalplaneringsperspektivet och bevarar de goda och effektiva lösningarna. Fokus för detta arbete är på tid och krav på tid, inte direkt på kostnader. Ansatsen i TUFF-PO är inte att försöka konstruera personalomlopp och inte heller personalslingor utan att titta på arbetsperioder för att utifrån dessa försöka finna gemensamma egenskaper som tycks gynna bra personalomlopp i senare planeringsskeden. Dessa egenskaper lägger grunden för de begränsningar som bildar krav på tidtabelläggningen. Preliminära resultat pekar på att det är möjligt att skapa kvalitativt bättre personalplaner. Vi tar upp och belyser både generella frågeställningar och den prototypimplementering som är gjord för att validera resultaten.

  • 124.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Coordination of planning processes for traffic operators on rail networks; Annual Report 1, Swedish national railway administration (Banverket) R&D-project - SPOK2003Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This project is concerned with how to improve the capacity allocation process. In particular the project aims at proposing an enhanced format for train path applications, study the technical limitations for timetabling support tools and in the longer term to implement support systems for the train path allocation process. This report describes the various factors that affect the application process, and report the opinions from several actors in the field. Since the deregulation of the Swedish railway, and with new EU directives, the foundations for the capacity allocation process is changing rapidly. There is a strong need for clear and predictable principles that are fair and operator neutral and implements the prioritisation given to different types of traffic and for improved methodologies and decision support tools in the capacity allocation process. This is crucial to support both the possibility for the traffic operators to state demands and the timetable designers in judging conflicting train paths. A conclusion is that almost all the requirements on the timetable presented in this report can in fact be stated as properties and relations of events in the timetable.

  • 125.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Översikt av metoder och förutsättningar för tåglägestilldelning2003Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    Denna rapport beskriver status hos den forskning som är relevant för tåglägestilldelning samt analyserar och kommenterar några av de reglerande dokument såsom lagar och förordningar samt instruktioner och information som Banverket och Tågtrafikledningen tagit fram. för att styra tåglägestilldelningsprocessen. Rapporten ger också en översikt av forskningsfronten vad gäller systemstöd för tåglägestilldelningen och ger en kortfattad en beskrivning av några av de tekniker som kan vara användbara i ett stödsystem för tåglägestilldelning samt lyfter fram deras respektive för och nackdelar.

  • 126.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Eriksson, Lars-Henrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gäredal, Anette
    RISE - Research Institutes of Sweden, ICT, SICS.
    Hallnäs, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    Olin, Peter
    The programming language GCLA: A definitional approach to logic programming1989Rapport (Övrigt vetenskapligt)
    Abstract [en]

    We present a logic programming language, GCLA (Generalized horn Clause LAnguage), that is based on a generalization of Prolog. This generalization is unusual in that it takes a quite different view of the meaning of a logic program--a "definitional" view rather than the traditional logical view. GCLA has a number of noteworthy properties, for instance hypothetical and non-monotonic reasoning. This makes implementation of reasoning in knowledge-based systems more direct in GCLA than in Prolog. GCLA is also general enough to incorporate functional programming as a special case. GCLA and its syntax and semantics are described. The use of various language constructs are illustrated with several examples.

  • 127.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Eriksson, Lars-Henrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Hallnäs, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A survey of GCLA: A definitional approach to logic programming1989Ingår i: Proceedings of the first international workshop on extensions of logic programming, ELP '89, Springer Verlag , 1989, 3, Vol. 475, s. 49-100Konferensbidrag (Refereegranskat)
  • 128.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Forsgren, Malin
    RISE., Swedish ICT, SICS.
    Gestrelius, Sara
    RISE., Swedish ICT, SICS.
    The Road to Incremental Allocation & Incremental Planning2012Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Successiv tilldelning (Successive Allocation) is a new approach for railway planning for Trafikverket (the Swedish Transport Administration) worked out by SICS. This document describes the steps proposed by SICS towards a full implementation of the new approach. Results from the SICS projects Tågplan 2015 and Marackasen are reported, as these support the reasoning behind the suggested implementation.

  • 129.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Forsgren, Malin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gestrelius, Sara
    RISE., Swedish ICT, SICS.
    Uncovered capacity in Incremental Allocation2017Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper summarizes the work to estimate the value of uncovered capacity when using Incremental Allocation, including how it was calculated. The estimation was performed as part of the commercial valuation of Incremental Allocation. This valuation was made within the PENG framework. The aim is to estimate the value of new traffic that can be served by the uncovered capacity. The calculations are based on the UIC406 standard, but instead of analysing the traffic executed on a typical day the planned train paths are analysed. More precisely, the input data is a snapshot from planning tool TrainPlan from 2011-04-08, including AdHoc train paths. The results show that a large portion of the available capacity is hidden from use by the current planning methods and scheduling rules.

  • 130.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Hallnäs, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    GCLA: Generalized horn clauses as a programming language1988Rapport (Övrigt vetenskapligt)
  • 131.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Joborn, Martin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Danielsson, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kapacitetsutnyttjande på järnvägen år 20302015Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    I denna rapport estimeras den belastning som kan uppstå på Sveriges järnvägssystem år 2030 om tillväxten för godstransporter blir som prognoser förutspår. Hänsyn har tagits till de kända planerade utbyggnaderna av infrastrukturen. Resultaten visar att det på delar av nätet kommer att bli mycket hög belastning – högre belastning än vad som idag anses hanterbart. Det gäller speciellt Södra Stambanan. På Västra Stambanan och den enkelspåriga delen av Godsstråket genom Bergslagen nås också ett mycket högt belastningsläge. Passagerartrafiken har i denna studie antagits vara konstant, dvs passagerartrafiken 2030 antas ha samma omfattning som 2010. Detta gör att skattningen av belastningen kan betraktas som konservativ, eftersom även persontrafiken förutspås att öka fram till 2030. Rapporten är slutrapport från projekt ”KLIPS – Klimat på spåret”.

  • 132.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Joborn, Martin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gestrelius, Sara
    RISE., Swedish ICT, SICS.
    Ranjbar, Zohreh
    RISE., Swedish ICT, SICS.
    Kapacitet på rangerbangården Hallsberg: resultat från projektet PRAGGE22016Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    Denna rapport beskriver dels en metod att bedöma rangerbangårdens förmåga att hantera tågbildning och dels en pilotstudie som gjorts i Hallsberg i projektet PRAGGE2. Metoden, kallad PRAGGE-metoden, bygger på att en optimerande programvara utvecklad i tidigare projekt, kallad RanPlan, används för att undersöka det extra arbete som olika bangårdsutformningar ger upphov till. Extraarbete mäts som ett nyckeltal, ER (extra valldrag), som är en funktion av antalet vagnar som får hanteras flera gånger över rangervallen. Ju högre ER-värde desto arbetsammare är det för bangården att skapa de avgående tågen. Inom ramen för denna studie har riktningsgruppens antal spår samt längder undersökts, U-gruppens betydelse för Hallsbergs rangerbangård har belysts med speciellt fokus på den nuvarande situationen med det ibland förekommande tågkön in till infartsgruppen. Vidare har en enklare undersökning av ett ev. spårbehov för s.k. ”block-swaps” (byte av ett fåtal större vagnsgrupper mellan tåg) gjorts samt även ett försök att påbörja en kategorisering eller kapacitetsbeskrivning av en rangerbangård.

  • 133.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Joborn, Martin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gestrelius, Sara
    RISE., Swedish ICT, SICS.
    Ranjbar, Zohreh
    RISE., Swedish ICT, SICS.
    Kapacitetsanalys av tre olika utbyggnadsalternativ av Sävenäs rangerbangård: resultat från pilotstudien av Sävenäs i projektet PRAGGE22016Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    Följande rapport redovisar arbetet med en av två piloter i projektet PRAGGE2, undersökning av tre bangårdsalternativ för rustningen/ombyggnaden av Sävenäs rangerbangård i Göteborg. I detta arbete har en metod utvecklad under det första PRAGGE-projektet använts för att studera tre olika utvecklingsalternativ av rangerbangården i Sävenäs, framtagna av Sweco i separat projekt. PRAGGE-metoden bygger på att mäta det extra arbete i termer av att mäta det antal gånger en vagn rangeras extra på bangården på grund av trängsel, väsentligen för få spår att bygga avgående tåg på. Metoden utgår från den i utfallsdata definierade tidtabellen och bokningen och skapar en rangerplan med minimalt antal extra rangerade vagnar över vall. Green Cargo har för PRAGGE2 ställt data från 2014 års trafik till vårt förfogande. Resultatet från pilotstudien är att en av bangårdsutformningarna från Swecos tre framtagna alternativ inte bedöms ha tillräcklig kapacitet medan de två andra har utvärderats vidare. Den ena av dem bedömdes dock inte få plats på den yta som anses kunna ställas till förfogande varvid enbart ett alternativ återstår. Erfarenheten från piloten är att PRAGGE-metoden fungerar som en kvantitativ utvärderingsmetod för att bedöma kapaciteten på föreslagen grov utformning av rangerbangården och som kompletterar de kvalitativa utvärderingsmetoder som också används.

  • 134.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Joborn, Martin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ranjbar, Zohreh
    RISE., Swedish ICT, SICS.
    FBI-BAS, Framtidssäkra BangårdsInvesteringar - Pilot BAngods-Sävenäs2015Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    Projektet fokus har varit att undersöka möjliga metoder för att dimensionera en framtida rangerbangård givet långtidsprognos och dagens trafikering av bangården. Begreppet ”knytning” definieras som den ”bokning” som vagnen har från ankommande tåg till avgående tåg. Knytningen spelar stor roll för effektiviteten, produktiviteten och belastningen på bangården. Projektet har undersökt olika möjligheter att skapa en statistisk modell av knytningarna från historiskt material, ett års trafik, på bangården. Frågeställningen har varit att se om det statistiska materialet är tillräckligt signifikant för att kunna skapa en statistisk modell av knytningarna, samt hur denna modell skall vara utformad för att kunna anslutas till det prognosdata som lämnas från systemen Samgods och Bangods. Resultatet från projektet visar att det är viktigt att utgå från en nationell nivå även för en mer detaljerad analys av rangerbangårdars belastning, så att man då bygger vidare på det resultat som genereras från Samgods. Den nuvarande kopplingen mellan Samgods-Bangods är dock svag och bör stärkas eller ersättas med alternativ eller kompletterande metod för nationell analys av järnvägens godstransporter. I projektet provades en hypotes att man kunde direkt utgå från basårets tåg och tåginnehåll, för att skatta prognosårets tåginnehåll genom statistiska metoder. Emellertid blir den statistiska modellen för svag och framför allt riskerar detta angreppssätt att cementera fast brister i den nuvarande transportstrukturen. En statistisk metod bör därför användas som komplement till en övergripande nationell analys, snarare än att vara den nationella analysen. Det statiska metod som skissa på i projektet är mycket lämplig för att till prognoser lägga till det ”brus” i transportflödet som finns. Detta ”brus” är en mycket viktig komponent i bedömningen av en rangerbangårds belastning. Rapporten avslutas med att ge några förslag på förbättringar i befintliga processer och system samt redovisar även en del idéer på alternativa kapacitetsmodelleringar och behov av kompletterande data för att få en sammanhängande process mellan prognosarbete och kapacitetsberäkning. Projektet rekommenderar tre olika fortsättningsstudier: 1) Utveckling av alternativ metod för skattning av belastning på rangeringsbangården; 2) Undersöka om Nemo eller något alternativt verktyg kan vara lämpligt för att skapa en tågplan som är väl anpassad för prognosårets transportbehov; 3) Utveckling av prototyp för att ”skapa innehåll” till prognostiserade tåg, vilket behövs för bedömning av rangeringsbehov; 4) Vidare är det önskvärt att införa en tidsdimension till flöden och transportbehov i resultaten från Samgods. Ett flertal godstyper har krav på avsändningstid och/eller frammetid vilket utgör viktiga begränsningar på de faktiska dygnsvis transporterna och spelar stor roll för bangårdens beläggning. I närtid och för att vinna tid kan respektive varugrupp eventuellt schabloniseras med dylika krav på avsändningstid och frammetid.

  • 135.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Jägbeck, Adina
    Förutsättningar för användning av likartade planeringsverktyg inom byggproduktion och järnvägstrafik2001Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    Vi presenterar en studie som jämför två branscher där planeringsmetoder är en viktigt komponent för lyckad produktion. För en trafikutövare inom järnvägssektorn är resursplanering en mycket viktig komponent för effektiv produktion, och inom byggsektorn är produktionsplanering likaså en mycket viktig komponent för effektiva byggen. Studien är gjord med fokus på möjligheterna att överföra verktyg framtagna för järnvägsoperatörers re-sursplanering inom projektet TUFF på SICS till planeringssituationen som den ser ut på byggsidan. Resultatet av studien är att de två branscherna planerar på olika sätt, framför allt skiljer ut-gångspunkten för planering: för trafikoperatören är framför allt resurserna styrande för plane-ringen, medan för byggaren är produkten styrande för planeringen. Vidare är planerna för trafikoperatören oftast cykliska och återkommande medan för byggaren är de specifika för en viss produkt eller del av produkt. Mot bakgrund av detta kan vi konstatera att de specifika planeringsmodeller som tagits fram i TUFF inte har en omedelbar och rättfram användning inom byggprojektplaneringen. Detta arbete finansierades av NUTEK och VINNOVA genom programmet Komplexa system under 1999-2001.

  • 136.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A constraint model for a cyclic time personnel routing and scheduling problem2001Rapport (Övrigt vetenskapligt)
    Abstract [en]

    We present a crew scheduling problem with time windows in the context of scheduling train personnel, which encompasses not only assignment of resources to tasks but also the introduction of extra tasks, passive journeys, depending on the problem instance. The representation of the problem is made as a constraint program, which relies heavily on some global constraints, notably a constraint for expressing non-overlap between rectangles on a surface. A search algorithm is described and we also point out some problems and deficiencies of the current model and its computational behaviour.

  • 137.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab. IAM.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gjerdrum, Jonathan
    An Efficient MIP Model for Locomotive Routing and Scheduling2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a MIP model for a locomotive routing and scheduling problem from the domain of freight railways. Innovative features of the model include the use of binary variables to separate the integer and continuous parts of the problem to maintain the flow character of the integer part of the problem. The model has been developed with, and has found practical Green Cargo, the largest rail freight operator in Sweden.

  • 138.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gjerdrum, Jonathan
    An Efficient MIP Model for Locomotive Scheduling with Time Windows2006Ingår i: Dagstuhl Seminar Proceedings, 2006, 1, , s. 21Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents an IP model for a vehicle routing and scheduling problem from the domain of freight railways. The problem is non-capacitated but allows non-binary integer flows of vehicles between transports with departure times variable within fixed intervals. Innovative features of the model include the use of boolean variables to separate the integer and continuous parts of the problem and maintaining the flow character of the integer part of the problem. The model has been developed with and has found practical use at Green Cargo, the largest freight rail operator in Sweden

  • 139.
    Aronsson, Martin
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindblom, Simon
    Holmberg, Per
    ACOOR Rapport 1; Tuff: Systemöversikt och arkitektur2000Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    TUFF är ett verktyg för strategisk planering av tågrörelser och resursomlopp (f.n. lok). Det unika med TUFF är inte att kunna utföra dessa planeringar var för sig, utan att de kan samverka. Detta är möjligt dels genom att de ingående komponenterna kan hantera vagare data, t.ex. tidsintervall i stället för fasta tider vilket är det vanliga annars bland kommersiella lösningar, dels att det finns en samordningsfunktion, som vi kallar samordningsagent, som samordnar olika planer från olika planeringsfunktioner. Denna samordnare är programmerbar via ett speciellt språk, så att ett stort problem kan splittras upp i mindre delar, och resultat från olika planeringar av dessa delar kan sedan kombineras och nya resultat genereras. Tanken med denna integrering av olika planeringsfunktioner är att åstadkomma globalt bättre lösningar, jämfört med när varje problem löses var för sig, genom att ta hänsyn till varje planeringsproblems krav tidigt i planeringscykeln.

  • 140.
    Aronsson, Martin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ranjbar, Zohreh
    RISE., Swedish ICT, SICS.
    Gestrelius, Sara
    RISE., Swedish ICT, SICS.
    Joborn, Martin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kapacitetsanalys av Sävenäs rangerbangård: Spårbehov på riktningsgruppen undersökt i projektet PRAGGE2016Rapport (Övrigt vetenskapligt)
    Abstract [sv]

    I denna rapport analyseras kapaciteten på riktningsgruppen vid Sävenäs rangerbangård. Analysmetoden bygger på att schemalägga rangeringsrörelserna som krävs för att skapa de avgående tågen givet en viss bangårdskonfiguration. Schemaläggningen görs med matematisk optimering varvid antalet extra rörelser minimeras och används som ett mått för att bedöma belastningen på bangården. Resultatet är att minst 29 spår krävs på riktningsgruppen för att genomföra 2014 års trafik på ett rimligt sätt. En viktig iakttagelse är att antalet hanterade vagnar per tidsenhet inte ensamt är ett bra mått på belastningen på bangården, utan vagnarnas ståtid, antal destinationer och antalet ankommande respektive avgående tåg är exempel på andra parametrar som spelar stor roll för belastningen.

  • 141. Arts, Thomas
    et al.
    Dam, Mads
    RISE., Swedish ICT, SICS.
    Fredlund, Lars-Åke
    RISE., Swedish ICT, SICS.
    Gurov, Dilian
    RISE., Swedish ICT, SICS.
    System description: verification of distributed Erlang programs1998Konferensbidrag (Refereegranskat)
  • 142. Arts, Thomas
    et al.
    Fredlund, Lars-Åke
    RISE., Swedish ICT, SICS.
    Trace analysis of Erlang programs2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    The paper reports on an experiment to provide the Erlang programming language with a tool package for convenient trace generation, collection and to support analysis of traces using a set of techniques. Due to the frequent use of state-based software design patterns in Erlang programming we can in many cases recover not only the events from a trace log, but also the program states causing these events. This makes it possible to obtain program models from execution traces. In our work we make use of these program models for program visualization and model checking.

  • 143. Arunachalam, Raghu
    et al.
    Eriksson, Joakim
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Sadeh, Norman M.
    The Supply Chain Management Game for the Trading Agent Competition 20042004Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This report is the specification for the Trading Agent Competition Supply Chain Management Game - TAC SCM-04, to be held between July 20-22, 2004, in New York in conjunction with AAMAS-04. Based on the experience of the 2003 Trading Agent Competition a few enhancements have been added to the original game: (1)The price function has been modified to better reflect demand; (2) storage costs have been introduced; and (3) customer demand has been segmented into multiple markets.

  • 144. Arvidsson, Åke
    et al.
    Gillblad, Daniel
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Tracking user terminals in a mobile communication network2011Patent (Övrig (populärvetenskap, debatt, mm))
    Abstract [en]

    There is provided a method of tracking user terminals in a mobile communication network. The method comprising, at a tracking node, determining that a user terminal is located in a tracking area, storing data associated with the tracking area, the data comprising a number of observations of all user terminals at the tracking area at a first time, receiving a page response from the user terminal located in one of the tracking area and a further tracking area, and in the event that the user terminal remains located at the tracking area, updating the data to include the number of page responses received at the tracking area after a first time interval, and in the event that the user terminal is located at the further tracking area, updating the data to include the number of page responses received at the further tracking area after the first time interval.

  • 145. Aschenbruck, Nils
    et al.
    Ernst, Raphael
    Schwamborn, Matthias
    Österlind, Fredrik
    RISE., Swedish ICT, SICS.
    Voigt, Thiemo
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Poster Abstract: Adding Mobility to Wireless Sensor Network Simulations2010Konferensbidrag (Refereegranskat)
  • 146.
    Aslam, Mudassar
    RISE, Swedish ICT, SICS. School of Innovation, Design and Engineering, Embedded Systems.
    Bringing Visibility in the Clouds : using Security, Transparency and Assurance Services2014Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    The evolution of cloud computing allows the provisioning of IT resources over the Internet and promises many benefits for both - the service users and providers. Despite various benefits offered by cloud based services, many users hesitate in moving their IT systems to the cloud mainly due to many new security problems introduced by cloud environments. In fact, the characteristics of cloud computing become basis of new problems, for example, support of third party hosting introduces loss of user control on the hardware; similarly, on-demand availability requires reliance on complex and possibly insecure API interfaces; seamless scalability relies on the use of sub-providers; global access over public Internet exposes to broader attack surface; and use of shared resources for better resource utilization introduces isolation problems in a multi-tenant environment. These new security issues in addition to existing security challenges (that exist in today's classic IT environments) become major reasons for the lack of user trust in cloud based services categorized in Software-as-a-Service (SaaS), Platform-as-a-Service (PaaS) or Infrastructure-as-a-Service (IaaS). The focus of this thesis is on IaaS model which allows users to lease IT resources (e.g. computing power, memory, storage, etc.) from a public cloud to create Virtual Machine (VM) instances. The public cloud deployment model considered in this thesis exhibits most elasticity (i.e. degree of freedom to lease/release IT resources according to user demand) but is least secure as compared to private or hybrid models. As a result, public clouds are not trusted for many use cases which involve processing of security critical data such as health records, financial data, government data, etc. However, public IaaS clouds can also be made trustworthy and viable for these use cases by providing better transparency and security assurance services for the user. In this thesis, we consider such assurance services and identify security aspects which are important for making public clouds trustworthy. Based upon our findings, we propose solutions which promise to improve cloud transparency thereby realizing trustworthy clouds. The solutions presented in this thesis mainly deal with the secure life cycle management of the user VM which include protocols and their implementation for secure VM launch and migration. The VM launch and migration solutions ensure that the user VM is always hosted on correct cloud platforms which are setup according to a profile that fulfills the use case relevant security requirements. This is done by using an automated platform security audit and certification mechanism which uses trusted computing and security automation techniques in an integrated solution. In addition to provide the assurance about the cloud platforms, we also propose a solution which provides assurance about the placement of user data in correct and approved geographical locations which is critical from many legal aspects and usually an important requirement of the user. Finally, the assurance solutions provided in this thesis increase cloud transparency which is important for user trust and to realize trustworthy clouds.

  • 147.
    Aslam, Mudassar
    RISE, Swedish ICT, SICS. School of Innovation, Design and Engineering.
    Secure Service Provisioning in a Public Cloud2012Licentiatavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    The evolution of cloud technologies which allows the provisioning of IT resources over the Internet promises many benefits for the individuals and enterprises alike. However, this new resource provisioning model comes with the security challenges which did not exist in the traditional resource procurement mechanisms. We focus on the possible security concerns of a cloud user (e.g. an organization, government department, etc.) to lease cloud services such as resources in the form of Virtual Machines (VM) from a public Infrastructure-as-a-Service (IaaS) provider. There are many security critical areas in the cloud systems, such as data confidentiality, resource integrity, service compliance, security audits etc. In this thesis, we focus on the security aspects which result in the trust deficit among the cloud stakeholders and hence hinder a security sensitive user to benefit from the opportunities offered by the cloud computing. Based upon our findings from the security requirements analysis,we propose solutions that enable user trust in the public IaaS clouds. Our solutions mainly deal with the secure life cycle management of the user VM which include mechanisms for VM launch and migration. The VM launch and migration solutions ensure that the user VM is always protected in the cloud by only allowing it to run on the user trusted platforms. This is done by using trusted computing techniques that allow the users to remotely attest and hence rate the cloud platforms trusted or untrusted. We also provide a prototype implementation to prove the implementation feasibility of the proposed trust enabling principles used in the VM launch and migration solutions.

  • 148.
    Aslam, Mudassar
    et al.
    RISE., Swedish ICT, SICS.
    Gehrmann, Christian
    RISE., Swedish ICT, SICS, Security Lab.
    Deploying Virtual Machines on Shared Platforms2011Rapport (Övrigt vetenskapligt)
    Abstract [en]

    In this report, we describe mechanisms for secure deployment of virtual machines on shared platforms looking into a telecommunication cloud use case, which is also presented in this report. The architecture we present focuses on the security requirements of the major stakeholders’ part of the scenario we present. This report comprehensively covers all major security aspects including different security mechanisms and protocols, leveraging existing standards and state-of-the art wherever applicable. In particular, our architecture uses TCG technologies for trust establishment in the deployment of operator virtual machines on shared resource platforms. We also propose a novel procedure for securely launching and cryptographically binding a virtual machine to a target platform thereby protecting the operator virtual machine and its related credentials.

  • 149.
    Aslam, Mudassar
    et al.
    RISE., Swedish ICT, SICS.
    Gehrmann, Christian
    RISE., Swedish ICT, SICS, Security Lab.
    Security Considerations for Virtual Platform Provisioning2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    The concept of virtualization is not new but leveraging virtualization in different modes and at different layers has revolutionized its usage scenarios. Virtualization can be applied at application layer to create sandbox environment, operating system layer to virtualize shared system resources (e.g. memory, CPU), at platform level or in any other useful possible hybrid scheme. When virtualization is applied at platform level, the resulting virtualized platform can run multiple virtual machines as if they were physically separated real machines. Provisioning virtualized platforms in this way is often also referred to as Infrastructure-as-a-Service or Platform-as-a-Service when full hosting and application support is also offered. Different business models, like datacenters or telecommunication providers and operators, can get business benefits by using platform virtualization due to the possibility of increased resource utilization and reduced upfront infrastructure setup expenditures. This opportunity comes together with new security issues. An organization that runs services in form of virtual machine images on an offered platform needs security guarantees. In short, it wants evidence that the platforms it utilizes are trustworthy and that sensitive information is protected. Even if this sounds natural and straight forward, few attempts have been made to analyze in details what these expectations means from a security technology perspective in a realistic deployment scenario. In this paper we present a telecommunication virtualized platform provisioning scenario with two major stakeholders, the operator who utilizes virtualized telecommunication platform resources and the service provider, who offers such resources to operators. We make threats analysis for this scenario and derive major security requirements from the different stakeholders’ perspectives. Through investigating a particular virtual machine provisioning use case, we take the first steps towards a better understanding of the major security obstacles with respect to platform service offerings. The last couple of years we have seen increased activities around security for clouds regarding different usage and business models. We contribute to this important area through a thorough security analysis of a concrete deployment scenario. Finally, we use the security requirements derived through the analysis to make a comparison with contemporary related research and to identify future research challenges in the area.

  • 150.
    Aslam, Mudassar
    et al.
    RISE., Swedish ICT, SICS.
    Gehrmann, Christian
    RISE., Swedish ICT, SICS, Security Lab.
    TCG based approach for secure management of virtualized platforms: state-of-the-art2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    There is a strong trend shift in the favor of adopting virtualization to get business benefits. The provisioning of virtualized enterprise resources is one kind of many possible scenarios. Where virtualization promises clear advantages it also poses new security challenges which need to be addressed to gain stakeholders confidence in the dynamics of new environment. One important facet of these challenges is establishing 'Trust' which is a basic primitive for any viable business model. The Trusted computing group (TCG) offers technologies and mechanisms required to establish this trust in the target platforms. Moreover, TCG technologies enable protecting of sensitive data in rest and transit. This report explores the applicability of relevant TCG concepts to virtualize enterprise resources securely for provisioning, establish trust in the target platforms and securely manage these virtualized Trusted Platforms.

1234567 101 - 150 av 1929
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.9