Artist Rafaello Busoni seated in his studio next to one of his paintings; Paris.

Digital Image

The identification of teaching interactions used in one-to-one teaching of number in the early years of schooling

This research paper reports on phase one of an investigation of video recorded intensive one-to-one teaching interactions with 6–7-year-old students who were in their second year of schooling in Australia and identified by the their teacher as low attaining in early number. The two-phased study from which this paper emerges was originally conducted in 1998 as part of my Bachelor of Teaching Honours (Research) program at Southern Cross University Lismore, New South Wales. That study identified teaching interactions particularly suited to one-to-one teaching in the Maths Recovery Program, a program designed for these students who were at risk of failure in early number. Since that time a great deal has not changed with limited literature available that comprehensively reports on teaching interactions in intensive one-to-one settings. Revisiting the original study is considered timely given the increasing number of withdrawal and intensive programs now funded and adopted by schools and yet, rarely reported on in terms of the effectiveness of the teaching interactions that occur in such settings. This paper then presents a discussion of a preliminary series of teaching interactions that either positively and or negatively influence an intensive one-to-one teaching and learning setting

Using a glow graph to represent data flow and dependency in event logs

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other representations.

PIV study on the dimple mid-plane of a narrow rectangular channel with dimples applied to one wall

This paper presents an investigation of the fluid flow in the fully developed portion of a rectangular channel (Aspect Ratio of 2) with dimples applied to one wall at channel Reynolds numbers of 20,000, 30,000, and 40,000. The dimples are applied in a staggered-row, racetrack configuration. Results for three different dimple geometries are presented: a large dimple, small dimple, and double dimple. Heat transfer and aerodynamic results from preceding works are presented in Nusselt number and friction factor augmentation plots as determined experimentally. Using particle image velocimetry, the region near the dimple feature is studied in detail in the location of the entrainment and ejection of vortical packets into and out of the dimple; the downstream wake region behind each dimple is also studied to examine the effects of the local flow phenomenon that result in improved heat transfer in the areas of the channel wall not occupied by a feature. The focus of the paper is to examine the secondary flows in these dimpled channels in order to support the previously presented heat transfer trends. The flow visualization is also intended to improve the understanding of the flow disturbances in a dimpled channel; a better understanding of these effects would lead the development of more effective channel cooling designs. Copyright © 2011 by ASME.

From words to images and then to one image: the poster in Spielberg' s translations of literary works

Eterio Pajares, Raquel Merino y José Miguel Santamaría (eds.)

Refinement of edge-to-edge matching model and its application in the Mg17Al12/alpha-Mg and alpha-Y/alpha-Mg systems

A refined version of the edge-to-edge matching model is described here. In the original model, the matching directions were obtained from the planes with all the atomic centers that were exactly in the plane, or the distance from the atomic center to the plane which was less than the atomic radius. The direction-matching pairs were the match of straight rows-straight rows and zigzag rows-zigzag rows. In the refined model, the matching directions were obtained from the planes with all the atomic centers that were exactly in the plane.

The many-to-many location-routing problem

In this paper the many to many location routing problem is introduced, and its relationship to various problems in distribution management is emphasised. Useful mathematical formulations which can be easily extended to cater for other related problems are produced. Techniques for tackling this complex distribution problem are also outlined.

A robust approach to subsequence matching

In terms of a general time theory which addresses time-elements as typed point-based intervals, a formal characterization of time-series and state-sequences is introduced. Based on this framework, the subsequence matching problem is specially tackled by means of being transferred into bipartite graph matching problem. Then a hybrid similarity model with high tolerance of inversion, crossover and noise is proposed for matching the corresponding bipartite graphs involving both temporal and non-temporal measurements. Experimental results on reconstructed time-series data from UCI KDD Archive demonstrate that such an approach is more effective comparing with the traditional similarity model based algorithms, promising robust techniques for lager time-series databases and real-life applications such as Content-based Video Retrieval (CBVR), etc.

An economical route to one-way quantum computation

We assess the effects of a realistic intrinsic model for imperfections in cluster states by introducing noisy cluster states and characterizing their role in the one-way computational model. A suitable strategy to counter-affect these non-idealities is represented by the use of small clusters, stripped of any redundancy, which leads to the search for compact schemes for one-way quantum computation. In light of this, we quantitatively address the behavior of a simple four-qubit cluster which simulates a controlled-NOT under the influences of our model for decoherence. Our scheme can be particularly useful in an all-optical setup and the strategy we address can be directly applied in those, experimental situations where small cluster states can be constucted.

Combining preference ordering and contingent valuation methods to assess non market benefit of alternative afforestation projects

The application of the contingent valuation method (CVM) in this paper incorporates a prior preference ordering of several alternative future afforestation programmes which could be implemented in Ireland over the next decade. This particular experimental design is thereby shown to reveal the potentially conflicting preferences of different groups within society. These findings are used to devise appropriate CVM scenarios to take account, not only of the efficiency gains of choosing a single policy alternative over others, but also the effects on the distribution of non market benefit between different groups within society, arising from choice between alternatives. (C) 1998 Elsevier Science Ltd. All rights reserved.