The objective of this paper is to demonstrate that the gradient-constrained discounted Steiner point algorithm (GCDSPA) described in an earlier paper by the authors is applicable to a class of real mine planning problems, by using the algorithm to design a part of the underground access in the Rubicon gold mine near Kalgoorlie in Western Australia. The algorithm is used to design a decline connecting two ore bodies so as to maximize the net present value (NPV) associated with the connector. The connector is to break out from the access infrastructure of one ore body and extend to the other ore body. There is a junction on the connector where it splits in two near the second ore body. The GCDSPA is used to obtain the optimal location of the junction and the corresponding NPV. The result demonstrates that the GCDSPA can be used to solve certain problems in mine planning for which currently available methods cannot provide optimal solutions.

Asymptotic expansions of the Gauss hypergeometric function with large parameters, $F(\unicode[STIX]{x1D6FC}+\unicode[STIX]{x1D716}_{1}\unicode[STIX]{x1D70F},\unicode[STIX]{x1D6FD}+\unicode[STIX]{x1D716}_{2}\unicode[STIX]{x1D70F};\unicode[STIX]{x1D6FE}+\unicode[STIX]{x1D716}_{3}\unicode[STIX]{x1D70F};z)$ as $|\unicode[STIX]{x1D70F}|\rightarrow \infty$, are known for many special cases, but not for one that the author encountered in recent work on fluid mechanics: $\unicode[STIX]{x1D716}_{2}=0$ and $\unicode[STIX]{x1D716}_{3}=\unicode[STIX]{x1D716}_{1}z$. This paper gives the leading term for that case if $\unicode[STIX]{x1D6FD}$ is not a negative integer and $z$ is not on the branch cut $[1,\infty )$, and it shows how subsequent terms can be found.

We study impatient customers’ joining strategies in a single-server Markovian queue with synchronized abandonment and multiple vacations. Customers receive the system information upon arrival, and decide whether to join or balk, based on a linear reward-cost structure under the acquired information. Waiting customers are served in a first-come-first-serve discipline, and no service is rendered during vacation. Server’s vacation becomes the cause of impatience for the waiting customers, which leads to synchronous abandonment at the end of vacation. That is, customers consider simultaneously but independent of others, whether to renege the system or to remain. We are interested to study the effect of both information and reneging choice on the balking strategies of impatient customers. We examine the customers’ equilibrium and socially optimal balking strategies under four cases of information: fully/almost observable and fully/almost unobservable cases, assuming the linear reward-cost structure. We compare the social benefits under all the information policies.

In aquatic microbial systems, high-magnitude variations in abundance, such as sudden blooms alternating with comparatively long periods of very low abundance (“apparent disappearance”), are relatively common. We suggest that in order for this to occur, such variations in abundance in microbial systems and, in particular, the apparent disappearance of species do not require seasonal or periodic forcing of any kind or external factors of any other nature. Instead, such variations can be caused by internal factors and, in particular, by bacteria–phage interaction. Specifically, we suggest that the variations in abundance and the apparent disappearance phenomenon can be a result of phage infection and the lysis of infected bacteria. To illustrate this idea, we consider a reasonably simple mathematical model of bacteria–phage interaction based on the model suggested by Beretta and Kuang, which assumes neither periodic forcing nor action of other external factors. The model admits a loss of stability via Andronov–Hopf bifurcation and exhibits dynamics which explains the phenomenon. These properties of the model are especially distinctive for spatially nonhomogeneous biosystems as well as biosystems with some sort of cooperation or community effects.

The functional partial differential equation (FPDE) for cell division,

$$ \begin{align*} &\frac{\partial}{\partial t}n(x,t) +\frac{\partial}{\partial x}(g(x,t)n(x,t))\\ &\quad = -(b(x,t)+\mu(x,t))n(x,t)+b(\alpha x,t)\alpha n(\alpha x,t)+b(\beta x,t)\beta n(\beta x,t), \end{align*} $$

$$ \begin{align*} \frac{\partial}{\partial t}n(x,t) +\frac{\partial}{\partial x}(g(x,t)n(x,t)) = -(b(x,t)+\mu(x,t))n(x,t)+F(x,t), \end{align*} $$

$F(x,t)$

$n(\alpha x,t)$

$n(\beta x,t)$

$\beta \ge 2 \ge \alpha \ge 1$

$\alpha x$

$\beta x$

The nonnegative function, $n(x,t)$, denotes the density of cells at time t with respect to cell size x. The functions $g(x,t)$, $b(x,t)$ and $\mu (x,t)$ are, respectively, the growth rate, splitting rate and death rate of cells of size x. The total number of cells, $\int _{0}^{\infty }n(x,t)\,dx$, coincides with the $L^1$ norm of n. The goal of this paper is to find estimates in $L^1$ (and, with some restrictions, $L^p$ for $p>1$) for a sequence of approximate solutions to the FPDE that are generated by solving the first-order PDE. Our goal is to provide a framework for the analysis and computation of such FPDEs, and we give examples of such computations at the end of the paper.

We show existence and uniqueness of solutions to an initial boundary value problem that entails a pantograph type functional partial differential equation with two advanced nonlocal terms. The problem models cell growth and division into two daughter cells of different sizes. There is a paucity of information about the solution to the problem for an arbitrary initial cell distribution.