Clinical imaging modalities are a mainstay of modern disease management, but the full utilization of imaging-based data remains elusive. Aortic disease is defined by anatomic scalars quantifying aortic size, even though aortic disease progression initiates complex shape changes. We present an imaging-based geometric descriptor, inspired by fundamental ideas from topology and soft-matter physics that captures dynamic shape evolution. The aorta is reduced to a two-dimensional mathematical surface in space whose geometry is fully characterized by the local principal curvatures. Disease causes deviation from the smooth bent cylindrical shape of normal aortas, leading to a family of highly heterogeneous surfaces of varying shapes and sizes. To deconvolute changes in shape from size, the shape is characterized using integrated Gaussian curvature or total curvature. The fluctuation in total curvature (δK) across aortic surfaces captures heterogeneous morphologic evolution by characterizing local shape changes. We discover that aortic morphology evolves with a power-law defined behavior with rapidly increasing δK forming the hallmark of aortic disease. Divergent δK is seen for highly diseased aortas indicative of impending topologic catastrophe or aortic rupture. We also show that aortic size (surface area or enclosed aortic volume) scales as a generalized cylinder for all shapes. Classification accuracy for predicting aortic disease state (normal, diseased with successful surgery, and diseased with failed surgical outcomes) is 92.8±1.7%. The analysis of δK can be applied on any three-dimensional geometric structure and thus may be extended to other clinical problems of characterizing disease through captured anatomic changes.

Data analysis is an important functionality in cloud computing which allows a huge amount of data to be processed over very large clusters. MapReduce is recognized as a popular way to handle data in the cloud environment due to its excellent scalability and good fault tolerance. However, compared to parallel databases, the performance of MapReduce is slower when it is adopted to perform complex data analysis tasks that require the joining of multiple data sets in order to compute certain aggregates. A common concern is whether MapReduce can be improved to produce a system with both scalability and efficiency. In this paper, we introduce Map-Join-Reduce, a system that extends and improves MapReduce runtime framework to efficiently process complex data analysis tasks on large clusters. We first propose a filtering-join-aggregation programming model, a natural extension of MapReduce's filtering-aggregation programming model. Then, we present a new data processing strategy which performs filtering-join-aggregation tasks in two successive MapReduce jobs. The first job applies filtering logic to all the data sets in parallel, joins the qualified tuples, and pushes the join results to the reducers for partial aggregation. The second job combines all partial aggregation results and produces the final answer. The advantage of our approach is that we join multiple data sets in one go and thus avoid frequent checkpointing and shuffling of intermediate results, a major performance bottleneck in most of the current MapReduce-based systems. We benchmark our system against Hive, a state-of-the-art MapReduce-based data warehouse on a 100-node cluster on Amazon EC2 using TPC-H benchmark. The results show that our approach significantly boosts the performance of complex analysis queries.