Numerical simulation of dendrite growth during solidification

A comprehensive probabilistic model for simulating dendrite morphology and investigating dendritic growth kinetics during solidification has been developed, based on a modified Cellular Automaton (mCA) for microscopic modeling of nucleation, growth of crystals and solute diffusion. The mCA model numerically calculated solute redistribution both in the solid and liquid phases, the curvature of dendrite tips and the growth anisotropy. This modeling takes account of thermal, curvature and solute diffusion effects. Therefore, it can simulate microstructure formation both on the scale of the dendrite tip length. This model was then applied for simulating dendritic solidification of an Al-7%Si alloy. Both directional and equiaxed dendritic growth has been performed to investigate the growth anisotropy and cooling rate on dendrite morphology. Furthermore, the competitive growth and selection of dendritic crystals have also investigated.

Breast cancer five-year survival in New South Wales women, 1972 to 1991

This study of breast cancer survival is based on analysis of five-year relative survival of 38 362 cases of invasive breast cancer in New South Wales (NSW) women, incident between 1972 and 1991, with follow-up to 1992, using data from the population-based NSW Central Cancer Registry. Survival was ascertained by matching the registry file of breast cancers against NSW death certificates from 1972 to 1992, mainly by automated probabilistic linkage. Absolute survival of cases was compared with expected survival of age- and period-matched NSW women. Proportional hazard regression analysis was used for examination of the effects on excess mortality of age, period of diagnosis and degree of spread at diagnosis. Relative survival at five years increased from 70 per cent in 1972-1976 to 77 per cent in 1987-1991. Survival improved during the 1970s and in the late 1980s. Regression analysis suggested that part of the improved survival in the late 1980s was due to lesser degree of spread at diagnosis, whereas the improved survival during the 1970s may have been due to treatment. Survival was better for those aged 40-49 years (RR = 0.86) and worse for those aged greater than or equal to 70 years (RR = 1.22) compared with the referent group (60-69 years). Excess mortality was much less for those with invasive localised disease than those with regional spread (RR = 3.1) or metastatic cancer (RR = 15.5) at diagnosis. For the most recent period (1987-1991), relative five-year survival was 90, 70 and 18 per cent, respectively, for the three degree-of-spread categories.

Simpson's paradox: A logically benign, empirically treacherous hydra

This article examines Simpson's paradox as applied to the theory of probabilites and percentages. The author discusses possible flaws in the paradox and compares it to the Sure Thing Principle, statistical inference, causal inference and probabilistic analyses of causation.

Briefing: Factored material properties and limit state loads-unlikely extreme or impossible pretense

In the limit state design (LSD) method each design criterion is formally stated and assessed using a performance function. The performance function defines the relationship between the design parameters and the design criterion. In practice, LSD involves factoring up loads and factoring down calculated strengths and material parameters. This provides a convenient way to carry out routine probabilistic-based design. The factors are statistically calculated to produce a design with an acceptably low probability of failure. Hence the ultimate load and the design material properties are mathematical concepts that have no physical interpretation. They may be physically impossible. Similarly, the appropriate analysis model is also defined by the performance function and may not describe the real behaviour at the perceived physical equivalent limit condition. These points must be understood to avoid confusion in the discussion and application of partial factor LSD methods.

Effect of chronic clonidine treatment on transmitter release from sympathetic varicosities of the guinea-pig vas deferens

1 Previous studies have demonstrated that chronic pre-synaptic inhibition of transmitter release by morphine evokes a counter-adaptive response in the sympathetic nerve terminals that manifests itself as an increase in transmitter release during acute withdrawal. In the present study we examined the possibility that other pre-synaptically acting drugs such as clonidine also evoke a counter-adaptive response in the sympathetic nerve terminals. 2 In chronically saline treated (CST) preparations, clonidine (0.5 muM) completely abolished evoked transmitter release from sympathetic varicosities bathed in an extracellular calcium concentration ([Ca2+](o)) of 2 mM. The inhibitory effect of clonidine was reduced by increasing [Ca2+](o) from 2 to 4 mM and the stimulation frequency from 0.1 to 1 Hz. 3 The nerve terminal impulse (NTI) was not affected by concentrations of clonidine that completely abolished evoked transmitter release. 4 Sympathetic varicosities developed a tolerance to clonidine (0.5 muM) following 7-9 days of chronic exposure to clonidine. 5 Acute withdrawal of preparations following chronic clonidine treatment (CCT) resulted in a significant (P

Set-valued Markov chains and negative semitrajectories of discretized dynamical systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic behaviour of the semitrajectories follows probabilistic laws which correspond to a set-valued Markov chain, whose transition probabilities can be explicitly calculated. The results are illustrated for two-dimensional dynamical systems obtained by discretization of fractional linear transformations of the unit disc in the complex plane.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

Modelling of microstructure formation and evolution during solidification

A comprehensive probabilistic model for simulating microstructure formation and evolution during solidification has been developed, based on coupling a Finite Differential Method (FDM) for macroscopic modelling of heat diffusion to a modified Cellular Automaton (mCA) for microscopic modelling of nucleation, growth of microstructures and solute diffusion. The mCA model is similar to Nastac's model for handling solute redistribution in the liquid and solid phases, curvature and growth anisotropy, but differs in the treatment of nucleation and growth. The aim is to improve understanding of the relationship between the solidification conditions and microstructure formation and evolution. A numerical algorithm used for FDM and mCA was developed. At each coarse scale, temperatures at FDM nodes were calculated while nucleation-growth simulation was done at a finer scale, with the temperature at the cell locations being interpolated from those at the coarser volumes. This model takes account of thermal, curvature and solute diffusion effects. Therefore, it can not only simulate microstructures of alloys both on the scale of grain size (macroscopic level) and the dendrite tip length (mesoscopic level), but also investigate nucleation mechanisms and growth kinetics of alloys solidified with various solute concentrations and solidification morphologies. The calculated results are compared with values of grain sizes and solidification morphologies of microstructures obtained from a set of casting experiments of Al-Si alloys in graphite crucibles.

A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.

But what if I don't want to wait forever?

We present an abstract model of the leader election protocol used in the IEEE 1394 High Performance Serial Bus standard. The model is expressed in the probabilistic Guarded Command Language. By formal reasoning based on this description, we establish the probability of the root contention part of the protocol successfully terminating in terms of the number of attempts to do so. Some simple calculations then allow us to establish an upper bound on the time taken for those attempts.

Simulation supplements field studies to determine no-till dryland corn population recommendations for semiarid western Nebraska

In a 2-yr multiple-site field study conducted in western Nebraska during 1999 and 2000, optimum dryland corn (Zea mays L.) population varied from less than 1.7 to more than 5.6 plants m(-2), depending largely on available water resources. The objective of this study was to use a modeling approach to investigate corn population recommendations for a wide range of seasonal variation. A corn growth simulation model (APSIM-maize) was coupled to long-term sequences of historical climatic data from western Nebraska to provide probabilistic estimates of dryland yield for a range of corn populations. Simulated populations ranged from 2 to 5 plants m(-2). Simulations began with one of three levels of available soil water at planting, either 80, 160, or 240 mm in the surface 1.5 m of a loam soil. Gross margins were maximized at 3 plants m(-2) when starting available water was 160 or 240 mm, and the expected probability of a financial loss at this population was reduced from about 10% at 160 mm to 0% at 240 mm. When starting available water was 80 mm, average gross margins were less than $15 ha(-1), and risk of financial loss exceeded 40%. Median yields were greatest when starting available soil water was 240 mm. However, perhaps the greater benefit of additional soil water at planting was reduction in the risk of making a financial loss. Dryland corn growers in western Nebraska are advised to use a population of 3 plants m(-2) as a base recommendation.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.