Mass transport in layered polycrystalline thin films

Thin film specimens having the layered structure Pb/Ag/Au and Pb/Ag/Pd were prepared for a study of the reactions between Pb and Au, and Pb and Pd, respectively. These reactions require mass transport through the intermediate layer of Ag. In the case of the reaction between Pb and Au, it is found that after annealing at 200°C for more than 24 h the compound Pb₂Au can be detected in those specimens where the 3000 Å thick Ag layer is polycrystalline but not in specimens where the Ag layer is a single crystal. This result indicates that grain boundaries in the polycrystalline Ag layer act as paths for rapid transport of Au and Pb atoms. In the case of the reaction between Pb and Pd, we prepared only polycrystalline Ag as the intermediate layer and detected the compound Pb₂Pd after a few hours of annealing in the temperature range 160°–200°C. The lattice parameter of the polycrystalline Ag layer before and after annealing has been measured by X-ray diffraction and found to be unchanged, indicating that leakage into the Ag grains by lattice diffusion is negligible and that boundary transport is dominant. Separate study of grain boundary diffusion kinetics is now possible using this technique.     

More on the behavior of soda lime glass under shock loading

A series of plate impact experiments with soda-lime glass specimens was performed in order to further investigate the complex behavior of this material in the 0–8 GPa range of shock loading. Using commercial manganin gauges we followed the stress histories and their different shapes as the stresses increase from 3.5 to about 8.0 GPa. In particular, we find that there are meaningful differences between the shapes of these signals at pressures below about 4.0 GPa, in between 4.0 and 6.0 GPa and above 6.0 GPa. We also gather more data on the fractured glass behind the fracture wave front, from our measured stress histories, and offer a new way to determine the Hugoniot elastic limit of this material, as well as other brittle solids.     

THE SIZE OF PLASTIC ZONES AND FATIGUE CRACK GROWTH BEHAVIOUR OF THREE FORMS OF A Ti–6Al–2.5Mo–1.5Cr ALLOY

The effect of microstructure on the fatigue properties of Ti–6Al–2.5Mo–1.5Cr alloy was investigated. The experimental results for both the fatigue crack initiation and propagation behaviour, as well as the dynamic fracture toughness ( K _Id ) showed clearly that a lamellar microstructure is superior to two other structures. It was found that, as in the case of steels, the initiation and subsequent growth of cracks in the titanium specimens with a sharp notch may also occur on loading levels below the threshold values of the K factor (Δ K _th ) determined for long fatigue cracks. In addition, measurements by interferential-contrast of the plastic zone size on the surface of specimens revealed that the different rate of crack growth at identical values of Δ K in individual structural states can roughly be correlated with the size of the plastic zone. A general relationship between the fatigue crack growth rate and plastic zone size, the modulus of elasticity and the role of crack tip shielding is discussed.     

Constraint programming and graph algorithms

Aconstraint system includes a set of variables and a set of relations among these variables, calledconstraints. The solution of a constraint system is an assignment of values to variables so that all, or many, of the relations are made true. A simple and efficient method for constraint resolution has been proposed in the work of B.N. Freeman-Benson, J. Maloney, and A. Borning. We show how their method is related to the classical problem of graph matching, and from this connection we derive new resolution algorithms.     

Modeling and simulation of large-scale,linear, multiport systems

A large number of physical and engineering systems may be represented directly in terms of component energy characteristics and their power interactions. When the system elements are modeled as energetic multiports, and their interconnections by power bonds, then the bond graph language is a natural one for describing the entire system. Bond graphs may be written for dynamic systems involving various energy types, such as electrical, mechanical, fluid and thermal; all energy types may be coexistent. Useful modeling elements include multiport storages, dissipators, and junction elements and transducers, as well as sources.Bond graph models of linear multiport systems may be transformed to state-space form by a powerful algorithm based upon operational causality. From the state-space equations, dynamic responses may be obtained by the matrix exponential technique, thereby allowing the direct digital simulation of linear multiport models.The ENPORT program is a realization of the bond graph reduction algorithm. It is a principal purpose of this paper to describe the procedure upon which ENPORT is based, and to present some results. Important features of ENPORT are its choice of physically significant state variables, its use of operational causality to obtain an orderly formulation of system equations, and its ability to handle systems containing static storage subfields.     

Static Strategies for Worksharing with Unrecoverable Interruptions

One has a large workload that is “divisible”—its constituent work’s granularity can be adjusted arbitrarily—and one has access to p remote worker computers that can assist in computing the workload. How can one best utilize the workers? Complicating this question is the fact that each worker is subject to interruptions (of known likelihood) that kill all work in progress on it. One wishes to orchestrate sharing the workload with the workers in a way that maximizes the expected amount of work completed. Strategies are presented for achieving this goal, by balancing the desire to checkpoint often—thereby decreasing the amount of vulnerable work at any point—vs. the desire to avoid the context-switching required to checkpoint. Schedules must also temper the desire to replicate work, because such replication diminishes the effective remote workforce. The current study demonstrates the accessibility of strategies that provably maximize the expected amount of work when there is only one worker (the case p=1) and, at least in an asymptotic sense, when there are two workers (the case p=2); but the study strongly suggests the intractability of exact maximization for p≥2 computers, as work replication on multiple workers joins checkpointing as a vehicle for decreasing the impact of work-killing interruptions. We respond to that challenge by developing efficient heuristics that employ both checkpointing and work replication as mechanisms for decreasing the impact of work-killing interruptions. The quality of these heuristics, in expected amount of work completed, is assessed through exhaustive simulations that use both idealized models and actual trace data.     

Relationship between scene complexity and perceptual performance for computer graphics simulations

An important goal for the design of visual displays is to determine how much realism or scene complexity to include in a computer simulation to reach a given level of performance. This is an important task since the present trend in computer graphics is to include the highest level of realism or scene complexity possible in a simulation. However, it may not be necessary to always include the highest level of realism or complexity to reach an acceptable level of performance. In fact, needless degrees of realism, and thus computational resources, may be wasted in the quest for ‘photographic’ realism. To study the relationship between scene complexity and human performance, three different simulations of scene complexity were modeled for a final approach task. The subject's task were to estimate two aspects of situation awareness, perceived altitude and aimpoint, during a simulated final approach at nine unique distances to threshold. The three levels of scene complexity included a homogeneous Lambertian shaded flat surface, farmlands, and farmlands with hills. The results indicated that increasing the level of scene complexity lead to better performance in judging both altitude and aimpoint during the simulated final approach. The relationship between scene complexity and perceptual performance for computer graphics simulations are discussed.     

Data encodings and their costs

Summary This paper is devoted to developing and studying a precise notion of the encoding of a logical data structure in a physical storage structure, that is motivated by considerations of computational efficiency. The development builds upon the notion of an encoding of one graph in another. The cost of such an encoding is then defined so as to reflect the structural compatibility of the two graphs, the (externally specified) costs of implementing the host graph, and the (externally specified) set of intended usage patterns of the guest graph. The stability of the constructed framework is demonstrated in terms of a number of results; the faithfulness of the formalism is argued in terms of a number of examples from the literature; and the tractability of the model is hinted at by several results and by further references to the literature.     

The need for style systems in ODA

Many advanced document systems provide a formatting mechanism called ‘style sheets’ Style sheets provide a great deal of flexibility in describing a document's format, and allow easy maintenance of different house styles for a collection of documents. In this paper, we describe the basics of general style sheet systems, argue that successful document interchange must include the exchange of style sheet information, and evaluate ODA's style mechanism against this requirement.