New integrable model of correlated electrons with off-diagonal long-range order from so(5) symmetry

We present a new integrable model for correlated electrons which is based on so(5) symmetry. By using an eta-pairing realization we construct eigenstates of the Hamiltonian with off-diagonal long-range order. It is also shown that these states lie in the ground state sector. We exactly solve the model on a one-dimensional lattice by the Bethe ansatz.

Computation of bifurcation boundaries for power systems: A new Delta-plane method

This paper is devoted to the problems of finding the load flow feasibility, saddle node, and Hopf bifurcation boundaries in the space of power system parameters. The first part contains a review of the existing relevant approaches including not-so-well-known contributions from Russia. The second part presents a new robust method for finding the power system load flow feasibility boundary on the plane defined by any three vectors of dependent variables (nodal voltages), called the Delta plane. The method exploits some quadratic and linear properties of the load now equations and state matrices written in rectangular coordinates. An advantage of the method is that it does not require an iterative solution of nonlinear equations (except the eigenvalue problem). In addition to benefits for visualization, the method is a useful tool for topological studies of power system multiple solution structures and stability domains. Although the power system application is developed, the method can be equally efficient for any quadratic algebraic problem.

Spelling in adults: The role of reading skills and experience

One hundred university students completed tests of spelling production, vocabulary, reading comprehension, reading experience, and reading accuracy (ability to distinguish a previously read word from a similar distractor). Reading experience, as measured by an adaptation of the Author Recognition Test, and reading accuracy contributed to the prediction of spelling beyond the joint contribution of reading comprehension and vocabulary. The results are more consistent with a uni-process model of spelling based on the quality of word-specific orthographic learning, rather than with a dual-process account relying on both word-specific knowledge and rules.

Integrable Kondo impurities in one-dimensional extended Hubbard models

Three kinds of integrable Kondo problems in one-dimensional extended Hubbard models are studied by means of the boundary graded quantum inverse scattering method. The boundary K matrices depending on the local moments of the impurities are presented as a nontrivial realization of the graded reflection equation algebras acting in a (2s alpha + 1)-dimensional impurity Hilbert space. Furthermore, these models are solved using the algebraic Bethe ansatz method, and the Bethe ansatz equations are obtained.

Heat flow for Yang-Mills-Higgs fields, part I

The Yang-Mills-Higgs field generalizes the Yang-Mills field. The authors establish the local existence and uniqueness of the weak solution to the heat flow for the Yang-Mills-Higgs field in a vector bundle over a compact Riemannian 4-manifold, and show that the weak solution is gauge-equivalent to a smooth solution and there are at most finite singularities at the maximum existing time.

Transfer matrix eigenvalues of the anisotropic multiparametric U model

A multiparametric extension of the anisotropic U model is discussed which maintains integrability. The R-matrix solving the Yang-Baxter equation is obtained through a twisting construction applied to the underlying U-q(sl (2/1)) superalgebraic structure which introduces the additional free parameters that arise in the model. Three forms of Bethe ansatz solution for the transfer matrix eigenvalues are given which we show to be equivalent.

Integrable Kondo impurity in one-dimensional q-deformed t-J models

Integrable Kondo impurities in two cases of one-dimensional q-deformed t-J models are studied by means of the boundary Z(2)-graded quantum inverse scattering method. The boundary K matrices depending on the local magnetic moments of the impurities are presented as nontrivial realizations of the reflection equation algebras in an impurity Hilbert space. Furthermore, these models are solved by using the algebraic Bethe ansatz method and the Bethe ansatz equations are obtained.

Drinfeld twists and symmetric Bethe vectors of supersymmetric fermion models

We construct the Drinfeld twists ( factorizing F-matrices) of the gl(m-n)-invariant fermion model. Completely symmetric representation of the pseudo-particle creation operators of the model are obtained in the basis provided by the F-matrix ( the F-basis). We resolve the hierarchy of the nested Bethe vectors in the F-basis for the gl(m-n) supersymmetric model.

Analysis of dynamic models for structural insight and model reduction .2. A multi-stage compressor shutdown case-study

In this second paper, the three structural measures which have been developed are used in the modelling of a three stage centrifugal synthesis gas compressor. The goal of this case study is to determine the essential mathematical structure which must be incorporated into the compressor model to accurately model the shutdown of this system. A simple, accurate and functional model of the system is created via three structural measures. It was found that the model can be correctly reduced into its basic modes and that the order of the differential system can be reduced from 51(st) to 20(th). Of the 31 differential equational 21 reduce to algebraic relations, 8 become constants and 2 can be deleted thereby increasing the algebraic set from 70 to 91 equations. An interpretation is also obtained as to which physical phenomena are dominating the dynamics of the compressor add whether the compressor will enter surge during the shutdown. Comparisons of the reduced model performance against the full model are given, showing the accuracy and applicability of the approach. Copyright (C) 1996 Elsevier Science Ltd

Evaluating SVM and MLDA in the extraction of discriminant regions for mental state prediction

Pattern recognition methods have been successfully applied in several functional neuroimaging studies. These methods can be used to infer cognitive states, so-called brain decoding. Using such approaches, it is possible to predict the mental state of a subject or a stimulus class by analyzing the spatial distribution of neural responses. In addition it is possible to identify the regions of the brain containing the information that underlies the classification. The Support Vector Machine (SVM) is one of the most popular methods used to carry out this type of analysis. The aim of the current study is the evaluation of SVM and Maximum uncertainty Linear Discrimination Analysis (MLDA) in extracting the voxels containing discriminative information for the prediction of mental states. The comparison has been carried out using fMRI data from 41 healthy control subjects who participated in two experiments, one involving visual-auditory stimulation and the other based on bimanual fingertapping sequences. The results suggest that MLDA uses significantly more voxels containing discriminative information (related to different experimental conditions) to classify the data. On the other hand, SVM is more parsimonious and uses less voxels to achieve similar classification accuracies. In conclusion, MLDA is mostly focused on extracting all discriminative information available, while SVM extracts the information which is sufficient for classification. (C) 2009 Elsevier Inc. All rights reserved.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Predictors of word-level literacy amongst Grade 3 children in five diverse languages

Groups of Grade 3 children were tested on measures of word-level literacy and undertook tasks that required the ability to associate sounds with letter sequences and that involved visual, auditory and phonological-processing skills. These groups came from different language backgrounds in which the language of instruction was Arabic, Chinese, English, Hungarian or Portuguese. Similar measures were used across the groups, with tests being adapted to be appropriate for the language of the children. Findings indicated that measures of decoding and phonological-processing skills were good predictors of word reading and spelling among Arabic- and English-speaking children, but were less able to predict variability in these same early literacy skills among Chinese- and Hungarian-speaking children, and were better at predicting variability in Portuguese word reading than spelling. Results were discussed with reference to the relative transparency of the script and issues of dyslexia assessment across languages. Overall, the findings argue for the need to take account of features of the orthography used to represent a language when developing assessment procedures for a particular language and that assessment of word-level literacy skills and a phonological perspective of dyslexia may not be universally applicable across all language contexts. Copyright (C) 2008 John Wiley & Sons, Ltd.