• 응용통계연구
• /
• 제26권1호
• /
• pp.131-139
• /
• 2013

지지벡터기계는 잡음변수가 존재하는 경우에 성능이 저하될 수 있다. 또한 최종 분류기에서 각 변수들의 중요도를 알리 어려운 단점이 있다. 따라서 변수선택은 지지벡터기계의 해석력과 정확도를 높일 수 있다. 기존의 문헌상의 대부분의 연구는 선형 지지벡터기계에서 성근 해를 주는 벌점함수를 통해 변수를 선택에 관한 것이다. 실제로는 분류의 정확도를 높이기 위해 비선형 커널을 사용하는 경우가 일반적이다. 따라서 변수선택은 비선형 지지벡터기계에서도 마찬가지로 필요하다. 본 논문에서는 모의실험 및 실제자료를 통하여 비선형 지지벡터의 대표적인 변수선택법인 COSSO(component selection and smoothing operator)와 KNIFE(kernel iterative feature extraction)의 성능을 비교한다.

• 정보학연구
• /
• 제8권4호
• /
• pp.91-102
• /
• 2005

In this paper, development of embedded system based on Windows CE 5.0 which released recently is studied. Embedded softwares for the target board using S3C2410A SOC based on ARM920T core are composed of (1) BSP(Board Support Package) contains an OAL(OEM Adaptation Layer) which includes a boot loader for initializing and customizing target hardware, device drivers, and a corresponding set of configuration files (2) Windows CE 5.0 kernel (3) SDK and MP3 test application. Particularly, PB(Platform Builder) provides the efficient functions to build, test and debug the BSP and CE kernel. It is looked forward to being widely spread that Windows CE 5.0 will be utilized at smart devices such as PMP, CNS and DMB phone which inevitably require a display device.

• 호남수학학술지
• /
• 제33권4호
• /
• pp.467-485
• /
• 2011

We consider the Hyers-Ulam-Rassias stability problem $${\parallel}u{\circ}A-{\upsilon}{\circ}P_1-w{\circ}P_2{\parallel}{\leq}{\varepsilon}({\mid}x{\mid}^p+{\mid}y{\mid}^p)$$ for the Schwartz distributions u, ${\upsilon}$, w, which is a distributional version of the Pexider generalization of the Hyers-Ulam-Rassias stability problem ${\mid}(x+y)-g(x)-h(y){\mid}{\leq}{\varepsilon}({\mid}x{\mid}^p+{\mid}y{\mid}^p)$, x, $y{\in}\mathbb{R}^n$, for the functions f, g, h : $\mathbb{R}^n{\rightarrow}\mathbb{C}$.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1181-1184
• /
• 2005

In this paper, we proposed small scale real-time operating system for embedded system. Real-time system is characterized by the severe consequences that result if logical as well as timing correctness properties of system are not met. On real-time system, real-time operating system allows real-time applications to be designed and expanded easily. Functions can be added without requiring major changes to the software. We design small scale real-time operating system for preemptive kernel, and design kernel component such as multitasking, scheduler, task priority, semaphore, inter-task communication, clock tick timer, ISR(Interrupt Service Routine) mechanism has low interrupt latency.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.14-14
• /
• 2003

Given a sequence ｛ $X_{n}$｝ of independent and identically distributed random variables with F, a sequential procedure for the p-th quantile ξ$_{P}$= $F^{-1}$ (P), 0$\beta$-protection. Some asymptotic properties for the proposed procedure and of an involved stopping time are proved: asymptotic consistency, asymptotic efficiency and asymptotic normality. From one of the results an effect of smoothing based on kernel functions is discussed. The results are also extended to the contaminated case.e.e.

• 한국IT서비스학회지
• /
• 제10권2호
• /
• pp.235-245
• /
• 2011

Early criticality prediction models that determine whether a design entity is fault-prone or not are becoming more and more important as software development projects are getting larger. Effective predictions can reduce the system development cost and improve software quality by identifying trouble-spots at early phases and proper allocation of effort and resources. Many prediction models have been proposed using statistical and machine learning methods. This paper builds a prediction model using Support Vector Machine(SVM) which is one of the most popular modern classification methods and compares its prediction performance with a well-known prediction model, BackPropagation neural network Model(BPM). SVM is known to generalize well even in high dimensional spaces under small training data conditions. In prediction performance evaluation experiments, dimensionality reduction techniques for data set are not used because the dimension of input data is too small. Experimental results show that the prediction performance of SVM model is slightly better than that of BPM and polynomial kernel function achieves better performance than other SVM kernel functions.

• Journal of the Korean Statistical Society
• /
• 제25권4호
• /
• pp.499-514
• /
• 1996

Consider an additive regression model of Y on X = (X$_1$,X$_2$,. . .,$X_p$), Y = $sum_{j=1}^pf_j(X_j) + $\varepsilon$$, where $f_j$s are smooth functions to be estimated and $\varepsilon$ is a random error. If $X_j$s are fixed design points, we call it the fixed design additive model. Since the response variable Y is observed at fixed p-dimensional design points, the behavior of the nonparametric regression estimator depends on the design. We propose a fixed design called permutation fixed design, and fit the regression function by the kernel method. The estimator in the permutation fixed design achieves the univariate optimal rate of convergence in mean squared error for any p $\geq$ 2.

• 대한수학회논문집
• /
• 제25권4호
• /
• pp.655-669
• /
• 2010

In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

• 대한산업공학회지
• /
• 제28권4호
• /
• pp.435-442
• /
• 2002

It is difficult to access and share design data among heterogeneous CAD systems. Usually, different CAD systems exchange the design data using a neutral format such as IGES or STEP. A prototype CAD system which uses a geometric kernel and a commercial database management system has been implemented. The prototype system used the Open Cascade geometric kernel and the commercial object-oriented database ObjectStore. STEP provides the database schema. The database can be accessed from commercial CAD systems such as SolidWorks or Unigraphics. The data access module from a commercial CAD system is developed with the CAD system's native API, ObjectStore API functions, and ActiveX.

• 대한수학회지
• /
• 제42권3호
• /
• pp.573-597
• /
• 2005

A continuous linear operator T, on the space of entire functions in d variables, is PDE-preserving for a given set $\mathbb{P}\;\subseteq\;\mathbb{C}|\xi_{1},\ldots,\xi_{d}|$ of polynomials if it maps every kernel-set ker P(D), $P\;{\in}\;\mathbb{P}$, invariantly. It is clear that the set $\mathbb{O}({\mathbb{P}})$ of PDE-preserving operators for $\mathbb{P}$ forms an algebra under composition. We study and link properties and structures on the operator side $\mathbb{O}({\mathbb{P}})$ versus the corresponding family $\mathbb{P}$ of polynomials. For our purposes, we introduce notions such as the PDE-preserving hull and basic sets for a given set $\mathbb{P}$ which, roughly, is the largest, respectively a minimal, collection of polynomials that generate all the PDE-preserving operators for $\mathbb{P}$. We also describe PDE-preserving operators via a kernel theorem. We apply Hilbert's Nullstellensatz.