ÐParallel architectures with physically distributed memory provide a cost-effective scalability to solve many large scale scientific problems. However, these systems are very difficult to program and tune. In these systems, the choice of a good data mapping and parallelization strategy can dramatically improve the efficiency of the resulting program. In this paper, we present a framework for au...

PURPOSE This article focuses on developing a novel noniterative fat water decomposition algorithm more robust to fat water swaps and related ambiguities. METHODS Field map estimation is reformulated as a constrained surface estimation problem to exploit the spatial smoothness of the field, thus minimizing the ambiguities in the recovery. Specifically, the differences in the field map-induced ...

This paper presents a toolkit for generating optimal policy projections. It makes five contributions. First, the requires minimal set of inputs: only baseline projection target and instrument variables impulse responses those to shocks. Second, it solves projections under commitment, limited-time discretion. Third, handles multiple instruments. Fourth, constraints on instruments such as lower b...

Chemical process optimization and control are affected by (1) plant-model mismatch, (2) disturbances, (3) constraints for safe operation. Reinforcement learning policy would be a natural way to solve this due its ability address stochasticity, directly account the effect of future uncertainty feedback in proper closed-loop manner; all without need an inner loop. One main reasons why reinforceme...

in induction of systemic and mucosal immunity, particulate antigens are more effective than soluble antigens possibly because they are more efficiently endocytosed by mucosal-associated lymphoid tissue (malt) m cells. in this study, we determined the systemic and mucosal immune responses in rabbits following intranasal immunization of tetanus toxoid tt and cpg-odn encapsulated within plga nanos...

Researchers have been investigating the optimal route query problem for a long time. Optimal route queries are categorized as either unconstrained or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra’s shortest path algorithm is one of the most popular algorithms for the unconstrained route query proble...