We propose two fault-tolerant broadcasting schemes in star graphs. One of the schemes can tolerate up to n − 2 faults of the crash type in the n-star graph. The other scheme can tolerate up to ⌊ n−3d−1 2 ⌋ faults of the Byzantine type in the n-star graph, where d is the smallest positive integer satisfying n ≤ d!. Each of the schemes is designed for the single-port mode, and it completes the br...

Shor and Preskill have provided a simple proof of security of the standard quantum key distribution scheme by Bennett and Brassard (BB84) by demonstrating a connection between key distribution and entanglement purification protocols with one-way communications. Here we provide proofs of security of standard quantum key distribution schemes, BB84 and the six-state scheme, against the most genera...

BACKGROUND The majority (approximately 75%) of children with cow's milk allergy tolerate extensively heated (baked) milk products. Long-term effects of inclusion of dietary baked milk have not been reported. OBJECTIVE We report on the outcomes of children who incorporated baked milk products into their diets. METHODS Children evaluated for tolerance to baked milk (muffin) underwent sequenti...

Previous work on radiation hardening has focused on designing memory elements to tolerate direct hits by high energy particles. The study of latch designs to tolerate high energy particle induced transient pulses arising in the combinational part of the circuit and traveling to the inputs of DFFs has been ignored. In this work, we look at ways to slow down the input stage of latches by insertin...

Crucial computer applications require extremely reliable software. For a typical system, current proof techniques and testing methods cannot guarantee the absence of software faults, but careful use of redundancy may allow the system to tolerate them. Existing methods to provide fault tolerance at execution time rely on redundant software written to the same specifications. Such techniques use ...