• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1035-1038
• /
• 2008

가상 메모리의 스왑 저장 장치로서 플래시 메모리를 사용하는 경우, 시스템을 기동할 때 스왑 영역의 초기화를 위한 삭제 연산이 요구되어 기동 시간이 오래 걸리는 문제점이 있다. 본 논문에서는 스왑 영역의 플래시 메모리 내용을 모두 삭제하지 않고 일부만을 삭제함으로서 기동 시간을 줄일 수 있는 방법을 연구하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.103-114
• /
• 2013

This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and Reverse-delete algorithms verify whether the cycle occurs within the edges of the graph. For this reason, they have problems of unnecessarily performing extra algorithms from the edges, even though they've already obtained the minimum spanning tree. This paper, first of all, suggests the 1st method which reduces the no. of performances by introducing stop point criteria of algorithm, but at the same time, performs algorithms from all the edges, just like how Kruskal and Reverse-delete algorithms. Next, it suggests the 2nd method which finds the minimum spanning tree from the remaining edges after getting rid of all the unnecessary edges which are considered not to affect the minimum spanning tree. These suggested methods have an effect of terminating algorithm at least 1.4 times and at most 3.86times than Kruskal and Reverse-delete algorithms, when applied to the real graphs. We have found that the 2nd method of the Reverse-delete algorithm has the fastest speed in terminating an algorithm, among 4 algorithms which are results of the 2 suggested methods being applied to 2 algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.107-116
• /
• 2013

This algorithm suggests a method in which a minimum spanning tree can be obtained fast by reducing the number of an algorithm execution. The suggested algorithm performs a select-and-delete process. In the select process, firstly, it performs Borůvka's first stage for all the vertices of a graph. Then it re-performs Borůvka's first stage for specific vertices and reduces the population of the edges. In the delete process, it deletes the maximum weight edge if any cycle occurs between the 3 edges of the edges with the reduced population. After, among the remaining edges, applying the valency concept, it gets rid of maximum weight edges. Finally, it eliminates the maximum weight edges if a cycle happens among the vertices with a big valency. The select-and-delete algorithm was applied to 9 various graphs and was evaluated its applicability. The suggested select process is believed to be the vest way to choose the edges, since it showed that it chose less number of big edges from 6 graphs, and only from 3 graphs, comparing to the number of edges that is to be performed when using MST algorithm. When applied the delete process to Kruskal algorithm, the number of performances by Kruskal was less in 6 graphs, but 1 more in each 3 graph. Also, when using the suggested delete process, 1 graph performed only the 1st stage, 5 graphs till 2nd stage, and the remaining till 3rd stage. Finally, the select-and-delete algorithm showed its least number of performances among the MST algorithms.

• The Journal of the Korea Contents Association
• /
• v.7 no.11
• /
• pp.34-42
• /
• 2007

In this paper, we propose a staff-line detection and removal algorithm from a music score image obtained by a mobile phone camera. As a preprocessing technique to recognize a music score image, staff-line detection and removal should be efficiently applied to the skewed or curved images. The proposed method detects a staff-line by dividing a staff according to the degree of distortion. The number of division is calculated by dividing a staff repletely until an average of differences of y coordinates in every divided position is smaller than a threshold. Therefore, the number of division can be adaptively estimated according to the degree of the distortion. For an experiment, we make various kinds of images by rotating one from $1^{\circ}\;to\;3^{\circ}$ or curving slightly upward. The results show that the proposed method performed well on the experiment images.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.3
• /
• pp.69-80
• /
• 2007

To protect personal information when releasing data, a general privacy-protecting technique is the removal of all the explicit identifiers, such as names and social security numbers. De-identifying data, however, provides no guarantee of anonymity because released information can be linked to publicly available information to identify them and to infer information that was not intended for release. In recent years, two emerging concepts in personal information protection are k-anonymity and $\ell$-diversity, which guarantees privacy against homogeneity and background knowledge attacks. While these solutions are signigicant in static data environment, they are insufficient in dynamic environments because of vulnerability to inference. Specially, the problem appeared in record deletion is to deconstruct the k-anonymity and $\ell$-diversity. In this paper, we present an approach to securely anonymizing a continuously changeable dataset in an efficient manner while assuring high data quality.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.06a
• /
• pp.197-201
• /
• 2011

검찰과 경찰에서는 압수수색을 통해 조사를 수행하는데, 기업들은 압수수색 수사를 받기 전에 회계 DB 및 회계 관련 파일 삭제, 파손 및 은닉하는 등의 문제점을 발생시키고 있다. 2008년 삼성화재 비자금 조성 사건과, 2009년 교하 복합커뮤니티 센터의 입찰비리 사건 등 기업회계장부의 포렌식 기술적용방법 문제 등이 발생하고 있다. 본 논문에서는 포렌식 수사 도구인 EnCase, FinalData 등을 연구하고, 기업의 회계 서버에 대해 압수수색 준비와 압수 수색, 획득 증거 분석 등의 절차를 연구한다. 기업의 회계 서버 압수수색 후에 디스크에서 포렌식 증거분석에서 실시되는 증거물 원본 파일보관, 원본성이 입증된 사본생성, 삭제 파일 검사 및 복원, 삭제 내용 확인, 원본 파일과의 대조를 실험을 한다. 본 연구 결과는 포렌식 기술발전에 기여하게 될 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.209-212
• /
• 2001

기존의 클라이언트 컴포넌트 기술로부터 EJB(Enterprise JavaBeans)와 마이크로소프트의 DCOM 모델을 기반으로 하는 서버 환경의 컴포넌트 기술이 발표 되고있다. 이에 따라 비즈니스 분야에서 활용할 수 있는 비교적 규모가 큰 컴포넌트가 개발되고 있어 이들 컴포넌트를 새로운 소프트웨어 개발에 활용할 수 있도록 컴포넌트를 재정의(Customization)하고 합성하는 과정을 지원하는 도구의 개발이 필요하다. 본 연구에서는 컴포넌트 기반 소프트웨어 개발시 컴포넌트 저장소에 구축되어 있는 컴포넌트를 검색하여 사용자의 요구사항에 맞게 재정의 하고 기존 컴포넌트 패키지에서 컴포넌트를 조립 및 삭제할 때 컴포넌트간의 종속성을 유지할 수 있도록 하는 방법 및 도구를 개발하였다. 본 도구는 재정의 도구를 관리하는 재정의기(Customizer), 컴포넌트 저장소에 구축되어 있는 컴포넌트 패키지를 보여주고 수정, 삭제를 지원하는 컴포넌트 브라우저, 컴포넌트 브라우저로부터 선택한 컴포넌트의 속성을 나타내고 수정, 삭제 등을 지원하는 속성 편집기와 컴포넌트 브라우저로부터 가져온 컴포넌트를 시각적으로 편집할 수 있게 하는 디자이너(Designer)로 구성되며, 컴포넌트의 조립 및 삭제를 할 매 컴포넌트 인터페이스의 종속성을 확인할 수 있게 하는 종속성 브라우저(Dependency Browser), 종속성 유지를 위하여 대체 컴포넌트 및 인터페이스를 선택할 수 있게 하는 인터페이스 편집기(Interface Editor)를 제공한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.12
• /
• pp.487-496
• /
• 2017

In MySQL InnoDB, there are two ways of storing data. One is to create a separate tablespace for each table and store it separately. Another is to store all table and index information in a single system tablespace. You can use this information to recover deleted data from the record. However, in most of the current database forensic studies, the former is actively researched and its structure is analyzed, whereas the latter is not enough to be used for forensics. Both approaches must be analyzed in terms of database forensics because their storage structures are different from each other. In this paper, we propose a method for recovering deleted records in a method of storing records in IBDATA file, which is a single system tablespace. First, we analyze the IBDATA file to reveal its structure. And introduce delete record recovery algorithm which extended to an unallocated page area which was not considered in the past. In addition, we show that the recovery rate is improved up to 68% compared with the existing method through verification using real data by implementing the algorithm as a tool.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.921-926
• /
• 2002

B+-Tree is the most popular indexing method in DBMS to manage large size data in more efficiency. However the existing B+-Tree has shortcomings in there is overhead on DISK/IO when the first time of constructing DB or of making Index, and it lessens the concurrency if there are frequent delete operations so that the index structure also should be changed frequently. To solve these problems almost DBMS is using batch construction method and lazy deletion method. But to apply B+-Tree, which is using batch construction method and lazy deletion method, into DBMS the technique for controlling and recovering concurrency is necessary, but its researching is still unsatisfactory so that there is a problem on applying it into actual systems. On this paper I suggest the technique for controlling and recovering concurrency how to implement the batch construction method and the lazy deletion method in actual DBMS. Through the suggested technique there is no cascade rollback by using Pending list, it enhances the concurrency by enabling insertion and deletion for base table on every reconstruction, and it shortens transaction response time for user by using system queue which makes the batch constructing operation is processed not in user's transaction level but in system transaction level.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1449-1452
• /
• 2009

현재 기업 및 공공기관에서는 산업기술 유출 방지를 위해 잔여데이터 완전삭제 등 보안기능이 구현된 디지털 복합기를 사용하고 있다. 이에 따라 국제적으로 특히 일본 평가기관들 중심으로 공통평가기준으로 평가 인증 많이 받고 있다. 그러나 국내에서는 MFP에 대한 인식과 평가 노하우(know-how)의 부족하여 평가 인증 방법에 미비한 상태이다, 본 논문에서는 MFP의 핵심 중요 기술인 잔여정보 완전삭제 기능을 공통평가기준으로 평가할 수 있는 국내 시험/평가 방법론을 제시하고자 한다.