title: Magnetic annihilation and reconnection in two dimensions

authors: Watson, P.G.

subjects: MHD—plasmas

abstract: The problems of incompressible, planar, magnetic annihilation and reconnection are discussed. We first emphasize that steady-state reconnection solutions can be constructed from annihilation models involving harmonic velocity fields. We show, however, that the only harmonic velocity profile capable of supporting inviscid magnetic annihilation is the traditional stagnation point flow φ= −αxy. The implication is that further steady-state planar reconnection models derived from annihilation solutions are impossible. We go on to show that certain classes of nonharmonic stream functions allow reconnection solutions to be developed, once the constraint of time independence is relaxed. In particular, we construct an exact reconnection model based on cellular inflows into a periodic assemblage of magnetic X-points.

text: Magnetic annihilation and reconnection in two dimensions The problems of incompressible, planar, magnetic annihilation and reconnection are discussed. We first emphasize that steady-state reconnection solutions can be constructed from annihilation models involving harmonic velocity fields. We show, however, that the only harmonic velocity profile capable of supporting inviscid magnetic annihilation is the traditional stagnation point flow φ= −αxy. The implication is that further steady-state planar reconnection models derived from annihilation solutions are impossible. We go on to show that certain classes of nonharmonic stream functions allow reconnection solutions to be developed, once the constraint of time independence is relaxed. In particular, we construct an exact reconnection model based on cellular inflows into a periodic assemblage of magnetic X-points.

year: 1998-09

title: Domain-independent programming by demonstration in existing applications

authors: Paynter, Gordon W.

subjects: computer science

abstract: This paper describes Familiar, a domain- independent programming by demonstration system for automating iterative tasks in existing, unmodified applications on a popular commercial platform. Familiar is domain- independent in an immediate and practical sense: it requires no domain knowledge from the developer and works immediately with new applications as soon as they are installed. Based on the AppleScript language, the system demonstrates that commercial operating systems are mature enough to support practical, domain- independent programming by demonstration – but only just, for the work exposes many deficiencies.

text: Domain-independent programming by demonstration in existing applications This paper describes Familiar, a domain- independent programming by demonstration system for automating iterative tasks in existing, unmodified applications on a popular commercial platform. Familiar is domain- independent in an immediate and practical sense: it requires no domain knowledge from the developer and works immediately with new applications as soon as they are installed. Based on the AppleScript language, the system demonstrates that commercial operating systems are mature enough to support practical, domain- independent programming by demonstration – but only just, for the work exposes many deficiencies.

year: 2001-02

title: Te Poutikanga

authors: Maxwell, Te Kahautu

abstract: Te Poutikanga was composed to pay homage to the newly appointed spiritual leader of Te Haahi Ringatū Mr Wirangi Pera who was appointed on the 1 January 2014. This composition was performed by ŌpōtikiMai Tawhiti at the Mātaatua Regional Kapa Haka Competition and placed first in the Whakawātea discipline.

text: Te Poutikanga Te Poutikanga was composed to pay homage to the newly appointed spiritual leader of Te Haahi Ringatū Mr Wirangi Pera who was appointed on the 1 January 2014. This composition was performed by ŌpōtikiMai Tawhiti at the Mātaatua Regional Kapa Haka Competition and placed first in the Whakawātea discipline.

year: 2014-01-25