a finite volume-lattice boltzmann algorithm is applied to study skin friction behaviour in different channel flows. for this purpose, cell centred scheme is adapted to discretize the boltzmann equation and consistent boundary conditions are also addressed, which resulted in a wider domain of stability. a simulation of flow in a two dimensional channels with different geometries are carried out....

The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...

This paper presents a new model updating approach for structural damage localization and quantification. Based on the Modal Assurance Criterion (MAC), a new damage-sensitive cost function is introduced by employing the main diagonal and anti-diagonal members of the calculated Generalized Flexibility Matrix (GFM) for the monitored structure and its analytical model. Then, ...

In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculation are described completely and the algorithm will be showed as a computer program.

for a uniform distribution of water, decrease in water waste and decrease in erosion of soil, it is important that a land be prepared with proper slopes along its length as well as width. the aim of leveling is to create appropriate slopes for irrigation and drainage on the lands that were not already properly levelled and of the same time creating the level surface with a minimum transport of ...

We introduce a hybrid projection-localization method for solving large convex cone programs. The method interleaves a series of projections onto localization sets with the classical alternating projections method for convex feasibility problems; the problem is made amenable to the method by reducing it to a convex feasibility problem composed of a subspace and a cone via its homogeneous self-du...