The analysis and application of an HBV model

A mathematical model is formulated to describe the spread of hepatitis B. The stability of equilibria and persistence of disease are analyzed. The results shows that the dynamics of the model is completely determined by the basic reproductive number ρ₀. If ρ₀ < 1, the disease-free equilibrium is globally stable. When ρ₀ > 1, the disease-free equilibrium is unstable and the disease is uniformly persistent. Furthermore, under certain conditions, it is proved that the endemic equilibrium is globally attractive. Numerical simulations are conducted to demonstrate our theoretical results. The model is applied to HBV transmission in China. The parameter values of the model are estimated based on available HBV epidemic data in China. The simulation results matches the HBV epidemic data in China approximately.     

Solving linear program as linear system in polynomial time

A physically concise polynomial-time iterative-cum-non-iterative algorithm is presented to solve the linear program (LP) $Min{c}^{t}x\text{subject to}Ax=b,x\ge 0$. The iterative part–a variation of Karmarkar projective transformation algorithm–is essentially due to Barnes only to the extent of detection of basic variables of the LP taking advantage of monotonic convergence. It involves much less number of iterations than those in the Karmarkar projective transformation algorithm. The shrunk linear system containing only the basic variables of the solution vector $x$ resulting from $Ax=b$ is then solved in the mathematically non-iterative part. The solution is then tested for optimality and is usually more accurate because of reduced computation and has less computational and storage complexity due to smaller order of the system. The computational complexity of the combination of these two parts of the algorithm is polynomial-time $O\left(n^3\right)$. The boundedness of the solution, multiple solutions, and no-solution (inconsistency) cases are discussed. The effect of degeneracy of the primal linear program and/or its dual on the uniqueness of the optimal solution is mentioned. The algorithm including optimality test is implemented in Matlab which is found to be useful for solving many real-world problems.     

Monotonicity of the search number in the Golovach problem

The Golovach problem, also known as the ɛ-search problem, is as follows. A team of pursuers pursues an evader on a topological graph. The objective of the pursuers is to catch the evader, that is, approach the evader to a distance not exceeding a given nonnegative number ɛ. It is assumed that the evader is invisible to the pursuers and is fully informed beforehand about the search program of the pursuers. The problem is to find the ɛ-search number, i.e., the least number of pursuers sufficient for capturing the evader. Graphs with monotone ɛ-search number are studied; the ɛ-search number of a graph G is said to be monotone if it is not exceeded by the ɛ-search numbers of all connected subgraphs H of G. It is known that the ɛ-search number of any tree is monotone for all nonnegative ɛ. The edgesearch number, which is equal to the 0-search number, is monotone for all connected subgraphs of an arbitrary graph. A sufficient monotonicity condition for the ɛ-search number of any graph is obtained. This result is improved in the case of complete subgraphs. The Golovach function is constructed for graphs obtained by removing one edge from complete graphs with unit edges.     

Measuring the efficiency of decision making units: A comment

The full cost of a department of an organization is the sum of its direct cost and the overhead allocated to it. The problem of overhead allocation is to determine a cost allocation procedure that is both objective and equitable. The problem of departmental full costing is solved here via goal programming models. The present paper formulates the problem and constructs goal programming models for its solution.     

On the measure with maximal entropy for the Teichmüller flow on the moduli space of Abelian differentials

The Teichmüller flow g _t on the moduli space of Abelian differentials with zeros of given orders on a Riemann surface of a given genus is considered. This flow is known to preserve a finite absolutely continuous measure and is ergodic on every connected component ? of the moduli space. The main result of the paper is that µ/µ(?) is the unique measure with maximal entropy for the restriction of g _t to ?. The proof is based on the symbolic representation of g _t .     

Analysis of the multistrain asymmetric SI model for arbitrary strain diversity

The asymmetric multistrain $SI$ model is studied within a history-based framework. The governing differential equation in set notation is solved by making use of the powerful set manipulation functions of the Mathematica programming language. The algorithm allows, for the first time, the solution of both the temporal and the equilibrium equations for arbitrary strain diversity. Since Mathematica is an algebraic manipulator, analytical expressions are presented for the equilibrium population variables in terms of the forces of infection for arbitrary number of strains, $n$. Since there are no recoveries allowed in this model, it is found that coinfection always dominates the system if the basic reproductive number of both strains is greater than 1. The danger of coinfection is already evident for the relatively simple case of $n=2$ and becomes more drastic as $n$ increases. Strains which are not sustainable on their own are prevalent in the host population due to coinfection. The notion of a prevalence distribution function is introduced, which shows how the total prevalence is distributed amongst the different levels of infection. Results indicate that higher values of $n$ lead to a faster increase in coinfection prevalences since there are no recoveries in the model.     

Latin square and intersection of surface

A technique is developed here to estimate an unknown curve joining two points in a three dimensional Euclidean space. A special application presented here is a computer procedure to determine the intersection of two arbitrary given smooth surfaces. The method used is to assume that y is a function of x and the set (x,y(x)) lies on the projection of the intersection of two surfaces. The function y is determined by least square curve fitting on a Latin square of experimental values. The procedure is written in APL (A Programming Language). A set of preliminary results is presented. The results indicate that this is a successful procedure for some simple surfaces, including some conic surfaces.     

Inherited conics in Hall planes

The existence of ovals and hyperovals is an old question in the theory of non-Desarguesian planes. The aim of this paper is to describe when a conic of $\mathrm{PG}(2,q)$ remains an arc in the Hall plane obtained by derivation. Some combinatorial properties of the inherited conics are obtained also in those cases when it is not an arc. The key ingredient of the proof is an old lemma by Segre–Korchmáros on Desargues configurations with perspective triangles inscribed in a conic.     

The Cohomologies of the Sylow 2-Subgroups of a Symplectic Group of Degree Six and of the Third Conway Group

The third Conway group Co ₃ is one of the 26 sporadic finite simple groups. The cohomology of its Sylow 2-subgroup S is computed, an important step in calculating the mod 2 cohomology of Co ₃. The spectral sequence for the central extension of S is described; it collapses at the sixth page. Generators are described in terms of the Evens norm or transfers from subgroups. The central quotient S′ = S/2 is the Sylow 2-subgroup of the symplectic group Sp ₆(𝔽₂) of six-by-six matrices over the field of two elements. The cohomology of S′ is computed and is detected by restriction to elementary abelian 2-subgroups.     

A priori reduction method for solving the two-dimensional Burgers’ equations

The two-dimensional Burgers’ equations are solved here using the A Priori Reduction method. This method is based on an iterative procedure which consists in building a basis for the solution where at each iteration the basis is improved. The method is called a priori because it does not need any prior knowledge of the solution, which is not the case if the standard Karhunen-Loéve decomposition is used. The accuracy of the APR method is compared with the standard Newton-Raphson scheme and with results from the literature. The APR basis is also compared with the Karhunen-Loéve basis.     

Inverses of tridiagonal Toeplitz and periodic matrices with applications to mechanics

The linear algebraic equation Ax = b with tridiagonal coefficient matrix of A is solved by the analytical matrix inversion. An explicit formula is known if A is a Toeplitz matrix. New formulas are presented for the following cases: (1) A is of Toeplitz type except that A(1, 1) and A(n, n) are different from the remaining diagonal elements. (2) A is p-periodic (p > 1), by which is meant that in each of the three bands of A a group of p elements is periodically repeated. (3) The tridiagonal matrix A is composed of periodic submatrices of different periods. In cases (2) and(3) the problem of matrix inversion is reduced to a second-order difference equation with periodic coefficients. The solution is based on Floquet's theorem. It is shown that for p = 1 the formulae found for periodic matrices reduce to special forms valid for Toeplitz matrices. The results are applied to problems of elastostatics and of vibration theory.     

Toroidal automorphic forms for function fields

The space of toroidal automorphic forms was introduced by Zagier in 1979. Let F be a global field. An automorphic form on GL(2) is toroidal if it has vanishing constant Fourier coefficients along all embedded non-split tori. The interest in this space stems from the fact (amongst others) that an Eisenstein series of weight s is toroidal if s is a non-trivial zero of the zeta function, and thus a connection with the Riemann hypothesis is established. In this paper, we concentrate on the function field case. We show the following results. The (n ^?1)-th derivative of a non-trivial Eisenstein series of weight s and Hecke character x is toroidal if and only if L(x, s+1/2) vanishes in s to order at least n (for the “only if” part we assume that the characteristic of F is odd). There are no non-trivial toroidal residues of Eisenstein series. The dimension of the space of derivatives of unramified Eisenstein series equals h(g ^?1)+1 if the characteristic is not 2; in characteristic 2, the dimension is bounded from below by this number. Here g is the genus and h is the class number of F. The space of toroidal automorphic forms is an admissible representation and every irreducible subquotient is tempered.     

The approximation of reachable sets of control systems with integral constraint on controls

In this paper an approximation method for the construction of reachable sets of control systems with integral constraints on the control is considered. It is assumed that the control system is non-linear with respect to the phase state vector and is linear with respect to the control vector. The admissible control functions are chosen from the ball centered at the origin with radius μ₀ in L_p, p > 1. The reachable set is replaced by the set which consists of finite number of points. The estimated accuracy of the Hausdorff distance between the reachable set and the set which is approximately constructed is obtained.     

The Third Problem for the Laplace Equation with a Boundary Condition from L p

The third problem for the Laplace equation is studied on an open set with Lipschitz boundary. The boundary condition is in L_p and it is fulfilled in the sense of the nontangential limit. The existence and the uniqueness of a solution is proved and the solution is expressed in the form of a single layer potential. For domains with C¹ boundary the explicit solution of the problem is calculated.     

Continuous time control of the arrival process in an m/g/1 queue

The problem of continuously controlling the arrival process in an M/G/1 queue is studied. The control is exercised by keeping the facility open or closed for potential arrivals, and is based on the residual workload process. The reward structure includes a reward rate R when the server is busy, and a holding cost rate cx when the residual workload is x. The economic criterion used is long run average return. A control limit policy is shown to be optimal. An iterative method for calculating this control limit policy is suggested.     

k-eccentricity and absolute k-centrum of a probabilistic tree

The k-eccentricity evaluated at a point x of a graph G is the sum of the (weighted) distances from x to the k vertices farthest from it. The k-centrum is the set of vertices for which the k-eccentricity is a minimum. The concept of k-centrum includes, as a particular case, that of center and that of centroid (or median) of a graph. The absolute k-centrum is the set of points (not necessarily vertices) for which the k-eccentricity is a minimum. In this paper it will be proven that, for a weighted tree, both deterministic and probabilistic, the k-eccentricity is a convex function and that the absolute k-centrum is a connected set and is contained in an elementary path. Hints will be given for the construction of an algorithm to find the k-centrum and the absolute k-centrum.     

Lifshitz tails for Schrödinger operators with random breather potential

We prove a Lifshitz tail bound on the integrated density of states of random breather Schrödinger operators. The potential is composed of translated single-site potentials. The single-site potential is an indicator function of the set tA where t is from the unit interval and A is a measurable set contained in the unit cell. The challenges of this model are that, since A is not assumed to be star-shaped, the dependence of the potential on the parameter t is not monotone. It is also non-linear and not differentiable.     

A sequential sampling rule for selecting the most probable multinomial event

Summary A sequential sampling rule is given for selecting the most probable event from a multinomial distribution withk cells. A random number of observations is taken from the given multinomial distribution at each stage of sampling, where the number is distributed according to a Poisson distribution with mean λ. The sampling is stopped when the count in any cell is greater than or equal to a given positive integerN. The cell with the highest count is selected for the most probable event. The mathematical analysis of the problem is simplified as a result of the statistical independence of the cell frequencies due to the randomization of the sample number. The expected value of the stage when the sampling terminates is decreasing in λ. The sequential sampling scheme in which one observation is taken at a time until the highest cell count is equal toN, corresponds to λ→0. A table is given showing some properties of the given selection procedure.