BACKGROUND: Network science represents a powerful and increasingly promising method for studying complex real-world problems. In the last decade, it has been applied to psychometric data in the attempt to explain psychopathologies as complex systems of causally interconnected symptoms. One category of mental disorders, relevant for their severity, incidence and multifaceted structure, is that of eating disorders (EDs), serious disturbances that negatively affect a person's eating behavior.

This paper presents an innovative approach to maximally disconnect a given network. More specifically, this work introduces the concept of a Critical Disruption Path, a path between a source and a destination vertex whose deletion minimizes the cardinality of the largest remaining connected component. Network interdiction models seek to optimally disrupt network operations. Existing interdiction models disrupt network operations by removing vertices or edges. We introduce the first problem and formulation that optimally fragments a network via interdicting a path.

Mathematical models have the potential to contribute to design and evaluate the infectivity spreading and growth of human immunodeficiency virus (HIV). Providing a better understanding of the dynamics of HIV infection in vivo and the immune system interactions with the virus can improve the classification of the infected cells and drive to an early diagnosis of the disease and drug evaluations.

Drug delivery carriers are considered an encouraging approach for the localized treatment of disease with minimum effect on the surrounding tissue. Particularly, layer-by-layer releasing particles have gained increasing interest for their ability to develop multifunctional systems able to control the release of one or more therapeutical drugs and biomolecules. Although experimental methods can offer the opportunity to establish cause and effect relationships, the data collection can be excessively expensive or/and time-consuming.

In this paper we propose a modeling setting and a numerical Riemann problem solver at the junction of one dimensional shallow-water channel networks. The junction conditions take into account the angles with which the channels intersect and include the possibility of channels with different sections. The solver is illustrated with several numerical tests which underline the importance of the angle dependence to obtain reliable solutions.

Multiple emulsions are a class of soft fluid in which small drops are immersed within a larger one and stabilized over long periods of time by a surfactant. We recently showed that, if a monodisperse multiple emulsion is subject to a pressure-driven flow, a wide variety of nonequilibrium steady states emerges at late times, whose dynamics relies on a complex interplay between hydrodynamic interactions and multibody collisions among internal drops.

In this paper we devise a microscopic (agent-based) mathematical model for reproducing crowd behavior in a specific scenario: a number of pedestrians, consisting of numerous social groups, flow along a corridor until a gate located at the end of the corridor closes. People are not informed about the closure of the gate and perceive the blockage observing dynamically the local crowd conditions. Once people become aware of the new conditions, they stop and then decide either to stay, waiting for reopening, or to go back and leave the corridor forever.

Background: In a systems biology perspective, protein-protein interactions (PPI) are encoded in machine-readable formats to avoid issues encountered in their retrieval for the reconstruction of comprehensive interaction maps and biological pathways. However, the information stored in electronic formats currently used doesn't allow a valid automatic reconstruction of biological pathways.Results: We propose a logical model of PPI that takes into account the "state" of proteins before and after the interaction.

This paper presents a sparse factorization for the delay Vandermonde matrix (DVM) and a faster, exact, radix-2, and completely recursive DVM algorithm to realize millimeter wave beamformers in wireless communication networks. The proposed algorithm will reduce the complexity of $N$-beam wideband beamformers from $\mathcal{O}(N^2)$ to $\mathcal{O}(N {\rm\: log\:} N)$. The scaled DVM algorithm is at least 97$\%$ faster than the brute-force scale DVM by a vector product. The signal flow graphs of the scaled DVM algorithm are shown to elaborate the simplicity of the proposed algorithm.