66,814 research outputs found

    Reflections on security options for the real-time transport protocol framework

    Get PDF
    The Real-time Transport Protocol (RTP) supports a range of video conferencing, telephony, and streaming video ap- plications, but offers few native security features. We discuss the problem of securing RTP, considering the range of applications. We outline why this makes RTP a difficult protocol to secure, and describe the approach we have recently proposed in the IETF to provide security for RTP applications. This approach treats RTP as a framework with a set of extensible security building blocks, and prescribes mandatory-to-implement security at the level of different application classes, rather than at the level of the media transport protocol

    Ensuring Linguistic Access in Health Care Settings: An Overview of Current Legal Rights and Responsibilities

    Get PDF
    Focuses on the language access responsibilities of healthcare and coverage providers pursuant to federal and state laws and policies

    Reality: Each Day I Escape It

    Get PDF
    I was dreaming. But the realness of my dream with frighteningly vivid and at the same time morbid, and as it progressed it took on nightmarish proportions..

    Twisting eigensystems of Drinfeld Hecke eigenforms by characters

    Get PDF
    We address some questions posed by Goss related to the modularity of Drinfeld modules of rank 1 defined over the field of rational functions in one variable with coefficients in a finite field. For each positive characteristic valued Dirichlet character, we introduce certain projection operators on spaces of Drinfeld modular forms with character of a given weight and type such that when applied to a Hecke eigenform return a Hecke eigenform whose eigensystem has been twisted by the given Dirichlet character. Unlike the classical case, however, the effect on Goss' uu-expansions for these eigenforms --- and even on Petrov's AA-expansions --- is more complicated than a simple twisting of the u−u- (or A−A-) expansion coefficients by the given character. We also introduce Eisenstein series with character for irreducible levels p\mathfrak{p} and show that they and their Fricke transforms are Hecke eigenforms with a new type of AA-expansion and AA-expansion in the sense of Petrov, respectively. We prove congruences between certain cuspforms in Petrov's special family and the Eisenstein series and their Fricke transforms introduced here, and we show that in each weight there are as many linearly independent Eisenstein series with character as there are cusps for Γ1(p)\Gamma_1(\mathfrak{p}).Comment: Research funded by the Alexander von Humboldt Foundatio

    The Legendre determinant form for Drinfeld modules in arbitrary rank

    Full text link
    For each positive integer rr, we construct a nowhere-vanishing, single-cuspidal Drinfeld modular form for \GL_r(\FF_q[\theta]), necessarily of least possible weight, via determinants using rigid analytic trivializations of the universal Drinfeld module of rank rr and deformations of vectorial Eisenstein series. Along the way, we deduce that the cycle class map from de Rham cohomology to Betti cohomology is an isomorphism for Drinfeld modules of all ranks over \FF_q[\theta].Comment: 14 page

    Random k-SAT and the Power of Two Choices

    Full text link
    We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well-studied area of probabilistic combinatorics (Achlioptas processes) to random CSP's. In particular, while a rule to delay the 2-SAT threshold was known previously, this is the first proof of a rule to shift the threshold of k-SAT for k >= 3. We then propose a gap decision problem based upon this semi-random model. The aim of the problem is to investigate the hardness of the random k-SAT decision problem, as opposed to the problem of finding an assignment or certificate of unsatisfiability. Finally, we discuss connections to the study of Achlioptas random graph processes.Comment: 13 page
    • …