Determination of coalescence kernels for high-shear granulation using DEM simulations

Discrete element method (DEM) modeling is used in parallel with a model for coalescence of deformable surface wet granules. This produces a method capable of predicting both collision rates and coalescence efficiencies for use in derivation of an overall coalescence kernel. These coalescence kernels can then be used in computationally efficient meso-scale models such as population balance equation (PBE) models. A soft-sphere DEM model using periodic boundary conditions and a unique boxing scheme was utilized to simulate particle flow inside a high-shear mixer. Analysis of the simulation results provided collision frequency, aggregation frequency, kinetic energy, coalescence efficiency and compaction rates for the granulation process. This information can be used to bridge the gap in multi-scale modeling of granulation processes between the micro-scale DEM/coalescence modeling approach and a meso-scale PBE modeling approach.

Bifurcation in growth patterns for arrays of parallel Griffith, edge and sliding cracks

This paper presents the recent finding by Muhlhaus et al [1] that bifurcation of crack growth patterns exists for arrays of two-dimensional cracks. This bifurcation is a result of the nonlinear effect due to crack interaction, which is, in the present analysis, approximated by the dipole asymptotic or pseudo-traction method. The nonlinear parameter for the problem is the crack length/ spacing ratio lambda = a/h. For parallel and edge crack arrays under far field tension, uniform crack growth patterns (all cracks having same size) yield to nonuniform crack growth patterns (i.e. bifurcation) if lambda is larger than a critical value lambda(cr) (note that such bifurcation is not found for collinear crack arrays). For parallel and edge crack arrays respectively, the value of lambda(cr) decreases monotonically from (2/9)(1/2) and (2/15.096)(1/2) for arrays of 2 cracks, to (2/3)(1/2)/pi and (2/5.032)(1/2)/pi for infinite arrays of cracks. The critical parameter lambda(cr) is calculated numerically for arrays of up to 100 cracks, whilst discrete Fourier transform is used to obtain the exact solution of lambda(cr) for infinite crack arrays. For geomaterials, bifurcation can also occurs when array of sliding cracks are under compression.

Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Red Parkes quasars: Evidence for soft X-ray absorption

The Parkes Half-Jansky Flat-Spectrum Sample contains a large number of sources with unusually red optical-to-near-infrared (NIR) continua. If this is to be interpreted as extinction by dust in the line of sight, then associated material might also give rise to absorption in the soft X-ray regime. This hypothesis is tested using broadband (0.1-2.4 keV) data from the ROSAT All-Sky Survey. Significant (>3 sigma confidence level) correlations between the optical (and NIR)-to-soft X-ray continuum slope and optical extinction are found in the data, consistent with absorption by material with metallicity and a range in the gas-to-dust ratio as observed in the local ISM. Under this simple model, the soft X-rays are absorbed at a level consistent with the range of extinctions (0 < A(V) < 6 mag) implied by the observed optical reddening. Excess X-ray absorption by warm (ionized) gas, (i.e., a warm absorber) is not required by the data.

Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software

In this and a preceding paper, we provide an introduction to the Fujitsu VPP range of vector-parallel supercomputers and to some of the computational chemistry software available for the VPP. Here, we consider the implementation and performance of seven popular chemistry application packages. The codes discussed range from classical molecular dynamics to semiempirical and ab initio quantum chemistry. All have evolved from sequential codes, and have typically been parallelised using a replicated data approach. As such they are well suited to the large-memory/fast-processor architecture of the VPP. For one code, CASTEP, a distributed-memory data-driven parallelisation scheme is presented. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

Target similarity effects: Support for the parallel distributed processing assumptions

Recent research has begun to provide support for the assumptions that memories are stored as a composite and are accessed in parallel (Tehan & Humphreys, 1998). New predictions derived from these assumptions and from the Chappell and Humphreys (1994) implementation of these assumptions were tested. In three experiments, subjects studied relatively short lists of words. Some of the Lists contained two similar targets (thief and theft) or two dissimilar targets (thief and steal) associated with the same cue (ROBBERY). AS predicted, target similarity affected performance in cued recall but not free association. Contrary to predictions, two spaced presentations of a target did not improve performance in free association. Two additional experiments confirmed and extended this finding. Several alternative explanations for the target similarity effect, which incorporate assumptions about separate representations and sequential search, are rejected. The importance of the finding that, in at least one implicit memory paradigm, repetition does not improve performance is also discussed.

Parallel processing and image analysis in the eyes of mantis shrimps

The compound eyes of mantis shrimps, a group of tropical marine crustaceans, incorporate principles of serial and parallel processing of visual information that may be applicable to artificial imaging systems. Their eyes include numerous specializations for analysis of the spectral and polarizational properties of light, and include more photoreceptor classes for analysis of ultraviolet light, color, and polarization than occur in any other known visual system. This is possible because receptors in different regions of the eye are anatomically diverse and incorporate unusual structural features, such as spectral filters, not seen in other compound eyes. Unlike eyes of most other animals, eyes of mantis shrimps must move to acquire some types of visual information and to integrate color and polarization with spatial vision. Information leaving the retina appears to be processed into numerous parallel data streams leading into the central nervous system, greatly reducing the analytical requirements at higher levels. Many of these unusual features of mantis shrimp vision may inspire new sensor designs for machine vision

Race and sex effects on the association between muscle strength, soft tissue, and bone mineral density in healthy elders: The Health, Aging, and Body Composition Study

Two factors generally reported to influence bone density are body composition and muscle strength. However, it is unclear if these relationships are consistent across race and sex, especially in older persons. If differences do exist by race and/or sex, then strategies to maintain bone mass or minimize bone loss in older adults may need to be modified accordingly. Therefore, we examined the independent effects of bone mineral-free lean mass (LM), fat mass (FM), and muscle strength on regional and whole body bone mineral density (BMD) in a cohort of 2619 well-functioning older adults participating in the Health, Aging, and Body Composition (Health ABC) Study with complete measures. Participants included 738 white women, 599 black women, 827 white men, and 455 black men aged 70-79 years. BMD (g/cm(2)) of the femoral neck, whole body, upper and lower limb, and whole body and upper limb bone mineral-free LM and FM was assessed by dual-energy X-ray absorptiometry (DXA). Handgrip strength and knee extensor torque were determined by dynamometry. In analyses stratified by race and sex and adjusted for a number of confounders, LM was a significant (p < 0.001) determinant of BMD, except in white women for the lower limb and whole body. In women, FM also was an independent contributor to BMD at the femoral neck, and both PM and muscle strength contributed to limb BMD. The following were the respective Beta-weights (regression coefficients for standardized data, Std beta) and percent difference in BMD per unit (7.5 kg) LM: femoral neck, 0.202-0.386 and 4.7-6.9 %; lower limb,.0.209-0.357 and 2.9-3.5%; whole body, 0.239-0.484 and 3.0-4.7 %; and upper limb (unit = 0.5 kg), 0.231-0.407 and 3.1-3.4%. Adjusting for bone size (bone mineral apparent density [BMAD]) or body size BMD/height) diminished the importance of LM, and the contributory effect of FM became more pronounced. These results indicate that LM and FM were associated with bone mineral depending on the bone site and bone index used. Where differences did occur, they were primarily by sex not race. To preserve BMD, maintaining or increasing LM in the elderly would appear to be an appropriate strategy, regardless of race or sex.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

Structure optimization combining soft-core interaction functions, the diffusion equation method, and molecular dynamics

Smoothing the potential energy surface for structure optimization is a general and commonly applied strategy. We propose a combination of soft-core potential energy functions and a variation of the diffusion equation method to smooth potential energy surfaces, which is applicable to complex systems such as protein structures; The performance of the method was demonstrated by comparison with simulated annealing using the refinement of the undecapeptide Cyclosporin A as a test case. Simulations were repeated many times using different initial conditions and structures since the methods are heuristic and results are only meaningful in a statistical sense.