publications
Here’s a list of my publications in reversed chronological order. For a complete and updated list visit my Scholar or DBLP profile.
2024
- JASSSReliable and Efficient Agent-Based Modeling and SimulationAntelmi, Alessia, Caramante, Pasquale, Cordasco, Gennaro, D’Ambrosio, Giuseppe, De Vinco, Daniele, Foglia, Francesco, Postiglione, Luca, and Spagnuolo, Carmine2024
Agent-based models represent a primary methodology to untangle and study complex systems. Over the last decade, the need for more elaborate computing-demanding models gave rise to many frameworks and tools to run ABM simulations. Current state-of-the-art ABM tools either focus on ease of use, performance, or a trade-off between these two elements. Still, efficiency-oriented solutions (required for both large and small-scale simulations) are vulnerable to memory flaws which could invalidate the experiment results. This work aims to merge efficiency, reliability, and safeness under an innovative ABM software framework based on the Rust programming language. Our framework, krABMaga, is an open-source library that offers a high-level environment by exploiting metaprogramming and expandable visualization features. We equipped our library with a dynamic simulation monitoring system and model exploration and optimization capabilities over parallel, distributed, and cloud architectures. After having presented the overall architecture and functionalities of krABMaga, we discuss a performance comparison of our framework against the mostly adopted ABM software and the scalability potential of our simulation engine on a model calibration experiment running over an AWS EC2 virtual cluster machine. All code and examples models are available on GitHub.
- Deciphering Conversational Networks: Stance Detection via Hypergraphs and LLMsDe Vinco, Daniele, Antelmi, Alessia, Spagnuolo, Carmine, and Aiello, Luca Maria2024
Understanding the structural and linguistic properties of conversational data in social media is crucial for extracting meaningful insights to understand opinion dynamics, (mis-)information spreading, and the evolution of harmful behavior. Current state-of-the-art mathematical frameworks, such as hypergraphs and linguistic tools, such as large language models (LLMs), offer robust methodologies for modeling high-order group interactions and unprecedented capabilities for dealing with natural language-related tasks. In this study, we propose an innovative approach that blends these worlds by abstracting conversational networks via hypergraphs and analyzing their dynamics through LLMs. Our aim is to enhance the stance detection task by incorporating the high-order interactions naturally embedded within a conversation, thereby enriching the contextual understanding of LLMs regarding the intricate human dynamics underlying social media data.
- HypergraphRepository: A Community-Driven and Interactive Hypernetwork Data CollectionAntelmi, Alessia, De Vinco, Daniele, and Spagnuolo, Carmine2024
Hypergraph research has been thriving over the past few years, with a growing interest in a plethora of domains. Despite this remarkable surge, the lack of a comprehensive platform for searching and downloading diverse and well-curated datasets poses a significant obstacle to the continued advancement of the field. This absence hinders the ability of researchers and practitioners to validate and benchmark their hypergraph algorithms and models effectively.
2023
- The Age of Snippet Programming: Toward Understanding Developer Communities in Stack Overflow and RedditAntelmi, Alessia, Cordasco, Gennaro, De Vinco, Daniele, and Spagnuolo, CarmineIn ACM Web INPROCEEDINGS 2023 - Companion of the World Wide Web INPROCEEDINGS, WWW 2023 2023
Today, coding skills are among the most required competencies worldwide, often also for non-computer scientists. Because of this trend, community contribution-based, question-and-answer (Q&A) platforms became prominent for finding the proper solution to all programming issues. Stack Overflow has been the most popular platform for technical-related questions for years. Still, recently, some programming-related subreddits of Reddit have become a standing stone for questions and discussions. This work investigates the developers’ behavior and community formation around the twenty most popular programming languages. We examined two consecutive years of programming-related questions from Stack Overflow and Reddit, performing a longitudinal study on users’ posting activity and their high-order interaction patterns abstracted via hypergraphs. Our analysis highlighted crucial differences in how these Q&A platforms are utilized by their users. In line with previous literature, it emphasized the constant decline of Stack Overflow in favor of more community-friendly platforms, such as Reddit, which has been growing rapidly lately. © 2023 ACM.
- VRKG-CollaborativeExploration - Data-Driven Discussions in the MetaverseAccardo, Alberto, Monaco, Daniele, Pellegrino, Maria Angela, Scarano, Vittorio, and Spagnuolo, CarmineIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2023
The metaverse is an immersive, multi-user, virtual world where humans, represented by avatars, can entertain, socialize, and collaborate. This demo proposes VRKG-CollaborativeExploration, a Virtual Reality application that enables users to join thematic and collaborative data-driven discussions in the social metaverse where data are retrieved from Knowledge Graphs via SPARQL queries. © The Author(s), under exclusive license to Springer Nature Switzerland AG. 2023.
- Experimenting with Agent-Based Model Simulation ToolsAntelmi, Alessia, Cordasco, Gennaro, D’Ambrosio, Giuseppe, De Vinco, Daniele, and Spagnuolo, Carmine2023
Agent-based models (ABMs) are one of the most effective and successful methods for analyzing real-world complex systems by investigating how modeling interactions on the individual level (i.e., micro-level) leads to the understanding of emergent phenomena on the system level (i.e., macro-level). ABMs represent an interdisciplinary approach to examining complex systems, and the heterogeneous background of ABM users demands comprehensive, easy-to-use, and efficient environments to develop ABM simulations. Currently, many tools, frameworks, and libraries exist, each with its characteristics and objectives. This article aims to guide newcomers in the jungle of ABM tools toward choosing the right tool for their skills and needs. This work proposes a thorough overview of open-source general-purpose ABM tools and offers a comparison from a two-fold perspective. We first describe an off-the-shelf evaluation by considering each ABM tool’s features, ease of use, and efficiency according to its authors. Then, we provide a hands-on evaluation of some ABM tools by judging the effort required in developing and running four ABM models and the obtained performance. © 2022 by the authors.
- Sustainable, Secure, and Smart Collaboration (S3C)Pellegrino, Maria Angela, Cordasco, Gennaro, Scarano, Vittorio, and Spagnuolo, CarmineIn ACM International INPROCEEDINGS Proceeding Series 2023
We live in an increasingly interconnected world, where collaboration is the order of the day, stimulating the transition to a more sustainable society. This workshop focuses on sustainable and smart collaboration, which might also take place in virtual and remote settings. While the virtual environment represents a step forward in breaking down geographical and social barriers, they require to deal carefully with security concerns. In this context, the Sustainable, Secure, and Smart Collaboration (S3C) workshop is meant to connect researchers, industries, educators, and technologists related to Human-computer Interaction (HCI) blended with immersive systems, smart cities, and security awareness which can take advantage of the collaboration. It resulted in the presentation of 6 contributions proposed by researchers and companies all around Europe, exploiting collaboration to guarantee learners’ engagement, security awareness, and smart solution design. The contributions confirm the pervasive role of collaboration that has the potential to improve human interaction in the presence or remotely. © 2023 ACM.
- CURSA Survey on Hypergraph Representation LearningAntelmi, Alessia, Cordasco, Gennaro, Polato, Mirko, Scarano, Vittorio, Spagnuolo, Carmine, and Yang, DingqiACM Computing Surveys 2023
Hypergraphs have attracted increasing attention in recent years thanks to their flexibility in naturally modeling a broad range of systems where high-order relationships exist among their interacting parts. This survey reviews the newly born hypergraph representation learning problem, whose goal is to learn a function to project objects - most commonly nodes - of an input hyper-network into a latent space such that both the structural and relational properties of the network can be encoded and preserved. We provide a thorough overview of existing literature and offer a new taxonomy of hypergraph embedding methods by identifying three main families of techniques, i.e., spectral, proximity-preserving, and (deep) neural networks. For each family, we describe its characteristics and our insights in a single yet flexible framework and then discuss the peculiarities of individual methods, as well as their pros and cons. We then review the main tasks, datasets, and settings in which hypergraph embeddings are typically used. We finally identify and discuss open challenges that would inspire further research in this field. © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.
2022
- SWJMove cultural heritage knowledge graphs in everyone’s pocketPellegrino, Maria Angela, Scarano, Vittorio, and Spagnuolo, CarmineSemantic Web 2022
Last years witnessed a shift from the potential utility in digitisation to a crucial need to enjoy activities virtually. In fact, before 2019, data curators recognised the utility of performing data digitisation, while during the lockdown caused by the COVID-19, investing in virtual and remote activities to make culture survive became crucial as no one could enjoy Cultural Heritage in person. The Cultural Heritage community heavily invested in digitisation campaigns, mainly modelling data as Knowledge Graphs by becoming one of the most successful Semantic Web technologies application domains. Despite the vast investment in Cultural Heritage Knowledge Graphs, the syntactic complexity of RDF query languages, e.g., SPARQL, negatively affects and threatens data exploitation, risking leaving this enormous potential untapped. Thus, we aim to support the Cultural Heritage community (and everyone interested in Cultural Heritage) in querying Knowledge Graphs without requiring technical competencies in Semantic Web technologies. We propose an engaging exploitation tool accessible to all without losing sight of developers’ technological challenges. Engagement is achieved by letting the Cultural Heritage community leave the passive position of the visitor and actively create their Virtual Assistant extensions to exploit proprietary or public Knowledge Graphs in question-answering. By accessible to all, we mean that the proposed software framework is freely available on GitHub and Zenodo with an open-source license. We do not lose sight of developers’ technical challenges, which are carefully considered in the design and evaluation phases. This article first analyses the effort invested in publishing Cultural Heritage Knowledge Graphs to quantify data developers can rely on in designing and implementing data exploitation tools in this domain. Moreover, we point out challenges developers may face in exploiting them in automatic approaches. Second, it presents a domain-agnostic Knowledge Graph exploitation approach based on virtual assistants as they naturally enable question-answering features where users formulate questions in natural language directly by their smartphones. Then, we discuss the design and implementation of this approach within an automatic community-shared software framework (a.k.a. generator) of virtual assistant extensions and its evaluation in terms of performance and perceived utility according to end-users. Finally, according to a taxonomy of the Cultural Heritage field, we present a use case for each category to show the applicability of the proposed approach in the Cultural Heritage domain. In overviewing our analysis and the proposed approach, we point out challenges that a developer may face in designing virtual assistant extensions to query Knowledge Graphs, and we show the effect of these challenges in practice. © 2023-The authors. Published by IOS Press.
- ACCESSA Volunteer Computing Architecture for Computational Workflows on Decentralized WebAntelmi, Alessia, D’Ambrosio, Giuseppe, Petta, Andrea, Serra, Luigi, and Spagnuolo, CarmineIEEE Access 2022
The amount of accessible computational devices over the Internet offers an enormous but latent computational power. Nonetheless, the complexity of orchestrating and managing such devices requires dedicated architectures and tools and hinders the exploitation of this vast processing capacity. Over the last years, the paradigm of (Browser-based) Volunteer Computing emerged as a unique approach to harnessing such computational capabilities, leveraging the idea of voluntarily offering resources. This article proposes VFuse, a groundbreaking architecture to exploit the Browser-based Volunteer Computing paradigm via a ready-to-access volunteer network. VFuse offers a modern multi-language programming environment for developing scientific workflows using WebAssembly technology without requiring the user any local installation or configuration. We equipped our architecture with a secure and transparent rewarding mechanism based on blockchain technology (Ethereum) and distributed P2P file system (IPFS). Further, the use of Non-Fungible Tokens provides a unique, secure, and transparent methodology for recognizing the users’ participation in the network. We developed a prototype of the proposed architecture and four example applications implemented with our system. All code and examples are publicly available on GitHub. © 2013 IEEE.
- Handwriting and Drawing Features for Detecting Personality Traits: An Analysis on Big Five Sub-dimensionsEsposito, Anna, Amorese, Terry, Buonanno, Michele, Cuciniello, Marialucia, Esposito, Antonietta M., Faundez-Zanuy, Marcos, Likforman-Sulem, Laurence, Riviello, Maria Teresa, Spagnuolo, Carmine, Troncone, Alda, and Cordasco, GennaroActa Polytechnica Hungarica 2022
Handwriting and Drawing are functional tasks involving physical and cognitive processes. Recently they have been investigated for detecting cognitive and motor disorders. In this work, handwriting/drawing features are investigated for identifying connections with personality traits. For this purpose, an experiment comprising seven handwriting/drawing tasks has been administrated to 78 young adults (mean age=24.6 ± 2.4 years) equally balanced by gender. Handwriting and Drawing activities-both on and close to the paper – had been recorded online through a digitizing tablet able to measure handwriting and drawing features such as pressure, speed, dimension, and inclination of each pen-stroke on the paper. Participants were asked to fill the Big Five Personality Questionnaire (BFQ) and according to the scores obtained for each of the 5 dimensions and 10 Big Five sub-dimensions, were partitioned into three categories: low, typical, and high. To evaluate whether the recorded handwriting/drawing features are connected with personality traits ANOVA repeated measures have been performed with gender and group category (low, typical, and high) as between and the listed handwriting/drawing features as within factors. The analyses show significant differences among low, typical and, high BFQ scores for the main Big Five dimensions and the ten Big Five sub-dimensions, indicating that personality traits can be revealed by a quantitative analysis of the proposed handwriting/drawing features. © 2022, Budapest Tech Polytechnical Institution. All rights reserved.
- Towards a collaborative taxonomy of Tools, Languages and Environments in K-12 Computing EducationAddone, Agnese, Scarano, Vittorio, and Spagnuolo, CarmineIn Proceedings - Frontiers in Education INPROCEEDINGS, FIE 2022
In this Work-in-Progress paper we present a preliminary study and the design of a taxonomy of Tools, Languages and Environments (TLE) employed in K-12 Computing Education, in schools and outreach programs. The research provides an analytical classification model based on a survey of TLEs and on previous related works. It also outlines the collaborative protocol that will allow researchers to share the results of the taxonomy on a public repository. An analysis of the most common platforms where contributors can work collaboratively is presented to show the qualitative process of identification and choice of GitHub as the most reliable one. © 2022 IEEE.
2021
- Automatic Skill Generation for Knowledge Graph Question AnsweringPellegrino, Maria Angela, Santoro, Mario, Scarano, Vittorio, and Spagnuolo, Carmine2021
Knowledge Graphs are a critical source for Question Answering, but their potential may be threatened due to the complexity of their query languages, such as SPARQL. On the opposite side, Virtual Assistants have witnessed an extraordinary interest as they enable users to pose questions in natural language. Many companies and researchers have combined Knowledge Graphs and Virtual Assistants, but no one has provided end-users with a generic methodology to generate extensions for automatically querying knowledge graphs. Thus, we propose a community shared software framework to create custom extensions to query knowledge graphs by virtual assistants, unlocking the potentialities of the Semantic Web technologies by bringing knowledge graphs in the “pocket” of everyone, accessible from smartphones or smart speakers. © 2021, Springer Nature Switzerland AG.
- TraceMeNow: an Open-Source Software Framework for Indoor Localization ApplicationsBorrazzo, Mauro, D’Ambrosio, Giuseppe, Scarano, Vittorio, and Spagnuolo, CarmineIn CEUR Workshop Proceedings 2021
The increased number of smartphone-connected devices and the pervasive presence of sensors enabled the application of localization and tracking technologies in multiple contexts. Health, customer care, traveling, crowd management are just some of the possible fields where an Indoor Positioning System could be useful. Despite the effort of the research community, the integration of an Indoor Positioning System within an application is still difficult since it requires expertise in diverse fields like communication technologies, localization techniques, and hardware. This paper presents TraceMeNow, an open-source framework for developing applications comprising an Indoor Positioning System based on Bluetooth Low Energy and low-cost hardware. TraceMeNow is designed to improve developers’ experience without requiring specific knowledge to be used, thus aiming to be a simple and valuable tool suitable for different situations and accessible to any developer. TraceMeNow adopts a modular architecture enhancing the interoperability between components and supporting the developer throughout all the implementation phases. We aim to show the flexibility and ease of use of our framework by presenting an application to address a real-world use case. TraceMeNow aims to reduce the cost and the effort needed to create an application comprising an Indoor Positioning System, providing the basis for all the components and relying on mainstream technologies for hardware and communication. Moreover, TraceMeNow allows developers exploiting cloud computing when facing large scenarios with specific requirements such as high scalability and reliability, maintaining the same ease of use since the interaction with the provider is entirely abstracted. © 2021 Copyright for this paper by its authors.
- FGCSEasy and efficient agent-based simulations with the OpenABL language and compilerCosenza, Biagio, Popov, Nikita, Juurlink, Ben, Richmond, Paul, Chimeh, Mozhgan Kabiri, Spagnuolo, Carmine, Cordasco, Gennaro, and Scarano, VittorioFuture Generation Computer Systems 2021
Agent-based simulations represent an effective scientific tool, with numerous applications from social sciences to biology, which aims to emulate or predict complex phenomena through a set of simple rules performed by multiple agents. To simulate a large number of agents with complex models, practitioners have developed high-performance parallel implementations, often specialized for particular scenarios and target hardware. It is, however, difficult to obtain portable simulations, which achieve high performance and at the same time are easy to write and to reproduce on different hardware. This article gives a complete presentation of OPENABL, a domain-specific language and a compiler for agent-based simulations that enable users to achieve high-performance parallel and distributed agent simulations with a simple and portable programming environment. OPENABL is comprised of (1) an easy-to-program language, which relies on domain abstractions and explicitly exposes agent parallelism, synchronization and locality, (2) a source-to-source compiler, and (3) a set of pluggable compiler backends, which generate target code for multi-core CPUs, GPUs, and cloud-based systems. We evaluate OPENABL on simulations from different fields. In particular, our analysis includes predator–prey and keratinocyte, two complex simulations with multiple step functions, heterogeneous agent types, and dynamic creation and removal of agents. The results show that OPENABL-generated codes are portable to different platforms, perform similarly to manual target-specific implementations, and require significantly fewer lines of codes. © 2020 Elsevier B.V.
- Social influence maximization in hypergraphsAntelmi, Alessia, Cordasco, Gennaro, Spagnuolo, Carmine, and Szufel, PrzemysławEntropy 2021
This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value. Firstly proposed by Kempe et al., the TSS problem is based on a linear threshold diffusion model defined on an input graph with node thresholds, quantifying the hardness to influence each node. The goal is to find the smaller set of items that can influence the whole network according to the diffusion model defined. This study generalizes the TSS problem on networks characterized by many-to-many relationships modeled via hypergraphs. Specifically, we introduce a linear threshold diffusion process on such structures, which evolves as follows. Let H = (V, E) be a hypergraph. At the beginning of the process, the nodes in a given set S ⊆ V are influenced. Then, at each iteration, (i) the influenced hyperedges set is augmented by all edges having a sufficiently large number of influenced nodes; (ii) consequently, the set of influenced nodes is enlarged by all the nodes having a sufficiently large number of already influenced hyperedges. The process ends when no new nodes can be influenced. Exploiting this diffusion model, we define the minimum Target Set Selection problem on hypergraphs (TSSH). Being the problem NP-hard (as it generalizes the TSS problem), we introduce four heuristics and provide an extensive evaluation on real-world networks. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
- ACCESSModeling and Evaluating Epidemic Control Strategies with High-Order Temporal NetworksAntelmi, Alessia, Cordasco, Gennaro, Scarano, Vittorio, and Spagnuolo, CarmineIEEE Access 2021
Non-Pharmaceutical Interventions (NPIs) are essential measures that reduce and control a severe outbreak or a pandemic, especially in the absence of drug treatments. However, estimating and evaluating their impact on society remains challenging, considering the numerous and closely tied aspects to examine. This article proposes a fine-grain modeling methodology for NPIs, based on high-order relationships between people and environments, mimicking direct and indirect contagion pathways over time. After assessing the ability of each intervention in controlling an epidemic propagation, we devise a multi-objective optimization framework, which, based on the epidemiological data, calculates the NPI combination that should be implemented to minimize the spread of an epidemic as well as the damage due to the intervention. Each intervention is thus evaluated through an agent-based simulation, considering not only the reduction in the fraction of infected but also to what extent its application damages the daily life of the population. We run experiments on three data sets, and the results illustrate how the application of NPIs should be tailored to the specific epidemic situation. They further highlight the critical importance of correctly implementing personal protective (e.g., using face masks) and sanitization measures to slow down a pathogen spreading, especially in crowded places. © 2013 IEEE.
- Toward a domain-specific language for scientific workflow-based applications on multicloud systemCordasco, Gennaro, D’Auria, Matteo, Negro, Alberto, Scarano, Vittorio, and Spagnuolo, CarmineIn Concurrency and Computation: Practice and Experience 2021
The cloud computing paradigm has emerged as the backbone of modern price-aware scalable computing systems. Many cloud service models are competing to become the leading doorway to access the computational power of cloud providers. Recently, a novel service model, called function-as-a-service (FaaS), has been proposed, which enables users to exploit the cloud computational scalability, left out the configuration and management of huge computing infrastructures. This article discloses Fly, a domain-specific language, which aims at reconciling cloud and high-performance computing paradigms adopting a multicloud strategy by providing a powerful, effective, and pricing-efficient tool for developing scalable workflow-based scientific applications by exploiting different and at the same time FaaS cloud providers as computational backends in a transparent fashion. We present several improvements of the Fly language, as well as a new enhanced version of a source-to-source compiler, which currently supports Symmetric Multiprocessing, Amazon AWS, and Microsoft Azure backends and translation of functions in Java, JavaScript, and Python programming languages. Furthermore, we discuss a performance evaluation of Fly on a popular benchmark for distributed computing frameworks, along with a collection of case studies with an analysis of their performance results and costs. © 2020 John Wiley & Sons, Ltd.
2020
- FLY: A Domain-Specific Language for Scientific Computing on FaaSCordasco, Gennaro, D’Auria, Matteo, Negro, Alberto, Scarano, Vittorio, and Spagnuolo, CarmineIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2020
Cloud Computing is widely recognized as distributed computing paradigm for the next generation of dynamically scalable applications. Recently a novel service model, called Function-as-a-Service (FaaS), has been proposed, that enables users to exploit the computational power of cloud infrastructures, without the need to configure and manage complex computations systems. FaaS paradigm represents an opportunity to easily develop and execute extreme-scale applications as it allows fine-grain decomposition of the application with a much more efficient scheduling on cloud provider infrastructure. We introduce fly, a domain-specific language for designing, deploying and executing scientific computing applications by exploiting the FaaS service model on different cloud infrastructures. In this paper, we present the design and the language definition of fly on several computing (local and FaaS) back-ends: Symmetric multiprocessing (SMP), Amazon AWS Lambda, Microsoft Azure Functions, Google Cloud Functions, and IBM Bluemix/Apache OpenWhisk. We also present the first fly source-to-source compiler, publicly available on GitHub, which supports SMP and AWS back-ends. © 2020, Springer Nature Switzerland AG.
- Analyzing, exploring, and visualizing complex networks via hypergraphs using simplehypergraphs.JlAntelmi, Alessia, Cordasco, Gennaro, Kamiński, Bogumi̷l, Pra̷lat, Pawe̷l, Scarano, Vittorio, Spagnuolo, Carmine, and Szufel, PrzemyslawInternet Mathematics 2020
Real-world complex networks are usually being modeled as graphs. The concept of graphs assumes that the relations within the network are binary (for instance, between pairs of nodes); however, this is not always true for many real-life scenarios, such as peer-to-peer communication schemes, paper co-authorship, or social network interactions. For such scenarios, it is often the case that the underlying network is better and more naturally modeled by hypergraphs. A hypergraph is a generalization of a graph in which a single (hyper)edge can connect any number of vertices. Hypergraphs allow modelers to have a complete representation of multi-relational (many-to-many) networks; hence, they are extremely suitable for analyzing and discovering more subtle dependencies in such data structures. Working with hypergraphs requires new software libraries that make it possible to perform operations on them, from basic algorithms (such as searching or traversing the network) to computing significant hypergraph measures, to including more challenging algorithms (such as community detection). In this paper, we present a new software library, SimpleHypergraphs.jl, written in the Julia language and designed for high-performance computing on hypergraphs and propose two new algorithms for analyzing their properties: s-betweenness and modified label propagation. We also present various approaches for hypergraph visualization integrated into our tool. In order to demonstrate how to exploit the library in practice, we discuss two case studies based on the 2019 Yelp Challenge dataset and the collaboration network built upon the Game of Thrones TV series. The results are promising and they confirm the ability of hypergraphs to provide more insight than standard graph-based approaches. © 2020, Ryerson University. All rights reserved.
- Information diffusion in complex networks: a model based on hypergraphs and its analysisAntelmi, Alessia, Cordasco, Gennaro, Spagnuolo, Carmine, and Szufel, PrzemysławIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2020
This work introduces the problem of social influence diffusion in complex networks, where vertices are linked not only through simple pairwise relationships to other nodes but with groups of nodes of arbitrary size. A challenging problem that arises in this domain is to determine a small subset of nodes S (a target-set) able to spread their influence in the whole network. This problem has been formalized and studied in different ways, and many viable solutions have been found for graphs. These have been applied to study several phenomena in research fields such as social, economic, biological, and physical sciences. In this contribution, we investigated the social influence problem on hypergraphs. As hypergraphs are mathematical structures generalization of graphs, they can naturally model the many-to-many relationships characterizing a complex network. Given a network represented by a hypergraph H=(V, E), we consider a dynamic influence diffusion process on H, evolving as follows. At the beginning of the process, the nodes in a given set S (Formula Presented) V are influenced. Then, at each iteration, the influenced hyperedges set is augmented by all hyperedges having a sufficiently large number of influenced nodes. Consequently, the set of influenced nodes is extended by all the nodes contained in a sufficiently large number of already influenced hyperedges. The process terminates when no new nodes can be influenced. The so defined problem is an inherent chicken-and-egg question as nodes are influenced by groups of other nodes (or hyperedges), while hyperedges (or group of nodes) are influenced by the nodes they contain. In this paper, we provide a formal definition of the influence diffusion problem on hypergraphs. We propose a set of greedy-based heuristic strategies for finding the minimum influence target set, and we present an in-depth analysis of their performance on several classes of random hypergraphs. Furthermore, we describe an experiment on a real use-case, based on the character co-occurrences network of the Game-of-Thrones TV Series. © Springer Nature Switzerland AG 2020.
- AAMASA design-methodology for epidemic dynamics via time-varying hypergraphsAntelmi, Alessia, Cordasco, Gennaro, Spagnuolo, Carmine, and Scarano, VittorioIn Proceedings of the International Joint INPROCEEDINGS on Autonomous Agents and Multiagent Systems, AAMAS 2020
In epidemiology science, the importance to explore innovative modeling tools for acutely analyzing epidemic diffusion is turning into a big challenge considering the myriad of real-world aspects to capture. Typically, equation-based models, such as SIS and SIR, are used to study the propagation of diseases over a population. Improved approaches also include human-mobility patterns as network information to describe contacts among individuals. However, there still is the need to incorporate in these models information about different types of contagion, geographical information, humans habits, and environmental properties. In this paper, we propose a novel approach that takes into account: 1. direct and indirect epidemic contagion pathways to explore the dynamics of the epidemic, 2. the times of possible contagions, and 3. human-mobility patterns. We combine these three features exploiting time-varying hypergraphs, and we embed this model into a design-methodology for agent-based models (ABMs), able to improve the correctness in the epidemic estimations of classical contact-network approaches. We further describe a diffusion algorithm suitable for our design-methodology and adaptable to the peculiarities of any disease spreading policies and/or models. Finally, we tested our methodology by developing an ABM, realizing the SIS epidemic compartmental model, for simulating an epidemic propagation over a population of individuals. We experimented the model using real user-mobility data from the location-based social network Foursquare, and we demonstrated the high-impact of temporal direct and indirect contagion pathways. © 2020 International Foundation for Autonomous.
2019
- On Evaluating Rust as a Programming Language for the Future of Massive Agent-Based SimulationsAntelmi, Alessia, Cordasco, Gennaro, D’Auria, Matteo, De Vinco, Daniele, Negro, Alberto, and Spagnuolo, CarmineIn Communications in Computer and Information Science 2019
The analysis of real systems and the development of predictive models to describe the evolution of real phenomena are challenging tasks that can improve the design of methodologies in many research fields. In this context, Agent-Based Model (ABM) can be seen as an innovative tool for modelling real-world complex simulations. This paper presents Rust-AB, an open-source library for developing ABM simulation on sequential and/or parallel computing platforms, exploiting Rust as programming language. The Rust-AB architecture as well as an investigation on the ability of Rust to develop ABM simulations are discussed. An ABM simulation written in Rust-AB, and a performance comparison against the well-adopted Java ABM toolkit MASON is also presented. © 2019, Springer Nature Singapore Pte Ltd.
- Large-scale Optimized Searching for Cruise Itinerary Scheduling on the CloudCarillo, Michele, D’Auria, Matteo, Serrapica, Flavio, Spagnuolo, Carmine, Caligaris, Carlo, and Fabiano, MarcelloIn 2019 International INPROCEEDINGS on Optimization and Applications, ICOA 2019 2019
We consider the Cruise Itinerary Schedule Design (CISD) problem, which consists in identifying a cruise itinerary in order to optimize the payoff of a cruising company. To deal with this problem we present an optimization strategy based on a parameters optimization process. We exploits the Simulation exploration and Optimization Framework for the cloud (SOF) for building our computing intensive process on a cloud computing infrastructure. The optimization process is based on a heuristic tabu-search strategy, which computes and evaluates the cruise schedule and a genetic algorithm that optimizes the parameters of the heuristic search. We have evaluated the proposed solution in terms of quality as well as the scalability/cost efficiency on the cloud infrastructure Amazon Web Services. © 2019 IEEE.
- SimpleHypergraphs.jl—novel software framework for modelling and analysis of hypergraphsAntelmi, Alessia, Cordasco, Gennaro, Kamiński, Bogumił, Prałat, Paweł, Scarano, Vittorio, Spagnuolo, Carmine, and Szufel, PrzemyslawIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2019
Hypergraphs are natural generalization of graphs in which a single (hyper)edge can connect any number of vertices. As a result, hypergraphs are suitable and useful to model many important networks and processes. Typical applications are related to social data analysis and include situations such as exchanging emails with several recipients, reviewing products on social platforms, or analyzing security vulnerabilities of information networks. In many situations, using hypergraphs instead of classical graphs allows us to better capture and analyze dependencies within the network. In this paper, we propose a new library, named SimpleHypergraphs.jl, designed for efficient hypegraph analysis. The library exploits the Julia language flexibility and direct support for distributed computing in order to bring a new quality for simulating and analyzing processes represented as hypergraphs. In order to show how the library can be used we study two case studies based on the Yelp dataset. Results are promising and confirm the ability of hypergraphs to provide more insight than standard graph-based approaches. © Springer Nature Switzerland AG 2019.
- The MASON Simulation Toolkit: Past, Present, and FutureLuke, Sean, Simon, Robert, Crooks, Andrew, Wang, Haoliang, Wei, Ermo, Freelan, David, Spagnuolo, Carmine, Scarano, Vittorio, Cordasco, Gennaro, and Cioffi-Revilla, ClaudioIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2019
MASON is a widely-used open-source agent-based simulation toolkit that has been in constant development since 2002. MASON’s architecture was cutting-edge for its time, but advances in computer technology now offer new opportunities for the ABM community to scale models and apply new modeling techniques. We are extending MASON to provide these opportunities in response to community feedback. In this paper we discuss MASON, its history and design, and how we plan to improve and extend it over the next several years. Based on user feedback will add distributed simulation, distributed GIS, optimization and sensitivity analysis tools, external language and development environment support, statistics facilities, collaborative archives, and educational tools. © 2019, Springer Nature Switzerland AG.
2018
- A layered architecture for open data: Design, implementation and experiencesCordasco, Gennaro, Malandrino, Delfina, Pirozzi, Donato, Scarano, Vittorio, and Spagnuolo, CarmineIn ACM International INPROCEEDINGS Proceeding Series 2018
In order to increase transparency, Public Administrations (PAs) have their own portals to publish Open Data, resulting in more openness, reduced corruption and improved services. Open Data (OD) initiatives are achieving less citizens’ engagement than expected. Hence, the need to find other ways and services to obtain more engagement and extract value from OD. This paper introduces an architectural model to design software platforms with the objective to increase public value through collective participation of citizens, public administrations and key stakeholders. The architectural model originates from the Data-Information-Knowledge hierarchy, where greater value is at the top of the pyramid, in information and knowledge gathered from data. Thus, the architectural model adds the collaborative and presentation layers to the classical data layer; citizens, public administrations, and stakeholders form groups of interests to understand, reason and interpret Open Data to gather information and generate knowledge that will be communicated to the general audience over Internet, thus, increasing public value. The paper describes three platform instances: the ROUTE-TO-PA ecosystem, the data.world, and DKAN, which functionalities can be mapped onto the architectural model proposed in the paper. Furthermore, the paper describes HETOR, a concreate experience of exploitation of the architectural model and the ROUTE-TO-PA ecosystem with groups of students and associations of citizens, who collaborated together to ultimately generate new knowledge for Cultural Heritage to be communicated over Internet through blog posts. © 2018 Association for Computing Machinery.
- OpenABL: A Domain-Specific Language for Parallel and Distributed Agent-Based SimulationsCosenza, Biagio, Popov, Nikita, Juurlink, Ben, Richmond, Paul, Chimeh, Mozhgan Kabiri, Spagnuolo, Carmine, Cordasco, Gennaro, and Scarano, VittorioIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2018
Agent-based simulations are becoming widespread among scientists from different areas, who use them to model increasingly complex problems. To cope with the growing computational complexity, parallel and distributed implementations have been developed for a wide range of platforms. However, it is difficult to have simulations that are portable to different platforms while still achieving high performance. We present OpenABL, a domain-specific language for portable, high-performance, parallel agent modeling. It comprises an easy-to-program language that relies on high-level abstractions for programmability and explicitly exploits agent parallelism to deliver high performance. A source-to-source compiler translates the input code to a high-level intermediate representation exposing parallelism, locality and synchronization, and, thanks to an architecture based on pluggable backends, generates target code for multi-core CPUs, GPUs, large clusters and cloud systems. OpenABL has been evaluated on six applications from various fields such as ecology, animation, and social sciences. The generated code scales to large clusters and performs similarly to hand-written target-specific code, while requiring significantly fewer lines of codes. © 2018, Springer International Publishing AG, part of Springer Nature.
- SIMPATDistributed simulation optimization and parameter exploration framework for the cloudCarillo, Michele, Cordasco, Gennaro, Serrapica, Flavio, Scarano, Vittorio, Spagnuolo, Carmine, and Szufel, PrzemysławSimulation Modelling Practice and Theory 2018
Simulation models are becoming an increasingly popular tool for the analysis and optimization of complex real systems in different fields. Finding an optimal system design requires performing a large sweep over the parameter space in an organized way. Hence, the model optimization process is extremely demanding from a computational point of view, as it requires careful, time-consuming, complex orchestration of coordinated executions. In this paper, we present the design of SOF (Simulation Optimization and exploration Framework in the cloud), a framework which exploits the computing power of a cloud computational environment in order to carry out effective and efficient simulation optimization strategies. SOF offers several attractive features. Firstly, SOF requires “zero configuration” as it does not require any additional software installed on the remote node; only standard Apache Hadoop and SSH access are sufficient. Secondly, SOF is transparent to the user, since the user is totally unaware that the system operates on a distributed environment. Finally, SOF is highly customizable and programmable, since it enables the running of different simulation optimization scenarios using diverse programming languages – provided that the hosting platform supports them – and different simulation toolkits, as developed by the modeler. The tool has been fully developed and is available on a public repository1 under the terms of the open source Apache License. It has been tested and validated on several private platforms, such as a dedicated cluster of workstations, as well as on public platforms, including the Hortonworks Data Platform and Amazon Web Services Elastic MapReduce solution. © 2017 Elsevier B.V.
- SIMPATDistributed MASON: A scalable distributed multi-agent simulation environmentCordasco, Gennaro, Scarano, Vittorio, and Spagnuolo, CarmineSimulation Modelling Practice and Theory 2018
Computational Social Science (CSS) involves interdisciplinary fields and exploits computational methods, such as social network analysis as well as computer simulation with the goal of better understanding social phenomena. Agent-Based Models (ABMs) represent an effective research tool for CSS and consist of a class of models, which, aim to emulate or predict complex phenomena through a set of simple rules (i.e., independent actions, interactions and adaptation), performed by multiple agents. The efficiency and scalability of ABMs systems are typically obtained distributing the overall computation on several machines, which interact with each other in order to simulate a specific model. Unfortunately, the design of a distributed simulation model is particularly challenging, especially for domain experts who sporadically are computer scientists and are not used to developing parallel code. D-MASON framework is a distributed version of the MASON library for designing and executing ABMs in a distributed environment ensuring scalability and easiness. D-MASON enable the developer to exploit the computing power of distributed environment in a transparent manner; the developer has to do simple incremental modifications to existing MASON models, without re-designing them. This paper presents several novel features and architectural improvements introduced in the D-MASON framework: an improved space partitioning strategy, a distributed 3D field, a distributed network field, a decentralized communication layer, a novel memory consistency mechanism and the integration to cloud environments. Full documentation, additional tutorials, and other material can be found at https://github.com/isislab-unisa/dmason where the framework can be downloaded. © 2018
- Scalability in the MASON Multi-Agent Simulation SystemWang, Haoliang, Wei, Ermo, Simon, Robert, Luke, Sean, Crooks, Andrew, Freelan, David, and Spagnuolo, CarmineIn Proceedings of the 2018 IEEE/ACM 22nd International Symposium on Distributed Simulation and Real Time Applications, DS-RT 2018 2018
This paper describes Distributed MASON, a distributed version of the MASON agent-based simulation tool. Distributed MASON is architected to take advantage of well known principles from Parallel and Discrete Event Simulation, such as the use of Logical Processes (LP) as a method for obtaining scalable and high performing simulation systems. We first explain data management and sharing between LPs and describe our approach to load balancing. We then present both a local greedy approach and a global hierarchical approach. Finally, we present the results of our implementation of Distributed MASON on an instance in the Amazon Cloud, using several standard multi-agent models. The results indicate that our design is highly scalable and achieves our expected levels of speed-up. © 2018 IEEE.
- Heterogeneous Scalable Multi-languages Optimization via SimulationCordasco, Gennaro, D’Auria, Matteo, Spagnuolo, Carmine, and Scarano, VittorioIn Communications in Computer and Information Science 2018
Scientific Computing (SC) is a multidisciplinary field that uses the computational approach to understand and study complex artificial and natural systems belonging many scientific sectors. Optimization via Simulation (OvS) is a fast developing area in SC field. OvS combines classical optimization algorithms and stochastic simulations to face problems with unknown and/or dynamic data distribution. We present Heterogeneous Simulation Optimization (HSO), an architecture that enable to distribute the OvS process on an Heterogeneous Computing systems. HSO is designed according to two levels of heterogeneity: hardware heterogeneity, that is the ability to exploit the computational power of several general-purpose CPUs and/or hardware accelerators such as Graphics Processing Units (GPUs); programming languages heterogeneity, that is the capability to develop the OvS methodology combining different programming languages such as C++, C, Clojure, Erlang, Go, Haskel, Java, Node.js, Objective-C, PHP, Python, Scala and many others. The proposed HSO architecture has been fully developed and is available on a public GitHub repository. We have validated and tested the scalability of HSO developing two different use cases that show both the levels of heterogeneity, and showing how to exploit Optimal Computing Budget Allocation (OCBA) algorithm and a Genetic Algorithm in a OvS process. © 2018, Springer Nature Singapore Pte Ltd.
2017
- D-MASON on the cloud: An experience with amazon web servicesCarillo, Michele, Cordasco, Gennaro, Serrapica, Flavio, Spagnuolo, Carmine, Szufel, Przemysaw, and Vicidomini, LucaIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2017
D-Mason framework is a parallel version of the Mason library for writing and running Agent-based simulations – a class of models that, by simulating the behavior of multiple agents, aims to emulate and/or predict complex phenomena. D-Mason has been conceived to harness the amount of unused computing power available in common installations like educational laboratory. Then the focus moved to dedicated installation, such as massively parallel machines or supercomputing centers. In this paper, D-Mason takes another step forward and now it canbeusedonacloudenvironment. The goal of the paper is twofold. Firstly, we are going to present D-Mason on the cloud – a D-Mason extension that, starting from an IaaS (Infrastructure as a Service) abstraction, and exploiting Amazon Web Services and StarCluster, provides a SIMulation-as-a-Service (SIMaaS) abstraction that simplifies the process of setting up and running distributed simulations in the cloud. Secondly, an additional goal of the paper is to assess computational and economic efficiency of running distributed multi-agent simulations on the Amazon Web Services EC2 instances. The computational speed and costs of an EC2 cluster will be compared against an on-site HPC cluster. © Springer International Publishing AG 2017.
- Engaging Citizens with a Social Platform for Open DataCordasco, Gennaro, De Donato, Renato, Malandrino, Delfina, Palmieri, Giuseppina, Petta, Andrea, Pirozzi, Donato, Santangelo, Gianluca, Scarano, Vittorio, Serra, Luigi, Spagnuolo, Carmine, and Vicidomini, LucaIn ACM International INPROCEEDINGS Proceeding Series 2017
Open Data are valuable initiatives in favour of transparency. Public administrations are increasing the availability of datasets for citizens, associations, innovators and other stakeholders, by releasing their data with open licenses. Open initiatives are achieving less success than expected, mainly due to the lack of engagement. There is a growing demand for approaches to actively engage citizens in exploiting Open Data. This paper introduces SPOD, a Social Platform for Open Data, which aims to engage citizens, local associations and organizations in forming communities of interests, stimulating the interpretation of Open Data and exploiting their use in Data-driven discussions, something not well-supported on traditional social networks. Social collaboration is the key aspect to increase the public value, where citizens participate in the discussions, co-create knowledge and data. The paper describes the engagement of four communities of citizens, which contributed to the public value by discussing topics in the context of Cultural Heritage, generating information from existing and co-created open datasets, by using SPOD. © 2017 ACM.
- Increasing Public Value through Co-Creation of Open KnowledgeAndriessen, Jerry, Baker, Michael, Cordasco, Gennaro, De Donato, Renato, Malandrino, Delfina, Palmieri, Giuseppina, Pardijs, Mirjam, Petta, Andrea, Pirozzi, Donato, Scarano, Vittorio, Serra, Luigi, Spagnuolo, Carmine, and Vicidomini, LucaIn 2017 4th International INPROCEEDINGS on eDemocracy and eGovernment, ICEDEG 2017 2017
The aim of our research is to study how to increase Public Value through the collective participation, involving Public Administrations, stakeholders and citizens together. The Public Value for citizens is in the available and gained Knowledge. The paper models this concept by introducing a variant of the classic Data-Information-Knowledge pyramid, considering everything published as open and public. The paper introduces a social and iterative process designed for user appropriation, that includes the Knowledge and Data Co-Creation with the aim to generate public Open Knowledge. Users with process and technology appropriation can creatively follow the process in different ways. The paper concludes by introducing a brief preliminary scenario that exploits the process, platform and technology in the context of Cultural Heritage. © 2017 IEEE.
- Work partitioning on parallel and distributed agent-based simulationCordasco, Gennaro, Spagnuolo, Carmine, and Scarano, VittorioIn Proceedings - 2017 IEEE 31st International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2017 2017
Work partitioning is a key challenge with ap- plications in many scientific and technological fields. The problem is very well studied with a rich literature on both distributed and parallel computing architectures. In this paper we deal with the work partitioning problem for parallel and distributed agent-based simulations which aims at (i) balancing the overall load distribution, (ii) minimizing, at the same time, the communication overhead due to agents’ inter-dependencies. We introduce a classification taxonomy of work partitioning strategies and present a space-based work partitioning ap- proach, based on a Quad-tree data structure, which enables to: identify a good space partitioning (even when the distribution of agents on the fields is non-uniform) with a limited impact in terms of communication. Being a multi-objective problem, the results are difficult to compare and it is hard to foresee what can be the impact of one solution. For this reason we evaluate our strategy in a real context using a well-known behavior (the boids flocking model), on a distributed agent based simulation framework (D-MASON). The results show that our proposal provides a sensible impact on the performances of the system and scales in terms of the number of logical processors. © 2017 IEEE.
- DatalEt-ecosystem provider (DEEP): Scalable architecture for reusable, portable and user-friendly visualizations of open dataDe Donato, Renato, Malandrino, Delfina, Palmieri, Giuseppina, Petta, Andrea, Pirozzi, Donato, Scarano, Vittorio, Serra, Luigi, Spagnuolo, Carmine, Vicidomini, Luca, and Cordasco, GennaroIn Proceedings of the 7th International INPROCEEDINGS for E-Democracy and Open Government, CeDEM 2017 2017
This paper presents the DatalEt-Ecosystem Provider (DEEP), an extensible, and scalable Edge-centric architecture to visualize Open Data, retrieved in real time from institutional open data portals. The aim is to engage citizens and stakeholders through reusable, portable and interactive visualizations, named datalets. The DEEP architecture exploits the increasing computing power and capacity of end-users devices, moving the computation to process and visualize data, from the central server, directly to the client-side ensuring data trustiness, privacy, scalability and dynamic data loading. DEEP and its datalets have been fully exploited, in the ROUTE-TO-PA, HORIZON 2020 funded project, by five public administrations across Europe as pilot projects. The project engages and involves citizens in creating, sharing and commenting existing visualizations of Open Data. DEEP is open source, its source code is fully available on GitHub, thus every single component can be reused by other projects. © 2017 IEEE.
2016
- Toward the new version of D-MASON: Efficiency, effectiveness and correctness in parallel and distributed agent-based simulationsCordasco, Gennaro, Spagnuolo, Carmine, and Scarano, VittorioIn Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016 2016
Agent-Based Models (ABMs) denote a class of models which, by simulating the behavior of multiple agents (i.e., independent actions, interactions and adaptation), aim to emulate and/or predict complex phenomena. One of the general features of ABM simulations is their experimental capacity, that requires a viable and reliable infrastructure to interact with a running simulation, monitoring its behaviour, as it proceeds, and applying changes to the configurations at run time, in order to study «what if» scenarios. A common approach for improving the efficiency and the effectiveness of ABMs as a research tool is to distribute the overall computation on a number of machines, which makes the design of the simulation model particularly challenging. D-MASON framework is a distributed version of the MASON library for writing and running Agent-based simulations. We briefly present D-MASON architecture and functionalities. Then we presents its novel features: a distributed network field and a novel communication layer dedicated to massive parallel machines. The main contribution of the paper is in providing a memory consistency modeling, where the previous state of theagent is made available (consistently) for all other agents (even the one on other processors) and this is obtained by exploiting the Java Method Handler mechanism. Full documentation, additional tutorials and other material can be found at www.dmason.org where the framework can be downloaded. © 2016 IEEE.
- SOF: Zero Configuration Simulation Optimization Framework on the CloudCarillo, Michele, Cordasco, Gennaro, Serrapica, Flavio, Scarano, Vittorio, Spagnuolo, Carmine, and Szufel, PrzemysawIn Proceedings - 24th Euromicro International INPROCEEDINGS on Parallel, Distributed, and Network-Based Processing, PDP 2016 2016
Simulation models are becoming an increasingly popular tool for the analysis and optimization of complex real systems in different fields. Finding an optimal system design requires performing a large parameter sweep. In this paper, we present the design of SOF (Simulation Optimization and exploration Framework on the cloud), a framework which exploits the computing power of a cloud computational environment in order to realize effective and efficient simulation optimization strategies. SOF offers several attractive features: SOF requires «zero configuration» as it does not require any additional software installed on the remote node, SOF is transparent to the user, since the user is totally unaware that system operates on a distributed environment, SOF is highly customizable and programmable, since it enables the running of different simulation optimization scenarios on different simulation toolkits. The tool has been fully developed and is available on a public repository under the Apache public licence. © 2016 IEEE.
- An architecture for social sharing and collaboration around open data visualisationsMalandrino, Delfina, Manno, Ilaria, Palmieri, Giuseppina, Petta, Andrea, Pirozzi, Donato, Scarano, Vittorio, Serra, Luigi, Spagnuolo, Carmine, Vicidomini, Luca, and Cordasco, GennaroIn Proceedings of the ACM INPROCEEDINGS on Computer Supported Cooperative Work, CSCW 2016
This paper introduces the DatalEt-Ecosystem Provider (DEEP), an open source, extensible, modular and pluggable architecture providing datalets, which are web-component visualisations of datasets content. DEEP enables the sharing and collaboration around data visualisations, supporting for instance communities in public deliberation around Open Data. Users can create, reconfigure, reuse and share interactive visualisations in any web-page and other systems.
- WSCFrom desktop to large-scale model exploration with swift/TOzik, Jonathan, Collier, Nicholson T., Wozniak, Justin M., and Spagnuolo, CarmineIn Proceedings - Winter Simulation INPROCEEDINGS 2016
As high-performance computing resources have become increasingly available, new modes of computational processing and experimentation have become possible. This tutorial presents the Extreme-scale Model Exploration with Swift/T (EMEWS) framework for combining existing capabilities for model exploration approaches (e.g., model calibration, metaheuristics, data assimilation) and simulations (or any "black box" application code) with the Swift/T parallel scripting language to run scientific workflows on a variety of computing resources, from desktop to academic clusters to Top 500 level supercomputers. We will present a number of use-cases, starting with a simple agent-based model parameter sweep, and ending with a complex adaptive parameter space exploration workflow coordinating ensembles of distributed simulations. The use-cases are published on a public repository for interested parties to download and run on their own. © 2016 IEEE.
- Fostering transparency and participation in the data-based society: A sustainable architecture for a social platform for Open DataScarano, Vittorio, Cordasco, Gennaro, Lettieri, Nicola, Malandrino, Delfina, Manno, Ilaria, Palmieri, Giuseppina, Petta, Andrea, Pirozzi, Donato, Rizzolo, Diletta, Serra, Luigi, Spagnuolo, Carmine, and Vicidomini, LucaIn eChallenges e-2015 INPROCEEDINGS Proceedings 2016
This paper focuses on innovative solutions to the problem of transparency in Public Administrations (PAs) by opening up public data and services so that citizens participation is facilitated and encouraged. We introduce the motivating principles and the architectural solutions to a Social Platform for Open Data, that is designed in order to provide a sustainable and re-usable framework to provide collaborative and social access to Open Data provided by PAs. Our overall objective is to propose a engage citizens by making them able to socially interact over Open Data, by forming or joining existing online communities that share common interest and discuss common issues of relevance to local policy, service delivery, and regulation. The proposed architectural solution is supporting the citizens in a collective relationship among them (as a network helping each other) and with PAs so that the information provided by the Public Administrations is shared, interpreted, personalized, made easier to understand and discussed to assess its meanings. The results and benefits of our approach, as well as potential impact in the pilot experiences that are planned, are also discussed. © 2015 IIMC.
2015
- On evaluating graph partitioning algorithms for distributed agent based models on networksAntelmi, Alessia, Cordasco, Gennaro, Spagnuolo, Carmine, and Vicidomini, LucaIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2015
Graph Partitioning is a key challenge problem with application in many scientific and technological fields. The problem is very well studied with a rich literature and is known to be NP-hard. Several heuristic solutions, which follow diverse approaches, have been proposed, they are based on different initial assumptions that make them difficult to compare. An analytical comparison was performed based on an Implementation Challenge [3], however being a multi-objective problem (two opposing goals are for instance load balancing and edge-cut size), the results are difficult to compare and it is hard to foresee what can be the impact of one solution, instead of another, in a real scenario. In this paper we analyze the problem in a real context: the development of a distributed agent-based simulation model on a network field (which for instance can model social interactions). We present an extensive evaluation of the most efficient and effective solutions for the balanced k-way partitioning problem. We evaluate several strategies both analytically and on real distributed simulation settings (D-Mason). Results show that, a good partitioning strategy strongly influences the performances of the distributed simulation environment. Moreover, we show that there is a strong correlation between the edge-cut size and the real performances. Analyzing the results in details we were also able to discover the parameters that need to be optimized for best performances on networks in ABMs. © Springer International Publishing Switzerland 2015.
- Distributed agent-based simulation and GIS: An experiment with the dynamics of social normsLettieri, Nicola, Spagnuolo, Carmine, and Vicidomini, LucaIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2015
In the last decade, the investigation of the social complexity has witnessed the rise of Computational Social Science, a research paradigm that heavily relies upon data and computation to foster our understanding of social phenomena. In this field, a key role is played by the explanatory and predictive power of agent-based social simulations that are showing to take advantage of GIS, higher number of agents and real data. We focus GIS based distibuted ABMs. We observed that the density distribution of agents, over the field, strongly impact on the overall performances. In order to better understand this issue, we analyzes three different scenarios ranging from real positioning, where the citizens are positioned according to a real dataset to a random positioning where the agent are positioned uniformly at random on the field. Results confirm our hypothesis and show that an irregular distribution of the agents over the field increases the communication overhead. We provide also an analytic analysis which, in a 2-dimensional uniform field partitioning, is affected by several parameters (which depend on the model), but is also influenced by the density distribution of agents over the field. According to the presented results, we have that uniform space partitioning strategy does not scale on GIS based ABM characterized by an irregular distribution of agents. © Springer International Publishing Switzerland 2015.
2014
- Communication strategies in distributed agent-based simulations: The experience with D-MasonCordasco, Gennaro, Mancuso, Ada, Milone, Francesco, and Spagnuolo, CarmineIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014
Agent-Based simulation Models (ABMs) are a very powerful experimental tool of analysis, used in many scientific and technological communities of researchers, to assess and predict the dynamic unfolding of a series of events or processes, according to the imposition of certain conditions, given by the analyst. The computing power usually represents a limit for such simulations and the traditional answer to the need for computing power is to invest in computer resources. D-Mason is a framework for parallelizing simulations developed on top of Mason toolkit. The goal of D-Mason is to exploit wasted computing power in a network of computers, eventually heterogeneous, as a research lab or a cluster of workstation. In this paper we present a novel communication strategy using Publish/ Subscribe paradigm through a layer based on the MPI Standard. © 2014 Springer-Verlag Berlin Heidelberg.
- Exploiting D-Mason on parallel platforms: A novel communication strategyCordasco, Gennaro, Milone, Francesco, Spagnuolo, Carmine, and Vicidomini, LucaIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014
Agent-based simulation models are a powerful experimental tool for research and management in many scientific and technological fields.; D-Mason is a parallel version of Mason, a library for writing and running Agent-based simulations.; In this paper, we present a novel development of D-Mason, a decentralized communication strategy which realizes a Publish/Subscribe paradigm through a layer based on the MPI standard. We show that our communication mechanism is much more scalable and efficient than the previous centralized one. © Springer International Publishing Switzerland 2014.
2013
- Designing computational steering facilities for distributed agent based simulationsCordasco, Gennaro, De Chiara, Rosario, Raia, Francesco, Scarano, Vittorio, Spagnuolo, Carmine, and Vicidomini, LucaIn SIGSIM-PADS 2013 - Proceedings of the 2013 ACM SIGSIM Principles of Advanced Discrete Simulation 2013
Agent-Based Models (ABMs) are a class of models which, by simulating the behavior of multiple agents (i.e., ndependent actions, interactions and adaptation), aim to emulate and/or predict complex phenomena. One of the general features of ABM simulations is their experimental capacity, that requires a viable and reliable infrastructure to interact with a running simulation, monitoring its behaviour, as it proceeds, and applying changes to the configurations at run time, (the computational steering) in order to study "what if" scenarios. A common approach for improving the efficiency and the effectiveness of ABMs as a research tool is to distribute the overall computation on a number of machines, which makes the computational steering of the simulation particularly challenging. In this paper, we present the principles and the architecture design of the management and control infrastructure that is available in D-Mason, a framework for implementing distributed ABM simulations. Together with an efficient parallel distribution of the simulation tasks, D-Mason offers a number of facilities to support the computational steering of a simulation, i.e. monitoring and interacting with a running distributed simulation. © 2013 ACM.
- Bringing together efficiency and effectiveness in distributed simulations: The experience with D-MasonCordasco, Gennaro, Chiara, Rosario, Mancuso, Ada, Mazzeo, Dario, Scarano, Vittorio, and Spagnuolo, CarmineSIMULATION 2013
Agent-based simulation models are an increasingly popular tool for research and management in many fields. In executing such simulations “speed” is one of the most general and important issues because of the size and complexity of simulations. But another important issue is the effectiveness of the solution, which consists of how easily usable and portable the solutions are for the users, i.e. the programmers of the distributed simulation. Our study, then, is aimed at efficient and effective distribute simulations by adopting a framework-level approach, with our design and implementation of a framework, D-Mason, which is a parallel version of the Mason library for writing and running simulations of agent-based simulation models. In particular, besides the efficiency due to workload distribution with small overhead, D-Mason at a framework level proves itself effective since it enables the scientists that use the framework (domain expert but with limited knowledge of distributed programming) only minimally aware of the fact that the simulation is running on a distributed environment. Then, we present tests that compare D-Mason against Mason in order to assess the improved scalability and D-Mason capability to exploit heterogeneous distributed hardware. Our tests also show that several massive simulations that are impossible to execute on Mason (e.g. because of CPU and/or memory requirements) can be easily performed using D-Mason. © 2013, The Society for Modeling and Simulation International. All rights reserved.
2012
- A framework for distributing agent-based simulationsCordasco, Gennaro, De Chiara, Rosario, Mancuso, Ada, Mazzeo, Dario, Scarano, Vittorio, and Spagnuolo, CarmineIn Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012
Agent-based simulation models are an increasingly popular tool for research and management in many, different and diverse fields. In executing such simulations the "speed" is one of the most general and important issues. The traditional answer to this issue is to invest resources in deploying a dedicated installation of dedicated computers. In this paper we present a framework that is a parallel version of the Mason, a library for writing and running Agent-based simulations. © 2012 Springer-Verlag Berlin Heidelberg.