• 한국문헌정보학회지
• /
• 제15권
• /
• pp.197-224
• /
• 1988

The kernel technique in game theory is introduced and modified in the notion of super kernel, which creates searching maps through the hierarchic clustering technique. The results show more Improved retrieval efficiency in terms of precision and recall.

• 대한임베디드공학회논문지
• /
• 제2권3호
• /
• pp.145-154
• /
• 2007

Dynamic update of kernel can change kernel functionality and fix bugs in runtime. Dynamic update is important because it leverages availability, reliability and flexibility of kernel. An instruction-granularity update technique has been used for dynamic update. However, it is difficult to apply update technique for a commodity operating system kernel because development and maintenance of update code must be performed with assembly language. To overcome this difficulty, we design the function-granularity dynamic update system which uses high-level language such as C language. The proposed update system makes the development and execution of update convenient by providing the development environment for update code which is same for kernel development. We implement this system for Linux and demonstrate an example of update for do_coredump() function which is reported it has a vulnerable point for security. The update was successfully executed.

• Journal of the Korean Data and Information Science Society
• /
• 제23권4호
• /
• pp.825-832
• /
• 2012

We propose a novel way of forecasting the market shares of several brands simultaneously in a multiplicative competitive interaction model, which uses kernel regression technique incorporated with kernel machine technique applied in support vector machines and other machine learning techniques. Traditionally, the estimations of the market share attraction model are performed via a maximum likelihood estimation procedure under the assumption that the data are drawn from a normal distribution. The proposed method is shown to be a good candidate for forecasting method of the market share attraction model when normal distribution is not assumed. We apply the proposed method to forecast the market shares of 4 Korean car brands simultaneously and represent better performances than maximum likelihood estimation procedure.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.983-986
• /
• 2002

Support Vector Machine (SVM) is one of the methods of pattern recognition that separate input data using hyperplane. This method has high capability of pattern recognition by using the technique, which says kernel trick, and the Radial basis function (RBF) kernel is usually used as a kernel function in kernel trick. In this paper we propose using the q-normal distribution to the kernel function, instead of conventional RBF, and compare two types of the kernel function.

• 정보과학회 논문지
• /
• 제44권2호
• /
• pp.171-178
• /
• 2017

본 논문에서는 안드로이드 커널 모듈의 취약점을 탐지하기 위한 자동 유닛 테스트 생성 기법을 제안한다. 안드로이드 커널 모듈의 각 함수를 대상으로 테스트 드라이버/스텁 함수를 자동 생성하고 동적 기호 실행 기법을 사용하여 테스트 입력 값을 자동으로 생성한다. 또한 안드로이드 커널 모듈의 함수 포인터와 함수 선행 조건을 고려하지 않은 테스트 생성으로 인한 거짓 경보를 줄이기 위해 정적 분석을 통한 함수 포인터 매칭 기법과 def-use 분석을 사용한 함수 선행 조건 생성 기법을 개발하였다. 자동 유닛 테스트 생성 기법을 안드로이드 커널 3.4 버전의 세 모듈에 적용한 결과 기존에 존재하던 취약점을 모두 탐지할 수 있었으며 제안한 거짓 경보 감소 기법으로 평균 44.9%의 거짓 경보를 제거할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2084-2100
• /
• 2020

Operating system (OS) kernel function call graphs have been widely used in OS analysis and defense. However, most existing methods and tools for generating function call graphs are designed for application programs, and cannot be used for generating OS kernel function call graphs. This paper proposes a virtualization-based call graph generation method called Acquire in Trap (AIT). When target kernel functions are called, AIT dynamically initiates a system trap with the help of a virtualization technique. It then analyzes and records the calling relationships for trap handling by traversing the kernel stacks and the code space. Our experimental results show that the proposed method is feasible for both Linux and Windows OSs, including 32 and 64-bit versions, with high recall and precision rates. AIT is independent of the source code, compiler and OS kernel architecture, and is a universal method for generating OS kernel function call graphs.

• Journal of the Korean Data and Information Science Society
• /
• 제21권5호
• /
• pp.973-981
• /
• 2010

Quantile regression investigates the quantiles of the conditional distribution of a response variable given a set of covariates. M-quantile regression extends this idea by a "quantile-like" generalization of regression based on influence functions. In this paper we propose a new method of estimating M-quantile regression functions, which uses kernel machine technique. Simulation studies are presented that show the finite sample properties of the proposed M-quantile regression.

• 한국산학기술학회논문지
• /
• 제12권7호
• /
• pp.3251-3257
• /
• 2011

본 논문에서는 논리합성을 위한 공통식 추출 방법을 새롭게 제안한다. 제안하는 방법은 주어진 각 논리식들에서 커널/커널 쌍들과 코커널/커널 쌍을 추출한다. 커널/커널 쌍은 주어진 논리식을 부울 나눗셈에 의해 제수, 몫, 나머지로 논리식을 다시 표현하게 된다. 다음, 여러 논리식에서 산출된 제수, 몫들에서 공통식을 추출하는 커널 교집합에 의해 공통식을 구하는 방법을 제안한다. 실험 결과 기존의 공통식 산출 결과들과 비교했을 때 제안한 방법은 리터럴 개수를 줄일 수 있었다.

• 응용통계연구
• /
• 제6권2호
• /
• pp.329-339
• /
• 1993

커널을 이용한 회귀선의 추정은 단지 참 함수의 미분성만을 요구하는 비모수적인 회귀선의 추정방법이다. 유한구간에서 어떤 곡선의 완만한 추정곡선을 커널을 이용하여 추정할 때 추 정량의 전체적인 성능을 감소시키는 바운더리 문제가 발생하게 된다. 본논문에서는 바운더 리 문제를 다룰수 있는 커널을 개발하였다. Gray와 Schcany(1972)의 일반화된 jackknife 방 법을 이용하여 바운더리 커널을 개발하였고 또한 이 바운더리 커널이 이 바운더리 커널과 같은 수렴속도를 갖는 것을 보였다.

• Communications for Statistical Applications and Methods
• /
• 제13권3호
• /
• pp.503-512
• /
• 2006

In this paper, the Inverse Weibull distribution parameters have been estimated using a new estimation technique based on the non-parametric kernel density function that introduced as an alternative and reliable technique for estimation in life testing models. This technique will require bootstrapping from a set of sample observations for constructing the density functions of pivotal quantities and thus the confidence intervals for the distribution parameters. The performances of this technique have been studied comparing to the conditional inference on the basis of the mean lengths and the covering percentage of the confidence intervals, via Monte Carlo simulations. The simulation results indicated the robustness of the proposed method that yield reasonably accurate inferences even with fewer bootstrap replications and it is easy to be used than the conditional approach. Finally, a numerical example is given to illustrate the densities and the inferential methods developed in this paper.