Severity: Warning
Message: file_get_contents(https://...@gmail.com&api_key=61f08fa0b96a73de8c900d749fcb997acc09&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 197
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 197
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 271
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 1075
Function: getPubMedXML
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3195
Function: GetPubMedArticleOutput_2016
File: /var/www/html/application/controllers/Detail.php
Line: 597
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 511
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 317
Function: require_once
98%
921
2 minutes
20
Computational hemodynamics is being developed as an alternative approach for assisting clinical diagnosis and treatment planning for liver diseases. The technology is non-invasive, but the computational time could be high when the full geometry of the blood vessels is taken into account. Existing approaches use either one-dimensional model of the artery or simplified three-dimensional tubular geometry in order to reduce the computational time, but the accuracy is sometime compromised, for example, when simulating blood flows in arteries with plaque. In this work, we study a highly parallel method for the transient incompressible Navier-Stokes equations for the simulation of the blood flows in the full three-dimensional patient-specific hepatic artery, portal vein and hepatic vein. As applications, we also simulate the flow in a patient with hepatectomy and calculate the S (PPG). One of the advantages of simulating blood flows in all hepatic vessels is that it provides a direct estimate of the PPG, which is a gold standard value to assess the portal hypertension. Moreover, the robustness and scalability of the algorithm are also investigated. A 83% parallel efficiency is achieved for solving a problem with 7 million elements on a supercomputer with more than 1000 processor cores.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1002/cnm.3451 | DOI Listing |