Using Adobe Flash Lite on mobile phones for psychological research: reaction time measurement reliability and inter-device variability

Mobile telephones have significant potential for use in psychological research, possessing unique characteristics—not least their ubiquity—that may make them useful tools for psychologists. We examined whether it is possible to measure reaction times (RTs) accurately using Adobe Flash Lite on mobile phones. We ran simple and choice RT experiments on two widely available mobile phones, a Nokia 6110 Navigator and a Sony Ericsson W810i, using a wireless application protocol (WAP) connection to access the Internet from the devices. RTs were compared within subjects with those obtained using a Linux-based millisecond-accurate measurement system. Results show that measured RTs were significantly longer on mobile devices, and that overall RTs and distribution of RTs varied across device

Quantum affine Cartan matrices, Poincare series of binary polyhedral groups, and reflection representations

We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r) that one usually associates with such a group and hence with a simply-laced Coxeter-Dynkin diagram have a meaningful definition for the non-simply-laced diagrams, too, and as a byproduct we extend Saito's formula for the determinant of the Cartan matrix to all cases. Returning to invariant theory we show that for each irreducible representation i of a binary tetrahedral, octahedral, or icosahedral group one can find a homomorphism into a finite complex reflection group whose defining reflection representation restricts to i.Comment: 19 page

Reconstructing sparticle mass spectra using hadronic decays

Most sparticle decay cascades envisaged at the Large Hadron Collider (LHC) involve hadronic decays of intermediate particles. We use state-of-the art techniques based on the K⊥ jet algorithm to reconstruct the resulting hadronic final states for simulated LHC events in a number of benchmark supersymmetric scenarios. In particular, we show that a general method of selecting preferentially boosted massive particles such as W±, Z0 or Higgs bosons decaying to jets, using sub-jets found by the K⊥ algorithm, suppresses QCD backgrounds and thereby enhances the observability of signals that would otherwise be indistinct. Consequently, measurements of the supersymmetric mass spectrum at the per-cent level can be obtained from cascades including the hadronic decays of such massive intermediate bosons

Liouville integrability of a class of integrable spin Calogero-Moser systems and exponents of simple Lie algebras

In previous work, we introduced a class of integrable spin Calogero-Moser systems associated with the classical dynamical r-matrices with spectral parameter, as classified by Etingof and Varchenko for simple Lie algebras. Here the main purpose is to establish the Liouville integrability of these systems by a uniform method

A Robust Solution Procedure for Hyperelastic Solids with Large Boundary Deformation

Compressible Mooney-Rivlin theory has been used to model hyperelastic solids, such as rubber and porous polymers, and more recently for the modeling of soft tissues for biomedical tissues, undergoing large elastic deformations. We propose a solution procedure for Lagrangian finite element discretization of a static nonlinear compressible Mooney-Rivlin hyperelastic solid. We consider the case in which the boundary condition is a large prescribed deformation, so that mesh tangling becomes an obstacle for straightforward algorithms. Our solution procedure involves a largely geometric procedure to untangle the mesh: solution of a sequence of linear systems to obtain initial guesses for interior nodal positions for which no element is inverted. After the mesh is untangled, we take Newton iterations to converge to a mechanical equilibrium. The Newton iterations are safeguarded by a line search similar to one used in optimization. Our computational results indicate that the algorithm is up to 70 times faster than a straightforward Newton continuation procedure and is also more robust (i.e., able to tolerate much larger deformations). For a few extremely large deformations, the deformed mesh could only be computed through the use of an expensive Newton continuation method while using a tight convergence tolerance and taking very small steps.Comment: Revision of earlier version of paper. Submitted for publication in Engineering with Computers on 9 September 2010. Accepted for publication on 20 May 2011. Published online 11 June 2011. The final publication is available at http://www.springerlink.co

Do the home field, global advantage, and liability of unfamiliarness hypotheses hold? empirical evidence from Malaysia

The study explores the home field, global advantage, and liability of unfamiliarness hypotheses in the Malaysian banking sector. The results indicate that Malaysian banks have exhibited productivity progress mainly attributed to technological progress. The authors find negative relationship between foreign and government ownership and bank productivity. Likewise, the publicly listed banks have been relatively less productive compared to private banks, thus rejecting the market discipline hypothesis. The empirical findings suggest that foreign banks from the North American countries to be the least productive banking group lending support to the home field advantage and the limited form of the global advantage hypotheses

Continuous time volatility modelling: COGARCH versus Ornstein-Uhlenbeck models

We compare the probabilistic properties of the non-Gaussian Ornstein-Uhlenbeck based stochastic volatility model of Barndorff-Nielsen and Shephard (2001) with those of the COGARCH process. The latter is a continuous time GARCH process introduced by the authors (2004). Many features are shown to be shared by both processes, but differences are pointed out as well. Furthermore, it is shown that the COGARCH process has Pareto like tails under weak regularity conditions

Regular Incidence Complexes, Polytopes, and C-Groups

Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of abstract regular polytopes has been well-studied. The paper describes the combinatorial structure of a regular incidence complex in terms of a system of distinguished generating subgroups of its automorphism group or a flag-transitive subgroup. Then the groups admitting a flag-transitive action on an incidence complex are characterized as generalized string C-groups. Further, extensions of regular incidence complexes are studied, and certain incidence complexes particularly close to abstract polytopes, called abstract polytope complexes, are investigated.Comment: 24 pages; to appear in "Discrete Geometry and Symmetry", M. Conder, A. Deza, and A. Ivic Weiss (eds), Springe