Change search
Refine search result
2345678 201 - 250 of 601
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • 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.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Towards self-managing systems2004In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, no 58Article in journal (Other (popular science, discussion, etc.))
  • 202.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Gielda, Mikael
    Gielda, Peter
    Demo Abstract: EmuLink - Heterogeneous Sensor Network Simulation in Cooja2013Conference paper (Refereed)
  • 203.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The trading agent competition: TAC 20022002In: ERCIM News, ISSN 0926-4981, E-ISSN 1564-0094, no 51Article in journal (Other (popular science, discussion, etc.))
    Abstract [en]

    The finals of the third annual Trading Agent Competition were held on 28 July 2002, co-located with AAA1-02 in Edmonton, Canada. The actual games took place on the Internet, with the game and auction servers running at SICS in Kista, Sweden. The agents resided at the home locations of the participating research groups.

  • 204.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Österlind, Fredrik
    RISE, Swedish ICT, SICS.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Accurate power profiling for sensor network simulators2008Conference paper (Refereed)
  • 205.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Österlind, Fredrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE - Research Institutes of Sweden, ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Accurate, network-scale power profiling for sensor network simulators2009Conference paper (Refereed)
  • 206.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Österlind, Fredrik
    RISE, Swedish ICT, SICS.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Sauter, Robert
    Marrón, Pedro José
    COOJA/MSPSim: Interoperability Testing for Wireless Sensor Networks2009Conference paper (Refereed)
  • 207.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Österlind, Fredrik
    RISE, Swedish ICT, SICS.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Sauter, Robert
    Marrón, Pedro José
    Demo Abstract: Towards Interoperability Testing for Wireless Sensor Networks with COOJA/MSPSim2009Conference paper (Refereed)
  • 208.
    Eriksson, Joakim
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Österlind, Fredrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Finne, Niclas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Raza, Shahid
    RISE, Swedish ICT, SICS, Security Lab.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE - Research Institutes of Sweden, ICT, SICS.
    Demo abstract: accurate power profiling of sensornets with the COOJA/MSPSim simulator2009Conference paper (Refereed)
    Abstract [en]

    Power consumption is of utmost concern in sensor networks. Researchers have several ways of measuring the power consumption of a complete sensor network, but they are typically either impractical or inaccurate. To meet the need for practical and scalable measurement of power consumption of sensor networks, we have developed a cycle-accurate simulator, called COOJA/MSPsim, that enables live power estimation of systems running on MSP430 processors. This demonstration shows the ease of use and the power measurement accuracy of COOJA/MSPsim. The demo setup consists of a small sensor network and a laptop. Beside gathering software-based power measurements from the motes, the laptop runs COOJA/MSPsim to simulate the same network. We visualize the power consumption of both the simulated and the real sensor network, and show that the simulator produces matching results.

  • 209.
    Eskilson, Jesper
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    SICStus MT: a multithreaded execution environment for SICStus Prolog1998In: Programming Languages: Implementations, Logics, and Programs / [ed] Palamidessi, Catuscia, Glaser, Hugh and Meinke, Karl, Springer-Verlag , 1998, 1, p. 36-53Conference paper (Refereed)
  • 210.
    Fagerberg, Petra
    et al.
    RISE, Swedish ICT, SICS.
    Ståhl, Anna
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Höök, Kristina
    RISE - Research Institutes of Sweden, ICT, SICS.
    Designing gestures for affective input: an analysis of shape, effort and valence2003Conference paper (Refereed)
    Abstract [en]

    We discuss a user-centered approach to incorporating affective expressions in interactive applications, and argue for a design that addresses both body and mind. In particular, we have studied the problem of finding a set of affective gestures. Based on previous work in movement analysis and emotion theory [Davies, Laban and Lawrence, Russell], and a study of an actor expressing emotional states in body movements, we have identified three underlying dimensions of movements and emotions: shape, effort and valence. From these dimensions we have created a new affective interaction model, which we name the affective gestural plane model. We applied this model to the design of gestural affective input to a mobile service for affective messages.

  • 211. Fagerberg, Petra
    et al.
    Ståhl, Anna
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Höök, Kristina
    RISE, Swedish ICT, SICS.
    eMoto - Emotionally Engaging Interaction2004In: Personal and Ubiquitous Computing, ISSN 1617-4909, E-ISSN 1617-4917Article in journal (Refereed)
  • 212.
    Faxén, Karl-Filip
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Effect inference for deterministic parallelism2008Report (Other academic)
    Abstract [en]

    In this report we sketch a polymorphic type and effect inference system for ensuring deterministic execution of parallel programs containing shared mutable state. It differs from that of Gifford and Lucassen in being based on Hindley Milner polymorphism and in formalizing the operational semantics of parallel and sequential computation.

  • 213.
    Faxén, Karl-Filip
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Modular cloning2008Report (Other academic)
    Abstract [en]

    In this paper we deal with the problem of making context dependent interprocedural optimizations (where the legality of optimizing a function depends on properties of the callers of the function) effective and compatible with (a form of) separate compilation. We improve effectiveness by cloning, generating several versions of a single function optimized for different call sites. We attack the separate compilation problem, that code can not be generated until all calls of a function are known, by splitting the compilation process into two phases. The first phase analyses the modules one at a time in bottom-up dependency order ('main' is processed last) and produces code in an intermediate language where the constructs targeted by the optimization are annotated to control the application of the optimization. In cases where the legality of an optimization depends on properties of the callers of the function, these annotations can take the form of annotation variables which become extra formal parameters. The second phase traverses the modules in top-down dependency order, removing all of these extra parameters by specialization. We illustrate our approach with an integrated programming analysis and transformation system featuring a context sensitive type based analysis, cloning with sharing of identical clones and a modular implementation allowing for the compilation of large programs. The system implements cheap eagerness and redundant eval elimination for a lazy functional language.

  • 214.
    Faxén, Karl-Filip
    et al.
    RISE, Swedish ICT, SICS.
    Popov, Konstantin
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Albertsson, Lars
    RISE, Swedish ICT, SICS.
    Embla - Data Dependence Profiling for Parallel Programming2008In: Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems, 2008, 10, p. 780-785Conference paper (Refereed)
    Abstract [en]

    With the proliferation of multicore processors, there is an urgent need for tools and methodologies supporting parallelization of existing applications. In this paper, we present a novel tool for aiding programmers in parallelizing programs. The tool, Embla, is based on the Valgrind framework, and allows the user to discover the data dependences in a sequential program, thereby exposing opportunities for parallelization. Embla performs an off-line dynamic analysis, and records dependences as they arise during program execution. It reports an optimistic view of parallelizable sequences, and ignores dependences that do not arise during execution. Moreover, since the tool instruments the machine code of the program, it is largely language independent. Since Embla finds the dependencies that occur for particular executions, the confidence one would assign to its results depend on whether different executions yield different (bad) or largely the same (good) dependencies. We present a preliminary investigation into this issue using 84 different inputs to the SPEC CPU 2006 benchmark 403.gcc. The results indicate that there is a strong correlation between coverage and finding dependencies; executing the entire program is likely to reveal all dependencies.

  • 215.
    Feeney, Laura Marie
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Nilsson, Martin
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Investigating the energy consumption of a wireless network interface in an ad hoc networking environment2001Conference paper (Refereed)
    Abstract [en]

    Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behaviour of actual wireless interfaces. But little practical information is available about the energy consumption behaviour of well-known wireless network interfaces and device specifications do not provide information in a form that is helpful to protocol developers. This paper describes a series of experiments which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment. The data is presented as a collection of linear equations for calculating the energy consumed in sending, receiving and discarding broadcast and point-to-point data packets of various sizes. Some implications for protocol design and evaluation in ad hoc networks are discussed.

  • 216.
    Fernaeus, Ylva
    et al.
    RISE, Swedish ICT, SICS.
    Håkansson, Maria
    RISE, Swedish ICT, SICS.
    Jacobsson, Mattias
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ljungblad, Sara
    RISE, Swedish ICT, SICS.
    How do you Play with a Robotic Toy Animal? A long-term study of Pleo2010Conference paper (Refereed)
    Abstract [en]

    Pleo is one of the more advanced interactive toys currently available for the home market, taking the form of a robotic dinosaur. We present an exploratory study of how it was interacted with and reflected upon in the homes of six families during 2 to 10 months. Our analysis emphasizes a discrepancy between the participants’ initial desires to borrow a Pleo and what they reported later on about their actual experiences. Further, the data suggests an apparent tension between participants expecting the robot to work as a ‘toy’ while making consistent comparisons with real pet animals. We end by discussing a series of implications for design of this category of toys, in order to better maintain interest and engagement over time.

  • 217.
    Fernaeus, Ylva
    et al.
    RISE, Swedish ICT, SICS.
    Isbister, Katherine
    Höök, Kristina
    RISE, Swedish ICT, SICS.
    Laaksolahti, Jarmo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Sundström, Petra
    RISE, Swedish ICT, SICS.
    Understanding users and their situation2011In: Emotion-Oriented Systems: The Humaine Handbook, Springer , 2011, 10, p. 653-666Chapter in book (Refereed)
    Abstract [en]

    The first step in any design process is to set the stage for what to design and how that should be realised. In terms of user-centred design, this includes to develop a sense of who will be using the system, where it is intended to be used, and what it should be used for. In this chapter we provide an overview of this part of the development process, and its place in the design cycle, and some orienting design challenges that are specific to affective interaction. Thereafter we present a variety of methods that designers may want to consider in actual design work. We end by providing a set of examples from previous and ongoing research in the field, which could also work as inspirations or guiding sources in the early stages in a user-centred design process.

  • 218.
    Fernaeus, Ylva
    et al.
    RISE, Swedish ICT, SICS.
    Jacobsson, Mattias
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Comics, robots, fashion and programming: outlining the concept of actDresses2009Conference paper (Refereed)
    Abstract [en]

    This paper concerns the design of physical languages for controlling and programming robotic consumer products. For this purpose we explore basic theories of semiotics represented in the two separate fields of comics and fashion, and how these could be used as resources in the development of new physical languages. Based on these theories, the design concept of actDresses is defined, and supplemented by three example scenarios of how the concept can be used for controlling, programming, and predicting the behaviour of robotic systems.

  • 219.
    Fernaeus, Ylva
    et al.
    RISE, Swedish ICT, SICS.
    Jacobsson, Mattias
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ljungblad, Sara
    RISE, Swedish ICT, SICS.
    Holmquist, Lars Erik
    RISE, Swedish ICT, SICS.
    Are we living in a robot cargo cult?2009Conference paper (Refereed)
    Abstract [en]

    We use the Cargo Cult metaphor to discuss visions, methods and communication of robot research. Essentially cargo cult involves performing of imitative rituals that are conducted without understanding the underlying cause of a phenomenon. We discuss how this is an ongoing challenge within the field of HRI, and what researchers could do to avoid contributing to a robotic cargo cult.

  • 220. Ferrari, Federico
    et al.
    Zimmerling, Marco
    Thiele, Lothar
    Mottola, Luca
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The Bus Goes Wireless: Routing-Free Data Collection with QoS Guarantees in Sensor Networks2012Conference paper (Refereed)
  • 221.
    Finne, Niclas
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Experiences from two sensor network deployments - self-configuration a key to success2007Report (Other academic)
    Abstract [en]

    Various experiments have shown that the performance of wireless sensor networks is very hard to predict. It is also acknowledged that deploying sensor networks in real settings is a difficult and tedious task. To contribute to the understanding of wireless sensor network behavior we report on our experience from two recently deployed sensor networks: one in-door surveillance network in a factory complex and a combined out-door and in-door surveillance network. Both networks use advanced sensor network technology such as ad hoc routing and multi hop networking. Our results highlight the need for self-configuration in wireless sensor networks, especially in cases where fast deployment and dynamic environments are important aspects.

  • 222.
    Finne, Niclas
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Experiences from two sensor network deployments: self-monitoring and self-configuration keys to success2008In: Wired/Wireless Internet Communications: 6th International Conference, WWIC 2008: Proceedings, Germany: Springer , 2008, 1, , p. 12Conference paper (Refereed)
    Abstract [en]

    Despite sensor network protocols being self-configuring, sensor network deployments continue to fail. We report our experience from two recently deployed IP-based multi-hop sensor networks: one in-door surveillance network in a factory complex and a combined out-door and in-door surveillance network. Our experiences highlight that adaptive protocols alone are not sufficient, but that an approach to self-monitoring and self-configuration that covers more aspects than protocol adaptation is needed. Based on our experiences, we design and implement an architecture for self-monitoring of sensor nodes. We show that the self-monitoring architecture detects and prevents the problems with false alarms encountered in our deployments. The architecture also detects software bugs by monitoring actual and expected duty-cycle of key components of the sensor node. We show that the energy-monitoring architecture detects bugs that cause the radio chip to be active longer than expected.

  • 223.
    Finne, Niclas
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Eriksson, Joakim
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Improving Sensornet Performance by Separating System Configuration from System Logic2010Conference paper (Refereed)
    Abstract [en]

    Many sensor network protocols are self-configuring, but independent self-configuration at different layers often results in suboptimal performance. We present Chi, a full-system configuration architecture that separates system logic from system configuration. Drawing from concepts in artificial intelligence, Chi allows full-system configuration that meets both changing application demands and changing environmental conditions. We show that configuration policies using Chi can improve throughput and energy efficiency without adding dependencies between layers. Our results show that sensornet systems can use Chi to adapt to changing conditions at all layers of the system, thus meeting the requirements of heterogeneous and continuously changing system conditions.

  • 224. Ghadimi, Euhanna
    et al.
    Landsiedel, Olaf
    Soldati, Pablo
    Duquennoy, Simon
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Johansson, Mikael
    Opportunistic Routing in Low Duty-Cycle Wireless Sensor Networks2014In: TOSN: ACM Transactions on Sensor NetworksArticle in journal (Refereed)
    Abstract [en]

    Opportunistic routing is widely known to have substantially better performance than unicast routing in wireless networks with lossy links. However, wireless sensor networks are heavily duty-cycled, i.e. they frequently enter sleep states to ensure long network life-time. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. ORW uses a novel opportunistic routing metric, EDC, that reflects the expected number of duty-cycled wakeups that are required to successfully deliver a packet from source to destination. We devise distributed algorithms that find the EDC-optimal forwarding and demonstrate using analytical performance models and simulations that EDC-based opportunistic routing results in significantly reduced delay and improved energy efficiency compared to the traditional unicast routing. We compare the performance of the ORW protocol with other alternatives in both simulations and testbed-based experiments. Our results show that ORW reduces radio duty cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art.

  • 225.
    Ghodsi, Ali
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Atomic Ring Maintenance for Distributed Hash Tables2007Report (Other academic)
    Abstract [en]

    This paper provides algorithms to maintain a ring-structure for structured peer-to-peer systems. The algorithms guarantee consistent lookup results in the presence of joins and leaves, regardless of at which node the lookup is initiated. Every join and leave event appears as if it happened atomically, thus guaranteeing that lookup results will be the same as if no joins or leaves took place. The ring maintenance algorithms guarantee that no routing failures occur as nodes are joining and leaving. We also show that lookup consistency is impossible to provide given failure detector, and show how the algorithms can be extended to handle failures. The correctness of all the provided algorithms is proven. Previous approaches to this problem either assume a fault-free environment, or have no proof of correctness.

  • 226.
    Ghodsi, Ali
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    ForestCast: a central solution to heuristically constructing trees2007Report (Other academic)
    Abstract [en]

    We present Forestcast which is a flexible and centralized solution to building a forest of trees, which are used to stream live media. A number of heuristic strategies are described to handle joins. Leaves are handled through rejoins. To enable fail-overs, we describe a scheme where the server gives each peer a backup parent such that it is guaranteed that the failure of any peer can be handled. We also describe how the scheme can be efficiently coupled with multiple stripes to allow for better bandwidth utilization. Finally, it is shown how the centralized solution can be decentralized. The provided scheme has three main advantages. i) It is difficult for peers to hack ForestCast as all decisions are taken by the central server. A peer just follows the server's orders about where it should download its stream. It is also possible to use a PKI scheme, where a peer can verify whether it should give its stream to another peer. ii) As the server has complete information about the state of all trees, it can optimize the number and shape of trees based on any metric, e.g. total latency, bandwidth utilization, robustness against failures etc. iii) The client software, running on the peers, contains little intelligence. Hence, it will be simple and can therefore be adapted for various OS and environments. Furthermore, most updates will be to the server infrastructure. A decentralized solution would need software updates to be applied to all peers.

  • 227.
    Ghodsi, Ali
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Weatherspoon, Hakim
    Exploiting the Synergy Between Gossiping and Structured Overlays2007In: ACM SIGOPS Operating Systems Review, Vol. 41, p. 61-66Article in journal (Refereed)
    Abstract [en]

    In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes.

  • 228.
    Girdzijauskas, Sarunas
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Chockler, Gregory
    Vigfusson, Ymir
    Tock, Yoav
    Melamed, Roie
    Magnet: Practical Subscription Clustering for Internet-Scale Publish/Subscribe2010Conference paper (Refereed)
    Abstract [en]

    An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay networks. The key pre-requisite for supporting these types of applications on top of the overlays is efficient distribution of messages to multiple subscribers dispersed across numerous multicast groups. In this paper, we introduce Magnet: a peer-to-peer publish/ subscribe system which achieves efficient message distribution by dynamically organizing peers with similar subscriptions into dissemination structures which preserve locality in the subscription space. Magnet is able to significantly reduce the message propagation costs by taking advantage of subscription correlations present in many large-scale groupbased applications. We evaluate Magnet by comparing its performance against a strawman pub/sub system which does not cluster similar subscriptions by simulation. We find that Magnet outperforms the strawman by a substantial margin on clustered subscription workloads produced using both generative models and real application traces.

  • 229.
    Gotlieb, Arnaud
    et al.
    Simula Research Laboratory, Norway.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Liaaen, Marius
    Cisco, Norway.
    Marijan, Dusica
    Simula Research Laboratory, Norway.
    Petillon, Alexandre
    Simula Research Laboratory, Norway.
    Automated Regression Testing Using Constraint Programming2016In: Proceedings of the Twenty-Eighth AAAI Conference on Innovative Applications (IAAI-16), AAAI Press, 2016, p. 4010-4015Conference paper (Refereed)
    Abstract [en]

    In software validation, regression testing aims to check the absence of regression faults in new releases of a software system. Typically, test cases used in regression testing are executed during a limited amount of time and are selected to check a given set of user requirements. When testing large systems, the number of regression tests grows quickly over the years, and yet the available time slot stays limited. In order to overcome this problem, an approach known as test suite reduction (TSR), has been developed in software engineering to select a smallest subset of test cases, so that each requirement remains covered at least once. However solving the TSR problem is difficult as the underlying optimization problem is NP-hard, but it is also crucial for vendors interested in reducing the time to market of new software releases. In this paper, we address regression testing and TSR with Constraint Programming (CP). More specifically, we propose new CP models to solve TSR that exploit global constraints, namely NValue and GCC. We reuse a set of preprocessing rules to reduce a priori each instance, and we introduce a structure-aware search heuristic. We evaluated our CP models and proposed improvements against existing approaches, including a simple greedy approach and MINTS, the state-of-the-art tool of the software engineering community. Our experiments show that CP outperforms both the greedy approach and MINTS when it is interfaced with MiniSAT, in terms of percentage of reduction and execution time. When MINTS is interfaced with CPLEX, we show that our CP model performs better only on percentage of reduction. Finally, by working closely with validation engineers from Cisco Systems, Norway, we integrated our CP model into an industrial regression testing process.

  • 230.
    Grinchtein, Olga
    et al.
    Ericsson AB, Sweden.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Pearson, Justin
    Uppsala University, Sweden.
    A Constraint Optimisation Model for Analysis of Telecommunication Protocol Logs2015In: Tests and Proofs / [ed] Jasmin Christian Blanchette, Nikolai Kosmatov, 2015, 6, Vol. 9154, p. 137-154Conference paper (Refereed)
    Abstract [en]

    Testing a telecommunication protocol often requires protocol log analysis. A protocol log is a sequence of messages with timestamps. Protocol log analysis involves checking that the content of messages and timestamps are correct with respect to the protocol specification. We model a protocol specification using constraint programming (MiniZinc), and we present an approach where a constraint solver is used to perform protocol log analysis. Our case study is the Public Warning System service, which is a part of the Long Term Evolution (LTE) 4G standard. We were able to analyse logs containing more than 3000 messages with more than 4000 errors.

  • 231.
    Grinchtein, Olga
    et al.
    Ericsson AB, Sweden.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Pearson, Justin
    Uppsala University, Sweden.
    Testing of a telecommunication protocol using constraint programming2015In: 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), 2015, 6, article id 7107467Conference paper (Refereed)
    Abstract [en]

    We present an approach of implementing part of a telecommunication test harness using constraint programming. Our case study is the Public Warning System service, which is a part of the Long Term Evolution (LTE) 4G standard.

  • 232. Groleau, William
    et al.
    Vlassov, Vladimir
    Popov, Konstantin
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Towards Semantics-Based Resource Discovery for the Grid2005Conference paper (Refereed)
  • 233. Gupta, Gopal
    et al.
    Pontelli, Enrico
    Ali, Khayri Mohammed
    RISE - Research Institutes of Sweden, ICT, SICS.
    Carlsson, Mats
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Hermenegildo, Manuel
    Parallel execution of Prolog programs2001In: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, E-ISSN 1558-4593, Vol. 23, no 4, p. 472-602Article in journal (Refereed)
    Abstract [en]

    Since the early days of logic programming, researchers in the field realised the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of non-determinism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this paper is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The paper describes the major techniques used for shared memory implementation of Or-parallelism, And-parallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualisation.

  • 234.
    Hagersten, Erik
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The cache coherence protocol of the data diffusion machine1989Report (Other academic)
    Abstract [en]

    The Data Diffusion Machine (DDM) is a scalable shared memory multiprocessor in which the location of a datum in the machine is completely decoupled from its address. A data access "snooping" protocol provides an automatic duplication and migration of the data to wherever needed. The protocol also handles data coherence and replacement. The hardware organization consists of a hierarchy of buses and data controllers linking an arbitrary number of processors each having a large set-associative memory. Each data controller has a set-associative directory containing status bits for data under its control. The rest of the system appears to one processor like shared memory system, which makes the DDM a general architecture. The DDM is scalable in that there may be any number of levels in the hierarchy. The logical topmost bus (or any other bus) can be implemented by an unlimited number of physical buses removing an anticipated bottleneck.

  • 235. Hagersten, Erik
    et al.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Warren, David H.D.
    The cache-coherence protocol of the data diffusion machine1990Conference paper (Refereed)
  • 236. Hagersten, Erik
    et al.
    Landin, Anders
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Multiprocessor consistency and synchronization thru transient cache states1991Conference paper (Refereed)
  • 237.
    Hahm, Oliver
    et al.
    Inria, France.
    Baccelli, Emmanuel
    Inria, France.
    Petersen, Hauke
    Free University of Berlin, Germany.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Operating Systems for Low-End Devices in the Internet of Things: a Survey2015In: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 3, no 5, p. 720-734Article in journal (Refereed)
    Abstract [en]

    The Internet of Things (IoT) is projected to soon interconnect tens of billions of new devices, in large part also connected to the Internet. IoT devices include both high-end devices which can use traditional go-to operating systems (OSs) such as Linux, and low-end devices which cannot, due to stringent resource constraints, e.g., very limited memory, computational power, and power supply. However, large-scale IoT software development, deployment, and maintenance requires an appropriate OS to build upon. In this paper, we thus analyze in detail the specific requirements that an OS should satisfy to run on low-end IoT devices, and we survey applicable OSs, focusing on candidates that could become an equivalent of Linux for such devices, i.e., a one-size-fits-most, open source OS for low-end IoT devices.

  • 238.
    Hamza, Mohammed Ayyoob Ahamed
    et al.
    University of Colombo, Sri Lanka.
    Keppitiyagama, Chamath
    RISE, Swedish ICT, SICS. University of Colombo, Sri Lanka.
    De Zoysa, Kasun
    University of Colombo, Sri Lanka.
    Iyer, Venkatraman
    Uppsala University, Sweden.
    Hewage, Kasun
    Uppsala University, Sweden.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory. Uppsala University, Sweden.
    A Quadcopter Controller to Maintain Radio Link Quality2015In: Proceedings of the First Workshop on Micro Aerial Vehicle Networks, Systems, and Applications for Civilian Use (DroNet '15), 2015, 8, p. 21-26Conference paper (Refereed)
    Abstract [en]

    The excellent maneuverability and the availability of a large number of sensors including good quality video cameras make quadcopters attractive for surveillance systems. Most video surveillance systems need a real-time high quality video stream from the cameras on the quadcopter to the base station which requires a stable and reliable radio link. Moreover, to ensure a controlled flight, it is essential to maintain a good quality radio link from the base station to the quadcopter. The quality of this link depends on the distance between base station and quadcopter as well as the ambient noise. Towards this end, we present a controller to hover a quadcopter at the maximum distance from the base station while maintaining the link quality at a given value indicated by the Signal to Noise Ratio (SNR). There are existing solutions in the field of robotics that incorporate the concept of link aware mobility. However, to the best of our knowledge, this is the first link-quality aware mobility implementation on a quadcopter.

  • 239.
    Haridi, Seif
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Kernel Andorra Prolog and its computation model1990In: Logic Programming: Proceedings of the Seventh International Conference, MIT Press , 1990, 12Chapter in book (Refereed)
    Abstract [en]

    The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints.

  • 240.
    Haridi, Seif
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Janson, Sverker
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Kernel Andorra Prolog and its Computational Model1990Report (Other academic)
    Abstract [en]

    The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints. The languages Prolog, GHC, Parlog, and Atomic Herbrand, are all executable in the Kernel Andorra Prolog computation model. There are instances of the framework in which all of these languages are embeddable.

  • 241.
    Haridi, Seif
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    van Roy, Peter
    Brand, Per
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Mehl, Michael
    Scheidhauer, Ralf
    Smolka, Gert
    Efficient logic variables for distributed computing1999In: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, E-ISSN 1558-4593, Vol. 21, no 3, p. 569-626Article in journal (Refereed)
  • 242.
    Hassanzadeh, Navid
    et al.
    RISE, Swedish ICT, SICS.
    Landsiedel, Olaf
    Hermans, Frederik
    Rensfelt, Olof
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Efficient Mobile Data Collection with Mobile Collect2012Conference paper (Refereed)
  • 243.
    Hassanzadeh, Navid
    et al.
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Landsiedel, Olaf
    Hermans, Frederik
    Rensfelt, Olof
    Do Sensor Networks need Mobile MAC Protocols?2012Conference paper (Refereed)
  • 244.
    Hausman, Bogumil
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ciepielewski, Andrzej
    RISE - Research Institutes of Sweden, ICT, SICS.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    OR-parallel Prolog made efficient on shared memory multiprocessors1987Report (Other academic)
    Abstract [en]

    With the arrival of commercially available shared-memory multiprocessors, Prolog implementation efforts begin to shift from single processor architectures to the new ones. Among the main problems are efficient implementation of operations on variables and of task switching. Most of the solutions proposed so far suffer from expensive, non-constant time implementation of operations on variables. We propose a model (Versions-Vector Model) in which operations on all variables are constant time operations. The price we pay is a non-constant time of a task switch. As a remedy we propose two ways of decreasing that price. The first is promotion of variables on a task switch, from versions-vectors to the stack or heap, making subsequent task switches cheaper. The second is delayed installation of variables in versions-vectors, decreasing the cost of short branches. We believe that the increased memory consumption induced by our model can be accepted as it is traded for speed.

  • 245.
    He, Zhitao
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Implementation and evaluation of the sensornet protocol for Contiki2007Report (Other academic)
    Abstract [en]

    Sensornet Protocol (SP) is a link abstraction layer between the network layer and the link layer for sensor networks. SP was proposed as the core of a future-oriented sensor node architecture that allows flexible and optimized combination between multiple coexisting protocols. This thesis implements the SP sensornet protocol on the Contiki operating system in order to: evaluate the effectiveness of the original SP services; explore further requirements and implementation trade-offs uncovered by the original proposal. We analyze the original SP design and the TinyOS implementation of SP to design the Contiki port. We implement the data sending and receiving part of SP using Contiki processes, and the neighbor management part as a group of global routines. The evaluation consists of a single-hop traffic throughput test and a multihop convergecast test. Both tests are conducted using both simulation and experimentation. We conclude from the evaluation results that SP's link-level abstraction effectively improves modularity in protocol construction without sacrificing performance, and our SP implementation on Contiki lays a good foundation for future protocol innovations in wireless sensor networks.

  • 246.
    He, Zhitao
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Tsiftes, Nicolas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Rethinking link-level abstractions for sensor networks2008Conference paper (Refereed)
    Abstract [en]

    For designers of the communication stack of sensor nodes there is a constant tension between performance and modularity. To alleviate this tension, researchers have come up with a number of modular architectures. In this work we take a refreshed view of the design of an abstract link level service, an important component in the communication stack. We start with a critical review of one such service, the Sensornet Protocol (SP), and then we implement an SP-flavored link level service featuring a novel combination of ARQ and MAC. Experimental results of transmission delay and energy efficiency highlight a few subtle architectural design trade-offs we have encountered, namely semantics binding, implicit information sharing, and time scope initialization. These aspects have significant impact on software modularity in tiny sensor nodes.

  • 247.
    He, Zhitao
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Hewage, Kasun
    Uppsala University, Sweden.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Arpeggio: a Penetration Attack on Glossy Networks2016In: 2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON), 2016, 9, article id 7732971Conference paper (Refereed)
    Abstract [en]

    Glossy networks make use of concurrent transmissions to achieve rapid network flooding in wireless networks with high reliability. They are robust against jamming and header injection attacks. We find that Glossy floods can be hijacked by a packet injection attacker to penetrate into the network and cause severe loss. We demonstrate the design of such an attacker by evaluating its effectiveness in a 30-node testbed.

  • 248.
    He, Zhitao
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Droplet: A New Denial-of-Service Attack on Low Power Wireless Sensor Networks2013Conference paper (Refereed)
    Abstract [en]

    In this paper we present a new kind of Denial-of-Service attack against the PHY layer of low power wireless sensor networks. Overcoming the very limited range of jamming-based attacks, this attack can penetrate deep into a target network with high power efficiency. We term this the Droplet attack, as it attains enormous disruption by dropping small, payload-less frame headers to its victim's radio receiver, depriving the latter of bandwidth and sleep time. We demonstrate the Droplet attack's high damage rate to full duty-cycle receivers, and further show that a high frequency version of Droplet can even force nodes running on very low duty-cycle MAC protocols to drop most of their packets.

  • 249.
    He, Zhitao
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Precise Packet Loss Pattern Generation by Intentional Interference2011Conference paper (Refereed)
    Abstract [en]

    Abstract—Intermediate-quality links often cause vulnerable connectivity in wireless sensor networks, but packet losses caused by such volatile links are not easy to trace. In order to equip link layer protocol designers with a reliable test and debugging tool, we develop a reactive interferer to generate packet loss patterns precisely. By using intentional interference to emulate parameterized lossy links with very low intrusiveness, our tool facilitates both robustness evaluation of protocols and flaw detection in protocol implementation.

  • 250.
    He, Zhitao
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Zooming Into Radio Events by Bus Snooping2012Conference paper (Refereed)
    Abstract [en]

    In this position paper, we advocate the use of bus snooping to trace radio events. Highly precise and unintrusive, the technique leads to potentially more efficient code and enables more insightful protocol analysis than conventional code instrumentation techniques.

2345678 201 - 250 of 601
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.7