Due to the limited field of view of the microscopes, acquisitions of macroscopic specimens require many parallel image stacks to cover the whole volume of interest. Overlapping regions are introduced among stacks in order to make it possible automatic alignment by means of a 3D stitching tool. Since state-of-the-art microscopes coupled with chemical clearing procedures can generate 3D images whose size exceeds the Terabyte, parallelization is required to keep stitching time within acceptable limits.

Single-cell RNA-seq (scRNAseq) is a powerful tool to study heterogeneity of cells. Recently, several clustering based methods have been proposed to identify distinct cell populations. These methods are based on different statistical models and usually require to perform several additional steps, such as preprocessing or dimension reduction, before applying the clustering algorithm. Individual steps are often controlled by method-specific parameters, permitting the method to be used in different modes on the same datasets, depending on the user choices.

Cardiovascular disease is the leading cause of mortality worldwide. Atherosclerosis, one of the most common forms of the disease, is characterized by a gradual formation of atherosclerotic plaque, hardening, and narrowing of the arteries. Nanomaterials can serve as powerful delivery platforms for atherosclerosis treatment. However, their therapeutic efficacy is substantially limited in vivo due to nonspecific clearance by the mononuclear phagocytic system.

We investigate nonlinear elliptic Dirichlet problems whose growth is driven by a general anisotropic N-function, which is not necessarily of power-type and need not satisfy the $\Delta_2$ nor the $\nabla_2$ -condition. Fully anisotropic, non-reflexive Orlicz-Sobolev spaces provide a natural functional framework associated with these problems. Minimal integrability assumptions are detected on the datum on the right-hand side of the equation ensuring existence and uniqueness of weak solutions.

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.

This paper describes the efforts, pitfalls, and successes of applying unsupervised classification techniques to analyze the Trap-2017 dataset. Guided by the informative perspective on the nature of the dataset obtained through a set of specifically-written perl/bash scripts, we devised an automated clustering tool implemented in python upon openly-available scientific libraries. By applying our tool on the original raw data it is possibile to infer a set of trending behaviors for vehicles travelling over a route, yielding an instrument to classify both routes and plates.

The amount of traffic data collected by automatic number plate reading systems constantly incrseases. It is therefore important, for law enforcement agencies, to find convenient techniques and tools to analyze such data. In this paper we propose a scalable and fully automated procedure leveraging the Apache Accumulo technology that allows an effective importing and processing of traffic data. We discuss preliminary results obtained by using our application for the analysis of a dataset containing real traffic data provided by the Italian National Police.

The relevant role of freight lorry parking facilities as a tool to reduce nuisances and impact of economic activities in densely populated urban areas is widely recognised in the literature. Nevertheless, the literature currently lacks specific contributions addressing the use of a complex Multiple Criteria Decision Analysis (MCDA) approach for coping with an optimal location of freight lorry parking facilities in the urban context.

This paper considers a hub location problem where several carriers operate on a shared network to satisfy a given demand represented by a set of commodities. Possible cooperative strategies are studied where carriers can share resources or swap their respective commodities to produce tangible cost savings while fully satisfying the existing demand. Three different collaborative policies are introduced and discussed, and mixed integer programming formulations are provided for each of them.