Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMulti-Agent Systems and Blood Cell Formation
385
0
0.0
(
0
)
Authors
Nikolai Bessonov
Ask ChatGPT about the research
No Arabic abstract
The objective of this chapter is to give an insight of the mathematical modellng of hematopoiesis using multi-agent systems. Several questions may arise then: what is hematopoiesis and why is it interesting to study this problem from a mathematical point of view? Has the multi-agent system approach been the only attempt done until now? What does it bring more than other techniques? What were the results obtained? What is there left to do?
rate research
Read More
We study a system of particles in a two-dimensional geometry that move according to a reinforced random walk with transition probabilities dependent on the solutions of reaction-diffusion equations for the underlying fields. A birth process and a history-dependent killing process are also considered. This system models tumor-induced angiogenesis, the process of formation of blood vessels induced by a growth factor released by a tumor. Particles represent vessel tip cells, whose trajectories constitute the growing vessel network. New vessels appear and may fuse with existing ones during their evolution. Thus, the system is described by tracking the density of active tips, calculated as an ensemble average over many realizations of the stochastic process. Such density satisfies a novel discrete master equation with source and sink terms. The sink term is proportional to a space-dependent and suitably fitted killing coefficient. Results are illustrated studying two influential angiogenesis models.
The impulse response function (IRF) of a localized bolus in cerebral blood flow codes important information on the tissue type. It is indirectly accessible both from MR- and CT-imaging methods, at least in principle. In practice, however, noise and limited signal resolution render standard deconvolution techniques almost useless. Parametric signal descriptions look more promising, and it is the aim of this contribution to develop some improvements along this line.
We study a five-compartment mathematical model originally proposed by Kuznetsov et al. (1994) to investigate the effect of nonlinear interactions between tumour and immune cells in the tumour microenvironment, whereby immune cells may induce tumour cell death, and tumour cells may inactivate immune cells. Exploiting a separation of timescales in the model, we use the method of matched asymptotics to derive a new two-dimensional, long-timescale, approximation of the full model, which differs from the quasi-steady-state approximation introduced by Kuznetsov et al. (1994), but is validated against numerical solutions of the full model. Through a phase-plane analysis, we show that our reduced model is excitable, a feature not traditionally associated with tumour-immune dynamics. Through a systematic parameter sensitivity analysis, we demonstrate that excitability generates complex bifurcating dynamics in the model. These are consistent with a variety of clinically observed phenomena, and suggest that excitability may underpin tumour-immune interactions. The model exhibits the three stages of immunoediting - elimination, equilibrium, and escape, via stable steady states with different tumour cell concentrations. Such heterogeneity in tumour cell numbers can stem from variability in initial conditions and/or model parameters that control the properties of the immune system and its response to the tumour. We identify different biophysical parameter targets that could be manipulated with immunotherapy in order to control tumour size, and we find that preferred strategies may differ between patients depending on the strength of their immune systems, as determined by patient-specific values of associated model parameters.
Rapidly dividing tissues, like intestinal crypts, are frequently chosen to investigate the process of tumor initiation, because of their high rate of mutations. To study the interplay between normal and mutant as well as immortal cells in the human colon or intestinal crypt, we developed a 4-compartmental stochastic model for cell dynamics based on current discoveries. Recent studies of the intestinal crypt have revealed the existence of two stem cell groups. Therefore, our model incorporates two stem cell groups (central stem cells (CeSCs) and border stem cells (BSCs)), plus one compartment for transit amplifying (TA) cells and one compartment of fully differentiated (FD) cells. However, it can be easily modified to have only one stem cell group. We find that the worst-case scenario occurs when CeSCs are mutated, or an immortal cell arises in the TA or FD compartments. The probability that the progeny of a single advantageous CeSC mutant will take over the entire crypt is more than $0.2$, and one immortal cell always causes all FD cells to become immortals.Moreover, when CeSCs are either mutants or wild-type (w.t.) individuals, their progeny will take over the entire crypt in less than 100 days if there is no immortal cell. Unexpectedly, if the CeSCs are wild-type, then non-immortal mutants with higher fitness are washed out faster than those with lower fitness. Therefore, we suggest one potential treatment for colon cancer might be replacing or altering the CeSCs with the normal stem cells.
One major challenge in implementation of formation control problems stems from the packet loss that occur in these shared communication channel. In the presence of packet loss the coordination information among agents is lost. Moreover, there is a move to use wireless channels in formation control applications. It has been found in practice that packet losses are more pronounced in wireless channels, than their wired counterparts. In our analysis, we first show that packet loss may result in loss of rigidity. In turn this causes the entire formation to fail. Later, we present an estimation based formation control algorithm that is robust to packet loss among agents. The proposed estimation algorithm employs minimal spanning tree algorithm to compute the estimate of the node variables (coordination variables). Consequently, this reduces the communication overhead required for information exchange. Later, using simulation, we verify the data that is to be transmitted for optimal estimation of these variables in the event of a packet loss. Finally, the effectiveness of the proposed algorithm is illustrated using suitable simulation example.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
