Fault tolerance of Mobius cubes under two forbidden fault set models

An n-dimensional Mobius cube, 0MQ(n) or 1MQ(n), is a variation of n-dimensional cube Q(n) which possesses many attractive properties such as significantly smaller communication delay and stronger graph-embedding capabilities. In some practical situations, the fault tolerance of a distributed memory multiprocessor system can be measured more precisely by the connectivity of the underlying graph under forbidden fault set models. This article addresses the connectivity of 0MQ(n)/1MQ(n), under two typical forbidden fault set models. We first prove that the connectivity of 0MQ(n)/1MQ(n) is 2n - 2 when the fault set does not contain the neighborhood of any vertex as a subset. We then prove that the connectivity of 0MQ(n)/1MQ(n) is 3n - 5 provided that the neighborhood of any vertex as well as that of any edge cannot fail simultaneously These results demonstrate that 0MQ(n)/1MQ(n) has the same connectivity as Q(n) under either of the previous assumptions.

Modified level set method with Canny operator for image noise removal

The level set method is commonly used to address image noise removal. Existing studies concentrate mainly on determining the speed function of the evolution equation. Based on the idea of a Canny operator, this letter introduces a new method of controlling the level set evolution, in which the edge strength is taken into account in choosing curvature flows for the speed function and the normal to edge direction is used to orient the diffusion of the moving interface. The addition of an energy term to penalize the irregularity allows for better preservation of local edge information. In contrast with previous Canny-based level set methods that usually adopt a two-stage framework, the proposed algorithm can execute all the above operations in one process during noise removal.

Space partitioning for scalable K-means

K-Means is a popular clustering algorithm which adopts an iterative refinement procedure to determine data partitions and to compute their associated centres of mass, called centroids. The straightforward implementation of the algorithm is often referred to as `brute force' since it computes a proximity measure from each data point to each centroid at every iteration of the K-Means process. Efficient implementations of the K-Means algorithm have been predominantly based on multi-dimensional binary search trees (KD-Trees). A combination of an efficient data structure and geometrical constraints allow to reduce the number of distance computations required at each iteration. In this work we present a general space partitioning approach for improving the efficiency and the scalability of the K-Means algorithm. We propose to adopt approximate hierarchical clustering methods to generate binary space partitioning trees in contrast to KD-Trees. In the experimental analysis, we have tested the performance of the proposed Binary Space Partitioning K-Means (BSP-KM) when a divisive clustering algorithm is used. We have carried out extensive experimental tests to compare the proposed approach to the one based on KD-Trees (KD-KM) in a wide range of the parameters space. BSP-KM is more scalable than KDKM, while keeping the deterministic nature of the `brute force' algorithm. In particular, the proposed space partitioning approach has shown to overcome the well-known limitation of KD-Trees in high-dimensional spaces and can also be adopted to improve the efficiency of other algorithms in which KD-Trees have been used.

Biomass partitioning and growth efficiency in four naturally regenerated forest tree species

Current forest growth models and yield tables are almost exclusively based on data from mature trees, reducing their applicability to young and developing stands. To address this gap, young European beech, sessile oak, Scots pine and Norway spruce trees approximately 0 to 10 years old were destructively sampled in a range of naturally regenerated forest stands in Central Europe. Diameter at base and height were first measured in situ for up to 175 individuals per species. Subsequently, the trees were excavated and dry biomass of foliage, branches, stems and roots was measured. Allometric relations were then used to calculate biomass allocation coefficients (BAC) and growth efficiency (GE) patterns in young trees. We found large differences in BAC and GE between broadleaves and conifers, but also between species within these categories. Both BAC and GE are strongly age-specific in young trees, their rapidly changing values reflecting different growth strategies in the earliest stages of growth. We show that linear relationships describing biomass allocation in older trees are not applicable in young trees. To accurately predict forest biomass and carbon stocks, forest growth models need to include species and age specific parameters of biomass allocation patterns.

Neurofuzzy network model construction using Bézier-Bernstein polynomial functions

Neurofuzzy modelling systems combine fuzzy logic with quantitative artificial neural networks via a concept of fuzzification by using a fuzzy membership function usually based on B-splines and algebraic operators for inference, etc. The paper introduces a neurofuzzy model construction algorithm using Bezier-Bernstein polynomial functions as basis functions. The new network maintains most of the properties of the B-spline expansion based neurofuzzy system, such as the non-negativity of the basis functions, and unity of support but with the additional advantages of structural parsimony and Delaunay input space partitioning, avoiding the inherent computational problems of lattice networks. This new modelling network is based on the idea that an input vector can be mapped into barycentric co-ordinates with respect to a set of predetermined knots as vertices of a polygon (a set of tiled Delaunay triangles) over the input space. The network is expressed as the Bezier-Bernstein polynomial function of barycentric co-ordinates of the input vector. An inverse de Casteljau procedure using backpropagation is developed to obtain the input vector's barycentric co-ordinates that form the basis functions. Extension of the Bezier-Bernstein neurofuzzy algorithm to n-dimensional inputs is discussed followed by numerical examples to demonstrate the effectiveness of this new data based modelling approach.

A new approach for the solution of the optimal set-point tracking problem for nonlinear systems

In this paper, a discrete time dynamic integrated system optimisation and parameter estimation algorithm is applied to the solution of the nonlinear tracking optimal control problem. A version of the algorithm with a linear-quadratic model-based problem is developed and implemented in software. The algorithm implemented is tested with simulation examples.

A simple, coherent framework for partitioning uncertainty in climate predictions

A simple and coherent framework for partitioning uncertainty in multi-model climate ensembles is presented. The analysis of variance (ANOVA) is used to decompose a measure of total variation additively into scenario uncertainty, model uncertainty and internal variability. This approach requires fewer assumptions than existing methods and can be easily used to quantify uncertainty related to model-scenario interaction - the contribution to model uncertainty arising from the variation across scenarios of model deviations from the ensemble mean. Uncertainty in global mean surface air temperature is quantified as a function of lead time for a subset of the Coupled Model Intercomparison Project phase 3 ensemble and results largely agree with those published by other authors: scenario uncertainty dominates beyond 2050 and internal variability remains approximately constant over the 21st century. Both elements of model uncertainty, due to scenario-independent and scenario-dependent deviations from the ensemble mean, are found to increase with time. Estimates of model deviations that arise as by-products of the framework reveal significant differences between models that could lead to a deeper understanding of the sources of uncertainty in multi-model ensembles. For example, three models are shown diverging pattern over the 21st century, while another model exhibits an unusually large variation among its scenario-dependent deviations.

Reduced complexity set-point following in self-tuning control

An external input signal is incorporated into a self-tuning controller which, although it is based on a CARMA system model, employs a state-space framework for control law calculations. Steady-state set point following can then be accomplished even when only a recursive least squares parameter estimation scheme is used, despite the fact that the disturbance affecting the system may well be coloured.

The roles of feature-specific task set and bottom-up salience in attentional capture: An ERP study

We investigated the roles of top-down task set and bottom-up stimulus salience for feature-specific attentional capture. Spatially nonpredictive cues preceded search arrays that included a color-defined target. For target-color singleton cues, behavioral spatial cueing effects were accompanied by cueinduced N2pc components, indicative of attentional capture. These effects were only minimally attenuated for nonsingleton target-color cues, underlining the dominance of top-down task set over salience in attentional capture. Nontarget-color singleton cues triggered no N2pc, but instead an anterior N2 component indicative of top-down inhibition. In Experiment 2, inverted behavioral cueing effects of these cues were accompanied by a delayed N2pc to targets at cued locations, suggesting that perceptually salient but task-irrelevant visual events trigger location-specific inhibition mechanisms that can delay subsequent target selection.

An isotope dilution model for partitioning phenylalanine uptake by the liver of lactating dairy cows

An isotope dilution model for partitioning phenylalanine uptake by the liver of the lactating dairy cow was constructed and solved in the steady state. If assumptions are made, model solution permits calculation of the rate of phenylalanine uptake from portal vein and hepatic arterial blood supply, phenylalanine release into the hepatic vein, phenylalanine oxidation and synthesis, and degradation of hepatic constitutive and export proteins. The model requires the measurement of plasma fow rate through the liver in combination with phenylalanine concentrations and plateau isotopic enrichments in arterial, portal and hepatic plasma during a constant infusion of [1-13C]phenylalanine tracer. The model can be applied to other amino acids with similar metabolic fates and will provide a means for assessing the impact of hepatic metabolism on amino acid availability to peripheral tissues. This is of particular importance for the dairy cow when considering the requirements for milk protein synthesis and the negative environmental impact of excessive nitrogen excretion.

Mineral partitioning in milk and milk permeates at high temperature

The soluble phase of milk was separated at 20 and 80°C using ultrafiltration. The resulting permeates were then subjected to further ultrafiltration and dialysis at close to these two temperatures. It was found that pH, Ca2+ and soluble Ca decreased as the separation temperature increased both in original UF permeates and in dialysates obtained from these permeates, but P decreased only slightly. The major reason for these changes was due to the precipitation of calcium phosphate/citrate complexes onto the casein micelle with concomitant release of H+. The pH of both permeates and dialysates from milk at 20°C were slightly higher than for milk. When UF permeates collected at 20 and 80°C, were each dialysed at both these temperatures, the dialysate collected at 80°C showed much less temperature dependence for pH and ionic calcium compared with that collected at 20°C. This is in contrast to milk, which shows considerable temperature dependence for pH and ionic calcium. Further experiments revealed that the pH and Ca2+ concentration of permeates showed high temperature dependence above the temperature at which they were separated, but a much lower temperature dependence below that temperature. These findings suggest that dialysis and UF of milk at high temperature provide the best means yet for estimating the pH and ionic calcium of milk at that temperature.