• Korean Journal of Biological Psychiatry
• /
• v.5 no.1
• /
• pp.3-16
• /
• 1998

The neurophysiological study has been widely used in search of the relationship between brain and behavior. The basic techniques for the animal experiments of this kind such as stereotaxic techniques, lesioning methods, the methods of electrical stimulation and recording, and confirmation of histological location were briefly reviewed. Nevertheless, the importance of complementary neurochemical, neuroanatomical and behavioral studies can not be neglected.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.477-491
• /
• 2002

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.707-711
• /
• 2010

Most relational database systems provide $B^+$-trees as their main index structures, and use bulk-loading techniques for creating new $B^+$-trees on existing data from scratch. Although bulk loadings are more effective than inserting keys one by one, they are still time-consuming because they have to sort all the keys from large data. To improve the performance of bulk loadings, this paper proposes an efficient parallel bulk loading method for $B^+$-trees based on CUDA, which is a parallel computing architecture developed by NVIDIA to utilize computing powers of graphic processor units for general purpose computing. Experimental results show that the proposed method enhance the performance more than 70 percents compared to existing bulk loading methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.251-255
• /
• 2008

In most file systems, if a file is deleted, only the metadata of the file is deleted or modified and the file's data is still stored on the physical media. Some users require that deleted files no longer be accessible. This requirement is more important in embedded systems that employ flash memory as a storage medium. In this paper, we propose a secure deletion method for NAND flash file system and apply the method to YAFFS. Our method uses encryption to delete files and forces all keys of a specific file to be stored in the same block. Therefore, only one erase operation is required to securely delete a file. Our simulation results show that the amortized number of block erases is smaller than the simple encryption method. Even though we apply our method only to the YAFFS, our method can be easily applied to other NAND flash file systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.626-633
• /
• 2006

The wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Sensor operating systems that run on tiny sensor nodes are the key to the performance of the distributed computing environment for the wireless sensor networks. Therefore, sensor operating systems should be able to operate efficiently in terms of energy consumption and resource management. In this paper, we present an efficient memory allocation scheme to improve the time and space efficiency of memory management for the sensor operating systems. Our experimental results show that the proposed scheme performs efficiently in both time and space compared with existing memory allocation mechanisms.

• Journal of Information Management
• /
• v.18 no.4
• /
• pp.98-117
• /
• 1985

At the present time, the role and importance of information retrieval has greatly increased for two main reasons: the coverage of the searchable collections is now extensive and collection size may exceed several million documents; further more, the search results can now be obtained more or less instantaneously using online procedures and computer terminal devices that provide interaction and communication between system and users. The large collection size make it plausible to the users that relevant information will in fact be retrieved as a result of a search operation, and the probability of obtaining the search output without delay creates a substantial user demand for the retrieval services.

• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.859-870
• /
• 2009

Despite the surge in the research for keyword search method over relational database, only little attention has been devoted to studying on relational data stream.The research for keyword search over relational data stream is intense interest because streaming data is recently a major research topic of growing interest in the data management. In this regard we first analyze the researches related to keyword search methodover relational data stream, and then this paper focuses on the method of minimizing the join cost occurred while processing keyword search queries. As a result, we propose an advanced keyword search method that can yield more meaningful results for users on relational data streams. We also propose a query optimization method using layered-clustering for efficient query processing.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.335-344
• /
• 2008

We propose an adaptive garbage collection technique for hybrid flash memory which has both SLC and MLC. Since SLC area is fast and MLC area has low cost, the proposed scheme utilizes the SLC area as log buffer and the MLC area as data block. Considering the high write cost of MLC flash, the garbage collection for the SLC log buffer moves a page into the MLC data block only when the page is cold or the page migration invokes a small cost. The other pages are moved within the SLC log buffer. Also it adjusts the parameter values which determine the operation of garbage collection adaptively considering I/O pattern. From the experiments, we can know that the proposed scheme provides better performance compared with the previous flash management schemes for the hybrid flash and finds the parameter values of garbage collection close to the optimal values.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.617-625
• /
• 2009

NAND flash memory is widely used in embedded systems because of many attractive features, such as small size, light weight, low power consumption and fast access speed. However, it requires garbage collection, which includes erase operations. Erase operation is very slow. Besides, the number of the erase operations allowed to be carried out for each block is limited. The proposed garbage collection method focuses on minimizing the total number of erase operations, the deviation value of each block and the garbage collection time. NAND flash memory consists of pages of three types, such as valid pages, invalid pages and free pages. In order to achieve above goals, we use a page rate to decide when to do garbage collection and to select the target victim block. Additionally, We implement allocating method and group management method. Simulation results show that the proposed policy performs better than Greedy or CAT with the maximum rate at 82% of reduction in the deviation value of erase operation and 75% reduction in garbage collection time.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.3-3
• /
• 2023

수자원위성은 C-band 영상레이더(synthetic aperture radar, SAR)를 탑재한 중형급의 수자원 관리 및 수재해 감시 전용 위성이다. 수자원위성은 물 환경과 관련된 다양한 분야에 활용되어 고부가가치의 정보를 제공할 것으로 예상되는데, 특히 시계열 레이더 간섭기법(SAR interferometry, InSAR)의 적용을 통해 댐·보와 같은 수자원시설물의 미세변위 탐지 및 안정성 평가에 효과적으로 사용될 것으로 기대된다. 시계열 영상레이더 간섭기법은 고정산란체를 이용하는 Persistent Scatterer InSAR(PSInSAR) 기법과 분산산란체 기반의 Small BAseline Subset(SBAS) InSAR 기법으로 대표된다. 이 연구에서는 수자원위성에 적합한 수리시설물 시계열 변위 모니터링 알고리즘 개발을 목적으로, Sentinel-1 위성의 C-band SAR 기반 시계열 레이더 간섭기법의 적용성을 평가하고 알고리즘 개발에 고려해야 할 사항들을 분석하였다. 2020년 여름 수재해가 발생한 섬진강댐과 담양댐 및 수변부를 테스트 사이트로 선정하고, 2019년부터 2021년까지의 Sentinel-1 시계열 SAR 영상에 PSInSAR와 SBAS InSAR를 적용하여 시계열 변위를 관측하였다. 댐체에서는 PSInSAR가 SBAS InSAR에 비해 신뢰할 수 있는 시계열 변위를 산출하였다. 그러나 시계열 분석 기간이 길어짐에 따라 PSInSAR 시계열 변위의 정밀도가 낮아지는 경향이 관측되었다. 수변부에서 PSInSAR는 변위 정보를 거의 제공하지 못했다. SBAS InSAR는 수변부의 시계열 변위 모니터링에 효과적이었으나, 여름철 장마 등으로 인해 레이더 간섭도의 긴밀도(coherence)가 낮아질 경우 부정확한 변위를 산출하였다. 앞으로 국내의 다양한 수자원시설물을 대상으로 Sentinel-1 위성을 이용한 시계열 변위 모니터링 알고리즘의 적용성 평가 연구가 진행될 예정이며, 연구 결과를 수자원위성의 관측 특성에 적합한 변위 탐지 알고리즘의 개발에 활용하고자 한다.