461 resultados para Common Scrambling Algorithm Stream Cipher
Resumo:
Despite the conventional wisdom that proactive security is superior to reactive security, we show that reactive security can be competitive with proactive security as long as the reactive defender learns from past attacks instead of myopically overreacting to the last attack. Our game-theoretic model follows common practice in the security literature by making worst-case assumptions about the attacker: we grant the attacker complete knowledge of the defender’s strategy and do not require the attacker to act rationally. In this model, we bound the competitive ratio between a reactive defense algorithm (which is inspired by online learning theory) and the best fixed proactive defense. Additionally, we show that, unlike proactive defenses, this reactive strategy is robust to a lack of information about the attacker’s incentives and knowledge.
Resumo:
BACKGROUND Endometriosis is a polygenic disease with a complex and multifactorial aetiology that affects 8-10% of women of reproductive age. Epidemiological data support a link between endometriosis and cancers of the reproductive tract. Fibroblast growth factor receptor 2 (FGFR2) has recently been implicated in both endometrial and breast cancer. Our previous studies on endometriosis identified significant linkage to a novel susceptibility locus on chromosome 10q26 and the FGFR2 gene maps within this linkage region. We therefore hypothesized that variation in FGFR2 may contribute to the risk of endometriosis. METHODS We genotyped 13 single nucleotide polymorphisms (SNPs) densely covering a 27 kb region within intron 2 of FGFR2 including two SNPs (rs2981582 and rs1219648) significantly associated with breast cancer and a total 40 tagSNPs across 150 kb of the FGFR2 gene. SNPs were genotyped in 958 endometriosis cases and 959 unrelated controls. RESULTS We found no evidence for association between endometriosis and FGFR2 intron 2 SNPs or SNP haplotypes and no evidence for association between endometriosis and variation across the FGFR2 gene. CONCLUSIONS Common variation in the breast-cancer implicated intron 2 and other highly plausible causative candidate regions of FGFR2 do not appear to be a major contributor to endometriosis susceptibility in our large Australian sample.
Resumo:
The delay stochastic simulation algorithm (DSSA) by Barrio et al. [Plos Comput. Biol.2, 117–E (2006)] was developed to simulate delayed processes in cell biology in the presence of intrinsic noise, that is, when there are small-to-moderate numbers of certain key molecules present in a chemical reaction system. These delayed processes can faithfully represent complex interactions and mechanisms that imply a number of spatiotemporal processes often not explicitly modeled such as transcription and translation, basic in the modeling of cell signaling pathways. However, for systems with widely varying reaction rate constants or large numbers of molecules, the simulation time steps of both the stochastic simulation algorithm (SSA) and the DSSA can become very small causing considerable computational overheads. In order to overcome the limit of small step sizes, various τ-leap strategies have been suggested for improving computational performance of the SSA. In this paper, we present a binomial τ- DSSA method that extends the τ-leap idea to the delay setting and avoids drawing insufficient numbers of reactions, a common shortcoming of existing binomial τ-leap methods that becomes evident when dealing with complex chemical interactions. The resulting inaccuracies are most evident in the delayed case, even when considering reaction products as potential reactants within the same time step in which they are produced. Moreover, we extend the framework to account for multicellular systems with different degrees of intercellular communication. We apply these ideas to two important genetic regulatory models, namely, the hes1 gene, implicated as a molecular clock, and a Her1/Her 7 model for coupled oscillating cells.
Resumo:
In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each of the tasks in the composite web services; the other is scheduling the allocated resources when each resource may be used by multiple tasks at different points of time. In addition, Quality-of-Service (QoS) issues, such as execution time and running costs, must be considered in the resource allocation and scheduling problem. Here we present a Cooperative Coevolutionary Genetic Algorithm (CCGA) to solve the deadline-constrained resource allocation and scheduling problem for multiple composite web services. Experimental results show that our CCGA is both efficient and scalable.