• Title/Summary/Keyword: random

Search Result 13,665, Processing Time 0.034 seconds

Random vibration analysis of structures by a time-domain explicit formulation method

  • Su, Cheng;Xu, Rui
    • Structural Engineering and Mechanics
    • /
    • v.52 no.2
    • /
    • pp.239-260
    • /
    • 2014
  • Non-stationary random vibration of linear structures with uncertain parameters is investigated in this paper. A time-domain explicit formulation method is first presented for dynamic response analysis of deterministic structures subjected to non-stationary random excitations. The method is then employed to predict the random responses of a structure with given values of structural parameters, which are used to fit the conditional expectations of responses with relation to the structural random parameters by the response surface technique. Based on the total expectation theorem, the known conditional expectations are averaged to yield the random responses of stochastic structures as the total expectations. A numerical example involving a frame structure is investigated to illustrate the effectiveness of the present approach by comparison with the power spectrum method and the Monte Carlo simulation method. The proposed method is also applied to non-stationary random seismic analysis of a practical arch bridge with structural uncertainties, indicating the feasibility of the present approach for analysis of complex structures.

Properties and Approximation Method of the Random - Request Availability (임의 요구 가용도의 성질과 근사방법)

  • Lee, Kang-W.;Park, Jung-W.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.3
    • /
    • pp.260-266
    • /
    • 2001
  • The characteristic of the random-request availability is that random task arrival is included as one of system elements. If the mean number of task arrivals grows, the computational complexity for deriving the random-request availability becomes extremely high. Using a simulation method, the effect of 'random task arrival' elements on the random-request availability is investigated. Some approximation methods are also discussed.

  • PDF

Note on Fuzzy Random Renewal Process and Renewal Rewards Process

  • Hong, Dug-Hun
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.9 no.3
    • /
    • pp.219-223
    • /
    • 2009
  • Recently, Zhao et al. [Fuzzy Optimization and Decision Making (2007) 6, 279-295] characterized the interarrival times as fuzzy random variables and presented a fuzzy random elementary renewal theorem on the limit value of the expected renewal rate of the process in the fuzzy random renewal process. They also depicted both the interarrival times and rewards are depicted as fuzzy random variables and provided fuzzy random renewal reward theorem on the limit value of the long run expected reward per unit time in the fuzzy random renewal reward process. In this note, we simplify the proofs of two main results of the paper.

Optimization of Random Subspace Ensemble for Bankruptcy Prediction (재무부실화 예측을 위한 랜덤 서브스페이스 앙상블 모형의 최적화)

  • Min, Sung-Hwan
    • Journal of Information Technology Services
    • /
    • v.14 no.4
    • /
    • pp.121-135
    • /
    • 2015
  • Ensemble classification is to utilize multiple classifiers instead of using a single classifier. Recently ensemble classifiers have attracted much attention in data mining community. Ensemble learning techniques has been proved to be very useful for improving the prediction accuracy. Bagging, boosting and random subspace are the most popular ensemble methods. In random subspace, each base classifier is trained on a randomly chosen feature subspace of the original feature space. The outputs of different base classifiers are aggregated together usually by a simple majority vote. In this study, we applied the random subspace method to the bankruptcy problem. Moreover, we proposed a method for optimizing the random subspace ensemble. The genetic algorithm was used to optimize classifier subset of random subspace ensemble for bankruptcy prediction. This paper applied the proposed genetic algorithm based random subspace ensemble model to the bankruptcy prediction problem using a real data set and compared it with other models. Experimental results showed the proposed model outperformed the other models.

Maximal overlap discrete wavelet transform-based power trace alignment algorithm against random delay countermeasure

  • Paramasivam, Saravanan;PL, Srividhyaa Alamelu;Sathyamoorthi, Prashanth
    • ETRI Journal
    • /
    • v.44 no.3
    • /
    • pp.512-523
    • /
    • 2022
  • Random delay countermeasures introduce random delays into the execution flow to break the synchronization and increase the complexity of the side channel attack. A novel method for attacking devices with random delay countermeasures has been proposed by using a maximal overlap discrete wavelet transform (MODWT)-based power trace alignment algorithm. Firstly, the random delay in the power traces is sensitized using MODWT to the captured power traces. Secondly, it is detected using the proposed random delay detection algorithm. Thirdly, random delays are removed by circular shifting in the wavelet domain, and finally, the power analysis attack is successfully mounted in the wavelet domain. Experimental validation of the proposed method with the National Institute of Standards and Technology certified Advanced Encryption Standard-128 cryptographic algorithm and the SAKURA-G platform showed a 7.5× reduction in measurements to disclosure and a 3.14× improvement in maximum correlation value when compared with similar works in the literature.

ITERATIVE ALGORITHM FOR RANDOM GENERALIZED NONLINEAR MIXED VARIATIONAL INCLUSIONS WITH RANDOM FUZZY MAPPINGS

  • Faizan Ahmad, Khan;Eid Musallam, Aljohani;Javid, Ali
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.4
    • /
    • pp.881-894
    • /
    • 2022
  • In this paper, we consider a class of random generalized nonlinear mixed variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings in real Hilbert spaces. We suggest and analyze an iterative algorithm for finding the approximate solution of this class of inclusions. Further, we discuss the convergence analysis of the iterative algorithm under some appropriate conditions. Our results can be viewed as a refinement and improvement of some known results in the literature.

Catalytic Pyrolysis of Miscanthus and Random Polypropylene over SAPO-11 (SAPO-11을 이용한 억새와 Random Polypropylene의 촉매 열분해)

  • Kang, Hyeon Koo;Yu, Mi Jin;Park, Sung Hoon;Jeon, Jong-Ki;Kim, Sang-Chai;Park, Young-Kwon
    • Polymer(Korea)
    • /
    • v.37 no.3
    • /
    • pp.379-386
    • /
    • 2013
  • SAPO-11 was applied for the first time to the catalytic pyrolysis of miscanthus and random polypropylene (random PP). Thermogravimetric analysis confirmed that SAPO-11 promoted the dehydration of miscanthus while suppressing the formation of char. In the pyrolysis of random PP, the decomposition temperature and activation energy were reduced by using a catalyst. A large fraction of levoglucosan, which was the main oxygenate product from the non-catalytic pyrolysis of miscanthus, was converted to high value-added products, such as furans, phenolics and aromatics using SAPO-34. The catalytic pyrolysis of random PP produced gasoline- and diesel-range hydrocarbons.

Random Number Generation using SDRAM (SDRAM을 사용한 난수 발생)

  • Pyo, Chang-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.415-420
    • /
    • 2010
  • Cryptographic keys for security should be generated by true random number generators that apply irreversible hashing algorithms to initial values taken from a random source. As DRAM shows randomness in its access latency, it can be used as a random source. However, systems with synchronous DRAM (SDRAM) do not easily expose such randomness resulting in highly clustered random numbers. We resolved this problem by using the xor instruction. Statistical testing shows that the generated random bits have the quality comparable to true random bit sequences. The performance of bit generation is at the order of 100 Kbits/sec. Since the proposed random number generation requires neither external devices nor any special circuits, this method may be used in any computing device that employs DRAM.

A case study on the random coefficient model for diet experimental data (변량계수모형의 식이요법 실험자료에 관한 사례연구)

  • Jo, Jin-Nam;Baik, Jai-Wook
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.5
    • /
    • pp.787-796
    • /
    • 2009
  • A random coefficient model is applied when times of the repeated measurements are not fixed in experiments with respect to the subjects. The procedures of the inference of a random coefficient model are same as those of a mixed model. Diet experimental data was used for applying the random coefficient model. Various random coefficient models are investigated for the experimental data, and are compared each other. Finally, optimal random coefficient model would be selected. It resulted from the analysis that for the fixed effect factor, the baseline, treatment, height, and time effect were very significant. The treatment effect of the diet foods and exercises were more effective in losing weight than the effect of the diet foods only. The fixed cubic time effect was very significant. The variance components corresponding to the subject effect, linear time effect, quadratic time effect, and cubic time effect of the random coefficients are all positive. When quartic time effect was added as random coefficients the model did not converge. Thus random coefficients up to the cubic terms was considered as the optimal model.

  • PDF

Estimation of the Random Error of Eddy Covariance Data from Two Towers during Daytime (주간에 두 타워로부터 관측된 에디 공분산 자료의 확률 오차의 추정)

  • Lim, Hee-Jeong;Lee, Young-Hee;Cho, Changbum;Kim, Kyu Rang;Kim, Baek-Jo
    • Atmosphere
    • /
    • v.26 no.3
    • /
    • pp.483-492
    • /
    • 2016
  • We have examined the random error of eddy covariance (EC) measurements on the basis of two-tower approach during daytime. Two EC towers were placed on the grassland with different vegetation density near Gumi-weir. We calculated the random error using three different methods. The first method (M1) is two-tower method suggested by Hollinger and Richardson (2005) where random error is based on differences between simultaneous flux measurements from two towers in very similar environmental conditions. The second one (M2) is suggested by Kessomkiat et al. (2013), which is extended procedure to estimate random error of EC data for two towers in more heterogeneous environmental conditions. They removed systematic flux difference due to the energy balance deficit and evaporative fraction difference between two sites before determining the random error of fluxes using M1 method. Here, we introduce the third method (M3) where we additionally removed systematic flux difference due to available energy difference between two sites. Compared to M1 and M2 methods, application of M3 method results in more symmetric random error distribution. The magnitude of estimated random error is smallest when using M3 method because application of M3 method results in the least systematic flux difference between two sites among three methods. An empirical formula of random error is developed as a function of flux magnitude, wind speed and measurement height for use in single tower sites near Nakdong River. This study suggests that correcting available energy difference between two sites is also required for calculating the random error of EC data from two towers at heterogeneous site where vegetation density is low.