OPTIMAL INVESTMENT IN THE PROTECTION OF A VULNERABLE BIOLOGICAL RESOURCE

It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given.     

Concentration for self‐bounding functions and an inequality of Talagrand

We see that the entropy method yields strong concentration results for general self‐bounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

The transmission properties of optical waveguides in SIMOX structures

The numerical aperture of step index planar waveguides in SIMOX structures is 3.16. Analysis suggests that some of the higher-order modes that are supported by the waveguide will be reflected at the output face, due to total internal reflection. This situation therefore suggests that the propagation losses of such waveguide structures may be lower than those measured by conventional methods.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

The dominating number of a random cubic graph

We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636n ≤ D(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc.     

Pyrimidino- and Proton-ionizable Pyrimidono-crown Ether Ligands: Synthesis and Preliminary Complexation Studies

Pyrimidino-crown ethers were prepared in 30-50% yields by reactingthe ditosylate derivative of the appropriate oligoethylene glycol with4-methoxy-5-methyl-2,6-pyrimidinedimethanol under basic conditions. A newmacrocyclic ligand containing a proton-ionizable pyrimidone subcyclic unitwas prepared in 88% yield by treating the appropriatepyrimidino-crown ether with 5 M NaOH in 50% (v/v) aqueous methanol.Preliminary complexation properties of some of these new compounds werestudied using various NMR spectral techniques. Good enantiomeric recognitionwas exhibited by a chiral pyrimidino-crown ether for the enantiomers of1-(-naphthyl)ethylammonium perchlorate.