Numerical simulations of aggregate breakup in bounded and unbounded turbulent flows

Breakup of small aggregates in fully developed turbulence is studied by means of direct numerical simulations in a series of typical bounded and unbounded flow configurations, such as a turbulent channel flow, a developing boundary layer and homogeneous isotropic turbulence. The simplest criterion for breakup is adopted, whereby aggregate breakup occurs when the local hydrodynamic stress "1=2, with " being the energy dissipation at the position of the aggregate, overcomes a given threshold cr, which is characteristic for a given type of aggregate.

Finite volume formulation of thermal lattice Boltzmann method

The main purpose of this paper is to develop a novel thermal lattice Boltzmann method (LBM) based on finite volume (FV) formulation. Validation of the suggested formulation is performed by simulating plane Poiseuille, backward-facing step and flow over circular cylinder. For this purpose, a cell-centered scheme is used to discretize the convection operator and the double distribution function model is applied to describe the temperature field. To enhance stability, weighting factors are defined as flux correctors on a D2Q9 lattice.

A fast computation method for IQA metrics based on their typical set

This paper deals with the typical set of an image quality assessment (IQA) measure. In particular, it focuses on the well known and widely used Structural SIMilarity index (SSIM). In agreement with Information Theory, the visual distortion typical set is composed of the least amount of information necessary to estimate the quality of the distorted image. General criteria for an effective and fruitful computation of the set will be given.

Automated restoration of semi-transparent degradation via Lie groups and visibility laws

This paper presents a novel approach for the removal of semi-transparent defects from images of historical or artistic importance. It combines Lie group transformations with human perception rules in order to make restoration more flexible and adaptable to defects having different physical or mechanical causes. In particular, the restoration process consists of an iterative procedure that gradually reduces the visual perception of the defect.

Direct evidence of plastic events and dynamic heterogeneities in soft-glasses

By using fluid-kinetic simulations of confined and concentrated emulsion droplets, we investigate the nature of space non-homogeneity in soft-glassy dynamics and provide quantitative measurements of the statistical features of plastic events in the proximity of the yield-stress threshold. Above the yield stress, our results show the existence of a finite stress correlation scale, which can be mapped directly onto the cooperativity scale, recently introduced in the literature to capture non-local effects in the soft-glassy dynamics.

Relativistic lattice kinetic theory: Recent developments and future prospects

In this paper, we review recent progress in relativistic lattice kinetic theory and its applications to relativistic hydrodynamics. Two methods for constructing the discretised distribution function, moment matching and projection onto orthogonal polynomials, are described. Extensions to ultra-high velocities as well as improved dissipation models are discussed. We show that the existing models can successfully cover a wide range of velocities (from weak-relativistic to ultra-relativistic) and viscous regimes.

Multi-omic landscape of rheumatoid arthritis: re-evaluation of drug adverse effects

Objective: To provide a frame to estimate the systemic impact (side/adverse events) of (novel) therapeutic targets by taking into consideration drugs potential on the numerous districts involved in rheumatoid arthritis (RA) from the inflammatory and immune response to the gut-intestinal (GI) microbiome. Methods: We curated the collection of molecules from high-throughput screens of diverse (multi-omic) biochemical origin, experimentally associated to RA.

IMPROVED APPROXIMATION OF MAXIMUM VERTEX COVERAGE PROBLEM ON BIPARTITE GRAPHS

Given a simple undirected graph G and a positive integer s, the maximum vertex coverage problem (MVC) is the problem of finding a set U of s vertices of G such that the number of edges having at least one endpoint in U is as large as possible. The problem is NP-hard even in bipartite graphs, as shown in two recent papers [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37-48; G. Joret and A. Vetta, Reducing the Rank of a Matroid, preprint, arXiv: 1211.4853v1 [cs.DS], 2012].