Phase field study of precipitate growth: Effect of misfit strain and interface curvature

We have used phase field simulations to study the effect of misfit and interfacial curvature on diffusion-controlled growth of an isolated precipitate in a supersaturated matrix. Treating our simulations as computer experiments, we compare our simulation results with those based on the Zener–Frank and Laraia–Johnson–Voorhees theories for the growth of non-misfitting and misfitting precipitates, respectively. The agreement between simulations and the Zener–Frank theory is very good in one-dimensional systems. In two-dimensional systems with interfacial curvature (with and without misfit), we find good agreement between theory and simulations, but only at large supersaturations, where we find that the Gibbs–Thomson effect is less completely realized. At small supersaturations, the convergence of instantaneous growth coefficient in simulations towards its theoretical value could not be tracked to completion, because the diffusional field reached the system boundary. Also at small supersaturations, the elevation in precipitate composition matches well with the theoretically predicted Gibbs–Thomson effect in both misfitting and non-misfitting systems.

Non-linear flapping vibrations of rotating blades

The non-linear equations of motion of a rotating blade undergoing extensional and flapwise bending vibration are derived, including non-linearities up to O (ε3). The strain-displacement relationship derived is compared with expressions derived by earlier investigators and the errors and the approximations made in some of those are brought out. The equations of motion are solved under the inextensionality condition to obtain the influence of the amplitude on the fundamental flapwise natural frequency of the rotating blade. It is found that large finite amplitudes have a softening effect on the flapwise frequency and that this influence becomes stronger at higher speeds of rotation.

Stochastic Modeling of an Aircraft Traversing a Runway Using Time Series Analysis

Time series, from a narrow point of view, is a sequence of observations on a stochastic process made at discrete and equally spaced time intervals. Its future behavior can be predicted by identifying, fitting, and confirming a mathematical model. In this paper, time series analysis is applied to problems concerning runwayinduced vibrations of an aircraft. A simple mathematical model based on this technique is fitted to obtain the impulse response coefficients of an aircraft system considered as a whole for a particular type of operation. Using this model, the output which is the aircraft response can be obtained with lesser computation time for any runway profile as the input.

Influence of heat-treatment on the strength and fracture-behavior of fe-12cr-6al ferritic stainless-steel

The changes in the tensile properties and fracture mode brought about by heat treatment of Fe-12Cr-6Al ferritic stainless steel have been studied. A favourable combination of high strength and good ductility is obtained by heating the material at 1370 K for 2 h followed by a water quench. The high-temperature treatment results in carbide dissolution as well as an increase in the grain size. The mechanism of strengthening has been evaluated from the apparent activation energy (28 kJ mol–1) and is identified to be the unpinning of dislocations from the atmosphere of carbon atoms. As the heat-treatment temperature is increased, the fracture behaviour changes from ductile to brittle mode and this is related to the changes in grain size and friction stress.

Functional programming systems revisited

Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Programming (NFP) systems in which nondeterministic programs can be specified and both deterministic and nondeterministic programs can be verified essentially within the system. It is shown that the algebra of NFP programs has simpler laws in comparison with the algebra of FP programs. "Regular" forms are introduced to put forward a disciplined way of reasoning about programs. Finally, an alternative definition of "linear" forms is proposed for reasoning about recursively defined programs. This definition, when used to test the linearity of forms, results in simpler verification conditions than those generated by the original definition of linear forms.

Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes

Database schemes can be viewed as hypergraphs with individual relation schemes corresponding to the edges of a hypergraph. Under this setting, a new class of "acyclic" database schemes was recently introduced and was shown to have a claim to a number of desirable properties. However, unlike the case of ordinary undirected graphs, there are several unequivalent notions of acyclicity of hypergraphs. Of special interest among these are agr-, beta-, and gamma-, degrees of acyclicity, each characterizing an equivalence class of desirable properties for database schemes, represented as hypergraphs. In this paper, two complementary approaches to designing beta-acyclic database schemes have been presented. For the first part, a new notion called "independent cycle" is introduced. Based on this, a criterion for beta-acyclicity is developed and is shown equivalent to the existing definitions of beta-acyclicity. From this and the concept of the dual of a hypergraph, an efficient algorithm for testing beta-acyclicity is developed. As for the second part, a procedure is evolved for top-down generation of beta-acyclic schemes and its correctness is established. Finally, extensions and applications of ideas are described.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

2 Algorithms For 3-Layer Channel Routing

A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.

On the axial vibrations of rotating bars

One of the important developments in rotary wing aeroelasticity in the recent past has been the growing awareness and acceptance of the fact that the problem is inherently non-linear and that correct treatment of aeroelastic problems requires the development of a consistent mathematical model [l]. This has led to a number of studies devoted to the derivation of a consistent set of “second order” non-linear equations, for example, those of Hodges and Dowel1 [2], of Rosen and Friedmann [3], and of Kvaternik, White and Kaza [4], each of which differs from the others on the question of the inclusion of certain terms in the equations of motion. The final form of the equations depends first upon the ordering scheme used for characterizing the displacements and upon the consistency with which this is applied in omitting terms of lower order. The ideal way of achieving this would be to derive the equations of motion with all the terms first included regardless of their relative orders of magnitude and then to apply the ordering scheme.

Transient pulse evolution of active-mode locking in an intra-cavity frequency-doubled laser

The theory of transient mode locking for an active modulator in an intracavity frequency-doubled laser is presented. The theory is applied to mode-locked and intracavity frequency-doubled Nd:YAG laser and the mode-locked pulse width is plotted as a function of number of round trips inside the cavity. It is found that the pulse compression is faster and the system takes a very short time to approach the steady state in the presence of a second harmonic generating crystal inside the laser cavity. The effect of modulation depth and the second harmonic conversion efficiency on the temporal behavior of the pulse width is discussed.

Aerodynamic characteristics of pretensioned elastic membrane rectangular sailwings

Presented in the paper are the details of a method for obtaining aerodynamic characteristics of pretensioned elastic membrane rectangular sailwings. This is a nonlinear problem governed by the membrane equation for the inflated sail and the lifting surface theory integral equation for aerodynamic loads on the sail. Assuming an admissible mode shape for the inflated elastic sail, an iterative procedure based on a doublet lattice method is employed to determine the inflated configuration as well as various aerodynamic characteristics. Application of the method is made to a typical nylon-cotton sailwing of AR = 6.0 and results are presented graphically to show the effect of various parameters. The results are found to tend to plane wing values when the pretensions are large in magnitude.

DFL: A Data Flow Language

Many novel computer architectures like array and multiprocessors which achieve high performance through the use of concurrency exploit variations of the von Neumann model of computation. The effective utilization of the machines makes special demands on programmers and their programming languages, such as the structuring of data into vectors or the partitioning of programs into concurrent processes. In comparison, the data flow model of computation demands only that the principle of structured programming be followed. A data flow program, often represented as a data flow graph, is a program that expresses a computation by indicating the data dependencies among operators. A data flow computer is a machine designed to take advantage of concurrency in data flow graphs by executing data independent operations in parallel. In this paper, we discuss the design of a high level language (DFL: Data Flow Language) suitable for data flow computers. Some sample procedures in DFL are presented. The implementation aspects have not been discussed in detail since there are no new problems encountered. The language DFL embodies the concepts of functional programming, but in appearance closely resembles Pascal. The language is a better vehicle than the data flow graph for expressing a parallel algorithm. The compiler has been implemented on a DEC 1090 system in Pascal.

Design and evaluation of a dual-microcomputer shared memory system with a shared I/O bus

The design, implementation and evaluation are described of a dual-microcomputer system based on the concept of shared memory. Shared memory is useful for passing large blocks of data and it also provides a means to hold and work with shared data. In addition to the shared memory, a separate bus between the I/O ports of the microcomputers is provided. This bus is utilized for interprocessor synchronization. Software routines helpful in applying the dual-microcomputer system to realistic problems are presented. Performance evaluation of the system is carried out using benchmarks.