Language processing with dynamic fields

We construct a mapping from complex recursive linguistic data structures to spherical wave functions using Smolensky's filler/role bindings and tensor product representations. Syntactic language processing is then described by the transient evolution of these spherical patterns whose amplitudes are governed by nonlinear order parameter equations. Implications of the model in terms of brain wave dynamics are indicated.

Modeling of complex-valued Wiener systems using B-spline neural network

In this brief, a new complex-valued B-spline neural network is introduced in order to model the complex-valued Wiener system using observational input/output data. The complex-valued nonlinear static function in the Wiener system is represented using the tensor product from two univariate B-spline neural networks, using the real and imaginary parts of the system input. Following the use of a simple least squares parameter initialization scheme, the Gauss-Newton algorithm is applied for the parameter estimation, which incorporates the De Boor algorithm, including both the B-spline curve and the first-order derivatives recursion. Numerical examples, including a nonlinear high-power amplifier model in communication systems, are used to demonstrate the efficacy of the proposed approaches.

Modelling and inverting complex-valued Wiener systems

We develop a complex-valued (CV) B-spline neural network approach for efficient identification and inversion of CV Wiener systems. The CV nonlinear static function in the Wiener system is represented using the tensor product of two univariate B-spline neural networks. With the aid of a least squares parameter initialisation, the Gauss-Newton algorithm effectively estimates the model parameters that include the CV linear dynamic model coefficients and B-spline neural network weights. The identification algorithm naturally incorporates the efficient De Boor algorithm with both the B-spline curve and first order derivative recursions. An accurate inverse of the CV Wiener system is then obtained, in which the inverse of the CV nonlinear static function of the Wiener system is calculated efficiently using the Gaussian-Newton algorithm based on the estimated B-spline neural network model, with the aid of the De Boor recursions. The effectiveness of our approach for identification and inversion of CV Wiener systems is demonstrated using the application of digital predistorter design for high power amplifiers with memory

Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading

In the present paper we study the approximation of functions with bounded mixed derivatives by sparse tensor product polynomials in positive order tensor product Sobolev spaces. We introduce a new sparse polynomial approximation operator which exhibits optimal convergence properties in L2 and tensorized View the MathML source simultaneously on a standard k-dimensional cube. In the special case k=2 the suggested approximation operator is also optimal in L2 and tensorized H1 (without essential boundary conditions). This allows to construct an optimal sparse p-version FEM with sparse piecewise continuous polynomial splines, reducing the number of unknowns from O(p2), needed for the full tensor product computation, to View the MathML source, required for the suggested sparse technique, preserving the same optimal convergence rate in terms of p. We apply this result to an elliptic differential equation and an elliptic integral equation with random loading and compute the covariances of the solutions with View the MathML source unknowns. Several numerical examples support the theoretical estimates.

Complex-valued B-spline neural networks for modeling and inverting Hammerstein systems

Many communication signal processing applications involve modelling and inverting complex-valued (CV) Hammerstein systems. We develops a new CV B-spline neural network approach for efficient identification of the CV Hammerstein system and effective inversion of the estimated CV Hammerstein model. Specifically, the CV nonlinear static function in the Hammerstein system is represented using the tensor product from two univariate B-spline neural networks. An efficient alternating least squares estimation method is adopted for identifying the CV linear dynamic model’s coefficients and the CV B-spline neural network’s weights, which yields the closed-form solutions for both the linear dynamic model’s coefficients and the B-spline neural network’s weights, and this estimation process is guaranteed to converge very fast to a unique minimum solution. Furthermore, an accurate inversion of the CV Hammerstein system can readily be obtained using the estimated model. In particular, the inversion of the CV nonlinear static function in the Hammerstein system can be calculated effectively using a Gaussian-Newton algorithm, which naturally incorporates the efficient De Boor algorithm with both the B-spline curve and first order derivative recursions. The effectiveness of our approach is demonstrated using the application to equalisation of Hammerstein channels.

Joint multiple dictionary learning for tensor sparse coding

Traditional dictionary learning algorithms are used for finding a sparse representation on high dimensional data by transforming samples into a one-dimensional (1D) vector. This 1D model loses the inherent spatial structure property of data. An alternative solution is to employ Tensor Decomposition for dictionary learning on their original structural form —a tensor— by learning multiple dictionaries along each mode and the corresponding sparse representation in respect to the Kronecker product of these dictionaries. To learn tensor dictionaries along each mode, all the existing methods update each dictionary iteratively in an alternating manner. Because atoms from each mode dictionary jointly make contributions to the sparsity of tensor, existing works ignore atoms correlations between different mode dictionaries by treating each mode dictionary independently. In this paper, we propose a joint multiple dictionary learning method for tensor sparse coding, which explores atom correlations for sparse representation and updates multiple atoms from each mode dictionary simultaneously. In this algorithm, the Frequent-Pattern Tree (FP-tree) mining algorithm is employed to exploit frequent atom patterns in the sparse representation. Inspired by the idea of K-SVD, we develop a new dictionary update method that jointly updates elements in each pattern. Experimental results demonstrate our method outperforms other tensor based dictionary learning algorithms.

Dunford-Pettis properties, Hilbert spaces and projective tensor products

We study complete continuity properties of operators onto ℓ2 and prove several results in the Dunford–Pettis theory of JB∗-triples and their projective tensor products, culminating in characterisations of the alternative Dunford–Pettis property for where E and F are JB∗-triples.

Rational conversion of substrate and product specificity in a Salvia monoterpene synthase: structural insights into the evolution of terpene synthase function

Terpene synthases are responsible for the biosynthesis of the complex chemical defense arsenal of plants and microorganisms. How do these enzymes, which all appear to share a common terpene synthase fold, specify the many different products made almost entirely from one of only three substrates? Elucidation of the structure of 1,8-cineole synthase from Salvia fruticosa (Sf-CinS1) combined with analysis of functional and phylogenetic relationships of enzymes within Salvia species identified active-site residues responsible for product specificity. Thus, Sf-CinS1 was successfully converted to a sabinene synthase with a minimum number of rationally predicted substitutions, while identification of the Asn side chain essential for water activation introduced 1,8-cineole and alpha-terpineol activity to Salvia pomifera sabinene synthase. A major contribution to product specificity in Sf-CinS1 appears to come from a local deformation within one of the helices forming the active site. This deformation is observed in all other mono- or sesquiterpene structures available, pointing to a conserved mechanism. Moreover, a single amino acid substitution enlarged the active-site cavity enough to accommodate the larger farnesyl pyrophosphate substrate and led to the efficient synthesis of sesquiterpenes, while alternate single substitutions of this critical amino acid yielded five additional terpene synthases.

Effect of method of application of a fibrolytic enzyme product on digestive processes and milk production in Holstein-Friesian cows

Four multiparous cows with cannulas in the rumen and proximal duodenum were used in early lactation in a 4 x 4 Latin square experiment to investigate the effect of method of application of a fibrolytic enzyme product on digestive processes and milk production. The cows were given ad libitum a total mixed ration (TMR) composed of 57% (dry matter basis) forage (3:1 corn silage:grass silage) and 43% concentrates. The TMR contained (g/kg dry matter): 274 neutral detergent fiber, 295 starch, 180 crude protein. Treatments were TMR alone or TMR with the enzyme product added (2 kg/1000 kg TMR dry matter) either sprayed on the TMR 1 h before the morning feed (TMR-E), sprayed only on the concentrate the day before feeding (Concs-E), or infused into the rumen for 14 h/d (Rumen-E). There Was no significant effect on either feed intake or milk yield but both were highest on TMR-E. Rumen digestibility of dry matter, organic matter, and starch was unaffected by the enzyme. Digestibility of NDF was lowest on TMR-E in the rumen but highest postruminally. Total Tract digestibility was highest on TMR-E for dry matter, organic matter, and starch but treatment differences were nonsignificant for neutral detergent fiber: Corn silage stover retention time in the rumen was reduced by all enzyme treatments but postruminal transit time vas increased so the decline in total tract retention. time with enzymes was not significant. It is suggested that the tendency for enzymes to reduce particle retention time in the rumen may, by reducing the time available for fibrolysis to occur, at least partly explain the variability in the reported responses to enzyme treatment.