The Effect of the Spacer of Bis(biurea) Ligands on the Structure of A2L3‐type (A=anion) Phosphate Complexes

By tuning the length and rigidity of the spacer of bis(biurea) ligands L, three structural motifs of the A₂L₃ complexes (A represents anion, here orthophosphate PO₄^3?), namely helicate, mesocate, and mono‐bridged motif, have been assembled by coordination of the ligand to phosphate anion. Crystal structure analysis indicated that in the three complexes, each of the phosphate ions is coordinated by twelve hydrogen bonds from six surrounding urea groups. The anion coordination properties in solution have also been studied. The results further demonstrate the coordination behavior of phosphate ion, which shows strong tendency for coordination saturation and geometrical preference, thus allowing for the assembly of novel anion coordination‐based structures as in transition‐metal complexes.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Experiences in Expert Systems

This paper describes some work carried out in the Scientific Research and Development Branch (SRDB) of the Home Office, intended to contribute to an overall aim of building up internal expertise in the field of expert systems. This was done by carrying out a number of pilot and demonstrator projects, two of which are described in some detail. The plan, which proved successful, was to build as far as possible on the relevant skills already possessed by an OR group in the branch. The lessons learned from these are summarized in the hope that they will be of use to other groups who wish to become involved in this important area.     

Numerical simulations of a filament in a flowing soap film

Experiments concerning the properties of soap films have recently been carried out and these systems have been proposed as experimental versions of theoretical two‐dimensional liquids. A silk filament introduced into a flowing soap film, was seen to demonstrate various stable modes, and these were, namely, a mode in which the filament oscillates and one in which the filament is stationary and aligns with the flow of the liquid. The system could be forced from the oscillatory mode into the non‐ oscillatory mode by varying the length of the filament. In this article we use numerical and computational techniques in order to simulate the strongly coupled behaviour of the filament and the fluid. Preliminary results are presented for the specific case in which the filament is seen to oscillate continuously for the duration of our simulation. We also find that the filament oscillations are strongly suppressed when we reduce the effective length of the filament. We believe that these results are reminiscent of the different oscillatory and non‐oscillatory modes observed in experiment. The numerical solutions show that, in contrast to experiment, vortices are created at the leading edge of the filament and are preferentially grown in the curvature of the filament and are eventually released from the trailing edge of the filament. In a similar manner to oscillating hydrofoils, it seems that the oscillating filaments are in a minimal energy state, extracting sufficient energy from the fluid to oscillate. In comparing numerical and experimental results it is possible that the soap film does have an effect on the fluid flow especially in the boundary layer where surface tension forces are large. Copyright © 2004 John Wiley & Sons, Ltd.     

On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.     

Corn stover fractions and bioenergy

Information is presented on structure, composition, and response to enzymes of corn stover related to barriers for bioconversion to ethanol. Aromatic compounds occurred in most tissue cell walls. Ferulic acid esterase treatment before cellulase treatment significantly improved dry weight loss and release of phenolic acids and sugars in most fractions over cellulase alone. Leaf fractions were considerably higher in dry weight loss and released sugars with esterase treatment, but stem pith cells gave up the most phenolic acids. Results help identify plant fractions more appropriate for coproducts and bioconversion and those more suitable as residues for soil erosion control.     

Global Solution of Optimization Problems with Parameter-Embedded Linear Dynamic Systems

This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly