Optimal Harvesting in an Age-Structured Predator–Prey Model

We investigate optimal harvesting control in a predator–prey model in which the prey population is represented by a first-order partial differential equation with age-structure and the predator population is represented by an ordinary differential equation in time. The controls are the proportions of the populations to be harvested, and the objective functional represents the profit from harvesting. The existence and uniqueness of the optimal control pair are established.     

Decay of solutions of ordinary differential equations

We investigate the rate of decay of eigenfunctions of Schrödinger equations using a perturbation method which consists of making a perturbation B of the operator L of the form B[y]=L[y]−(g⁻¹Lg)[y], where g is an appropriately chosen function. In our theory we allow B to be either relatively compact or satisfy a certain boundedness condition. We give some examples which apply the results of our main theorems coupled with recent work on the relative boundedness and compactness of differential operators.     

Line graphs of bipartite graphs with Hamiltonian paths

It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path P_t as a star complement for the eigenvalue ?2. The maximal graph is the line graph of K_m,m if t = 2m?1, and of K_m,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement P_r ∪ P_s or P_r ∪ C_s for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003     

Radiotracer studies of the antitumor metallocene molybdocene dichloride with biomolecules

Neutron irradiation of Cp₂MoCl₂ for 24 h afforded the radiotracer Cp₂⁹⁹MoCl₂ which was characterised by UV–Vis spectroscopy and thin layer chromatography. Binding experiments with the thiol containing protein human serum albumin (HSA) or calf thymus DNA, were monitored for ⁹⁹Mo using a gamma counter. Under the conditions investigated, molar ratios of binding of 0.2:1 (Cp₂MoCl₂:DNA) and 9.4:1 (Cp₂MoCl₂:HSA) were calculated. The results are consistent with in vitro coordination studies that have shown strong preferential interaction of Cp₂MoCl₂ with thiols versus other donor sites in biomolecules including DNA.     

Degradative chain transfer in vinyl acetate polymerizations using toluene as solvent

In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (C_trs) determined using the Mayo method is equal to 3.8 × 10^?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10^?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the M_n data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007     

The Two-Body Interaction with a Circle in Time

We complete our previous^{(1, 2)} demonstration that there is a family of new solutions to the photon and Dirac equations using spatial and temporal circles and four-vector behaviour of the Dirac bispinor. We analyse one solution for a bound state, which is equivalent to the attractive two-body interaction between a charged point particle and a second, which remains at rest. We show this yields energy and angular momentum eigenvalues that are identical to those found by the usual method of solving of the Dirac equation,⁽⁴⁾ including fine structure. We complete our previous derivation⁽²⁾ of QED from a set of rules for the two-body interaction and generalise these. We show that QED may be decomposed into a two-body interaction at every point in spacetime.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular n‐queens solutions

In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (a_ij), for all i and j it holds that a_ij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007