Bifurcations in valveless pumping techniques from a coupled fluid-structure-electrophysiology model in heart development

We explore an embryonic heart model that couples electrophysiology and muscle-force generation to flow induced using a $2D$ fluid-structure interaction framework based on the immersed boundary method. The propagation of action potentials are coupled to muscular contraction and hence the overall pumping dynamics. In comparison to previous models, the electro-dynamical model does not use prescribed motion to initiate the pumping motion, but rather the pumping dynamics are fully coupled to an underlying electrophysiology model, governed by the FitzHugh-Nagumo equations. Perturbing the diffusion parameter in the FitzHugh-Nagumo model leads to a bifurcation in dynamics of action potential propagation. This bifurcation is able to capture a spectrum of different pumping regimes, with dynamic suction pumping and peristaltic-like pumping at the extremes. We find that more bulk flow is produced within the realm of peristaltic-like pumping.Comment: 11 pages, 13 figures. arXiv admin note: text overlap with arXiv:1610.0342

The Partial Visibility Representation Extension Problem

For a graph $G$, a function $\psi$ is called a \emph{bar visibility representation} of $G$ when for each vertex $v \in V(G)$, $\psi(v)$ is a horizontal line segment (\emph{bar}) and $uv \in E(G)$ iff there is an unobstructed, vertical, $\varepsilon$-wide line of sight between $\psi(u)$ and $\psi(v)$. Graphs admitting such representations are well understood (via simple characterizations) and recognizable in linear time. For a directed graph $G$, a bar visibility representation $\psi$ of $G$, additionally, puts the bar $\psi(u)$ strictly below the bar $\psi(v)$ for each directed edge $(u,v)$ of $G$. We study a generalization of the recognition problem where a function $\psi'$ defined on a subset $V'$ of $V(G)$ is given and the question is whether there is a bar visibility representation $\psi$ of $G$ with $\psi(v) = \psi'(v)$ for every $v \in V'$. We show that for undirected graphs this problem together with closely related problems are \NP-complete, but for certain cases involving directed graphs it is solvable in polynomial time.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Pulsing corals: A story of scale and mixing

Effective methods of fluid transport vary across scale. A commonly used dimensionless number for quantifying the effective scale of fluid transport is the Reynolds number, Re, which gives the ratio of inertial to viscous forces. What may work well for one Re regime may not produce significant flows for another. These differences in scale have implications for many organisms, ranging from the mechanics of how organisms move through their fluid environment to how hearts pump at various stages in development. Some organisms, such as soft pulsing corals, actively contract their tentacles to generate mixing currents that enhance photosynthesis. Their unique morphology and intermediate scale where both viscous and inertial forces are significant make them a unique model organism for understanding fluid mixing. In this paper, 3D fluid-structure interaction simulations of a pulsing soft coral are used to quantify fluid transport and fluid mixing across a wide range of Re. The results show that net transport is negligible for $Re<10$, and continuous upward flow is produced for $Re\geq 10$.Comment: 8 pages, 8 figure

Planar L-Drawings of Directed Graphs

We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence of a planar L-drawing is an NP-complete problem. Motivated by this result, we focus on upward-planar L-drawings. We show that directed st-graphs admitting an upward- (resp. upward-rightward-) planar L-drawing are exactly those admitting a bitonic (resp. monotonically increasing) st-ordering. We give a linear-time algorithm that computes a bitonic (resp. monotonically increasing) st-ordering of a planar st-graph or reports that there exists none.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017