A cell by cell anisotropic adaptive mesh ALE scheme for the numerical solution of the Euler equations

In this paper a cell by cell anisotropic adaptive mesh technique is added to an existing staggered mesh Lagrange plus remap finite element ALE code for the solution of the Euler equations. The quadrilateral finite elements may be subdivided isotropically or anisotropically and a hierarchical data structure is employed. An efficient computational method is proposed, which only solves on the finest level of resolution that exists for each part of the domain with disjoint or hanging nodes being used at resolution transitions. The Lagrangian, equipotential mesh relaxation and advection (solution remapping) steps are generalised so that they may be applied on the dynamic mesh. It is shown that for a radial Sod problem and a two-dimensional Riemann problem the anisotropic adaptive mesh method runs over eight times faster.

Towards the automatic reconstruction of dendritic trees using particle filters

The 3D reconstruction of a Golgi-stained dendritic tree from a serial stack of images captured with a transmitted light bright-field microscope is investigated. Modifications to the bootstrap filter are discussed such that the tree structure may be estimated recursively as a series of connected segments. The tracking performance of the bootstrap particle filter is compared against Differential Evolution, an evolutionary global optimisation method, both in terms of robustness and accuracy. It is found that the particle filtering approach is significantly more robust and accurate for the data considered.

Induction of modular classification rules: using Jmax-pruning

The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree structure. Classifiers induced by Prism algorithms achieve a comparable accuracy compared with decision trees and in some cases even outperform decision trees. Both kinds of algorithms tend to overfit on large and noisy datasets and this has led to the development of pruning methods. Pruning methods use various metrics to truncate decision trees or to eliminate whole rules or single rule terms from a Prism rule set. For decision trees many pre-pruning and postpruning methods exist, however for Prism algorithms only one pre-pruning method has been developed, J-pruning. Recent work with Prism algorithms examined J-pruning in the context of very large datasets and found that the current method does not use its full potential. This paper revisits the J-pruning method for the Prism family of algorithms and develops a new pruning method Jmax-pruning, discusses it in theoretical terms and evaluates it empirically.

Jmax-pruning: a facility for the information theoretic pruning of modular classification rules

The Prism family of algorithms induces modular classification rules in contrast to the Top Down Induction of Decision Trees (TDIDT) approach which induces classification rules in the intermediate form of a tree structure. Both approaches achieve a comparable classification accuracy. However in some cases Prism outperforms TDIDT. For both approaches pre-pruning facilities have been developed in order to prevent the induced classifiers from overfitting on noisy datasets, by cutting rule terms or whole rules or by truncating decision trees according to certain metrics. There have been many pre-pruning mechanisms developed for the TDIDT approach, but for the Prism family the only existing pre-pruning facility is J-pruning. J-pruning not only works on Prism algorithms but also on TDIDT. Although it has been shown that J-pruning produces good results, this work points out that J-pruning does not use its full potential. The original J-pruning facility is examined and the use of a new pre-pruning facility, called Jmax-pruning, is proposed and evaluated empirically. A possible pre-pruning facility for TDIDT based on Jmax-pruning is also discussed.

Random prism: an alternative to random forests

Ensemble learning techniques generate multiple classifiers, so called base classifiers, whose combined classification results are used in order to increase the overall classification accuracy. In most ensemble classifiers the base classifiers are based on the Top Down Induction of Decision Trees (TDIDT) approach. However, an alternative approach for the induction of rule based classifiers is the Prism family of algorithms. Prism algorithms produce modular classification rules that do not necessarily fit into a decision tree structure. Prism classification rulesets achieve a comparable and sometimes higher classification accuracy compared with decision tree classifiers, if the data is noisy and large. Yet Prism still suffers from overfitting on noisy and large datasets. In practice ensemble techniques tend to reduce the overfitting, however there exists no ensemble learner for modular classification rule inducers such as the Prism family of algorithms. This article describes the first development of an ensemble learner based on the Prism family of algorithms in order to enhance Prism’s classification accuracy by reducing overfitting.

Recent patterns of change in vegetation structure and tree composition of British broadleaved woodland: evidence from large-scale surveys

Evidence is presented of widespread changes in structure and species composition between the 1980s and 2003–2004 from surveys of 249 British broadleaved woodlands. Structural components examined include canopy cover, vertical vegetation profiles, field-layer cover and deadwood abundance. Woods were located in 13 geographical localities and the patterns of change were examined for each locality as well as across all woods. Changes were not uniform throughout the localities; overall, there were significant decreases in canopy cover and increases in sub-canopy (2–10 m) cover. Changes in 0.5–2 m vegetation cover showed strong geographic patterns, increasing in western localities, but declining or showing no change in eastern localities. There were significant increases in canopy ash Fraxinus excelsior and decreases in oak Quercus robur/petraea. Shrub layer ash and honeysuckle Lonicera periclymenum increased while birch Betula spp. hawthorn Crataegus monogyna and hazel Corylus avellana declined. Within the field layer, both bracken Pteridium aquilinum and herbs increased. Overall, deadwood generally increased. Changes were consistent with reductions in active woodland management and changes in grazing and browsing pressure. These findings have important implications for sustainable active management of British broadleaved woodlands to meet silvicultural and biodiversity objectives.

Optimal control of a class of discrete–continuous non-linear systems — decomposition and hierarchical structure

A technique is derived for solving a non-linear optimal control problem by iterating on a sequence of simplified problems in linear quadratic form. The technique is designed to achieve the correct solution of the original non-linear optimal control problem in spite of these simplifications. A mixed approach with a discrete performance index and continuous state variable system description is used as the basis of the design, and it is shown how the global problem can be decomposed into local sub-system problems and a co-ordinator within a hierarchical framework. An analysis of the optimality and convergence properties of the algorithm is presented and the effectiveness of the technique is demonstrated using a simulation example with a non-separable performance index.

Patterns of pollen and seed dispersal in a small, fragmented population of the wind-pollinated tree Araucaria angustifolia in southern Brazil

Paternity analysis based on eight microsatellite loci was used to investigate pollen and seed dispersal patterns of the dioecious wind- pollinated tree, Araucaria angustifolia. The study sites were a 5.4 ha isolated forest fragment and a small tree group situated 1.7 km away, located in Paran alpha State, Brazil. In the forest fragment, 121 males, 99 females, 66 seedlings and 92 juveniles were mapped and genotyped, together with 210 seeds. In the tree group, nine male and two female adults were mapped and genotyped, together with 20 seeds. Paternity analysis within the forest fragment indicated that at least 4% of the seeds, 3% of the seedlings and 7% of the juveniles were fertilized by pollen from trees in the adjacent group, and 6% of the seeds were fertilized by pollen from trees outside these stands. The average pollination distance within the forest fragment was 83 m; when the tree group was included the pollination distance was 2006m. The average number of effective pollen donors was estimated as 12.6. Mother- trees within the fragment could be assigned to all seedlings and juveniles, suggesting an absence of seed immigration. The distance of seedlings and juveniles from their assigned mother- trees ranged from 0.35 to 291m ( with an average of 83m). Significant spatial genetic structure among adult trees, seedlings, and juveniles was detected up to 50m, indicating seed dispersal over a short distance. The effective pollination neighborhood ranged from 0.4 to 3.3 ha. The results suggest that seed dispersal is restricted but that there is longdistance pollen dispersal between the forest fragment and the tree group; thus, the two stands of trees are not isolated.

Use of an artificial root to examine the influence of 8-hydroxyquinoline on soil microbial activity and bacterial community structure

Invasive plant species have been shown to alter the microbial community composition of the soils they invade and it is suggested that this below-ground perturbation of potential pathogens, decomposers or symbionts may feedback positively to allow invasive success. Whether these perturbations are mediated through specific components of root exudation are not understood. We focussed on 8-hydroxyquinoline, a putative allelochemical of Centaurea diffusa (diffuse knapweed) and used an artificial root system to differentiate the effects of 8-hydroxyquinoline against a background of total rhizodeposition as mimicked through supply of a synthetic exudate solution. In soil proximal (0-10 cm) to the artificial root, synthetic exudates had a highly significant (P < 0.001) influence on dehydrogenase, fluorescein diacetate hydrolysis and urease activity. in addition, 8-hydroxyquinoline was significant (p = 0.003) as a main effect on dehydrogenase activity and interacted with synthetic exudates to affect urease activity (p = 0.09). Hierarchical cluster analysis of 16S rDNA-based DGGE band patterns also identified a primary affect of synthetic exudates and a secondary affect of 8-hydroxyquinoline on bacterial community structure. Thus, we show that the artificial rhizosphere produced by the synthetic exudates was the predominant effect, but, that the influence of the 8-hydroxyquinoline signal on the activity and structure of soil microbial communities could also be detected. (C) 2009 Elsevier Ltd. All rights reserved.

Dynamic load balancing in parallel KD-tree k-means

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.

A hierarchical distributed approach for mining molecular fragments

Recently, two approaches have been introduced that distribute the molecular fragment mining problem. The first approach applies a master/worker topology, the second approach, a completely distributed peer-to-peer system, solves the scalability problem due to the bottleneck at the master node. However, in many real world scenarios the participating computing nodes cannot communicate directly due to administrative policies such as security restrictions. Thus, potential computing power is not accessible to accelerate the mining run. To solve this shortcoming, this work introduces a hierarchical topology of computing resources, which distributes the management over several levels and adapts to the natural structure of those multi-domain architectures. The most important aspect is the load balancing scheme, which has been designed and optimized for the hierarchical structure. The approach allows dynamic aggregation of heterogenous computing resources and is applied to wide area network scenarios.

A hierarchical Bayesian model for predicting the functional consequences of amino-acid polymorphisms

Genetic polymorphisms in deoxyribonucleic acid coding regions may have a phenotypic effect on the carrier, e.g. by influencing susceptibility to disease. Detection of deleterious mutations via association studies is hampered by the large number of candidate sites; therefore methods are needed to narrow down the search to the most promising sites. For this, a possible approach is to use structural and sequence-based information of the encoded protein to predict whether a mutation at a particular site is likely to disrupt the functionality of the protein itself. We propose a hierarchical Bayesian multivariate adaptive regression spline (BMARS) model for supervised learning in this context and assess its predictive performance by using data from mutagenesis experiments on lac repressor and lysozyme proteins. In these experiments, about 12 amino-acid substitutions were performed at each native amino-acid position and the effect on protein functionality was assessed. The training data thus consist of repeated observations at each position, which the hierarchical framework is needed to account for. The model is trained on the lac repressor data and tested on the lysozyme mutations and vice versa. In particular, we show that the hierarchical BMARS model, by allowing for the clustered nature of the data, yields lower out-of-sample misclassification rates compared with both a BMARS and a frequen-tist MARS model, a support vector machine classifier and an optimally pruned classification tree.

Synthesis of heterosulfamates. Search for structure-taste relationships

Thirty one new sodium heterosulfamates, RNHSO3Na, where the R portion contains mainly thiazole, benzothiazole, thiadiazole and pyridine ring structures, have been synthesized and their taste portfolios have been assessed. A database of 132 heterosulfamates ( both open-chain and cyclic) has been formed by combining these new compounds with an existing set of 101 heterosulfamates which were previously synthesized and for which taste data are available. Simple descriptors have been obtained using (i) measurements with Corey-Pauling-Koltun (CPK) space- filling models giving x, y and z dimensions and a volume VCPK, (ii) calculated first order molecular connectivities ((1)chi(v)) and (iii) the calculated Spartan program parameters to obtain HOMO, LUMO energies, the solvation energy E-solv and V-SPART AN. The techniques of linear (LDA) and quadratic (QDA) discriminant analysis and Tree analysis have then been employed to develop structure-taste relationships (SARs) that classify the sweet (S) and non-sweet (N) compounds into separate categories. In the LDA analysis 70% of the compounds were correctly classified ( this compares with 65% when the smaller data set of 101 compounds was used) and in the QDA analysis 68% were correctly classified ( compared to 80% previously). TheTree analysis correctly classified 81% ( compared to 86% previously). An alternative Tree analysis derived using the Cerius2 program and a set of physicochemical descriptors correctly classified only 54% of the compounds.

Modelling spectral reflectance of open cork oak woodland: a simulation analysis of the effects of vegetation structure and background

This study analyses the influence of vegetation structure (i.e. leaf area index and canopy cover) and seasonal background changes on moderate-resolution imaging spectrometer (MODIS)-simulated reflectance data in open woodland. Approximately monthly spectral reflectance and transmittance field measurements (May 2011 to October 2013) of cork oak tree leaves (Quercus suber) and of the herbaceous understorey were recorded in the region of Ribatejo, Portugal. The geometric-optical and radiative transfer (GORT) model was used to simulate MODIS response (red, near-infrared) and to calculate vegetation indices, investigating their response to changes in the structure of the overstorey vegetation and to seasonal changes in the understorey using scenarios corresponding to contrasting phenological status (dry season vs. wet season). The performance of normalized difference vegetation index (NDVI), soil-adjusted vegetation index (SAVI), and enhanced vegetation index (EVI) is discussed. Results showed that SAVI and EVI were very sensitive to the emergence of background vegetation in the wet season compared to NDVI and that shading effects lead to an opposing trend in the vegetation indices. The information provided by this research can be useful to improve our understanding of the temporal dynamic of vegetation, monitored by vegetation indices.