• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2001년도 종합학술발표회논문집
• /
• pp.340-347
• /
• 2001

MAC(Mandatory Access Control)이나 MLS(Multi Level Security) 보안정책이 적용된 보안운영체제는 주체와 객체에 보안등급(Security Level)과 영역(Category) 값을 부여하고, 부여된 이들 정보에 의해 객체에 행해지는 주체의 접근을 제한한다. 하지만, 이러한 MAC과 MLS 보안이 적용된 경우라 하더라도 시스템의 보안정책을 위반하며 불법적 정보를 유통하게 하는 경로가 있을 수 있다. 본 논문에서는 불법적 정보의 유통경로가 되고 있는 IPC(Inter Process Communication) 메커니즘과 스토리지에 의한 비밀채널을(Covert Channel) 문제 해결 위해 커널 수준의 설계와 구현을 시도하였다. IPC 메커니즘에 의한 불법적 정보흐름 제거를 위해 IPC 메커니즘에 MLS 보안정책을 적용하였고, 스토리지 비밀채널는 시스템 콜 명세를 분석하여 이를 식별, 감사, 지연처리가 가능토록 하였다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권1호
• /
• pp.95-104
• /
• 2022

A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

• 한국컴퓨터정보학회논문지
• /
• 제28권1호
• /
• pp.65-70
• /
• 2023

본 논문에서는 YOLO v3를 이용한 CCTV 저장공간 확보 모델을 제안한다. CCTV는 방범, 화재예방, 감시 등 재난·재해 및 안전을 위해 사회 곳곳에 설치·운영되며, 개수의 증가와 화질의 개선이 함께 이뤄지고 있다. 이로 인해 영상파일의 개수와 크기가 증가하면서 기존의 저장공간으로는 이를 감당하기 어려움을 느끼고 있다. 이를 해소하기 위해 CCTV 영상 속의 특정 객체를 YOLO v3를 이용하여 탐지하여 해당 프레임만을 저장하여 불필요한 프레임을 삭제하는 모델을 제안하여 영상파일의 크기를 줄임으로써 저장공간을 확보하고, 그로 인해 더 오랜 기간 영상을 저장·관리할 수 있도록 하였다. 제안 모델 적용 후 평균 94.9% 영상파일의 크기가 절감됨을 확인하였으며, 제안 모델을 적용하기 전보다 약 20배의 보관 기간이 증가했음을 확인할 수 있었다.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.106-114
• /
• 1994

A new merging technique is adopted for combining rectangular parallelepipes produced by 2-D rectangular code into more intuitive 30D volume elements. Rectangular parallelepiped codes (RP codes) can be used in volume-based representation of a three-dimensional object. We proposed more regularity-conserving 2-D rectangular coding scheme to merge rectangular cells represented by RP codes in three-dimensional space. After being constructed from modified 2-D rectangular code, 3-D RP codes are merged in the two orthogonal directions using new merging algorithm. The shape of merged 3-D object reconstructed by proposed algorithm is shown to be much closer to the original object shape than that of conventional RP codes. The storage requirement of merged object can be also reduced.

• 한국정보통신학회논문지
• /
• 제24권1호
• /
• pp.141-144
• /
• 2020

Convolutional neural networks (CNNs) show high performance in computer vision tasks including object detection, but a lot of weight storage and computation is required. In this paper, a pruning scheme is applied to CNNs for object detection, which can remove much amount of weights with a negligible performance degradation. Contrary to the previous ones, the pruning scheme applied in this paper considers the base accelerator architecture. With the consideration, the pruned CNNs can be efficiently performed on an ASIC or FPGA accelerator. Even with the constrained pruning, the resulting CNN shows a negligible degradation of detection performance, less-than-1% point degradation of mAP on VOD0712 test set. With the proposed scheme, CNNs can be applied to objection dtection efficiently.

• 대한전기학회논문지
• /
• 제45권3호
• /
• pp.329-334
• /
• 1996

Power system is becoming more and more complex and large Existing procedural programming technique can't cope with software flexibility and maintenance problems. So, Object-Oriented Programming (OOP) is increasingly used to solve these problems. OOP in power system analysis field has been greatly developed. This paper applies OOP in power flow analysis, and presents new algorithm which uses only a Jacobian to solve mismatch equations, and introduces a new sparse matrix storage method which is different from existing method. (author). 11 refs., 12 figs., 3 tabs.

• 한국정보처리학회논문지
• /
• 제6권4호
• /
• pp.851-867
• /
• 1999

Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.

• 대한전기학회논문지
• /
• 제36권5호
• /
• pp.319-327
• /
• 1987

This paper presents a dynamic programming sucdessive approximation algorithm for scheduling pumped storage hydro plants and shows how this method can be coordinated with the commitment of the thermal units of the system. The general object of operation of pumped hydrostorage plants is the minimization of the overall production cost and the maximization of generation reserves. The basic procedure used to obtain a combined pumped storage-unit commitment schedule is to execute the pumped storage scheduler and unit commitment scheduler iteratively. A combined DPSA algorithm has been presented to coordinate the scheduling of the pumped storage with the scheduling of the thermal units.

• 한국CDE학회논문집
• /
• 제7권3호
• /
• pp.202-209
• /
• 2002

It is difficult to support collaborative design with a conventional ship CAD system which manages design information using files. In this research, file storage has been replaced with a database. This paper describes the OpenDIS which is an interface between the geometric kernel and the database. Its main purpose is to implement the CAD system which has the STEP database as the native storage. A prototype CAD system has been implemented using that OpenDIS interface which is implemented by OpenCascade geometric kernel and the Objectstore object-oriented database. The STEP methodology is used as the database schema. This CAD system has been applied to the hull design of a ship in order to verify the usefulness of the interface.

• 산업공학
• /
• 제17권3호
• /
• pp.330-337
• /
• 2004

Since XML (eXtensible Markup Language) was highlighted as an information interchange format, there is an increasing demand for incorporating XML with databases. Most of the approaches are focused on RDB (Relational Databases) because of legacy systems. But these approaches depend on the database system. Countless researches are being focused on DTD (Document Type Definition). However XML Schema is more comprehensive and efficient in many perspectives. We propose a meta-model for XML Schema that is independent of the database. There are three processes to build our meta-model: DOM (Document Object Model) tree analysis, object modeling and storing object into a fixed DB schema using model mapping approach. We propose four mapping rules for object modeling, which conform to the ODMG (Object Data Management Group) 3.0 standard. We expect that the model will be especially useful in building XML-based e-business applications.