Broadcasting in Noisy Radio Networks

The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this model, the strong assumption is made that node $v$ receives a message from a neighbor if and only if exactly one of its neighbors broadcasts. We relax this assumption by introducing a new noisy radio network model in which random faults occur at senders or receivers. Specifically, for a constant noise parameter $p \in [0,1)$, either every sender has probability $p$ of transmitting noise or every receiver of a single transmission in its neighborhood has probability $p$ of receiving noise. We first study single-message broadcast algorithms in noisy radio networks and show that the Decay algorithm [Bar-Yehuda et al., 1992] remains robust in the noisy model while the diameter-linear algorithm of Gasieniec et al., 2007 does not. We give a modified version of the algorithm of Gasieniec et al., 2007 that is robust to sender and receiver faults, and extend both this modified algorithm and the Decay algorithm to robust multi-message broadcast algorithms. We next investigate the extent to which (network) coding improves throughput in noisy radio networks. We address the previously perplexing result of Alon et al. 2014 that worst case coding throughput is no better than worst case routing throughput up to constants: we show that the worst case throughput performance of coding is, in fact, superior to that of routing -- by a $\Theta(\log(n))$ gap -- provided receiver faults are introduced. However, we show that any coding or routing scheme for the noiseless setting can be transformed to be robust to sender faults with only a constant throughput overhead. These transformations imply that the results of Alon et al., 2014 carry over to noisy radio networks with sender faults.Comment: Principles of Distributed Computing 201

Accumulation and bunching of positrons

Results from a positron accumulator that operates efficiently over a range of repetition rates from 100 to 1000 Hz are presented. Moderated β‐decay positrons from a radioactive source are accumulated in a Penning‐style trap. At a repetition rate of 250 Hz an accumulation efficiency of ∼25% has been achieved. Two techniques for reducing the time spread of the positron pulses have been investigated. The most successful method reduces the pulse width from 120 ns to 20 ns.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/87600/2/487_1.pd

An observational prospective study of topical acidified nitrite for killing methicillin-resistant Staphylococcus aureus (MRSA) in contaminated wounds

Background Endogenous nitric oxide (NO) kills bacteria and other organisms as part of the innate immune response. When nitrite is exposed to low pH, NO is generated and has been used as an NO delivery system to treat skin infections. We demonstrated eradication of MRSA carriage from wounds using a topical formulation of citric acid (4.5%) and sodium nitrite (3%) creams co-applied for 5 days to 15 wounds in an observational prospective pilot study of 8 patients. Findings Following treatment with topical citric acid and sodium nitrite, 9 of 15 wounds (60%) and 3 of 8 patients (37%) were cleared of infection. MRSA isolates from these patients were all sensitive to acidified nitrite in vitro compared to methicillin-sensitive S. aureus and a reference strain of MRSA. Conclusions Nitric oxide and acidified nitrite offer a novel therapy for control of MRSA in wounds. Wounds that were not cleared of infection may have been re-contaminated or the bioavailability of acidified nitrite impaired by local factors in the tissue

Paradox of Modern Pregnancy: A Phenomenological Study of Women's Lived Experiences from Assisted Pregnancy

The purpose of our study was describing the meaning of pregnancy through Assisted Reproductive Technologies (ARTs). A qualitative design with hermeneutic phenomenology approach was selected to carry out the research. Semistructured in-depth interviews were conducted with 12 women who experienced assisted pregnancy. Three themes emerged from women's experience including finding peace in life, paradoxical feelings, and struggling to realize a dream. We concluded that pregnancy is the beginning of a new and hard struggle for women with fertility problems. The findings of our study resulted in helpful implications for the health care professionals managing assisted pregnancies. Copyright © 2015 Fahimeh Ranjbar et al

Structural and microstructural phase evolution during mechano-synthesis of nanocrystalline/amorphous CyAlMn alloy powders

Cataloged from PDF version of article.The formation mechanism of Cu-11.5Al-4Mn alloys by mechanical alloying (MA) of pure elemental powders was investigated. During milling, the powder sampling was conducted at predetermined intervals from 1 h to 96 h. The quantitative phase analyses were done by X-ray diffraction and the particles size and morphology were studied by scanning electron microscopy. Furthermore, the microstructure investigation and phase identification were done by transmission electron microscopy. Concerning the results, the nanocrystalline Cu solid solution were formed at short milling times and, by milling evolution, the austenite-to-martensite (2H) phase transformation occurred. Moreover, the formation of considerable amount of amorphous phase and its partial transformation to crystalline phases during the milling process were revealed. It was also found that, by milling development, the powder morphology changes from lamellar to semi-spherical and their size initially increases, then reduces and afterward re-increases. (C) 2013 The Society of Powder Technology Japan. Published by Elsevier B.V. and The Society of Powder Technology Japan. All rights reserve

Almost-Tight Distributed Minimum Cut Algorithms

We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our algorithm can compute $\lambda$ exactly in $O((\sqrt{n} \log^{*} n+D)\lambda^4 \log^2 n)$ time. To the best of our knowledge, this is the first paper that explicitly studies computing the exact minimum cut in the distributed setting. Previously, non-trivial sublinear time algorithms for this problem are known only for unweighted graphs when $\lambda\leq 3$ due to Pritchard and Thurimella's $O(D)$-time and $O(D+n^{1/2}\log^* n)$-time algorithms for computing $2$-edge-connected and $3$-edge-connected components. By using the edge sampling technique of Karger's, we can convert this algorithm into a $(1+\epsilon)$-approximation $O((\sqrt{n}\log^{*} n+D)\epsilon^{-5}\log^3 n)$-time algorithm for any $\epsilon>0$. This improves over the previous $(2+\epsilon)$-approximation $O((\sqrt{n}\log^{*} n+D)\epsilon^{-5}\log^2 n\log\log n)$-time algorithm and $O(\epsilon^{-1})$-approximation $O(D+n^{\frac{1}{2}+\epsilon} \mathrm{poly}\log n)$-time algorithm of Ghaffari and Kuhn. Due to the lower bound of $\Omega(D+n^{1/2}/\log n)$ by Das Sarma et al. which holds for any approximation algorithm, this running time is tight up to a $\mathrm{poly}\log n$ factor. To get the stated running time, we developed an approximation algorithm which combines the ideas of Thorup's algorithm and Matula's contraction algorithm. It saves an $\epsilon^{-9}\log^{7} n$ factor as compared to applying Thorup's tree packing theorem directly. Then, we combine Kutten and Peleg's tree partitioning algorithm and Karger's dynamic programming to achieve an efficient distributed algorithm that finds the minimum cut when we are given a spanning tree that crosses the minimum cut exactly once

Investigating the needs of family caregivers of older stroke patients: A longitudinal study in Iran

Background: The high burden of care associated with older stroke patients is a factor that threatens the health of family caregivers. Identifying the needs of family caregivers in this group of patients can help provide effective solutions. The present study aimed to determine the needs of family caregivers of older stroke patients. Methods: The sample size of this longitudinal study included 200 family caregivers of older stroke patients from two hospitals in Iran. Data collection included demographics, responses to family caregivers' needs questionnaires, and the Barthel Index which was taken in four stages including admission time, pre-discharge, two weeks and 12 weeks post-discharge. Results: The results showed that all participants at all stages of the study identified "respect for the patient when providing education, treatment, or rehabilitation"as one of their needs. There was a statistically significant relationship between the older adult survivor's age and the number of family caregivers' needs two weeks post-discharge (p = 0.012) and 12 weeks post-discharge (p = 0.008). There was a significant relationship between the patient's hospitalization period and the number of caregivers' needs three months after the patient's discharge (p = 0.028), and a significant statistical relationship between the pre-discharge physiotherapy of the patients and the number of their caregivers' needs during the two weeks post-discharge (p = 0.018). There was also a statistically significant relationship between the patient's level of dependence and the number of caregivers' needs (p = 0.0001). On the contrary, there was no significant relationship between the sex, place of living, and underlying disease history of the patient and the number of caregivers' needs (p > 0.05). Conclusion: The results of the present research indicate that the total number of caregivers' needs decreases with increasing duration of the disease. However, respite and care provision planning by other family members, seeking assistance from professional caregivers, and the search for community support resources can help reduce the burden of care of caregivers and give them the opportunity to meet their needs in different dimensions of patient care provided. © 2020 The Author(s)

Distributed Symmetry Breaking in Hypergraphs

Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and $\Delta +1$-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hypergraphs. In this paper, we study the distributed complexity of symmetry breaking in hypergraphs by presenting distributed randomized algorithms for a variety of fundamental problems under a natural distributed computing model for hypergraphs. We first show that MIS in hypergraphs (of arbitrary dimension) can be solved in $O(\log^2 n)$ rounds ($n$ is the number of nodes of the hypergraph) in the LOCAL model. We then present a key result of this paper --- an $O(\Delta^{\epsilon}\text{polylog}(n))$-round hypergraph MIS algorithm in the CONGEST model where $\Delta$ is the maximum node degree of the hypergraph and $\epsilon > 0$ is any arbitrarily small constant. To demonstrate the usefulness of hypergraph MIS, we present applications of our hypergraph algorithm to solving problems in (standard) graphs. In particular, the hypergraph MIS yields fast distributed algorithms for the {\em balanced minimal dominating set} problem (left open in Harris et al. [ICALP 2013]) and the {\em minimal connected dominating set problem}. We also present distributed algorithms for coloring, maximal matching, and maximal clique in hypergraphs.Comment: Changes from the previous version: More references adde

Ki-67/MIB-1 as a prognostic marker in cervical cancer - a systematic review with meta-analysis

Background: In cervical cancer patients it has been reported that there in a significant Ki-67/MIB-1 expression is correlated with survival in cervical cancer patients. However, the prognostic value is still not well understood. Materials and Methods: In the present meta-analysis the prognostic value of Ki-67/MIB-1 with regard to overall survival (OS) and disease-free survival (DFS) in cervical cancer was investigated. The databases of PubMed, ISI Web of Science, Cochrane Central Register of Controlled Trials, EMBASE, Science Direct and Wiley Online Library were used to identify appropriate literature. Results: In order to explore the relationship between Ki-67/MIB-1 and cervical cancer, we have included 13 studies covering 894 patients in the current meta-analysis. The effect of Ki-67/MIB-1 on OS for pooled random effects HR estimate was 1.63 (95confidence interval (CI) 1.09-2.45; P0.05) and the subgroup analysis indicated Ki-67/MIB1 was associated with DFS (HR=3.67, 95CI 2.65-5.09) in Asians. Conclusions: According to this meta-analysis, Ki-67/MIB-1 has prognostic value for OS in patients suffering from cervical cancer. For better evaluation of the prognostic role of Ki-67/MIB-1 on DFS, studies with larger numbers of patients are needed to validate present findings in the future