• 한국컴퓨터정보학회논문지
• /
• 제23권8호
• /
• pp.85-93
• /
• 2018

In this research, it is proposed that a method to hide data by modifying directory index entry information. It consists of two methods: a directory list hiding and a file contents hiding. The directory list hiding method is to avoid the list of files from appearing in the file explorer window or the command prompt window. By modifying the file names of several index entries to make them duplicated, if the duplicated files are deleted, then the only the original file is deleted, but the modified files are retained in the MFT entry intact. So, the fact that these files are hidden is not exposed. The file contents hiding is to allocate data to be hidden on an empty index record page that is not used. If many files are made in the directory, several 4KB index records are allocated. NTFS leaves the empty index records unchanged after deleting the files. By modifying the run-list of the index record with the cluster number of the file-to-hide, the contents of the file-to-hide are hidden in the index record. By applying the proposed method to the case of hiding two files, the file lists are not exposed in the file explorer and the command prompt window, and the contents of the file-to-hide are hidden in the empty index record. It is proved that the proposed method has effectiveness and validity.

• 디지털산업정보학회논문지
• /
• 제11권2호
• /
• pp.73-90
• /
• 2015

When we apply file commands on files in a directory, the directory as well as the file suffer changes in timestamps of MFT entry. Based on understanding of these changes, this work provides a digital forensic analysis on the timestamp changes of the directory influenced by execution of file commands. NTFS utilizes B-tree indexing structure for managing efficient storage of a huge number of files and fast lookups, which changes an index tree of the directory index when files are operated by commands. From a digital forensic point of view, we try to understand behaviors of the B-tree indexes and are looking for traces of files to collect information. But it is not easy to analyze the directory index entry when the file commands are executed. And researches on a digital forensic about NTFS directory and B-tree indexing are comparatively rare. Focusing on the fact, we present, in this paper, directory timestamp changes after executing file commands including a creation, a copy, a deletion etc are analyzed and a method for finding forensic evidences of a deletion of directory containing files. With some cases, i.e. examples of file copy and file deletion command, analyses on the problem of timestamp changes of the directory are given and the problem of finding evidences of a deletion of directory containging files are shown.

• 정보처리학회논문지A
• /
• 제17A권5호
• /
• pp.229-236
• /
• 2010

인터넷이나 기업체 안에서 생성되는 문서의 수가 빠르게 증가하고 있고 이에 따라 효율적인 문서 검색 서비스의 중요성도 함께 커지고 있다. 이런 검색 환경에서 사용자의 검색 질의를 미리 예측할 수 없기 때문에 문서 내의 키워드를 자동 추출하여 색인어로 사용하는 전문검색(full-text search)이 일반적으로 적용된다. 전문검색을 위해 생성된 색인 파일의 크기는 문서 수 증가로 대용량화 되고, 이런 대용량 색인에 대한 다중 키워드 질의 처리에는 과도한 디스크 비용이 초래될 수 있다. 논문에서는 이런 비용 문제를 해결하기 위해 대용량 문서의 전문검색 시스템에서 다중 키워드 질의를 효율적으로 처리할 수 있게 하는 색인 파일 구조 및 관리 기법을 제안한다. 제안된 방법은 다중 키워드 검색에 적합한 것으로 알려진 역파일을 기본 색인 구조로 하며, 질의 처리의 조인 연산과 랭킹 연산에 적합하도록 색인 파일을 계층화한다. 이를 바탕으로 다중 키워드 질의를 구성할 확률이 높은 키워드 쌍에 대한 조인 연산 결과를 주기억장치 공간에 동적으로 저장함으로써 디스크 사용량을 크게 줄일 수 있다. 논문에서는 제안된 기법의 우수성을 보이기 위해 디스크 비용 모델에 기반한 성능 비교도 수행한다.

• 한국컴퓨터정보학회논문지
• /
• 제11권5호
• /
• pp.69-74
• /
• 2006

최근 멀티미디어 내용기반 검색 기술의 발달로 음악 정보 검색 기술 중 하나인 오디오 특징을 이용한 뮤지션 검색에 대한 관심이 증대되고 있다. 그러나 이와 관련한 음악 데이타베이스의 인덱싱 기법에 대한 연구는 부족한 실정이다. 본 논문에서는 시계열 패턴 인덱스 화일의 공간 분할 방법을 이용하여 오디오 특징 데이터를 사용한 뮤지션 검색 기법을 제시한다. 뮤지션 탐색을 위하여 오디오의 특징을 사용하며, 유사한 후보 뮤지션의 곡을 탐색하기 위한 인덱싱 기법으로 시계열 패턴 인덱스 화일을 사용한다. 실험 결과, 윤번 공간 분할 방법을 사용한 시계열 패턴 인덱스 화일이 뮤지션 검색에 있어서 효율적임을 보였다.

• 치과방사선
• /
• 제29권1호
• /
• pp.149-159
• /
• 1999

Purpose: The purpose of this study was to evaluate cervical lymph node metastasis of oral squamous cell carcinoma patients by MRI film and neural network system. Materials and Methods: The oral squamous cell carcinoma patients(21 patients. 59 lymph nodes) who have visited SNU hospital and been taken by MRI. were included in this study. Neck dissection operations were done and all of the cervical lymph nodes were confirmed with biopsy. In MR images. each lymph node were evaluated by using 6 MR imaging criteria(size. roundness. heterogeneity. rim enhancement. central necrosis, grouping) respectively. Positive predictive value. negative predictive value. and accuracy of each MR imaging criteria were calculated. At neural network system. the layers of neural network system consisted of 10 input layer units. 10 hidden layer units and 1 output layer unit. 6 MR imaging criteria previously described and 4 MR imaging criteria (site I-node level II and submandibular area. site II-other node level. shape I-oval. shape II-bean) were included for input layer units. The training files were made of 39 lymph nodes(24 metastatic lymph nodes. 10 non-metastatic lymph nodes) and the testing files were made of other 20 lymph nodes(10 metastatic lymph nodes. 10 non-metastatic lymph nodes). The neural network system was trained with training files and the output level (metastatic index) of testing files were acquired. Diagnosis was decided according to 4 different standard metastatic index-68. 78. 88. 98 respectively and positive predictive values. negative predictive values and accuracy of each standard metastatic index were calculated. Results: In the diagnosis of using single MR imaging criteria. the rim enhancement criteria had highest positive predictive value (0.95) and the size criteria had highest negative predictive value (0.77). In the diagnosis of using single MR imaging criteria. the highest accurate criteria was heterogeneity (accuracy: 0.81) and the lowest one was central necrosis (accuracy: 0.59). In the diagnosis of using neural network systems. the highest accurate standard metastatic index was 78. and that time. the accuracy was 0.90. Neural network system was more accurate than any other single MR imaging criteria in evaluating cervical lymph node metastasis. Conclusion: Neural network system has been shown to be more useful than any other single MR imaging criteria. In future. Neural network system will be powerful aiding tool in evaluating cervical node metastasis.

• 한국조명전기설비학회:학술대회논문집
• /
• 한국조명전기설비학회 2004년도 춘계학술대회 논문집
• /
• pp.90-94
• /
• 2004

Among various modern control theories, PID control has been well used for several decades. PID algorithms needs son tuning methods are used for selecting PID parameters. But in some cases various kinds of performance indices are used instead of well-known tuning rules, and so variable type of performance index must be tested so that controllers, output characteristics and disturbance rejection property meets some specifications. In this paper, linear conbinational type of performance using error signal, time, control input and robustness is used to the PID control of air conditioning system. By the 2 DOF PID parmeters minimizing perfromacne index, controllers, output characteristics and robustness properties are analyzed. Simulations are done with MATLAB m file and mdl files.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2913-2927
• /
• 2013

A data hiding scheme in HTML files is presented in this paper. Web pages are a very popular medium for broadcasting information and knowledge nowadays, and web pages are a good way to achieve the goal of secret message delivery because the different HTML coding codes will render the same screen in any of the popular browsers. The proposed method utilizes the HTML special space codes and sentence segmentation to conceal secret messages into a HTML file. The experimental results show that the stego HTML file generated by the proposed method is imperceptible. Also, the proposed method can conceal one more secret bit in every between-word location.

• 한국컴퓨터정보학회논문지
• /
• 제16권3호
• /
• pp.131-140
• /
• 2011

부패한 파일을 공유하거나, 인덱스 정보에 잘못된 인덱스 레코드를 삽입하는 등의 파일 오염문제는 대다수의 파일 공유 P2P 시스템들의 실질적인 문제가 되어 왔다. 이러한 파일 오염은 사용자들로 하여금 다운받아도 전혀 득이 되지 않는 오염된 파일들을 다운받도록 하거나, 존재하지 않는 파일들에 대한 비생산적인 다운로드 시도를 유도한다. 파일 오염은 네트워크 자원을 낭비할 뿐만 아니라, 사용자들의 활발한 참여를 제한하기 때문에 적절하게 대처하지 못한다면 향후 파일 공유 P2P 시스템 (혹은 비슷한 분산 환경 정보 공유 어플리케이션)의 성공을 기약하기 힘들다. 따라서 효과적인 오염방지 메커니즘의 개발이 시급하다. 본 논문은 대표적인 DHT (distributed hash table) 기반 P2P 시스템인 Kad 네트워크에서 사용자 행동양식 및 파일 오염에 대한 측정 연구를 통해 향후 효과적인 파일 오염방지 메커니즘을 개발하고자 하는 연구자들에게 실질적으로 활용 가능한 정보를 제공한다.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2003년도 하계학술대회 논문집
• /
• pp.169-172
• /
• 2003

PID control has been well used for several decade. For PID algorithm, some tuning methods are used and with these parameters, control system is designed. But in some cases various kinds of performance are needed, so variable type of performance index must be utilized so that the designed control system meets the conditions. This paper presents some linear combinational type of performance index and with numerical methods, the PID parameters are obtained. Moreover I-PD type controller is used so that this two degree of freedom controller may give more desirable output characteristics. Simulations are done with MATLAB m file and mdl files.

• 디지털산업정보학회논문지
• /
• 제11권4호
• /
• pp.69-79
• /
• 2015

This research proposes a modified data hiding method to hide data in a slack space of an NTFS index record. The existing data hiding method is for anti-forensics, which uses traces of file names of an index entry in an index record when files are deleted in a direcotry. The proposed method in this paper modifies the existing method to make non-admittable ASCII characters for a file name applicable. By improving the existing method, problems of a file creation error due to non-admittable characters are remedied; including the non-admittable 9 characters (i. e. slash /, colon :, greater than >, less than <, question mark ?, back slash ${\backslash}$, vertical bar |, semi-colon ;, esterisk * ), reserved file names(i. e. CON, PRN, AUX, NUL, COM1~COM9, LPT1~LPT9) and two non-admittable characters for an ending character of the file name(i. e. space and dot). Two results of the two message with non-admittable ASCII characters by keyboard inputs show the applicability of the proposed method.