• Title/Summary/Keyword: random weighted

Search Result 268, Processing Time 0.026 seconds

Robust design of liquid column vibration absorber in seismic vibration mitigation considering random system parameter

  • Debbarma, Rama;Chakraborty, Subrata
    • Structural Engineering and Mechanics
    • /
    • v.53 no.6
    • /
    • pp.1127-1141
    • /
    • 2015
  • The optimum design of liquid column dampers in seismic vibration control considering system parameter uncertainty is usually performed by minimizing the unconditional response of a structure without any consideration to the variation of damper performance due to uncertainty. However, the system so designed may be sensitive to the variations of input system parameters due to uncertainty. The present study is concerned with robust design optimization (RDO) of liquid column vibration absorber (LCVA) considering random system parameters characterizing the primary structure and ground motion model. The RDO is obtained by minimizing the weighted sum of the mean value of the root mean square displacement of the primary structure as well as its standard deviation. A numerical study elucidates the importance of the RDO procedure for design of LCVA system by comparing the RDO results with the results obtained by the conventional stochastic structural optimization procedure and the unconditional response based optimization.

ON THE HAJECK-RENYI-TYPE INEQUALITY FOR $\tilde{\rho}$-MIXING SEQUENCES

  • Choi, Jeong-Yeol;Baek, Jong-Il
    • Honam Mathematical Journal
    • /
    • v.30 no.3
    • /
    • pp.479-486
    • /
    • 2008
  • Let {${\Omega}$, F, P} be a probability space and {$X_n{\mid}n{\geq}1$} be a sequence of random variables defined on it. We study the Hajeck-Renyi-type inequality for p..mixing random variable sequences and obtain the strong law of large numbers by using this inequality. We also consider the strong law of large numbers for weighted sums of ${\tilde{\rho}}$-mixing sequences.

A Study on the Stochastic Finite Element Method for Dynamic Problem of Nonlinear Continuum

  • Wang, Qing;Bae, Dong-Myung
    • Journal of Ship and Ocean Technology
    • /
    • v.12 no.2
    • /
    • pp.1-15
    • /
    • 2008
  • The main idea of this paper introduce stochastic structural parameters and random dynamic excitation directly into the dynamic functional variational formulations, and developed the nonlinear dynamic analysis of a stochastic variational principle and the corresponding stochastic finite element method via the weighted residual method and the small parameter perturbation technique. An interpolation method was adopted, which is based on representing the random field in terms of an interpolation rule involving a set of deterministic shape functions. Direct integration Wilson-${\theta}$ Method was adopted to solve finite element equations. Numerical examples are compared with Monte-Carlo simulation method to show that the approaches proposed herein are accurate and effective for the nonlinear dynamic analysis of structures with random parameters.

Machine Learning Model for Predicting the Residual Useful Lifetime of the CNC Milling Insert (공작기계의 절삭용 인서트의 잔여 유효 수명 예측 모형)

  • Won-Gun Choi;Heungseob Kim;Bong Jin Ko
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.1
    • /
    • pp.111-118
    • /
    • 2023
  • For the implementation of a smart factory, it is necessary to collect data by connecting various sensors and devices in the manufacturing environment and to diagnose or predict failures in production facilities through data analysis. In this paper, to predict the residual useful lifetime of milling insert used for machining products in CNC machine, weight k-NN algorithm, Decision Tree, SVR, XGBoost, Random forest, 1D-CNN, and frequency spectrum based on vibration signal are investigated. As the results of the paper, the frequency spectrum does not provide a reliable criterion for an accurate prediction of the residual useful lifetime of an insert. And the weighted k-nearest neighbor algorithm performed best with an MAE of 0.0013, MSE of 0.004, and RMSE of 0.0192. This is an error of 0.001 seconds of the remaining useful lifetime of the insert predicted by the weighted-nearest neighbor algorithm, and it is considered to be a level that can be applied to actual industrial sites.

Efficient Security Mechanism using Light-weight Data Origin Authentication in Sensor Networks (경량화 데이터 origin 인증을 통한 효율적인 센서 네트워크 보안에 관한 연구)

  • Park, Min-Ho;Lee, Chung-Keun;Son, Ju-Hyung;Seo, Seung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7A
    • /
    • pp.717-723
    • /
    • 2007
  • There are many weaknesses in sensor networks due to hardware limitation of sensor nodes besides the vulnerabilities of a wireless channel. In order to provide sensor networks with security, we should find out the approaches different from ones in existing wireless networks; the security mechanism in sensor network should be light-weighted and not degrade network performance. Sowe proposed a novel data origin authentication satisfying both of being light-weighted and maintaining network performance by using Unique Random Sequence Code. This scheme uses a challenge-response authentication consisting of a query code and a response code. In this paper, we show how to make a Unique Random Sequence Code and how to use it for data origin authentication.

Efficient Security Mechanism using Light-weight Data Origin Authentication in Sensor Networks (경량화 데이터 Origin 인증을 통한 효율적인 센서 네트워크 보안에 관한 연구)

  • Park, Min-Ho;Lee, Chung-Keun;Son, Ju-Hyung;Seo, Seung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5A
    • /
    • pp.402-408
    • /
    • 2007
  • There are many weaknesses in sensor networks due to hardware limitation of sensor nodes besides the vulnerabilities of a wireless channel. In order to provide sensor networks with security, we should find out the approaches different from ones in existing wireless networks; the security mechanism in sensor network should be light-weighted and not degrade network performance. Sowe proposed a novel data origin authentication satisfying both of being light-weighted and maintaining network performance by using Unique Random Sequence Code. This scheme uses a challenge-response authentication consisting of a query code and a response code. In this paper, we show how to make a Unique Random Sequence Code and how to use it for data origin authentication.

MEAN CONVERGENCE THEOREMS AND WEAK LAWS OF LARGE NUMBERS FOR DOUBLE ARRAYS OF RANDOM ELEMENTS IN BANACH SPACES

  • Dung, Le Van;Tien, Nguyen Duy
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.3
    • /
    • pp.467-482
    • /
    • 2010
  • For a double array of random elements {$V_{mn};m{\geq}1,\;n{\geq}1$} in a real separable Banach space, some mean convergence theorems and weak laws of large numbers are established. For the mean convergence results, conditions are provided under which $k_{mn}^{-\frac{1}{r}}\sum{{u_m}\atop{i=1}}\sum{{u_n}\atop{i=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in $L_r$ (0 < r < 2). The weak law results provide conditions for $k_{mn}^{-\frac{1}{r}}\sum{{T_m}\atop{i=1}}\sum{{\tau}_n\atop{j=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in probability where {$T_m;m\;{\geq}1$} and {${\tau}_n;n\;{\geq}1$} are sequences of positive integer-valued random variables, {$k_{mn};m{{\geq}}1,\;n{\geq}1$} is an array of positive integers. The sharpness of the results is illustrated by examples.

Machine-printed Numeral Recognition using Weighted Template Matching with Chain Code Trimming (체인 코드 트리밍과 가중 원형 정합을 이용한 인쇄체 숫자 인식)

  • Jung, Min-Chul
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.4
    • /
    • pp.35-44
    • /
    • 2007
  • This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

  • PDF

Stability analysis of closely-spaced tunnel using RFEM (확률유한요소 해석에 의한 근접터널 안정성 분석)

  • Kim, Sang-Gyun
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.10 no.4
    • /
    • pp.349-360
    • /
    • 2008
  • In this paper, the modeling procedure of random field with an elasto-plastic finite element algorithm and probability of failure on closely-spaced tunnel were investigated. Local average subdivision (LAS) method which can generate discrete random variables fast and accurately as well as change the resolution in certain region was used. And correlated value allocating and weighted average method were suggested to implement geometrical characteristics of tunnel. After the probability of failure on the test problem was thoroughly investigated using random finite element method, the results were compared with the deterministic strength reduction factor method and single random variable method. Of particular importance in this work, is the conclusion that the probability of failure determined by simplified probabilistic analysis, in which spatial variability is ignored by assuming perfect correlation, can be estimated from the safety factor determined by strength reduction factor method. Also, single random variable method can lead to unconservative estimates of the probability of failure.

  • PDF

Elite-initial population for efficient topology optimization using multi-objective genetic algorithms

  • Shin, Hyunjin;Todoroki, Akira;Hirano, Yoshiyasu
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.14 no.4
    • /
    • pp.324-333
    • /
    • 2013
  • The purpose of this paper is to improve the efficiency of multi-objective topology optimization using a genetic algorithm (GA) with bar-system representation. We proposed a new GA using an elite initial population obtained from a Solid Isotropic Material with Penalization (SIMP) using a weighted sum method. SIMP with a weighted sum method is one of the most established methods using sensitivity analysis. Although the implementation of the SIMP method is straightforward and computationally effective, it may be difficult to find a complete Pareto-optimal set in a multi-objective optimization problem. In this study, to build a more convergent and diverse global Pareto-optimal set and reduce the GA computational cost, some individuals, with similar topology to the local optimum solution obtained from the SIMP using the weighted sum method, were introduced for the initial population of the GA. The proposed method was applied to a structural topology optimization example and the results of the proposed method were compared with those of the traditional method using standard random initialization for the initial population of the GA.