Antonio Bucchiarone

Dongliang Chen, Antonio Bucchiarone, Zhihan Lv

The COVID-19 problem has not gone away with the passing of the seasons. Even though most countries have achieved remarkable results in fighting against epidemic diseases and preventing and controlling viruses, the general public is still far from understanding the new crown virus and lacks imagination on its transmission law. In this paper, we propose MeetDurian: a cross-platform mobile application that exploits a location-based game to improve users' hygiene habits and reduce virus dispersal. We present its main features, its architecture, and its core technologies. Finally, we report a set of experiments that prove the acceptability and usability of MeetDurian. An illustrative demo of the mobile app features is shown in the following video: https://youtu.be/Vqg7nFDQuOU.

Antonio Bucchiarone, Antonio Cicchetti, Nelly Bencomo et al.

Motivational digital systems offer capabilities to engage and motivate end-users to foster behavioral changes towards a common goal. In general these systems use gamification principles in non-games contexts. Over the years, gamification has gained consensus among researchers and practitioners as a tool to motivate people to perform activities with the ultimate goal of promoting behavioural change, or engaging the users to perform activities that can offer relevant benefits but which can be seen as unrewarding and even tedious. There exists a plethora of heterogeneous application scenarios towards reaching the common good that can benefit from gamification. However, an open problem is how to effectively combine multiple motivational campaigns to maximise the degree of participation without exposing the system to counterproductive behaviours. We conceive motivational digital systems as multi-agent systems: self-adaptation is a feature of the overall system, while individual agents may self-adapt in order to leverage other agents' resources, functionalities and capabilities to perform tasks more efficiently and effectively. Consequently, multiple campaigns can be run and adapted to reach common good. At the same time, agents are grouped into micro-communities in which agents contribute with their own social capital and leverage others' capabilities to balance their weaknesses. In this paper we propose our vision on how the principles at the base of the autonomous and multi-agent systems can be exploited to design multi-challenge motivational systems to engage smart communities towards common goals. We present an initial version of a general framework based on the MAPE-K loop and a set of research challenges that characterise our research roadmap for the implementation of our vision.

Siva Rama Krishnan Somayaji, Mamoun Alazab, Manoj MK et al.

As digitization increases, the need to automate various entities becomes crucial for development. The data generated by the IoT devices need to be processed accurately and in a secure manner. The basis for the success of such a scenario requires blockchain as a means of unalterable data storage to improve the overall security and trust in the system. By providing trust in an automated system, with real-time data updates to all stakeholders, an improved form of implementation takes the stage and can help reduce the stress of adaptability to complete automated systems. This research focuses on a use case with respect to the real time Internet of Things (IoT) network which is deployed at the beach of Chicago Park District. This real time data which is collected from various sensors is then used to design a predictive model using Deep Neural Networks for estimating the battery life of IoT sensors that is deployed at the beach. This proposed model could help the government to plan for placing orders of replaceable batteries before time so that there can be an uninterrupted service. Since this data is sensitive and requires to be secured, the predicted battery life value is stored in blockchain which would be a tamper-proof record of the data.

Philip Feldman, Antonio Bucchiarone

Modern natural language models such as the GPT-2/GPT-3 contain tremendous amounts of information about human belief in a consistently testable form. If these models could be shown to accurately reflect the underlying beliefs of the human beings that produced the data used to train these models, then such models become a powerful sociological tool in ways that are distinct from traditional methods, such as interviews and surveys. In this study, We train a version of the GPT-2 on a corpora of historical chess games, and then "launch" clusters of synthetic agents into the model, using text strings to create context and orientation. We compare the trajectories contained in the text generated by the agents/model and compare that to the known ground truth of the chess board, move legality, and historical patterns of play. We find that the percentages of moves by piece using the model are substantially similar from human patterns. We further find that the model creates an accurate latent representation of the chessboard, and that it is possible to plot trajectories of legal moves across the board using this knowledge.

Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo et al.

Heuristic forward search is currently the dominant paradigm in classical planning. Forward search algorithms typically rely on a single, relatively simple variation of best-first search and remain fixed throughout the process of solving a planning problem. Existing work combining multiple search techniques usually aims at supporting best-first search with an additional exploratory mechanism, triggered using a handcrafted criterion. A notable exception is very recent work which combines various search techniques using a trainable policy. It is, however, confined to a discrete action space comprising several fixed subroutines. In this paper, we introduce a parametrized search algorithm template which combines various search techniques within a single routine. The template's parameter space defines an infinite space of search algorithms, including, among others, BFS, local and random search. We further introduce a neural architecture for designating the values of the search parameters given the state of the search. This enables expressing neural search policies that change the values of the parameters as the search progresses. The policies can be learned automatically, with the objective of maximizing the planner's performance on a given distribution of planning problems. We consider a training setting based on a stochastic optimization algorithm known as the cross-entropy method (CEM). Experimental evaluation of our approach shows that it is capable of finding effective distribution-specific search policies, outperforming the relevant baselines.

Manuel Mazzara, Antonio Bucchiarone, Nicola Dragoni et al.

In this chapter we offer an overview of microservices providing the introductory information that a reader should know before continuing reading this book. We introduce the idea of microservices and we discuss some of the current research challenges and real-life software applications where the microservice paradigm play a key role. We have identified a set of areas where both researcher and developer can propose new ideas and technical solutions.

Evgeny Bobrov, Antonio Bucchiarone, Alfredo Capozucca et al.

DevOps processes comply with principles and offer practices with main objective to support efficiently the evolution of IT systems. To be efficient a DevOps process relies on a set of integrated tools. DevOps is the first required competency together with Agile Method required by the industry. DevOps processes are sharing many aspects with microservices approaches especially the modularity and flexibility which enables continuous change and delivery. As a new approach it is necessary to developp and offer to the academy and to the industry training programs to prepare our engineers in the best possible way. In this chapter we present the main aspects of the educational effort made in the recent years to educate to the concepts and values of the DevOps philosophy. This includes principles, practices, tools and architectures, primarily the Microservice architectural style. Two experiences have been made, one at academic level as a master program course and the other, as an industrial training. Based on those two experiences, we provide a comparative analysis and some proposals in order to develop and improve DevOps education for the future.

Evgeny Bobrov, Antonio Bucchiarone, Alfredo Capozucca et al.

This paper describes our experience of delivery educational programs in academia and in industry on DevOps, compare the two approaches and sum-up the lessons learnt. We also propose a vision to implement a shift in the Software Engineering Higher Education curricula.

Kizilov Mikhail, Antonio Bucchiarone, Manuel Mazzara et al.

This paper discusses a roadmap to investigate Domain Objects being an adequate formalism to capture the peculiarity of microservice architecture, and to support Software development since the early stages. It provides a survey of both Microservices and Domain Objects, and it discusses plans and reflections on how to investigate whether a modeling approach suited to adaptable service-based components can also be applied with success to the microservice scenario.

Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo et al.

Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its computational complexity resulting from exponentially large search spaces. Heuristic approaches are necessary to solve all but the simplest problems. In this work, we explore the possibility of obtaining domain-independent heuristic functions using machine learning. This is a part of a wider research program whose objective is to improve practical applicability of planning in systems for which the planning domains evolve at run time. The challenge is therefore the learning of (corrections of) domain-independent heuristics that can be reused across different planning domains.