Physical interpretation of the correlation between multi-angle spectral data and canopy height

Recent empirical studies have shown that multi-angle spectral data can be useful for predicting canopy height, but the physical reason for this correlation was not understood. We follow the concept of canopy spectral invariants, specifically escape probability, to gain insight into the observed correlation. Airborne Multi-Angle Imaging Spectrometer (AirMISR) and airborne Laser Vegetation Imaging Sensor (LVIS) data acquired during a NASA Terrestrial Ecology Program aircraft campaign underlie our analysis. Two multivariate linear regression models were developed to estimate LVIS height measures from 28 AirMISR multi-angle spectral reflectances and from the spectrally invariant escape probability at 7 AirMISR view angles. Both models achieved nearly the same accuracy, suggesting that canopy spectral invariant theory can explain the observed correlation. We hypothesize that the escape probability is sensitive to the aspect ratio (crown diameter to crown height). The multi-angle spectral data alone therefore may not provide enough information to retrieve canopy height globally.

Mean-tracking clustering algorithm for radial basis function centre selection

Radial basis functions can be combined into a network structure that has several advantages over conventional neural network solutions. However, to operate effectively the number and positions of the basis function centres must be carefully selected. Although no rigorous algorithm exists for this purpose, several heuristic methods have been suggested. In this paper a new method is proposed in which radial basis function centres are selected by the mean-tracking clustering algorithm. The mean-tracking algorithm is compared with k means clustering and it is shown that it achieves significantly better results in terms of radial basis function performance. As well as being computationally simpler, the mean-tracking algorithm in general selects better centre positions, thus providing the radial basis functions with better modelling accuracy

Robust initialisation of Gaussian radial basis function networks using partitioned k-means clustering

Radial basis function networks can be trained quickly using linear optimisation once centres and other associated parameters have been initialised. The authors propose a small adjustment to a well accepted initialisation algorithm which improves the network accuracy over a range of problems. The algorithm is described and results are presented.

Preparation of (–)-epigallocatechin gallate from commercial green tea by caffeine precipitation and solvent partition

A method has been developed which enables the easy and inexpensive preparation of gram quantities of (–)-epigallocatechin gallate from green tea (Camellia sinensis). A decaffeinated aqueous brew of commercial green tea is treated with caffeine (30 m ). The precipitate is redissolved after decaffeination with chloroform and further purified by solvent partition with ethyl hexanoate and propyl acetate. Commercial leaf (25 g) yields 400 mg (–)-epigallocatechin gallate at better than 80% purity, as judged by reversed phase HPLC.

Modelling niches of arbitrary shape in genetic algorithms using Niche Linkage in the Dynamic Niche Clustering framework

We present some additions to a fuzzy variable radius niche technique called Dynamic Niche Clustering (DNC) (Gan and Warwick, 1999; 2000; 2001) that enable the identification and creation of niches of arbitrary shape through a mechanism called Niche Linkage. We show that by using this mechanism it is possible to attain better feature extraction from the underlying population.

Dynamic Niche Clustering: a fuzzy variable radius niching technique for multimodal optimisation in GAs

This paper describes the recent developments and improvements made to the variable radius niching technique called Dynamic Niche Clustering (DNC). DNC is fitness sharing based technique that employs a separate population of overlapping fuzzy niches with independent radii which operate in the decoded parameter space, and are maintained alongside the normal GA population. We describe a speedup process that can be applied to the initial generation which greatly reduces the complexity of the initial stages. A split operator is also introduced that is designed to counteract the excessive growth of niches, and it is shown that this improves the overall robustness of the technique. Finally, the effect of local elitism is documented and compared to the performance of the basic DNC technique on a selection of 2D test functions. The paper is concluded with a view to future work to be undertaken on the technique.

Cloud base height and cosmic rays

Cosmic rays modify current flow in the global atmospheric electrical circuit. Charging at horizontal layer cloud edges has been observed to be consistent with global circuit vertical current flow through the cloud, which can modify the properties of small and pure water droplets. Studies have been hampered by the absence of cloud edge observations, hence cloud base height information is investigated here. Cloud base height measured at the Lerwick Observatory, Shetland, UK, is analysed using threshold tests and spectral analysis. The cloud base height distributions for low cloud (cloud base less than 800 m) are found to vary with cosmic ray conditions. Further, 27 day and 1.68 year periodicities characteristic of cosmic ray variations are present, weakly, in the cloud base height data of stratiform clouds, when such periodicities are present in neutron monitor cosmic ray data. These features support the idea of propagation of heliospheric variability into layer clouds, through the global atmospheric electric circuit.

Reduced height alleles (Rht) and Hagberg falling number of wheat

Near isogenic lines varying for alleles for reduced height (Rht) and photoperiod insensitivity (Ppd-D1) in cv. Mercia (2005/6 to 2010/11; rht (tall), Rht-B1b, Rht-D1b, Rht-B1c, Rht8c+Ppd-D1a, Rht-D1c, Rht12) and cvs Maris Huntsman and Maris Widgeon (2007/8 to 2010/11; rht (tall), Rht-B1b, Rht-D1b, Rht-B1c, Rht-B1b+Rht-D1b, Rht-D1b+Rht-B1c) were compared at one field site, but within different systems (‘organic’, O, 2005/6 to 2007/8 v ‘intensive’, I, 2005/6 to 2010/11). Further experiments at the site (2006/7 to 2008/9) compared 64 lines of a doubled haploid (DH) population [Savannah (Rht-D1b) × Renesansa (Rht-8c+Ppd-D1a)]. Gibberellin (GA) insensitive dwarfing alleles (Rht-B1b; Rht-B1c; Rht-D1b; Rht-D1c) could reduce α-amylase activity and/or increase Hagberg falling number (HFN) but effects depended greatly on system, background and season. Only Rht-B1c increased grain dormancy despite producing plants taller than Rht-D1c. The GA-sensitive Rht8c+Ppd-D1a in Mercia was associated with reduced HFN but analysis of the DH population suggested this was more closely linked with Ppd-D1a, rather than Rht8c. The severe GA-sensitive dwarfing allele Rht12 was associated with reduced HFN. Instability in HFN over season tended to increase with degree of dwarfing. There was a negative association between mean grain weight and HFN that was in addition to effects of Rht and Ppd-D1 allele.

Epidemic K-Means clustering

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. This work proposes a fully decentralised algorithm (Epidemic K-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art distributed K-Means algorithms based on sampling methods. The experimental analysis confirms that the proposed algorithm is a practical and accurate distributed K-Means implementation for networked systems of very large and extreme scale.

Advances in sequential data assimilation and numerical weather forecasting: an Ensemble Transform Kalman-Bucy Filter, a study on clustering in deterministic Ensemble Square Root Filters, and a test of a new time stepping scheme in an atmospheric model

This dissertation deals with aspects of sequential data assimilation (in particular ensemble Kalman filtering) and numerical weather forecasting. In the first part, the recently formulated Ensemble Kalman-Bucy (EnKBF) filter is revisited. It is shown that the previously used numerical integration scheme fails when the magnitude of the background error covariance grows beyond that of the observational error covariance in the forecast window. Therefore, we present a suitable integration scheme that handles the stiffening of the differential equations involved and doesn’t represent further computational expense. Moreover, a transform-based alternative to the EnKBF is developed: under this scheme, the operations are performed in the ensemble space instead of in the state space. Advantages of this formulation are explained. For the first time, the EnKBF is implemented in an atmospheric model. The second part of this work deals with ensemble clustering, a phenomenon that arises when performing data assimilation using of deterministic ensemble square root filters in highly nonlinear forecast models. Namely, an M-member ensemble detaches into an outlier and a cluster of M-1 members. Previous works may suggest that this issue represents a failure of EnSRFs; this work dispels that notion. It is shown that ensemble clustering can be reverted also due to nonlinear processes, in particular the alternation between nonlinear expansion and compression of the ensemble for different regions of the attractor. Some EnSRFs that use random rotations have been developed to overcome this issue; these formulations are analyzed and their advantages and disadvantages with respect to common EnSRFs are discussed. The third and last part contains the implementation of the Robert-Asselin-Williams (RAW) filter in an atmospheric model. The RAW filter is an improvement to the widely popular Robert-Asselin filter that successfully suppresses spurious computational waves while avoiding any distortion in the mean value of the function. Using statistical significance tests both at the local and field level, it is shown that the climatology of the SPEEDY model is not modified by the changed time stepping scheme; hence, no retuning of the parameterizations is required. It is found the accuracy of the medium-term forecasts is increased by using the RAW filter.