In this paper, some recent applications of the so-called Generalized Bernstein polynomials are collected. This polynomial sequence is constructed by means of the samples of a continuous function f on equispaced points of [0; 1] and depends on an additional parameter which can be suitable chosen in order to improve the rate of convergence to the function f, as the smoothness of f increases, overcoming the well-known low degree of approximation achieved by the classical Bernstein polynomials or by the piecewise polynomial approximation.

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.

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.

Presentazione orale al side event - GEO Week 2018 - Sede: Kyoto (JP) - La GEO WEEK è la conferenza scientifica internazionale di GEO che precede il summit annuale dei 200 membri di GEO. Si tiene alternativamente in America, Asia, Europa, Africa e Oceania.

Parties of reputation systems rate each other and use ratings to compute reputation scores that drive their interactions. When deciding which reputation model to deploy in a network environment, it is important to find the most suitable model and to determine its right initial configuration. This calls for an engineering approach for describing, implementing and evaluating reputation systems while taking into account specific aspects of both the reputation systems and the networked environment where they will run.

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.

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.