• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.1
• /
• pp.21-26
• /
• 2014

When iodine container for dental mouth treatment is opened, thread for treatment is cut by the blade in cap of container. Due to the problem of corrosion in a short period time after the reaction of metal blade to iodine solution, it gives impact on patient hygiene. In order to solve the problem, alternative products such as ceramic blade are developed and produced recently. In case of ceramic blade, it is produced by handwork and machine work. In this study, for the quantity production of ceramic blade with powder injection molding, we proposed a delivery system to have uniform charge of 20 cavity. Using Moldflow, simulation on 20 Cavity flow was performed. And then the mold was obtained through mold production and modification.(based on simulation) After injection molding, debinder, sintering process was achieved for ceramic blade, and the cap product was completed via insert injection on ceramic blade. In this study, we verified possibility of quantity production of ceramic blade which showed effective performance for cutting.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.549-557
• /
• 2016

It is important for effective visualization to summarize not only a large amount of debugging information but also the mental models of abstract ideas. This paper presents an abstract visualization tool which provides effective visualization of thread structure and race information for OpenMP programs with critical sections and nested parallelism, using a partial order execution graph which captures logical concurrency among threads. This tool is supported by an on-the-fly trace-filtering technique to reduce space complexity of visualization information, and a graph abstraction technique to reduce visual complexity of nested parallelism and critical sections in the filtered trace. The graph abstraction of partial-order relation and race information is effective for understanding program execution and detecting to eliminate races, because the user can examine control flow of program and locations of races in a structural fashion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2B
• /
• pp.279-286
• /
• 2010

RFID reader protocol is an interface between RFID readers and higher (host) such as RFID middlewares and applications. At present, reader protocols provided by vendors are different from each other and there are compatibility problems in environment using heterogeneous readers. In this paper, to solve this problem, an RFID reader which supports LLRP(Low Level Reader Protocol), a well-known standard reader protocol presented by EPCglobal is designed and implemented. It is designed with two modules and supports various interfaces for easy adaptation to various applications. The LLRP protocol is implemented over a embedded LINUX multi-thread environment. It not only supports almost all properties of LLRP, and is designed with flexible hardware/software architecture to meet various requirements.

• Journal of the Optical Society of Korea
• /
• v.15 no.4
• /
• pp.386-393
• /
• 2011

In this study, we report an effective k-domain linearization method with a pre-calibrated indexed look-up table. The method minimizes k-domain nonlinear characteristics of a swept source optical coherence tomography (SS-OCT) system by using two arrays, a sample position shift index and an intensity compensation array. Two arrays are generated from an interference pattern acquired by connecting a Fabry-Perot interferometer (FPI) and an optical spectrum analyzer (OSA) to the system. At real time imaging, the sample position is modified by location movement and intensity compensation with two arrays for linearity of wavenumber. As a result of evaluating point spread functions (PSFs), the signal to noise ratio (SNR) is increased by 9.7 dB. When applied to infrared (IR) sensing card imaging, the SNR is increased by 1.29 dB and the contrast noise ratio (CNR) value is increased by 1.44. The time required for the linearization and intensity compensation is 30 ms for a multi thread method using a central processing unit (CPU) compared to 0.8 ms for compute unified device architecture (CUDA) processing using a graphics processing unit (GPU). We verified that our linearization method is appropriate for applying real time imaging of SS-OCT.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.19-24
• /
• 2004

A novel fast parallel NTGST is proposed for high resolution computer vision inspection of the BLUs in a LCD production line. The conventional computation- intensive NTGST algorithm is modified and its C codes are optimized into fast NTGST to be adapted to the SIMD parallel architecture. And then, the input inspection image is partitioned and allocated to each of the P processors in multi-threaded implementation, and the NTGST is executed on SIMD architecture of N data items simultaneously in each thread. Thus, the proposed inspection system can achieve the speedup of O(NP). Experiments using Dual-Pentium III processor with its MMX and extended MMX SIMD technology show that the proposed parallel NTGST is about Sp=8 times faster than the conventional NTGST, which shows the scalability of the proposed system implementation for the fast, high resolution computer vision inspection of the various sized BLUs in LCD production lines.

• Journal of IKEEE
• /
• v.22 no.2
• /
• pp.281-288
• /
• 2018

In this paper, we propose an intelligent face recognition and tracking system that distributes GPU resources using CUDA. The proposed system consists of five steps such as GPU allocation algorithm that distributes GPU resources in optimal state, face area detection and face recognition using deep learning, real time face tracking, and PTZ camera control. The GPU allocation algorithm that distributes multi-GPU resources optimally distributes the GPU resources flexibly according to the activation level of the GPU, unlike the method of allocating the GPU to the thread fixedly. Thus, there is a feature that enables stable and efficient use of multiple GPUs. In order to evaluate the performance of the proposed system, we compared the proposed system with the non - distributed system. As a result, the system which did not allocate the resource showed unstable operation, but the proposed system showed stable resource utilization because it was operated stably. Thus, the utility of the proposed system has been demonstrated.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.157-165
• /
• 2004

The paper suggests that web-server security management system will be able to detect the web service attack accurately and swiftly which is keeping on increasing at the moment and reduce the possibility of the false positive detection. This system gathers the results of many unit security modules at the real time and enhances the correctness of the detection through the correlation analysis procedure. The unit security module consists of Network based Intrusion Detection System module. File Integrity Check module. System Log Analysis module, and Web Log Analysis and there is the Correlation Analysis module that analyzes the correlations on the spot as a result of each unit security module processing. The suggested system provides the feasible framework of the range extension of correlation analysis and the addition of unit security module, as well as the correctness of the attack detection. In addition, the attack detection system module among the suggested systems has the faster detection time by means of restructuring Snort with multi thread base system. WSM will be improved through shortening the processing time of many unit security modules with heavy traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.90-95
• /
• 2002

Though the FTP(File Transfer Protocol) has been used widely and stable, It has the structural weakness that can't support current file transmissions so that we have to wait the completion of previous file transmission when try to transmit another file. If try to transmit multiple files concurrently using this FTP, It has to forking multiple FTP servers and clients in each user's PC and ISP's host machine it would result in the waist of memory, resource of network and the high workload of system. In order to solving previous problem, in this paper I have designed the new model of FTP which based on multi-thread and created NFTP(Next-Generation FTP)protocol so that may reduce the workload of system and support current file transmission effectively. I have implemented NFTP and also applied to real service, as a result It have provided reliable service by reducing the workload of system and saved the waiting time which would happened.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.421-427
• /
• 2013

Disk Cache Manager(DCM), a functional server of microkernel based, to improve the I/O power of shared disks is designed and implemented in this work. DCM interfaces other different servers with message passing through ports by serving as a system actor the multi-thread mode on the Minix3 micro-kernel. DCM proposed in this paper uses the shared disk logically as a Seven Disk and Sodd Disk to enable parallel I/O. DCM enables the efficient placement of disk data because it raises disk cache hit-ratio by increasing the cache size when the utilization of the particular disk is high. Through experimental results, we show that DCM is quite efficient for a shared disk with higher utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.655-664
• /
• 2002

In many data-parallel applications massive parallelism can be easily extracted through data distribution. But it often causes very long communication latency. This paper shows that task parallelism, which is extracted from data-parallel programs, can be exploited to hide such communication latency Unlike the most previous researches over exploitation of task parallelism which has not been considered together with data parallelism, this paper describes exploitation of task parallelism in the context of data parallelism. PCFG(Parallel Control Flow Graph) is proposed to represent a multithreaded program consisting of a few task threads each of which can include a few data-parallel loops. It is also described how a PCFG is constructed from a source data-parallel program through HDG(Hierarchical Dependence Graph) and how the multithreaded program can be constructed from the PCFG.