• 제목/요약/키워드: Process of Data Deletion

검색결과 29건 처리시간 0.028초

데이터 폐기 지침 마련을 위한 기초 연구 (A Study on the Guideline for the Data Deletion)

  • 임태훈;서직수;김선영
    • 정보관리연구
    • /
    • 제41권4호
    • /
    • pp.165-186
    • /
    • 2010
  • 본 연구는 정보시스템의 운영 효율성과 관리 비용 절감을 도모하고자 불필요한 데이터를 폐기할 수 있는 기준과 근거를 탐색해 보았다. 국내외 법령 및 정책을 문헌조사하여 데이터 폐기 지침에 응용할 수 있는 내용을 도출하였으며, 이를 기초로 데이터 폐기를 위한 기초안을 마련하였다. 공공기관과 지자체 실무자를 대상으로 데이터 폐기 현황에 대한 면담조사와 데이터 폐기 지침 초안에 대한 설문조사를 실시하였고, 관련 이슈사항에 대해 의견을 수렴하였다. 그 결과, 데이터 폐기의 대상 유형과 절차, 폐기 방법 등을 포함한 지침을 마련할 수 있었다. 연구 결과로 마련된 데이터 폐기 지침을 시범 적용해 본 결과, 폐기 대상의 선정, 폐기 절차별 역할 담당자의 선정, 폐기 요청과 심의 등에 누락되거나 보완해야 할 사항은 나타나지 않아 지침이 실효성이 있는 것으로 파악되었다.

배열기반 데이터 구조를 이용한 간략한 divide-and-conquer 삼각화 알고리즘 (A Compact Divide-and-conquer Algorithm for Delaunay Triangulation with an Array-based Data Structure)

  • 양상욱;최영
    • 한국CDE학회논문집
    • /
    • 제14권4호
    • /
    • pp.217-224
    • /
    • 2009
  • Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

ISO 15926 기반의 참조 데이터 라이브러리 편집기의 개발 (Development of an Editor for Reference Data Library Based on ISO 15926)

  • 전영준;변수진;문두환
    • 한국CDE학회논문집
    • /
    • 제19권4호
    • /
    • pp.390-401
    • /
    • 2014
  • ISO 15926 is an international standard for integration of lifecycle data for process plants including oil and gas facilities. From the viewpoint of information modeling, ISO 15926 Parts 2 provides the general data model that is designed to be used in conjunction with reference data. Reference data are standard instances that represent classes, objects, properties, and templates common to a number of users, process plants, or both. ISO 15926 Parts 4 and 7 provide the initial set of classes, objects, properties and the initial set of templates, respectively. User-defined reference data specific to companies or organizations are defined by inheriting from the initial reference data and the initial set of templates. In order to support the extension of reference data and templates, an editor that provides creation, deletion and modification functions of user-defined reference data is needed. In this study, an editor for reference data based on ISO 15926 was developed. Sample reference data were encoded in OWL (web ontology language) according to the specification of ISO 15926 Part 8. iRINGTools and dot15926Editor were benchmarked for the design of GUI (graphical user interface). Reference data search, creation, modification, and deletion functions were implemented with XML (extensible markup language) DOM (document object model), and SPARQL (SPARQL protocol and RDF query language).

The effect of word frequency on the reduction of English CVCC syllables in spontaneous speech

  • Kim, Jungsun
    • 말소리와 음성과학
    • /
    • 제7권3호
    • /
    • pp.45-53
    • /
    • 2015
  • The current study investigated CVCC syllables in spontaneous American English speech to find out whether such syllables are produced as phonological units with a string of segments, showing a hierarchical structure. Transcribed data from the Buckeye Speech Corpus was used for the analysis in this study. The result of the current study showed that the constituents within a CVCC syllable as a phonological unit may have phonetic variations (namely, the final coda may undergo deletion). First, voiceless alveolar stops were the most frequently deleted when they occurred as the second final coda consonants of a CVCC syllable; this deletion may be an intermediate process on the way from the abstract form CVCC (with the rime VCC) to the actual pronunciation CVC (with the rime VC), a production strategy employed by some individual speakers. Second, in the internal structure of the rime, the proportion of deletion of the final coda consonant depended on the frequency of the word rather than on the position of postvocalic consonants on the sonority hierarchy. Finally, the segment following the consonant cluster proved to have an effect on the reduction of that cluster; more precisely, the following contrast was observed between obstruents and non-obstruents, reflecting the effect of sonority: when the segment following the consonant cluster was an obstruent, the proportion of deletion of the final coda consonant was increased. Among these results, the effect of word frequency played a critical role for promoting the deletion of the second coda consonant for clusters in CVCC syllables in spontaneous speech. The current study implies that the structure of syllables as phonological units can vary depending on individual speakers' lexical representation.

CONTINUOUS QUERY PROCESSING IN A DATA STREAM ENVIRONMENT

  • Lee, Dong-Gyu;Lee, Bong-Jae;Ryu, Keun-Ho
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
    • /
    • pp.3-5
    • /
    • 2007
  • Many continuous queries are important to be process efficiently in a data stream environment. It is applied a query index technique that takes linear performance irrespective of the number and width of intervals for processing many continuous queries. Previous researches are not able to support the dynamic insertion and deletion to arrange intervals for constructing an index previously. It shows that the insertion and search performance is slowed by the number and width of interval inserted. Many intervals have to be inserted and searched linearly in a data stream environment. Therefore, we propose Hashed Multiple Lists in order to process continuous queries linearly. Proposed technique shows fast linear search performance. It can be utilized the systems applying a sensor network, and preprocessing technique of spatiotemporal data mining.

  • PDF

생산효율화를 위한 설비보전관리 지원시스템에 관한 연구 -설비보전정보시스템을 중심으로- (A Study on the Equipment Maintenance Management Support System for Production Efficiency)

  • 송원섭
    • 산업경영시스템학회지
    • /
    • 제21권48호
    • /
    • pp.279-289
    • /
    • 1998
  • This study deals with the schemes of design, plan and operate maintenance management support systems and with the engineering approach for the solutions to build the maintenance management for the production efficiency. Maintenance Management Information System(MMIS) is the task that must focus on machinery historical data and planned maintenance action. Also the efficient supporting system in a maintenance management is achieved by database which is based on process of machinery's failure history. Designing method of maintenance management information system, maintenance modules are consisted of six factors ; machinery's historical data, lubrication control, check sheet, repair work, availability report, and performance report(control board and detailed reports), and then operators can rapidly utilize data in work place. In the implementation of designed model, program coding has been developed by Visual Basic 3.0. Data insertion, deletion and updating which perform menu screen is implemented by reading data from database. Implementation model based on LAN environment and related data is stored in Microsoft DBMS.

  • PDF

Realm 데이터베이스의 삭제된 레코드 복구 기법 (The Method of Recovery for Deleted Record of Realm Database)

  • 김준기;한재혁;최종현;이상진
    • 정보보호학회논문지
    • /
    • 제28권3호
    • /
    • pp.625-633
    • /
    • 2018
  • Realm은 모바일 기기에서 주로 사용되는 SQLite를 대체하기 위해 개발된 오픈 소스 데이터베이스이다. 데이터 베이스에 저장되는 데이터는 사용자의 행위를 파악하고 모바일 기기의 동작 여부를 확인하는 데 도움이 될 수 있어 모바일 기기를 대상으로 하는 디지털 포렌식 분석 과정에서 반드시 확인되어야 한다. 뿐만 아니라, 사용자가 의도적으로 데이터베이스에 저장된 데이터 삭제와 같은 안티 포렌식 기법을 사용할 수 있으므로 데이터베이스에서 삭제된 레코드를 복구하는 방법에 대한 연구가 필요하다. 본 논문은 Realm 데이터베이스 파일의 구조와 레코드의 저장 및 삭제 과정을 분석한 결과를 바탕으로 삭제된 후 덮어 쓰여지지 않은 레코드의 복구 기법을 제시하였다.

CNN 기반 동영상의 프레임 삭제 검출 기법 (Detection of Frame Deletion Using Convolutional Neural Network)

  • 홍진형;양윤모;오병태
    • 방송공학회논문지
    • /
    • 제23권6호
    • /
    • pp.886-895
    • /
    • 2018
  • 본 논문에서는 동영상의 압축 과정에서 발생하는 규칙성을 이용하여 동영상의 조작 여부를 검출하는 기법에 대해 소개한다. 제안방식은 동영상의 이중 압축과 일부 영상의 조작에 의해 잃어버린 계층적 규칙성을 이용한다. 이러한 불규칙성을 추출하기 위해 HEVC의 기본 단위인 CU와 TU의 분할정보를 이용한다. 성능 향상을 위해 지역적인 정보를 활용하여 CU와 TU의 분할 지도를 제작한 뒤, GoP 단위로 묶어 입력 데이터를 제작한다. 효과적인 분류를 위하여 3차원 합성곱 신경망을 이용하여 동영상의 이중 압축 및 조작 여부를 판단한다. 실험 결과, 기존의 기계학습 알고리즘을 이용한 연구 결과에 비해 더욱 효과적으로 동영상의 조작 여부를 판단함을 확인하였다.

XML 문서의 분할 인덱스 기법 (Indexing Methods of Splitting XML Documents)

  • 김종명;진민
    • 한국멀티미디어학회논문지
    • /
    • 제6권3호
    • /
    • pp.397-408
    • /
    • 2003
  • 기존의 Numbering 스킴을 이용한 XML 데이터의 인덱스 정의 방법은 개체가 삽입, 삭제, 갱신될 경우 인덱스가 재정의되어야 하는 문제점이 있다. 이러한 문제를 해결하기 위해서 본 논문은 블록단위의 인덱스기법을 제안한다. 블록과 블록사이는 많아야 하나의 관계가 유지 되도록 XML 데이터를 블록단위로 나누고, 각 블록에 대해 Numbering 스킴을 적용하여 인덱스를 정의한다. 이렇게 정의된 인덱스는 XML 데이터의 삽입, 삭제, 갱신의 경우 인덱스 재정의에 따른 오버헤드를 상당히 줄일 수 있다. 또한 XML 질의를 지원하기 위해 정의된 인덱스를 이용하여 두 개체사이의 관계를 검색하는 Parent-Child Block Merge Algorithm과 Ancestor-Descendent Block Merge Algorithm을 제안한다. 그리고 Ancestor-Descendent관계를 빠르게 검색하기 위하여 블록식별자가 부모의 정보를 유지하는 방법을 소개하고 이를 이용한 Parent-Child Block Merge Algorithm과 Ancestor-Descendent Block Merge Algorithm을 제안한다.

  • PDF

기계학습 기반 저 복잡도 긴장 상태 분류 모델 (Design of Low Complexity Human Anxiety Classification Model based on Machine Learning)

  • 홍은재;박형곤
    • 전기학회논문지
    • /
    • 제66권9호
    • /
    • pp.1402-1408
    • /
    • 2017
  • Recently, services for personal biometric data analysis based on real-time monitoring systems has been increasing and many of them have focused on recognition of emotions. In this paper, we propose a classification model to classify anxiety emotion using biometric data actually collected from people. We propose to deploy the support vector machine to build a classification model. In order to improve the classification accuracy, we propose two data pre-processing procedures, which are normalization and data deletion. The proposed algorithms are actually implemented based on Real-time Traffic Flow Measurement structure, which consists of data collection module, data preprocessing module, and creating classification model module. Our experiment results show that the proposed classification model can infers anxiety emotions of people with the accuracy of 65.18%. Moreover, the proposed model with the proposed pre-processing techniques shows the improved accuracy, which is 78.77%. Therefore, we can conclude that the proposed classification model based on the pre-processing process can improve the classification accuracy with lower computation complexity.