15 resultados para Girolamo, da Schio, Bishop, 1481-1533.

em Boston University Digital Common


Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://www.archive.org/details/hindrancestothew00unknuoft

Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://www.archive.org/details/anheroicbishopli00stocuoft

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Boston University Theology Library

Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://www.archive.org/details/amemoirofedwards00heanuoft

Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://www.archive.org/details/manualofmissions014078mbp

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/wantedleadersstu00bratrich

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/handbooksonmissi01episuoft

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A simple procedure for the isolation of caffeine from energy drinks by solid phase extraction on a C18 cartridge. Quantitative analysis of the amount of caffeine by LC/MS is determined by referencing a standard curve.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Various concurrency control algorithms differ in the time when conflicts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency Control (PCC and OCC) alternatives represent two extremes. PCC locking protocols detect conflicts as soon as they occur and resolve them using blocking. OCC protocols detect conflicts at transaction commit time and resolve them using rollbacks (restarts). For real-time databases, blockages and rollbacks are hazards that increase the likelihood of transactions missing their deadlines. We propose a Speculative Concurrency Control (SCC) technique that minimizes the impact of blockages and rollbacks. SCC relies on the use of added system resources to speculate on potential serialization orders and to ensure that if such serialization orders materialize, the hazards of blockages and roll-backs are minimized. We present a number of SCC-based algorithms that differ in the level of speculation they introduce, and the amount of system resources (mainly memory) they require. We show the performance gains (in terms of number of satisfied timing constraints) to be expected when a representative SCC algorithm (SCC-2S) is adopted.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, we expose an unorthodox adversarial attack that exploits the transients of a system's adaptive behavior, as opposed to its limited steady-state capacity. We show that a well orchestrated attack could introduce significant inefficiencies that could potentially deprive a network element from much of its capacity, or significantly reduce its service quality, while evading detection by consuming an unsuspicious, small fraction of that element's hijacked capacity. This type of attack stands in sharp contrast to traditional brute-force, sustained high-rate DoS attacks, as well as recently proposed attacks that exploit specific protocol settings such as TCP timeouts. We exemplify what we term as Reduction of Quality (RoQ) attacks by exposing the vulnerabilities of common adaptation mechanisms. We develop control-theoretic models and associated metrics to quantify these vulnerabilities. We present numerical and simulation results, which we validate with observations from real Internet experiments. Our findings motivate the need for the development of adaptation mechanisms that are resilient to these new forms of attacks.