A unified and complete construction of all finite dimensional irreducible representations of gl(2|2)

Representations of the non-semisimple superalgebra gl(2/2) in the standard basis are investigated by means of the vector coherent state method and boson-fermion realization. All finite-dimensional irreducible typical and atypical representations and lowest weight (indecomposable) Kac modules of gl(2/2) are constructed explicity through the explicit construction of all gl(2) circle plus gl(2) particle states (multiplets) in terms of boson and fermion creation operators in the super-Fock space. This gives a unified and complete treatment of finite-dimensional representations of gl(2/2) in explicit form, essential for the construction of primary fields of the corresponding current superalgebra at arbitrary level.

Exact solution of the A(n-1)((1)) trigonometric vertex model with non-diagonal open boundaries

The A(n-1)((1)) trigonometric vertex model with generic non-diagonal boundaries is studied. The double-row transfer matrix of the model is diagonalized by algebraic Bethe ansatz method in terms of the intertwiner and the corresponding face-vertex relation. The eigenvalues and the corresponding Bethe ansatz equations are obtained.

Special issue on advances in data mining and its applications

Data mining is the process to identify valid, implicit, previously unknown, potentially useful and understandable information from large databases. It is an important step in the process of knowledge discovery in databases, (Olaru & Wehenkel, 1999). In a data mining process, input data can be structured, seme-structured, or unstructured. Data can be in text, categorical or numerical values. One of the important characteristics of data mining is its ability to deal data with large volume, distributed, time variant, noisy, and high dimensionality. A large number of data mining algorithms have been developed for different applications. For example, association rules mining can be useful for market basket problems, clustering algorithms can be used to discover trends in unsupervised learning problems, classification algorithms can be applied in decision-making problems, and sequential and time series mining algorithms can be used in predicting events, fault detection, and other supervised learning problems (Vapnik, 1999). Classification is among the most important tasks in the data mining, particularly for data mining applications into engineering fields. Together with regression, classification is mainly for predictive modelling. So far, there have been a number of classification algorithms in practice. According to (Sebastiani, 2002), the main classification algorithms can be categorized as: decision tree and rule based approach such as C4.5 (Quinlan, 1996); probability methods such as Bayesian classifier (Lewis, 1998); on-line methods such as Winnow (Littlestone, 1988) and CVFDT (Hulten 2001), neural networks methods (Rumelhart, Hinton & Wiliams, 1986); example-based methods such as k-nearest neighbors (Duda & Hart, 1973), and SVM (Cortes & Vapnik, 1995). Other important techniques for classification tasks include Associative Classification (Liu et al, 1998) and Ensemble Classification (Tumer, 1996).

Project to investigate improving literacy and numeracy outcomes of distance education students in the early years of schooling

The project was commissioned to investigate and analyse the issue of effective support for distance education students in the early years of school to maximise literacy and numeracy outcomes. The scope of this project was limited to students living in rural and remote areas who are undertaking education at home and who are in their early years of schooling. For the purpose of this project, the early years are conceptualised as the first three years of formal compulsory schooling in each of the States and Territories. There were a number of key tasks for the project which included: 1. Examining of the role of home tutors/supervisors This included interviewing personnel from the State and Territory distance education providers as well as the principals, teachers, home tutors and children. 2. Describing literacy and numeracy teaching and learning, and the use of information and communication technologies (ICT) in distance education This aspect of the project involved a critical review and analysis of relevant literature and reports in the last five years, and a consideration of the new initiatives that had been implemented in the States and Territories in the last two years. 3. The development of resources Through examination of the role of home tutors/supervisors, and an examination of literacy and numeracy and the use of technology in distance education, three resources were developed: ● A guide for home tutors/supervisors and schools of distance education about effective intervention and assessment strategies to support students’ learning and to assist the home tutors/supervisors in implementing ICT to support the development of literacy and numeracy in the early years. ● A calendar of activities for literacy and numeracy that would act as a stimulus for integrated and authentic activity for young children. ● An embryonic website of resources for the stakeholders in rural and distance education that might act as a catalyst for future resource building and sharing. In this way the final key task of the project, which was to create a context for a strategic dissemination plan, was realised when a strategy to address effective dissemination of the findings of the project so as to maximise their usefulness for the relevant groups was achieved.

The intersection problem for star designs

We determine those triples (m, II, k) of integers for which there are two m-star designs on the same n-set having exactly k stars in common.

Matrix elements of U(2n) generators in a multishell spin-orbit basis. I. The del-operator MEs in a two-shell composite Gelfand-Paldus basis

This is the first in a series of three articles which aimed to derive the matrix elements of the U(2n) generators in a multishell spin-orbit basis. This is a basis appropriate to many-electron systems which have a natural partitioning of the orbital space and where also spin-dependent terms are included in the Hamiltonian. The method is based on a new spin-dependent unitary group approach to the many-electron correlation problem due to Gould and Paldus [M. D. Gould and J. Paldus, J. Chem. Phys. 92, 7394, (1990)]. In this approach, the matrix elements of the U(2n) generators in the U(n) x U(2)-adapted electronic Gelfand basis are determined by the matrix elements of a single Ll(n) adjoint tensor operator called the del-operator, denoted by Delta(j)(i) (1 less than or equal to i, j less than or equal to n). Delta or del is a polynomial of degree two in the U(n) matrix E = [E-j(i)]. The approach of Gould and Paldus is based on the transformation properties of the U(2n) generators as an adjoint tensor operator of U(n) x U(2) and application of the Wigner-Eckart theorem. Hence, to generalize this approach, we need to obtain formulas for the complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The nonzero shift coefficients are uniquely determined and may he evaluated by the methods of Gould et al. [see the above reference]. In this article, we define zero-shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis which are appropriate to the many-electron problem. By definition, these are proportional to the corresponding two-shell del-operator matrix elements, and it is shown that the Racah factorization lemma applies. Formulas for these coefficients are then obtained by application of the Racah factorization lemma. The zero-shift adjoint reduced Wigner coefficients required for this procedure are evaluated first. All these coefficients are needed later for the multishell case, which leads directly to the two-shell del-operator matrix elements. Finally, we discuss an application to charge and spin densities in a two-shell molecular system. (C) 1998 John Wiley & Sons.

Matrix elements of U(2n) generators in a multishell spin-orbit basis. II. The two-shell nonzero shift ACCs and U(2n) generator MEs

This is the second in a series of articles whose ultimate goal is the evaluation of the matrix elements (MEs) of the U(2n) generators in a multishell spin-orbit basis. This extends the existing unitary group approach to spin-dependent configuration interaction (CI) and many-body perturbation theory calculations on molecules to systems where there is a natural partitioning of the electronic orbital space. As a necessary preliminary to obtaining the U(2n) generator MEs in a multishell spin-orbit basis, we must obtain a complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The zero-shift coefficients were obtained in the first article of the series. in this article, we evaluate the nonzero shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. We then demonstrate that the one-shell versions of these coefficients may be obtained by taking the Gelfand-Tsetlin limit of the two-shell formulas. These coefficients,together with the zero-shift types, then enable us to write down formulas for the U(2n) generator matrix elements in a two-shell spin-orbit basis. Ultimately, the results of the series may be used to determine the many-electron density matrices for a partitioned system. (C) 1998 John Wiley & Sons, Inc.

Matrix elements of U(2n) generators in a multishell spin-orbit basis. III. General formulas

This is the third and final article in a series directed toward the evaluation of the U(2n) generator matrix elements (MEs) in a multishell spin/orbit basis. Such a basis is required for many-electron systems possessing a partitioned orbital space and where spin-dependence is important. The approach taken is based on the transformation properties of the U(2n) generators as an adjoint tensor operator of U(n) x U(2) and application of the Wigner-Eckart theorem. A complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis (which is appropriate to the many-electron problem) were obtained in the first and second articles of this series. Ln the first article we defined zero-shift coupling coefficients. These are proportional to the corresponding two-shell del-operator matrix elements. See P. J. Burton and and M. D. Gould, J. Chem. Phys., 104, 5112 (1996), for a discussion of the del-operator and its properties. Ln the second article of the series, the nonzero shift coupling coefficients were derived. Having obtained all the necessary coefficients, we now apply the formalism developed above to obtain the U(2n) generator MEs in a multishell spin-orbit basis. The methods used are based on the work of Gould et al. (see the above reference). (C) 1998 John Wiley & Sons, Inc.

3,5-cycle decompositions

For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n -1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n-2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles. (C) 1998 John Wiley & Sons, Inc.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

Reliability and validity of scores on scales to measure managerial aspirations

The present investigation assessed the reliability and validity of the scores of a subjective measure of desired aspirations and a behavioral measure of enacted aspirations. A sample of 5,655 employees was randomly split into two halves. Principal components analysis on Sample 1, followed by confirmatory factor analysis on Sample 2, confirmed the desired and enacted scales as distinct but related measures of managerial aspirations. The desired and enacted scales had satisfactory levels of internal consistency and temporal stability over a 1-year period. Relationships between the measures of desired and enacted managerial aspirations and both attitudinal and behavioral criteria, measured concurrently and 1 year later, provided preliminary support for convergent and discriminant validity for our sample. Desired aspirations demonstrated stronger validity than enacted aspirations. Although further examination of the psychometric properties of the scales is warranted, the present findings provide promising support for their validity and reliability for our sample.