Flimma: a federated and privacy-aware tool for differential gene expression analysis

Aggregating transcriptomics data across hospitals can increase sensitivity and robustness of differential expression analyses, yielding deeper clinical insights. As data exchange is often restricted by privacy legislation, meta-analyses are frequently employed to pool local results. However, the accuracy might drop if class labels are inhomogeneously distributed among cohorts. Flimma (https://exbio.wzw.tum.de/flimma/) addresses this issue by implementing the state-of-the-art workflow limma voom in a federated manner, i.e., patient data never leaves its source site.

On the filtered polynomial interpolation at Chebyshev nodes

The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vallée Poussin filters. In order to get an optimal approximation in spaces of locally continuous functions equipped with weighted uniform norms, the related Lebesgue constants have to be uniformly bounded. In previous works this has already been proved under different sufficient conditions. Here, we complete the study by stating also the necessary conditions to get it.

Research co-design in protected areas for nature conservation: the ECOPOTENTIAL Project experience

Questa presentazione descrive le conclusioni finali del progetto ECOPOTENTIAL riguardo al coinvolgimento degli stakeholder delle aree protette nel definire e condurre le attività di ricerca a fianco dei ricercatori, illustrando punti di forza e di debolezza, come risultati da un questionario sottoposto ai gestori delle Aree Protette.

Specifying and Analysing Reputation Systems with a Coordination Language

Reputation systems are nowadays widely used to support decision making in networked systems. Parties in such systems rate each other and use shared ratings to compute reputation scores that drive their interactions. The existence of reputation systems with remarkable differences calls for formal approaches to their analysis. We present a verification methodology for reputation systems that is based on the use of the coordination language Klaim and related analysis tools.

Numerical analysis of the dynamics of rigid blocks subjected to support excitation

The dynamic behaviour of rigid blocks subjected to support excitation is represented by discontinuous differential equations with state jumps. In the numerical simulation of these systems, the jump times corresponding to the numerical trajectory do not coincide with the ones of the given problem. When multiple state jumps occur, this approximation may affect the accuracy of the solution and even cause an order reduction in the method. Focus here is on the error behaviour in the numerical dynamic.

Reputation-Based Cooperation in the Clouds

The popularity of the cloud computing paradigm is opening new opportunities for collaborative computing. In this paper we tackle a fundamental problem in open-ended cloud-based distributed computing platforms, i.e., the quest for potential collaborators. We assume that cloud participants are willing to share their computational resources for shared distributed computing problems, but they are not willing to disclose the details of their resources. Lacking such information, we advocate to rely on reputation scores obtained by evaluating the interactions among participants.

Long-time behaviour of the approximate solution to quasi-convolution Volterra equations

The integral representation of some biological phenomena consists in Volterra equations whose kernels involve a convolution term plus a non convolution one. Some significative applications arise in linearised models of cell migration and collective motion, as described in Di Costanzo et al. (Discrete Contin. Dyn. Syst. Ser. B 25 (2020) 443-472), Etchegaray et al. (Integral Methods in Science and Engineering (2015)), Grec et al. (J. Theor. Biol. 452 (2018) 35-46) where the asymptotic behaviour of the analytical solution has been extensively investigated.

Reputation-Based Composition of Social Web Services

Social Web Services (SWSs) constitute a novel paradigm of service-oriented computing, where Web services, just like humans, sign up in social networks that guarantee, e.g., better service discovery for users and faster replacement in case of service failures. In past work, composition of SWSs was mainly supported by specialised social networks of competitor services and cooperating ones. In this work, we continue this line of research, by proposing a novel SWSs composition procedure driven by the SWSs reputation.