Necessary and sufficient conditions for the existence of solution of generalized fuzzy relation equations A ⇔X = B

In 2013 Li and Jin studied a particular type of fuzzy relational equations on finite sets, where the introduced min-bi-implication composition is based on Łukasiewicz equivalence. In this paper such fuzzy relation equations are studied on a more general level, namely complete residuated lattice valued fuzzy relation equations of type ⋀y∈Y(A(x,y)↔X(y)=B(x) are analyzed, and the existence of solutions S is studied. First a necessary condition for the existence of solution is established, then conditions for lower and upper limits of solutions are given, and finally sufficient conditions for the existence of the smallest and largest solutions, respectively, are characterized. If such general or global solutions do not exist, there might still be partial or point wise solutions; this is a novel way to study fuzzy relation equations. Such point wise solutions are studied on Łukasiewicz, Product and Gödel t-norm based residuated lattices on the real unit interval.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Research group: Computer Science and Applied Logics
Contributors: Turunen, E.
Number of pages: 7
Pages: 351-357
Publication date: 1 Oct 2020
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 536
ISSN (Print): 0020-0255
Original language: English
ASJC Scopus subject areas: Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Fuzzy relation equation, Residuated lattice, T-norm
URLs: 
Source: Scopus
Source ID: 85085840362

Research output: Contribution to journalArticleScientificpeer-review

On the zeros of the partial Hosoya polynomial of graphs

The partial Hosoya polynomial (or briefly the partial H-polynomial) can be used to construct the well-known Hosoya polynomial. The ith coefficient of this polynomial, defined for an arbitrary vertex u of a graph G, is the number of vertices at distance i from u. The aim of this paper is to determine the partial H-polynomial of several well-known graphs and, then, to investigate the location of their zeros. To pursue, we characterize the structure of graphs with the minimum and the maximum modulus of the zeros of partial H-polynomial. Finally, we define another graph polynomial of the partial H-polynomial, see [9]. Also, we determine the unique positive root of this polynomial for particular graphs.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Shahid Rajaee Teacher Training University, Swiss Distance University of Applied Sciences, Institute for Bioinformatics and Translational Research, Nankai University, Tianjin Polytechnic University, Central South University China, Aalto University, Peking University, Mathematics Faculty of Information Technology and Communication Sciences
Contributors: Ghorbani, M., Dehmer, M., Cao, S., Feng, L., Tao, J., Emmert-Streib, F.
Number of pages: 17
Pages: 199-215
Publication date: 1 Jul 2020
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 524
ISSN (Print): 0020-0255
Original language: English
ASJC Scopus subject areas: Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Cut-vertex, Distance, Hosoya polynomial, Polynomial roots
Source: Scopus
Source ID: 85083078026

Research output: Contribution to journalArticleScientificpeer-review

Studying the inertias of LCM matrices and revisiting the Bourque-Ligh conjecture

Let S={x1,x2,…,xn} be a finite set of distinct positive integers. Throughout this article we assume that the set S is GCD closed. The LCM matrix [S] of the set S is defined to be the n×n matrix with lcm(xi,xj) as its ij element. The famous Bourque-Ligh conjecture used to state that the LCM matrix of a GCD closed set S is always invertible, but currently it is a well-known fact that any nontrivial LCM matrix is indefinite and under the right circumstances it can be even singular (even if the set S is assumed to be GCD closed). However, not much more is known about the inertia of LCM matrices in general. The ultimate goal of this article is to improve this situation. Assuming that S is a meet closed set we define an entirely new lattice-theoretic concept by saying that an element xi∈S generates a double-chain set in S if the set meetcl(CS(xi))∖CS(xi) can be expressed as a union of two disjoint chains (here the set CS(xi) consists of all the elements of the set S that are covered by xi and meetcl(CS(xi)) is the smallest meet closed subset of S that contains the set CS(xi)). We then proceed by studying the values of the Möbius function on sets in which every element generates a double-chain set and use the properties of the Möbius function to explain why the Bourque-Ligh conjecture holds in so many cases and fails in certain very specific instances. After that we turn our attention to the inertia and see that in some cases it is possible to determine the inertia of an LCM matrix simply by looking at the lattice-theoretic structure of (S,|) alone. Finally, we are going to show how to construct LCM matrices in which the majority of the eigenvalues is either negative or positive.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Research group: Computer Science and Applied Logics, Tampere University
Contributors: Haukkanen, P., Mattila, M., Mäntysalo, J.
Publication date: 1 Apr 2020
Peer-reviewed: Yes
Early online date: 14 Oct 2019

Publication information

Journal: Journal of Combinatorial Theory. Series A
Volume: 171
Article number: 105161
ISSN (Print): 0097-3165
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics
Keywords: Bourque-Ligh conjecture, GCD matrix, LCM matrix, Smith determinant
URLs: 
Source: Scopus
Source ID: 85073148974

Research output: Contribution to journalArticleScientificpeer-review

Computer-Generated Holograms for 3D Imaging: A Survey

Holography is usually considered as the ultimate way to visually reproduce a three-dimensional scene. Computer-generated holography constitutes an important branch of holography, which enables visualization of artificially generated scenes as well as real three-dimensional scenes recorded under white-light illumination. In this article, we present a comprehensive survey of methods for synthesis of computer-generated holograms, classifying them into two broad categories: wavefront-based methods and ray-based methods. We examine their modern implementations in terms of the quality of reconstruction and computational efficiency. As it is an integral part of computer-generated holography, we devote a special section to speckle suppression, which is also discussed under two categories following the classification of underlying computer-generated hologram methods.

General information

Publication status: Published
MoE publication type: A2 Review article in a scientific journal
Organisations: Computing Sciences, Research group: 3D MEDIA, Bulgarian Academy of Sciences
Contributors: Sahin, E., Stoykova, E., Mäkinen, J., Gotchev, A.
Number of pages: 35
Publication date: 2020
Peer-reviewed: Yes

Publication information

Journal: ACM Computing Surveys
Volume: 53
Issue number: 2
Article number: 32
ISSN (Print): 0360-0300
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 3D displays, 3D imaging, Computer-generated holograms
Source: Scopus
Source ID: 85087876294

Research output: Contribution to journalReview ArticleScientificpeer-review

Densely-sampled light field reconstruction

In this chapter, we motivate the use of densely-sampled light fields as the representation which can bring the required density of light rays for the correct recreation of 3D visual cues such as focus and continuous parallax and can serve as an intermediary between light field sensing and light field display. We consider the problem of reconstructing such a representation from few camera views and approach it in a sparsification framework. More specifically, we demonstrate that the light field is well structured in the set of so-called epipolar images and can be sparsely represented by a dictionary of directional and multi-scale atoms called shearlets. We present the corresponding regularization method, along with its main algorithm and speed-accelerating modifications. Finally, we illustrate its applicability for the cases of holographic stereograms and light field compression.

General information

Publication status: Published
MoE publication type: A3 Part of a book or another research book
Organisations: Computing Sciences
Contributors: Vagharshakyan, S., Bregovic, R., Gotchev, A.
Number of pages: 29
Pages: 67-95
Publication date: 2020

Host publication information

Title of host publication: Real VR – Immersive Digital Reality
Publisher: Springer
ISBN (Print): 978-3-030-41815-1
ISBN (Electronic): 978-3-030-41816-8

Publication series

Name: Lecture Notes in Computer Science
Volume: 11900
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Light field, Shearlet transform, Sparsification

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85083441420

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Design and characterization of light field and holographic near-eye displays

The light field and holographic displays constitute two important categories of advanced three-dimensional displays that are aimed at delivering all physiological depth cues of the human visual system, such as stereo cues, motion parallax, and focus cues, with sufficient accuracy. As human observers are the end-users of such displays, the delivered spatial information (e.g., perceptual spatial resolution) and view-related image quality factors (e.g., focus cues) are significantly dependent on the characteristics of the human visual system. Retinal image formation models enable rigorous characterization and subsequently efficient design of light field and holographic displays. In this chapter the ray-based near-eye light field and wave-based near-eye holographic displays are reviewed, and the corresponding retinal image formation models are discussed. In particular, most of the discussion is devoted to characterization of the perceptual spatial resolution and focus cues.

General information

Publication status: Published
MoE publication type: A3 Part of a book or another research book
Organisations: Computing Sciences
Contributors: Sahin, E., Mäkinen, J., Akpinar, U., Miyanishi, Y., Gotchev, A.
Number of pages: 28
Pages: 244-271
Publication date: 2020

Host publication information

Title of host publication: Real VR – Immersive Digital Reality
Publisher: Springer
ISBN (Print): 978-3-030-41815-1
ISBN (Electronic): 978-3-030-41816-8

Publication series

Name: Lecture Notes in Computer Science
Volume: 11900
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Display characterization, Focus cues, Holographic display, Light field display, Perceptual resolution
Source: Scopus
Source ID: 85083426092

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Game-theoretic semantics for ATL+ with applications to model checking

We develop a game-theoretic semantics (GTS) for the fragment ATL+ of the alternating-time temporal logic ATL, thereby extending the recently introduced GTS for ATL. We show that the game-theoretic semantics is equivalent to the standard compositional semantics of ATL+ with perfect-recall strategies. Based on the new semantics, we provide an analysis of the memory and time resources needed for model checking ATL+ and show that strategies of the verifier that use only a very limited amount of memory suffice. Furthermore, using the GTS, we provide a new algorithm for model checking ATL+ and identify a natural hierarchy of tractable fragments of ATL+ that substantially extend ATL.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Stockholm University, University of Johannesburg, Tampere University, University of Helsinki
Contributors: Goranko, V., Kuusisto, A., Rönnholm, R.
Number of pages: 23
Publication date: 2020
Peer-reviewed: Yes

Publication information

Journal: Information and Computation
Article number: 104554
ISSN (Print): 0890-5401
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Information Systems, Computer Science Applications, Computational Theory and Mathematics
Keywords: Algorithmic model checking, Alternating-time temporal logic, Finite memory strategies, Game-theoretic semantics, Tractable fragments
Source: Scopus
Source ID: 85082775187

Research output: Contribution to journalArticleScientificpeer-review

Learning and Teaching Experiences with a Persuasive Social Robot in Primary School – Findings and Implications from a 4-Month Field Study

In the field of child-robot interaction (CRI), long-term field studies with users in authentic contexts are still rare. This paper reports the findings from a 4-month field study of robot-assisted language learning (RALL). We focus on the learning experiences of primary school pupils with a social, persuasive robot, and the experiences of the teachers of using the robot as a teaching tool. Our qualitative research approach includes interviews, observations, questionnaires and a diary as data collection methods, and affinity diagram as a data analysis method. The research involves three target groups: the pupils of a 3rd grade class (9–10 years old, n = 20), language teachers (n = 3) and the parents (n = 18). We report findings on user experience (UX), the robot’s tasks and role in the school, and the experience of the multimodal interaction with the robot. Based on the findings, we discuss several aspects concerning the design of persuasive robotics on robot-assisted learning and CRI, for example the benefits of robot-specific ways of rewarding, the value of the physical embodiment and the opportunities of the social role adopted by the learning robot.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences
Contributors: Ahtinen, A., Kaipainen, K.
Number of pages: 12
Pages: 73-84
Publication date: 2020

Host publication information

Title of host publication: Persuasive Technology. Designing for Future Change - 15th International Conference on Persuasive Technology, PERSUASIVE 2020, Proceedings
Publisher: Springer
Editors: Gram-Hansen, S. B., Jonasen, T. S., Midden, C.
ISBN (Print): 9783030457112

Publication series

Name: Lecture Notes in Computer Science
Volume: 12064
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Child-robot interaction, Field study, Persuasive design, Robot-assisted learning, User experience

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85084760449

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

PRBS-based loop gain identification and output impedance shaping in DC microgrid power converters

Due to potential dynamic interactions among dc microgrid power converters, the performance of some of their control loops can vary from the designed behavior. Thus, online monitoring of different control loops within a dc microgrid power converter is highly desirable. This paper proposes the simultaneous identification of several control loops within dc microgrid power converters, by injecting orthogonal pseudo-random binary sequences (PRBSs), and measuring all the loop gains in one measurement cycle. The identification results can be used for different purposes such as controller autotuning, impedance shaping, etc. Herein, an example of output impedance estimation and shaping based on locally-measured loop gains is presented. The proposed identification technique and its application in output impedance shaping are validated on an experimental dc microgrid prototype, composed of three droop-controlled power converters.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Research group: Power electronics, Research area: Power engineering, Electrical Engineering, Universita degli Studi di Padova, Italy
Contributors: Khodamoradi, A., Liu, G., Mattavelli, P., Messo, T., Abedini, H.
Number of pages: 13
Publication date: 2020
Peer-reviewed: Yes

Publication information

Journal: Mathematics and Computers in Simulation
ISSN (Print): 0378-4754
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all), Numerical Analysis, Modelling and Simulation, Applied Mathematics
Keywords: DC microgrid, Impedance shaping, Loop gain identification
Source: Scopus
Source ID: 85084199897

Research output: Contribution to journalArticleScientificpeer-review

Remarks on the Design of First Digital Computers in Japan - Contributions of Yasuo Komamiya

This paper presents some less known details about the work of Yasuo Komamiya in development of the first relay computers using the theory of computing networks that is based on the former work of Oohashi Kan-ichi and Mochiori Goto at the Electrotechnical Laboratory (ETL) of Agency of Industrial Science and Technology, Tokyo, Japan. The work at ETL in the same direction was performed under guidance of Mochinori Goto.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Mathematical Institute of SANU, Meiji University, Computer Systems and Media Laboratory
Contributors: Stanković, R. S., Sasao, T., Astola, J. T., Yamada, A.
Number of pages: 8
Pages: 123-130
Publication date: 2020

Host publication information

Title of host publication: Computer Aided Systems Theory – EUROCAST 2019 - 17th International Conference, Revised Selected Papers
Publisher: Springer
Editors: Moreno-Díaz, R., Quesada-Arencibia, A., Pichler, F.
ISBN (Print): 9783030450922

Publication series

Name: Lecture Notes in Computer Science
Volume: 12013
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Arithmetic circuits, Digital computers, History, Parametron computers, Relay-based computers, Transistorised computers

Bibliographical note

EXT="Stanković, Radomir S."

Source: Scopus
Source ID: 85083959364

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Tile priorities in adaptive 360-degree video streaming

For video applications, tiled streaming is a popular way to deliver viewport dependent 360-degree video. Unfortunately, dynamic adaptation to network bandwidth fluctuations of such video streams is still a challenge. This paper proposes a method for managing in a controlled way the graceful quality degradation in DASH-based streaming systems to deliver omnidirectional video. The method is enabled by the signaling of tile priority maps in order to reduce the impact of graceful degradation on the users’ Quality of Experience (QoE). Simulation results show that this method allows degrading the system by over 10% of minor bandwidth usage during Viewport Dependent Streaming, without sacrificing the user QoE so much compared to the case that does not make use of this technique. Furthermore, the presented method improves flexibility from the service provider’s standpoint.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Nokia
Contributors: Curcio, I. D., Monakhov, D., Hourunranta, A., Aksu, E. B.
Number of pages: 12
Pages: 212-223
Publication date: 2020

Host publication information

Title of host publication: Smart Multimedia - 2nd International Conference, ICSM 2019, Revised Selected Papers
Publisher: Springer
Editors: McDaniel, T., Berretti, S., Curcio, I. D., Basu, A.
ISBN (Print): 9783030544065
ISBN (Electronic): 978-3-030-54407-2

Publication series

Name: Lecture Notes in Computer Science
Volume: 12015 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 360-degree video, Bandwidth adaptation, Omnidirectional video, Tiled streaming, Video streaming

Bibliographical note

INT=comp,"Monakhov, Dmitrii"
JUFOID=62555

Source: Scopus
Source ID: 85089617577

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Vehicle Attribute Recognition by Appearance: Computer Vision Methods for Vehicle Type, Make and Model Classification

This paper studies vehicle attribute recognition by appearance. In the literature, image-based target recognition has been extensively investigated in many use cases, such as facial recognition, but less so in the field of vehicle attribute recognition. We survey a number of algorithms that identify vehicle properties ranging from coarse-grained level (vehicle type) to fine-grained level (vehicle make and model). Moreover, we discuss two alternative approaches for these tasks, including straightforward classification and a more flexible metric learning method. Furthermore, we design a simulated real-world scenario for vehicle attribute recognition and present an experimental comparison of the two approaches.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Research group: Multimedia Research Group - MRG
Contributors: Ni, X., Huttunen, H.
Publication date: 2020
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
ISSN (Print): 1939-8018
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: Image classification, Metric learning, Vehicle attribute recognition
Source: Scopus
Source ID: 85086837300

Research output: Contribution to journalArticleScientificpeer-review

Programming languages for data-Intensive HPC applications: A systematic mapping study

A major challenge in modelling and simulation is the need to combine expertise in both software technologies and a given scientific domain. When High-Performance Computing (HPC) is required to solve a scientific problem, software development becomes a problematic issue. Considering the complexity of the software for HPC, it is useful to identify programming languages that can be used to alleviate this issue. Because the existing literature on the topic of HPC is very dispersed, we performed a Systematic Mapping Study (SMS) in the context of the European COST Action cHiPSet. This literature study maps characteristics of various programming languages for data-intensive HPC applications, including category, typical user profiles, effectiveness, and type of articles. We organised the SMS in two phases. In the first phase, relevant articles are identified employing an automated keyword-based search in eight digital libraries. This lead to an initial sample of 420 papers, which was then narrowed down in a second phase by human inspection of article abstracts, titles and keywords to 152 relevant articles published in the period 2006–2018. The analysis of these articles enabled us to identify 26 programming languages referred to in 33 of relevant articles. We compared the outcome of the mapping study with results of our questionnaire-based survey that involved 57 HPC experts. The mapping study and the survey revealed that the desired features of programming languages for data-intensive HPC applications are portability, performance and usability. Furthermore, we observed that the majority of the programming languages used in the context of data-intensive HPC applications are text-based general-purpose programming languages. Typically these have a steep learning curve, which makes them difficult to adopt. We believe that the outcome of this study will inspire future research and development in programming languages for data-intensive HPC applications.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Research group: MMDM, Universidade Nova de Lisboa, University of Torino, Der Technischen Universitat Wien Fakultät für Elektrotechnik und Informationstechnik, University of Stirling, Universidade de Lisboa, University of Latvia, NOVA University of Lisbon, University of Amsterdam, Aristotle University of Thessaloniki, Linköping University, Queen's University, Belfast, Northern Ireland, Linnaeus University, Kalmar, Instituto Superior de Engenharia de Lisboa
Contributors: Amaral, V., Norberto, B., Goulão, M., Aldinucci, M., Benkner, S., Bracciali, A., Carreira, P., Celms, E., Correia, L., Grelck, C., Karatza, H., Kessler, C., Kilpatrick, P., Martiniano, H., Mavridis, I., Pllana, S., Respício, A., Simão, J., Veiga, L., Visa, A.
Number of pages: 17
Publication date: 8 Nov 2019
Peer-reviewed: Yes

Publication information

Journal: Parallel Computing
Volume: 91
Article number: 102584
ISSN (Print): 0167-8191
Ratings: 
  • Scopus rating (2019): CiteScore 2.9 SJR 0.346 SNIP 1.104
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Hardware and Architecture, Computer Networks and Communications, Computer Graphics and Computer-Aided Design, Artificial Intelligence
Keywords: Big data, Data-intensive applications, Domain-Specific language (DSL), General-Purpose language (GPL), High performance computing (HPC), Programming languages, Systematic mapping study (SMS)
Source: Scopus
Source ID: 85076201522

Research output: Contribution to journalArticleScientificpeer-review

Satisfiability of modal inclusion logic: Lax and strict semantics

We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for the strict and another one for the lax semantics. Both problems turn out to be EXPTIME-complete on general structures. Finally,we showhowfor a specific class of structures NEXPTIME-completeness for these problems under strict semantics can be achieved.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Leibniz-Universität Hannover, Tampere University
Contributors: Hella, L., Kuusisto, A., Meier, A., Vollmer, H.
Publication date: 1 Oct 2019
Peer-reviewed: Yes

Publication information

Journal: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Volume: 21
Issue number: 1
Article number: 7
ISSN (Print): 1529-3785
Ratings: 
  • Scopus rating (2019): CiteScore 2.2 SJR 0.572 SNIP 1.095
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all), Logic, Computational Mathematics
Keywords: Computational complexity, Modal inclusion logic, Satisfiability, Team semantics

Bibliographical note

DUPL=50949587

Source: Scopus
Source ID: 85075599859

Research output: Contribution to journalArticleScientificpeer-review

Model checking and validity in propositional and modal inclusion logics

Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. By doing so, we come close to finalizing the programme that aims to completely classify the complexities of the basic reasoning problems for modal and propositional dependence, independence and inclusion logics.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Tampere University, Leibniz Universität Hannover, University of Helsinki, Hasselt University
Contributors: Hella, L., Kuusisto, A., Meier, A., Virtema, J.
Number of pages: 26
Pages: 605-630
Publication date: 1 Sep 2019
Peer-reviewed: Yes

Publication information

Journal: JOURNAL OF LOGIC AND COMPUTATION
Volume: 29
Issue number: 5
ISSN (Print): 0955-792X
Ratings: 
  • Scopus rating (2019): CiteScore 2.8 SJR 0.786 SNIP 1.481
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Arts and Humanities (miscellaneous), Hardware and Architecture, Logic
Keywords: complexity, Inclusion logic, model checking, team semantics, validity problem
Source: Scopus
Source ID: 85080893187

Research output: Contribution to journalArticleScientificpeer-review

Hermitian normalized Laplacian matrix for directed networks

In this paper, we extend and generalize the spectral theory of undirected networks towards directed networks by introducing the Hermitian normalized Laplacian matrix for directed networks. In order to start, we discuss the Courant–Fischer theorem for the eigenvalues of Hermitian normalized Laplacian matrix. Based on the Courant–Fischer theorem, we obtain a similar result towards the normalized Laplacian matrix of undirected networks: for each i ∈ {1, 2,…, n}, any eigenvalue of Hermitian normalized Laplacian matrix λ i ∈ [0, 2]. Moreover, we prove some special conditions if 0, or 2 is an eigenvalue of the Hermitian normalized Laplacian matrix L(X). On top of that, we investigate the symmetry of the eigenvalues of L(X)and the edge-version for the eigenvalue interlacing result. Finally we present two expressions for the coefficients of the characteristic polynomial of the Hermitian normalized Laplacian matrix. As an outlook, we sketch some novel and intriguing problems to which our apparatus could generally be applied.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Research group: Predictive Society and Data Analytics (PSDA), Guizhou University of Finance and Economics, University of Applied Sciences Upper Austria, Nankai University, Hall in Tyrol, Institute of Biosciences and Medical Technology
Contributors: Yu, G., Dehmer, M., Emmert-Streib, F., Jodlbauer, H.
Number of pages: 10
Pages: 175-184
Publication date: 1 Aug 2019
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 495
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2019): CiteScore 11.3 SJR 1.723 SNIP 2.688
Original language: English
ASJC Scopus subject areas: Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Characteristic polynomial, Courant–Fischer theorem, Directed networks, Eigenvalue interlacing inequality, Hermitian normalized Laplacian matrix
Source: Scopus
Source ID: 85065248406

Research output: Contribution to journalArticleScientificpeer-review

High-performance SIMD implementation of the lattice-Boltzmann method on the Xeon Phi processor

We present a high-performance implementation of the lattice-Boltzmann method (LBM) on the Knights Landing generation of Xeon Phi. The Knights Landing architecture includes 16GB of high-speed memory (MCDRAM) with a reported bandwidth of over 400 GB/s, and a subset of the AVX-512 single instruction multiple data (SIMD) instruction set. We explain five critical implementation aspects for high performance on this architecture: (1) the choice of appropriate LBM algorithm, (2) suitable data layout, (3) vectorization of the computation, (4) data prefetching, and (5) running our LBM simulations exclusively from the MCDRAM. The effects of these implementation aspects on the computational performance are demonstrated with the lattice-Boltzmann scheme involving the D3Q19 discrete velocity set and the TRT collision operator. In our benchmark simulations of fluid flow through porous media, using double-precision floating-point arithmetic, the observed performance exceeds 960 million fluid lattice site updates per second.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Physics, CSC - IT center for science, Abo Akad Univ, Abo Akademi University, Dept Phys, Jyväskylän yliopisto
Contributors: Robertsén, F., Mattila, K., Westerholm, J.
Number of pages: 16
Publication date: 10 Jul 2019
Peer-reviewed: Yes

Publication information

Journal: Concurrency Computation
Volume: 31
Issue number: 13
Article number: e5072
ISSN (Print): 1532-0626
Ratings: 
  • Scopus rating (2019): CiteScore 3.4 SJR 0.341 SNIP 0.944
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Computer Science Applications, Computer Networks and Communications, Computational Theory and Mathematics
Keywords: Lattice Boltzmann, prefetching, SIMD, Xeon Phi
Source: Scopus
Source ID: 85056764195

Research output: Contribution to journalArticleScientificpeer-review

Analysis of an efficient parallel implementation of active-set Newton algorithm

This paper presents an analysis of an efficient parallel implementation of the active-set Newton algorithm (ASNA), which is used to estimate the nonnegative weights of linear combinations of the atoms in a large-scale dictionary to approximate an observation vector by minimizing the Kullback–Leibler divergence between the observation vector and the approximation. The performance of ASNA has been proved in previous works against other state-of-the-art methods. The implementations analysed in this paper have been developed in C, using parallel programming techniques to obtain a better performance in multicore architectures than the original MATLAB implementation. Also a hardware analysis is performed to check the influence of CPU frequency and number of CPU cores in the different implementations proposed. The new implementations allow ASNA algorithm to tackle real-time problems due to the execution time reduction obtained.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Signal Processing, Research group: Audio research group - ARG, Universitat Politècnica de València
Contributors: San Juan Sebastián, P., Virtanen, T., Garcia-Molla, V. M., Vidal, A. M.
Number of pages: 12
Pages: 1298-1309
Publication date: Mar 2019
Peer-reviewed: Yes
Early online date: 19 May 2018

Publication information

Journal: Journal of Supercomputing
Volume: 75
Issue number: 3
ISSN (Print): 0920-8542
Ratings: 
  • Scopus rating (2019): CiteScore 3.9 SJR 0.432 SNIP 1.181
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Information Systems, Hardware and Architecture
Keywords: Convex optimization, Multicore, Newton algorithm, Parallel computing, Sparse representation
Source: Scopus
Source ID: 85047129085

Research output: Contribution to journalArticleScientificpeer-review

Towards detecting structural branching and cyclicity in graphs: A polynomial-based approach

Structural properties of graphs and networks have been investigated across scientific disciplines ranging from mathematics to structural chemistry. Structural branching, cyclicity and, more generally, connectedness are well-known examples of such properties. In particular, various graph measures for detecting structural branching and cyclicity have been investigated. These measures are of limited applicability since their interpretation relies heavily on a certain definition of structural branching. In this paper we define a related measure, taking an approach to measurement similar to that of Lovász and Pelikán (On the eigenvalues of trees, Periodica Mathematica Hungarica, Vol. 3 (1–2), 1973, 175–182). We define a complex valued polynomial which also has a unique positive root. Analytical and numerical results demonstrate that this measure can be interpreted as a structural branching and cyclicity measure for graphs. Our results generalize the work of Lovász and Pelikán since the measure we introduce is not restricted to trees.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Faculty of Biomedical Sciences and Engineering, Research group: Computational Medicine and Statistical Learning Laboratory (CMSL), Research group: Predictive Society and Data Analytics (PSDA), University of Applied Sciences Upper Austria, Nankai University, Hall in Tyrol, The City College of New York (CUNY), Shandong University at Weihai
Contributors: Dehmer, M., Chen, Z., Emmert-Streib, F., Mowshowitz, A., Shi, Y., Tripathi, S., Zhang, Y.
Number of pages: 10
Pages: 19-28
Publication date: 1 Jan 2019
Peer-reviewed: Yes
Early online date: 29 Aug 2018

Publication information

Journal: Information Sciences
Volume: 471
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2019): CiteScore 11.3 SJR 1.723 SNIP 2.688
Original language: English
ASJC Scopus subject areas: Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Data science, Graphs, Networks, Quantitative graph theory, Structural branching
Source: Scopus
Source ID: 85052883508

Research output: Contribution to journalArticleScientificpeer-review

ALMARVI System Solution for Image and Video Processing in Healthcare, Surveillance and Mobile Applications

ALMARVI is a collaborative European research project funded by Artemis involving 16 industrial as well as academic partners across 4 countries, working together to address various computational challenges in image and video processing in 3 application domains: healthcare, surveillance and mobile. This paper is an editorial for a special issue discussing the integrated system created by the partners to serve as a cross-domain solution for the project. The paper also introduces the partner articles published in this special issue to discuss the various technological developments achieved within ALMARVI spanning all system layers, from hardware to applications. We illustrate the challenges faced within the project based on use cases from the three targeted application domains, and how these can address the 4 main project objectives addressing 4 challenges faced by high performance image and video processing systems: massive data rate, low power consumption, composability and robustness. We present a system stack composed of algorithms, design frameworks and platforms as a solution to these challenges. Finally, the use cases from the three different application domains are mapped on the system stack solution and are evaluated based on their performance for each of the 4 ALMARVI objectives.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, Delft University of Technology, Philips Healthcare Nederland
Contributors: Al-Ars, Z., van der Vlugt, S., Jääskeläinen, P., van der Linden, F.
Pages: 1-7
Publication date: Jan 2019
Peer-reviewed: Yes
Early online date: 2018

Publication information

Journal: Journal of Signal Processing Systems
Volume: 91
Issue number: 1
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2019): CiteScore 2.4 SJR 0.298 SNIP 0.833
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Source: Scopus
Source ID: 85057058836

Research output: Contribution to journalArticleScientificpeer-review

A fun-accuracy trade-off in game-based learning

The present paper illustrates that the game-based implementation of a learning task - here to train basic math skills - entails benefits with strings attached. We developed a game for learning math with its core element based on the number line estimation task. In this task, participants have to indicate the position of a target number on a number-line, which is thought to train basic numerical skills. Participants completed both the game on a mobile device and a conventional paper-pencil version of the task. They indicated to have significantly more fun using the game-based environment. However, they also made considerably higher estimation errors in the game compared to the paper-pencil version. In this case, more fun in a math-learning task was ultimately bought at the expense of lower reliability, namely lowered accuracy of estimations in the learning game. This fun-accuracy trade-off between adding elements for enjoyment and clarity of content is discussed together with the consequences for game-design.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Leibniz-Institut für Wissensmedien, Eberhard-Karls University Tuebingen
Contributors: Greipl, S., Ninaus, M., Bauer, D., Kiili, K., Moeller, K.
Number of pages: 11
Pages: 167-177
Publication date: 2019

Host publication information

Title of host publication: Games and Learning Alliance - 7th International Conference, GALA 2018, Proceedings
Publisher: Springer Verlag
Editors: Söbke, H., Gentile, M., Allegra, M.
ISBN (Print): 9783030115470

Publication series

Name: Lecture Notes in Computer Science
Volume: 11385
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Enjoyment, Game-based learning, Mathematics, Number-line estimation, Reliability, User-experience

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85061364322

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Alternating-time temporal logic ATL with finitely bounded semantics

We study a variant ATLFB of the alternating-time temporal logic ATL with a non-standard, ‘finitely bounded’ semantics (FBS). FBS was originally defined as a game-theoretic semantics where players must commit to time limits when attempting to verify eventuality (respectively, to falsify safety) formulae. It turns out that FBS has a natural corresponding compositional semantics that essentially evaluates formulae only on finite initial segments of paths and imposes uniform bounds on all plays for the fulfilment of eventualities. The resulting version ATLFB differs in some essential features from the standard ATL, as it no longer has the finite model property, though the two logics are equivalent on finite models. We develop two tableau systems for ATLFB. The first one deals with infinite sets of formulae and may run in a transfinite sequence of steps, whereas the second one deals only with finite sets of formulae in an extended language allowing explicit symbolic indication of time limits in formulae. We prove soundness and completeness of the infinitary tableau system and prove that it is equivalent to the finitary one. We also show that the finitary tableau system provides an exponential-time decision procedure for the satisfiability problem of ATLFB and thus establishes its EXPTIME-completeness. Furthermore, we present an infinitary axiomatization for ATLFB and prove its soundness and completeness.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Stockholm University, University of Johannesburg, University of Bremen, Tampere University of Applied Sciences
Contributors: Goranko, V., Kuusisto, A., Rönnholm, R.
Publication date: 2019
Peer-reviewed: Yes

Publication information

Journal: Theoretical Computer Science
ISSN (Print): 0304-3975
Ratings: 
  • Scopus rating (2019): CiteScore 2.3 SJR 0.57 SNIP 1.104
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Alternating-time temporal logic, Axiomatization, Completeness, Decidability, Finitely bounded semantics, Tableaux

Bibliographical note

dupl=49136187

Source: Scopus
Source ID: 85068448060

Research output: Contribution to journalArticleScientificpeer-review

An Accurate Approximation of Resource Request Distributions in Millimeter Wave 3GPP New Radio Systems

The recently standardized millimeter wave-based 3GPP New Radio technology is expected to become an enabler for both enhanced Mobile Broadband (eMBB) and ultra-reliable low latency communication (URLLC) services specified to future 5G systems. One of the first steps in mathematical modeling of such systems is the characterization of the session resource request probability mass function (pmf) as a function of the channel conditions, cell size, application demands, user location and system parameters including modulation and coding schemes employed at the air interface. Unfortunately, this pmf cannot be expressed via elementary functions. In this paper, we develop an accurate approximation of the sought pmf. First, we show that Normal distribution provides a fairly accurate approximation to the cumulative distribution function (CDF) of the signal-to-noise ratio for communication systems operating in the millimeter frequency band, further allowing evaluating the resource request pmf via error function. We also investigate the impact of shadow fading on the resource request pmf.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Peoples’ Friendship University of Russia, Federal Research Center Computer Science and Control of the Russian Academy of Sciences
Contributors: Kovalchukov, R., Moltchanov, D., Gaidamaka, Y., Bobrikova, E.
Number of pages: 14
Pages: 572-585
Publication date: 2019

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 19th International Conference, NEW2AN 2019, and 12th Conference, ruSMART 2019, Proceedings
Publisher: Springer Verlag
Editors: Galinina, O., Andreev, S., Koucheryavy, Y., Balandin, S.
ISBN (Print): 9783030308582

Publication series

Name: Lecture Notes in Computer Science
Volume: 11660
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 5G, Millimeter-wave, New Radio, Performance evaluation, Shadow fading, SNR

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85072953365

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Autonomous UAV Landing on a Moving Vessel: Localization Challenges and Implementation Framework

The number of Unmanned Aerial Vehicle (UAV) applications is growing tremendously. The most critical ones are operations in use cases such as natural disasters, and search and rescue activities. Many of these operations are performed on water scenarios. A standalone niche covering autonomous UAV operation is thus becoming increasingly important. One of the crucial parts of mentioned operations is a technology capable to land an autonomous UAV on a moving surface vessel. This approach could not be entirely possible without precise UAV positioning. However, conventional strategies that rely on satellite localization may not always be reliable, due to scenario specifics. Therefore, the development of an independent precise landing technology is essential. In this paper, we developed the localization and landing system based on Gauss-Newton’s method, which allows to achieve the required localization accuracy.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Nokia Technologies, Peoples’ Friendship University of Russia, Tampere University, Brno University of Technology
Contributors: Castillo, C., Pyattaev, A., Villa, J., Masek, P., Moltchanov, D., Ometov, A.
Number of pages: 13
Pages: 342-354
Publication date: 2019

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 19th International Conference, NEW2AN 2019, and 12th Conference, ruSMART 2019, Proceedings
Publisher: Springer Verlag
Editors: Galinina, O., Andreev, S., Koucheryavy, Y., Balandin, S.
ISBN (Print): 9783030308582

Publication series

Name: Lecture Notes in Computer Science
Volume: 11660
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Automatic landing, Positioning, Simulation, UAV
URLs: 

Bibliographical note

jufoid=62555
EXT="Pyattaev, Alexander"

Source: Scopus
Source ID: 85072950164

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Characterizing the Degree of LTE Involvement in Supporting Session Continuity in Street Deployment of NR Systems

The prospective roll out of recently standardized New Radio (NR) systems operating in millimeter wave frequency band pose unique challenges to network engineers. In this context, the support of NR-based vehicle-to-infrastructure communications is of special interest due to potentially high speeds of user equipment and semi-stochastic dynamic blockage conditions of propagation paths between UE and BR base station (BS). In this conditions even the use of advanced NR functionalities such as multiconnectivity supporting active connections to multiple BSs located nearby may not fully eliminate outages. Thus, to preserve session continuity for UEs located on vehicles a degree of LTE support might be required. In this paper, we quantify the amount of LTE support required to maintain session continuity in street deployment of NR systems supporting multiconnectivity capabilities. Particularly, we demonstrate that it is heavily affected by the traffic conditions, inter-site distance between NR BSs and the degree of multiconnectivity.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Peoples’ Friendship University of Russia, Federal Research Center Computer Science and Control of the Russian Academy of Sciences
Contributors: Begishev, V., Samuylov, A., Moltchanov, D., Samouylov, K.
Number of pages: 13
Pages: 71-83
Publication date: 2019

Host publication information

Title of host publication: Distributed Computer and Communication Networks - 22nd International Conference, DCCN 2019, Revised Selected Papers
Publisher: Springer
Editors: Vishnevskiy, V. M., Kozyrev, D. V., Samouylov, K. E., Kozyrev, D. V.
ISBN (Print): 9783030366131

Publication series

Name: Lecture Notes in Computer Science
Volume: 11965
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Blockage, LTE support, Millimeter wave, Multiconnectivity, New Radio, Outage, Street deployment

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85077500431

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Communicating User Insights with Travel Mindsets and Experience Personas in Intra-city Bus Context

Design of attractive services for the bus travel context is important because of the aim to increase the usage of sustainable travel modes of public transportation. In bus travel, both user experience of the digital services and the broader service design context of the public transportation need to be addressed. Experience-Driven Design (EDD) can be used to take the passengers’ needs and experiences in the core of the design process. This paper presents a qualitative diary and interview study on bus travel experience with 20 passengers in two major cities in Finland. The aim of this study was to identify and communicate frequent bus passengers’ needs, experiences, values and activities as user insights to support experience-driven service design in the public transportation context. Based on the data analysis, we derived ten Travel Mindsets: Abstracted, Efficient, Enjoyer, In-control, Isolation, Observer, Off-line, Relaxed, Sensitive, and Social. To communicate the study findings on bus passengers’ travel experience, Travel Experience Personas were created. The personas include primary and secondary travel mindsets, specific needs related to bus travel, insights on mobile device usage, and target user experience (UX) goals that could enhance the personas’ travel experience. We also discuss how the personas can be used as a communicative design tool that supports EDD of novel services in the bus context.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Research area: User experience
Contributors: Hildén, E., Väänänen, K.
Number of pages: 19
Pages: 34-52
Publication date: 2019

Host publication information

Title of host publication: Human-Computer Interaction – INTERACT 2019 - 17th IFIP TC 13 International Conference, Proceedings
Publisher: Springer Verlag
Editors: Lamas, D., Loizides, F., Nacke, L., Petrie, H., Winckler, M., Zaphiris, P.
ISBN (Print): 9783030293895

Publication series

Name: Lecture Notes in Computer Science
Volume: 11749
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Bus, Design tool, Experience-Driven Design, Mindset, Persona, Travel experience, User experience (UX), UX goal
Source: Scopus
Source ID: 85072957290

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Digital Predistortion for 5G Small Cell: GPU Implementation and RF Measurements

In this paper, we present a high data rate implementation of a digital predistortion (DPD) algorithm on a modern mobile multicore CPU containing an on-chip GPU. The proposed implementation is capable of running in real-time, thanks to the execution of the predistortion stage inside the GPU, and the execution of the learning stage on a separate CPU core. This configuration, combined with the low complexity DPD design, allows for more than 400 Msamples/s sample rates. This is sufficient for satisfying 5G new radio (NR) base station radio transmission specifications in the sub-6 GHz bands, where signal bandwidths up to 100 MHz are specified. The linearization performance is validated with RF measurements on two base station power amplifiers at 3.7 GHz, showing that the 5G NR downlink emission requirements are satisfied.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Electrical Engineering, Computing Sciences, Research area: Computer engineering, Research group: Wireless Communications and Positioning, University of Vaasa (UVA), Tampere University
Contributors: Pascual Campo, P., Lampu, V., Meirhaeghe, A., Boutellier, J., Anttila, L., Valkama, M.
Number of pages: 12
Publication date: 2019
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2019): CiteScore 2.4 SJR 0.298 SNIP 0.833
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: 5G, Digital predistortion (DPD), GPU, High data rate, Real-time

Bibliographical note

INT=comp,"Meirhaeghe, Alexandre"

Source: Scopus
Source ID: 85077054281

Research output: Contribution to journalArticleScientificpeer-review

Emptiness problems for distributed automata

We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite sequence of synchronous rounds. The problem is shown to be decidable in LOGSPACE for a class of forgetful automata, where the nodes see the messages received from their neighbors but cannot remember their own state. When restricted to the appropriate families of graphs, these forgetful automata are equivalent to classical finite word automata, but strictly more expressive than finite tree automata. On the other hand, we also show that the emptiness problem is undecidable in general. This already holds for two heavily restricted classes of distributed automata: those that reject immediately if they receive more than one message per round, and those whose state diagram must be acyclic except for self-loops. Additionally, to demonstrate the flexibility of distributed automata in simulating different models of computation, we provide a characterization of constraint satisfaction problems by identifying a class of automata with exactly the same computational power.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, Helsinki University, UPEM
Contributors: Kuusisto, A., Reiter, F.
Publication date: 2019
Peer-reviewed: Yes

Publication information

Journal: Information and Computation
Article number: 104503
ISSN (Print): 0890-5401
Ratings: 
  • Scopus rating (2019): CiteScore 2.7 SJR 0.573 SNIP 1.203
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Information Systems, Computer Science Applications, Computational Theory and Mathematics
Keywords: Distributed computing, Emptiness problem, Finite automata
Source: Scopus
Source ID: 85076991997

Research output: Contribution to journalArticleScientificpeer-review

Evaluating multi-connectivity in 5G NR systems with mixture of unicast and multicast traffic

The future 5G New Radio (NR) systems are expected to support both multicast and unicast traffic. However, these traffic types require principally different NR system parameters. Particularly, the area covered by a single antenna configuration needs to be maximized when serving multicast traffic to efficiently use system resources. This prevents the system from using the maximum allowed number of antenna elements decreasing the inter-site distance between NR base stations. In this paper, we formulate a model of NR system with multi-connectivity capability serving a mixture of unicast and multicast traffic types. We show that multi-connectivity enables a trade-off between new and ongoing session drop probabilities for both unicast and multicast traffic types. Furthermore, supporting just two simultaneously active links allows to exploit most of the gains and the value of adding additional links is negligible. We also show that the service specifics implicitly prioritize multicast sessions over unicast ones. If one needs to achieve a balance between unicast and multicast session drop probabilities, explicit prioritization mechanism is needed at NR base stations.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Peoples’ Friendship University of Russia
Contributors: Kovalchukov, R., Moltchanov, D., Pyattaev, A., Ometov, A.
Number of pages: 11
Pages: 118-128
Publication date: 2019

Host publication information

Title of host publication: Wired/Wireless Internet Communications - 17th IFIP WG 6.2 International Conference, WWIC 2019, Proceedings
Publisher: Springer Verlag
Editors: Di Felice, M., Natalizio, E., Bruno, R., Kassler, A.
ISBN (Print): 9783030305222

Publication series

Name: Lecture Notes in Computer Science
Volume: 11618
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 5G cellular systems, Multi-connectivity, Multicasting, New Radio, Resource utilization, Session drop probabilities

Bibliographical note

EXT="Pyattaev, Alexander"
jufoid=62555

Source: Scopus
Source ID: 85072869809

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Extending a digital fraction game piece by piece with physical manipulatives

This paper reports results from an ongoing project that aims to develop a digital game for introducing fractions to young children. In the current study, third-graders played the Number Trace Fractions prototype in which they estimated fraction locations and compared fraction magnitudes on a number line. The intervention consisted of five 30 min playing sessions. Conceptual fraction knowledge was assessed with a paper based pre- and posttest. Additionally, after the intervention students’ fraction comparison strategies were explored with game-based comparison tasks including self-explanation prompts. The results support previous findings indicating that game-based interventions emphasizing fraction magnitudes improve students’ performance in conceptual fraction tasks. Nevertheless, the results revealed that in spite of clear improvement many students tended to use false fraction magnitude comparison strategies after the intervention. It seems that the game mechanics and the feedback that the game provided did not support conceptual change processes of students with low prior knowledge well enough and common fraction misconceptions still existed. Based on these findings we further developed the game and extended it with physical manipulatives. The aim of this extension is to help students to overcome misconceptions about fraction magnitude by physically interacting with manipulatives.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Leibniz-Institut für Wissensmedien, Eberhard-Karls University Tuebingen
Contributors: Kiili, K., Koskinen, A., Lindstedt, A., Ninaus, M.
Number of pages: 10
Pages: 157-166
Publication date: 2019

Host publication information

Title of host publication: Games and Learning Alliance - 7th International Conference, GALA 2018, Proceedings
Publisher: Springer Verlag
Editors: Söbke, H., Gentile, M., Allegra, M.
ISBN (Print): 9783030115470

Publication series

Name: Lecture Notes in Computer Science
Volume: 11385
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Conceptual change, Fraction, Game-based learning, Manipulatives, Mathematics, Number line, Serious games

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85061384605

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Graph-boosted attentive network for semantic body parsing

Human body parsing remains a challenging problem in natural scenes due to multi-instance and inter-part semantic confusions as well as occlusions. This paper proposes a novel approach to decomposing multiple human bodies into semantic part regions in unconstrained environments. Specifically we propose a convolutional neural network (CNN) architecture which comprises of novel semantic and contour attention mechanisms across feature hierarchy to resolve the semantic ambiguities and boundary localization issues related to semantic body parsing. We further propose to encode estimated pose as higher-level contextual information which is combined with local semantic cues in a novel graphical model in a principled manner. In this proposed model, the lower-level semantic cues can be recursively updated by propagating higher-level contextual information from estimated pose and vice versa across the graph, so as to alleviate erroneous pose information and pixel level predictions. We further propose an optimization technique to efficiently derive the solutions. Our proposed method achieves the state-of-art results on the challenging Pascal Person-Part dataset.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Nokia Technologies
Contributors: Wang, T., Wang, H.
Pages: 267-280
Publication date: 2019

Host publication information

Title of host publication: Artificial Neural Networks and Machine Learning – ICANN 2019 : Image Processing - 28th International Conference on Artificial Neural Networks, 2019, Proceedings
Publisher: Springer Verlag
Editors: Tetko, I. V., Karpov, P., Theis, F., Kurková, V.
ISBN (Print): 9783030305079

Publication series

Name: Lecture Notes in Computer Science
Volume: 11729
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85072866839

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Institutional Perspectives on the Process of Enterprise Architecture Adoption

Organizations often adopt enterprise architecture (EA) when planning how best to develop their information technology (IT) or businesses, for strategic management, or generally for managing change initiatives. This variety of different uses affects many stakeholders within and between organizations. Because stakeholders have dissimilar backgrounds, positions, assumptions, and activities, they respond differently to changes and the potential problems that emerge from those changes. This situation creates contradictions and conflicts between stakeholders that may further influence project activities and ultimately determine how EA is adopted. In this paper, we examine how institutional pressures influence EA adoption. Based on a qualitative case study of two cases, we show how regulative, normative, and cognitive pressures influence stakeholders’ activities and behaviors during the process of EA adoption. Our contribution thus lies in identifying roles of institutional pressures in different phases during the process of EA adoption and how it changes overtime. The results provide insights into EA adoption and the process of institutionalization, which help to explain emergent challenges in EA adoption.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Information and Knowledge Management, Research group: Business Data Research Group, University of Vaasa (UVA)
Contributors: Dang, D., Pekkola, S.
Publication date: 2019
Peer-reviewed: Yes

Publication information

Journal: Information Systems Frontiers
ISSN (Print): 1387-3326
Ratings: 
  • Scopus rating (2019): CiteScore 6.7 SJR 1.02 SNIP 1.926
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Information Systems, Computer Networks and Communications
Keywords: EA adoption, Enterprise architecture, Institutional theory, Institutionalization process

Bibliographical note

EXT="Dang, Duong"

Source: Scopus
Source ID: 85069739091

Research output: Contribution to journalArticleScientificpeer-review

Large-Scale Centralized Scheduling of Short-Range Wireless Links

In 5G networks we expect femtocells, mmWave and D2D communications to take over the more typical long-range cellular architectures with pre-planned radio resources. However, as the connection length between the nodes become shorter, locating feasible, non-interfering combinations of the links becomes more and more difficult. In this paper a new approach to this problem is presented. In particular, through guided heuristic search, it is possible to locate non-interfering combinations of wireless connections in a highly effective manner. The approach enables operators to deploy centralized scheduling solutions for emerging technologies such as network-assisted WiFi-Direct and LTE Direct, and others, especially those which lack efficient medium arbitration mechanisms.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Peoples’ Friendship University of Russia
Contributors: Pyattaev, A., Gerasimenko, M.
Number of pages: 9
Pages: 607-615
Publication date: 2019

Host publication information

Title of host publication: Distributed Computer and Communication Networks - 22nd International Conference, DCCN 2019, Revised Selected Papers
Publisher: Springer
Editors: Vishnevskiy, V. M., Kozyrev, D. V., Samouylov, K. E., Kozyrev, D. V.
ISBN (Print): 9783030366131

Publication series

Name: Lecture Notes in Computer Science
Volume: 11965
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

EXT="Pyattaev, Alexander"

Source: Scopus
Source ID: 85077490909

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Learning Image-to-Image Translation Using Paired and Unpaired Training Samples

Image-to-image translation is a general name for a task where an image from one domain is converted to a corresponding image in another domain, given sufficient training data. Traditionally different approaches have been proposed depending on whether aligned image pairs or two sets of (unaligned) examples from both domains are available for training. While paired training samples might be difficult to obtain, the unpaired setup leads to a highly under-constrained problem and inferior results. In this paper, we propose a new general purpose image-to-image translation model that is able to utilize both paired and unpaired training data simultaneously. We compare our method with two strong baselines and obtain both qualitatively and quantitatively improved results. Our model outperforms the baselines also in the case of purely paired and unpaired training data. To our knowledge, this is the first work to consider such hybrid setup in image-to-image translation.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Aalto University
Contributors: Tripathy, S., Kannala, J., Rahtu, E.
Number of pages: 16
Pages: 51-66
Publication date: 2019

Host publication information

Title of host publication: Computer Vision - ACCV 2018 - 14th Asian Conference on Computer Vision, Revised Selected Papers
Publisher: Springer Verlag
Editors: Jawahar, C., Schindler, K., Mori, G., Li, H.
ISBN (Print): 9783030208899

Publication series

Name: Lecture Notes in Computer Science
Volume: 11362
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85067340886

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Lifelong learning with a digital math game: Performance and basic experience differences across age

Gaming is acknowledged as a natural way of learning and established as a mainstream activity. Nevertheless, gaming performance and subjective game experience were hardly examined across adult age groups for which the game was not intended to. In contrast to serious games as specific tools against a natural, age-related decline in cognitive performance, we evaluated performance and subjective experiences of the established math learning game Semideus across three age groups from 19 to 79. Observed decline in performance in terms of processing speed were not exclusively predicted by age, but also by gaming frequency. Strongest age-related drops of processing speed were found for the middle-aged group aged 35 to 59 years. On the other hand, more knowledge-dependent performance measures like the amount of correctly solved problems remained comparably stable. According to subjective ratings, the middle-aged group experienced the game as less fluent and automatic compared to the younger and older groups. Additionally, the elderly group of participants reported fewer negative attitudes towards technology than both younger groups. We conclude that, albeit performance differences with respect to processing speed, subjective gaming experience stayed on an overall high positive level. This further encourages the use of games for learning across age.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Education, Leibniz-Institut für Wissensmedien, Eberhard-Karls University Tuebingen
Contributors: Greipl, S., Moeller, K., Kiili, K., Ninaus, M.
Number of pages: 11
Pages: 301-311
Publication date: 2019

Host publication information

Title of host publication: Games and Learning Alliance- 8th International Conference, GALA 2019, Proceedings
Publisher: Springer
Editors: Liapis, A., Yannakakis, G. N., Gentile, M., Ninaus, M.
ISBN (Print): 9783030343491

Publication series

Name: Lecture Notes in Computer Science
Volume: 11899
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Applicability, Elderly, Game-based learning, Life-long learning, Number-line estimation, Reliability, User-experience

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85082506812

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Maximizing Achievable Data Rate in Unlicensed mmWave Networks with Mobile Clients

In millimeter-wave (mmWave) networks, where faster signal attenuation is compensated by the use of highly directional antennas, the effects of high mobility may seriously harm the link quality and, hence, the overall system performance. In this paper, we study the channel access in unlicensed mmWave networks with mobile clients, with particular emphasis on initial beamforming training and beam refinement protocol as per IEEE 802.11ad/ay standard. We explicitly model beamforming procedures and corresponding overhead for directional mmWave antennas and provide a method for maximizing the average data rate over the variable length of the 802.11ad/ay beacon interval in different mobility scenarios. We illustrate the impact of the client speed and mobility patterns by examples of three variations of the discrete random walk mobility model.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Federal Research Center Computer Science and Control of the Russian Academy of Sciences, Peoples’ Friendship University of Russia
Contributors: Chukhno, N., Chukhno, O., Shorgin, S., Samouylov, K., Galinina, O., Gaidamaka, Y.
Number of pages: 13
Pages: 282-294
Publication date: 2019

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 19th International Conference, NEW2AN 2019, and 12th Conference, ruSMART 2019, Proceedings
Publisher: Springer Verlag
Editors: Galinina, O., Andreev, S., Koucheryavy, Y., Balandin, S.
ISBN (Print): 9783030308582

Publication series

Name: Lecture Notes in Computer Science
Volume: 11660
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 802.11ad/ay, Beamforming, Channel access, mmWave, Mobility, Random walk
Electronic versions: 
URLs: 

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85072982692

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

MicroSCOPE: Enabling access control in searchable encryption with the use of attribute-based encryption and SGX

Secure cloud storage is considered as one of the most important problems that both businesses and end-users take into account before moving their private data to the cloud. Lately, we have seen some interesting approaches that are based either on the promising concept of Symmetric Searchable Encryption (SSE) or on the well-studied field of Attribute-Based Encryption (ABE). Our construction, MicroSCOPE, combines both ABE and SSE to utilize the advantages of each technique. Finally, we enhance our construction with an access control mechanism by utilizing the functionality provided by SGX.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, University of Westminster
Contributors: Michalas, A., Bakas, A., Dang, H. V., Zalitko, A.
Number of pages: 17
Pages: 254-270
Publication date: 2019

Host publication information

Title of host publication: Secure IT Systems - 24th Nordic Conference, NordSec 2019, Proceedings
Publisher: Springer
Editors: Askarov, A., Hansen, R. R., Rafnsson, W.
ISBN (Print): 9783030350543

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11875 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Access control, Attribute-Based Encryption, Cloud security, Hybrid encryption, Policies, Storage protection, Symmetric Searchable Encryption
Source: Scopus
Source ID: 85076284928

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

MLAttack: Fooling Semantic Segmentation Networks by Multi-layer Attacks

Despite the immense success of deep neural networks, their applicability is limited because they can be fooled by adversarial examples, which are generated by adding visually imperceptible and structured perturbations to the original image. Semantic segmentation is required in several visual recognition tasks, but unlike image classification, only a few studies are available for attacking semantic segmentation networks. The existing semantic segmentation adversarial attacks employ different gradient based loss functions which are defined using only the last layer of the network for gradient backpropogation. But some components of semantic segmentation networks implicitly mitigate several adversarial attacks (like multiscale analysis) due to which the existing attacks perform poorly. This provides us the motivation to introduce a new attack in this paper known as MLAttack, i.e., Multiple Layers Attack. It carefully selects several layers and use them to define a loss function for gradient based adversarial attack on semantic segmentation architectures. Experiments conducted on publicly available dataset using the state-of-the-art segmentation network architectures, demonstrate that MLAttack performs better than existing state-of-the-art semantic segmentation attacks.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Research group: Artificial Intelligence and Vision - AIV, IIT Indore
Contributors: Gupta, P., Rahtu, E.
Number of pages: 13
Pages: 401-413
Publication date: 2019

Host publication information

Title of host publication: Pattern Recognition - 41st DAGM German Conference, DAGM GCPR 2019, Proceedings
Publisher: Springer
Editors: Fink, G. A., Frintrop, S., Jiang, X.
ISBN (Print): 9783030336752

Publication series

Name: Lecture Notes in Computer Science
Volume: 11824 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

EXT="Gupta, Puneet"

Source: Scopus
Source ID: 85076181547

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Multi-level Architecture for P2P Services in Mobile Networks

Latency is an important metric of mobile applications performance. To reduce the latency, recently it was proposed to replace the standard centralized architecture of mobile applications by the mobile edge computing (MEC). Such an approach allows processing of users data closer to their location. Motivated by disaster response scenarios, in this paper we investigated the capabilities of MEC for the forwarding of first aid request as an illustrative example of P2P service discovery in an emergency situation. We proposed an analytical model of the system and executed performance evaluation using system level simulator. Our results show that the developed solution considerably reduces the request processing time. The proposed solution can be used not only for first aid but also for general purposes, e.g., searching various service providers in a certain location.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Peoples’ Friendship University of Russia, St. Petersburg State University of Telecommunication, Saint-Petersburg State Pediatric Medical University
Contributors: Pirmagomedov, R., Ahmed, A. A., Glushakov, R.
Number of pages: 9
Pages: 415-423
Publication date: 2019

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 19th International Conference, NEW2AN 2019, and 12th Conference, ruSMART 2019, Proceedings
Publisher: Springer Verlag
Editors: Galinina, O., Andreev, S., Koucheryavy, Y., Balandin, S.
ISBN (Print): 9783030308582

Publication series

Name: Lecture Notes in Computer Science
Volume: 11660
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Edge computing, eHealth, Mobile networks, P2P

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85072967405

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Near Lossless JPEG Compression Based on Masking Effect of Non-predictable Energy of Image Regions

This paper studies near lossless JPEG image compression. A method of estimation of image regions masking ability (maximal level of distortions invisible for human visual system) using non-predictable energy of image regions is described. A novel method of zeroing quantized DCT coefficients of JPEG images to increase their compression ratio without introducing visible distortions is proposed. A numerical analysis of effectiveness of the proposed near lossless compression method using 300 noise free test images of TAMPERE17 database is carried out. It is shown that the proposed method provides an increase of compression ratio of JPEG images without visible distortions at about 1.35 times in average. Additionally, the proposed method results in decreasing of variability of compression ratio values for different images. It is shown that the proposed method increases minimal compression ratio for highly textured JPEG images from 1.1…1.5 times to 2 times. Carried out experiments demonstrated once again that the traditional PSNR metric does not correspond to human perception for this task.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences
Contributors: Ponomarenko, M., Egiazarian, K.
Number of pages: 11
Pages: 173-183
Publication date: 2019

Host publication information

Title of host publication: Image Analysis - 21st Scandinavian Conference, SCIA 2019, Proceedings
Publisher: Springer Verlag
Editors: Felsberg, M., Forssén, P., Unger, J., Sintorn, I.
ISBN (Print): 9783030202040

Publication series

Name: Lecture Notes in Computer Science
Volume: 11482
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Human visual system, JPEG, Lossy image compression, Masking effect, Near lossless image compression

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85066916524

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Non-parametric contextual relationship learning for semantic video object segmentation

We propose a novel approach for modeling semantic contextual relationships in videos. This graph-based model enables the learning and propagation of higher-level spatial-temporal contexts to facilitate the semantic labeling of local regions. We introduce an exemplar-based nonparametric view of contextual cues, where the inherent relationships implied by object hypotheses are encoded on a similarity graph of regions. Contextual relationships learning and propagation are performed to estimate the pairwise contexts between all pairs of unlabeled local regions. Our algorithm integrates the learned contexts into a Conditional Random Field (CRF) in the form of pairwise potentials and infers the per-region semantic labels. We evaluate our approach on the challenging YouTube-Objects dataset which shows that the proposed contextual relationship model outperforms the state-of-the-art methods.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Nokia Technologies
Contributors: Wang, T., Wang, H.
Number of pages: 9
Pages: 325-333
Publication date: 2019

Host publication information

Title of host publication: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 23rd Iberoamerican Congress, CIARP 2018, Proceedings
Publisher: Springer Verlag
Editors: Vera-Rodriguez, R., Fierrez, J., Morales, A.
ISBN (Print): 9783030134686

Publication series

Name: Lecture Notes in Computer Science
Volume: 11401
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85063060358

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

On the web platform cornucopia

The evolution of the Web browser has been organic, with new features introduced on a pragmatic basis rather than following a clear rational design. This evolution has resulted in a cornucopia of overlapping features and redundant choices for developing Web applications. These choices include multiple architecture and rendering models, different communication primitives and protocols, and a variety of local storage mechanisms. In this position paper we examine the underlying reasons for this historic evolution. We argue that without a sound engineering approach and some fundamental rethinking there will be a growing risk that the Web may no longer be a viable, open software platform in the long run.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, University of Helsinki, Università della Svizzera Italiana, Nokia Technologies
Contributors: Mikkonen, T., Pautasso, C., Systä, K., Taivalsaari, A.
Number of pages: 9
Pages: 347-355
Publication date: 2019

Host publication information

Title of host publication: Web Engineering - 19th International Conference, ICWE 2019, Proceedings
Publisher: Springer Verlag
Editors: Bakaev, M., Ko, I., Frasincar, F.
ISBN (Print): 9783030192730

Publication series

Name: Lecture Notes in Computer Science
Volume: 11496
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: HTML5, Progressive Web applications, Software engineering principles, Technology design space, Web engineering, Web platform

Bibliographical note

EXT="Mikkonen, Tommi"
jufoid=62555
EXT="Taivalsaari, Antero"

Source: Scopus
Source ID: 85065497369

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Patterns for functional safety system development

Functional safety is involved in many machines, processes, and systems to mitigate risks by reducing the likelihood of the occurrence or the severity of the consequences of a hazard. The development of functional safety systems realising safety functions is typically directed by laws and standards, which set requirements on the development process and design of the system. In addition, functional safety systems often operate in a context, in which other control entities also affect the operation of the system under control. In this article, nine patterns considering the design and development functional safety systems, in terms of their architecture and co-operation with other controlling entities, are presented. The purpose of the patterns is to support the designers of functional safety systems to cope with the mentioned aspects.

General information

Publication status: Published
MoE publication type: A3 Part of a book or another research book
Organisations: Automation Technology and Mechanical Engineering
Contributors: Rauhamäki, J.
Number of pages: 39
Pages: 100-138
Publication date: 2019

Host publication information

Title of host publication: Transactions on Pattern Languages of Programming IV
Publisher: Springer Verlag
ISBN (Print): 978-3-030-14290-2
ISBN (Electronic): 978-3-030-14291-9

Publication series

Name: Lecture Notes in Computer Science
Volume: 10600
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Architecture, Control, Pattern, Safety function, Safety-related

Bibliographical note

jufoid=81923

Source: Scopus
Source ID: 85063145577

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Patterns for light-weight fault tolerance and decoupled design in distributed control systems

Distributed control systems comprise networked computing units that monitor and control physical processes in feedback loops. Reliability of these systems is affected by dynamic and complex computing environments where connections and system configurations may change rapidly. Diverse redundancy can be effective in improving system dependability, but it is susceptible to common mode failures and development costs for design diversity are often seen as prohibitive. In this paper we present three patterns that can be used to provide light-weight form of fault tolerance to improve system dependability and resilience by providing ability to cope with unexpected events and faults. These patterns are presented together with a pattern language that shows how they relate to other fault tolerance patterns.

General information

Publication status: Published
MoE publication type: A3 Part of a book or another research book
Organisations: Automation Technology and Mechanical Engineering
Contributors: Alho, P., Rauhamäki, J.
Number of pages: 21
Pages: 1-21
Publication date: 2019

Host publication information

Title of host publication: Transactions on Pattern Languages of Programming IV
Publisher: Springer Verlag
ISBN (Print): 978-3-030-14290-2
ISBN (Electronic): 978-3-030-14291-9

Publication series

Name: Lecture Notes in Computer Science
Volume: 10600
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Dependability, Distributed systems, Fault tolerance, Real-time systems, Reliability

Bibliographical note

jufoid=81923

Source: Scopus
Source ID: 85063141009

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Performance of mmwave-based mesh networks in indoor environments with dynamic blockage

Due to growing throughput demands dictated by innovative media applications (e.g., 360°) video streaming, augmented and virtual reality), millimeter-wave (mmWave) wireless access is considered to be a promising technology enabler for the emerging mobile networks. One of the crucial usages for such systems is indoor public protection and disaster relief (PPDR) missions, which may greatly benefit from higher mmWave bandwidths. In this paper, we assess the performance of on-demand mmWave mesh topologies in indoor environments. The evaluation was conducted by utilizing our system-level simulation framework based on a realistic floor layout under dynamic blockage conditions, 3GPP propagation model, mobile nodes, and multi-connectivity operation. Our numerical results revealed that the use of multi-connectivity capabilities in indoor deployments allows for generally improved connectivity performance whereas the associated per-node throughput growth is marginal. The latter is due to the blockage-rich environment, which is typical for indoor layouts as it distinguishes these from outdoor cases. Furthermore, the number of simultaneously supported links at each node that is required to enhance the system performance is greater than two, thus imposing considerable control overheads.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Peoples’ Friendship University of Russia, St. Petersburg State University of Telecommunication, Tampere University
Contributors: Pirmagomedov, R., Moltchanov, D., Ustinov, V., Saqib, M. N., Andreev, S.
Number of pages: 12
Pages: 129-140
Publication date: 2019

Host publication information

Title of host publication: Wired/Wireless Internet Communications - 17th IFIP WG 6.2 International Conference, WWIC 2019, Proceedings
Publisher: Springer Verlag
Editors: Di Felice, M., Natalizio, E., Bruno, R., Kassler, A.
ISBN (Print): 9783030305222

Publication series

Name: Lecture Notes in Computer Science
Volume: 11618
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 5G NR, Emergency response, Indoor environment, Milliliter-wave mesh, PPDR

Bibliographical note

INT=elen,"Saqib, Md Nazmus"
jufoid=62555

Source: Scopus
Source ID: 85072874329

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Predicting Novel Views Using Generative Adversarial Query Network

The problem of predicting a novel view of the scene using an arbitrary number of observations is a challenging problem for computers as well as for humans. This paper introduces the Generative Adversarial Query Network (GAQN), a general learning framework for novel view synthesis that combines Generative Query Network (GQN) and Generative Adversarial Networks (GANs). The conventional GQN encodes input views into a latent representation that is used to generate a new view through a recurrent variational decoder. The proposed GAQN builds on this work by adding two novel aspects: First, we extend the current GQN architecture with an adversarial loss function for improving the visual quality and convergence speed. Second, we introduce a feature-matching loss function for stabilizing the training procedure. The experiments demonstrate that GAQN is able to produce high-quality results and faster convergence compared to the conventional approach.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, University of Oulu
Contributors: Nguyen-Ha, P., Huynh, L., Rahtu, E., Heikkilä, J.
Number of pages: 12
Pages: 16-27
Publication date: 2019

Host publication information

Title of host publication: Image Analysis - 21st Scandinavian Conference, SCIA 2019, Proceedings
Publisher: Springer Verlag
Editors: Felsberg, M., Forssén, P., Unger, J., Sintorn, I.
ISBN (Print): 9783030202040

Publication series

Name: Lecture Notes in Computer Science
Volume: 11482
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Generative Adversarial Query Network, Mean feature matching loss, Novel view synthesis

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85066899709

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Ray-Based Modeling of Unlicensed-Band mmWave Propagation Inside a City Bus

In the wake of recent hardware developments, augmented, mixed, and virtual reality applications – grouped under an umbrella term of eXtended reality (XR) – are believed to have a transformative effect on customer experience. Among many XR use cases, of particular interest are crowded commuting scenarios, in which passengers are involved in in-bus/in-train entertainment, e.g., high-quality video or 3D hologram streaming and AR/VR gaming. In the case of a city bus, the number of commuting users during the busy hours may exceed forty, and, hence, could pose far higher traffic demands than the existing microwave technologies can support. Consequently, the carrier candidate for XR hardware should be sought in the millimeter-wave (mmWave) spectrum; however, the use of mmWave cellular frequencies may appear impractical due to the severe attenuation or blockage by the modern metal coating of the glass. As a result, intra-vehicle deployment of unlicensed mmWave access points becomes the most promising solution for bandwidth-hungry XR devices. In this paper, we present the calibrated results of shooting-and-bouncing ray simulation at 60 GHz for the bus interior. We analyze the delay and angular spread, estimate the parameters of the Saleh-Valenzuela channel model, and draw important practical conclusions regarding the intra-vehicle propagation at 60 GHz.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electrical Engineering, Tampere University
Contributors: Ponomarenko-Timofeev, A., Ometov, A., Galinina, O.
Number of pages: 13
Pages: 269-281
Publication date: 2019

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 19th International Conference, NEW2AN 2019, and 12th Conference, ruSMART 2019, Proceedings
Publisher: Springer Verlag
Editors: Galinina, O., Andreev, S., Koucheryavy, Y., Balandin, S.
ISBN (Print): 9783030308582

Publication series

Name: Lecture Notes in Computer Science
Volume: 11660
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Channel model, Intra-vehicular, mmWave, SBR, Wearables
Electronic versions: 
URLs: 

Bibliographical note

INT=elen,"Ponomarenko-Timofeev, Aleksei"
jufoid=62555

Source: Scopus
Source ID: 85072960596

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Rewritability in monadic disjunctive Datalog, Mmsnp, and expressive description logics

We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are decidable, and that rewritability into Datalog is decidable when the original query satisfies a certain condition related to equality. We establish 2NExpTime-completeness for all studied problems except rewritability into MDLog for which there remains a gap between 2NExpTime and 3ExpTime. We also analyze the shape of rewritings, which in the case of MMSNP correspond to obstructions, and give a new construction of canonical Datalog programs that is more elementary than existing ones and also applies to non-Boolean queries.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Computing Sciences, University of Bremen, Tampere University
Contributors: Feier, C., Kuusisto, A., Lutz, C.
Pages: 15:1-15:46
Publication date: 2019
Peer-reviewed: Yes

Publication information

Journal: Logical Methods in Computer Science
Volume: 15
Issue number: 2
ISSN (Print): 1860-5974
Ratings: 
  • Scopus rating (2019): CiteScore 1.6 SJR 0.558 SNIP 0.955
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: FO-Rewritability, MDDLog, MMSNP, Monadic Datalog-Rewritability, OMQ
Electronic versions: 
Source: Scopus
Source ID: 85070362805

Research output: Contribution to journalArticleScientificpeer-review

Simultaneously Learning Architectures and Features of Deep Neural Networks

This paper presents a novel method which simultaneously learns the number of filters and network features repeatedly over multiple epochs. We propose a novel pruning loss to explicitly enforces the optimizer to focus on promising candidate filters while suppressing contributions of less relevant ones. In the meanwhile, we further propose to enforce the diversities between filters and this diversity-based regularization term improves the trade-off between model sizes and accuracies. It turns out the interplay between architecture and feature optimizations improves the final compressed models, and the proposed method is compared favorably to existing methods, in terms of both models sizes and accuracies for a wide range of applications including image classification, image compression and audio classification.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Nokia Technologies
Contributors: Wang, T., Fan, L., Wang, H.
Number of pages: 13
Pages: 275-287
Publication date: 2019

Host publication information

Title of host publication: Artificial Neural Networks and Machine Learning – ICANN 2019 : Deep Learning - 28th International Conference on Artificial Neural Networks, Proceedings
Publisher: Springer Verlag
Editors: Tetko, I. V., Karpov, P., Theis, F., Kurková, V.
ISBN (Print): 9783030304836

Publication series

Name: Lecture Notes in Computer Science
Volume: 11728
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85072867295

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Teaching educational game design: Expanding the game design mindset with instructional aspects

It is argued that we are witnessing a paradigmatic shift toward constructionist gaming in which students design games instead of just consuming them. However, only a limited number of studies have explored teaching of educational Game Design (GD). This paper reports a case study in which learning by designing games strategy was used to teach different viewpoints of educational GD. In order to support design activities, we proposed a CIMDELA (Content, Instruction, Mechanics, Dynamics, Engagement, Learning Analytics) framework that aims to align game design and instructional design aspects. Thirty under-graduate students participated in the gamified workshop and designed math games in teams. The activities were divided into eight rounds consisting of design decisions and game testing. The workshop activities were observed and the designed games saved. Most of the students were engaged in the design activities and particularly the approach that allowed students to test the evolving game after each round, motivated students. Observations revealed that some of the students had isolated design mindset in the beginning and they had problems to consider design decisions from game design and instructional perspectives, but team-based design activities often led to fruitful debate with co-designers and helped some students to expand their mindsets.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Education, Research group: TUT Game Lab, Computing Sciences
Contributors: Kiili, K., Tuomi, P.
Number of pages: 11
Pages: 103-113
Publication date: 2019

Host publication information

Title of host publication: Games and Learning Alliance- 8th International Conference, GALA 2019, Proceedings
Publisher: Springer
Editors: Liapis, A., Yannakakis, G. N., Gentile, M., Ninaus, M.
ISBN (Print): 9783030343491

Publication series

Name: Lecture Notes in Computer Science
Volume: 11899
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Design mindset, Educational game, Game design, Game-based learning

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85082446998

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Triggerflow: Regression Testing by Advanced Execution Path Inspection

Cryptographic libraries often feature multiple implementations of primitives to meet both the security needs of handling private information and the performance requirements of modern services when the handled information is public. OpenSSL, the de-facto standard free and open source cryptographic library, includes mechanisms to differentiate the confidential data and its control flow, including run-time flags, designed for hardening against timing side-channels, but repeatedly accidentally mishandled in the past. To analyze and prevent these accidents, we introduce Triggerflow, a tool for tracking execution paths that, assisted by source annotations, dynamically analyzes the binary through the debugger. We validate this approach with case studies demonstrating how adopting our method in the development pipeline would have promptly detected such accidents. We further show-case the value of the tooling by presenting two novel discoveries facilitated by Triggerflow: one leak and one defect.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Research area: Information security, Tampere University
Contributors: Gridin, I., Pereida García, C., Tuveri, N., Brumley, B. B.
Number of pages: 21
Pages: 330-350
Publication date: 2019

Host publication information

Title of host publication: Detection of Intrusions and Malware, and Vulnerability Assessment - 16th International Conference, DIMVA 2019, Proceedings
Publisher: Springer Verlag
Editors: Maurice, C., Giacinto, G., Perdisci, R., Almgren, M., Perdisci, R.
ISBN (Print): 9783030220372

Publication series

Name: Lecture Notes in Computer Science
Volume: 11543
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Applied cryptography, Continuous integration, Dynamic program analysis, OpenSSL, Regression testing, Side-channel analysis, Software testing

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85067827171

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Understanding the digital and non-digital participation by the gaming youth

It is important for the inclusiveness of society that the youth actively participate in its development. Even though the means of digital participation have advanced in the past decade, there is still lack of understanding of digital participation of the youth. In this paper, we present a study on how youth aged 16–25 years perceive social and societal participation and more specifically, how youth currently participate in non-digitally and digitally. We conducted a mixed method study in a large gaming event in Finland using a questionnaire (N = 277) and face-to-face interviews (N = 25). The findings reveal that the gaming youth consider digital participation to include discussions in different social media services or web discussion forums. Creating digital content (e.g. videos) and answering surveys were also emphasized. Perceived advantages to participate digitally include the freedom regarding location and time, ease and efficiency in sharing information, and inexpensiveness. Central disadvantages include lack of commitment, anonymity, misinformation and cheating. We also found that frequently playing gamers are more likely to participate online in social activities than those who play occasionally. Youth who reported that they play strategy games were more active in civic participation than those who do not play strategy games. We discuss the implications of our findings to the design of tools for digital participation.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Computing Sciences, Research area: User experience
Contributors: Pietilä, I., Varsaluoma, J., Väänänen, K.
Number of pages: 19
Pages: 453-471
Publication date: 2019

Host publication information

Title of host publication: Human-Computer Interaction – INTERACT 2019 - 17th IFIP TC 13 International Conference, Proceedings
Publisher: Springer Verlag
Editors: Lamas, D., Loizides, F., Nacke, L., Petrie, H., Winckler, M., Zaphiris, P.
ISBN (Print): 9783030293833

Publication series

Name: Lecture Notes in Computer Science
Volume: 11747
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Digital participation, Games, Gaming, Societal participation, Youth

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85072963099

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Usability, security and trust in password managers: A quest for user-centric properties and features

A password manager stores and handles users' passwords from different services. This relieves the users from constantly remembering and recalling many different login credentials. However, because of the poor usability and limited user experience of password managers, users find it difficult to perform basic actions, such as a safe login. Unavoidably, the password manager holds the login credentials of many online services; as a result, it becomes a desired target for online attacks. This results in compromised security, which users often consider as an inevitable condition that must be accepted. Many studies analysed the usability and security of various password managers. Their research findings, though important, are rather incomprehensible to designers of password managers, because they are limited to particular properties or specific applications and they, often, are contradictory. Hence, we focus on investigating properties and features that can elevate the usability, security, and trustworthiness of password managers, aiming at providing practical, simple, and useful guidelines for building a useable password manager. We performed a systematic literature review, in which we selected thirty-two articles with coherent outcomes associated with usability and security. From these outcomes, we deduced and present meaningful suggestions for realising a useable, secure and trustworthy password manager.

General information

Publication status: Published
MoE publication type: A2 Review article in a scientific journal
Organisations: Computing Sciences, Deerwalk Institute of Technology, University of Jyvaskyla, Deerwalk Institute of Technology
Contributors: Chaudhary, S., Schafeitel-Tähtinen, T., Helenius, M., Berki, E.
Number of pages: 22
Pages: 69-90
Publication date: 2019
Peer-reviewed: Yes

Publication information

Journal: Computer Science Review
Volume: 33
ISSN (Print): 1574-0137
Ratings: 
  • Scopus rating (2019): CiteScore 14.7 SJR 1.997 SNIP 5.273
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Cognition, Password manager, Security, Systematic literature review, Trust, Usability, User experience
Source: Scopus
Source ID: 85070724002

Research output: Contribution to journalReview ArticleScientificpeer-review

Toward Efficient Execution of RVC-CAL Dataflow Programs on Multicore Platforms

The increasing number of cores in System on Chips (SoC) has introduced challenges in software parallelization. As an answer to this, the dataflow programming model offers a concurrent and reusability promoting approach for describing applications. In this work, a runtime for executing Dataflow Process Networks (DPN) on multicore platforms is proposed. The main difference between this work and existing methods is letting the operating system perform Central processing unit (CPU) load-balancing freely, instead of limiting thread migration between processing cores through CPU affinity. The proposed runtime is benchmarked on desktop and server multicore platforms using five different applications from video coding and telecommunication domains. The results show that the proposed method offers significant improvements over the state-of-art, in terms of performance and reliability.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, Research area: Computer engineering, Univ of Oulu
Contributors: Hautala, I., Boutellier, J., Nyländen, T., Silvén, O.
Number of pages: 11
Pages: 1507-1517
Publication date: Nov 2018
Peer-reviewed: Yes
Early online date: 9 Feb 2018

Publication information

Journal: Journal of Signal Processing Systems
Volume: 90
Issue number: 11
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2018): CiteScore 1.7 SJR 0.203 SNIP 0.61
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: Dataflow Process Networks, Multicore, Orcc, RVC-CAL
Source: Scopus
Source ID: 85041532591

Research output: Contribution to journalArticleScientificpeer-review

Graph measures with high discrimination power revisited: A random polynomial approach

Finding graph measures with high discrimination power has been triggered by searching for so-called complete graph invariants. In a series of papers, we have already investigated highly discriminating measures to distinguish graphs (networks) based on their topology. In this paper, we propose an approach where the graph measures are based on the roots of random graph polynomials. The polynomial coefficients have been defined by utilizing information functionals which capture structural information of the underlying networks. Our numerical results obtained by employing exhaustively generated graphs reveal that the new approach outperforms earlier results in the literature.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Faculty of Biomedical Sciences and Engineering, Research group: Computational Medicine and Statistical Learning Laboratory (CMSL), Research group: Predictive Society and Data Analytics (PSDA), University of Applied Sciences Upper Austria, School of Management, Nankai University
Contributors: Dehmer, M., Chen, Z., Emmert-Streib, F., Shi, Y., Tripathi, S.
Number of pages: 8
Pages: 407-414
Publication date: 1 Oct 2018
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 467
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2018): CiteScore 10.4 SJR 1.62 SNIP 2.744
Original language: English
ASJC Scopus subject areas: Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Data science, Graphs, Networks, Quantitative graph theory, Statistics

Bibliographical note

EXT="Tripathi, Shailesh"

Source: Scopus
Source ID: 85051518614

Research output: Contribution to journalArticleScientificpeer-review

NP-completeness results for partitioning a graph into total dominating sets

A total domatic k-partition of a graph is a partition of its vertex set into k subsets such that each intersects the open neighborhood of each vertex. The maximum k for which a total domatic k-partition exists is known as the total domatic number of a graph G, denoted by dt(G). We extend considerably the known hardness results by showing it is[Formula presented]-complete to decide whether dt(G)≥3 where G is a bipartite planar graph of bounded maximum degree. Similarly, for every k≥3, it is[Formula presented]-complete to decide whether dt(G)≥k, where G is split or k-regular. In particular, these results complement recent combinatorial results regarding dt(G) on some of these graph classes by showing that the known results are, in a sense, best possible. Finally, for general n-vertex graphs, we show the problem is solvable in 2nnO(1) time, and derive even faster algorithms for special graph classes.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Mathematics, University of Helsinki
Contributors: Koivisto, M., Laakkonen, P., Lauri, J.
Publication date: 1 Jan 2018
Peer-reviewed: Yes

Publication information

Journal: Theoretical Computer Science
ISSN (Print): 0304-3975
Ratings: 
  • Scopus rating (2018): CiteScore 2.4 SJR 0.494 SNIP 1.104
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Combinatorics, Computational complexity, Graph theory, Total domatic number
Source: Scopus
Source ID: 85045701638

Research output: Contribution to journalArticleScientificpeer-review

18th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems, NEW2AN 2018 and 11th Conference on Internet of Things and Smart Spaces, ruSMART 2018

The proceedings contain 64 papers. The special focus in this conference is on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems. The topics include: Measuring a LoRa Network: Performance, Possibilities and Limitations; testbed for Identify IoT-Devices Based on Digital Object Architecture; the Application of Graph Theory and Adjacency Lists to Create Parallel Queries to Relational Databases; on the Necessary Accuracy of Representation of Optimal Signals; On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel; application of Optimal Finite-Length Signals for Overcoming “Nyquist Limit”; Influence of Amplitude Limitation for Random Sequence of Single-Frequency Optimal FTN Signals on the Occupied Frequency Bandwidth and BER Performance; Spectral Efficiency Comparison Between FTN Signaling and Optimal PR Signaling for Low Complexity Detection Algorithm; a Method of Simultaneous Signals Spectrum Analysis for Instantaneous Frequency Measurement Receiver; context-Based Cyclist Intelligent Support: An Approach to e-Bike Control Based on Smartphone Sensors; Analytical Models for Schedule-Based License Assisted Access (LAA) LTE Systems; kinetic Approach to Elasticity Analysis of D2D Links Quality Indicators Under Non-stationary Random Walk Mobility Model; the Phenomenon of Secondary Flow Explosion in Retrial Priority Queueing System with Randomized Push-Out Mechanism; Comparison of LBOC and RBOC Mechanisms for SIP Server Overload Control; Performance Analysis of Cognitive Femtocell Network with Ambient RF Energy Harvesting; comparative Analysis of the Mechanisms for Energy Efficiency Improving in Cloud Computing Systems; blue Team Communication and Reporting for Enhancing Situational Awareness from White Team Perspective in Cyber Security Exercises; signing Documents by Hand: Model for Multi-Factor Authentication.

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, FRUCT Oy
Contributors: Galinina, O., Andreev, S., Balandin, S., Koucheryavy, Y.
Number of pages: 720
Publication date: 2018

Publication information

Publisher: Springer Verlag
ISBN (Print): 9783030011673
Original language: English

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

EXT="Balandin, Sergey"

Source: Scopus
Source ID: 85054815936

Research output: Book/ReportAnthologyScientificpeer-review

3D folded loop UAV antenna design

Utilization of Unmanned Aerial Vehicles (UAVs), also known as “drones”, has a great potential for many emerging applications, such as delivering the connectivity on-demand, providing services for public safety, or recovering after damage to the communication infrastructure. Notably, nearly any application of drones requires a stable link to the ground control center, yet this functionality is commonly added at the last moment in the design, necessitating compact antenna designs. In this work, we propose a novel electrically small antenna element based on the 3D folded loop topology, which could be easily located inside the UAV airframe, yet still delivering good isolation from the drones own noise sources. The complete manufacturing technique along with corresponding simulations/measurements are presented. Measurements and evaluations show that the proposed antenna design is an option to achieve genuinely isotropic radiation in a small size without sacrificing efficiency.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Peoples’ Friendship University of Russia
Contributors: Pyattaev, A., Solomitckii, D., Ometov, A.
Number of pages: 13
Pages: 269-281
Publication date: 2018

Host publication information

Title of host publication: Wired/Wireless Internet Communications - 16th IFIP WG 6.2 International Conference, WWIC 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030029302

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 10866 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Electronic versions: 

Bibliographical note

jufiod=62555

Source: Scopus
Source ID: 85059690272

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

A Concise Review of 5G New Radio Capabilities for Directional Access at mmWave Frequencies

In this work, we briefly outline the core 5G air interface improvements introduced by the latest New Radio (NR) specifications, as well as elaborate on the unique features of initial access in 5G NR with a particular emphasis on millimeter-wave (mmWave) frequency range. The highly directional nature of 5G mmWave cellular systems poses a variety of fundamental differences and research problem formulations, and a holistic understanding of the key system design principles behind the 5G NR is essential. Here, we condense the relevant information collected from a wide diversity of 5G NR standardization documents (based on 3GPP Release 15) to distill the essentials of directional access in 5G mmWave cellular, which becomes the foundation for any corresponding system-level analysis.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Wireless Communications and Positioning, Universita degli Studi di Reggio Calabria, Vodafone Italy
Contributors: Sanfilippo, G., Galinina, O., Andreev, S., Pizzi, S., Araniti, G.
Number of pages: 15
Pages: 340-354
Publication date: 2018

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030011673

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 5G NR, Beamforming, Initial access, mmWave, New radio, Numerology, Random access
Source: Scopus
Source ID: 85054871691

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

ADVIO: An authentic dataset for visual-inertial odometry

The lack of realistic and open benchmarking datasets for pedestrian visual-inertial odometry has made it hard to pinpoint differences in published methods. Existing datasets either lack a full six degree-of-freedom ground-truth or are limited to small spaces with optical tracking systems. We take advantage of advances in pure inertial navigation, and develop a set of versatile and challenging real-world computer vision benchmark sets for visual-inertial odometry. For this purpose, we have built a test rig equipped with an iPhone, a Google Pixel Android phone, and a Google Tango device. We provide a wide range of raw sensor data that is accessible on almost any modern-day smartphone together with a high-quality ground-truth track. We also compare resulting visual-inertial tracks from Google Tango, ARCore, and Apple ARKit with two recent methods published in academic forums. The data sets cover both indoor and outdoor cases, with stairs, escalators, elevators, office environments, a shopping mall, and metro station.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Research group: Artificial Intelligence and Vision - AIV, Aalto University
Contributors: Cortés, S., Solin, A., Rahtu, E., Kannala, J.
Number of pages: 16
Pages: 425-440
Publication date: 2018

Host publication information

Title of host publication: Computer Vision – ECCV 2018 - 15th European Conference, 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030012489

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11214 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Benchmarking, Navigation, Visual-inertial odometry
Source: Scopus
Source ID: 85055101439

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

A Lower Bound on the Average Identification Time in a Passive RFID System

One of the most well-known standards for radio frequency identification (RFID), the standard ISO 18000-6C, collects the requirements for RFID readers and tags and regulates respective communication protocols. In particular, the standard introduces the so-called Q-algorithm resolving conflicts in the channel (which occur when several RFID tags respond simultaneously). As of today, a vast amount of existing literature addresses various modifications of the Q-algorithm; however, none of them is known to significantly reduce the average identification time (i.e., the time to identify all proximate tags). In this work, we derive a lower bound for the average identification time in an RFID system. Furthermore, we demonstrate that in case of an error-free channel, the performance of the legacy Q-algorithm is reasonably close to the proposed lower bound; however, for the error-prone environment, this gap may substantially increase, thereby indicating the need for new identification algorithms.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, St. Petersburg State University of Aerospace Instrumentation
Contributors: Stepanov, N., Matveev, N., Galinina, O., Turlikov, A.
Number of pages: 11
Pages: 524-534
Publication date: 2018

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030011673

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Electronic versions: 
Source: Scopus
Source ID: 85054806849

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

An algebraic approach to reducing the number of variables of incompletely defined discrete functions

In this paper, we consider incompletely defined discrete functions, i.e., Boolean and multiple-valued functions, f : S → {0, 1, . . . , q - 1} where S ⊆ {0, 1, . . . , q - 1}n i.e., the function value is specified only on a certain subset S of the domain of the corresponding completely defined function. We assume the function to be sparse i.e. |S| is 'small' relative to the cardinality of the domain. We show that by embedding the domain {0, 1, . . . , q - 1}n , where n is the number of variables and q is a prime power, in a suitable ring structure, the multiplicative structure of the ring can be used to construct a linear function {0, 1, . . . , q - 1}n → {0, 1, . . . , q - 1}m that is injective on S provided that m > 2 logq |S| + logq (n - 1). In this way we find a linear transform that reduces the number of variables from n to m, and can be used e.g. in implementation of an incompletely defined discrete function by using linear decomposition.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Signal Processing, Faculty of Electronics Niš
Contributors: Astola, J., Astola, P., Stanković, R., Tabus, I.
Number of pages: 15
Pages: 239-253
Publication date: 2018
Peer-reviewed: Yes

Publication information

Journal: Journal of Multiple-Valued Logic and Soft Computing
Volume: 31
Issue number: 3
ISSN (Print): 1542-3980
Ratings: 
  • Scopus rating (2018): CiteScore 1.2 SJR 0.224 SNIP 0.605
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Logic

Bibliographical note

EXT="Stanković, Radomir"

Source: Scopus
Source ID: 85055661435

Research output: Contribution to journalArticleScientificpeer-review

Analytical Models for Schedule-Based License Assisted Access (LAA) LTE Systems

The scarcity of resources available for commercial wireless access systems below 6 GHz coupled with constantly increasing traffic demands from the mobile users force network operators to seek additional spectrum. In addition to moving upper in the frequency band and occupying millimeter wave band with 3GPP New Radio access technology the set of solutions also includes implementing commercial LTE systems in unlicensed bands including 2.4 GHz and 5.1 GHz that are currently occupied by Wi-Fi. This technology, known as License Assisted Access (LAA), has recently received considerable attention within the 3GPP community. One of the solutions to provide fair division of air interface resources between competing technologies is to use schedule-based access, where LAA access point is in full control of shared medium and may dynamically schedule allocations to LTE and Wi-Fi traffic. The fine tuning of LAA technology requires careful understanding of various trade-offs and dependencies involved in Wi-Fi and LTE coexistence. In this paper, using the tools of the queuing theory we formulate and solve several analytical models targeting different implementation strategies of schedule-based LAA systems and traffic types of end users. We derive relevant performance characteristics including the session drop probabilities, probability that the session accepted to the system is drop before its service completion and average resource utilization of the system.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Peoples’ Friendship University of Russia, Federal Research Center Computer Science and Control of the Russian Academy of Sciences
Contributors: Markova, E., Moltchanov, D., Sinitsyna, A., Ivanova, D., Filipova, V., Gudkova, I., Samouylov, K.
Number of pages: 14
Pages: 210-223
Publication date: 2018

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030011673

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 4G, Analytical models, LAA, License-assisted access, LTE
Source: Scopus
Source ID: 85054865293

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Characterizing mmWave Radio Propagation at 60 GHz in a Conference Room Scenario

In this paper, we provide a shooting and bouncing ray (SBR) based simulation study of mmWave radio propagation at 60 GHz in a typical conference room. The room geometry, material types, and other simulation settings are verified against the results of the measurement campaign at 83 GHz in [15]. Here, we extend the evaluation scenario by randomly scattering several human-sized blockers as well as study the effects of human body blockage models. We demonstrate that multiple knife-edge diffraction (KED) models are capable of providing meaningful results while keeping the simulation duration relatively short. Moreover, we address another important scenario, where transmitters and receivers are located at the same heights and are moving according to a predefined trajectory that corresponds, for example, to device-to-device interactions or inter-user interference.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Peoples’ Friendship University of Russia, Brno University of Technology
Contributors: Ponomarenko-Timofeev, A., Semkin, V., Masek, P., Galinina, O.
Number of pages: 13
Pages: 381-393
Publication date: 2018

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030011673

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 60 GHz, Conference room, Indoor propagation, mmWave, Radio propagation

Bibliographical note

INT=elt, "Semkin, Vasilii"
INT=elt, "Ponomarenko-Timofeev, Aleksei"

Source: Scopus
Source ID: 85054848053

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Computing minimum rainbow and strong rainbow colorings of block graphs

A path in an edge-colored graph G is rainbow if no two edges of it are colored the same. The graph G is rainbowconnected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph G is strongly rainbow-connected. The minimum number of colors needed to make G rainbow-connected is known as the rainbow connection number of G, and is denoted by rc(G). Similarly, the minimum number of colors needed to make G strongly rainbow-connected is known as the strong rainbow connection number ofG, and is denoted by src(G). We prove that for every k ≥ 3, deciding whether src(G) ≤ k is NP-complete for split graphs, which form a subclass of chordal graphs. Furthermore, there exists no polynomial-time algorithm for approximating the strong rainbow connection number of an n-vertex split graph with a factor of n1-2-ϵ for any ϵ > 0 unless P = NP. We then turn our attention to block graphs, which also form a subclass of chordal graphs. We determine the strong rainbow connection number of block graphs, and show it can be computed in linear time. Finally, we provide a polynomial-time characterization of bridgeless block graphs with rainbow connection number at most 4.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Mathematics, Michigan Technological University, Bell Labs
Contributors: Keranen, M., Lauri, J.
Publication date: 2018
Peer-reviewed: Yes

Publication information

Journal: Discrete Mathematics and Theoretical Computer Science
Volume: 20
Issue number: 1
Article number: 22
ISSN (Print): 1462-7264
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all), Discrete Mathematics and Combinatorics
Keywords: Block graph, Computational complexity, Rainbow coloring
Electronic versions: 
Source: Scopus
Source ID: 85049392046

Research output: Contribution to journalArticleScientificpeer-review

Convolutional neural network based inter-frame enhancement for 360-degree video streaming

360-degree video has attracted more and more attention in recent years. However, it is a highly challenging task to transmit the high-resolution video within the limited bandwidth. In this paper, we first propose to unequally compress the cubemaps in each frame of the 360-degree video to reduce the total bitrate of the transmitted data. Specifically, a Group of Pictures (GOP) is used as a unit to alternately transmit different versions of the video. Each version consists of 3 high-quality cubemaps and 3 low-quality cubemaps. Then, the convolutional neural network (CNN) is introduced to enhance the low-quality cubemaps with the high-quality cubemaps by exploring the inter-frame similarities. It is shown in the experiment that a single CNN model can be used for various videos. The experimental results also show that the proposed method has an excellent quality enhancement compared with the benchmark in terms of PSNR, especially for videos with slow motion.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Beijing Jiaotong University
Contributors: Li, Y., Yu, L., Lin, C., Zhao, Y., Gabbouj, M.
Number of pages: 10
Pages: 57-66
Publication date: 2018

Host publication information

Title of host publication: Advances in Multimedia Information Processing – PCM 2018 - 19th Pacific-Rim Conference on Multimedia, 2018
Publisher: Springer
ISBN (Print): 9783030007669

Publication series

Name: Lecture Notes in Computer Science
Volume: 11165
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: 360-degree video streaming, Convolutional neural network, Inter-frame enhancement

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85057256401

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Current Trends in Web Engineering: ICWE 2018 International Workshops, MATWEP, EnWot, KD-WEB, WEOD, TourismKG, Cáceres, Spain, June 5, 2018, Revised Selected Papers

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Pervasive Computing, Università della Svizzera Italiana, Universidad de Extremadura
Contributors: Pautasso, C. (ed.), Sánchez-Figueroa, F. (ed.), Systä, K. (ed.), Rodríguez, J. M. M. (ed.)
Number of pages: 298
Publication date: 2018

Publication information

Publisher: Springer
ISBN (Print): 978-3-030-03055-1
ISBN (Electronic): 978-3-030-03056-8
Original language: English

Publication series

Name: Lecture Notes in Computer Science
Volume: 11153
ISSN (Print): 0302-9743
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85058267881

Research output: Book/ReportAnthologyScientificpeer-review

Gibbs Dyadic Differentiation on Groups - Evolution of the Concept

Differential operators are usually used to determine the rate of change and the direction of change of a signal modeled by a function in some appropriately selected function space. Gibbs derivatives are introduced as operators permitting differentiation of piecewise constant functions. Being initially intended for applications in Walsh dyadic analysis, they are defined as operators having Walsh functions as eigenfunctions. This feature was used in different generalizations and extensions of the concept firstly defined for functions on finite dyadic groups. In this paper, we provide a brief overview of the evolution of this concept into a particlar class of differential operators for functions on various groups.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Department of Computer Science, Faculty of Electronic Engineering, Technical University of Dortmund
Contributors: Stankovic, R. S., Astola, J., Moraga, C.
Number of pages: 9
Pages: 229-237
Publication date: 2018

Host publication information

Title of host publication: Computer Aided Systems Theory – EUROCAST 2017 - 16th International Conference, Revised Selected Papers
Publisher: Springer Verlag
ISBN (Print): 9783319747262

Publication series

Name: Lecture Notes in Computer Science
Volume: 10672
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

EXT="Stankovic, Radomir S."
jufoid=79748

Source: Scopus
Source ID: 85041720547

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Information Exchange Architecture for Collaborative Industrial Ecosystem

Due to the networked nature of modern industrial business, repeated information exchange activities are necessary. Unfortunately, information exchange is both laborious and expensive with the current communication media, which causes errors and delays. To increase the efficiency of communication, this study introduces an architecture to exchange information in a digitally processable manner in industrial ecosystems. The architecture builds upon commonly agreed business practices and data formats, and an open consortium and information mediators enable it. Following the architecture, a functional prototype has been implemented for a real industrial scenario. This study has its focus on the technical information of equipment, but the architecture concept can also be applied in financing and logistics. Therefore, the concept has potential to completely reform industrial communication.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Automation and Hydraulic Engineering, Research group: Automation and Systems Theory, Collaxion Oy
Contributors: Kannisto, P., Hästbacka, D., Marttinen, A.
Pages: 1-16
Publication date: 2018
Peer-reviewed: Yes
Early online date: 2018

Publication information

Journal: Information Systems Frontiers
ISSN (Print): 1387-3326
Ratings: 
  • Scopus rating (2018): CiteScore 7.6 SJR 0.797 SNIP 2.201
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Information Systems, Computer Networks and Communications
Keywords: Digital business ecosystem, Industrial information management, Lifecycle management, Multi-sided platform, Operations and maintenance, Systems integration
Source: Scopus
Source ID: 85052098014

Research output: Contribution to journalArticleScientificpeer-review

IoT Application Deployment Using Request-Response Pattern with MQTT

As IoT devices become more powerful they can also become full participants of Internet architectures. For example, they can consume and provide RESTful services. However, the typical network infrastructures do not support the architecture and middleware solutions used in the cloud-based Internet. We show how systems designed with RESTful architecture can be implemented by using an IoT-specific technology called MQTT. Our example case is an application development and deployment system that can be used for remote management of IoT devices.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research area: Software engineering
Contributors: Luoto, A., Systä, K.
Number of pages: 13
Pages: 48-60
Publication date: 2018

Host publication information

Title of host publication: Current Trends in Web Engineering: ICWE 2017 International Workshops, Liquid Multi-Device Software and EnWoT, practi-O-web, NLPIT, SoWeMine, Rome, Italy, June 5-8, 2017, Revised Selected Papers
Volume: 10544
Publisher: Springer Verlag
ISBN (Print): 9783319744322

Publication series

Name: Lecture Notes in Computer Science
Volume: 10544
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Internet-of-Things, IoT, MQTT, REST
Electronic versions: 

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85042801104

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Kinetic Approach to Elasticity Analysis of D2D Links Quality Indicators Under Non-stationary Random Walk Mobility Model

In device-to-device communications, the link quality indicators, such as signal-to-interference ratio (SIR) is heavily affected by mobility of users. Conventionally, the mobility model is assumed to be stationary. In this paper, we use kinetic theory to analyze evolution of probability distribution function parameters of SIR in D2D environment under non-stationary mobility of users. Particularly, we concentrate on elasticity of the SIR moments with respect to parameters of Fokker-Planck equation. The elasticity matrix for average SIR value, SIR variance and time periods, when SIR values is higher than a certain threshold are numerically constructed. Our numerical results demonstrate that the main kinetic parameter affecting SIR behavior is diffusion coefficient. The influence of the drift is approximately ten times less.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Peoples’ Friendship University of Russia, Keldysh Institute of Applied Mathematics, Federal Research Center Computer Science and Control of the Russian Academy of Sciences
Contributors: Samuylov, A. K., Ivchenko, A. Y., Orlov, Y. N., Moltchanov, D. A., Bobrikova, E. V., Gaidamaka, Y. V., Shorgin, V. S.
Number of pages: 12
Pages: 224-235
Publication date: 2018

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings
Publisher: Springer
ISBN (Print): 9783030011673

Publication series

Name: Lecture Notes in Computer Science
Volume: 11118
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Device-to-device communications, Kinetic equation, Mathematical modeling, Non-stationary random walk, SIR distribution, Wireless communications

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85054808451

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Liquid Transfer of User Identity

Most consumers own more than one device for accessing content from the Web. In this world Liquid Software allows users to switch the device and effortlessly continue tasks in the new device. This paper addresses on the needs and methods for transferring a user session and user information from one device to another. The identity should follow the moving application seamlessly instead of requiring repeated entering of credentials in each device. Such solution would make services that require authentication to work in a liquid fashion. The paper describes our on-going work on investigating how liquid transfer of user identity can be added to various ways of handing the user authentication.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing
Contributors: Thangavel, S., Systä, K.
Number of pages: 16
Pages: 92-107
Publication date: 2018

Host publication information

Title of host publication: Current Trends in Web Engineering - ICWE 2017 International Workshops, Liquid Multi-Device Software and EnWoT, practi-O-web, NLPIT, SoWeMine, Revised Selected Papers
Publisher: Springer Verlag
ISBN (Print): 9783319744322

Publication series

Name: Lecture Notes in Computer Science
Volume: 10544
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Liquid software, User identification, User sessions, Web session migration

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85042798718

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Memory Tampering Attack on Binary GCD Based Inversion Algorithms

In the field of cryptography engineering, implementation-based attacks are a major concern due to their proven feasibility. Fault injection is one attack vector, nowadays a major research line. In this paper, we present how a memory tampering-based fault attack can be used to severely limit the output space of binary GCD based modular inversion algorithm implementations. We frame the proposed attack in the context of ECDSA showing how this approach allows recovering the private key from only one signature, independent of the key size. We analyze two memory tampering proposals, illustrating how this technique can be adapted to different implementations. Besides its application to ECDSA, it can be extended to other cryptographic schemes and countermeasures where binary GCD based modular inversion algorithms are employed. In addition, we describe how memory tampering-based fault attacks can be used to mount a previously proposed fault attack on scenarios that were initially discarded, showing the importance of including memory tampering attacks in the frameworks for analyzing fault attacks and their countermeasures.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, Research area: Information security, Universidad Tecnológica de la Habana José Antonio Echeverría, Universidad de Sevilla
Contributors: Aldaya, A. C., Brumley, B. B., Sarmiento, A. J., Sánchez-Solano, S.
Pages: 1-20
Publication date: 2018
Peer-reviewed: Yes
Early online date: 2018

Publication information

Journal: International Journal of Parallel Programming
ISSN (Print): 0885-7458
Ratings: 
  • Scopus rating (2018): CiteScore 2.4 SJR 0.289 SNIP 0.97
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Information Systems
Keywords: Binary GCD, Bitstream manipulation, ECDSA, Fault attacks, FPGA memory tampering
Electronic versions: 
URLs: 
Source: Scopus
Source ID: 85057616270

Research output: Contribution to journalArticleScientificpeer-review

Model-Based Dynamic Scheduling for Multicore Signal Processing

This paper presents a model-based design method and a corresponding new software tool, the HTGS Model-Based Engine (HMBE), for designing and implementing dataflow-based signal processing applications on multi-core architectures. HMBE provides complementary capabilities to HTGS (Hybrid Task Graph Scheduler), a recently-introduced software tool for implementing scalable workflows for high performance computing applications on compute nodes with high core counts and multiple GPUs. HMBE integrates model-based design approaches, founded on dataflow principles, with advanced design optimization techniques provided in HTGS. This integration contributes to (a) making the application of HTGS more systematic and less time consuming, (b) incorporating additional dataflow-based optimization capabilities with HTGS optimizations, and (c) automating significant parts of the HTGS-based design process using a principled approach. In this paper, we present HMBE with an emphasis on the model-based design approaches and the novel dynamic scheduling techniques that are developed as part of the tool. We demonstrate the utility of HMBE via two case studies: an image stitching application for large microscopy images and a background subtraction application for multispectral video streams.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, Research area: Computer engineering, University of Maryland, National Institute of Standards and Technology
Contributors: Wu, J., Blattner, T., Keyrouz, W., Bhattacharyya, S. S.
Number of pages: 14
Pages: 1-14
Publication date: 2018
Peer-reviewed: Yes
Early online date: 2018

Publication information

Journal: Journal of Signal Processing Systems
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2018): CiteScore 1.7 SJR 0.203 SNIP 0.61
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: Dataflow, Memory management, Multicore platforms, Scheduling
Source: Scopus
Source ID: 85054798661

Research output: Contribution to journalArticleScientificpeer-review

Model-Based Representations for Dataflow Schedules

Dataflow is widely used as a model of computation in many application domains, especially domains within the broad area of signal and information processing. The most common uses of dataflow techniques in these domains are in the modeling of application behavior and the design of specialized architectures. In this chapter, we discuss a different use of dataflow that involves its application as a formal model for scheduling applications onto architectures. Scheduling is a critical aspect of dataflow-based system design that impacts key metrics, including latency, throughput, buffer memory requirements, and energy efficiency. Deriving efficient and reliable schedules is an important and challenging problem that must be addressed in dataflow-based design flows. The concepts and methods reviewed in this chapter help to address this problem through model-based representations of schedules. These representations build on the separation of concerns between functional specification and scheduling in dataflow, and provide a useful new class of abstractions for designing dataflow graph schedules, as well as for managing, analyzing, and manipulating schedules within design tools.

General information

Publication status: Published
MoE publication type: A3 Part of a book or another research book
Organisations: Pervasive Computing, Department of Electrical and Computer Engineering, University of Maryland, Abo Akad Univ, Abo Akademi University, Dept Phys
Contributors: Bhattacharyya, S. S., Lilius, J.
Number of pages: 18
Pages: 88-105
Publication date: 2018

Host publication information

Title of host publication: Principles of Modeling
Publisher: Springer Verlag
ISBN (Print): 978-3-319-95245-1
ISBN (Electronic): 978-3-319-95246-8

Publication series

Name: Lecture Notes in Computer Science
Volume: 10760
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Dataflow, Model-based design, Scheduling, Signal processing

Bibliographical note

jufo=53801

Source: Scopus
Source ID: 85052699637

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Modeling and Engineering Promoters with Pre-defined RNA Production Dynamics in Escherichia Coli

Recent developments in live-cell time-lapse microscopy and signal processing methods for single-cell, single-RNA detection now allow characterizing the in vivo dynamics of RNA production of Escherichia coli promoters at the single event level. This dynamics is mostly controlled at the promoter region, which can be engineered with single nucleotide precision. Based on these developments, we propose a new strategy to engineer genes with predefined transcription dynamics (mean and standard deviation of the distribution of RNA numbers of a cell population). For this, we use stochastic modelling followed by genetic engineering, to design synthetic promoters whose rate-limiting steps kinetics allow achieving a desired RNA production kinetics. We present an example where, from a pre-defined kinetics, a stochastic model is first designed, from which a promoter is selected based on its rate-limiting steps kinetics. Next, we engineer mutant promoters and select the one that best fits the intended distribution of RNA numbers in a cell population. As the modelling strategies and databases of models, genetic constructs, and information on these constructs kinetics improve, we expect our strategy to be able to accommodate a wide variety of pre-defined RNA production kinetics.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Faculty of Biomedical Sciences and Engineering, Research group: Laboratory of Biosystem Dynamics-LBD, Research group: Computational Systems Biology
Contributors: Oliveira, S. M. D., Bahrudeen, M. N. M., Startceva, S., Kandavalli, V., Ribeiro, A. S.
Number of pages: 18
Pages: 3-20
Publication date: 2018

Host publication information

Title of host publication: Computational Methods in Systems Biology - 16th International Conference, CMSB 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319994284

Publication series

Name: Lecture Notes in Bioinformatics
Volume: 11095 LNBI
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Gene engineering framework, Model of transcription initiation, Rate-limiting steps, Synthetic constructs
Source: Scopus
Source ID: 85053213051

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

MultiMedia Modeling: 24th International Conference, MMM 2018, Bangkok, Thailand, February 5-7, 2018, Proceedings, Part I

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Signal Processing, Alpen-Adria-Universitat Klagenfurt, Chulalongkorn University, City University of Hong Kong, Dublin City University, K-JIST, Rutgers University
Contributors: Schoeffmann, K. (ed.), Chalidabhongse, T. H. (ed.), Ngo, C. W. (ed.), Aramvith, S. (ed.), O'Connor, N. E. (ed.), Ho, Y. S. (ed.), Gabbouj, M. (ed.), Elgammal, A. (ed.)
Number of pages: 648
Publication date: 2018

Publication information

Publisher: Springer
ISBN (Print): 978-3-319-73602-0
ISBN (Electronic): 978-3-319-73603-7
Original language: English

Publication series

Name: Lecture Notes in Computer Science
Volume: 10704
ISSN (Print): 0302-9743
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85042077828

Research output: Book/ReportAnthologyScientificpeer-review

MultiMedia Modeling: 24th International Conference, MMM 2018, Bangkok, Thailand, February 5-7, 2018, Proceedings, Part II

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Signal Processing, Chulalongkorn University, K-JIST, Dublin City University, Alpen-Adria-Universitat Klagenfurt, City University of Hong Kong, Rutgers University
Contributors: Aramvith, S., Ho, Y. S., O’Connor, N. E., Chalidabhongse, T., Schoeffmann, K., Ngo, C. W., Gabbouj, M., Elgammal, A.
Number of pages: 460
Publication date: 2018

Publication information

Publisher: Springer
ISBN (Print): 978-3-319-73599-3
ISBN (Electronic): 978-3-319-73600-6
Original language: English

Publication series

Name: Lecture Notes in Computer Science
Volume: 10705
ISSN (Print): 0302-9743
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85042114535

Research output: Book/ReportAnthologyScientificpeer-review

On the degeneracy of the Randić entropy and related graph measures

Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randić entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures’ applicability to deterministic and non-deterministic networks.

General information

Publication status: E-pub ahead of print
MoE publication type: A1 Journal article-refereed
Organisations: Faculty of Biomedical Sciences and Engineering, Research group: Computational Medicine and Statistical Learning Laboratory (CMSL), Research group: Predictive Society and Data Analytics (PSDA), University of Applied Sciences Upper Austria, School of Management, Nankai University, Hall in Tyrol, The City College of New York (CUNY), Production and Operations Management, Tianjin University of Technology
Contributors: Dehmer, M., Chen, Z., Mowshowitz, A., Jodlbauer, H., Emmert-Streib, F., Shi, Y., Tripathi, S., Xia, C.
Publication date: 2018
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2018): CiteScore 10.4 SJR 1.62 SNIP 2.744
Original language: English
ASJC Scopus subject areas: Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Data science, Graphs, Networks, Quantitative graph theory, Structural graph measures, Structural network analysis

Bibliographical note

EXT="Tripathi, Shailesh"

Source: Scopus
Source ID: 85057760552

Research output: Contribution to journalArticleScientificpeer-review

Optimization on ports activation towards energy efficient data center networks

Nowadays, Internet of thing including network support (i.e. checking social media, sending emails, video conferencing) requires smart and efficient data centers to support these services. Hence, data centers become more important and must be able to respond to ever changing service requirements and application demands. However, data centers are classified as one of the largest consumers of energy in the world. Existing topologies such as ScalNet improves the data center scalability while leading to enormous amounts of energy consumption. In this paper, we present a new energy efficient algorithm for ScalNet called Green ScalNet. The proposed topology strikes a compromise between maximizing the energy saving and minimizing the average path length. By taking into consideration the importance of the transmitted data and the critical parameters for the receiver (e.g. time, energy), the proposed topology dynamically controls the number of active communication links by turning off and on ports in the network (switches ports and nodes ports). Both theoretical analysis and simulation experiments are conducted to evaluate its overall performance in terms of average path length and energy consumption.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Research group: Multimedia Research Group - MRG, Qatar University, Université de Bourgogne Franche-Comté, New York University Abu Dhabi, College of Engineering
Contributors: Chkirbene, Z., Hamila, R., Foufou, S., Kiranyaz, S., Gabbouj, M.
Number of pages: 12
Pages: 155-166
Publication date: 2018

Host publication information

Title of host publication: Ubiquitous Networking - 4th International Symposium, UNet 2018, Revised Selected Papers
Publisher: Springer Verlag
ISBN (Print): 9783030028480

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11277 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Average path length, Data center network, Energy consumption, Internet of thing, Network architecture

Bibliographical note

EXT="Hamila, Ridha"
EXT="Kiranyaz, Serkan"
jufoid=62555

Source: Scopus
Source ID: 85056810418

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Performance Limitations of Parsing Libraries: State-of-the-Art and Future Perspectives

The acceleration of mobile data traffic and the shortage of available spectral resources create new challenges for the next-generation (5G) networks. One of the potential solutions is network offloading that opens a possibility for unlicensed spectrum utilization. Heterogeneous networking between cellular and WLAN systems allows mobile users to adaptively utilize the licensed (LTE) and unlicensed (IEEE 802.11) radio technologies simultaneously. At the same time, softwarized frameworks can be employed not only inside the network controllers but also at the end nodes. To operate with the corresponding policies and interpret them efficiently, a signaling processor has to be developed and equipped with a fast packet parsing mechanism. In this scenario, the reaction time becomes a crucial factor, and this paper provides an overview of the existing parsing libraries (Scapy and dpkt) as well as proposes a flexible parsing tool that is capable of reducing the latency incurred by analyzing packets in a softwarized network.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Wireless Communications and Positioning, Universita degli Studi di Reggio Calabria, Peoples’ Friendship University of Russia
Contributors: D’Agostino, A. M., Ometov, A., Pyattaev, A., Andreev, S., Araniti, G.
Number of pages: 14
Pages: 405-418
Publication date: 2018

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030011673

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: dpkt, Parsing, Performance evaluation, Scapy, SDN
Source: Scopus
Source ID: 85054808740

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

PESTEL Analysis of Hacktivism Campaign Motivations

A political, economic, socio-cultural, technological, environment and legal (PESTEL) analysis is a framework or tool used to analyse and monitor the macro-environmental factors that have an impact on an organisation. The results identify threats and weaknesses which are used in a strengths, weaknesses, opportunities and threats (SWOT) analysis. In this paper the PESTEL framework was utilized to categorize hacktivism motivations for attack campaigns against certain companies, governments or industries. Our study is based on empirical evidence: of thirty-three hacktivism attack campaigns in manifesto level. Then, the targets of these campaigns were analysed and studied accordingly. As a result, we claim that connecting cyberattacks to motivations permits organizations to determine their external cyberattack risks, allowing them to perform more accurate risk-modeling.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Cyber Intelligence House Ltd., Singapore Management University
Contributors: Nurmi, J., Niemelä, M. S.
Number of pages: 13
Pages: 323-335
Publication date: 2018

Host publication information

Title of host publication: Secure IT Systems - 23rd Nordic Conference, NordSec 2018
Publisher: Springer Verlag
ISBN (Print): 9783030036379

Publication series

Name: Lecture Notes in Computer Science
Volume: 11252
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Cyberattack, Hacktivism, Online anonymity, PESTEL analysis, Political activism, Risk modeling, Security, Strategic management

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85057422076

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Preface

General information

Publication status: Published
MoE publication type: B1 Article in a scientific magazine
Organisations: Electronics and Communications Engineering, FRUCT Oy
Contributors: Galinina, O., Balandin, S., Andreev, S., Koucheryavy, Y.
Pages: v-vi
Publication date: 2018
Peer-reviewed: No

Publication information

Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11118 LNCS
ISSN (Print): 0302-9743
Ratings: 
  • Scopus rating (2018): CiteScore 1.6 SJR 0.283 SNIP 0.746
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

EXT="Balandin, Sergey"

Source: Scopus
Source ID: 85054820013

Research output: Contribution to journalEditorialScientific

Reduction of variables of index generation functions using linear and quadratic transformations

In many applications in communication, data retrieval and processing, digital system design, and related areas, incompletely specified switching (Boolean or multiple-valued) functions are encountered. A particular class of highly incompletely specified functions are the so-called index generation functions, which being defined on a small fraction of input combinations, often do not require all the variables to be represented. Reducing the variables of index generation functions is an important task, since they are used mainly in real-time applications and compactness of their representations influences performances of related systems. One approach towards reducing the number of variables in index generation functions are linear transformations meaning that initial variables are replaced by their linear combinations. A drawback is that finding an optimal transformation can be difficult. Therefore, in this paper, we first formulate the problem of finding a good linear transformation by using linear subspaces. This formulation serves as a basis to propose non-linear (polynomial) transformations to reduce the number of variables in index generation functions.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Signal Processing, Faculty of Electronics
Contributors: Astola, H., Stanković, R., Astola, J.
Number of pages: 16
Pages: 255-270
Publication date: 2018
Peer-reviewed: Yes

Publication information

Journal: Journal of Multiple-Valued Logic and Soft Computing
Volume: 31
Issue number: 3
ISSN (Print): 1542-3980
Ratings: 
  • Scopus rating (2018): CiteScore 1.2 SJR 0.224 SNIP 0.605
Original language: English
ASJC Scopus subject areas: Software, Theoretical Computer Science, Logic
Keywords: Index generation function, Linear transformation, Non-linear transformation, Reed-Muller expression

Bibliographical note

EXT="Stanković, Radomir"

Source: Scopus
Source ID: 85055671990

Research output: Contribution to journalArticleScientificpeer-review

Representational quality challenges of big data: insights from comparative case studies

Big data is said to provide many benefits. However, as data originates from multiple sources with different quality, big data is not easy to use. Representational quality refers to the concise and consistent representation of data to allow ease of understanding of the data and interpretability. In this paper, we investigate the challenges in creating representational quality of big data. Two case studies are investigated to understand the challenges emerging from big data. Our findings suggest that the veracity and velocity of big data makes interpretation more difficult. Our findings also suggest that decisions are made ad-hoc and decision-makers often are not able to understand the ins and outs. Sense-making is one of the main challenges in big data. Taking a naturalistic decision-making view can be used to understand the challenges of big data processing, interpretation and use in decision-making better. We recommend that big data research should focus more on easy interpretation of the data.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Industrial and Information Management, Research group: Business Data Research Group, Delft University of Technology
Contributors: Wahyudi, A., Pekkola, S., Janssen, M.
Number of pages: 19
Pages: 520-538
Publication date: 2018

Host publication information

Title of host publication: Challenges and Opportunities in the Digital Era - 17th IFIP WG 6.11 Conference on e-Business, e-Services, and e-Society, I3E 2018, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783030021306

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 11195 LNCS
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Big data, Interpretation, Naturalistic decision making, Sense-making
Source: Scopus
Source ID: 85055803490

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Subjective quality of spatially asymmetric omnidirectional stereoscopic video for streaming adaptation

Asymmetric video coding is a well-studied area for bit rate reduction in stereoscopic video coding. Such video coding technique is possible because of the binocular fusion theory which states that the Human Visual System (HVS) is capable of fusing views from both the eyes. As a result, past literature has shown that the final perceived quality of different left and right quality images is closer the highest quality of the two views. In this paper, we investigate spatially asymmetric omnidirectional video in subjective experiments using a Head Mounted Display (HMD). We want to subjectively verify to what extent the binocular fusion theory applies in immersive media environments, and also assess to what degree reducing the omnidirectional video streaming bandwidth is feasible. We prove that (1) the HVS is capable of partial suppression of the low-quality view up to a certain resolution; (2) there is a bandwidth saving of 25% when 75% of the spatial resolution is used for one of the views, while ensuring a subjective visual quality with a DMOS of 4.7 points; (3) in case of bandwidth adaptation using asymmetric video, bit rate savings are in the range 25–50%.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Media Technology Research, Nokia Technologies
Contributors: Curcio, I. D., Naik, D., Toukomaa, H., Zare, A.
Number of pages: 12
Pages: 417-428
Publication date: 2018

Host publication information

Title of host publication: Smart Multimedia - 1st International Conference, ICSM 2018, Revised Selected Papers
Publisher: Springer
ISBN (Print): 9783030043742

Publication series

Name: Lecture Notes in Computer Science
Volume: 11010
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Asymmetric video, Omnidirectional video, Streaming adaptation, Subjective quality evaluation, Virtual reality streaming

Bibliographical note

EXT="Curcio, Igor D.D."
EXT="Zare, Alireza"
jufoid=62555

Source: Scopus
Source ID: 85058531674

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Quantitative Graph Theory: A new branch of graph theory and network science

In this paper, we describe some highlights of the new branch QUANTITATIVE GRAPH THEORY and explain its significant different features compared to classical graph theory. The main goal of quantitative graph theory is the structural quantification of information contained in complex networks by employing a measurement approach based on numerical invariants and comparisons. Furthermore, the methods as well as the networks do not need to be deterministic but can be statistic. As such this complements the field of classical graph theory, which is descriptive and deterministic in nature. We provide examples of how quantitative graph theory can be used for novel applications in the context of the overarching concept network science.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Research group: Computational Medicine and Statistical Learning Laboratory (CMSL), Faculty of Biomedical Sciences and Engineering, BioMediTech, Research group: Predictive Society and Data Analytics (PSDA), Nankai University
Contributors: Dehmer, M., Emmert-Streib, F., Shi, Y.
Number of pages: 6
Pages: 575-580
Publication date: 1 Dec 2017
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 418-419
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2017): CiteScore 10 SJR 1.635 SNIP 2.304
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Software, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Data Science, Graphs, Networks, Quantitative Graph Theory, Statistics
Source: Scopus
Source ID: 85027400753

Research output: Contribution to journalArticleScientificpeer-review

Highly unique network descriptors based on the roots of the permanental polynomial

In this paper, we examine the zeros of permanental polynomials as highly unique network descriptors. We employ exhaustively generated networks and demonstrate that our defined graph measures based on the moduli of the zeros of permanental polynomials are quite efficient when distinguishing graphs structurally. In this work, we continue with a line of research that relates to the search of almost complete graph invariants. These highly unique network measures may serve as a powerful tool for tackling graph isomorphism.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Faculty of Biomedical Sciences and Engineering, Research group: Computational Medicine and Statistical Learning Laboratory (CMSL), BioMediTech, Research group: Predictive Society and Data Analytics (PSDA), Institute for Bioinformatics and Translational Research, Laboratory of Biosystem Dynamics, BioMediTech Institute and Faculty of Biomedical Sciences and Engineering, Universität der Bundeswehr München, Nankai University, Babes-Bolyai University
Contributors: Dehmer, M., Emmert-Streib, F., Hu, B., Shi, Y., Stefu, M., Tripathi, S.
Number of pages: 6
Pages: 176-181
Publication date: 1 Oct 2017
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 408
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2017): CiteScore 10 SJR 1.635 SNIP 2.304
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Software, Computer Science Applications, Information Systems and Management, Artificial Intelligence
Keywords: Data science, Graphs, Networks, Quantitative graph theory, Statistics
Source: Scopus
Source ID: 85018769218

Research output: Contribution to journalArticleScientificpeer-review

Guest Editorial: Implementation Issues in System-on-Chip

General information

Publication status: Published
MoE publication type: B1 Article in a scientific magazine
Organisations: Electronics and Communications Engineering, Research group: System-on-Chip for GNSS, Wireless Communications and Cyber-Physical Embedded Computing, Tallinn University of Technology
Contributors: Ellervee, P., Nurmi, J.
Number of pages: 2
Pages: 269-270
Publication date: 1 Jun 2017
Peer-reviewed: No

Publication information

Journal: Journal of Signal Processing Systems
Volume: 87
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Electronic versions: 
URLs: 
Source: Scopus
Source ID: 85017177298

Research output: Contribution to journalEditorialScientific

Power Mitigation by Performance Equalization in a Heterogeneous Reconfigurable Multicore Architecture

This paper presents an integrated self-aware computing model mitigating the power dissipation of a heterogeneous reconfigurable multicore architecture by dynamically scaling the operating frequency of each core. The power mitigation is achieved by equalizing the performance of all the cores for an uninterrupted exchange of data. The multicore platform consists of heterogeneous Coarse-Grained Reconfigurable Arrays (CGRAs) of application-specific sizes and a Reduced Instruction-Set Computing (RISC) core. The CGRAs and the RISC core are integrated with each other over a Network-on-Chip (NoC) of six nodes arranged in a topology of two rows and three columns. The RISC core constantly monitors and controls the performance of each CGRA accelerator by adjusting the operating frequencies unless the performance of all the CGRAs is optimally balanced over the platform. The CGRA cores on the platform are processing some of the most computationally-intensive signal processing algorithms while the RISC core establishes packet based synchronization between the cores for computation and communication. All the cores can access each other’s computational and memory resources while processing the kernels simultaneously and independently of each other. Besides general-purpose processing and overall platform supervision, the RISC processor manages performance equalization among all the cores which mitigates the overall dynamic power dissipation by 20.7 % for a proof-of-concept test.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Electronics and Communications Engineering, Research group: System-on-Chip for GNSS, Wireless Communications and Cyber-Physical Embedded Computing
Contributors: Hussain, W., Hoffmann, H., Ahonen, T., Nurmi, J.
Number of pages: 11
Pages: 287–297
Publication date: Jun 2017
Peer-reviewed: Yes
Early online date: 5 May 2016

Publication information

Journal: Journal of Signal Processing Systems
Volume: 87
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Modelling and Simulation, Hardware and Architecture, Information Systems, Signal Processing, Theoretical Computer Science
Keywords: CGRA, Dark silicon, Heterogeneous, Multicore, Power dissipation, Reconfigurable
Source: Scopus
Source ID: 84965022070

Research output: Contribution to journalArticleScientificpeer-review

Row-interleaved sampling for depth-enhanced 3d video coding for polarized displays

Passive stereoscopic displays create the illusion of three dimensions by employing orthogonal polarizing filters and projecting two images onto the same screen. In this article, a coding scheme targeting depth-enhanced stereoscopic video coding for polarized displays is introduced. We propose to use asymmetric row-interleaved sampling for texture and depth views prior to encoding. The performance of the proposed scheme is compared with several other schemes, and the objective results confirm the superior performance of the proposed method. Furthermore, subjective evaluation proves that no quality degradation is introduced by the proposed coding scheme compared to the reference method.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Signal Processing, Research group: Multimedia Research Group - MRG, Nokia
Contributors: Homayouni, M., Aflaki, P., Hannuksela, M. M., Gabbouj, M.
Publication date: 1 Mar 2017
Peer-reviewed: Yes

Publication information

Journal: ACM TRANSACTIONS ON APPLIED PERCEPTION
Volume: 14
Issue number: 3
Article number: 15
ISSN (Print): 1544-3558
Ratings: 
  • Scopus rating (2017): CiteScore 2.8 SJR 0.281 SNIP 0.986
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all), Experimental and Cognitive Psychology
Keywords: 3D video, Compression, Polarized display, Sub-sampling
Source: Scopus
Source ID: 85017164724

Research output: Contribution to journalArticleScientificpeer-review

Abstractions for transition systems with applications to stubborn sets

Partial order reduction covers a range of techniques based on eliminating unnecessary transitions when generating a state space. On the other hand, abstractions replace sets of states of a system with abstract representatives in order to create a smaller state space. This article explores how stubborn sets and abstraction can be combined. We provide examples to provide intuition and expand on some recent results. We provide a classification of abstractions and give some novel results on what is needed to combine abstraction and partial order reduction in a sound way.

General information

Publication status: Published
MoE publication type: B2 Part of a book or another research book
Organisations: Research group: MAT Computer Science and Applied Logics, Mathematics
Contributors: Hansen, H.
Number of pages: 20
Pages: 104-123
Publication date: 1 Jan 2017

Host publication information

Title of host publication: Concurrency, Security, and Puzzles : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
Publisher: Springer International Publishing
Editors: Gibson-Robinson, T., Hopcroft, P., Lazić, R.
ISBN (Print): 978-3-319-51045-3
ISBN (Electronic): 978-3-319-51046-0

Publication series

Name: Lecture Notes in Computer Science
Volume: 10160
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Source: Scopus
Source ID: 85006700598

Research output: Chapter in Book/Report/Conference proceedingChapterScientific

More stubborn set methods for process algebras

Six stubborn set methods for computing reduced labelled transition systems are presented. Two of them preserve the traces, and one is tailored for on-the-fly verification of safety properties. The rest preserve the tree failures, fair testing equivalence, or the divergence traces. Two methods are entirely new, the ideas of three are recent and the adaptation to the process-algebraic setting with non-deterministic actions is new, and one is recent but slightly generalized. Most of the methods address problems in earlier solutions to the so-called ignoring problem. The correctness of each method is proven, and efficient implementation is discussed.

General information

Publication status: Published
MoE publication type: B2 Part of a book or another research book
Organisations: Research group: MAT Computer Science and Applied Logics, Mathematics
Contributors: Valmari, A.
Number of pages: 26
Pages: 246-271
Publication date: 1 Jan 2017

Host publication information

Title of host publication: Concurrency, Security, and Puzzles : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
Publisher: Springer International Publishing
Editors: Gibson-Robinson, T., Hopcroft, P., Lazić, R.
ISBN (Print): 978-3-319-51045-3
ISBN (Electronic): 978-3-319-51046-0

Publication series

Name: Lecture Notes in Computer Science
Volume: 10160
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Source: Scopus
Source ID: 85006810860

Research output: Chapter in Book/Report/Conference proceedingChapterScientific

A co-design study of digital service ideas in the bus context

To enhance the desirability of public transportation, it is important to design for positive travel experience. The context of bus transportation has broad potential for utilization of novel, supplementary digital services beyond travel information. The aim of our research was to study bus passengers’ needs and expectations for future digital services and to develop initial service concept ideas through co-design. To this end, three Idea generating workshops with 24 participants were arranged. Our findings reveal six service themes that can be used as a basis of designing future digital traveling services: (1) Information at a glance while traveling, (2) Entertainment and entertaining activities, (3) Services that support social interaction, (4) Multiple channels to provide travel information, (5) Extra services for better travel experience, and (6) Services that people already expect to have. The themes are discussed and further elaborated in this paper.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research area: User experience
Contributors: Hildén, E., Ojala, J., Väänänen, K.
Number of pages: 18
Pages: 295-312
Publication date: 2017

Host publication information

Title of host publication: Human-Computer Interaction - INTERACT 2017 - 16th IFIP TC 13 International Conference, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319677439

Publication series

Name: Lecture Notes in Computer Science
Volume: 10513
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Bus, Co-design, Digital services, Public transportation, User needs

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85030656726

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3x and 1.8x speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, Research area: Computer engineering, University of Maryland Baltimore County, National Institute of Standards and Technology, Department of Electrical and Computer Engineering, University of Maryland
Contributors: Blattner, T., Keyrouz, W., Bhattacharyya, S. S., Halem, M., Brady, M.
Number of pages: 11
Pages: 457–467
Publication date: 2017
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
Volume: 89
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: Dataflow, Heterogeneous architectures, Hybrid workflows, Image processing, Matrix multiplication, Task graph
Source: Scopus
Source ID: 85025108758

Research output: Contribution to journalArticleScientificpeer-review

ASR in classroom today: Automatic visualization of conceptual network in science classrooms

Automatic Speech Recognition (ASR) field has improved substantially in the last years. We are in a point never saw before, where we can apply such algorithms in non-ideal conditions such as real classrooms. In these scenarios it is still not possible to reach perfect recognition rates, however we can already take advantage of these improvements. This paper shows preliminary results using ASR in Chilean and Finnish middle and high school to automatically provide teachers a visualization of the structure of concepts present in their discourse in science classrooms. These visualizations are conceptual networks that relate key concepts used by the teacher. This is an interesting tool that gives feedback to the teacher about his/her pedagogical practice in classes. The result of initial comparisons shows great similarity between conceptual networks generated in a manual way with those generated automatically.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Universidad de Chile, Jyväskylän yliopisto, Aalto University
Contributors: Caballero, D., Araya, R., Kronholm, H., Viiri, J., Mansikkaniemi, A., Lehesvuori, S., Virtanen, T., Kurimo, M.
Number of pages: 4
Pages: 541-544
Publication date: 2017

Host publication information

Title of host publication: Data Driven Approaches in Digital Education - 12th European Conference on Technology Enhanced Learning, EC-TEL 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319666099

Publication series

Name: Lecture Notes in Computer Science
Volume: 10474
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Automatic speech recognition, Classroom dialogue, Conceptual network, Teacher discourse

Bibliographical note

jufoid=62555
EXT="Mansikkaniemi, André "

Source: Scopus
Source ID: 85029583746

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Battery monitoring within industry 4.0 landscape: Solution as a service (SaaS) for industrial power unit systems

The current globalization already faces the challenge of meeting the continuously growing demand for new consumer goods by simultaneously ensuring a sustainable evolution of human existence. The industrial value creation must be geared towards sustainability. In order to overcome this challenge, tightly coupling the production and its axiomatization processes is required in the paradigm of Industry 4.0. This technology bridges together a vast amount of new interconnected smart devices being mostly battery powered. Batteries are the heart of industrial motive power and electric energy storing solutions in the infrastructures of today. The charges related to the batteries are among the biggest cost (2.000–5.000 EUR per unit). Unfortunately, the batteries are not always treated properly and the badly managed ones lose their ability to store energy quickly. In this work, we present the developed modular Cloud solution utilizing Solution as a Service (SaaS) to monitor and manage industrial power unit systems. Modular approach is realized using simple miniature non-intrusive wireless sensors combined with cloud platform that provides the battery intelligence.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Brno University of Technology, Peoples’ Friendship University of Russia
Contributors: Devos, M., Masek, P.
Number of pages: 13
Pages: 40-52
Publication date: 2017

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 17th International Conference, NEW2AN 2017, 10th Conference, ruSMART 2017, 3rd Workshop NsCC 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319673790

Publication series

Name: Lecture Notes in Computer Science
Volume: 10531
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Battery consumption, Industrial motive battery, Industry 4.0, Internet of Things, IoT platform

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85031411447

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Characterizing time-dependent variance and coefficient of variation of SIR in D2D connectivity

Attempting to build a uniform theory of mobility-dependent characterization of wireless communications systems, in this paper, we address time-dependent analysis of the signal-to-interference ratio (SIR) in device-to-device (D2D) communications scenario. We first introduce a general kinetic-based mobility model capable of representing the movement process of users with a wide range of mobility characteristics including conventional, fractal and even non-stationary ones. We then derive the time-dependent evolution of mean, variance and coefficient of variation of SIR metric. We demonstrate that under non-stationary mobility behavior of communicating entities the SIR may surprisingly exhibit stationary behavior.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Keldysh Institute of Applied Mathematics, Peoples’ Friendship University of Russia, Russian Academy of Sciences
Contributors: Ivchenko, A., Orlov, Y., Samouylov, A., Molchanov, D., Gaidamaka, Y.
Number of pages: 10
Pages: 526-535
Publication date: 2017

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 17th International Conference, NEW2AN 2017, 10th Conference, ruSMART 2017, 3rd Workshop NsCC 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319673790

Publication series

Name: Lecture Notes in Computer Science
Volume: 10531
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Fokker-Plank equation, Mobility model, SIR, Time dependence

Bibliographical note

INT=elt,"Samouylov, Andrey"
jufoid=62555

Source: Scopus
Source ID: 85031420716

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Data Flow Algorithms for Processors with Vector Extensions: Handling Actors With Internal State

Full use of the parallel computation capabilities of present and expected CPUs and GPUs requires use of vector extensions. Yet many actors in data flow systems for digital signal processing have internal state (or, equivalently, an edge that loops from the actor back to itself) that impose serial dependencies between actor invocations that make vectorizing across actor invocations impossible. Ideally, issues of inter-thread coordination required by serial data dependencies should be handled by code written by parallel programming experts that is separate from code specifying signal processing operations. The purpose of this paper is to present one approach for so doing in the case of actors that maintain state. We propose a methodology for using the parallel scan (also known as prefix sum) pattern to create algorithms for multiple simultaneous invocations of such an actor that results in vectorizable code. Two examples of applying this methodology are given: (1) infinite impulse response filters and (2) finite state machines. The correctness and performance of the resulting IIR filters and one class of FSMs are studied.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Pervasive Computing, Research area: Computer engineering, Signal Processing Research Community (SPRC), Keysight Technologies, University of Maryland
Contributors: Barford, L., Bhattacharyya, S. S., Liu, Y.
Pages: 21-31
Publication date: 2017
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
Volume: 87
Issue number: 1
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Modelling and Simulation, Hardware and Architecture, Information Systems, Signal Processing, Theoretical Computer Science
Keywords: Data flow computing, Digital signal processing, Graphics processing units, Parallel algorithms, Vector processors
Source: Scopus
Source ID: 84946115179

Research output: Contribution to journalArticleScientificpeer-review

Design Flow for GPU and Multicore Execution of Dynamic Dataflow Programs

Dataflow programming has received increasing attention in the age of multicore and heterogeneous computing. Modular and concurrent dataflow program descriptions enable highly automated approaches for design space exploration, optimization and deployment of applications. A great advance in dataflow programming has been the recent introduction of the RVC-CAL language. Having been standardized by the ISO, the RVC-CAL dataflow language provides a solid basis for the development of tools, design methodologies and design flows. This paper proposes a novel design flow for mapping RVC-CAL dataflow programs to parallel and heterogeneous execution platforms. Through the proposed design flow the programmer can describe an application in the RVC-CAL language and map it to multi- and many-core platforms, as well as GPUs, for efficient execution. The functionality and efficiency of the proposed approach is demonstrated by a parallel implementation of a video processing application and a run-time reconfigurable filter for telecommunications. Experiments are performed on GPU and multicore platforms with up to 16 cores, and the results show that for high-performance applications the proposed design flow provides up to 4 × higher throughput than the state-of-the-art approach in multicore execution of RVC-CAL programs.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, Research area: Computer engineering, Center for Machine Vision and Signal Analysis, Univ of Oulu
Contributors: Boutellier, J., Nyländen, T.
Number of pages: 10
Pages: 469–478
Publication date: 2017
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
Volume: 89
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: Dataflow computing, Design automation, Parallel processing, Signal processing
Source: Scopus
Source ID: 85021239311

Research output: Contribution to journalArticleScientificpeer-review

ICT based interventions for anganwadi healthcare workers in Mumbai

Anganwadi workers [1] form the core of healthcare system for a large section of rural and semi-urban population in India. They provide care for newborn babies and play an important role in immunization programs, besides providing health related information to pregnant women. Traditionally these Anganwadi workers use paper based information leaflets as a part of their job to spread awareness among the people. Although mobile phones have made their inroads into the day to day life of these workers for basic communication (making a call), however it is yet to be seen how a mobile device is being used as a technological aid for their work. There are enormous challenges in addressing these issues especially in developing regions owing to numerous reasons such as illiteracy, cognitive difficulties, cultural norms, collaborations, experience and exposure, motivation, power relations, and social standing [2]. The purpose of this field visit would be to enquire the role of mobile devices in their day-to-day work; and if being used as a technological intervention, then in what manner and form is it being used? The methodology used to conduct the study would involve contextual enquiry, open-ended interviews and observing the Anganwadi workers using ICT solutions and other informational artefacts.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research area: User experience, Siemens AG, University of Bamberg
Contributors: Thankachan, B., Sharma, S., Turunen, M., Linna, J., Väätäjä, H., Kortekaas, R., Gross, T.
Number of pages: 3
Pages: 485-487
Publication date: 2017

Host publication information

Title of host publication: Human-Computer Interaction - INTERACT 2017 - 16th IFIP TC 13 International Conference, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319680583

Publication series

Name: Lecture Notes in Computer Science
Volume: 10516
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Anganwadi, Emergent users, HCI4D, Healthcare workers, ICT4D, Low-literate users, Mitanins

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85030845147

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Implementation of a Multirate Resampler for Multi-carrier Systems on GPUs

Efficient sample rate conversion is of widespread importance in modern communication and signal processing systems. Although many efficient kinds of polyphase filterbank structures exist for this purpose, they are mainly geared toward serial, custom, dedicated hardware implementation for a single task. There is, therefore, a need for more flexible sample rate conversion systems that are resource-efficient, and provide high performance. To address these challenges, we present in this paper an all-software-based, fully parallel, multirate resampling method based on graphics processing units (GPUs). The proposed approach is well-suited for wireless communication systems that have simultaneous requirements on high throughput and low latency. Utilizing the multidimensional architecture of GPUs, our design allows efficient parallel processing across multiple channels and frequency bands at baseband. The resulting architecture provides flexible sample rate conversion that is designed to address modern communication requirements, including real-time processing of multiple carriers simultaneously.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Pervasive Computing, University of Maryland
Contributors: Kim, S. C., Bhattacharyya, S. S.
Number of pages: 11
Pages: 445–455
Publication date: 2017
Peer-reviewed: Yes
Early online date: 30 Mar 2017

Publication information

Journal: Journal of Signal Processing Systems
Volume: 89
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: Carrier aggregation, GPU-based radio, Multirate signal processing, Polyphase decimator, Polyphase interpolator, Polyphase resampler
Source: Scopus
Source ID: 85016560476

Research output: Contribution to journalArticleScientificpeer-review

Internet of Things, Smart Spaces, and Next Generation Networks and Systems: 17th International Conference, NEW2AN 2017, 10th Conference, ruSMART 2017, Third Workshop NsCC 2017, St. Petersburg, Russia, August 28–30, 2017, Proceedings

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Electronics and Communications Engineering, Research group: Wireless Communications and Positioning, FRUCT Oy
Contributors: Galinina, O. (ed.), Andreev, S. (ed.), Balandin, S. (ed.), Koucheryavy, Y. (ed.)
Publication date: 2017

Publication information

Publisher: Springer Verlag
ISBN (Print): 978-3-319-67379-0
ISBN (Electronic): 978-3-319-67380-6
Original language: English

Publication series

Name: Lecture Notes in Computer Science
Volume: 10531
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555
EXT="Balandin, Sergey"

Source: Scopus
Source ID: 85031412186

Research output: Book/ReportAnthologyScientificpeer-review

Local adaptive wiener filtering for class averaging in single particle reconstruction

In cryo-electron microscopy (cryo-EM), the Wiener filter is the optimal operation – in the least-squares sense – of merging a set of aligned low signal-to-noise ratio (SNR) micrographs to obtain a class average image with higher SNR. However, the condition for the optimal behavior of the Wiener filter is that the signal of interest shows stationary characteristic thoroughly, which cannot always be satisfied. In this paper, we propose substituting the conventional Wiener filter, which encompasses the whole image for denoising, with its local adaptive implementation, which denoises the signal locally. We compare our proposed local adaptive Wiener filter (LA-Wiener filter) with the conventional class averaging method using a simulated dataset and an experimental cryo-EM dataset. The visual and numerical analyses of the results indicate that LA-Wiener filter is superior to the conventional approach in single particle reconstruction (SPR) applications.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Research group: M2oBSI, Ita-Suomen yliopisto
Contributors: Abdollahzadeh, A., Acar, E., Peltonen, S., Ruotsalainen, U.
Number of pages: 12
Pages: 233-244
Publication date: 2017

Host publication information

Title of host publication: Image Analysis - 20th Scandinavian Conference, SCIA 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319591285

Publication series

Name: Lecture Notes in Computer Science
Volume: 10270
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Class averaging, Electron microscopy, Local adaptive Wiener filter, Single particle reconstruction, Spectral signal-to-noise ratio

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85020387764

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Multi-task Deep Face Recognition

In recent years, deep learning has become one of the most representative and effective techniques in face recognition. Due to the high expense of labelling data, it is costly to collect a large-scale face dataset with accurate label information. For the tasks without sufficient data, deep models cannot be well trained. Generally, parameters of deep models are usually initialized with a pre-trained model, and then fine-tuned on a small dataset of specific task. However, by straightforward fine-tuning, the final model usually does not generalize well. In this paper, we propose a multi-task deep learning (MTDL) method for face recognition. The superiority of the proposed multi-task method is demonstrated by experiments on LFW and CCFD.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Research group: Computational Imaging-CI, Tianjin University
Contributors: Yuan, J., Ma, W., Zhu, P., Egiazarian, K.
Number of pages: 8
Pages: 183-190
Publication date: 2017

Host publication information

Title of host publication: Biometric Recognition - 12th Chinese Conference, CCBR 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319699226

Publication series

Name: Lecture Notes in Computer Science
Volume: 10568
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Convolution neural network, Deep learning, Face recognition, Multi-task

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85032701886

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

NP-completeness results for partitioning a graph into total dominating sets

A total domatic k-partition of a graph is a partition of its vertex set into k subsets such that each intersects the open neighborhood of each vertex. The maximum k for which a total domatic k-partition exists is known as the total domatic number of a graph G, denoted by d:t(G). We extend considerably the known hardness results by showing it istextsc {NP} -complete to decide whether d:t(G)ge 3 where G is a bipartite planar graph of bounded maximum degree. Similarly, for every kge 3, it istextsc {NP} -complete to decide whether d:t(G)ge k, where G is a split graph or k-regular. In particular, these results complement recent combinatorial results regarding d:t(G) on some of these graph classes by showing that the known results are, in a sense, best possible. Finally, for general n-vertex graphs, we show the problem is solvable in 2^n n^{O(1)} time, and derive even faster algorithms for special graph classes.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Mathematics, Research group: Computer Science and Applied Logics, University of Helsinki, Bell Labs
Contributors: Koivisto, M., Laakkonen, P., Lauri, J.
Number of pages: 13
Pages: 333-345
Publication date: 2017

Host publication information

Title of host publication: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319623887

Publication series

Name: Lecture Notes in Computer Science
Volume: 10392
ISSN (Print): 0302-9743
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85028457743

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Parallel Digital Predistortion Design on Mobile GPU and Embedded Multicore CPU for Mobile Transmitters

Digital predistortion (DPD) is a widely adopted baseband processing technique in current radio transmitters. While DPD can effectively suppress unwanted spurious spectrum emissions stemming from imperfections of analog RF and baseband electronics, it also introduces extra processing complexity and poses challenges on efficient and flexible implementations, especially for mobile cellular transmitters, considering their limited computing power compared to basestations. In this paper, we present high data rate implementations of broadband DPD on modern embedded processors, such as mobile GPU and multicore CPU, by taking advantage of emerging parallel computing techniques for exploiting their computing resources. We further verify the suppression effect of DPD experimentally on real radio hardware platforms. Performance evaluation results of our DPD design demonstrate the high efficacy of modern general purpose mobile processors on accelerating DPD processing for a mobile transmitter.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Electronics and Communications Engineering, Research group: Wireless Communications and Positioning, Rice University, Univ of Oulu
Contributors: Li, K., Ghazi, A., Tarver, C., Boutellier, J., Abdelaziz, M., Anttila, L., Juntti, M., Valkama, M., Cavallaro, J. R.
Number of pages: 14
Pages: 417–430
Publication date: 2017
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
Volume: 89
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2017): CiteScore 1.7 SJR 0.216 SNIP 0.632
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Theoretical Computer Science, Signal Processing, Information Systems, Modelling and Simulation, Hardware and Architecture
Keywords: CUDA, Digital predistortion, Mobile SoC, NEON SIMD, Software-defined radio
Source: Scopus
Source ID: 85013872658

Research output: Contribution to journalArticleScientificpeer-review

Parental perspectives towards education technology in low-income urban households

Government and NGO schools catering to children from low-income urban environments are increasingly introducing ir children, through semi-structured interviews. This is an extension of our ongoing work in designing sustainable educational technology models for low-literate urban populations.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research area: User experience, University of Central Lancashire
Contributors: Sharma, S., Linna, J., Thankachan, B., Turunen, M., Väätäjä, H., Kallioniemi, P., Read, J. C., Sim, G.
Number of pages: 3
Pages: 501-503
Publication date: 2017

Host publication information

Title of host publication: Human-Computer Interaction - INTERACT 2017 - 16th IFIP TC 13 International Conference, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319680583

Publication series

Name: Lecture Notes in Computer Science
Volume: 10516
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Low-income urban population, Sustainable EdTech

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85030832266

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Relative camera pose estimation using convolutional neural networks

This paper presents a convolutional neural network based approach for estimating the relative pose between two cameras. The proposed network takes RGB images from both cameras as input and directly produces the relative rotation and translation as output. The system is trained in an end-to-end manner utilising transfer learning from a large scale classification dataset. The introduced approach is compared with widely used local feature based methods (SURF, ORB) and the results indicate a clear improvement over the baseline. In addition, a variant of the proposed architecture containing a spatial pyramid pooling (SPP) layer is evaluated and shown to further improve the performance.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Research group: Artificial Intelligence and Vision - AIV, Aalto University
Contributors: Melekhov, I., Ylioinas, J., Kannala, J., Rahtu, E.
Number of pages: 13
Pages: 675-687
Publication date: 2017

Host publication information

Title of host publication: Advanced Concepts for Intelligent Vision Systems - 18th International Conference, ACIVS 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319703527

Publication series

Name: Lecture Notes in Computer Science
Volume: 10617
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Deep neural networks, Relative camera pose estimation, Spatial pyramid pooling

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85036668143

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Robust Deep Face Recognition with Label Noise

In the last few years, rapid development of deep learning method has boosted the performance of face recognition systems. However, face recognition still suffers from a diverse variation of face images, especially for the problem of face identification. The high expense of labelling data makes it hard to get massive face data with accurate identification information. In real-world applications, the collected data are mixed with severe label noise, which significantly degrades the generalization ability of deep learning models. In this paper, to alleviate the impact of the label noise, we propose a robust deep face recognition (RDFR) method by automatic outlier removal. The noisy faces are automatically recognized and removed, which can boost the performance of the learned deep models. Experiments on large-scale face datasets LFW, CCFD, and COX show that RDFR can effectively remove the label noise and improve the face recognition performance.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing, Research group: Computational Imaging-CI, Tianjin University
Contributors: Yuan, J., Ma, W., Zhu, P., Egiazarian, K.
Number of pages: 10
Pages: 593-602
Publication date: 2017

Host publication information

Title of host publication: Neural Information Processing - 24th International Conference, ICONIP 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319700953

Publication series

Name: Lecture Notes in Computer Science
Volume: 10635
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Deep learning, Face recognition, Noise removal

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85035097737

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Search of the emotional design effect in programming revised

In this paper, we validate and extend previous findings on using emotional design in online learning materials by using a randomized controlled trial in the context of a partially-online university level programming course. For students who did not master the content beforehand, our results echo previous observations: emotional design material was not perceived more favourably, while materials’ perceived quality was correlated with learning outcomes. Emotionally designed material lead to better learning outcomes per unit of time, but it didn’t affect students navigation in the material.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research area: User experience, University of Helsinki
Contributors: Nurminen, M., Leppänen, L., Väätäjä, H., Ihantola, P.
Number of pages: 7
Pages: 434-440
Publication date: 2017

Host publication information

Title of host publication: Data Driven Approaches in Digital Education - 12th European Conference on Technology Enhanced Learning, EC-TEL 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319666099

Publication series

Name: Lecture Notes in Computer Science
Volume: 10474
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Electronic learning material, Emotional design

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85029604212

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Stubborn set intuition explained

This study focuses on the differences between stubborn sets and other partial order methods. First a major problem with step graphs is pointed out with an example. Then the deadlock-preserving stubborn set method is compared to the deadlock-preserving ample set and persistent set methods. Next, conditions are discussed whose purpose is to ensure that the reduced state space preserves the ordering of visible transitions, that is, transitions that may change the truth values of the propositions that the formula under verification has been built from. Finally solutions to the ignoring problem are analysed both when the purpose is to preserve only safety properties and when also liveness properties are of interest.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Mathematics
Contributors: Valmari, A., Hansen, H.
Number of pages: 26
Pages: 140-165
Publication date: 2017

Host publication information

Title of host publication: Transactions on Petri Nets and Other Models of Concurrency XII
Publisher: Springer Verlag
ISBN (Print): 9783662558614

Publication series

Name: Lecture Notes in Computer Science
Volume: 10470
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85030723564

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Stubborn sets with frozen actions

Most ample, persistent, and stubborn set methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method that is based on “freezing” the actions in the cycle.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research group: Computer Science and Applied Logics
Contributors: Valmari, A.
Number of pages: 16
Pages: 160-175
Publication date: 2017

Host publication information

Title of host publication: Reachability Problems - 11th International Workshop, RP 2017, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319670881

Publication series

Name: Lecture Notes in Computer Science
Volume: 10506
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Ignoring problem, Partial-order methods, Safety properties, Stubborn sets

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85029459917

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

The time will tell on you: Exploring information leaks in SSH public key authentication

SSH client public key authentication method is one of the most used public key client authentication methods. Despite its popularity, the precise protocol is not very well known, and even advanced users may have misconceptions of its functionality. We describe the SSH public key authentication protocol, and identify potential weak points for client privacy. We further review parts of the OpenSSH implementation of the protocol, and identify possible timing attack information leaks. To evaluate the severity of these leaks we built a modified SSH-library that can be used to query the authentication method with arbitary public key blobs and measure the response time. We then use the resulting query timing differences to enumerate valid users and their key types. Furthermore, to advance the knowledge on remote timing attacks, we study the timing signal exploitability over a Tor Hidden Service (HS) connection and present filtering methods that make the attack twice as effective in the HS setting.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Research area: Information security
Contributors: Kannisto, J., Harju, J.
Number of pages: 14
Pages: 301-314
Publication date: 2017

Host publication information

Title of host publication: Network and System Security : 11th International Conference, NSS 2017, Helsinki, Finland, August 21–23, 2017, Proceedings
Publisher: Springer
ISBN (Print): 978-3-319-64700-5
ISBN (Electronic): 978-3-319-64701-2

Publication series

Name: Lecture Notes in Computer Science
Volume: 10394
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85028457856

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Time-dependent SIR analysis in shopping malls using fractal-based mobility models

Shopping malls are characterized by a high density of users. The use of direct device-to-device (D2D) communications may significantly mitigate the load imposed on the cellular systems in such environments. In addition to high user densities, the communicating entities are inherently mobile with very specific attractor-based mobility patterns. In this paper, we propose a model for characterizing time-dependent signal-to-interference ratio (SIR) in shopping malls. Particularly, we use fractional Fokker-Plank equation for modeling the non-linear functional of the average SIR value, defined on a stochastic fractal trajectory. The evolution equation of the average SIR is derived in terms of fractal motion of the tagged receiver and the interfering devices. We illustrate the use of our model by showing that the behavior of SIR is generally varying for different types of fractals.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Department of Applied Probability and Informatics, Peoples’ Friendship University of Russia
Contributors: Orlov, Y., Kirina-Lilinskaya, E., Samuylov, A., Ometov, A., Moltchanov, D., Gaimamaka, Y., Andreev, S., Samouylov, K.
Number of pages: 10
Pages: 16-25
Publication date: 2017

Host publication information

Title of host publication: Wired/Wireless Internet Communications - 15th IFIP WG 6.2 International Conference, WWIC 2017, Proceedings
Publisher: Springer
ISBN (Print): 9783319613819

Publication series

Name: Lecture Notes in Computer Science
Volume: 10372
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Average SIR evolution, Device-to-device communications, Fractal stochastic motion, Mobility, Time-dependent metrics

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85021707393

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Tor de-anonymisation techniques

Tor offers a censorship-resistant and distributed platform that can provide easy-to-implement anonymity to web users, websites, and other web services. Tor enables web servers to hide their location, and Tor users can connect to these authenticated hidden services while the server and the user both stay anonymous. However, throughout the years of Tor’s existence, some users have lost their anonymity. This paper discusses the technical limitations of anonymity and the operational security challenges that Tor users will encounter. We present a hands-on demonstration of anonymity exposures that leverage traffic correlation attacks, electronic fingerprinting, operational security failures, and remote code execution. Based on published research and our experience with these methods, we will discuss what they are and how some of them can be exploited. Also, open problems, solutions, and future plans are discussed.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pervasive Computing, Kinkayo Pte Ltd, Human-Centered Technology (IHTE)
Contributors: Nurmi, J., Niemelä, M. S.
Number of pages: 15
Pages: 657-671
Publication date: 2017

Host publication information

Title of host publication: Network and System Security : 11th International Conference, NSS 2017, Helsinki, Finland, August 21–23, 2017, Proceedings
Publisher: Springer
ISBN (Print): 978-3-319-64700-5
ISBN (Electronic): 978-3-319-64701-2

Publication series

Name: Lecture Notes in Computer Science
Volume: 10394
ISSN (Print): 0302-9743
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 85028453023

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Wired/Wireless Internet Communications: 15th IFIP WG 6.2 International Conference, WWIC 2017, St. Petersburg, Russia, June 21–23, 2017, Proceedings

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Research group: Wireless Communications and Positioning, University of Macedonia, Boston University, Peoples’ Friendship University of Russia
Contributors: Koucheryavy, Y. (ed.), Mamatas, L. (ed.), Matta, I. (ed.), Ometov, A. (ed.), Papadimitriou, P. (ed.)
Publication date: 2017

Publication information

Publisher: Springer
ISBN (Print): 978-3-319-61381-9
ISBN (Electronic): 978-3-319-61382-6
Original language: English

Publication series

Name: Lecture Notes in Computer Science
Volume: 10372
ISSN (Print): 0302-9743
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

jufoid=62555
EXT="Ometov, Aleksandr"

Source: Scopus
Source ID: 85021765523

Research output: Book/ReportAnthologyScientificpeer-review

A survey on internal interfaces used by exploits and implications on interface diversification

The idea of interface diversification is that internal interfaces in the system are transformed into unique secret instances. On one hand, the trusted programs in the system are accordingly modified so that they can use the diversified interfaces. On the other hand, the malicious code injected into a system does not know the diversification secret, that is the language of the diversified system, and thus it is rendered useless. Based on our study of 500 exploits, this paper surveys the different interfaces that are targeted in malware attacks and can potentially be diversified in order to prevent the malware from reaching its goals. In this study, we also explore which of the identified interfaces have already been covered in existing diversification research and which interfaces should be considered in future research. Moreover, we discuss the benefits and drawbacks of diversifying these interfaces. We conclude that diversification of various internal interfaces could prevent or mitigate roughly 80% of the analyzed exploits. Most interfaces we found have already been diversified as proof-of-concept implementations but diversification is not widely used in practical systems.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Turun Yliopisto/Turun Biomateriaalikeskus
Contributors: Rauti, S., Lauren, S., Uitto, J., Hosseinzadeh, S., Ruohonen, J., Hyrynsalmi, S., Leppänen, V.
Number of pages: 17
Pages: 152-168
Publication date: 2 Nov 2016

Host publication information

Title of host publication: Secure IT Systems - 21st Nordic Conference, NordSec 2016, Proceedings
Volume: 10014 LNCS
Publisher: Springer Verlag
ISBN (Print): 9783319475592

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 10014 LNCS
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Source: Scopus
Source ID: 84994520899

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Coverage and network requirements of a “Big Data” flash crowd monitoring system using users’ devices

Over the last decade aural and visual monitoring of massive people gatherings has become a critical problem of national security. Whenever possible a fixed infrastructure is used for this purpose. However, in case of spontaneous gatherings the infrastructure may not be available. In this paper, we propose the system for spontaneous “flash crowd” monitoring in areas with no fixed infrastructure. The basic concept is to engage users with their mobile devices to participate in the monitoring process. The system takes on characteristics of “big data” generators. We analyze the proposed system for coverage metrics and estimate the rate imposed on the wireless network. Our results show that given a certain level of participation the LTE network can support aural monitoring with prescribed guarantees. However, the modern LTE system cannot fully support visual monitoring as much more capacity is required. This capacity may potentially be provided by forthcoming millimeter wave and terahertz communications systems.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno
Contributors: Nguyen, A., Komarov, M., Moltchanov, D.
Number of pages: 11
Pages: 372-382
Publication date: 20 Sep 2016

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 16th International Conference, NEW2AN 2016 and 9th Conference, ruSMART 2016, Proceedings
Publisher: Springer International Publishing AG
ISBN (Print): 9783319463001

Publication series

Name: Lecture Notes in Computer Science
Volume: 9870
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Flash crowds, Monitoring, Visual and aural information

Bibliographical note

INT=elt,"Nguyen, An"
jufoid=62555

Source: Scopus
Source ID: 84989877649

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Dynamic trust management framework for robotic multi-agent systems

A lot of research attention has recently been dedicated to multi-agent systems, such as autonomous robots that demonstrate proactive and dynamic problem-solving behavior. Over the recent decades, there has been enormous development in various agent technologies, which enabled efficient provisioning of useful and convenient services across a multitude of fields. In many of these services, it is required that information security is guaranteed reliably. Unless there are certain guarantees, such services might observe significant deployment issues. In this paper, a novel trust management framework for multi-agent systems is developed that focuses on access control and node reputation management. It is further analyzed by utilizing a compromised device attack, which proves its suitability for practical utilization.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, ITMO University
Contributors: Zikratov, I., Maslennikov, O., Lebedev, I., Ometov, A., Andreev, S.
Number of pages: 10
Pages: 339-348
Publication date: 20 Sep 2016

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 16th International Conference, NEW2AN 2016 and 9th Conference, ruSMART 2016, Proceedings
Volume: 9870
Publisher: Springer International Publishing AG
ISBN (Print): 9783319463001

Publication series

Name: Lecture Notes in Computer Science
Volume: 9870
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Access control, Information security, Multi-agent systems, Trust management
Source: Scopus
Source ID: 84989853912

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Evaluating a case of downlink uplink decoupling using queuing system with random requirements

The need for efficient resource utilization at the air interfaces in heterogeneous wireless systems has recently led to the concept of downlink and uplink decoupling (DUDe). Several studies have already reported the gains of using DUDe in static traffic conditions. In this paper we investigate performance of DUDe with stochastic session arrivals patterns in LTE environment with macro and micro base stations. Particularly, we use a queuing systems with random resource requirements and to calculate the session blocking probability and throughput of the system. Our results demonstrate that DUDe association approach allows to significantly improve the metrics of interest compared to conventional downlink-based association mechanism.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Peoples’ Friendship University of Russia, Department of Applied Probability and Informatics, Peoples' Friendship University of Russia
Contributors: Sopin, E., Samouylov, K., Vikhrova, O., Kovalchukov, R., Moltchanov, D., Samuylov, A.
Number of pages: 11
Pages: 440-450
Publication date: 20 Sep 2016

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 16th International Conference, NEW2AN 2016 and 9th Conference, ruSMART 2016, Proceedings
Publisher: Springer International Publishing
ISBN (Print): 9783319463001

Publication series

Name: Lecture Notes in Computer Science
Volume: 9870
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: DL and UL decoupling, Heterogeneous networks, LTE-advanced, Pathloss, RBs allocation, Signal-to-noise ratio

Bibliographical note

jufoid=62555
EXT="Kovalchukov, Roman"

Source: Scopus
Source ID: 84989941177

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Intra-CPU traffic estimation and implications on networks-on-chip research

General purpose networks-on-chip (GP-NoC) are expected to feature tens or even hundreds of computational elements with complex communications infrastructure binding them into a connected network to achieve memory synchronization. The experience accumulated over the years in network design suggests that the knowledge of the traffic nature is mandatory for successful design of a networking technology. In this paper, based on the Intel CPU family, we describe traffic estimation techniques for modern multi-core GP-CPUs, discuss the traffic modeling procedure and highlight the implications of the traffic structure for GP-NoC research. The most important observation is that the traffic at internal interfaces appears to be random for external observer and has clearly identifiable batch structure.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, ITMO University, St. Petersburg State University
Contributors: Moltchanov, D., Kluchev, A., Kustarev, P., Borunova, K., Platunov, A.
Number of pages: 12
Pages: 453-464
Publication date: 20 Sep 2016

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 16th International Conference, NEW2AN 2016 and 9th Conference, ruSMART 2016, Proceedings
Publisher: Springer International Publishing AG
ISBN (Print): 9783319463001

Publication series

Name: Lecture Notes in Computer Science
Volume: 9870
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Intra-CPU communications, Networks on chip, Traffic estimation, Wireless network on chip
Source: Scopus
Source ID: 84989824537

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Optimizing network-assisted WLAN systems with aggressive channel utilization

Cellular network assistance over unlicensed spectrum technologies is a promising approach to improve the average system throughput and achieve better trade-off between latency and energy-efficiency in Wireless Local Area Networks (WLANs). However, the extent of ultimate user gains under network-assisted WLAN operation has not been explored sufficiently. In this paper, an analytical model for usercentric performance evaluation in such a system is presented. The model captures the throughput, energy efficiency, and access delay assuming aggressive WLAN channel utilization. In the second part of the paper, our formulations are validated with system-level simulations. Finally, the cases of possible unfair spectrum use are also discussed.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, ITMO University, St. Petersburg State University of Aerospace Instrumentation
Contributors: Ometov, A., Andreev, S., Levina, A., Bezzateev, S.
Number of pages: 13
Pages: 217-229
Publication date: 20 Sep 2016

Host publication information

Title of host publication: Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 16th International Conference, NEW2AN 2016 and 9th Conference, ruSMART 2016, Proceedings
Publisher: Springer International Publishing AG
ISBN (Print): 9783319463001

Publication series

Name: Lecture Notes in Computer Science
Volume: 9870
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Source: Scopus
Source ID: 84989826774

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Application and theory of Petri nets and other models of concurrency: Special issue of selected papers from Petri Nets 2015

General information

Publication status: Published
MoE publication type: B1 Article in a scientific magazine
Organisations: Department of Mathematics, Research group: MAT Computer Science and Applied Logics
Contributors: Devillers, R., Valmari, A., Penczek, W.
Pages: v-vi
Publication date: 13 Sep 2016
Peer-reviewed: No

Publication information

Journal: Fundamenta Informaticae
Volume: 146
Issue number: 1
ISSN (Print): 0169-2968
Ratings: 
  • Scopus rating (2016): CiteScore 1.8 SJR 0.371 SNIP 0.716
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Algebra and Number Theory, Information Systems, Computational Theory and Mathematics
Source: Scopus
Source ID: 84988662462

Research output: Contribution to journalEditorialScientific

Optimization of Flexible Filter Banks Based on Fast Convolution

Multirate filter banks can be implemented efficiently using fast-convolution (FC) processing. The main advantage of the FC filter banks (FC-FB) compared with the conventional polyphase implementations is their increased flexibility, that is, the number of channels, their bandwidths, and the center frequencies can be independently selected. In this paper, an approach to optimize the FC-FBs is proposed. First, a subband representation of the FC-FB is derived. Then, the optimization problems are formulated with the aid of the subband model. Finally, these problems are conveniently solved with the aid of a general nonlinear optimization algorithm. Several examples are included to demonstrate the proposed overall design scheme as well as to illustrate the efficiency and the flexibility of the resulting FC-FB.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Electronics and Communications Engineering, Research group: Wireless Communications and Positioning
Contributors: Yli-Kaakinen, J., Renfors, M.
Pages: 101-111
Publication date: Aug 2016
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
Volume: 85
Issue number: 1
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2016): CiteScore 1.6 SJR 0.212 SNIP 0.677
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Modelling and Simulation, Hardware and Architecture, Information Systems, Signal Processing, Theoretical Computer Science
Keywords: Digital filters, Filter banks, Multirate signal processing, Optimization, Sampling rate conversion
Source: Scopus
Source ID: 84929682954

Research output: Contribution to journalArticleScientificpeer-review

Fifty years of graph matching, network alignment and network comparison

In this paper we survey methods for performing a comparative graph analysis and explain the history, foundations and differences of such techniques of the last 50 years. While surveying these methods, we introduce a novel classification scheme by distinguishing between methods for deterministic and random graphs. We believe that this scheme is useful for a better understanding of the methods, their challenges and, finally, for applying the methods efficiently in an interdisciplinary setting of data science to solve a particular problem involving comparative network analysis.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Signal Processing
Contributors: Emmert-Streib, F., Dehmer, M., Shi, Y.
Number of pages: 18
Pages: 180-197
Publication date: 10 Jun 2016
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 346-347
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2016): CiteScore 8.6 SJR 1.781 SNIP 2.515
Original language: English
ASJC Scopus subject areas: Artificial Intelligence, Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management
Keywords: Biological networks, Computational graph theory, Graph matching, Network comparison, Network similarity, Quantitative graph theory
Source: Scopus
Source ID: 84964349574

Research output: Contribution to journalArticleScientificpeer-review

Constructing Minimal Coverability Sets

This publication addresses two bottlenecks in the construction of minimal coverability sets of Petri nets: the detection of situations where the marking of a place can be converted to ω, and the manipulation of the set A of maximal ω-markings that have been found so far. For the former, a technique is presented that consumes very little time in addition to what maintaining A consumes. It is based on Tarjan's algorithm for detecting maximal strongly connected components of a directed graph. For the latter, a data structure is introduced that resembles BDDs and Covering Sharing Trees, but has additional heuristics designed for the present use. Results from a few experiments are shown. They demonstrate significant savings in running time and varying savings in memory consumption compared to an earlier state-of-the-art technique.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Mathematics, Research group: MAT Computer Science and Applied Logics
Contributors: Piipponen, A., Valmari, A.
Number of pages: 22
Pages: 393-414
Publication date: 4 Mar 2016
Peer-reviewed: Yes

Publication information

Journal: Fundamenta Informaticae
Volume: 143
Issue number: 3-4
ISSN (Print): 0169-2968
Ratings: 
  • Scopus rating (2016): CiteScore 1.8 SJR 0.371 SNIP 0.716
Original language: English
ASJC Scopus subject areas: Information Systems, Computational Theory and Mathematics, Theoretical Computer Science, Algebra and Number Theory
Keywords: antichain data structure, coverability set, Tarjan's algorithm
Source: Scopus
Source ID: 84959877143

Research output: Contribution to journalArticleScientificpeer-review

A prospect for computing in porous materials research: Very large fluid flow simulations

Properties of porous materials, abundant both in nature and industry, have broad influences on societies via, e.g. oil recovery, erosion, and propagation of pollutants. The internal structure of many porous materials involves multiple scales which hinders research on the relation between structure and transport properties: typically laboratory experiments cannot distinguish contributions from individual scales while computer simulations cannot capture multiple scales due to limited capabilities. Thus the question arises how large domain sizes can in fact be simulated with modern computers. This question is here addressed using a realistic test case; it is demonstrated that current computing capabilities allow the direct pore-scale simulation of fluid flow in porous materials using system sizes far beyond what has been previously reported. The achieved system sizes allow the closing of some particular scale gaps in, e.g. soil and petroleum rock research. Specifically, a full steady-state fluid flow simulation in a porous material, represented with an unprecedented resolution for the given sample size, is reported: the simulation is executed on a CPU-based supercomputer and the 3D geometry involves 16,3843 lattice cells (around 590 billion of them are pore sites). Using half of this sample in a benchmark simulation on a GPU-based system, a sustained computational performance of 1.77 PFLOPS is observed. These advances expose new opportunities in porous materials research. The implementation techniques here utilized are standard except for the tailored high-performance data layouts as well as the indirect addressing scheme with a low memory overhead and the truly asynchronous data communication scheme in the case of CPU and GPU code versions, respectively.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Physics, Physics, University of Jyväskylä, Natural Resources Institute Finland (Luke), CENPES, Abo Akademi University
Contributors: Mattila, K., Puurtinen, T., Hyväluoma, J., Surmas, R., Myllys, M., Turpeinen, T., Robertsén, F., Westerholm, J., Timonen, J.
Number of pages: 15
Pages: 62-76
Publication date: 1 Jan 2016
Peer-reviewed: Yes

Publication information

Journal: Journal of Computational Science
Volume: 12
ISSN (Print): 1877-7503
Ratings: 
  • Scopus rating (2016): CiteScore 3.4 SJR 0.476 SNIP 1.356
Original language: English
ASJC Scopus subject areas: Computer Science(all), Modelling and Simulation, Theoretical Computer Science
Keywords: Fluid flow simulation, GPU, Lattice Boltzmann method, Permeability, Petascale computing, Porous material

Bibliographical note

INT=fys,"Mattila, Keijo"

Source: Scopus
Source ID: 84954140861

Research output: Contribution to journalArticleScientificpeer-review

Are software developers just users of development tools? Assessing developer experience of a graphical user interface designer

Software developers use software products to design and develop new software products for others to use. Research has introduced a concept of developer experience inspired by the concept of user experience but appreciating also the special characteristics of software development context. It is unclear what the experiential components of developer experience are and how it can be measured. In this paper we address developer experience of Vaadin Designer, a graphical user interface designer tool in terms of user experience, intrinsic motivation, and flow state experience. We surveyed 18 developers using AttrakDiff, flow state scale, intrinsic motivation inventory and our own DEXI scale and compare those responses to developers’ overall user experience assessment using Mann-Whitney U test. We found significant differences in motivational and flow state factors between groups who assessed the overall user experience either bad or good. Based on our results we discuss the factors that construe developer experience.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: User experience, University of Central Lancashire
Contributors: Kuusinen, K.
Number of pages: 19
Pages: 215-233
Publication date: 2016

Host publication information

Title of host publication: Human-Centered and Error-Resilient Systems Development - IFIP WG 13.2/13.5 Joint Working Conference 6th International Conference on Human-Centered Software Engineering, HCSE 2016 and 8th International Conference on Human Error, Safety, and System Development, HESSD 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-44901-2
ISBN (Electronic): 978-3-319-44902-9

Publication series

Name: Lecture Notes in Computer Science
Volume: 9856
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84986203561

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Backend infrastructure supporting audio augmented reality and storytelling

Today, museums are looking for new ways to attract and engage audience. These include virtual exhibitions, augmented reality and 3D modelling based applications, and interactive digital storytelling. The target of all these activities is to provide better experiences for audiences that are very familiar with the digital world. In augmented reality (AR) and interactive digital storytelling (IDS) systems, visual presentation has been dominant. In contrast to this trend, we have chosen to concentrate on auditory presentation. A key element for this is a backend service supporting different client applications. This paper discusses our experiences from designing a portable open source based audio digital asset management system (ADAM), which supports interaction with smart phones and tablets containing audio augmented reality and audio story applications. We have successfully implemented ADAM system and evaluated it in the Museum of Technology in Helsinki, Finland.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering, Helsinki Metropolia University of Applied Sciences
Contributors: Salo, K., Giova, D., Mikkonen, T.
Number of pages: 11
Pages: 325-335
Publication date: 2016

Host publication information

Title of host publication: Human Interface and the Management of Information: Applications and Services : 18th International Conference, HCI International 2016 Toronto, Canada, July 17-22, 2016. Proceedings, Part II
Publisher: Springer Verlag
ISBN (Print): 9783319403960

Publication series

Name: Lecture Notes in Computer Science
Volume: 9735
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Audio augmented reality, Digital asset management, Metadata, Open source DAM, Soundscape
Source: Scopus
Source ID: 84978903908

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Construction of enterprise architecture in discourses within the public sector

Enterprise Architecture (EA) has been employed in the public sector to improve efficiency and interoperability of information systems. Despite their daily use in the public sector, the concepts of Enterprise Architecture and efficiency are ambiguous and lack commonly accepted definitions. The benefits and outcomes of using EA in the public sector have been studied with mixed results. This study examined the use of EA in the Finnish basic education system using critical discourse analysis (CDA). The research revealed how the role and rationale of EA is constructed in the speech of public sector officials. Three orders of discourse, each having its own views on EA, were found. While there were commonly accepted functions for EA, there were also areas where the concepts were not mutually understood or accepted.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Information Management and Logistics
Contributors: Lemmetti, J.
Number of pages: 12
Pages: 287-298
Publication date: 2016

Host publication information

Title of host publication: Electronic Government - 15th IFIP WG 8.5 International Conference, EGOV 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-44420-8
ISBN (Electronic): 978-3-319-44421-5

Publication series

Name: Lecture Notes in Computer Science
Volume: 9820
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: CDA, Discourse analysis, Efficiency, Enterprise architecture, Public sector

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84984906720

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Coordinating decision-making in data management activities: A systematic review of data governance principles

More and more data is becoming available and is being combined which results in a need for data governance - the exercise of authority, control, and shared decision making over the management of data assets. Data governance provides organizations with the ability to ensure that data and information are managed appropriately, providing the right people with the right information at the right time. Despite its importance for achieving data quality, data governance has received scant attention by the scientific community. Research has focused on data governance structures and there has been only limited attention given to the underlying principles. This paper fills this gap and advances the knowledge base of data governance through a systematic review of literature and derives four principles for data governance that can be used by researchers to focus on important data governance issues, and by practitioners to develop an effective data governance strategy and approach.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Industrial Management, Delft University of Technology
Contributors: Brous, P., Janssen, M., Vilminko-Heikkinen, R.
Number of pages: 11
Pages: 115-125
Publication date: 2016

Host publication information

Title of host publication: Electronic Government - 15th IFIP WG 8.5 International Conference, EGOV 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-44420-8
ISBN (Electronic): 978-3-319-44421-5

Publication series

Name: Lecture Notes in Computer Science
Volume: 9820
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Data, Data governance, Data management, Data quality, E-Government, Governance

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84984918466

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Customer involvement in continuous deployment: A systematic literature review

[Context and motivation] In order to build successful software products and services, customer involvement and an understanding of customers’ requirements and behaviours during the development process are essential. [Question/Problem] Although continuous deployment is gaining attention in the software industry as an approach for continuously learning from customers, there is no common overview of the topic yet. [Principal ideas/results] To provide a common overview, we conduct a secondary study that explores the state of reported evidence on customer input during continuous deployment in software engineering, including the potential benefits, challenges, methods and tools of the field. [Contribution] We report on a systematic literature review covering 25 primary studies. Our analysis of these studies reveals that although customer involvement in continuous deployment is highly relevant in the software industry today, it has been relatively unexplored in academic research. The field is seen as beneficial, but there are a number of challenges related to it, such as misperceptions among customers. In addition to providing a comprehensive overview of the research field, we clarify the gaps in knowledge that need to be studied further.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: User experience, University of Helsinki, University of Oulu
Contributors: Yaman, S. G., Sauvola, T., Riungu-Kalliosaari, L., Hokkanen, L., Kuvaja, P., Oivo, M., Männistö, T.
Number of pages: 17
Pages: 249-265
Publication date: 2016

Host publication information

Title of host publication: Requirements Engineering: Foundation for Software Quality : 22nd International Working Conference, REFSQ 2016, Gothenburg, Sweden, March 14-17, 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319302812

Publication series

Name: Lecture Notes in Computer Science
Volume: 9619
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Continuous delivery, Continuous deployment, Customer feedback, Customer involvement, Software development, User feedback, User involvement

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84960908831

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Fair testing and stubborn sets

Partial-order methods alleviate state explosion by considering only a subset of transitions in each constructed state. The choice of the subset depends on the properties that the method promises to preserve. Many methods have been developed ranging from deadlockpreserving to CTL ∗-and divergence-sensitive branching bisimilarity preserving. The less the method preserves, the smaller state spaces it constructs. Fair testing equivalence unifies deadlocks with livelocks that cannot be exited, and ignores the other livelocks. It is the weakest congruence that preserves whether the ability to make progress can be lost. We prove that a method that was designed for trace equivalence also preserves fair testing equivalence. We describe a fast algorithm for computing high-quality subsets of transitions for the method, and demonstrate its effectiveness on a protocol with a connection and data transfer phase. This is the first practical partial-order method that deals with a practical fairness assumption.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Mathematics, University of Augsburg
Contributors: Valmari, A., Vogler, W.
Number of pages: 19
Pages: 225-243
Publication date: 2016

Host publication information

Title of host publication: Model Checking Software : 23rd International Symposium, SPIN 2016, Co-located with ETAPS 2016, Eindhoven, The Netherlands, April 7-8, 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319325811

Publication series

Name: Lecture Notes in Computer Science
Volume: 9641
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Fair testing equivalence, Fairness, Partial-order methods, Progress
Electronic versions: 
Source: Scopus
Source ID: 84963849997

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Global scale integral volumes

Integral volume is an important image representation technique, which is useful in many computer vision applications. Processing integral volumes for large scale 3D datasets is challenging due to high memory requirements. The difficulties lie in efficiently computing, storing, querying and updating the integral volume values. In this work, we address the above problems and present a novel solution for processing integral volumes for large scale 3D datasets efficiently. We propose an octree-based method where the worst-case complexity for querying the integral volume of arbitrary regions is O(log n), here n is the number of nodes in the octree. We evaluate our proposed method on multiresolution LiDAR point cloud data. Our work can serve as a tool to fast extract features from large scale 3D datasets, which can be beneficial for computer vision applications.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Video, Nokia
Contributors: Bhattacharya, S., Fan, L., Babahajiani, P., Gabbouj, M.
Number of pages: 13
Pages: 192-204
Publication date: 2016

Host publication information

Title of host publication: Computer Vision - ECCV 2016 Workshops, Proceedings
Volume: 9913
Publisher: Springer International Publishing
ISBN (Print): 9783319466033

Publication series

Name: Lecture Notes in Computer Science
Volume: 9913
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Integral volume, LiDAR, Octree, Point cloud

Bibliographical note

EXT="Babahajiani, Pouria"

Source: Scopus
Source ID: 84989905412

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

HTML5-based mobile agents for Web-of-Things

Systems and services utilizing Internet-of-Things can benefit from dynamically updated software in a significant way. In this paper we show how the most advanced variant of moving code, mobile agents, can be used for operating and managing Internet-connected systems composed of gadgets, sensors and actuators. We believe that the use of mobile agents brings several benefits, for example, mobile agents help to reduce the network load, overcome network latency, and encapsulate protocols. In addition, they can perform autonomous tasks that would otherwise require extensive configuration. The need for moving agents is even more significant if the applications and other factors of the over experience should follow the user to new contexts. When multiple agents are used to provide the user with services, some mechanisms to manage the agents are needed. In the context of Internet-of-Things such management should reflect the physical spaces and other relevant contexts. In this paper we describe the technical solutions used in implementation of the mobile agents, describe two proof concepts and we also compare our solution to related work. We also describe our visions of the future work.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Pervasive Computing, Research area: Software engineering
Contributors: Voutilainen, J. P., Mattila, A. L., Systä, K., Mikkonen, T.
Number of pages: 9
Pages: 43-51
Publication date: 2016
Peer-reviewed: Yes

Publication information

Journal: Informatica
Volume: 40
Issue number: 1
ISSN (Print): 0350-5596
Ratings: 
  • Scopus rating (2016): CiteScore 1.2 SJR 0.136 SNIP 0.461
Original language: English
ASJC Scopus subject areas: Computer Science Applications, Software, Artificial Intelligence, Theoretical Computer Science
Keywords: Html5, Internet-of-things, Javascript, Mobile agents, Web applications, Web-of-things
Source: Scopus
Source ID: 84963719558

Research output: Contribution to journalArticleScientificpeer-review

IEEE 802.11ac MIMO Transceiver Baseband Processing on a VLIW Processor

Wireless standards are evolving rapidly due to the exponential growth in the number of portable devices along with the applications with high data rate requirements. Adaptable software based signal processing implementations for these devices can make the deployment of the constantly evolving standards faster and less expensive. The flagship technology from the IEEE WLAN family, the IEEE 802.11ac, aims at achieving very high throughputs in local area connectivity scenarios. This article presents a software based implementation for the Multiple Input and Multiple Output (MIMO) transmitter and receiver baseband processing conforming to the IEEE 802.11ac standard which can achieve transmission bit rates beyond 1Gbps. This work focuses on the Physical layer frequency domain processing. Various configurations, including 2×2 and 4×4 MIMO are considered for the implementation. To utilize the available data and instruction level parallelism, a DSP core with vector extensions is selected as the implementation platform. Then, the feasibility of the presented software-based solution is assessed by studying the number of clock cycles and power consumption of the different scenarios implemented on this core. Such Software Defined Radio based approaches can potentially offer more flexibility, high energy efficiency, reduced design efforts and thus shorter time-to-market cycles in comparison with the conventional fixed-function hardware methods.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Electronics and Communications Engineering, Research group: Wireless Communications and Positioning, Department of Pervasive Computing, Research area: Computer engineering
Contributors: Aghababaeetafreshi, M., Lehtonen, L. K., Levanen, T., Valkama, M., Takala, J.
Publication date: 2016
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2016): CiteScore 1.6 SJR 0.212 SNIP 0.677
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Modelling and Simulation, Hardware and Architecture, Information Systems, Signal Processing, Theoretical Computer Science
Keywords: MIMO, OFDM, Parallel processing, Software defined radio, VLIW, WLAN

Bibliographical note

ORG=elt,0.5
ORG=tie,0.5

Source: Scopus
Source ID: 84942023616

Research output: Contribution to journalArticleScientificpeer-review

Implementing a broadcast storm attack on a mission-critical wireless sensor network

In this work, we emphasize the practical importance of mission-critical wireless sensor networks (WSNs) for structural health monitoring of industrial constructions. Due to its isolated and ad hoc nature, this type of WSN deployments is susceptible to a variety of malicious attacks that may disrupt the underlying crucial systems. Along these lines, we review and implement one such attack, named a broadcast storm, where an attacker is attempting to flood the network by sending numerous broadcast packets. Accordingly, we assemble a live prototype of said scenario with real-world WSN equipment, as well as measure the key operational parameters of the WSN under attack, including packet transmission delays and the corresponding loss ratios.We further develop a simple supportive mathematical model based on widely-adopted methods of queuing theory. It allows for accurate performance assessment as well as for predicting the expected system performance, which has been verified with statistical methods.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, ITMO University, Brno University of Technology
Contributors: Krivtsova, I., Lebedev, I., Sukhoparov, M., Bazhayev, N., Zikratov, I., Ometov, A., Andreev, S., Masek, P., Fujdiak, R., Hosek, J.
Number of pages: 12
Pages: 297-308
Publication date: 2016

Host publication information

Title of host publication: Wired/Wireless Internet Communications : 14th IFIP WG 6.2 International Conference, WWIC 2016, Thessaloniki, Greece, May 25-27, 2016, Proceedings
Volume: 9674
Publisher: Springer Verlag
ISBN (Print): 9783319339351

Publication series

Name: Lecture Notes in Computer Science
Volume: 9674
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Ad hoc networks, Device availability, Information security, Multi-agent systems, Prototyping, Vulnerability

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84979030733

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Instrumentation-Driven Validation of Dataflow Applications

Dataflow modeling offers a myriad of tools for designing and optimizing signal processing systems. A designer is able to take advantage of dataflow properties to effectively tune the system in connection with functionality and different performance metrics. However, a disparity in the specification of dataflow properties and the final implementation can lead to incorrect behavior that is difficult to detect. This motivates the problem of ensuring consistency between dataflow properties that are declared or otherwise assumed as part of dataflow-based application models, and the dataflow behavior that is exhibited by implementations that are derived from the models. In this paper, we address this problem by introducing a novel dataflow validation framework (DVF) that is able to identify disparities between an application’s formal dataflow representation and its implementation. DVF works by instrumenting the implementation of an application and monitoring the instrumentation data as the application executes. This monitoring process is streamlined so that DVF achieves validation without major overhead. We demonstrate the utility of our DVF through design and implementation case studies involving an automatic speech recognition application, a JPEG encoder, and an acoustic tracking application.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Department of Pervasive Computing, Research area: Computer engineering, Signal Processing Research Community (SPRC), University of Maryland, Technische Universitat Munchen, Institute for Advanced Computer Studies
Contributors: Chukhman, I., Jiao, Y., Salem, H. B., Bhattacharyya, S. S.
Pages: 383–397
Publication date: 2016
Peer-reviewed: Yes

Publication information

Journal: Journal of Signal Processing Systems
Volume: 84
Issue number: 3
ISSN (Print): 1939-8018
Ratings: 
  • Scopus rating (2016): CiteScore 1.6 SJR 0.212 SNIP 0.677
Original language: English
ASJC Scopus subject areas: Control and Systems Engineering, Modelling and Simulation, Hardware and Architecture, Information Systems, Signal Processing, Theoretical Computer Science
Keywords: Dataflow graphs, Design validation, Models of computation, Signal processing systems
Source: Scopus
Source ID: 84946128443

Research output: Contribution to journalArticleScientificpeer-review

IS acquisition characteristics in the public sector

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Information Management and Logistics, Research group: Novi
Contributors: Mäki-Lohiluoma, P., Hellsten, P., Pekkola, S.
Number of pages: 12
Pages: 164-175
Publication date: 2016

Host publication information

Title of host publication: Electronic Government - 15th IFIP WG 8.5 International Conference, EGOV 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319444208

Publication series

Name: Lecture Notes in Computer Science
Volume: 9820
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84984877026

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Mobile soundscape mixer – ready for action

Today, cultural organizations such as museums are seeking new ways to attract and engage audience. Augmented reality based applications are seen very promising. The target is to provide more interactive experiences for an audience with high familiarity of digital interaction. So far, visual presentation has been dominant in augmented reality systems. In contrast to this trend, we have chosen to concentrate on audio augmentation as user generated soundscapes. This paper discusses our approach, focusing on how to design and develop an easy-to-use and smoothly working Android application, which increases user interaction by developing soundscapes from building blocks stored in audio digital asset management system. We have successfully implemented applications for Android platform and evaluated their performance.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering, Helsinki Metropolia University of Applied Sciences
Contributors: Salo, K., Bauters, M., Mikkonen, T.
Number of pages: 13
Pages: 18-30
Publication date: 2016

Host publication information

Title of host publication: Mobile Web and Intelligent Information Systems - 13th International Conference, MobiWIS 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-44214-3
ISBN (Electronic): 978-3-319-44215-0

Publication series

Name: Lecture Notes in Computer Science
Volume: 9847
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Android, Audio Augmented Reality, Participatory design, Performance profiling, Research-based design, Soundscape, User centered design

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 84984813409

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

On the arity gap of finite functions: Results and applications

Let A be a finite set and B an arbitrary set with at least two elements. The arity gap of a function f : An → B is the minimum decrease in the number of essential variables when essential variables of f are identified. A non- Trivial fact is that the arity gap of such B-valued functions on A is at most |A|. Even less trivial to verify is the fact that the arity gap of B-valued functions on A with more than |A| essential variables is at most 2. These facts ask for a classification of B-valued functions on A in terms of their arity gap. In this paper, we survey what is known about this problem. We present a general characterization of the arity gap of B-valued functions on A and provide explicit classifications of the arity gap of Boolean and pseudo-Boolean functions. Moreover, we reveal unsettled questions related to this topic, and discuss links and possible applications of some results to other subjects of research.

General information

Publication status: Published
MoE publication type: A2 Review article in a scientific journal
Organisations: Department of Mathematics, Université de Lorraine, Department of Combinatorics and Optimization, University of Waterloo, Computer Science and Communications Research Unit, University of Luxembourg
Contributors: Couceiro, M., Lehtonen, E.
Number of pages: 15
Pages: 193-207
Publication date: 2016
Peer-reviewed: Yes

Publication information

Journal: Journal of Multiple-Valued Logic and Soft Computing
Volume: 27
Issue number: 2-3
ISSN (Print): 1542-3980
Ratings: 
  • Scopus rating (2016): CiteScore 0.9 SJR 0.26 SNIP 0.571
Original language: English
ASJC Scopus subject areas: Software, Logic, Theoretical Computer Science
Source: Scopus
Source ID: 84979953947

Research output: Contribution to journalReview ArticleScientificpeer-review

Operating system compositor and hardware usage to enhance graphical performance in web runtimes

Web runtimes are an essential part of the modern operating systems and their role will further grow in the future. Many web runtime implementations need to support multiple platforms and the design choices are driven by portability instead of optimized use of the underlying hardware. Thus, the implementations do not fully utilize the GPU and other graphics hardware. The consequence is reduced performance and increased power consumption. In this paper, we describe a way to improve the graphical performance of Chromium web runtime dramatically. In addition, the implementation aspects are discussed.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering, Huawei Technologies Oy
Contributors: Peuhkurinen, A., Fedorov, A., Systä, K.
Number of pages: 8
Pages: 381-388
Publication date: 2016

Host publication information

Title of host publication: Web Engineering : 16th International Conference, ICWE 2016, Lugano, Switzerland, June 6-9, 2016. Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319387901

Publication series

Name: Lecture Notes in Computer Science
Volume: 9671
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Graphics, Performance, Web runtimes
Source: Scopus
Source ID: 84977498329

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Private cloud deployment model in open-source mobile robots ecosystem

The focus of this paper is on secure cloud service platform for mobile robots ecosystem. Especially the emphasis is based on the scope of open-source software frameworks such as Apache Hadoop which offers numerous possibilities to employ open-source designing tools and deployment models for private cloud computing planning. This paper presents implementation of the OpenCRP (Open CloudRobotic Platform) locally-operated private cloud infrastructure and configuration methods by using Hadoop distributed file system (HDFS) for easing the ecosystem communications set-up in its entirety. For robot teleoperation, ROS (Robot Operating System) is used. The presented ecosystem utilizes security features for autonomous cloud robotic platform, software tools to manage user authentication and methods for large-scale robot-based data management and analysis. In addition to robot trial set-up of robot data storage and sharing, an ecosystem built with two low-cost mobile robots is presented.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pori Department, Telecommunications Research Center
Contributors: Oksa, P., Loula, P.
Number of pages: 10
Pages: 239-248
Publication date: 2016

Host publication information

Title of host publication: Towards Autonomous Robotic Systems : 17th Annual Conference, TAROS 2016, Sheffield, UK, June 26--July 1, 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-40378-6

Publication series

Name: Lecture Notes in Computer Science
Volume: 9716
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Cloud robotics, Ecosystem, Open-source, Private cloud

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84977481143

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Supporting management of hybrid OSS communnities - A stakeholder analysis approach

In Hybrid Open Source Software projects, independent and commercially oriented stakeholders collaborate using freely accessible tools and development processes. Here, contributors can enter and leave the community flexibly, which poses a challenge for community managers in ensuring the sustainability of the community. This short paper reports initial results from an industrial case study of the “Qt” Open Source Software project.We present a visual stakeholder analysis approach, building on data from the three systems that provide for the Qt project’s complete software development workflow. This overview, augmented with information about the stakeholders’ organizational affiliations, proved to help the project’s community manager in finding potential for encouraging contributors and to identify issues that can potentially be detrimental for the community.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering, University of Helsinki, The Qt Company
Contributors: Mäenpää, H., Kojo, T., Munezero, M., Fagerholm, F., Kilamo, T., Nurminen, M., Männistö, T.
Number of pages: 7
Pages: 102-108
Publication date: 2016

Host publication information

Title of host publication: Product-Focused Software Process Improvement - 17th International Conference, PROFES 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319490939

Publication series

Name: Lecture Notes in Computer Science
Volume: 10027
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Community management, Hybrid open source, Stakeholder identification

Bibliographical note

jufoid=62555

Source: Scopus
Source ID: 84998717629

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Synchronizing application state using virtual DOM trees

We will all soon have numerous computing devices we use every day interchangeably. Liquid software, a concept where software is allowed to flow from one computer to another, is a programming framework that aims at simplifying the development and use of such multi-device software. The existing research has discovered three major architecture challenges for liquid software: (1) adaptation of the user interface to different devices, (2) availability of the relevant data in all devices, and (3) transfer of the application state. This paper addresses the last challenge and differs from the earlier work by concentrating in application state that is in the DOM tree, a key element in today’s Web applications.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering, Gofore Ltd
Contributors: Voutilainen, J., Mikkonen, T., Systä, K.
Number of pages: 13
Pages: 142-154
Publication date: 2016

Host publication information

Title of host publication: Current Trends in Web Engineering : ICWE 2016 International Workshops DUI, TELERISE, SoWeMine, and Liquid Web, Revised Selected Papers
Publisher: Springer Verlag
ISBN (Print): 9783319469621

Publication series

Name: Lecture Notes in Computer Science
Volume: 9881
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Experience roaming, Liquid software, Multi-device ownership, Web programming

Bibliographical note

jufoid=62555
EXT="Voutilainen, Jari-Pekka"

Source: Scopus
Source ID: 84992692459

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

System design and analysis of UAV-assisted BLE wireless sensor systems

Inefficiency of wireless sensor networks (WSN) in terms of the network lifetime is one of the major reasons preventing their widespread use. To alleviate this problem different data collection approaches have been proposed. One of the promising techniques is to use unmanned aerial vehicle (UAV). In spite of several papers advocating this approach, there have been no system designs and associated performance evaluation proposed to date. In this paper, we address this issue by proposing a new WSN design, where UAV serves as a sink while Bluetooth low energy (BLE) is used as a communication technology. We analyze the proposed design in terms of the network lifetime and area coverage comparing it with routed WSNs. Our results reveal that the lifetime of the proposed design is approximately two orders of magnitude longer than that of the routed WSNs. Using the tools of integral geometry we show that the density of nodes to cover a certain area is approximately two times more for routed WSNs compared to our design.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Electronics and Communications Engineering, Research group: Emerging Technologies for Nano-Bio-Info-Cogno, Faculty of Business and Management, National Research University Higher School of Economics
Contributors: Komarov, M., Moltchanov, D.
Number of pages: 13
Pages: 284-296
Publication date: 2016

Host publication information

Title of host publication: Wired/Wireless Internet Communications : 14th IFIP WG 6.2 International Conference, WWIC 2016, Thessaloniki, Greece, May 25-27, 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319339351

Publication series

Name: Lecture Notes in Computer Science
Volume: 9674
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: BLE, Performance, Sensor networks, System design, UAV

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84979021289

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Temperature dependence of leakiness of transcription repression mechanisms of Escherichia coli

In E. coli, transcription repression is essential in cellular functioning. However, its failure rates are non-negligible. We measured the leakiness rate of lacO3O1 promoter with single RNA sensitivity and its temperature dependence in live cells. After finding strong temperature dependence, we dissected the causes. While RNA polymerase numbers and kt, the rate of active transcription, vary weakly with temperature, the repression strength (dependent on number of repressors and binding and unbinding rates of repressors to the promoter) is heavily temperature dependent. We conclude that the lacO3O1 leakiness at low temperatures increases as the repression mechanism’s efficiency hampers.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Laboratory of Biosystem Dynamics-LBD, Research group: Computational Systems Biology, Campus FCT-UNL
Contributors: Goncalves, N., Oliveira, S. M. D., Kandavalli, V. K., Fonseca, J. M., S. Ribeiro, A.
Number of pages: 2
Pages: 341-342
Publication date: 2016

Host publication information

Title of host publication: Computational Methods in Systems Biology - 14th International Conference, CMSB 2016
Publisher: Springer Verlag
ISBN (Print): 9783319451763

Publication series

Name: Lecture Notes in Computer Science
Volume: 9859
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: lacO3O1, Leakiness, MS2-GFP RNA detection, Repression, Time-lapse confocal microscopy, Transcription
Source: Scopus
Source ID: 84988524968

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

The developers dilemma: Perfect product development or fast business validation?

To find a fast-track to profitability, a startup needs to streamline and speed up two vital processes – developing novel products and finding new markets for their products. These two goals are typically opposed to each other, business development requiring quick iteration and product development requiring focus on quality. This difference in mindsets, where the focus should be on the balance of quality to the business experimentation causes a conflicting environment for the developers to develop products. This problem is aggravated in a startup environment, where the reasons for product failure are not clear, increasing the frustrations felt by the developers. Clear ways to communicate the product goals and even successes between management and developers is needed to create an environment for success. This balancing act between quality and speed to achieve fast product iteration is the developers dilemma.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering
Contributors: Terho, H., Suonsyrjä, S., Systä, K.
Number of pages: 9
Pages: 571-579
Publication date: 2016

Host publication information

Title of host publication: Product-Focused Software Process Improvement - 17th International Conference, PROFES 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319490939

Publication series

Name: Lecture Notes in Computer Science
Volume: 10027
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Agile, Business development, Lean startup, Prototyping, Software development, Startups

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84998996040

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Towards model construction based on test cases and GUI extraction

The adoption of model-based testing techniques is hindered by the difficulty of creating a test model. Various techniques to automate the modelling process have been proposed, based on software process artefacts or an existing product. This paper outlines a hybrid approach to model construction, based on two previously proposed methods. The presented approach combines information in pre-existing test cases with a model extracted from the graphical user interface of the product.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering
Contributors: Jääskeläinen, A.
Number of pages: 6
Pages: 225-230
Publication date: 2016

Host publication information

Title of host publication: Testing Software and Systems - 28th IFIP WG 6.1 International Conference, ICTSS 2016, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-47442-7

Publication series

Name: Lecture Notes in Computer Science
Volume: 9976
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Model extraction, Model-based testing, Software testing
Electronic versions: 

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84992445209

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Software evolution and time series volatility: An empirical exploration

The paper presents the first empirical study to examine econometric time series volatility modeling in the software evolution context. The econometric volatility concept is related to the conditional variance of a time series rather than the conditional mean targeted in conventional regression analysis. The software evolution context is motivated by relating these variance characteristics to the proximity of operating system releases, the theoretical hypothesis being that volatile characteristics increase nearby new milestone releases. The empirical experiment is done with a case study of FreeBSD. The analysis is carried out with 12 time series related to bug tracking, development activity, and communication. A historical period from 1995 to 2011 is covered under a daily sampling frequency. According to the results the time series dataset contains visible volatility characteristics, but these cannot be explained by the time windows around the six observed major FreeBSD releases. The paper consequently contributes to the software evolution research field with new methodological ideas, as well as with both positive and negative empirical results.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Managing digital industrial transformation (mDIT), University of Turku, Department of Information Technology
Contributors: Ruohonen, J., Hyrynsalmi, S., Leppänen, V.
Number of pages: 10
Pages: 56-65
Publication date: 30 Aug 2015

Host publication information

Title of host publication: 14th International Workshop on Principles of Software Evolution, IWPSE 2015 - Proceedings
Volume: 30-Aug-2015
Publisher: Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic): 9781450338165
ASJC Scopus subject areas: Software, Computational Theory and Mathematics, Modelling and Simulation, Theoretical Computer Science
Keywords: ARIMA, Code churn, Conditional variance, FreeBSD, GARCH, Software evolution, Time series analysis, Volatility
Source: Scopus
Source ID: 84958599161

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Automatic verification of Dafny programs with traits

This paper describes the design of traits, abstract superclasses, in the verification-aware programming language Dafny. Although there is no inheritance among classes in Dafny, the traits make it possible to describe behavior common to several classes and to write code that abstracts over the particular classes involved. The design incorporates behavioral specifications for a trait's methods and functions, just like for classes in Dafny. The design has been implemented in the Dafny tool.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Research Community on Data-to-Decision (D2D), Microsoft Research
Contributors: Ahmadi, R., Leino, K. R. M., Nummenmaa, J.
Publication date: 7 Jul 2015

Host publication information

Title of host publication: Proceedings for the 17th Workshop on Formal Techniques for Java-like Programs, FTfJP 2015: co-located with ECOOP 2015
Publisher: Association for Computing Machinery, Inc
Article number: a4
ISBN (Electronic): 9781450336567
ASJC Scopus subject areas: Computational Theory and Mathematics, Theoretical Computer Science
Keywords: Boogie, Dafny, Program verification, Traits
Source: Scopus
Source ID: 84958750086

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Accuracy evaluation of a linear positioning system for light field capture

In this paper a method has been proposed for estimating the positions of a moving camera attached to a linear positioning system (LPS). By comparing the estimated camera positions with the expected positions, which were calculated based on the LPS specifications, the manufacturer specified accuracy of the system, can be verified. Having this data, one can more accurately model the light field sampling process. The overall approach is illustrated on an inhouse assembled LPS.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Signal Processing Research Community (SPRC), Department of Signal Processing, Research group: 3D MEDIA
Contributors: Vagharshakyan, S., Durmush, A., Suominen, O., Bregovic, R., Gotchev, A.
Number of pages: 10
Pages: 388-397
Publication date: 2015

Host publication information

Title of host publication: Intelligent Information and Database Systems : 7th Asian Conference, ACIIDS 2015, Bali, Indonesia, March 23-25, 2015, Proceedings, Part II
Publisher: Springer Verlag
ISBN (Print): 9783319157047

Publication series

Name: Lecture Notes in Computer Science
Volume: 9012
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Electronic versions: 

Bibliographical note

AUX=sgn,"Durmush, Ahmed"

Source: Scopus
Source ID: 84925250800

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

A conceptual model towards the scaffolding of learning experience

The challenge of delivering personalized learning experiences is amplified by the size of classrooms and of online learning communities. In turn, serious games are increasingly recognized for their potential to improve education, but a typical requirement from instructors is to gain insight into how the students are playing. When we bring games into the rapidly growing online learning communities, the challenges multiply and hinder the potential effectiveness of serious games. There is a need to deliver a comprehensive, flexible and intelligent learning framework that facilitates better understanding of learners’ knowledge, effective assessment of their progress and continuous evaluation and optimization of the environments in which they learn. This paper aims to explore the potential in the use of games and learning analytics towards scaffolding and supporting teaching and learning experience. The conceptual model discussed aims to highlight key considerations that may advance the current state of learning analytics, adaptive learning and serious games, by leveraging serious games as an ideal medium for gathering data and performing adaptations. This opportunity has the potential to affect the design and deployment of education and training in the future.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Pori Department, Research group: TUT Game Lab, Regulation of learning and active learning methods (REALMEE), Coventry University, Universidad Complutense de Madrid, Herriot-Watt University, University of Northampton, Bremer Institut für Produktion und Logistik, University of Graz, Curtin University, Gruppo SIGLA S.r.l, Högskolan i Skövde, “Carol I” National Defence University
Contributors: Arnab, S., Ger, P. M., Lim, T., Lameras, P., Hendrix, M., Kiili, K., Hauge, J. B., Ninaus, M., de Freitas, S., Mazzetti, A., Dahlbom, A., Degano, C., Stanescu, I., Riveiro, M.
Number of pages: 14
Pages: 83-96
Publication date: 2015

Host publication information

Title of host publication: Third International Conference, GALA 2014, Bucharest, Romania, July 2-4, 2014
Volume: 9221
Publisher: Springer Verlag
ISBN (Print): 9783319229591

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9221
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84945951349

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Analysis of HVS-metrics’ properties using color image database TID2013

Various full-reference (FR) image quality metrics (indices) that take into account peculiarities of human vision system (HVS) have been proposed during last decade. Most of them have been already tested on several image databases including TID2013, a recently proposed database of distorted color images. Metrics performance is usually characterized by the rank order correlation coefficients of the considered metric and a mean opinion score (MOS). In this paper, we characterize HVS-metrics from another practically important viewpoint. We determine and analyze image statistics such as mean and standard deviation for several state of the art quality metrics on classes of images with multiple or particular types of distortions. This allows setting threshold value(s) for a given metric and application.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Signal Processing Research Community (SPRC), National Aerospace University
Contributors: Ponomarenko, N., Lukin, V., Astola, J., Egiazarian, K.
Number of pages: 12
Pages: 613-624
Publication date: 2015

Host publication information

Title of host publication: Advanced Concepts for Intelligent Vision Systems : 16th International Conference, ACIVS 2015, Catania, Italy, October 26-29, 2015. Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-25902-4
ISBN (Electronic): 978-3-319-25903-1

Publication series

Name: Lecture Notes in Computer Science
Volume: 9386
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Color image database, Full reference metrics, Mean opinion score, Threshold values, Visual quality
Source: Scopus
Source ID: 84949209257

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Application and Theory of Petri Nets and Concurrency: 36th International Conference, PETRI NETS 2015 Brussels, Belgium, June 21-26, 2015 Proceedings

General information

Publication status: Published
MoE publication type: C2 Edited books
Organisations: Department of Mathematics, Research group: MAT Computer Science and Applied Logics, Regulation of learning and active learning methods (REALMEE), Embedded Electronics research unit of the Bio Electro and Mechanical Systems (BEAMS) department of the Université Libre de Bruxelles
Contributors: Devillers, R. (ed.), Valmari, A. (ed.)
Publication date: 2015

Publication information

Publisher: Springer Verlag
Volume: 9115
ISBN (Print): 978-3-319-19487-5
ISBN (Electronic): 978-3-319-19488-2
Original language: English

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9115
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science

Bibliographical note

JUFOID=62555

Source: Scopus
Source ID: 84937510301

Research output: Book/ReportAnthologyScientificpeer-review

Applying finite state process algebra to formally specify a computational model of security requirements in the key2phone-mobile access solution

Key2phone is a mobile access solution which turns mobile phone into a key for electronic locks, doors and gates. In this paper, we elicit and analyse the essential and necessary safety and security requirements that need to be considered for the Key2phone interaction system. The paper elaborates on suggestions/solutions for the realisation of safety and security concerns considering the Internet of Things (IoT) infrastructure. The authors structure these requirements and illustrate particular computational solutions by deploying the Labelled Transition System Analyser (LTSA), a modelling tool that supports a process algebra notation called Finite State Process (FSP). While determining an integrated solution for this research study, the authors point to key quality factors for successful system functionality.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Information security, Intelligent dexterity for secure networked infrastructure and applications (IDSNIA), Augmented Human Activities (AHA), University of Tampere, Department of Computer Engineering and Information Technology of College of Information and Communication Technology at the University of Dar Es Salaam, University of Jyväskylä, Beijing Institute of Petrochemical Technology, Department of Computer Science and Information Systems, Finwe Ltd
Contributors: Chaudhary, S., Li, L., Berki, E., Helenius, M., Kela, J., Turunen, M.
Number of pages: 18
Pages: 128-145
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science
Publisher: Springer Verlag
ISBN (Print): 9783319194578

Publication series

Name: Lecture Notes in Computer Science
Volume: 9128
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science

Bibliographical note

EXT="Chaudhary, Sunil"

Source: Scopus
Source ID: 84931036213

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Bayesian statistical analysis for performance evaluation in real-time control systems

This paper presents a method for statistical analysis of hybrid systems affected by stochastic disturbances, such as random computation and communication delays. The method is applied to the analysis of a computer controlled digital hydraulic power management system, where such effects are present. Bayesian inference is used to perform parameter estimation and we use hypothesis testing based on Bayes factors to compare properties of different variants of the system to assess the impact of different random disturbances. The key idea is to use sequential sampling to generate only as many samples from the models as needed to achieve desired confidence in the result.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Intelligent Hydraulics and Automation, Research group: Digital hydraulics, Åbo Akademi University
Contributors: Boström, P., Heikkilä, M., Huova, M., Waldèn, M., Linjama, M.
Number of pages: 17
Pages: 312-328
Publication date: 2015

Host publication information

Title of host publication: Quantitative Evaluation of Systems : 12th International Conference, QEST 2015, Madrid, Spain, September 1-3, 2015, Proceedings
Volume: 9259
Publisher: Springer Verlag
ISBN (Print): 9783319222639

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9259
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84944789593

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Cache storage attacks

Covert channels are a fundamental concept for cryptanalytic side-channel attacks. Covert timing channels use latency to carry data, and are the foundation for timing and cache-timing attacks. Covert storage channels instead utilize existing system bits to carry data, and are not historically used for cryptanalytic side-channel attacks. This paper introduces a new storage channel made available through cache debug facilities on some embedded microprocessors. This channel is then extended to a cryptanalytic side-channel attack on AES software.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Information security, Intelligent dexterity for secure networked infrastructure and applications (IDSNIA)
Contributors: Brumley, B. B.
Number of pages: 13
Pages: 22-34
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Verlag
ISBN (Print): 9783319167145

Publication series

Name: Lecture Notes in Computer Science
Volume: 9048
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Cache-timing attacks, Covert channels, Side-channel attacks, Storage channels, Timing attacks
Electronic versions: 
Source: Scopus
Source ID: 84930422577

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Complex transforms

In this research paper, motivated by the concept of complex hypercube, a novel class of complex Hadamard matrices are proposed. Based on such class of matrices, a novel transform, called complex Hadamard transform is discussed. In the same spirit of this transform, other complex transforms such as complex Haar transform are proposed. It is expected that these novel complex transforms will find many applications. Also, the associated complex valued orthogonal functions are of theoretical interest.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Filterbanks
Contributors: Murthy, G. R., Saramäki, T.
Number of pages: 10
Pages: 382-391
Publication date: 2015

Host publication information

Title of host publication: Mining Intelligence and Knowledge Exploration : Third International Conference, MIKE 2015, Hyderabad, India, December 9-11, 2015, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-26831-6
ISBN (Electronic): 978-3-319-26832-3

Publication series

Name: Lecture Notes in Computer Science
Volume: 9468
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Complex signum function, Hadamard matrix, Transforms
Source: Scopus
Source ID: 84955284889

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Delayed key exchange for constrained smart devices

In the Internet of Things some nodes, especially sensors, can be constrained and sleepy, i.e., they spend extended periods of time in an inaccessible sleep state. Therefore, the services they offer may have to be accessed through gateways. Typically this requires that the gateway is trusted to store and transmit the data. However, if the gateway cannot be trusted, the data needs to be protected end-to-end. One way of achieving end-to-end security is to perform a key exchange, and secure the subsequent messages using the derived shared secrets. However, when the constrained nodes are sleepy this key exchange may have to be done in a delayed fashion. We present a novel way of utilizing the gateway in key exchange, without the possibility of it influencing or compromising the exchanged keys. The paper investigates the applicability of existing protocols for this purpose. Furthermore, due to a possible need for protocol translations, application layer use of the exchanged keys is examined.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Information security, Intelligent dexterity for secure networked infrastructure and applications (IDSNIA), Ericsson Research
Contributors: Kannisto, J., Heikkinen, S., Slavov, K., Harju, J.
Number of pages: 15
Pages: 12-26
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Verlag
ISBN (Print): 9783662463376

Publication series

Name: Lecture Notes in Computer Science
Volume: 8629
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84922776150

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Detecting and tracking the tips of fluorescently labeled mitochondria in U2OS cells

We present a method for automatically detecting the tips of fluorescently labeled mitochondria. The method is based on a Random Forest classifier, which is trained on small patches extracted from confocal microscope images of U2OS human osteosarcoma cells. We then adopt a particle tracking framework for tracking the detected tips, and quantify the tracking accuracy on simulated data. Finally, from images of U2OS cells, we quantify changes in mitochondrial mobility in response to the disassembly of microtubules via treatment with Nocodazole. The results show that our approach provides efficient tracking of the tips of mitochondria, and that it enables the detection of disease-associated changes in mitochondrial motility.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Laboratory of Biosystem Dynamics-LBD, Multi-scaled biodata analysis and modelling (MultiBAM), Radboud University Medical Center
Contributors: Lihavainen, E., Mäkelä, J., Spelbrink, J. N., Ribeiro, A. S.
Number of pages: 10
Pages: 363-372
Publication date: 2015

Host publication information

Title of host publication: Image Analysis and Processing — ICIAP 2015 : 18th International Conference, Genoa, Italy, September 7-11, 2015, Proceedings, Part II
Volume: 9280
Publisher: Springer Verlag
ISBN (Print): 9783319232331

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9280
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Detection, Image analysis, Mitochondria, Tracking
Source: Scopus
Source ID: 84944768777

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Diversification of system calls in linux binaries

This paper studies the idea of using large-scale diversification to protect operating systems and make malware ineffective. The idea is to first diversify the system call interface on a specific computer so that it becomes very challenging for a piece of malware to access resources, and to combine this with the recursive diversification of system library routines indirectly invoking system calls. Because of this unique diversification (i.e. a unique mapping of system call numbers), a large group of computers would have the same functionality but differently diversified software layers and user applications. A malicious program now becomes incompatible with its environment. The basic flaw of operating system monoculture - the vulnerability of all software to the same attacks - would be fixed this way. Specifically, we analyze the presence of system calls in the ELF binaries. We study the locations of system calls in the software layers of Linux and examine how many binaries in the whole system use system calls. Additionally, we discuss the different ways system calls are coded in ELF binaries and the challenges this causes for the diversification process. Also, we present a diversification tool and suggest several solutions to overcome the difficulties faced in system call diversification. The amount of problematic system calls is small, and our diversification tool manages to diversify the clear majority of system calls present in standard-like Linux configurations. For diversifying all the remaining system calls, we consider several possible approaches.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Managing digital industrial transformation (mDIT), University of Turku
Contributors: Rauti, S., Laurén, S., Hosseinzadeh, S., Mäkelä, J. M., Hyrynsalmi, S., Leppänen, V.
Number of pages: 21
Pages: 15-35
Publication date: 2015

Host publication information

Title of host publication: Trusted Systems - 6th International Conference, INTRUST 2014, Revised Selected Papers
Publisher: Springer Verlag
ISBN (Print): 9783319279978

Publication series

Name: Lecture Notes in Computer Science
Volume: 9473
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84958040185

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Existence and synthesis of complex hopfield type associative memories

In this research paper, a complex valued generalization of associative memory synthesized by Hopfield is considered and it is proved that it is impossible to synthesize such a neural network with desired unitary stable states when the dimension of the network (number of neurons) is odd. The linear algebraic structure of such a neural network is discussed. Using Sylvester construction of Hadamard matrix of suitable dimension, an algorithm to synthesize such a complex Hopfield neural network is discussed. Also, it is discussed how to synthesize real/complex valued associative memories with desired energy landscape (i.e. desired stable states and desired energy values of associated quadratic energy function).

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Video, Research Community on Data-to-Decision (D2D), International Institute of Information Technology Hyderabad
Contributors: Rama Murthy, G., Gabbouj, M.
Number of pages: 14
Pages: 356-369
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Verlag
ISBN (Print): 9783319192215

Publication series

Name: Lecture Notes in Computer Science
Volume: 9095
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84937710457

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Gender classification by LUT based boosting of overlapping block patterns

The paper addresses the problem of gender classification from face images. For feature extraction, we propose discrete Overlapping Block Patterns (OBP), which capture the characteristic structure from the image at various scales. Using integral images, these features can be computed in constant time. The feature extraction at multiple scales results in a high dimensionality and feature redundancy. Therefore, we apply a boosting algorithm for feature selection and classification. Look- Up Tables (LUT) are utilized as weak classifiers, which are appropriate to the discrete nature of the OBP features. The experiments are performed on two publicly available data sets, Labeled Faces in the Wild (LFW) and MOBIO. The results demonstrate that Local Binary Pattern (LBP) features with LUT boosting outperform the commonly used block-histogram-based LBP approaches and that OBP features gain over Multi-Block LBP (MB-LBP) features.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Idiap Research Institute
Contributors: Mehta, R., Günther, M., Marcel, S.
Number of pages: 13
Pages: 530-542
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Verlag
ISBN (Print): 9783319196640

Publication series

Name: Lecture Notes in Computer Science
Volume: 9127
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84947969005

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Interaction and humans in internet of things

Internet of Things is mainly about connected devices embedded in our everyday environment. Typically, ‘interaction’ in the context of IoT means interfaces which allow people to either monitor or configure IoT devices. Some examples include mobile applications and embedded touchscreens for control of various functions (e.g., heating, lights, and energy efficiency) in environments such as homes and offices. In some cases, humans are an explicit part of the scenario, such as in those cases where people are monitored (e.g., children and elderly) by IoT devices. Interaction in such applications is still quite straightforward, mainly consisting of traditional graphical interfaces, which often leads to clumsy co-existence of human and IoT devices. Thus, there is a need to investigate what kinds of interaction techniques could provide IoT to be more human oriented, what is the role of automation and interaction, and how human originated data can be used in IoT.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: User experience, Augmented Human Activities (AHA), University of Tampere, DFKI, Technische Universität Berlin, S1nn GmbH and Co. KG, University of Southern Denmark
Contributors: Turunen, M., Sonntag, D., Engelbrecht, K., Olsson, T., Schnelle-Walka, D., Lucero, A.
Number of pages: 4
Pages: 633-636
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science
Publisher: Springer Verlag
ISBN (Print): 9783319227221

Publication series

Name: Lecture Notes in Computer Science
Volume: 9299
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Automation, IoT, Novel interaction means
Source: Scopus
Source ID: 84945536922

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Life in the fast lane: Effect of language and calibration accuracy on the speed of text entry by gaze

Numerous techniques have been developed for text entry by gaze, and similarly, a number of evaluations have been carried out to determine the efficiency of the solutions. However, the results of the published experiments are inconclusive, and it is unclear what causes the difference in their findings. Here we look particularly at the effect of the language used in the experiment. A study where participants entered text both in English and in Finnish does not show an effect of language structure: the entry rates were reasonably close to each other. The role of other explaining factors, such as calibration accuracy and experimental procedure, are discussed.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Augmented Human Activities (AHA)
Contributors: Räihä, K. J.
Number of pages: 16
Pages: 402-417
Publication date: 2015

Host publication information

Title of host publication: Human-Computer Interaction – INTERACT 2015 - 15th IFIP TC 13 International Conference, Proceedings
Volume: 9296
Publisher: Springer Verlag
ISBN (Print): 9783319227009

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9296
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Comparative evaluation, Entry speed, Error rate, Gaze input, Longitudinal study, Performance, Text entry
Source: Scopus
Source ID: 84945576994

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Mining itemset-based distinguishing sequential patterns with gap constraint

Mining contrast sequential patterns, which are sequential patterns that characterize a given sequence class and distinguish that class from another given sequence class, has a wide range of applications including medical informatics, computational finance and consumer behavior analysis. In previous studies on contrast sequential pattern mining, each element in a sequence is a single item or symbol. This paper considers a more general case where each element in a sequence is a set of items. The associated contrast sequential patterns will be called itemsetbased distinguishing sequential patterns (itemset-DSP). After discussing the challenges on mining itemset-DSP, we present iDSP-Miner, a mining method with various pruning techniques, for mining itemset-DSPs that satisfy given support and gap constraint. In this study, we also propose a concise border-like representation (with exclusive bounds) for sets of similar itemset-DSPs and use that representation to improve efficiency of our proposed algorithm. Our empirical study using both real data and synthetic data demonstrates that iDSP-Miner is effective and efficient.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Research Community on Data-to-Decision (D2D), Sichuan University, Wright State University
Contributors: Yang, H., Duan, L., Dong, G., Nummenmaa, J., Tang, C., Li, X.
Number of pages: 16
Pages: 39-54
Publication date: 2015

Host publication information

Title of host publication: Database Systems for Advanced Applications - 20th International Conference, DASFAA 2015, Proceedings Hanoi, Vietnam, April 20-23, 2015 Proceedings, Part I
Volume: 9049
Publisher: Springer Verlag
ISBN (Print): 9783319181196

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9049
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Contrast mining, Itemset, Sequential pattern
Source: Scopus
Source ID: 84942565599

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Non-local sigma filter

This paper proposes a non-local modification of well-known sigma filter, Nonlocal Sigma filter (NSF), intended to suppress additive white Gaussian noise from images. Similarly to the Nonlocal Mean Filter (NLM), every output pixel value is computed as a nonlocal weighted average of pixels coming from similar patches to the patch around the current pixel. The main difference between the proposed NSF and NLM is in the following: there are pixels in NSF not used in a weighted averaging (if the difference between them and the central pixel value is above a predefined threshold value, and if the distance between patch neighborhood and the central patch neighborhood is greater than a second threshold value). The weights used to estimate the output pixel depend on the patch size as well as on a distance between considered and reference patches. The proposed filter is compared to its counter-parts, namely, the conventional sigma filter and the NLM filter. It is shown that NSF outperforms both of them in PSNR and visual quality metrics values, PSNR-HVS-M and MSSIM. In this paper, a novel filtering quality criterion that takes into account distortions introduced into processed images due to denoising is proposed. It is demonstrated that, according to this criterion, NSF has similar edge-detail preservation property as the conventional sigma filter but has better noise suppression ability.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Computational Imaging-CI, Signal Processing Research Community (SPRC), National Aerospace University
Contributors: Ponomarenko, N., Lukin, V., Astola, J., Egiazarian, K.
Number of pages: 11
Pages: 483-493
Publication date: 2015

Host publication information

Title of host publication: Image Analysis and Processing — ICIAP 2015 : 18th International Conference, Genoa, Italy, September 7-11, 2015, Proceedings, Part II
Volume: 9280
Publisher: Springer Verlag
ISBN (Print): 9783319232331

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9280
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Human perception, Image denoising, Image self-similarity, Non-local methods, Sigma filter, Similarity-based methods, Visual quality metrics
Source: Scopus
Source ID: 84944748361

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Remarks on characterization of bent functions in terms of gibbs dyadic derivatives

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Algebraic and Algorithmic Methods in Signal Processing AAMSP, Signal Processing Research Community (SPRC), University of Niš, Technical University of Dortmund
Contributors: Stanković, R. S., Astola, J. T., Moraga, C., Stanković, M., Gajić, D.
Number of pages: 8
Pages: 632-639
Publication date: 2015

Host publication information

Title of host publication: Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers
Publisher: Springer
ISBN (Print): 978-3-319-27339-6
ISBN (Electronic): 978-3-319-27340-2

Publication series

Name: Lecture Notes in Computer Science
Volume: 9520
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Bent functions, Dyadic derivatives, GPU, Walsh functions
Source: Scopus
Source ID: 84952325470

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Speaker verification using adaptive dictionaries in non-negative spectrogram deconvolution

This article presents a new method for speaker verification, which is based on the non-negative matrix deconvolution (NMD) of the magnitude spectrogram of an observed utterance. In contrast to typical methods known from the literature, which are based on the assumption that the desired signal dominates (for example GMM-UBM, joint factor analysis, i-vectors), compositional models such as NMD describe a recording as a non-negative combination of latent components. The proposed model represents a spectrogram of a signal as a sum of spectrotemporal patterns that span durations of order about 150 ms, while many state of the art automatic speaker recognition systems model a probability distribution of features extracted from much shorter excerpts of speech signal (about 50 ms). Longer patterns carry information about dynamical aspects of modeled signal, for example information about accent and articulation. We use a parametric dictionary in the NMD and the parameters of the dictionary carry information about the speakers’ identity. The experiments performed on the CHiME corpus show that with the proposed approach achieves equal error rate comparable to an i-vector based system.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Audio research group, Research Community on Data-to-Decision (D2D), Poznan University of Technology
Contributors: Drgas, S., Virtanen, T.
Number of pages: 8
Pages: 462-469
Publication date: 2015

Host publication information

Title of host publication: Latent Variable Analysis and Signal Separation : 12th International Conference, LVA/ICA 2015, Liberec, Czech Republic, August 25-28, 2015, Proceedings
Volume: 9237
Publisher: Springer Verlag
ISBN (Print): 9783319224817

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9237
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84944710306

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

The Extended 1-D (One-Dimensional) Discrete Phase Retrieval Problem

In this work we discuss some difficulties that can be encountered when one uses iterative methods for finding a solution of a onedimensional discrete phase retrieval problem. Iterative methods are widely used but, unfortunately, they often stagnate. We shall show that by using an extended form of the one-dimensional discrete phase retrieval problem, we can find a solution to the problem.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Signal Processing, Research group: Algebraic and Algorithmic Methods in Signal Processing AAMSP, Signal Processing Research Community (SPRC), Technical University of Cluj-NapocaUniversitatea Tehnica din Cluj-Napoca
Contributors: Rusu, C., Astola, J.
Number of pages: 8
Pages: 640-647
Publication date: 2015

Host publication information

Title of host publication: Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers
Publisher: Springer
ISBN (Print): 978-3-319-27339-6
ISBN (Electronic): 978-3-319-27340-2

Publication series

Name: Lecture Notes in Computer Science
Volume: 9520
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Phase retrieval, Signal reconstruction

Bibliographical note

EXT="Rusu, Corneliu"

Source: Scopus
Source ID: 84952332786

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Three positives make one negative: Public sector is procurement

The requirement specifications are centric in the IS acquisition process, also in public sector. In addition to the regulatory factors multiple stakeholders are often involved in the procurement process. Yet their expertise varies and is often limited to a narrow sector or a specific field. For this paper, we conducted a single case study on an IS acquisition in a middle-sized city. The function nominated a project manager for the project, with little if any prior experience of IS or of their acquisition. The counterpart in the CIO’s office had that knowledge but had little domain knowledge about the requirements. The third party involved was the Procurement and Tendering office. Having specialized in serving the variety of functions in that particular field, the specific areas become inevitably omitted. All three parties argued that their requirements specifications were good, if not great. We observed how such a trident, having reported successful completion of their duties, still missed the point. The tendering resulted in little short of a disaster; two projects were contested, and lost in the market court.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Information Management and Logistics, Research group: Novi, Managing digital industrial transformation (mDIT), Tampere University of Technology
Contributors: Alanne, A., Hellsten, P., Pekkola, S., Saarenpää, I.
Number of pages: 13
Pages: 321-333
Publication date: 2015

Host publication information

Title of host publication: Electronic Government : 14th IFIP WG 8.5 International Conference, EGOV 2015, Thessaloniki, Greece, August 30 -- September 2, 2015, Proceedings
Volume: 9248
Publisher: Springer Verlag
ISBN (Print): 9783319224787

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9248
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Case study, Information systems procurement, Public sector procurement

Bibliographical note

AUX=tlo,"Saarenpää, Iiris"

Source: Scopus
Source ID: 84944749274

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Towards liquid web applications

As the complexity of rich Web applications grows together with the power and number of Web browsers, the next Web engineering challenge to be addressed is to design and deploy Web applications to make coherent use of all devices. As users nowadays operate multiple personal computers, smart phones, tablets, and computing devices embedded into home appliances or cars, the architecture of current Web applications needs to be redesigned to enable what we call Liquid Software. Liquid Web applications not only can take full advantage of the computing, storage and communication resources available on all devices owned by the end user, but also can seamlessly and dynamically migrate from one device to another continuously following the user attention and usage context. In this paper we address the Liquid Software concept in the context of Web applications and survey to which extent and how current Web technologies can support its novel requirements.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Pervasive Computing, Research area: Software engineering, Intelligent dexterity for secure networked infrastructure and applications (IDSNIA), University of Lugano (USI)
Contributors: Mikkonen, T., Systä, K., Pautasso, C.
Number of pages: 10
Pages: 134-143
Publication date: 2015

Host publication information

Title of host publication: Engineering the Web in the Big Data Era : 15th International Conference, ICWE 2015, Rotterdam, The Netherlands, June 23-26, 2015, Proceedings
Publisher: Springer Verlag
ISBN (Print): 978-3-319-19889-7
ISBN (Electronic): 978-3-319-19890-3

Publication series

Name: Lecture Notes in Computer Science
Volume: 9114
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Source: Scopus
Source ID: 84937402708

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Vision-based trajectories planning for four wheels independently steered mobile robots with maximum allowable velocities

In this paper, we extend our previous work to introduce a novel vision-based trajectories planning method for four-wheel-steered mobile robots. Relying only on the overhead camera and by utilizing artificial potential fields and visual servoing concepts, we simultaneously, generate the synchronized trajectories for all wheels in the world coordinates with sufficient number of trajectories midpoints. The synchronized trajectories are used to provide the robot’s kinematic variables and robotinstantaneous-center of rotation to reduce the complexity of the robot kinematic model. Therefore, we plan maximum allowable velocities for all wheels so that at least one of the actuators is always working at maximum velocity. Experiment results are presented to illustrate the efficiency of the proposed method for four-wheel-steered mobile robot called iMoro.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Department of Intelligent Hydraulics and Automation, Research group: Mobile manipulation
Contributors: Ziaei, Z., Oftadeh, R., Mattila, J.
Number of pages: 7
Pages: 303-309
Publication date: 2015

Host publication information

Title of host publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9287
Publisher: Springer Verlag
ISBN (Print): 9783319224152

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9287
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Driving velocity planning, Steering velocity planning, Trajectories planning, Vision-based
Source: Scopus
Source ID: 84947080299

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

A computational approach to construct a multivariate complete graph invariant

In this paper, we present a computational approach for finding complete graph invariants. Specifically, we generate exhaustive sets of connected, non-isomorphic graphs with 9 and 10 vertices and demonstrate that a 97-dimensional multivariate graph invariant is capable to distinguish each of the non-isomorphic graphs. Furthermore, in order to tame the computational complexity of the problem caused by the vast number of graphs, e.g., involving over 10 million networks with 10 vertices, we suggest a low-dimensional, iterative procedure that is based on highly discriminative individual graph invariants. We show that also this computational approach leads to a perfect discrimination. Overall, our numerical results prove the existence of such graph invariants for networks with 9 and 10 vertices. Furthermore, we show that our iterative approach has a polynomial time complexity.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Research Community on Data-to-Decision (D2D), 6060 Hall in Tyrol, Computational Biology and Machine Learning, Queen's University, Belfast, Northern Ireland
Contributors: Dehmer, M., Emmert-Streib, F., Grabner, M.
Number of pages: 9
Pages: 200-208
Publication date: 1 Mar 2014
Peer-reviewed: Yes

Publication information

Journal: Information Sciences
Volume: 260
ISSN (Print): 0020-0255
Ratings: 
  • Scopus rating (2014): CiteScore 7.4 SJR 2.226 SNIP 3.198
Original language: English
ASJC Scopus subject areas: Artificial Intelligence, Software, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications, Information Systems and Management
Keywords: Information inequality, Quantitative graph theory, Random network model, Statistics
Source: Scopus
Source ID: 84891738883

Research output: Contribution to journalArticleScientificpeer-review

Audio-haptic car navigation interface with rhythmic tactons

While car environment is often noisy and driving requires visual attention, still navigation instructions are given with audio and visual feedbacks. By using rhythmic tactons together with audio, navigation task could be supported better in the driving context. In this paper we describe haptic-audio interface with simple two-actuator setup on the wheel using rhythmic tactons for supporting navigation in the car environment. The users who tested the interface with a driving game would choose audio-haptic interface over audio only interface for a real navigation task.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Augmented Human Activities (AHA), School of Management (JKK)
Contributors: Pakkanen, T., Raisamo, R., Surakka, V.
Number of pages: 8
Pages: 208-215
Publication date: 2014

Host publication information

Title of host publication: Haptics: Neuroscience, Devices, Modeling, and Applications - 9th International Conference, EuroHaptics 2014, Proceedings
Volume: 8618
Publisher: Springer Verlag
ISBN (Electronic): 9783662441923

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 8618
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Driving user, Haptic feedback, User interaction
Source: Scopus
Source ID: 84910123571

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Delayed haptic feedback to gaze gestures

Haptic feedback can improve the usability of gaze gestures in mobile devices. However, the benefit is highly sensitive to the exact timing of the feedback. In practical systems the processing and transmission of signals takes some time, and the feedback may be delayed. We conducted an experiment to determine limits on the feedback delays. The results show that when the delays increase to 200 ms or longer the task completion times are significantly longer than with shorter delays.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Augmented Human Activities (AHA), Tampere Unit for Computer-Human Interaction, School of Information Sciences, University of Tampere
Contributors: Kangas, J., Rantala, J., Akkil, D., Isokoski, P., Majaranta, P., Raisamo, R.
Number of pages: 7
Pages: 25-31
Publication date: 2014

Host publication information

Title of host publication: Haptics: Neuroscience, Devices, Modeling, and Applications - 9th International Conference, EuroHaptics 2014, Proceedings
Volume: 8618
Publisher: Springer Verlag
ISBN (Electronic): 9783662441923

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 8618
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Gaze interaction, Gaze tracking, Haptic feedback
Source: Scopus
Source ID: 84910138534

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Does visualization speed up the safety analysis process?

The goal of this paper is to present our experience in utilizing the power of the information visualization (InfoVis) field to accelerate the safety analysis process of Component Fault Trees (CFT) in embedded systems. For this, we designed and implemented an interactive visual tool called ESSAVis, which takes the CFT model as input and then calculates the required safety information (e.g., the information on minimal cut sets and their probabilities) that is needed to measure the safety criticality of the underlying system. ESSAVis uses this information to visualize the CFT model and allows users to interact with the produced visualization in order to extract the relevant information in a visual form. We compared ESSAVis with ESSaRel, a tool that models the CFT and represents the analysis results in textual form. We conducted a controlled user evaluation study where we invited 25 participants from different backgrounds, including 6 safety experts, to perform a set of tasks to analyze the safety aspects of a given system in both tools. We compared the results in terms of accuracy, efficiency, and level of user acceptance. The results of our study show a high acceptance ratio and higher accuracy with better performance for ESSAVis compared to the text-based tool ESSaRel. Based on the study results, we conclude that visual-based tools really help in analyzing the CFT model more accurately and efficiently. Moreover, the study opens the door to thoughts about how the power of visualization can be utilized in such domains to accelerate the safety assurance process in embedded systems.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: University of Kaiserslautern, Former organisation of the author
Contributors: Altarawneh, R., Steiner, M., Taibi, D., Humayoun, S. R., Liggesmeyer, P.
Number of pages: 13
Pages: 431-443
Publication date: 2014

Host publication information

Title of host publication: Computer Safety, Reliability, and Security - SAFECOMP 2014 Workshops : ASCoMS, DECSoS, DEVVARTS, ISSE, ReSA4CI, SASSUR, Proceedings
Volume: 8696 LNCS
Publisher: Springer Verlag
ISBN (Print): 9783319105567

Publication series

Name: Lecture Notes in Computer Science
Volume: 8696
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: Embedded Systems, Information Visualization, Safety Analysis
Source: Scopus
Source ID: 84907311649

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Do persuasive technologies persuade? - A review of empirical studies

This paper reviews the current body of empirical research on persuasive technologies (95 studies). In recent years, technology has been increasingly harnessed to persuade and motivate people to engage in various behaviors. This phenomenon has also attracted substantial scholarly interest over the last decade. This review examines the results, methods, measured behavioral and psychological outcomes, affordances in implemented persuasive systems, and domains of the studies in the current body of research on persuasive technologies. The reviewed studies have investigated diverse persuasive systems/designs, psychological factors, and behavioral outcomes. The results of the reviewed studies were categorized into fully positive, partially positive, and negative and/or no effects. This review provides an overview of the state of empirical research regarding persuasive technologies. The paper functions as a reference in positioning future research within the research stream of persuasive technologies in terms of the domain, the persuasive stimuli and the psychological and behavioral outcomes.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Mathematical modelling with wide societal impact (MathImpact), Aalto University
Contributors: Hamari, J., Koivisto, J., Pakkanen, T.
Number of pages: 19
Pages: 118-136
Publication date: 2014

Host publication information

Title of host publication: Persuasive Technology - 9th International Conference, PERSUASIVE 2014, Proceedings
Volume: 8462 LNCS
Publisher: Springer Verlag
ISBN (Print): 9783319071268

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 8462 LNCS
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: behavioral change support system, captology, game-based learning, gamification, health technology, motivational affordance, persuasive computing, persuasive technology, sustainability
Source: Scopus
Source ID: 84900556917

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Evaluation of user experience goal fulfillment: Case remote operator station

In this paper, the results of a user experience (UX) goal evaluation study are reported. The study was carried out as a part of a research and development project of a novel remote operator station (ROS) for container gantry crane operation in port yards. The objectives of the study were both to compare the UXs of two different user interface concepts and to give feedback on how well the UX goals experience of safe operation, sense of control, and feeling of presence are fulfilled with the developed ROS prototype. According to the results, the experience of safe operation and feeling of presence were not supported with the current version of the system. However, there was much better support for the fulfilment of the sense of control UX goal in the results. Methodologically, further work is needed in adapting the utilized Usability Case method to suit UX goal evaluation better.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: Augmented Human Activities (AHA), VTT Technical Research Centre of Finland, Jyväskylän yliopisto
Contributors: Karvonen, H., Koskinen, H., Tokkonen, H., Hakulinen, J.
Number of pages: 12
Pages: 366-377
Publication date: 2014

Host publication information

Title of host publication: Virtual, Augmented and Mixed Reality: Applications of Virtual and Augmented Reality - 6th International Conference, VAMR 2014, Held as Part of HCI International 2014, Proceedings
Volume: 8526 LNCS
Publisher: Springer Verlag
Edition: PART 2
ISBN (Print): 9783319074634

Publication series

Name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 8526 LNCS
No.: PART 2
ISSN (Print): 03029743
ISSN (Electronic): 16113349
ASJC Scopus subject areas: Computer Science(all), Theoretical Computer Science
Keywords: evaluation, remote operation, user experience, user experience goal
Source: Scopus
Source ID: 84903589690

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Interoperability-related architectural problems and solutions in information systems: A scoping study

[Context] With the increasing industrial demands for seamless exchange of data and services among information systems, architectural solutions are a promising research direction which supports high levels of interoperability at early development stages. [Objectives] This research aims at identifying the architectural problems and before-release solutions of interoperability on its different levels in information systems, and exploring the interoperability metrics and research methods used to evaluate identified solutions. [Methods] We performed a scoping study in five digital libraries and descriptively analyzed the results of the selected studies. [Results] From the 22 studies included, we extracted a number of architectural interoperability problems on the technical, syntactical, semantic, and pragmatic levels. Many problems are caused by systems' heterogeneity on data representation, meaning or context. The identified solutions include standards, ontologies, wrappers, or mediators. Evaluation methods to validate solutions mostly included toy examples rather than empirical studies. [Conclusions] Progress has been made in the software architecture research area to solve interoperability problems. Nevertheless, more researches need to be spent on solutions for the higher levels of interoperability accompanied with proper empirical evaluation for their effectiveness and usefulness.

General information

Publication status: Published
MoE publication type: A4 Article in a conference publication
Organisations: University of Kaiserslautern, Former organisation of the author
Contributors: Abukwaik, H., Taibi, D., Rombach, D.
Number of pages: 16
Pages: 308-323
Publication date: 2014

Host publication information

Title of host publication: Software Architecture - 8th European Conference, ECSA 2014, Proceedings
Publisher: Springer Verlag
ISBN (Print): 9783319099699

Publication series

Name: Lecture Notes in Computer Science
Volume: 8627
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: information systems, scoping study, software architecture, Software interoperability
Source: Scopus
Source ID: 84906330044

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Low-Power Reconfigurable Miniature Sensor Nodes for Condition Monitoring

Wireless sensor networks (WSNs) are being deployed at an escalating rate for various application fields. The ever growing number of application areas requires a diverse set of algorithms with disparate processing needs. WSNs also need to adapt to prevailing energy conditions and processing requirements. The preceding reasons rule out the use of a single fixed design. Instead, a general purpose design that can rapidly be adapted to different conditions and requirements is desired. In lieu of the traditional inflexible wireless sensor node consisting of a separate micro-controller, radio transceiver, sensor array and energy storage, we propose a unified rapidly reconfigurable miniature sensor node, implemented with a transport triggered architecture processor on a low-power Flash FPGA. To our knowledge, this is the first study of its kind. The proposed approach does not solely concentrate on energy efficiency but a high emphasis is also put on the ease of development perspective. Power consumption and silicon area usage comparison based on solutions implemented using our novel rapid design approach for wireless sensor nodes are performed. The comparison is performed between 16-bit fixed point, 16-bit floating point and 32-bit floating point implementations. The implemented processors and algorithms are intended for rolling bearing condition monitoring, but can be fully extended for other applications as well.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Signal Processing Research Community (SPRC), Univ of Oulu, Dept. of Computer Science and Engineering
Contributors: Nyländen, T., Boutellier, J., Nikunen, K., Hannuksela, J., Silvén, O.
Number of pages: 21
Pages: 3-23
Publication date: 2014
Peer-reviewed: Yes

Publication information

Journal: International Journal of Parallel Programming
Volume: 43
Issue number: 1
ISSN (Print): 0885-7458
Ratings: 
  • Scopus rating (2014): CiteScore 1.5 SJR 0.256 SNIP 1.046
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Software, Information Systems
Keywords: Application specific processors, Transport triggered architecture, Wireless sensor networks
Source: Scopus
Source ID: 84921701379

Research output: Contribution to journalArticleScientificpeer-review

Mining frequent closed sequential patterns with non-user-defined gap constraints

Frequent closed sequential pattern mining plays an important role in sequence data mining and has a wide range of applications in real life, such as protein sequence analysis, financial data investigation, and user behavior prediction. In previous studies, a user predefined gap constraint is considered in frequent closed sequential pattern mining as a parameter. However, it is difficult for users, who are lacking sufficient priori knowledge, to set suitable gap constraints. Furthermore, different gap constraints may lead to different results, and some useful patterns may be missed if the gap constraint is chosen inappropriately. To deal with this, we present a novel problem of mining frequent closed sequential patterns with non-user-defined gap constraints. In addition, we propose an efficient algorithm to find the frequent closed sequential patterns with the most suitable gap constraints. Our empirical study on protein data sets demonstrates that our algorithm is effective and efficient.

General information

Publication status: Published
MoE publication type: A1 Journal article-refereed
Organisations: Research Community on Data-to-Decision (D2D), Sichuan University, Wuhan University, Nanjing University of Posts and Telecommunications
Contributors: Wang, W., Duan, L., Nummenmaa, J., Deng, S., Li, Z., Yang, H., Tang, C.
Number of pages: 16
Pages: 55-70
Publication date: 2014
Peer-reviewed: Yes

Publication information

Journal: Lecture Notes in Computer Science
Volume: 8933
ISSN (Print): 0302-9743
Ratings: 
  • Scopus rating (2014): CiteScore 1.5 SJR 0.354 SNIP 0.756
Original language: English
ASJC Scopus subject areas: Theoretical Computer Science, Computer Science(all)
Keywords: Frequent closed sequential pattern, Gap constraint, Sequence data mining
Source: Scopus
Source ID: 84921722564

Research output: Contribution to journalArticleScientificpeer-review

Multi-view regularized extreme learning machine for human action recognition

In this paper, we propose an extension of the ELM algorithm that is able to exploit multiple action representations. This is achieved by incorporating proper regularization terms in the ELM optimization problem. In order to determine both optimized network weights and action representation combination weights, we propose an iterative optimization process. The proposed algorithm has been evaluated by using the state-of-the-art action video represe