Biomass functions and expansion factors in young Norway spruce (Picea abies [L.] Karst) trees

Roots, stems, branches and needles of 160 Norway spruce trees younger than 10 years were sampled in seven forest stands in central Slovakia in order to establish their biomassfunctions (BFs) and biomassexpansionfactors (BEFs). We tested three models for each biomass pool based on the stem base diameter, tree height and the two parameters combined. BEF values decreased for all spruce components with increasing height and diameter, which was most evident in very young trees under 1 m in height. In older trees, the values of BEFs did tend to stabilise at the height of 3–4 m. We subsequently used the BEFs to calculate dry biomass of the stands based on average stem base diameter and tree height. Total stand biomass grew with increasing age of the stands from about 1.0 Mg ha−1 at 1.5 years to 44.3 Mg ha−1 at 9.5 years. The proportion of stem and branch biomass was found to increase with age, while that of needles was fairly constant and the proportion of root biomass did decrease as the stands grew older.

Application of cylindrical distribution functions to wide-angle X-ray scattering from oriented polymers

A systematic approach is presented for obtaining cylindrical distribution functions (CDF's) of noncrystalline polymers which have been oriented by extension. The scattering patterns and CDF's are also sharpened by the method proposed by Deas and by Ruland. Data from atactic poly(methyl methacrylate) and polystyrene are analysed by these techniques. The methods could also be usefully applied to liquid crystals.

System identification of Wiener systems with B-spline functions using De Boor recursion

In this article a simple and effective algorithm is introduced for the system identification of the Wiener system using observational input/output data. The nonlinear static function in the Wiener system is modelled using a B-spline neural network. The Gauss–Newton algorithm is combined with De Boor algorithm (both curve and the first order derivatives) for the parameter estimation of the Wiener model, together with the use of a parameter initialisation scheme. Numerical examples are utilised to demonstrate the efficacy of the proposed approach.

Modular non-computational-connectionist-hybrid neural network approach to robotic systems

Spiking neural networks are usually limited in their applications due to their complex mathematical models and the lack of intuitive learning algorithms. In this paper, a simpler, novel neural network derived from a leaky integrate and fire neuron model, the ‘cavalcade’ neuron, is presented. A simulation for the neural network has been developed and two basic learning algorithms implemented within the environment. These algorithms successfully learn some basic temporal and instantaneous problems. Inspiration for neural network structures from these experiments are then taken and applied to process sensor information so as to successfully control a mobile robot.

Rhinocetin, a venom-derived integrin-specific antagonist inhibits collagen-induced platelet and endothelial cell functions

Snaclecs are small non-enzymatic proteins present in viper venoms reported to modulate haemostasis of victims through effects on platelets, vascular endothelial and smooth muscle cells. In this study, we have isolated and functionally characterised a snaclec which we named rhinocetin from the venom of West African gaboon viper, Bitis gabonica rhinoceros. Rhinocetin was shown to comprise α and β chains with the molecular masses of 13.5 and 13kDa respectively. Sequence and immunoblot analysis of rhinocetin confirmed this to be a novel snaclec. Rhinocetin inhibited collagen-stimulated activation of human platelets in dose dependent manner, but displayed no inhibitory effects on glycoprotein VI (collagen receptor) selective agonist, CRP-XL-, ADP- or thrombin-induced platelet activation. Rhinocetin antagonised the binding of monoclonal antibodies against the α2 subunit of integrin α2β1 to platelets and coimmunoprecipitation analysis confirmed integrin α2β1 as a target for this venom protein. Rhinocetin inhibited a range of collagen induced platelet functions such as fibrinogen binding, calcium mobilisation, granule secretion, aggregation and thrombus formation. It also inhibited integrin α2β1 dependent functions of human endothelial cells. Together, our data suggest rhinocetin to be a modulator of integrin α2β1 function and thus may provide valuable insights into the role of this integrin in physiological and pathophysiological scenarios including haemostasis, thrombosis and envenomation.

Smoothness of scale functions for spectrally negative Lévy processes

Scale functions play a central role in the fluctuation theory of spectrally negative Lévy processes and often appear in the context of martingale relations. These relations are often require excursion theory rather than Itô calculus. The reason for the latter is that standard Itô calculus is only applicable to functions with a sufficient degree of smoothness and knowledge of the precise degree of smoothness of scale functions is seemingly incomplete. The aim of this article is to offer new results concerning properties of scale functions in relation to the smoothness of the underlying Lévy measure. We place particular emphasis on spectrally negative Lévy processes with a Gaussian component and processes of bounded variation. An additional motivation is the very intimate relation of scale functions to renewal functions of subordinators. The results obtained for scale functions have direct implications offering new results concerning the smoothness of such renewal functions for which there seems to be very little existing literature on this topic.

Structural spoilers or structural supports? Unionism and the strategic integration of HR functions

The strategic integration of the human resource (HR) function is regarded as crucial in the literature on (strategic) human resource management ((S)HRM). Evidence on the contextual or structural influences on this integration is, however, limited. The structural implications of unionism are particularly intriguing given the evolution of study of the employment relationship. Pluralism is typically seen as antithetical to SHRM, and unions as an impediment to the strategic integration of HR functions, but there are also suggestions in the literature that unionism might facilitate the strategic integration of HR. This paper deploys large-scale international survey evidence to examine the organization-level influence of unionism on this strategic integration, allowing for other established and plausible influences. The analysis reveals that exceptionally, where the organization-level role of unions is particularly contested, unionism does impede the strategic integration of HR. However, it is the predominance of the facilitation of the strategic integration of HR by unionism which is most remarkable.

PMCRI: a parallel modular classification rule induction framework

In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction of Decision Trees (TDIDT) algorithm is a very widely used technology to predict the classification of newly recorded data. However alternative technologies have been derived that often produce better rules but do not scale well on large datasets. Such an alternative to TDIDT is the PrismTCS algorithm. PrismTCS performs particularly well on noisy data but does not scale well on large datasets. In this paper we introduce Prism and investigate its scaling behaviour. We describe how we improved the scalability of the serial version of Prism and investigate its limitations. We then describe our work to overcome these limitations by developing a framework to parallelise algorithms of the Prism family and similar algorithms. We also present the scale up results of a first prototype implementation.

Parallel induction of modular classification rules

The Distributed Rule Induction (DRI) project at the University of Portsmouth is concerned with distributed data mining algorithms for automatically generating rules of all kinds. In this paper we present a system architecture and its implementation for inducing modular classification rules in parallel in a local area network using a distributed blackboard system. We present initial results of a prototype implementation based on the Prism algorithm.

Towards a computationally efficient approach to modular classification rule induction

Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision Trees (TDIDT) approach. However, alternative approaches have been developed such as the Prism algorithm for inducing modular rules. Prism often produces qualitatively better rules than TDIDT but suffers from higher computational requirements. We investigate approaches that have been developed to minimize the computational requirements of TDIDT, in order to find analogous approaches that could reduce the computational requirements of Prism.

J-PMCRI: a methodology for inducing pre-pruned modular classification rules

Inducing rules from very large datasets is one of the most challenging areas in data mining. Several approaches exist to scaling up classification rule induction to large datasets, namely data reduction and the parallelisation of classification rule induction algorithms. In the area of parallelisation of classification rule induction algorithms most of the work has been concentrated on the Top Down Induction of Decision Trees (TDIDT), also known as the ‘divide and conquer’ approach. However powerful alternative algorithms exist that induce modular rules. Most of these alternative algorithms follow the ‘separate and conquer’ approach of inducing rules, but very little work has been done to make the ‘separate and conquer’ approach scale better on large training data. This paper examines the potential of the recently developed blackboard based J-PMCRI methodology for parallelising modular classification rule induction algorithms that follow the ‘separate and conquer’ approach. A concrete implementation of the methodology is evaluated empirically on very large datasets.

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.