Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Graph”

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.

At least 1,189 records · Page 66Linked to original sources
PubMed1993

[A comparative study on the nasolance and graph pattern of cleft palate patients before and after operation].

The aim of the present study is to compare the nasolance score and graphic pattern of the nasometric registration before and after cleft palate repair. Sixty cleft palate patients were studied with nasometer. One month after operation the nasolance is significantly lower as compared with the preoperation sequence and the number of "up and down" pattern has increased significantly. These results indicate that the velopharygeal function starts to recover one month after operation and the speech training can be given at the mean time. The speech results should be assessed at least three months after operation.

Adolescent↗
PubMed1995

[A retrospective comparison between clinical cases and graphs of biorhythms].

The present article develops the hypothesis of the biorhythms in a retrospective study of 50 normal parturitions, 13 premature births of dead fetuses, 9 premature rip off of the placenta, 4 caesarean sections with spinal anaesthesia and unmotivated high arterial pressure and 2 cases of clinical death, one of which treated successfully to life again. The results show high mathematical probability, i.e. 53% of all the incidents had happened exactly in the most critical days. The authors consider correctly that a number of preliminary planed surgical interventions could be in conformity not only with the determined by the biorhythms days but with the most convenient for the patient hour, too. And this is a routine already in a lot of western countries, and especially in the fields of oncological surgery.

Cesarean Section↗
PubMed1996

[Proposition of chemical topology of principal antiviral molecules by a multiparameter mathematic model: the minimal length graph].

The developed formula of some 200 antiviral molecules were treated by molecular connectivity matrix method. This technic allows the search and the automatically count of structural binary fragments of these molecules. It has been possible to establish a spanning tree (Prim's arborescent squeleton) which gathers the different molecules and permits to put a priori some new structures.

Antiviral Agents↗
PubMedDate not supplied

[Children with nutritional risk: evaluation of graphs in order to follow growth in a basic health unit of Ribeirao Preto].

This study was realized with 6 children until 36 months of age enrolled in the Nourishing Suplementation Program of the Basic Health Unit in Ribeirão Preto where the analises of the growing, the intercurrencies of health problems and interviews with mothers allowed us to caracterize the child with nutritional risk showing low levels of social economical conditions, high levels of infectious episodes, low level of weigth and stature for the age and the occurrence of several levels of desnutrition in any children studied.

Child Nutrition Disorders↗
PubMed1996

[Evaluation of renal allograft dysfunction employing dynamic SPECT with 99mTc-MAG3 and graph plot analysis].

To estimate renal blood flow and tubular function in transplanted kidneys, we applied the 4 compartments model and the graphic analysis method to 99mTc-MAG3 dynamic SPECT and calculated some parameters, i.e. K1 (renal influx rate constant), K3 (tubular transporting rate constant), Vd12 (intrarenal distribution volume), and others. Twenty-three renal transplant recipients were examined and divided into following 3 groups according to their serum creatinine levels (SCr); Group I: less than 1.3 mg/dl (1.1 +/- 0.3, n = 7), Group II: 1.4-2.5 mg/dl (1.8 +/- 0.3, n = 11), and Group III more than 2.6 mg/dl (3.9 +/- 0.9, n = 5). The K3 value became lower in the order of Group I > II > III, and well correlated with blood urea nitrogen (BUN, r = -0.95, p < 0.001) and creatinine clearance (Ccr, r = 0.78, p < 0.001). The K1 value reduced markedly in Group III despite of no difference between Group I and II. Although the K1 value also correlated with SCr, BUN and Ccr, correlation coefficients were smaller than those with the K3. Effective renal plasma flow derived from K1 and K3 showed a good correlation with the tubular extraction rate by Bubeck's method. From these results and clinical conditions including histopathological findings it is suggested that K1, K3 and Vd12 are useful parameters of renal central arterial blood flow, renal peripheral arteriolar blood flow and renal 99mTc-MAG3 uptake function, respectively.

Adolescent↗
PubMed1997

Multi-body interactions within the graph of protein structure.

We construct a graphical representation of protein structure based on the 3D C-alpha carbon point set, using the Delaunay tessellation to define interacting quadruples of amino acid residues. The tessellation is filtered by two criteria: interaction distance less than 9.5 angstroms and circumsphere radius less than 8.0 angstroms using dataset of 608 protein structures of low mutual sequence identity and a likelihood ratio test, we show that 3-body and 4-body interactions are indeed significant. We identify particular significant three-body interactions by first reducing the dataset to interacting triples, and classifying amino acid residues in a reduced alphabet. Although cystein was previously shown to be a dominant source of 3-body interactions, we now identify additional significant 3-body interactions of charged, hydrophobic and small residues.

Algorithms↗
PubMedDate not supplied

Patients' and physicians' interpretations of graphic data displays.

To assess how patients' and physicians' treatment preferences are influenced by graphic data displays (five-year survival curves), a cross-sectional survey of patients, physicians, and medical students was done in a university-based Department of Veterans Affairs Medical Center. Participants in the study were 119 patients seen in a general medicine clinic, 43 physicians, and 67 medical students. Three five-year survival graphs were used. Each graph contained survival curves for two alternative unidentified treatments for an unidentified medical condition. Graph 1 was a baseline graph used in previous studies of framing effects. Graph 2 contained one survival curve having an area under the curve that was 24% greater than that in graph 1. Graph 3 contained one survival curve that had an area under the curve that was 42% greater than that in graph 1. Respondents were asked to indicate which treatment they preferred for each graph and which aspects of the five-year survival curves most influenced their choices. Respondents did not receive numerical data about the difference between the areas under the two curves. Most patients did not change their preferences across the three graphs. A significantly larger (p < or = 0.0001) proportion of physicians and medical students than of patients changed their preferences across the three graphs.(ABSTRACT TRUNCATED AT 250 WORDS)

Adult↗
PubMed2005

Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.

Many vision tasks can be formulated as graph partition problems that minimize energy functions. For such problems, the Gibbs sampler provides a general solution but is very slow, while other methods, such as Ncut and graph cuts are computationally effective but only work for specific energy forms and are not generally applicable. In this paper, we present a new inference algorithm that generalizes the Swendsen-Wang method to arbitrary probabilities defined on graph partitions. We begin by computing graph edge weights, based on local image features. Then, the algorithm iterates two steps. 1) Graph clustering: It forms connected components by cutting the edges probabilistically based on their weights. 2) Graph relabeling: It selects one connected component and flips probabilistically, the coloring of all vertices in the component simultaneously. Thus, it realizes the split, merge, and regrouping of a "chunk" of the graph, in contrast to Gibbs sampler that flips a single vertex. We prove that this algorithm simulates ergodic and reversible Markov chain jumps in the space of graph partitions and is applicable to arbitrary posterior probabilities or energy functions defined on graphs. We demonstrate the algorithm on two typical problems in computer vision--image segmentation and stereo vision. Experimentally, we show that it is 100-400 times faster in CPU time than the classical Gibbs sampler and 20-40 times faster then the DDMCMC segmentation algorithm. For stereo, we compare performance with graph cuts and belief propagation. We also show that our algorithm can automatically infer generative models and obtain satisfactory results (better than the graphic cuts or belief propagation) in the same amount of time.

Algorithms↗
PubMed2004

Effective use of tables and figures in abstracts, presentations, and papers.

In some situations, tables, graphs, and figures can present certain types of information (including complicated relationships and sequences of events) more clearly and in less space than the same information would require in sentence form. However, do not use tables, graphs, and figures for small amounts of data that could be conveyed clearly and succinctly in a sentence. Also, do not reiterate in sentences the data that are shown in a table, graph, or figure: the point of creating a table or graph or figure is to eliminate that type of sentence from your manuscript. In building a data table you must balance the necessity that the table be complete with the equally important necessity that it not be too complex. Sometimes it is helpful to break a large table into several smaller ones to allow the reader to identify important information easily, but, conversely, it is a common mistake of novice authors to split up into several tables data that belong in one table. In almost all cases, only one table or graph or figure should be included in an abstract, and then only if it can convey essential information in less space and in a more easily interpretable way than the sentence form. For a poster, in almost all instances you should use only one typeface and one font in a table, graph, or figure. In general, do not use bold, italics, or color unless you are presenting a great deal of data and you need to highlight certain data values and you are certain that using bold, italics, or color will improve readability, which is rare. Do not include identical information in a table and a graph/figure. In reporting a clinical trial you will need to include a patient flow chart that identifies the number of patients initially screened for the study, the number of patients who were excluded (and why) after initial screening or in the final analysis, and how many patients entered, exited early, and completed each arm of the study. A treatment protocol should also be described with a flow chart. In preparing a graph the most common error is to include a line that suggests an unsubstantiated extrapolation between or beyond the data points. In selecting the graph's axes, avoid truncating, enlarging, or compressing the axes in ways that might make the graph confusing or misleading. To prepare clear, accurate, easily interpretable tables, graphs, and figures, rely on the rules described in authoritative guides such as the Council of Science Editors' Scientific Style and Format and the American Medical Association's Manual of Style.

Abstracting and Indexing↗