15,309 research outputs found

    Inter-Office Memorandum from J.F. Cunningham, O.P. to R.L. Pelkington, O.P.

    Get PDF
    Providence College Department of Theatre, Dance & Film Inter-Office Memorandum from J.F. Cunningham, O.P. to R.L. Pelkington, O.P. regarding the production of Man of La Mancha. March 2, 1973https://digitalcommons.providence.edu/lamancha_commentary/1001/thumbnail.jp

    System remotely inspects, measures, and records internal irregularities in piping

    Get PDF
    Video electromechanical probe visually inspects and measures internal offset and peaking of welds in relatively large piping. Irregularity dimensions are recorded on peripheral equipment consisting of video tape and X-Y plotter. The probe is used for inspection of vacuum-jacketed liquid lines that cannot be inspected externally

    Transonic unsteady airloads on an energy efficient transport wing with oscillating control surfaces

    Get PDF
    An aspect ratio 10.8 supercritical wing with oscillating control surfaces is described. The wing is instrumental with 252 static orifices and 164 in situ dynamic pressure transducers for studying the effects of control surface deflection on steady and unsteady pressures at transonic speeds. Results from initial wind tunnel tests conducted in the Langley Transonic Dynamics Tunnel are discussed. Unsteady pressure results are presented for two trailing edge control surfaces oscillating separately at the design Mach number of 0.78. Some experimental results are compared with analytical results obtained by using linear lifting surface theory

    Strategic Network Formation with Attack and Immunization

    Full text link
    Strategic network formation arises where agents receive benefit from connections to other agents, but also incur costs for forming links. We consider a new network formation game that incorporates an adversarial attack, as well as immunization against attack. An agent's benefit is the expected size of her connected component post-attack, and agents may also choose to immunize themselves from attack at some additional cost. Our framework is a stylized model of settings where reachability rather than centrality is the primary concern and vertices vulnerable to attacks may reduce risk via costly measures. In the reachability benefit model without attack or immunization, the set of equilibria is the empty graph and any tree. The introduction of attack and immunization changes the game dramatically; new equilibrium topologies emerge, some more sparse and some more dense than trees. We show that, under a mild assumption on the adversary, every equilibrium network with nn agents contains at most 2n−42n-4 edges for n≥4n\geq 4. So despite permitting topologies denser than trees, the amount of overbuilding is limited. We also show that attack and immunization don't significantly erode social welfare: every non-trivial equilibrium with respect to several adversaries has welfare at least as that of any equilibrium in the attack-free model. We complement our theory with simulations demonstrating fast convergence of a new bounded rationality dynamic which generalizes linkstable best response but is considerably more powerful in our game. The simulations further elucidate the wide variety of asymmetric equilibria and demonstrate topological consequences of the dynamics e.g. heavy-tailed degree distributions. Finally, we report on a behavioral experiment on our game with over 100 participants, where despite the complexity of the game, the resulting network was surprisingly close to equilibrium.Comment: The short version of this paper appears in the proceedings of WINE-1

    NLC-2 graph recognition and isomorphism

    Get PDF
    NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a O(n2m)O(n^2 m)-time algorithm, improving Johansson's algorithm \cite{Johansson00}. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust O(n2m)O(n^2 m)-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.Comment: soumis \`{a} WG 2007; 12
    • …
    corecore