The beneficial effects of physical activity for the prevention and management of several chronic diseases are widely recognized. Mathematical modeling of the effects of physical exercise in body metabolism and in particular its influence on the control of glucose homeostasis is of primary importance in the development of eHealth monitoring devices for a personalized medicine. Nonetheless, to date only a few mathematical models have been aiming at this specific purpose. We have developed a whole-body computational model of the effects on metabolic homeostasis of a bout of physical exercise. Built upon an existing model, it allows to detail better both subjects' characteristics and physical exercise, thus determining to a greater extent the dynamics of the hormones and the metabolites considered.
physical activity
mathematical modeling
metabolism
agent-based model
diabetes
2018Abstract in Atti di convegnometadata only access
Network-constrained bi-clustering of patients and multi-scale omics data
Olga Lazareva
;
Simon J Larsen
;
Paolo Tieri
;
Jan Baumbach
;
Tim Kacprowski
Recent advances in omics profiling technologies yield ever larger amounts of molecular data. Yet, the elucidation of the molecular basis of human diseases remains an unsolved challenge. The analysis of multi-scale omics data requires integrative bioinformatic tools capable of multi-modal computing and multi-scale modeling. Unsupervised learning approaches are frequently employed to identify biomolecules and pathways involved in specific diseases. However, classical clustering is hardly suitable to analyse, e.g., gene expression data conjointly with experimental conditions and molecular pathway information. Since we are interested in gene sets displaying a consistent behaviour across different conditions, both genes and samples have to be clustered simultaneously employing models respecting the heterogeneity of such multi-scale data. To this end, we aim for extending bi-clustering approaches by including information encoded in biological networks.
Methods
BiCluE (Sun et al. 2013) has been the first software package tackling the weighted bi-cluster editing problem. It pro- vides an exact algorithm based on fixed-parameter tractability (FPT). The bi-cluster editing problem is formulated as a bi-partite graph connecting features and samples. We then transform this graph into a disjunct set of bi-cliques while minimizing the editing costs (e.g., number of edges to be added/removed). Even though BiCluE yields potent solutions in many scenarios such as novel genotype-phenotype associations in GWAS data, it does not consider intrinsic feature relationships, e.g., interactions between proteins or regulatory interactions between genes. Therefore, we propose an extension of the BiCluE algorithm by mapping molecular interaction networks onto the bi-partite graph such that we impose constraints that force bi-cliques to respect intrinsic feature relationships. This reduces the computational com- plexity from O(4k) to O(2k), with k being the cluster editing costs due to a drastic reduction of the search space. Ad- ditionally, this model straight-forwardly allows incorporation of multi-scale data depending on the integrated network.
Results and conclusions
We demonstrate the validity and efficiency of our extension to BiCluE on simulated data. In general, such network- constrained bi-clustering approaches do not only allow for more stable feature selection, they also lead to more coherent functional enrichment, improving interpretability with respect to systems biology and systems medicine while being straight-forwardly applicable to multi-scale omics data.
bi-clustering
fixed-parameter tractability algorithm
multi-scale data
unsupervised analysis
2018Abstract in Atti di convegnometadata only access
Extracting survival-relevant subnetworks from multi-scale omics data with KeyPathwayMiner
Manuela Lautizi
;
Tim Kacprowski
;
Paolo Tieri
;
Jan Baumbach
;
Markus List
Biological interaction databases can be exploited by pathway-level enrichment methods for downstream analyses in biological and biomedical settings. Classical enrichment methods rely on predefined lists of pathways, biasing the search towards known pathways and risking to overlook unknown, yet important functional modules. To overcome this limitation, so-called de novo network enrichment approaches extract novel pathways from large, molecular interaction networks given molecular profiles of patients, e.g. gene expression, promoter methylation, etc.
Network enrichment of molecular profiling data is challenging due to noise and incompleteness of both the data them- selves and the networks. KeyPathwayMiner (KPM) jointly considers multi-scale molecular profiles to extract subnet- works enriched for de-regulated genes, e.g. differentially expressed genes. KPM is available as a feature-rich, user-friend- ly Cytoscape app, standalone software, or web service for de novo network enrichment (http://www.keypathwayminer. compbio.sdu.dk/).
Clinical cancer research often focuses on patient survival times. Thus, we developed a new strategy to identify sub- networks most significantly associated with differences in survival. Our approach is based on the Network of Muta- tions Associated with Survival (NoMAS) algorithm that extracts subnetworks enriched in mutations. NoMAS exploits colour-coding to identify candidate subnetworks that are then evaluated with a log-rank test. We adapted NoMAS for multi-scale omics data by introducing a k-means clustering step to split patients into two groups using the candidate subnetworks molecular profile. Next, we apply a log-rank test to assess the significance of the difference in survival times between the two groups. Our overall goal is to find subnetworks significantly associated with survival time, thus creating multi-scale models that connect molecular changes, e.g. on the level of gene expression, to changes in the time-scale of patient survival. The identified subnetworks can be expected to represent important disease mechanisms, making them interesting candidates for further investigation. We thus expect that extending KPM to survival data will make de novo network enrichment considerably more attractive as a systems medicine approach.
network enrichment
survival analysis
colour-coding
systems medicine
A general methodology, which consists in deriving two-dimensional finite-difference schemes which involve numerical fluxes based on Dirichlet-to-Neumann maps (or Steklov-Poincare operators), is first recalled. Then, it is applied to several types of diffusion equations, some being weakly anisotropic, endowed with an external source. Standard finite-difference discretizations are systematically recovered, showing that in absence of any other mechanism, like e.g. convection and/or damping (which bring Bessel and/or Mathieu functions inside that type of numerical fluxes), these well-known schemes achieve a satisfying multi-dimensional character. (C) 2018 Published by Elsevier Ltd.
A genuinely two-dimensional discretization of general drift-diffusion (including incompressible Navier--Stokes) equations is proposed. Its numerical fluxes are derived by computing the radial derivatives of "bubbles" which are deduced from available discrete data by exploiting the stationary Dirichlet--Green function of the convection-diffusion operator. These fluxes are reminiscent of Scharfetter and Gummel's in the sense that they contain modified Bessel functions which allow one to pass smoothly from diffusive to drift-dominating regimes. For certain flows, monotonicity properties are established in the vanishing viscosity limit (``asymptotic monotony'') along with second-order accuracy when the grid is refined. Practical benchmarks are displayed to assess the feasibility of the scheme, including the "western currents" with a Navier--Stokes--Coriolis model of ocean circulation.
Read More: https://epubs.siam.org/doi/10.1137/17M1151353
bubbles
drift-diffusion
Green--Dirichlet function
Navier--Stokes--Coriolis
Modal decomposition techniques are used to analyse the wake field past a marine
propeller achieved by previous numerical simulations (Muscari et al. Comput. Fluids,
vol. 73, 2013, pp. 65-79). In particular, proper orthogonal decomposition (POD) and
dynamic mode decomposition (DMD) are used to identify the most energetic modes
and those that play a dominant role in the inception of the destabilization mechanisms.
Two different operating conditions, representative of light and high loading conditions,
are considered. The analysis shows a strong dependence of temporal and spatial scales
of the process on the propeller loading and correlates the spatial shape of the modes
and the temporal scales with the evolution and destabilization mechanisms of the wake
past the propeller. At light loading condition, due to the stable evolution of the wake,
both POD and DMD describe the flow field by the non-interacting evolution of the
tip and hub vortex. The flow is mainly associated with the ordered convection of the
tip vortex and the corresponding dominant modes, identified by both decompositions,
are characterized by spatial wavelengths and frequencies related to the blade passing
frequency and its multiples, whereas the dynamic of the hub vortex has a negligible
contribution. At high loading condition, POD and DMD identify a marked separation
of the flow field close to the propeller and in the far field, as a consequence of wake
breakdown. The tonal modes are prevalent only near to the propeller, where the flow
is stable; on the contrary, in the transition region a number of spatial and temporal
scales appear. In particular, the phenomenon of destabilization of the wake, originated
by the coupling of consecutive tip vortices, and the mechanisms of hub-tip vortex
interaction and wake meandering are identified by both POD and DMD.
Computing eigenvectors of graph Laplacian is a main computational kernel in data clustering, i.e., in identifying different groups such that data in the same group are similar and points in different groups are dissimilar with respect to a given notion of similarity. Data clustering can be reformulated in terms of a graph partitioning problem when the given set of data is represented as a graph, also known as similarity graph. In this context, eigenvectors of the graph Laplacian are used to obtain a new geometric representation of the original data set which generally enhances cluster properties and improves cluster detection. In this work we apply a bootstrap Algebraic MultiGrid (AMG) method to compute an approximation of the eigenvectors corresponding to small eigenvalues of the graph Laplacian and analyse their ability to catch clusters both in synthetic and in realistic graphs.
The Smoothed Particle Hydrodynamics (SPH)method is revisited within a Large Eddy Simulation (LES)perspective following the recent work of [1]. To this aim, LESfiltering procedure is recast in a Lagrangian framework bydefining a filter centred at the particle position that moves withthe filtered fluid velocity. The Lagrangian formulation of LES isthen used to re-interpret the SPH approximation of differentialoperators as a specific model based on the decomposition of theLES filter into a spatial and time filter.The derived equations represent a general LES-SPH schemeand contain terms that in part come from LES filtering and inpart derive from SPH kernels. The last ones lead to additionalterms (with respect to LES filtering) that contain fluctuations inspace, requiring adequate modelling. Further, since the adoptedLES filter differs from the classical Favre averaging for thedensity field, fluctuation terms also appear in the continuityequation.In the paper, a closure model for all the terms is suggested andsome simplifications with respect to the full LES-SPH model areproposed. The simplified LES model is formulated in a fashionsimilar to the diffusive SPH scheme of Molteni & Colagrossi[2] and the diffusive parameter is reinterpreted as a turbulentdiffusive coefficient, namely ? ? . In analogy with the turbulentkinetic viscosity ? T , the diffusive coefficient is modelled througha Smagorinsky-like model and both ? T and ? ? are assumed todepend on the magnitude of the local strain rate tensor D.Some examples of the simplified model are reported forboth 2D and 3D free-decaying homogeneous turbulence andcomparisons with the full LES-SPH model are provided.
The rapid development of cyber insurance market brings forward the question about the effect of cyber insurance on cyber security. Some researchers believe that the effect should be positive as organisations will be forced to maintain a high level of security in order to pay lower premiums. On the other hand, other researchers conduct a theoretical analysis and demonstrate that availability of cyber insurance may result in lower investments in security. In this paper we propose a mathematical analysis of a cyber-insurance model in a non-competitive market. We prove that with a right pricing strategy it is always possible to ensure that security investments are at least as high as without insurance. Our general theoretical analysis is confirmed by specific cases using CARA and CRRA utility functions.
Corner-transport-upwind lattice Boltzmann model for bubble cavitation
Sofonea V
;
Biciusca T
;
Busuioc S
;
Ambrus Victor E
;
Gonnella G
;
Lamura A
Aiming to study the bubble cavitation problem in quiescent and sheared liquids, a third-order isothermal lattice Boltzmann model that describes a two-dimensional (2D) fluid obeying the van der Waals equation of state, is introduced. The evolution equations for the distribution functions in this off-lattice model with 16 velocities are solved using the corner-transport-upwind (CTU) numerical scheme on large square lattices (up to 6144 x 6144 nodes). The numerical viscosity and the regularization of the model are discussed for first- and second-order CTU schemes finding that the latter choice allows to obtain a very accurate phase diagram of a nonideal fluid. In a quiescent liquid, the present model allows us to recover the solution of the 2D Rayleigh-Plesset equation for a growing vapor bubble. In a sheared liquid, we investigated the evolution of the total bubble area, the bubble deformation, and the bubble tilt angle, for various values of the shear rate. A linear relation between the dimensionless deformation coefficient D and the capillary number Ca is found at small Ca but with a different factor than in equilibrium liquids. A nonlinear regime is observed for Ca greater than or similar to 0.2.
An intraguild predator-prey model with
a carrying capacity
proportional to the biotic resource, is generalized by introducing a
Holling type II functional response.
The longtime behaviour of solutions is analyzed and, in particular, absorbing sets in the phase space are determined.
The existence of biologically meaningful equilibria (boundary and internal equilibria) has been investigated.
Linear and nonlinear stability conditions for biologically meaningful equilibria
are performed. Finally, numerical simulations on
different
regimes of coexistence and extinction of the involved populations have been shown.
Intraguild predation
Stability
Longtime behavior
Holling type II functional response
The classic Brusselator model consists of four reactions in- volving six components A, B, D, E, X, Y. In a typical run, the final products D and E are removed instantly, while, the con- centrations of the reactants A and B are kept constant. Then, the classic Brusselator model consisting of two equations for the intermediate X and Y is obtained. When the component B is not considered constant, it is added to the mixture and the so-called full Brusselator model is considered. In this pa- per, the full Brusselator model is studied. In particular, the boundedness of solutions and the effect of diffusion on the linear stability is analyzed. Moreover, sufficient conditions ensuring that the unique steady state, unstable (stable) in the ODEs system, becomes stable (unstable) in presence of diffusion, are performed and a first nonlinear stability result is obtained.
Reaction-diffusion systems
Brusselator model
Stability
Turing instability
Many studies have shown that Physarum polycephalum slime mold is able to find the shortest path in a maze. Here we study this behavior in a network, using a hyperbolic model of chemotaxis [1]. Suitable transmission and boundary conditions at each node are considered to mimic the behavior of such an organism in the feeding process. Several numerical tests are presented for special network geometries to show the qualitative agreement between our model and the observed behavior of the mold.
Gamma-Convergence Analysis of a Generalized XY Model: Fractional Vortices and String Defects
Badal Rufat
;
Cicalese Marco
;
De Luca Lucia
;
Ponsiglione Marcello
We propose and analyze a generalized two dimensional XY model, whose interaction potential has n weighted wells, describing corresponding symmetries of the system. As the lattice spacing vanishes, we derive by -convergence the discrete-to-continuum limit of this model. In the energy regime we deal with, the asymptotic ground states exhibit fractional vortices, connected by string defects. The -limit takes into account both contributions, through a renormalized energy, depending on the configuration of fractional vortices, and a surface energy, proportional to the length of the strings. Our model describes in a simple way several topological singularities arising in Physics and Materials Science. Among them, disclinations and string defects in liquid crystals, fractional vortices and domain walls in micromagnetics, partial dislocations and stacking faults in crystal plasticity.
XY spin systems
Ginzburg-Landau
Liquid Crystals
Dislocations
Calculus of Variations
Gamma-convergence
We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give a simplified proof of the Heitmann-Radin crystallization theorem (Heitmann and Radin in J Stat Phys 22(3):281-287, 1980), which concerns a system of N identical atoms in two dimensions interacting via the idealized pair potential if , if , 0 if . This is done by endowing the bond graph of a general particle configuration with a suitable notion of discrete curvature, and appealing to a discrete Gauss-Bonnet theorem (Knill in Elem Math 67:1-7, 2012) which, as its continuous cousins, relates the sum/integral of the curvature to topological invariants. This leads to an exact geometric decomposition of the Heitmann-Radin energy into (i) a combinatorial bulk term, (ii) a combinatorial perimeter, (iii) a multiple of the Euler characteristic, and (iv) a natural topological energy contribution due to defects. An analogous exact geometric decomposition is also established for soft potentials such as the Lennard-Jones potential , where two additional contributions arise, (v) elastic energy and (vi) energy due to non-bonded interactions.
Crystallization
Interaction potential
Discrete differential geometry
Energy minimization
Gauss-Bonnet theorem