Southern Hemisphere automated supernova search

The Perth Astronomy Research Group has developed an automated supernova search program, using the 61 cm Perth–Lowell reflecting telescope at Perth Observatory in Western Australia, equipped with a CCD camera. The system is currently capable of observing about 15 objects per hour, using 3 min exposures, and has a detection threshold of 18th–19th magnitude. The entire system has been constructed using low‐cost IBM‐compatible computers. Two original discoveries (SN 1993K, SN 1994R) have so far been made during automated search runs. This paper describes the hardware and software used for the supernova search program, and shows some preliminary results from the search system

Parity violating pion electroproduction off the nucleon

Parity violating (PV) contributions due to interference between $\gamma$ and $Z^0$ exchange are calculated for pion electroproduction off the nucleon. A phenomenological model with effective Lagrangians is used to determine the resulting asymmetry for the energy region between threshold and $\Delta(1232)$ resonance. The $\Delta$ resonance is treated as a Rarita-Schwinger field with phenomenological $N \Delta$ transition currents. The background contributions are given by the usual Born terms using the pseudovector $\pi N$ Lagrangian. Numerical results for the asymmetry are presented.Comment: 17 pages, RevTeX, 6 figures (in separate file figs.uu), uses epsf, accepted for publication in Z. Phys.

Reconstructing the 3-D Trajectories of CMEs in the Inner Heliosphere

A method for the full three-dimensional (3-D) reconstruction of the trajectories of coronal mass ejections (CMEs) using Solar TErrestrial RElations Observatory (STEREO) data is presented. Four CMEs that were simultaneously observed by the inner and outer coronagraphs (COR1 and 2) of the Ahead and Behind STEREO satellites were analysed. These observations were used to derive CME trajectories in 3-D out to ~15Rsun. The reconstructions using COR1/2 data support a radial propagation model. Assuming pseudo-radial propagation at large distances from the Sun (15-240Rsun), the CME positions were extrapolated into the Heliospheric Imager (HI) field-of-view. We estimated the CME velocities in the different fields-of-view. It was found that CMEs slower than the solar wind were accelerated, while CMEs faster than the solar wind were decelerated, with both tending to the solar wind velocity.Comment: 17 pages, 10 figures, 1 appendi

A moving mesh finite element algorithm for the adaptive solution of time-dependent partial differential equations with moving boundaries

A moving mesh finite element algorithm is proposed for the adaptive solution of nonlinear diffusion equations with moving boundaries in one and two dimensions. The moving mesh equations are based upon conserving a local proportion, within each patch of finite elements, of the total “mass” that is present in the projected initial data. The accuracy of the algorithm is carefully assessed through quantitative comparison with known similarity solutions, and its robustness is tested on more general problems. Applications are shown to a variety of problems involving time-dependent partial differential equations with moving boundaries. Problems which conserve mass, such as the porous medium equation and a fourth order nonlinear diffusion problem, can be treated by a simplified form of the method, while problems which do not conserve mass require the full theory

Memory enhancing drugs and Alzheimer’s Disease: Enhancing the self or preventing the loss of it?

In this paper we analyse some ethical and philosophical questions related to the development of memory enhancing drugs (MEDs) and anti-dementia drugs. The world of memory enhancement is coloured by utopian thinking and by the desire for quicker, sharper, and more reliable memories. Dementia is characterized by decline, fragility, vulnerability, a loss of the most important cognitive functions and even a loss of self. While MEDs are being developed for self-improvement, in Alzheimer’s Disease (AD) the self is being lost. Despite this it is precisely those patients with AD and other forms of dementia that provide the subjects for scientific research on memory improvement. Biomedical research in the field of MEDs and anti-dementia drugs appears to provide a strong impetus for rethinking what we mean by ‘memory’, ‘enhancement’, ‘therapy’, and ‘self’. We conclude (1) that the enhancement of memory is still in its infancy, (2) that current MEDs and anti-dementia drugs are at best partially and minimally effective under specific conditions, (3) that ‘memory᾿and ‘enhancement᾿are ambiguous terms, (4) that there is no clear-cut distinction between enhancement and therapy, and (5) that the research into MEDs and anti-dementia drugs encourages a reductionistic view of the human mind and of the self

Synchronous counting and computational algorithm design

Consider a complete communication network on n nodes, each of which is a state machine with s states. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are “odd” and which are “even”. We require that the solution is self-stabilising (reaching the correct operation from any initial state) and it tolerates f Byzantine failures (nodes that send arbitrary misinformation). Prior algorithms are expensive to implement in hardware: they require a source of random bits or a large number of states s. We use computational techniques to construct very compact deterministic algorithms for the first non-trivial case of f = 1. While no algorithm exists for n < 4, we show that as few as 3 states are sufficient for all values n ≥ 4. We prove that the problem cannot be solved with only 2 states for n = 4, but there is a 2-state solution for all values n ≥ 6.Peer reviewe

Distributed Consensus, Revisited

We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors (Diamond S or, equivalently, Omega), under the hypothesis that only a minority of processes may crash. The model is defined as a global transition system that is unambigously generated by local transition rules. The model is syntax-free in that it does not refer to any form of programming language or pseudo code. We use our model to formally prove that the algorithm is correct