Acquisition of control information in a wind shear

When an aircraft encounters a change of air mass it may experience a change in horizontal wind sufficient to cause appreciable change in airspeed and, therefore, in lift. It may also suffer a change in vertical wind and, therefore, in vertical speed. The adverse combination of these effects may result in a significant excursion below the correct vertical profile and this may be especially serious if it happens during the latter part of an approach. Appropriate action should then be taken very quickly to avoid a situation from which the aircraft can scarcely recover, implying that suitable information needs to be readily accessible to the pilot. The purpose of this paper is to explore circumstances in which it is difficult to meet this requirement in conventionally equipped aircraft, because of time factors affecting the flow of information

Head-up display in the non-precision approach

The problem of head-up guidance for an aircraft making an instrument approach without glide slope information is discussed. Requirements for path control are considered for each section of the approach profile and a head-up display is developed to meet these needs. The display is an unreferenced flight director which is modified by adding a ground referenced symbol as an alternative guidance component. The director is used for holding altitude in the first segment and for descent at a controlled rate in the second segment. It is used in the third segment to maintain the minimum decision altitude while assessing the approach situation. This is done by means of occasional brief changes to the referenced symbol. In the final segment a visual approach is made with the referenced symbol used continuously for path control. The display is investigated experimentally in simulated approaches made by three pilots. The results show a fair agreement between objective and subjective estimates of the quality of landing decisions

An experimental evaluation of head-up display formats

Three types of head-up display format are investigated. Type 1 is an unreferenced (conventional) flight director, type 2 is a ground referenced flight path display, and type 3 is a ground referenced director. Formats are generated by computer and presented by reflecting collimation against a simulated forward view in flight. Pilots, holding commercial licenses, fly approaches in the instrument flight mode and in a combined instrument and visual flight mode. The approaches are in wind shear with varied conditions of visibility, offset, and turbulence. The displays are equivalent in pure tracking but there is a slight advantage for the unreferenced director in poor conditions. Flight path displays are better for tracking in the combined flight mode, possibly because of poor director control laws and the division of attention between superimposed fields. Workloads is better for the type 2 displays. The flight path and referenced director displays are criticized for effects of symbol motion and field limiting. In the subjective judgment of pilots familiar with the director displays, they are rated clearly better than path displays, with a preference for the unreferenced director. There is a fair division of attention between superimposed fields

A conformal head-up display for the visual approach

The degree of conformity used in matching a superimposed display to its visual background is considered in relation to the information available for vertical guidance and control during a purely visual approach. The information may be represented by individual symbols or combined in a single symbol, and the relative merits of these methods are discussed. A fully conformal display format is developed for the purpose of showing both the position and direction of the flight path, with provision for the effects of disturbances, ILS compatibility, and control needs. The field of view needed for all conditions and phases of the visual approach with a fully conformal display is studied in relation to the limitations of conventional collimator systems. Methods are discussed which depend on deviation of the sight line, and on windshield reflection of the uncollimated image of a simple pointer. Limited flight tests show some promise for the uncollimated method

Algorithmic Debugging of Real-World Haskell Programs: Deriving Dependencies from the Cost Centre Stack

Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, even libraries that the user does not want to debug and which may use language features not supported by the debugger. This is a pity, because a promising ap- proach to debugging is therefore not applicable to many real-world programs. We use the cost centre stack from the Glasgow Haskell Compiler profiling environment together with runtime value observations as provided by the Haskell Object Observation Debugger (HOOD) to collect enough information for algorithmic debugging. Program annotations are in suspected modules only. With this technique algorithmic debugging is applicable to a much larger set of Haskell programs. This demonstrates that for functional languages in general a simple stack trace extension is useful to support tasks such as profiling and debugging

Compositional Explanation of Types and Algorithmic Debugging of Type Errors

The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard to understand why a program is not type correct or a function does not have the intended type. We suggest that at the core of this problem is the difficulty of explaining why a given expression has a certain type. The type system is not defined compositionally. We propose to explain types using a variant of the Hindley-Milner type system that defines a compositional type explanation graph of principal typings. We describe how the programmer understands types by interactive navigation through the explanation graph. Furthermore, the explanation graph can be the foundation for algorithmic debugging of type errors, that is, semi-automatic localisation of the source of a type error without even having to understand the type inference steps. We implemented a prototype of a tool to explore the usefulness of the proposed methods

Lightweight Computation Tree Tracing for Lazy Functional Languages

A computation tree of a program execution describes computations of functions and their dependencies. A computation tree describes how a program works and is at the heart of algorithmic debugging. To generate a computation tree, existing algorithmic debuggers either use a complex implementation or yield a less informative approximation. We present a method for lazy functional languages that requires only a simple tracing library to generate a detailed computation tree. With our algorithmic debugger a programmer can debug any Haskell program by only importing our library and annotating suspected functions

Late Holocene palynology and palaeovegetation of tephra-bearing mires at Papamoa and Waihi Beach, western Bay of Plenty, North Island, New Zealand.

The vegetation history of two mires associated with Holocene dunes near the western Bay of Plenty coast, North Island, New Zealand, is deduced from pollen analysis of two cores. Correlation of airfall tephra layers in the peats, and radiocarbon dates, indicate that the mires at Papamoa and Waihi Beach are c. 4600 and c. 2900 conventional radiocarbon years old, respectively. Tephras used to constrain the chronology of the pollen record include Rotomahana (1886 AD), Kaharoa (700 yr B.P.), Taupo (Unit Y; 1850 yr B.P.), Whakaipo (Unit V; 2700 yr B.P.), Stent (Unit Q; 4000 yr B.P.), Hinemaiaia (Unit K; 4600 yr B.P.), and reworked Whakatane (c. 4800 yr B.P.) at Papamoa, and Kaharoa and Taupo at Waihi Beach. Peat accumulation rates at Papamoa from 4600 - 1850 yr B.P. range from 0.94 to 2.64 mm/yr (mean 1.37 mm/yr). At Waihi Beach, from 2900 yr B.P. - present day, they range from 0.11 to 0.21 mm/yr (mean 0.20 mm/yr). Peat accumulation at both sites was slowest from 1850 to 700 yr B.P., suggesting a drier overall climate during this interval. At both sites, the earliest organic sediments, which are underlain by marine or estuarine sands, yield pollen spectra indicating salt marsh or estuarine environments. Coastal vegetation communities declined at both sites, as sea level gradually fell or the coast prograded, and were eventually superseded by a low moor bog at Papamoa, and a mesotrophic swamp forest at Waihi Beach. These differences, and the marked variation in peat accumulation rates, probably reflect local hydrology and are unlikely to have been climatically controlled. The main regional vegetation during this period was mixed northern conifer-angiosperm forest. Kauri (Agathis australis) formed a minor component of these forests, but populations of this tree have apparently not expanded during the late Holocene at these sites, which are near its present southern limit. Occasional shortlived forest disturbances are detectable in these records, in particular immediately following the deposition of Taupo Tephra. However, evidence for forest clearance during the human era is blurred by the downward dislocation of modern adventi ve pollen at these sites, preventing the clear differentiation of the Polynesian and European eras

Knot selection in sparse Gaussian processes with a variational objective function

Sparse, knot‐based Gaussian processes have enjoyed considerable success as scalable approximations of full Gaussian processes. Certain sparse models can be derived through specific variational approximations to the true posterior, and knots can be selected to minimize the Kullback‐Leibler divergence between the approximate and true posterior. While this has been a successful approach, simultaneous optimization of knots can be slow due to the number of parameters being optimized. Furthermore, there have been few proposed methods for selecting the number of knots, and no experimental results exist in the literature. We propose using a one‐at‐a‐time knot selection algorithm based on Bayesian optimization to select the number and locations of knots. We showcase the competitive performance of this method relative to optimization of knots simultaneously on three benchmark datasets, but at a fraction of the computational cost