• The Journal of Art Theory & Practice
• /
• no.13
• /
• pp.7-33
• /
• 2012

The memory of the Korean War is about the time period when people lived toughly during evacuation, due to being exposed to the natural climate such as intense cold or heat without any protection, leaving their comfortable home and living in temporary built shelters which were barely enough to avoid the wind. 'Death is concealed and only the figures of evacuation for survival were expressed, just as how the government ordered. Since the experience of the battlefield is personal and fragmentary, that is broken into pieces, it does not have compatibility. As war is a distorted experience that cannot be placed in a big picture, it is not possible to take a view of the war's big picture. Having this individualized experience as a common collective memory is an issue and it is the will that people tries to pursue. The reason why the evacuees from north to south, and as well as from the south to further south were all able to be adopted as the theme of artworks due to the military action that emptied the occupied territories of the North Korean Army under the forced removal command. In such situations, the natural state of the 'snow' was like a symbol of the 1.4 Recession. The group of people who were thrown into the intense cold displaced the war damage of loosing their base livelihood, and symbolized the obedient citizens who faithfully follow their government's command. The figure of advocating anti-communism is projected as a figure of a refugee during cold winter-time and it contains ones past which he or she obeyed its own country's commands. Evacuation, especially the evacuation during the winter is a visual device that can confirm these kinds of country's command. The consequences were same for the artists as well. Therefore, the situation being communal could be found due to the individual experiences during war are ideological. The image of the refuge shown in the picture played the role of strengthening the consciousness of defecting to South Korea into the meaning of the 'Finding Freedom.' I would like to express that the reason of them leave their home during the harsh winter is in order to avoid the oppression of the Communist Party. The evacuation that people went through was not to 'Finding Freedom', but 'To Survive'. Later, this evacuation has been imprinted as a behavior of choosing free Republic of Korea, which was an ideological issue. Anti-communism was the rule of survival in South Korea society, and people have the tendency to remember what they want to remember. As it is not the people who possesses an incident, but the memory that possesses ones, people cover their memory with disguised plots in order to forget the violence and to live a different prologue. They share the incident of violence as a hurtful memory. The tragedy of the Korean War was the result of Ideology and being in between the powerful nations' rights, but the violence during the war has been depicted as a natural disaster, which was the evacuation in heavy snow.

• Korean Journal of Acupuncture
• /
• v.19 no.2
• /
• pp.63-78
• /
• 2002

Kupunggibodan(KU), Gamisamul-tang(GA) and Whangryunhaedok-tang(WH) are clinically the most popular prescriptions as an herbal medicine in the treatment of ischemia. In order to compare and evaluate their protective effects on the ischema-induced cognitive deficits by middle cerebral artery occlusion (MCAO), we examined its ability to improve ischemia-induced cell loss and impairements of learning and memory in the Morris water maze and eight-arm radial arm maze. Focal cerebral ischemia produced a marked cell loss, decrease in acetylcholinesterase(AchE) reactivity in the hippocampus, and learning and memory deficits in two behavioral tasks. Pretreatment with WH (100 mg/kg, p.o.) produced a substantial increase in acquisition in the Morris water maze. Pretreatment with KU increased the perfomance of the resention test in the Morris water maze. WH, KU and GA caused a significant improvement in choice accuracy in radial arm maze test. WH was superior to KU and GA in perfomance of the radial arm maze test. Consistent with behavioral data, staining with cresyl violet showed that pretreatments with WH, but not KU and GA significantly recovered the ischemia-induced cell loss in the hippcampal CA1 area. In addition, pretreatments with WH and KU recovered the ischemia-induced reduction of AchE reactivity in the hippocampal CA1 area. These results demonstrated that KU, GA and WH have protective effects against ischimea-induced learning and memory impairments and that the efficacy was the order of WH>KU>GA in tratment of ischemia induced memory deficits. The present studies provide an evidence of KU, GA and WH as putative treatment of vascular dementia. Supported by a fund from the Ministry of Health and Welfare(HMP-00-OO-04-0004), and the Brain Korea 21 Project from Korean Ministry of Education, Korea.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.755-766
• /
• 2008

Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.

• Korean journal of communication and information
• /
• v.60
• /
• pp.104-124
• /
• 2012

The purpose of this study is to explore how North Korean woman defectors' memories of their past lives are represented in Korean television talk show, (Channel A, 2011~) and its social implications. In order to carry out this task, this study first discusses the emergence of the concept of 'memory' in its relations with 'collective memory', 'cultural memory' and 'history', and its social appropriation in media such as television. And, the ideological aspects of the recent trend of television talk show that deals with people's private memories were also discussed. The study used the method of structural narrative analysis. The findings are the following. First of all, North Korean woman defectors' memories in collide with the dominant public memories in South Korea. In any case, it has been found that the show tended to make North Korea and their defectors as exotic 'others' and thereby reinforce the existing public memory. After all, this study argues that the representation of the defectors' memories in the talk show only results in stressing the melodramatic narrative emotionally packaged with 'laughing' and 'crying' without any sincere consideration of them.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.189-200
• /
• 2001

This paper proposes a memory allocation model for Real-Time Linux. The proposed model allows users to create several continuous memory regions in an application, to specify an appropriate region allocation policy for each memory region, and to request memory blocks from a necessary memory region. Instead of using single memory management module in order to support the proposed model, we adopt two-layered structure that is consisted of region allocators implementing allocation policies and a region manager controlling regions and region allocator modules. This structure separates allocation policy from allocation mechanism, thus allows system developers to implement same allocation policy using different algorithms in case of need. IN addition, it enables them to implement new allocation policy using different algorithms in case of need. In addition, it enables them to implement new allocation policy easily as long as they preserver predefined internal interfaces, to add the implemented policy into the system, and to remove unnecessary allocation policies from the system, Because the proposed model provides various allocation policies implemented previously, system builders can also reconfigure the system by just selecting most appropriate policies for a specific application without implementing these policies from scratch.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.157-168
• /
• 2011

Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.232-238
• /
• 2003

Traditional operating systems use a virtual memory to provide users with a bigger memory than a physical memory. The virtual memory augments the insufficient physical memory by the swap device. Since disks are usually used as the swap device, the cost of a page fault is relatively high compared to the access cost of the physical memory. Recently, numerous papers have investigated the Network RAM in order to exploit the idle memory in the network instead of disks. Since today's distributed systems are interconnected with high-performance networks, the network latency is far smaller than the disk access latency In this paper we design and implement the Network RAM using block device driver on Linux. This is the first implementation of the Network RAM on Linux. We propose the new reliability method to recover the page when the other workstation's memory is damaged. The system using the Network RAM as the swap device reduces the execution time by 40.3% than the system using the disk as the swap device. The performance results suggest that the new reliability method that use the processor more efficiently has the similar execution time with others, but uses smaller server memory and generates less message traffic than others.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.836-840
• /
• 2009

Many researchers have studied flash memory in order to replace hard disk storages. Many FTL algorithms have been proposed to overcome physical constraints of flash memory such as erase-before-write, wear leveling, and poor write performance. Therefore, these constraints should be considered for testing FTL algorithms and the performance evaluation of flash memory. As doing the experiments, we suffer from several problems with costs and settings in experimental configuration. When we, for example, replay the traces of Oracle to evaluate the I/O performance with flash memory, it is hard to extract exact traces of I/O operations in Oracle. Since there are only write operations in the log, it is impossible to gather read operations. In MySQL and SQLite, we can gather the read operations by changing I/O functions in the source codes. But it is not easy to search for the exact points about I/O and even if we can find out the points, we might get wrong results depending on how we modify source codes to get I/O traces. The FlaSim proposed in this paper removes the difficulties when we evaluate the performance of FTL algorithms and flash memory. Our Linux drivers emulate the flash memory as a hard disk. And we can easily obtain the usage statistics of flash memory such as the number of write, read, and erase operations. The FlaSim can be gracefully extended to support the additional modules implemented by novel algorithms and ideas. In this paper, we describe the structure of FTL emulator, development tools and operating methods. We expect this emulator to be helpful for many experiments and research with flash memory.

• Journal of the Society of Naval Architects of Korea
• /
• v.45 no.3
• /
• pp.258-268
• /
• 2008

The radiation potential of a ship advancing in waves is studied using the 3D time-domain forward-speed free-surface Green function and the Green integral equation. Numerical solutions are obtained by making use of the 2nd order BEM(Boundary Element Method) which make it possible to take account of the line integral along the waterline in a rigorous manner. The 6 degree of freedom motion memory functions of a hemisphere and the Wigley seakeeping model obtained by direct integration of the time-domain 3D potentials over the wetted surface are presented for various Froude numbers.