Vital Dyes in Vitreomacular Surgery

Vital dyes contain complex molecules with chromophores that stain living tissues and have greatly enhanced identification and removal of transparent vitreoretinal tissues during surgery. Several “chromovitrectomy” dyes are frequently used by vitreoretinal specialists, including indocyanine green, trypan blue, brilliant blue G, and triamcinolone acetonide; other dyes are also under investigation. Trypan Blue was approved by the U.S. Food and Drug Administration (FDA) for epiretinal membrane removal, and preservative-free triamcinolone acetonide was approved by the FDA for intraocular use. However, currently available chromovitrectomy dyes have their limitations, and of particular concern for some of them is the possibility for acute and chronic toxicity to the neurosensory retina and retinal pigmented epithelium. The potentially irreversible acute toxicity and other limitations, such as lack of long-term safety profiles, highlight the need for further advancements

Epitopes Of Tilapia Red Blood Cells. I. Species-Specific Antibodies For The Control Of Tilapia Breeding Stocks

Specific antisera against red blood cells of some tilapia species were obtained by reciprocal inter- specific and intergeneric immunizations. The antisera were used to confirm co-dominant expres- sion of epitopes in F1 interspecific hybrids and to identify the parental origin of three red tilapia strains. The antisera in all hybrids (Oreochromis niloticus x O. mossambicus, O. aureus x O. horno- rum, O. niloticus x S. galilaeus and O. niloticus x O. aureus) were positive to both parental strains. However, while all F1 hybrids of O. mossambicus x O. hornorum were positive to anti-O. mossambi- cus antiserum, only 50% were positive to anti-O. hornorum antiserum. In most cases, these results point to co-dominant expression of the species-specific epitopes in hybrids. In addition, the triple parental origins of the Philippine red tilapia (positive for O. aureus, O. mossambicus and O. niloticus epitopes) and of mossambicus red tilapia (positive for O. hornorum, O. mossambicus and O. niloticus epitopes) were assessed. The O. niloticus red tilapia, described as a purebred red variant of O. niloticus, was positive for both anti-O. niloticus and anti-O. aureus antibodies, with a significantly more intense reaction to the latter. A possible genetic basis of this last finding is discussed

Glucose Starvation Boosts Entamoeba histolytica Virulence

The unicellular parasite, Entamoeba histolytica, is exposed to numerous adverse conditions, such as nutrient deprivation, during its life cycle stages in the human host. In the present study, we examined whether the parasite virulence could be influenced by glucose starvation (GS). The migratory behaviour of the parasite and its capability to kill mammalian cells and to lyse erythrocytes is strongly enhanced following GS. In order to gain insights into the mechanism underlying the GS boosting effects on virulence, we analyzed differences in protein expression levels in control and glucose-starved trophozoites, by quantitative proteomic analysis. We observed that upstream regulatory element 3-binding protein (URE3-BP), a transcription factor that modulates E.histolytica virulence, and the lysine-rich protein 1 (KRiP1) which is induced during liver abscess development, are upregulated by GS. We also analyzed E. histolytica membrane fractions and noticed that the Gal/GalNAc lectin light subunit LgL1 is up-regulated by GS. Surprisingly, amoebapore A (Ap-A) and cysteine proteinase A5 (CP-A5), two important E. histolytica virulence factors, were strongly down-regulated by GS. While the boosting effect of GS on E. histolytica virulence was conserved in strains silenced for Ap-A and CP-A5, it was lost in LgL1 and in KRiP1 down-regulated strains. These data emphasize the unexpected role of GS in the modulation of E.histolytica virulence and the involvement of KRiP1 and Lgl1 in this phenomenon

Asynchronous Byzantine Agreement with Subquadratic Communication

Understanding the communication complexity of Byzantine agreement (BA) is a fundamental problem in distributed computing. In particular, as protocols are run with a large number of parties (as, e.g., in the context of blockchain protocols), it is important to understand the dependence of the communication on the number of parties $n$. Although adaptively secure BA protocols with $o(n^2)$ communication are known in the synchronous and partially synchronous settings, no such protocols are known in the fully asynchronous case. We show here an asynchronous BA protocol with subquadratic communication tolerating an adaptive adversary who can corrupt $f0$). One variant of our protocol assumes initial setup done by a trusted dealer, after which an unbounded number of BA executions can be run; alternately, we can achieve subquadratic amortized communication with no prior setup. We also show that some form of setup is needed for (non-amortized) subquadratic BA tolerating $\Theta(n)$ corrupted parties. As a contribution of independent interest, we show a secure-computation protocol in the same threat model that has $o(n^2)$ communication when computing no-input functionalities with short output (e.g., coin tossing)

Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback

Protocols for secure Multi-Party Computation (MPC) can be classified according to the underlying communication model. Two prominent communication models considered in the literature are the synchronous and asynchronous models, which considerably differ in terms of the achievable security guarantees. Synchronous MPC protocols can achieve the optimal corruption threshold $n/2$ and allow every party to give input, but become completely insecure when synchrony assumptions are violated. On the other hand, asynchronous MPC protocols remain secure under arbitrary network conditions, but can tolerate only $n/3$ corruptions and parties with slow connections unavoidably cannot give input. A natural question is whether there exists a protocol for MPC that can tolerate up to $t_s < n/2$ corruptions under a synchronous network and $t_a < n/3$ corruptions even when the network is asynchronous. We answer this question by showing tight feasibility and impossibility results. More specifically, we show that such a protocol exists if and only if $t_a + 2t_s < n$ and the number of inputs taken into account under an asynchronous network is at most $n-t_s$