Modeling Three-dimensional Invasive Solid Tumor Growth in Heterogeneous Microenvironment under Chemotherapy

A systematic understanding of the evolution and growth dynamics of invasive solid tumors in response to different chemotherapy strategies is crucial for the development of individually optimized oncotherapy. Here, we develop a hybrid three-dimensional (3D) computational model that integrates pharmacokinetic model, continuum diffusion-reaction model and discrete cell automaton model to investigate 3D invasive solid tumor growth in heterogeneous microenvironment under chemotherapy. Specifically, we consider the effects of heterogeneous environment on drug diffusion, tumor growth, invasion and the drug-tumor interaction on individual cell level. We employ the hybrid model to investigate the evolution and growth dynamics of avascular invasive solid tumors under different chemotherapy strategies. Our simulations reproduce the well-established observation that constant dosing is generally more effective in suppressing primary tumor growth than periodic dosing, due to the resulting continuous high drug concentration. In highly heterogeneous microenvironment, the malignancy of the tumor is significantly enhanced, leading to inefficiency of chemotherapies. The effects of geometrically-confined microenvironment and non-uniform drug dosing are also investigated. Our computational model, when supplemented with sufficient clinical data, could eventually lead to the development of efficient in silico tools for prognosis and treatment strategy optimization.Comment: 41 pages, 8 figure

Efficient Multi-Robot Coverage of a Known Environment

This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heuristics for solving the multi-robot coverage problem. The first solution presented is a direct extension of an efficient single robot area coverage algorithm, based on an exact cellular decomposition. The second algorithm is a greedy approach that divides the area into equal regions and applies an efficient single-robot coverage algorithm to each region. We present experimental results for two algorithms. Results indicate that our approaches provide good coverage distribution between robots and minimize the workload per robot, meanwhile ensuring complete coverage of the area.Comment: In proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 201

Preparing sparse solvers for exascale computing.

Sparse solvers provide essential functionality for a wide variety of scientific applications. Highly parallel sparse solvers are essential for continuing advances in high-fidelity, multi-physics and multi-scale simulations, especially as we target exascale platforms. This paper describes the challenges, strategies and progress of the US Department of Energy Exascale Computing project towards providing sparse solvers for exascale computing platforms. We address the demands of systems with thousands of high-performance node devices where exposing concurrency, hiding latency and creating alternative algorithms become essential. The efforts described here are works in progress, highlighting current success and upcoming challenges. This article is part of a discussion meeting issue 'Numerical algorithms for high-performance computational science'

Strategies of Domain Decomposition to Partition Mesh-Based Applications onto Computational Grids

In this paper, we evaluate strategies of domain decomposition in Grid environment to solve mesh-basedapplications. We compare the balanced distribution strategy with unbalanced distribution strategies. While the former is acommon strategy in homogenous computing environment (e.g. parallel computers), it presents some problems due tocommunication latency in Grid environments. Unbalanced decomposition strategies consist of assigning less workload toprocessors responsible for sending updates outside the host. The results obtained in Grid environments show that unbalanceddistributions strategies improve the expected execution time of mesh-based applications by up to 53%. However, this is not truewhen the number of processors devoted to communication exceeds the number of processors devoted to calculation in thehost. To solve this problem we propose a new unbalanced distribution strategy that improves the expected execution time up to43%. We analyze the influence of the communication patterns on execution times using the Dimemas simulator.Peer ReviewedPostprint (published version