In the present study, a spectral finite element method is developed for free and forced transverse vibration of Levy-type moderately thick rectangular orthotropic plates based on first-order shear deformation theory. Levy solution assumption was used to convert the two-dimensional problem into a one-dimensional problem. In the first step, the governing out-of-plane differential equations are tr...

In this paper a numerical approach of the elasto-plastic problem with mixed hardening in the plane stress state, within the classical constitutive framework of small deformation, is proposed. In the formalized problem, the non-zero normal component of the strain (namely, the component in the direction perpendicular to the plane of stress) is considered to be compatible with the plane stress. We...

Introduction: While the necessity of replacing voxels with blobs in conventional tomographic reconstruction based upon line-integrals is clear, it is not however well-investigated in plane- integral-based reconstruction. The problem is more challenging in convergent-plane projection reconstruction. In this work, we are aiming at utilizing blobs as alternative to voxels. <stron...

A “based” plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations with at most n vertices. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the ...

in the present study, a spectral finite element method is developed for free and forced transverse vibration of levy-type moderately thick rectangular orthotropic plates based on first-order shear deformation theory. levy solution assumption was used to convert the two-dimensional problem into a one-dimensional problem. in the first step, the governing out-of-plane differential equations are tr...

in this paper, we consider a special case of weber location problem which we call goal location problem. the weber location problem asks to find location of a point in the plane such that the sum of weighted distances between this point and n existing points is minimized. in the goal location problem each existing point pi has a relevant radius ri and it’s ideal for us to locate a new facility o...