Ändra sökning
Avgränsa sökresultatet
1234567 51 - 100 av 349
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • 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.
  • 51.
    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 Engineering2002Rapport (Övrigt vetenskapligt)
    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.

  • 52. 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., Swedish ICT, SICS.
    Waern, Annika
    RISE., Swedish ICT, SICS.
    Boman, Magnus
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Classifying Mobile Services2004Rapport (Övrigt vetenskapligt)
    Abstract [en]

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

  • 53.
    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.

  • 54.
    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.

  • 55.
    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)
  • 56.
    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.

  • 57.
    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.

  • 58.
    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.

  • 59.
    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.

  • 60.
    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.

  • 61.
    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.

  • 62.
    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.

  • 63.
    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.

  • 64.
    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.

  • 65.
    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.

  • 66.
    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.

  • 67.
    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.

  • 68.
    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.

  • 69.
    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.

  • 70.
    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.

  • 71.
    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.

  • 72.
    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)
  • 73.
    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)
  • 74.
    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”.

  • 75.
    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.

  • 76.
    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.

  • 77.
    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.

  • 78.
    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

  • 79.
    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.

  • 80. 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.

  • 81. Aurell, Erik
    et al.
    Boman, Magnus
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Carlsson, Mats
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    A trading agent built on constraint programming2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Trading Agent Competition (TAC) combines a fairly realistic model of the Internet commerce of the future, including shopbots and pricebots, with a challenging problem in automated reasoning and decision making. Automated trading via auctions under severe time constraints are to be con-ducted by entering autonomous agents into TAC, assuming the role of travel agents. The TAC game rules, as well as a description of the discrete op-timization problem faced by an agent that wishes to allocate goods to its clients, are described. The TAC’01 entry “006”, encapsulating a constraint programming solution, is explained in some detail.

  • 82.
    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.
    GENFUNK2002Rapport (Övrigt vetenskapligt)
    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.

  • 83. Bardeli, Rolf
    et al.
    Boujemaa, Nozha
    Compañó, Ramón
    Doch, Christoph
    Geurts, Joost
    Gouraud, Henri
    Joly, Alexis
    Karlgren, Jussi
    RISE., Swedish ICT, SICS.
    King, Paul
    Köhler, Joachim
    Kompatsiaris, Yiannis
    Le Moine, Jean-Yves
    Ortgies, Robert
    Point, Jean-Charles
    Rotenberg, Boris
    Rudström, Åsa
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Schreer, Oliver
    Sebe, Nicu
    Snoek, Cees
    CHORUS Deliverable 2.2: Second report - identification of multi-disciplinary key issues for gap analysis toward EU multimedia search engines roadmap2008Övrigt (Övrigt vetenskapligt)
    Abstract [en]

    After addressing the state-of-the-art during the first year of Chorus and establishing the existing landscape in multimedia search engines, we have identified and analyzed gaps within European research effort during our second year. In this period we focused on three directions, notably technological issues, user-centred issues and use-cases and socio- economic and legal aspects. These were assessed by two central studies: firstly, a concerted vision of functional breakdown of generic multimedia search engine, and secondly, a representative use-cases descriptions with the related discussion on requirement for technological challenges. Both studies have been carried out in cooperation and consultation with the community at large through EC concertation meetings (multimedia search engines cluster), several meetings with our Think-Tank, presentations in international conferences, and surveys addressed to EU projects coordinators as well as National initiatives coordinators. Based on the obtained feedback we identified two types of gaps, namely core technological gaps that involve research challenges, and “enablers”, which are not necessarily technical research challenges, but have impact on innovation progress. New socio-economic trends are presented as well as emerging legal challenges.

  • 84.
    Ben Abdesslem, Fehmi
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindgren, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Cacheability of YouTube Videos in Cellular Networks2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Video traffic now represents a growing proportion of the traffic on cellular networks, causing capacity problems for operators and increased delays for users. Studies have shown that deploying caches at the network level reduces the delay for the end-user and the overall traffic volume for the telecom operator. In this paper, we analyse a large nationwide dataset of real-life video requests sent by mobile users to a popular video streaming website. This analysis is the first to rely on such a large dataset, and sheds light on the optimal cacheability of video content with caches distributed in the cellular network, and how efficient some existing cache replacement algorithms are at reducing the number of requests sent to the video provider. We show that depending on the cache size and algorithm parameters, up to 20.33% of the requests can be served by a local cache.

  • 85.
    Ben Abdesslem, Fehmi
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindgren, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Demo: Mobile Opportunistic System for Experience Sharing (MOSES) in Indoor Exhibitions2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Information-Centric Networking (ICN) is an alternative architecture for computer networks, where the communication is focused on the data being transferred instead of the communicating hosts. This paper describes a demo of an experience sharing application for mobile phones built on an ICN platform designed for devices with intermittent connectivity. In particular, we detail how this application will be showcased in an indoor exhibition where experience is shared with media content that is geo-tagged using Bluetooth beacons and spread opportunistically to other users. 

  • 86.
    Ben Abdesslem, Fehmi
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindgren, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Large Scale Characterisation of YouTube Requests in a Cellular Network2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Traffic from wireless and mobile devices is expected to soon exceed traffic from fixed devices. Understanding the behaviour of users on mobile devices is important in order to improve the offered services and the provision of the underlying network. Globally, more than 60% of consumer Internet traffic is estimated to be video traffic, and the most popular video website, YouTube, estimates that mobile access makes up nearly 40% of the global watch time. This paper presents the first work to study the characteristics of YouTube user requests on a nationwide cellular network. This study is based on the analysis of a large dataset generated by 3 million users and collected by a major telecom operator. We show for instance that 20% of the users generate 78% of the requests, and that over 80% of the requests target only 20% of the distinct videos accessed during the data collection period. Our results provide a comprehensive insight into the way people use YouTube on mobile devices, and show a very high potential for video cacheability on the cellular network.

  • 87.
    Ben Abdesslem, Fehmi
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindgren, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    The Pursuit of 'Appiness: Exploring Android Market Download Behaviour in a Nationwide Cellular Network2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Mobile devices are now part of our everyday lives, and the emergence of online application marketplaces allow a rapid spread of new mobile applications to a large user base. Such user-installed mobile applications constitute a large part of our daily interaction with the devices. With more than one million available applications, Android Market, the online catalog for Android devices allows users to choose and download a large selection of disparate applications. Analysing and characterising the application marketplace download patterns provides a better insight on the needs and behaviour of users In this paper, we explore a large dataset collected by a major European telecom operator to study the downloads of Android applications on a nationwide scale. Our findings include that more than 43% of the application data downloaded is for games, and that a set of only 10 GB of applications is responsible for 88% of the 45 TB downloaded in total by all the users. 

  • 88.
    Ben Abdesslem, Fehmi
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindgren, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Hess, Andrea
    RISE., Swedish ICT, SICS.
    Understanding usage and activity in cellular networks by investigating HTTP requests2015Ingår i: 2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC), 2015, 11, s. 570-575, artikel-id 7158036Konferensbidrag (Refereegranskat)
    Abstract [en]

    The number of mobile devices is estimated to now exceed the world’s population, using more and more cloud services, and hence generating more and more traffic. Smartphones generate 95% of the total global handset traffic, and while approximately half of this traffic is sent to cellular networks, other handsets such as tablets are also using increasingly the cellular networks. This paper provides a closer look at the traffic generated on cellular networks by exploring billions of HTTP requests sent by millions of users to a nation-wide cellular network during 41 days. We confirm that - as in many other contexts - 20% of the users are responsible for more than 80% of the requests and provide a deeper analysis of the cellular network usage. Furthermore, we characterise the activity of users on their mobile device and which cloud services they use. For instance, almost 30% of the users use the cellular network frequently, mainly using search services and social networks, but 20% of their requests are sent to advertisement and tracking systems.

  • 89. Berglund, Åsa
    et al.
    Bjurling, Björn
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Dantas, Ramide
    Engberg, Susanne
    Giambiagi, Pablo
    RISE., Swedish ICT, SICS.
    Ohlman, Börje
    Towards goal-based autonomic networking2009Ingår i: Proceedings of the Distributed Autonomous Network Magagement Systems Workshop (DANMS 2008), November 2008, 2009, 1, , s. 5Konferensbidrag (Refereegranskat)
    Abstract [en]

    The ability to quickly deploy and efficiently manage services is critical to the telecommunications industry. Currently, services are designed and managed by different teams with expertise over a wide range of concerns, from high-level business to low level network aspects. Not only is this approach expensive in terms of time and resources, but it also has problems to scale up to new outsourcing and/or multi-vendor models, where subsystems and teams belong to different organizations. We endorse the idea, upheld among others in the autonomic computing community, that the network and system components involved in the provision of a service must be crafted to facilitate their management. Furthermore, they should help bridge the gap between network and business concerns. In this paper, we sketch an approach based on early work on the hierarchical organization of autonomic entities that possibly belong to different organizations. An autonomic entity governs over other autonomic entities by defining their goals. Thus, it is up to each autonomic entity to decide its line of actions in order to fulfill its goals, and the governing entity needs not know about the internals of its subordinates. We illustrate the approach with a simple but still rich example of a telecom service.

  • 90. Bertels, Koen
    et al.
    Boman, Magnus
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Agent-based social simulation in markets2001Ingår i: Electronic Commerce Research, ISSN 1389-5753, E-ISSN 1572-9362, Vol. 1, nr 1-2, s. 149-158Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We show that certain desired behavioural properties of agent-based models can be deterministically induced by an appropriate mathematical structure. We also point out problems related to the handling of parameters, and of the modelling of time, in agent-based models. Our purpose is to illustrate some problems of agent-based social simulations in markets, as a first step towards the more ambitious goal of providing a methodology for such simulations.

  • 91. Bertels, Koen
    et al.
    Jacques, Jean-Marie
    Boman, Magnus
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Risk and crises management in complex systems2005Ingår i: MICRO MESO MACRO: Addressing Complex Systems Couplings, World Scientific Publishing Company , 2005, 4, , s. 12s. 305-316Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Many theories attempt to explain the nature of industrial and other kinds of hazards and some of the also stress the dynamical aspects of such events. We investigate to what extent the theory of self-organized criticality contributes to our understanding of industrial hazards.

  • 92. Berti, Valentino
    et al.
    Björkman, Mats
    Norden, Lars-Åke
    Lindgren, Anders
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Datakommunikation2012 (uppl. 7)Bok (Övrigt vetenskapligt)
    Abstract [sv]

    Denna bok ger en bred introduktion till datakommunikation i allmänhet och internetteknologi i synnerhet. Vad Internet är beror helt på vem du frågar, och detsamma gäller ämnet datakommunikation. Från att ha varit ett specialämne som studenter möjligtvis läste i årskurs 3 eller 4 på datatekniska universitetsutbildningar så kan man idag lära sig grunderna i datakommunikation på flera gymnasieprogram. Författarna till denna bok har alla personlig erfarenhet av att undervisa i ämnet datakommunikation på olika nivåer. Bokens struktur möjliggör olika sätt att tillgodogöra sig materialet beroende på vad som är mest tilltalande för respektive målgrupp.

  • 93.
    Bjurling, Björn
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A Labelled Deductive System for Reasoning about Random Experiments2006Doktorsavhandling, monografi (Övrigt vetenskapligt)
  • 94.
    Bjurling, Björn
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Contracts for Resources in Crisis Management2010Konferensbidrag (Refereegranskat)
  • 95.
    Bjurling, Björn
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Giambiagi, Pablo
    RISE., Swedish ICT, SICS.
    Contracts for controlling business processes in dynamic environments2008Konferensbidrag (Refereegranskat)
  • 96.
    Bjurling, Björn
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Hansen, Preben
    RISE., Swedish ICT, SICS.
    Contracts for Information Sharing in Collaborative Networks2010Konferensbidrag (Refereegranskat)
  • 97.
    Bjurling, Björn
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Data Readiness for BADA: BADA main study 1, FFI/Vinnova grant 2015-006772017Rapport (Övrigt vetenskapligt)
  • 98.
    Bjurling, Björn
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Rasmusson, Lars
    RISE., Swedish ICT, SICS, Computer Systems Laboratory.
    Johansson, Ulf M
    Qualitative policies for bandwidth priorities in ad-hoc networks2008Ingår i: Proc. IEEE 27th Conference on Computer Communications, 2008, 1Konferensbidrag (Refereegranskat)
  • 99.
    Bjurling, Björn
    et al.
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Steinert, Rebecca
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gillblad, Daniel
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Translation of Probabilistic QoS in a Decentralized Hierarchical Setting2011Konferensbidrag (Refereegranskat)
  • 100.
    Bohlin, Markus
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Doganay, Kivanc
    RISE., Swedish ICT, SICS.
    Kreuger, Per
    RISE., Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Scheduling Gas Turbine Maintenance Based on Condition Data2009Ingår i: Proceedings of the 21st Innovative Applications of Artificial Intelligence Conference, 2009, 6Konferensbidrag (Refereegranskat)
1234567 51 - 100 av 349
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • 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.8