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

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

Journal: :iranian journal of chemistry and chemical engineering (ijcce) 2013
mohammad hadi parhamvand shahab gerami mohammad ali emadi

obtaining samples that represent original fluid of reservoirs optimizes reservoirs management. the optimized management increases recovery. also, selecting and performing proper improved oil recovery (ior) or enhance oil recovery (eor) programs depend on collecting representative samples. achieving accurate compositions of original in-situ fluid prevents overdesigning surface facilities. repres...

Journal: :Hypertension 1985
P Needleman S P Adams B R Cole M G Currie D M Geller M L Michener C B Saper D Schwartz D G Standaert

NUMEROUS observations have implicated humoral factors in the homeostatic regulation of fluid and electrolyte balance. This review will focus on a recently discovered peptide that is synthesized and stored in cardiac atrial myocytes and exerts potent, selective, and transient biological effects. Characterization of the cardiac substance has shown that it is not related to endogenous Na,K-ATPase ...

2013
B. Saha S. Batabyal S. Chattopadhyay

○ INTRODUCTION Hydatidosis is a silent, cyclozoonotic and oldest infection of man and domestic animals and is caused by larvae of the cestode, Echinococcus (Bhatia and Pathak, 1990). The infected human beings and animals loose their normal functional capacities leading to huge economic losses. The diagnosis of hydatid disease is based on clinical, radiological, microscopical and immunological m...

2015
Jing Wang Yongqi Fu Zongwei Xu Fengzhou Fang

Many factors influence the near-field visualization of plasmonic structures that are based on perforated elliptical slits. Here, characterization errors are experimentally analyzed in detail from both fabrication and measurement points of view. Some issues such as geometrical parameter, probe-sample surface interaction, misalignment, stigmation, and internal stress, have influence on the final ...

Journal: :Discrete Mathematics 1989
Douglas R. Woodall

For various graph-theoretic properties P that impose upper bounds on the minimum degree or the size of a neighbourhood set, we characterize the class %(P’) (%((P’)) of graphs G such that G and all its subgraphs (subcontractions) have property P. For example, if P is “6 <xn” (6 = minimum degree, n = number of vertices, 0 <X < 1) then S(P’) = F(K,+,), the class of graphs that do not have K,,, as ...

Journal: :Order 2003
Reinhard Diestel Oleg Pikhurko

We study which infinite posets have simple cofinal subsets such as chains, or decompose canonically into such subsets. The posets of countable cofinality admitting such a decomposition are characterized by a forbidden substructure; the corresponding problem for uncountable cofinality remains open.

Journal: :CoRR 2009
Craig Weidert

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered graph as a subgraph. In particular, we take a step toward confirming a conjecture of Pach and Tardos [12] regarding the number of edges allowed when the forbid...

Journal: :Discrete Applied Mathematics 2016
Flavia Bonomo Luciano N. Grippo Martin Milanic Martín Darío Safe

Clique-width is a graph parameter with many algorithmic applications. For a positive integer k, the k-th power of a graph G is the graph with the same vertex set as G, in which two distinct vertices are adjacent if and only if they are at distance at most k in G. Many graph algorithmic problems can be expressed in terms of graph powers. We initiate the study of graph classes of power-bounded cl...

Journal: :Discrete Mathematics 2009
Andrei V. Gagarin Wendy J. Myrvold John Chambers

We prove a precise characterization of toroidal graphs with no K3,3-subdivisions in terms of forbidden minors and subdivisions. The corresponding lists of four forbidden minors and eleven forbidden subdivisions are shown.

Journal: :Discussiones Mathematicae Graph Theory 2009
Ewa Drgas-Burchardt

An additive hereditary graph property is any class of simple graphs, which is closed under isomorphisms unions and taking subgraphs. Let La denote a class of all such properties. In the paper, we consider Hreducible over La properties with H being a fixed graph. The finiteness of the sets of all minimal forbidden graphs is analyzed for such properties.

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

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