• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.238-249
• /
• 2010

Flash memory has been studied as a storage medium in order to improve the performance of the system using its high computing speed in the DBMS field where frequent data access is needed. The most difficulty using the flash memory is the performance degradation and the life span shortening of flash memory coming from inefficient in-place update. Log based approaches have been studied to solve inefficient in-place update problem in the DBMS where write operations occur in smaller size of data than page frequently. However the existing log based approaches suffer from the frequent merging operations, which are the principal cause of performance deterioration. Thus is because their fixed log area management can not guarantee a sufficient space for logs. In this paper, we propose non-fixed log area management technique that can minimize the occurrence of the merging operations by promising an enough space for logs. We also suggest the cost calculation model of the optimal log sector number minimizing the system operation cost in a block. In experiment, we show that our non-fixed log area management technique can have the improved performance compared to existing approaches.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.343-350
• /
• 2002

A scene change detection which involves finding a cut between two consecutive shots is an important step for video indexing and retrieval. This paper proposes an algorithm for fast and accurate detection of abrupt scene changes in an MPEG compressed domain with minimal decoding requirements arid computational effort. The proposed method compares two successive DC images of I-frames for finding the GOP (group of picture) which contain a scene change and uses macroblock-coded type information contained in B-frames to detect the exact frame where the scene change occurred. The experiment results demonstrate that the proposed algorithm has better detection performance, such as precision and recall rate, than the existing method using all DC images. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1753-1762
• /
• 1996

Since the number of spatial objects go easily into millions, they are stored on a secondary storage. In order to speed up accessing the geometric objects, we investigate spatial database system. The spatial objects are organized and accessed by spatial access methods(SAMs). But, SAMs are not able to organize polygons directly The most popular approach for handing polygon in SAMs is to use MBR apporximaotion as a geometric key. MBR provides a fast but inaccurate answers to approximation-based query processing. The performance of approximation-based spatial query processing depends on which type of approximation is chosen for the spatial objects. A suitable approximation is crucial for reducing the size of the candidate set. The better the approxmation quality, the fewer accesses to the exact object are necessary. In this paper, I proposed a new multicontainer approximation named Slice decomposition. The performance of proposed method is compared with other method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1393-1399
• /
• 1999

In this paper, a VLSI design of the convolutional codec chip of code rate r=l/3, and constraint length K=9 is presented, which is able to correct errors of the received data when transmitted data is corrupted in channels. The circuit design mainly aimed for simple implementation. In the decoder, Viterbi algorithm with 3-bit soft-decision is employed. For information sequence updating and storage, the register exchange method is employed, where the register length is 5$\times$K(45 stages). The codec chip is designed using VHDL language and Design Analyzer and VHDL Simulator of Synopsys are used for simulation and synthesis. The chip is composed of ENCODER block, ALIGN block, BMC block, ACS block, SEL_MIN block and REG_EXCH block. The operation of the codec chip is verified though the logic simulations, where several error conditions are assumed. As a result of the timing simulation after synthesis, the decoding speed of 325.5Kbps is achieved, and 6,894 gates is used.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.161-166
• /
• 2003

In this paper, we propose a novel method of design and implementation for the multimedia monitoring system using Web Camera. Recently WebCam is variously applied to many different areas and implemented as an improved performance using convenient functions of Web in this Internet era. Multimedia moving pictures has been popularly used in a variety of ways in different areas of monitoring systems in order to enhance the performance and the service with their data compression capability and the speed of the communication network these days. The design method of WebCam system presented in this paper might offer not only a convenient function of the monitoring system but great application capabilities. It can be used for a real time application of the multimedia picture and audio transmission so that the monitoring system can manage the security information in the sense for the reality. Tn addition, the monitoring system may be used as an inreal-time application using data storage and retrieval features of the Web. We offer both functions of monitoring in this structured form of implemented system.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.293-298
• /
• 2017

Recently, much research has been devoted to implementing and provisioning high-performance computing environment using clusters with multiple computers and high-performance networking technologies. In-memory based Key-Value stores, such as Redis or Memcached, are widely used in high performance cluster environments to improve the data processing performance. We can distribute data at different storage nodes, and each computing node can access it at a high speed using these In-memory based Key-Value stores. InfiniBand is a de-facto technology that is widely used to interconnect each node of a cluster. In this paper, we propose a new data pre-fetching scheme for Key-Value store based on high performance clusters to improve the performance. The proposed scheme utilizes the data transfer characteristics of InfiniBand. The results of the simulation show that the proposed scheme can reduce the data transfer time by up to about 28%.

• Proceedings of KOSOMES biannual meeting
• /
• 2003.11a
• /
• pp.181-185
• /
• 2003

the effect if atmosphere is more important in the West sea of Korea than in other seas because of shallow water and heat storage if the water. The serial oceanographic observation data and coastal station data from NFRID, and the atmosphere data from KMA were used in order to find out the relationship between them The highest water temperature, salinity and weather factor were recorded in Aug, and the lowest of them in Feb. As the water deepens, the maximum time leg in water temperature and the minimum time leg in salinity. Water temperature have the maximum in Oct, the minimum in Apr at 75m of the 311-07 station with 100m depth water temperature (WT)-air temperature, WT-precipitation (Preci.) and salinity (Sal)-wind speed (WS) were in direct proportion, but WT-WS, Sal-AT and Sal-Preci in inverse proportion Water temperature and salinity I-ave time leg at the same depth the maximum had more the delay of $2\~4$ months at a depth if 20 meters than at the surface in all stations except for salinity at 307-05.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.374-385
• /
• 2009

Flash memory becomes increasingly popular as data storage for various devices because of its versatile features such as non-volatility, light weight, low power consumption, and shock resistance. Flash memory, however, has some distinct characteristics that make today's disk-based database technology unsuitable, such as no in-place update and the asymmetric speed of read and write operations. As a result, most traditional disk-based database systems may not provide the best attainable performance on flash memory. To maximize the database performance on flash memory, some approaches have been proposed where only the changes made to the database, i.e., logs, are written to another empty place that has born erased in advance. In this paper, we propose an efficient log management scheme for flash-based database systems. Unlike the previous approaches, the proposed approach stores logs in specially allocated blocks, called log blocks. By evenly distributing logs across log blocks, the proposed approach can significantly reduce the number of write and erase operations. Our performance evaluation shows that the proposed approaches can improve the overall system performance by reducing the number of write and erase operation compared to the previous ones.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1384-1397
• /
• 2007

This paper proposes fast storage techniques for hybrid query of data streams. DSMS(Data Stream Management System) have been researched for processing data streams that have busting income. To process hybrid query that retrieve both current incoming data streams and past data streams data streams have to be stored into disk. But due to fast input speed of data stream and memory and disk space limitation, the main research is not about querying to stored data streams but about querying to current incoming data streams. Proposed techniques of this paper use circular buffer for maximizing memory utility and for make non blocking insertion possible. Data in a disk is compressed to maximize the number of data in the disk. Through experiences, proposed technique show that bursting insertion is stored fast.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.30 no.1
• /
• pp.79-87
• /
• 1997

A study on the processing method of anchovy hydrolysate paste (AHP) was carried out to improve the sensory quality of salted and fermented fish. Homogenized whole anchovy was hydrolyzed using commercial pretenses, Complex enzyme-2000 (CE, Pacific Chem. Co.) and Alcalase (AL, Novo), in a cylindrical vessel with 4 baffle plates and 6-bladed turbine impeller. Optimal pH, temperature, and enzyme concentration for the hydrolysis with CE and AL were $7.0,\;52^{\circ}C,\;7\%$, and $8.0,\;60^{\circ}C,\;6\%$, respectively. The rational amount of water for homogenization, agitation speed, and hydrolyzing time were $100\%\;(w/w)$, 100 rpm, and 210 min, respectively. To make the hydrolysate to paste type, it was effective to mix the additives, such as starch, soybean protein, agar, and carrageenan gum to the hydrolysate 5 min before the end of boiling at $100^{\circ}C$ for 30 min. Minimal NaCl concentration for long-term preservation was $15\%$, and this could be reduced to $12\%$ by adding $5\%$ of KCl. yield of the AHP based on the total nitrogen content was $94.6\~97.0\%,\;and\;86.0\~89.2\%$, of the nitrogen was amino nitrogen. Salinity, pH and histamine content of the AHP prepared with $12\%$ NaCl and $5\%$ KCl were $9.3\~9.9\%,\;6.1\~6.2$, and below 13 mg/100 g, respectively. The AHP was stable at $26{\pm}3^{\circ}C$ for 60 days on bacterial growth, and addition of $0.05\%$ of rosemary (Herbalox) extract was effective to inhibit the lipid oxidation of the AHP during storage.