University of California

Mahdi Hajiaghayi

Hamid Jafarkhani

Arash Kheradvar

Elliott Groves

An apparatus or method for minimizing the total accessing cost, such as minimizing repair bandwidth, delay or the number of hops including the steps of minimizing the number of nodes to be engaged for the recovery process using a polynomial-time solution that determines the optimal number of participating nodes and the optimal set of nodes to be engaged for recovering lost data, where in a distributed database storage system, for example a dynamic system, where the accessing cost or even the number of available nodes are subject to change results in different values for the optimal number of participating nodes. An MDS code is included which can be reused when the number of participating nodes varies without having to change the entire code structure and the content of the nodes.

Cost-efficient repair for storage systems using progressive engagement

The disclosure relates to a method of automatically producing a three-dimensional (3D) segmentation of a heart chamber, the method comprising: obtaining data sets from cardiac magnetic resonance imaging (MRI) or ultrasound, generating a 3D segmentation of the heart chamber from the data sets using an active contour method, modifying the 3D segmentation by adding a plurality of intra-chamber structures; and identifying an enclosing myocardium using the 3D segmentation generated by the method.

Growing community of inventors

Irvine, CA, United States of America

Mahdi Hajiaghayi