<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ariadne Lab</title><link>https://www.ariadnelab.dieei.unict.it/</link><atom:link href="https://www.ariadnelab.dieei.unict.it/index.xml" rel="self" type="application/rss+xml"/><description>Ariadne Lab</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 27 Feb 2026 00:00:00 +0000</lastBuildDate><image><url>https://www.ariadnelab.dieei.unict.it/media/sharing.png</url><title>Ariadne Lab</title><link>https://www.ariadnelab.dieei.unict.it/</link></image><item><title>Network Robustness and Resilience</title><link>https://www.ariadnelab.dieei.unict.it/research/robustness/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/research/robustness/</guid><description>&lt;h2 id="research-focus"&gt;Research focus&lt;/h2&gt;
&lt;p&gt;Failures and targeted interventions can change the connectivity and function of
a complex system. We study theoretical and computational methods for describing
that response, with particular attention to network dismantling: identifying a
small set of nodes or edges whose removal fragments a network.&lt;/p&gt;
&lt;p&gt;This work includes comparisons of dismantling methods, machine-learning
approaches to structural intervention and indicators that anticipate network
disintegration.&lt;/p&gt;
&lt;h2 id="selected-publications"&gt;Selected publications&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/artime-2024-robustness/"&gt;Robustness and resilience of complex networks&lt;/a&gt;, &lt;em&gt;Nature Reviews Physics&lt;/em&gt; (2024)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-machine/"&gt;Machine learning dismantling and early-warning signals of disintegration in complex systems&lt;/a&gt;, &lt;em&gt;Nature Communications&lt;/em&gt; (2021)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2025-latent/"&gt;Latent Geometry-Driven Network Automata for Complex Network Dismantling&lt;/a&gt;, &lt;em&gt;ICLR&lt;/em&gt; (2026)&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="code-and-data"&gt;Code and data&lt;/h2&gt;
&lt;p&gt;The &lt;a href="https://www.ariadnelab.dieei.unict.it/docs/network-dismantling-review/"&gt;network dismantling review resource&lt;/a&gt;
collects implementations, benchmark networks and reproducibility material
associated with the 2024 review.&lt;/p&gt;</description></item><item><title>Multilayer Networks and Mesoscale Structure</title><link>https://www.ariadnelab.dieei.unict.it/research/multilayer-networks/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/research/multilayer-networks/</guid><description>&lt;h2 id="research-focus"&gt;Research focus&lt;/h2&gt;
&lt;p&gt;Many systems contain several kinds of interaction and organise themselves at
scales between individual nodes and the network as a whole. Multilayer models
keep different relations distinct; community-detection and flow-based methods
help reveal the resulting mesoscale organisation.&lt;/p&gt;
&lt;p&gt;Our work has examined the community structure of multilayer systems, molecular
networks, international trade and global value chains. The common question is
which structural information is lost when heterogeneous relations are reduced
to a single graph.&lt;/p&gt;
&lt;h2 id="molecular-networks-and-biological-function"&gt;Molecular networks and biological function&lt;/h2&gt;
&lt;p&gt;Our study of the human proteome, with Giuseppe Jurman and Manlio De Domenico,
keeps molecular interaction layers separate when identifying functional modules with Multiplex
Infomap. Its random walker follows the links of its current layer and, with a
probability called the relax rate, the links of any layer, which lets it move
between layers. An information-theoretic criterion selects this rate.&lt;/p&gt;
&lt;p&gt;Comparing the resulting modules with independently annotated gene sets assesses
their biological relevance. The selected multilayer organisation has greater
functional content than modules obtained from the aggregate representation,
connecting a modelling choice to an external biological assessment.&lt;/p&gt;
&lt;h2 id="selected-publications"&gt;Selected publications&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/alves-2019-nested/"&gt;The nested structural organization of the worldwide trade multi-layer network&lt;/a&gt;, &lt;em&gt;Scientific Reports&lt;/em&gt; (2019)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/amelio-2019-modularity/"&gt;Modularity in multilayer networks using redundancy-based resolution and projection-based inter-layer coupling&lt;/a&gt;, &lt;em&gt;IEEE Transactions on Network Science and Engineering&lt;/em&gt; (2019)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/mangioni-2018-multilayer/"&gt;Multilayer flows in molecular networks identify biological modules in the human proteome&lt;/a&gt;, &lt;em&gt;IEEE Transactions on Network Science and Engineering&lt;/em&gt; (2020)&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Learning on Graphs</title><link>https://www.ariadnelab.dieei.unict.it/research/graph-ai/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/research/graph-ai/</guid><description>&lt;h2 id="research-focus"&gt;Research focus&lt;/h2&gt;
&lt;p&gt;Graph data are rarely homogeneous. Relations may be weighted, signed, organised
in layers or observed only indirectly. We study learning methods that preserve
and exploit this structure rather than flattening it before analysis.&lt;/p&gt;
&lt;p&gt;This line includes graph neural networks for non-standard graph structures,
link prediction, graph generation and methods for evaluating or interpreting
learned network representations. Besides predictive performance, we look for
models whose assumptions and outputs can be related back to network structure.&lt;/p&gt;
&lt;h2 id="selected-publications"&gt;Selected publications&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2022-wsgat/"&gt;wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction&lt;/a&gt;, &lt;em&gt;Complex Networks&lt;/em&gt; (2021)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-mgnn/"&gt;mGNN: Generalizing the Graph Neural Networks to the Multilayer Case&lt;/a&gt;, &lt;em&gt;arXiv preprint&lt;/em&gt; (2021)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/romano-2025-beyond/"&gt;Beyond MMD: Evaluating Graph Generative Models with Geometric Deep Learning&lt;/a&gt;, &lt;em&gt;arXiv preprint&lt;/em&gt; (2025)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/romano-2026-protoguide/"&gt;ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation&lt;/a&gt;, &lt;em&gt;arXiv preprint&lt;/em&gt; (2026)&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Graph Algorithms and Combinatorial Optimisation</title><link>https://www.ariadnelab.dieei.unict.it/research/graph-optimisation/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/research/graph-optimisation/</guid><description>&lt;h2 id="research-focus"&gt;Research focus&lt;/h2&gt;
&lt;p&gt;Many questions about complex networks lead to computationally difficult graph
problems. We investigate hybrid approaches in which a solver stays in charge
and learning helps it decide where to search, which elements to prune or which
intervention to evaluate next.&lt;/p&gt;
&lt;p&gt;Our papers cover search-space reduction for maximum-clique
problems and node- or edge-based network dismantling. Across these settings, we
are interested in scalability, comparison against strong algorithmic baselines
and what the learned strategy reveals about the structure of the problem.&lt;/p&gt;
&lt;h2 id="selected-publications"&gt;Selected publications&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/lauri-2023/"&gt;Learning fine-grained search space pruning and heuristics for combinatorial optimization&lt;/a&gt;, &lt;em&gt;Journal of Heuristics&lt;/em&gt; (2023)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2024-geometric/"&gt;Geometric deep learning sub-network extraction for maximum clique enumeration&lt;/a&gt;, &lt;em&gt;PLOS ONE&lt;/em&gt; (2024)&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2024-edge/"&gt;Edge Dismantling with Geometric Reinforcement Learning&lt;/a&gt;, &lt;em&gt;Complex Networks&lt;/em&gt; (2024)&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Mediterranean School of Complex Networks</title><link>https://www.ariadnelab.dieei.unict.it/mscx/</link><pubDate>Sat, 17 Oct 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/mscx/</guid><description>&lt;p&gt;The school brings lecturers and PhD students together for a week of lectures,
invited talks and participants&amp;rsquo; flash talks on the theory and applications of
complex networks. In 2022 it merged with ISI&amp;amp;DCN, the school the lab organised
at the University of Catania in 2018 and 2020, whose organisers joined the
MSCX directors.&lt;/p&gt;
&lt;p&gt;The first six editions, from 2014 to 2019, were held on Salina and directed by
Alex Arenas and Manlio De Domenico. There is no 2026 edition: the school is
taking a year to rework its programme and returns in 2027.&lt;/p&gt;</description></item><item><title>Food Connections: Data and Simulation Tools</title><link>https://www.ariadnelab.dieei.unict.it/docs/food-connections/</link><pubDate>Fri, 09 Oct 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/docs/food-connections/</guid><description>&lt;h2 id="about-the-resource"&gt;About the resource&lt;/h2&gt;
&lt;p&gt;Food Connections studies how international trade and the rules governing it
relate to food and nutrition security and environmental sustainability.
The project portal brings together materials and results, with entry points
to data, simulation code and an early-warning application.&lt;/p&gt;
&lt;h2 id="use-the-resource"&gt;Use the resource&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://foodconnections.pages.dev/" target="_blank" rel="noopener"&gt;Visit the Food Connections portal&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Consult the linked resources for documentation, data provenance and citation
requirements.&lt;/p&gt;</description></item><item><title>What a generated graph should preserve</title><link>https://www.ariadnelab.dieei.unict.it/highlights/graph-generation/</link><pubDate>Mon, 14 Sep 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/highlights/graph-generation/</guid><description>&lt;p&gt;Generating graphs with plausible summary statistics does not guarantee that
they retain the structural characteristics of a real network domain. Our work
examines both how to evaluate this correspondence and how to guide generation
towards a specified class of networks.&lt;/p&gt;
&lt;p&gt;Beyond MMD introduces representation-aware evaluation using geometric deep
learning. Its comparison of graph generators shows that agreement on selected
topological statistics can coexist with a loss of the structural features
that distinguish graph domains.&lt;/p&gt;
&lt;p&gt;ProtoGuide uses a learned graph representation and target-class prototypes to
guide a frozen discrete graph generator. The guidance can be retargeted by
changing the prototype without retraining the generator. Experiments with two
generative backbones show improved target-class fidelity, with effects on
coverage and diversity that vary across classes and settings.&lt;/p&gt;
&lt;p&gt;Both selected papers are preprints. Together they address a common question:
what should a generated network preserve beyond a small set of summary statistics?&lt;/p&gt;</description></item><item><title>A digital twin should make a risky claim</title><link>https://www.ariadnelab.dieei.unict.it/publication/dedomenico-2026-digital/</link><pubDate>Fri, 11 Sep 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/dedomenico-2026-digital/</guid><description/></item><item><title>Graph-Based Analysis of Attentional Fidelity in Brain-To-Image Reconstruction</title><link>https://www.ariadnelab.dieei.unict.it/publication/moradi-2026-graph/</link><pubDate>Tue, 01 Sep 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/moradi-2026-graph/</guid><description/></item><item><title>Unveiling core-collapse supernova progenitors: characterization and physical insights through explainable artificial intelligence</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2026-unveiling/</link><pubDate>Mon, 06 Jul 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2026-unveiling/</guid><description/></item><item><title>Brain-Grasp: Graph-Based Saliency Priors for Improved FMRI-Based Visual Brain Decoding</title><link>https://www.ariadnelab.dieei.unict.it/publication/moradi-2026-brain/</link><pubDate>Sun, 03 May 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/moradi-2026-brain/</guid><description/></item><item><title>From brain signals to meaningful networks</title><link>https://www.ariadnelab.dieei.unict.it/highlights/functional-connectomes/</link><pubDate>Thu, 09 Apr 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/highlights/functional-connectomes/</guid><description>&lt;p&gt;How can we reconstruct informative networks when we observe the activity of
individual brain regions? Our work examines which collective patterns of
co-activation carry useful information about subjects and conditions.&lt;/p&gt;
&lt;p&gt;Functional brain networks reconstructed from fMRI usually rely on statistical
pruning: each correlation between two regions of interest is thresholded
independently, ignoring collective co-activation patterns within
sub-networks. Functional pruning instead retains connections for their
collective importance in distinguishing healthy from affected individuals.&lt;/p&gt;
&lt;p&gt;We build multilayer network representations from a multi-frequency
decomposition of the signals, learn them with geometric deep learning, and
use an explainable-AI tool to identify the most discriminative sub-networks.&lt;/p&gt;</description></item><item><title>Machine-enhanced reconstruction of functional connectomes unravels discriminative brain sub-systems in health and disease</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2026-machine/</link><pubDate>Thu, 09 Apr 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2026-machine/</guid><description/></item><item><title>LLMsFold: Integrating Large Language Models and Biophysical Simulations for De Novo Drug Design</title><link>https://www.ariadnelab.dieei.unict.it/publication/widuranga-2026-llmsfold/</link><pubDate>Wed, 04 Mar 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/widuranga-2026-llmsfold/</guid><description/></item><item><title>Contact</title><link>https://www.ariadnelab.dieei.unict.it/contact/</link><pubDate>Fri, 27 Feb 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/contact/</guid><description>&lt;p&gt;Looking for a thesis? Start from &lt;a href="https://www.ariadnelab.dieei.unict.it/thesis/"&gt;Thesis projects&lt;/a&gt;, with the open
areas and the steps to follow. The other researchers&amp;rsquo; contacts are on the
&lt;a href="https://www.ariadnelab.dieei.unict.it/people/"&gt;People&lt;/a&gt; page.&lt;/p&gt;</description></item><item><title>Influence of the reinsertion algorithm on the performance of the Vertex Entanglement method</title><link>https://www.ariadnelab.dieei.unict.it/publication/ghavasieh-2026-influence/</link><pubDate>Wed, 07 Jan 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/ghavasieh-2026-influence/</guid><description/></item><item><title>ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation</title><link>https://www.ariadnelab.dieei.unict.it/publication/romano-2026-protoguide/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/romano-2026-protoguide/</guid><description/></item><item><title>Graph-Based Evaluation of Visual Brain Decoding from fMRI Data</title><link>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-graph/</link><pubDate>Mon, 08 Dec 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-graph/</guid><description/></item><item><title>Latent Geometry-Driven Network Automata for Complex Network Dismantling</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2025-latent/</link><pubDate>Mon, 08 Dec 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2025-latent/</guid><description/></item><item><title>Understanding network robustness</title><link>https://www.ariadnelab.dieei.unict.it/highlights/network-dismantling/</link><pubDate>Mon, 08 Dec 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/highlights/network-dismantling/</guid><description>&lt;p&gt;Local failures can propagate through a network, changing its structure and
function. Understanding robustness and resilience means asking how much
disruption a system can withstand, how it responds and which interventions
can reduce the impact.&lt;/p&gt;
&lt;p&gt;Our review in &lt;em&gt;Nature Reviews Physics&lt;/em&gt; (2024) brings together theoretical
and computational approaches to these questions, including the design of
robust networks, early-warning signals and adaptive responses. It also
compares dismantling techniques and provides ready-to-use scripts.&lt;/p&gt;
&lt;p&gt;Network dismantling probes structural vulnerability by finding a small
set of units whose removal fragments a network. Finding a minimum set is
computationally challenging (NP-hard), so practical approaches often rely
on heuristics.&lt;/p&gt;
&lt;p&gt;A machine trained to dismantle relatively small systems identifies
higher-order topological patterns and disintegrates large-scale social,
infrastructural and technological networks more efficiently than human-based
heuristics. It also assesses the probability that the next attacks will
disintegrate the system, a quantitative early-warning signal of collapse
(&lt;em&gt;Nature Communications&lt;/em&gt;, 2021).&lt;/p&gt;
&lt;p&gt;Latent Geometry-Driven Network Automata use local rules to approximate
effective link distances and outperform existing dismantling algorithms,
validated on 1,475 real-world networks across 32 domains (ICLR 2026).&lt;/p&gt;</description></item><item><title>How Well is Human Attention Preserved in fMRI-Based VisualBrain Decoding?</title><link>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-fmri/</link><pubDate>Mon, 06 Oct 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-fmri/</guid><description/></item><item><title>What is Wrong with Visual Brain Decoding? A Saliency-based Investigation</title><link>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-whatiswrong/</link><pubDate>Mon, 30 Jun 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-whatiswrong/</guid><description/></item><item><title>Machine Learning Supernovae’s Progenitor Characterization</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2025-mlsupernovae/</link><pubDate>Wed, 12 Mar 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2025-mlsupernovae/</guid><description/></item><item><title>Beyond MMD: Evaluating Graph Generative Models with Geometric Deep Learning</title><link>https://www.ariadnelab.dieei.unict.it/publication/romano-2025-beyond/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/romano-2025-beyond/</guid><description/></item><item><title>Saliency Matters: From Nodes to Objects</title><link>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-saliency/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/moradi-2025-saliency/</guid><description/></item><item><title>Geometric Deep Learning sub-network extraction for Maximum Clique Enumeration</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2024-geometric/</link><pubDate>Tue, 16 Jan 2024 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2024-geometric/</guid><description/></item><item><title>Network Dismantling Review: Code and Data</title><link>https://www.ariadnelab.dieei.unict.it/docs/network-dismantling-review/</link><pubDate>Mon, 08 Jan 2024 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/docs/network-dismantling-review/</guid><description>&lt;h2 id="about-the-resource"&gt;About the resource&lt;/h2&gt;
&lt;p&gt;This repository accompanies the review:&lt;/p&gt;
&lt;blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"&gt;
&lt;p&gt;O. Artime, M. Grassia, M. De Domenico, J. P. Gleeson, H. A. Makse,
G. Mangioni, M. Perc, and F. Radicchi. &lt;em&gt;Robustness and resilience of
complex networks&lt;/em&gt;. Nature Reviews Physics 6, 114–131 (2024).&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;It brings together implementations and wrappers for network dismantling
methods, benchmark networks used in the review and scripts for reproducing
comparative results. Network dismantling studies how removing selected nodes
or edges changes the connectivity of a network.&lt;/p&gt;
&lt;h2 id="use-the-resource"&gt;Use the resource&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/NetworkDismantling/review" target="_blank" rel="noopener"&gt;Browse the repository&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://doi.org/10.1038/s42254-023-00676-y" target="_blank" rel="noopener"&gt;Read the research article&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://github.com/NetworkDismantling/review/blob/main/dataset/README.md" target="_blank" rel="noopener"&gt;Consult dataset sources and citation requirements&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Installation and execution instructions are maintained in the repository so
that they remain aligned with the code.&lt;/p&gt;
&lt;h2 id="citation-and-licence"&gt;Citation and licence&lt;/h2&gt;
&lt;p&gt;Please cite the review and the original publications for any individual
algorithm used. Code produced for the review is released under GPLv3;
individual algorithm wrappers can retain the licences of their original
implementations. Consult the repository before redistribution or reuse.&lt;/p&gt;</description></item><item><title>Robustness and resilience of complex networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/artime-2024-robustness/</link><pubDate>Mon, 08 Jan 2024 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/artime-2024-robustness/</guid><description/></item><item><title>Edge Dismantling with Geometric Reinforcement Learning</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2024-edge/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2024-edge/</guid><description/></item><item><title>Regionalisation and cross-region integration. Twin dynamics in the automotive international trade networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/russo-2023-regionalisation/</link><pubDate>Fri, 01 Dec 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/russo-2023-regionalisation/</guid><description/></item><item><title>The layered structure of global trade</title><link>https://www.ariadnelab.dieei.unict.it/highlights/trade-networks/</link><pubDate>Fri, 01 Dec 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/highlights/trade-networks/</guid><description>&lt;p&gt;International trade connects countries through different commodities and
industries. Keeping those relations separate reveals structures that an
aggregate trade network can obscure, from commodity-specific communities to
interactions within and across production sectors.&lt;/p&gt;
&lt;p&gt;Our studies examine the multilayer organisation of global value chains,
communities in food trade, and regionalisation and cross-region integration
in automotive trade. These perspectives describe how trading relationships
are organised at several scales.&lt;/p&gt;
&lt;p&gt;Network-based simulations also examine how shocks to domestic food production
propagate through international trade. They show that exposure to external
shocks and protection against domestic shortages differ across countries.
The structure of trade therefore matters when assessing food-security risks.&lt;/p&gt;
&lt;p&gt;The &lt;a href="https://www.ariadnelab.dieei.unict.it/docs/food-connections/"&gt;Food Connections resource page&lt;/a&gt; links to project
materials, data and simulation tools on trade and food and nutrition security.&lt;/p&gt;</description></item><item><title>Efficient Node PageRank Improvement via Link-building using Geometric Deep Learning</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2023-efficient/</link><pubDate>Fri, 30 Jun 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2023-efficient/</guid><description/></item><item><title>Learning fine-grained search space pruning and heuristics for combinatorial optimization</title><link>https://www.ariadnelab.dieei.unict.it/publication/lauri-2023/</link><pubDate>Thu, 01 Jun 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/lauri-2023/</guid><description/></item><item><title>Complex Networks XIII: Proceedings of the 13th Conference on Complex Networks, CompleNet 2022</title><link>https://www.ariadnelab.dieei.unict.it/publication/pacheco-2023-complex/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/pacheco-2023-complex/</guid><description/></item><item><title>Complex Networks XIV: Proceedings of the 14th Conference on Complex Networks, CompleNet 2023</title><link>https://www.ariadnelab.dieei.unict.it/publication/teixeira-2023-complex/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/teixeira-2023-complex/</guid><description/></item><item><title>CoreGDM: Geometric Deep Learning Network Decycling and Dismantling</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2023-coregdm/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2023-coregdm/</guid><description/></item><item><title>CoreGDM: Network Decycling and Dismantling</title><link>https://www.ariadnelab.dieei.unict.it/docs/coregdm/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/docs/coregdm/</guid><description>&lt;h2 id="about-the-resource"&gt;About the resource&lt;/h2&gt;
&lt;p&gt;CoreGDM was introduced in:&lt;/p&gt;
&lt;blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"&gt;
&lt;p&gt;M. Grassia and G. Mangioni. &lt;em&gt;CoreGDM: Geometric Deep Learning Network
Decycling and Dismantling&lt;/em&gt;. Complex Networks XIV (2023).&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;It merges the &lt;a href="https://www.ariadnelab.dieei.unict.it/docs/gdm/"&gt;GDM&lt;/a&gt; framework with the CoreHD algorithm: it
attacks the 2-core of the network, using a learned score in place of the node
degree.&lt;/p&gt;
&lt;h2 id="use-the-resource"&gt;Use the resource&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/NetworkDismantling/review/tree/main/network_dismantling/CoreGDM" target="_blank" rel="noopener"&gt;Browse the implementation&lt;/a&gt;
in the &lt;a href="https://www.ariadnelab.dieei.unict.it/docs/network-dismantling-review/"&gt;Network Dismantling review package&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2023-coregdm/"&gt;Read the research article&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The &lt;a href="https://github.com/NetworkScienceLab/CoreGDM" target="_blank" rel="noopener"&gt;CoreGDM repository&lt;/a&gt; points
to the review package for now; the stand-alone code is not published yet.&lt;/p&gt;
&lt;h2 id="citation-and-licence"&gt;Citation and licence&lt;/h2&gt;
&lt;p&gt;Please cite the paper. The code is released under GPLv3.&lt;/p&gt;</description></item><item><title>Correlation Between Researchers’ Centrality and H-Index: A Case Study</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-correlation/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-correlation/</guid><description/></item><item><title>Geometric Deep Learning Graph Pruning to Speed-Up the Run-Time of Maximum Clique Enumerarion Algorithms</title><link>https://www.ariadnelab.dieei.unict.it/publication/arciprete-2023-geometric/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/arciprete-2023-geometric/</guid><description/></item><item><title>Editorial: Scalable Network Generation &amp; Analysis</title><link>https://www.ariadnelab.dieei.unict.it/publication/giabbanelli-2022-editorial/</link><pubDate>Mon, 25 Jul 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/giabbanelli-2022-editorial/</guid><description/></item><item><title>Co-Authorship Networks Analysis to Discover Collaboration Patterns among Italian Researchers</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-co/</link><pubDate>Thu, 16 Jun 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-co/</guid><description/></item><item><title>The rise and fall of countries in the global value chains</title><link>https://www.ariadnelab.dieei.unict.it/publication/alves-2022-rise/</link><pubDate>Tue, 31 May 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/alves-2022-rise/</guid><description/></item><item><title>Insights into countries’ exposure and vulnerability to food trade shocks from network-based simulations</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2022-insights/</link><pubDate>Thu, 17 Mar 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2022-insights/</guid><description/></item><item><title>Link Prediction in Time Varying Social Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-link/</link><pubDate>Tue, 01 Mar 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-link/</guid><description/></item><item><title>Analysis of the Co-authorship Sub-networks of Italian Academic Researchers</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-analysis/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-analysis/</guid><description/></item><item><title>Automotive Value Chains in a Brave New World</title><link>https://www.ariadnelab.dieei.unict.it/publication/russo-2022-automotive/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/russo-2022-automotive/</guid><description/></item><item><title>Network Topology to Predict Bibliometrics Indices: A Case Study</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-network/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-network/</guid><description/></item><item><title>Preliminary Characterization of Italian Academic Scholars by Their Bibliometrics</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-preliminary/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2022-preliminary/</guid><description/></item><item><title>Relations Between Entropy and Accuracy Trends in Complex Artificial Neural Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/cavallaro-2022-relations/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/cavallaro-2022-relations/</guid><description/></item><item><title>The Changing Shape of the World Automobile Industry: A Multilayer Network Analysis of International Trade in Components and Parts</title><link>https://www.ariadnelab.dieei.unict.it/publication/russo-2022-changing/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/russo-2022-changing/</guid><description/></item><item><title>wsGAT: Weighted and Signed Graph Attention</title><link>https://www.ariadnelab.dieei.unict.it/docs/wsgat/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/docs/wsgat/</guid><description>&lt;h2 id="about-the-resource"&gt;About the resource&lt;/h2&gt;
&lt;p&gt;This repository accompanies the paper:&lt;/p&gt;
&lt;blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"&gt;
&lt;p&gt;M. Grassia and G. Mangioni. &lt;em&gt;wsGAT: Weighted and Signed Graph Attention
Networks for Link Prediction&lt;/em&gt;. Complex Networks &amp;amp; Their Applications X
(2022).&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;wsGAT extends the Graph Attention Network (GAT) layer to graphs whose links
carry a weight and a sign, such as trust and correlation networks. The paper
uses it to predict the weight, the sign and the existence of links.&lt;/p&gt;
&lt;h2 id="use-the-resource"&gt;Use the resource&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/NetworkScienceLab/wsGAT" target="_blank" rel="noopener"&gt;Browse the repository&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2022-wsgat/"&gt;Read the research article&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The repository contains the layer, &lt;code&gt;wsGATConv&lt;/code&gt;, written for PyTorch
Geometric.&lt;/p&gt;
&lt;h2 id="citation-and-licence"&gt;Citation and licence&lt;/h2&gt;
&lt;p&gt;Please cite the paper. The code is released under GPLv3.&lt;/p&gt;</description></item><item><title>wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2022-wsgat/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2022-wsgat/</guid><description/></item><item><title>(Unintended) Consequences of export restrictions on medical goods during the Covid-19 pandemic</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-unintended/</link><pubDate>Mon, 20 Dec 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-unintended/</guid><description/></item><item><title>GDM: Graph Dismantling with Machine Learning</title><link>https://www.ariadnelab.dieei.unict.it/docs/gdm/</link><pubDate>Tue, 31 Aug 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/docs/gdm/</guid><description>&lt;h2 id="about-the-resource"&gt;About the resource&lt;/h2&gt;
&lt;p&gt;This repository accompanies the paper:&lt;/p&gt;
&lt;blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"&gt;
&lt;p&gt;M. Grassia, M. De Domenico, and G. Mangioni. &lt;em&gt;Machine learning dismantling
and early-warning signals of disintegration in complex systems&lt;/em&gt;. Nature
Communications 12, 5190 (2021).&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;A graph neural network trained to dismantle small synthetic networks is used
to attack large real-world ones, and its predictions give an early-warning
signal of the network&amp;rsquo;s collapse. The repository holds the scripts, the
networks used for training and testing, and the pre-trained models.&lt;/p&gt;
&lt;h2 id="use-the-resource"&gt;Use the resource&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://github.com/NetworkScienceLab/GDM" target="_blank" rel="noopener"&gt;Browse the repository&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-machine/"&gt;Read the research article&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://github.com/NetworkScienceLab/GDM/tree/master/dataset" target="_blank" rel="noopener"&gt;Consult the dataset&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Setup and reproduction instructions are in the repository. Only part of the
real-world test networks is included, because the original data come under
different licences.&lt;/p&gt;
&lt;h2 id="citation-and-licence"&gt;Citation and licence&lt;/h2&gt;
&lt;p&gt;Please cite the paper, and the archived release when you use the code. The
code is released under GPLv3.&lt;/p&gt;</description></item><item><title>Machine learning dismantling and early-warning signals of disintegration in complex systems</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-machine/</link><pubDate>Tue, 31 Aug 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-machine/</guid><description/></item><item><title>Mutual Influence of Users Credibility and News Spreading in Online Social Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-mutual/</link><pubDate>Sun, 25 Apr 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-mutual/</guid><description/></item><item><title>A Network-Based Analysis of a Worksite Canteen Dataset</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-network/</link><pubDate>Mon, 08 Mar 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-network/</guid><description/></item><item><title>Food Recommendation in a Worksite Canteen</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-food/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-food/</guid><description/></item><item><title>mGNN: Generalizing the Graph Neural Networks to the Multilayer Case</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-mgnn/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2021-mgnn/</guid><description/></item><item><title>Wind Farms Maintenance Optimization Using a Pickup and Delivery VRP Algorithm</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-wind/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2021-wind/</guid><description/></item><item><title>A network-based analysis to understand food-habits of a multi-company canteen's customers</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-network/</link><pubDate>Mon, 30 Nov 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-network/</guid><description/></item><item><title>Pick-up &amp; Deliver in Maintenance Management of Renewable Energy Power Plants</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-pick/</link><pubDate>Sat, 26 Sep 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-pick/</guid><description/></item><item><title>Modularity in Multilayer Networks Using Redundancy-Based Resolution and Projection-Based Inter-Layer Coupling</title><link>https://www.ariadnelab.dieei.unict.it/publication/amelio-2019-modularity/</link><pubDate>Wed, 01 Jul 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/amelio-2019-modularity/</guid><description/></item><item><title>Complex Networks XI: Proceedings of the 11th Conference on Complex Networks CompleNet 2020</title><link>https://www.ariadnelab.dieei.unict.it/publication/barbosa-2020-complex/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/barbosa-2020-complex/</guid><description/></item><item><title>Credibility-based Model for News Spreading on Online Social Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-credibility/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-credibility/</guid><description/></item><item><title>Group Cohesion Assessment in Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-group/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-group/</guid><description/></item><item><title>Multilayer Flows in Molecular Networks Identify Biological Modules in the Human Proteome</title><link>https://www.ariadnelab.dieei.unict.it/publication/mangioni-2018-multilayer/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/mangioni-2018-multilayer/</guid><description/></item><item><title>Preface</title><link>https://www.ariadnelab.dieei.unict.it/publication/barbosa-2020-v/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/barbosa-2020-v/</guid><description/></item><item><title>Smart Topic Sharing in IoT Platform Based on a Social Inspired Broker</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-smart/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-smart/</guid><description/></item><item><title>Strategies Comparison in Link Building Problem</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-strategies/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2020-strategies/</guid><description/></item><item><title>Network robustness improvement via long-range links</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-network/</link><pubDate>Sun, 01 Dec 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-network/</guid><description/></item><item><title>The nested structural organization of the worldwide trade multi-layer network</title><link>https://www.ariadnelab.dieei.unict.it/publication/alves-2019-nested/</link><pubDate>Wed, 27 Feb 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/alves-2019-nested/</guid><description/></item><item><title>A PageRank Inspired Approach to Measure Network Cohesiveness</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-pagerank/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-pagerank/</guid><description/></item><item><title>A Social Inspired Broker for M2M Protocols</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-social/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-social/</guid><description/></item><item><title>Learning Multi-Stage Sparsification for Maximum Clique Enumeration</title><link>https://www.ariadnelab.dieei.unict.it/publication/grassia-2019-learning/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/grassia-2019-learning/</guid><description/></item><item><title>Long distance connections for ranking and robustness enhancement in networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-long/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-long/</guid><description/></item><item><title>Managing Privacy in a Social Broker Internet of Thing</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-managing/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2019-managing/</guid><description/></item><item><title>Unfolding the Complexity of the Global Value Chain: Strength and Entropy in the Single-Layer, Multiplex, and Multi-Layer International Trade Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/alves-2018-unfolding/</link><pubDate>Wed, 28 Nov 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/alves-2018-unfolding/</guid><description/></item><item><title>Identifying the community structure of the food-trade international multi-network</title><link>https://www.ariadnelab.dieei.unict.it/publication/torreggiani-2018-identifying/</link><pubDate>Thu, 10 May 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/torreggiani-2018-identifying/</guid><description/></item><item><title>Black hole metric: Overcoming the pagerank normalization problem</title><link>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2018-black/</link><pubDate>Sun, 01 Apr 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2018-black/</guid><description/></item><item><title>A Trust-Based News Spreading Model</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-trust/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-trust/</guid><description/></item><item><title>Climbing Ranking Position via Long-Distance Backlinks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-climbing/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-climbing/</guid><description/></item><item><title>Exploiting Long Distance Connections to Strengthen Network Robustness</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-exploiting/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-exploiting/</guid><description/></item><item><title>Introducing Credibility to Model News Spreading</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-introducing/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-introducing/</guid><description/></item><item><title>Long Distance In-Links for Ranking Enhancement</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-long/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-long/</guid><description/></item><item><title>Post Sharing-Based Credibility Network for Social Network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-post/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-post/</guid><description/></item><item><title>Terrorism and War: Twitter Cascade Analysis</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-terrorism/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2018-terrorism/</guid><description/></item><item><title>Direct trust assignment using social reputation and aging</title><link>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2017-direct/</link><pubDate>Sat, 01 Apr 2017 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2017-direct/</guid><description/></item><item><title>Dealing with the Best Attachment Problem via Heuristics</title><link>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2017-dealing/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2017-dealing/</guid><description/></item><item><title>Evaluating the community partition quality of a network with a genetic programming approach</title><link>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2017-evaluating/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2017-evaluating/</guid><description/></item><item><title>Network size and topology impact on trust-based ranking</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2017-network/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2017-network/</guid><description/></item><item><title>Social-Based Arcs Weight Assignment in Trust Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2016-social/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/buzzanca-2016-social/</guid><description/></item><item><title>Tourism Websites Network: Crawling the Italian Webspace</title><link>https://www.ariadnelab.dieei.unict.it/publication/longheu-2016-tourism/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/longheu-2016-tourism/</guid><description/></item><item><title>Multisource agent-based healthcare data gathering</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-multisource/</link><pubDate>Sun, 11 Oct 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-multisource/</guid><description/></item><item><title>Searching for experts in a context-aware recommendation network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-searching/</link><pubDate>Thu, 01 Oct 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-searching/</guid><description/></item><item><title>Complex Networks VI: Proceedings of the 6th Workshop on Complex Networks CompleNet 2015</title><link>https://www.ariadnelab.dieei.unict.it/publication/mangioni-2015-complex/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/mangioni-2015-complex/</guid><description/></item><item><title>CORSA: An Open Solution for Social Oriented Real-time Ride Sharing</title><link>https://www.ariadnelab.dieei.unict.it/publication/bonarrigo-2015-corsa/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/bonarrigo-2015-corsa/</guid><description/></item><item><title>In Complex Networks VI</title><link>https://www.ariadnelab.dieei.unict.it/publication/oliveira-2015-complex/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/oliveira-2015-complex/</guid><description/></item><item><title>The cost of trust in the dynamics of best attachment</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-cost/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-cost/</guid><description/></item><item><title>The Effect of Topology on the Attachment Process in Trust Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-effect/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2015-effect/</guid><description/></item><item><title>Social system as complex networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/ghoshal-2014-social/</link><pubDate>Mon, 01 Dec 2014 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/ghoshal-2014-social/</guid><description/></item><item><title>An Intelligent and Pervasive Surveillance System for Home Security</title><link>https://www.ariadnelab.dieei.unict.it/publication/longheu-2012-intelligent/</link><pubDate>Sat, 20 Sep 2014 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/longheu-2012-intelligent/</guid><description/></item><item><title>Virtualization for Effective Risk-Free Network Security Assessment</title><link>https://www.ariadnelab.dieei.unict.it/publication/longheu-2014-virtualization/</link><pubDate>Sat, 13 Sep 2014 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/longheu-2014-virtualization/</guid><description/></item><item><title>A Carpooling Open Application with Social Oriented Reward Mechanism</title><link>https://www.ariadnelab.dieei.unict.it/publication/bonarrigo-2014-carpooling/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/bonarrigo-2014-carpooling/</guid><description/></item><item><title>A Heuristic to Explore Trust Networks Dynamics</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2014-heuristic/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2014-heuristic/</guid><description/></item><item><title>Connecting relatives in virtual worlds: The kinship networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-connecting/</link><pubDate>Sun, 01 Sep 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-connecting/</guid><description/></item><item><title>A Growing Model for Scale–Free Networks Embedded in Hyperbolic Metric Spaces</title><link>https://www.ariadnelab.dieei.unict.it/publication/mangioni-2013-growing/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/mangioni-2013-growing/</guid><description/></item><item><title>Complex Networks IV</title><link>https://www.ariadnelab.dieei.unict.it/publication/ghoshal-2013-complex/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/ghoshal-2013-complex/</guid><description/></item><item><title>Crafting Kinship Networks by Exploring Acquaintances Relationships</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-crafting/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-crafting/</guid><description/></item><item><title>The Effects of Pre-trusted Peers Misbehaviour on EigenTrust</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-effects/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-effects/</guid><description/></item><item><title>The Relevance of Context in Trust Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-relevance/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-relevance/</guid><description/></item><item><title>Users' attachment in trust networks: reputation vs. effort</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-users/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2013-users/</guid><description/></item><item><title>Trust assessment: a personalized, distributed, and secure approach</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2012-trust/</link><pubDate>Wed, 25 Apr 2012 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2012-trust/</guid><description/></item><item><title>Trust into e-Learning</title><link>https://www.ariadnelab.dieei.unict.it/publication/longheu-2012-trust/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/longheu-2012-trust/</guid><description/></item><item><title>Identifying the community structure of the international-trade multi-network</title><link>https://www.ariadnelab.dieei.unict.it/publication/barigozzi-2011-identifying/</link><pubDate>Wed, 01 Jun 2011 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/barigozzi-2011-identifying/</guid><description/></item><item><title>Communications in Computer and Information Science:Preface</title><link>https://www.ariadnelab.dieei.unict.it/publication/costa-2011-communications/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/costa-2011-communications/</guid><description/></item><item><title>Communities Unfolding in Multislice Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2011-communities/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2011-communities/</guid><description/></item><item><title>Community Structure in the Multi-network of International Trade</title><link>https://www.ariadnelab.dieei.unict.it/publication/barigozzi-2011-community/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/barigozzi-2011-community/</guid><description/></item><item><title>Complex Networks: Second International Workshop, CompleNet 2010, Rio de Janeiro, Brazil, October 13-15, 2010, Revised Selected Papers</title><link>https://www.ariadnelab.dieei.unict.it/publication/costa-2011-complex/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/costa-2011-complex/</guid><description/></item><item><title>Gain the Best Reputation in Trust Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2012-gain/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2012-gain/</guid><description/></item><item><title>Intelligent distributed information systems</title><link>https://www.ariadnelab.dieei.unict.it/publication/badica-2010-intelligent/</link><pubDate>Sat, 01 May 2010 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/badica-2010-intelligent/</guid><description/></item><item><title>An adaptive overlay network inspired by social behaviour</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-adaptive/</link><pubDate>Mon, 01 Mar 2010 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-adaptive/</guid><description/></item><item><title>A Distributed Algorithm for Personalized Trust Evaluation in Social Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-distributed/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-distributed/</guid><description/></item><item><title>Context-based global expertise in recommendation systems</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-context/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-context/</guid><description/></item><item><title>Pervasive Home Security: An Intelligent Domotics Application</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-pervasive/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2010-pervasive/</guid><description/></item><item><title>Effective Classification of Enterprise Reports in Production Assessment</title><link>https://www.ariadnelab.dieei.unict.it/publication/longheu-2009-effective/</link><pubDate>Tue, 01 Dec 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/longheu-2009-effective/</guid><description/></item><item><title>Struggling with misbehaviours in trust systems</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-struggling/</link><pubDate>Tue, 01 Dec 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-struggling/</guid><description/></item><item><title>The effect of malicious peers in a gossip-based reputation system</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-effect/</link><pubDate>Tue, 24 Nov 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-effect/</guid><description/></item><item><title>Advertising and Discovering Trusted Resources within a P2P-Based Architecture</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-advertising/</link><pubDate>Wed, 01 Jul 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-advertising/</guid><description/></item><item><title>Resource advertising in PROSA P2P network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-resource/</link><pubDate>Fri, 01 May 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-resource/</guid><description/></item><item><title>Extending the definition of modularity to directed graphs with overlapping communities</title><link>https://www.ariadnelab.dieei.unict.it/publication/nicosia-2009-extending/</link><pubDate>Mon, 16 Mar 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/nicosia-2009-extending/</guid><description/></item><item><title>Complex Networks: Results of the 2009 International Workshop on Complex Networks (CompleNet 2009)</title><link>https://www.ariadnelab.dieei.unict.it/publication/fortunato-2009-complex/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/fortunato-2009-complex/</guid><description/></item><item><title>Discovering Community Structure on Large Networks Using a Grid Computing Environment</title><link>https://www.ariadnelab.dieei.unict.it/publication/fiumicello-2009-discovering/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/fiumicello-2009-discovering/</guid><description/></item><item><title>Exploiting trust into e-learning: adding reliability to learning paths</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-exploiting/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-exploiting/</guid><description/></item><item><title>Search for overlapped communities by parallel genetic algorithms</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-search/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-search/</guid><description/></item><item><title>The Assessment of Expertise in Social Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-assessment/</link><pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2009-assessment/</guid><description/></item><item><title>Emerging structures of P2P networks induced by social relationships</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-emerging/</link><pubDate>Fri, 01 Feb 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-emerging/</guid><description/></item><item><title>Adaptive E–Learning: An Architecture Based on PROSA P2P Network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-adaptive/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-adaptive/</guid><description/></item><item><title>Applying Social Behaviours to Model Trusting</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-applying/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-applying/</guid><description/></item><item><title>Intelligent Distributed Computing, Systems and Applications: Proceedings of the 2nd International Symposium on Intelligent Distributed Computing: IDC 2008, Catania, Italy, 18-19.09. 2008</title><link>https://www.ariadnelab.dieei.unict.it/publication/badica-2008-intelligent/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/badica-2008-intelligent/</guid><description/></item><item><title>PROSA: P2P Resource Organisation by Social Acquaintances</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-prosa/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-prosa/</guid><description/></item><item><title>Reliable Personalized Learning Paths: The Contribution of Trust to E-Learning</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-reliable/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-reliable/</guid><description/></item><item><title>The dilemma of trust: A social network based approach</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-dilemma/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-dilemma/</guid><description/></item><item><title>Trusting Evaluation by Social Reputation</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-trusting/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2008-trusting/</guid><description/></item><item><title>On robustness and self-adaptiveness of a socially inspired P2P network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-robustness/</link><pubDate>Thu, 01 Nov 2007 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-robustness/</guid><description/></item><item><title>A model for a web-based learning system</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-model/</link><pubDate>Sun, 01 Jul 2007 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-model/</guid><description/></item><item><title>Fast Information Retrieval in a Self–Organising P2P Network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-fast/</link><pubDate>Sun, 01 Jul 2007 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-fast/</guid><description/></item><item><title>An Approach to Trust Based on Social Networks</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-approach/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-approach/</guid><description/></item><item><title>An architecture to support adaptive e-learning</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-architecture/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-architecture/</guid><description/></item><item><title>Efficient Searching and Retrieval of Documents in PROSA</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-efficient/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2007-efficient/</guid><description/></item><item><title>Evaluating the Dynamic Behaviour of PROSA P2P Network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-evaluating/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-evaluating/</guid><description/></item><item><title>Exploiting Social Networks Dynamics for P2P Resource Organisation</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-exploiting/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-exploiting/</guid><description/></item><item><title>Self-Organisation of Resources in PROSA P2P Network</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-self/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-self/</guid><description/></item><item><title>Social Behaviours in P2P Systems: An Efficient Algorithm for Resource Organisation</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-social/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2006-social/</guid><description/></item><item><title>Using web-based personalized learning system in academic context</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2004-using/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2004-using/</guid><description/></item><item><title>A Tool for Performance Evaluation in a Formal Codesign Framework</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-tool/</link><pubDate>Mon, 01 Sep 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-tool/</guid><description/></item><item><title>TTL: a modular language for hardware/software systems design</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-ttl/</link><pubDate>Sat, 01 Mar 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-ttl/</guid><description/></item><item><title>Automatic generation of learning paths</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-automatic/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-automatic/</guid><description/></item><item><title>Courses Modeling in E-learning Context</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-courses-2/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-courses-2/</guid><description/></item><item><title>Courses personalization in an e-learning environment</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-courses/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-courses/</guid><description/></item><item><title>From Specification to Hardware Device: A Synthesis Algorithm</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-specification/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-specification/</guid><description/></item><item><title>Synthesis of LOTOS specification of the IEEE-1394 firewire protocol</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-synthesis/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2003-synthesis/</guid><description/></item><item><title>ESA: an approach to Systems Design by Equation Solving</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2001-esa/</link><pubDate>Mon, 01 Jan 2001 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2001-esa/</guid><description/></item><item><title>Using a Formal Framework for Agent System Design</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2001-using/</link><pubDate>Mon, 01 Jan 2001 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2001-using/</guid><description/></item><item><title>Hardware/software synthesis of formal specifications in codesign of embedded systems</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2000-hardware/</link><pubDate>Sat, 01 Jul 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2000-hardware/</guid><description/></item><item><title>A Method to Implement Information Systems by Reusable Components</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolomethod/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolomethod/</guid><description/></item><item><title>A Simulator for Embedded Systems Design</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolosimulator/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolosimulator/</guid><description/></item><item><title>Algorithmic resolution of LOTOS equations</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2000-algorithmic/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2000-algorithmic/</guid><description/></item><item><title>Complex Networks VI</title><link>https://www.ariadnelab.dieei.unict.it/publication/mangionicomplex/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/mangionicomplex/</guid><description/></item><item><title>Hardware Implementation of Algebraic Specifications</title><link>https://www.ariadnelab.dieei.unict.it/publication/mangionihardware/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/mangionihardware/</guid><description/></item><item><title>IEEE/ACM ASONAM 2020 ASONAM 2020 Program Committee</title><link>https://www.ariadnelab.dieei.unict.it/publication/atzmullerieee/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/atzmullerieee/</guid><description/></item><item><title>Implementing a distributed server using mobile agent technology</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2000-implementing/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-2000-implementing/</guid><description/></item><item><title>Reusing Components in Hardware Design</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchioloreusing/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchioloreusing/</guid><description/></item><item><title>An agent based platform for a service provider</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1998-agent/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1998-agent/</guid><description/></item><item><title>Formal Codesign Methodology with Multistep Partitioning</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1998-formal/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1998-formal/</guid><description/></item><item><title>Synthesis of TTL specification: A case study</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1998-synthesis/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1998-synthesis/</guid><description/></item><item><title>An algorithm for direct synthesis of formal specifications</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1997-algorithm/</link><pubDate>Wed, 01 Jan 1997 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1997-algorithm/</guid><description/></item><item><title>An approach to the synthesis of HW and SW in codesign</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1997-approach/</link><pubDate>Wed, 01 Jan 1997 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1997-approach/</guid><description/></item><item><title>TTL simulator</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1997-ttl/</link><pubDate>Wed, 01 Jan 1997 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1997-ttl/</guid><description/></item><item><title>Decomposition and partitioning in Hardware/Software codesign</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1996-decomposition/</link><pubDate>Mon, 01 Jan 1996 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1996-decomposition/</guid><description/></item><item><title>TTL: A LOTOS extension for system description</title><link>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1996-ttl/</link><pubDate>Mon, 01 Jan 1996 00:00:00 +0000</pubDate><guid>https://www.ariadnelab.dieei.unict.it/publication/carchiolo-1996-ttl/</guid><description/></item></channel></rss>