Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2021
Numerical evaluation of the duodenal mucosal resurfacing technique for the treatment of Type 2 diabetes
Computer Methods and Programs in Biomedicine (CBIO), Volume 211, Issue Chttps://doi.org/10.1016/j.cmpb.2021.106413Highlights- Bioheat transfer equation is employed as a thermal model of the DMR treatment.
- ...
This work presents a numerical analysis of the Duodenal Mucosal Resurfacing (DMR) technique, which is a relatively new treatment for Type 2 diabetes that has been already tested in human beings. In ...
- articleMarch 2019
The Jump Start Power Method: A New Approach for Computing the Ergodic Projector of a Finite Markov Chain
Journal of Scientific Computing (JSCI), Volume 78, Issue 3Pages 1691–1723https://doi.org/10.1007/s10915-018-0828-1This article presents a new numerical method for approximately computing the ergodic projector of a finite Markov chain. Our approach requires neither structural information on the chain, such as, the identification of ergodic classes, transient states, ...
- articleFebruary 2019
An algorithm for the evaluation of the incomplete gamma function
Advances in Computational Mathematics (SPACM), Volume 45, Issue 1Pages 23–49https://doi.org/10.1007/s10444-018-9604-xWe introduce an algorithm for the evaluation of the Incomplete Gamma Function, P(m, x), for all m, x >?0. For small m, a classical recursive scheme is used to evaluate P(m, x), whereas for large m a newly derived asymptotic expansion is used. The number ...
- research-articleJanuary 2018
Study on Distributed Cloud Computing Environment with Composition Model and Graph Model
IMCOM '18: Proceedings of the 12th International Conference on Ubiquitous Information Management and CommunicationArticle No.: 96, Pages 1–8https://doi.org/10.1145/3164541.3164561The conventional centralized cloud has some issues related to timeliness and network congestion. To solve correspondent issues, the conventional cloud is extended in close proximity to a cloud service customer. The researches regarding network edge side ...
- research-articleJanuary 2014
Fast computation of a class of highly oscillatory integrals
In this paper, the problem of numerical evaluation of a class of highly oscillatory integrals a b f ( x ) ( x - a ) α ( b - x ) β k = 1 n x - k γ k e i ω x dx , where α , β < 1 , γ k ≤ 1 , a < k < b and ω 1 , has been discussed. Based on analytic ...
- articleOctober 2012
Evaluating bound-constrained minimization software
Computational Optimization and Applications (COOP), Volume 53, Issue 2Pages 347–373https://doi.org/10.1007/s10589-012-9466-yBound-constrained minimization is a subject of active research. To assess the performance of existent solvers, numerical evaluations and comparisons are carried on. Arbitrary decisions that may have a crucial effect on the conclusions of numerical ...
- articleApril 2012
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
Computational Optimization and Applications (COOP), Volume 51, Issue 3Pages 1065–1088https://doi.org/10.1007/s10589-011-9401-7The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes ...
- articleAugust 2011
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing (JPDC), Volume 71, Issue 8Pages 1165–1176https://doi.org/10.1016/j.jpdc.2011.01.009Consider a group of peers, an ideal random peer sampling service should return a peer, which is a uniform independent random sample of the group. This paper focuses on the implementation and analysis of a peer sampling service based on symmetric view ...
- ArticleDecember 2009
A Formal Characterization of Uniform Peer Sampling Based on View Shuffling
PDCAT '09: Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and TechnologiesPages 360–365https://doi.org/10.1109/PDCAT.2009.61Consider a group of peers, an ideal random peer sampling service should return a peer, which is an unbiased independent random sample of the group. This paper focuses on peer sampling service based on view shuffling (aka gossip-based peer sampling), ...
- articleMay 2008
How good are projection methods for convex feasibility problems?
Computational Optimization and Applications (COOP), Volume 40, Issue 1Pages 1–12https://doi.org/10.1007/s10589-007-9073-5We consider simple projection methods for solving convex feasibility problems. Both successive and sequential methods are considered, and heuristics to improve these are suggested. Unfortunately, particularly given the large literature which might make ...