Describing long-term trends in precipitation using generalized additive models

With the current concern over climate change, descriptions of how rainfall patterns are changing over time can be useful. Observations of daily rainfall data over the last few decades provide information on these trends. Generalized linear models are typically used to model patterns in the occurrence and intensity of rainfall. These models describe rainfall patterns for an average year but are more limited when describing long-term trends, particularly when these are potentially non-linear. Generalized additive models (GAMS) provide a framework for modelling non-linear relationships by fitting smooth functions to the data. This paper describes how GAMS can extend the flexibility of models to describe seasonal patterns and long-term trends in the occurrence and intensity of daily rainfall using data from Mauritius from 1962 to 2001. Smoothed estimates from the models provide useful graphical descriptions of changing rainfall patterns over the last 40 years at this location. GAMS are particularly helpful when exploring non-linear relationships in the data. Care is needed to ensure the choice of smooth functions is appropriate for the data and modelling objectives. (c) 2008 Elsevier B.V. All rights reserved.

The effects of temperature and light integral on early vegetative growth and chlorophyll fluorescence of four contrasting genotypes of cacao (Theobroma cacao)

The effect of temperature on early vegetative growth, leaf chlorophyll fluorescence and chlorophyll content was examined on four genotypes of cacao (Amelonado, AMAZ 15–15, SCA 6 and SPEC 54/1). A controlled environment glasshouse was used to simulate the temperature conditions of three cacao-growing regions (Bahia, Brazil; Tafo, Ghana and Lower Perak, Malaysia) over the course of a year. Base temperatures calculated from increments in main stem growth varied from 18.6°C for AMAZ 15/15 to 20.8°C for SPEC 54/1. Temporal variation in Fv/Fm observed for two of the clones (SCA 6 and SPEC 54/1) in two of the compartments were correlated with temperature differences over time. Significant differences were also recorded between genotypes in leaf chlorophyll content. It was shown that variation over time in leaf chlorophyll content could be quantified accurately as a function of temperature and light integral. The results imply that genetic variability exists in cacao in response to temperature stress.

A family study of co-morbidity between generalized social phobia and generalized anxiety disorder in a non-clinic sample

Background: High rates of co-morbidity between Generalized Social Phobia (GSP) and Generalized Anxiety Disorder (GAD) have been documented. The reason for this is unclear. Family studies are one means of clarifying the nature of co-morbidity between two disorders. Methods: Six models of co-morbidity between GSP and GAD were investigated in a family aggregation study of 403 first-degree relatives of non-clinical probands: 37 with GSP, 22 with GAD, 15 with co-morbid GSP/GAD, and 41 controls with no history of GSP or GAD. Psychiatric data were collected for probands and relatives. Mixed methods (direct and family history interviews) were utilised. Results: Primary contrasts (against controls) found an increased rate of pure GSP in the relatives of both GSP probands and co-morbid GSP/GAD probands, and found relatives of co-morbid GSP/GAD probands to have an increased rate of both pure GAD and comorbid GSP/GAD. Secondary contrasts found (i) increased GSP in the relatives of GSP only probands compared to the relatives of GAD only probands; and (ii) increased GAD in the relatives of co-morbid GSP/GAD probands compared to the relatives of GSP only probands. Limitations: The study did not directly interview all relatives, although the reliability of family history data was assessed. The study was based on an all-female proband sample. The implications of both these limitations are discussed. Conclusions: The results were most consistent with a co-morbidity model indicating independent familial transmission of GSP and GAD. This has clinical implications for the treatment of patients with both disorders. (C) 2006 Elsevier B.V. All fights reserved.

Identification of nonlinear systems using generalized kernel models

Nonlinear system identification is considered using a generalized kernel regression model. Unlike the standard kernel model, which employs a fixed common variance for all the kernel regressors, each kernel regressor in the generalized kernel model has an individually tuned diagonal covariance matrix that is determined by maximizing the correlation between the training data and the regressor using a repeated guided random search based on boosting optimization. An efficient construction algorithm based on orthogonal forward regression with leave-one-out (LOO) test statistic and local regularization (LR) is then used to select a parsimonious generalized kernel regression model from the resulting full regression matrix. The proposed modeling algorithm is fully automatic and the user is not required to specify any criterion to terminate the construction procedure. Experimental results involving two real data sets demonstrate the effectiveness of the proposed nonlinear system identification approach.

Complexity of Monte Carlo algorithms for a class of integral equations

In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.

Comparison of extrasystolic ECG signal classifiers using discrete wavelet transforms

This work compares and contrasts results of classifying time-domain ECG signals with pathological conditions taken from the MITBIH arrhythmia database. Linear discriminant analysis and a multi-layer perceptron were used as classifiers. The neural network was trained by two different methods, namely back-propagation and a genetic algorithm. Converting the time-domain signal into the wavelet domain reduced the dimensionality of the problem at least 10-fold. This was achieved using wavelets from the db6 family as well as using adaptive wavelets generated using two different strategies. The wavelet transforms used in this study were limited to two decomposition levels. A neural network with evolved weights proved to be the best classifier with a maximum of 99.6% accuracy when optimised wavelet-transform ECG data wits presented to its input and 95.9% accuracy when the signals presented to its input were decomposed using db6 wavelets. The linear discriminant analysis achieved a maximum classification accuracy of 95.7% when presented with optimised and 95.5% with db6 wavelet coefficients. It is shown that the much simpler signal representation of a few wavelet coefficients obtained through an optimised discrete wavelet transform facilitates the classification of non-stationary time-variant signals task considerably. In addition, the results indicate that wavelet optimisation may improve the classification ability of a neural network. (c) 2005 Elsevier B.V. All rights reserved.

Design of a minimum variance multiple input-multiple output neuro self-tuning proportional-integral-derivative controller for non-linear dynamic systems

In this study a minimum variance neuro self-tuning proportional-integral-derivative (PID) controller is designed for complex multiple input-multiple output (MIMO) dynamic systems. An approximation model is constructed, which consists of two functional blocks. The first block uses a linear submodel to approximate dominant system dynamics around a selected number of operating points. The second block is used as an error agent, implemented by a neural network, to accommodate the inaccuracy possibly introduced by the linear submodel approximation, various complexities/uncertainties, and complicated coupling effects frequently exhibited in non-linear MIMO dynamic systems. With the proposed model structure, controller design of an MIMO plant with n inputs and n outputs could be, for example, decomposed into n independent single input-single output (SISO) subsystem designs. The effectiveness of the controller design procedure is initially verified through simulations of industrial examples.

Generalized matching networks and their properties

In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cubes and the star graphs. We prove that a GMN on a family of k-connected building graphs is -connected. We then prove that a GMN on a family of Hamiltonian-connected building graphs having at least three vertices each is Hamiltonian-connected. Our conclusions generalize some previously known results.

Minimum neighborhood in a generalized cube

Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.

Generalized honeycomb torus is Hamiltonian

Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a "token ring" parallel algorithm onto the associated network in an efficient way. Cho and Hsu [Inform. Process. Lett. 86 (4) (2003) 185-190] speculated that every generalized honeycomb torus is Hamiltonian. In this paper, we have proved this conjecture. (C) 2004 Elsevier B.V. All rights reserved.