• Nuclear Engineering and Technology
• /
• v.55 no.6
• /
• pp.1966-1973
• /
• 2023

Virtual reality technology has been widely used in the field of nuclear and radiation safety, dose rate computing in virtual environment is essential for optimizing radiation protection and planning the work in radioactive-controlled area. Because the CPU-based gamma dose rate computing takes up a large amount of time and computing power for voxelization of volumetric radioactive source, it is inefficient and limited in its applied scope. This study is to develop an efficient gamma dose rate computing code and apply into fast virtual simulation. To improve the computing efficiency of the point kernel algorithm in the reference (Li et al., 2020), we design a GPU-based computing framework for taking full advantage of computing power of virtual engine, propose a novel voxelization algorithm of volumetric radioactive source. According to the framework, we develop the GPPK(GPU-based point kernel gamma dose rate computing) code using GPU programming, to realize the fast dose rate computing in virtual world. The test results show that the GPPK code is play and plug for different scenarios of virtual simulation, has a better performance than CPU-based gamma dose rate computing code, especially on the voxelization of three-dimensional (3D) model. The accuracy of dose rates from the proposed method is in the acceptable range.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.454-459
• /
• 2012

A kernel function of apparent earth resistivity can be estimated using the apparent earth resistivity measured with Wenner's 4 point method. It becomes to solve a nonlinear system to estimate the kernel function of apparent earth resistivity. However it is not simple to get solution of nonlinear system with many unknown variables. This paper suggests the method of estimating kernel function by linearizing this nonlinear system. Finally, various examples of earth structure have been simulated to evaluate the proposed method in this paper.

• East Asian mathematical journal
• /
• v.25 no.1
• /
• pp.55-68
• /
• 2009

In this paper we propose new large-update primal-dual inte-rior point algorithms for $P_*(\kappa)$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on the kernel function$\psi(t)=\frac{t^{p+1}-1}{p+1}+\frac{e^{\frac{1}{t}}-e}{e}$,$p{\in}$[0,1]. We showed that if a strictly feasible starting point is available, then the algorithm has $O((1+2\kappa)(logn)^{2}n^{\frac{1}{p+1}}log\frac{n}{\varepsilon}$ complexity bound.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.190-192
• /
• 2008

This paper shows the formulation of fast moving least square reproducing kernel method (FMLSRKM) which is a kind of meshfree methods. FMLSRKM has some advantages compared to conventional numerical techniques such as finite element method. For simple analysis on a rectangular waveguide, point collocation scheme is introduced and applied.

• ETRI Journal
• /
• v.15 no.2
• /
• pp.35-51
• /
• 1993

This paper presents function approximation based on nonparametric estimation. As an estimation model of function approximation, a three layered network composed of input, hidden and output layers is considered. The input and output layers have linear activation units while the hidden layer has nonlinear activation units or kernel functions which have the characteristics of bounds and locality. Using this type of network, a many-to-one function is synthesized over the domain of the input space by a number of kernel functions. In this network, we have to estimate the necessary number of kernel functions as well as the parameters associated with kernel functions. For this purpose, a new method of parameter estimation in which linear learning rule is applied between hidden and output layers while nonlinear (piecewise-linear) learning rule is applied between input and hidden layers, is considered. The linear learning rule updates the output weights between hidden and output layers based on the Linear Minimization of Mean Square Error (LMMSE) sense in the space of kernel functions while the nonlinear learning rule updates the parameters of kernel functions based on the gradient of the actual output of network with respect to the parameters (especially, the shape) of kernel functions. This approach of parameter adaptation provides near optimal values of the parameters associated with kernel functions in the sense of minimizing mean square error. As a result, the suggested nonparametric estimation provides an efficient way of function approximation from the view point of the number of kernel functions as well as learning speed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.2
• /
• pp.93-111
• /
• 2010

The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.1
• /
• pp.79-87
• /
• 2012

In the case that the probability density function has a discontinuity point, Huh (2002) estimated the location and jump size of the discontinuity point based on the difference between the right and left kernel density estimators using the one-sided kernel function. In this paper, we consider the cross-validation, made by the right and left maximum likelihood cross-validations, for the bandwidth selection in order to estimate the location and jump size of the discontinuity point. This method is motivated by the one-sided cross-validation of Hart and Yi (1998). The finite sample performance is illustrated by simulated example.

• Progress in Medical Physics
• /
• v.15 no.2
• /
• pp.100-104
• /
• 2004

The detector size effect due to the spatial response of detectors is a critical source of inaccuracy in clinical dosimetry that has been the subject of numerous studies. Conventionally, the detector response kernel contains all the information about the influence that the detector size has on the measured beam profile. Various analytical models for this kernel have been proposed and studied in theoretical and experimental works. Herein, a method to simply determine the detector response kernel using the Monte Carlo simulation and convolution theory has been proposed. Based on this numerical method, the detector response kernel for a Farmer type ion chamber embedded in a water phantom has been obtained. The obtained kernel shows characteristics of both the pre-existing parabolic model proposed by Sibata et al. and the Gaussian model used by Garcia-Vicente et al. From this kernel and deconvolution technique, the detector size effect can be removed from measurements for 6MV, 10${\times}$10 $\textrm{cm}^2$ and 0.5${\times}$10 $\textrm{cm}^2$photon beams. The deconvolved beam profiles are in good agreements with the measurements performed by the film and pin-point ion chamber, with the exception of in the tail legion.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.315-319
• /
• 2006

Support vector machines in biped humanoid robot are presented in this paper. The trajectory of the ZMP in biped walking robot poses an important criterion for the balance of the walking robots but complex dynamics involved make robot control difficult. We are establishing empirical relationships based on the dynamic stability of motion using SVMs. SVMs and kernel method have become very popular method for learning from examples. We applied SVM to model the practical humanoid robot. Three kinds of kernels are employed also and each result has been compared. As a result, SVM based on kernel method have been found to work well. Especially SVM with RBF kernel function provides the best results. The simulation results show that the generated ZMP from the SVM can be improve the stability of the biped walking robot and it can be effectively used to model and control practical biped walking robot.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.4
• /
• pp.661-674
• /
• 2021

Malware, such as a rootkit that modifies the kernel, can adversely affect the analyst's judgment, making the analysis difficult or impossible if a mechanism to evade memory analysis is added. Therefore, we plan to preemptively respond to malware such as rootkits that bypass detection through advanced kernel modulation in the future. To this end, the main structure used in the Windows kernel was analyzed from the attacker's point of view, and a method capable of modulating the kernel object was applied to modulate the memory dump file. The result of tampering is confirmed through experimentation that it cannot be detected by memory analysis tool widely used worldwide. Then, from the analyst's point of view, using the concept of tamper resistance, it is made in the form of software that can detect tampering and shows that it is possible to detect areas that are not detected by existing memory analysis tools. Through this study, it is judged that it is meaningful in that it preemptively attempted to modulate the kernel area and derived insights to enable precise analysis. However, there is a limitation in that the necessary detection rules need to be manually created in software implementation for precise analysis.