Change search
Refine search result
234567 201 - 250 of 348
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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)
  • Disputation date (earliest first)
  • Disputation date (latest 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)
  • Disputation date (earliest first)
  • Disputation date (latest 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.
  • 201.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Analys och prediktion av slitage på hjulprofiler och bromsbelägg på tåg2011Report (Other academic)
    Abstract [sv]

    Vi har som en del av det Vinnova-finansierade projektet DUST undersökt hur Bayesiansk statistisk modellering och avvikelsedetektion kan användas för att analysera slitage på hjulprofiler och bromsbelägg på tåg. Vi visar hur man med denna analys kan filtrera data, upptäcka onormalt slitage, och förutsäga när det är dags för underhåll. Resultaten visar att de föreslagna metoderna fungerar mycket bra för analys av den typ av tidsseriedata med trender som det handlar om här, och att det går att få ut ganska mycket trots att data är relativt få och brusiga.

    Download full text (pdf)
    FULLTEXT01
  • 202.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Data analysis of sensor network data2009Report (Other academic)
    Abstract [en]

    In this report we illustrate how a number of data analysis methods can be used to monitor data from a sensor network. Analysis is made in the forms of visualization, dependency analysis, and anomaly detection. The sensor network is monitored with respect to both the measurements made by the sensors and the operation of the network itself.

    Download full text (pdf)
    FULLTEXT01
    Download full text (ps)
    FULLTEXT02
  • 203.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Optimal test planning for High Cycle Fatigue limit testing2011In: Annals of Operations Research, p. 1-10Article in journal (Refereed)
  • 204.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    The DALLAS project. Report from the NUTEK-supported project AIS-8: Application of Data Analysis with Learning Systems, 1999-20012002Report (Other academic)
    Abstract [en]

    The DALLAS ("application of Data AnaLysis with LeArning Systems") project has been designed to bring together groups using learning systems (e.g. artificial neural networks, non-linear multi-variate statistics, inductive logic etc) at five universities and research institutes, with seven companies with data analysis tasks from various industrial sectors in Sweden. An objective of the project has been to spread knowledge and the use of learning systems methods for data analysis in industry. Further objectives have been to test the methods on real world problems in order to find strengths and weaknesses in the methods and to inspire research in the area.

    Download full text (pdf)
    FULLTEXT01
  • 205.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Incremental stream clustering for anomaly detection and classification.2011Conference paper (Refereed)
  • 206.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gillblad, Daniel
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Deviation detection of industrial processes2004In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, no 56, p. 13-14Article in journal (Other (popular science, discussion, etc.))
  • 207.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Larsen, Stefan
    Abnormality detection in event data and condition counters on Regina trains2006In: The IETInternational Conference on Railway Condition Monitoring 2006, 2006, 1, , p. 4p. 53-56Conference paper (Refereed)
    Abstract [en]

    The Regina trains, manufactured by Bombardier Transportation, contain software and hardware to generate as well condition data as event data that can be used to monitor the condition of the trains. In this paper we present the necessary equations for abnormality detection of both event data and condition counters in a general setting. The use of the equations is illustrated on authentic data from Regina trains.

  • 208.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Larsen, Stefan
    Abnormality detection in event data and condition counters on Regina trains.2006Conference paper (Refereed)
  • 209.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Larsen, Stefan
    Avvikelsedetektion i signaler från Regina2006Report (Other academic)
    Abstract [sv]

    I Reginatågen genereras signaler om såväl s.k. "events" (meddelanden om både rutinhändelser och mer eller mindre allvarliga fel i olika enheter) som "condition" (driftsräknare för olika enheter). Det är önskvärt att övervaka båda dessa typer av signaler för att upptäcka avvikelser som kraftigt förändrad frekvens eller driftsintensitet. Sådana avvikelser skulle kunna signalera olika servicebehov, och det skulle alltså vara till användning om servicepersonal fick reda på dem i god tid innan de lett till allvarligare fel. Vi kommer här att gå igenom en grundläggande och generellt användbar statistisk modell för detta scenario. Metoden utvärderas på autentiska data från Reginatågen.

    Download full text (pdf)
    FULLTEXT01
  • 210.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Butler: Fallanalys 1 - Outokumpu2004Report (Other academic)
    Abstract [sv]

    Denna rapport beskriver resultatet av en dataanalys gjord på produktionsdata från Outokumpu:s valsverk i Avesta. Syftet har varit att fastställa samband mellan övriga produktionsparametrar och uppkomsten av sk. "slivers" en typ av ytlig sprick- eller veck-bildning i det färdiga stålet. Ett annat syfte har varit att studera metodologiska frågor i ett arbete av detta slag.

    Download full text (pdf)
    FULLTEXT01
  • 211.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Funk, Per
    Tenth Scandinavian Conference on Artificial Intelligence, SCAI 20082008 (ed. 1)Book (Refereed)
  • 212.
    Holst, Anders
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Sahlgren, Magnus
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Dispersing the conceptual confusion2001Conference paper (Refereed)
    Abstract [en]

    In few subjects it is as easy to talk past each other as when discussing consciousness. Not only is the subject elusive and everyone has their own opinion of what it is all about; different people also make quite different use of words and language when discussing consciousness. This contribution tries to exemplify some common misunderstanding between people with different starting points and different use of language. The suggestion is that 'the problem of consciousness' is after all quite similar to all of us, although this is muddled by the way we talk about it, and the way we have locked ourselves into our different slogans and world views.

  • 213.
    Höök, Kristina
    et al.
    RISE, Swedish ICT, SICS.
    Rudström, Åsa
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Waern, Annika
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Edited Adaptive Hypermedia: Combining Human and Machine Intelligence to Achieve Filtered Information1997Conference paper (Refereed)
    Abstract [en]

    We discuss a novel approach to filtering of hypermedia information based on an information broker and user environment coupled together. The advantage of the proposed approach, edited adaptive hypermedia, is that it combines human expertise with machine intelligence in order to achieve high quality of the filtered information provided to the end users.

    Download full text (ps)
    fulltext
  • 214.
    John, Wolfgang
    et al.
    Ericsson Research, Sweden.
    Meirosu, Catalin
    Ericsson Research, Sweden.
    Pechenot, Bertrand
    RISE, Swedish ICT, Acreo.
    Sköldström, Pontus
    RISE, Swedish ICT, Acreo.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Steinert, Rebecca
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Scalable Software Defined Monitoring for Service Provider DevOps2015In: 2015 Fourth European Workshop on Software Defined Networks, 2015, 11, p. 61-66, article id 7313617Conference paper (Refereed)
    Abstract [en]

    Technology trends such as Cloud, SDN, and NFV are transforming the telecommunications business, promising higher service flexibility and faster deployment times. They also allow for increased programmability of the infrastructure layers. We propose to split selected monitoring control functionality onto node-local control planes, thereby taking advantage of processing capabilities on programmable nodes. Our software defined monitoring approach provides telecom operators with a way to handle the trade off between high-granular monitoring information versus network and computation loads at central control and management layers. To illustrate the concept, a link rate monitoring function is implemented using node-local control plane components. Furthermore, we introduce a messaging bus for simple and flexible communication between monitoring function components as well as control and management systems. We investigate scalability gains with a numerical analysis, demonstrating that our approach would generate thousand fold less monitoring traffic while providing similar information granularity as a naive SNMP implementation or an Open Flow approach.

  • 215.
    John, Wolfgang
    et al.
    Ericsson, Sweden.
    Pentikousis, Konstantinos
    EICT, Germany.
    Agapiou, George
    OTE Research, Italy.
    Jacob, Eduardo
    University of the Basque Country, Spain.
    Kind, Mario
    Deutsche Telekom AG, Germany.
    Manzalini, Antonio
    Telecom Italia, Italy.
    Risso, Fulvio
    Politecnico di Torino, Italy.
    Staessens, Dimitri
    IMinds, Belgium.
    Steinert, Rebecca
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Meirosu, Catalin
    Ericsson, Sweden.
    Research directions in network service chaining2013Conference paper (Refereed)
    Abstract [en]

    Network Service Chaining (NSC) is a service deployment concept that promises increased flexibility and cost efficiency for future carrier networks. NSC has received considerable attention in the standardization and research communities lately. However, NSC is largely undefined in the peer-reviewed literature. In fact, a literature review reveals that the role of NSC enabling technologies is up for discussion, and so are the key research challenges lying ahead. This paper addresses these topics by motivating our research interest towards advanced dynamic NSC and detailing the main aspects to be considered in the context of carrier-grade telecommunication networks. We present design considerations and system requirements alongside use cases that illustrate the advantages of adopting NSC. We detail prominent research challenges during the typical lifecycle of a network service chain in an operational telecommunications network, including service chain description, programming, deployment, and debugging, and summarize our security considerations. We conclude this paper with an outlook on future work in this area.

  • 216. Jonsson, Andreas
    et al.
    Folke, Mats
    Ahlgren, Bengt
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    The split naming/forwarding network architecture2003Conference paper (Refereed)
  • 217.
    Kanerva, Pentti
    et al.
    RISE, Swedish ICT, SICS.
    Kristoferson, Jan
    RISE, Swedish ICT, SICS.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Random indexing of text samples for latent semantic analysis2000In: Proceedings of the 22nd Annual Conference of the Cognitive Science Society, 2000, 1Conference paper (Refereed)
  • 218.
    Kanerva, Pentti
    et al.
    RISE, Swedish ICT, SICS.
    Sjödin, Gunnar
    RISE, Swedish ICT, SICS.
    Kristoferson, Jan
    RISE, Swedish ICT, SICS.
    Karlsson, R.
    Levin, Björn
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Karlgren, Jussi
    RISE, Swedish ICT, SICS.
    Sahlgren, Magnus
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Computing with large random patterns2001In: Foundations of Real-World Intelligence, Stanford, California: CSLI Publications , 2001, 1, p. 251-311Chapter in book (Refereed)
    Abstract [en]

    We describe a style of computing that differs from traditional numeric and symbolic computing and is suited for modeling neural networks. We focus on one aspect of ``neurocomputing,'' namely, computing with large random patterns, or high-dimensional random vectors, and ask what kind of computing they perform and whether they can help us understand how the brain processes information and how the mind works. Rapidly developing hardware technology will soon be able to produce the massive circuits that this style of computing requires. This chapter develops a theory on which the computing could be based.

  • 219.
    Karlgren, Jussi
    et al.
    RISE, Swedish ICT, SICS.
    Holst, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Sahlgren, Magnus
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Filaments of Meaning in Word Space2008Conference paper (Refereed)
    Abstract [en]

    Word space models, in the sense of vector space models built on distributional data taken from texts, are used to model semantic relations between words. We argue that the high dimensionality of typical vector space models lead to unintuitive effects on modeling likeness of meaning and that the local structure of word spaces is where interesting semantic relations reside. We show that the local structure of word spaces has substantially different dimensionality and character than the global space and that this structure shows potential to be exploited for further semantic analysis using methods for local analysis of vector space structure rather than globally scoped methods typically in use today such as singular value decomposition or principal component analysis.

    Download full text (pdf)
    fulltext
  • 220.
    Karlgren, Jussi
    et al.
    RISE, Swedish ICT, SICS.
    Kauber, Markus
    Boujemaa, Nozha
    Compañó, Ramón
    Dosch, Christoph
    Geurts, Joost
    Gouraud, Henri
    King, Paul
    Köhler, Joachim
    van der Linden, Pieter
    Ortgies, Robert
    Rudström, Åsa
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Sebe, Nicu
    CHORUS Deliverable 3.4: Vision Document2009Other (Other academic)
    Abstract [en]

    The goal of the CHORUS Vision Document is to create a high level vision on audio-visual search engines in order to give guidance to the future R&D work in this area and to highlight trends and challenges in this domain. The vision of CHORUS is strongly connected to the CHORUS Roadmap Document (D2.3). A concise document integrating the outcomes of the two deliverables will be prepared for the end of the project (NEM Summit).

    Download full text (pdf)
    FULLTEXT01
  • 221.
    Karlgren, Jussi
    et al.
    RISE, Swedish ICT, SICS.
    Rudström, Åsa
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Dosch, Christoph
    Ortgies, Robert
    CHORUS Deliverable 4.3: Report from CHORUS workshops on national initiatives and metadata2007Other (Other academic)
    Abstract [en]

    Minutes of the following Workshops: • National Initiatives on Multimedia Content Description and Retrieval, Geneva, October 10th, 2007. • Metadata in Audio-Visual/Multimedia production and archiving, Munich, IRT, 21st – 22nd November 2007 Workshop in Geneva 10/10/2007 This highly successful workshop was organised in cooperation with the European Commission. The event brought together the technical, administrative and financial representatives of the various national initiatives, which have been established recently in some European countries to support research and technical development in the area of audio-visual content processing, indexing and searching for the next generation Internet using semantic technologies, and which may lead to an internet-based knowledge infrastructure. The objective of this workshop was to provide a platform for mutual information and exchange between these initiatives, the European Commission and the participants. Top speakers were present from each of the national initiatives. There was time for discussions with the audience and amongst the European National Initiatives. The challenges, communalities, difficulties, targeted/expected impact, success criteria, etc. were tackled. This workshop addressed how these national initiatives could work together and benefit from each other. Workshop in Munich 11/21-22/2007 Numerous EU and national research projects are working on the automatic or semi-automatic generation of descriptive and functional metadata derived from analysing audio-visual content. The owners of AV archives and production facilities are eagerly awaiting such methods which would help them to better exploit their assets.Hand in hand with the digitization of analogue archives and the archiving of digital AV material, metadatashould be generated on an as high semantic level as possible, preferably fully automatically. All users of metadata rely on a certain metadata model. All AV/multimedia search engines, developed or under current development, would have to respect some compatibility or compliance with the metadata models in use. The purpose of this workshop is to draw attention to the specific problem of metadata models in the context of (semi)-automatic multimedia search.

    Download full text (pdf)
    FULLTEXT01
  • 222.
    Kim, Juhoon
    et al.
    Deutsche Telekom AG, Germany.
    Meirosu, Catalin
    Ericsson AB, Sweden.
    Papafili, Ioanna
    OTE, Greece.
    Steinert, Rebecca
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Sharma, Sachin
    Ghent University, Belgium.
    Westphal, Joachim F.
    Deutsche Telekom AG, Germany.
    Kind, Mario
    Deutsche Telekom AG, Germany.
    Shukla, Apoorv
    Technical University of Berlin, Germany.
    Nemeth, Felician
    Budapest University of Technology and Economics, Hungary.
    Manzalini, Antonio
    Telcom Italia, Italy.
    Service Provider DevOps for Large Scale Modern Network Services2015In: 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM), 2015, 14, p. 1391-1397, article id 7140502Conference paper (Refereed)
    Abstract [en]

    Network service providers are facing challenges for deploying new services mainly due to the growing complexity of software architecture and development process. Moreover, the recent architectural innovation of network systems such as Network Function Virtualization (NFV), Software-defined Net- working (SDN), and Cloud computing increases the development and operation complexity yet again. One of the emerging solutions to this problem is a novel software development concept, namely DevOps, that is widely employed by major Internet software companies. Although the goals of DevOps in data centers are well-suited for the demands of agile service creation, additional requirements specific to the virtualized and software-defined network environment are important to be addressed from the perspective of modern network carriers.

  • 223. Kocjan, Waldemar
    et al.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Filtering methods for symmetric cardinality constraint2004In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Springer , 2004, 5, , p. 9p. 200-208Conference paper (Refereed)
    Abstract [en]

    The symmetric cardinality constraint is described in terms of a set of variables X={x1,...,xk}, which take their values as subsets of values V={v1,...,vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [lxi,cxi] and at the same time it restricts the number of occurrences of each value vj in V in the sets assigned to variables in X to be in an other interval [lvj,cvj]. In this paper we introduce the symmetric cardinality constraint and define set constraint satisfaction problem as a framework for dealing with this type of constraints. Moreover, we present effective filtering methods for the symmetric cardinality constraint.

  • 224.
    Kocjan, Waldemar
    et al.
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Filtering methods for symmetric cardinality constraint2003Report (Other academic)
    Abstract [en]

    The symmetric cardinality constraint is described in terms of variables X = {x_1,...,x_k} which take values in the subset of values V={v_1,...,v_n}. It constraints the number of times a value can be assigned to a variable in X to be in an interval [l_{x_i},c_{x_i}] and at the same time it restricts the number of values in V which any variable can take to an interval [l_{v_j},c_{v_j}]. In this paper we introduce the symmetric cardinality constraint and define set constraint satisfaction problem as a framework for dealing with this type of constraints. Moreover, we present effective filtering methods for the symmetric cardinality constraint.

    Download full text (pdf)
    FULLTEXT01
  • 225.
    Kostopoulos, Alexandros
    et al.
    Hellenic Telecommunications Organization S.A., Greece.
    Chochliouros, Ioannos
    Hellenic Telecommunications Organization S.A., Greece.
    Kuo, Fang-Chun
    Travelping, Germany.
    Riggio, Roberto
    FBK Create-Net, Italy.
    Goratti, Leonardo
    FBK Create-Net, Italy.
    Nikaein, Navid
    Institut Eurecom, France.
    Giannoulakis, Ioannis
    National Centre for Scientific Research “Demokritos”, Greece.
    Perez-Romero, Jordi
    Universitat Politècnica de Catalunya, Spain.
    Chen, Tao
    VTT Technical Research Centre of Finland, Finland.
    Steinert, Rebecca
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Panaitopol, Dorin
    Thales, France.
    Design aspects for 5G architectures: The SESAME and COHERENT approach2017In: 2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017, 2017, p. 986-992Conference paper (Refereed)
    Abstract [en]

    The exponential growth of mobile data traffic still remains an important challenge for the mobile network operators. In response, the 5G scene needs to couple fast connectivity and optimized spectrum usage with cloud networking and high processing power, optimally combined in a converged environment. In this paper, we investigate two 5G research projects; SESAME [1] and COHERENT [2]. We consider the proposed 5G architectures and the corresponding key network components, in order to highlight the common aspects towards the 5G architecture design.

  • 226.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A higher order logic parser for natural language implemented in Lambda Prolog1988Report (Other academic)
    Abstract [en]

    This paper describes an implementation of some of the ideas presented by F.C.N. Pereira in [1]. Pereira uses a sequent-calculus like system to produce Montague semantics from natural language. The lefthand sequent can be interpreted as a set of constraints under which a given sentence fragment has a certain interpretation. Pereira presents a few complementary "discharge-rules" to reduce the number of such constraints. These conditional interpretations constitute a uniform way to represent partial knowledge during the parsing process. The implementation this paper describes is done in Lambda Prolog [2]. Lambda Prolog is a generalization of horn-clause logic to higher order logic, based on the higher order unification procedure of Huet [3]. It appears that the implementation of Pereira's system in Lambda Prolog becomes very natural. The higher order unification mechanism of Lambda takes care of the complicated binding mechanisms in Pereira's "discharge-rules" in a very simple and elegant way. Finally, the paper discusses some problems with the implementation and gives a few suggestions on how these could be overcome.

    Download full text (pdf)
    FULLTEXT01
  • 227.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A version of Huet's algorithm for higher-order unification1989Report (Other academic)
    Abstract [en]

    This paper describes a procedure for unification in extensional higher order logics. The procedure is due to Gerard Huet and was described in /Hu75/. In this paper we consider unification in extensional theories' which is a significantly simpler problem and is not described in detail in Huet's paper. In addition, the description here focuses on computation of substitutions rather than deciding inifiability, as in Huet's paper. To this some explanatory and clarifying material has been added.

  • 228.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    An approach to handling polymorphic types in higher order unification1988Report (Other academic)
    Abstract [en]

    The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple theory of types [Ch 40]. In this language types are expressed in a very weak language (no quantification, "->" being the only operator). In many applications a stronger type-system is desirable. Lambda Prolog [MN 86], e.g. uses a type system that is in some ways similar to that of ML. This type-system uses implicitly universally quantified variables in the type-expressions. It is not trivial to reformulate the higher order unification procedure for such a theory. This paper describes an implementation of the procedure that tries to overcome some of the problems encountered in such an endeavor. The basic approach taken is to let the types be an integral part of the representation of the terms to be unified. This makes it simpler to instanciate type-variables during the unification process, and to delay the unification of terms with completely unspecified types until such time as more information is gained.

    Download full text (pdf)
    FULLTEXT01
  • 229.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Applications of Partial Inductive Definitions. Conclusions from some projects run at SICS KBS-lab 1986-19921992Report (Other academic)
    Abstract [en]

    This paper describes the history of and some conclusions from a series of projects run at SICS KBS-lab during the period from 1986 to 1992. The projects have in common that they all are applications of the theory of partial inductive definitions.

    Download full text (ps)
    FULLTEXT01
    Download full text (pdf)
    FULLTEXT02
  • 230.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    A-sufficient substitutions in mixed contexts1994In: Proceedings of the Workshop Proof-Theoretic Extensions of Logic Programming at the International Conference on Logic Programming, Springer LNAI Extensions of Logic Programming at the International Conference on Logic Programming, 1994, 1, Vol. 596, p. 6p. 38-43Conference paper (Refereed)
    Abstract [en]

    In proof-systems based on calculi of Partial Inductive Definitions (PID), the notion of an A-sufficient substitution is of central importance. Applying an A-sufficient substitution to an atom before computing its definiens is necessary for the rule of definitional reflection to be sound. So far computation of A-sufficient substitutions have been restricted to the case where all variables in a query (sequent to be proved) are existentially quantified, i.e. logical variables in the sense of Prolog. From a proof theoretic point of view this kind of variable can be regarded as metavariables i.e. place-holders for as yet unknown terms. In a finitary calculus of PID's these eigenvariables have to be bound by the rule of definitional reflection in order to preserve soundness (with respect to an underlying infinitary system of PID's). This property makes these calculi different from most (if not all) calculi based on more traditional logics. This note explores some computational issues in connectin with such caluculi.

    Download full text (ps)
    fulltext
  • 231.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Axioms in Definitional Calculi1993In: Extensions of Logic Programming ELP'93: Proceedings Proceedings of the fourth international workshop on extensions of logic programming, Springer LNAI of the fourth international workshop on extensions of logic programming, Springer Verlag , 1993, 1, Vol. 798, p. 196-205Conference paper (Refereed)
    Abstract [en]

    This paper introduces a restricted form of the axiom rule in calculi of Partial Inductive Definitions (PID). The paper argues that in calculi of PIDs the distinction between atomic and non-atomic formulae is not asclear as in traditional sequent calculi. Therefore the common restriction of the axiom rule to the atomic case is not adequate for this type of calculi.A novel proviso for the axiom rule and corresponding provisos for the left and right definition rules are introduced with an accompanying discussion and suggestions for possible applications in the domain of declarative specification of operational behaviour of logic programs.

    Download full text (ps)
    fulltext
  • 232.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Clustering and scheduling maintenance tasks over time2008Report (Other academic)
    Abstract [en]

    We report results on a maintenance scheduling problem. The problem consists of allocating maintenance task instances to and scheduling the performances of a suitable number of maintenance packages. The number of maintenance packages is not fixed, nor is, in general, the dates or durations of their performances. A constraint programming (CP) model and solver for the problem is presented together with preliminary computational results.

    Download full text (pdf)
    FULLTEXT01
  • 233.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Computational Issues in Calculi of Partial Inductive Definitions1995Doctoral thesis, monograph (Other academic)
    Abstract [en]

    We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. Formal systems based on this notion can be used to generalize Horn-logic and naturally allow and suggest extensions which differ in interesting ways from generalizations based on first order predicate calculus. E.g. the notion of completion generated by a calculus of PID and the resulting notion of negation is completely natural and does not require externally motivated procedures such as "negation as failure". For this reason, computational issues arising in these calculi deserve closer inspection. This work discuss a number of finitary theories of PID and analyzethe algorithmic and semantical issues that arise in each of them. There has been significant work on implementing logic programming languages in this setting and we briefly present the programming language and knowledge modelling tool GCLA II in which many of the computational prob-lems discussed arise naturally in practice.

    Download full text (ps)
    FULLTEXT01
  • 234.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    EWAM: An extension of WAM to execute functional programs1989Report (Other academic)
    Abstract [en]

    This paper describes a procedure for unification in extensional higher order logics. The procedure is due to Gerard Huet and was described in <Hu75>. In this paper we consider unification in extensional theories, which is a significantly simpler problem and is not described in detail in Huet's paper. In addition, the description here focuses on computation of substitutions rather than deciding unifiability, as in Huet's paper. To this some explanatory and clarifying material has been added.

    Download full text (pdf)
    FULLTEXT01
  • 235.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    GCLA II. A definitional approach to control1992Report (Other academic)
    Abstract [en]

    This paper describes the logic programming language GCLA II, its operational semantics and parts of its theortical foundations. GCLA II is a generalization of the language GCLA (Generalized Horn Clause Language) argumented by a method to guide and constrain proof search. The method is based on specification of strategies in a meta language that is a sub language of GCLA itself. A GCLA II program is partioned into two distinct parts. One is used to express the declarative content of the program, while the other is used to define the possible inference made from this declarative knowledge. Altough the intended use of the declarative part and the procedural parts are quite different, they can both be described in the formalism of partial inductive definitions. Thus we preserve a declarative reading of the program as a whole. In particular, given certain sythactic constraints on the program, the heuristics associated with proof search does not affect the declarative reading of the declarative part of the program at all. Several experiments intepreters and a compiler from GCLA II to Prolog have been implemented.

    Download full text (pdf)
    fulltext
    Download full text (pdf)
    fulltext
  • 236.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Industrial diagnosis, planning and simulation: introduction and key note to special theme2004In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, no 56, p. 10-11Article in journal (Refereed)
  • 237.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Två system för default-resonemang, en studie av Kurt Konoliges artikel: On the relation between default and autoepistemic logic1989Report (Other academic)
    Abstract [sv]

    Denna artikel presenterar, sammanfattar och granskar kritiskt en teori som läggs fram av Kurt Konolige i hans artikel "On the Relation between Default and Autoepistemic Logic." Detta material presenterades ursprungligen som examination på doktorandkursen "Logik for AI" som gavs under 1988 av Rune Gustavsson på SICS. Konoliges artikel tar upp förhållandet mellan två typer av logiker som använts för att föra default-resonemang, en typ av resonemang under ofullständig kunskap. De två system han tar upp är dels Reiters Default-logik, dels Moores Autoepistemiska logik. Det huvudsakliga resultatet i Konoliges artikel är att dessa tvä system kan visas vara ekvivalenta i en viss mening.

    Download full text (pdf)
    FULLTEXT01
  • 238.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Abrahamsson, Henrik
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Scheduling IPTV content pre-distribution2009Conference paper (Refereed)
  • 239.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Aronsson, Martin
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Bohlin, Markus
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Leveranstågplan: specifikation och åtagande2006Report (Other academic)
    Abstract [sv]

    Denna rapport beskriver och motiverar leveranstågplanens roll och utformning i relation till den dynamiska tågplanen. Med utgångspunkt i formen för de krav som specificerats i den framtida tåglägesansökan föreslår vi en form för leveranstågplanen vars syfte är att både kunders och trafikutövares krav på förutsägbarhet och samtidigt ger utrymme för effektiv operativ styrning och kortare ledtider vid förändrad efterfrågan. I sin första version är detta dokument främst tänkt som ideskiss för diskussion och kritisk analys bland kapacitetsfördelningsprocessen intressenter.

    Download full text (pdf)
    FULLTEXT01
  • 240.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Aronsson, Martin
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Franzén, Thomas
    Rail Traffic Requirements Engineering2005Conference paper (Refereed)
    Abstract [en]

    The deregulation of the Swedish rail transport market and introduction of several operators competing for train paths has fundamentally affected the demands on the capacity allocation process. As a consequence this process is facing radical change in the near future. The demands and their consequences for the future are analysed in this paper. The analysis proceeds from a set of identified requirements typically posed by rail transport customers and service operators. A simple mathematical framework in which these requirements can be formalised is defined and methods for conflict detection and resolution are discussed

    Download full text (pdf)
    fulltext
  • 241.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Aronsson, Martin
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ekman, Jan
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Franzén, Thomas
    Rail Traffic Requirements Engineering2005Report (Other academic)
    Abstract [en]

    The deregulation of the Swedish rail transport market and introduction of several operators competing for train paths has fundamentally affected the demands on the capacity allocation process. As a consequence this process is facing radical change in the near future. The demands and their consequences for the future are analysed in this paper. The analysis proceeds from a set of identified requirements typically posed by rail transport customers and service operators. A simple mathematical framework in which these requirements can be formalised is defined and methods for conflict detection and resolution are discussed.

    Download full text (pdf)
    FULLTEXT01
  • 242.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Olsson, Jan
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Sjöland, Thomas
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Åström, Emil
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    The TUFF train scheduler1997In: ILPS'97 Workshop on Tools and Environments for (Constraint) Logic Programmins / [ed] G. Puebla, 1997, 1Conference paper (Refereed)
    Download full text (pdf)
    fulltext
    Download full text (ps)
    fulltext
  • 243.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Olsson, Jan
    Sjöland, Thomas
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Åström, Emil
    The TUFF train scheduler: two duration trip scheduling on single track networks1997In: CP'97 Workshop on Industrial Constraint-Driven Scheduling / [ed] A. Davenport, 1997, 1, , p. 12Conference paper (Refereed)
    Download full text (pdf)
    fulltext
    Download full text (ps)
    fulltext
  • 244.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Sjöland, Thomas
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Åström, Emil
    RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
    Sequence dependent task extensions for trip scheduling2001Report (Other academic)
    Abstract [en]

    A constraint model for scheduling train trips on a network of tracks used in both directions, using a headway abstraction is described. We argue that a generalisation of a straightforward job-shop scheduling formulation using sequence dependent task extensions can decrease the required resolution of network representation and hence problem size. A geometric interpretation of the model of the constraints that can be used to visualise schedules is presented. Preliminary ideas on search heuristics are presented with performance results and a set of examples.

    Download full text (pdf)
    FULLTEXT01
  • 245.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gillblad, Daniel
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Arvidsson, Åke
    Ericsson, Sweden.
    zCap: a zero configuration adaptive paging and mobility management mechanism2013In: International Journal of Network Management, ISSN 1055-7148, E-ISSN 1099-1190, Vol. 23, no 4, p. 235-258Article in journal (Refereed)
    Abstract [en]

    Today, cellular networks rely on fixed collections of cells (tracking areas) for user equipment localisation. Locating users within these areas involves broadcast search (paging), which consumes radio bandwidth but reduces the user equipment signalling required for mobility management. Tracking areas are today manually configured, hard to adapt to local mobility and influence the load on several key resources in the network. We propose a decentralised and self-adaptive approach to mobility management based on a probabilistic model of local mobility. By estimating the parameters of this model from observations of user mobility collected online, we obtain a dynamic model from which we construct local neighbourhoods of cells where we are most likely to locate user equipment. We propose to replace the static tracking areas of current systems with neighbourhoods local to each cell. The model is also used to derive a multi-phase paging scheme, where the division of neighbourhood cells into consecutive phases balances response times and paging cost. The complete mechanism requires no manual tracking area configuration and performs localisation efficiently in terms of signalling and response times. Detailed simulations show that significant potential gains in localisation effi- ciency are possible while eliminating manual configuration of mobility management parameters. Variants of the proposal can be implemented within current (LTE) standards.

    Download full text (pdf)
    FULLTEXT01
  • 246.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gillblad, Daniel
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Arvidsson, Åke
    Ericsson, Sweden.
    Zero configuration adaptive paging (zCap)2012In: IEEE Vehicular Technology Conference, IEEE , 2012, 14, article id 6399016Conference paper (Refereed)
    Abstract [en]

    Today, cellular networks rely on fixed collections of cells (tracking areas) for handset localisation. This management parameter is manually configured and maintained and is not regularly adapted to changes in use patterns. We present a decentralised approach to localisation, based on a self-adaptive probabilistic mobility model. Estimates of model parameters are built from observations of mobility patterns collected on- line using a distributed algorithm. Based on these estimates, dynamic local neighbourhoods of cells are formed and maintained by the mobility management entities of the network. These neighbourhoods replace the static tracking areas used in current implementations by using the tracking area list facility of LTE. The model is also used to derive a multi phase paging scheme, where the division of cells into consecutive phases is optimal with respect to a set balance between response times and paging cost. The approach requires no manual tracking area configuration, and performs localisation efficiently in terms of number of location updates, page messages per localisation request and response times.

    Download full text (pdf)
    FULLTEXT01
  • 247.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gillblad, Daniel
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Görnerup, Olof
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Corcoran, Diarmuid
    Lundborg, Tomas
    Ermedahl, Andreas
    Methods, Nodes and system for enabling redistribution of cell load2015Patent (Other (popular science, discussion, etc.))
    Abstract [en]

    Patent for distributed load balancing mechanism for LTE, developed by SICS in collaboration with Ericsson DURA

    Download full text (pdf)
    FULLTEXT01
  • 248.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Görnerup, Olof
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Gillblad, Daniel
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lundborg, Tomas
    Ericsson AB, Sweden.
    Corcoran, Diarmuid
    Ericsson AB, Sweden.
    Ermedahl, Andreas
    Ericsson AB, Sweden.
    Autonomous load balancing of heterogeneous networks2015In: 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), 2015, 11, article id 7145712Conference paper (Refereed)
    Abstract [en]

    This paper presents a method for load balancing heterogeneous networks by dynamically assigning values to the LTE cell range expansion (CRE) parameter. The method records hand-over events online and adapts flexibly to changes in terminal traffic and mobility by maintaining statistical estimators that are used to support autonomous assignment decisions. The proposed approach has low overhead and is highly scalable due to a modularised and completely distributed design that exploits self- organisation based on local inter-cell interactions. An advanced simulator that incorporates terminal traffic patterns and mobility models with a radio access network simulator has been developed to validate and evaluate the method.

    Download full text (pdf)
    FULLTEXT01
  • 249.
    Kreuger, Per
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Steinert, Rebecca
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Scalable in-network rate monitoring2015In: 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM), 2015, 6, p. 866-869, article id 7140396Conference paper (Refereed)
    Abstract [en]

    We propose a highly scalable statistical method for modelling the monitored traffic rate in a network node and suggest a simple method for detecting increased risk of congestion at different monitoring time scales. The approach is based on parameter estimation of a lognormal distribution using the method of moments. The proposed method is computation- ally efficient and requires only two counters for updating the parameter estimates between consecutive inspections. Evaluation using a naive congestion detector with a success rate of over 98% indicates that our model can be used to detect episodes of high congestion risk at 0.3 s using estimates captured at 5 m intervals.

    Download full text (pdf)
    FULLTEXT01
  • 250.
    Laaksolahti, Jarmo
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Boman, Magnus
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Anticipatory Guidance of Plot2003In: Anticipatory Behavior in Adaptive Learning Systems, Berlin, Heidelberg, New York: Springer Verlag , 2003, 1Chapter in book (Refereed)
234567 201 - 250 of 348
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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