Search

Your search keyword '"Vienna University of Technology"' showing total 235 results
Start Over Author "Vienna University of Technology" Topic computer science
235 results on '"Vienna University of Technology"'

1. Distributed information-theoretic biclustering

Author

Georg Pichler, Pablo Piantanida, Gerald Matz, Vienna University of Technology (TU Wien), Laboratoire des signaux et systèmes (L2S), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Institute for Telecommunications, Vienna University of Technology (Vienna University), and Piantanida, Pablo

Subjects
FOS: Computer and information sciences, Statistics and Probability, Computer Science - Machine Learning, Theoretical computer science, Logarithm, Computer science, Computer Science - Information Theory, Binary number, Distributed source coding, 02 engineering and technology, 01 natural sciences, Machine Learning (cs.LG), 010305 fluids & plasmas, Set (abstract data type), Biclustering, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Cardinality, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Redundancy (engineering), Special case, Cluster analysis, [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], Independence (probability theory), Statistical hypothesis testing, Discrete mathematics, Numerical Analysis, Information Theory (cs.IT), Applied Mathematics, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], Information bottleneck method, 020206 networking & telecommunications, Mutual information, Constraint (information theory), Computational Theory and Mathematics, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Analysis
Abstract

We study a novel multi-terminal source coding setup motivated by the biclustering problem. Two separate encoders observe two i.i.d. sequences $X^n$ and $Y^n$, respectively. The goal is to find rate-limited encodings $f(x^n)$ and $g(z^n)$ that maximize the mutual information $I(f(X^n); g(Y^n))/n$. We discuss connections of this problem with hypothesis testing against independence, pattern recognition, and the information bottleneck method. Improving previous cardinality bounds for the inner and outer bounds allows us to thoroughly study the special case of a binary symmetric source and to quantify the gap between the inner and the outer bound in this special case. Furthermore, we investigate a multiple description (MD) extension of the Chief Operating Officer (CEO) problem with mutual information constraint. Surprisingly, this MD-CEO problem permits a tight single-letter characterization of the achievable region., Comment: 30 pages, 4 figures, 1 table; published in Information and Inference

Published
2016

2. Sinusoidal Wave Estimation Using Photogrammetry and Short Video Sequences

Author

Ewelina Rupnik, Josef Jansa, Norbert Pfeifer, Laboratoire des Sciences et Technologies de l'Information Géographique (LaSTIG), École nationale des sciences géographiques (ENSG), Institut National de l'Information Géographique et Forestière [IGN] (IGN)-Institut National de l'Information Géographique et Forestière [IGN] (IGN), Vienna University of Technology (TU Wien), Dept Geodesy & Geoinformat, and Vienna University of Technology

Subjects
Surface (mathematics), sinusoidal wave, Computer science, Acoustics, water, Phase (waves), Bundle adjustment, lcsh:Chemical technology, System of linear equations, photogrammetry, video, Biochemistry, Least squares, Article, Analytical Chemistry, 3D modeling, Sine wave, Parametric surface, lcsh:TP1-1185, Computer vision, specular, Specular reflection, Electrical and Electronic Engineering, Dispersion (water waves), Instrumentation, ComputingMilieux_MISCELLANEOUS, dynamic, business.industry, Atomic and Molecular Physics, and Optics, non-rigid, bundle adjustment, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Reflection (physics), Artificial intelligence, business
Abstract

The objective of the work is to model the shape of the sinusoidal shape of regular water waves generated in a laboratory flume. The waves are traveling in time and render a smooth surface, with no white caps or foam. Two methods are proposed, treating the water as a diffuse and specular surface, respectively. In either case, the water is presumed to take the shape of a traveling sine wave, reducing the task of the 3D reconstruction to resolve the wave parameters. The first conceived method performs the modeling part purely in 3D space. Having triangulated the points in a separate phase via bundle adjustment, a sine wave is fitted into the data in a least squares manner. The second method presents a more complete approach for the entire calculation workflow beginning in the image space. The water is perceived as a specular surface, and the traveling specularities are the only observations visible to the cameras, observations that are notably single image. The depth ambiguity is removed given additional constraints encoded within the law of reflection and the modeled parametric surface. The observation and constraint equations compose a single system of equations that is solved with the method of least squares adjustment. The devised approaches are validated against the data coming from a capacitive level sensor and on physical targets floating on the surface. The outcomes agree to a high degree.

Published
2015
Full Text
View/download PDF

3. Nanometer-Scale Ge-Based Adaptable Transistors Providing Programmable Negative Differential Resistance Enabling Multivalued Logic

Author

Raphael Böckle, Masiar Sistani, Walter M. Weber, Minh Anh Luong, Alois Lugstein, Martien Den Hertog, David Falkensteiner, Vienna University of Technology (TU Wien), Laboratoire d'Etude des Matériaux par Microscopie Avancée (LEMMA ), Modélisation et Exploration des Matériaux (MEM), Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Grenoble Alpes (UGA)-Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Grenoble Alpes (UGA), Matériaux, Rayonnements, Structure (NEEL - MRS), Institut Néel (NEEL), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), and Université Grenoble Alpes (UGA)

Subjects
Operability, Computer science, Transistor, General Engineering, Nanowire, General Physics and Astronomy, law.invention, law, [PHYS.COND.CM-MS]Physics [physics]/Condensed Matter [cond-mat]/Materials Science [cond-mat.mtrl-sci], Electronic engineering, General Materials Science, Charge carrier, Electronics, Differential (infinitesimal), Polarity (mutual inductance), Hardware_LOGICDESIGN, Electronic circuit
Abstract

The functional diversification and adaptability of the elementary switching units of computational circuits are disruptive approaches for advancing electronics beyond the static capabilities of conventional complementary metal-oxide-semiconductor-based architectures. Thereto, in this work the one-dimensional nature of monocrystalline and monolithic Al-Ge-based nanowire heterostructures is exploited to deliver charge carrier polarity control and furthermore to enable distinct programmable negative differential resistance at runtime. The fusion of electron and hole conduction together with negative differential resistance in a universal adaptive transistor may enable energy-efficient reconfigurable circuits with multivalued operability that are inherent components of emerging artificial intelligence electronics.

Published
2021

4. When catalytic P systems with one catalyst can be computationally complete

Author

Rudolf Freund, Artiom Alhazov, Sergiu Ivanov, Vladimir Andrunachievici Institute of Mathematics and Computer Science, Faculty of Informatics, Vienna University of Technology (TU Wien), Informatique, BioInformatique, Systèmes Complexes (IBISC), and Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay

Subjects
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Catalytic rules, Computational complexity theory, Computer science, Applied Mathematics, P systems, Priority of catalytic rules, Derivation mode maxobjects, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Catalysis, Whole systems, Recursively enumerable language, Computational Theory and Mathematics, 010201 computation theory & mathematics, Theory of computation, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Completeness (statistics), Algorithm
Abstract

Catalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst in the whole system: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining computational completeness even with only one catalyst. In this paper, we show that one catalyst is sufficient for obtaining computational completeness if either catalytic rules have weak priority over non-catalytic rules or else instead of the standard maximally parallel derivation mode, we use the derivation mode maxobjects, i.e., we only take those multisets of rules which affect the maximal number of objects in the underlying configuration.

Published
2021

5. UIs Automatically Optimized for Your Smartphone

Author

Hermann Kaindl, Vienna University of Technology, Vienna University of Technology (TU Wien), Pedro Campos, Nicholas Graham, Joaquim Jorge, Nuno Nunes, Philippe Palanque, Marco Winckler, and TC 13

Subjects
Multimedia, Computer science, business.industry, 05 social sciences, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 020207 software engineering, 02 engineering and technology, computer.software_genre, (Semi-)automatic generation of user interfaces, Smartphones, Human–computer interaction, 0202 electrical engineering, electronic engineering, information engineering, automatic optimization for small devices, [INFO]Computer Science [cs], 0501 psychology and cognitive sciences, Use case, User interface, business, computer, 050107 human factors, Graphical user interface
Abstract

Part 1: Long and Short Papers; International audience; Graphical user interfaces (UIs) for PCs will most likely not fit relatively small screens of devices like today’s Smartphones. Providing dedicated UIs for several devices manually, however, is costly and takes time. Therefore, we have developed an approach to (semi-)automatic generation of UIs for various devices. A designer defines classes of dialogues in a device-independent discourse model. Such a discourse model can be also viewed as specifying classes of scenarios, i.e., use cases. It refers to a domain model that specifies the domain-of-discourse of the dialogues between user and application. From such models, we can generate UIs (semi-)automatically. Recently, we included in this generation process automatic optimization based on heuristic search. In effect, this tutorial shows that and how user interfaces can be automatically optimized for your Smartphone.

Published
2011

6. Programming at the edge of synchrony

Author

Josef Widder, Cezara Drăgoi, Damien Zufferey, Analyse Statique par Interprétation Abstraite (ANTIQUE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Vienna University of Technology (TU Wien), Max Planck Institute for Software Systems (MPI-SWS), Damien Zufferey is supported in part by the Deutsche Forschungsgemeinschaft project 389792660-TRR 248 and by the European Research Council under the Grant Agreement 610150 (http://www.impact-erc.eu/) (ERC Synergy Grant ImPACT). Most of the work was done while Cezara Drăgoi was at INRIA, France, supported by the French National Research Agency ANR project SAFTA (12744-ANR-17-CE25-0008-01). Cezara Drăgoi and Josef Widder are supported by Interchain Foundation., ANR-17-CE25-0008,SAFTA,Analyse statique des algorithmes distribués tolérants aux pannes(2017), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria de Paris

Subjects
Theoretical computer science, Computer science, 020206 networking & telecommunications, Fault tolerance, 02 engineering and technology, Distributed systems, Fault-tolerance, Synchrony, Asynchronous communication, Synchronization (computer science), Communication in small groups, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Enhanced Data Rates for GSM Evolution, Round Model, Safety, Risk, Reliability and Quality, Implementation, Protocol (object-oriented programming), Software, Abstraction (linguistics)
Abstract

Synchronization primitives for fault-tolerant distributed systems that ensure an effective and efficient cooperation among processes are an important challenge in the programming languages community. We present a new programming abstraction, ReSync, for implementing benign and Byzantine fault-tolerant protocols. ReSync has a new round structure that offers a simple abstraction for group communication, like it is customary in synchronous systems, but also allows messages to be received one by one, like in the asynchronous systems. This extension allows implementing network and algorithm-specific policies for the message reception, which is not possible in classic round models. The execution of ReSync programs is based on a new generic round switch protocol that generalizes the famous theoretical result about consensus in the presence of partial synchrony by of Dwork, Lynch, and Stockmeyer. We evaluate experimentally the performance of ReSync’s execution platform, by comparing consensus implementations in ReSync with LibPaxos3, etcd, and Bft-SMaRt, three consensus libraries tolerant to benign, resp. byzantine faults.

Published
2020

7. Consistency of Satellite Climate Data Records for Earth System Monitoring

Author

Emilio Chuvieco, Michael Buchwitz, Thomas Popp, Victoria Bennett, Ulrika Willén, Benoit Meyssignac, Stefan G. H. Simis, Frank Paul, Wouter Dorigo, Shubha Sathyendranath, Philippe Ciais, Shaun Quegan, Rainer Hollmann, Christopher J. Merchant, Annett Bartsch, Carsten Brockmann, Thomas Lavergne, Tracy Scanlon, Fabrice Ardhuin, Ana Bastos, Richard G. Jones, Michaela I. Hegglin, Darren Ghent, Marc Schröder, Jacqueline Boutin, Deutsches Zentrum für Luft- und Raumfahrt [Oberpfaffenhofen-Wessling] (DLR), University of Reading (UOR), Deutscher Wetterdienst [Offenbach] (DWD), Laboratoire d'Océanographie Physique et Spatiale (LOPS), Institut de Recherche pour le Développement (IRD)-Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS), Ludwig-Maximilians-Universität München (LMU), NERC National Centre for Earth Observation (NCEO), Natural Environment Research Council (NERC), STFC Rutherford Appleton Laboratory (RAL), Science and Technology Facilities Council (STFC), Processus et interactions de fine échelle océanique (PROTEO), Laboratoire d'Océanographie et du Climat : Expérimentations et Approches Numériques (LOCEAN), Institut Pierre-Simon-Laplace (IPSL (FR_636)), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-Institut de Recherche pour le Développement (IRD)-Muséum national d'Histoire naturelle (MNHN)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Institut Pierre-Simon-Laplace (IPSL (FR_636)), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-Institut de Recherche pour le Développement (IRD)-Muséum national d'Histoire naturelle (MNHN)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU), Institute of Environmental Physics [Bremen] (IUP), University of Bremen, Laboratoire des Sciences du Climat et de l'Environnement [Gif-sur-Yvette] (LSCE), Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), ICOS-ATC (ICOS-ATC), Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Department of Geodesy and Geoinformation [Wien], Vienna University of Technology (TU Wien), Met Office Hadley Centre for Climate Change (MOHC), United Kingdom Met Office [Exeter], Norwegian Meteorological Institute [Oslo] (MET), Laboratoire d'études en Géophysique et océanographie spatiales (LEGOS), Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Centre National de la Recherche Scientifique (CNRS), Department of Geography [Zürich], Universität Zürich [Zürich] = University of Zurich (UZH), School of Mathematics and Statistics [Sheffield] (SoMaS), University of Sheffield [Sheffield], Plymouth Marine Laboratory (PML), Plymouth Marine Laboratory, Swedish Meteorological and Hydrological Institute (SMHI), Institut de Recherche pour le Développement (IRD)-Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Institut national des sciences de l'Univers (INSU - CNRS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS), Muséum national d'Histoire naturelle (MNHN)-Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut Pierre-Simon-Laplace (IPSL (FR_636)), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Muséum national d'Histoire naturelle (MNHN)-Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institut Pierre-Simon-Laplace (IPSL (FR_636)), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Centre National de la Recherche Scientifique (CNRS), University of Zurich, and Popp, Thomas

Subjects
Atmospheric Science, 010504 meteorology & atmospheric sciences, Computer science, media_common.quotation_subject, Climate change, 010502 geochemistry & geophysics, computer.software_genre, 01 natural sciences, Task (project management), Consistency (database systems), Climate records, 1902 Atmospheric Science, 910 Geography & travel, [SDU.ENVI]Sciences of the Universe [physics]/Continental interfaces, environment, ComputingMilieux_MISCELLANEOUS, 0105 earth and related environmental sciences, media_common, [SDU.OCEAN]Sciences of the Universe [physics]/Ocean, Atmosphere, Remote sensing, Satellite observations, Metadata, Interdependence, Earth system science, 10122 Institute of Geography, 13. Climate action, Key (cryptography), Satellite, Data mining, Atmosphäre, computer
Abstract

Climate data records (CDRs) of essential climate variables (ECVs) as defined by the Global Climate Observing System (GCOS) derived from satellite instruments help to characterize the main components of the Earth system, to identify the state and evolution of its processes, and to constrain the budgets of key cycles of water, carbon, and energy. The Climate Change Initiative (CCI) of the European Space Agency (ESA) coordinates the derivation of CDRs for 21 GCOS ECVs. The combined use of multiple ECVs for Earth system science applications requires consistency between and across their respective CDRs. As a comprehensive definition for multi-ECV consistency is missing so far, this study proposes defining consistency on three levels: 1) consistency in format and metadata to facilitate their synergetic use (technical level); 2) consistency in assumptions and auxiliary datasets to minimize incompatibilities among datasets (retrieval level); and 3) consistency between combined or multiple CDRs within their estimated uncertainties or physical constraints (scientific level). Analyzing consistency between CDRs of multiple quantities is a challenging task and requires coordination between different observational communities, which is facilitated by the CCI program. The interdependencies of the satellite-based CDRs derived within the CCI program are analyzed to identify where consistency considerations are most important. The study also summarizes measures taken in CCI to ensure consistency on the technical level, and develops a concept for assessing consistency on the retrieval and scientific levels in the light of underlying physical knowledge. Finally, this study presents the current status of consistency between the CCI CDRs and future efforts needed to further improve it.

Published
2020

8. Tutorial: Parameterized Verification with Byzantine Model Checker

Author

Ilina Stoilkovska, Josef Widder, Igor Konnov, Marijana Lazić, Informal systems [Vienna], Technische Universität Munchen - Université Technique de Munich [Munich, Allemagne] (TUM), Vienna University of Technology (TU Wien), Alexey Gotsman, Ana Sokolova, TC 6, WG 6.1, and Technical University of Munich (TUM)

Subjects
Model checking, Theoretical computer science, Computer science, Parameterized complexity, Scale (descriptive set theory), 0102 computer and information sciences, 02 engineering and technology, Commit, 01 natural sciences, Article, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 010201 computation theory & mathematics, Distributed algorithm, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Resilience (network)
Abstract

Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems of distributed computing, such as reliable broadcast, two-phase commit, and consensus. Moreover, threshold guards can be found in recent blockchain algorithms such as Tendermint consensus. In this tutorial, we give an overview of the techniques implemented in Byzantine Model Checker (ByMC). ByMC implements several techniques for automatic verification of threshold-guarded distributed algorithms. These algorithms have the following features: (1) up to t of processes may crash or behave Byzantine; (2) the correct processes count messages and make progress when they receive sufficiently many messages, e.g., at least \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t+1$$\end{document}; (3) the number n of processes in the system is a parameter, as well as t; (4) and the parameters are restricted by a resilience condition, e.g., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n > 3t$$\end{document}. Traditionally, these algorithms were implemented in distributed systems with up to ten participating processes. Nowadays, they are implemented in distributed systems that involve hundreds or thousands of processes. To make sure that these algorithms are still correct for that scale, it is imperative to verify them for all possible values of the parameters.

Published
2020

9. Par means parallel: multiplicative linear logic proofs as concurrent functional programs

Author

Francesco A. Genco, Federico Aschieri, Technische Universität Wien (TU Wien), Institut d'Histoire et de Philosophie des Sciences et des Techniques (IHPST), Université Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS)-Département d'Etudes Cognitives - ENS Paris (DEC), École normale supérieure - Paris (ENS Paris)-École normale supérieure - Paris (ENS Paris), ANR-18-CE27-0012,IBS,INSIGHTS FROM BERNARD BOLZANO(2018), Vienna University of Technology (TU Wien), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), and ANR-18-CE27-0012,IBS,Intuitions Bolzaniennes(2018)

Subjects
Functional programming, Natural deduction, Interpretation (logic), ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, Computer science, Concurrency, Multiplicative function, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, Mathematical proof, 01 natural sciences, Linear logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, Algebra, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, 020204 information systems, Subject reduction, 0202 electrical engineering, electronic engineering, information engineering, Safety, Risk, Reliability and Quality, Software
Abstract

International audience; Along the lines of Abramsky's "Proofs-as-Processes" program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deduction system and show it is isomorphic to a simple and natural extension of λ-calculus with parallelism and communication primitives, called λpar. We shall prove that λpar satisfies all the desirable properties for a typed programming language: subject reduction, progress, strong normalization and confluence.

Published
2019

10. HyperLabels---Browsing of Dense and Hierarchical Molecular 3D Models

Author

David Kouril, Ivan Viola, Tobias Isenberg, M. Eduard Gröller, Barbora Kozlíková, Miriah Meyer, Vienna University of Technology (TU Wien), Analysis and Visualization (AVIZ), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Masaryk University [Brno] (MUNI), University of Utah, ANR-16-CE91-0011,ILLUSTRARE,Integrative Visual Abstraction of Molecular Data(2016), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), and Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
Structure (mathematical logic), 3D molecular data, Scientific visualization, HyperLabels, Computer science, business.industry, Orientation (computer vision), [SCCO.COMP]Cognitive science/Computer science, 020207 software engineering, 02 engineering and technology, Solid modeling, Computer Graphics and Computer-Aided Design, Visualization, multi-scale data, Data visualization, Human–computer interaction, Signal Processing, 0202 electrical engineering, electronic engineering, information engineering, hierarchical data, Computer Vision and Pattern Recognition, business, navigation, Spatial analysis, Software
Abstract

International audience; We present a method for the browsing of hierarchical 3D models in which we combine the typical navigation of hierarchical structures in a 2D environment---using clicks on nodes, links, or icons---with a 3D spatial data visualization. Our approach is motivated by large molecular models, for which the traditional single-scale navigational metaphors are not suitable. Multi-scale phenomena, e. g., in astronomy or geography, are complex to navigate due to their large data spaces and multi-level organization. Models from structural biology are in addition also densely crowded in space and scale. Cutaways are needed to show individual model subparts. The camera has to support exploration on the level of a whole virus, as well as on the level of a small molecule. We address these challenges by employing HyperLabels: active labels that---in addition to their annotational role---also support user interaction. Clicks on HyperLabels select the next structure to be explored. Then, we adjust the visualization to showcase the inner composition of the selected subpart and enable further exploration. Finally, we use a breadcrumbs panel for orientation and as a mechanism to traverse upwards in the model hierarchy. We demonstrate our concept of hierarchical 3D model browsing using two exemplary models from meso-scale biology.

Published
2021

11. Reset-control-based current tracking for a solenoid with unknown parameters

Author

Andreas Kugi, M. Schwegel, Luca Zaccarian, R. Bertollo, University of Trento [Trento], Vienna University of Technology (TU Wien), Austrian Institute of Technology [Vienna] (AIT), Dipartimento di Ingegneria Industriale [Trento], Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, ANR-18-CE40-0010,HANDY,Systèmes Dynamiques Hybrides et en Réseau(2018), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), and Université de Toulouse (UT)

Subjects
0209 industrial biotechnology, Computer science, 020208 electrical & electronic engineering, Feed forward, Solenoid, 02 engineering and technology, Tracking (particle physics), Stability (probability), Action (physics), [SPI.AUTO]Engineering Sciences [physics]/Automatic, 020901 industrial engineering & automation, Control and Systems Engineering, Control theory, 0202 electrical engineering, electronic engineering, information engineering, Current (fluid), Reset (computing)
Abstract

International audience; We propose a hybrid controller for reference tracking for the output current of a solenoid. The solenoid can be modeled as a first-order linear plant with unknown parameters. The proposed hybrid controller comprises 1) a feedforward action, based on an estimate of the unknown plant parameters exploiting a hybrid formulation of the recursive least-squares method, and 2) a feedback action, exploiting a reset control scheme based on a first-order reset element. We prove stability properties for the closed-loop system and we show through simulations that the current output converges to the reference for sufficiently exciting reference signals.

Published
2021

12. Error-Tolerant Reconfigurable VDD 10T SRAM Architecture for IoT Applications

Author

Santosh Kumar Vishvakarma, Ambika Prasad Shah, Neha Gupta, Patrick Girard, Sajid Khan, Michael Waltl, Indian Institute of Technology Indore (IITI), Indian Institute of Technology [Jammu] (IIT Jammu), Vienna University of Technology (TU Wien), TEST (TEST), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), and Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)

Subjects
IoT, TK7800-8360, Computer Networks and Communications, Computer science, 02 engineering and technology, Hardware_PERFORMANCEANDRELIABILITY, error-tolerant, supply voltage scaling, reconfigurable architecture, 0202 electrical engineering, electronic engineering, information engineering, Static random-access memory, Electrical and Electronic Engineering, [SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics, Scaling, Hardware_MEMORYSTRUCTURES, business.industry, 020208 electrical & electronic engineering, Electrical engineering, Failure rate, Dissipation, 020202 computer hardware & architecture, Power (physics), failure probability, CMOS, Hardware and Architecture, Control and Systems Engineering, Signal Processing, Node (circuits), Electronics, business, Voltage
Abstract

This paper proposes an error-tolerant reconfigurable VDD (R-VDD) scaled SRAM architecture, which significantly reduces the read and hold power using the supply voltage scaling technique. The data-dependent low-power 10T (D2LP10T) SRAM cell is used for the R-VDD scaled architecture with the improved stability and lower power consumption. The R-VDD scaled SRAM architecture is developed to avoid unessential read and hold power using VDD scaling. In this work, the cells are implemented and analyzed considering a technologically relevant 65 nm CMOS node. We analyze the failure probability during read, write, and hold mode, which shows that the proposed D2LP10T cell exhibits the lowest failure rate compared to other existing cells. Furthermore, the D2LP10T cell design offers 1.66×, 4.0×, and 1.15× higher write, read, and hold stability, respectively, as compared to the 6T cell. Moreover, leakage power, write power-delay-product (PDP), and read PDP has been reduced by 89.96%, 80.52%, and 59.80%, respectively, compared to the 6T SRAM cell at 0.4 V supply voltage. The functional improvement becomes even more apparent when the quality factor (QF) is evaluated, which is 458× higher for the proposed design than the 6T SRAM cell at 0.4 V supply voltage. A significant improvement of power dissipation, i.e., 46.07% and 74.55%, can also be observed for the R-VDD scaled architecture compared to the conventional array for the respective read and hold operation at 0.4 V supply voltage.

Published
2021

13. Deploying a Strategy to Unlock Big Data Research and Teaching Activities in the West Balkan Region

Author

Emanuel Sallinger, Damien Graux, Valentina Janev, Hajira Jabeen, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institute Mihajlo Pupin [Belgrade], University of Cologne, Institut für Informationssysteme [Wien], Vienna University of Technology (TU Wien), University of Oxford [Oxford], Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), and University of Oxford

Subjects
business.industry, Computer science, 05 social sciences, Big data, Applied computing, 050301 education, 02 engineering and technology, Data science, Education, Domain (software engineering), Order (exchange), Software deployment, 020204 information systems, Component (UML), 0202 electrical engineering, electronic engineering, information engineering, Information systems, [INFO]Computer Science [cs], business, 0503 education, Data management systems, Bespoke, ComputingMilieux_MISCELLANEOUS
Abstract

International audience; Big Data Analytics is a crucial component of the Big Data paradigm and deals with the extraction of knowledge from the enormous amount of data. As the number of Big Data related methods, tools, frameworks, and solutions is growing, there is a need to systematize the knowledge about the domain. Moreover, as this domain is rapidly involving, it is difficult to keep up to date with its latest and most efficient technologies; and this is thereby especially challenging for countries which have so far suffered from a lack of infrastructure in Big Data.In this article, we report on the deployment of a strategy we design, fostering the knowledge and awareness around the challenges of Big Data analytics in the West Balkan region. In particular, we describe how we joined forces across multiple European institutions in order to design bespoke actions (from, e.g. classes, to student exchanges) to be applied in Serbia and the West Balkan region over several years.

Published
2021

14. Neural Network Compression Through Shunt Connections and Knowledge Distillation for Semantic Segmentation Problems

Author

Matthias Wess, Alexander Wendt, Axel Jantsch, Bernhard Haas, Vienna University of Technology (TU Wien), Ilias Maglogiannis, John Macintyre, Lazaros Iliadis, TC 12, and WG 12.5

Subjects
Optimization, Scale (ratio), Computer science, Shunt connections, Latency (audio), MobileNet, 02 engineering and technology, Knowledge distillation, computer.software_genre, Convolutional neural network, 030218 nuclear medicine & medical imaging, 03 medical and health sciences, 0302 clinical medicine, Compression (functional analysis), Machine learning, 0202 electrical engineering, electronic engineering, information engineering, Code (cryptography), Segmentation, [INFO]Computer Science [cs], Accuracy, Artificial neural network, CIFAR, DeepLab, Shunt (medical), Embedded machine learning, Latency, 020201 artificial intelligence & image processing, Data mining, computer, Cityscapes
Abstract

Part 9: Deep Learning; International audience; Employing convolutional neural network models for large scale datasets represents a big challenge. Especially embedded devices with limited resources cannot run most state-of-the-art model architectures in real-time, necessary for many applications. This paper proves the applicability of shunt connections on large scale datasets and narrows this computational gap. Shunt connections is a proposed method for MobileNet compression. We are the first to provide results of shunt connections for the MobileNetV3 model and for segmentation tasks on the Cityscapes dataset, using the DeeplabV3 architecture, on which we achieve compression by 28%, while observing a 3.52 drop in mIoU. The training of shunt-inserted models are optimized through knowledge distillation. The full code used for this work will be available online.

Published
2021

15. A survey of challenges for runtime verification from advanced application domains (beyond software)

Author

Wolfgang Ahrendt, Domenico Bianculli, Srđan Krstić, Christian Colombo, Gerardo Schneider, Julien Signoles, Dmitriy Traytel, João Lourenço, Yliès Falcone, José Rufino, Gordon J. Pace, Adrian Francalanza, Alexander Weiss, César Sánchez, Dejan Nickovic, Ezio Bartocci, Institute IMDEA Software [Madrid], University of Gothenburg (GU), Chalmers University of Technology [Göteborg], Vienna University of Technology (TU Wien), Université du Luxembourg (Uni.lu), University of Malta [Malta], Université Grenoble Alpes - UFR Informatique et Mathématiques Appliquées (UGA UFR IMAG), Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Compiler Optimization and Run-time Systems (CORSE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Department of Computer Science [ETH Zürich] (D-INFK), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), Austrian Institute of Technology [Vienna] (AIT), Department of Computer Science [Malta], Laboratoire Sûreté des Logiciels (LSL), Département Ingénierie Logiciels et Systèmes (DILS), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Accemic Technologies GmbH, DI - Departamento de Informática, NOVALincs, European Cooperation in Science and Technology (COST) [sponsor], Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Software Verification and Validation Lab (SVV Lab) [research center], Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Laboratoire d'Intégration des Systèmes et des Technologies (LIST), and University of Edinburgh

Subjects
FOS: Computer and information sciences, Computer science, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, Runtime verification, Formal methods, Formal verification, Theoretical Computer Science, Computer Science - Software Engineering, Software, Computer software -- Verification, Formal specification, 0202 electrical engineering, electronic engineering, information engineering, Instrumentation (computer programming), TRACE (psycholinguistics), Formal methods (Computer science), Computer science [C05] [Engineering, computing & technology], Computational model, business.industry, 020207 software engineering, Sciences informatiques [C05] [Ingénierie, informatique & technologie], Software Engineering (cs.SE), Hardware and Architecture, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, 020201 artificial intelligence & image processing, Software engineering, business
Abstract

Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification., Formal Methods in System Design, 54 (3), ISSN:0925-9856, ISSN:1572-8102

Published
2019

16. TLA+ model checking made symbolic

Author

Igor Konnov, Thanh-Hai Tran, Jure Kukovec, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Proof-oriented development of computer-based systems (MOSEL), Department of Formal Methods (LORIA - FM), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Vienna University of Technology (TU Wien), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Max-Planck-Institut für Informatik (MPII), and Max-Planck-Gesellschaft-Max-Planck-Gesellschaft

Subjects
Model checking, Exploit, Relation (database), Computer science, Programming language, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, computer.software_genre, Language primitive, TLA+, SMT, 020204 information systems, Formal specification, 0202 electrical engineering, electronic engineering, information engineering, State (computer science), Tuple, Safety, Risk, Reliability and Quality, Boolean data type, computer, Software
Abstract

TLA+ is a language for formal specification of all kinds of computer systems. System designers use this language to specify concurrent, distributed, and fault-tolerant protocols, which are traditionally presented in pseudo-code. TLA+ is extremely concise yet expressive: The language primitives include Booleans, integers, functions, tuples, records, sequences, and sets thereof, which can be also nested. This is probably why the only model checker for TLA+ (called TLC) relies on explicit enumeration of values and states. In this paper, we present APALACHE -- a first symbolic model checker for TLA+. Like TLC, it assumes that all specification parameters are fixed and all states are finite structures. Unlike TLC, APALACHE translates the underlying transition relation into quantifier-free SMT constraints, which allows us to exploit the power of SMT solvers. Designing this translation is the central challenge that we address in this paper. Our experiments show that APALACHE outperforms TLC on examples with large state spaces.

Published
2019

17. Variants of P systems with activation and blocking of rules

Author

Sergiu Ivanov, Artiom Alhazov, Rudolf Freund, Vladimir Andrunachievici Institute of Mathematics and Computer Science, Faculty of Informatics, Vienna University of Technology (TU Wien), Informatique, BioInformatique, Systèmes Complexes (IBISC), and Université d'Évry-Val-d'Essonne (UEVE)

Subjects
Theoretical computer science, Computer science, Semantics (computer science), P systems, Complex system, 0102 computer and information sciences, 02 engineering and technology, Go beyond Turing, 01 natural sciences, Set (abstract data type), Activation of rules, Blocking of rules, 0202 electrical engineering, electronic engineering, information engineering, Derivation modes, Control (linguistics), Turing, computer.programming_language, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Computational completeness, 16. Peace & justice, Blocking (computing), Computer Science Applications, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], 010201 computation theory & mathematics, Theory of computation, 020201 artificial intelligence & image processing, Completeness (statistics), computer
Abstract

International audience; We introduce new possibilities to control the application of rules based on the preceding applications, which can be defined in a general way for (hierarchical) P systems and the main known derivation modes. Computational completeness can be obtained even with non-cooperative rules and using both activation and blocking of rules, especially for the set modes of derivation, when allowing derivation steps with no rules being applied. When we allow the application of rules to influence the application of rules in previous derivation steps, applying a non-conservative semantics for what we consider to be a valid infinite derivation, we can even “go beyond Turing”.

Published
2019

18. Design of Fault-Tolerant and Thermally Stable XOR Gate in Quantum dot Cellular Automata

Author

Syed Farah Naz, Patrick Girard, Michael Waltl, Ambika Prasad Shah, Suhaib Ahmed, Indian Institute of Technology [Jammu] (IIT Jammu), University Rajouri, TEST (TEST), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), and Vienna University of Technology (TU Wien)

Subjects
Digital electronics, Quantum dot cellular automata, business.industry, Computer science, Reliability (computer networking), fault tolerant design, Quantum dot cellular automaton, Fault tolerance, Hardware_PERFORMANCEANDRELIABILITY, Topology, Signal, Cellular automaton, nanoelectronics, Logic gate, Hardware_INTEGRATEDCIRCUITS, [SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics, business, XOR gate, Hardware_LOGICDESIGN
Abstract

International audience; In this paper, a new XOR gate is discussed in quantum-dot cellular automata (QCA). The proposed gate is a single layer structure with no crossovers, and has been designed with redundant cells to increase the amplitude of the output signal and to improve the fault tolerance and reliability of the circuit. Based on the performance comparison, the investigated XOR gate has very high fault tolerance to single-cell addition and single-cell omission defects, thereby making them suitable candidates for designing reliable QCA based digital circuits.

Published
2021

19. Generation of a fault-tolerant clock through redundant crystal oscillators

Author

Matthias Függer, Wolfgang Dür, Andreas Steininger, Vienna University of Technology (TU Wien), Institute of Computer Engineering [Vienna], Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Modeling and Exploitation of Interaction and Concurrency (MEXICO), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), and Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)

Subjects
[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Correctness, Computer science, 02 engineering and technology, Topology, 01 natural sciences, Formal proof, Computer Science::Hardware Architecture, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Independent clock, Electrical and Electronic Engineering, Safety, Risk, Reliability and Quality, 010302 applied physics, 020208 electrical & electronic engineering, Skew, Fault tolerance, Condensed Matter Physics, Atomic and Molecular Physics, and Optics, Surfaces, Coatings and Films, Electronic, Optical and Magnetic Materials, Clock network, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Single point of failure, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Crystal oscillator
Abstract

International audience; Having a precise and stable clock that is still fault tolerant is a fundamental prerequisite in safety critical realtime systems. However, combining redundant independent clock sources to form a unified fault-tolerant clock supply is non-trivial, especially when redundant clock outputs are required-e.g., for supplying the replicated nodes within a TMR architecture through a clock network that does not suffer from a single point of failure. Having these outputs fail independent but still keeping them tightly synchronized is highly desirable, as it substantially eases the design of the overall architecture. In this paper we address exactly this challenge. Our approach extends an existing, ring-oscillator like distributed clock generation scheme by augmenting each of its constituent nodes with a stable clock reference. We introduce the appropriately modified algorithm and illustrate its operation by simulation experiments. These experiments further demonstrate that the four clock outputs of our circuit do not share a single point of failure, have small and bounded skew, remain stabilized to one crystal source during normal operation, do not propagate glitches from one failed clock to a correct one, and only exhibit slightly extended clock cycles during a short stabilization period after a component failure. In addition we give a rigorous formal proof for the correctness of the algorithm on an abstraction level that is close to the implementation.

Published
2021

20. Exploring behaviour towards avatars and agents in immersive virtual environments with mixed-agency interactions

Author

Ludovic Hoyet, Katja Zibrek, Anne-Hélène Olivier, Julien Pettré, Iana Podkosova, Vienna University of Technology (TU Wien), Analysis-Synthesis Approach for Virtual Human Simulation (MIMETIC), Université de Rennes 2 (UR2)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Sensor-based and interactive robotics (RAINBOW), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Laboratoire Mouvement Sport Santé (M2S), Université de Rennes (UR)-École normale supérieure - Rennes (ENS Rennes)-Université de Brest (UBO)-Université de Rennes 2 (UR2)-Structure Fédérative de Recherche en Biologie et Santé de Rennes ( Biosit : Biologie - Santé - Innovation Technologique ), scholarship Sejour Scientifique de Haut Niveau of the French Ministry of Europe and Foreign Affaires, Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Inria Rennes – Bretagne Atlantique, Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), École normale supérieure - Cachan (ENS Cachan)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Brest (UBO)-Université de Rennes 2 (UR2), and Université de Rennes (UNIV-RENNES)-Structure Fédérative de Recherche en Biologie et Santé de Rennes ( Biosit : Biologie - Santé - Innovation Technologique )

Subjects
Avatars, Computer science, [SDV]Life Sciences [q-bio], 05 social sciences, Control (management), 020207 software engineering, Virtual agent, 02 engineering and technology, Scheduling (computing), Future study, Collaborative Virtual Reality, Embodied cognition, Human–computer interaction, Virtual Agents, Agency (sociology), 0202 electrical engineering, electronic engineering, information engineering, Natural (music), 0501 psychology and cognitive sciences, Recreation, 050107 human factors
Abstract

International audience; Immersive virtual environments (IVEs) in which multiple users navigate by walking and interact with each other in natural ways are perfectly suited for team applications from training to recreation. At the same time, they can solve scheduling conflicts by employing virtual agents in place of missing team members or additional participants of a scenario. While this idea has been long discussed in IVEs research there are no prior publications on social interactions in systems with multiple embodied users and agents. This paper presents an experiment at a work-in-progress stage that addresses the impact of perceived agency and control of a virtual character in a collaborative scenario with two embodied users and one virtual agent. Our future study will investigate whether users treat avatars and agents differently within a mixed-agency scenario, analysing several behavioural metrics and self-report of participants.

Published
2021

21. Risk-aware business process management using multi-view modeling: method and tool

Author

Elyes Lamine, Hervé Pingaud, Ouajdi Korbaa, Dominik Bork, Amine Boufaied, Rafika Thabet, Institut Supérieur d'Informatique et des Techniques de Communication (Université de Sousse) (ISITCom), Université de Sousse, Laboratoire de Génie Chimique (LGC), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Business Informatics Group [Vienne], Vienna University of Technology (TU Wien), University of Vienna [Vienna], Institut national universitaire Champollion [Albi] (INUC), Centre Génie Industriel (CGI), IMT École nationale supérieure des Mines d'Albi-Carmaux (IMT Mines Albi), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
[SPI.OTHER]Engineering Sciences [physics]/Other, Computer science, media_common.quotation_subject, Multi-view modeling, 02 engineering and technology, Meta-modeling, Business process management, Consistency (database systems), Blueprint, 0202 electrical engineering, electronic engineering, information engineering, Quality (business), Risk-aware business process management, media_common, Conceptualization, business.industry, 020207 software engineering, Usability, Viewpoints, Data science, Interdependence, [SHS.GESTION]Humanities and Social Sciences/Business administration, 020201 artificial intelligence & image processing, Consistency, business, Software, Information Systems
Abstract

Correction to: Risk‑aware business process management using multi‑view modeling: method and tool : https://doi.org/10.1007/s00766-021-00356-2; International audience; Risk-aware Business Process Management (R-BPM) has been addressed in research since more than a decade. However, the integration of the two independent research streams is still ongoing with a lack of research focusing on the conceptual modeling perspective. Such an integration results in an increased meta-model complexity and a higher entry barrier for modelers in creating conceptual models and for addressees of the models in comprehending them. Multi-view modeling can reduce this complexity by providing multiple interdependent viewpoints that, all together, represent a complex system. Each viewpoint only covers those concepts that are necessary to separate the different concerns of stakeholders. However, adopting multi-view modeling discloses a number of challenges particularly related to managing consistency which is threatened by semantic and syntactic overlaps between the viewpoints. Moreover, usability and efficiency of multi-view modeling have never been systematically evaluated. This paper reports on the conceptualization, implementation, and empirical evaluation of e-BPRIM, a multi-view modeling extension of the Business Process-Risk Management-Integrated Method (BPRIM). The findings of our research contribute to theory by showing, that multi-view modeling outperforms diagram-oriented modeling by means of usability and efficiency of modeling, and quality of models. Moreover, the developed modeling tool is openly available, allowing its adoption and use in R-BPM practice. Eventually, the detailed presentation of the conceptualization serves as a blueprint for other researchers aiming to harness multi-view modeling.

Published
2021

22. Dimension reduction for time series in a blind source separation context using r

Author

Klaus Nordhausen, Markus Matilainen, Joni Virta, Sara Taskinen, Jari Miettinen, Vienna University of Technology, Turku PET Centre, Dept Signal Process and Acoust, Department of Mathematics and Systems Analysis, University of Jyväskylä, Aalto-yliopisto, Aalto University, and Department of Signal Processing and Acoustics

Subjects
Statistics and Probability, Series (mathematics), Stochastic volatility, Computer science, blind source separation, supervised dimension reduction, R, signaalinkäsittely, Dimensionality reduction, signaalianalyysi, Context (language use), Covariance, Blind signal separation, QA273-280, aikasarja-analyysi, R-kieli, Dimension (vector space), monimuuttujamenetelmät, Blind source separation, Statistics, Probability and Uncertainty, Time series, Algorithm, Software, Supervised dimension reduction
Abstract

Funding Information: The work of KN was supported by the CRoNoS COST Action IC1408 and the Austrian Science Fund P31881-N32. The work of ST was supported by the CRoNoS COST Action IC1408. The work of JV was supported by Academy of Finland (grant 321883). We would like to thank the anonymous reviewers for their comments which improved the paper and package considerably. Publisher Copyright: © 2021, American Statistical Association. All rights reserved. Multivariate time series observations are increasingly common in multiple fields of science but the complex dependencies of such data often translate into intractable models with large number of parameters. An alternative is given by first reducing the dimension of the series and then modelling the resulting uncorrelated signals univariately, avoiding the need for any covariance parameters. A popular and effective framework for this is blind source separation. In this paper we review the dimension reduction tools for time series available in the R package tsBSS. These include methods for estimating the signal dimension of second-order stationary time series, dimension reduction techniques for stochastic volatility models and supervised dimension reduction tools for time series regression. Several examples are provided to illustrate the functionality of the package.

Published
2021

23. A Big Data Learning Platform for the West Balkans and Beyond

Author

Emanuel Sallinger, Damien Graux, Hajira Jabeen, Valentina Janev, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institute Mihajlo Pupin [Belgrade], University of Cologne, Institut für Informationssysteme [Wien], Vienna University of Technology (TU Wien), University of Oxford [Oxford], Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), and University of Oxford

Subjects
Focus (computing), teaching big data analytics, business.industry, Computer science, 05 social sciences, Big data, Applied computing, 050301 education, 02 engineering and technology, west Balkans, Data science, Education, Domain (software engineering), European collaboration, Software deployment, 0202 electrical engineering, electronic engineering, information engineering, Information systems, Virtual learning environment, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, business, 0503 education, Data management systems, ComputingMilieux_MISCELLANEOUS
Abstract

International audience; As the number of Big Data related methods, tools, frameworks, and solutions is growing, there is a need to classify and make available the knowledge related to this domain. This is especially useful for countries which, so far, have suffered from some lack of infra-structure in Big Data. In this article, we describe the deployment of an open online platform gathering lectures and resources, from multiple partnered European institutions, tailored for West Balkan students with a particular focus on local Big Data challenges.

Published
2021
Full Text
View/download PDF

24. Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach

Author

Martin Nöllenburg, Daniel Archambault, Markus Wallinger, David Auber, Jaakko Peltonen, Vienna University of Technology (TU Wien), Swansea University, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), and Tempere University

Subjects
FOS: Computer and information sciences, Similarity (geometry), Computer science, 02 engineering and technology, Mathematics::Algebraic Geometry, Computer Science - Graphics, 0202 electrical engineering, electronic engineering, information engineering, Cluster (physics), Mathematics::Symplectic Geometry, ComputingMilieux_MISCELLANEOUS, Process (computing), 020207 software engineering, Computer Graphics and Computer-Aided Design, Graphics (cs.GR), [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], Signal Processing, Shortest path problem, Path (graph theory), Metric (mathematics), ComputerApplications_GENERAL, Clutter, Computer Vision and Pattern Recognition, Enhanced Data Rates for GSM Evolution, Algorithm, Software, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to date implicitly or explicitly cluster groups of individual edges, or parts of them, together based on these attributes. These clusters can result in ambiguous connections that do not exist in the data. Confluent drawings of networks do not have these ambiguities, but require the layout to be computed as part of the bundling process. We devise a new bundling method, Edge-Path bundling, to simplify edge clutter while greatly reducing ambiguities compared to previous bundling techniques. Edge-Path bundling takes a layout as input and clusters each edge along a weighted, shortest path to limit its deviation from a straight line. Edge-Path bundling does not incur independent edge ambiguities typically seen in all edge bundling methods, and the level of bundling can be tuned through shortest path distances, Euclidean distances, and combinations of the two. Also, directed edge bundling naturally emerges from the model. Through metric evaluations, we demonstrate the advantages of Edge-Path bundling over other techniques., VIS 2021

Published
2021

25. The future is big graphs: a Community View on Graph Processing Systems

Author

Jan Hidders, Mohamed Ragab, Angela Bonifati, Hannes Voigt, Maciej Besta, Alexandru Iosup, Ana Lucia Varbanescu, Petra Selmer, Tim Hegeman, Joshua Shinavier, Katja Hose, Stefania Dumbrava, Vasiliki Kalavri, Matei Ripeanu, Gábor Szárnyas, Eiko Yoneki, Da Yan, Semih Salihoglu, Renzo Angles, Eric Peukert, Olaf Hartig, Christian Schulz, Marcelo Arenas, Riccardo Tommasini, Nikolay Yakovets, Alexandru Uta, Stefan Plantikow, Juan F. Sequeda, M. Tamer Özsu, Emanuele Della Valle, Peter Boncz, Khaled Ammar, Wim Martens, Hsiang-Yun Wu, Bernhard Haslhofer, Sherif Sakr, Adriana Iamnitchi, Khuzaima Daudjee, Walid G. Aref, Antonino Tumeo, Hugo Kapp, Institute of Computer Science [University of Tartu, Estonie], University of Tartu, Base de Données (BD), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Types and Reasoning for the Web (TYREX), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Neo4j, Vrije Universiteit Amsterdam [Amsterdam] (VU), Delft University of Technology (TU Delft), BorialisAI, Universidad de Talca, Purdue University [West Lafayette], UC Pontifical University Cathoic [Santiogo], Millennium Institute for Foundational Research on Data (IMFD), Pontificia Universidad Católica de Chile (UC), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Centrum Wiskunde & Informatica (CWI), University of Waterloo [Waterloo], Polytechnic University of Milan, Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE), Linköping University (LIU), Austrian Institute of Technology [Vienna] (AIT), Birkbeck College [University of London], Aalborg University [Denmark] (AAU), University of South Florida [Tampa] (USF), Boston University [Boston] (BU), Oracle Labs Switzerland, Universität Bayreuth, Universität Leipzig, University of British Columbia (UBC), Heidelberg University, data.world, Uber Engineering [Palo Alto], Budapest University of Technology and Economics [Budapest] (BME), Pacific Northwest National Laboratory (PNNL), University of Amsterdam [Amsterdam] (UvA), Institute of Applied Physics [Vienna] (TU Wien), Vienna University of Technology (TU Wien), Eindhoven University of Technology [Eindhoven] (TU/e), University of Alabama at Birmingham [ Birmingham] (UAB), University of Cambridge [UK] (CAM), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), VU University Amsterdam, Universität Leipzig [Leipzig], and Vrije universiteit = Free university of Amsterdam [Amsterdam] (VU)

Subjects
FOS: Computer and information sciences, SQL, General Computer Science, Computer science, H.2, J.0, Big graph, 02 engineering and technology, computer.software_genre, Domain (software engineering), Computer Science - Databases, Relational database management system, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Use case, computer.programming_language, [INFO.INFO-WB]Computer Science [cs]/Web, 020207 software engineering, Databases (cs.DB), Data science, Graph, Computer Science - Distributed, Parallel, and Cluster Computing, C.3, E.0, Core (graph theory), Distributed, Parallel, and Cluster Computing (cs.DC), computer
Abstract

Graphs are, by nature, "unifying abstractions" that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. although real users and consumers of graph instances and graph workloads understand these abstractions, future problems will require new abstractions and systems. What needs to happen in the next decade for big graph processing to continue to succeed?, Communications of the ACM, 64 (9), ISSN:1557-7317, ISSN:0001-0782

Published
2021

26. Usability Study of Learning-Based Pose Estimation of Industrial Objects from Synthetic Depth Data

Author

Timothy Patten, Stefan Thalhammer, Markus Vincze, Vienna University of Technology (TU Wien), Svetan Ratchev, TC 5, WG 5.5, and Ratchev, S

Subjects
Synthetic data, Computer science, 02 engineering and technology, Augmentation, Machine learning, computer.software_genre, Rendering, Rendering (computer graphics), Task (project management), 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Relevance (information retrieval), Pose, Pose estimation, business.industry, Deep learning, 020207 software engineering, Usability, Object (computer science), Depth data, 0806 Information Systems, 020201 artificial intelligence & image processing, Artificial intelligence, business, computer
Abstract

Part 5: Human Centred Assembly; International audience; For visual assistance systems deployed in an industrial setting, precise object pose estimation is an important task in order to support scene understanding and to enable subsequent grasping and manipulation. Industrial environments are especially challenging since mesh-models are usually available while physical objects are not or are expensive to model. Manufactured objects are often similar in appearance, have limited to no textural cues and exhibit symmetries. Thus, these are especially challenging for recognizers that are meant to provide detection, classification and pose estimation on instance level. A usability study of a recent synthetically trained learning-based recognizer for these particular challenges is conducted. Experiments are performed on the challenging T-LESS dataset due to its relevance for industry.

Published
2021

27. The Involution Tool for Accurate Digital Timing and Power Analysis

Author

Ulrich Schmid, Matthias Függer, Daniel Öhlinger, Jürgen Maier, Institute of Computer Engineering [Vienna], Vienna University of Technology (TU Wien), Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Université Paris-Saclay, Modeling and Exploitation of Interaction and Concurrency (MEXICO), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), and ANR-17-CE40-0013,FREDDA,Méthodes formelles pour la conception d'algorithmes distribués(2017)

Subjects
Combinational logic, glitch propagation, [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Computer science, 020208 electrical & electronic engineering, NAND gate, Static timing analysis, 02 engineering and technology, NAND logic, delay models, 020202 computer hardware & architecture, Tree (data structure), Computer Science::Hardware Architecture, CMOS, Hardware and Architecture, 0202 electrical engineering, electronic engineering, information engineering, Inverter, Involution (philosophy), Digital timing simulation, pulse degradation, Electrical and Electronic Engineering, design tools, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Algorithm, Software
Abstract

International audience; We introduce the prototype of a digital timing simulation and power analysis tool for integrated circuits that supports the involution delay model (Függer et al., IEEE TCAD 2019). Unlike the pure and inertial delay models typically used in digital timing analysis tools, the involution model faithfully captures short pulse propagation and related effects. Our Involution Tool facilitates experimental accuracy evaluation of variants of involution models, by comparing their timing and power predictions to those from SPICE and standard timing analysis tools. The tool is easily customizable w.r.t. instances of the involution model and circuits, and supports automatic test case generation and parameter sweeping. We demonstrate the capabilities of the Involution Tool by providing timing and power analysis results for three different circuits, namely, an inverter tree, the clock tree of an open-source processor, and a combinational circuit that involves multi-input NAND gates. Our evaluation uses two different technologies (15 nm and 65 nm CMOS), and three different variants of involution channels (Exp, Hill and SumExp-channels). It turns out that the timing and power predictions of all involution models are significantly better than the predictions obtained by standard digital simulations for the inverter tree and the clock tree, with the SumExp-channel channel clearly outperforming the others. For the NAND circuit, the performance of any involution model is generally comparable but not significantly better than that of standard models, however, which reveals some shortcomings of the existing involution channels for modeling multi-input gates.

Published
2021

28. Automated Information Supply of Worker Guidance Systems in Smart Assembly Environment

Author

Philipp Hold, Gerhard Reisinger, Wilfried Sihn, Fraunhofer Austria Research GmbH, Vienna University of Technology (TU Wien), Svetan Ratchev, TC 5, and WG 5.5

Subjects
0209 industrial biotechnology, Computer science, Process (engineering), Context (language use), 02 engineering and technology, computer.software_genre, Assembly planning, 020901 industrial engineering & automation, Software, 0203 mechanical engineering, [INFO]Computer Science [cs], Digitization, Digital assistance, Worker guidance, business.industry, Core competency, Pilot factory, Expert system, Engineering management, 020303 mechanical engineering & transports, Human-machine interaction, Factory (object-oriented programming), Smart assembly, Guidance system, business, computer, Algorithms
Abstract

Part 5: Human Centred Assembly; International audience; The global megatrends of digitization and individualization substantially affect manufacturing enterprises. Assembly workers are exposed to increased process complexity resulting in physical and cognitive workload. Worker guidance systems (WGS) are used to overcome this challenge through output of information regarding what should be done, how it should be done and why it should be done. An unsolved scientific challenge in this context is efficient information supply of WGS. Information such as worker’s instruction texts, pictures or 3D representations are created by employees of the work preparation department and transferred to the WGS. Manual information supply is a time-consuming and complex process, which requires a high (non-value-adding) effort as well as comprehensive knowledge in handling 3D CAD modelling and software programming. This paper presents a novel approach to reduce the required manual effort in information supply process. A knowledge-based model is proposed that enables an automated information supply of WGS in smart assembly environment by means of algorithms and self-learning expert systems, which pursues a holistic and consistent approach without media breaks. The automated approach assists employees of work preparation department, which means they can concentrate on their essential core competencies instead of being busy, for example, creating assembly plans, instruction texts or pictures for individual WGS. Finally, the technical implementation as a software-based proof-of-concept demonstrator and sub-sequent integration into the IT environment of TU Wien Pilot Factory Industry 4.0 is outlined.

Published
2020

29. Securing Deep Spiking Neural Networks against Adversarial Attacks through Inherent Structural Parameters

Author

Alberto Marchisio, Rida El-Allami, Ihsen Alouani, Muhammad Shafique, Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA), Université catholique de Lille (UCL)-Université catholique de Lille (UCL), Vienna University of Technology (TU Wien), New York University [Abu Dhabi], NYU System (NYU), COMmunications NUMériques - IEMN (COMNUM - IEMN), INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Université catholique de Lille (UCL)-Université catholique de Lille (UCL)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA), Intel Corporation, Institut d’Électronique, de Microélectronique et de Nanotechnologie - Département Opto-Acousto-Électronique - UMR 8520 (IEMN-DOAE), INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), and Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-JUNIA (JUNIA)

Subjects
FOS: Computer and information sciences, Optimization, Computer Science - Machine Learning, Computer science, 02 engineering and technology, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Machine learning, computer.software_genre, SNN, Machine Learning (cs.LG), Machine Learning, Spiking Neural Networks, [SPI]Engineering Sciences [physics], Adversarial system, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Deep Learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Robustness (computer science), Neuromorphic, 0202 electrical engineering, electronic engineering, information engineering, Robustness, Adversarial Attacks, Vulnerability (computing), Spiking neural network, business.industry, Deep learning, 020202 computer hardware & architecture, Variable (computer science), Neuromorphic engineering, Parameters, Security, 020201 artificial intelligence & image processing, Artificial intelligence, Noise (video), business, computer, Analysis
Abstract

Deep Learning (DL) algorithms have gained popularity owing to their practical problem-solving capacity. However, they suffer from a serious integrity threat, i.e., their vulnerability to adversarial attacks. In the quest for DL trustworthiness, recent works claimed the inherent robustness of Spiking Neural Networks (SNNs) to these attacks, without considering the variability in their structural spiking parameters. This paper explores the security enhancement of SNNs through internal structural parameters. Specifically, we investigate the SNNs robustness to adversarial attacks with different values of the neuron's firing voltage thresholds and time window boundaries. We thoroughly study SNNs security under different adversarial attacks in the strong white-box setting, with different noise budgets and under variable spiking parameters. Our results show a significant impact of the structural parameters on the SNNs' security, and promising sweet spots can be reached to design trustworthy SNNs with 85% higher robustness than a traditional non-spiking DL system. To the best of our knowledge, this is the first work that investigates the impact of structural parameters on SNNs robustness to adversarial attacks. The proposed contributions and the experimental framework is available online to the community for reproducible research., Accepted for publication at the 24th Design, Automation and Test in Europe (DATE'21), February, 2021

Published
2020

30. Comparing and Exploring High-Dimensional Data with Dimensionality Reduction Algorithms and Matrix Visualizations

Author

Michaël Aupetit, Jean-Daniel Fekete, Michael Sedlmair, René Cutura, Vienna University of Technology (TU Wien), Qatar Computing Research Institute [Doha, Qatar] (QCRI), Analysis and Visualization (AVIZ), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Recherche en Informatique (LRI), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), and University of Stuttgart

Subjects
0301 basic medicine, Clustering high-dimensional data, Visual analytics, Computer science, 02 engineering and technology, Matrix Visualization, computer.software_genre, 03 medical and health sciences, Information visualization, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Dimensionality Reduction, business.industry, Dimensionality reduction, Visual comparison, 020207 software engineering, Visual Comparison, Visualization, 030104 developmental biology, Data mining, High-Dimensional Data, business, computer, Subspace topology, Distance matrices in phylogeny, Subspace Analysis
Abstract

International audience; We propose Compadre, a tool for visual analysis for comparing distances of high-dimensional (HD) data and their low-dimensional projections. At the heart is a matrix visualization to represent the discrepancy between distance matrices, linked side-by-side with 2D scatterplot projections of the data. Using different examples and datasets, we illustrate how this approach fosters (1) evaluating dimensionality reduction techniques w.r.t. how well they project the HD data, (2) comparing them to each other side-by-side, and (3) evaluate important data features through subspace comparison.We also present a case study, in which we analyze IEEE VIS authors from 1990 to 2018, and gain new insights on the relationships between coauthors, citations, and keywords. The coauthors are projected as accurately with UMAP as with t-SNE but the projections show different insights. The structure of the citation subspace is very different from the coauthor subspace. The keyword subspace is noisy yet consistent among the three IEEE VIS sub-conferences.

Published
2020

31. Blockchain- and IPFS-Based Data Distribution for the Internet of Things

Author

Stefan Schulte, Simon Krejci, Marten Sigwart, Vienna University of Technology (TU Wien), Antonio Brogi, Wolf Zimmermann, Kyriakos Kritikos, TC 2, and WG 2.14

Subjects
Blockchain, Data distribution, Computer science, business.industry, Internet of Things, Distribution (economics), 020206 networking & telecommunications, IPFS, 02 engineering and technology, World Wide Web, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], business
Abstract

Part 5: Data Distribution and Analytics; International audience; Distributing data in a tamper-proof and traceable way is a necessity in many Internet of Things (IoT) scenarios. Blockchain technologies are frequently named as an approach to provide such functionality. Despite this, there is a lack of concrete solutions which integrate the IoT with the blockchain for data distribution purposes.Within this paper, we present a middleware which connects to IoT devices, and uses a blockchain to distribute IoT data with guaranteed integrity. Furthermore, the middleware also offers that data is distributed in real-time via a second channel. We implement our solution using the Ethereum blockchain and the InterPlanetary File System (IPFS).

Published
2020

32. Cross-Platform File System Activity Monitoring and Forensics – A Semantic Approach

Author

Elmar Kiesling, Kabul Kurniawan, Fajar J. Ekaputra, Andreas Ekelhart, Faculty of Informatics, Vienna University of Technology (TU Wien), University of Vienna [Vienna], Marko Hölbl, Kai Rannenberg, Tatjana Welzer, and TC 11

Subjects
Semantic log analysis, 050101 languages & linguistics, 509018 Knowledge management, Computer science, 505002 Data protection, Digital forensics, Interoperability, 02 engineering and technology, computer.software_genre, Article, 509018 Wissensmanagement, Cross-platform, 0202 electrical engineering, electronic engineering, information engineering, 505002 Datenschutz, 0501 psychology and cognitive sciences, [INFO]Computer Science [cs], Instrumentation (computer programming), File system, File system monitoring, Database, Exfiltration detection, 05 social sciences, Information security, Key (cryptography), 020201 artificial intelligence & image processing, Raw data, computer
Abstract

Part 9: Privacy and Security Management; International audience; Ensuring data confidentiality and integrity are key concerns for information security professionals, who typically have to obtain and integrate information from multiple sources to detect unauthorized data modifications and transmissions. The instrumentation that operating systems provide for the monitoring of file system level activity can yield important clues on possible data tampering and exfiltration activity but the raw data that these tools provide is difficult to interpret, contextualize and query. In this paper, we propose and implement an architecture for file system activity log acquisition, extraction, linking and storage that leverages semantic techniques to tackle limitations of existing monitoring approaches in terms of integration, contextualization, and cross-platform interoperability. We illustrate the applicability of the proposed approach in both forensic and monitoring scenarios and conduct a performance evaluation in a virtual setting.

Published
2020

33. Double-Authentication-Preventing Signatures in the Standard Model

Author

Azam Soleimanian, Dario Catalano, Georg Fuchsbauer, Dipartimento di Matematica e Informatica (DMI), Università degli studi di Catania [Catania], Vienna University of Technology (TU Wien), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), The first author is supported by the Programma ricerca di ateneo UNICT 2020-22 linea 2. The second author is supported by the Vienna Science and Technology Fund (WWTF) through project VRG18-002. The third author is supported by the European Union's Horizon 2020 Project FENTEC (Grant Agreement no. 780108)., Clemente Galdi, Vladimir Kolesnikov, Università degli studi di Catania = University of Catania (Unict), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris)

Subjects
Scheme (programming language), 050101 languages & linguistics, Computer science, 02 engineering and technology, Double-spending, Random oracle, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Digital signature, certificate subversion, 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, [INFO]Computer Science [cs], computer.programming_language, Standard model (cryptography), Authentication, Payload, business.industry, 05 social sciences, cryptocurrencies, Signature (logic), ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMS, digital signature, Key (cryptography), 020201 artificial intelligence & image processing, business, computer, Computer network
Abstract

International audience; A double-authentication preventing signature (DAPS) scheme is a digital signature scheme equipped with a self-enforcement mechanism. Messages consist of an address and a payload component, and a signer is penalized if she signs two messages with the same addresses but different payloads. The penalty is the disclosure of the signer's signing key. Most of the existing DAPS schemes are proved secure in the random oracle model (ROM), while the efficient ones in the standard model only support address spaces of polynomial size.We present DAPS schemes that are efficient, secure in the standard model under standard assumptions and support large address spaces. Our main construction builds on vector commitments (VC) and double-trapdoor chameleon hash functions (DCH).We also provide a DAPS realization from Groth-Sahai (GS) proofs that builds on a generic construction by Derler et al., which they instantiate in the ROM. The GS-based construction, while less efficient than our main one, shows that a general yet efficient instantiation of DAPS in the standard model is possible. An interesting feature of our main construction is that it can be easily modified to guarantee security even in the most challenging setting where no trusted setup is provided. To the best of our knowledge, ours seems to be the first construction achieving this in the standard model.

Published
2020

34. Molecumentary: Scalable Narrated Documentaries Using Molecular Visualization

Author

Ivan Viola, Eduard Groeller, Peter Mindek, Ondrej Strnad, David Kouril, Sarkis Halladjian, Tobias Isenberg, Vienna University of Technology (TU Wien), King Abdullah University of Science and Technology (KAUST), Analysis and Visualization (AVIZ), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Recherche en Informatique (LRI), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), ANR-16-CE91-0011,ILLUSTRARE,Integrative Visual Abstraction of Molecular Data(2016), Masaryk University [Brno] (MUNI), The Institute of Computer Graphics and Algorithms [Vienna] (TU Wien), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), and Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
FOS: Computer and information sciences, Computer science, Computer Science - Human-Computer Interaction, [SCCO.COMP]Cognitive science/Computer science, 02 engineering and technology, Domain (software engineering), Human-Computer Interaction (cs.HC), Human–computer interaction, storytelling, audio, 0202 electrical engineering, electronic engineering, information engineering, Virtual tour, Narrative, Structure (mathematical logic), Scientific visualization, 020207 software engineering, Computer Graphics and Computer-Aided Design, Visualization, Signal Processing, Graph (abstract data type), Computer Vision and Pattern Recognition, biological data, illustrative visualization, Software, Storytelling
Abstract

To appear; International audience; We present a method for producing documentary-style content using real-time scientific visualization. We introduce molecumentaries, i. e., molecular documentaries featuring structural models from molecular biology, created through adaptable methods instead of the rigid traditional production pipeline. Our work is motivated by the rapid evolution of scientific visualization and it potential in science dissemination. Without some form of explanation or guidance, however, novices and lay-persons often find it difficult to gain insights from the visualization itself. We integrate such knowledge using the verbal channel and provide it along an engaging visual presentation. To realize the synthesis of a molecumentary, we provide technical solutions along two major production steps: (1) preparing a story structure and (2) turning the story into a concrete narrative. In the first step, we compile information about the model from heterogeneous sources into a story graph. We combine local knowledge with external sources to complete the story graph and enrich the final result. In the second step, we synthesize a narrative, i. e., story elements presented in sequence, using the story graph. We then traverse the story graph and generate a virtual tour, using automated camera and visualization transitions. We turn texts written by domain experts into verbal representations using text-to-speech functionality and provide them as a commentary. Using the described framework, we synthesize fly-throughs with descriptions: automatic ones that mimic a manually authored documentary or semi-automatic ones which guide the documentary narrative solely through curated textual input.

Published
2020

35. Neuroattack: undermining spiking neural networks security through externally triggered bit-flips

Author

Alberto Marchisio, Valerio Venceslai, Maurizio Martina, Muhammad Shafique, Ihsen Alouani, Vienna University of Technology (TU Wien), Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF), COMmunications NUMériques - IEMN (COMNUM - IEMN), Institut d’Électronique, de Microélectronique et de Nanotechnologie - Département Opto-Acousto-Électronique - UMR 8520 (IEMN-DOAE), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France), Politecnico di Torino = Polytechnic of Turin (Polito), This work has been partially supported by the Doctoral CollegeResilient Embedded Systems which is run jointly by TU Wien’sFaculty of Informatics and FH-Technikum Wien., Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF), INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France), and Institut National des Sciences Appliquées (INSA)

Subjects
FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Cryptography and Security, Computer science, Distributed computing, Reliability (computer networking), Machine Learning (stat.ML), 02 engineering and technology, 01 natural sciences, SNN, Machine Learning (cs.LG), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Machine Learning, Spiking Neural Networks, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [SPI]Engineering Sciences [physics], Hardware, Statistics - Machine Learning, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Fault-Injection Attacks, Resilience (network), Adversarial Attacks, 010302 applied physics, Spiking neural network, Deep Neural Networks, Resilience, Machine Learning, Spiking Neural Networks, Reliability, Adversarial Attacks, Fault-Injection Attacks, Deep Neural Networks, DNN, SNN, Security, Resilience, Cross-Layer, Biological system modeling, Reliability, 020202 computer hardware & architecture, [SPI.TRON]Engineering Sciences [physics]/Electronics, Cross layer, Cross-Layer, Security, Noise (video), Biological neural networks, Cryptography and Security (cs.CR), [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, DNN
Abstract

Due to their proven efficiency, machine-learning systems are deployed in a wide range of complex real-life problems. More specifically, Spiking Neural Networks (SNNs) emerged as a promising solution to the accuracy, resource-utilization, and energy-efficiency challenges in machine-learning systems. While these systems are going mainstream, they have inherent security and reliability issues. In this paper, we propose NeuroAttack, a cross-layer attack that threatens the SNNs integrity by exploiting low-level reliability issues through a high-level attack. Particularly, we trigger a fault-injection based sneaky hardware backdoor through a carefully crafted adversarial input noise. Our results on Deep Neural Networks (DNNs) and SNNs show a serious integrity threat to state-of-the art machine-learning techniques., Accepted for publication at the 2020 International Joint Conference on Neural Networks (IJCNN)

Published
2020

36. Groupoid description of modular structures

Author

Bernd Souvignier, Massimo Nespolo, Berthold Stöger, Cristallographie, Résonance Magnétique et Modélisations (CRM2), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Radboud university [Nijmegen], Vienna University of Technology (TU Wien), and Hubert Curien Partnership AMADEUS No. 42120UD ‘LOCSYM’

Subjects
Pure mathematics, superposition structures, 010504 meteorology & atmospheric sciences, Computer science, polytypism, 010502 geochemistry & geophysics, Space (mathematics), 01 natural sciences, Biochemistry, [MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR], Inorganic Chemistry, Set (abstract data type), Crystal (programming language), Structural Biology, Mathematics::Category Theory, [CHIM.CRIS]Chemical Sciences/Cristallography, General Materials Science, Physical and Theoretical Chemistry, 0105 earth and related environmental sciences, modular crystal structures, Modular structure, business.industry, groupoids, Zero (complex analysis), Extension (predicate logic), Modular design, Condensed Matter Physics, Research Papers, subperiodic groups, business, Mathematics
Abstract

International audience; Modular structures are crystal structures built by subperiodic (zero-, mono-or diperiodic) substructures, called modules. The whole set of partial operations relating substructures in a modular structure build up a groupoid; modular structures composed of identical substructures are described by connected groupoids, or groupoids in the sense of Brandt. A general approach is presented to describe modular structures by Brandt's groupoids and how to obtain the corresponding space groups, in which only the partial operations that have an extension to the whole crystal space appear.

Published
2020

37. Behavioral interfaces for executable DSLs

Author

Dorian Leroy, Manuel Wimmer, Tanja Mayerhofer, Erwan Bousse, Benoit Combemale, Wieland Schwinger, Vienna University of Technology (TU Wien), Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Johannes Kepler University Linz [Linz] (JKU), FR 08/2017, OeAD-GmbH, P 28519-N31, Austrian Science Fund, Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Johannes Kepler Universität Linz - Johannes Kepler University Linz [Autriche] (JKU)

Subjects
Domain-specific language, Semantics (computer science), Computer science, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Reuse, Metamodeling, computer.software_genre, USable, Language engineering, Regular Paper, 0202 electrical engineering, electronic engineering, information engineering, Model execution, Use case, GeneralLiterature_REFERENCE(e.g.,dictionaries,encyclopedias,glossaries), Language Workbenches, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Programming language, 05 social sciences, Metalanguage, 050301 education, 020207 software engineering, computer.file_format, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Modeling and Simulation, Executable, Software_PROGRAMMINGLANGUAGES, 0503 education, computer, Domain Specific Languages, Software
Abstract

Executable domain-specific languages (DSLs) enable the execution of behavioral models. While an execution is mostly driven by the model content (e.g., control structures), many use cases require interacting with the running model, such as simulating scenarios in an automated or interactive way, or coupling the model with other models of the system or environment. The management of these interactions is usually hardcoded into the semantics of the DSL, which prevents its reuse for other DSLs and the provision of generic interaction-centric tools (e.g., event injector). In this paper, we propose a metalanguage for complementing the definition of executable DSLs with explicit behavioral interfaces to enable external tools to interact with executed models in a unified way. We implemented the proposed metalanguage in the GEMOC Studio and show how behavioral interfaces enable the realization of tools that are generic and thus usable for different executable DSLs.

Published
2020

38. Archaeological Ground Point Filtering of Airborne Laser Scan Derived Point-Clouds in a Difficult Mediterranean Environment

Author

Gottfried Mandlburger, Michael Doneus, Nives Doneus, University of Vienna [Vienna], University of Stuttgart, Vienna University of Technology (TU Wien), and Austrian Academy of Sciences (OeAW)

Subjects
Archeology, 010504 meteorology & atmospheric sciences, Laser scanning, [SHS.ARCHEO]Humanities and Social Sciences/Archaeology and Prehistory, Computer science, 0211 other engineering and technologies, Point cloud, Terrain, 02 engineering and technology, 01 natural sciences, lcsh:QA75.5-76.95, adaptive filtering, Point (geometry), als, lcsh:CC1-960, ComputingMilieux_MISCELLANEOUS, 021101 geological & geomatics engineering, 0105 earth and related environmental sciences, macchia, archaeology, Filter (signal processing), Vegetation, 15. Life on land, Archaeology, Field (geography), Computer Science Applications, Adaptive filter, mediterranean environment, classification, lcsh:Archaeology, lcsh:Electronic computers. Computer science
Abstract

Digital terrain models (DTM) based on airborne laser scanning (ALS) are an important source for identifying and monitoring archaeological sites and landscapes. However, a DTM is only one of many representations of a given surface. Its accuracy and quality must conform to its purpose and are a result of several considerations and decisions along the processing chain. One of the most important factors of ALS-based DTM generation is ground point filtering, i.e., the classification of the acquired point-cloud into terrain and off-terrain points. Filtering is not straightforward. The resulting DTM is usually a compromise that might show the surface below very dense vegetation while losing detail in other areas. In this paper, we show that in very complex situations (e.g., strongly varying vegetation cover), an optimal compromise is difficult to achieve, and more than one filter with different settings adapted to the varying degree of vegetation cover is necessary. For practical reasons, the results need to be combined into a single DTM. This is demonstrated using the case study of a Mediterranean landscape in Croatia, which consists of open areas (agricultural and grassland), olive plantations, as well as extremely dense and evergreen macchia vegetation. The results are the first step toward an adaptive ground point filtering strategy that might be useful far beyond the field of archaeology.

Published
2020

39. Robot Perception of Static and Dynamic Objects with an Autonomous Floor Scrubber

Author

Nicola Bellotto, Georg Halmetschlager, Markus Vincze, Tom Duckett, Simon Schreiberhuber, Zhi Yan, Connaissance et Intelligence Artificielle Distribuées [Dijon] (CIAD), Université de Technologie de Belfort-Montbeliard (UTBM)-Université de Bourgogne (UB), Vienna University of Technology (TU Wien), Centre for Autonomous Systems, University of Lincoln, University of Lincoln, and European Project: 645376

Subjects
FOS: Computer and information sciences, 0209 industrial biotechnology, Computer science, Computational Mechanics, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, G700 Artificial Intelligence, 01 natural sciences, Robot perception, Human detection and tracking, Object and dirt detection, Spatial-temporal representation, Dataset, ROS, TRACKING, Computer Science - Robotics, 020901 industrial engineering & automation, Artificial Intelligence, PEOPLE, Floor scrubber, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Computer vision, Representation (mathematics), Engineering (miscellaneous), Modularity (networks), business.industry, Mechanical Engineering, 010401 analytical chemistry, MOTION REMOVAL, Object (computer science), Pipeline (software), H671 Robotics, 0104 chemical sciences, Robot, RGB color model, Artificial intelligence, business, Robotics (cs.RO), Stereo camera, LONG-TERM AUTONOMY, RGB-D SLAM
Abstract

This paper presents the perception system of a new professional cleaning robot for large public places. The proposed system is based on multiple sensors including 3D and 2D lidar, two RGB-D cameras and a stereo camera. The two lidars together with an RGB-D camera are used for dynamic object (human) detection and tracking, while the second RGB-D and stereo camera are used for detection of static objects (dirt and ground objects). A learning and reasoning module for spatial-temporal representation of the environment based on the perception pipeline is also introduced. Furthermore, a new dataset collected with the robot in several public places, including a supermarket, a warehouse and an airport, is released. Baseline results on this dataset for further research and comparison are provided. The proposed system has been fully implemented into the Robot Operating System (ROS) with high modularity, also publicly available to the community., 15 pages, 16 figures, submitted to Intelligent Service Robotics

Published
2020

40. When Malware is Packin' Heat; Limits of Machine Learning Classifiers Based on Static Analysis Features

Author

Giovanni Vigna, Stefano Ortolani, Fabio Gritti, Davide Balzarotti, Francesco Mecca, Hojjat Aghakhani, Christopher Kruegel, Martina Lindorfer, University of California [Santa Barbara] (UC Santa Barbara), University of California (UC), Università degli studi di Torino = University of Turin (UNITO), Vienna University of Technology (TU Wien), Lastline Inc., Eurecom [Sophia Antipolis], European Project: 771844,BITCRUMBS, and European Project: 875019C0003,DARPA

Subjects
021110 strategic, defence & security studies, Computer science, business.industry, 0211 other engineering and technologies, Sample (statistics), 02 engineering and technology, computer.file_format, Static analysis, Machine learning, computer.software_genre, Obfuscation (software), Software, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, False positive paradox, Malware, [INFO]Computer Science [cs], Executable, Artificial intelligence, Heuristics, business, computer
Abstract

International audience; Machine learning techniques are widely used in addition to signatures and heuristics to increase the detection rate of anti-malware software, as they automate the creation of detection models, making it possible to handle an ever-increasing number of new malware samples. In order to foil the analysis of anti-malware systems and evade detection, malware uses packing and other forms of obfuscation. However, few realize that benign applications use packing and obfuscation as well, to protect intellectual property and prevent license abuse. In this paper, we study how machine learning based on static analysis features operates on packed samples. Malware researchers have often assumed that packing would prevent machine learning techniques from building effective classifiers. However, both industry and academia have published results that show that machine-learning-based classifiers can achieve good detection rates, leading many experts to think that classifiers are simply detecting the fact that a sample is packed, as packing is more prevalent in malicious samples. We show that, different from what is commonly assumed, packers do preserve some information when packing programs that is "useful" for malware classification. However, this information does not necessarily capture the sample's behavior. We demonstrate that the signals extracted from packed executables are not rich enough for machine-learning-based models to (1) generalize their knowledge to operate on unseen packers, and (2) be robust against adversarial examples. We also show that a naïve application of machine learning techniques results in a substantial number of false positives, which, in turn, might have resulted in incorrect labeling of ground-truth data used in past work.

Published
2020

41. Time-freeness and clock-freeness and related concepts in P systems

Author

Artiom Alhazov, Bosheng Song, Sergiu Ivanov, Linqiang Pan, Rudolf Freund, Institute of Mathematics [Moldova], Academy of Sciences of Moldova (ASM), Key Laboratory of Image Information Processing, Intelligent Control of Education, Huazhong University of Science and Technology [Wuhan] (HUST), Vienna University of Technology (TU Wien), Informatique, BioInformatique, Systèmes Complexes (IBISC), and Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay

Subjects
Discrete mathematics, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], General Computer Science, Computer science, Semantics (computer science), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Time-freeness, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Rewriting, Clock-freeness, P system, Mode-freeness, Integer (computer science)
Abstract

In the majority of models of P systems, rules are applied at the ticks of a global clock and their products are introduced into the system for the following step. In timed P systems, di erent integer durations are statically assigned to rules; time-free P systems are P systems yielding the same languages independently of these durations. In clock-free P systems, durations are real and are assigned to individual rule applications; thus, different applications of the same rule may last for a different amount of time. In this paper, we formalise timed, time-free, and clock-free P system within a framework for generalised parallel rewriting. We then explore the relationship between these variants of semantics. We show that clock-free P systems cannot effi ciently solve intractable problems. Moreover, we consider un-timed systems where we collect the results using arbitrary timing functions as well as un-clocked P systems where we take the union over all possible per-instance rule durations. Finally, we also introduce and study mode-free P systems, whose results do not depend on the choice of a mode within a fixed family of modes, and compare mode-freeness with clock-freeness.

Published
2020

42. Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics

Author

Tiziano Dalmonte, Nicola Olivetti, Björn Lellmann, Elaine Pimentel, Vienna University of Technology (TU Wien), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre (LIRICA), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Universidade Federal do Rio Grande do Norte [Natal] (UFRN), Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU)

Subjects
Hypersequents, Computer science, Semantic interpretation, Deontic logic, 010102 general mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Cube (algebra), 0102 computer and information sciences, 01 natural sciences, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Feature (linguistics), Modal, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Simple (abstract algebra), TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Calculus, Non-normal modal logics, Cut elimination, Non normality, [INFO]Computer Science [cs], 0101 mathematics, Countermodel con- struction, Optimal decision
Abstract

International audience; We develop semantically-oriented calculi for the cube of non-normal modal logics and some deontic extensions. The calculi manipulate hypersequents and have a simple semantic interpretation. Their main feature is that they allow for direct countermodel extraction. Moreover they provide an optimal decision procedure for the respective logics. They also enjoy standard proof-theoretical properties, such as a syntactical proof of cut-admissibility.

Published
2020

43. A Faithful Binary Circuit Model with Adversarial Noise

Author

Jürgen Maier, Matthias Függer, Ulrich Schmid, Robert Najvirt, Thomas Nowak, Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Modeling and Exploitation of Interaction and Concurrency (MEXICO), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Computer Engineering [Vienna], Vienna University of Technology (TU Wien), Systèmes parallèles (LRI) (ParSys - LRI), Laboratoire de Recherche en Informatique (LRI), and Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)

Subjects
FOS: Computer and information sciences, B.8.2, B.8.1, Computer science, Generalization, Other Computer Science (cs.OH), [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, 01 natural sciences, Computer Science - Other Computer Science, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Involution (philosophy), Formal verification, ModelSim, Digital electronics, 010308 nuclear & particles physics, business.industry, Static timing analysis, Function (mathematics), 020202 computer hardware & architecture, Glitch, Logic gate, business, Algorithm
Abstract

Accurate delay models are important for static and dynamic timing analysis of digital circuits, and mandatory for formal verification. However, F\"ugger et al. [IEEE TC 2016] proved that pure and inertial delays, which are employed for dynamic timing analysis in state-of-the-art tools like ModelSim, NC-Sim and VCS, do not yield faithful digital circuit models. Involution delays, which are based on delay functions that are mathematical involutions depending on the previous-output-to-input time offset, were introduced by F\"ugger et al. [DATE'15] as a faithful alternative (that can easily be used with existing tools). Although involution delays were shown to predict real signal traces reasonably accurately, any model with a deterministic delay function is naturally limited in its modeling power. In this paper, we thus extend the involution model, by adding non-deterministic delay variations (random or even adversarial), and prove analytically that faithfulness is not impaired by this generalization. Albeit the amount of non-determinism must be considerably restricted to ensure this property, the result is surprising: the involution model differs from non-faithful models mainly in handling fast glitch trains, where small delay shifts have large effects. This originally suggested that adding even small variations should break the faithfulness of the model, which turned out not to be the case. Moreover, the results of our simulations also confirm that this generalized involution model has larger modeling power and, hence, applicability., Comment: 9 pages, 9 figures, extended version of a paper which was accepted at DATE'18

Published
2020
Full Text
View/download PDF

44. P systems with randomized right-hand sides of rules

Author

Artiom Alhazov, Sergiu Ivanov, Rudolf Freund, Institute of Mathematics [Moldova], Academy of Sciences of Moldova (ASM), Key Laboratory of Image Information Processing, and Intelligent Contro, Huazhong University of Science and Technology [Wuhan] (HUST), Institut für Computersprachen, Vienna University of Technology (TU Wien), Informatique, BioInformatique, Systèmes Complexes (IBISC), and Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay

Subjects
Discrete mathematics, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], General Computer Science, Computer science, Structure (category theory), Binary number, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph, Tissue P system, Theoretical Computer Science, Power (physics), Exponential function, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Graph (abstract data type), 020201 artificial intelligence & image processing, P system, Randomized rules
Abstract

International audience; P systems are a model of distributed and compartmentalized multiset rewriting, complete with various signal transmission mechanisms. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. Finally, we also discuss extensions of the three variants to tissue P systems, i.e., P systems on an arbitrary graph structure.

Published
2020

45. Efficient plagiarism detection for software modeling assignments

Author

Salvador Martínez, Jordi Cabot, Manuel Wimmer, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), Lab-STICC_IMTA_CACS_MOCS, Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Vienna University of Technology (TU Wien), and Institució Catalana de Recerca i Estudis Avançats (ICREA)

Subjects
Information retrieval, General Computer Science, Modeling language, Computer science, business.industry, 05 social sciences, 050301 education, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Education, Locality-sensitive hashing, Identification (information), Software, Engineering education, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Plagiarism detection, Model-driven architecture, Cluster analysis, business, 0503 education, computer, ComputingMilieux_MISCELLANEOUS, computer.programming_language
Abstract

Reports suggest plagiarism is a common occurrence in universities. While plagiarism detection mechanisms exist for textual artifacts, this is less so for non-code related ones such as software desi...

Published
2020

46. BIAS: Transparent reporting of biomedical image analysis challenges

Author

Annika Reinke, Bram van Ginneken, Annette Kopp-Schneider, Tal Arbel, Anne L. Martel, Matthias Eisenmann, Henning Müller, Allan Hanbury, Pierre Jannin, Sinan Onogur, Julio Saez-Rodriguez, Bennett A. Landman, Michal Kozubek, Lena Maier-Hein, German Cancer Research Center - Deutsches Krebsforschungszentrum [Heidelberg] (DKFZ), Masaryk University [Brno] (MUNI), University of Toronto, McGill University = Université McGill [Montréal, Canada], Vienna University of Technology (TU Wien), Laboratoire Traitement du Signal et de l'Image (LTSI), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de la Santé et de la Recherche Médicale (INSERM), University of Applied Sciences and Arts of Western Switzerland (HES-SO), University of Geneva [Switzerland], Heidelberg University, Radboud University Medical Center [Nijmegen], Vanderbilt University [Nashville], ERC-2015-StG-37960, European Research Council, RGPIN-2016-06283, Natural Sciences and Engineering Research Council of Canada, 705772, Canadian Cancer Society, CZ.02.1.01/0.0/0.0/16_013/0001775, Ministerstvo Školství, Mládeže a Tělovýchovy, 1452485, National Science Foundation, R01-EB017230-01A1, NIH Clinical Center, Université de Rennes (UR)-Institut National de la Santé et de la Recherche Médicale (INSERM), Université de Genève = University of Geneva (UNIGE), and HAL UR1, Admin

Subjects
FOS: Computer and information sciences, Biomedical Research, Computer science, Computer Vision and Pattern Recognition (cs.CV), media_common.quotation_subject, Computer Science - Computer Vision and Pattern Recognition, Good scientific practice, Biomedical challenges, Health Informatics, Guideline, Biomedical image analysis, Article, Field (computer science), Task (project management), Computer Science - Computers and Society, 03 medical and health sciences, 0302 clinical medicine, All institutes and research themes of the Radboud University Medical Center, Computers and Society (cs.CY), FOS: Electrical engineering, electronic engineering, information engineering, Humans, Radiology, Nuclear Medicine and imaging, Quality (business), Set (psychology), 030304 developmental biology, Interpretability, media_common, [SDV.IB] Life Sciences [q-bio]/Bioengineering, 0303 health sciences, Radiological and Ultrasound Technology, Image and Video Processing (eess.IV), Reproducibility of Results, Benchmarking, Electrical Engineering and Systems Science - Image and Video Processing, Prognosis, Computer Graphics and Computer-Aided Design, Data science, Checklist, 3. Good health, Transparency (graphic), [SDV.IB]Life Sciences [q-bio]/Bioengineering, Computer Vision and Pattern Recognition, 030217 neurology & neurosurgery, Rare cancers Radboud Institute for Health Sciences [Radboudumc 9]
Abstract

Highlights • First guideline for reporting biomedical image analysis challenges • Includes checklist for authors and reviewers, Graphical abstract, The number of biomedical image analysis challenges organized per year is steadily increasing. These international competitions have the purpose of benchmarking algorithms on common data sets, typically to identify the best method for a given problem. Recent research, however, revealed that common practice related to challenge reporting does not allow for adequate interpretation and reproducibility of results. To address the discrepancy between the impact of challenges and the quality (control), the Biomedical Image Analysis ChallengeS (BIAS) initiative developed a set of recommendations for the reporting of challenges. The BIAS statement aims to improve the transparency of the reporting of a biomedical image analysis challenge regardless of field of application, image modality or task category assessed. This article describes how the BIAS statement was developed and presents a checklist which authors of biomedical image analysis challenges are encouraged to include in their submission when giving a paper on a challenge into review. The purpose of the checklist is to standardize and facilitate the review process and raise interpretability and reproducibility of challenge results by making relevant information explicit.

Published
2020

47. Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access

Author

Christoph Redl, Tobias Kaminski, Thomas Eiter, Antonius Weinzierl, Vienna University of Technology, Professorship Niemelä I., Department of Computer Science, Aalto-yliopisto, and Aalto University

Subjects
ta113, Theoretical computer science, Computer science, Lift (data mining), 0102 computer and information sciences, 02 engineering and technology, External source, 01 natural sciences, Answer set programming, 010201 computation theory & mathematics, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Non-monotonic logic
Abstract

Answer Set Programming (ASP) is a well-known declarative problem solving approach based on nonmonotonic logic programs, which has been successfully applied to a wide range of applications in artificial intelligence and beyond. To address the needs of modern applications, HEX-programs were introduced as an extension of ASP with external atoms for accessing information outside programs via an API style bi-directional interface mechanism. To evaluate such programs, conflict-driving learning algorithms for SAT and ASP solving have been extended in order to capture the semantics of external atoms. However, a drawback of the state-of-the-art approach is that external atoms are only evaluated under complete assignments (i.e., input to the external source) while in practice, their values often can be determined already based on partial assignments alone (i.e., from incomplete input to the external source). This prevents early backtracking in case of conflicts, and hinders more efficient evaluation of HEX-programs. We thus extend the notion of external atoms to allow for three-valued evaluation under partial assignments, while the two-valued semantics of the overall HEX-formalism remains unchanged. This paves the way for three enhancements: first, to evaluate external sources at any point during model search, which can trigger learning knowledge about the source behavior and/or early backtracking in the spirit of theory propagation in SAT modulo theories (SMT). Second, to optimize the knowledge learned in terms of so-called nogoods, which roughly speaking are impossible input-output configurations. Shrinking nogoods to their relevant input part leads to more effective search space pruning. And third, to make a necessary minimality check of candidate answer sets more efficient by exploiting early external evaluation calls. As this check usually accounts for a large share of the total runtime, optimization is here particularly important. We further present an experimental evaluation of an implementation of a novel HEX-algorithm that incorporates these enhancements using a benchmark suite. Our results demonstrate a clear efficiency gain over the state-of-the-art HEX-solver for the benchmarks, and provide insights regarding the most effective combinations of solver configurations.

Published
2018

48. Energy monitoring as an essential building block towards sustainable ultrascale systems

Author

Jorge G. Barbosa, Manuel F. Dolz, Marcos Dias De Assuncao, Helen D. Karatza, Ivona Brandic, Jean-Marc Pierson, Georges Da Costa, Francisco Almeida, Ilias Mavridis, Vicente Blanco, Ariel Oleksiak, Anne C. Elster, Anne-Cécile Orgerie, Laurent Lefèvre, Mateusz Jarus, Universidad de La Laguna [Tenerife - SP] (ULL), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Laboratoire de l'Informatique du Parallélisme (LIP), Departamento de matematica aplicada [Porto] (LIACC), Universidade do Porto, Vienna University of Technology (TU Wien), Système d’exploitation, systèmes répartis, de l’intergiciel à l’architecture (IRIT-SEPIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse III - Paul Sabatier (UT3), Universidad Carlos III de Madrid [Madrid] (UC3M), Department of Electronic Systems [Trondheim] (IES NTNU), Norwegian University of Science and Technology [Trondheim] (NTNU), Norwegian University of Science and Technology (NTNU)-Norwegian University of Science and Technology (NTNU), Poznan Supercomputing and Networking Center (PSNC), Aristotle University of Thessaloniki, Poznan University of Technology (PUT), Design and Implementation of Autonomous Distributed Systems (MYRIADS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Nesus European COST Action IC1305European Commission under contract 288701 through the project CoolEmAlFrench Fonds national pour la Societe Numerique (FSN) XLCloudGrid5000FWF through project Y 904 START-Program 2015, Grid5000, Avalon, Myriads, Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Faculdade de Engenharia, Aristotle University of Thessaloniki (GREECE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Institut National des Sciences Appliquées de Rennes - INSA (FRANCE), Norwegian University of Science and Technology - NTNU (NORWAY), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Poznan Supercomputing and Networking Center - PSNC (POLAND), Université de Bretagne Sud - UBS (FRANCE), Universität Wien (AUSTRIA), Universidad Carlos III de Madrid - UC3M (SPAIN), Universidad de La Laguna - ULL (SPAIN), Universidade do Porto - UP (PORTUGAL), Université de Rennes 1 (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), Institut de Recherche en Informatique et Systèmes Aléatoires - IRISA (Rennes, France), Institut National Polytechnique de Toulouse - INPT (FRANCE), Universidad de La Laguna ( ULL ), Algorithms and Software Architectures for Distributed and HPC Platforms ( AVALON ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Laboratoire de l'Informatique du Parallélisme ( LIP ), École normale supérieure - Lyon ( ENS Lyon ) -Université Claude Bernard Lyon 1 ( UCBL ), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique ( Inria ) -Centre National de la Recherche Scientifique ( CNRS ) -École normale supérieure - Lyon ( ENS Lyon ) -Université Claude Bernard Lyon 1 ( UCBL ), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique ( CNRS ), Laboratoire de l'Informatique du Parallélisme ( LIP ), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique ( Inria ) -Centre National de la Recherche Scientifique ( CNRS ), Departamento de matematica aplicada [Porto] ( LIACC ), University of Porto, Technical University of Vienna [Vienna] ( TU WIEN ), Institut de recherche en informatique de Toulouse ( IRIT ), Institut National Polytechnique [Toulouse] ( INP ) -Université Toulouse 1 Capitole ( UT1 ) -Université Toulouse - Jean Jaurès ( UT2J ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Universidad Carlos III de Madrid [Madrid], Department of Electronics and Telecommunications [Norwegian University of Science and Technology], Norwegian University of Science and Technology [Trondheim] ( NTNU ), Poznan Supercomputing and Networking Center ( PSNC ), Poznan University of Technology, Design and Implementation of Autonomous Distributed Systems ( MYRIADS ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -SYSTÈMES LARGE ÉCHELLE ( IRISA_D1 ), Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Institut National des Sciences Appliquées - Rennes ( INSA Rennes ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Universidade do Porto = University of Porto, Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)

Subjects
Ultra large-scale systems, Monitoring, General Computer Science, Computer science, [ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020209 energy, energy-efficiency, Big data, Ultra-large-scale systems, Système d'exploitation, Réseaux et télécommunications, Engenharia electrotécnica, electrónica e informática [Ciências da engenharia e tecnologias], 02 engineering and technology, Bottleneck, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Architectures Matérielles, Computer engineering, Electrical engineering, Electronic engineering, Information engineering, 0202 electrical engineering, electronic engineering, information engineering, energy-awareness, Electrical and Electronic Engineering, Simulation, Block (data storage), Energy-efficiency, business.industry, Information and Computer Science, Systèmes embarqués, Electrical engineering, Electronic engineering, Information engineering [Engineering and technology], monitoring, Engenharia de computadores, Engenharia electrotécnica, electrónica e informática, Risk analysis (engineering), Information technology management, Sustainability, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Energy-awareness, Efficient energy use
Abstract

International audience; An Ultrascale System (USS) joins parallel and distributed computing systems that will be two to three orders of magnitude larger than today's infrastructure regarding scale, performance, the number of components and their complexity. For such systems to become a reality, however, advances must be made in High Performance Computing (HPC), large-scale distributed systems, and big data solutions, also tackling challenges such as improving the energy efficiency of the IT infrastructure. Monitoring the power consumed by underlying IT resources is essential towards optimising the manner IT resources are used and hence improve the sustainability of such systems. Nevertheless, monitoring the energy consumed by USSs is a challenging endeavour as the system can comprise thousands of heterogeneous server resources spanning multiple data centres. Moreover, the amount of monitoring data, its gathering, and processing , should never become a bottleneck nor profoundly impact the energy efficiency of the overall system. This work surveys state of the art on energy monitoring of large-scale systems and methodologies for monitoring the power consumed by large systems and discusses some of the challenges to be addressed towards monitoring and improving the energy efficiency of USSs. Next, we present efforts made on designing monitoring solutions. Finally, we discuss potential gaps in existing solutions when tackling emerging large-scale monitoring scenarios and present some directions for future research on the topic.

Published
2018

49. Extended spiking neural P systems with white hole rules and their red–green variants

Author

Marion Oswald, Artiom Alhazov, Sergey Verlan, Rudolf Freund, Sergiu Ivanov, Vladimir Andrunachievici Institute of Mathematics and Computer Science, Institut für Logic and Computation Favoritenstraße, Vienna University of Technology (TU Wien), Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), and Institut für Computersprachen

Subjects
Theoretical computer science, Relation (database), Computer science, White hole, Red-green automata, Complex system, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Article, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Turing, Going beyond Turing, ComputingMilieux_MISCELLANEOUS, computer.programming_language, Discrete mathematics, Quantitative Biology::Neurons and Cognition, White hole rules, Extension (predicate logic), Computer Science Applications, Spiking neural P systems, 010201 computation theory & mathematics, Theory of computation, 020201 artificial intelligence & image processing, computer
Abstract

We consider extended spiking neural P systems with the additional possibility of so-called "white hole rules", which send the complete contents of a neuron to other neurons, and we prove that this extension of the original model can easily simulate register machines. Based on this proof, we then define red-green variants of these extended spiking neural P systems with white hole rules and show how to go beyond Turing with these red-green systems. We also discuss the number of actor neurons needed, and the relation of this model to some special variants of Lindenmayer systems.

Published
2017

50. Preference-Based Inconsistency Management in Multi-Context Systems

Author

Thomas Eiter, Antonius Weinzierl, Vienna University of Technology, Department of Computer Science, Aalto-yliopisto, and Aalto University

Subjects
ta113, Theoretical computer science, Computer science, Context (language use), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Preference, Task (project management), Nondeterministic algorithm, 010201 computation theory & mathematics, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Selection (linguistics), 020201 artificial intelligence & image processing, Medical diagnosis, Negation as failure, Information exchange
Abstract

Multi-Context Systems (MCS) are a powerful framework for interlinking possibly heterogeneous, autonomous knowledge bases, where information can be exchanged among knowledge bases by designated bridge rules with negation as failure. An acknowledged issue with MCS is inconsistency that arises due to the information exchange. To remedy this problem, inconsistency removal has been proposed in terms of repairs, which modify bridge rules based on suitable notions for diagnosis of inconsistency. In general, multiple diagnoses and repairs do exist; this leaves the user, who arguably may oversee the inconsistency removal, with the task of selecting some repair among all possible ones. To aid in this regard, we extend the MCS framework with preference information for diagnoses, such that undesired diagnoses are filtered out and diagnoses that are most preferred according to a preference ordering are selected. We consider preference information at a generic level and develop meta-reasoning techniques on diagnoses in MCS that can be exploited to reduce preference-based selection of diagnoses to computing ordinary subset-minimal diagnoses in an extended MCS. We describe two meta-reasoning encodings for preference orders: the first is conceptually simple but may incur an exponential blowup. The second is increasing only linearly in size and based on duplicating the original MCS. The latter requires nondeterministic guessing if a subset-minimal among all most preferred diagnoses should be computed. However, a complexity analysis of diagnoses shows that this is worst-case optimal, and that in general, preferred diagnoses have the same complexity as subset-minimal ordinary diagnoses. Furthermore, (subset-minimal) filtered diagnoses and (subset-minimal) ordinary diagnoses also have the same complexity.

Published
2017

Catalog

Books, media, physical & digital resources
See catalog results