Change search
Refine search result
1 - 9 of 9
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.
  • 1.
    Abbas, Zainab
    et al.
    KTH Royal Institute of Technology, Sweden.
    Al-Shishtawy, Ahmad
    RISE - Research Institutes of Sweden, ICT, SICS.
    Girdzijauskas, Sarunas
    RISE - Research Institutes of Sweden, ICT, SICS. KTH Royal Institute of Technology, Sweden.
    Vlassov, Vladimir
    KTH Royal Institute of Technology, Sweden.
    Short-Term Traffic Prediction Using Long Short-Term Memory Neural Networks2018In: Proceedings - 2018 IEEE International Congress on Big Data, BigData Congress 2018 - Part of the 2018 IEEE World Congress on Services, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 57-65Conference paper (Refereed)
    Abstract [en]

    Short-term traffic prediction allows Intelligent Transport Systems to proactively respond to events before they happen. With the rapid increase in the amount, quality, and detail of traffic data, new techniques are required that can exploit the information in the data in order to provide better results while being able to scale and cope with increasing amounts of data and growing cities. We propose and compare three models for short-term road traffic density prediction based on Long Short-Term Memory (LSTM) neural networks. We have trained the models using real traffic data collected by Motorway Control System in Stockholm that monitors highways and collects flow and speed data per lane every minute from radar sensors. In order to deal with the challenge of scale and to improve prediction accuracy, we propose to partition the road network into road stretches and junctions, and to model each of the partitions with one or more LSTM neural networks. Our evaluation results show that partitioning of roads improves the prediction accuracy by reducing the root mean square error by the factor of 5. We show that we can reduce the complexity of LSTM network by limiting the number of input sensors, on average to 35% of the original number, without compromising the prediction accuracy. .

  • 2. Aberer, Karl
    et al.
    Onana Alima, Luc
    RISE, Swedish ICT, SICS.
    Ghodsi, Ali
    RISE, Swedish ICT, SICS.
    Girdzijauskas, Sarunas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Hauswirth, Manfred
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    The essence of P2P: A reference architecture for overlay networks2005Conference paper (Refereed)
    Abstract [en]

    The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide variety of algorithms, data structures, and architectures have been proposed. The terminologies and abstractions used, however, have become quite inconsistent since the P2P paradigm has attracted people from many different communities, e.g., networking, databases, distributed systems, graph theory, complexity theory, biology, etc. In this paper we propose a reference model for overlay networks which is capable of modeling different approaches in this domain in a generic manner. It is intended to allow researchers and users to assess the properties of concrete systems, to establish a common vocabulary for scientific discussion, to facilitate the qualitative comparison of the systems, and to serve as the basis for defining a standardized API to make overlay networks interoperable.

  • 3.
    Ghoorchian, Kambiz
    et al.
    KTH Royal Institute of Techniology, Sweden.
    Girdzijauskas, Sarunas
    KTH Royal Institute of Techniology, Sweden.
    Rahimian, Fatemeh
    RISE - Research Institutes of Sweden, ICT, SICS.
    DeGPar: Large Scale Topic Detection Using Node-Cut Partitioning on Dense Weighted Graphs2017In: Proceedings - International Conference on Distributed Computing Systems, 2017, p. 775-785Conference paper (Refereed)
    Abstract [en]

    Topic Detection (TD) refers to automatic techniques for locating topically related material in web documents. Nowadays, massive amounts of documents are generated by users of Online Social Networks (OSNs), in form of very short text, tweets and snippets of news. While topic detection, in its traditional form, is applied to a few documents containing a lot of information, the problem has now changed to dealing with massive number of documents with very little information. The traditional solutions, thus, fall short either in scalability (due to huge number of input items) or sparsity (due to insufficient information per input item). In this paper we address the scalability problem by introducing an efficient and scalable graph based algorithm for TD on short texts, leveraging dimensionality reduction and clustering techniques. We first, compress the input set of documents into a dense graph, such that frequent cooccurrence patterns in the documents create multiple dense topological areas in the graph. Then, we partition the graph into multiple dense sub-graphs, each representing a topic. We compare the accuracy and scalability of our solution with two state-of-the-art solutions (including the standard LDA, and BiTerm). The results on two widely used benchmark datasets show that our algorithm not only maintains a similar or better accuracy, but also performs by an order of magnitude faster than the state-of-the-art approaches.

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

  • 5.
    Holst, Anders
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Bouguelia, M. -R
    CAISR, Sweden.
    Görnerup, Olof
    RISE - Research Institutes of Sweden, ICT, SICS.
    Pashami, S.
    CAISR, Sweden.
    Al-Shishtawy, Ahmad
    RISE - Research Institutes of Sweden, ICT, SICS.
    Falkman, G.
    University of Skövde, Sweden.
    Karlsson, A.
    University of Skövde, Sweden.
    Said, A.
    University of Skövde, Sweden.
    Bae, J.
    University of Skövde, Sweden.
    Girdzijauskas, Sarunas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Nowaczyk, S.
    CAISR, Sweden.
    Soliman, Amina
    RISE - Research Institutes of Sweden, ICT, SICS.
    Eliciting structure in data2019In: CEUR Workshop Proceedings, 2019Conference paper (Refereed)
    Abstract [en]

    This paper demonstrates how to explore and visualize different types of structure in data, including clusters, anomalies, causal relations, and higher order relations. The methods are developed with the goal of being as automatic as possible and applicable to massive, streaming, and distributed data. Finally, a decentralized learning scheme is discussed, enabling finding structure in the data without collecting the data centrally. © 2019 Copyright held for the individual papers by the papers’ authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

  • 6.
    Rahimian, Fatemeh
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Girdzijauskas, Sarunas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Parallel Community Detection For Cross-Document Coreference2014Report (Other academic)
    Abstract [en]

    This document presents a highly parallel solution for cross-document coreference resolution, which can deal with billions of documents that exist in the current web. At the core of our solution lies a novel algorithm for community detection in large scale graphs. We operate on graphs which we construct by representing documents' keywords as nodes and the co-location of those keywords in a document as edges. We then exploit the particular nature of such graphs where coreferent words are topologically clustered and can be efficiently discovered by our community detection algorithm. The accuracy of our technique is considerably higher than that of the state of the art, while the convergence time is by far shorter. In particular, we increase the accuracy for a baseline dataset by more than 15\% compared to the best reported result so far. Moreover, we outperform the best reported result for a dataset provided for the Word Sense Induction task in SemEval 2010.

  • 7.
    Rahimian, Fatemeh
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Girdzijauskas, Sarunas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Payberah, Amir
    RISE, Swedish ICT, SICS.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Vinifera: A Gossip-based Hybrid Overlay for Content-based Publish/Subscribe2011Conference paper (Refereed)
  • 8.
    Rahimian, Fatemeh
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Girdzijauskas, Sarunas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Payberah, Amir
    RISE, Swedish ICT, SICS.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Vitis: A Gossip-based Hybrid Overlay for Internet-scale Publish/Subscribe2011In: IPDPS 2011, 2011, 11Conference paper (Refereed)
    Abstract [en]

    Peer-to-peer overlay networks are attractive solutions for building Internet-scale publish/subscribe systems. However, scalability comes with a cost: a message published on a certain topic often needs to traverse a large number of uninterested (unsubscribed) nodes before reaching all its subscribers. This might sharply increase resource consumption for such relay nodes (in terms of bandwidth transmission cost, CPU, etc) and could ultimately lead to rapid deterioration of the system’s performance once the relay nodes start dropping the messages or choose to permanently abandon the system. In this paper, we introduce Vitis, a gossip-based publish/subscribe system that significantly decreases the number of relay messages, and scales to an unbounded number of nodes and topics. This is achieved by the novel approach of enabling rendezvous routing on unstructured overlays. We construct a hybrid system by injecting structure into an otherwise unstructured network. The resulting structure resembles a navigable small-world network, which spans along clusters of nodes that have similar subscriptions. The properties of such an overlay make it an ideal platform for efficient data dissemination in large-scale systems. We perform extensive simulations and evaluate Vitis by comparing its performance against two base-line publish/subscribe systems: one that is oblivious to node subscriptions, and another that exploits the subscription similarities. Our measurements show that Vitis significantly outperforms the base-line solutions on various subscription and churn scenarios, from both synthetic models and real-world traces.

  • 9.
    Rahimian, Fatemeh
    et al.
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Payberah, Amir
    RISE, Swedish ICT, SICS.
    Girdzijauskas, Sarunas
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Jelasity, Mark
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Ja-be-Ja: A Distributed Algorithm for Balanced Graph Partitioning2013Report (Other academic)
    Abstract [en]

    Balanced graph partitioning is a well known NP-complete problem with a wide range of applications. These applications include many large-scale distributed problems such as the optimal storage of large sets of graph-structured data over several hosts, or identifying clusters in on-line social networks. In such very large-scale distributed scenarios, state-of-the-art algorithms are not directly applicable, because they typically involve frequent global operations over the entire graph. In this paper, we propose a distributed graph partitioning algorithm, called Ja-be-Ja1. The algorithm is massively parallel: each graph node is processed independently, and only the direct neighbors of the node, and a small subset of random nodes in the graph need to be known. Strict synchronization is not required. These features allow Ja-be-Ja to be easily adapted to any distributed graph-processing system from data centers to fully distributed networks. We perform a thorough experimental analysis, which shows that the minimal edge-cut value achieved by Ja-be-Ja is comparable to state-of-the-art centralized algorithms such as Metis. In particular, on large social networks Ja-be-Ja outperforms Metis.

1 - 9 of 9
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