Abstract
We present a model for measuring the impact of offloading soft real-time jobs over multi-tier cloud infrastructures. The jobs originate in mobile devices and offloading strategies may choose to execute them locally, in neighbouring devices, in cloudlets or in infrastructure cloud servers. Within this specification, we put forward several such offloading strategies characterised by their differential use of the cloud tiers with the goal of optimizing execution time and/or energy consumption. We implement an instance of the model using Jay, a software framework for adaptive computation offloading in hybrid edge clouds. The framework is modular and allows the model and the offloading strategies to be seamlessly implemented while providing the tools to make informed runtime offloading decisions based on system feedback, namely through a built-in system profiler that gathers runtime information such as workload, energy consumption and available bandwidth for every participating device or server. The results show that offloading strategies sensitive to runtime conditions can effectively and dynamically adjust their offloading decisions to produce significant gains in terms of their target optimization functions, namely, execution time, energy consumption and fulfilment of job deadlines.

Abstract
Deductive verification has gained paramount attention from both academia and industry. Although intensive research in this direction covers almost all mainstream languages, the research community has paid little attention to the verification of database applications. This paper proposes a comprehensive set of Verification Conditions (VCs) generation techniques from database programs, adapting Symbolic Execution, Conditional Normal Form, and Weakest Precondition. The validity checking of the generated VCs for a database program determines its correctness w.r.t. the annotated database properties. The developed prototype DBverify based on our theoretical foundation allows us to instantiate VC generation from PL/SQL codes, yielding to detailed performance analysis of the three approaches under different circumstances. With respect to the literature, the proposed approach shows its competence to support crucial SQL features (aggregate functions, nested queries, NULL values, and set operations) and the embedding of SQL codes within a host imperative language. For the chosen set of benchmark PL/SQL codes annotated with relevant properties of interest, our experiment shows that only 38% of procedures are correct, while 62% violate either all or part of the annotated properties. The primary cause for the latter case is mostly due to the acceptance of runtime inputs in SQL statements without proper checking.

Abstract
Modern communications have moved away from point-to-point models to increasingly heterogeneous network models. In this article, we propose a novel controller-based architecture to deploy adaptive causal network coding in heterogeneous and highly meshed communication networks. Specifically, we consider using the software-defined network as the main controller. We first present an architecture for highly meshed heterogeneous multi-source multi-destination networks that represent the practical communication networks encountered in the fifth generation of wireless networks and beyond. Next, we present a promising solution to deploy network coding over the new architecture. We also present a new controller-based setting with which network coding modules communicate to attain the required information. Finally, we briefly discuss how the proposed architecture and network coding solution provide a good opportunity for future technologies.

Abstract
Learning computer programming is a complex activity and requires a lot of practice. The viral pandemic that we are facing has intensified these difficulties. In this context, programming learning platforms play a crucial role. Most of them are characterized by providing a wide range of exercises with progressive complexity, multi-language support, sophisticated interfaces and automatic evaluation and gamification services. Nevertheless, despite the various features provided, others features, which influence user experience, are not emphasized, such as performance and usability. This article presents an user experience evaluation of the LearnJS playground, a JavaScript learning platform which aims to foster the practice of coding. The evaluation highlights two facets of the code playground: performance and a usability. In the former, lab and field data were collected based on Google Lighthouse and PageSpeed Insights reports. In the later, an inquiry was distributed among students from a Web Technologies course with a set of questions based on flexibility, usability and consistency heuristics. Both evaluation studies have a twofold goal: to improve the learning environment in order to be officially used in the next school year and to foster the awareness of user experience in all phases of the software development life-cycle as a key facet in Web applications engagement and loyalty. © Ricardo Queirós, Mário Pinto, and Teresa Terroso; licensed under Creative Commons License CC-BY 4.0 Second International Computer Programming Education Conference (ICPEC 2021).

Abstract
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from multiple domains. Counting subgraphs is, however, computationally very expensive, and there has been a large body of work on efficient algorithms and strategies to make subgraph counting feasible for larger subgraphs and networks. This survey aims precisely to provide a comprehensive overview of the existing methods for subgraph counting. Our main contribution is a general and structured review of existing algorithms, classifying them on a set of key characteristics, highlighting their main similarities and differences. We identify and describe the main conceptual approaches, giving insight on their advantages and limitations, and we provide pointers to existing implementations. We initially focus on exact sequential algorithms, but we also do a thorough survey on approximate methodologies (with a trade-off between accuracy and execution time) and parallel strategies (that need to deal with an unbalanced search space).

Abstract
The carsharing market has never been as competitive as it is now, and during the last years, we have been witnessing a boom in the number of carsharing organizations that appear, often accompanied by an also booming number of companies that disappear. Designing a viable carsharing system is challenging and often depends on local conditions as well as on a myriad of operational decisions that need to be supported by suitable decision support systems. Therefore, carsharing is being increasingly studied in the Operations Management (OM) literature. Nevertheless, often due to the limited transparency of this highly competitive sector and the recency of this business, there is still a "gap of understanding" of the scientific community concerning the business practices and contexts, often resulting in over-simplifications and relevant problems being overlooked. In this paper, we aim to close this "gap of understanding" by describing, conceptualizing, and analyzing the reality of 34 business to-consumer carsharing organizations. With the data collected, we propose a detailed description of the current business practices, such as the ones concerning pricing. From this, we highlight relevant "research insights" and structure all collected data organized by different OM topics, enabling knowledge to be further developed in this field.