• Title/Summary/Keyword: Case-file

Search Result 364, Processing Time 0.021 seconds

Ingestion and surgical retrieval of an endodontic file: a case report

  • Devon Marta Ptak;Elinor Alon;Robert Bruce Amato;Julia Tassinari;Adrian Velasquez
    • Restorative Dentistry and Endodontics
    • /
    • v.48 no.4
    • /
    • pp.32.1-32.8
    • /
    • 2023
  • Ingestions and aspirations of foreign bodies are rare, but do occasionally occur during dental treatment. Although reports exist, few include photos demonstrating the extensive surgical intervention that may be necessary to manage such events. Perhaps this lack of visualization, and associated lack of awareness, is one of the reasons some clinicians still provide nonsurgical root canal therapy (NSRCT) without a rubber dam. This case report outlines the medical treatment of a 30-year-old male who initially presented to a general dentist's office (not associated with the authors) for NSRCT of their mandibular right first molar. A rubber dam was not used for this procedure, during which the accidental ingestion of an endodontic K-file occurred. The patient was subsequently hospitalized for evaluation and treatment, consisting of numerous imaging studies, endoscopic evaluation, and surgical removal of the file from his small intestine. The ingestion of foreign bodies, and the associated complications, can be reduced through the routine use of a rubber dam, which is considered the standard of care for NSRCT. This case graphically illustrates the potential consequences associated with deviating from the standard of care and should remind clinicians that a rubber dam is necessary for all cases of NSRCT.

A Classification Method for Executable Files based on Comparison of Undocumented Information in the PE Header (실행파일 헤더내 문서화되지 않은 정보의 비교를 통한 실행파일 분류 방법)

  • Kim, Jung-Sun;Kang, Jung-Min;Kim, Kang-San;Shin, Wook
    • 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 ANALYSIS OF INITIAL APICAL FILE SIZE BEFORE AND AFTER CORONAL FLARING (Coronal flaring 전, 후 초기근관장 파일크기의 분석)

  • Hwang, Ho-Keel;Park, Chan-Ho;Bae, Seong-Chul
    • 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.

MANAGEMENT OF SEPARATED FILE IN THE ROOT CANAL (근관 내 File의 파절 시 대처 방안)

  • Kim, Hye-Jeong;Jang, Hoon-Sang;Park, Se-Hee;Cho, Kyung-Mo;Kim, Jin-Woo
    • Restorative Dentistry and Endodontics
    • /
    • v.31 no.3
    • /
    • pp.161-168
    • /
    • 2006
  • During root canal preparation procedures, the potential for instrument separation is always present. Files, a lentulo, a Gates-Glidden (GG) bur or any manufactured obstruction can be left behind in the canal Nickel-titanium (NiTi) rotary files are in common usage in these days. Despite their undeniable advantages, there is a potential risk of separation within the canals. It is very rapid, unpredictable, and creates a great deal of stress for the practitioner. When an endodontic instrument separates, the best option is to remove it. Ultrasonic instruments and microscopes have improved the success rate for removing separated instruments. But It is difficult and not always possible. Therefore prevention is the key. In this case report, several management methods of separated file in the canal are presented.

Data Hiding in NTFS Timestamps for Anti-Forensics

  • Cho, Gyu-Sang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.31-40
    • /
    • 2016
  • In this paper, we propose a new anti-forensic method for hiding data in the timestamp of a file in the Windows NTFS filesystem. The main idea of the proposed method is to utilize the 16 least significant bits of the 64 bits in the timestamps. The 64-bit timestamp format represents a number of 100-nanosecond intervals, which are small enough to appear in less than a second, and are not commonly displayed with full precision in the Windows Explorer window or the file browsers of forensic tools. This allows them to be manipulated for other purposes. Every file has $STANDARD_INFORMATION and $FILE_NAME attributes, and each attribute has four timestamps respectively, so we can use 16 bytes to hide data. Without any changes in an original timestamp of "year-month-day hour:min:sec" format, we intentionally put manipulated data into the 16 least significant bits, making the existence of the hidden data in the timestamps difficult to uncover or detect. We demonstrated the applicability and feasibility of the proposed method with a test case.

Multiple Layer File Format for Safe Collaborative Design (안전한 협업 디자인 작업을 위한 다중 레이어 파일 포맷)

  • Kim, Kichang;Yoo, Sang Bong
    • The Journal of Society for e-Business Studies
    • /
    • v.18 no.4
    • /
    • pp.45-65
    • /
    • 2013
  • A design file can get larger in size as the complexity of the target object increases. A large design file may reside in a large parallel computing system, such as cloud computing systems, and many designers may work concurrently on the same design file. In such a case, it is obvious that we need some kind of protection mechanism so that each user can access only the area of the file he or she is entitled to. Two approaches can be taken for this problem: one is the traditional access control mechanisms and the other encryption techniques. We take the latter approach to ensure the safety of the file even in public domain such as clouding systems, and in this paper, we suggest an encryption scheme for a file where the file is encrypted in multi-layer so that each user is allowed to access the file only at the layer for which the user has the proper access right. Each layer of the file is encrypted with different keys and these keys are exposed only to those who have the right access permit. The paper explains the necessary file format to achieve this goal and discusses the file manipulation functions to handle this new file format.

A Length-based File Fuzzing Test Suite Reduction Algorithm for Evaluation of Software Vulnerability (소프트웨어 취약성 평가를 위한 길이기반 파일 퍼징 테스트 슈트 축약 알고리즘)

  • Lee, Jaeseo;Kim, Jong-Myong;Kim, SuYong;Yun, Young-Tae;Kim, Yong-Min;Noh, Bong-Nam
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.2
    • /
    • pp.231-242
    • /
    • 2013
  • Recently, automated software testing methods such as fuzzing have been researched to find software vulnerabilities. The purpose of fuzzing is to disclose software vulnerabilities by providing a software with malformed data. In order to increase the probability of vulnerability discovery by fuzzing, we must solve the test suite reduction problem because the probability depends on the test case quality. In this paper, we propose a new method to solve the test suite reduction problem which is suitable for the long test case such as file. First, we suggested the length of test case as a measure in addition to old measures such as coverage and redundancy. Next we designed a test suite reduction algorithm using the new measure. In the experimental results, the proposed algorithm showed better performance in the size and length reduction ratio of the test suite than previous studies. Finally, results from an empirical study suggested the viability of our proposed measure and algorithm for file fuzzing.

Endodontic treatment of mandibular molar with root dilaceration using Reciproc single-file system

  • Meireles, Daniely Amorin;Bastos, Mariana Mena Barreto;Marques, Andre Augusto Franco;Garcia, Lucas Da Fonseca Roberti;Sponchiado, Emilio Carlos Junior
    • Restorative Dentistry and Endodontics
    • /
    • v.38 no.3
    • /
    • pp.167-171
    • /
    • 2013
  • Biomechanical preparation of root canals with accentuated curvature is challenging. New rotatory systems, such as Reciproc, require a shorter period of time to prepare curved canals, and became a viable alternative for endodontic treatment of teeth with root dilaceration. Thus, this study aimed to report a clinical case of endodontic therapy of root with accentuated dilaceration using Reciproc single-file system. Mandibular right second molar was diagnosed as asymptomatic irreversible pulpitis. Pulp chamber access was performed, and glide path was created with #10 K-file (Dentsply Maillefer) and PathFile #13, #16 and #19 (Dentsply Maillefer) up to the temporary working length. The working length measured corresponded to 20 mm in the mesio-buccal and mesio-lingual canals, and 22 mm in the distal canal. The R25 file (VDW GmbH) was used in all the canals for instrumentation and final preparation, followed by filling with Reciproc gutta-percha cones (VDW GmbH) and AH Plus sealer (Dentsply Maillefer), using thermal compaction technique. The case has been receiving follow-up for 6 mon and no painful symptomatology or periapical lesions have been found. Despite the difficulties, the treatment could be performed in a shorter period of time than the conventional methods.

Construction of a Simulator by Expanded SARA Model for File Transfer via Satellite and Terrestrial Links (위성과 지상회선에서 파일전송을 위한 확장된 SARA 모델 시뮬레이터 구성)

  • 박진양
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.2
    • /
    • pp.131-140
    • /
    • 2001
  • In this paper file transfer efficiencies of satellite and terrestrial links are analyzed, and a simulator that satellite links are supplementarily expanded to SARA(System ARchitect’ Apprentice) model, a terrestrial model of CSDN interface, is constructed. And in satellite transmission an interpretative method and a simulator of file transfer are proposed to evaluate the efficiency of file transfer. The parameters used are the message length and transmission time, and the optimum message length by transmission speed of satellite links. From the results of evaluation, in satellite transfer, it is found that when the length of message is shorter than 512 byte, the file transfer time becomes extremely long and when the length of message is set at 1,024 byte the file transfer time becomes minimum, and if the length of message is set more longer, the file transfer time abruptly increases from 2,048 byte. Therefore, from the results of file transfer simulation in the case of utilizing satellite transmission, it is found that the optimum massage length in the minimum transfer time is present closely at 1,024 byte.

  • PDF

Design and Implementation of Kernel-Level Split and Merge Operations for Efficient File Transfer in Cyber-Physical System (사이버 물리 시스템에서 효율적인 파일 전송을 위한 커널 레벨 분할 및 결합 연산의 설계와 구현)

  • Park, Hyunchan;Jang, Jun-Hee;Lee, Junseok
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.5
    • /
    • pp.249-258
    • /
    • 2019
  • In the cyber-physical system, big data collected from numerous sensors and IoT devices is transferred to the Cloud for processing and analysis. When transferring data to the Cloud, merging data into one single file is more efficient than using the data in the form of split files. However, current merging and splitting operations are performed at the user-level and require many I / O requests to memory and storage devices, which is very inefficient and time-consuming. To solve this problem, this paper proposes kernel-level partitioning and combining operations. At the kernel level, splitting and merging files can be done with very little overhead by modifying the file system metadata. We have designed the proposed algorithm in detail and implemented it in the Linux Ext4 file system. In our experiments with the real Cloud storage system, our technique has achieved a transfer time of up to only 17% compared to the case of transferring split files. It also confirmed that the time required can be reduced by up to 0.5% compared to the existing user-level method.