Cluster scheduling and load balancing via TCP options

This paper describes an experiment in designing, implementing and testing a Transport layer cluster scheduling and dispatching architecture. The motivation for the experiment was the hypothesis that a Transport layer clustering solution may offer advantantages over the existing industry-standard Network layer and Data Link Layer approaches. The critical success factors initially established to guide and evaluate the experiment were reduced dispatcher work load, reduced dispatcher internal state memory requirements, distributed denial of service resilience, and cluster software design simplicity. The functional design stage of the experiment produced a Transport layer strategy for scheduling and load balancing based on the specification of two new TCP options. Implementation required the introduction of the newly specified TCP options into the Linux (2.4) kernel. The implementation produced an extended Linux Socket API to facilitate user-process access to the additional TCP capability. The testing stage of the experiment confirmed the operational efficiency of the solution.

Virtual training environments to improve train driver's crisis decision making

This paper reports on a current research project in which virtual reality simulators are being investigated as a means of simulating hazardous Rail work conditions in order to allow train drivers to practice decision-making under stress. When working under high stress conditions train drivers need to move beyond procedural responses into a response activated through their own problem-solving and decision-making skills. This study focuses on the use of stress inoculation training which aims to build driver’s confidence in the use of new decision-making skills by being repeatedly required to respond to hazardous driving conditions. In particular, the study makes use of a train cab driving simulator to reproduce potentially stress inducing real-world scenarios. Initial pilot research has been undertaken in which drivers have experienced the training simulation and subsequently completed surveys on the level of immersion experienced. Concurrently drivers have also participated in a velocity perception experiment designed to objectively measure the fidelity of the virtual training environment. Baseline data, against which decision-making skills post training will be measured, is being gathered via cognitive task analysis designed to identify primary decision requirements for specific rail events. While considerable efforts have been invested in improving Virtual Reality technology, little is known about how to best use this technology for training personnel to respond to workplace conditions in the Rail Industry. To enable the best use of simulators for training in the Rail context the project aims to identify those factors within virtual reality that support required learning outcomes and use this information to design training simulations that reliably and safely train staff in required workplace accident response skills.

The arithmetic of receiver scheduling for electronic support

In Electronic Support, it is well known that periodic search strategies for swept-frequency superheterodyne receivers (SHRs) can cause synchronisation with the radar it seeks to detect. Synchronisation occurs when the periods governing the search strategies of the SHR and radar are commensurate. The result may be that the radar is never detected. This paper considers the synchronisation problem in depth. We find that there are usually a finite number of synchronisation ratios between the radar’s scan period and the SHR’s sweep period. We develop three geometric constructions by which these ratios can be found and we relate them to the Farey series. The ratios may be used to determine the intercept time for any combination of scan and sweep period. This theory can assist the operator of an SHR in selecting a sweep period that minimises the intercept time against a number of radars in a threat emitter list.

The effective management of geological risk in long-term production scheduling of open pit mines

Investment in mining projects, like most business investment, is susceptible to risk and uncertainty. The ability to effectively identify, assess and manage risk may enable strategic investments to be sheltered and operations to perform closer to their potential. In mining, geological uncertainty is seen as the major contributor to not meeting project expectations. The need to assess and manage geological risk for project valuation and decision-making translates to the need to assess and manage risk in any pertinent parameter of open pit design and production scheduling. This is achieved by taking geological uncertainty into account in the mine optimisation process. This thesis develops methods that enable geological uncertainty to be effectively modelled and the resulting risk in long-term production scheduling to be quantified and managed. One of the main accomplishments of this thesis is the development of a new, risk-based method for the optimisation of long-term production scheduling. In addition to maximising economic returns, the new method minimises the risk of deviating from production forecasts, given the understanding of the orebody. This ability represents a major advance in the risk management of open pit mining.

An integrated scheduling problem of PCB components on sequential pick-and-place machines:mathematical models and heuristic solutions

This paper formulates several mathematical models for determining the optimal sequence of component placements and assignment of component types to feeders simultaneously or the integrated scheduling problem for a type of surface mount technology placement machines, called the sequential pick-andplace (PAP) machine. A PAP machine has multiple stationary feeders storing components, a stationary working table holding a printed circuit board (PCB), and a movable placement head to pick up components from feeders and place them to a board. The objective of integrated problem is to minimize the total distance traveled by the placement head. Two integer nonlinear programming models are formulated first. Then, each of them is equivalently converted into an integer linear type. The models for the integrated problem are verified by two commercial packages. In addition, a hybrid genetic algorithm previously developed by the authors is adopted to solve the models. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total traveling distance.