Continuous buttermaking : a process capability study : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in Industrial Management at Massey University

Continuous buttermaking has become an important process in the New Zealand Dairy Industry. From the first experimental trials in 1964 conducted by staff of the New Zealand Dairy Research Institute, continuous manufacture of butter by the Fritz process has now reached a commercial production of over 80,000 tons. Process control of the buttermaking process plays an important part in determining the economic return on the product. At this stage adequate information is available on the general operating principles of Continuous churns. However, in the absence of change in the operating conditions the product continues to show compositional variation. There is little information available to determine the causes of such variation. The work undertaken during this project was primarily aimed at investigation of this variation. It was conducted as a process capability study. It is clear that Continuous Buttermaking will continue to be an important process in the New Zealand Dairy Industry for some time, and it is essential that further information regarding the proceas is made available in order to facilitate improved process control

Splitting for Rare Event Simulation: A Large Deviation Approach to Design and Analysis

Particle splitting methods are considered for the estimation of rare events. The probability of interest is that a Markov process first enters a set $B$ before another set $A$, and it is assumed that this probability satisfies a large deviation scaling. A notion of subsolution is defined for the related calculus of variations problem, and two main results are proved under mild conditions. The first is that the number of particles generated by the algorithm grows subexponentially if and only if a certain scalar multiple of the importance function is a subsolution. The second is that, under the same condition, the variance of the algorithm is characterized (asymptotically) in terms of the subsolution. The design of asymptotically optimal schemes is discussed, and numerical examples are presented.Comment: Submitted to Stochastic Processes and their Application

Satellite-map position estimation for the Mars rover

A method for locating the Mars rover using an elevation map generated from satellite data is described. In exploring its environment, the rover is assumed to generate a local rover-centered elevation map that can be used to extract information about the relative position and orientation of landmarks corresponding to local maxima. These landmarks are integrated into a stochastic map which is then matched with the satellite map to obtain an estimate of the robot's current location. The landmarks are not explicitly represented in the satellite map. The results of the matching algorithm correspond to a probabilistic assessment of whether or not the robot is located within a given region of the satellite map. By assigning a probabilistic interpretation to the information stored in the satellite map, researchers are able to provide a precise characterization of the results computed by the matching algorithm

Approximation algorithms for planning and control

A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions

Cold dilute neutron matter on the lattice II: Results in the unitary limit

This is the second of two papers which investigate cold dilute neutron matter on the lattice using pionless effective field theory. In the unitary limit, where the effective range is zero and scattering length is infinite, simple scaling relations relate thermodynamic functions at different temperatures. When the second virial coefficient is properly tuned, we find that the lattice results obey these scaling relations. We compute the energy per particle, pressure, spin susceptibility, dineutron correlation function, and an upper bound for the superfluid critical temperature.Comment: 16 pages, 9 figure

Short course on principles and applications of beach nourishment

Covers the engineering aspects of beach nourishment. (Document is 192 pages

Neutron matter on the lattice with pionless effective field theory

We study neutron matter by combining pionless effective field theory with non-perturbative lattice methods. The neutron contact interaction is determined by zero temperature scattering data. We simulate neutron matter on the lattice at temperatures 4 and 8 MeV and densities below one-fifth normal nuclear matter density. Our results at different lattice spacings agree with one another and match bubble chain calculations at low densities. The equation of state of pure neutron matter obtained from our simulations agrees quantitatively with variational calculations based on realistic potentials.Comment: 28 pages, 13 figure