References of "Paper published in a book"
     in
Bookmark and Share    
See detailThe legacy of coal mining – a view on examples in Belgium and France
Helfer, Malte UL

in Deutsches Bergbau-Museum Bochum (Ed.) Boom – Crisis – Heritage. King Coal and Energy Revolutions after 1945; proceedings of the international conference March 14th-16th 2018, Technische Hochschule Georg Agricola, Bochum (in press)

Following the end of coalmining in Belgium (1992) and France (2004), the year 2018 marks the end of hard coal mining in Germany as well. This contribution looks at the legacy of coalmining of Germany’s ... [more ▼]

Following the end of coalmining in Belgium (1992) and France (2004), the year 2018 marks the end of hard coal mining in Germany as well. This contribution looks at the legacy of coalmining of Germany’s French-speaking neighbours and presents the most important remaining coal mining heritage sites as well as some extraordinary converted sites in France and the Belgian province Wallonia. [less ▲]

Detailed reference viewed: 132 (1 UL)
Full Text
Peer Reviewed
See detailA Theoretical Framework for Understanding the Relationship between Log Parsing and Anomaly Detection
Shin, Donghwan UL; Khan, Zanis Ali UL; Bianculli, Domenico UL et al

in Proceedings of the 21st International Conference on Runtime Verification (in press)

Log-based anomaly detection identifies systems' anomalous behaviors by analyzing system runtime information recorded in logs. While many approaches have been proposed, all of them have in common an ... [more ▼]

Log-based anomaly detection identifies systems' anomalous behaviors by analyzing system runtime information recorded in logs. While many approaches have been proposed, all of them have in common an essential pre-processing step called log parsing. This step is needed because automated log analysis requires structured input logs, whereas original logs contain semi-structured text printed by logging statements. Log parsing bridges this gap by converting the original logs into structured input logs fit for anomaly detection. Despite the intrinsic dependency between log parsing and anomaly detection, no existing work has investigated the impact of the "quality" of log parsing results on anomaly detection. In particular, the concept of "ideal" log parsing results with respect to anomaly detection has not been formalized yet. This makes it difficult to determine, upon obtaining inaccurate results from anomaly detection, if (and why) the root cause for such results lies in the log parsing step. In this short paper, we lay the theoretical foundations for defining the concept of "ideal" log parsing results for anomaly detection. Based on these foundations, we discuss practical implications regarding the identification and localization of root causes, when dealing with inaccurate anomaly detection, and the identification of irrelevant log messages. [less ▲]

Detailed reference viewed: 99 (15 UL)
Full Text
Peer Reviewed
See detailPrimauté et droits fondamentaux: une question de compétences?
Neframi, Eleftheria UL

in Gaudin, Hélène (Ed.) Primauté et clause la plus protectrice: le renouveau des droits fondamentaux en Europe (in press)

Dans le rapport entre le principe de primauté et la protection des droits fondamentaux la question de la répartition des compétences ne semble pas, à première vue, se poser : la primauté nous place dans ... [more ▼]

Dans le rapport entre le principe de primauté et la protection des droits fondamentaux la question de la répartition des compétences ne semble pas, à première vue, se poser : la primauté nous place dans la sphère de compétence de l’Union, alors que la protection des droits fondamentaux, comme contestation de la primauté, relève de la sphère nationale. Le conflit entre primauté et droits fondamentaux relève ainsi du rapport des ordres juridiques et est résolu par leur interaction, exprimée dans la balance entre le principe de coopération loyale et la prise en compte des intérêts nationaux, sur la base du respect de l’identité nationale ou en invoquant l’article 53 de la Charte . En ce sens, la problématique des compétences n’entre pas en ligne de compte. Cependant, l’élaboration de standards européens de protection des droits fondamentaux, en tant qu’objet direct ou indirect de l’exercice des compétences de l’Union, peut servir le compromis issu du principe d’attribution. Ainsi, primauté et droits fondamentaux peuvent être abordés sous l’angle des compétences. Le rapport entre primauté et droits fondamentaux n’est toutefois pas forcément conflictuel. La Charte est source d’obligations pour les Etats membres au-delà du champ couvert par l’exercice des compétences de l’Union. Il est bien établi que la notion de mise en œuvre du droit de l’Union en tant que condition de l’application de la Charte à l’égard des Etats membres, est entendue dans le sens du domaine couvert par le droit de l’Union. Ainsi, les standards européens de protection sont eux-mêmes couverts par la primauté et interviennent dans l’encadrement de l’autonomie nationale et l’articulation des compétences [less ▲]

Detailed reference viewed: 68 (4 UL)
See detailLe dialogue entre les juges en matière de protection des droits de l'homme
Pelin Raducu, Ioana UL

in Menetrey, Séverine; Hess, Burkhard (Eds.) Les dialogues des juges en Europe (in press)

Dans cet article, nous allons mettre en exergue quelques aspects des arrêts récents provenant de la Cour de justice de l’UE (Akerberg Frasson, Melloni, Kamberaj)qui démontrent l’émergence d’un standard ... [more ▼]

Dans cet article, nous allons mettre en exergue quelques aspects des arrêts récents provenant de la Cour de justice de l’UE (Akerberg Frasson, Melloni, Kamberaj)qui démontrent l’émergence d’un standard propre de l’UE en matière des droits de l’homme. Cette tendance de la C.J.U.E. contredira le prescrit normatif découlant du « dialogue des juges » d’interprétation conforme à la jurisprudence de la C.E.D.H. avant que l’adhésion de l’UE à la Convention E.D.H. ne soit formellement acquise. [less ▲]

Detailed reference viewed: 113 (12 UL)
Full Text
Peer Reviewed
See detailVirtual Agent Representation for Critical Transactions
Sun, Ningyuan UL; Botev, Jean UL

in Proceedings of the 12th ACM Multimedia Systems Conference (MMSys) (in press)

Detailed reference viewed: 48 (8 UL)
Full Text
Peer Reviewed
See detailLa Charte dans l'action extérieure de l'Union européenne
Neframi, Eleftheria UL

in Iliopoulou Penot, Anastasia; Xenou, Lamprini (Eds.) La Charte des droits fondamentaux de l'UE (in press)

Detailed reference viewed: 99 (7 UL)
Full Text
Peer Reviewed
See detailLes archevêques de Milan face aux premières expériences seigneuriales: stratégies et positionnements (milieu XIIIe-début XIVe s.)
Salemme, Timothy UL

in Barralis, Christine (Ed.) L’évêque face à son métier. Actes du colloque international, Metz. 15-17 novembre 2017 (in press)

Detailed reference viewed: 26 (1 UL)
Full Text
See detailDatenbank für Zweisprachige Historische Luxemburgische Bekanntmachungen
Gilles, Peter UL; Ziegler, Evelyn

in Wallmeier, Nadine; Tophinke, Doris (Eds.) Historische Stadtsprachenforschung (in press)

Detailed reference viewed: 126 (4 UL)
Full Text
Peer Reviewed
See detailOn the (M)iNTRU assumption in the integer case
Barthel, Jim Jean-Pierre UL; Müller, Volker UL; Rosie, Razvan UL

in Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings (in press)

In AsiaCrypt 2019, Genise, Gentry, Halevi, Li and Micciancio put forth two novel and intriguing computational hardness hypotheses: The inhomogeneous NTRU (iNTRU) assumption and its matrix version MiNTRU ... [more ▼]

In AsiaCrypt 2019, Genise, Gentry, Halevi, Li and Micciancio put forth two novel and intriguing computational hardness hypotheses: The inhomogeneous NTRU (iNTRU) assumption and its matrix version MiNTRU. In this work, we break the integer case of the iNTRU assumption through elementary lattice reduction, and we describe how the attack might be generalized to polynomial rings and to the low dimensional MiNTRU assumption with small noise. [less ▲]

Detailed reference viewed: 74 (9 UL)
See detail« … Eripuit servus mihi vitam » - Représentations médiatiques de la violence et de la criminalité dans les provinces occidentales de l'Empire romain
Binsfeld, Andrea UL

in Amodio, Mara (Ed.) The imagery of violence in Roman society (I-VI cent.). Persistence, innovations and interrelations from the Roman to the Christian Empire (in press)

Detailed reference viewed: 117 (16 UL)
Full Text
Peer Reviewed
See detailA New Perspective on the Luxembourgish Genitive
Döhmer, Caroline UL

in Germanic Genitives (in press)

Detailed reference viewed: 436 (11 UL)
Full Text
Peer Reviewed
See detailExternalisation de la politique migratoire et identité de l'Union européenne
Neframi, Eleftheria UL; Gatti, Mauro UL

in Benlolo, Myriam (Ed.) L'Union européenne et les migrations (in press)

Detailed reference viewed: 197 (12 UL)
Full Text
Peer Reviewed
See detailL’exposition d’objets ou de collections de « marque » : cobranding, réécriture, réénonciation
Schall, Céline UL

in Laval, Sylvie (Ed.) Marques muséales : un espace public revisité ? (in press)

Le cobranding est une pratique habituelle du secteur marchand. Mais lorsque deux musées réalisent ensemble une exposition, peut-on parler de cobranding muséal ? Quelles en seraient les spécificités  ... [more ▼]

Le cobranding est une pratique habituelle du secteur marchand. Mais lorsque deux musées réalisent ensemble une exposition, peut-on parler de cobranding muséal ? Quelles en seraient les spécificités ? Quels effets peut avoir cette démarche sur la communication ou sur l’exposition ? Notamment, le musée d’accueil s’approprie-t-il simplement l’imaginaire et les valeurs de la marque invitée par un phénomène de « transfert » ? Pour répondre à ces questions, nous étudions trois expositions qui reprennent des objets ou collections de musées dont la marque est internationalement reconnue. L’analyse sémiotique des images de marque du musée d’accueil et du musée invité ainsi que l’analyse sémiopragmatique des expositions montrent l’impact de la présence d’une grande marque internationale sur l’exposition et réciproquement, l’impact de l’exposition sur l’image de marque du musée d’accueil. Plus qu’un simple cobranding, c’est une réécriture impliquant une réénonciation du discours et des valeurs portés par les marques qui est proposée à travers ces expositions. Le processus aboutit à la création de nouveaux espaces symboliques et d’expositions réflexives, avec plusieurs niveaux de lecture. [less ▲]

Detailed reference viewed: 233 (6 UL)
Full Text
Peer Reviewed
See detailDiscrete-Phase Sequence Design with Stopband and PSL Constraints for Cognitive Radar
Alaeekerahroodi, Mohammad UL; Kumar, Sumit UL; Mysore Rama Rao, Bhavani Shankar UL et al

in Proceedings of EuRAD 2020 (in press)

We present the design of discrete-phase sequences considering simultaneously the peak sidelobe level (PSL) and avoiding reserved frequency bands which are occupied by narrowband interferers or ... [more ▼]

We present the design of discrete-phase sequences considering simultaneously the peak sidelobe level (PSL) and avoiding reserved frequency bands which are occupied by narrowband interferers or communications. We use the coordinate descent framework and propose an algorithm to design discrete-phase sequences with spectral power suppressed in arbitrary bands and with low auto-correlation sidelobes in terms of PSL. Our proposed algorithm exploits fast Fourier transform and is, therefore, computationally efficient. The over-the-air experiments using implementation on software-defined radio show reasonable agreement with numerical simulations and feasibility for field-deployment [less ▲]

Detailed reference viewed: 67 (5 UL)
Full Text
See detailUpdate Internationales und Europäisches Steuerrecht
Sinnig, Julia UL

in Taeger, Jürgen (Ed.) Tagungsband DSRI-Herbstakademie 2020 (in press)

Im Berichtszeitraum dieses Updates rief die OECD zu einem zweiten Öffentlichkeitsbetei-ligungsverfahren auf und erarbeitete einen präziseren Lösungsansatz zur Besteuerung digitalisierter Geschäftsmodelle ... [more ▼]

Im Berichtszeitraum dieses Updates rief die OECD zu einem zweiten Öffentlichkeitsbetei-ligungsverfahren auf und erarbeitete einen präziseren Lösungsansatz zur Besteuerung digitalisierter Geschäftsmodelle, der in einer Veröffentlichung im Januar 2020 vorgestellt wurde. Auf Ebene der Europäischen Union gab es im Berichtszeitraum keine Weiterent-wicklung der Richtlinienvorschläge zu einer Digitalsteuer und dem Konzept der „signifi-kanten digitalen Präsenz“. Der EuGH urteilte am 3. März 2020 in Hinblick auf die unions-rechtliche Vereinbarkeit zweier ungarischer Umsatzsteuern. Dieses Urteil erlaubt erste Rückschlüsse bezüglich der Europarechtskonformität umsatzbasierter Steuern, wie bspw. auch im Berichtszeitraum eingeführte Digitalsteuern einzelner Mitgliedstaaten. Dieser Beitrag knüpft an die Vorträge von Prof. Dr. Jens M. Schmittmann und der Verfasserin anlässlich der Herbstakademien 2018 in Bochum und 2019 in Oldenburg, sowie dem Vortrag der Verfasserin anlässlich der Herbstakademie 2017 in Heidelberg an. [less ▲]

Detailed reference viewed: 80 (2 UL)
Full Text
Peer Reviewed
See detailConservazione e ricezione dei documenti pontifici in Italia settentrionale: il caso del monastero cistercense di Chiaravalle Milanese (secoli XII-XVI)
Salemme, Timothy UL

in Salemme, Timothy; Renault, Jean-Baptiste (Eds.) Conservation et réception des documents pontificaux par les Ordres religieux (XIe-XVe siècles). Actes du colloque international. Nancy, 12-13 décembre 2013 (in press)

Detailed reference viewed: 48 (0 UL)
Full Text
Peer Reviewed
See detailPartitioned Searchable Encryption
Barthel, Jim Jean-Pierre UL; Beunardeau, Marc; Rosie, Razvan et al

in Qiong, Huang; Yu, Yu (Eds.) Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings (in press)

Symmetric searchable encryption (SSE) allows to outsource encrypted data to an untrusted server and retain searching capabilities. This is done without impacting the privacy of both the data and the ... [more ▼]

Symmetric searchable encryption (SSE) allows to outsource encrypted data to an untrusted server and retain searching capabilities. This is done without impacting the privacy of both the data and the search/update queries. In this work we put forth a new flavour of symmetric searchable encryption (SSE): Partitioned SSE is meant to capture the cases where the search rights must be partitioned among multiple individuals. We motivate through compelling examples the practical need for such a notion and discuss instantiations based on functional encryption and trapdoor permutations. First we leverage the power of functional encryption (FE). Our construction follows the general technique of encrypting the set of keywords and the presumably larger datafiles separately, a keyword acting as a ``pointer'' to datafiles it belongs to. To improve on the constraint factors (large ciphertext, slow encryption/decryption procedures) that are inherent in FE schemes, the keyword check is done with the help of a Bloom filter -- one per datafile: the crux idea is to split the filter into buckets, and encrypt each bucket separately under an FE scheme. Functional keys are given for binary \masks checking if relevant positions are set to 1 inside the underlying bit-vector of the Bloom filter. The second construction we present achieves forward security and stems from the scheme by Bost in CCS'16. We show that a simple tweak of the original construction gives rise to a scheme supporting updates in the partitioned setting. Moreover, the constructions take into account the possibility that some specific users are malicious while declaring their search results. [less ▲]

Detailed reference viewed: 101 (1 UL)
Full Text
Peer Reviewed
See detailSpecifying Properties over Inter-Procedural, Source Code Level Behaviour of Programs
Dawes, Joshua UL; Bianculli, Domenico UL

in Proceedings of the 21st International Conference on Runtime Verification (in press)

The problem of verifying a program at runtime with respect to some formal specification has led to the development of a rich collection of specification languages. These languages often have a high level ... [more ▼]

The problem of verifying a program at runtime with respect to some formal specification has led to the development of a rich collection of specification languages. These languages often have a high level of abstraction and provide sophisticated modal operators, giving a high level of expressiveness. In particular, this makes it possible to express properties concerning the source code level behaviour of programs. However, for many languages, the correspondence between events generated at the source code level and parts of the specification in question would have to be carefully defined. To enable expressing — using a temporal logic — properties over source code level behaviour without the need for this correspondence, previous work introduced Control-Flow Temporal Logic (CFTL), a specification language with a low level of abstraction with respect to the source code of programs. However, this work focused solely on the intra-procedural setting. In this paper, we address this limitation by introducing Inter-procedural CFTL, a language for expressing source code level, inter-procedural properties of program runs. We evaluate the new language, iCFTL, via application to a real-world case study. [less ▲]

Detailed reference viewed: 145 (21 UL)
See detailEsclavage, servitude, travail forcé : constitution et évolution d’un cadre conceptuel
Erpelding, Michel UL

in Marchadier, Fabien (Ed.) La prohibition de l'esclavage (in press)

This chapter examines the emergence, definition and evolution of the concepts of slavery, forced labour and servitude in international law.

Detailed reference viewed: 26 (0 UL)
Full Text
Peer Reviewed
See detailProcess analysis in thermal process engineering with high-performance computing using the example of grate firing
Peters, Bernhard UL; Rousset, Alban UL; Besseron, Xavier UL et al

in 12th European Conference on Industrial Furnaces and Boilers (in press)

Biomass as a renewable energy source continues to grow in popularity to reduce fossil fuel consumption for environmental and economic benefits. In the present contribution, the combustion chamber of a 16 ... [more ▼]

Biomass as a renewable energy source continues to grow in popularity to reduce fossil fuel consumption for environmental and economic benefits. In the present contribution, the combustion chamber of a 16 MW geothermal steam super-heater, which is part of the Enel Green Power "Cornia 2" power plant, is being investigated with high-performance computing methods. For this purpose, the extended discrete element method (XDEM) developed at the University of Luxembourg is used in a high-performance computing environment, which includes both the moving wooden bed and the combustion chamber above it. The XDEM simulation platform is based on a hybrid four-way coupling between the Discrete Element Method (DEM) and Computational Fluid Dynamics (CFD). In this approach, particles are treated as discrete elements that are coupled by heat, mass, and momentum transfer to the surrounding gas as a continuous phase. For individual wood particles, besides the equations of motion, the differential conservation equations for mass, heat, and momentum are solved, which describe the thermodynamic state during thermal conversion. The consistency of the numerical results with the actual system performance is discussed in this paper to determine the potentials and limitations of the approach. [less ▲]

Detailed reference viewed: 175 (36 UL)
Full Text
Peer Reviewed
See detailA Methodology for Handling Data Movements by Anticipation: Position Paper
Bleuse, Raphaël UL; Lucarelli, Giorgio; Trystram, Denis

in Euro-Par 2018 Workshops (in press)

The enhanced capabilities of large scale parallel and distributed platforms produce a continuously increasing amount of data which have to be stored, exchanged and used by various tasks allocated on ... [more ▼]

The enhanced capabilities of large scale parallel and distributed platforms produce a continuously increasing amount of data which have to be stored, exchanged and used by various tasks allocated on different nodes of the system. The management of such a huge communication demand is crucial for reaching the best possible performance of the system. Meanwhile, we have to deal with more interferences as the trend is to use a single all-purpose interconnection network whatever the interconnect (tree-based hierarchies or topology-based heterarchies). There are two different types of communications, namely, the flows induced by data exchanges during the computations, and the flows related to Input/Output operations. We propose in this paper a general model for interference-aware scheduling, where explicit communications are replaced by external topological constraints. Specifically, the interferences of both communication types are reduced by adding geometric constraints on the allocation of tasks into machines. The proposed constraints reduce implicitly the data movements by restricting the set of possible allocations for each task. This methodology has been proved to be efficient in a recent study for a restricted interconnection network (a line/ring of processors which is an intermediate between a tree and higher dimensions grids/torus). The obtained results illustrated well the difficulty of the problem even on simple topologies, but also provided a pragmatic greedy solution, which was assessed to be efficient by simulations. We are currently extending this solution for more complex topologies. This work is a position paper which describes the methodology, it does not focus on the solving part. [less ▲]

Detailed reference viewed: 140 (0 UL)
Full Text
Peer Reviewed
See detailLe quotidien d’un poilu de la première guerre mondiale sur Facebook : nouvelle forme de médiation, nouvelle expérience ?
Schall, Céline UL; Vilatte, Jean-Christophe

in Les mondes de la médiation culturelle (in press)

« En 2013, le Musée de la Grande Guerre du Pays de Meaux et l’agence de communication DDB ont élaboré une page Facebook d’un genre nouveau. Facebook 1914, le quotidien de la première guerre offre une ... [more ▼]

« En 2013, le Musée de la Grande Guerre du Pays de Meaux et l’agence de communication DDB ont élaboré une page Facebook d’un genre nouveau. Facebook 1914, le quotidien de la première guerre offre une forme de médiation a priori inédite pour un musée français. Elle présente l’histoire d’un personnage de fiction, Léon Vivien, qui raconte son quotidien lors de la première guerre mondiale, sur Facebook, comme si ce réseau social avait existé à cette époque. Cette contribution met en évidence certains des effets de sens de la page par une analyse sémiotique du dispositif et une analyse thématique de ses contenus. Nous questionnons ensuite cette « nouvelle » forme de médiation qui se dit « participante » et qui, en réalité, reste assez classique dans son contenu et sous-exploite le potentiel de Facebook. » [less ▲]

Detailed reference viewed: 103 (1 UL)
Full Text
Peer Reviewed
See detailBlockchain Governance: An Overview and Prediction of Optimal Strategies Using Nash Equilibrium
Khan, Nida UL; Ahmad, Tabrez; Patel, Anass et al

in 3rd AUE International Research Conference (in press)

Blockchain governance is a subject of ongoing research and an interdisciplinary view of blockchain governance is vital to aid in further research for establishing a formal governance framework for this ... [more ▼]

Blockchain governance is a subject of ongoing research and an interdisciplinary view of blockchain governance is vital to aid in further research for establishing a formal governance framework for this nascent technology. In this paper, the position of blockchain governance within the hierarchy of Institutional governance is discussed. Blockchain governance is analyzed from the perspective of IT governance using Nash equilibrium to predict the outcome of different governance decisions. A payoff matrix for blockchain governance is created and simulation of different strategy profiles is accomplished for computation of all Nash equilibria. We also create payoff matrices for different kinds of blockchain governance, which were used to propose novel mathematical formulae usable to predict the best governance strategy that minimizes the occurrence of a hard fork as well as predicts the behavior of the majority during protocol updates. [less ▲]

Detailed reference viewed: 252 (22 UL)
Full Text
Peer Reviewed
See detailWhich Properties has an Icon? A Critical Discussion on Evaluation Methods for Standardised Data Protection Iconography
Rossi, Arianna UL; Lenzini, Gabriele UL

in Proceedings of the 8th Workshop on Socio-Technical Aspects in Security and Trust (STAST) (in press)

Following GDPR's Article12.7's proposal to use standardized icons to inform data subject in "an easily visible, intelligible and clearly legible manner," several icon sets have been developed. In this ... [more ▼]

Following GDPR's Article12.7's proposal to use standardized icons to inform data subject in "an easily visible, intelligible and clearly legible manner," several icon sets have been developed. In this paper, we firstly critically review some of those proposals. We then examine the properties that icons and icon sets should arguably fulfill according to Art.12's transparency provisions. Lastly, we discuss metrics and evaluation procedures to measure compliance with the Article. [less ▲]

Detailed reference viewed: 187 (18 UL)
Full Text
Peer Reviewed
See detailNIKE from Affine Determinant Programs
Barthel, Jim Jean-Pierre UL; Rosie, Razvan UL

in Qiong, Huang; Yu, Yu (Eds.) Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings (in press)

A multi-party non-interactive key-exchange (NIKE) scheme enables N users to securely exchange a secret key K in a non-interactive manner. It is well-known that NIKE schemes can be obtained assuming the ... [more ▼]

A multi-party non-interactive key-exchange (NIKE) scheme enables N users to securely exchange a secret key K in a non-interactive manner. It is well-known that NIKE schemes can be obtained assuming the existence of indistinguishability obfuscation (iO). In this work, we revisit the original, iO-based, provably-secure NIKE construction by Boneh and Zhandry, aiming to simplify it. The core idea behind our protocol is to replace the functionality of the obfuscator with the one of an affine determinant program (ADP). Although ADPs have been designed with the purpose of attaining indistinguishability obfuscation, such implication is left open for general circuits. The ingredients enabling to prove the security of our scheme stem into a more careful analysis of the branching programs needed to build ADPs. In particular, we show: 1) An intuitive indistinguishability notion defined for ADPs of puncturable pseudorandom functions (PRFs) is sufficient to prove security for NIKE. 2) A set of simple conditions based on ADP's branching program topology that are sufficient for proving indistinguishability of ADPs. We leave open the question of finding ADPs satisfying them. [less ▲]

Detailed reference viewed: 40 (4 UL)
Full Text
Peer Reviewed
See detailOn Frame Fingerprinting and Controller Area Networks Security in Connected Vehicles
Buscemi, Alessio UL; Turcanu, Ion; Castignani, German et al

in IEEE Consumer Communications & Networking Conference, Virtual Conference 8-11 January 2022 (2022, January)

Modern connected vehicles are equipped with a large number of sensors, which enable a wide range of services that can improve overall traffic safety and efficiency. However, remote access to connected ... [more ▼]

Modern connected vehicles are equipped with a large number of sensors, which enable a wide range of services that can improve overall traffic safety and efficiency. However, remote access to connected vehicles also introduces new security issues affecting both inter and intra-vehicle communications. In fact, existing intra-vehicle communication systems, such as Controller Area Network (CAN), lack security features, such as encryption and secure authentication for Electronic Control Units (ECUs). Instead, Original Equipment Manufacturers (OEMs) seek security through obscurity by keeping secret the proprietary format with which they encode the information. Recently, it has been shown that the reuse of CAN frame IDs can be exploited to perform CAN bus reverse engineering without physical access to the vehicle, thus raising further security concerns in a connected environment. This work investigates whether anonymizing the frames of each newly released vehicle is sufficient to prevent CAN bus reverse engineering based on frame ID matching. The results show that, by adopting Machine Learning techniques, anonymized CAN frames can still be fingerprinted and identified in an unknown vehicle with an accuracy of up to 80 %. [less ▲]

Detailed reference viewed: 43 (6 UL)
Full Text
Peer Reviewed
See detailAggregating Energy Flexibility for Demand-Side Management in Manufacturing Companies – A Two-Step Method
Lindner, M; Wenninger, Simon; Fridgen, Gilbert UL et al

in Production at the Leading Edge of Technology (2022)

Towards greener production, manufacturing companies face several challenges, for example peak load shaving or flexible production planning as parts of demand-side management (DSM). DSM uses processes that ... [more ▼]

Towards greener production, manufacturing companies face several challenges, for example peak load shaving or flexible production planning as parts of demand-side management (DSM). DSM uses processes that can be shut down, shifted, or controlled. Advances in digitalization in the energy sector and manufacturing systems create transparency which in turn offers new opportunities to commercialize energy flexibility potentials as optimally and automatically as possible. The variety of flexibilities in manufacturing systems and various dependencies of different kinds of complex manufacturing processes complicate the modelling and aggregation of flexibility. To overcome this challenge, we developed a method for the aggregation of energy flexibilities that is based on a generic energy flexibility data model. The method proposes a two-step approach to aggregate flexibilities cost efficiently and considers manufacturing specific limitations. For cost-efficient aggregation, we use in the first step the merit-order model known from the energy industry and in the second step the bin-packing problem originating from combinatorial optimization, adapted according to the generic data model. The two-step approach allows energy flexibilities to be aggregated across industries, facilities, and systems, thus ensuring broad applicability. [less ▲]

Detailed reference viewed: 31 (2 UL)
Full Text
See detailDichtungsanalyse von Elastomer-O-Ringen unter Hochdruck bei Raum- und Tieftemperatur
Repplinger, Christian UL; Sellen, Stephan UL; Maas, Stefan UL

in Repplinger, Christian (Ed.) 47. VDI-Jahrestagung: Schadensanalyse 2021 - Wasserstoff in metallischen Bauteilen und Mediale und klimatische Beanspruchung von polymeren Produkten (2021, October)

Detailed reference viewed: 14 (0 UL)
Full Text
Peer Reviewed
See detailProvably Improving Election Verifiability in Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in Electronic Voting 6th International Joint Conference, E-Vote-ID 2021 Virtual Event, October 5–8, 2021, Proceedings (2021, October)

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the ... [more ▼]

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assump- tion that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice leaves open space for attacks, as has been shown recently. In this paper we make two simple additions to Belenios and we formally prove that the new version satisfies the expected verifiability properties. Our proofs are automatically performed with the Tamarin prover, under the assumption that voters are allowed to vote at most four times. [less ▲]

Detailed reference viewed: 77 (18 UL)
Full Text
Peer Reviewed
See detail"Just for the sake of transparency": Exploring Voter Mental Models Of Verifiability
Zollinger, Marie-Laure UL; Estaji, Ehsan UL; Ryan, Peter Y A UL et al

in Electronic Voting, Sixth International Joint Conference, E-Vote-ID 2021, Bregenz, Austria, October 5-8 (2021, October)

Verifiable voting schemes allow voters to verify their individual votes and the election outcome. The voting protocol Selene offers verification of plaintext votes while preserving privacy. Misconceptions ... [more ▼]

Verifiable voting schemes allow voters to verify their individual votes and the election outcome. The voting protocol Selene offers verification of plaintext votes while preserving privacy. Misconceptions of verification mechanisms might result in voters mistrust of the system or abstaining from using it. In this paper, we interviewed 24 participants and invited them to illustrate their mental models of Selene. The drawings demonstrated different levels of sophistication and four mental models: 1) technology understanding, 2) meaning of the verification phase, 3) security concerns, and 4) unnecessary steps. We highlight the misconceptions expressed regarding Internet voting technologies and the system design. Based on our findings, we conclude with recommendations for future implementations of Selene as well as for the design of Internet voting systems in general. [less ▲]

Detailed reference viewed: 107 (6 UL)
Full Text
Peer Reviewed
See detailDo We Really Need TSN in Next-Generation Helicopters? Insights From a Case-Study
Mauclair, Cédric; Gutiérrez, Marina; Migge, Jörn et al

in 2021 AIAA/IEEE 40th Digital Avionics Systems Conference (DASC) (2021, October)

As Ethernet rapidly replaces legacy networks as the core high-speed network in helicopter’s avionics and mission systems, we ask in this paper the question of the technical benefits of migrating to ... [more ▼]

As Ethernet rapidly replaces legacy networks as the core high-speed network in helicopter’s avionics and mission systems, we ask in this paper the question of the technical benefits of migrating to Ethernet Time-Sensitive-Networking (TSN). Indeed, TSN has become a rich toolbox of mechanisms and protocols to address Quality-of-Service (QoS) requirements pertaining to timing and reliability. TSN is quickly becoming the prominent technology for wired high-speed communications in a variety of application domains like automotive, industry 4.0 and telecom. In this context, this work explores the use of TSN timing QoS mechanisms for helicopter’s avionics and mission systems on a case-study representative of the communication requirements of next-generation systems. This study aims to provide quantified insights into what can be expected from TSN in terms of timing, memory usage and extensibility. [less ▲]

Detailed reference viewed: 44 (4 UL)
Full Text
Peer Reviewed
See detailProvably Improving Election Verifiability in Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in Electronic Voting 6th International Joint Conference, E-Vote-ID 2021 Virtual Event, October 5–8, 2021, Proceedings (2021, October)

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the ... [more ▼]

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assump- tion that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice leaves open space for attacks, as has been shown recently. In this paper we make two simple additions to Belenios and we formally prove that the new version satisfies the expected verifiability properties. Our proofs are automatically performed with the Tamarin prover, under the assumption that voters are allowed to vote at most four times. [less ▲]

Detailed reference viewed: 77 (18 UL)
Full Text
Peer Reviewed
See detailProvably Improving Election Verifiability in Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in Electronic Voting 6th International Joint Conference, E-Vote-ID 2021 Virtual Event, October 5–8, 2021, Proceedings (2021, October)

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the ... [more ▼]

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assump- tion that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice leaves open space for attacks, as has been shown recently. In this paper we make two simple additions to Belenios and we formally prove that the new version satisfies the expected verifiability properties. Our proofs are automatically performed with the Tamarin prover, under the assumption that voters are allowed to vote at most four times. [less ▲]

Detailed reference viewed: 77 (18 UL)
Full Text
Peer Reviewed
See detailProvably Improving Election Verifiability in Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in Electronic Voting 6th International Joint Conference, E-Vote-ID 2021 Virtual Event, October 5–8, 2021, Proceedings (2021, October)

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the ... [more ▼]

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assump- tion that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice leaves open space for attacks, as has been shown recently. In this paper we make two simple additions to Belenios and we formally prove that the new version satisfies the expected verifiability properties. Our proofs are automatically performed with the Tamarin prover, under the assumption that voters are allowed to vote at most four times. [less ▲]

Detailed reference viewed: 77 (18 UL)
Full Text
Peer Reviewed
See detailProvably Improving Election Verifiability in Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in Electronic Voting 6th International Joint Conference, E-Vote-ID 2021 Virtual Event, October 5–8, 2021, Proceedings (2021, October)

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the ... [more ▼]

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assump- tion that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice leaves open space for attacks, as has been shown recently. In this paper we make two simple additions to Belenios and we formally prove that the new version satisfies the expected verifiability properties. Our proofs are automatically performed with the Tamarin prover, under the assumption that voters are allowed to vote at most four times. [less ▲]

Detailed reference viewed: 77 (18 UL)
Full Text
Peer Reviewed
See detailProvably Improving Election Verifiability in Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in Electronic Voting 6th International Joint Conference, E-Vote-ID 2021 Virtual Event, October 5–8, 2021, Proceedings (2021, October)

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the ... [more ▼]

Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon as either the voting registrar or the voting server is honest. It was formally proved to be secure, making the assump- tion that no further ballots are cast on the bulletin board after voters verified their ballots. In practice, however, revoting is allowed and voters can verify their ballots anytime. This gap between formal proofs and use in practice leaves open space for attacks, as has been shown recently. In this paper we make two simple additions to Belenios and we formally prove that the new version satisfies the expected verifiability properties. Our proofs are automatically performed with the Tamarin prover, under the assumption that voters are allowed to vote at most four times. [less ▲]

Detailed reference viewed: 77 (18 UL)
Full Text
Peer Reviewed
See detailConFuzzius: A Data Dependency-Aware Hybrid Fuzzer for Smart Contracts
Ferreira Torres, Christof UL; Iannillo, Antonio Ken UL; Gervais, Arthur et al

in European Symposium on Security and Privacy, Vienna 7-11 September 2021 (2021, September)

Smart contracts are Turing-complete programs that are executed across a blockchain. Unlike traditional programs, once deployed, they cannot be modified. As smart contracts carry more value, they become ... [more ▼]

Smart contracts are Turing-complete programs that are executed across a blockchain. Unlike traditional programs, once deployed, they cannot be modified. As smart contracts carry more value, they become more of an exciting target for attackers. Over the last years, they suffered from exploits costing millions of dollars due to simple programming mistakes. As a result, a variety of tools for detecting bugs have been proposed. Most of these tools rely on symbolic execution, which may yield false positives due to over-approximation. Recently, many fuzzers have been proposed to detect bugs in smart contracts. However, these tend to be more effective in finding shallow bugs and less effective in finding bugs that lie deep in the execution, therefore achieving low code coverage and many false negatives. An alternative that has proven to achieve good results in traditional programs is hybrid fuzzing, a combination of symbolic execution and fuzzing. In this work, we study hybrid fuzzing on smart contracts and present ConFuzzius, the first hybrid fuzzer for smart contracts. ConFuzzius uses evolutionary fuzzing to exercise shallow parts of a smart contract and constraint solving to generate inputs that satisfy complex conditions that prevent evolutionary fuzzing from exploring deeper parts. Moreover, ConFuzzius leverages dynamic data dependency analysis to efficiently generate sequences of transactions that are more likely to result in contract states in which bugs may be hidden. We evaluate the effectiveness of ConFuzzius by comparing it with state-of-the-art symbolic execution tools and fuzzers for smart contracts. Our evaluation on a curated dataset of 128 contracts and a dataset of 21K real-world contracts shows that our hybrid approach detects more bugs than state-of-the-art tools (up to 23%) and that it outperforms existing tools in terms of code coverage (up to 69%). We also demonstrate that data dependency analysis can boost bug detection up to 18%. [less ▲]

Detailed reference viewed: 83 (9 UL)
Full Text
Peer Reviewed
See detailTo Buffer or Not To Buffer: IEEE 802.11p/bd Performance Under Different Buffering Strategies
Baiocchi, Andrea; Turcanu, Ion UL; Vinel, Alexey

in 33 Edition of International Teletraffic Congress (ITC), Avignon, France, August 31st - September 3rd 2021 (2021, September)

A fundamental paradigm of the Internet of Things (IoT) consists of agents that communicate updates to each other to perform joint actions, e.g., cooperative awareness in transportation systems, swarms of ... [more ▼]

A fundamental paradigm of the Internet of Things (IoT) consists of agents that communicate updates to each other to perform joint actions, e.g., cooperative awareness in transportation systems, swarms of Unmanned Aerial Vehicles (UAVs), fleet of robots, automated assembly lines and logistics. A common feature of update messaging is emphasis on reliable throughput and freshness of collected data. We develop an analytical model that yields accurate predictions of all relevant metrics, both in terms of moments and probability distributions, for the case of one-hop broadcast update messages exchanged by using a CSMA-based wireless network. The model is validated against simulations and then applied to compare two update message scheduling approaches: providing a minimal buffer resource or providing no buffer. Surprisingly, we prove that having no buffer improves Age of Information (AoI) performance as well as message delivery rate, in spite of dropped packets. This is essentially due to much smaller congestion and hence collision probability in the wireless channel. From a system point of view this suggests a simple design of message handling, with no need of buffering and overwriting older messages. From a modeling point of view, the result supports the definition of simpler models that need not keep into account buffer state. [less ▲]

Detailed reference viewed: 53 (1 UL)
Full Text
Peer Reviewed
See detailA Model-based Conceptualization of Requirements for Compliance Checking of Data Processing against GDPR
Amaral Cejas, Orlando UL; Abualhaija, Sallam UL; Sabetzadeh, Mehrdad UL et al

in 2020 IEEE Eleventh International Model-Driven Requirements Engineering (MoDRE) (2021, September)

The General Data Protection Regulation (GDPR) has been recently introduced to harmonize the different data privacy laws across Europe. Whether inside the EU or outside, organizations have to comply with ... [more ▼]

The General Data Protection Regulation (GDPR) has been recently introduced to harmonize the different data privacy laws across Europe. Whether inside the EU or outside, organizations have to comply with the GDPR as long as they handle personal data of EU residents. The organizations with whom personal data is shared are referred to as data controllers. When controllers subcontract certain services that involve processing personal data to service providers (also known as data processors), then a data processing agreement (DPA) has to be issued. This agreement regulates the relationship between the controllers and processors and also ensures the protection of individuals’ personal data. Compliance with the GDPR is challenging for organizations since it is large and relies on complex legal concepts. In this paper, we draw on model-driven engineering to build a machine-analyzable conceptual model that characterizes DPA-related requirements in the GDPR. Further, we create a set of criteria for checking the compliance of a given DPA against the GDPR and discuss how our work in this paper can be adapted to develop an automated compliance checking solution. [less ▲]

Detailed reference viewed: 47 (3 UL)
Full Text
Peer Reviewed
See detailQ-Learning-Based SCMA for Efficient Random Access in mMTC Networks With Short Packets
Tran, Duc Dung UL; Sharma, Shree Krishna; Chatzinotas, Symeon UL et al

in Proceedings of 2021 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2021) (2021, September)

In massive machine-type communications (mMTC) networks, the ever-growing number of MTC devices and the limited radio resources have caused a severe problem of random access channel (RACH) congestion. To ... [more ▼]

In massive machine-type communications (mMTC) networks, the ever-growing number of MTC devices and the limited radio resources have caused a severe problem of random access channel (RACH) congestion. To mitigate this issue, several potential multiple access (MA) mechanisms including sparse code MA (SCMA) have been proposed. Besides, the short-packet transmission feature of MTC devices requires the design of new transmission and congestion avoidance techniques as the existing techniques based on the assumption of infinite data-packet length may not be suitable for mMTC networks. Therefore, it is important to find novel solutions to address RACH congestion in mMTC networks while considering SCMA and short-packet communications (SPC). In this paper, we propose an SCMA-based random access (RA) method, in which Q-learning is utilized to dynamically allocate the SCMA codebooks and time-slot groups to MTC devices with the aim of minimizing the RACH congestion in SPC-based mMTC networks. To clarify the benefits of our proposed method, we compare its performance with those of the conventional RA methods with/without Q-learning in terms of RA efficiency and evaluate its convergence. Our simulation results show that the proposed method outperforms the existing methods in overloaded systems, i.e., the number of devices is higher than the number of available RA slots. Moreover, we illustrate the sum rate comparison between SPC and long-packet communications (LPC) when applying the proposed method to achieve more insights on SPC. [less ▲]

Detailed reference viewed: 60 (1 UL)
Full Text
Peer Reviewed
See detailGlobal Governance. A Short History of Debates Born with the Telegraph and Popularized by the Internet
Musiani, Francesca; Schafer, Valerie UL

in Musiani, Francesca; Schafer, Valerie (Eds.) Global Governance. A Short History of Debates Born with the Telegraph and Popularized by the Internet (2021, September)

Scholars have successfully attempted to historicize global governance, comparing the Internet to telephone and broadcasting, from a primarily legal standpoint. Among these scholars, historians have also ... [more ▼]

Scholars have successfully attempted to historicize global governance, comparing the Internet to telephone and broadcasting, from a primarily legal standpoint. Among these scholars, historians have also studied particular issues that are relevant to Internet governance, e.g. openness and net neutrality. History is relevant for the concept of global governance for at least two reasons: to historicize the concept in itself through the Internet/digital age (the evolution and enrichment of the notion in the past 30 years, with key turning points such as the creation of ICANN and WSIS) and to flesh out continuities through time with other “global media” or “global issues,” such as international standardization, multi-stakeholderism, and communication rights. This chapter addresses these issues at three levels: periodization of the key concept of “global governance” since the 90s; evolution of the state of the art/research on global (Internet) governance; analysis of global governance in the broader field of media and communication. [less ▲]

Detailed reference viewed: 57 (1 UL)
Full Text
Peer Reviewed
See detailAn efficient deep learning approach for ground point filtering in aerial laser scanning point clouds
Nurunnabi, Abdul Awal Md UL

in Nurunnabi, Abdul Awal Md; Teferle, Felix Norman; Li, Jonathan (Eds.) et al An efficient deep learning approach for ground point filtering in aerial laser scanning point clouds (2021, July 02)

Ground surface extraction is one of the classic tasks in airborne laser scanning (ALS) point cloud processing that is used for three-dimensional (3D) city modelling, infrastructure health monitoring, and ... [more ▼]

Ground surface extraction is one of the classic tasks in airborne laser scanning (ALS) point cloud processing that is used for three-dimensional (3D) city modelling, infrastructure health monitoring, and disaster management. Many methods have been developed over the last three decades. Recently, Deep Learning (DL) has become the most dominant technique for 3D point cloud classification. DL methods used for classification can be categorized into end-to-end and non end-to-end approaches. One of the main challenges of using supervised DL approaches is getting a sufficient amount of training data. The main advantage of using a supervised non end-to-end approach is that it requires less training data. This paper introduces a novel local feature-based non end-to-end DL algorithm that generates a binary classifier for ground point filtering. It studies feature relevance, and investigates three models that are different combinations of features. This method is free from the limitations of point clouds’ irregular data structure and varying data density, which is the biggest challenge for using the elegant convolutional neural network. The new algorithm does not require transforming data into regular 3D voxel grids or any rasterization. The performance of the new method has been demonstrated through two ALS datasets covering urban environments. The method successfully labels ground and non-ground points in the presence of steep slopes and height discontinuity in the terrain. Experiments in this paper show that the algorithm achieves around 97% in both F1-score and model accuracy for ground point labelling. [less ▲]

Detailed reference viewed: 52 (1 UL)
Full Text
Peer Reviewed
See detailLog-based Slicing for System-level Test Cases
Messaoudi, Salma UL; Shin, Donghwan UL; Panichella, Annibale et al

in Proceedings of ISSTA '21: 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (2021, July)

Regression testing is arguably one of the most important activities in software testing. However, its cost-effectiveness and usefulness can be largely impaired by complex system test cases that are poorly ... [more ▼]

Regression testing is arguably one of the most important activities in software testing. However, its cost-effectiveness and usefulness can be largely impaired by complex system test cases that are poorly designed (e.g., test cases containing multiple test scenarios combined into a single test case) and that require a large amount of time and resources to run. One way to mitigate this issue is decomposing such system test cases into smaller, separate test cases---each of them with only one test scenario and with its corresponding assertions---so that the execution time of the decomposed test cases is lower than the original test cases, while the test effectiveness of the original test cases is preserved. This decomposition can be achieved with program slicing techniques, since test cases are software programs too. However, existing static and dynamic slicing techniques exhibit limitations when (1) the test cases use external resources, (2) code instrumentation is not a viable option, and (3) test execution is expensive. In this paper, we propose a novel approach, called DS3 (Decomposing System teSt caSe), which automatically decomposes a complex system test case into separate test case slices. The idea is to use test case execution logs, obtained from past regression testing sessions, to identify "hidden" dependencies in the slices generated by static slicing. Since logs include run-time information about the system under test, we can use them to extract access and usage of global resources and refine the slices generated by static slicing. We evaluated DS3 in terms of slicing effectiveness and compared it with a vanilla static slicing tool. We also compared the slices obtained by DS3 with the corresponding original system test cases, in terms of test efficiency and effectiveness. The evaluation results on one proprietary system and one open-source system show that DS3 is able to accurately identify the dependencies related to the usage of global resources, which vanilla static slicing misses. Moreover, the generated test case slices are, on average, 3.56 times faster than original system test cases and they exhibit no significant loss in terms of fault detection effectiveness. [less ▲]

Detailed reference viewed: 280 (27 UL)
Full Text
Peer Reviewed
See detailStudent Response Systems in Remote Teaching
Botev, Jean UL; Grevisse, Christian UL; Rothkugel, Steffen UL

in Proceedings of the 23rd International Conference on Human-Computer Interaction (HCI International) (2021, July)

Detailed reference viewed: 70 (16 UL)
Full Text
Peer Reviewed
See detailRESIF 3.0: Toward a Flexible & Automated Management of User Software Environment on HPC facility
Varrette, Sébastien UL; Kieffer, Emmanuel UL; Pinel, Frederic UL et al

in ACM Practice and Experience in Advanced Research Computing (PEARC'21) (2021, July)

High Performance Computing (HPC) is increasingly identified as a strategic asset and enabler to accelerate the research and the business performed in all areas requiring intensive computing and large ... [more ▼]

High Performance Computing (HPC) is increasingly identified as a strategic asset and enabler to accelerate the research and the business performed in all areas requiring intensive computing and large-scale Big Data analytic capabilities. The efficient exploitation of heterogeneous computing resources featuring different processor architectures and generations, coupled with the eventual presence of GPU accelerators, remains a challenge. The University of Luxembourg operates since 2007 a large academic HPC facility which remains one of the reference implementation within the country and offers a cutting-edge research infrastructure to Luxembourg public research. The HPC support team invests a significant amount of time (i.e., several months of effort per year) in providing a software environment optimised for hundreds of users, but the complexity of HPC software was quickly outpacing the capabilities of classical software management tools. Since 2014, our scientific software stack is generated and deployed in an automated and consistent way through the RESIF framework, a wrapper on top of Easybuild and Lmod [5] meant to efficiently handle user software generation. A large code refactoring was performed in 2017 to better handle different software sets and roles across multiple clusters, all piloted through a dedicated control repository. With the advent in 2020 of a new supercomputer featuring a different CPU architecture, and to mitigate the identified limitations of the existing framework, we report in this state-of-practice article RESIF 3.0, the latest iteration of our scientific software management suit now relying on streamline Easybuild. It permitted to reduce by around 90% the number of custom configurations previously enforced by specific Slurm and MPI settings, while sustaining optimised builds coexisting for different dimensions of CPU and GPU architectures. The workflow for contributing back to the Easybuild community was also automated and a current work in progress aims at drastically decrease the building time of a complete software set generation. Overall, most design choices for our wrapper have been motivated by several years of experience in addressing in a flexible and convenient way the heterogeneous needs inherent to an academic environment aiming for research excellence. As the code base is available publicly, and as we wish to transparently report also the pitfalls and difficulties met, this tool may thus help other HPC centres to consolidate their own software management stack. [less ▲]

Detailed reference viewed: 276 (18 UL)
Full Text
Peer Reviewed
See detailAvoiding bias when inferring race using name-based approaches
Kozlowski, Diego UL; Murray, Dakota S.; Bell, Alexis et al

in 18th INTERNATIONAL CONFERENCE ON SCIENTOMETRICS & INFORMETRICS, 12–15 July 2021KU Leuven, Belgium (2021, July)

Racial disparity in academia is a widely acknowledged problem. The quantitative understanding of racial-based systemic inequalities is an important step towards a more equitable research system. However ... [more ▼]

Racial disparity in academia is a widely acknowledged problem. The quantitative understanding of racial-based systemic inequalities is an important step towards a more equitable research system. However, few large-scale analyses have been performed on this topic, mostly because of the lack of robust race-disambiguation algorithms. Identifying author information does not generally include the author’s race. Therefore, an algorithm needs to be employed, using known information about authors, i.e., their names, to infer their perceived race. Nevertheless, as any other algorithm, the process of racial inference can generate biases if it is not carefully considered. When the research is focused on the understanding of racial-based inequalities, such biases undermine the objectives of the investigation and may perpetuate inequities. The goal of this article is to assess the biases introduced by the different approaches used name-based racial inference. We use information from US census and mortgage applications to infer the race of US author names in the Web of Science. We estimate the effects of using given and family names, thresholds or continuous distributions, and imputation. Our results demonstrate that the validity of name-based inference varies by race and ethnicity and that threshold approaches underestimate Black authors and overestimate White authors. We conclude with recommendations to avoid potential biases. This article fills an important research gap that will allow more systematic and unbiased studies on racial disparity in science. [less ▲]

Detailed reference viewed: 44 (3 UL)
Full Text
Peer Reviewed
See detailAutomatic Test Suite Generation for Key-Points Detection DNNs using Many-Objective Search (Experience Paper)
Ul Haq, Fitash UL; Shin, Donghwan UL; Briand, Lionel UL et al

in 2021 ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) (2021, July)

Automatically detecting the positions of key-points (e.g., facial key-points or finger key-points) in an image is an essential problem in many applications, such as driver's gaze detection and drowsiness ... [more ▼]

Automatically detecting the positions of key-points (e.g., facial key-points or finger key-points) in an image is an essential problem in many applications, such as driver's gaze detection and drowsiness detection in automated driving systems. With the recent advances of Deep Neural Networks (DNNs), Key-Points detection DNNs (KP-DNNs) have been increasingly employed for that purpose. Nevertheless, KP-DNN testing and validation have remained a challenging problem because KP-DNNs predict many independent key-points at the same time---where each individual key-point may be critical in the targeted application---and images can vary a great deal according to many factors. In this paper, we present an approach to automatically generate test data for KP-DNNs using many-objective search. In our experiments, focused on facial key-points detection DNNs developed for an industrial automotive application, we show that our approach can generate test suites to severely mispredict, on average, more than 93% of all key-points. In comparison, random search-based test data generation can only severely mispredict 41% of them. Many of these mispredictions, however, are not avoidable and should not therefore be considered failures. We also empirically compare state-of-the-art, many-objective search algorithms and their variants, tailored for test suite generation. Furthermore, we investigate and demonstrate how to learn specific conditions, based on image characteristics (e.g., head posture and skin color), that lead to severe mispredictions. Such conditions serve as a basis for risk analysis or DNN retraining. [less ▲]

Detailed reference viewed: 61 (16 UL)
Full Text
Peer Reviewed
See detailComparing MultiLingual and Multiple MonoLingual Models for Intent Classification and Slot Filling
Lothritz, Cedric UL; Allix, Kevin UL; Lebichot, Bertrand UL et al

in 26th International Conference on Applications of Natural Language to Information Systems (2021, June 25)

With the momentum of conversational AI for enhancing client-to-business interactions, chatbots are sought in various domains, including FinTech where they can automatically handle requests for opening ... [more ▼]

With the momentum of conversational AI for enhancing client-to-business interactions, chatbots are sought in various domains, including FinTech where they can automatically handle requests for opening/closing bank accounts or issuing/terminating credit cards. Since they are expected to replace emails and phone calls, chatbots must be capable to deal with diversities of client populations. In this work, we focus on the variety of languages, in particular in multilingual countries. Specifically, we investigate the strategies for training deep learning models of chatbots with multilingual data. We perform experiments for the specific tasks of Intent Classification and Slot Filling in financial domain chatbots and assess the performance of mBERT multilingual model vs multiple monolingual models. [less ▲]

Detailed reference viewed: 58 (8 UL)
Full Text
Peer Reviewed
See detailMassive MIMO under Double Scattering Channels: Power Minimization and Congestion Controls
Trinh, van Chien UL; Ngo, Quoc Hien; Chatzinotas, Symeon UL et al

in Massive MIMO under Double Scattering Channels: Power Minimization and Congestion Controls (2021, June 14)

This paper considers a massive MIMO system under the double scattering channels. We derive a closed-form expression of the uplink ergodic spectral efficiency (SE) by exploiting the maximum-ratio combining ... [more ▼]

This paper considers a massive MIMO system under the double scattering channels. We derive a closed-form expression of the uplink ergodic spectral efficiency (SE) by exploiting the maximum-ratio combining technique with imperfect channel state information. We then formulate and solve a total uplink data power optimization problem that aims at simultaneously satisfying the required SEs from all the users with limited power resources. We further propose algorithms to cope with the congestion issue appearing when at least one user is served by lower SE than requested. Numerical results illustrate the effectiveness of our proposed power optimization. More importantly, our proposed congestion-handling algorithms can guarantee the required SEs to many users under congestion, even when the SE requirement is high. [less ▲]

Detailed reference viewed: 42 (4 UL)
Full Text
Peer Reviewed
See detailtrajeR - une nouvelle librairie R pour les modèles de mélanges pour données longitudinales.
Noel, Cédric UL; Schiltz, Jang UL

in CNRIUT' 2021 - Recueil des Publications (2021, June)

Detailed reference viewed: 61 (0 UL)
Full Text
Peer Reviewed
See detailProtection of Personal Data in High Performance Computing Platform for Scientific Research Purposes
Paseri, Ludovica; Varrette, Sébastien UL; Bouvry, Pascal UL

in Proc. of the EU Annual Privacy Forum (APF) 2021 (2021, June)

The Open Science projects are also aimed at strongly encouraging the use of Cloud technologies and High Performance Computing (HPC), for the benefit of European researchers and universities. The emerging ... [more ▼]

The Open Science projects are also aimed at strongly encouraging the use of Cloud technologies and High Performance Computing (HPC), for the benefit of European researchers and universities. The emerging paradigm of Open Science enables an easier access to expert knowledge and material; however, it also raises some challenges regarding the protection of personal data, considering that part of the research data are personal data thus subjected to the EU’s General Data Protection Regulation (GDPR). This paper investigates the concept of scientific research in the field of data protection, with regard both to the European (GDPR) and national (Luxembourg Data Protection Law) legal framework for the compliance of the HPC technology. Therefore, it focuses on a case study, the HPC platform of the University of Luxembourg (ULHPC), to pinpoint the major data protection issues arising from the processing activities through HPC from the perspective of the HPC platform operators. Our study illustrates where the most problematic aspects of compliance lie. In this regard, possible solutions are also suggested, which mainly revolve around (1) standardisation of procedures; (2) cooperation at institutional level; (3) identification of guidelines for common challenges. This research is aimed to support legal researchers in the field of data protection, in order to help deepen the understanding of HPC technology’s challenges and universities and research centres holding an HPC platform for research purposes, which have to address the same issues. [less ▲]

Detailed reference viewed: 90 (6 UL)
Full Text
Peer Reviewed
See detailElection Verifiability Revisited: Automated Security Proofs and Attacks on Helios and Belenios
Baloglu, Sevdenur UL; Bursuc, Sergiu UL; Mauw, Sjouke UL et al

in IEEE 34th Computer Security Foundations Symposium, Dubrovnik 21-25 June 2021 (2021, June)

Election verifiability aims to ensure that the outcome produced by electronic voting systems correctly reflects the intentions of eligible voters, even in the presence of an adversary that may corrupt ... [more ▼]

Election verifiability aims to ensure that the outcome produced by electronic voting systems correctly reflects the intentions of eligible voters, even in the presence of an adversary that may corrupt various parts of the voting infrastructure. Protecting such systems from manipulation is challenging because of their distributed nature involving voters, election authorities, voting servers and voting platforms. An adversary corrupting any of these can make changes that, individually, would go unnoticed, yet in the end will affect the outcome of the election. It is, therefore, important to rigorously evaluate whether the measures prescribed by election verifiability achieve their goals. We propose a formal framework that allows such an evaluation in a systematic and automated way. We demonstrate its application to the verification of various scenarios in Helios and Belenios, two prominent internet voting systems, for which we capture features and corruption models previously outside the scope of formal verification. Relying on the Tamarin protocol prover for automation, we derive new security proofs and attacks on deployed versions of these protocols, illustrating trade-offs between usability and security. [less ▲]

Detailed reference viewed: 149 (11 UL)
Full Text
Peer Reviewed
See detailAn Age-Of-Information Perspective on Decentralized Congestion Control in Vehicular Networks
Turcanu, Ion UL; Baiocchi, Andrea; Lyamin, Nikita et al

in 19th Mediterranean Communication and Computer Networking Conference, Online Conference, 15-17 June 2021 (2021, June)

Vehicular networking enables a wide range of emerging Cooperative Intelligent Transportation System (C-ITS) applications, from safety to traffic efficiency and infotainment. Many of these applications ... [more ▼]

Vehicular networking enables a wide range of emerging Cooperative Intelligent Transportation System (C-ITS) applications, from safety to traffic efficiency and infotainment. Many of these applications depend on the reliability and timeliness of status information periodically exchanged among vehicles on the same wireless communication channel. A major effort has been spent, especially by standardization bodies, to define congestion control algorithms for the vehicular networking environment. The picture is, however, more complex than simply controlling the load level on the channel, given the non-trivial interplay of delivery reliability, system throughput, and timeliness of updates. In this paper, we provide a comprehensive performance evaluation of the main state-of- the-art broadcast rate control algorithms from the point of view of channel load, utilization efficiency, and information freshness. We evaluate these algorithms in a realistic simulation environment and describe a centralized approach to define a bound on the performance. We show that controlling the congestion based on either channel load or information freshness only leads to sub-optimal performance. [less ▲]

Detailed reference viewed: 125 (9 UL)
Full Text
Peer Reviewed
See detailIntelligent Misbehavior Detection System for Detecting False Position Attacks in Vehicular Networks
Hawlader, Faisal UL; Boualouache, Abdelwahab UL; Faye, Sébastien UL et al

in Hawlader, Faisal; Boualouache, Abdelwahab; Faye, Sébastien (Eds.) et al The 2021 IEEE International Conference on Communications (the 4th Workshop on 5G and Beyond Wireless Security) (2021, June)

Position falsification attacks are one of the most dangerous internal attacks in vehicular networks. Several Machine Learning-based Misbehavior Detection Systems (ML-based MDSs) have recently been proposed ... [more ▼]

Position falsification attacks are one of the most dangerous internal attacks in vehicular networks. Several Machine Learning-based Misbehavior Detection Systems (ML-based MDSs) have recently been proposed to detect these attacks and mitigate their impact. However, existing ML-based MDSs require numerous features, which increases the computational time needed to detect attacks. In this context, this paper introduces a novel ML-based MDS for the early detection of position falsification attacks. Based only on received positions, our system provides real-time and accurate predictions. Our system is intensively trained and tested using a publicly available data set, while its validation is done by simulation. Six conventional classification algorithms are applied to estimate and construct the best model based on supervised learning. The results show that the proposed system can detect position falsification attacks with almost 100% accuracy. [less ▲]

Detailed reference viewed: 185 (57 UL)
Full Text
Peer Reviewed
See detailDigital Twins Are Not Monozygotic -- Cross-Replicating ADAS Testing in Two Industry-Grade Automotive Simulators
Borg, Markus; Ben Abdessalem (helali), Raja UL; Nejati, Shiva UL et al

in 2021 IEEE 14th International Conference on Software Testing, Validation and Verification (ICST) (2021, May 25)

The increasing levels of software- and data-intensive driving automation call for an evolution of automotive software testing. As a recommended practice of the Verification and Validation (V&V) process of ... [more ▼]

The increasing levels of software- and data-intensive driving automation call for an evolution of automotive software testing. As a recommended practice of the Verification and Validation (V&V) process of ISO/PAS 21448, a candidate standard for safety of the intended functionality for road vehicles, simulation-based testing has the potential to reduce both risks and costs. There is a growing body of research on devising test automation techniques using simulators for Advanced Driver-Assistance Systems (ADAS). However, how similar are the results if the same test scenarios are executed in different simulators? We conduct a replication study of applying a Search-Based Software Testing (SBST) solution to a real-world ADAS (PeVi, a pedestrian vision detection system) using two different commercial simulators, namely, TASS/Siemens PreScan and ESI Pro-SiVIC. Based on a minimalistic scene, we compare critical test scenarios generated using our SBST solution in these two simulators. We show that SBST can be used to effectively and efficiently generate critical test scenarios in both simulators, and the test results obtained from the two simulators can reveal several weaknesses of the ADAS under test. However, executing the same test scenarios in the two simulators leads to notable differences in the details of the test outputs, in particular, related to (1) safety violations revealed by tests, and (2) dynamics of cars and pedestrians. Based on our findings, we recommend future V&V plans to include multiple simulators to support robust simulation-based testing and to base test objectives on measures that are less dependant on the internals of the simulators. [less ▲]

Detailed reference viewed: 70 (7 UL)
Full Text
Peer Reviewed
See detailHSM-based Key Management Solution for Ethereum Blockchain
Shbair, Wazen UL; Gavrilov, Eugene; State, Radu UL

in IEEE International Conference on Blockchain and Cryptocurrency, 3-6 May 2021 (2021, May 03)

The security of distributed applications backed by blockchain technology relies mainly on keeping the associated cryptographic keys (i.e. private keys) in well-protected storage. Since they are the unique ... [more ▼]

The security of distributed applications backed by blockchain technology relies mainly on keeping the associated cryptographic keys (i.e. private keys) in well-protected storage. Since they are the unique proof of ownership of the underlying digital assets. If the keys are stolen or lost, there is no way to recover the assets. The cold wallet is a good candidate for basic use cases, but it has a substantial challenge for more complex applications as it does not scale. Warm and hot wallets are more convenient options for blockchain-based solutions that aim to transact in a cloud environment. In this work, we focus on Hardware Security Module (HSM) based wallet. The HSM is the de-facto standard device designed to manage high-value cryptographic keys and to protect them against hacks. In this demonstration, we present an HSM-based working prototype that secures the entire life cycle of Ethereum public and private keys. [less ▲]

Detailed reference viewed: 115 (4 UL)
Full Text
Peer Reviewed
See detailA Replication Study on the Usability of Code Vocabulary in Predicting Flaky Tests
Haben, Guillaume UL; Habchi, Sarra UL; Papadakis, Mike UL et al

in 18th International Conference on Mining Software Repositories (2021, May)

Abstract—Industrial reports indicate that flaky tests are one of the primary concerns of software testing mainly due to the false signals they provide. To deal with this issue, researchers have developed ... [more ▼]

Abstract—Industrial reports indicate that flaky tests are one of the primary concerns of software testing mainly due to the false signals they provide. To deal with this issue, researchers have developed tools and techniques aiming at (automatically) identifying flaky tests with encouraging results. However, to reach industrial adoption and practice, these techniques need to be replicated and evaluated extensively on multiple datasets, occasions and settings. In view of this, we perform a replication study of a recently proposed method that predicts flaky tests based on their vocabulary. We thus replicate the original study on three different dimensions. First we replicate the approach on the same subjects as in the original study but using a different evaluation methodology, i.e., we adopt a time-sensitive selection of training and test sets to better reflect the envisioned use case. Second, we consolidate the findings of the initial study by building a new dataset of 837 flaky tests from 9 projects in a different programming language, i.e., Python while the original study was in Java, which comforts the generalisability of the results. Third, we propose an extension to the original approach by experimenting with different features extracted from the Code Under Test. Our results demonstrate that a more robust validation has a consistent negative impact on the reported results of the original study, but, fortunately, these do not invalidate the key conclusions of the study. We also find re-assuring results that the vocabulary-based models can also be used to predict test flakiness in Python and that the information lying in the Code Under Test has a limited impact in the performance of the vocabulary-based models [less ▲]

Detailed reference viewed: 168 (19 UL)
Full Text
Peer Reviewed
See detailUsing Domain-specific Corpora for Improved Handling of Ambiguity in Requirements
Ezzini, Saad UL; Abualhaija, Sallam UL; Arora, Chetan et al

in In Proceedings of the 43rd International Conference on Software Engineering (ICSE'21), Madrid 25-28 May 2021 (2021, May)

Ambiguity in natural-language requirements is a pervasive issue that has been studied by the requirements engineering community for more than two decades. A fully manual approach for addressing ambiguity ... [more ▼]

Ambiguity in natural-language requirements is a pervasive issue that has been studied by the requirements engineering community for more than two decades. A fully manual approach for addressing ambiguity in requirements is tedious and time-consuming, and may further overlook unacknowledged ambiguity – the situation where different stakeholders perceive a requirement as unambiguous but, in reality, interpret the requirement differently. In this paper, we propose an automated approach that uses natural language processing for handling ambiguity in requirements. Our approach is based on the automatic generation of a domain-specific corpus from Wikipedia. Integrating domain knowledge, as we show in our evaluation, leads to a significant positive improvement in the accuracy of ambiguity detection and interpretation. We scope our work to coordination ambiguity (CA) and prepositional-phrase attachment ambiguity (PAA) because of the prevalence of these types of ambiguity in natural-language requirements [1]. We evaluate our approach on 20 industrial requirements documents. These documents collectively contain more than 5000 requirements from seven distinct application domains. Over this dataset, our approach detects CA and PAA with an average precision of 80% and an average recall of 89% ( 90% for cases of unacknowledged ambiguity). The automatic interpretations that our approach yields have an average accuracy of 85%. Compared to baselines that use generic corpora, our approach, which uses domain-specific corpora, has 33% better accuracy in ambiguity detection and 16% better accuracy in interpretation. [less ▲]

Detailed reference viewed: 119 (11 UL)
Full Text
Peer Reviewed
See detailThEodorE: a Trace Checker for CPS Properties
Menghi, Claudio UL; Vigano, Enrico UL; Bianculli, Domenico UL et al

in Companion Proceedings of the 43rd International Conference on Software Engineering (2021, May)

ThEodorE is a trace checker for Cyber-Physical systems (CPS). It provides users with (i) a GUI editor for writing CPS requirements; (ii) an automatic procedure to check whether the requirements hold on ... [more ▼]

ThEodorE is a trace checker for Cyber-Physical systems (CPS). It provides users with (i) a GUI editor for writing CPS requirements; (ii) an automatic procedure to check whether the requirements hold on execution traces of a CPS. ThEodorE enables writing requirements using the Hybrid Logic of Signals (HLS), a novel, logic-based specification language to express CPS requirements. The trace checking procedure of ThEodorE reduces the problem of checking if a requirement holds on an execution trace to a satisfiability problem, which can be solved using off-the-shelf Satisfiability Modulo Theories (SMT) solvers. This artifact paper presents the tool support provided by ThEodorE. [less ▲]

Detailed reference viewed: 70 (4 UL)
Full Text
Peer Reviewed
See detailRAICC: Revealing Atypical Inter-Component Communication in Android Apps
Samhi, Jordan UL; Bartel, Alexandre UL; Bissyande, Tegawendé François D Assise UL et al

in Samhi, Jordan; Bartel, Alexandre; Bissyande, Tegawendé François D Assise (Eds.) et al 43rd International Conference on Software Engineering (ICSE) (2021, May)

Inter-Component Communication (ICC) is a key mechanism in Android. It enables developers to compose rich functionalities and explore reuse within and across apps. Unfortunately, as reported by a large ... [more ▼]

Inter-Component Communication (ICC) is a key mechanism in Android. It enables developers to compose rich functionalities and explore reuse within and across apps. Unfortunately, as reported by a large body of literature, ICC is rather "complex and largely unconstrained", leaving room to a lack of precision in apps modeling. To address the challenge of tracking ICCs within apps, state of the art static approaches such as Epicc, IccTA and Amandroid have focused on the documented framework ICC methods (e.g., startActivity) to build their approaches. In this work we show that ICC models inferred in these state of the art tools may actually be incomplete: the framework provides other atypical ways of performing ICCs. To address this limitation in the state of the art, we propose RAICC a static approach for modeling new ICC links and thus boosting previous analysis tasks such as ICC vulnerability detection, privacy leaks detection, malware detection, etc. We have evaluated RAICC on 20 benchmark apps, demonstrating that it improves the precision and recall of uncovered leaks in state of the art tools. We have also performed a large empirical investigation showing that Atypical ICC methods are largely used in Android apps, although not necessarily for data transfer. We also show that RAICC increases the number of ICC links found by 61.6% on a dataset of real-world malicious apps, and that RAICC enables the detection of new ICC vulnerabilities. [less ▲]

Detailed reference viewed: 85 (15 UL)
Full Text
Peer Reviewed
See detailTrace-Checking CPS Properties: Bridging the Cyber-Physical Gap
Menghi, Claudio UL; Vigano, Enrico UL; Bianculli, Domenico UL et al

in Proceedings of the 43rd International Conference on Software Engineering (ICSE 2021) (2021, May)

Cyber-physical systems combine software and physical components. Specification-driven trace-checking tools for CPS usually provide users with a specification language to express the requirements of ... [more ▼]

Cyber-physical systems combine software and physical components. Specification-driven trace-checking tools for CPS usually provide users with a specification language to express the requirements of interest, and an automatic procedure to check whether these requirements hold on the execution traces of a CPS. Although there exist several specification languages for CPS, they are often not sufficiently expressive to allow the specification of complex CPS properties related to the software and the physical components and their interactions. In this paper, we propose (i) the Hybrid Logic of Signals (HLS), a logic-based language that allows the specification of complex CPS requirements, and (ii) ThEodorE, an efficient SMT-based trace-checking procedure. This procedure reduces the problem of checking a CPS requirement over an execution trace, to checking the satisfiability of an SMT formula. We evaluated our contributions by using a representative industrial case study in the satellite domain. We assessed the expressiveness of HLS by considering 212 requirements of our case study. HLS could express all the 212 requirements. We also assessed the applicability of ThEodorE by running the trace-checking procedure for 747 trace-requirement combinations. ThEodorE was able to produce a verdict in 74.5% of the cases. Finally, we compared HLS and ThEodorE with other specification languages and trace-checking tools from the literature. Our results show that, from a practical standpoint, our approach offers a better trade-off between expressiveness and performance. [less ▲]

Detailed reference viewed: 299 (25 UL)
Full Text
Peer Reviewed
See detailAge of Information in IEEE 802.11p
Baiocchi, Andrea; Turcanu, Ion UL; Lyamin, Nikita et al

in 17th IFIP/IEEE International Symposium on Integrated Network Management (IM): ITAVT Workshop (2021, May)

Vehicle-to-Everything (V2X) communication is essential for facilitating connected and automated driving, where vehicles and other road traffic participants share data instantaneously and cooperate to ... [more ▼]

Vehicle-to-Everything (V2X) communication is essential for facilitating connected and automated driving, where vehicles and other road traffic participants share data instantaneously and cooperate to solve tricky traffic situations in milliseconds. This paper proposes two stochastic models for the V2X standard IEEE 802.11p to characterize amongst other things the Age of Information (AoI), a recently-proposed metric that measures the freshness of information. The first model is based on renewal process analysis of a tagged station with mean field approximation, while the second one adopts Markov chain approach with network level view. Analytical results show that IEEE 802.11p, given its adaptability to event-triggered and aperiodic messaging, supports advanced cooperative driving scenarios. [less ▲]

Detailed reference viewed: 149 (10 UL)
Full Text
Peer Reviewed
See detailA Comparison of Pre-Trained Language Models for Multi-Class Text Classification in the Financial Domain
Arslan, Yusuf UL; Allix, Kevin UL; Veiber, Lisa UL et al

in Companion Proceedings of the Web Conference 2021 (WWW '21 Companion), April 19--23, 2021, Ljubljana, Slovenia (2021, April 19)

Detailed reference viewed: 76 (14 UL)
Full Text
Peer Reviewed
See detailDesign model for dry-stacked and demountable masonry blocks
Chewe Ngapeya, Gelen Gael; Waldmann, Daniele UL

in POWERSKIN Conference Proceedings (2021, April 09)

The construction industry around the world produces a large part of inert wastes mainly coming from building demolitions. Facing to this envi-ronmental challenge and considering the new policy initiatives ... [more ▼]

The construction industry around the world produces a large part of inert wastes mainly coming from building demolitions. Facing to this envi-ronmental challenge and considering the new policy initiatives supporting the designing of sustainable buildings, dry-stacked masonry comes forward as a promising solution since components can be dismantled, saved in a component bank and reassembled on new sites. The speedy growth of the construction industry, the increasing importance given to the complete life cycle of buildings and the evolution of construction technics have led to the development of dry-stacked masonry structures. Mortarless masonry structures minimise skilled labour requirements and improve construction productivity. However, despite these advantages, there are no design standards providing guidelines to assess the load-bearing capacity of dry-stacked masonry block, which therefore limits its use in construction. In an attempt to fill this lack, the current paper investigates the load-bearing capacity of dry-stacked masonry and its influencing parameters. The effects of the geometric imperfections such as height imperfections and bed-joint roughness have been analysed as well as a mitigation strategy. Then, based on experimental evidence, a design method has been proposed for dry-stacked masonry solicited by axial compression. The developed design methodology provided promising results, with 93% of accuracy in the prediction of the dry-stacked masonry’s’ load-bearing capacity. [less ▲]

Detailed reference viewed: 71 (2 UL)
Full Text
Peer Reviewed
See detailEco-construction for sustainable development: Concept of a Material and Component Bank
JAYASINGHE, Laddu Bhagya; Waldmann, Daniele UL

in POWERSKIN Conference Proceedings (2021, April 09)

The European Commission has recently promulgated the concept of Circular Economy as a new pathway towards sustainability, in particular through new policy initiatives such as the Circular Economy Action ... [more ▼]

The European Commission has recently promulgated the concept of Circular Economy as a new pathway towards sustainability, in particular through new policy initiatives such as the Circular Economy Action Plan (CEAP). Since the environmental impact of the construction industry with the depletion of natural resources and the raising CO2 emissions will have to be reduced in the future, the need of recycling and even reusing entire building components supporting the principles of circular economy have been identified. The direct reuse of components extracted from old deconstructed buildings presents an energy-efficient and environmental-friendly solution. However, the reuse of components can be hindered by e.g. the lack of information on the availability of decommissioned structural components and uncertainties on the warranty of structural components. To handle this process an additional independent institution acting as Material and Component (M&C) Bank is needed. This entity assures activities such as e.g. the identification of reusable components in buildings which are proposed for selective dismantling; the condition assessment; the data management and the data transfer from a previously deconstructed building to a new building; and finally, an official certification of the components’ conformity for another service life in a new application. In the current paper, a concept for such a M&C bank is presented. This study investigates the potential of a M&C bank in the framework of circular economy concepts for the planning of sustainable and circular buildings with a reduced eco-footprint by focusing on the reuse of decommissioned structural components. The concept, main businesses and work operation of the bank are discussed. Furthermore, a digital representation of the bank as BIM-based M&C bank needed to publicize the availability of the reusable components to the market and to enable circular business models by showing their circular pathways are described. [less ▲]

Detailed reference viewed: 57 (2 UL)
Full Text
Peer Reviewed
See detailImprovements to Deep-Learning-based Feasibility Prediction of Switched Ethernet Network Configurations
Mai, Tieu Long UL; Navet, Nicolas UL

in The 29th International Conference on Real-Time Networks and Systems (RTNS2021) (2021, April 07)

Graph neural network (GNN) is an advanced machine learning model, which has been recently applied to encode Ethernet configurations as graphs and predict their feasibility in terms of meeting deadlines ... [more ▼]

Graph neural network (GNN) is an advanced machine learning model, which has been recently applied to encode Ethernet configurations as graphs and predict their feasibility in terms of meeting deadlines constraints. Ensembles of GNN models have proven to be robust to changes in the topology and traffic patterns with respect to the training set. However, the moderate prediction accuracy of the model, 79.3% at the lowest, hinders the application of GNN to real-world problems. This study proposes improvements to the base GNN model in the construction of the training set and the structure of the model itself. We first introduce new training sets that are more diverse in terms of topologies and traffic patterns and focus on configurations that are difficult to predict. We then enhance the GNN model with more powerful activation functions, multiple channels and implement a technique called global pooling. The prediction accuracy of the ensemble GNN model with a combination of the suggested improvements increases significantly, up to 11.9% on the same 13 testing sets. Importantly, these improvements increase only marginally the time it takes to predict unseen configurations, i.e., the speedup factor is still from 50 to 1125 compared to schedulability analysis, which allows a far more extensive exploration of the design space. [less ▲]

Detailed reference viewed: 169 (11 UL)
Full Text
Peer Reviewed
See detailThe Evolution of an Architectural Paradigm - Using Blockchain to Build a Cross-Organizational Enterprise Service Bus
Amend, Julia; Fridgen, Gilbert UL; Rieger, Alexander UL et al

in 54th Hawaii International Conference on System Sciences (HICSS), Maui, Hawaii (Virtual) (2021, April)

Cross-organizational collaboration and the exchange of process data are indispensable for many processes in federally organized governments. Conventional IT solutions, such as cross-organizational ... [more ▼]

Cross-organizational collaboration and the exchange of process data are indispensable for many processes in federally organized governments. Conventional IT solutions, such as cross-organizational workflow management systems, address these requirements through centralized process management and architectures. However, such centralization is difficult and often undesirable in federal contexts. One alternative solution that emphasizes decentralized process management and a decentralized architecture is the blockchain solution of Germany’s Federal Office for Migration and Refugees. Here, we investigate the architecture of this solution and examine how it addresses the requirements of federal contexts. We find that the solution’s architecture resembles an improvement and cross-organizational adaption of an old architectural paradigm, the enterprise service bus. [less ▲]

Detailed reference viewed: 99 (11 UL)
Full Text
Peer Reviewed
See detailUn nouvel outil d'évaluation de la créativité dans le milieu publicitaire
Gubenko, Alla UL; Houssemand, Claude UL

in Houssemand, Claude (Ed.) Recherches actuelles en psychologie différentielle (2021, April)

Detailed reference viewed: 35 (2 UL)
Full Text
Peer Reviewed
See detailBLER-based Adaptive Q-learning for Efficient Random Access in NOMA-based mMTC Networks
Tran, Duc Dung UL; Sharma, Shree Krishna UL; Chatzinotas, Symeon UL

in Proceedings of 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring) (2021, April)

The ever-increasing number of machine-type communications (MTC) devices and the limited available radio resources are leading to a crucial issue of radio access network (RAN) congestion in upcoming 5G and ... [more ▼]

The ever-increasing number of machine-type communications (MTC) devices and the limited available radio resources are leading to a crucial issue of radio access network (RAN) congestion in upcoming 5G and beyond wireless networks. Thus, it is crucial to investigate novel techniques to minimize RAN congestion in massive MTC (mMTC) networks while taking the underlying short-packet communications (SPC) into account. In this paper, we propose an adaptive Q-learning (AQL) algorithm based on block error rate (BLER), an important metric in SPC, for a non-orthogonal multiple access (NOMA) based mMTC system. The proposed method aims to efficiently accommodate MTC devices to the available random access (RA) slots in order to significantly reduce the possible collisions, and subsequently to enhance the system throughput. Furthermore, in order to obtain more practical insights on the system design, the scenario of imperfect successive interference cancellation (ISIC) is considered as compared to the widely-used perfect SIC assumption. The performance of the proposed AQL method is compared with the recent Q-learning solutions in the literature in terms of system throughput over a range of parameters such as the number of devices, blocklength, and residual interference caused by ISIC, along with its convergence evaluation. Our simulation results illustrate the superiority of the proposed method over the existing techniques, in the scenarios where the number of devices is higher than the number of available RA time-slots. [less ▲]

Detailed reference viewed: 86 (4 UL)
Full Text
Peer Reviewed
See detailRoboBus: A Diverse and Cross-Border Public Transport Dataset
Varisteas, Georgios; Frank, Raphaël UL; Robinet, François UL

in Proceedings of the 19th International Conference on Pervasive Computing and Communications (PerCom 2021) (2021, March 22)

Detailed reference viewed: 101 (17 UL)
Full Text
Peer Reviewed
See detailEl duende, quand une technique propre au flamenco s’impose sur la scène de théâtre : Partage de midi de Paul Claudel (mise en scène d’Yves Beaunesne)
Deregnoncourt, Marine UL

in Deregnoncourt, Marine; Rameau, Corinne (Eds.) Le flamenco dans tous ses états : de la scène à la page, du pas à l’image (2021, March 08)

Pour tenter de correspondre au mieux au propos de cette journée d’études intitulée : « Le flamenco dans tous ses états : de la scène à la page, du pas à l’image », nous nous proposons d’analyser comment ... [more ▼]

Pour tenter de correspondre au mieux au propos de cette journée d’études intitulée : « Le flamenco dans tous ses états : de la scène à la page, du pas à l’image », nous nous proposons d’analyser comment le duende, technique propre au flamenco, peut être envisagé comme une clé de lecture opérante pour aborder la mise en scène d’Yves Beaunesne de Partage de midi de Paul Claudel (Comédie – Française, 2007 et Théâtre Marigny, 2009) et plus précisément de la scène d’amour (Acte II, Scène 2). En effet, lors de cette scène, Marina Hands et Éric Ruf, interprètes respectifs d’Ysé et de Mesa (protagonistes phares du drame claudélien) se livrent à une danse contemporaine caractérisée par un tombé au sol et une relève et comparable à une lutte, un break1, une transe et « un véritable cri du corps entier »2. Comment cela se manifeste-t-il sur scène ? C’est précisément à cette problématique que notre communication entend se consacrer. Pour ce faire, notre réflexion se divisera en deux parties. La première sera davantage théorique et tentera de définir ce qu’est le duende. La seconde s’axera, quant à elle, sur le spectacle précité et concernera plus spécifiquement la danse contemporaine exécutée par ces deux acteurs. [less ▲]

Detailed reference viewed: 72 (4 UL)
Full Text
Peer Reviewed
See detailAn MDE Method for Improving Deep Learning Dataset Requirements Engineering using Alloy and UML
Ries, Benoit UL; Guelfi, Nicolas UL; Jahic, Benjamin UL

in Proceedings of the 9th International Conference on Model-Driven Engineering and Software Development (2021, February)

Since the emergence of deep learning (DL) a decade ago, only few software engineering development methods have been defined for systems based on this machine learning approach. Moreover, rare are the DL ... [more ▼]

Since the emergence of deep learning (DL) a decade ago, only few software engineering development methods have been defined for systems based on this machine learning approach. Moreover, rare are the DL approaches addressing specifically requirements engineering. In this paper, we define a model-driven engineering (MDE) method based on traditional requirements engineering to improve datasets requirements engineering. Our MDE method is composed of a process supported by tools to aid customers and analysts in eliciting, specifying and validating dataset structural requirements for DL-based systems. Our model driven engineering approach uses the UML semi-formal modeling language for the analysis of datasets structural requirements, and the Alloy formal language for the requirements model execution based on our informal translational semantics. The model executions results are then presented to the customer for improving the dataset validation activity. Our approach aims at validating DL-based dataset structural requirements by modeling and instantiating their datatypes. We illustrate our approach with a case study on the requirements engineering of the structure of a dataset for classification of five-segments digits images. [less ▲]

Detailed reference viewed: 142 (13 UL)
Full Text
Peer Reviewed
See detailEnergy-Efficient Hybrid Symbol-Level Precoding via Phase Shifter Selection in mmWave MU-MIMO Systems
Haqiqatnejad, Alireza UL; Kayhan, Farbod UL; Ottersten, Björn UL

in Energy-Efficient Hybrid Symbol-Level Precoding via Phase Shifter Selection in mmWave MU-MIMO Systems (2021, January 25)

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output wireless system. We consider a hybrid analog-digital ... [more ▼]

We address the symbol-level precoding design problem for the downlink of a multiuser millimeter wave (mmWave) multiple-input multiple-output wireless system. We consider a hybrid analog-digital architecture with phase shifter selection where a small-sized baseband precoder is followed by two successive networks of analog on-off switches and variable phase shifters according to a fully-connected structure. We jointly optimize the digital baseband precoder and the states of the switching network on a symbol-level basis, i.e., by exploiting both the channel state information (CSI) and the instantaneous data symbols, while the phase-shifting network is designed only based on the CSI. Our approach to this joint optimization is to minimize the Euclidean distance between the optimal fully-digital and the hybrid symbol-level precoders. It is shown via numerical results that using the proposed approach, up to 50 percent of the phase shifters can be switched off on average, allowing for reductions in the power consumption of the phase-shifting network. Adopting appropriate power consumption models for the analog precoder, our energy efficiency analysis further shows that this power reduction can substantially improve the energy efficiency of the hybrid precoding compared to the fully-digital and the state-of-the-art schemes. [less ▲]

Detailed reference viewed: 51 (8 UL)
Full Text
Peer Reviewed
See detailVirtual Verification of Cause-Effect Chains in Automotive Cyber-Physical Systems
Gonzalez de Oliveira, Ricardo UL; Raghupatruni, Indrasen; Hamman, Arne et al

in 21. Internationales Stuttgarter Symposium (2021, January 25)

The technical complexity of automotive Cyber-Physical Systems (CPS) traditionally demands high development and validation efforts. Due to the new technologies entering the automotive market, such as ... [more ▼]

The technical complexity of automotive Cyber-Physical Systems (CPS) traditionally demands high development and validation efforts. Due to the new technologies entering the automotive market, such as Highly Automated Driving (HAD) (>= SAE L3) and connected infotainment, the overall system complexity is currently increasing significantly, challenging traditional system development methods and requiring new approaches for validation and verification (V&V). In parallel, new Electric/Electronic (E/E) architecture patterns are emerging in the automotive industry, distributing the functionalities across several multi-core Electrical Control Units (ECU) connected via Ethernet-based in-vehicle networks. This distributed approach leads to complex inter- and intra-ECU timing relations challenging the concept of freedom from interference according to the ISO 26262, and adding another dimension of effects analysis during V&V. This work enhances a cyber-physical functional simulation tool to include timing effects in distributed cause-effect chains and multi-technology-communication networks (incl. Ethernet and CAN). The resulting simulation allows the system designer to evaluate the impact of timing properties on a given distributed vehicle function, enabling an early validation of the system, avoiding rework during later stages of the development process resulting from wrong design choices. [less ▲]

Detailed reference viewed: 58 (2 UL)
Full Text
Peer Reviewed
See detailDeep Learning-Aided 5G Channel Estimation
Le, Ha An; Trinh, van Chien UL; Nguyen, Tien Hoa et al

in Deep Learning-Aided 5G Channel Estimation (2021, January 06)

Deep learning has demonstrated the important roles in improving the system performance and reducing computational complexity for $5$G-and-beyond networks. In this paper, we propose a new channel ... [more ▼]

Deep learning has demonstrated the important roles in improving the system performance and reducing computational complexity for $5$G-and-beyond networks. In this paper, we propose a new channel estimation method with the assistance of deep learning in order to support the least-squares estimation, which is a low-cost method but having relatively high channel estimation errors. This goal is achieved by utilizing a MIMO (multiple-input multiple-output) system with a multi-path channel profile used for simulations in the 5G networks under the severity of Doppler effects. Numerical results demonstrate the superiority of the proposed deep learning-assisted channel estimation method over the other channel estimation methods in previous works in terms of mean square errors. [less ▲]

Detailed reference viewed: 70 (4 UL)
Full Text
Peer Reviewed
See detailEulerian-Lagrangian momentum coupling between XDEM and OpenFOAM using preCICE
Besseron, Xavier UL; Rousset, Alban UL; Peyraut, Alice et al

in 14th WCCM & ECCOMAS Congress 2020 (2021, January)

Eulerian-Lagrangian couplings consider problems with a discrete phase as a particulate material that is in contact with a fluid phase. These applications are as diverse as engineering, additive ... [more ▼]

Eulerian-Lagrangian couplings consider problems with a discrete phase as a particulate material that is in contact with a fluid phase. These applications are as diverse as engineering, additive manufacturing, biomass conversion, thermal processing or pharmaceutical industry, among many others. A typical approach for this type of simulations is the coupling between Computation Fluid Dynamics (CFD) and Discrete Element Method (DEM), which is challenging in many ways. Such CFD--DEM couplings are usually implemented using an ad-hoc coupling layer, specific to the both DEM and CFD software, which considerably reduces the flexibility and applicability of the proposed implementation. In this work, we present the coupling of eXtended Discrete Element Method (XDEM), with the CFD library OpenFOAM, using the preCICE coupling library~\cite{preCICE} on volumetric meshes. Such momentum coupling requires the CFD side to account for the change of porosity due to the particulate phase and the particle momentum, while the particles of the DEM will be affected by the buoyancy and drag force of the fluid. While preCICE significantly simplifies the coupling between standalone libraries, each solver and, its respective adapter, have to be made aware of the new data involved in the physic model. For that, a new adapter has been implemented for XDEM and the existing adapter for OpenFOAM has been extended to include the additional data field exchange required for the momentum coupling, e.g porosity, particle momentum, fluid velocity and density. Our solution is tested and validated using simple benchmarks and advanced testcases such as a dam break, and shows consistent results. [less ▲]

Detailed reference viewed: 65 (2 UL)
Full Text
Peer Reviewed
See detailAutomated Deep Learning-based Segmentation of Brain, SEEG and DBS Electrodes on CT Images.
Vlasov, Vanja UL; Bofferding, Marie UL; Marx, Loic Marc UL et al

in Bildverarbeitung für die Medizin 2021 (2021)

Detailed reference viewed: 47 (2 UL)
Full Text
Peer Reviewed
See detailAdapting User Interfaces with Model-based Reinforcement Learning
Todi, Kashyap; Bailly, Gilles; Leiva, Luis A. UL et al

in Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems (CHI) (2021)

Detailed reference viewed: 24 (1 UL)
Full Text
Peer Reviewed
See detailMuDelta: Delta-Oriented Mutation Testing at Commit Time
Ma, Wei UL; Thierry Titcheu, Chekam; Papadakis, Mike UL et al

in International Conference on Software Engineering (ICSE) (2021)

Detailed reference viewed: 80 (5 UL)
Full Text
Peer Reviewed
See detailHow We Swipe: A Large-scale Shape-writing Dataset and Empirical Findings
Leiva, Luis A. UL; Kim, Sunjun; Cui, Wenzhe et al

in Proceedings of the ACM International Conference on Human-Computer Interaction with Mobile Devices and Services (MobileHCI) (2021)

Despite the prevalence of shape-writing (gesture typing, swype input, or swiping for short) as a text entry method, there are currently no public datasets available. We report a large-scale dataset that ... [more ▼]

Despite the prevalence of shape-writing (gesture typing, swype input, or swiping for short) as a text entry method, there are currently no public datasets available. We report a large-scale dataset that can support efforts in both empirical study of swiping as well as the development of better intelligent text entry techniques. The dataset was collected via a web-based custom virtual keyboard, involving 1,338 users who submitted 11,318 unique English words. We report aggregate-level indices on typing performance, user-related factors, as well as trajectory-level data, such as the gesture path drawn on top of the keyboard or the time lapsed between consecutively swiped keys. We find some well-known effects reported in previous studies, for example that speed and error are affected by age and language skill. We also find surprising relationships such that, on large screens, swipe trajectories are longer but people swipe faster. [less ▲]

Detailed reference viewed: 112 (0 UL)
Full Text
Peer Reviewed
See detailOn the Asymptotic Performance of One-Bit Co-Array-Based Music
Sedighi, Saeid UL; Mysore Rama Rao, Bhavani Shankar UL; Soltanalian, Mojtaba et al

in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2021)

Co-array-based Direction of Arrival (DoA) estimation using Sparse Linear Arrays (SLAs) has recently gained considerable attention in array processing thanks to its capability of providing enhanced degrees ... [more ▼]

Co-array-based Direction of Arrival (DoA) estimation using Sparse Linear Arrays (SLAs) has recently gained considerable attention in array processing thanks to its capability of providing enhanced degrees of freedom for DoAs that can be resolved. Additionally, deployment of one-bit Analog-to-Digital Converters (ADCs) has become an important topic in array processing, as it offers both a low-cost and a low-complexity implementation. Although the problem of DoA estimation form one-bit SLA measurements has been studied in some prior works, its analytical performance has not yet been investigated and characterized. In this paper, to provide valuable insights into the performance of DoA estimation from one-bit SLA measurements, we derive an asymptotic closed-form expression for the performance of One-Bit Co-Array-Based MUSIC (OBCAB-MUSIC). Further, numerical simulations are provided to validate the asymptotic closed-form expression for the performance of OBCAB-MUSIC and to show an interesting use case of it in evaluating the resolution of OBCAB-MUSIC. [less ▲]

Detailed reference viewed: 31 (1 UL)
Full Text
Peer Reviewed
See detailL’engagement cognitif et comportemental des élèves dans l’enseignement secondaire au Luxembourg
Milmeister, Paul UL; Kerger, Sylvie UL; Poncelet, Débora UL et al

in Houssemand, Claude (Ed.) Recherches actuelles en psychologie différentielle (2021)

Detailed reference viewed: 47 (3 UL)
Full Text
Peer Reviewed
See detailA Flexible Approach to Argumentation Framework Analysis using Theorem Proving
Fuenmayor Pelaez, David UL; Steen, Alexander UL

in First International Workshop on Logics for New-Generation Artificial Intelligence (2021)

Argumentation frameworks constitute the central concept of argumentation theory of Dung. In this paper we present a novel and flexible approach of analyzing argumen- tation frameworks and their semantics ... [more ▼]

Argumentation frameworks constitute the central concept of argumentation theory of Dung. In this paper we present a novel and flexible approach of analyzing argumen- tation frameworks and their semantics based on an encoding into extensional type theory (classical higher-order logic). This representation enables the use of a wide range of interactive and automated higher-order reasoning tools for assessing argu- mentation frameworks. This includes the generation of labellings (and extensions), the assessment of meta-theoretic properties, the conduction of interactive empirical experiments, and the flexible analysis of argumentation frameworks with interpreted arguments. [less ▲]

Detailed reference viewed: 74 (0 UL)
Full Text
Peer Reviewed
See detail"I Personally Relate It to the Traffic Light": A User Study on Security & Privacy Indicators in a Secure Email System Committed to Privacy by Default
Stojkovski, Borce UL; Lenzini, Gabriele UL; Koenig, Vincent UL

in Proceedings of the 36th Annual ACM Symposium on Applied Computing (2021)

Improving the usability and adoption of secure (i.e. end-to-end encrypted) email systems has been a notorious challenge for over two decades. One of the open questions concerns the amount and format of ... [more ▼]

Improving the usability and adoption of secure (i.e. end-to-end encrypted) email systems has been a notorious challenge for over two decades. One of the open questions concerns the amount and format of information that should be communicated to users to inform them of the security and privacy properties with respect to different messages or correspondents. Contributing to the ongoing discussion on the usability and effectiveness of security and privacy indicators, particularly in the context of systems targeting non-expert users, this paper sheds light on users' evaluation of traffic light-inspired indicators, as a metaphor to represent different privacy states and guarantees, provided by a new system for email end-to-end encryption called p≡p. Using a mixed-methods approach, based on input gathered from 150 participants in three online studies, we highlight the pros and cons of the traffic light semantic in p≡p's context and beyond, and discuss the potential implications on the perceived security and use of such systems. [less ▲]

Detailed reference viewed: 279 (9 UL)
Full Text
Peer Reviewed
See detailExamining Linguisic Biases with a Game Teoretic Analysis
Hoehn, Sviatlana UL; Mauw, Sjouke UL; Asher, Nicholas

in Proceedings of the 3rd Multidisciplinary International Symposium on Disinformation in Open Online Media (2021)

Detailed reference viewed: 130 (2 UL)
Full Text
See detailLa preuve de la loi étrangère par renvoi préjudiciel
Kinsch, Patrick UL

in La connaissance du droit étranger. A la recherche d’instruments de coopération adaptés (2021)

Detailed reference viewed: 26 (2 UL)
Full Text
Peer Reviewed
See detailTemporal Networks Based Industry Identification for Bitcoin Users
Han, Weili; Chen, Dingjie; Pang, Jun UL et al

in Proceedings of 16th International Conference on Wireless Algorithms, Systems, and Applications (WASA'21) (2021)

Detailed reference viewed: 21 (2 UL)
Full Text
Peer Reviewed
See detail"I am definitely manipulated, even when I am aware of it. It’s ridiculous!" - Dark Patterns from the End-User Perspective
Bongard-Blanchy, Kerstin UL; Rossi, Arianna UL; Rivas, Salvador UL et al

in Proceedings of ACM DIS Conference on Designing Interactive Systems (2021)

Online services pervasively employ manipulative designs (i.e., dark patterns) to influence users to purchase goods and subscriptions, spend more time on-site, or mindlessly accept the harvesting of their ... [more ▼]

Online services pervasively employ manipulative designs (i.e., dark patterns) to influence users to purchase goods and subscriptions, spend more time on-site, or mindlessly accept the harvesting of their personal data. To protect users from the lure of such designs, we asked: are users aware of the presence of dark patterns? If so, are they able to resist them? By surveying 406 individuals, we found that they are generally aware of the influence that manipulative designs can exert on their online behaviour. However, being aware does not equip users with the ability to oppose such influence. We further find that respondents, especially younger ones, often recognise the "darkness" of certain designs, but remain unsure of the actual harm they may suffer. Finally, we discuss a set of interventions (e.g., bright patterns, design frictions, training games, applications to expedite legal enforcement) in the light of our findings. [less ▲]

Detailed reference viewed: 128 (15 UL)
Full Text
Peer Reviewed
See detailThe DLPS: A New Framework for Benchmarking Blockchains
Sedlmeir, Johannes; Ross, Philipp; Luckow, André et al

in Proceedings of the 54th Hawaii International Conference on System Sciences (2021)

Distributed Ledger Technologies (DLT) promise to revolutionize business ecosystems by permitting secure transactions without intermediaries. A widely recognized challenge that inhibits the uptake of DLT ... [more ▼]

Distributed Ledger Technologies (DLT) promise to revolutionize business ecosystems by permitting secure transactions without intermediaries. A widely recognized challenge that inhibits the uptake of DLT is scalability and performance. Hence, quantifying key metrics such as throughput and latency is crucial for designing DLT-based infrastructures, applications, and ecosystems. However, current benchmarking frameworks for blockchains do not cover the whole benchmarking process; impeding transparent comparisons of different DLT networks. In this paper, we present the Distributed Ledger Performance Scan (DLPS), an open-source framework for end-to-end performance characterizations of blockchains, addressing the need to transparently and automatically evaluate the performance of highly customizable configurations. We describe our new framework and argue that it significantly improves existing DLT benchmarking solutions. To demonstrate the capabilities of the DLPS, we also summarize the main results obtained from a series of experiments that we have conducted with it, giving a first comprehensive comparison of essential scalability properties of several commonly used enterprise blockchains. [less ▲]

Detailed reference viewed: 91 (14 UL)
Full Text
Peer Reviewed
See detailKernel Regression on Graphs in Random Fourier Features Space
Elias, Vitor R. M.; Gogenini, Vinay C.; Alves Martins, Wallace UL et al

in IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-2021), Toronto 6-11 June 2021 (2021)

This work proposes an efficient batch-based implementation for kernel regression on graphs (KRG) using random Fourier features (RFF) and a low-complexity online implementation. Kernel regression has ... [more ▼]

This work proposes an efficient batch-based implementation for kernel regression on graphs (KRG) using random Fourier features (RFF) and a low-complexity online implementation. Kernel regression has proven to be an efficient learning tool in the graph signal processing framework. However, it suffers from poor scalability inherent to kernel methods. We employ RFF to overcome this issue and derive a batch-based KRG whose model size is independent of the training sample size. We then combine it with a stochastic gradient-descent approach to propose an online algorithm for KRG, namely the stochastic-gradient KRG (SGKRG). We also derive sufficient conditions for convergence in the mean sense of the online algorithms. We validate the performance of the proposed algorithms through numerical experiments using both synthesized and real data. Results show that the proposed batch-based implementation can match the performance of conventional KRG while having reduced complexity. Moreover, the online implementations effectively learn the target model and achieve competitive performance compared to the batch implementations. [less ▲]

Detailed reference viewed: 58 (3 UL)
Full Text
Peer Reviewed
See detailUser Scheduling for Precoded Satellite Systems With Individual Quality of Service Constraints
Trinh, van Chien UL; Lagunas, Eva UL; Tung, Ta Hai et al

in Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Virtual Conference, Sept. 2021 (2021)

Detailed reference viewed: 76 (4 UL)
Full Text
Peer Reviewed
See detailCentralized Gateway Concept for Precoded Multi-beam GEO Satellite Networks
Kisseleff, Steven UL; Lagunas, Eva UL; Krivochiza, Jevgenij et al

in VTC2021-Fall Workshop on Evolution of Non-Terrestrial Networks Toward 6G, Sept. 2021 (2021)

Detailed reference viewed: 37 (7 UL)
Full Text
Peer Reviewed
See detailUser Selection based on Inter-channel Interference for Massive MIMO under Line-of-sight Propagation
Chaves, Rafael S.; Cetin, Ediz; Lima, Markus V. S. et al

in URSI GASS 2021, Rome 28 August - 4 September 2021 (2021)

Massive multiple-input multiple-output (MIMO) is seen as a key enabler for next-generation wireless communication systems. Increased throughput afforded by massive MIMO, however, may severely degrade when ... [more ▼]

Massive multiple-input multiple-output (MIMO) is seen as a key enabler for next-generation wireless communication systems. Increased throughput afforded by massive MIMO, however, may severely degrade when the number of users served by a single base station increases, calling for user scheduling algorithms. To deal with this problem, a new user selection algorithm, called inter-channel interference-based selection (ICIBS), is proposed. ICIBS drops those users that induce the highest interference to the remaining users. Simulations show that selecting users with ICIBS significantly improves the throughput, outperforming state-of-the-art user selection algorithms. [less ▲]

Detailed reference viewed: 53 (7 UL)
Full Text
Peer Reviewed
See detailMy Mouse, My Rules: Privacy Issues of Behavioral User Profiling via Mouse Tracking
Leiva, Luis A. UL; Arapakis, Ioannis; Iordanou, Costas

in Proceedings of ACM SIGIR Conference on Human Information Interaction and Retrieval (CHIIR) (2021)

Detailed reference viewed: 86 (8 UL)
Full Text
Peer Reviewed
See detailGoal-Directed Decision Procedures for Input/Output Logics
Steen, Alexander UL

in Marra, Alessandra; Liu, Fenrong; Portner, Paul (Eds.) et al Deontic Logic and Normative Systems: 15th International Conference (DEON 2020/2021) (2021)

Input/Output (I/O) logics address the abstract study of conditional norms. Here, norms are represented as pairs of formulas instead of statements that themselves carry truth-values. I/O logics have been ... [more ▼]

Input/Output (I/O) logics address the abstract study of conditional norms. Here, norms are represented as pairs of formulas instead of statements that themselves carry truth-values. I/O logics have been studied thoroughly in the past, including further applications and refinements. In this paper, a class of automated reasoning procedures is presented that, given a set of norms and a concrete situation, decide whether a specific state of affairs is obligatory according to the output operations of I/O logics. The procedures are parametric in the underlying logical formalism and can be instantiated with different classical objects logics, such as propositional logic or first-order logic. The procedures are shown to be correct, and a proof-of-concept implementation for propositional I/O logics is surveyed. [less ▲]

Detailed reference viewed: 94 (6 UL)
Full Text
Peer Reviewed
See detailFindings of the VarDial Evaluation Campaign 2021
Chakravarthi, Bharathi Raja; Găman, Mihaela; Ionescu, Radu Tudor et al

in Proceedings of the Eighth Workshop on NLP for Similar Languages, Varieties and Dialects (2021)

Detailed reference viewed: 78 (1 UL)