1,132 research outputs found

    A novel scrambling algorithm for a robust WEP implementation [wired equivalent privacy protocol]

    Get PDF

    SNDR sensitivity analysis for cascaded ΣΔ modulators

    Get PDF

    14-bit 2.2-MS/s sigma-delta ADC's

    Get PDF

    Mapping of non-central potentials under point canonical transformations

    Full text link
    Motivated by the observation that all known exactly solvable shape invariant central potentials are inter-related via point canonical transformations, we develop an algebraic framework to show that a similar mapping procedure is also exist between a class of non-central potentials. As an illustrative example, we discuss the inter-relation between the generalized Coulomb and oscillator systems.Comment: 11 pages article in LaTEX (uses standard article.sty). Please check http://www1.gantep.edu.tr/~gonul for other studies of Nuclear Physics Group at University of Gaziante

    When three’s a crowd: how relational structure and social history shape organizational codes in triads

    Get PDF
    When members of an organization share communication codes, coordination across subunits is easier. But if groups interact separately, they will each develop a specialized code. This paper asks: Can organizations shape how people interact in order to create shared communication codes? What kinds of design interventions in communication structures and systems are useful? In laboratory experiments on triads composed of dyads that solve distributed coordination problems, we examine the effect of three factors: transparency of communication (versus privacy), role differentiation, and the subjects’ social history. We find that these factors impact the harmonization of dyadic codes into triadic codes, shaping the likelihood that groups develop group-level codes, converge on a single group-level code, and compress the group-level code into a single word. Groups with transparent communication develop more effective codes, while acyclic triads composed of strangers are more likely to use multiple dyadic codes, which are less efficient than group-level codes. Groups of strangers put into acyclic configurations appear to have more difficulty establishing “ground rules”—that is, the “behavioral common ground” necessary to navigate acyclic structures. These coordination problems are transient—groups of different structures end up with the same average communication performance if given sufficient time. However, lasting differences in the code that is generated remain
    • …
    corecore