• Restorative Dentistry and Endodontics
• /
• v.27 no.6
• /
• pp.612-621
• /
• 2002

The purpose of this study was to compare the histomorphological change of curved root canal preparation using GT rotary File, Profile .04 taper and stainless steel K-file. 45 mesial canals(over 20 degree) of extracted human mandibular first molars were mounted in resin using a modified Bramante muffle system and divided into three groups. The roots were cross-sectioned at 2.5mm 5mm and 8mm levels from apical foramen. Tracings of the canals were made from preinstrumentation pictures of the cross section. The canals were prepared using a step-back technique with stainless steel K file(group 1), Profile .04 taper rotary file(group 2) and GT rotary file(group 3). Tracings of the prepared canals were made from postinstrumentation picture. Canal centring ratio. amount of transportation, area of dentin removed and shape of canal were measured and statistically were evaluated with Student-Newman-Keuls test using Sigma Stat(Jandel Scientific Software, USA). The results were as followings : 1 Amount of transportation of group 2 was the lowest at apical part, but there was no statistical difference. The direction of transportation was the outside of curvature at apical part. 2. Centering ratio at the apical part of group 1 was the highest, and there was statistical differences between apical and middle part, apical and coronal part(p＜0.05). Centering ratio at the middle part of group 3 was the lowest, and there was statistical difference between apical and middle part(p＜0.05). Centering ratio of group 2 was the lowest at apical part, but there was no statistical difference. 3. Amount of dentin removed of group 1 was the highest at coronal, middle and apical part among three groups, and there was statistical difference(p＜0.05). 4. The majority of the cross-sectioned canal shape after instrumentation were irregular at coronal, middle and apical part. But there are more number of round shaped canals at group 3 than other group.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.472-483
• /
• 2002

This paper presents the design and implementation of a cache file system, umcFS, which is specifically designed to provide an efficient caching and transmission of streaming media. The proposed file system is based on the concept of file disk and implemented as an application level on top of a general-purpose file system. The file disk favors the continuity of cached media and provides an efficient I/O mechanism for cache server. umcFS statically allocates control blocks as well as media cache blocks. These blocks are referenced by the single-level indirect management structure. As the file system is designed as an application level, it is easy to develop and port to other systems. The performance of the implemented system shows that umcFS performs about 13% better than the native file system in randomly accessing the cache blocks of 1024KB.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.683-695
• /
• 2007

NAND flash memory-based file systems cannot store their system-related information in the file system due to wear-leveling of NAND flash memory. This forces NAND flash memory-based file systems to scan the whole flash memory during their mounts. The mount time usually increases linearly according to the size of and the usage pattern of the flash memory. NAND flash memory has been widely used as the storage medium of mobile devices. Due to the fact that mobile devices have unstable power supply, the file system for NAND flash memory requires stable recovery mechanism from power failure. In this paper, we present design and implementation of a new NAND flash memory-based file system that provides fast mount and enhanced stability. Our file system mounts 19 times faster than JFFS2's and 2 times faster than YAFFS's. The stability of our file system is also shown to be equivalent to that of JFFS2.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.632-639
• /
• 2014

In this paper, we propose a PC's self-monitoring system for protecting illegal outflow of important personal files, which are managed in the Windows environment PC. This paper is based on the idea that it should be a read (access) file operation in order to outflow files through the network. To compare the information (name, some content) obtained from all operations of the reading of the 'Windows File System Driver' and captured transmission packets of mini port of 'Windows NDIS (Network Driver Interface Specification) Driver', and, if two pieces of information match, this system will determine the transmission to user. In this paper, tentatively, we developed a function to gather file information about file read operation and developed a function for transmission packet capture. This demonstration implementation showed that the proposed process has validity and the proposed process verified that it does not significantly affect the PC's performance.

• Journal of Digital Contents Society
• /
• v.16 no.2
• /
• pp.299-306
• /
• 2015

In this paper, we research to secure stability of data storing/searching on NoSQL implemented on Distributed File System. When implementing NoSQL on Distributed File System, we faced that random write on Distributed File System is almost impossible. To solve this problem, a concept of Intermediate-File was employed, and then it has been achieved that our system resist any failure circumstance. Additionally, since we discovered its performance cannot be as fast as general File System, by redefining the file block unit for our NoSQL system, we have prevented a slowdown in system performance. As a result, we are able to develop highly scalable NoSQL as Distributed File System, which fulfills basic conditions of transaction: Atomicity, Consistency, Isolation, and Performance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.1
• /
• pp.43-50
• /
• 2013

File identification and analysis is an important process of computer forensics, since the process determines which subjects are necessary to be collected and analyzed as digital evidence. An efficient file classification aids in the file identification, especially in case of copyright infringement where we often have huge amounts of files. A lot of file classification methods have been proposed by far, but they have mostly focused on classifying malicious behaviors based on known information. In copyright infringement cases, we need a different approach since our subject includes not only malicious codes, but also vast number of normal files. In this paper, we propose an efficient file classification method that relies on undocumented information in the header of the PE format files. Out method is useful in copyright infringement cases, being applied to any sort of PE format executable file whether the file is malicious, packed, mutated, transformed, virtualized, obfuscated, or not.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.57-64
• /
• 2008

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The proposed policy considers file size to reduce the number of files corresponding to a requested file rather than forecasting the uncertain future for replacement. The results of the simulation show that hit ratio was similar when the cache size was small, but the proposed policy was superior to traditional policies when the cache size was large.

• Restorative Dentistry and Endodontics
• /
• v.28 no.1
• /
• pp.64-71
• /
• 2003

The purpose of this study was to compare the initial apical file(IAF) first Ole that fits to the apex in each canal before and after early flaring to analyze if the size of file to fit to the apex would increase after flaring. Eighty anterior teeth with complete apical formation and patent foramens were selected. The samples were randomly divided into 4 groups(GG, OS, GT, PT Group) of 20 teeth each. A file was fit to the apex in each canal and that size recorded. Radicular flaring were completed using different types of instruments. After flaring a file was again fit to the apex in the same manner as before and its size recorded. The results of this study were as follows : 1. The mean diameter of IAF before flaring(file diameters in $mm{\times}10^{-2}$) was $19.81{\pm}8.32$ before and $25.94{\pm}9.21$ after(p<0.05). 2. The increase in diameter of IAF was approximately one file size for all groups. 3. Ranking of increasing diameter of IAF were GG>CT>OS>PT group. There was a statistically significant difference between before and after flaring(p<0.05). 4 Ranking of the time for flaring were GG>GT>OS>PT group. There was a statistically significant difference between GG group and other groups(p<0.05). 5. In the case without change of IAF diameter, they showed decrease in force after flaring when IAF was pulled out from root canal(p<0.05). This study suggested that early radicular flaring increases the file size that is snug at the apex, and awareness of that difference gives the clinician a better sense of canal size. Early flaring of the canal provides better apical size information and with this awareness, a better decision can be made concerning the appropriate final diameter needed for complete apical shaping.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.39-46
• /
• 2007

Recently flash memory is widely accepted as a storage devise of embedded systems for portability and performance reasons. Flash memory has many distinguishing features compared to legacy magnetic disks. Especially, a file system for flash memory usually assumes the form of log-structured file system and it employs garbage collector accordingly. Since the garbage collector can greatly affect the performance of file system, it should be designed carefully considering flash memory features. In this paper, we suggest a new garbage collector for existing JFFS2 (Journaling Flash File System II) file system. By extensive performance evaluation, we show that the proposed garbage collector achieves improved performance in terms of flash memory consumption rate, increased flash memory life time, and improved wear-leveling.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.51-57
• /
• 2013

Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.