A new uniform mapping algorithm for sample selection
โ Scribed by Jorge F. Magallanes
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 374 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0886-9383
- DOI
- 10.1002/cem.1209
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labels intersect, and the size of the labels is maximized. This problem is known as map-labeling with uniform circular pairs
Seven BASIC programs are presented that use algorithms for selection of treatments and samples in spatial and temporal contexts. Program (1) takes a natural sequence of samples (such as logs cut from a tree trunk) and divides them into groups (equal to the number of samples divided by treatments), a
A return mapping algorithm is presented for the numerical time integration of the constitutive equations for elastoplasticity with isotropic yield surfaces, constructed from all three invariants of the stress tensor. Based on the first-order backward Euler difference formula (BDF), the governing equ
This paper presents an algorithm for two-dimensional steady viscoelastic flow simulation in which the solution of the momentum and continuity equations is decoupled from that of the constitutive equations. The governing equations are discretized by the finite element method, with 3 x 3 element subdi