We present the first Byzantine agreement protocol which tolerates any number of maliciously faulty processors without relying on computational assumptions (such as the unforgeability of digital signatures). Our protocol needs reliable broadcast and secret channels in a precomputation phase. For a security parameter σ, it achieves Byzantine agreement with an error probability of at most 2–σ, whe...

We report a new one-parameter family of spherically symmetric, inhomogeneous, and time-dependent solutions the vacuum Brans-Dicke field equations which are conformal to Roberts scalar geometries Einstein gravity. The solution is spherical contains naked central singularity. use it as seed generate another two-parameter using known symmetry

We consider the number of zeros of the integral $I(h) = oint_{Gamma_h} omega$ of real polynomial form $omega$ of degree not greater than $n$ over a family of vanishing cycles on curves $Gamma_h:$ $y^2+3x^2-x^6=h$, where the integral is considered as a function of the parameter $h$. We prove that the number of zeros of $I(h)$, for $0 < h < 2$, is bounded above by $2[frac{n-1}{2}]+1$.

The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and Bäckström et al. (2012) picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provid...

Introduction: There are many similarities between memory impairment in patients suffering from Alzheimer and animals treated by Cannabinoids. The agonists of Cannabinoid receptors affect on a variety of memories and leanings. The present study aims to investigate the role of &alpha;-1-adrenergic receptors in central region of amygdala in state-dependent learning induced by WIN55,212-2 (cannabin...

In this study&lrm;, &lrm;a new polynomial rank transmutation is proposed with the help of&lrm; &lrm; the idea of quadratic rank transmutation mapping (QRTM)&lrm;. &lrm;This polynomial rank&lrm; &lrm; transmutation is allowed to extend the range of the transmutation parameter from&lrm; &lrm; &nbsp;[-1,1] to [-1,k]&lrm;&lrm;. &lrm;At this point&lrm;, &lrm;the generated distributions gain more&lrm...