• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.599-609
• /
• 2007

Due to the restrictions of Flash memory such as overwrite limitation and write/erase operational unit differences, block cleaning is required in Flash memory based file systems and known as a key factor on the performance of file systems. In this paper, we identify three parameters, namely utilization, invalidity and uniformity, and analyze how the parameters affect the cost of block cleaning. The analysis show that as uniformity degrades, the cost of block cleaning increases drastically. To overcome this problem, we design a new modification-aware(MODA) page allocation scheme that strives to keep uniformity high by separating frequently-updating data from infrequently-updating data. Real implementation experiments conducted on an embedded system show that the MODA scheme can actually enhance uniformity of Flash memory, which consequently leads to reduce the cost of block cleaning with an average of 123%, compared to the traditional sequential allocation scheme that is used in YAFFS.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.587-592
• /
• 2004

Context-aware computing systems require real-time context reasoning process for context awareness. Context reasoning can be done by comparing input information from sensors with knowledge-base within system. This method is identical with it of rule-based systems. In this paper, we propose hardware rule-based system architecture which can process context reasoning in real-time. Compared to previous architecture, hardware rule-based system architecture can reduce the number of constraints on rule representations and combinations of condition terms in rules. The modified content addressable memory, crossbar switch network and pre-processing module are used for reducing constraints. Using SystemC for description can provide easy modification of system configuration later.

• School Mathematics
• /
• v.8 no.2
• /
• pp.139-160
• /
• 2006

It seems that North Korea has been trying to reorganize its educational system as well as its economic system on a large scale since July 1, 2002. There has been a decrease in quantity of math textbooks by about 30% decrease. Until the 1990's, geometry and algebra had been kept apart from each other in North Korea, but they are put together now. Moreover many changes have been made in both contents and methods of teaching. For example, an area model is used in North Korea to teach operation of fraction, which makes the learning period shorter. This idea will provide us with many implication when we need to ready for decreasing the quantities in the future. Moreover teaching methods of division algorithms need to be reconsidered since the visual algorithm of division could help save the thinking in problem solving.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.8
• /
• pp.1818-1824
• /
• 2015

Cloud computing draws attention as an application to provide dynamically scalable infrastructure for application, data and file storage. An untrusted remote server can cause a variety of problems in the field of data protection. It may process intentionally or involuntarily user's data operations(modify, insert, delete) without user's permission. It may provide false information in order to hide his mistakes in the auditing process. Therefore, it is necessary to audit the integrity of data stored in the cloud server. In this paper, we propose a new data auditing system that can verify whether servers had a malicious behavior or not. Performance and security analysis have proven that our scheme is suitable for cloud computing environments in terms of performance and security aspects.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.101-112
• /
• 2000

In Geographic Information System, spatial object can be changed in the attribute information, spatial location and the topological relation between them with the change of time. However traditional GIS deletes the old value of aspatial information and replaces them with new value. Therefore. it is difficult to manage thc history of changed spatial object and can not support the spatio-temporal queries including temporal queries. In this paper, we propose a spatio-temporal objected model to solve this problem. We implement the proposed model with spatio-temporal class using Gothic GIS tool. The historical information of an object is stored into the object itself for the effective history management. And, in order to provide the queries for the history of an object and spatio-temporal relationship, we add temporal operators, spatio-temporal operators, and spatio-temporal query operations into Gothic, and improve the facility of the Gothic.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.134-143
• /
• 1999

In this paper, in order to implement the IDWT(inverse discrete wavelet transform) with relatively low complexity, we propose a VLSI architecture for odd-tap linear-phase IDWT filters. By considering the symmetric property of the linear phase filter, the input is added to the one located at symmetrical position of the filter before filtering. Then. we rearrange the delay line of the filter in a U-shaped fashion. requiring no global interconnection between the components. The proposed architecture for the IDWT filter consists of delay units. operator units, adder units. and postprocessor unit. Since each units are configured regularly and interconnected locally. the proposed architecture can accommodate arbitrary linear phase IDWTs by simply adding/removing the corresponding units. The M -level IDWT can be implemented by interconnecting the proposed architecture in a cascaded or semi-recursive form. It is expected that the proposed architecture for the IDWT can be effectively employed in the related area including MPEG-4, since the proposed architecture is less complex than the conventional architectures.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.23-32
• /
• 2006

In this paper, we propose indexing method to manage large amount of XML documents efficiently, using the range of node and Pre-Oder List. The most of XML indexing methods are based on path or numbering method. However, the method of path-based indexing method shows disadvantages of performance degradation for join operations of ancestor-descendent relationships, and searching for middle and lower nodes. The method of numbers-scheme based indexing has to number all nodes of XML documents, since search overhead increased and the disk space for indexes was wasted. Therefore, in this paper, we propose a novel indexing method using node ranges and Preorder-Lists to overcome these problems. The proposed method more efficiently stores similar structured XML documents. In addition, our method supports flexible insertion and deletion of XML documents.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.593-604
• /
• 2001

A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.21-29
• /
• 2020

The use of NAND flash memory is continuously increased with the demand of mobile data in the IT industry environment. However, the erase operations in flash memory require longer latency and higher power consumption, resulting in the limited lifetime for each cell. Therefore, frequent write/erase operations reduce the performance and the lifetime of the flash memory. In order to solve this problem, management techniques for improving the performance of flash based storage by reducing write and erase operations of flash memory with using disk buffers have been studied. In this paper, we propose a CPWL to minimized the number of write operations. It is a disk buffer management that separates read and write pages according to the characteristics of the buffer memory access patterns. This technique increases the lifespan of the flash memory and decreases an energy consumption by reducing the number of writes by arranging pages according to the characteristics of buffer memory access mode of requested pages.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.270-273
• /
• 1999

Y2k will be able to enormous disaster. The many make an effort to find a solution to problem of Y2k. Problem of Y2k must solution to as follow. First, problem of Y2k solution organization must constructed. Second, in step with each stage-the first, developing and complete stage, stage of Y2k solution must be constructed. Third, solution of Y2k must construct to hierarchy. hierarchy structure constructed form six stage to first stage, first stage is investigation resources, second stage is estimation influence, third stage is planing conversion, fourth stage is working conversion, fifte spot, sixth stage is diffusion on the spot.