• The Journal of Korean Academy of Prosthodontics
• /
• v.49 no.1
• /
• pp.38-48
• /
• 2011

Purpose: Dentists suffer back, neck and shoulder pain during their careers due to bad operating posture. If dentists have a good operating posture ergonomically, there would be less pain and discomfort in the shoulder and back. Therefore, dentists should learn the Home position which enables dentists to approach a stable posture ergonomically. This study was to compare tooth preparation in the Home position and the Random position, and evaluate the clinical efficacy of the Home position. Materials and methods: Tooth preparation for fixed partial denture was performed on the maxillary left 2nd premolar and maxillary left 2nd molar at the two different operating positions were compared. The amount of occlusal reduction, marginal width, subgingival margin depth, and convergence angle were measured. A T-test was performed separately to compare the results of the Random position and the Home position. Results: 1. The amounts of average thickness of occlusal reduction on fossa were deficient to the ordered ones in the Random position and the Home position (P > .05). 2. The average subgingival margin depth of prepared margin on maxillary left 2nd premolar, maxillary left 2nd molar were excessive in the Random position than in the Home position. On the maxillary left 2nd premolar, there was no statistical difference in the Random position and the Home position except Distal midline, DL line angle, Lingual midline, ML line angle (P< .05). On the maxillary left 2nd molar, there was no statistical difference in the Random position and the Home position (P < .05). 3. Average convergence angle in the Random position and the Home position were excessive compared to the ordered angle. There was no statistical difference in the Random position and the Home position (P > .05). 4. Analysis of pearson correlation : In the Random position, the amounts of average thickness of occlusal reduction, the average subgingival margin depth of prepared margin, convergence angle were significantly associated with each other (P < .05). But in the Home position, they were not significantly associated with each other (P < .05). 5. The time needed for preparation in the Home position was faster or equal than that of the Random position as time went on. Conclusion: In conclusion, there were no significant differences between Home position and Random position in measures of occlusal reduction, marginal width, marginal depth, convergence angle. However, preparation time and incidence of damaging adjacent teeth were less in Home position than in Random position. Therefore, if trained properly, Home position which is more ergonomically stable can be adopted for clinical use.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1881-1884
• /
• 2003

본 논문은 시각적 워터마크의 삭제나 수정을 방지하기 위해 블록 기반 내용 인증(Block-wise content authentication) 방법을 제안한다. 제안한 방법은 원본 이미지와 워터마크 이미지를 사용하여 DCT 기반의 시각적 워터마크(Visible watermark)가 삽입된 이미지로 만든다. 다음, 블록 기반 서명(Block-wise signature)을 삽입하여 JPEG 과 같은 허용 가능한 이미지 조작에서는 정보가 유지되고, 워터마크의 삭제와 같은 악의적인 이미지 조작에는 인증을 허용하지 않는다. 또한 이미지의 조작된 부분을 알 수 있도록 로컬라이제이션(Localization)을 이용하여 조작된 부분의 위치를 파악한 수 있다. Lena를 포함한 여러 표준 영상을 사용하여 실험한 결과, 제안한 방법은 시각적 워터마크에 대한 다양한 공격에서 조작된 위치를 정확하게 표현할 수 있었다. 그리고 Photoshop 7.0의 Quality factor 11인 JPEG-90 압축에서 약 99%의 인증이 가능하였고, 블러링(Blurring)이나 샤프닝(Sharpening)과 같은 기타 공격에서는 각각 51%, 50%로 인증이 허용되지 않았다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.01a
• /
• pp.65-66
• /
• 2020

이 논문에서는 NTFS 파일시스템에서 여러 개의 클러스터에 걸쳐서 슬랙 영역에 데이터 숨기기를 수행하는 데이터 숨기기 방법의 강인성을 조사하기 위하여 디스크 조각모음 실험을 수행할 때 필요한 방법을 제안한다. 디스크 조각모음의 실행으로 클러스터의 위치가 변동되기 위해서는 여러 클러스터에 걸친 디스크 조각의 단편화가 일어날 수 있도록 파일을 생성하고 삭제하는 작업을 수행한다. 그 후에 용량이 큰 파일을 복사하여 여러 클러스터에 걸친 단편화된 파일을 작위적으로 생성한다. 단편화된 파일만을 남기고 그 이외의 다른 파일들을 삭제한 후에 디스크조각 모음을 수행한다. 이 실험에 필요한 준비과정과 실험과정을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.203-206
• /
• 2008

O-tree 표현법을 이용한 기존의 플로어플랜 알고리즘은 결정적 기법에 기반한 것으로써, 회로의 각 모듈을 차례대로 삭제한 후 가장 좋은 다른 위치에 삽입하는 과정을 함으로써 해 공간을 검색해 간다. 이는 모듈을 처리하는 순서에 따라 결과가 결정되는 단점이 있다. 이런 단점을 해결하기 위해 본 논문에서는 Simulated Annealing 프레임을 이용하여 해 공간을 효과적으로 검색하는 방법을 제시한다. 이웃 해를 탐색하기 위한 플로어 플랜의 변형은 매우 단순하면서도 효과적인 두 가지 방법을 사용한다. 첫째 방법은 한 쌍의 모듈을 선택하여 상호위치를 맞바꾸는 방법이고, 둘째는 임의의 한 모듈을 선택하여 삭제한 후 삽입 가능한 모든 위치 중 임의의 한 곳에 삽입하는 연산을 사용한다. 실험 결과는 매우 고무적이다.

• The Journal of Korean Academy of Prosthodontics
• /
• v.49 no.2
• /
• pp.152-160
• /
• 2011

Purpose: The aim of this study was to evaluate the volumetric change of teeth after preparation for various designs and margin locations through Micro CT analysis (Skyscan 1076: SKYSCAN, Konitch, Belgium). Materials and methods: The 36 artificial teeth were used to determine reduction volume of upper central incisor. According to the restorative design these 36 teeth were divided into 4 groups and according to the marginal location each group was divided into 3 subgroups. The volume of unprepared teeth was obtained by using Micro CT and the volume of prepared teeth was obtained in the same method. The CT scanned images before and after preparation were superimposed. Results: The volume difference was significantly increased as follows: traditional laminate veneer < full laminate veneer < all ceramic crown < metal ceramic crown. One-way ANOVA and Tukey multiple comparison analyses were used to analyze the data in this study. In each group the volume difference was significantly increased as follows: 1 mm above CEJ < CEJ < 1 mm below CEJ (P<.05). The % volume difference of all ceramic crown and metal ceramic crown was 31 - 48% and that of laminate veneer was 14 - 30%. The volume difference of the traditional laminate veneer was 1/3 of that of metal ceramic crown. The full laminate (1 mm below CEJ) and all ceramic crown (1 mm above CEJ) showed a similar volume difference. Metal ceramic crown showed 13.7% more volume difference than all ceramic crown. Conclusion: There exists the difference in volumetric change according to designs of restoration and margin locations of preparation.

• Journal of Advanced Navigation Technology
• /
• v.17 no.2
• /
• pp.189-195
• /
• 2013

In an environment with frequent job requests and short job processing times, thread pool methods are frequently used to increase throughput by reducing overheads due to thread creation and removal. A watermark method normally reduces unnecessary uses of resources by keeping the number of threads less than those needed in the maximum. In the absence of available threads, however, it processes jobs by creating additional threads up to a specified limit so that the system overhead increases due to creation of threads, which results in throughput degradation. This paper presents a history-based dynamic method that alleviates throughput degradation. By estimating and maintaining the number of threads needed for jobs, it reduces overheads due to thread creation and removal. According to experiments, compared to the watermark thread pool method, it shows average 33% increase in the number of threads kept and average 62% reduction in the number of threads created, which results in 6% increase in terms of system throughput.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.2
• /
• pp.387-396
• /
• 2016

As the number of people using digital devices has increased, the digital forensic, which aims at finding clues for crimes in digital data, has been developed and become more important especially in court. Together with the development of the digital forensic, the anti-forensic which aims at thwarting the digital forensic has also been developed. As an example, with anti-forensic technology the criminal would delete an digital evidence without which the investigator would be hard to find any clue for crimes. In such a case, recovery techniques on deleted or damaged information will be very important in the field of digital forensic. Until now, even though EVTX(event log)-based recovery techniques on deleted files have been presented, but there has been no study to retrieve event log data itself, In this paper, we propose some recovery algorithms on deleted or damaged event log file and show that our recovery algorithms have high success rate through experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.2
• /
• pp.223-232
• /
• 2017

Previous research on data recovery in Microsoft SQL Server has focused on restoring data based on in the transaction log that might have deleted records exist. However, there was a limit that was not applicable if the related transaction log did not exist or the physical database file was not connected to Server. Since the suspect in the crime scene may delete the data records using a different deletion statements besides "delete", we need to check the remaining data and a recovery possibility of the deleted record. In this paper, we examined the changes "Page Allocation information" of the table, "Unallocation deleted data", "Row Offset Array" in the page according to "delete", "truncate" and "drop" events. Finally it confirmed the possibility of data recovery and availability of management tools in Microsoft SQL Server digital forensic investigation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.143-154
• /
• 2011

SQLite is a small sized database engine largely used in embedded devices and local application software. The availability of portable devices, such as smartphones, has been extended over the recent years and has contributed to growing adaptation of SQLite. This implies a high likelihood of digital evidences acquired during forensic investigations to include SQLite database files. Where intentional deletion of sensitive data can be made by a suspect, forensic investigators need to recover deleted records in SQLite at the best possible. This study analyzes data management rules used by SQLite and the structure of deleted data in the system, and in turn suggests a recovery Tool of deleted data. Further, the study examines major SQLite suited software as it validates feasible possibility of deleted data recovery.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.293-294
• /
• 2014

정보 검색 분야에서 키 탐색을 빠르게 하기 위한 인덱스 구조로 이진 트라이가 대표적으로 사용된다. CB 트리는 이진 트라이 구조를 구현할 경우 발생하는 저장 공간의 부담을 축소하기 위해 이진 시퀀스를 사용하여 저장한다. 이는 저장 공간 측면에서 상당한 우수성을 보여주나 키의 잦은 삽입 및 삭제 요구가 있을 경우 이진 비트열에 대한 시프트 연산이 요구되는 부담이 있다. 본 논문에서는 완전 이진 트라이 구조를 사용하여 CB 트리를 표현하는 방법을 제시하였다. 저장 공간의 크기가 증가되기는 하지만 키가 삽입되거나 삭제되어도 이진 비트열에 대한 시프트 연산이 필요하지 않은 장점이 있다.