2021
Autores
Lima, R; Ferreira, JF; Mendes, A;
Publicação
2021 36TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING WORKSHOPS (ASEW 2021)
Abstract
Vulnerability detection and repair is a demanding and expensive part of the software development process. As such, there has been an effort to develop new and better ways to automatically detect and repair vulnerabilities. DifFuzz is a state-of-the-art tool for automatic detection of timing side-channel vulnerabilities, a type of vulnerability that is particularly difficult to detect and correct. Despite recent progress made with tools such as DifFuzz, work on tools capable of automatically repairing timing side-channel vulnerabilities is scarce. In this paper, we propose DifFuzzAR, a new tool for automatic repair of timing side-channel vulnerabilities in Java code. The tool works in conjunction with DifFuzz and it is able to repair 56% of the vulnerabilities identified in DifFuzz's dataset. The results show that the tool can indeed automatically correct timing side-channel vulnerabilities, being more effective with those that are controlflow based.
2021
Autores
Narciso, D; Melo, M; Rodrigues, S; Cunha, JP; Vasconcelos Raposo, J; Bessa, M;
Publicação
MULTIMEDIA TOOLS AND APPLICATIONS
Abstract
The main goal of this systematic review is to synthesize existing evidence on the use of immersive virtual reality (IVR) to train professionals as well as to identify the main gaps and challenges that still remain and need to be addressed by future research. Following a comprehensive search, 66 documents were identified, assessed for relevance, and analysed. The main areas of application of IVR-based training were identified. Moreover, we identified the stimuli provided, the hardware used and information regarding training evaluation. The results showed that the areas in which a greater number of works were published were those related to healthcare and elementary occupations. In hardware, the most commonly used equipment was head mounted displays (HMDs), headphones included in the HMDs and handheld controllers. Moreover, the results indicated that IVR training systems are often evaluated manually, the most common metric being questionnaires applied before and after the experiment, and that IVR training systems have a positive effect in training professionals. We conclude that the literature is insufficient for determining the effect of IVR in the training of professionals. Although some works indicated promising results, there are still relevant themes that must be explored and limitations to overcome before virtual training replaces real-world training.
2021
Autores
Macedo, R; Correia, C; Dantas, M; Brito, C; Xu, WJ; Tanimura, Y; Haga, J; Paulo, J;
Publicação
2021 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING (CLUSTER 2021)
Abstract
Deep Learning (DL) training requires efficient access to large collections of data, leading DL frameworks to implement individual I/O optimizations to take full advantage of storage performance. However, these optimizations are intrinsic to each framework, limiting their applicability and portability across DL solutions, while making them inefficient for scenarios where multiple applications compete for shared storage resources. We argue that storage optimizations should be decoupled from DL frameworks and moved to a dedicated storage layer. To achieve this, we propose a new Software-Defined Storage architecture for accelerating DL training performance. The data plane implements self-contained, generally applicable I/O optimizations, while the control plane dynamically adapts them to cope with workload variations and multi-tenant environments. We validate the applicability and portability of our approach by developing and integrating an early prototype with the TensorFlow and PyTorch frameworks. Results show that our I/O optimizations significantly reduce DL training time by up to 54% and 63% for TensorFlow and PyTorch baseline configurations, while providing similar performance benefits to framework-intrinsic I/O mechanisms provided by TensorFlow.
2021
Autores
Faria, N; Pereira, J;
Publicação
PaPoC@EuroSys 2021, 8th Workshop on Principles and Practice of Consistency for Distributed Data, Online Event, United Kingdom, April 26, 2021
Abstract
Distributed data management systems have increasingly been using variants of Snapshot Isolation (SI) as their transactional isolation criteria as it combines strong ACID guarantees with non-blocking reads and scalability. However, most existing proposals are limited by the performance of update propagation and stability detection, in particular, when execution and storage are disaggregated. In this paper, we propose TOPSI, an approach providing a restricted form of Parallel Snapshot Isolation (PSI) that allows partially ordering recent transactions to avoid waiting for remote updates or using a stale snapshot. Moreover, it has the interesting property of making a prefix of history in all sites converge to a common total order. This allows versions to be represented by a single scalar timestamp for certification and storage in a shared store. We demonstrate the impact on throughput and abort rate with a proof-of-concept implementation and the industry-standard TPC-C benchmark. © 2021 ACM.
2021
Autores
Morais, R; Mendes, J; Silva, R; Silva, N; Sousa, JJ; Peres, E;
Publicação
AGRICULTURE-BASEL
Abstract
Spatial and temporal variability characterization in Precision Agriculture (PA) practices is often accomplished by proximity data gathering devices, which acquire data from a wide variety of sensors installed within the vicinity of crops. Proximity data acquisition usually depends on a hardware solution to which some sensors can be coupled, managed by a software that may (or may not) store, process and send acquired data to a back-end using some communication protocol. The sheer number of both proprietary and open hardware solutions, together with the diversity and characteristics of available sensors, is enough to deem the task of designing a data acquisition device complex. Factoring in the harsh operational context, the multiple DIY solutions presented by an active online community, available in-field power approaches and the different communication protocols, each proximity monitoring solution can be regarded as singular. Data acquisition devices should be increasingly flexible, not only by supporting a large number of heterogeneous sensors, but also by being able to resort to different communication protocols, depending on both the operational and functional contexts in which they are deployed. Furthermore, these small and unattended devices need to be sufficiently robust and cost-effective to allow greater in-field measurement granularity 365 days/year. This paper presents a low-cost, flexible and robust data acquisition device that can be deployed in different operational contexts, as it also supports three different communication technologies: IEEE 802.15.4/ZigBee, LoRa/LoRaWAN and GRPS. Software and hardware features, suitable for using heat pulse methods to measure sap flow, leaf wetness sensors and others are embedded. Its power consumption is of only 83 mu A during sleep mode and the cost of the basic unit was kept below the EUR 100 limit. In-field continuous evaluation over the past three years prove that the proposed solution-SPWAS'21-is not only reliable but also represents a robust and low-cost data acquisition device capable of gathering different parameters of interest in PA practices.
2021
Autores
Giddens, S; Gomes, MAC; Vilela, JP; Santos, JL; Harrison, WK;
Publicação
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021)
Abstract
Current methods for optimization of low-density parity-check (LDPC) codes analyze the degree distribution pair asymptotically as block length approaches infinity. This effectively ignores the discrete nature of the space of valid degree distribution pairs for LDPC codes of finite block length. While large codes are likely to conform reasonably well to the infinite block length analysis, shorter codes have no such guarantee. We present and analyze an algorithm for completely enumerating the space of all valid degree distribution pairs for a given block length, code rate, maximum variable node degree, and maximum check node degree. We then demonstrate this algorithm on an example LDPC code of finite block length. Finally, we discuss how the result of this algorithm can be utilized by discrete optimization routines to form novel methods for the optimization of small block length LDPC codes.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.