• Journal of the Korean Society of Safety
• /
• v.35 no.1
• /
• pp.62-69
• /
• 2020

Most people suffer from stress during day life because modernized society is very complex and changes fast. Because stress can affect to many kind of physiological phenomena it is even considered as a disease. Therefore, it should be detected earlier, then must be released. When a person is being stressed several bio-signals such as heart rate, etc. are changed. So, those can be detected using medical electronics techniques. In this paper, stress assessment system is studied using random forest algorithm based on heart rate, RR interval and Galvanic skin response. The random forest model was trained and tested using the data set obtained from the bio-signals. It is found that the stress assessment procedure developed in this paper is very useful.

• Structural Engineering and Mechanics
• /
• v.31 no.6
• /
• pp.737-749
• /
• 2009

The problem of estimating the dynamic response of a distributed parameter system excited by a moving vehicle with random initial velocity and random vehicle body mass is investigated. By adopting the Galerkin's method and modal analysis, a set of approximate governing equations of motion possessing time-dependent uncertain coefficients and forcing function is obtained, and then the dynamic response of the coupled system can be calculated in deterministic sense. The statistical characteristics of the responses of the system are computed by using improved perturbation approach with respect to mean value. This method is simple and useful to gather the stochastic structural response due to the vehicle-passenger-bridge interaction. Furthermore, some of the statistical numerical results calculated from the perturbation technique are checked by Monte Carlo simulation.

• Journal of the Korean Statistical Society
• /
• v.27 no.4
• /
• pp.407-420
• /
• 1998

This paper is concerned with selecting covariates to be included in building linear random effects models designed to analyze clustered response normal data. It is based on a Bayesian approach, intended to propose and develop a procedure that uses probabilistic considerations for selecting premising subsets of covariates. The approach reformulates the linear random effects model in a hierarchical normal and point mass mixture model by introducing a set of latent variables that will be used to identify subset choices. The hierarchical model is flexible to easily accommodate sign constraints in the number of regression coefficients. Utilizing Gibbs sampler, the appropriate posterior probability of each subset of covariates is obtained. Thus, In this procedure, the most promising subset of covariates can be identified as that with highest posterior probability. The procedure is illustrated through a simulation study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2317-2337
• /
• 2015

Cryptography provides an effective solution to secure the communication over public networks. The communication over public networks that includes electronic commerce, business and military services, necessitates the requirement of simple and robust encryption techniques. In this paper, a novel image encryption method which employs calligraphy based hybrid scan and random number is presented. The original image is scrambled by pixel position permutation with calligraphy based diagonal and novel calligraphy based scan patterns. The cipher image is obtained by XORing the scrambled image with random numbers. The suggested method resists statistical, differential, entropy, and noise attacks which have been demonstrated with a set of standard images.

• Journal of the Korea Society for Simulation
• /
• v.9 no.4
• /
• pp.1-10
• /
• 2000

One of the primary goals of the simulation experiments is to understand the overall system behavior and to analyze the system, ultimately to optimize the system. Optimizing the system includes determining the optimum condition of the system parameters of interest. This paper is concerned with the simulation methodology for estimating the unknown objective function for the system of interest and optimizing the system with respect to the controllable factors. In the process of estimating the unknown objective function, which is assumed to be a second order spline function, we use common random numbers for different set of the controllable factors resulting in more accurate parameter estimation for the objective function. We will show some mathematical result for the benefit of using common random numbers.

• Journal of the Korea Society for Simulation
• /
• v.10 no.4
• /
• pp.41-50
• /
• 2001

When optimizing a complex system by determining the optimum condition of the system parameters of interest, we often employ the process of estimating the unknown objective function, which is assumed to be a second order spline function. In doing so, we normally use common random numbers for different set of the controllable factors resulting in more accurate parameter estimation for the objective function. In this paper, we will show some mathematical result for the analysis of variance when using common random numbers in terms of the regression error, the residual error and the pure error terms. In fact, if we can realize the special structure of the covariance matrix of the error terms, we can use the result of analysis of variance for the uncorrelated experiments only by applying minor changes.

• Transactions on Electrical and Electronic Materials
• /
• v.7 no.4
• /
• pp.210-214
• /
• 2006

In this paper, two sampling methods which are Latin hypercube sampling (LHS) and simple random sampling were. compared to improve the modeling speed of neural network model. Sampling method was used to generate initial weights and bias set. Electrical characteristic data for $HfO_2$ thin film was used as modeling data. 10 initial parameter sets which are initial weights and bias sets were generated using LHS and simple random sampling, respectively. Modeling was performed with generated initial parameters and measured epoch number. The other network parameters were fixed. The iterative 20 minimum epoch numbers for LHS and simple random sampling were analyzed by nonparametric method because of their nonnormality.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.243-248
• /
• 2021

Although many different types of covert channels have been suggested in the literature, there are little work in directly applying game theory to building up covert channel. This is because researchers have mainly focused on tailoring game theory for covert channel analysis, identification, and covert channel problem solving. Unlike typical adaptation of game theory to covert channel, we show that game theory can be utilized to establish a new type of covert channel in IoT devices. More specifically, we propose a covert channel that can be constructed by utilizing the Nash Equilibrium with sensor data collected from IoT devices. For covert channel construction, we set random seed to the value of sensor data and make payoff from random number created by running pseudo random number generator with the configured random seed. We generate I × J (I ≥ 2, J ≥ 2) matrix game with these generated payoffs and attempt to obtain the Nash Equilibrium. Covert channel construction method is distinctly determined in accordance with whether or not to acquire the Nash Equilibrium.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.816-839
• /
• 2023

In a random vector functional link (RVFL) network, shortcomings such as local optimal stagnation and decreased convergence performance cause a reduction in the accuracy of illumination correction by only inputting the weights and biases of hidden neurons. In this study, we proposed an improved regularized random vector functional link (RRVFL) network algorithm with an optimized grey wolf optimizer (GWO). Herein, we first proposed the moth-flame optimization (MFO) algorithm to provide a set of excellent initial populations to improve the convergence rate of GWO. Thereafter, the MFO-GWO algorithm simultaneously optimized the input feature, input weight, hidden node and bias of RRVFL, thereby avoiding local optimal stagnation. Finally, the MFO-GWO-RRVFL algorithm was applied to ameliorate the performance of illumination correction of various test images. The experimental results revealed that the MFO-GWO-RRVFL algorithm was stable, compatible, and exhibited a fast convergence rate.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.191-209
• /
• 2008

In this paper, we model grain boundary evolution based on a multiple level set method. Grain boundary migration under a curvature-induced driving force is considered and the level set method is employed to deal with the resulting topological changes of grain structures. The complexity of using a level set method for modeling grain structure evolution is due to its N-phase nature and the associated geometry compatibility constraint. We employ a multiple level set method with a predictor-multicorrectors approach to reduce the gaps in the triple junctions down to the grid resolution level. A ghost cell approach for imposing periodic boundary conditions is introduced without solving a constrained problem with a Lagrange multiplier method or a penalty method. Numerical results for both uniform and random grain structures evolution are presented and the results are compared with the solutions based on a front tracking approach (Chen and Kotta et al. 2004b).