As part of a multi-centre European project, FOOD-PCR, the feasibility of a novel approach for production of dried bacterial DNA that could be used as certified reference materials (CRM) was assessed. Selected strains of Salmonella typhimurium, Listeria monocytogenes, Escherichia coli O157, Campylobacter jejuni and Yersinia enterocolitica were used to produce genomic DNA (gDNA). These preparations gave support to method development for qualitative polymerase chain reaction (PCR) detection methods for food-borne pathogens. Purified gDNA was transformed into stable and dry gDNA by using polypropylene vials as carrier and applying a vacuum-drying technique. The gDNA preparations were shown to be sufficiently stable under ambient transport conditions without cooling and proved to have long-term stability at 5°C of at least 22 months. The dried DNA was easily reconstituted by addition of distilled water then gentle shaking. These studies have shown that production of stable and dry bacterial gDNA material is feasible and could help satisfy the increasing need for certified reference DNA positive control samples in the field of PCR testing for detection and verification of food-borne microbial pathogens.
We investigate asymptotic behaviour of solutions of the functional-differentialequation
where f and g arelocally Lipschitz functions, C is a continuous matrix and thesmooth lag function obeys 0 (t) t for t 0. We transformthe equation into a delay equation with an infinity of delaysand use a theorem of Söderlind to derive sufficient conditionsfor stability and for asymptotic stability in the case limt(t) = . The situation is qualitatively different when limt(t) = * < and we outline stability conditions for thatcase by employing direct techniques. 相似文献
In this paper, we examine three algorithms in the ABS family and consider their storage requirements on sparse band systems. It is shown that, when using the implicit Cholesky algorithm on a band matrix with band width 2q+1, onlyq additional vectors are required. Indeed, for any matrix with upper band widthq, onlyq additional vectors are needed. More generally, ifakj0,j>k, then thejth row ofHi is effectively nonzero ifj>i>k. The arithmetic operations involved in solving a band matrix by this method are dominated by (1/2)n2q. Special results are obtained forq-band tridiagonal matrices and cyclic band matrices.The implicit Cholesky algorithm may require pivoting if the matrixA does not possess positive-definite principal minors, so two further algorithms were considered that do not require this property. When using the implicit QR algorithm, a matrix with band widthq needs at most 2q additional vectors. Similar results forq-band tridiagonal matrices and cyclic band matrices are obtained.For the symmetric Huang algorithm, a matrix with band widthq requiresq–1 additional vectors. The storage required forq-band tridiagonal matrices and cyclic band matrices are again analyzed.This work was undertaken during the visit of Dr. J. Abaffy to Hatfield Polytechnic, sponsored by SERC Grant No. GR/E-07760. 相似文献
Abstract An investigation of the effects of changing the nature of X, nitrogen base (B), and amino substituent (R2N) on the equilibrium 1?2 was carried out. The influence of the above structural changes on the time-averaged coupling constants JAP and JBP, determined at 300 MHz, were used to follow changes in Keq. With constant R2N, small effects from variation of X and B were found. A large range in Keq arose from changes in the steric size of R2N. These results will be related to the question of the ease of chair to twist interconversion of the phosphate ring essential to the biological activities of the naturally occurring diesters, cAMP and cGMP. 相似文献
Let F(n,r,k) denote the maximum possible number of distinctedge-colorings of a simple graph on n vertices with r colorswhich contain no monochromatic copy of Kk. It is shown thatfor every fixed k and all n>n0(k), and , where tk1(n)is the maximum possible number of edges of a graph on n verticeswith no Kk (determined by Turán's theorem). The caser=2 settles an old conjecture of Erds and Rothschild, whichwas also independently raised later by Yuster. On the otherhand, for every fixed r>3 and k>2, the function F(n,r,k)is exponentially bigger than . The proofs are based on Szemerédi's regularity lemmatogether with some additional tools in extremal graph theory,and provide one of the rare examples of a precise result provedby applying this lemma. 相似文献
We prove Pach-Sharir type incidence theorems for a class of curves in Rn and surfaces in R3, which we call pseudoflats}. In particular, our results apply to a
wide class of generic irreducible real algebraic sets of bounded degree. 相似文献
A general iterative method is proposed for finding the maximal rootxmax of a one-variable equation in a given interval. The method generates a monotone-decreasing sequence of points converging toxmax or demonstrates the nonexistence of a real root. It is globally convergent. A concrete realization of the general algorithm is also given and is shown to be locally quadratically convergent. Computational experience obtained for eight test problems indicates that the new method is comparable to known methods claiming global convergence. 相似文献
Abstract This review article focuses on the analytical capabilities of glow discharge optical emission spectrometry (GD‐OES) and mass spectrometry (GD‐MS) to perform compositional depth profiling (GD‐CDP). The properties of the Grimm‐type glow discharge as well as basic processes of sputtering are described and their influence on the GD as a surface and interface analytical tool are discussed. A series of examples from recent literature ranging from computer hard disks to molecular monolayers on copper substrates are presented to illustrate the excellent depth resolution that can be achieved with GD surface analytical techniques. The conditions for obtaining nanometer or even atomic‐layer depth resolution are discussed. Following this introduction is the possibilities of the technique a selection of applications principally chosen from our laboratories, demonstrating that GD‐OES and GD‐MS can be successfully employed as an analytical tool assisting the development of new materials and coatings. The applications cover common industrial tasks such as heat treatments, studies of diffusion processes at interfaces, and electrochemical depositions for biocompatible material. However, limitations and known artifacts are also discussed. 相似文献
We introduce and study a class of “maximally clustered” elements for simply laced Coxeter groups. Such elements include as
a special case the freely braided elements of Green and the author, which in turn constitute a superset of the iji-avoiding elements of Fan. We show that any reduced expression for a maximally clustered element is short-braid equivalent
to a “contracted” expression, which can be characterized in terms of certain subwords called “braid clusters”. We establish
some properties of contracted reduced expressions and apply these to the study of Schubert varieties in the simply laced setting.
Specifically, we give a smoothness criterion for Schubert varieties indexed by maximally clustered elements.
Received December 30, 2005 相似文献