Results 1  10
of
435
A Level Set Formulation of Eulerian Interface Capturing Methods for Incompressible Fluid Flows
 JOURNAL OF COMPUTATIONAL PHYSICS 124, 449–464
, 1996
"... A level set formulation is derived for incompressible, immiscible smooths out the front. In the case of irrotational flow, one Navier–Stokes equations separated by a free surface. The interface can reformulate the problem in the boundary integral form is identified as the zero level set of a smoot ..."
Abstract

Cited by 179 (13 self)
 Add to MetaCart
smooth function. Eulerian so that it involves the motion of the free surface alone. In finite difference methods based on this level set formulation are this case, it is possible to design high order accurate methproposed. These methods are robust and efficient and are capable of computing interface
Eulerian models
, 2008
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract
 Add to MetaCart
, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information
Exit Time approach for Lagrangian and Eulerian Turbulence
"... Usually, intermittency in turbulence is studied by looking at the scaling of structure functions of different orders versus time and space separation (Eulerian statistics) or by looking at different moments of particles distance versus time (Lagrangian statistics). Here, we discuss an alternative ap ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
approach in which one analyses the statistical properties of the time necessary to have a fixed velocity fluctuation in the Eulerian case or a fixed distance separation in the Lagrangian case. This method gives good results also at low Reynolds numbers, where the traditional approach for both Eulerian
Reliable Orientations of Eulerian Graphs
, 2006
"... We present a characterization of Eulerian graphs that have a karcconnected orientation so that the deletion of any vertex results in a (k − 1)arcconnected directed graph. This provides an affirmative answer for a conjecture of Frank [2]. The special case, when k = 2, describes Eulerian graphs ad ..."
Abstract
 Add to MetaCart
We present a characterization of Eulerian graphs that have a karcconnected orientation so that the deletion of any vertex results in a (k − 1)arcconnected directed graph. This provides an affirmative answer for a conjecture of Frank [2]. The special case, when k = 2, describes Eulerian graphs
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
 SIAM Journal on Discrete Mathematics
, 1997
"... We analyze the strong relationship among three combinatorial problems, namely the problem of sorting a permutation by the minimum number of reversals (MINSBR), the problem of finding the maximum number of edgedisjoint alternating cycles in a breakpoint graph associated with a given permutation (MA ..."
Abstract

Cited by 64 (9 self)
 Add to MetaCart
(MAXACD), and the problem of partitioning the edge set of a Eulerian graph into the maximum number of cycles (MAXECD). We first illustrate a nice characterization of breakpoint graphs, which leads to a linear time algorithm for their recognition. This characterization is used to prove that MAX
Eulerian secret key exchange
 Proc. COCOON '98, Lecture Notes in Compom  Science,Spnce,v8 vol.1449,p.1449,v9F
, 1998
"... Abstract. Designing a protocol to exchange a secret key is one of the most fundamental subjects in cryptography. Using a random deal of cards, pairs of card players (agents) can share informationtheoretically secure keys that are secret from an eavesdropper. In this paper we first introduce the no ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
the notion of an Eulerian secret key exchange, in which the pairs of players sharing secret keys form an Eulerian circuit passing through all players. Along the Eulerian circuit any designated player can send a message to the rest of players and the message can be finally returned to the sender. Checking
LEVEL EULERIAN POSETS
, 2010
"... The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the longest interval one needs to check to verify Eulerianness. Fu ..."
Abstract
 Add to MetaCart
generating function in the noncommutative variables a and b. In the case the poset is also Eulerian, the analogous result holds for the cdseries. Using coalgebraic techniques a method is developed to recognize the cdseries matrix of a level Eulerian poset.
CRITICAL THRESHOLDS IN EULERIAN DYNAMICS
, 2007
"... In this thesis, we study the critical regularity phenomena in Eulerian dynamics, ut+u ·∇u = F (u,Du, · · ·), here F represents a general force acting on the flow and by regularity we seek to obtain a large set of subcritical initial data. We analyze three prototype models, ranging from the oned ..."
Abstract
 Add to MetaCart
In this thesis, we study the critical regularity phenomena in Eulerian dynamics, ut+u ·∇u = F (u,Du, · · ·), here F represents a general force acting on the flow and by regularity we seek to obtain a large set of subcritical initial data. We analyze three prototype models, ranging from the one
Parameterized Complexity of Eulerian Deletion Problems
 ALGORITHMICA
"... We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge
Dynamics and Dispersion in EulerianEulerian DNS of TwoPhaseFlows By
"... A DNS approach for EulerianEulerian dispersed two phase flows is tested. The need for a subgrid stress term in the dispersed phase momentum equation is identified and a simple model for this stress term allows the calculation of an experimental test case with inertial particles in homogeneous turbu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
A DNS approach for EulerianEulerian dispersed two phase flows is tested. The need for a subgrid stress term in the dispersed phase momentum equation is identified and a simple model for this stress term allows the calculation of an experimental test case with inertial particles in homogeneous
Results 1  10
of
435