• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.2 s.257
• /
• pp.260-268
• /
• 2007

Demand for the use of 3D CAD DMU systems over the Internet environment has been increased. However, transmission of commercial 3D kernels has delayed the communication effectiveness due to the kernel size. Light weight CAD geometric kernel design methodology is required for rapid transmission in the distributed environment. In this paper, an assembly data structure suitable for the top-down and bottom-up assembly models has been constructed. Part features are stored without a hierarchy so that they are created and saved in no particular order. In particular, this paper proposes a new assembly representation model, called multi-level assembly representation (MAR), for the PDM based assembly DMU system. Since the geometric kernel retains assembly hierarchy and topological information, it is applied to the web-viewer for the PDM based DMU system. Effectiveness of the proposed geometric kernel is confirmed through various case studies.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.4
• /
• pp.175-184
• /
• 2010

This paper designs a virtual USB drive for mobile devices which gives an illusion of a traditional USB flash memory drive and provides capacity-free storage space over IP network. The virtual USB drive operating with a S3C2410 hardware platform and embedded linux consists of USB device driver, an iSCSI-enabled network stack, and a seamless USB/iSCSI tunneling module. For performance enhancement, it additionally provides a kernel-level seamless USB/iSCSI tunneling module and data sharing with symbol references among kernel modules. Experiments reveal that the kernel-level implementation can improve the I/O performance up to 8 percentage, as compared with the user-level implementation.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.182-190
• /
• 2005

As computers and Internet become popular, many corporations and countries are using information protection system and security network to protect their informations and resources in internet. But the Intrusional possibilities are increases in open network environments such as the Internet. Even though many security systems were developed, the implementation of these systems are mostly application level not kernel level. Also many file protection systems were developed, but they aren't used widely because of their inconvenience in usage. In this paper, we implement a kernel module to support a file protection function using Loadable Kernel Module (LKM) on Linux. When a system is damaged due to intrusion, the file system are easily recovered through periodical file system image backup.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.810-831
• /
• 2019

Recently, continuous dimensional emotion recognition from audiovisual clues has attracted increasing attention in both theory and in practice. The large amount of data involved in the recognition processing decreases the efficiency of most bimodal information fusion algorithms. A novel algorithm, namely the incomplete Cholesky decomposition based kernel cross factor analysis (ICDKCFA), is presented and employed for continuous dimensional audiovisual emotion recognition, in this paper. After the ICDKCFA feature transformation, two basic fusion strategies, namely feature-level fusion and decision-level fusion, are explored to combine the transformed visual and audio features for emotion recognition. Finally, extensive experiments are conducted to evaluate the ICDKCFA approach on the AVEC 2016 Multimodal Affect Recognition Sub-Challenge dataset. The experimental results show that the ICDKCFA method has a higher speed than the original kernel cross factor analysis with the comparable performance. Moreover, the ICDKCFA method achieves a better performance than other common information fusion methods, such as the Canonical correlation analysis, kernel canonical correlation analysis and cross-modal factor analysis based fusion methods.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.1
• /
• pp.79-86
• /
• 2004

In general, operating system is offering the security function of OS level to support several web services. However, it is true that security side of OS level is weak from many parts. Specially, it is needed to audit/trace function in security kernel level to satisfy security more than B2 level that define in TCSEC(Trusted Computer System Evaluation Criteria). So we need to create audit data at system call invocation for this, and do to create audit data of equal format about almost event and supply information to do traceback late. This Paper Proposes audit/trace system module that use LKM(Loadable Kernel Module) technique. It is applicable without alteration about existing linux kernel to ensure safe evidence. It offers interface that can utilize external audit data such as intrusion detection system, and also offers safe role based system that is divided system administrator and security administrator These data will going to utilize to computer forensics' data that legal confrontation is Possible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7C
• /
• pp.428-434
• /
• 2011

Recently, subspace analysis has raised its performance to a higher level through the adoption of kernel-based nonlinearity. Especially, the radial basis function, based on its nonparametric nature, has shown promising results in face recognition. However, due to the endemic small sample size problem of face data, the conventional kernel-based feature extraction methods have difficulty in data representation. In this paper, we introduce a novel variant of the RBF kernel to alleviate this problem. By adopting the concept of the nearest feature line classifier, we show both effectiveness and generalizability of the proposed method, particularly regarding the small sample size issue.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2527-2545
• /
• 2016

Measuring the similarity of given samples is a key problem of recognition, clustering, retrieval and related applications. A number of works, e.g. kernel method and metric learning, have been contributed to this problem. The challenge of similarity learning is to find a similarity robust to intra-class variance and simultaneously selective to inter-class characteristic. We observed that, the similarity measure can be improved if the data distribution and hidden semantic information are exploited in a more sophisticated way. In this paper, we propose a similarity learning approach for retrieval and recognition. The approach, termed as LDA-FEK, derives free energy kernel (FEK) from Latent Dirichlet Allocation (LDA). First, it trains LDA and constructs kernel using the parameters and variables of the trained model. Then, the unknown kernel parameters are learned by a discriminative learning approach. The main contributions of the proposed method are twofold: (1) the method is computationally efficient and scalable since the parameters in kernel are determined in a staged way; (2) the method exploits data distribution and semantic level hidden information by means of LDA. To evaluate the performance of LDA-FEK, we apply it for image retrieval over two data sets and for text categorization on four popular data sets. The results show the competitive performance of our method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.85-87
• /
• 2002

본 논문에서는 리눅스 클러스터에서 커널 수준의 응용 프로그램 개발을 위한 통신 모듈인 KCCM(Kernel level Cluster Communication Module)에 대한 구조를 기술한다. KCCM은 비동기 통신을 지원하기 위한 응용 프로그램 인터페이스와 송수신(Send/ Receive)형태의 동기 통신을 지원하기 위한 응용 프로그램 인터페이스를 함께 제공하며, 다른 플랫폼으로의 포팅을 고려하여 소켓 인터페이스를 이용해 구현되었다. 또한 장애 상황에서도 서비스를 계속하고 장애를 복구할 수 있도록 설계되어 커널 수준의 고 가용성 클러스터 응용 프로그램을 개발하는데 유용하다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.4
• /
• pp.265-276
• /
• 2005

ELECTRE IS requires the decision maker (DM) to specify several parameters such as weights, pseudo-criteria thresholds and the concordance level. Among these parameters, the concordance level has a significant effect on the outranking relation. And the number of alternatives selected may be sensitive to the value of these parameters. Therefore the DM may have to perform many iterations to obtain the desired number of alternatives in the kernel set. In this study, we developed a mixed-integer programming (MIP) model to elicit the concordance level and thereby to choose the desired number of alternatives in the kernel set. The MIP model can be applied in the interactive process so that the pseudo-criteria thresholds are adjusted according to the results of MIP model. Using the MIP model in the interactive process, we can reduce the number of iterations needed to perform ELECTRE IS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1947-1954
• /
• 2011

There are various attacks such as tampering, bypassing and spoofing which are caused with system-wide vulnerabilities of Windows operating system. The underlying operating system is responsible for protecting application-space mechanisms against such attacks. This paper provides the implementation of mandatory access control known as multi-level security (MLS) rating with TCSEC-B1 level on th kernel of Windows$^{TM}$. By adding especially the protection feature against tampering memory of processes to the security kernel, this implementation meets the responsibility against system-wide vulnerabilities.