• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.400-403
• /
• 2019

스타일 변환(Style Transfer)은 주어진 문장의 긍정이나 부정 같은 속성을 변경하여 다른 속성을 갖는 문장으로 변환하는 과정을 의미한다. 본 연구에서는 스타일 변환을 위한 단어 n-그램 삭제의 기준을 확장하였고, 네이버 영화리뷰 데이터셋을 통해 이를 스타일 변환 이후 원래 문장의 스타일로부터 얼마나 차이가 나게 되었는지를 측정하였다. 측정은 감성분석기를 통해 이루어졌고, 기존 방법에 비해 6.28%p정도 높은 75.13%의 정확도를 보였다.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.33 no.4
• /
• pp.597-605
• /
• 2006

It is introduced that pit and fissure sealant is the most universal and effective to prevent occlusal dental caries. In processing of being applied the pit and fissure sealant, the various kinds of methods are developed to remove organic matters, plaque, microflora and debris in the pit and fissure for increasing the rates of maintain the sealant. Recently, the Er:YAG laser has been used as a new enamel surface treatment method. The purpose of this thesis is compared whether that enamel surface treatment method is superior to other methods or not. 1. 100mJ 5Hz Er:YAG lased enamel surface was similar to acid-etched enamel in SEM evaluation. 2, Mechanical preparation showed decreased microleakage when compared with acid-etching only, but no significant differences in both method. 3. After laser and acid-etching method showed decreased microleakage when compared with acid-etching only.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.28 no.4
• /
• pp.728-734
• /
• 2001

The purpose of this study was to investigate the effects of Er:YAG laser on cutting of efficacy of enamel and dentin in primary and permanent teeth. We used the enamel and dentin specimens of human teeth which contain the physiologic saline and maintain the pulpal pressure in dentinal tubules. Each specimen was exposed to Er:YAG laser with non-contact mode under different treatment condition of irradiation energy, pulse repetition rate. We investigated the cutting efficacy of Er:YAG laser by Scanning Intensity Microscopy, and obtained following results. 1. Cutting volume of enamel and dentin in primary and permanent teeth were increased by increasing the irradiation energy, pulse repetition rate. 2. Cutting volume of primary teeth was larger than that of permanent teeth. 3. Cutting volume of dentin was larger than that of enamel in primary and permanent teeth. From these results, Er:YAG laser would be more effective in cutting dentin than enamel, and in cutting primary teeth than permanent teeth for clinical application.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.5
• /
• pp.947-955
• /
• 2013

Most of the enterprise information is stored in the database. Therefore, in order to investigate the company's criminal behavior, forensic analysis is important for the database and delete record is a need to develop recovery techniques. This paper is explained structure of the oracle database tablespace file and analyzed system tables that stored table information. Further, we suggests a method of recovery for deleted record in oracle tablespace.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.202-203
• /
• 2015

멀티코어 시스템에서는 서로 다른 코어들이 공통 데이터를 동시에 접근할 때 데이터의 일관성을 유지하기 위해서 스핀락 기법을 사용한다. 전통적인 스핀락을 이용한 잠금 기법에서는 잠금 변수가 실행 도중 삭제되지 않으므로 문제가 되지 않는다. 그러나 병렬성을 최대화하기 위해서는 개별 객체 잠금을 하여야 하고 이를 위해서는 객체내에 잠금 변수를 유지하여야 한다. 이 경우 객체는 도중에 언제든지 삭제가 가능하기 때문에 잠금을 하는 도중에는 잠금 변수가 절대 삭제되지 않도록 하여야 한다. 본 논문은 멀티코어상에서 발생하는 이 같은 문제를 해결하기 위해 잠금 변수를 객체 내에 유지할 때의 개별적인 객체 잠금을 위한 스핀락 구현 방법을 제시한다.

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

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

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.1
• /
• pp.1-6
• /
• 2016

This paper focuses on algorithm innovation of NAND Flash Memory for enhancing cell lifetime. During flash memory read/write/erase, the voltage of a specific cell should be a valid voltage level. If not, we cannot read the data correctly. This type of interference/disturbance tends to be serious when program and erase operation will go on. This is because FN tunneling results in tunnel oxide damage due to increased trap site on repetitive high biased state. In order to resolve this problem, we make the cell degradation by reducing the amount of stress in terms of erase cell, resulting in minimizing the cell disturbance on erase verify.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.285-292
• /
• 2003

Existing MPEG-4 players have limitation of screen blinks and drops of object rendering speed when user insert, delete, and replace objects on scenes. In this paper, an Object Priority Order Composition operated through the MPEG-4 player is proposed. This composition is the method for presentation user can insert, delete, and replace scene objects more efficiently. Therefore, this composition can show the MPEG-4 multimedia scenes without blinks and delays on MPR-4 player may seem random and natural.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.878-884
• /
• 2013

Recent C ++ developers take advantage of the many advantages in memory management in the development of reference counting smart pointer. However, these have a problem more than the normal pointer. In this paper, we not only complement these by reference counting smart pointer which pointing a large dynamic object to perform a delete operation to improve performance by creating a thread for the delete operation but also Generalize all data types, we propose a convenient way to operate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.365-371
• /
• 2015

CB tree represents the binary trie by a compact binary sequence. However, retrieval time grows fast since the more keys stored in the trie, longer the binary sequences are. In addition it is inefficient for frequent key insertion/deletion. HCB tree is a hierarchical CB tree consisting of small binary tries. However it can not avoid shift operations and have to scan an additional table to refer child or parent trie. In order to improve retrieval performance and avoid shift operations when keys are inserted or deleted, we in this paper represent each separated trie by a full binary trie and then assign the unique identifier to it. Finally the theoretical evaluations show that both the proposed approach and HCB tree provides better than CB tree for key retrieval. The proposed approach shows the highest performance in case of key insertion/deletion and moreover requires only 71%~89% of storage as compared with CB tree.