General derivative relations for anharmonic force fields

The brace notation, introduced by Allen and Csaszar (1993, J. chem. Phys., 98, 2983), provides a simple and compact way to deal with derivatives of arbitrary non-tensorial quantities. One of its main advantages is that it builds the permutational symmetry of the derivatives directly into the formalism. The brace notation is applied to formulate the general nth-order Cartesian derivatives of internal coordinates, and to provide closed forms for general, nth-order transformation equations of anharmonic force fields, expressed as Taylor series, from internal to Cartesian or normal coordinate spaces.

The Klein-Gordon equation on the half line: a Riemann-Hilbert approach

We solve an initial-boundary problem for the Klein-Gordon equation on the half line using the Riemann-Hilbert approach to solving linear boundary value problems advocated by Fokas. The approach we present can be also used to solve more complicated boundary value problems for this equation, such as problems posed on time-dependent domains. Furthermore, it can be extended to treat integrable nonlinearisations of the Klein-Gordon equation. In this respect, we briefly discuss how our results could motivate a novel treatment of the sine-Gordon equation.

Minimum aberration construction results for nonregular two-level fractional factorial designs

Nonregular two-level fractional factorial designs are designs which cannot be specified in terms of a set of defining contrasts. The aliasing properties of nonregular designs can be compared by using a generalisation of the minimum aberration criterion called minimum G2-aberration.Until now, the only nontrivial designs that are known to have minimum G2-aberration are designs for n runs and m n–5 factors. In this paper, a number of construction results are presented which allow minimum G2-aberration designs to be found for many of the cases with n = 16, 24, 32, 48, 64 and 96 runs and m n/2–2 factors.

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.

Some theory for constructing minimum aberration fractional factorial designs

Minimum aberration is the most established criterion for selecting a regular fractional factorial design of maximum resolution. Minimum aberration designs for n runs and n/2 less than or equal to m < n factors have previously been constructed using the novel idea of complementary designs. In this paper, an alternative method of construction is developed by relating the wordlength pattern of designs to the so-called 'confounding between experimental runs'. This allows minimum aberration designs to be constructed for n runs and 5n/16 less than or equal to m less than or equal to n/2 factors as well as for n/2 less than or equal to m < n.

X-ray crystallographic study of DNA duplex cross-linking: simultaneous binding to two d(CGTACG)(2) molecules by a bis(9-aminoacridine-4-carboxamide) derivative

Acridine-4-carboxamides form a class of known DNA mono-intercalating agents that exhibit cytotoxic activity against tumour cell lines due to their ability to inhibit topoisomerases. Previous studies of bis-acridine derivatives have yielded equivocal results regarding the minimum length of linker necessary between the two acridine chromophores to allow bis-intercalation of duplex DNA. We report here the 1.7 angstrom resolution X-ray crystal structure of a six-carbon-linked bis(acridine-4-carboxamide) ligand bound to d(CGTACG)(2) molecules by non-covalent duplex cross-linking. The asymmetric unit consists of one DNA duplex containing an intercalated acridine-4-carboxamide chromophore at each of the two CG steps. The other half of each ligand is bound to another DNA molecule in a symmetry-related manner, with the alkyl linker threading through the minor grooves. The two crystallographically independent ligand molecules adopt distinct side chain interactions, forming hydrogen bonds to either O6 or N7 on the major groove face of guanine, in contrast to the semi-disordered state of mono-intercalators bound to the same DNA molecule. The complex described here provides the first structural evidence for the non-covalent cross-linking of DNA by a small molecule ligand and suggests a possible explanation for the inconsistent behaviour of six-carbon linked bis-acridines in previous assays of DNA bis-intercalation.

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.

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.

A lower bound on the size of k-neighborhood in generalized cubes

The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 <= k <= 3n - 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results. (c) 2005 Elsevier Inc. All rights reserved.