775 resultados para geometry algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is believed that surface instabilities can occur during the extrusion of linear low density polyethylene due to high extensional stresses at the exit of the die. Local crack development can occur at a critical stress level when melt rupture is reached. This high extensional stress results from the rearrangement of the flow at the boundary transition between the wall exit and the free surface. The stress is highest at the extrudate surface and decreases into the bulk of the material. The location of the region where the critical level is reached can determine the amplitude of the extrudate surface distortion, This paper studies the effect of wall slip on the numerically simulated extensional stress level at the die exit and correlates this to the experimentally determined amplitude of the surface instability. The effect of die exit radius and die wall roughness on extrusion surface instabilities is also correlated to the exit stress level in the same way. Whereas full slip may completely suppress the surface instability, a reduction in the exit stress level and instability amplitude is also shown for a rounded die exit and a slight increase in instability is shown to result from a rough die wall. A surface instability map demonstrates how the shear rate for onset of extrusion surface instabilities can be predicted on the basis of melt strength measurements and simulated stress peaks at the exit of the die. (C) 2001 Elsevier Science B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

OBJECTIVES The goal of this study was to determine whether wall stress at rest and during stress could explain the influence of left ventricular (LV) morphology on the accuracy of dobutamine stress echocardiography (DSE). BACKGROUND The sensitivity of DSE appears to be reduced in patients with concentric remodeling, but the cause of this finding is unclear. METHODS We studied 161 patients without resting wall motion abnormalities who underwent DSE and coronary angiography. Patients were classified into four groups according to relative wan thickness (normal

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper introduces a new reconstruction algorithm for electrical impedance tomography. The algorithm assumes that there are two separate regions of conductivity. These regions are represented as eccentric circles. This new algorithm then solves for the location of the eccentric circles. Due to the simple geometry of the forward problem, an analytic technique using conformal mapping and separation of variables has been employed. (C) 2002 John Wiley Sons, Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.