74,306 research outputs found
Mathematical models of avascular cancer
This review will outline a number of illustrative mathematical models describing the growth of avascular tumours. The aim of the review is to provide a relatively comprehensive list of existing models in this area and discuss several representative models in greater detail. In the latter part of the review, some possible future avenues of mathematical modelling of avascular tumour development are outlined together with a list of key questions
A lattice Boltzmann model for natural convection in cavities
We study a multiple relaxation time lattice Boltzmann model for natural convection with moment–based boundary conditions. The unknown primary variables of the algorithm at a boundary are found by imposing conditions directly upon hydrodynamic moments, which are then translated into conditions for the discrete velocity distribution functions. The method is formulated so that it is consistent with the second–order implementation of the discrete velocity Boltzmann equations for fluid flow and temperature. Natural convection in square cavities is studied for Rayleigh numbers ranging from 103 to 106. An excellent agreement with benchmark data is observed and the flow fields are shown to converge with second order accuracy
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
A digraph such that every proper induced subdigraph has a kernel is said to
be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI
for short) resp.) if the digraph has a kernel (does not have a kernel resp.).
The unique CKI-tournament is and the unique
KP-tournaments are the transitive tournaments, however bipartite tournaments
are KP. In this paper we characterize the CKI- and KP-digraphs for the
following families of digraphs: locally in-/out-semicomplete, asymmetric
arc-locally in-/out-semicomplete, asymmetric -quasi-transitive and
asymmetric -anti-quasi-transitive -free and we state that the problem
of determining whether a digraph of one of these families is CKI is polynomial,
giving a solution to a problem closely related to the following conjecture
posted by Bang-Jensen in 1998: the kernel problem is polynomially solvable for
locally in-semicomplete digraphs.Comment: 13 pages and 5 figure
- …