Multi-microprocessor control of processes with pure time delay

In 1967 a novel scheme was proposed for controlling processes with large pure time delay (Fellgett et al, 1967) and some of the constituent parts of the scheme were investigated (Swann, 1970; Atkinson et al, 1973). At that time the available computational facilities were inadequate for the scheme to be implemented practically, but with the advent of modern microcomputers the scheme becomes feasible. This paper describes recent work (Mitchell, 1987) in implementing the scheme in a new multi-microprocessor configuration and shows the improved performance it provides compared with conventional three-term controllers.

An on-line algorithm of uncertain time delay estimation in a continuous system

In this paper, we present an on-line estimation algorithm for an uncertain time delay in a continuous system based on the observational input-output data, subject to observational noise. The first order Pade approximation is used to approximate the time delay. At each time step, the algorithm combines the well known Kalman filter algorithm and the recursive instrumental variable least squares (RIVLS) algorithm in cascade form. The instrumental variable least squares algorithm is used in order to achieve the consistency of the delay parameter estimate, since an error-in-the-variable model is involved. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.

Human-computer cooperative teleoperation with time delay

Presents a method for model based bilateral control of master-slave arm with time delay between master and slave arms, where the system supports cooperative action between manual and automatic modes. The method realises efficiencies in master-slave arm control with the simplicities of a computer and the flexibility of a skilled human operator.

Dinitrogen release from arylpentazole: A picosecond time-resolved infrared, spectroelectrochemical, and DFT computational study

p-(Dimethylamino)phenyl pentazole, DMAP-N5 (DMAP = Me2N−C6H4), was characterized by picosecond transient infrared spectroscopy and infrared spectroelectrochemistry. Femtosecond laser excitation at 310 or 330 nm produces the DMAP-N5 (S1) excited state, part of which returns to the ground state (τ = 82 ± 4 ps), while DMAP-N and DMAP-N3 (S0) are generated as double and single N2-loss photoproducts with η ≈ 0.14. The lifetime of DMAP-N5 (S1) is temperature and solvent dependent. [DMAP-N3]+ is produced from DMAP-N5 in a quasireversible, one-electron oxidation process (E1/2 = +0.67 V). Control experiments with DMAP-N3 support the findings. DFT B3LYP/6-311G** calculations were used to identify DMAP-N5 (S1), DMAP-N3 +, and DMAP-N in the infrared spectra. Both DMAP-N5 (S1) and [DMAP-N5]+ have a weakened N5 ring structure.

A Proposed Modification to the Robert–Asselin Time Filter

The Robert–Asselin time filter is widely used in numerical models of weather and climate. It successfully suppresses the spurious computational mode associated with the leapfrog time-stepping scheme. Unfortunately, it also weakly suppresses the physical mode and severely degrades the numerical accuracy. These two concomitant problems are shown to occur because the filter does not conserve the mean state, averaged over the three time slices on which it operates. The author proposes a simple modification to the Robert–Asselin filter, which does conserve the three-time-level mean state. When used in conjunction with the leapfrog scheme, the modification vastly reduces the impacts on the physical mode and increases the numerical accuracy for amplitude errors by two orders, yielding third-order accuracy. The modified filter could easily be incorporated into existing general circulation models of the atmosphere and ocean. In principle, it should deliver more faithful simulations at almost no additional computational expense. Alternatively, it may permit the use of longer time steps with no loss of accuracy, reducing the computational expense of a given simulation.

Inheritance of time to flowering in cowpea (Vigna unguiculata (L.) Walp.)

Time to flowering and maturity is an important adaptive feature in annual crops, including cowpeas (Vigna unguiculata (L.) Walp.). In West and Central Africa, photoperiod is the most important environmental variable affecting time to flowering in cowpea. The inheritance of time from sowing to flowering (f) in cowpeas was studied by crossing a photoperiod-sensitive genotype Kanannnado to a photoperiod-insensitive variety IT97D-941-1. Sufficient seed of F-1, F-2, F-3 and backcross populations were generated. The parental, F-1, F-2, F-3 and the backcross populations were screened for f under long natural days (mean daylength 13.4 h per day) in the field and the parents, F-1, F-2 and backcross populations under short day (10 h per day) conditions. The result of the screening showed that photoperiod in the field was long enough to delay flowering of photoperiod-sensitive genotypes. Photoperiod-sensitivity was found to be partially dominant to insensitivity. Frequency distribution of the trait in the various populations indicated quantitative inheritance. Additive (d) and additive x dominance (j) interactions were the most important gene actions conditioning time to flowering. A narrow sense heritability of 86% was estimated for this trait. This will result in 26 days gain in time to flowering with 5% selection intensity from the F-2 to F-3 generation. At least seven major gene pairs, with an average delay of 6 days each, were estimated to control time to flowering in this cross.

Time patterns in UK demand for alcohol and tobacco: an application of the EM algorithm

Capturing the pattern of structural change is a relevant task in applied demand analysis, as consumer preferences may vary significantly over time. Filtering and smoothing techniques have recently played an increasingly relevant role. A dynamic Almost Ideal Demand System with random walk parameters is estimated in order to detect modifications in consumer habits and preferences, as well as changes in the behavioural response to prices and income. Systemwise estimation, consistent with the underlying constraints from economic theory, is achieved through the EM algorithm. The proposed model is applied to UK aggregate consumption of alcohol and tobacco, using quarterly data from 1963 to 2003. Increased alcohol consumption is explained by a preference shift, addictive behaviour and a lower price elasticity. The dynamic and time-varying specification is consistent with the theoretical requirements imposed at each sample point. (c) 2005 Elsevier B.V. All rights reserved.

Including a time-of-year effect in the analysis of a matched case-control study

Motivated by a matched case-control study to investigate potential risk factors for meningococcal disease amongst adolescents, we consider the analysis of matched case-control studies where disease incidence, and possibly other risk factors, vary with time of year. For the cases, the time of infection may be recorded. For controls, however, the recorded time is simply the time of data collection, which is shortly after the time of infection for the matched case, and so depends on the latter. We show that the effect of risk factors and interactions may be adjusted for the time of year effect in a standard conditional logistic regression analysis without introducing any bias. We also show that, if the time delay between data collection for cases and controls is constant, provided this delay is not very short, estimates of the time of year effect are approximately unbiased. In the case that the length of the delay varies over time, the estimate of the time of year effect is biased. We obtain an approximate expression for the degree of bias in this case. Copyright © 2004 John Wiley & Sons, Ltd.

Perceiving time to collision activates the sensorimotor cortex

The survival of many animals hinges upon their ability to avoid collisions with other animals or objects or to precisely control the timing of collisions. Optical expansion provides a compelling impression of object approach and in principle can provide the basis for judgments of time to collision (TTC) [1]. It has been demonstrated that pigeons [2] and houseflies [3] have neural systems that can initiate rapid coordinated actions on the basis of optical expansion. In the case of humans, the linkage between judgments of TTC and coordinated action has not been established at a cortical level. Using functional magnetic resonance imaging (fMRI), we identified superior-parietal and motor-cortex areas that are selectively active during perceptual TTC judgments, some of which are normally involved in producing reach-to-grasp responses. These activations could not be attributed to actual movement of participants. We demonstrate that networks involved in the computational problem of extracting TTC from expansion information have close correspondence with the sensorimotor systems that would be involved in preparing a timed motor response, such as catching a ball or avoiding collision.

The effects of a pre-movement delay on the kinematics of prehension in middle childhood

The present study examined the effects of a pre-movement delay on the kinematics of prehension in middle childhood. Twenty-five children between the ages of 5 and 11 years made visually open-loop reaches to two different sized objects at two different distances along the midline. Reaches took place either (i) immediately, or (ii) 2 s after the occlusion of the stimulus. In all age groups, reaches following the pre-movement delay were characterised by longer movement durations, lower peak velocities, larger peak grip apertures and longer time spent in the final slow phase of the movement. This pattern of results suggests that the representations that control the transport and grasp component are affected similarly by delay, and is consistent with the results previously reported for adults. Such representations therefore appear to develop before the age of 5. (C) 2004 Elsevier B.V. All rights reserved.

PIC based detection for distributed space-time block coding under imperfect synchronisation

A parallel interference cancellation (PIC) detection scheme is proposed to suppress the impact of imperfect synchronisation. By treating as interference the extra components in the received signal caused by timing misalignment, the PIC detector not only offers much improved performance but also retains a low structural and computational complexity.

Distributed space-time block coding with incremental relay: performance improvement under imperfect synchronisation

This paper addresses the impact of imperfect synchronisation on D-STBC when combined with incremental relay. To suppress such an impact, a novel detection scheme is proposed, which retains the two key features of the STBC principle: simplicity (i.e. linear computational complexity), and optimality (i.e. maximum likelihood). These two features make the new detector very suitable for low power wireless networks (e.g. sensor networks).

Distributed space-time block coding for 3 and 4 relay nodes: Imperfect synchronisation and a solution

Most research on distributed space time block coding (STBC) has so far focused on the case of 2 relay nodes and assumed that the relay nodes are perfectly synchronised at the symbol level. By applying STBC to 3-or 4-relay node systems, this paper shows that imperfect synchronisation causes significant performance degradation to the conventional detector. To this end, we propose a new STBC detection solution based on the principle of parallel interference cancellation (PIC). The PIC detector is moderate in computational complexity but is very effective in suppressing the impact of imperfect synchronisation.

Computational complexity of weighted splitting schemes on parallel computers

In models of complicated physical-chemical processes operator splitting is very often applied in order to achieve sufficient accuracy as well as efficiency of the numerical solution. The recently rediscovered weighted splitting schemes have the great advantage of being parallelizable on operator level, which allows us to reduce the computational time if parallel computers are used. In this paper, the computational times needed for the weighted splitting methods are studied in comparison with the sequential (S) splitting and the Marchuk-Strang (MSt) splitting and are illustrated by numerical experiments performed by use of simplified versions of the Danish Eulerian model (DEM).