Sentence examples for instances of 3 from inspiring English sources

For convenience, in the 5 instances of 3 simultaneous serotypes in a sample, the rarest of the 3 isolates was omitted in the subsequent analyses.

In the BxH cross, which contained the majority of CEGs, we observed the instances of 3 or 4 tandem CEGs having the same sign of their cis-eQTLs.

Direct hand contact with the water faucet after hand hygiene occurred in 99% (1223/1237) of attempts in which running water was used, including 19 instances of 3 different individuals in 2 separate clinics in which ABHR was used at a sink in place of soap.

Screen-positive laboratory investigations were: 44 (9.3%) instances of thrombocytopaenia (<150×10/L), 9 instances (1.9%) of renal impairment (creatinine >90 µmol/L), 35 instances (7.4%) of elevated ALT, 8 instances (1.7%) of elevated GGT and 163 instances (35%) of proteinuria (spot protein to creatinine ratio of 0.03 mg/mmol or more).

By the surface-based approach the satisfiable instances of 3-SAT would be misdetermined to be unsatisfiable.

Schrag and Crawford (1996) present strong experimental evidence that the occurrence of prime implicates of varying lengths in random instances of 3-SAT exhibits behaviour similar to the well-known phase transition phenomenon associated with satisfiability.

For instances of 3-SAT, Schrag and Crawford (1996) examine with what probability the longest prime implicate has length k (for k ⩾ 0 unsatisfiable formulae correspond to those having only a prime implicate of length 0 demonstrating that similar behaviour arises.

Thus, as the ratio of number of clauses (m) to number of prepositional variables (n) increases, random instances of 3-SAT progress from formulae which are generally satisfiable through to formulae which are generally not satisfiable, with an apparent sharp threshold being crossed when m/n ∼ 4.2.

By using the error model we argue that no matter how large the "mark" and "destroy" rates are we can always give satisfiable instances of 3-SAT such that no DNA strands remain on the surface at the end of the computation.

Furthermore, given the "mark" rate p and the "not-destroy" rate ρ, we find that the approach can only solve at most N-variable instances of 3-SAT problems, where N="[(2+β2+21+2β2)/β2] in which β="1−1/(p+ρq) and q="1−p and [a] is the greatest integer less than a or equal to a.

Instances of [*866] entire sentences quoted are not so common, though there are several of them.