Natural convection from a plane vertical porous surface in non-isothermal surroundings

In this paper, laminar natural convection flow from a permeable and isothermal vertical surface placed in non-isothermal surroundings is considered. Introducing appropriate transformations into the boundary layer equations governing the flow derives non-similar boundary layer equations. Results of both the analytical and numerical solutions are then presented in the form of skin-friction and Nusselt number. Numerical solutions of the transformed non-similar boundary layer equations are obtained by three distinct solution methods, (i) the perturbation solutions for small � (ii) the asymptotic solution for large � (iii) the implicit finite difference method for all � where � is the transpiration parameter. Perturbation solutions for small and large values of � are compared with the finite difference solutions for different values of pertinent parameters, namely, the Prandtl number Pr, and the ambient temperature gradient n.

Recognising Torres Strait Islander women’s knowledges in their children’s mathematics education

This paper discusses women’s involvement in their children’s mathematics education. It does, where possible, focus Torres Strait Islander women who share the aspirations of Aborginal communities around Australia. That is, they are keen for their children to receive an education that provides them with opportunities for their present and future lives. They are also keen to have their cultures’ child learning practices recognised and respected within mainstream education. This recognition has some way to go with the language of instruction in schools written to English conventions, decontextualised and disconnected to the students’ culture, Community and home language.

Inexact uniformization method for computing transient distributions of Markov chains

The uniformization method (also known as randomization) is a numerically stable algorithm for computing transient distributions of a continuous time Markov chain. When the solution is needed after a long run or when the convergence is slow, the uniformization method involves a large number of matrix-vector products. Despite this, the method remains very popular due to its ease of implementation and its reliability in many practical circumstances. Because calculating the matrix-vector product is the most time-consuming part of the method, overall efficiency in solving large-scale problems can be significantly enhanced if the matrix-vector product is made more economical. In this paper, we incorporate a new relaxation strategy into the uniformization method to compute the matrix-vector products only approximately. We analyze the error introduced by these inexact matrix-vector products and discuss strategies for refining the accuracy of the relaxation while reducing the execution cost. Numerical experiments drawn from computer systems and biological systems are given to show that significant computational savings are achieved in practical applications.

On the data consumption benefits of accepting increased uncertainty

In the context of learning paradigms of identification in the limit, we address the question: why is uncertainty sometimes desirable? We use mind change bounds on the output hypotheses as a measure of uncertainty and interpret ‘desirable’ as reduction in data memorization, also defined in terms of mind change bounds. The resulting model is closely related to iterative learning with bounded mind change complexity, but the dual use of mind change bounds — for hypotheses and for data — is a key distinctive feature of our approach. We show that situations exist where the more mind changes the learner is willing to accept, the less the amount of data it needs to remember in order to converge to the correct hypothesis. We also investigate relationships between our model and learning from good examples, set-driven, monotonic and strong-monotonic learners, as well as class-comprising versus class-preserving learnability.