• Journal of Korea Water Resources Association
• /
• v.46 no.4
• /
• pp.345-359
• /
• 2013

In order to manage water quality efficiently and systematically through TMDL (Total Maximum Daily Load), the demand for the construction of spatial data for stream networks has increased for use with GIS-based water quality modeling, data management and spatial analysis. The objective of this study was to present an improved KRF (Korean Reach File) design as framework data for domestic stream networks to be used for various purposes in relation to the TMDL. In order to achieve this goal, the US EPA's RF (River Reach File) was initially reviewed. The improved design of the graphic and attribute data for the KRF based on the design of the EPA's RF was presented. To verify the results, the KRF was created for the Han River Basin. In total, 2,047 stream reaches were divided and the relevant nodes were generated at 2,048 points in the study area. The unique identifiers for each spatial object were input into the KRF without redundancy. This approach can serve as a means of linking the KRF with related database. Also, the enhanced topological information was included as attributes of the KRF. Therefore, the KRF can be used in conjunction with various types of network analysis. The utilization of KRF for water quality modeling, data management and spatial analysis as they pertain to the applicability of the TMDL should be conducted.

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.810-821
• /
• 2006

As XML is widely used across the computer related fields, and it costs expensive for its compiler, the study on the automatic generation of the compiler is becoming important. In addition, though the XMLSchema became a standard, there have been few works on the automatic compiler generation for XML applications based on the XMLSchema. In this paper, we introduce a method that we can automatically generate a compiler for an XML application based on the XMLSchema. Our XML compiler generator uses data type information in XMLSchema document and semantic information in another file and produces semantic classes and a compiler for the XML application. The compiler parses an XML document, builds a tree in which each node is an instance of semantic class, and processes the document through the traversal of the tree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1286-1306
• /
• 2022

Searchable symmetric encryption (SSE) provides a safe and effective solution for retrieving encrypted data on cloud servers. However, the existing SSE schemes mainly focus on single keyword search in single client, which is inefficient for multiple keywords and cannot meet the needs for multiple clients. Considering the above drawbacks, we propose a scheme enabling dynamic multi-client and Boolean query in searchable symmetric encryption for cloud storage system (DMC-SSE). DMC-SSE realizes the fine-grained access control of multi-client in SSE by attribute-based encryption (ABE) and novel access control list (ACL), and supports Boolean query of multiple keywords. In addition, DMC-SSE realizes the full dynamic update of client and file. Compared with the existing multi-client schemes, our scheme has the following advantages: 1) Dynamic. DMC-SSE not only supports the dynamic addition or deletion of multiple clients, but also realizes the dynamic update of files. 2) Non-interactivity. After being authorized, the client can query keywords without the help of the data owner and the data owner can dynamically update client's permissions without requiring the client to stay online. At last, the security analysis and experiments results demonstrate that our scheme is safe and efficient.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.105-110
• /
• 1998

This paper proposes a method to manage individual information on large scale distributed geographic information systems. On such system, ordinary users usually cannot alter the contents of the server. The method proposed in this paper makes possible to alter the contents or add individual data onto such kinds of non-write-permitted data onto set. We call the method as GDSF, ‘geographic differential script file’. In this method, a client user makes a GDSF which contains the private information to be added onto the served data. Then, the client keeps the file on a local disk. After this, when the user uses the data, he applies the differential data sequence onto the down loaded data to restore the information. The GDSF is a collection of picture commands which tell pictures insertions, deletions, and modification operations. The GDSF also can contain the modification. The GDSF also can contain the modification of the attribute information of geographic entities. The method also applicable to modify data on a ROM device, for example CD-ROM or DVD-ROM. This paper describes the method and experimental results.

• Journal of Korean Society on Water Environment
• /
• v.32 no.6
• /
• pp.511-519
• /
• 2016

National Institute of Environmental Research (NIER) has developed the Korean Reach File (KRF) for scientific and systematic analysis of variables related to water quality, pollutant sources and aquatic ecosystems in consideration of steam reach networks. The KRF provides a new framework for data production, storage, management and analysis for water related variables in relation to spatial characteristics, connections, and topologies of stream reaches. However, the current version of KRF (ver.2) has limited applicability because its nodes include not only the stream points based on topological characteristics but also those based on water quality monitoring stations, which may undermine its generality. In this study, a new version of KRF (ver.3) was designed and established to overcome the weak point of version 2. The version 3 is a generalization of the old KRF graphic data and it integrates the attribute data while separating it from the graphic data to minimize additional work that is needed for data association and search. We tested the KRF (ver.3) on actual cases and convenience and adaptability for each application was verified. Further research should focus on developing a database link model and real-world applications that are targeted to process event data.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.387-398
• /
• 2006

In this paper, we propose a new page allocation scheme for flash memory file system. The proposed scheme allocates pages by exploiting the concept of Purity, which is defined as the fraction of blocks where valid Pages and invalid Pages are coexisted. The Pity determines the cost of block cleaning, that is, the portion of pages to be copied and blocks to be erased for block cleaning. To enhance the purity, the scheme classifies hot-modified data and cold-modified data and allocates them into different blocks. The hot/cold classification is based on both static properties such as attribute of data and dynamic properties such as the frequency of modifications. We have implemented the proposed scheme in YAFFS and evaluated its performance on the embedded board equipped with 400MHz XScale CPU, 64MB SDRAM, and 64MB NAND flash memory. Performance measurements have shown that the proposed scheme can reduce block cleaning time by up to 15.4 seconds with an average of 7.8 seconds compared to the typical YAFFS. Also, the enhancement becomes bigger as the utilization of flash memory increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1071-1090
• /
• 2016

Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.51-63
• /
• 2001

In this paper, we design and implement a XML document retrieval system to support structure-based retrieval using the BRS/Search system that is a commercial search engine, The implemented system in this paper represents the logical structure of XML documents as the directory structure of the Unix file system. In addition, we define the database schema of BRS/Search system to store documents, We also implement a ETID extractor, a structure information extractor, a storage manager and a query processor additionally to support content retrieval, structure retrieval, mixed retrieval and attribute retrieval in the BRS/Search system.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.3-19
• /
• 1998

관계형 데이터베이스 성능을 향상시키는데 중요한 요소 중의 하나는 트랜잭션을 처리하기 위해 데이터를 디스크에서 주 기억장치로 옮기는데 필요한 디스크 액세스(access) 횟수이다. 본 연구는 관계형 데이터베이스에서 트랜잭션을 처리할 때, 릴레이션(relation)을 속성의 중복할당을 허용하여 분할하고, 디스크에 단편(fragment)으로 저장하므로써 필요한 단편만을 액세스하여 디스크의 액세스 횟수를 줄이는 방법을 연구하였다. 본 연구에서는 속성의 중복할당을 허용하여 디스크의 액세스 횟수를 최소화시킬 수 있는 수직분할문제에 수리모형을 조회, 갱신트랙잭션을 모두 고려하여 0-1 정수계획법으로 개발하였다. 또한 모형에 대한 최적해법으로 분지한계법을 제안하였으며, 분지한계법으로 큰 문제를 푸는데는 많은 시간이 소요되므로 계산량을 줄일 수 있는 초기처리방법과 비용계산방법을 제안하였다. 속성의 중복을 허용하여 구한 해가 중복을 고려하지 않은 경우의 해보다 디스크 액세스횟수가 감소한 것으로 나타났으며, 갱신트랜？션의 수가 증가함에 따라 중복되는 속성의 수가 감소하는 결과를 나타내었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.3
• /
• pp.499-510
• /
• 2023

Recently, an intelligent and advanced cyber attack attacks a computer network of a public institution using a file containing malicious code or leaks information, and the damage is increasing. Even in public institutions with various information protection systems, known attacks can be detected, but unknown dynamic and encryption attacks can be detected when existing signature-based or static analysis-based malware and ransomware file detection methods are used. vulnerable to The detection method proposed in this study extracts the detection result data of the system that can detect malicious code and ransomware among the information protection systems actually used by public institutions, derives various attributes by combining them, and uses a machine learning classification algorithm. Results are derived through experiments on how the derived properties are classified and which properties have a significant effect on the classification result and accuracy improvement. In the experimental results of this paper, although it is different for each algorithm when a specific attribute is included or not, the learning with a specific attribute shows an increase in accuracy, and later detects malicious code and ransomware files and abnormal behavior in the information protection system. It is expected that it can be used for property selection when creating algorithms.