PISA, national and regional education policies and their effect on mathematics teaching in England and Germany

To consider how processes of education governance linking the work of international organisations and national and regional policy-making in two contrasting policy environments affect policy enactment in schools, differences in mathematics teaching between English and German secondary schools were analysed using Bernstein’s account of pedagogic practice. This allowed the opportunities for achievement provided to different groups of students to be identified. The findings suggest that, as a result of strong governance pressures, English higher achievers have more opportunities to make progress than lower achievers, a concern which is consistent with standardised assessment data. Despite policy changes, similarities in the teaching of higher and lower achieving students in Germany remain and these account, in part, for the narrower gap in achievement there. </jats:p

Stability of Mine Car Motion in Curves of Invariable and Variable Radii

We discuss our experiences adapting three recent algorithms for maximum common (connected) subgraph problems to exploit multi-core parallelism. These algorithms do not easily lend themselves to parallel search, as the search trees are extremely irregular, making balanced work distribution hard, and runtimes are very sensitive to value-ordering heuristic behaviour. Nonetheless, our results show that each algorithm can be parallelised successfully, with the threaded algorithms we create being clearly better than the sequential ones. We then look in more detail at the results, and discuss how speedups should be measured for this kind of algorithm. Because of the difficulty in quantifying an average speedup when so-called anomalous speedups (superlinear and sublinear) are common, we propose a new measure called aggregate speedup

Pseudovector vs. pseudoscalar coupling in one-boson exchange NN potentials

We examine the effects of pseudoscalar and pseudovector coupling of the pi and eta mesons in one-boson exchange models of the NN interaction using two approaches: time-ordered perturbation theory unitarized with the relativistic Lippmann-Schwinger equation, and a reduced Bethe-Salpeter equation approach using the Thompson equation. Contact terms in the one-boson exchange amplitudes in time-ordered perturbation theory lead naturally to the introduction of s-channel nucleonic cutoffs for the interaction, which strongly suppresses the far off-shell behavior of the amplitudes in both approaches. Differences between the resulting NN predictions of the various models are found to be small, and particularly so when coupling constants of the other mesons are readjusted within reasonable limits.Comment: 24 pages, 4 figure

Experimental Evaluation of Subgraph Isomorphism Solvers

International audienceSubgraph Isomorphism (SI) is an NP-complete problem which is at the heart of many structural pattern recognition tasks as it involves finding a copy of a pattern graph into a target graph. In the pattern recognition community, the most well-known SI solvers are VF2, VF3, and RI. SI is also widely studied in the constraint programming community, and many constraint-based SI solvers have been proposed since Ullman, such as LAD and Glasgow, for example. All these SI solvers can solve very quickly some large SI instances, that involve graphs with thousands of nodes. However, McCreesh et al. have recently shown how to randomly generate SI instances the hardness of which can be controlled and predicted, and they have built small instances which are computationally challenging for all solvers. They have also shown that some small instances, which are predicted to be easy and are easily solved by constraint-based solvers, appear to be challenging for VF2 and VF3. In this paper, we widen this study by considering a large test suite coming from eight benchmarks. We show that, as expected for an NP-complete problem, the solving time of an instance does not depend on its size, and that some small instances coming from real applications are not solved by any of the considered solvers. We also show that, if RI and VF3 can solve very quickly a large number of easy instances, for which Glasgow or LAD need more time, they fail at solving some other instances that are quickly solved by Glasgow or LAD, and they are clearly outperformed by Glasgow on hard instances. Finally, we show that we can easily combine solvers to take benefit of their complementarity