1,094 research outputs found

    A Shared-Constraint Approach to Multi-leader Multi-follower Games

    Full text link
    Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even local equilibria for it has proved challenging. Consequently, much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We consider a modified formulation in which every leader is cognizant of the equilibrium constraints of all leaders. Equilibria of this modified game contain the equilibria, if any, of the original game. The new formulation has a constraint structure called shared constraints, and our main result shows that if the leader objectives admit a potential function, the global minimizers of the potential function over the shared constraint are equilibria of the modified formulation. We provide another existence result using fixed point theory that does not require potentiality. Additionally, local minima, B-stationary, and strong-stationary points of this minimization are shown to be local Nash equilibria, Nash B-stationary, and Nash strong-stationary points of the corresponding multi-leader multi-follower game. We demonstrate the relationship between variational equilibria associated with this modified shared-constraint game and equilibria of the original game from the standpoint of the multiplier sets and show how equilibria of the original formulation may be recovered. We note through several examples that such potential multi-leader multi-follower games capture a breadth of application problems of interest and demonstrate our findings on a multi-leader multi-follower Cournot game.Comment: The earlier manuscript was rejected. We felt it had too many themes crowding it and decided to make a separate paper from each theme. This submission draws some parts from the earlier manuscript and adds new results. Another parts is under review with the IEEE TAC (on arxiv) and another was published in Proc IEEE CDC, 2013. This submission is under review with Set-valued and Variational Analysi

    Locality-Adaptive Parallel Hash Joins Using Hardware Transactional Memory

    Get PDF
    Previous work [1] has claimed that the best performing implementation of in-memory hash joins is based on (radix-)partitioning of the build-side input. Indeed, despite the overhead of partitioning, the benefits from increased cache-locality and synchronization free parallelism in the build-phase outweigh the costs when the input data is randomly ordered. However, many datasets already exhibit significant spatial locality (i.e., non-randomness) due to the way data items enter the database: through periodic ETL or trickle loaded in the form of transactions. In such cases, the first benefit of partitioning — increased locality — is largely irrelevant. In this paper, we demonstrate how hardware transactional memory (HTM) can render the other benefit, freedom from synchronization, irrelevant as well. Specifically, using careful analysis and engineering, we develop an adaptive hash join implementation that outperforms parallel radix-partitioned hash joins as well as sort-merge joins on data with high spatial locality. In addition, we show how, through lightweight (less than 1% overhead) runtime monitoring of the transaction abort rate, our implementation can detect inputs with low spatial locality and dynamically fall back to radix-partitioning of the build-side input. The result is a hash join implementation that is more than 3 times faster than the state-of-the-art on high-locality data and never more than 1% slower

    On the Near Ultra-Violet Absorption Spectra of some Bromoxylenes

    Get PDF

    Perch Associated Expression of Phenotypic Plasticity in Limb Development and Sprint Speed in Agamid Lizard Calotes versicolor: A Laboratory Study

    Get PDF
    New born hatchlings of Calotes versicolor were reared in terrarium having narrow or wide perches for a period of 4-month and their snout vent length (SVL), tail, fore and hindlimb lengths were measured at monthly intervals. Limb postures (closer to the body or spread away from the body) were also recorded. The sprint speed was recorded in two and four-month old lizards on a 1 m long race track providing 45° or 60° slope. In both the groups, SVL and tail lengths were comparable but the limb lengths and their growth rates were significantly greater in lizards of wider perch group. The lizards reared with narrow perches positioned their limbs closer to the body; while those reared on wider perches spread their limbs away from their body. Further, the latter exhibited significantly higher sprint speed regardless of the slope of the race track over those of narrow perch group. Sprint speeds of lizards in both groups were correlated with the limb sizes. The study showed that the lizards reared on narrow or wide perches exhibited divergent adaptive responses (phenotypic plasticity) by developing longer or shorter limbs and corresponding changes in their sprint speeds. These findings support the idea that availability of perch structure during early development evokes adaptive plasticity in the limb development and associated locomotory performance in arboreal lizards like C. versicolor

    Fault-tolerance techniques for hybrid CMOS/nanoarchitecture

    Get PDF
    The authors propose two fault-tolerance techniques for hybrid CMOS/nanoarchitecture implementing logic functions as look-up tables. The authors compare the efficiency of the proposed techniques with recently reported methods that use single coding schemes in tolerating high fault rates in nanoscale fabrics. Both proposed techniques are based on error correcting codes to tackle different fault rates. In the first technique, the authors implement a combined two-dimensional coding scheme using Hamming and Bose-Chaudhuri-Hocquenghem (BCH) codes to address fault rates greater than 5. In the second technique, Hamming coding is complemented with bad line exclusion technique to tolerate fault rates higher than the first proposed technique (up to 20). The authors have also estimated the improvement that can be achieved in the circuit reliability in the presence of Don-t Care Conditions. The area, latency and energy costs of the proposed techniques were also estimated in the CMOS domain

    Flow-History-Dependent Behavior in Entangled Polymer Melt Flow with Multiscale Simulation

    Full text link
    Polymer melts represent the flow-history-dependent behavior. To clearly show this behavior, we have investigated flow behavior of an entangled polymer melt around two cylinders placed in tandem along the flow direction in a two dimensional periodic system. In this system, the polymer states around a cylinder in downstream side are different from the ones around another cylinder in upstream side because the former ones have a memory of a strain experienced when passing around the cylinder in upstream side but the latter ones do not have the memory. Therefore, the shear stress distributions around two cylinders are found to be different from each other. Moreover, we have found that the averaged flow velocity decreases accordingly with increasing the distance between two cylinders while the applied external force is constant. While this behavior is consistent with that of the Newtonian fluid, the flow-history-dependent behavior enhances the reduction of the flow resistance.Comment: 6 pages, 3 figures, Proceedings of 5th International Mini-Symposium on Liquid

    Requirement for PBAF in transcriptional repression and repair at DNA breaks in actively transcribed regions of chromatin

    Get PDF
    Actively transcribed regions of the genome are vulnerable to genomic instability. Recently, it was discovered that transcription is repressed in response to neighboring DNA double-strand breaks (DSBs). It is not known whether a failure to silence transcription flanking DSBs has any impact on DNA repair efficiency or whether chromatin remodelers contribute to the process. Here, we show that the PBAF remodeling complex is important for DSB-induced transcriptional silencing and promotes repair of a subset of DNA DSBs at early time points, which can be rescued by inhibiting transcription globally. An ATM phosphorylation site on BAF180, a PBAF subunit, is required for both processes. Furthermore, we find that subunits of the PRC1 and PRC2 polycomb group complexes are similarly required for DSB-induced silencing and promoting repair. Cancer-associated BAF180 mutants are unable to restore these functions, suggesting PBAF's role in repressing transcription near DSBs may contribute to its tumor suppressor activity

    Characterisation of Bombyx mori odorant-binding proteins reveals that a general odorant-binding protein discriminates between sex pheromone components

    Get PDF
    In many insect species, odorant-binding proteins (OBPs) are thought to be responsible for the transport of pheromones and other semiochemicals across the sensillum lymph to the olfactory receptors (ORs) within the antennal sensilla. In the silkworm Bombyx mori, the OBPs are subdivided into three main subfamilies; pheromone-binding proteins (PBPs), general odorant-binding proteins (GOBPs) and antennal-binding proteins (ABPs). We used the MotifSearch algorithm to search for genes encoding putative OBPs in B. mori and found 13, many fewer than are found in the genomes of fruit flies and mosquitoes. The 13 genes include seven new ABP-like OBPs as well as the previously identified PBPs (three), GOBPs (two) and ABPx. Quantitative examination of transcript levels showed that BmorPBP1, BmorGOBP1, BmorGOBP2 and BmorABPx are expressed at very high levels in the antennae and so could be involved in olfaction. A new two-phase binding assay, along with other established assays, showed that BmorPBP1, BmorPBP2, BmorGOBP2 and BmorABPx all bind to the B. mori sex pheromone component (10E,12Z)-hexadecadien-1-ol (bombykol). BmorPBP1, BmorPBP2 and BmorABPx also bind the pheromone component (10E,12Z)-hexadecadienal (bombykal) equally well, whereas BmorGOBP2 can discriminate between bombykol and bombykal. X-ray structures show that when bombykol is bound to BmorGOBP2 it adopts a different conformation from that found when it binds to BmorPBP1. Binding to BmorGOBP2 involves hydrogen bonding to Arg110 rather than to Ser56 as found for BmorPBP1
    corecore