Array remappings are useful to many applications on dis tributed memory parallel machines They are available in High Performance Fortran a Fortran based data parallel language This paper describes techniques to handle dy namic mappings through simple array copies array remap pings are translated into copies between statically mapped distinct versions of the array It discusses the language re st...

targeted extension for heterogeneous farming systems is a challenge in developing countries. farm type identification and characterization based on estimates of income from different farm components allows simplifying diversity in farming systems. use of multivariate statistical techniques, such as principal component analysis (pca) and cluster analysis (ca), help in such farm typology delineat...

Short straw is a desired trait in oat germplasm (Avena sativa L.). Marker-assisted selection, a key tool for achieving this objective, is limited by the presence and number of available markers. Here, we have attempted to develop markers sufficiently linked to a gene specifying short straw so that marker-assisted selection could be applied. Bulked-segregant analysis was used to identify anonymo...

A novel constrained interpolation algorithm for remapping of solenoidal face finite element vector fields is presented. The algorithm is based on explicit recovery, postprocessing and interpolation of a potential for the original vector field and a subsequent application of a curl operator to obtain the desired divergence-free finite element field on the new mesh. The use of interpolation inste...

In this report we use optimization ideas to develop and study conservative, ∗Corresponding author Email addresses: [email protected] (Pavel Bochev), [email protected] (Denis Ridzal), [email protected] (Guglielmo Scovazzi), [email protected] (Mikhail Shashkov ) URL: http://www.sandia.gov/~pbboche/ (Pavel Bochev), http://www.sandia.gov/~dridzal/ (Denis Ridzal), http://www.sandia.gov/~gscovaz/ ...

An exact model of a simple genetic algorithm is developed for permutation based representations. Permutation based representations are used for scheduling problems and combinatorial problems such as the Traveling Salesman Problem. A remapping function is developed to remap the model to all permutations in the search space. The mixing matrices for various permutation based operators are also dev...

Uplink Model: Multiple-Access Relay Networks • Compress and Forward (CF) and Decode and Forward (DF) (IT 2009) • Quantize reMap and Forward (QMF) (IT 2011) • Compute and Forward (CoF) (ISIT 2009) and Quantize Compute and Forward (ITW 2011) Downlink Model: Broadcast Relay Networks • Compressed Dirty Paper Coding (EURASIP 2009) • Near-optimal for very large R0 • In general, suboptimal at finite (...