Search results
Results from the WOW.Com Content Network
Log reduction is a measure of how thoroughly a decontamination process reduces the concentration of a contaminant. It is defined as the common logarithm of the ratio of the levels of contamination before and after the process, so an increment of 1 corresponds to a reduction in concentration by a factor of 10.
The graph of the logarithm base 2 crosses the x-axis at x = 1 and passes through the points (2, 1), (4, 2), and (8, 3), depicting, e.g., log 2 (8) = 3 and 2 3 = 8. The graph gets arbitrarily close to the y-axis, but does not meet it. Addition, multiplication, and exponentiation are three of the most fundamental arithmetic operations.
What is often called a "log reduction" (technically a reduction by one order of magnitude) represents a 90% reduction in microbial population. Thus a process that achieves a "6-log reduction" (10 −6 ) will theoretically reduce an initial population of one million organisms to very close to zero.
The logarithmic decrement can be obtained e.g. as ln(x 1 /x 3).Logarithmic decrement, , is used to find the damping ratio of an underdamped system in the time domain.. The method of logarithmic decrement becomes less and less precise as the damping ratio increases past about 0.5; it does not apply at all for a damping ratio greater than 1.0 because the system is overdamped.
A serial dilution is the step-wise dilution of a substance in solution, either by using a constant dilution factor, or by using a variable factor between dilutions. If the dilution factor at each step is constant, this results in a geometric progression of the concentration in a logarithmic fashion.
In microbiology, in the context of a sterilization procedure, the D-value or decimal reduction time (or decimal reduction dose) is the time (or dose of an antimicrobial drug) required, at a given condition (e.g. temperature) or set of conditions, to achieve a one-log reduction, that is, to kill 90% of relevant microorganisms. [1]
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Let be a cyclic group of order , and given ,, and a partition =, let : be the map = {and define maps : and : by (,) = {() + (,) = {+ ()input: a: a generator of G b: an element of G output: An integer x such that a x = b, or failure Initialise i ← 0, a 0 ← 0, b 0 ← 0, x 0 ← 1 ∈ G loop i ← i + 1 x i ← f(x i−1), a i ← g(x i−1, a i−1), b i ← h(x i−1, b i−1) x 2i−1 ← ...