Modeling of columnar-to-equiaxed transition in solidified Al-Si alloys

A Cellular-Automaton Finite-Volume-Method (CAFVM) algorithm has been developed, coupling with macroscopic model for heat transfer calculation and microscopic models for nucleation and growth. The solution equations have been solved to determine the time-dependent constitutional undercooling and interface retardation during solidification. The constitutional undercooling is then coupled into the CAFVM algorithm to investigate both the effects of thermal and constitutional undercooling on columnar growth and crystal selection in the columnar zone, and formation of equiaxed crystals in the bulk liquid. The model cannot only simulate microstructures of alloys but also investigates nucleation mechanisms and growth kinetics of alloys solidified with various solute concentrations and solidification morphologies.

The selection of intended actions and the observation of others' actions: A time-resolved fMRI study

Whenever we plan, imagine, or observe an action, the motor systems that would be involved in preparing and executing that action are similarly engaged. The way in which such common motor activation is formed, however, is likely to differ depending on whether it arises from our own intentional selection of action or from the observation of another's action. In this study, we use time-resolved event-related functional MRI to tease apart neural processes specifically related to the processing of observed actions, the selection of our own intended actions, the preparation for movement, and motor response execution. Participants observed a finger gesture movement or a cue indicating they should select their own finger gesture to perform, followed by a 5-s delay period; participants then performed the observed or self-selected action. During the preparation and readiness for action, prior to initiation, we found activation in a common network of higher motor areas, including dorsal and ventral premotor areas and the pre-supplementary motor area (pre-SMA); the more caudal SMA showed greater activation during movement execution. Importantly, the route to this common motor activation differed depending on whether participants freely selected the actions to perform or whether they observed the actions performed by another person. Observation of action specifically involved activation of inferior and superior parietal regions, reflecting involvement of the dorsal visual pathway in visuomotor processing required for planning the action. In contrast, the selection of action specifically involved the dorsal lateral prefrontal and anterior cingulate cortex, reflecting the role of these prefrontal areas in attentional selection and guiding the selection of responses. (c) 2005 Elsevier Inc. All rights reserved.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Satellite observation and climate system model simulation of the St. Lawrence Island polynya

The St. Lawrence Island polynya (SLIP) is a commonly occurring winter phenomenon in the Bering Sea, in which dense saline water produced during new ice formation is thought to flow northward through the Bering Strait to help maintain the Arctic Ocean halocline. Winter darkness and inclement weather conditions have made continuous in situ and remote observation of this polynya difficult. However, imagery acquired from the European Space Agency ERS-1 Synthetic Aperture Radar (SAR) has allowed observation of the St. Lawrence Island polynya using both the imagery and derived ice displacement products. With the development of ARCSyM, a high resolution regional model of the Arctic atmosphere/sea ice system, simulation of the SLIP in a climate model is now possible. Intercomparisons between remotely sensed products and simulations can lead to additional insight into the SLIP formation process. Low resolution SAR, SSM/I and AVHRR infrared imagery for the St. Lawrence Island region are compared with the results of a model simulation for the period of 24-27 February 1992. The imagery illustrates a polynya event (polynya opening). With the northerly winds strong and consistent over several days, the coupled model captures the SLIP event with moderate accuracy. However, the introduction of a stability dependent atmosphere-ice drag coefficient, which allows feedbacks between atmospheric stability, open water, and air-ice drag, produces a more accurate simulation of the SLIP in comparison to satellite imagery. Model experiments show that the polynya event is forced primarily by changes in atmospheric circulation followed by persistent favorable conditions: ocean surface currents are found to have a small but positive impact on the simulation which is enhanced when wind forcing is weak or variable.

Social rules and attributions in the personnel selection interview

The study investigated the social rules applicable to selection interviews, and the attributions ions made by interviewers in response to rule-breaking behaviours by candidates. Sixty personnel specialists (31 males and 29 females) participated in the main study which examined their perceptions of social rules and attributions about rule breaking in their work experience. They listened to audiotapes of actual selection interviews, and made judgments about hireability communication competence, and specific social rules. Results indicated that interview rules could be categorized into two groups: specific interview presentation skills and general interpersonal competence. While situational attributions were more salient in explaining the breaking of general interpersonal competence rules, internal attributions (ability, effort) were more salient explanations for the breaking of more specific interview rules (with the exception of the preparation rule where lack of effort was the most likely explanation for rule breaking). Candidates previously judged as competent communicators were rated more favourably on both global and specific measures of rule-following competence, as well as on hireability. The theoretical and practical implications of combining social rules and attribution theory in the study of selection interviews are discussed.

Effect of body composition at selection on reproductive development in large white gilts

Fifty-four Large White gilts were used to determine the effect of body composition at selection (145 d of age) on the onset of puberty and subsequent reproductive development until 202 d of age. Gilts were assigned to one of three groups based on their backfat depth at selection: 10 to 12 mm (L), 13 to 15 mm (M), and 16 to 18 mm (F). All of the F gilts, 92% of the M gilts, and 67% of the L gilts reached puberty by slaughter at 202 d of age. Data from a subgroup (first 67% to reach puberty in each group; L = Lp, M = Mp, and F = Fp) was also used. The M (Mp) and F (Fp) gilts reached puberty at 172 d (166 d) and 170 d (166 d) of age, respectively, but the L (Lp) gilts at 184.5 d were 12 d (18 d) older than M(P < .05), Mp(P < .001), and F(P < .01), Fp (P < .001) gilts. The Lp (97.68 kg) and Mp (98.33 kg) gilts were lighter (P < .01) than Fp (108.72 kg) gilts at puberty. There were no differences (P < .05) among the L, M, and F gilts in terms of backfat depth or weight at puberty. The L (Lp) gilts had a mean of 1.16 (1.75) estrous cycles, which was lower (P < .01) than for M (Mp) and (P < .01) F (Fp) gilts, with 1.96 (2.29) and 2.25 (2.33) cycles, respectively. L (Lp) gilts had fewer (P < .05) follicles, 13.14 (12.63), than either M (Mp), 19.08 (18.71), or F (Fp), 18.25 (17.42) gilts. The number of corpora lutea was not influenced (P > .05) by grouping at selection, but Fp gilts had fewer (P < .05) corpora lutea than Mp or Fp gilts. Live weight at slaughter was not influenced (P > .10) by grouping at selection or subgrouping at puberty. The L gilts with a mean of 18.05 mm of backfat at slaughter were leaner (P < .05) than the F (21.66 mm) but not (P > .10) the M gilts (19.41 mm). Subgrouping had no effect. Fat deposition and protein deposition were higher (P < .05) in those animals that attained puberty. We conclude that the rate of fat and protein deposition seems to be one of the determinants of puberty attainment.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment

The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.