نتایج جستجو برای: upper bound method

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

H Haghighat, P Saadati

In this research, flat rolling process of bonded sandwich sheets is investigated by the method of upper bound. A kinematically admissible velocity field is developed for a single layer sheet and is extended into the rolling of the symmetrical sandwich sheets. The internal, shear and frictional power terms are derived and they are used in the upper bound model. Through the analysis, the rolling ...

Modular invarinat, constraints the spectrum of the theory. Using the medum temprature expansion, for first and third order of derivative, a universal upper bound on the lowest primary field has been obtained in recent researches.  In this paper, we will improve the upper bound on the scaling dimension of the lowest primary field. We use by the medium temprature expansion for an arbitrary orders...

Journal: :international journal of advanced design and manufacturing technology 0
alireza naddaf oskouei imam hossein university mohammad reza elhami imam hossein university iman karami fath graduated student

rupture and wrinkling are two prevalent phenomena that happen in hydro-forming process. many efforts have been made to achieve the upper and lower bounds for the pressure related to rupture and wrinkling of sheet, respectively. the aim of this investigation is to improve the upper bound of fluid pressure in hydro-forming process by hemispherical punch. in this article, analytical study of the u...

K. Rezaie, M. M. Lotfi and M. Abadi, M. Rabbani,

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

K. Rezaie, M. M. Lotfi and M. Abadi, M. Rabbani,

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

‎In this paper we give an upper bound for Noetherian dimension of all injective modules with Krull dimension on arbitrary rings‎. ‎In particular‎, ‎we also give an upper bound for Noetherian dimension of all Artinian modules on Noetherian duo rings.

Journal: :international journal of civil engineering 0
o. farzaneh school of civil engineering, faculty of engineering, university of tehran, shanzdah azar avenue, enghelab street, p.o. box: 14155-6457, tehran, iran, f. askari no 21,iiees, west arghavan st, north dibaji st, farmanieh, p.o.box: 3913/19395, tehran, iran, j. fatemi school of civil engineering, faculty of engineering, university of tehran, shanzdah azar avenue, enghelab street, p.o. box: 14155-6457, tehran, iran,

presented is a method of two-dimensional analysis of the active earth pressure due to simultaneous effect of both soil weight and surcharge of strip foundation. the study’s aim is to provide a rigorous solution to the problem in the framework of upper-bound theorem of limit analysis method in order to produce some design charts for calculating the lateral active earth pressure of backfill when ...

Abstract Dempster Shafer theory is the most important method of reviewing uncertainty for information system. This theory as introduced by Dempster using the concept of upper and lower probabilities extended later by Shafer. Another important application of entropy as a basic concept in the information theory  can be used as a uncertainty measurement of the system in specific situation In th...

In this paper, minimizing the number of tardy jobs in two-machine flowshop scheduling with non-simultaneous job entrance is discussed. It is proven that the complexity of the problem is NP_hard. Therefore, a heuristic algorithm is proposed to solve the large scale problems. Besides, an exact branch and bound algorithm with utilizing heuristic algorithm as upper bound proposed to achieve optimal...

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

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