A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

Simulating growth, development, and yield of tillering pearl millet. III. Biomass accumulation and partitioning

Pearl millet landraces from Rajasthan, India, yield significantly less than improved cultivars under optimum growing conditions, but not under stressed conditions. To successfully develop a simulation model for pearl millet, capable of capturing such genotype x environment (G x E) interactions for grain yield, we need to understand the causes of the observed yield interaction. The aim of this paper is to quantify the key parameters that determine the accumulation and partitioning of biomass: the,light extinction coefficient, radiation use efficiency (RUE), pattern of dry matter allocation to the leaf blades, the determination of grain number, and the rate and duration of dry matter accumulation into individual grains. We used data on improved cultivars and landraces, obtained from both published and unpublished sources collected at ICRISAT, Patancheru, India. Where possible, the effects of cultivar and axis (main shoot vs. tillers) on these parameters were analysed, as previous research suggested that G x E interactions for grain yield are associated with differences in tillering habit. Our results indicated there were no cultivar differences in extinction coefficient, RUE, and biomass partitioning before anthesis, and differences between axes in biomass partitioning were negligible. This indicates there was no basis for cultivar differences in the potential grain yield. Landraces, however, produced consistently less grain yield for a given rate of dry matter accumulation at anthesis than did improved cultivars. This was caused by a combination of low grain number and small grain size. The latter was predominantly due to a lower grain growth rate, as genotypic differences in the duration of grain filling were relatively small. Main shoot and tillers also had a similar duration of grain filling. The low grain yield of the landraces was associated with profuse nodal tillering, supporting the hypothesis that grain yield was below the potential yield that could be supported by assimilate availability. We hypothesise this is a survival strategy, which enhances the prospects to escape the effects of stress around anthesis. (C) 2002 E.J. van Oosterom. Published by Elsevier Science B.V. All rights reserved.

Partitioning sets of triples into small planes

We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2, 2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions) or copies of some planes of each type (mixed partitions). We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in several cases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We construct such partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, and an affine partition for v = 18. Using these as starter partitions, we prove that Fano partitions exist for v = 7(n) + 1, 13(n) + 1, 27(n) + 1, and affine partitions for v = 8(n) + 1, 9(n) + 1, 17(n) + 1. In particular, both Fano and affine partitions exist for v = 3(6n) + 1. Using properties of 3-wise balanced designs, we extend these results to show that affine partitions also exist for v = 3(2n). Similarly, mixed partitions are shown to exist for v = 8(n), 9(n), 11(n) + 1.

Predicting plant leaf area production: shoot assimilate accumulation and partitioning, and leaf area ratio, are stable for a wide range of sorghum population densities

Predicting plant leaf area production is required for modelling carbon balance and tiller dynamics in plant canopies. Plant leaf area production can be studied using a framework based on radiation intercepted, radiation use efficiency (RUE) and leaf area ratio (LAR) (ratio of leaf area to net above-ground biomass). The objective of this study was to test this framework for predicting leaf area production of sorghum during vegetative development by examining the stability of the contributing components over a large range of plant density. Four densities, varying from 2 to 16 plants m(-2), were implemented in a field experiment. Plants were either allowed to tiller or were maintained as uniculm by systematic tiller removal. In all cases, intercepted radiation was recorded daily and leaf area and shoot dry matter partitioning were quantified weekly at individual culm level. Up to anthesis, a unique relationship applied between fraction of intercepted radiation and leaf area index, and between shoot dry weight accumulation and amount of intercepted radiation, regardless of plant density. Partitioning of shoot assimilate between leaf, stem and head was also common across treatments up to anthesis, at both plant and culm levels. The relationship with thermal time (TT) from emergence of specific leaf area (SLA) and LAR of tillering plants did not change with plant density. In contrast, SLA of uniculm plants was appreciably lower under low-density conditions at any given TT from emergence. This was interpreted as a consequence of assimilate surplus arising from the inability of the plant to compensate by increasing the leaf area a culm could produce. It is argued that the stability of the extinction coefficient, RUE and plant LAR of tillering plants observed in these conditions provides a reliable way to predict leaf area production regardless of plant density. Crown Copyright (C) 2002 Published by Elsevier Science B.V. All rights reserved.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

A genetic algorithm/method of moments approach to the optimization of an RF coil for MRI applications - Theoretical considerations - Abstract

A Combined Genetic Algorithm and Method of Moments design methods is presented for the design of unusual near-field antennas for use in Magnetic Resonance Imaging systems. The method is successfully applied to the design of an asymmetric coil structure for use at 190MHz and demonstrates excellent radiofrequency field homogeneity.

Mapping the royal road and other hierarchical functions

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.

Automated traffic route identification through the shared nearest neighbour algorithm

Many organisations need to extract useful information from huge amounts of movement data. One example is found in maritime transportation, where the automated identification of a diverse range of traffic routes is a key management issue for improving the maintenance of ports and ocean routes, and accelerating ship traffic. This paper addresses, in a first stage, the research challenge of developing an approach for the automated identification of traffic routes based on clustering motion vectors rather than reconstructed trajectories. The immediate benefit of the proposed approach is to avoid the reconstruction of trajectories in terms of their geometric shape of the path, their position in space, their life span, and changes of speed, direction and other attributes over time. For clustering the moving objects, an adapted version of the Shared Nearest Neighbour algorithm is used. The motion vectors, with a position and a direction, are analysed in order to identify clusters of vectors that are moving towards the same direction. These clusters represent traffic routes and the preliminary results have shown to be promising for the automated identification of traffic routes with different shapes and densities, as well as for handling noise data.

Multi-centre validation of an automatic algorithm for fast 4D myocardial segmentation in cine CMR datasets

Quantitative analysis of cine cardiac magnetic resonance (CMR) images for the assessment of global left ventricular morphology and function remains a routine task in clinical cardiology practice. To date, this process requires user interaction and therefore prolongs the examination (i.e. cost) and introduces observer variability. In this study, we sought to validate the feasibility, accuracy, and time efficiency of a novel framework for automatic quantification of left ventricular global function in a clinical setting.

Lanczos algorithm on the grassmann manifold

5th. European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2008) 8th. World Congress on Computational Mechanics (WCCM8)

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.