The graduate teacher programme in England: mentor training, quality assurance and the findings of inspection

In its recent report on the Graduate Teacher Programme (GTP), an employment-based route to Qualified Teacher Status (QTS) in England, the Government's Office for Standards in Education found that, although almost all trainees meet the standards required to qualify, too often they do so at an adequate level, rather than achieving the high levels of which they should be capable. The underlying reason for this is the quality of mentoring provided in the schools. The inspectors concluded that schoolbased trainers are often not adequately prepared for their role in implementing wide-ranging training programmes for trainee teachers. Despite this generally bleak picture, Ofsted concluded that 'the minority of cases of good practice in the training programmes and of high quality teaching by trainees indicate that the GTP can be an effective alternative route for training teachers'™. This article considers the strengths and weaknesses of the Graduate Teacher Programme, introduced in January 1998, and also reports on a small-scale project, funded by the Teacher Training Agency (TTA), the key objective of which was to strengthen the existing partnerships by improving the quality of school-based tutor training and continuous professional development of staff.

Relationship between deadbeat and pole-placement discrete-time PID controllers

This paper considers PID control in terms of its implementation by means of an ARMA plant model. Two controller actions are considered, namely pole placement and deadbeat, both being applied via a PID structure for the adaptive real-time control of an industrial level system. As well as looking at two controller types separately, a comparison is made between the forms and it is shown how, under certain circumstances, the two forms can be seen to be identical. It is shown how the pole-placement PID form does not in fact realise an action which is equivalent to the deadbeat controller, when all closed-loop poles are chosen to be at the origin of the z-plane.

An implicit pole-assignment self-tuning regulator

A new self-tuning implicit pole-assignment algorithm is presented which, through the use of a pole compression factor and different RLS model and control structures, overcomes stability and convergence problems encountered in previously available algorithms. Computational requirements of the technique are much reduced when compared to explicit pole-assignment schemes, whereas the inherent robustness of the strategy is retained.

The implementation of a low-cost production-line inspection system

This article describes an application of computers to a consumer-based production engineering environment. Particular consideration is given to the utilisation of low-cost computer systems for the visual inspection of components on a production line in real time. The process of installation is discussed, from identifying the need for artificial vision and justifying the cost, through to choosing a particular system and designing the physical and program structure.

A specific pole placement technique to minimise hardware requirements within a real time terrestrial and cable video echo canceller

The real time hardware architecture of a deterministic video echo canceller (deghoster) system is presented. The deghoster is capable of calculating all the multipath channel distortion characteristics from terrestrial and cable television in one single pass while performing real time video in-line ghost cancellation. The results from the actual system are also presented in this paper.

Robust pole assignment in linear state feedback

Numerical methods are described for determining robust, or well-conditioned, solutions to the problem of pole assignment by state feedback. The solutions obtained are such that the sensitivity of the assigned poles to perturbations in the system and gain matrices is minimized. It is shown that for these solutions, upper bounds on the norm of the feedback matrix and on the transient response are also minimized and a lower bound on the stability margin is maximized. A measure is derived which indicates the optimal conditioning that may be expected for a particular system with a given set of closed-loop poles, and hence the suitability of the given poles for assignment.

Robust pole assignment in systems subject to structured perturbations

The problem of robust pole assignment by feedback in a linear, multivariable, time-invariant system which is subject to structured perturbations is investigated. A measure of robustness, or sensitivity, of the poles to a given class of perturbations is derived, and a reliable and efficient computational algorithm is presented for constructing a feedback which assigns the prescribed poles and optimizes the robustness measure.

Robust pole assignment and optimal stability margins

A robust pole assignment by linear state feedback is achieved in state-space representation by selecting a feedback which minimises the conditioning of the assigned eigenvalues of the closed-loop system. It is shown here that when this conditioning is minimised, a lower bound on the stability margin in the frequency domain is maximised.

Comments, with reply, on "Computational algorithms for pole assignment" by N.K. Nichols

Some points of the paper by N.K. Nichols (see ibid., vol.AC-31, p.643-5, 1986), concerning the robust pole assignment of linear multiinput systems, are clarified. It is stressed that the minimization of the condition number of the closed-loop eigenvector matrix does not necessarily lead to robustness of the pole assignment. It is shown why the computational method, which Nichols claims is robust, is in fact numerically unstable with respect to the determination of the gain matrix. In replying, Nichols presents arguments to support the choice of the conditioning of the closed-loop poles as a measure of robustness and to show that the methods of J Kautsky, N. K. Nichols and P. VanDooren (1985) are stable in the sense that they produce accurate solutions to well-conditioned problems.