Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Thinh D Nguyen"'
Autor:
Anh T Pham, Quoc H Dang, Cuong M Truong, Phuong H Trinh, Lam D Vu, Thinh D Nguyen, Thang Q Tran, An TM Nguyen, Khue K Dang
Publikováno v:
Radiology Case Reports, Vol 19, Iss 9, Pp 3672-3676 (2024)
Post hepatectomy Liver Failure (PHLF) is a fatal complication, especially after major liver resection. Insufficient remnant liver volume is a common cause of postoperative liver failure. Many strategies have been applied to induce the remnant liver h
Externí odkaz:
https://doaj.org/article/39cc996ec22c4ae98e6b3830268ffe60
Autor:
Eduardo Villegas, Thinh D. Nguyen, Yong X. Gan, Charles J. Coronella, Marisa Zuzga, Mingheng Li
Publikováno v:
Digital Chemical Engineering, Vol 5, Iss , Pp 100051- (2022)
This work is concerned with design and analysis of a renewable power generation process featured with fast speed of biomass processing, low NOx and SOx emissions and ease of carbon capture. It is based on chemical looping with oxygen uncoupling (CLOU
Externí odkaz:
https://doaj.org/article/3e0ab92353234baf941bdf89347d945d
Autor:
Thinh D. Nguyen
We show that selecting point in a 2D plane subject to some requirement is a difficult task.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f174ef6859be3f2da4e06b533935051e
Autor:
Thinh D. Nguyen
We show that searching for a long trail in a given graph is a hard task.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b287d9c36f85e89fc938912de1e271a5
Autor:
Thinh D. Nguyen
The study of perebor dates back to the Soviet-era mathematics, especially in the 1980s [1]. Post-Soviet mathematicians has been working on many problems in combinatorial optimization. One of them is Exact Weight Perfect Matching of Bipartite Graph (E
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cb4fcb05bbcad72349db835212c277b
Autor:
Thinh D. Nguyen
We are given a collection $S$ of sets. We would like to find the maximum number of disjoint sets in $S$. The decision problem asks for the existence of $K$ sets that are disjoint from each other.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a99b24a6c0647e308960f47b4278261b
Autor:
Thinh D. Nguyen
We prove the $\mathrm{NP}$-hardness of an optimization problem originating from algorithmic game theory. In this problem, we have a list containing each customer's ranking of some goods from a set $U$ of items in a store. We want to select a subset $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8eeeef30fe1b5aed3f7fdd1aa4912af
Autor:
Thinh D. Nguyen
We show that ordering vertices of a graph subject to some objective function is a difficult task.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01144717d8930a3618138729445ffb1c
Autor:
Thinh D. Nguyen
We extend the notion of independent sets to rigid independent sets. We choose the term {\em rigid} instead of {\em stable} since it reflects the rigidity of a block of concrete rather than the stability of a standing block.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cfeacd1a8ee46b795c9ebbc03f1d30c4
Autor:
Thinh D. Nguyen
Chinese remainder theorem is a widely-known result in number theory proven by Euler, according to Wikipedia. The proof actually yields an efficient method to solve a modular system with pair-wise coprime moduli. With a little improvement, we are able
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c45e89ca8bca839822da0c86e2c67369