116 resultados para Microstructural refinement

em University of Queensland eSpace - Australia


Relevância:

30.00% 30.00%

Publicador:

Resumo:

A new zirconium-rich magnesium-zirconium master alloy (designated AM-cast) has been developed by the CRC for Cast Metals Manufacturing in collaboration with Australian Magnesium Corporation for use as a grain refiner for magnesium alloys that do not contain aluminium. This work describes the microstructural characteristics of this new grain refiner and its grain refining ability when added to different magnesium alloys under various conditions (alloying temperature from 680 °C to 750 °C; weight of melt from 1 kg to 150 kg and sample thickness from 7 mm to 62 mm). Owing to its highly alloyable microstructure, AM-cast can be readily introduced into molten magnesium at any temperature when assisted by a few minutes of stirring or puddling. Little sludge has been found at the bottom of the alloying vessel in these trials due to the fine zirconium particles contained in the master alloy. The recovery of zirconium is normally in the range from 40% to 60% with respect to 1% zirconium addition as the master alloy. It is shown that this new master alloy is an excellent grain refiner for aluminium-free magnesium alloys.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The effect of increasing the amount of added grain refiner on grain size and morphology has been investigated for a range of hypoeutectic Al-Si alloys. The results show a transition in grain size at a silicon concentration of about 3 wt% in unrefined alloys; the grain size decreasing with silicon content before the transition, and increasing beyond the transition point. A change in morphology also occurs with increased silicon content. The addition of grain refiner leads to greater refinement for silicon contents below the transition point than for those contents above the transition point, while the transition point seems to remain unchanged. The slope of the grain size versus silicon content curve after the transition seems to be unaffected by the degree of grain refinement. The results are related to the competitive processes of nucleation and constitutional effects during growth and their impact on nucleation kinetics. (C) 1999 Elsevier Science S.A. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Peptides that induce and recall T-cell responses are called T-cell epitopes. T-cell epitopes may be useful in a subunit vaccine against malaria. Computer models that simulate peptide binding to MHC are useful for selecting candidate T-cell epitopes since they minimize the number of experiments required for their identification. We applied a combination of computational and immunological strategies to select candidate T-cell epitopes. A total of 86 experimental binding assays were performed in three rounds of identification of HLA-All binding peptides from the six preerythrocytic malaria antigens. Thirty-six peptides were experimentally confirmed as binders. We show that the cyclical refinement of the ANN models results in a significant improvement of the efficiency of identifying potential T-cell epitopes. (C) 2001 by Elsevier Science Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The phase and microstructural evolution of multi-cation Sm-Ca-alpha-sialon ceramics was investigated. Six samples were prepared, ranging from a pure Sm-sialon to a pure Ca-sialon, with calcium replacing samarium in 20 eq% increments, thus maintaining an equivalent design composition in all samples. After pressureless sintering at 1820 degreesC for 2 It, all samples were subsequently heat treated up to 192 h at 1450 and 1300 degreesC. The amount of grain boundary glass in the samples after sintering was observed to decrease with increasing calcium levels. A M-ss' or M-ss',-gehlenite solid solution was observed to form during the 1450 degreesC heat treatment of all Sm-containing samples, and this phase forms in clusters in the high-Sm samples. The thermal stability of the alpha-sialon phase was improved in the multi-cation systems. Heat treatment at 1300 degreesC produces SmAlO3 in the high-Sm samples, a M-ss',-gehlenite solid solution in the high-Ca samples, and a Sm-Ca-apatite phase in some intermediate samples. (C) 2002 Elsevier Science Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A program can be refined either by transforming the whole program or by refining one of its components. The refinement of a component is, for the main part, independent of the remainder of the program. However, refinement of a component can depend on the context of the component for information about the variables that are in scope and what their types are. The refinement can also take advantage of additional information, such as any precondition the component can assume. The aim of this paper is to introduce a technique, which we call program window inference, to handle such contextual information during derivations in the refinement calculus. The idea is borrowed from a technique, called window inference, for handling context in theorem proving. Window inference is the primary proof paradigm of the Ergo proof editor. This tool has been extended to mechanize refinement using program window inference. (C) 1997 Elsevier Science B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of modelling complex data structures needed to define the component processes of such systems, and CSP enables the concise specification of process interactions. The basis of the integration is a semantics of Object-Z classes identical to that of CSP processes. This allows classes specified in Object-Z to he used directly within the CSP part of the specification. In addition to specification, we also discuss refinement and verification in this model. The common semantic basis enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used fur the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the the CSP operators together with the logic for Object-Z.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This research is part of a project whose scope was to investigate the engineering properties of new non-commercial alloy formulations based on the Cu rich corner of the Cu-Fe-Cr ternary system with the primary aim of exploring the development of a new cost-effective high-strength, high-conductivity copper alloy. Promising properties have been measured for the following alloys: Cu-0.7wt%Cr-0.3wt%Fe and Cu-0.7wt%Cr-2.0wt%Fe. This paper reports on the microstructural characterisation of these alloys and discusses the mechanical and electrical properties of these alloys in terms of their microstructure, particularly the formation of precipitates. These alloys have evinced properties that warrant further investigation. Cost modelling has shown that Cu-0.7wt%Cr-0.3wt%Fe is approximately 25% cheaper to produce than commercial Cu-1%Cr. It has also been shown to be more cost efficient on a yield stress and % IACS per dollar basis. The reason for the cost saving is that the Cu-0.7%Cr-0.3%Fe alloy can be made with low carbon ferro-chrome additions as the source of chromium rather than the more expensive Cu-Cr master-alloy. For applications in which cost is one of the primary materials selection criteria, it is envisaged that there would be numerous applications in both cast and wrought form, where the Cu-0.7%Cr-0.3%Fe alloy would be more suitable than Cu-1%Cr. (C) 2001 Kluwer Academic Publishers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Y-Ba-Cu-O samples with additions of Y2O3 and CeO2 were quenched during seeded isothermal melt processing and examined by optical microscopy and scanning electron microscopy. Large YBa2Cu3O7-y (Y123) particles in the starting powder were found to form a distinct type of melt during heating, which was unaffected by the Y2O3 or CeO2 additives. This type of melt later formed regions with a low concentration of Y2BaCuO5 (Y211) particles in the Y123 matrix. The maximum growth rate of Y123 that could be sustained in the sample was found to be lower in the melt formed from large Y123 particles, and this may lead to growth accidents and subgrains in some samples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.