28 research outputs found

    Comparison between paracervical and intracervical block before procedures on uterine cavity and cervical dilatation

    Get PDF
    Background: Procedures like dilatation and curettage and manual vacuum aspirations are one of the commonest procedures conducted in the outpatient Department of Obstetrics and Gynecology. Objective of present study was to find out whether intracervical block is as effective as paracervical block in patients undergoing cervical dilatation and procedures on uterine cavity.Methods: Patients undergoing dilatation and curettage or manual vacuum aspiration were given either paracevrical block or intracervical block. The pain during cervical dilatation and curettage or manual vacuum aspiration were assessed on a 10 cm visual analogue scale.Results: Mean visual analogue score during dilatation was comparable in both groups. Mean visual analogue score were comparable during dilatation in both groups before curettage or manual vacuum aspiration. Mean visual analogue scores during manual vacuum aspiration or curettage was also comparable with both groups. One patient had a serious side effect of convulsion during paracervical block.Conclusions: Intracervical block is preferable to paracervical block during procedures like cervical dilatation and on procedures on uterine cavity as intracervical block requires less technical precision than paracervical block

    The Role of Interaction and Common Randomness in Two-User Secure Computation

    Get PDF
    This paper has been presented at : 2018 IEEE International Symposium On Information Theory (ISIT)We consider interactive computation of randomized functions between two users with the following privacy requirement: the interactive communication should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings.Gowtham R. Kurri was supported by a travel fellowship from the Sarojini Damodaran Foundation. This work was done while Jithin Ravi was at Tata Institute of Fundamental Research. He has received funding from ERC grant 714161

    Interactive Secure Function Computation

    Get PDF
    We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings. We also study perfectly secure non-interactive computation when only one of the users computes a randomized function based on a single transmission from the other user. We characterize randomized functions which can be perfectly securely computed in this model and obtain tight bounds on the optimal message lengths in all the privacy settings.Comment: 30 pages. Revised based on comments from the reviewer

    Multiple Access Channel Simulation

    Get PDF
    We study the problem of simulating a two-user multiple access channel over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each, while a decoder observes i.i.d. copies of a side-information random variable. There are rate-limited noiseless communication links and independent pairwise shared randomness resources between each encoder and the decoder. The decoder has to output approximately i.i.d. copies of another random variable jointly distributed with the two sources and the side information. We are interested in the rate tuples which permit this simulation. This setting can be thought of as a multi-terminal generalization of the point-to-point channel simulation problem studied by Bennett et al. (2002) and Cuff (2013). General inner and outer bounds on the rate region are derived. For the specific case where the sources at the encoders are conditionally independent given the side-information at the decoder, we completely characterize the rate region. Our bounds recover the existing results on function computation over such multi-terminal networks. We then show through an example that an additional independent source of shared randomness between the encoders strictly improves the communication rate requirements, even if the additional randomness is not available to the decoder. Furthermore, we provide inner and outer bounds for this more general setting with independent pairwise shared randomness resources between all the three possible node pairs.Comment: 33 pages, 3 figure
    corecore