Native grain refinement of magnesium alloys

High purity Mg-Al type alloys have a naturally fine grain size compared to commercial purity alloys with the same basic composition. This is referred to as native grain refinement. It is shown that native grain refinement occurs only in magnesium alloys containing aluminium. The mechanism is attributed to the Al4C3 particles existing in these alloys. (c) 2005 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Grain refinement efficiency and mechanism of aluminium carbide in Mg-Al alloys

Detailed microscopic examination using optical and electron microscopes suggests that Al4C3, often observed in the central regions of magnesium grains on polished sections, is a potent substrate for primary Mg. Calculations of the crystallographic relationships between magnesium and Al4C3 further support the experimental observations. (c) 2005 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Crystallographic study of grain refinement in aluminum alloys using the edge-to-edge matching model

The edge-to-edge matching model for describing the interfacial crystallographic characteristics between two phases that are related by reproducible orientation relationships has been applied to the typical grain refiners in aluminum alloys. Excellent atomic matching between Al3Ti nucleating substrates, known to be effective nucleation sites for primary Al, and the Al matrix in both close packed directions and close packed planes containing these directions have been identified. The crystallographic features of the grain refiner and the Al matrix are very consistent with the edge-to-edge matching model. For three other typical grain refiners for Al alloys, TiC (when a = 0.4328 nm), TiB2 and AIB(2), the matching only occurs between the close packed directions in both phases and between the second close packed plane of the Al matrix and the second close packed plane of the refiners. According to the model, it is predicted that Al3Ti is a more powerful nucleating substrate for Al alloy than TiC, TiB2 and AlB2. This agrees with the previous experimental results. The present work shows that the edge-to-edge matching model has the potential to be a powerful tool in discovering new and more powerful grain refiners for Al alloys. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Grain refinement of Mg-Al(-Mn) alloys by SiC additions

The addition of SiC particles effectively grain refined a range of Mg-Al alloys. The greatest reductions in grain size were found for the alloys with lower Al contents. The presence of Mg2Si in the microstructure after that SiC addition, and consideration of phase equilibria suggested that the SiC transforms to Al4C3, and this is the actual nucleant. The addition of Mn poisoned the grain refining effect of the SiC addition, probably due to the formation of less potent Al-Mn-carbides. (c) 2006 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Procedures and parameters in the real-time program refinement calculus

The real-time refinement calculus is a formal method for the systematic derivation of real-time programs from real-time specifications in a style similar to the non-real-time refinement calculi of Back and Morgan. In this paper we extend the real-time refinement calculus with procedures and provide refinement rules for refining real-time specifications to procedure calls. A real-time specification can include constraints on, not only what outputs are produced, but also when they are produced. The derived programs can also include time constraints oil when certain points in the program must be reached; these are expressed in the form of deadline commands. Such programs are machine independent. An important consequence of the approach taken is that, not only are the specifications machine independent, but the whole refinement process is machine independent. To implement the machine independent code on a target machine one has a separate task of showing that the compiled machine code will reach all its deadlines before they expire. For real-time programs, externally observable input and output variables are essential. These differ from local variables in that their values are observable over the duration of the execution of the program. Hence procedures require input and output parameter mechanisms that are references to the actual parameters so that changes to external inputs are observable within the procedure and changes to output parameters are externally observable. In addition, we allow value and result parameters. These may be auxiliary parameters, which are used for reasoning about the correctness of real-time programs as well as in the expression of timing deadlines, but do not lead to any code being generated for them by a compiler. (c) 2006 Elsevier B.V. All rights reserved.

A multiresolution terrain model for efficient visualization query processing

Multiresolution Triangular Mesh (MTM) models are widely used to improve the performance of large terrain visualization by replacing the original model with a simplified one. MTM models, which consist of both original and simplified data, are commonly stored in spatial database systems due to their size. The relatively slow access speed of disks makes data retrieval the bottleneck of such terrain visualization systems. Existing spatial access methods proposed to address this problem rely on main-memory MTM models, which leads to significant overhead during query processing. In this paper, we approach the problem from a new perspective and propose a novel MTM called direct mesh that is designed specifically for secondary storage. It supports available indexing methods natively and requires no modification to MTM structure. Experiment results, which are based on two real-world data sets, show an average performance improvement of 5-10 times over the existing methods.

Effect of manganese on grain refinement of Mg-Al based alloys

Manganese is a grain refiner for high purity Mg-3%Al, Mg-6%Al, Mg-9%Al, and commercial AZ31 (Mg-3%Al-1%Zn) alloys when introduced in the form of an Al-60%Mn master alloy splatter but the use of pure Mn flakes and ALTAB (TM) Mn75 tablets shows no grain refinement. Long time holding of the melt at 730 degrees C leads to an increase in grain size. The mechanism is attributed to the presence of all epsilon-AlMn phase (hexagonal close-packed) in the master alloy splatter. (c) 2006 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Mimicking the action of GroEL in molecular dynamics simulations: Application to the refinement of protein structures

Bacterial chaperonin, GroEL, together with its co-chaperonin, GroES, facilitates the folding of a variety of polypeptides. Experiments suggest that GroEL stimulates protein folding by multiple cycles of binding and release. Misfolded proteins first bind to an exposed hydrophobic surface on GroEL. GroES then encapsulates the substrate and triggers its release into the central cavity of the GroEL/ES complex for folding. In this work, we investigate the possibility to facilitate protein folding in molecular dynamics simulations by mimicking the effects of GroEL/ES namely, repeated binding and release, together with spatial confinement. During the binding stage, the (metastable) partially folded proteins are allowed to attach spontaneously to a hydrophobic surface within the simulation box. This destabilizes the structures, which are then transferred into a spatially confined cavity for folding. The approach has been tested by attempting to refine protein structural models generated using the ROSETTA procedure for ab initio structure prediction. Dramatic improvements in regard to the deviation of protein models from the corresponding experimental structures were observed. The results suggest that the primary effects of the GroEL/ES system can be mimicked in a simple coarse-grained manner and be used to facilitate protein folding in molecular dynamics simulations. Furthermore, the results Sur port the assumption that the spatial confinement in GroEL/ES assists the folding of encapsulated proteins.

Procedure compilation in the refinement calculus

High-level language program compilation strategies can be proven correct by modelling the process as a series of refinement steps from source code to a machine-level description. We show how this can be done for programs containing recursively-defined procedures in the well-established predicate transformer semantics for refinement. To do so the formalism is extended with an abstraction of the way stack frames are created at run time for procedure parameters and variables.

The effect of grain refinement and cooling rate on the hot tearing of wrought aluminium alloys

Using modifications to the Rappaz-Drezet-Gremaud hot tearing model, and using empirical equations developed for grain size and dendrite arm spacing (DAS) on the addition of grain refiner for a range of cooling rates, the effect of grain refinement and cooling rate on hot tearing susceptibility has been analysed. It was found that grain refinement decreased the grain size and made the grain morphology more globular. Therefore refining the grain size of an equiaxed dendritic grain decreased the hot tearing susceptibility. However, when the alloy was grain refined such that globular grain morphologies where obtained, further grain refinement increased the hot tearing susceptibility. Increasing the cooling decreased the grain size and made the grain morphology more dendritic and therefore increased the likelihood of hot tearing. The effect was particularly strong for equiaxed dendritic grain morphologies; hence grain refinement is increasingly important at high cooling rates to obtain more globular grain morphologies to reduce the hot tearing susceptibility.

Toward efficient multifeature query processing

In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range ( minimum and maximum values) of the f features with respect to a reference point ( the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B+-tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.

Linear temporal logic and z refinement

Since Z, being a state-based language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also in terms of its state. One means of doing this is to use Linear Temporal Logic (LTL) in which properties about the state of a system over time can be captured. This, however, raises the question of whether these properties are preserved under refinement. Refinement is observation preserving and the state of a specified system is regarded as internal and, hence, non-observable. In this paper, we investigate this issue by addressing the following questions. Given that a Z specification A is refined by a Z specification C, and that P is a temporal logic property which holds for A, what temporal logic property Q can we deduce holds for C? Furthermore, under what circumstances does the property Q preserve the intended meaning of the property P? The paper answers these questions for LTL, but the approach could also be applied to other temporal logics over states such as CTL and the mgr-calculus.