Properties of rapidly solidified binary copper alloys

A number of binary Cu-X alloys (X = Fe, Cr, Si and Al) with alloying elements up to approximate to 12 at % for Fe and Cr, and = 20 at% for Al and Si were cast into thin ribbons (30-50 mu m thickness) by chill block melt spinning. The structural state of the as-cast ribbons was determined by X-ray diffraction (XRD) and microstructures of the quenched alloys were compared with the ingot equivalent, It was possible to achieve solid solution and fine dispersion of secondary phase beyond XRD detection up to approximate to 8 at% solute for Fe and Cr, which is beyond the expected concentration limits from equilibrium phase diagrams. The effects of alloying on resistivity and microhardness are also presented.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

An architectonic comparison of the ventrobasal complex of two Megachiropteran and one Microchiropteran bat: implications for the evolution of Chiroptera

The architectonic features of the thalamic ventrobasal complex (Vb) of two species of Megachiropteran (Grey-headed flying fox, Pteropus poliocephalus, and the Eastern tube-nosed bat, Nyctimene robinsoni) are compared with those of a Microchiropteran (Australian ghost bat, Macroderma gigas). The somatosensory system was chosen for comparison as it represents a sensory system that has undergone analogous modifications in both Chiropteran lineages (the evolution of the wing). The components of Vb were examined as there are taxon-specific features in this region of the brain. Within the Megachiropteran Vb, four subnuclei were recognized: the ventral posterior medial (VPM), the ventral posterior lateral (VPL), the ventral posterior inferior (VPI), and the basal ventral medial (VMb). In the ghost bat only VPM and VPL were identified with certainty. No VPI was evident in the ghost bat, however a putative VMb was observed. Vb of the ghost bat also lacked the arcuate lamina, which distinguishes VPM from VPL in the Megachiropterans and many other mammals. These taxon-specific differences lend support to the proposal that the order Chiroptera has a diphyletic origin.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

Mark-recapture may reveal more about ecology than about population trends: Demography of a threatened ghost bat (Macroderma gigas) population

Since European settlement in Australia, the geographical range of ghost bats (Macroderma gigas) has contracted northwards. Ghost bats are thought to occur in disjunct populations with little interpopulation migration, raising concerns over the current status and future viability of the southernmost colony, which has also been threatened by mining activity. To address these concerns, demographic parameters of the southernmost colony were estimated from a mark-recapture study conducted during 1975-1981. Female bats gave birth to a single young in late spring, but only 40% (22-70%, 95% CI) of females bred in their second year, increasing to 93% (87-97%, 95% CI) for females greater than or equal to 2 years old. Sixty-five percent of juveniles caught were female. Annual adult survival ranged between 0.57-0.77 for females and 0.43-0.66 for males, and was lowest over winter-spring and greatest in autumn-winter. Juvenile survival for the first year ranged between 0.35-0.46 for females and 0.29-0.42 for males. Adult survival varied among seasons, was negatively associated with rainfall, but was not associated with temperature beyond being lower in late winter. Poor survival may result from the inferior daytime roosts that bats must use if water seepage forces them to leave their normal roosts. Although these age-specific rates of fecundity and survival suggested a declining population, mark-recapture estimates of the population trend indicated stability over the study period. Counts at daytime roosts also suggested a population decline, but were considered unreliable because of an increasing tendency of bats to avoid detection. It is therefore likely that some assumptions in estimating survival were violated. These results provide a caution against the uncritical use of population projections derived from mark-recapture estimates of demographic parameters, and the use of untested indices as the basis for conservation decisions.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.