We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case mes...

Aim. To compare objective and subjective outcome after simultaneous wave front guided (WFG) PRK and accelerated corneal cross-linking (CXL) in patients with progressive keratoconus versus sequential WFG PRK 6 months after CXL. Methods. 62 eyes with progressive keratoconus were divided into two groups; the first including 30 eyes underwent simultaneous WFG PRK with accelerated CXL. The second in...

BACKGROUND To compare changes in higher-order aberrations (HOAs) following small incision lenticule extraction (SMILE) and wavefront-guided femtosecond laser-assisted in situ keratomileusis (WFG FS-LASIK), and to investigate correlations between preoperative spherical equivalence (SE) and components of HOAs affecting visual quality. METHODS Sixty-five myopic eyes from 38 patients were enrolle...

AIM To evaluate and compare the efficacy of the astigmatic correction achieved with laser in situ keratomileusis (LASIK) in eyes with myopic astigmatism using wavefront-guided (WFG) and wavefront-optimized (WFO) ablation profiles. METHODS Prospective study included 221 eyes undergoing LASIK: 99 and 122 eyes with low and moderate myopic astigmatism (low and moderate myopia groups). Two subgrou...

This study aimed to investigate the effect of myopic defocus on visual acuity after phakic intraocular lens (IOL) implantation and wavefront-guided laser in situ keratomileusis (wfg-LASIK). Our prospective study comprised thirty eyes undergoing posterior chamber phakic IOL implantation and 30 eyes undergoing wfg-LASIK. We randomly measured visual acuity under myopic defocus after cycloplegic an...

We present a simple and eecient distributed algorithm for detecting generalized-deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-for graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an \image" of the WFG ...

We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. The proposed algorithm has two primary advantages: First, it avoids sending messages along the edges of the global wait-for graph (WFG), thereby achieving a worst-case mes...

BACKGROUND While acute rejection and early graft loss rates have decreased substantially over the past four decades, progressive chronic allograft dysfunction (CAD) still remains a common cause of late graft loss in kidney transplant recipients. OBJECTIVE This study was conducted to investigate the percentage of natural killer (NK) cell subsets and IL-2, 15 and 18 genes expression in two grou...

PURPOSE To evaluate the astigmatic outcomes of wavefront-guided sub-Bowman keratomileusis (WFG-SBK) for low to moderate myopic astigmatism. METHODS This study enrolled 100 right eyes from 100 patients who underwent WFG-SBK for the correction of myopia and astigmatism. The polar value method was performed with anterior and posterior corneal astigmatism measured with Scheimpflug camera combined...

Replicated databases that use quorum-consensus algorithms to perform majority voting are prone to deadlocks. Due to the P-out-of-Q nature of quorum requests, deadlocks that arise are generalized deadlocks and are hard to detect. We present an efficient distributed algorithm to detect generalized deadlocks in replicated databases. The algorithm performs reduction of a distributed waitfor-graph (...