Change search
Refine search result
1234567 1 - 50 of 803
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.
    Abdelraheem, Mohamed Ahmed
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Andersson, Tobias
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gehrmann, Christian
    Lunds university, Sweden.
    Searchable Encrypted Relational Databases:Risks and Countermeasures2017In: Data Privacy Management, Cryptocurrencies and Blockchain Technology: ESORICS 2017 International Workshops, DPM 2017 and CBT 2017, Oslo, Norway, September 14-15, 2017, Proceedings / [ed] Joaquin Garcia-Alfaro et al., Gewerbestrasse 11, 6330 Cham, Switzerland: Springer Nature , 2017, Vol. 10436, p. 70-85Conference paper (Refereed)
    Abstract [en]

    We point out the risks of protecting relational databases viaSearchable Symmetric Encryption (SSE) schemes by proposing an infer-ence attack exploiting the structural properties of relational databases.We show that record-injection attacks mounted on relational databaseshave worse consequences than their file-injection counterparts on un-structured databases. Moreover, we discuss some techniques to reducethe effectiveness of inference attacks exploiting the access pattern leak-age existing in SSE schemes. To the best of our knowledge, this is thefirst work that investigates the security of relational databases protectedby SSE schemes.

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

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

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

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

  • 7.
    Adler, Daniel
    RISE - Research Institutes of Sweden, ICT, SICS.
    Virtual Audio - Three-Dimensional Audio in Virtual Environments1996Report (Other academic)
    Abstract [en]

    Three-dimensional interactive audio has a variety ofpotential uses in human-machine interfaces. After lagging seriously behind the visual components, the importance of sound is now becoming increas-ingly accepted. This paper mainly discusses background and techniques to implement three-dimensional audio in computer interfaces. A case study of a system for three-dimensional audio, implemented by the author, is described in great detail. The audio system was moreover integrated with a virtual reality system and conclusions on user tests and use of the audio system is presented along with proposals for future work at the end of the paper. The thesis begins with a definition of three-dimensional audio and a survey on the human auditory system to give the reader the needed knowledge of what three-dimensional audio is and how human auditory perception works.

  • 8.
    Aghaeinezhadfirouzja, Saeid
    et al.
    Shanghai Jiao Tong University, China.
    Liu, Hui
    Shanghai Jiao Tong University, China.
    Balador, Ali
    RISE - Research Institutes of Sweden, ICT, SICS. Mälardalen University, Sweden.
    Practical 3-D beam pattern based channel modeling for multi-polarized massive MIMO systems2018In: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 18, no 4, article id 1186Article in journal (Refereed)
    Abstract [en]

    In this paper, a practical non-stationary three-dimensional (3-D) channel models for massive multiple-input multiple-output (MIMO) systems, considering beam patterns for different antenna elements, is proposed. The beam patterns using dipole antenna elements with different phase excitation toward the different direction of travels (DoTs) contributes various correlation weights for rays related towards/from the cluster, thus providing different elevation angle of arrivals (EAoAs) and elevation angle of departures (EAoDs) for each antenna element. These include the movements of the user that makes our channel to be a non-stationary model of clusters at the receiver (RX) on both the time and array axes. In addition, their impacts on 3-D massive MIMO channels are investigated via statistical properties including received spatial correlation. Additionally, the impact of elevation/azimuth angles of arrival on received spatial correlation is discussed. Furthermore, experimental validation of the proposed 3-D channel models on azimuth and elevation angles of the polarized antenna are specifically evaluated and compared through simulations. The proposed 3-D generic models are verified using relevant measurement data.

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

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

  • 10.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    Hagsand, Olof
    RISE - Research Institutes of Sweden, ICT, SICS.
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Dimensioning Links for IP Telephony2000Report (Other academic)
    Abstract [en]

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

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

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

  • 12.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Björkman, Mats
    Gunningberg, Per
    RISE - Research Institutes of Sweden, ICT, SICS.
    Towards predictable ILP performance-controlling communication buffer cache effects1995Conference paper (Refereed)
  • 13.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    D’Ambrosio, Matteo
    4WARD.
    Dannewitz, Christian
    4WARD.
    Marchisio, Marco
    Marsh, Ian
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ohlman, Börje
    Pentikousis, Kostas
    Rembarz, René
    Strandberg, Ove
    Vercellone, Vinicio
    Design considerations for a network of information2008Conference paper (Refereed)
    Abstract [en]

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

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

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

  • 15.
    Ahlgren, Bengt
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Hurtig, Per
    Karlstad University, Sweden.
    Abrahamsson, Henrik
    RISE - Research Institutes of Sweden, ICT, SICS.
    Grinnemo, Karl-Johan
    Karlstad University, Sweden.
    Brunstrom, Anna
    Karlstad University, Sweden.
    ICN Congestion Control for Wireless Links2018Conference paper (Refereed)
    Abstract [en]

    Information-centric networking (ICN) with its design around named-based forwarding and in-network caching holds great promises to become a key architecture for the future Internet. Still, despite its attractiveness, there are many open questions that need to be answered before wireless ICN becomes a reality, not least about its congestion control: Many of the proposed hop-by-hop congestion control schemes assume a fixed and known link capacity, something that rarely – if ever – holds true for wireless links. As a first step, this paper demonstrates that although these congestion control schemes are able to fairly well utilise the available wireless link capacity, they greatly fail to keep the link delay down. In fact, they essentially offer the same link delay as in the case with no hop-by-hop, only end-to-end, congestion control. Secondly, the paper shows that by complementing these congestion control schemes with an easy-to-implement, packet-train link estimator, we reduce the link delay to a level significantly lower than what is obtained with only end-to-end congestion control, while still being able to keep the link utilisation at a high level.

  • 16.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalen University, Sweden.
    Fotouhi, Hossein
    Mälardalen University, Sweden.
    Köckemann, Uew
    Örebro University, Sweden.
    Lindén, Maria
    Mälardalen University, Sweden.
    Tomasic, Ivan
    Mälardalen University, Sweden.
    Tsiftes, Nicolas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Voigt, Thiemo
    RISE - Research Institutes of Sweden, ICT, SICS.
    Run-Time Assurance for the E-care@home System2018In: Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 225), 2018, p. 107-110Conference paper (Refereed)
    Abstract [en]

    This paper presents the design and implementation of the software for a run-time assurance infrastructure in the E-care@home system. An experimental evaluation is conducted to verify that the run-time assurance infrastructure is functioning correctly, and to enable detecting performance degradation in experimental IoT network deployments within the context of E-care@home. © 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

  • 17.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalen University, Sweden.
    Fotouhi, Hossein
    Mälardalen University, Sweden.
    Köckemann, Uwe
    Örebro University, Sweden.
    Lindén, Maria
    Mälardalen University, Sweden.
    Tomasic, Ivan
    Mälardalen University, Sweden.
    Tsiftes, Nicolas
    RISE - Research Institutes of Sweden, ICT, SICS.
    Voigt, Thiemo
    RISE - Research Institutes of Sweden, ICT, SICS.
    Run-Time Assurance for the E-care@home System2017Conference paper (Refereed)
  • 18.
    Al Nahas, Beshr
    et al.
    Chalmers University of Technology, Sweden.
    Duquennoy, Simon
    RISE - Research Institutes of Sweden, ICT, SICS.
    Landsiedel, Olaf
    Chalmers University of Technology, Sweden.
    Network Bootstrapping and Leader Election in Low-power Wireless Networks2017In: Proceedings of the International Conference on Embedded Networked Sensor Systems (ACM SenSys 2017), November 5-8, 2017, Delft, The Netherlands, ACM Press, 2017Conference paper (Refereed)
  • 19.
    Al Nahas, Beshr
    et al.
    Chalmers University of Technology, Sweden.
    Duquennoy, Simon
    RISE - Research Institutes of Sweden, ICT, SICS.
    Landsiedel, Olaf
    Chalmers University of Technology, Sweden.
    Network-wide Consensus Utilizing the Capture Eect in Low-power Wireless Networks2017In: Proceedings of the International Conference on Embedded Networked Sensor Systems (ACM SenSys 2017), November 5-8, 2017, Delft, The Netherlands, 2017Conference paper (Refereed)
    Abstract [en]

    Many protocols in low-power wireless networks require a root nodeor a leader to bootstrap and maintain its operation. For example,Chaos and Glossy networks need an initiator to synchronize andinitiate the communications rounds. Commonly, these protocolsuse a xed, compile-time dened node as the leader. In this work,we tackle the challenge of dynamically bootstrapping the networkand electing a leader in low-power wireless scenarios, and we focuson Chaos-style networks

  • 20.
    Albertsson, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    An Overview of Practical Research Approaches to Real-Time System Engineering2001Report (Other academic)
    Abstract [en]

    This is a state of the art report and literature overview of practical methods for constructing and analysing real-time systems. It covers operating system support, monitoring methods, and execution time prediction through simulation.

  • 21.
    Albertsson, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    Entropy Injection2007Report (Other academic)
    Abstract [en]

    Testing is the predominant software quality assurance method today, but it has a major flaw --- it cannot reliably catch race conditions, intermittent errors caused by factors that cannot be controlled during testing, such as unpredictable timing behaviour in concurrent software. We present entropy injection, a extension of traditional test methods, which enable developers to create tests for arbitrary types of race conditions in any software application, reusing the application's existing test cases. An entropy injector runs the software under test in an instruction set simulator, where all factors that normally are unpredictable can be explicitly controlled. The injector provokes race condition defects by artificially changing the timing behaviour of the simulated processors, hardware devices, clocks, and input models. Provoked defects can be debugged by developers in a non-intrusive, programmable debugger, which allows race condition defects to be reproduced and provides access to all software state in a distributed system. Developers can use its services to create application-specific injection strategies and directed regression test cases that monitor application state and test specific interleavings of events. Our proof-of-concept entropy injector implementation Njord is built on Nornir, a debugger environment based on the complete system simulator Simics. Njord provokes test case failures by suspending simulated processors, thereby injecting delays in the processes in a concurrent application. We demonstrate Njord on a small test routine, and show how a developer can write a race condition regression test that triggers errors with very high probability, or provoke errors with good probability without using application knowledge.

  • 22.
    Albertsson, Lars
    RISE - Research Institutes of Sweden, ICT, SICS.
    Holistic debugging2006Report (Other academic)
    Abstract [en]

    We present holistic debugging, a novel method for observing execution of complex and distributed software. It builds on an instruction set simulator, which provides reproducible experiments and non-intrusive probing of state in a distributed system. Instruction set simulators, however, provide low-level information, so a holistic debugger contains a translation framework that maps this information to higher abstraction level observation tools, such as source code debuggers. We have created Nornir, a proof-of-concept holistic debugger, built on the simulator Simics. For each observed process in the simulated system, Nornir creates an abstraction translation stack, with virtual machine translators that map machine-level storage contents (e.g. physical memory, registers) provided by Simics, to application-level data (e.g. virtual memory contents) by parsing the data structures of operating systems and virtual machines. Nornir includes a modified version of the GNU debugger (GDB), which supports non-intrusive symbolic debugging of distributed applications. Nornir's main interface is a debugger shepherd, a programmable interface that controls multiple debuggers, and allows users to coherently inspect the entire state of heterogeneous, distributed applications. It provides a robust observation platform for construction of new observation tools.

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

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

  • 24.
    Albertsson, Lars
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Magnusson, Peter
    RISE - Research Institutes of Sweden, ICT, SICS.
    Simulation-based temporal debugging of Linux2000In: Proceedings of the Second Real-Time Linux Workshop, 27-28 Nov 2000, Orlando, Florida, USA, 2000, 1Conference paper (Refereed)
  • 25.
    Albertsson, Lars
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Magnusson, Peter
    RISE - Research Institutes of Sweden, ICT, SICS.
    Using complete system simulation for temporal debugging of general purpose operating systems and workloads2000In: Proceedings of MASCOTS 2000, 29 Aug - 01 Sept 2000, San Francisco, California, USA, IEEE, 2000, 1Conference paper (Refereed)
  • 26.
    Ali, Khayri Mohammed
    RISE - Research Institutes of Sweden, ICT, SICS.
    A method for implementing out in parallel execution of Prolog1987Report (Other academic)
    Abstract [en]

    A method for implementing cut in parallel execution of Prolog is presented. It takes advantages of the efficient implementation of cut in the sequential WAM. It restricts the parallelism, however, it is simple and adds a small extra overhead over the sequential scheme. The method can be used in parallel execution of Prolog on shared amd nonshared memory multiprocessors.

  • 27.
    Ali, Khayri Mohammed
    RISE - Research Institutes of Sweden, ICT, SICS.
    OR parallel execution of horn clause programs based on WAM and shared control information1988Report (Other academic)
    Abstract [en]

    A method for OR parallel execution of Horn clause programs on a shared memory multiprocessor is presented. The shared memory contains only control information that guide processors requesting a job to independently construct the environment required to get a new job from the other processors without degrading the performance. Each processor has a local memory containing its own binding environment. This reduces the traffic to the shared memory and allows each processor to process its job with high performance. Each processor is almost the same as the Warren Abstract Machine (WAM). Modification to the WAM for supporting the method is described in detail. A method for nonshared memory multiprocessor architecture is outlined.

  • 28.
    Ali, Khayri Mohammed
    RISE - Research Institutes of Sweden, ICT, SICS.
    OR parallel execution of Prolog on BC-machine1988Report (Other academic)
    Abstract [en]

    We present the principles of OR-parallel execution of Prolog on a special parallel inference machine, named BC-machine. The machine is a combined local and shared memory multiprocessor with a special interconnection network. The network allows write operations of an active processor to be broadcasted to several idle processors simultaneously. The shared memory is mainly used for sharing some control information among processors in the system. The amount of shared control information is small and accessed relatively seldom. The execution model is based on the local address space approach. It allows all the technology developed for standard Prolog to be used without loss of efficiency. We expect that the model substantially reduces the copying overhead in comparision with all previous related models. This reduction is due to our new idea of dynamic load balancing and the broadcast mechanism supported by the network. A prototype system of 9 processors is under construction at the Swedish Institute of Computer Science in Stockholm.

  • 29.
    Ali, Khayri Mohammed
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Global garbage collection for distributed heap storage systems1987Report (Other academic)
    Abstract [en]

    We present a garbage-collection algorithm, suitable for loosely-coupled multiprocessor systems, in which the processing elements (PE's) share only the communication medium. The algorithm is global, i.e. it involves all the PE's in the system. It allows space compaction, and it uses a system-wide marking phase to mark all accessible objects where a combination of parallel breadth-first/depth-first strategies is used for tracing the object-graphs according to a decentralized credit mechanism that regulates the number of garbage collection messages in the system. The credit mechanism is crucial for determining the space requirement of the garbage-collection messages. Also a variation of the above algorithm is presented for systems with high locality of reference. It allows each PE to perform first its local garbage collection and only invokes the global garbage collection when the freed space by the local collector is insufficient.

  • 30.
    Ali, Khayri Mohammed
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Wong, Milton
    An investigation of an OR parallel execution model for horn clause programs1988Report (Other academic)
    Abstract [en]

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

  • 31.
    Alima, Luc Onana
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Ghodsi, Ali
    RISE - Research Institutes of Sweden, ICT, SICS.
    Haridi, Seif
    RISE - Research Institutes of Sweden, ICT, SICS.
    A Framework for Structured Peer-to-Peer Overlay Networks2004Report (Other academic)
    Abstract [en]

    Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participating peers share computing resources as equals. In the past three year, various structured peer-to-peer overlay networks have been proposed, and probably more are to come. We present a framework for understanding, analyzing and designing structured peer-to-peer overlay networks. The main objective of the paper is to provide practical guidelines for the design of structured overlay networks by identifying a fundamental element in the construction of overlay networks: the embedding of k-ary trees. Then, a number of effective techniques for maintaining these overlay networks are discussed. The proposed framework has been effective in the development of the DKS system.

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

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

  • 33.
    Almgren, Jonas
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Andersson, Stefan
    RISE - Research Institutes of Sweden, ICT, SICS.
    Flood, Lena
    RISE - Research Institutes of Sweden, ICT, SICS.
    Frisk, Claes
    Nilsson, Hans
    Sundberg, Jan
    SICStus Prolog library manual1991Report (Other academic)
  • 34.
    Alonso, Juan
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Abrahamsson, Henrik
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Ahlgren, Bengt
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kreuger, Per
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Objective Functions for Balance in Traffic Engineering2002Report (Other academic)
    Abstract [en]

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

  • 35.
    Alonso, Juan
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Dunkels, Adam
    RISE, Swedish ICT, SICS.
    Voigt, Thiemo
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    Bounds on the Energy Consumption of Routings in Wireless Sensor Networks2003Report (Other academic)
    Abstract [en]

    Energy is one of the most important resources in wireless sensor networks. We use an idealized mathematical model to study the impact of routing on energy consumption. Our results are very general and, within the assumptions listed in Section 2, apply to arbitrary topologies, routings and radio energy models. We find bounds on the minimal and maximal energy routings will consume, and use them to bound the lifetime of the network. The bounds are sharp, and can be achieved in many situations of interest. We illustrate the theory with some examples.

  • 36. Alshawi, Hiyan
    et al.
    Brown, Carl
    RISE - Research Institutes of Sweden, ICT, SICS.
    Carter, David
    Gambäck, Björn
    RISE, Swedish ICT, SICS.
    Pulman, Steve
    Rayner, Manny
    RISE - Research Institutes of Sweden, ICT, SICS.
    Bilingual conversation interpreter : a prototype interactive message translator. Final report1991Report (Other academic)
    Abstract [en]

    This document is the final report for a research project aimed at producing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Billingual Conversation Interpreter, or BCI) translates between english and Swedish in both directions.The Major components of the BCI are two copies of the SRI Core Language Engine, equipped with English and Swedish grammars respectively. These are linked by the transfer and disambiguation components. Translation takes place by analyzing the source-language sentence into Quasi Logical Form ( QLF), a linguistically motivated logical representation, transferring this into a target-language QLF, and generating a target-language sentence. When ambiguities occur that cannot be resolved automatically, they are clarified by Querying the appropriate user. The clarification dialogue presupposes no knowledge of either linguistics or the other language. The prototype system has a broad grammatical coverage, a initial vocabulary of about 1000 words together with vocabulary expansion tools, and a set of English-Swedish transfer rules. The formalism developed for coding this linguistic information make it relatively easy to extend the system. We believe that the project was successful in demonstrating the feasibility of using these techniques for interactive translation applications, and provides a sound basis for development of a large scale message translator system with potential for commercial exploitation.The main sections of this report are the following: * A non-technical introduction, summarizing the BCI's design , and containing a sample session. * An overview of the Swedish version of the CLE. * A detailed discussion of the theory and practice of QLF transfer. * A description of the interactive disambiguation method. * Suggestions for possible follow-on projects aimed in the direction of practically usable commercial systems.

  • 37. Alshawi, Hiyan
    et al.
    Carter, David
    Gambäck, Björn
    RISE, Swedish ICT, SICS.
    Pulman, Steve
    Rayner, Manny
    RISE - Research Institutes of Sweden, ICT, SICS.
    Transfer through quasi logical form - A new approach to machine translation1991Report (Other academic)
    Abstract [en]

    This Document is an introduction to a research project aimed at producing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Billingual Conversation Interpreter, or BCI) translates between English and Swedish in both Directions. The major components of the BCI are two copies of the SRI Core Language Engine, equipped with English and Swedish grammars respectively. These are linked by the transfer and disambiguation components. Translation takes place by analyzing the source-language sentence into Quasi Logical Form (QLF), a linguistically motivated logical representation, transferring this onto a target-language QLF, and generating a target-language sentence. We believe that the project was successful in demonstrating the feasibility of using these techniques for interactive translation applications, and provides a sound basis for development of a large scale message translator system. The final section of the paper points to several possible follow-on projects aimed in the direction of practically usable commercial systems.

  • 38. Amadio, Roberto
    et al.
    Dam, Mads
    RISE - Research Institutes of Sweden, ICT, SICS.
    A Proof System for the pi-calculus1996Report (Other academic)
    Abstract [en]

    We study the problem of specifying and verifying properties of pi-calculus processes while relying on a bisimulation semantics. As our property specification language we use a version of the modal mu-calculus adapted to the pi-calculus. We show that the logical language is sufficiently expressive to characterize by means of a finite formula a process up to any approximation of the bisimulation relation. We consider the problem of checking that a process of the pi-calculus satisfies a specification expressed in this modal mu-calculus. We develop an algorithm which is sound in general, and complete for processes having a finite reachability property. Finally, we present a proof system which can be applied to prove non-recursive properties of arbitrary processes. We show that the system is complete on the non-recursive fragment of the logical language.

  • 39. Amadio, Roberto
    et al.
    Dam, Mads
    RISE - Research Institutes of Sweden, ICT, SICS.
    Reasoning about Higher-Order Processes1994Report (Other academic)
    Abstract [en]

    We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of Hennessy-Milner logic including a constructive implication, or function space constructor. This result is a non-trivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present an infinitary sound and complete proof system for the fragment of the calculus not handling restriction.

  • 40.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    Capacity Study of Statistical Multiplexing for IP Telephony2000Report (Other academic)
    Abstract [en]

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

  • 41.
    Andersson, Anders
    RISE - Research Institutes of Sweden, ICT, SICS.
    SAGA -- Syntax Analyzer Generator for Agents1995Report (Other academic)
    Abstract [en]

    LALR(1) parser generators in conjunction with imperative programming languages is the standard solution for parsing applications. Contrary to popular belief, this situation is not entirely satisfactory. With imperative tools like Yacc, it is difficult to add actions to a grammar without introducing conflicts. Also, LALR(1) is not powerful enough to meet the needs of languages like C++. We argue that LALR(1) parsing in conjuction with concurrent constraint programming is an interesting option that solves the former problem. We also show how deep guards and don't-know non-determinism can be exploited to solve the latter problem. These ideas have been incorporated in the Saga parser generator described in this report. Saga is an integrated generator for lexical analyzers and parsers. It is based on AKL, a multiparadigm programming language based on a concurrent constraint framework. It is intended both as a research tool to demonstrate the power offered by concurrent constraints, and as a practical tool for the Agents programming system. As a practical tool, Saga features many improvements over tools like Yacc. For example, Saga offers powerful syntax, elegant reporting and resolution of conflicts and powerful error handling in the generated syntax analyzers.

  • 42.
    Andersson Ersman, Peter
    et al.
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Westerberg, David
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Tu, Deyu
    Linköping University, Sweden.
    Nilsson, Marie
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Åhlin, Jessica
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Eveborn, Annelie
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Lagerlöf, Axel
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Nilsson, David
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Sandberg, Mats
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Norberg, Petronella
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Berggren, Magnus
    Linköping University, Sweden.
    Forchheimer, Robert
    RISE - Research Institutes of Sweden, ICT, SICS.
    Gustafsson, Göran
    RISE - Research Institutes of Sweden, ICT, Acreo.
    Screen printed digital circuits based on vertical organicelectrochemical transistors2017In: Flex. Print. Electron., Vol. 2, article id 045008Article in journal (Refereed)
    Abstract [en]

    Vertical organic electrochemical transistors (OECTs) have been manufactured solely using screenprinting. The OECTs are based on PEDOT:PSS (poly(3,4-ethylenedioxythiophene) doped with poly(styrene sulfonic acid)), which defines the active material for both the transistor channel and the gateelectrode. The resulting vertical OECT devices and circuits exhibit low-voltage operation, relativelyfast switching, small footprint and high manufacturing yield; the last three parameters are explainedby the reliance of the transistor configuration on a robust structure in which the electrolyte verticallybridges the bottom channel and the top gate electrode. Two different architectures of the verticalOECT have been manufactured, characterized and evaluated in parallel throughout this report. Inaddition to the experimental work, SPICE models enabling simulations of standalone OECTs andOECT-based circuits have been developed. Our findings may pave the way for fully integrated, lowvoltageoperating and printed signal processing systems integrated with e.g. printed batteries, solarcells, sensors and communication interfaces. Such technology can then serve a low-cost basetechnology for the internet of things, smart packaging and home diagnostics applications.

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

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

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

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

  • 45.
    Andersson, Stefan
    RISE - Research Institutes of Sweden, ICT, SICS.
    Implementing a module system for SICStus Prolog1991Report (Other academic)
    Abstract [en]

    This report covers the specification and implementation of a predicate based module system for SICStus Prolog. There is also a brief background to the module issue for Prolog. The emphasis is put on the description of the implementation.

  • 46. Andreou, Andreas S
    et al.
    Papatheocharous, Efi
    RISE - Research Institutes of Sweden, ICT, SICS.
    Automatic matching of software component requirements using semi-formal specifications and a CBSE ontology2015In: Evaluation of Novel Approaches to Software Engineering (ENASE), 2015 International Conference on, 2015, p. 118-128Conference paper (Refereed)
  • 47. Andreou, Andreas S
    et al.
    Papatheocharous, Efi
    RISE - Research Institutes of Sweden, ICT, SICS.
    Towards a CBSE Framework for Enhancing Software Reuse: Matching Component Properties Using Semi-Formal Specifications and Ontologies2015In: International Conference on Evaluation of Novel Approaches to Software Engineering, 2015, p. 98-121Conference paper (Refereed)
  • 48.
    Antonov, Nikolai V.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Scaling behavior in a stochastic self-gravitating system2003Report (Other academic)
    Abstract [en]

    A system of stochastic differential equations for the velocity and density of a classical self-gravitating matter is investigated by means of the field theoretic renormalization group. The existence of two types of large-scale scaling behavior, associated to physically admissible fixed points of the renormalization-group equations, is established. Their regions of stability are identified and the corresponding scaling dimensions are calculated in the one-loop approximation (first order of the epsilon expansion). The velocity and density fields have independent scaling dimensions. Our analysis supports the importance of the rotational (non-potential) components of the velocity field in the formation of those scaling laws.

  • 49.
    Arad, Cosmin
    et al.
    RISE - Research Institutes of Sweden, ICT, SICS.
    Kafray, Ozair
    Ghodsi, Ali
    RISE - Research Institutes of Sweden, ICT, SICS.
    Haridi, Seif
    RISE, Swedish ICT, SICS, Computer Systems Laboratory.
    GODS: Global Observatory for Distributed Systems2007Report (Other academic)
    Abstract [en]

    We propose GODS, an ecosystem for the evaluation and study of world-wide distributed and dynamic systems under a realistic emulated network environment. GODS allows the evaluation of a system's actual implementation in reproducible experiments, collecting global knowledge about the system state. Furthermore, GODS addresses the problems of debugging distributed algorithms, performance tuning, measuring bandwidth consumption, regression testing, and benchmarking similar systems, thus offering a complete evaluation environment for distributed applications. Our framework uses ModelNet for the network emulation and enhances that by (1) adding dynamism by varying link properties, partitioning the network and emulating churn, (2) offering global knowledge about the observed system by gathering statistics and events and (3) enabling the user to easily deploy, manage and monitor complex, large-scale distributed systems.

  • 50.
    Arfaoui, Ghada
    et al.
    Orange, France.
    Bisson, Pascal
    Thales, France.
    Blom, Rolf
    RISE - Research Institutes of Sweden, ICT, SICS.
    Borgaonkar, Ravishankar
    University of Oxford, UK.
    Englund, Håkan
    Ericsson AB, Sweden.
    Felix, Edith
    Thales, France.
    Klaedtke, Felix
    NEC Labs Europe, Germany..
    Nakarmi, Prajwol K.
    Ericsson AB, Sweden.
    Naslund, Mats
    Ericsson AB, Sweden.
    O'Hanlon, Piers
    University of Oxford, UK.
    Papay, Juri
    IT Innovation Centre, UK.
    Suomalainen, Jani
    VTT Technical Research Centre of Finland, Finland.
    Surridge, Mike
    IT Innovation Centre, UK.
    Wary, Jean-Philippe
    Orange, France.
    Zahariev, Alexander
    Nixu Corporation, Finland.
    A Security Architecture for 5G Networks2018In: IEEE Access, E-ISSN 2169-3536Article in journal (Refereed)
    Abstract [en]

    5G networks will provide opportunities for the creation of new services, for new business models, and for new players to enter the mobile market. The networks will support efficient and cost-effective launch of a multitude of services, tailored for different vertical markets having varying service and security requirements, and involving a large number of actors. Key technology concepts are network slicing and network softwarisation, including network function virtualisation and software-defined networking. The presented security architecture builds upon concepts from the 3G and 4G security architectures but extends and enhances them to cover the new 5G environment. It comprises a toolbox for security relevant modelling of the systems, a set of security design principles, and a set of security functions and mechanisms to implement the security controls needed to achieve stated security objectives. In a smart city use case setting, we illustrate its utility; we examine the high-level security aspects stemming from the deployment of large numbers of IoT devices and network softwarisation.

1234567 1 - 50 of 803
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.33.0