A modified PNN algorithm with optimal PD modeling using the orthogonal least squares method

In this paper a modified algorithm is suggested for developing polynomial neural network (PNN) models. Optimal partial description (PD) modeling is introduced at each layer of the PNN expansion, a task accomplished using the orthogonal least squares (OLS) method. Based on the initial PD models determined by the polynomial order and the number of PD inputs, OLS selects the most significant regressor terms reducing the output error variance. The method produces PNN models exhibiting a high level of accuracy and superior generalization capabilities. Additionally, parsimonious models are obtained comprising a considerably smaller number of parameters compared to the ones generated by means of the conventional PNN algorithm. Three benchmark examples are elaborated, including modeling of the gas furnace process as well as the iris and wine classification problems. Extensive simulation results and comparison with other methods in the literature, demonstrate the effectiveness of the suggested modeling approach.

Online bayesian inference in some time-frequency representations of non-stationary processes

The use of Bayesian inference in the inference of time-frequency representations has, thus far, been limited to offline analysis of signals, using a smoothing spline based model of the time-frequency plane. In this paper we introduce a new framework that allows the routine use of Bayesian inference for online estimation of the time-varying spectral density of a locally stationary Gaussian process. The core of our approach is the use of a likelihood inspired by a local Whittle approximation. This choice, along with the use of a recursive algorithm for non-parametric estimation of the local spectral density, permits the use of a particle filter for estimating the time-varying spectral density online. We provide demonstrations of the algorithm through tracking chirps and the analysis of musical data.

Mg/Ca partitioning between aqueous solution and aragonite mineral: a molecular dynamics study

We have calculated the concentrations of Mg in the bulk and surfaces of aragonite CaCO3 in equilibrium with aqueous solution, based on molecular dynamics simulations and grand-canonical statistical mechanics. Mg is incorporated in the surfaces, in particular in the (001) terraces, rather than in the bulk of aragonite particles. However, the total Mg content in the bulk and surface of aragonite particles was found to be too small to account for the measured Mg/Ca ratios in corals. We therefore argue that most Mg in corals is either highly metastable in the aragonite lattice, or is located outside the aragonite phase of the coral skeleton, and we discuss the implications of this finding for Mg/Ca paleothermometry.

Improved evaporative flux partitioning and carbon flux in the land surface model JULES: impact on the simulation of land surface processes in temperate Europe

The primary role of land surface models embedded in climate models is to partition surface available energy into upwards, radiative, sensible and latent heat fluxes. Partitioning of evapotranspiration, ET, is of fundamental importance: as a major component of the total surface latent heat flux, ET affects the simulated surface water balance, and related energy balance, and consequently the feedbacks with the atmosphere. In this context it is also crucial to credibly represent the CO2 exchange between ecosystems and their environment. In this study, JULES, the land surface model used in UK weather and climate models, has been evaluated for temperate Europe. Compared to eddy covariance flux measurements, the CO2 uptake by the ecosystem is underestimated and the ET overestimated. In addition, the contribution to ET from soil and intercepted water evaporation far outweighs the contribution of plant transpiration. To alleviate these biases, adaptations have been implemented in JULES, based on key literature references. These adaptations have improved the simulation of the spatio-temporal variability of the fluxes and the accuracy of the simulated GPP and ET, including its partitioning. This resulted in a shift of the seasonal soil moisture cycle. These adaptations are expected to increase the fidelity of climate simulations over Europe. Finally, the extreme summer of 2003 was used as evaluation benchmark for the use of the model in climate change studies. The improved model captures the impact of the 2003 drought on the carbon assimilation and the water use efficiency of the plants. It, however, underestimates the 2003 GPP anomalies. The simulations showed that a reduction of evaporation from the interception and soil reservoirs, albeit not of transpiration, largely explained the good correlation between the carbon and the water fluxes anomalies that was observed during 2003. This demonstrates the importance of being able to discriminate the response of individual component of the ET flux to environmental forcing.

High resolution simulation of the variability of surface energy balance fluxes across central London with urban zones for energy partitioning

The parameterization of surface heat-flux variability in urban areas relies on adequate representation of surface characteristics. Given the horizontal resolutions (e.g. ≈0.1–1km) currently used in numerical weather prediction (NWP) models, properties of the urban surface (e.g. vegetated/built surfaces, street-canyon geometries) often have large spatial variability. Here, a new approach based on Urban Zones to characterize Energy partitioning (UZE) is tested within a NWP model (Weather Research and Forecasting model;WRF v3.2.1) for Greater London. The urban land-surface scheme is the Noah/Single-Layer Urban Canopy Model (SLUCM). Detailed surface information (horizontal resolution 1 km)in central London shows that the UZE offers better characterization of surface properties and their variability compared to default WRF-SLUCM input parameters. In situ observations of the surface energy fluxes and near-surface meteorological variables are used to select the radiation and turbulence parameterization schemes and to evaluate the land-surface scheme

Multi-site evaluation of an urban land-surface model: intra-urban heterogeneity, seasonality and parameter complexity requirements

An extensive off-line evaluation of the Noah/Single Layer Urban Canopy Model (Noah/SLUCM) urban land-surface model is presented using data from 15 sites to assess (1) the ability of the scheme to reproduce the surface energy balance observed in a range of urban environments, including seasonal changes, and (2) the impact of increasing complexity of input parameter information. Model performance is found to be most dependent on representation of vegetated surface area cover; refinement of other parameter values leads to smaller improvements. Model biases in net all-wave radiation and trade-offs between turbulent heat fluxes are highlighted using an optimization algorithm. Here we use the Urban Zones to characterize Energy partitioning (UZE) as the basis to assign default SLUCM parameter values. A methodology (FRAISE) to assign sites (or areas) to one of these categories based on surface characteristics is evaluated. Using three urban sites from the Basel Urban Boundary Layer Experiment (BUBBLE) dataset, an independent evaluation of the model performance with the parameter values representative of each class is performed. The scheme copes well with both seasonal changes in the surface characteristics and intra-urban heterogeneities in energy flux partitioning, with RMSE performance comparable to similar state-of-the-art models for all fluxes, sites and seasons. The potential of the methodology for high-resolution atmospheric modelling application using the Weather Research and Forecasting (WRF) model is highlighted. This analysis supports the recommendations that (1) three classes are appropriate to characterize the urban environment, and (2) that the parameter values identified should be adopted as default values in WRF.

FAMOUS, faster: using parallel computing techniques to accelerate the FAMOUS/HadCM3 climate model with a focus on the radiative transfer algorithm

We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations. The modified algorithm runs more than 50 times faster on the CELL’s Synergistic Processing Elements than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60% of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.

A peak reduction scheduling algorithm for storage devices on the low voltage network

Reinforcing the Low Voltage (LV) distribution network will become essential to ensure it remains within its operating constraints as demand on the network increases. The deployment of energy storage in the distribution network provides an alternative to conventional reinforcement. This paper presents a control methodology for energy storage to reduce peak demand in a distribution network based on day-ahead demand forecasts and historical demand data. The control methodology pre-processes the forecast data prior to a planning phase to build in resilience to the inevitable errors between the forecasted and actual demand. The algorithm uses no real time adjustment so has an economical advantage over traditional storage control algorithms. Results show that peak demand on a single phase of a feeder can be reduced even when there are differences between the forecasted and the actual demand. In particular, results are presented that demonstrate when the algorithm is applied to a large number of single phase demand aggregations that it is possible to identify which of these aggregations are the most suitable candidates for the control methodology.

Exogenous alpha-Synuclein decreases raft partitioning of Cav2.2 channels inducing dopamine release

alpha-Synuclein is thought to regulate neurotransmitter release through multiple interactions with presynaptic proteins, cytoskeletal elements, ion channels, and synaptic vesicles membrane. alpha-Synuclein is abundant in the presynaptic compartment, and its release from neurons and glia has been described as responsible for spreading of alpha-synuclein-derived pathology. alpha-Synuclein-dependent dysregulation of neurotransmitter release might occur via its action on surface-exposed calcium channels. Here, we provide electrophysiological and biochemical evidence to show that alpha-synuclein, applied to rat neurons in culture or striatal slices, selectively activates Cav2.2 channels, and said activation correlates with increased neurotransmitter release. Furthermore, in vivo perfusion of alpha-synuclein into the striatum also leads to acute dopamine release. We further demonstrate that alpha-synuclein reduces the amount of plasma membrane cholesterol and alters the partitioning of Cav2.2 channels, which move from raft to cholesterol-poor areas of the plasma membrane. We provide evidence for a novel mechanism through which alpha-synuclein acts from the extracellular milieu to modulate neurotransmitter release and propose a unifying hypothesis for the mechanism of alpha-synuclein action on multiple targets: the reorganization of plasma membrane microdomains.

An isotope dilution model for partitioning phenylalanine and tyrosine uptake by the mammary gland of lactating dairy cows

An isotope dilution model for partitioning phenylalanine and tyrosine uptake by the mammary gland of the lactating dairy cow is constructed and solved in the steady state. The model contains four intracellular and four extracellular pools and conservation of mass principles are applied to generate the fundamental equations describing the behaviour of the system. The experimental measurements required for model solution are milk secretion and plasma flow rate across the gland in combination with phenylalanine and tyrosine concentrations and plateau isotopic enrichments in arterial and venous plasma and free and protein bound milk during a constant infusion of [1-(13)C]phenylalanine and [2,3,5,6-(2)H]tyrosine tracer. If assumptions are made, model solution enables determination of steady state flows for phenylalanine and tyrosine inflow to the gland, outflow from it and bypass, and flows representing the synthesis and degradation of constitutive protein and hydroxylation. The model is effective in providing information about the fates of phenylalanine and tyrosine in the mammary gland and could be used as part of a more complex system describing amino acid metabolism in the whole ruminant.

Simple M-factor algorithm for improved estimation of the basic maximum usable frequency of radio waves reflected from the ionospheric F-region

The equations of Milsom are evaluated, giving the ground range and group delay of radio waves propagated via the horizontally stratified model ionosphere proposed by Bradley and Dudeney. Expressions for the ground range which allow for the effects of the underlying E- and F1-regions are used to evaluate the basic maximum usable frequency or M-factors for single F-layer hops. An algorithm for the rapid calculation of the M-factor at a given range is developed, and shown to be accurate to within 5%. The results reveal that the M(3000)F2-factor scaled from vertical-incidence ionograms using the standard URSI procedure can be up to 7.5% in error. A simple addition to the algorithm effects a correction to ionogram values to make these accurate to 0.5%.

The effect of alkyl substitution on the extraction properties of BTPhen ligands for the partitioning of trivalent minor actinides and lanthanides in spent nuclear fuels

Bis-triazinylphenanthroline ligands (BTPhens), which contain additional alkyl (n-butyl and sec-butyl) groups attached to the triazine rings, have been synthesized, and the effects of this alkyl substitution on their extraction properties with Ln(III) and An(III) cations in simulated nuclear waste solutions have been studied. The speciation of n-butyl-substituted ligand (C4- BTPhen) with some trivalent lanthanide nitrates was elucidated by 1 H-NMR spectroscopic titrations. These experiments have shown that the dominant species in solution were the 1:2 complexes [Ln(III)(BTPhen)2], even at higher Ln(III) concentrations, and the relative stability of 2:1 to 1:1 BTPhen-Ln(III) complexes varied with different lanthanides. As expected, sec-butylsubstituted ligand (sec-C4 BTPhen) showed higher solubility than C4-BTPhen in certain diluents. A greater separation factor (SFAm/Eu = ca. 210) was observed for sec-C4-BTPhen compared to C4-BTPhen (SFAm/Eu = ca. 125) in 1-octanol at 4 M HNO3 solutions. The greater separation factor may be due to the higher solubility of the 2:1 complex for sec-C4-BTPhen at the interface than the 1:1 complex of C4-BTPhen.

Bit-index sort: a fast non-comparison integer sorting algorithm for permutations

This paper describes a fast integer sorting algorithm, herein referred as Bit-index sort, which is a non-comparison sorting algorithm for partial per-mutations, with linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers supported by machine hardware to retrieve the ordered output sequence. Results show that Bit-index sort outperforms in execution time to quicksort and counting sort algorithms. A parallel approach for Bit-index sort using two simultaneous threads is included, which obtains speedups up to 1.6.