• Title/Summary/Keyword: file access

Search Result 406, Processing Time 0.025 seconds

An evaluation of the accuracy of Root ZX according to the conditions of major apical foramen (주근단공의 조건에 따른 Root ZX의 정확성 평가)

  • Park, Shin-Young;Lee, Dong-Kyun;Hwang, Ho-Keel
    • Restorative Dentistry and Endodontics
    • /
    • v.37 no.2
    • /
    • pp.68-73
    • /
    • 2012
  • Objectives: The purpose of this study was to assess the accuracy of Root ZX (J. Morita Corp.) according to the location of major foramen and open apex. Materials and Methods: 81 mandibular premolars with mature apices were selected. After access preparation, 27 teeth were instrumented to simulate open apices. 54 teeth were classified according to location of major foramen under surgical microscope (${\times}16$). The file was fixed at the location of apical constriction by Root ZX using glass ionomer cement .The apical 4 mm of the apex was exposed and photo was taken and the distance from file tip to the major foramen was measured by calibrating metal ruler on graph paper. The results were statistically analyzed using ANOVA and Scheffe test at p < 0.05 level. Results: Mean distance from file tip to major foramen was 0.308 mm in Tip foramen group (I), 0.519 mm in Lateral foramen group (II) and 0.932 mm in open apex group (III). Root ZX located apical constriction accurately within ${\pm}0.5mm$ in group I of 85.71%, in group II of 59.09%, and in group III of 33.33%. There was a statistically significant difference between group I and III (p < 0.05). Conclusion: Root ZX located apical constriction accurately regardless of location of major foramen. However, Root ZX couldn't find it in open apex. Clinicians have to use a combination of methods to determine an appropriate working length at open apex. It may be more successful than relying on just electronic apex locator.

Web-based Medical Information System supporting DICOM Specification (DICOM 표준을 지원하는 웹 기반 의료 정보 시스템)

  • Kwon, Gi-Beom;Kim, Il-Kon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.4
    • /
    • pp.317-323
    • /
    • 2001
  • DICOM(Digital Imaging and Communications in MediCine), standard of medical image operation, present the methods for communications and Storage of Medical Image. medical image acquired from patient in hospital made DICOM files. this paper purposes design and implementation methodologies of a web-based medical information system that consists of DICOM (Digital Imaging and Communications in Medicine) databases and functional components of a web server in order to support the access of medical information with Intemet web browser. we store the patient and image information to database using reading the group and element oJ DICOM file. we made file transfer module by implementing DICOM Store service, in result, we can transfer DICOM file to IF based host or computer. We compose web component of communications and Storage service, user be used DICOM Service by web Browser.

  • PDF

Policy for Selective Flushing of Smartphone Buffer Cache using Persistent Memory (영속 메모리를 이용한 스마트폰 버퍼 캐시의 선별적 플러시 정책)

  • Lim, Soojung;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.1
    • /
    • pp.71-76
    • /
    • 2022
  • Buffer cache bridges the performance gap between memory and storage, but its effectiveness is limited due to periodic flush, performed to prevent data loss in smartphones. This paper shows that selective flushing technique with small persistent memory can reduce the flushing overhead of smartphone buffer cache significantly. This is due to our I/O analysis of smartphone applications in that a certain hot data account for most of file writes, while a large proportion of file data incurs single-writes. The proposed selective flushing policy performs flushing to persistent memory for frequently updated data, and storage flushing is performed only for single-write data. This eliminates storage write traffic and also improves the space efficiency of persistent memory. Simulations with popular smartphone application I/O traces show that the proposed policy reduces write traffic to storage by 24.8% on average and up to 37.8%.

A Study on Improvement of Buffer Cache Performance for File I/O in Deep Learning (딥러닝의 파일 입출력을 위한 버퍼캐시 성능 개선 연구)

  • Jeongha Lee;Hyokyung Bahn
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.2
    • /
    • pp.93-98
    • /
    • 2024
  • With the rapid advance in AI (artificial intelligence) and high-performance computing technologies, deep learning is being used in various fields. Deep learning proceeds training by randomly reading a large amount of data and repeats this process. A large number of files are randomly repeatedly referenced during deep learning, which shows different access characteristics from traditional workloads with temporal locality. In order to cope with the difficulty in caching caused by deep learning, we propose a new sampling method that aims at reducing the randomness of dataset reading and adaptively operating on existing buffer cache algorithms. We show that the proposed policy reduces the miss rate of the buffer cache by 16% on average and up to 33% compared to the existing method, and improves the execution time by up to 24%.

Development of an X3D Python Language Binding Viewer Providing a 3D Data Interface (3D 데이터 인터페이스를 제공하는 X3D Python 언어 바인딩 뷰어 개발)

  • Kim, Ha Seong;Lee, Myeong Won
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.6
    • /
    • pp.243-250
    • /
    • 2021
  • With the increased development of 3D VR applications augmented by recent VR/AR/MR technologies and by the advance of 3D devices, interchangeability and portability of 3D data have become essential. 3D files should be processed in a standard data format for common usage between applications. Providing standardized libraries and data structures along with the standard file format means that a more efficient system organization is possible and unnecessary processing due to the usage of different file formats and data structures depending on the applications can be omitted. In order to provide the function of using a common data file and data structure, this research is intended to provide a programming binding tool for generating and storing standardized data so that various services can be developed by accessing the common 3D files. To achieve this, this paper defines a common data structure including classes and functions to access X3D files with a standardized scheme using the Python programming language. It describes the implementation of a Python language binding viewer, which is an X3D VR viewer for rendering standard X3D data files based on the language binding interface. The VR viewer includes Python based 3D scene libraries and a data structure for creation, modification, exchange, and transfer of X3D objects. In addition, the viewer displays X3D objects and processes events using the libraries and data structure.

A Global Buffer Manager for a Shared Disk File System in SAN Clusters (SAN 환경에서 공유 디스크 파일 시스템을 위한 전역 버퍼 관리자)

  • 박선영;손덕주;신범주;김학영;김명준
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.2
    • /
    • pp.134-145
    • /
    • 2004
  • With rapid growth in the amount of data transferred on the Internet, traditional storage systems have reached the limits of their capacity and performance. SAN (Storage Area Network), which connects hosts to disk with the Fibre Channel switches, provides one of the powerful solutions to scale the data storage and servers. In this environment, the maintenance of data consistency among hosts is an important issue because multiple hosts share the files on disks attached to the SAN. To preserve data consistency, each host can execute the disk I/O whenever disk read and write operations are requested. However, frequent disk I/O requests cause the deterioration of the overall performance of a SAN cluster. In this paper, we introduce a SANtopia global buffer manager to improve the performance of a SAN cluster reducing the number of disk I/Os. We describe the design and algorithms of the SANtopia global buffer manager, which provides a buffer cache sharing mechanism among the hosts in the SAN cluster. Micro-benchmark results to measure the performance of block I/O operations show that the global buffer manager achieves speed-up by the factor of 1.8-12.8 compared with the existing method using disk I/O operations. Also, File system micro-benchmark results show that SANtopia file system with the global buffer manager improves performance by the factor of 1.06 in case of directories and 1.14 in case of files compared with the file system without a global buffer manager.

A Method to Express Audio Binary Files by Color QR Codes and Its Application (오디오 바이너리 파일을 컬러 QR코드로 표현하는 방법과 그 응용)

  • Lee, Choong Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.2
    • /
    • pp.47-53
    • /
    • 2018
  • This paper proposes a method to express an MP3 audio file by a series of color QR codes which can be printed on the paper. Moreover, the method can compress the data considerably. Firstly, an MP3 file is divided into many small files which have maximum capacity of binary file of a QR code. Secondly, the multiple files are converted to multiple black-and-white QR codes. Lastly, every three QR codes are combined into color QR codes. When combining, each of three black-and-white QR codes are regarded as red, green, blue components respectively. In this method, the areas of a color QR code where two QR codes are overlapped are expressed by the colors Cyan, Magenta and Yellow. And the areas where three components are overlapped are expressed by white color. Contrarily, the areas that no components are overlapped are expressed by white color. Experimentation result shows that an MP3 file with 8.5MB the original MP3 files are compressed with the compression rate around 15.7. This method has the advantage that can be used in the environments that the internet access is impossible.

A Parallel Processing Technique for Large Spatial Data (대용량 공간 데이터를 위한 병렬 처리 기법)

  • Park, Seunghyun;Oh, Byoung-Woo
    • Spatial Information Research
    • /
    • v.23 no.2
    • /
    • pp.1-9
    • /
    • 2015
  • Graphical processing unit (GPU) contains many arithmetic logic units (ALUs). Because many ALUs can be exploited to process parallel processing, GPU provides efficient data processing. The spatial data require many geographic coordinates to represent the shape of them in a map. The coordinates are usually stored as geodetic longitude and latitude. To display a map in 2-dimensional Cartesian coordinate system, the geodetic longitude and latitude should be converted to the Universal Transverse Mercator (UTM) coordinate system. The conversion to the other coordinate system and the rendering process to represent the converted coordinates to screen use complex floating-point computations. In this paper, we propose a parallel processing technique that processes the conversion and the rendering using the GPU to improve the performance. Large spatial data is stored in the disk on files. To process the large amount of spatial data efficiently, we propose a technique that merges the spatial data files to a large file and access the file with the method of memory mapped file. We implement the proposed technique and perform the experiment with the 747,302,971 points of the TIGER/Line spatial data. The result of the experiment is that the conversion time for the coordinate systems with the GPU is 30.16 times faster than the CPU only method and the rendering time is 80.40 times faster than the CPU.

SEM EVALUATION OF THE PREPARED ROOT CANALS BY HAND AND Ni-Ti ROTARY ROOT CANAL INSTRUMENTS (Hand & rotary root canal instrument의 근관내 삭제 형태에 관한 전자현미경적 비교)

  • Oh, Tae-Seok;Park, Jeong-Won
    • Restorative Dentistry and Endodontics
    • /
    • v.23 no.1
    • /
    • pp.477-486
    • /
    • 1998
  • Recently the development of rotary instrument makes it possible that in root canal treatment operator saves much more time, maintans original curved canal shape and easily prepares continuous tapered root canal. The purpose of this experiment was to examine the smoothness of the internal surface of prepared root canal and the effectiveness of debridement in prepared root canal by SEM for the comparison of hand and Ni-Ti rotary instrument. 25 extracted human teeth were access opened and # 10 K-type file was introduced into canal until it was appeared at the apical foramen. The working length was established by subtracting 0.5mm from this measurement. Group 1. The root canal preparation was done to # 30 with working length and then step-back until # 45 with K-Flexofile (Maillefer, Swiss). Group 2. Root canal preparation was done by Naviflex Ni-Ti file (Brasseler, USA) as the same technique with group 1. Group 3. Canal was prepared by Profile .04 (Maillefer, Swiss) taper until #30. Group 4. With use of Quantec (Tycom, USA) root canal was prepared from file number 1 to 8. In group 1 and 2, the root canal irrigant was NaOCl and the other groups, NaOCl and RC-prep (Premine Dental Products, USA) was used. The prepared teeth were notched with high-speed bur as bucco-lingual direction and fractured with chisel and mallet, then examined with SEM. Group 1 showed smooth internal surface. There were scratches mainly to the axial direction. Group 2 showed similar characteristics to those in group 1. Group 3 showed more smoother and linear cutting surface with bised scratches. Group 4 has the almost same characteristics group 3 and there was no difference in the file design. Ni-Ti rotary root canal instrument prepare the dentinal wall more smoother than hand instrument. The effectiveness of debridement was not fully affected by file design. The isthmus area and accessory canals of the root canal system were not prepared in any group. According to the result, hand and rotary type instrumentation techniques were effective in removal of major amount of tissue from root canal but it was not complete. In the direction of cutting movement there was difference between them.

  • PDF

Persistent Page Table and File System Journaling Scheme for NVM Storage (비휘발성 메모리 저장장치를 위한 영속적 페이지 테이블 및 파일시스템 저널링 기법)

  • Ahn, Jae-hyeong;Hyun, Choul-seung;Lee, Dong-hee
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.80-90
    • /
    • 2019
  • Even though Non-Volatile Memory (NVM) is used for data storage, a page table should be built to access data in it. And this observation leads us to the Persistent Page Table (PPT) scheme that keeps the page table in NVM persistently. By the way, processors have different page table structures and really operational page table cannot be built without virtual and physical addresses of NVM. However, those addresses are determined dynamically when NVM storage is attached to the system. Thus, the PPT should have system-independent and also address-independent structure and really working system-dependent page table should be built from the PPT. Moreover, entries of PPT should be updated atomically and, in this paper, we describe the design of PPT that meets those requirements. And we investigate how file systems can decrease the journaling overhead with the swap operation, which is a new operation created by the PPT. We modified the Ext4 file system in Linux and experiments conducted with Filebench workloads show that the swap operation enhances file system performance up to 60%.