Reunitising hundredths: prototypic and nonprototypic representations

This paper reports on a study in which 29 Year 6 students (selected from the top 30% of 176 Year 6 students) were individually interviewed to explore their ability to reunitise hundredths as tenths (Behr, Harel, Post & Lesh, 1992) when represented by prototypic (PRO) and nonprototypic (NPRO) models. The results showed that 55.2% of the students were able to unitise both models and that reunitising was more successful with the PRO model. The interviews revealed that many of these students had incomplete, fragmented or non-existent structural knowledge of the reunitising process and often relied on syntactic clues to complete the tasks. The implication for teaching is that instruction should not be limited to PRO representations of the part/whole notion of fraction and that the basic structures (equal parts, link between name and number of equal parts) of the part/whole notion needs to be revisited often.

Fractions, reunitisation and the number-line representation

Centre for Mathematics and Science Education, QUT, Brisbane, Australia This paper reports on a study in which Years 6 and 10 students were individually interviewed to determine their ability to unitise and reunitise number lines used to represent mixed numbers and improper fractions. Only 16.7% of the students (all Year 6) were successful on all three tasks and, in general, Year 6 students outperformed Year 8 students. The interviews revealed that the remaining students had incomplete, fragmented or non-existent structural knowledge of mixed numbers and improper fractions, and were unable to unitise or reunitise number lines. The implication for teaching is that instruction should focus on providing students with a variety of fraction representations in order to develop rich and flexible schema for all fraction types (mixed numbers, and proper and improper fractions).

Lie group symmetry analysis for granular media stress equations

The Airy stress function, although frequently employed in classical linear elasticity, does not receive similar usage for granular media problems. For plane strain quasi-static deformations of a cohesionless Coulomb–Mohr granular solid, a single nonlinear partial differential equation is formulated for the Airy stress function by combining the equilibrium equations with the yield condition. This has certain advantages from the usual approach, in which two stress invariants and a stress angle are introduced, and a system of two partial differential equations is needed to describe the flow. In the present study, the symmetry analysis of differential equations is utilised for our single partial differential equation, and by computing an optimal system of one-dimensional Lie algebras, a complete set of group-invariant solutions is derived. By this it is meant that any group-invariant solution of the governing partial differential equation (provided it can be derived via the classical symmetries method) may be obtained as a member of this set by a suitable group transformation. For general values of the parameters (angle of internal friction and gravity g) it is found there are three distinct classes of solutions which correspond to granular flows considered previously in the literature. For the two limiting cases of high angle of internal friction and zero gravity, the governing partial differential equation admit larger families of Lie point symmetries, and from these symmetries, further solutions are derived, many of which are new. Furthermore, the majority of these solutions are exact, which is rare for granular flow, especially in the case of gravity driven flows.

Automated proof for formal indistinguishability and its applications

Bana et al. proposed the relation formal indistinguishability (FIR), i.e. an equivalence between two terms built from an abstract algebra. Later Ene et al. extended it to cover active adversaries and random oracles. This notion enables a framework to verify computational indistinguishability while still offering the simplicity and formality of symbolic methods. We are in the process of making an automated tool for checking FIR between two terms. First, we extend the work by Ene et al. further, by covering ordered sorts and simplifying the way to cope with random oracles. Second, we investigate the possibility of combining algebras together, since it makes the tool scalable and able to cover a wide class of cryptographic schemes. Specially, we show that the combined algebra is still computationally sound, as long as each algebra is sound. Third, we design some proving strategies and implement the tool. Basically, the strategies allow us to find a sequence of intermediate terms, which are formally indistinguishable, between two given terms. FIR between the two given terms is then guaranteed by the transitivity of FIR. Finally, we show applications of the work, e.g. on key exchanges and encryption schemes. In the future, the tool should be extended easily to cover many schemes. This work continues previous research of ours on use of compilers to aid in automated proofs for key exchange.