A review of studies mapping (or cross walking) from non-preference based measures of health to generic preference-based measures

This paper presents a systematic review of current practice in mapping between nonpreference based measures and generic preference-based measures. It reviews the studies identified by a systematic search of the published literature and the grey literature. This review seeks to address the feasibility and overall validity of this approach, the circumstances when it should be considered and to bring together any lessons for future mapping studies

Encoding and Selecting Coarse-Grain Mapping Operators with Hierarchical Graphs

Coarse grain (CG) molecular dynamics (MD) can simulate systems inaccessible to fine grain (FG) MD simulations. A CG simulation decreases the degrees of freedom by mapping atoms from an FG representation into agglomerate CG particles. The FG to CG mapping is not unique. Research into systematic selection of these mappings is challenging due to their combinatorial growth with respect to the number of atoms in a molecule. Here we present a method of reducing the total count of mappings by imposing molecular topology and symmetry constraints. The count reduction is illustrated by considering all mappings for nearly 49,889 molecules. The resulting number of mapping operators is still large, so we introduce hierarchical graphs which encode multiple CG mapping operators. The encoding method is demonstrated for methanol and a 14-mer peptide. This encoding provides a foundation to perform automated mapping selection.Comment: 14 pages, 5 figure

Generalized Methodology for Array Processor Design of Real-time Systems

Many techniques and design tools have been developed for mapping algorithms to array processors. Linear mapping is usually used for regular algorithms. Large and complex problems are not regular by nature and regularization may cause a computational overhead which prevents the ability to meet real-time deadlines. In this paper, a systematic design methodology for mapping partially-regular as well as regular Dependence Graphs is presented. In this approach the set of all optimal solutions is generated under the given constraints. Due to nature of the problem and the tight timing constraints of real-time systems the set of alternative solutions is limited. An image processing example is discusse