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

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

2001
Igor Zverovich

Let G and H be graphs. A substitution of H in G instead of a vertex v 2 V (G) is the graph G(v ! H), which consists of disjoint union of H and G ? v with the additional edge-set fxy : x 2 V (H); y 2 N G (v)g. For a hereditary class of graphs P, the substitutional closure of P is deened as the class P consisting of all graphs which can be obtained from graphs in P by repeated substitutions. Let ...

2003
Ron Lifshitz

It is argued that the prevailing definition of quasicrystals, requiring them to contain an axis of symmetry that is forbidden in periodic crystals, is inadequate. This definition is too restrictive in that it excludes an important and interesting collection of structures that exhibit all the well-known properties of quasicrystals without possessing any forbidden symmetries.

2012
YOSHIMI IIJIMA HIROTAKA SAKAUE Yoshimi Iijima

Submitted for the DFD12 Meeting of The American Physical Society Lifetime Characterization of Electro-Luminescence Based Pressure-Sensitive Paint System for Unsteady Flow Field Measurements YOSHIMI IIJIMA, HIROTAKA SAKAUE, JAXA — Electro-luminescence based pressure-sensitive paint (EL-PSP) system uses an EL as an illumination source for a PSP measurement. EL can be directly applied onto a PSP m...

2009
Santiago Arias Ricard González-Cinca

Abstract We performed a characterization of the bubbly and slug flow regimes in minichannels in conditions relevant to microgravity. Two-phase flows were generated on ground by means of a T-junction device (1 mm i.d.), whose operation is independent to changes in gravity level [1]. Air and water were injected at several superficial velocities ranging from 0 up to 2 m/s. The generation and detac...

2014
Ephraim Korach

We consider the maximum integral tWo-Commodity flow problem in augmented planar graphs (i.e., with both source-sink edges added) and provide an o(IVI 2 1ogIVI) algorithm for that problem. Let G = (V, E) be a graph and w : E-t Z+ a weight function. Let T C V be an even subset of the vertices of G. A T-cut is an edge-cutset of the graph which divides T into two odd sets. Lomonosov gave a good cha...

2017
Thorsten M. Leucker Ines Valenta Thomas Hellmut Schindler

Positron emission tomography/computed tomography (PET/CT) applied with positron-emitting flow tracers such as 13N-ammonia and 82Rubidium enables the quantification of both myocardial perfusion and myocardial blood flow (MBF) in milliliters per gram per minute for coronary artery disease (CAD) detection and characterization. The detection of a regional myocardial perfusion defect during vasomoto...

2006
Benjamin Dauvergne Laurent Hascoët

Checkpointing is a technique to reduce the memory consumption of adjoint programs produced by reverse Automatic Differentiation. However, checkpointing also uses a non-negligible memory space for the so-called “snapshots”. We analyze the data-flow of checkpointing, yielding a precise characterization of all possible memory-optimal options for snapshots. This characterization is formally derived...

2007
TIAN MA

In this article, we derive a rigorous characterization of the boundary-layer and interior separations in the Taylor-Couette-Poiseuille (TCP) flow. The results obtained provide a rigorous characterization on how, when and where the propagating Taylor vortices (PTV) are generated. In particular, contrary to what is commonly believed, we show that the PTV do not appear after the first dynamical bi...

2013
Erika A O'Donnell David N Ernst Ravi Hingorani

Over the past 40 years, flow cytometry has emerged as a leading, application-rich technology that supports high-resolution characterization of individual cells which function in complex cellular networks such as the immune system. This brief overview highlights advances in multiparameter flow cytometric technologies and reagent applications for characterization and functional analysis of cells ...

Journal: :Journal of Graph Theory 2015
Eckhard Steffen

The paper characterizes (2t + 1)-regular graphs with circular flow number 2 + 2 2t−1 . For t = 1 this is Tutte’s characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs where a flow number separates the class 1 graphs from the class 2 graphs. We finally state some conjectures and relate them to existing flow-conjectures.

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

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