Distributed Computing最新文献

Hopsets are a fundamental graph-theoretic and graph-algorithmic construct, and they are widely used for distance-related problems in a variety of computational settings. Currently existing constructions of hopsets produce hopsets either with (Omega (n log n)) edges, or with a hopbound (n^{Omega (1)}). In this paper we devise a construction of linear-size hopsets with hopbound (ignoring the dependence on (epsilon )) ((log log n)^{log log n + O(1)}). This improves the previous hopbound for linear-size hopsets almost exponentially. We also devise efficient implementations of our construction in PRAM and distributed settings. The only existing PRAM algorithm [19] for computing hopsets with a constant (i.e., independent of n) hopbound requires (n^{Omega (1)}) time. We devise a PRAM algorithm with polylogarithmic running time for computing hopsets with a constant hopbound, i.e., our running time is exponentially better than the previous one. Moreover, these hopsets are also significantly sparser than their counterparts from [19]. We apply these hopsets to achieve the following online variant of shortest paths in the PRAM model: preprocess a given weighted graph within polylogarithmic time, and then given any query vertex v, report all approximate shortest paths from v in constant time. All previous constructions of hopsets require either polylogarithmic time per query or polynomial preprocessing time.

Background: To assess the multicenter outcomes of posterior chamber phakic intraocular lens implantation with a central hole (EVO-ICL, STAAR Surgical) for patients undergoing previous laser in situ keratomileusis (LASIK).

Methods: This case series enrolled 31 eyes of 21 consecutive patients undergoing EVO-ICL implantation to correct residual refractive errors after LASIK at 7 nationwide major surgical sites. We investigated safety, efficacy, predictability, stability, and adverse events at 1 week, 1, 3, and 6 months postoperatively, and at the final visit.

Results: The mean observation period was 1.6 ± 1.8 years. Uncorrected and corrected visual acuities were - 0.14 ± 0.11 and - 0.22 ± 0.09 logMAR at 6 months postoperatively. At 6 months postoperatively, 81% and 100% of eyes were within ± 0.5 D and ± 1.0 D, respectively, of the targeted correction. We found neither significant manifest refraction changes of 0.05 ± 0.38 D from 1 week to 6 months nor apparent intraoperative or postoperative complications in any case.

Conclusions: Our multicenter study confirmed that the EVO-ICL provided good outcomes in safety, efficacy, predictability, and stability, even in post-LASIK eyes. Therefore, EVO-ICL implantation may be a viable surgical option, even for correcting residual refractive errors after LASIK. Trial registration University Hospital Medical Information Network Clinical Trial Registry (000045295).

The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminating. In 1994, Ben-Or, Kelmer and Rabin published a proof-sketch of a lesser known lower bound for asynchronous fault tolerant computation with optimal resilience in face of a Byzantine adversary: if (nle 4t) then any t-resilient asynchronous verifiable secret sharing protocol must have some non-zero probability of not terminating. Our main contribution is to revisit this lower bound and provide a rigorous and more general proof. Our second contribution is to show how to avoid this lower bound. We provide a protocol with optimal resilience that is almost surely terminating for a strong common coin functionality. Using this new primitive we provide an almost surely terminating protocol with optimal resilience for asynchronous Byzantine agreement that has a new fair validity property. To the best of our knowledge this is the first asynchronous Byzantine agreement with fair validity in the information theoretic setting.