• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.1
• /
• pp.65-75
• /
• 2000

역할 기반 접근 제어(RBAC: Role Based Access Control)는 각 시스템 자원의 안전성을 보장하기 위한 접근 제어 기술이다. 거대한 네트워크에서 보안 관리의 복잡성과 비용을 줄여주는 기능 때문에, 특히 상업적인 분야에서 더욱 큰 관심을 끌고 있다. 본 논문에서는 RBAC 역할 계층 구조 개념만을 사용할 경우의 취약점을 해결하기 위해 두 가지 연산을 제시하였다. 그리고 이를 통하여 사용자와 권한(pemission)을 간접적으로 연관시킴으로써, RBAC 관리자가 사용자마다 연산을 추가하거나 삭제할 수 있도록 하였고 직관적인 관리자 인터페이스를 제공하여 관리자가 쉽게 사용자 역할, 그리고 연산 사이의 관계를 파악할 수 있도록 하였다. 그리고 이를 기반으로 RBAC 시스템을 설계하고 대학의 종합정보 시스템을 모델로 구현하였다.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.105-112
• /
• 2006

This paper be composed to file system by making a new i_node structure which can decrease Write frequency because this's can improved the file system efficiency if reduced Write operation frequency of flash memory in respect of file system, i-node is designed to realize Cleaning policy of data in order to perform Write operation. This paper suggest Cleaning Algorithm for Write operation through a new i_node structure. In addition, this paper have mode the oldest data cleaned and the most recent data maintained longest as a result of experiment that the recent applied program and data tend to be implemented again through the concept of regional and time space which appears automatically when applied program is implemented. Through experiment and realization of the Flash file system, this paper proved the efficiency of NAND-type flash file system which is required in on Embedded system.

• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.719-726
• /
• 2007

Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.217-222
• /
• 2009

Priority queues can be used in applications such as scheduling, sorting, retrival based on a priority like gene searching, shortest paths computation. This paper proposes a data structure using array representation for double-ended priority queue in which insertion and deletion takes O(1) amortized time and O(logn) time, respectively. To the author's knowledge, all the published array-based data structures for double ended priority queue support O(logn) time insertion and deletion operations.

• Annual Conference of KIPS
• /
• 2016.10a
• /
• pp.16-17
• /
• 2016

일반적인 에디터 프로그램과 운영체제를 사용하여 데이터를 편집할 경우, 일부 수정에도 모든 데이터를 다시 저장하고 있다. 본 논문에서는 이러한 기존 파일시스템의 문제점을 개선하기 위해 가변 길이 블록의 개념을 커널 레벨에 적용하여 효율적으로 수정된 데이터를 다시 쓸 수 있도록 하였다. 가변 블록은 데이터 삭제가 발생 했을 경우 나머지 블록은 그대로 유지하고 수정된 블록만 다시 저장하며, 삭제된 데이터로 인해 생기는 빈 공간의 그대로 유지하는 방법을 말한다. 이 개념을 기존 리눅스에서 사용하는 ext4파일 시스템에 적용하여 시스템을 구축, 실험하였으며 결과적으로 쓰기 연산을 비롯해 CPU사용량에서 크게 성능을 향상시켰다.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.203-206
• /
• 2008

O-tree 표현법을 이용한 기존의 플로어플랜 알고리즘은 결정적 기법에 기반한 것으로써, 회로의 각 모듈을 차례대로 삭제한 후 가장 좋은 다른 위치에 삽입하는 과정을 함으로써 해 공간을 검색해 간다. 이는 모듈을 처리하는 순서에 따라 결과가 결정되는 단점이 있다. 이런 단점을 해결하기 위해 본 논문에서는 Simulated Annealing 프레임을 이용하여 해 공간을 효과적으로 검색하는 방법을 제시한다. 이웃 해를 탐색하기 위한 플로어 플랜의 변형은 매우 단순하면서도 효과적인 두 가지 방법을 사용한다. 첫째 방법은 한 쌍의 모듈을 선택하여 상호위치를 맞바꾸는 방법이고, 둘째는 임의의 한 모듈을 선택하여 삭제한 후 삽입 가능한 모든 위치 중 임의의 한 곳에 삽입하는 연산을 사용한다. 실험 결과는 매우 고무적이다.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.49-54
• /
• 1998

AS it takes a considerable time for database operations for processing the condition part of active rule, the operations have an important effect on the efficiency of active database system. The processing time of operations should be minimized in order to improve the efficiency of system. The previous works are limited to basic database operations and the partial aggregate functions. In this paper, the processing technique using the structuralization and the state table of relations is suggested. The processing time for basic database operations can be reduced with the structuralization of relations to classification tree and the introduction of deletion information table. With the introduction of binary search tree and relation state table, the aggregate function which has a big of processing cost can be processed effectively and the function of the active database system can be maximized.

• Journal of Elementary Mathematics Education in Korea
• /
• v.23 no.1
• /
• pp.19-41
• /
• 2019

In this study, we present an analysis framework based on the 2015 revised curriculum to analyze how mathematical contents and achievement standards for domains of numbers and computations have changed in the curriculum of elementary mathematics in Korea. Based on this, we classified the achievement standards by type and investigated their characteristics. The achievement standards for numbers and computations can be divided into the successive, the extinctive, and the additive achievement standards depending on their characteristics. The successive achievement standards are the ones that have consistently existed without being removed from the 1-st curriculum to the latest revision in 2015. The extinctive achievement standards are the ones that have been removed at some point during the revisions of nine times and do not remain in the current revision in 2015. The characteristics of the extinctive achievement standards were analyzed to be different before and after the 4-th curriculum. The additive achievement standards refer to the ones that have been newly added to the curriculum or that have been removed at a certain moment but added back in later and thus exist in the current revision in 2015. The characteristics of each type according to the changes of the achievement standards can be thought to be the results that the revision for the mathematics curriculum in Korea has been faithfully conducted. Based on the results of this study, we suggest some implications for organizing the achievement standards in the future curricular development.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.2
• /
• pp.1-14
• /
• 2019

Since most documents used in web, XML, office applications are tree-structured, diff, merge, and version control for tree-structured documents in multi-user environments are crucial tasks. However research on edit scripts which is a basis for them is in primitive stage. In this paper, we present a document model for understanding the change of tree-structured documents as edit scripts are executed, and propose a method of switching adjacent edit operations on tree-structured documents based on the analysis of the effects of edit operations. Mostly, edit scripts which are produced as the results of diff on tree-structured documents only consist of basic operations such as update, insert, delete. However, when move and copy are included in edit scripts, because of the characteristics of their complex operation, it is often that edit scripts are generated to execute in two passes. In this paper, using the proposed method of switching edit operations, we present an algorithm of transforming the edit scripts of X-treeESgen, which are designed to execute in two passes, into the ones that can be executed in one pass.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.557-560
• /
• 2000

웹 환경의 많은 유휴상태 호스트를 이용하여 작업이 병력 처리가 가능하다. 그러나, 이로 인해 발생하는 호스트들의 가용성 및 웹의 가변성을 예측하기는 힘들다. 본 논문에서 제시한 시스템 WebSM은 작업에 대한 효율적인 병렬 처리를 위한 적응적 작업 할당 기법을 제시한다 또한 호스트들의 자유로운 연산 참여에 따른 작업 재할당 기법과 결함 및 삭제로 인해 미수행된 일부분의 작업 처리가 가능하도록 동적 작업 프로세서 관리 스킴을 제시한다.