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.

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.

A novel radix-3/9 algorithm for type-III generalized discrete Hartley transform

A novel radix-3/9 algorithm for type-III generalized discrete Hartley transform (GDHT) is proposed, which applies to length-3(P) sequences. This algorithm is especially efficient in the case that multiplication is much more time-consuming than addition. A comparison analysis shows that the proposed algorithm outperforms a known algorithm when one multiplication is more time-consuming than five additions. When combined with any known radix-2 type-III GDHT algorithm, the new algorithm also applies to length-2(q)3(P) sequences.

Hydrogelation and self-assembly of Fmoc-tripeptides: unexpected influence of sequence on self-assembled fibril structure, and hydrogel modulus and anisotropy

The self-assembly and hydrogelation properties of two Fmoc-tripeptides [Fmoc = N-(fluorenyl-9-methoxycarbonyl)] are investigated, in borate buffer and other basic solutions. A remarkable difference in self-assembly properties is observed comparing Fmoc-VLK(Boc) with Fmoc-K(Boc)LV, both containing K protected by N(epsilon)-tert-butyloxycarbonate (Boc). In borate buffer, the former peptide forms highly anisotropic fibrils which show local alignment, and the hydrogels show flow-aligning properties. In contrast, Fmoc-K(Boc)LV forms highly branched fibrils that produce isotropic hydrogels with a much higher modulus (G' > 10(4) Pa), and lower concentration for hydrogel formation. The distinct self-assembled structures are ascribed to conformational differences, as revealed by secondary structure probes (CD, FTIR, Raman spectroscopy) and X-ray diffraction. Fmoc-VLK(Boc) forms well-defined beta-sheets with a cross-beta X-ray diffraction pattern, whereas Fmoc-KLV(Boc) forms unoriented assemblies with multiple stacked sheets. Interchange of the K and V residues when inverting the tripeptide sequence thus leads to substantial differences in self-assembled structures, suggesting a promising approach to control hydrogel properties.

Thermodynamics of climate change: generalized sensitivities

Using a recent theoretical approach, we study how global warming impacts the thermodynamics of the climate system by performing experiments with a simplified yet Earth-like climate model. The intensity of the Lorenz energy cycle, the Carnot efficiency, the material entropy production, and the degree of irreversibility of the system change monotonically with the CO2 concentration. Moreover, these quantities feature an approximately linear behaviour with respect to the logarithm of the CO2 concentration in a relatively wide range. These generalized sensitivities suggest that the climate becomes less efficient, more irreversible, and features higher entropy production as it becomes warmer, with changes in the latent heat fluxes playing a predominant role. These results may be of help for explaining recent findings obtained with state of the art climate models regarding how increases in CO2 concentration impact the vertical stratification of the tropical and extratropical atmosphere and the position of the storm tracks.

Anticipatory activation in the amygdala and anterior cingulate in generalized anxiety disorder and prediction of treatment response

OBJECTIVE: The anticipation of adverse outcomes, or worry, is a cardinal symptom of generalized anxiety disorder. Prior work with healthy subjects has shown that anticipating aversive events recruits a network of brain regions, including the amygdala and anterior cingulate cortex. This study tested whether patients with generalized anxiety disorder have alterations in anticipatory amygdala function and whether anticipatory activity in the anterior cingulate cortex predicts treatment response. METHOD: Functional magnetic resonance imaging (fMRI) was employed with 14 generalized anxiety disorder patients and 12 healthy comparison subjects matched for age, sex, and education. The event-related fMRI paradigm was composed of one warning cue that preceded aversive pictures and a second cue that preceded neutral pictures. Following the fMRI session, patients received 8 weeks of treatment with extended-release venlafaxine. RESULTS: Patients with generalized anxiety disorder showed greater anticipatory activity than healthy comparison subjects in the bilateral dorsal amygdala preceding both aversive and neutral pictures. Building on prior reports of pretreatment anterior cingulate cortex activity predicting treatment response, anticipatory activity in that area was associated with clinical outcome 8 weeks later following treatment with venlafaxine. Higher levels of pretreatment anterior cingulate cortex activity in anticipation of both aversive and neutral pictures were associated with greater reductions in anxiety and worry symptoms. CONCLUSIONS: These findings of heightened and indiscriminate amygdala responses to anticipatory signals in generalized anxiety disorder and of anterior cingulate cortex associations with treatment response provide neurobiological support for the role of anticipatory processes in the pathophysiology of generalized anxiety disorder.

A geometric approach to generalized Stokes conjectures

We consider the Stokes conjecture concerning the shape of extreme two-dimensional water waves. By new geometric methods including a nonlinear frequency formula, we prove the Stokes conjecture in the original variables. Our results do not rely on structural assumptions needed in previous results such as isolated singularities, symmetry and monotonicity. Part of our results extends to the mathematical problem in higher dimensions.

A neural network enhanced generalized minimum variance self-tuning proportional, integral and derivative control algorithm for complex dynamic systems

A neural network enhanced proportional, integral and derivative (PID) controller is presented that combines the attributes of neural network learning with a generalized minimum-variance self-tuning control (STC) strategy. The neuro PID controller is structured with plant model identification and PID parameter tuning. The plants to be controlled are approximated by an equivalent model composed of a simple linear submodel to approximate plant dynamics around operating points, plus an error agent to accommodate the errors induced by linear submodel inaccuracy due to non-linearities and other complexities. A generalized recursive least-squares algorithm is used to identify the linear submodel, and a layered neural network is used to detect the error agent in which the weights are updated on the basis of the error between the plant output and the output from the linear submodel. The procedure for controller design is based on the equivalent model, and therefore the error agent is naturally functioned within the control law. In this way the controller can deal not only with a wide range of linear dynamic plants but also with those complex plants characterized by severe non-linearity, uncertainties and non-minimum phase behaviours. Two simulation studies are provided to demonstrate the effectiveness of the controller design procedure.

Generalized neurofuzzy network modeling algorithms using Bezier-Bernstein polynomial functions and additive decomposition

This paper introduces a new neurofuzzy model construction algorithm for nonlinear dynamic systems based upon basis functions that are Bezier-Bernstein polynomial functions. This paper is generalized in that it copes with n-dimensional inputs by utilising an additive decomposition construction to overcome the curse of dimensionality associated with high n. This new construction algorithm also introduces univariate Bezier-Bernstein polynomial functions for the completeness of the generalized procedure. Like the B-spline expansion based neurofuzzy systems, Bezier-Bernstein polynomial function based neurofuzzy networks hold desirable properties such as nonnegativity of the basis functions, unity of support, and interpretability of basis function as fuzzy membership functions, moreover with the additional advantages of structural parsimony and Delaunay input space partition, essentially overcoming the curse of dimensionality associated with conventional fuzzy and RBF networks. This new modeling network is based on additive decomposition approach together with two separate basis function formation approaches for both univariate and bivariate Bezier-Bernstein polynomial functions used in model construction. The overall network weights are then learnt using conventional least squares methods. Numerical examples are included to demonstrate the effectiveness of this new data based modeling approach.