Estimation of dynamic stress spectrum distribution in structural fatigue test
نویسندگان
چکیده
منابع مشابه
Marginal Distribution in Copula Estimation of Distribution Algorithm Based Dynamic K-S test
Estimation of distribution algorithms based on copula, and a number of different distribution functions were selected as the dimension of the marginal distribution function by applying K-S test. Dynamic K-S test, that is, dynamic adjust frequency of K-S test in different stages. In the estimation of the probability model stage, according to the actual distribution of the dominant group respect...
متن کاملSub-structural Niching in Estimation Distribution Algorithms
We propose a sub-structural niching method that fully exploits the problem decomposition capability of linkagelearning methods such as the estimation distribution algorithms and concentrate on maintaining diversity at the sub-structural level. The proposed method consists of three key components: (1) Problem decomposition and sub-structure identification, (2) sub-structure fitness estimation, a...
متن کاملt-Test in Dynamic Panel Structural Equations∗
abstract This paper studies the asymptotic covariance estimation associated with the LIML estimator for large-T dynamic panel structural equations. The proposed simple estimation method is based on the fixed-N or large Kasymptotics relating to the number of backward-filtered instruments. We demonstrate the resulting t-Test which also does not need asymptotic bias correction works well with the ...
متن کاملOptimization of an Accelerated Step-Stress Fatigue Test Plan
The design of a component subjected to fatigue requires an experimental qualification of the couple material/process fatigue characteristics. The current industrial requirements involve that this qualification has to be carried out on the smallest possible number of tests and within the smallest possible testing time to censorship. In the same time, the accuracy of estimations has to remain sig...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical and Applied Mechanics Letters
سال: 2013
ISSN: 2095-0349
DOI: 10.1063/2.1302110