Surveillance as a technique of power in physical education

This paper analyses surveillance as a technique of power in the culture of physical education, including its impact upon the health of teachers. Additionally, gendered aspects of surveillance are investigated because physical education is an important location in and through which bodies are inscribed with gendered identities. The embodied nature of physical educators' work renders the body as particularly significant in patterns of privilege and domination. The research was guided by Michel Foucault's work and poststructural feminist perspectives on the importance of power in social life. At nine schools across two international research sites, the functioning of surveillance was evidenced through the multi-directional workings of power in top-down, lateral, and bottom-up configurations. Data indicated that surveillance occurred on, through and about bodies. It had a strong gender dimension as the male gaze inscribed both female teachers' and students' bodies with value and competence. In terms of teachers' health, as well as responses to surveillance on a physical and emotional level, the workings of power were also influential in shaping teachers' identities.

Experimental manipulation of prior experience: Effects on item and associative recognition

Frequency of exposure to very low- and high-frequency words was manipulated in a three-phase (familiarisation, study, and test) design. During familiarisation, words were presented with their definition (once, four times, or not presented). One week (Experiment 1) or one day (Experiment 2) later, participants studied a list of homogeneous pairs (i.e., pair members were matched on background and familiarisation frequency). Item and associative recognition of high- and very low-frequency words presented in intact, rearranged, old-new, or new-new pairs were tested in Experiment 1. Associative recognition of very low-frequency words was tested in Experiment 2. Results showed that prior familiaris ation improved associative recognition of very low-frequency pairs, but had no effect on high-frequency pairs. The role of meaning in the formation of item-to-item and item-to-context associations and the implications for current models of memory are discussed.

The transform likelihood ratio method for rare event simulation with heavy tails

We present a novel method, called the transform likelihood ratio (TLR) method, for estimation of rare event probabilities with heavy-tailed distributions. Via a simple transformation ( change of variables) technique the TLR method reduces the original rare event probability estimation with heavy tail distributions to an equivalent one with light tail distributions. Once this transformation has been established we estimate the rare event probability via importance sampling, using the classical exponential change of measure or the standard likelihood ratio change of measure. In the latter case the importance sampling distribution is chosen from the same parametric family as the transformed distribution. We estimate the optimal parameter vector of the importance sampling distribution using the cross-entropy method. We prove the polynomial complexity of the TLR method for certain heavy-tailed models and demonstrate numerically its high efficiency for various heavy-tailed models previously thought to be intractable. We also show that the TLR method can be viewed as a universal tool in the sense that not only it provides a unified view for heavy-tailed simulation but also can be efficiently used in simulation with light-tailed distributions. We present extensive simulation results which support the efficiency of the TLR method.

Braided m-Lie algebras

Braided m-Lie algebras induced by multiplication are introduced, which generalize Lie algebras, Lie color algebras and quantum Lie algebras. The necessary and sufficient conditions for the braided m-Lie algebras to be strict Jacobi braided Lie algebras are given. Two classes of braided m-Lie algebras are given, which are generalized matrix braided m-Lie algebras and braided m-Lie subalgebras of End(F)M, where M is a Yetter-Drinfeld module over B with dimB < infinity. In particular, generalized classical braided m-Lie algebras sl(q,f)(GM(G)(A),F) and osp(q,l)(GM(G)(A),M,F) of generalized matrix algebra GMG(A) are constructed and their connection with special generalized matrix Lie superalgebra sl(s,f)(GM(Z2)(A(s)),F) and orthosymplectic generalized matrix Lie super algebra osp(s,l) (GM(Z2)(A(s)),M-s,F) are established. The relationship between representations of braided m-Lie algebras and their associated algebras are established.

A Lanczos-powered implementation of the Faber polynomial quantum time propagator for reaction probabilities

Complementing our recent work on subspace wavepacket propagation [Chem. Phys. Lett. 336 (2001) 149], we introduce a Lanczos-based implementation of the Faber polynomial quantum long-time propagator. The original version [J. Chem. Phys. 101 (1994) 10493] implicitly handles non-Hermitian Hamiltonians, that is, those perturbed by imaginary absorbing potentials to handle unwanted reflection effects. However, like many wavepacket propagation schemes, it encounters a bottleneck associated with dense matrix-vector multiplications. Our implementation seeks to reduce the quantity of such costly operations without sacrificing numerical accuracy. For some benchmark scattering problems, our approach compares favourably with the original. (C) 2004 Elsevier B.V. All rights reserved.

Eigenvalues of Casimir invariants for Uq[osp(m|n)]

For each quantum superalgebra U-q[osp(m parallel to n)] with m > 2, an infinite family of Casimir invariants is constructed. This is achieved by using an explicit form for the Lax operator. The eigenvalue of each Casimir invariant on an arbitrary irreducible highest weight module is also calculated. (c) 2005 American Institute of Physics.

Aurifeuillian factorization

The Cunningham project seeks to factor numbers of the form bn±1 with b = 2, 3, . . . small. One of the most useful techniques is Aurifeuillian Factorization whereby such a number is partially factored by replacing bn by a polynomial in such a way that polynomial factorization is possible. For example, by substituting y = 2k into the polynomial factorization (2y2)2+1 = (2y2−2y+1)(2y2+2y+1) we can partially factor 24k+2+1. In 1962 Schinzel gave a list of such identities that have proved useful in the Cunningham project; we believe that Schinzel identified all numbers that can be factored by such identities and we prove this if one accepts our definition of what “such an identity” is. We then develop our theme to similarly factor f(bn) for any given polynomial f, using deep results of Faltings from algebraic geometry and Fried from the classification of finite simple groups.

Adolescent tobacco-related associative memory: a cross-sectional and contextual analysis

Tobacco use is prevalent in adolescents, and understanding factors that contribute to its uptake and early development remains a critical public health priority. Implicit drug-related memory associations (DMAs) are predictive of drug use in older samples, but such models have little application to adolescent tobacco use. Moreover, extant research on memory associations yields little information on contextual factors that may be instrumental in the development of DMAs. The present study examined (a) the degree to which tobacco-related memory associations (TMAs) were associated with concurrent tobacco use and (b) the extent to which TMAs mediated the association of peer and self-use. A sample of 210 Australian high school students was recruited. Participants completed TMA tasks and behavioral checklists designed to obscure the tobacco-related focus of the study. Results showed that TMAs were associated with peer use, and TMAs predicted self-use. We found no evidence that TMAs mediated the association of peer and self-use. Future research might examine the emotive valence of implicit nodes and drinking behavior. The results have implications for testing the efficacy of consciousness-raising interventions for adolescents at risk of tobacco experimentation or regular use.

Designs for generalized linear models with several variables and model uncertainty

Standard factorial designs sometimes may be inadequate for experiments that aim to estimate a generalized linear model, for example, for describing a binary response in terms of several variables. A method is proposed for finding exact designs for such experiments that uses a criterion allowing for uncertainty in the link function, the linear predictor, or the model parameters, together with a design search. Designs are assessed and compared by simulation of the distribution of efficiencies relative to locally optimal designs over a space of possible models. Exact designs are investigated for two applications, and their advantages over factorial and central composite designs are demonstrated.

Varieties of algebras arising from K-perfect m-cycle systems

A class of algebras forms a variety if it is characterised by a collection of identities. There is a well-known method, often called the standard construction, which gives rise to algebras from m-cycle systems. It is known that the algebras arising from {1}-perfect m-cycle systems form a variety for m is an element of {3, 5} only, and that the algebras arising from {1, 2}-perfect m-cycle systems form a variety for m is an element of {3, 5, 7} only. Here we give, for any set K of positive integers, necessary and sufficient conditions under which the algebras arising from K-perfect m-cycle systems form a variety. (c) 2006 Elsevier B.V. All rights reserved.

Generalized Perk-Schultz models: solutions of the Yang-Baxter equation associated with quantized orthosymplectic superalgebras

The Perk-Schultz model may be expressed in terms of the solution of the Yang-Baxter equation associated with the fundamental representation of the untwisted affine extension of the general linear quantum superalgebra U-q (gl(m/n)], with a multiparametric coproduct action as given by Reshetikhin. Here, we present analogous explicit expressions for solutions of the Yang-Baxter equation associated with the fundamental representations of the twisted and untwisted affine extensions of the orthosymplectic quantum superalgebras U-q[osp(m/n)]. In this manner, we obtain generalizations of the Perk-Schultz model.

On the multicomponent polynomial solution models

The present study addresses the problem of predicting the properties of multicomponent systems from those of corresponding binary systems. Two types of multicomponent polynomial models have been analysed. A probabilistic interpretation of the parameters of the Polynomial model, which explicitly relates them with the Gibbs free energies of the generalised quasichemical reactions, is proposed. The presented treatment provides a theoretical justification for such parameters. A methodology of estimating the ternary interaction parameter from the binary ones is presented. The methodology provides a way in which the power series multicomponent models, where no projection is required, could be incorporated into the Calphad approach.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE

Integrating runtime assertions with dynamic types: Structuring a derivation from an incomputable specification

An inherent incomputability in the specification of a functional language extension that combines assertions with dynamic type checking is isolated in an explicit derivation from mathematical specifications. The combination of types and assertions (into "dynamic assertion-types" - DATs) is a significant issue since, because the two are congruent means for program correctness, benefit arises from their better integration in contrast to the harm resulting from their unnecessary separation. However, projecting the "set membership" view of assertion-checking into dynamic types results in some incomputable combinations. Refinement of the specification of DAT checking into an implementation by rigorous application of mathematical identities becomes feasible through the addition of a "best-approximate" pseudo-equality that isolates the incomputable component of the specification. This formal treatment leads to an improved, more maintainable outcome with further development potential.