The sky is the limit? The determinants and constraints of European airports' commercial revenues

This study investigates the determinants of commercial and retail airport revenues as well as revenues from real estate operations. Cross-sectional OLS, 2SLS and robust regression models of European airports identify a number of significant drivers of airport revenues. Aviation revenues per passenger are mainly determined by the national income per capita in which the airport is located, the percentage of leisure travelers and the size of the airport proxied by total aviation revenues. Main drivers of commercial revenues per passenger include the total number of passengers passing through the airport, the ratio of commercial to total revenues, the national income, the share of domestic and leisure travelers and the total number of flights. These results are in line with previous findings of a negative influence of business travelers on commercial revenues per passenger. We also find that a high amount of retail space per passenger is generally associated with lower commercial revenues per square meter confirming decreasing marginal revenue effects. Real estate revenues per passenger are positively associated with national income per capita at airport location, share of intra-EU passengers and percent delayed flights. Overall, aviation and non-aviation revenues appear to be strongly interlinked, underlining the potential for a comprehensive airport management strategy above and beyond mere cost minimization of the aviation sector.

Causal volumes in distributed virtual reality

Research to date has tended to concentrate on bandwidth considerations to increase scalability in distributed interactive simulation and virtual reality systems. This paper proposes that the major concern for latency in user interaction is that of the fundamental limit of communication rate due to the speed of light. Causal volumes and surfaces are introduced as a model of the limitations of causality caused by this fundamental delay. The concept of virtual world critical speed is introduced, which can be determined from the causal surface. The implications of the critical speed are discussed, and relativistic dynamics are used to constrain the object speed, in the same way speeds are bounded in the real world.

Limit operators, collective compactness, and the spectral theory of infinite matrices

In the first half of this memoir we explore the interrelationships between the abstract theory of limit operators (see e.g. the recent monographs of Rabinovich, Roch and Silbermann (2004) and Lindner (2006)) and the concepts and results of the generalised collectively compact operator theory introduced by Chandler-Wilde and Zhang (2002). We build up to results obtained by applying this generalised collectively compact operator theory to the set of limit operators of an operator (its operator spectrum). In the second half of this memoir we study bounded linear operators on the generalised sequence space , where and is some complex Banach space. We make what seems to be a more complete study than hitherto of the connections between Fredholmness, invertibility, invertibility at infinity, and invertibility or injectivity of the set of limit operators, with some emphasis on the case when the operator is a locally compact perturbation of the identity. Especially, we obtain stronger results than previously known for the subtle limiting cases of and . Our tools in this study are the results from the first half of the memoir and an exploitation of the partial duality between and and its implications for bounded linear operators which are also continuous with respect to the weaker topology (the strict topology) introduced in the first half of the memoir. Results in this second half of the memoir include a new proof that injectivity of all limit operators (the classic Favard condition) implies invertibility for a general class of almost periodic operators, and characterisations of invertibility at infinity and Fredholmness for operators in the so-called Wiener algebra. In two final chapters our results are illustrated by and applied to concrete examples. Firstly, we study the spectra and essential spectra of discrete Schrödinger operators (both self-adjoint and non-self-adjoint), including operators with almost periodic and random potentials. In the final chapter we apply our results to integral operators on .

Chaos in high performance digital robot controllers

Active robot force control requires some form of dynamic inner loop control for stability. The author considers the implementation of position-based inner loop control on an industrial robot fitted with encoders only. It is shown that high gain velocity feedback for such a robot, which is effectively stationary when in contact with a stiff environment, involves problems beyond the usual caveats on the effects of unknown environment stiffness. It is shown that it is possible for the controlled joint to become chaotic at very low velocities if encoder edge timing data are used for velocity measurement. The results obtained indicate that there is a lower limit on controlled velocity when encoders are the only means of joint measurement. This lower limit to speed is determined by the desired amount of loop gain, which is itself determined by the severity of the nonlinearities present in the drive system.

Implementation of Parallel (p,q) Counters for High Speed Digital Multipliers

Both the (5,3) counter and (2,2,3) counter multiplication techniques are investigated for the efficiency of their operation speed and the viability of the architectures when implemented in a fast bipolar ECL technology. The implementation of the counters in series-gated ECL and threshold logic are contrasted for speed, noise immunity and complexity, and are critically compared with the fastest practical design of a full-adder. A novel circuit technique to overcome the problems of needing high fan-in input weights in threshold circuits through the use of negative weighted inputs is presented. The authors conclude that a (2,2,3) counter based array multiplier implemented in series-gated ECL should enable a significant increase in speed over conventional full adder based array multipliers.

Parallel Architectures for High Speed Multipliers

The authors compare various array multiplier architectures based on (p,q) counter circuits. The tradeoff in multiplier design is always between adding complexity and increasing speed. It is shown that by using a (2,2,3) counter cell it is possible to gain a significant increase in speed over a conventional full-adder, carry-save array based approach. The increase in complexity should be easily accommodated using modern emitter-coupled-logic processes.

Predicting the arrival of high-speed solar wind streams at Earth using the STEREO Heliospheric Imagers

High-speed solar wind streams modify the Earth's geomagnetic environment, perturbing the ionosphere, modulating the flux of cosmic rays into the Earth atmosphere, and triggering substorms. Such activity can affect modern technological systems. To investigate the potential for predicting the arrival of such streams at Earth, images taken by the Heliospheric Imager (HI) on the STEREO-A spacecraft have been used to identify the onsets of high-speed solar wind streams from observations of regions of increased plasma concentrations associated with corotating interaction regions, or CIRs. In order to confirm that these transients were indeed associated with CIRs and to study their average properties, arrival times predicted from the HI images were used in a superposed epoch analysis to confirm their identity in near-Earth solar wind data obtained by the Advanced Composition Explorer (ACE) spacecraft and to observe their influence on a number of salient geophysical parameters. The results are almost identical to those of a parallel superposed epoch analysis that used the onset times of the high-speed streams derived from east/west deflections in the ACE measurements of solar wind speed to predict the arrival of such streams at Earth, assuming they corotated with the Sun with a period of 27 days. Repeating the superposed epoch analysis using restricted data sets demonstrates that this technique can provide a timely prediction of the arrival of CIRs at least 1 day ahead of their arrival at Earth and that such advanced warning can be provided from a spacecraft placed 40° ahead of Earth in its orbit.

Age related changes in speed and mechanism of adult skeletal muscle stem cell migration

Skeletal muscle undergoes a progressive age-related loss in mass and function. Preservation of muscle mass depends in part on satellite cells, the resident stem cells of skeletal muscle. Reduced satellite cell function may contribute to the age-associated decrease in muscle mass. Here we focused on characterising the effect of age on satellite cell migration. We report that aged satellite cells migrate at less than half the speed of young cells. In addition, aged cells show abnormal membrane extension and retraction characteristics required for amoeboid based cell migration. Aged satellite cells displayed low levels of integrin expression. By deploying a mathematical model approach to investigate mechanism of migration, we have found that young satellite cells move in a random ‘memoryless’ manner whereas old cells demonstrate superdiffusive tendencies. Most importantly, we show that nitric oxide, a key regulator of cell migration, reversed the loss in migration speed and reinstated the unbiased mechanism of movement in aged satellite cells. Finally we found that although Hepatocyte Growth Factor increased the rate of aged satellite cell movement it did not restore the memoryless migration characteristics displayed in young cells. Our study shows that satellite cell migration, a key component of skeletal muscle regeneration, is compromised during aging. However, we propose clinically approved drugs could be used to overcome these detrimental changes.

Large is fast, small is tight: determinants of speed and affinity in subunit capture by a periplasmic chaperone

The chaperone/usher pathway assembles surface virulence organelles of Gram-negative bacteria, consisting of fibers of linearly polymerized protein subunits. Fiber subunits are connected through 'donor strand complementation': each subunit completes the immunoglobulin (Ig)-like fold of the neighboring subunit by donating the seventh β-strand in trans. Whereas the folding of Ig domains is a fast first-order process, folding of Ig modules into the fiber conformation is a slow second-order process. Periplasmic chaperones separate this process in two parts by forming transient complexes with subunits. Interactions between chaperones and subunits are also based on the principle of donor strand complementation. In this study, we have performed mutagenesis of the binding motifs of the Caf1M chaperone and Caf1 capsular subunit from Yersinia pestis and analyzed the effect of the mutations on the structure, stability, and kinetics of Caf1M-Caf1 and Caf1-Caf1 interactions. The results suggest that a large hydrophobic effect combined with extensive main-chain hydrogen bonding enables Caf1M to rapidly bind an early folding intermediate of Caf1 and direct its partial folding. The switch from the Caf1M-Caf1 contact to the less hydrophobic, but considerably tighter and less dynamic Caf1-Caf1 contact occurs via the zip-out-zip-in donor strand exchange pathway with pocket 5 acting as the initiation site. Based on these findings, Caf1M was engineered to bind Caf1 faster, tighter, or both faster and tighter. To our knowledge, this is the first successful attempt to rationally design an assembly chaperone with improved chaperone function.

Reconstruction of gusty wind speed time series from autonomous data logger records

The collection of wind speed time series by means of digital data loggers occurs in many domains, including civil engineering, environmental sciences and wind turbine technology. Since averaging intervals are often significantly larger than typical system time scales, the information lost has to be recovered in order to reconstruct the true dynamics of the system. In the present work we present a simple algorithm capable of generating a real-time wind speed time series from data logger records containing the average, maximum, and minimum values of the wind speed in a fixed interval, as well as the standard deviation. The signal is generated from a generalized random Fourier series. The spectrum can be matched to any desired theoretical or measured frequency distribution. Extreme values are specified through a postprocessing step based on the concept of constrained simulation. Applications of the algorithm to 10-min wind speed records logged at a test site at 60 m height above the ground show that the recorded 10-min values can be reproduced by the simulated time series to a high degree of accuracy.

Multi-vehicle planning using RRT-connect

The problem of planning multiple vehicles deals with the design of an effective algorithm that can cause multiple autonomous vehicles on the road to communicate and generate a collaborative optimal travel plan. Our modelling of the problem considers vehicles to vary greatly in terms of both size and speed, which makes it suboptimal to have a faster vehicle follow a slower vehicle or for vehicles to drive with predefined speed lanes. It is essential to have a fast planning algorithm whilst still being probabilistically complete. The Rapidly Exploring Random Trees (RRT) algorithm developed and reported on here uses a problem specific coordination axis, a local optimization algorithm, priority based coordination, and a module for deciding travel speeds. Vehicles are assumed to remain in their current relative position laterally on the road unless otherwise instructed. Experimental results presented here show regular driving behaviours, namely vehicle following, overtaking, and complex obstacle avoidance. The ability to showcase complex behaviours in the absence of speed lanes is characteristic of the solution developed.

Motion planning of autonomous vehicles in a non-autonomous vehicle environment without speed lanes

Planning is one of the key problems for autonomous vehicles operating in road scenarios. Present planning algorithms operate with the assumption that traffic is organised in predefined speed lanes, which makes it impossible to allow autonomous vehicles in countries with unorganised traffic. Unorganised traffic is though capable of higher traffic bandwidths when constituting vehicles vary in their speed capabilities and sizes. Diverse vehicles in an unorganised exhibit unique driving behaviours which are analysed in this paper by a simulation study. The aim of the work reported here is to create a planning algorithm for mixed traffic consisting of both autonomous and non-autonomous vehicles without any inter-vehicle communication. The awareness (e.g. vision) of every vehicle is restricted to nearby vehicles only and a straight infinite road is assumed for decision making regarding navigation in the presence of multiple vehicles. Exhibited behaviours include obstacle avoidance, overtaking, giving way for vehicles to overtake from behind, vehicle following, adjusting the lateral lane position and so on. A conflict of plans is a major issue which will almost certainly arise in the absence of inter-vehicle communication. Hence each vehicle needs to continuously track other vehicles and rectify plans whenever a collision seems likely. Further it is observed here that driver aggression plays a vital role in overall traffic dynamics, hence this has also been factored in accordingly. This work is hence a step forward towards achieving autonomous vehicles in unorganised traffic, while similar effort would be required for planning problems such as intersections, mergers, diversions and other modules like localisation.