36 resultados para Corpo formalmente real
Resumo:
A question is examined as to estimates of the norms of perturbations of a linear stable dynamic system, under which the perturbed system remains stable in a situation R:here a perturbation has a fixed structure.
Resumo:
The plasma membrane Ca2+ pump is a key regulator of cytosolic free Ca2+. Recent studies have demonstrated the dynamic expression of the plasma membrane Ca2+ pump in a variety of cell types. Furthermore, alterations in plasma membrane calcium pump activity have now been implicated in human disease. In this study, the development of a technique to quantitatively assess mRNA expression of the human plasma membrane Ca2+ ATPase (PMCA1) isoform of the plasma membrane Ca2+ pump, using a real-time reverse transcriptase-polymerase chain reaction (real-time RT-PCR) assay in a human breast epithelial cell line (MCF-7) is described. The sequences of the PMCA1 primers and probe for real-time RT-PCR are presented. The results also indicate that PMCA1 mRNA can be normalized to both 18S ribosomal RNA (18S rRNA) and human glyceraldehyde-3-phosphate dehydrogenase (hGAPDH) in MCF-7 cells. Real-time RT-PCR will be most useful in assessing PMCA1 mRNA expression in cases where only low amounts of RNA are available and/or when numerous samples must be assessed simultaneously. (C) 2001 Elsevier Science Inc. All rights reserved.
Resumo:
Despite their limitations, linear filter models continue to be used to simulate the receptive field properties of cortical simple cells. For theoreticians interested in large scale models of visual cortex, a family of self-similar filters represents a convenient way in which to characterise simple cells in one basic model. This paper reviews research on the suitability of such models, and goes on to advance biologically motivated reasons for adopting a particular group of models in preference to all others. In particular, the paper describes why the Gabor model, so often used in network simulations, should be dropped in favour of a Cauchy model, both on the grounds of frequency response and mutual filter orthogonality.
Resumo:
The detection of Neisseria gonorrhoeae by the polymerase chain reaction (PCR) is now recognized as a sensitive and specific method of diagnosing infection by the organism. In this Study 152 urine specimens were examined for N. gonorrhoeae by a real-time PCR method using the LightCycler platform and results were compared to an in-house PCR assay using an ELISA-based detection method. N. gonorrhoeae DNA was detected in 29 (19%) specimens by LightCycler PCR (LC-PCR) and in 31 (20%) specimens by the in house PCR method. The LightCycler assay proved to be specific and 94% sensitive when compared to the in house PCR method. These features combined with the rapid turn-around time for results makes the LC-PCR particularly suitable for the detection of N. gonorrhoeae in a routine clinical laboratory. (C) 2002 Elsevier Science Inc. All rights reserved.
Resumo:
It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating repetitions. The rule makes use of a Floyd-Hoare-style loop invariant that is maintained by each iteration of the repetition, a Jones-style relation between the pre- and post-states on each iteration, and a deadline specifying an upper bound on the starting time of each iteration. The general rule is proved correct with respect to a predicative semantics. In the case of a terminating repetition the rule reduces to the standard rule extended to handle real time. Other special cases include repetitions whose bodies are guaranteed to terminate, nonterminating repetitions with the constant true as a guard, and repetitions whose termination is guaranteed by the inclusion of a fixed deadline. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.