نتایج جستجو برای: fluid characterization

تعداد نتایج: 590412  

Journal: :Discussiones Mathematicae Graph Theory 2007
Jurriaan Hage Tero Harju

We investigate which switching classes do not contain a bipartite graph. Our final aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. In addition to the odd cycles, we list a number of exceptional cases and prove that these are indeed critically non-bipartite. Finally, we give a number of s...

2012
Monique Laurent Antonios Varvitsiotis

The Gram dimension gd(G) of a graph is the smallest integer k ≥ 1 such that, for every assignment of unit vectors to the nodes of the graph, there exists another assignment of unit vectors lying in R, having the same inner products on the edges of the graph. The class of graphs satisfying gd(G) ≤ k is minor closed for fixed k, so it can characterized by a finite list of forbidden minors. For k ...

Journal: :Discrete Applied Mathematics 1997
John D. Lamb Gregory M. Asher Douglas R. Woodall

Electrical networks are defined and a definition of when a bond graph and an electrical network are equivalent is given. Bond graphs and electrical networks are defined to be primitive if they contain no transformers or gyrators. A bond graph is defined to be realisable if it is equivalent to an electrical network and primitively realisable if it is equivalent to a primitive electrical network....

Journal: :J. Comb. Theory, Ser. B 2003
Benny Sudakov

Let H be a fixed forbidden graph and let f be a function of n: Denote by RTðn;H; f ðnÞÞ the maximum number of edges a graph G on n vertices can have without containing H as a subgraph and also without having at least f ðnÞ independent vertices. The problem of estimating RTðn;H; f ðnÞÞ is one of the central questions of so-called Ramsey–Turán theory. In their recent paper (Discrete Math. 229 (20...

2017
Alexander Gill

Culture-based and genomics methods provide different insights into the nature and behavior of bacteria. Maximizing the usefulness of both approaches requires recognizing their limitations and employing them appropriately. Genomic analysis excels at identifying bacteria and establishing the relatedness of isolates. Culture-based methods remain necessary for detection and enumeration, to determin...

2003
R. Freedman

This paper discusses a new nuclear magnetic resonance (NMR) method that can provide wettability, saturation, and oil viscosity values in rocks partially saturated with oil and brine. The method takes advantage of two new technological advances in NMR well logging—the MRF* Magnetic Resonance Fluid Characterization Method and NMR “diffusion-editing” (DE) pulse sequences. We discuss the principles...

Journal: :Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society 2015
Alain Lebret Yukiko Kenmochi Jérôme Hodel Alain Rahmouni Philippe Decq Éric Petit

Cerebrospinal fluid imaging plays a significant role in the clinical diagnosis of brain disorders, such as hydrocephalus and Alzheimer's disease. While three-dimensional images of cerebrospinal fluid are very detailed, the complex structures they contain can be time-consuming and laborious to interpret. This paper presents a simple technique that represents the intracranial cerebrospinal fluid ...

Journal: :Journal of clinical microbiology 2005
Doris Chibo Michaela A Riddell Mike G Catton Chris J Birch

Expansion of measles molecular surveillance to developing countries where measles is endemic will help facilitate measles control. Limited infrastructure in these areas is a barrier to referral of specimens suitable for measles virus (MV) genotyping. In this study, we demonstrate that oral fluid dried onto filter paper can be used for the detection and characterization of MV strains. Using this...

Journal: :CoRR 2015
Dmitriy S. Malyshev

We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.

Journal: :Discrete Mathematics & Theoretical Computer Science 2000
Elena Barcucci Alberto Del Lungo Elisa Pergola Renzo Pinzani

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید