• 디지털산업정보학회논문지
• /
• 제6권2호
• /
• pp.107-118
• /
• 2010

This paper proposes a digital forensic method to a file creation transaction using a journal file($LogFile) on NTFS File System. The journal file contains lots of information which can help recovering the file system when system failure happens, so knowledge of the structure is very helpful for a forensic analysis. The structure of the journal file, however, is not officially opened. We find out the journal file structure with analyzing the structure of log records by using reverse engineering. We show the digital forensic procedure extracting information from the log records of a sample file created on a NTFS volume. The related log records are as follows: bitmap and segment allocation information of MFT entry, index entry allocation information, resident value update information($FILE_NAME, $STANDARD_INFORMATION, and INDEX_ALLOCATION attribute etc.).

• Restorative Dentistry and Endodontics
• /
• 제27권2호
• /
• pp.196-206
• /
• 2002

본 연구는 근관의 치관부는 GT Rotary file을 이용하여 성형하고, 근단부는 K-Flexofile, ProFile .04, Lightspeed, HERO642 file로 성형하여 근관용 file의 근관성형력을 비교하는 것이다. 실험 표본으로는 resin simulated root canal blocks(Dentsply, Swiss)를 이용하였고 4개의 군으로 분류하여 실험을 실시하였다. 모든 resin block을 GT Rotary file(Dentsply, Swiss)을 이용하여 치관부를 형성한 후 근단부는 K-Flexofile(Dentsply, Swiss), ProFile .04 taper file(Denstply. Swiss), Lightspeed file(Lightspeed Tech., USA), HERO642 file(Micromega, France)로 ISO size #35까지 형성하였다. 성형 후 preparation time과 instrument failure를 측정하였고 최종 사용한 file을 resin block 내에 재위치시켜 working length의 변화량을 0.5mm 단위로 측정하였다. Resin debris에 의한 canal blockage를 조사하였으며, 근관 내의 인상을 채득하여 canal form을 평가하였다. 성형 전과 성형 후의 사진을 촬영하고 computer software를 이용하여 중첩시킨 후 canal aberration, canal transportation을 평가하여 다음과 같은 결과를 얻었다. 1. Preparation time, working length의 변화량, canal blockage, canal aberration, canal transportation에 있어서 Ni-Ti file이 stainless steel file에 비하여 우수하였다(p<0.05). 반면에 근관성형력에 있어서 canal form과 canal transportation을 제외하고는 세 Ni-Ti file 사이에는 유의차가 없었다(p>0.05). 2. Canal form 중 taper에 있어서 Lightspeed는 적절하지 못한 taper를 보여주었다(p<0.05). 3. Canal transportation에 있어서 Lightspeed 군과 HER0642 군이 K-Flexofile 군과 ProFile .04 군에 비해 적게 나타났고(p<0.05), 특히 만곡의 끝 부분에서는 Lightspeed 군이 가장 적게 나타났다(p<0.05). 이상과 같은 연구결과로 보아 부적절한 taper를 지니고 있던 Lightspeed fie과 HERO642 file 중 HERO642 file은 GT Rotary file과 함께 사용함으로써 적절한 taper로 형성할 수 있었으나 Lightspeed file은 효과적이지 못하였으므로 적절한 taper를 형성하기 위한 file이 치근의 중간부를 형성하기 위해 필요함이 확인되었다.

• Restorative Dentistry and Endodontics
• /
• 제20권1호
• /
• pp.316-327
• /
• 1995

The purpose of this study was to evaluate canal shaping ability and canal angulation change of K-file, straight endosonic K-file and pre curved endosonic K-file. Twenty staight canals and thirty curved canals were selected and divided into five groups according to canals curvature and canal instrumentation method. VI group was prepared by straight endosonic K-file and H1 group by K-file in straigt canals. V2 group was instrumented by straight endosonic K-file, V3 group by pre curved endosonic K-file and H2 group by precurved K-file in curved canals. Radiographs of canals were obtained before and after canal shaping. And postoperative radiographs were compared with preoperative radiographs using superimposition method. The results obtained were as follows ; l. In straight canals, K-file group demonstrated lager percentage of canal enlargement than endosonic K-file group on facial view, but reverse results exhibit on mesial view. 2. In curved canals, precurved K-file group showed largest percentage of canal enlargement, followed by precurved endosonic K-fine group and straight endosonic K-file group was smallest. 3. Percantage of canal enlargement at convex side was greater than at concave side in apical portion of each group. Especially in straight endosonic K-file group, percantage of canal enlargement at convex side and concave side showed sharply difference. 4. In angulation change, the straight endosonic K-file group exhibited the greatest its change, followed by precurved endosonic K-file group and precurved K-file group was the least. Above results suggest that K-file is more effective endodontic instrument than endosonic K-file, and that precurved file is effective for canal shaping in curved canal.

• Restorative Dentistry and Endodontics
• /
• 제23권1호
• /
• pp.391-400
• /
• 1998

The aim of this study was to determine the shaping ability of stainless-steel K file (S-S K file), nickel-titanium K file (Ni-Ti K file) and engine driven nickel-titanium file (Quantec file) in resin simulated root canal. Computed tomography was used to evaluate the change of the root canal morphology. Thirty nine resin simulated root canal were divided into four groups (A:12, B:12, C:12, D:3). Resin simulated canals were scanned by computed tomography before instrumentation (1st C-T scan). Canals were instrumented using step back preparation technique with S-S K file in group A and Ni-Ti K file in group B. Group C was prepared with engine driven Ni-Ti file. Group D was uninstrumented to compare the 1st C-T scan images with 2nd C-T scan images of root canal. Instrumented canals were again scanned using computed tomography (2nd C-T scan), and reformated images of the uninstrumented canals were compared with images of the instrumented canals. In the sections of 2mm and 6mm from the apex, Quantec file caused significantly less canal transportation than S-S K file and Ni-Ti K file (p<0.05). Quantec file produced more centered than S-S K file and Ni-Ti K file in the sections of 2mm and 4mm from the apex (p<0.05). There was no significant difference in the removed volume of canals among the each groups (p>0.05). However the removed canal volume from the apex to 5mm were significantly higher than them from 5mm to 1mm (p<0.05) in each groups. Under the conditions of this study, preparation with Quantec file was more effective and produce more appropriate canal shapes than S-S K file and Ni-Ti K file.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.1-8
• /
• 2017

In this paper, we propose a file system for flash memory which remedies shortcomings of existing flash memory file systems. Besides supporting large block size, the proposed file system reduces time in initializing file system significantly by adopting logical address comprised of erase block number and bitmap for pages in the block to find a page. The file system is suitable for embedded systems with limited main memory since it has small in-memory data structures. It also provides efficient management of obsolete blocks and free blocks, which contribute to the reduction of file update time. Finally the proposed file system can easily configure the maximum file size and file system size limits, which results in portability to emerging larger flash memories. By conducting performance evaluation studies, we show that the proposed file system can contribute to the performance improvement of embedded systems.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.118-123
• /
• 2021

Recently, digital crime is becoming more intelligent, and efficient digital forensic techniques are required to collect evidence for this. In the case of important files related to crime, a specific person may intentionally delete the file. In such a situation, data recovery is a very important procedure that can prove criminal charges. Although there are various methods to recover deleted files, we focuses on the recovery technique using HxD editor. When recovering a deleted file using the HxD editor, check the file structure and access the file data area through calculation. However, there is a possibility that errors such as arithmetic errors may occur when a file approach through calculation is used. Therefore, in this paper, we propose an algorithm that automatically calculates the header and footer of a file after checking the file signature in the root directory for efficient file recovery. If the algorithm proposed in this paper is used, it is expected that the error rate of arithmetic errors in the file recovery process can be reduced.

• 한국항행학회논문지
• /
• 제18권4호
• /
• pp.401-408
• /
• 2014

하둡(Hadoop)은 맵리듀스(MapReduce) 분산처리 프로그래밍 모델과 HDFS(Hadoop distributed file system) 분산 파일시스템으로 구성된다. 하둡은 빅데이터 처리에 적합한 프레임워크로서, 대량의 스몰파일 처리에 문제점이 있다. 하둡에서 대량의 스몰파일 처리는 하나의 파일마다 매퍼가 생성되며, 파일의 메타정보를 저장하기 위해 많은 메모리가 필요한 문제점이 있다. 본 논문은 하둡 플랫폼에서 다양한 방법으로 대량의 스몰파일 처리방법을 비교 검토하였다. 일반 압축은 데이터의 크기와 상관없이 하나의 매퍼로 처리해야 하기 때문에, 하둡 처리 포맷으로 적절하지 않다. 시퀀스 와 하둡 아카이브 파일의 처리는 스몰파일을 압축 및 병합을 통해 네임노드의 메모리 문제가 제거되었다. 하둡 아카이브 파일은 스몰파일의 병합시간이 시퀀스 파일보다 빠른 속도를 보였다. CombineFileInputFormat 클래스를 이용한 처리는 병합과정이 필요 없으며, 빅데이터 처리방법과 유사한 속도를 보였다.

• 한국항행학회논문지
• /
• 제15권5호
• /
• pp.742-748
• /
• 2011

G-File은 사진촬영의 위치 좌표를 내장한 사진 파일을 이용하여 사용자에게 사진 속 이미지의 위치와 방향각 데이터를 이용한 파일을 말한다[1]. G-File은 사진 파일을 입력받아 저장하는 사진 파일 수신 수단과, 사진 파일을 사진 정보와 위치 정보로 분리하여 피사체의 위치 정보를 추출하는 위치 정보 분석 수단 및 위치 정보를 이용하여 지도상의 대응되는 좌표에 표시하는 위치 안내 수단을 포함하는 것을 특징으로 한다. 본 논문은, 이러한 G-File에 저장된 위치 정보에 대한 관리를 할 수 있는 알고리즘을 제안한다. 이 알고리즘은 G-File을 이용하는 사용자에게 정보를 관리하게 하고, G-File 관리에 편리함을 제공하기 위함이다.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2004년도 춘계학술대회 논문집
• /
• pp.293-297
• /
• 2004

This paper is described manufacturing to jewelry by using rapid prototype. At that time, the SLC file is useful for solved generating errors to part build file. Then. we have reduced the time of manufacturing complicated three-dimensional form. Generally, it is used the STL file for rapid prototype that it is necessary to considerable time when complicated firm as jewelry generated pan build file. But the SLC file is solved to problem because it consists of configuration of a section. Neter the less, Generating Part build file hate had a lot of problem when the SLC file is used.

• International journal of advanced smart convergence
• /
• 제1권1호
• /
• pp.34-37
• /
• 2012

In a storage system, the performance of data deduplication can be increased if we consider the file modification pattern. For example, if a file is modified at the end of file region then fixed-length chunking algorithm superior to variable-length chunking. Therefore, it is important to predict in which location of a file is modified between files. In this paper, the essential idea is to exploit an efficient file pattern checking scheme that can be used for data deduplication system. The file modification pattern can be used for elaborating data deduplication system for selecting deduplication algorithm. Experiment result shows that the proposed system can predict file modification region with high probability.