• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.174-176
• /
• 1998

역파일 구조(inverted file structure)는 검색 속도가 빠르기 때문에 정보검색 시스템의 색인정보 하부 저장구조로 널리 이용되지만 문서의 동적 삭제는 어려운 형태이다. 본 논문에서는 기존역파일 구조에 문서마다 색인어의 포스팅 레코드를 기록한 목록을 유지함으로써 문서의 동적 삭제가 용이하고, 위치정보를 포스팅 레코드에서 분리하여 위치 검색이 효율적인 역파일 구조를 설계한다. 설계된 역파일 구조는 STEER(Structured Entity Element Retrieval) 정보검색 시스템에서 구현되었다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.01a
• /
• pp.345-348
• /
• 2022

본 논문에서는 유체 시뮬레이션(Fluid simulation)중 화염에서 표현되는 불똥 입자(Fire-flake particle)의 생성, 움직임과 삭제를 효율적으로 학습하고 표현할 수 있는 인공지능 기법에 대해 소개한다. 유체 시뮬레이션을 계산하기 위해서는 일반적으로 수치해석학과 같은 학문의 이해가 필요하며 불똥이나 거품과 같은 유체의 2차 효과(Secondary effect)는 기반유체(Underlying fluids)를 통해 추출되기 때문에 복잡하고 계산양이 많아진다. 이러한 문제를 완화하고자 본 논문에서는 인공신경망을 이용한 분류 모델 학습을 통해 격자 내에서 표현되어야 하는 불똥 입자의 생성을 학습하고, 다항 회귀 모델 학습을 통해 불똥 입자의 움직임을 예측한다. 또한, 불똥 입자가 삭제되어야하는 상태를 네트워크 학습을 통해 얻어내며, 수명(Lifespan) 임계값 조절하여 다양한 장면에서 불똥을 제어할 수 있다. 결과적으로 화염의 움직임을 기반으로 불똥의 움직임을 복잡한 수학식이나 디자이너에게 의존하지 않고 인공지능 학습을 통해 쉽게 제어하고 예측하는 결과를 보여준다.

• Journal of the Korea Convergence Society
• /
• v.11 no.4
• /
• pp.41-48
• /
• 2020

The text has always been an important recording channel for the development of human civilization. The delete text function is essential. The current method of deleting text is to "press" the delete button to complete the operation. It does not meet the user's need to delete large amounts of text. This article focuses on a new interactive approach to this problem. We consider problems and find solutions from the perspective of zero-order position control and first-order rate control. Through experimental design analysis and comparison, the new keyboard interaction method greatly improves efficiency and user experience. This article hopes to evaluate the usability of the new keyboard through usability studies.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.422-426
• /
• 2007

Personal mobile devices equipped with non-volatile storage such as MP3 player, PMP, cellular phone, and USB memory require safety for the stored data on the devices. One of the safety requirements is secure deletion, which is removing stored data completely so that the data can not be restored illegally. In this paper, we study how to design the secure deletion on Flash memory, commonly used as storage media for mobile devices. We consider two possible secure deletion policy, named zero-overwrite and garbage-collection respectively, and analyze how each policy affects the performance of Flash memory file systems. Then, we propose an adaptive file deletion scheme that exploits the merits of the two possible policies. Specifically, the proposed scheme applies the zero-overwrite policy for small files, whereas it employs the garbage-collection policy for large files. Real implementation experiments show that the scheme is not only secure but also efficient.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.647-656
• /
• 2001

Video delivery from a server to a client across a network system is an important part of many multimedia applications. Usually, the network system has constraint in both the amount of network bandwidth and the buffer size in the client. While delivering a video stream across such a constrained network system, loss of frames may be unavoidable. The system resources consumed by the dropped frames are wasted, and the losses of frames would result in discontinuous display at the client. In this paper, for delivering hierarchically encoded video stream, we introduce the notion of selective layer discard algorithm at the server which not only preemptively discards data at the server but also drops less important part of a frame instead of the entire frame. By the simulation, we compare the proposed selective layer discard algorithm and the existing selective frame discard algorithm. The simulation results show that the proposed algorithm may improve the quality of decoded video, and decrease the replay discontinuity at the client.

• Journal of Embryo Transfer
• /
• v.20 no.3
• /
• pp.233-238
• /
• 2005

This study was carried out to investigate effects of claw trimming on reproductive efficiency in lactating cow. The results obtained were summarized as follows: 1. Days to 1st postpartum service were 180.9$\pm$47.2 days for control and 111.9$\pm$17.1 days for claw trimming. 2. Conception rate by 1st postpartum service was $25.0\%$ for control and $66.7\%$ for claw trimming. 3. Days to 1st postpartum conception were 258.1$\pm$43.3 days for control and 151.6$\pm$26.2 days for claw trimming(p<0.05). 4. Services per conception were 1.88$\pm$0.23 times for control and 1.44$\pm$0.18 times for claw trimming. 5. Calving interval was 489.3$\pm$47.2 days for control and 430.8$\pm$26.2 days for claw trimming.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.254-257
• /
• 2007

정보기술의 발달로 정보를 수집, 관리, 공유하기가 용이해 짐에 따라 여러 조직이나 기관에서는 개인정보를 수집해 관리하고 있다. 수집한 개인정보를 통계나 연구 등을 목적으로 배포할 때 개인의 프라이버시를 보호하기 위해 k-anonymity 와 l-diversity 원리가 제안되었고 이를 기반으로 하는 프라이버시 보호 기법들이 제안되었다. 그러나 기존 방법들은 정적인 데이터를 단 한번 배포하는 것을 가정하기 때문에 지속적으로 데이터에 삽입이나 삭제가 발생하는 동적 데이터 환경에 그대로 적용하기 적합하지 않다. 본 논문에서는 동적 데이터 환경에서 l-diversity 을 유지하면서 데이터 삽입과 삭제를 효율적으로 처리할 수 있는 기법을 제안한다. 제안 기법은 일반화를 사용하지 않기 때문에 일반화에서 발생하는 정보의 손실이 발생하지 않고 삽입과 삭제의 처리가 간단한 것이 특징이다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.21-30
• /
• 2009

Fusion flash memory such as OneNAND$^{TM}$ is popular as a ubiquitous storage device for embedded systems because it has advantages of NAND and NOR flash memory that it can support large capacity, fast read/write performance and XIP(eXecute-In-Place). Besides, OneNAND$^{TM}$ provides not only advantages of hybrid structure but also multi-block erase function that improves slow erase performance by erasing the multiple blocks simultaneously. But traditional NAND Flash Translation Layer may not fully support it because the garbage collection of traditional FTL only considers a few block as victim block and erases them. In this paper, we propose an Erase Group Flash Translation Layer for improving multi-block erase function. EGFTL uses a superblock scheme for enhancing garbage collection performance and invalid block management to erase multiple blocks simultaneously. Also, it uses clustered hash table to improve the address translation performance of the superblock scheme. The experimental results show that the garbage collection performance of EGFTL is 30% higher than those of traditional FTLs, and the address translation performance of EGFTL is 5% higher than that of Superblock scheme.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.921-926
• /
• 2002

B+-Tree is the most popular indexing method in DBMS to manage large size data in more efficiency. However the existing B+-Tree has shortcomings in there is overhead on DISK/IO when the first time of constructing DB or of making Index, and it lessens the concurrency if there are frequent delete operations so that the index structure also should be changed frequently. To solve these problems almost DBMS is using batch construction method and lazy deletion method. But to apply B+-Tree, which is using batch construction method and lazy deletion method, into DBMS the technique for controlling and recovering concurrency is necessary, but its researching is still unsatisfactory so that there is a problem on applying it into actual systems. On this paper I suggest the technique for controlling and recovering concurrency how to implement the batch construction method and the lazy deletion method in actual DBMS. Through the suggested technique there is no cascade rollback by using Pending list, it enhances the concurrency by enabling insertion and deletion for base table on every reconstruction, and it shortens transaction response time for user by using system queue which makes the batch constructing operation is processed not in user's transaction level but in system transaction level.