Change search
Refine search result
1234567 1 - 50 of 417
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1. Abbaspour Assadollah, Sara
    et al.
    Saadatmand, Mehrdad
    RISE - Research Institutes of Sweden, ICT, SICS.
    Sundmark, Daniel
    Hansson, Hans
    A Model for Systematic Monitoring and Debugging of Starvation Bugs in Multicore Software2016Conference paper (Refereed)
    Abstract [en]

    With the development of multicore hardware, concurrent, parallel and multicore software are becoming increasingly popular. Software companies are spending a huge amount of time and resources to nd and debug the bugs. Among all types of software bugs, concurrency bugs are also important and troublesome. This type of bugs is increasingly becoming an issue particularly due to the growing prevalence of multicore hardware. In this position paper, we propose a model for monitoring and debugging Starvation bugs as a type of concurrency bugs in multicore software. The model is composed into three phases: monitoring, detecting and debugging. The monitoring phase can support detecting phase by storing collected data from the system execution. The detecting phase can support debugging phase by comparing the stored data with starvation bug's properties, and the debugging phase can help in reproducing and removing the Starvation bug from multicore software. Our intention is that our model is the basis for developing tool(s) to enable solving Starvation bugs in software for multicore platforms.

  • 2.
    Abrahamsson, Henrik
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ahlgren, Bengt
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Alonso, Juan
    RISE - Research Institutes of Sweden, ICT, SICS.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A Multi Path Routing Algorithm for IP Networks Based on Flow Optimisation.2002Conference paper (Refereed)
  • 3.
    Abrahamsson, Henrik
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ahlgren, Bengt
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Alonso, Juan
    RISE - Research Institutes of Sweden, ICT, SICS.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    From QoS provisioning to QoS charging2002In: Proceedings of the Second International Workshop on Internet Charging and QoS Technologies, ICQT 2002, 2002, 1, Vol. Lectures Notes in Computer Science (LNCS) no. 2511, 135-144 p.Conference paper (Refereed)
  • 4.
    Abrahamsson, Henrik
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ahlgren, Bengt
    RISE - Research Institutes of Sweden, ICT, SICS.
    Lindvall, Patrik
    TeliaSonera, Sweden.
    Nieminen, Johanna
    TeliaSonera, Sweden.
    Tholin, Per
    TeliaSonera, Sweden.
    Traffic Characteristics on 1Gbit/s Access Aggregation Links2017Conference paper (Refereed)
    Abstract [en]

    Large network operators have thousands or tens of thousands of access aggregation links that they need to manage and dimension properly. Measuring and understanding the traffic characteristics on these type of links are therefore essential. What do the traffic intensity characteristics look like on different timescales from days down to milliseconds? How do the characteristics differ if we compare links with the same capacity but with different type of clients and access technologies? How do the traffic characteristics differ from that on core network links? These are the type of questions we set out to investigate in this paper. We present the results of packet level measurements on three different 1Gbit/s aggregation links in an operational IP network. We see large differences in traffic characteristics between the three links. We observe highly skewed link load probability densities on timescales relevant for buffering (i.e. 10-milliseconds). We demonstrate the existence of large traffic spikes on short timescales (10-100ms) and show their impact on link delay. We also found that these traffic bursts often are caused by only one or a few IP flows.

  • 5.
    Abrahamsson, Henrik
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Hagsand, Olof
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    TCP over High Speed Variable Capacity Links: A Simulation Study for Bandwidth Allocation2002Conference paper (Refereed)
  • 6.
    Abrahamsson, Henrik
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    DTMsim - DTM channel simulation in ns2001Report (Other academic)
    Abstract [en]

    Dynamic Transfer Mode (DTM) is a ring based MAN technology that provides a channel abstraction with a dynamically adjustable capacity. TCP is a reliable end to end transport protocol capable of adjusting its rate. The primary goal of this work is investigate the coupling of dynamically allocating bandwidth to TCP flows with the affect this has on the congestion control mechanism of TCP. In particular we wanted to find scenerios where this scheme does not work, where either all the link capacity is allocated to TCP or congestion collapse occurs and no capacity is allocated to TCP. We have created a simulation environment using ns-2 to investigate TCP over networks which have a variable capacity link. We begin with a single TCP Tahoe flow over a fixed bandwidth link and progressively add more complexity to understand the behaviour of dynamically adjusting link capacity to TCP and vice versa.

  • 7.
    Ahlgren, Bengt
    RISE - Research Institutes of Sweden, ICT, SICS.
    Improving computer communication performance by reducing memory bandwidth consumption1997Doctoral thesis, monograph (Other academic)
  • 8.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Andersson, Anders
    Hagsand, Olof
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Dimensioning Links for IP Telephony2000Report (Refereed)
    Abstract [en]

    Transmitting telephone calls over the Internet causes problems not present in current telephone technology such as packet loss and delay due to queueing in routers. In this undergraduate thesis we study how a Markov modulated Poisson process is applied as an arrival process to a multiplexer and we study the performance in terms of loss probability. The input consists of the superposition of independent voice sources. The predictions of the model is compared with results obtained with simulations of the multiplexer made with a network simulator. The buffer occupancy distribution is also studied and we see how this distribution changes as the load increases.

  • 9.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Andersson, Anders
    Hagsand, Olof
    RISE - Research Institutes of Sweden, ICT, SICS.
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Dimensioning links for IP telephony2001In: Proceedings of the 2nd IP-Telephony Workshop (IPtel 2001), 2-3 April 2001, New York City, New York, USA, 2001, 1Conference paper (Refereed)
    Abstract [en]

    Packet loss is an important parameter for dimensioning network links or traffic classes carrying IP telephony traffic. We present a model based on the Markov modulated Poisson process (MMPP) which calculates packet loss probabilities for a set of super positioned voice input sources and the specified link properties. We do not introduce another new model to the community, rather try and verify one of the existing models via extensive simulation and a real world implementation. A plethora of excellent research on queuing theory is still in the domain of ATM researchers and we attempt to highlight its validity to the IP Telephony community. Packet level simulations show very good correspondence with the predictions of the model. Our main contribution is the verification of the MMPP model with measurements in a laboratory environment. The loss rates predicted by the model are in general close to the measured loss rates and the loss rates obtained with simulation. The general conclusion is that the MMPP-based model is a tool well suited for dimensioning links carrying packetized voice in a system with limited buffer space.

  • 10.
    Ahlgren, Bengt
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Björkman, Mats
    Gunningberg, Per
    Integrated layer processing can be hazardous to your performance1997Conference paper (Refereed)
    Abstract [en]

    Integrated Layer Processing (ILP) has been presented as an implementation technique to improve communication protocol performance by reducing the number of memory references. Previous research has however not pointed out that in some circumstances ILP can significantly increase the number of memory references, resulting in lower communication throughput. We explore the performance effects of applying ILP to data manipulation functions with varying characteristics. The functions are generated from a set of parameters including input and output block size, state size and number of instructions. We present experimental data for varying function state sizes, number of integrated functions and instruction counts. The results clearly show that the aggregated state of the functions must fit in registers for ILP to be competitive.

  • 11.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Björkman, Mats
    Gunningberg, Per
    RISE - Research Institutes of Sweden, ICT, SICS.
    The applicability of integrated layer processing1998In: IEEE Journal on Selected Areas in Communications, Vol. 16, no 3, 317-331 p.Article in journal (Refereed)
    Abstract [en]

    In this paper we review previous work on the applicability and performance of Integrated Layer Processing (ILP). ILP has been shown to clearly improve computer communication performance when integrating simple data manipulation functions, but the situation has been less clear for more complex functions and complete systems. We discuss complications when applying ILP to protocol stacks, the requirements of ILP on the communication subsystem, caching aspects, the importance of the processor registers, and a model for predicting the performance of data manipulation functions. We conclude that the main drawback of ILP is its limited aplicability to complex data manipulation functions. The performance to expect from an ILP implementation also depends heavily on the protocol architecture and the host system architecture.

  • 12.
    Ahlgren, Bengt
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Björkman, Mats
    Gunningberg, Per
    RISE - Research Institutes of Sweden, ICT, SICS.
    Towards predictable ILP performance-controlling communication buffer cache effects1995Conference paper (Refereed)
  • 13.
    Ahlgren, Bengt
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Björkman, Mats
    Moldeklev, Kjersti
    The performance of a no-copy API for communication1995Conference paper (Refereed)
    Abstract [en]

    We present a so-called no-copy Application Programming Interface (API) for communication. The interface avoids copying when data is transferred between the application and operating system kernel address spaces. The API is an extension to the socket interface for SunOS, and has been implemented on Sun SPARCstations equipped with Fore Systems ATM adapters. Throughput for the no-copy API is 85 Mbit/s for 8K UDP messages, to be compared to 57 Mbit/s for the regular API on the SPARCstation 2. Processing times through the TCP and UDP stacks are reduced by up to 30% for the SPARCstation 2 and by more than 50% for the SPARCstation 10.

  • 14.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    D’Ambrosio, Matteo
    4WARD.
    Dannewitz, Christian
    4WARD.
    Marchisio, Marco
    4WARD.
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ohlman, Börje
    4WARD.
    Pentikousis, Kostas
    4WARD.
    Rembarz, René
    4WARD.
    Strandberg, Ove
    4WARD.
    Vercellone, Vinicio
    4WARD.
    Design considerations for a network of information2008Conference paper (Refereed)
    Abstract [en]

    The existing Internet ecosystem is a result of decades of evolution. It has managed to scale well beyond the original aspirations. Evolution, though, highlighted a certain degree of inadequacies that is well documented. In this position paper we present the design considerations for a re-architected global networking architecture which delivers dissemination and non-dissemination objects only to consenting recipients, reducing unwanted traffic, linking information producers with consumers independently of the hosts involved, and connects the digital with the physical world. We consider issues ranging from the proposed object identifier/locator split to security and trust as we transition towards a Network of Information and relate our work with the emerging paradigm of publish/subscribe architectures. We introduce the fundamental components of a Network of Information, i.e., name resolution, routing, storage, and search, and close this paper with a discussion about future work.

  • 15.
    Ahlgren, Bengt
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gunningberg, Per
    RISE - Research Institutes of Sweden, ICT, SICS.
    Moldeklev, Kjersti
    Increasing communication performance with a minimal-copy data path supporting ILP and ALF1996In: Journal of High Speed Networks, Vol. 5, no 2, 203-214 p.Article in journal (Refereed)
    Abstract [en]

    Many current implementations of communication subsystems on workstation class computers transfer communication data to and from primary memory several times. This is due to software copying between user and operating system address spaces, presentation layer data conversion and other data manipulation functions. The consequence is that memory bandwidth is one of the major performance bottlenecks limiting high speed communication on these systems. We propose a communication subsystem architecture with a minimal-copy data path to widen this bottleneck. The architecture is tailored for protocol implementations using Integrated Layer Processing (ILP) and Application Layer Framing (ALF). We choose to implement these protocols in the address space of the application program. We present a new application program interface (API) between the protocols and the communication service in the operating system kernel. The API does not copy data, but instead passes pointers to page size data buffers. We analyze and discuss ILP loop and cache memory requirements on these buffers. Initial experiments show that the API can increase the communication performance with 50% compared to a standard BSD Unix socket interface.

  • 16.
    Albertsson, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    Simulation-based debugging of soft real-time applications2001In: Real-Time Technology and Applications Symposium, 2001. Proceedings. Seventh IEEE, 2001, 1, 107-109 p.Conference paper (Refereed)
    Abstract [en]

    We present a temporal debugger, capable of examining time flow of soft real-time applications in Unix systems. The debugger is based on a simulator modelling an entire workstation in sufficient detail to run unmodified operating systems and applications. It provides a deterministic and non-intrusive debugging environment, allowing reproducible presentation of program time flow. The primary contribution of this paper is virtual machine translation, a technique necessary to debug applications in a simulated Unix system. We show how a virtual machine translator maps low-level data, provided by the simulator, to data useful to a symbolic debugger. The translator operates by parsing data structures in the target operating system and has been implemented for the GNU debugger and simulated Linux systems.

  • 17.
    Albertsson, Lars
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Magnusson, Peter
    RISE - Research Institutes of Sweden, ICT, SICS.
    Simulation-based temporal debugging of Linux2000In: Proceedings of the Second Real-Time Linux Workshop, 27-28 Nov 2000, Orlando, Florida, USA, 2000, 1Conference paper (Refereed)
  • 18.
    Albertsson, Lars
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Magnusson, Peter
    RISE - Research Institutes of Sweden, ICT, SICS.
    Using complete system simulation for temporal debugging of general purpose operating systems and workloads2000In: Proceedings of MASCOTS 2000, 29 Aug - 01 Sept 2000, San Francisco, California, USA, IEEE, 2000, 1Conference paper (Refereed)
  • 19.
    Ali, Khayri Mohammed
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Wong, Milton
    An investigation of an OR parallel execution model for horn clause programs1988Report (Other academic)
    Abstract [en]

    We present a model for OR parallel execution of Horn clause programs on a combined local and shared memory multiprocessor system. In this model, the shared memory only contains control information that guides processors requesting a job to independently construct the environment required to get a new job. Each processor has a local memory containing its own binding environment. This reduces the traffic to the shared memory and allows each processor to process its job with high performance. Each processor is almost the same as Warren's Abstract Machine (WAM). A method for nonshared memory multiprocessor architectures is outlined. We also present some preliminary results of an experimental investigation of the model.

  • 20.
    Alirezaie, Marjan
    et al.
    Örebro University,Örebro, Sweden.
    Renoux, Jennifer
    Örebro University,Örebro, Sweden.
    Köckemann, Uwe
    Örebro University,Örebro, Sweden.
    Kristoffersson, Annica
    Örebro University,Örebro, Sweden.
    Karlsson, Lars
    Örebro University,Örebro, Sweden.
    Blomqvist, Eva
    RISE - Research Institutes of Sweden, ICT, SICS.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Loutfi, A
    Örebro University,Örebro, Sweden.
    An ontology-based context-aware system for smart homes: E-care@home2017In: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 17, no 7, 1586Article in journal (Refereed)
    Abstract [en]

    Smart home environments have a significant potential to provide for long-term monitoring of users with special needs in order to promote the possibility to age at home. Such environments are typically equipped with a number of heterogeneous sensors that monitor both health and environmental parameters. This paper presents a framework called E-care@home, consisting of an IoT infrastructure, which provides information with an unambiguous, shared meaning across IoT devices, end-users, relatives, health and care professionals and organizations. We focus on integrating measurements gathered from heterogeneous sources by using ontologies in order to enable semantic interpretation of events and context awareness. Activities are deduced using an incremental answer set solver for stream reasoning. The paper demonstrates the proposed framework using an instantiation of a smart environment that is able to perform context recognition based on the activities and the events occurring in the home.

  • 21.
    Alonso, Juan
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Abrahamsson, Henrik
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ahlgren, Bengt
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Objective Functions for Balance in Traffic Engineering2002Report (Other academic)
    Abstract [en]

    We prove a result concerning objective functions that can be used to obtain efficient and balanced solutions to the multi-commodity network flow problem. This type of solution is of interest when routing traffic in the Internet. A particular case of the result proved here (see Corollary 2 below) was stated without proof in a previous paper.

  • 22. Andersson, Gerd
    et al.
    Bullock, Adrian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Laaksolahti, Jarmo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Nylander, Stina
    RISE, Swedish ICT, SICS, Software and Systems Engineering Laboratory.
    Olsson, Fredrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Sjölinder, Marie
    RISE - Research Institutes of Sweden, ICT, SICS.
    Waern, Annika
    RISE, Swedish ICT, SICS.
    Boman, Magnus
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Classifying Mobile Services2004Report (Refereed)
    Abstract [en]

    A categorization of telecommunications services is presented, as a deliverable in a project commissioned by TeliaSonera.

  • 23. Andersson, Johan
    et al.
    Andersson, Stefan
    Boortz, Kent
    Carlsson, Mats
    RISE - Research Institutes of Sweden, ICT, SICS.
    Nilsson, Hans
    Sjöland, Thomas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Widén, Johan
    RISE - Research Institutes of Sweden, ICT, SICS.
    SICStus Prolog user's manual, version 2.1 #81993Report (Other academic)
    Abstract [en]

    This Manual corresponds to SICStus Prolog release 2.1. #8 Prolog is a simple but powerful programming language developed at the University of Marseilles (Prolog : Manuel de Reference et d'Utilisation by P.Roussel, Groupe d'Intelligence Artificielle, Marseille-Luminy, 1975), as a practical tool for programming in Logic (Logic for Problem Solving by R.A. Kowalski, DCL Memo 75, Dept. of Artificial Intelligence, University of Edinburgh, March, 1974.)) From a user's point of view the major attraction of the language is ease of programming. Clear, readable, concise programs can be written quickly with few errors. This manual describes a Prolog system developed at the Swedish Institute of Computer Science in collaboration with Ericsson Telecom AB, NobelTech Systems AB, Infologics AB and Televerket under the IT4 program. The system consists of a WAM emulator written in C, a library and runtime system written in C and Prolog and an interpreter and a compiler written in Prolog. The Prolog engine is a Warren Abstract Machine (WAM) emulator defined by D:H:D: Warren in An Abstract Prolog Instruction Set, Tech. Note 309, International, Menlo Park, CA, 1983. Two modes of compilation are available: in-core i.e. incremental, and file-to-file.

  • 24. Arnborg, Stefan
    et al.
    Sjödin, Gunnar
    RISE - Research Institutes of Sweden, ICT, SICS.
    Bayes rules in finite models2000In: Proceedings of the European Conference on Artificial Intelligence, 20-25 Aug 2000, Berlin, Germany, 2000, 1, , 5 p.571-575 p.Conference paper (Refereed)
  • 25. Arnborg, Stefan
    et al.
    Sjödin, Gunnar
    RISE - Research Institutes of Sweden, ICT, SICS.
    On the foundations of Bayesianism2000Conference paper (Refereed)
  • 26. Arnborg, Stefan
    et al.
    Sjödin, Gunnar
    RISE - Research Institutes of Sweden, ICT, SICS.
    On the foundations of bayesianism2001Conference paper (Refereed)
    Abstract [en]

    We discuss precise assumptions entailing Bayesianism in the line of investigations started by Cox, and relate them to a recent critique by Halpern. We show that every finite model which cannot be rescaled to probability violates a natural and simple refinability principle. A new condition, separability, was found sufficient and necessary for rescalability of infinite models.We finally characterise the acceptable ways to handle uncertainty in infinite models based on Cox's assumptions. Certain closure properties must be assumed before all the axioms of ordered fields are satisfied. Once this is done, a proper plausibility model can be embedded in an ordered field containing the reals, namely either standard probability (field of reals) for a real valued plausibility model, or extended probability (field of reals and infinitesimals) for an ordered plausibility model.

  • 27.
    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 Concept2010Conference paper (Refereed)
    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.

  • 28.
    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 study2009In: 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, 13Conference paper (Refereed)
    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.

  • 29.
    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 study2007Report (Other academic)
    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.

  • 30.
    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 programming1989Report (Other academic)
    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.

  • 31.
    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 programming1989In: Proceedings of the first international workshop on extensions of logic programming, ELP '89, Springer Verlag , 1989, 3, Vol. 475, 49-100 p.Conference paper (Refereed)
  • 32.
    Aronsson, Martin
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab. RISE - Research Institutes of Sweden, ICT, SICS.
    Forsgren, Malin
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gestrelius, Sara
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab. RISE - Research Institutes of Sweden, ICT, SICS.
    Uncovered capacity in Incremental Allocation2017Report (Other academic)
    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.

  • 33.
    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 language1988Report (Other academic)
  • 34.
    Aronsson, Martin
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Joborn, Martin
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gestrelius, Sara
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ranjbar, Zohreh
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kapacitet på rangerbangården Hallsberg: resultat från projektet PRAGGE22016Report (Other academic)
    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.

  • 35.
    Aronsson, Martin
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Joborn, Martin
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gestrelius, Sara
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ranjbar, Zohreh
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kapacitetsanalys av tre olika utbyggnadsalternativ av Sävenäs rangerbangård: resultat från pilotstudien av Sävenäs i projektet PRAGGE22016Report (Other academic)
    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.

  • 36. Arts, Thomas
    et al.
    Dam, Mads
    RISE - Research Institutes of Sweden, ICT, SICS.
    Verifying a distributed database lookup manager written in Erlang1999In: FM'99 - Formal Methods: Proceedings of World Congress on Formal Methods in the Development of Computing Systems, 20- 24 Sept 1999, Toulouse, France, 1999, 1, 681-700 p.Conference paper (Refereed)
  • 37.
    Aurell, Erik
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    GENFUNK2002Report (Other academic)
    Abstract [en]

    This document summarizes the results obtained by SICS in project GENFUNK (2001). The project was carried out in collaboration with Global Genomics AB (Stockholm, Sweden). Jointly obtained results will be presented separately. Main funding was provided by Swedish Research Agency VINNOVA. Project GENFUNK studied a novel approach of measuring the global gene expression. In the method, mRNA is extracted from a tissue sample and transformed into cDNA captured on magnetic beads. This is then acted on by type IIS restriction endonucleases, which recognize certain short DNA sequences and cut the DNA close to those sequences. The resulting fragments are amplified in PCR with selected ligation fragments, and displayed in capillary electrophoresis. Determining the gene expression levels from the peak data is combinatorial optimization problem, which can in principle be solved, to give expression levels of most genes active in sampled cells, with good accuracy.

  • 38.
    Aurell, Erik
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Do-Quang, Minh
    An inventory of Lattice Boltzmann models of multiphase flows2001Other (Other academic)
    Abstract [en]

    This document reports investigations of models of multiphase flows using Lattice Boltzmann methods. The emphasis is on deriving by Chapman- Enskog techniques the corresponding macroscopic equations. The singular interface (Young-Laplace-Gauss) model is described briefly, with a discussion of its limitations. The diffuse interface theory is discussed in more detail, and shown to lead to the singular interface model in the proper asymptotic limit. The Lattice Boltzmann method is presented in its simplest form appropriate for an ideal gas. Four different Lattice Boltzmann models for non-ideal multi-phase) isothermal flows are then presented in detail, and the resulting macroscopic equations derived. Partly in contradiction with the published literature, it is found that only one of the models gives physically fully acceptable equations. The form of the equation of state for a multiphase system the density interval above the coexistance line determines surface tension and interface thickness in the diffuse interface theory. The use of this relation for optimizing a numerical model is discussed. The extension of Lattice Boltzmann methods to the non-isothermal situation is discussed.

  • 39.
    Aurell, Erik
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Fanelli, Duccio
    Muratore-Ginanneschi, Paolo
    On the dynamics of a self-gravitating medium with random and non-random initial conditions2001In: Physica D: Non-linear phenomena, ISSN 0167-2789, E-ISSN 1872-8022, Vol. 148, no 3-4, 272-288 p.Article in journal (Refereed)
    Abstract [en]

    The dynamics of a one-dimensional self-gravitating medium, with initial density almost uniform is studied. Numerical experiments are performed with ordered and with Gaussian random initial conditions. The phase space portraits are shown to be qualitatively similar to shock waves, in particular with initial conditions of Brownian type. The PDF of the mass distribution is investigated.

  • 40.
    Avatare, Anneli
    RISE - Research Institutes of Sweden, ICT, SICS.
    A graphical SDL editor produced by the Meta-Tool LOGGIE1990Report (Other academic)
    Abstract [en]

    We present a prototype implementation of a graphical editor for a subset of SDL(Specification and Description Language). SDL is a CCITT recommended standard for specifying and describing telecom systems. The editor is defined by the meta-tool LOGGIE, a tool for generating interactive language-oriented graphical editors. A short introduction to LOGGIE is given and the SDL application is described including a presentation of the chosen subset of the SDL syntax.

  • 41.
    Avatare, Anneli
    RISE - Research Institutes of Sweden, ICT, SICS.
    Computer aided hardware design by space-time mappings1989Report (Other academic)
    Abstract [en]

    This is a thesis work for the M.Sc. degree in mathematics and computer science at the University of Stockholm, accomplished at SICS, Swedish Institute of Computer Science, Kista during the summer and autumn 1989. This thesis deals with hardware synthesis by space-time mappings. It is a method to map the steps in algorithm to distinct events in a space-time. If the pattern of an algorithm is known in advance then the algorithm can be implemented directly in the hardware when it is known where and then all steps in the algorithm will be executed then it can be determined where cells shall be placed and how they shall be connected to each other. I have developed a prototype, an Interactive Space-Time Scheduler, that can be used as an aid to schedule algorithms manually in the space-time. The user interface is developed in the Xerox/Interlisp-D environment.

  • 42.
    Avatare, Anneli
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Sjölinder, Marie
    RISE, Swedish ICT, SICS.
    Live Broadcasting – The Feeling of Presence and Social Interaction2011Conference paper (Refereed)
    Abstract [en]

    This paper describes user-related aspects in the deployment of a live broadcasting service. Four user studies were conducted, addressing different user groups and different research questions. Participating user groups were the production team that generated content for live broadcasts and the viewers of the broadcasts. The aim of the studies was to investigate to which extent quality affects the experience and which functionality is needed to convey a feeling of presence. Technology and functionality needs were studied regarding the production team. The results showed the importance of a production environment that is easy to use, and providing the opportunity for producers to use the technology in their own creative way. The results related to the viewers supported the assumption that it was important to create a feeling of presence for those watching the matches via the service. Finally, the user groups also had several suggestions for functionalities that could increase the social interaction and feeling of presence.

  • 43.
    Axelsson, Jakob
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Franke, Ulrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Carlson, Jan
    Mälardalen University, Sweden.
    Sentilles, Severine
    Mälardalen University, Sweden.
    Cicchetti, Antonio
    Mälardalen University, Sweden.
    Towards the architecture of a decision support ecosystem for system component selection2017In: 11th Annual IEEE International Systems Conference, SysCon 2017 - Proceedings, 2017Conference paper (Refereed)
    Abstract [en]

    When developing complex software-intensive systems, it is nowadays common practice to base the solution partly on existing software components. Selecting which components to use becomes a critical decision in development, but it is currently not well supported through methods and tools. This paper discusses how a decision support system for this problem could benefit from a software ecosystem approach, where participants share knowledge across organizations both through reuse of analysis models, and through partially disclosed past decision cases. We show how the ecosystem architecture becomes fundamental to deal with efficient knowledge sharing, while respecting constraints on integrity of intellectual property. A concrete architecture proposal is outlined, which is a web-based distributed system-of-systems. Experiences of a proof-of-concept implementation are also described.

  • 44.
    Axelsson, Jakob
    et al.
    RISE, Swedish ICT, SICS, Software and Systems Engineering Laboratory.
    Papatheocharous, Efi
    RISE, Swedish ICT, SICS, Software and Systems Engineering Laboratory.
    Nyfjord, Jaana
    RISE - Research Institutes of Sweden, ICT, SICS.
    Törngren, Martin
    Notes On Agile and Safety-Critical Development2016In: Software Engineering Notes: an Informal Newsletter of The Specia, ISSN 0163-5948, E-ISSN 1943-5843, Vol. 41, no 2, 23-36 p.Article in journal (Refereed)
    Abstract [en]

    Agile approaches have been highly influential to the software engineering practices in many organizations, and are increasingly being applied in larger companies, and for developing systems outside the pure software domain. To understand more about the current state of agile, its applications to safety-critical systems, and the consequences on innovation and large organizations, a seminar was organized in Stockholm in 2014. This paper gives an overview of the topics discussed at that seminar, a summary of the main results and suggestions for future work as input to a research agenda for agile development of safety-critical software.

  • 45.
    Backlund, Björn
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Hagsand, Olof
    RISE - Research Institutes of Sweden, ICT, SICS.
    Pehrson, Björn
    RISE - Research Institutes of Sweden, ICT, SICS.
    Generation of graphic language-oriented design environments1989Report (Other academic)
    Abstract [en]

    We review some results in the area of using meta techniques to generate language-oriented programming environments. We focus on environments for languages having a two-dimensional syntax based on attribute grammars and constraints. We introduce edit-semantic attributes, a new classof attributes which control the user interaction and graphic presentation. We present LOGGIE, a prototype tool implementing some of the meta techniques discussed. The tool generates interactive language-oriented graphical editors.

  • 46. Barthe, Gilles
    et al.
    Gurov, Dilian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Huisman, Marieke
    Compositional specification and verification of control flow based security properties of multi-application programs2001In: Proceedings of the Workshop on Formal Techniques for Java Programs (FTfJP), 18 June 2001, Budapest, Hungary, 2001, 1Conference paper (Refereed)
    Abstract [en]

    The paper presents a compositional program model of multi-application programs and sketches a framework for compositional specification and verification of temporal properties of such programs.

  • 47.
    Beldiceanu, Nicolas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Global constraints as graph properties on a structured network of elementary constraints of the same type2000In: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, CP2000, 18-21 Sept 2000, Singapore, 2000, 1Conference paper (Refereed)
  • 48.
    Beldiceanu, Nicolas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Pruning for the cardinality-path constraint family2001Conference paper (Refereed)
    Abstract [en]

    This paper presents generic propagation algorithms for the cardinality-path constraint family. This is a restricted form of the cardinality operator that allows stating constraints on sliding sequences of consecutive variables. Taking advantage of these restrictions permits coming up with more efficient algorithms. Moreover the paper shows how to extend these propagation algorithms in order to partially integrate external constraints that have to hold. From an application point of view the cardinality-path constraint allows to express a huge variety of regulation constraints occurring in personnel planning problems.

  • 49.
    Beldiceanu, Nicolas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Pruning for the minimum constraint family and for the number of distinct values constraint family2001Conference paper (Refereed)
    Abstract [en]

    The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as time tabling or frequency allocation problems. A second important contribution is to provide a pruning algorithm for the constraint "at most n distinct values for a set of variables". This can be considered as the counterpart of Regin's algorithm for the all different constraint where one enforces having at least n distinct values for a given set of n variables.

  • 50.
    Beldiceanu, Nicolas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Sweep as a generic pruning technique2000Conference paper (Refereed)
1234567 1 - 50 of 417
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.29.1