• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.68-77
• /
• 2010

In this paper, we propose a new log buffer management scheme considering the accessibility of the data. Our proposed scheme evaluates the worth of the merge of log blocks. It conducts the merge operations between infrequently updated data and the data blocks and postpones as much as possible the merge operations between frequently updated data and the data blocks. As a result, the proposed method prevents the unnecessary merge operations, reduces the number of the erase operations, and improves the utilization of the flash memory storage. In order to show the superiority of the proposed scheme, we compare it with BAST and FAST. It is shown through performance evaluation that the proposed method achieves about 25% and 65% performance improvements over BAST and FAST on average in terms of the number of the erase operations.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2
• /
• pp.30-37
• /
• 1994

Since the morden targets are of high speed and getting quiet in both active and passive mode, the necessities of developing advanced SONAR system capable of performing target motion analysis (TMA) and target classification are evident. In order to develop such a system, the scattering mechanism of complex bodies needs to be, some extent, fully understood and modeled. In this paper, MOving Spread Target(MOST) signal simulation model is presented and discussed. The model is based on the highlight distribution method, and simulates pulse elongation of spread target, doppler effect due to kinematics of the target as well as SONAR platform, and distribution target strength of each highlight point (HL) with directivity. The model can be used in developing and evaluating advanced SONAR system through system simulation, and can also be used in the development of target state estimation algorithm.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2010.05a
• /
• pp.311-318
• /
• 2010

In this study, the conventional plane tip, double squealer tip, and various groove tip blades were tested in a linear cascade in order to measure the effect of the tip shapes on tip surface heat transfer coefficient distributions. Detailed heat transfer coefficient distributions were measured using a hue-detection based transient liquid crystals technique. Two tip gap clearances of 1.5% and 2.3% of blade span were investigated and the Reynolds number based on cascade exit velocity and chord length was $2.48{\times}10^5$. Results showed that the overall heat transfer coefficients on the tip surface with various grooved tips were lower than those with plane tip blade. The overall heat transfer coefficient on grooved along suction side tip was lower than that on the squealer tip.

• Convergence Security Journal
• /
• v.7 no.4
• /
• pp.73-81
• /
• 2007

Users of World Wide Web (Web) experience difficulties in the retrieval of pertinent information due to the increased information provided by Web sites and the complex structure of Web documents that are continuously created, deleted, restructured, and updated. Web providers' efforts to maintain their sites are tend to be less than that of site creation due to the expenses required for maintenance. If information of relationship among Web documents and their validity is provided to Web managers as well as Web developers, they can better serve users. In order to grasp the whole structure of a Web site and to verify the validity of hyperlinks, traversal and analysis of hyperlinks in a Web document are required to provide information for effective and efficient creation and maintenance of the Web. In this paper, we introduce a Web Editor specialized for Web maintenance. We emphasized on two aspects: first, the analysis of HTML Tags to extract hyperlink information and second, establishment of the relationship among hyperlinked documents, and verification of the validity of them.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.384-394
• /
• 2004

Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. In this paper, we propose a new index structure that exploits the properties of the both techniques. Then, we investigate the existing multi-dimensional index structures for main memory database system through experiments under the various work loads. We perform various experiments to show that our approach outperforms others.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.529-535
• /
• 2000

In this paper, we propose a new method of designing the vector quantizer which is robustness to coding results and independent of statistical characteristics of an input image in wavelet transformed image coding processes. The most critical drawback of a conventional vector quantizer is the degradation of coding capability resulted from the discordance between quantizer objective image and statistical characteristics of training sequence which is for generating representing vector. In order to resolve the problem of conventional methods, we use independent random-variables and pseudo image to which image correlation and edge component were added, as a training sequence for generating representing vector. We have done a computer simulation in order to compare coding capability between a vector quantizer designed by the proposed method and one with the conventional method using real image as same as that is objective to coding of training sequence used in codebook generation. The results show the superiority of the proposed vector quantizer method at the aspect of coding capability compared to conventional one. They also clarify the problems of conventional methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.185-190
• /
• 2010

최근 위치 인식 기술과 휴대 장치의 발달로 인해 이동하는 객체를 기반으로 하는 위치 기반 서비스(Location Based Service, LBS)의 관심이 점점 증가하고 있고 그에 관련된 연구들이 활발하게 진행되고 있다. 이동 객체의 응용은 빈번하게 변경되는 이동객체의 위치정보를 효과적으로 처리할 수 있는 색인구조를 필요로 한다. 위치정보를 색인하기 위해 R-tree 기반의 색인들이 제안되었다. 하지만 R-tree는 변경보다는 검색 연산에 초점이 맞추어진 색인구조이기 때문에 잦은 변경을 다루어야 하는 이동객체 환경에 적합하지 못하다. 최근 이러한 객체의 빠른 위치 변경을 지원하는 그리드 기반의 색인 구조가 제안되었다. 하지만 셀의 객체 점유율에 따라 검색 속도가 저하되는 단점은 여전히 해결되지 못하고 있다. 이러한 단점은 객체들이 특정 영역에 몰리는 경우 또는 그리드의 해상도를 잘못 지정한 경우 더욱 부각된다. 본 논문에서는 이러한 단점을 해결하기 위해 가상 셀 기반의 색인 구조를 제안한다. 데이터 페이지에 객체의 점유율을 보장하기 위해 여러 개의 인접한 셀들의 데이터를 한 데이터 페이지에 함께 저장한다. 공간 채움 곡선을 기반으로 순서화된 셀들로 셀의 인접성을 결정한다. 또한 공간 채움 곡선의 차수를 동적으로 지정하여 객체가 집중된 셀에 대해서는 셀의 단위 크기를 작게 지정한다. 뿐만 아니라 셀을 표현하기 위한 식별자를 위해 비트를 이용한 표현식을 제안하였다. 이로 인해 노드의 팬아웃을 증가시켰고, 저장공간을 절약하였다. 실험을 통해서 제안하는 색인 기법의 우수성을 증명하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.1-12
• /
• 2021

In this paper, we propose a tool called ARCAV (Atomatic Recovery of CUDA Atomicity violation) to automatically repair atomicity violations in GPU (Graphics Processing Unit) program. ARCAV monitors information of every barrier and memory to make actual memory writes occur at the end of the barrier region or to make the program execute barrier region again. Existing methods do not repair atomicity violations but only detect the atomicity violations in GPU programs because GPU programs generally do not support lock and sleep instructions which are necessary for repairing the atomicity violations. Proposed ARCAV is designed for GPU execution model. ARCAV detects and repairs four patterns of atomicity violations which represent real-world cases. Moreover, ARCAV is independent of memory hierarchy and thread configuration. Our experiments show that the performance of ARCAV is stable regardless of the number of threads or blocks. The overhead of ARCAV is evaluated using four real-world kernels, and its slowdown is 2.1x, in average, of native execution time.

• Convergence Security Journal
• /
• v.19 no.2
• /
• pp.3-9
• /
• 2019

Most of security countermeasures have been implemented to cope with continuous increase leakage of technology, but almost security countermeasures are focused on securing the boundary between inside and outside. This is effective for detecting and responding to attacks from the outside, but it is vulnerable to internal security incidents. In order to prevent internal leakage effectively, this study identifies activities corresponding to technology leakage activities and designes technology leakage activity detection items. As a design method, we analyzed the existing technology leakage detection methods based on the previous research and analyzed the technology leakage cases from the viewpoint of technology leakage activities. Through the statistical analysis, the items of detection of the technology leakage outcomes were verified to be appropriate, valid and reliable. Based on the results of this study, it is expected that it will be a basis for designing the technology leaking scenarios based on future research and leaking experiences.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.2
• /
• pp.127-132
• /
• 2019

In this paper, we propose a visual inspection method of automotive parts for injection molding to improve the appearance quality and productivity of automotive parts. Exterior inspection of existing injection molding automobile parts was generally done by manual sampling inspection by human. First, we applied the edge-tolerance vision inspection algorithm ([1] - [4]) for vision inspection of electronic components (TFT-LCD and PCB) And we propose a new visual inspection method to overcome the problem. In the proposed visual inspection, the inspection images of the parts to be inspected are aligned on the basis of the reference image of good quality. Then, after partial adaptive binarization, the binary block matching algorithm is used to compare the good binary image and the test binary image. We verified the effectiveness of the edge-tolerance vision check algorithm and the proposed appearance vision test method through various comparative experiments using actual developed equipment.