SEARCH · Search PubMed
Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
A graphic format is presented for the display and storage of data relating to gestational age. The graph permits rapid retrieval and synthesis of often confusion information and is thereby useful in the management of complicated pregnancies.
This is the first in a series of four articles developed for the readers of. Without language ideas cannot be articulated. What may not be so immediately obvious is that they cannot be formulated either. One of the essential languages of cardiology is mathematics. Unfortunately, medical education does not emphasize, and in fact, often neglects empowering physicians to think mathematically. Reference to statistics, conditional probability, multicompartmental modeling, algebra, calculus and transforms is common but often without provision of genuine conceptual understanding. At the University of Vermont College of Medicine, Professor Bates developed a course designed to address these deficiencies. The course covered mathematical principles pertinent to clinical cardiovascular and pulmonary medicine and research. It focused on fundamental concepts to facilitate formulation and grasp of ideas. This series of four articles was developed to make the material available for a wider audience. The articles will be published sequentially in Coronary Artery Disease. Beginning with fundamental axioms and basic algebraic manipulations they address algebra, function and graph theory, real and complex numbers, calculus and differential equations, mathematical modeling, linear system theory and integral transforms and statistical theory. The principles and concepts they address provide the foundation needed for in-depth study of any of these topics. Perhaps of even more importance, they should empower cardiologists and cardiovascular researchers to utilize the language of mathematics in assessing the phenomena of immediate pertinence to diagnosis, pathophysiology and therapeutics. The presentations are interposed with queries (by Coronary Artery Disease, abbreviated as CAD) simulating the nature of interactions that occurred during the course itself. Each article concludes with one or more examples illustrating application of the concepts covered to cardiovascular medicine and biology.
The analysis of data from automated DNA sequencing instruments has been a limiting factor in the development of new sequencing technology. A new base-calling algorithm that is intended to be independent of any particular sequencing technology has been developed and shown to be effective with data from the Applied Biosystems 373 sequencing system. This algorithm makes use of a nonlinear deconvolution filter to detect likely oligomer events and a graph theoretic editing strategy to find the subset of those events that is most likely to correspond to the correct sequence. Metrics evaluating the quality and accuracy of the resulting sequence are also generated and have been shown to be predictive of measured error rates. Compared to the Applied Biosystems Analysis software, this algorithm generates 18% fewer insertion errors, 80% more deletion errors, and 4% fewer mismatches. The tradeoff between different types of errors can be controlled through a secondary editing step that inserts or deletes base calls depending on their associated confidence values.
It is shown that the theory of stochastic diffusion processes on graphs is a natural tool for the analysis of noise in hysteretic systems. In particular, by using this theory, analytical expressions for stationary characteristics of random outputs of some hysteretic systems are derived.
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of hard spheres of (chemical) radius 1, and they are found to be in excellent agreement with numerical simulations. We give a detailed description of the replica-symmetric phase, including the size and entropy of the minimal vertex covers, and the structure of the unfrozen component which is found to percolate at a connectivity c approximately 1.43. The replica-symmetric solution breaks down at c=e approximately 2.72. We give a simple one-step replica-symmetry-broken solution, and discuss the problems in the interpretation and generalization of this solution.
We study wave function structure for quantum graphs in the chaotic and disordered regime, using measures such as the wave function intensity distribution and the inverse participation ratio. The result is much less ergodicity than expected from random matrix theory, even though the spectral statistics are in agreement with random matrix predictions. Instead, analytical calculations based on short-time semiclassical behavior correctly describe the eigenstate structure.
Recent theoretical studies and extensive data analyses have revealed a common feature displayed by biological, social, and technological networks: the presence of small world patterns. Here we analyze this problem by using several graphs obtained from one of the most common technological systems: electronic circuits. It is shown that both analogic and digital circuits exhibit small world behavior. We conjecture that the small world pattern arises from the compact design in which many elements share a small, close physical neighborhood plus the fact that the system must define a single connected component (which requires shortcuts connecting different integrated clusters). The degree distributions displayed are consistent with a conjecture concerning the sharp cutoffs associated to the presence of costly connections [Amaral et al., Proc. Natl. Acad. Sci. USA 97, 11 149 (2000)], thus providing a limit case for the classes of universality of small world patterns from real, artificial networks. The consequences for circuit design are outlined.
Exact calculations of the Potts model partition function Z(G,q,v) have been presented for arbitrary q and temperature-like variable v on self-dual strip graphs G of the square lattice with fixed width L(y) and arbitrarily great length Lx with two types of boundary conditions. Letting Lx-->infinity, the resultant free energy and complex-temperature phase diagram have been computed, including the locus B where the free energy is nonanalytic. Results are analyzed for widths L(y)=1,2,3. These results have been used to study the approach to the large-q limit of B.
One-flip stable configurations of an Ising model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function with two arguments. The analytical results are compared with numerical simulations.
We discuss the use of a ferromagnetic spin model on a random graph to model granular compaction. A multispin interaction is used to capture the competition between local and global satisfaction of constraints characteristic for geometric frustration. We define an athermal dynamics designed to model repeated taps of a given strength. Amplitude cycling and the effect of permanently constraining a subset of the spins at a given amplitude is discussed. Finally we check the validity of Edwards's hypothesis for the athermal tapping dynamics.
We present exact, explicit, convergent periodic-orbit expansions for individual energy levels of regular quantum graphs in the paper. One simple application is the energy levels of a particle in a piecewise constant potential. Since the classical ray trajectories (including ray splitting) in such systems are strongly chaotic, this result provides an explicit quantization of a classically chaotic system.
It has been suggested that an information geometric view of statistical mechanics in which a metric is introduced onto the space of parameters provides an interesting alternative characterization of the phase structure, particularly in the case where there are two such parameters, such as the Ising model with inverse temperature beta and external field h. In various two-parameter calculable models, the scalar curvature R of the information metric has been found to diverge at the phase transition point beta(c) and a plausible scaling relation postulated: R approximately |beta-beta(c)|(alpha-2). For spin models the necessity of calculating in nonzero field has limited analytic consideration to one-dimensional, mean-field and Bethe lattice Ising models. In this paper we use the solution in field of the Ising model on an ensemble of planar random graphs (where alpha=-1, beta=1/2, gamma=2) to evaluate the scaling behavior of the scalar curvature, and find R approximately |beta-beta(c)|(-2). The apparent discrepancy is traced back to the effect of a negative alpha.
We derive high-temperature series expansions for the free energy and the susceptibility of random-bond q-state Potts models on hypercubic lattices using a star-graph expansion technique. This method enables the exact calculation of quenched disorder averages for arbitrary uncorrelated coupling distributions. Moreover, we can keep the disorder strength p as well as the dimension d as symbolic parameters. By applying several series analysis techniques to the new series expansions, one can scan large regions of the (p,d) parameter space for any value of q. For the bond-diluted four-state Potts model in three dimensions, which exhibits a rather strong first-order phase transition in the undiluted case, we present results for the transition temperature and the effective critical exponent gamma as a function of p as obtained from the analysis of susceptibility series up to order 18. A comparison with recent Monte Carlo data [Chatelain et al., Phys. Rev. E 64, 036120 (2001)] shows signals for the softening to a second-order transition at finite disorder strength.
We present the first quantum system where Anderson localization is completely described within periodic-orbit theory. The model is a quantum graph analogous to an aperiodic Kronig-Penney model in one dimension. The exact expression for the probability to return to an initially localized state is computed in terms of classical trajectories. It saturates to a finite value due to localization, while the diagonal approximation decays diffusively. Our theory is based on the identification of families of isometric orbits. The coherent periodic-orbit sums within these families, and the summation over all families, are performed analytically using advanced combinatorial methods.
In this Letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This transition is characterized by means of exact numerical simulations as well as by analytical replica calculations. The replica symmetric phase diagram is in excellent agreement with numerical findings up to average connectivity e, where replica symmetry becomes locally unstable.
Quantized, compact graphs are excellent paradigms for quantum chaos in bounded systems. Connecting them with leads to infinity, we show that they display all the features which characterize quantum chaotic scattering. We derive exact expressions for the scattering matrix, and an exact trace formula for the density of resonances, in terms of classical orbits, analogous to the semiclassical theory of chaotic scattering. A statistical analysis of the cross sections and resonance parameters compares well with the predictions of random matrix theory. Hence, this system is proposed as a convenient tool to study the generic behavior of chaotic scattering systems and their semiclassical description.
We analytically describe the typical solution time needed by a backtracking algorithm to solve the vertex-cover problem on finite-connectivity random graphs. We find two different transitions: The first one is algorithm dependent and marks the dynamical transition from linear to exponential solution times. The second one gives the maximum computational complexity, and is found exactly at the threshold where the system undergoes an algorithm-independent phase transition in its solvability. Analytical results are corroborated by numerical simulations.
We consider a tapping dynamics, analogous to that in experiments on granular media, on spin glasses and ferromagnets on random thin graphs. Between taps, zero temperature single spin flip dynamics takes the system to a metastable state. Tapping corresponds to flipping simultaneously any spin with probability p. This dynamics leads to a stationary regime with a steady state energy E(p). We analytically solve this dynamics for the one-dimensional ferromagnet and +/-J spin glass. Numerical simulations for spin glasses and ferromagnets of higher connectivity are carried out; in particular, we find a novel first order transition for the ferromagnetic systems.