Because of different behavior of reservoir water and dam material, the determination of hydrodynamic pressure during earthquake is very complicated. Thus, different formulations have been presented for modeling of the dam reservoir system under dynamic loading such as earthquake. These formulations can be categorized into two general groups, which are Lagrangian and Eulerian, each having advant...

An identity of Chung, Graham and Knuth involving binomial coefficients and Eulerian numbers motivates our study of a class of polynomials that we call binomial-Eulerian polynomials. These polynomials share several properties with the Eulerian polynomials. For one thing, they are h-polynomials of simplicial polytopes, which gives a geometric interpretation of the fact that they are palindromic a...

This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an undirected Eulerian graph , a subset =) of the edges in E that require service, and a probability distribution for the number of edges in R that have to be visited in any given instance of the graph, the SETP seeks an a priori Eulerian tour of minimum expected length...

A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian. In this paper, we consider the related notion of a subsemi-eulerian graph, i.e. a graph which is spanned by a supergraph having an open trail containin...

In this paper, we introduce the definitions of Eulerian pair and Hermite-Biehler pair. We also characterize a duality relation between recurrences recurrence systems. This generalizes unifies decompositions several enumerative polynomials, including up-down run polynomials for symmetric groups, alternating hyperoctahedral flag descent groups ascent-plateau Stirling permutations. derive some pro...

Let G be an Eulerian directed graph with an arc-labeling such that arcs going out from the same vertex have di erent labels. In this work, we present an algorithm to construct the Eulerian trail starting at an arbitrary vertex v of minimum lexicographical label among labels of all Eulerian trails starting at this vertex. We also show an application of this algorithm to construct the minimal de ...

In this paper we describe routing functions for optical packets in point-to-point networks. These functions are based on Eulerian tours. We first define different measures to handle the efficiency of this routing. Then, we describe an algorithm to compute these measures. Moreover, we present such an Eulerian routing in the Square Mesh and we prove that the induced paths are close to the optimal...

In this work, we present a Fully Eulerian framework for fluid-structure interaction (fsi) problems coupling the incompressible Navier-Stokes equations with a hyperelastic solid. The Fully Eulerian framework is a monolithic implicit variational formulation for the coupled problem. In contrast to the well-established Arbitrary Lagrangian Eulerian (ALE) coordinates, the Fully Eulerian framework fo...

We completely characterize the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with n!, the factorial function of the infinite Boolean algebra, or 2n−1, the factorial function of the infinite butterfly poset. We also classify the factorial functions for Eulerian Sheffer posets. An Eulerian Sheffer poset with binomial factorial function B(n) = n! has...