• Journal of the Korea Computer Industry Society
• /
• v.7 no.1
• /
• pp.47-56
• /
• 2006

Proteome patterns reflect the underlying pathological state of a human organ. It is believed that the anomalies or diseases of human organs are identified by the analysis of the pattern. There are many ways to analysis these patterns. <중략> (colon cancer and leukemia dataset) indicates that the proposed method shows better classification performance and more stable results than other single kernel functions.

• The Korean Journal of Applied Statistics
• /
• v.26 no.1
• /
• pp.131-139
• /
• 2013

Support vector machines(SVM) may perform poorly in the presence of noise variables; in addition, it is difficult to identify the importance of each variable in the resulting classifier. A feature selection can improve the interpretability and the accuracy of SVM. Most existing studies concern feature selection in the linear SVM through penalty functions yielding sparse solutions. Note that one usually adopts nonlinear kernels for the accuracy of classification in practice. Hence feature selection is still desirable for nonlinear SVMs. In this paper, we compare the performances of nonlinear feature selection methods such as component selection and smoothing operator(COSSO) and kernel iterative feature extraction(KNIFE) on simulated and real data sets.

• The Journal of Information Technology
• /
• v.8 no.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.

• Honam Mathematical Journal
• /
• v.33 no.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}$.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• 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.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• 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.

• Journal of Information Technology Services
• /
• v.10 no.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
• /
• v.25 no.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.

• Communications of the Korean Mathematical Society
• /
• v.25 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.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.