• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.917-923
• /
• 2011

In this paper, a new prediction based embedded compression (EC) codec algorithm for the JPEG2000 encoder system is proposed to reduce excessive memory requirements. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform (DWT) stages compared with direct implementation of the DWT engine of this paper. The LOCO-I predictor and MAP are widely used in many lossless picture compression codec. The proposed EC algorithm use these predictor which are very simple but surprisingly effective. The predictive EC scheme adopts a forward adaptive quantization and fixed length coding to encoding the prediction error. Simulation results show that our LOCO-I and MAP based EC codecs present only PSNR degradation of 0.48 and 0.26 dB in average, respectively. The proposed algorithm improves the average PSNR by 1.39 dB compared to the previous work in [9].

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.422-428
• /
• 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 slower than other operations. Further, a block has a limited erase lifetime (typically 100,000) after which a block becomes unusable. The proposed garbage collection policy 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 ratio to decide when to do garbage collection and to select the target victimblock. 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 85% of reduction in the deviation value of the erase operations and 6% reduction in garbage collection time.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.22 no.3
• /
• pp.103-110
• /
• 2018

The long-term flexural behavior of reinforced concrete (RC) beams strengthened with an iron based-shape memory alloys (Fe-SMAs) by a near-surface mounted (NSM) method was evaluated. The pre-strained values of 2% and 4% and introduced prestressing force by an activation of a shape memory effect of the Fe-SMA strengthening material were considered as experimental variables. Deflections at the center of the RC beams were measured for six months after the 1 tonf concrete weight was loaded on the beam. Experimental results show that the deflections decreased because of the increased flexural stiffness of beams strengthened with the Fe-SMA strips. On the contrary, with increased pre-strained values, the deflection increased due to stiffness reduction of the strengthening material. It was confirmed that the specimens incorporating the prestressed force showed the deflection reduction of about 30%, compared to the ones without the prestressed force.

• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.5
• /
• pp.89-98
• /
• 2010

Wireless LAN (WLAN) is type of wireless service that has higher data transmission than current cellular networks. The usage is continually increasing. There are a lot of vulnerabilities in wireless network, due to the properties of the wireless environment, regardless of its popularity. IEEE announced the 802.11i security standard to solve these problems. The vulnerable point of messages used in the process of key distribution for 802.11i makes the target node attacked lose memory through continuous messages and blocks the legitimate WLAN service. In this paper, we proposed new schemes to solve this problem and compared our proposals with the current process. The proposed protocol eliminates the memory exhaustion problem on the client side by using methods for reduction of memory usage.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2008

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and at the same time places each data object that has different size into different shared pages. Consequently data objects that have the different call-site and different object size prohibited from being allocated to the same shared page. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1183-1190
• /
• 1999

This paper presents an efficient hardware architecture to improve the frame memory interface occupying the largest hardware area together with motion estimator in implementing MPEG-2 video encoder as an ASIC chip. In this architecture, the memory size for internal data buffering and hardware area for frame memory interface control logic are reduced through the efficient memory map organization of the external SDRAM having dual bank and memory access timing optimization between the video encoder and external SDRAM. In this design, 0.5 m, CMOS, TLM (Triple Layer Metal) standard cells are used as design libraries and VHDL simulator and logic synthesis tools are used for hardware design add verification. The hardware emulator modeled by C-language is exploited for various test vector generation and functional verification. The architecture of the improved frame memory interface occupies about 58% less hardware area than the existing architecture[2-3], and it results in the total hardware area reduction up to 24.3%. Thus, the (act that the frame memory interface influences on the whole area of the video encoder severely is presented as a result.

• The Korean Journal of Rehabilitation Nursing
• /
• v.3 no.2
• /
• pp.181-195
• /
• 2000

The purpose of this study is to find out the effects of personal characteristics, social support, depression, and metamemory on the older adults' memory performances. The subjects of the study consisted of 95 older adults over the age of 60 who are living in Busan. Some data were collected by means of the interview method, using questionnaires for metamemory (MIA questionnaire by Dixon, et al., 1988), and depression(GDS by Yesavage and Sheikl, 1986), social resoueces(Duke university, 1978), family support(Hyun-Sook Kang, 1985). The other data were collected by the testing method on the memory performance such as the immeadiate word recall task, the delayed word recall task, the word recognition task(Elderly Verbal Learning Test by Kyung Mi Choi, 1998), and the face recognition task(Face Recognition Task tool developed by Hye-Sook Min). The results of this study were as follows; 1. The level of metamemory is 3.4 points in the 5 point scale, the grades of the task and the achievement are relatively high and the grades of the change, the control, and the anxiety are relatively low in the sub-concepts. 2. Metamemory have significant relation with age(r=-.44), educational attainment(r=.46), depression(r=-.58), family support(r=.20), social resources(r=.20). 3. The significant variables to predict older adults' metamemory are educational attainment(22%), sex(11%), age (8.3%), depression(4.7%), and illness state(3%). 4. The strong variables to predict memory performances are metamemory, age, depression, social resources, educational attainment, illness state, and limitation of daily living activity related to illness. In conclusion, the enhancement strategies of metamemory and the social support and the prevention or reduction of depression are necessary to increase older adults' memory performances. Ultimately in this respect nurses' roles are very important in developing and performing some intervention programs for old adults' memory improvement, which have significant meanings in the field of nursing science.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.319-330
• /
• 2001

In virtual memory system, when a process attempts to access a page that is not resident in memory, the system generates and handles a page fault that causes unpredictable delay. So virtual memory system is not appropriate for the real-time system, because it can increase the deadline miss ratio of real-time task. In multimedia system, virtual memory system may degrade the QoS(quality of service) of multimedia application. Furthermore, in general-purpose operating system, whenever a new task is dynamically loaded, virtual memory system suffers from extensive page fault that cause transient overloading state. In this paper, we present efficient overloading control mechanism called RBPFH (Rate-Based Page Fault Handling). A significant feature of the RBPFH algorithm is page fault dispersion that keeps page fault ratio from exceeding available bound by monitoring current system resources. Furthermore, whenever the amount of available system resource is changed, the RBPFH algorithm dynamically adjusts the page fault handling rate. The RBPFH algorithm is implemented in the Linux operating system and its performance measured. The results demonstrate RBPFH\`s superior performance in supporting multimedia applications. Experiment result shows that RBPFH could achieve 10%∼20% reduction in deadline miss ratio and 50%∼60% reduction in average delay.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.52-55
• /
• 2000

The temperature effects of programming speed and endurance characteristics in p-channel flash memory cell have been investigated. In the case of room temperature, the programming speed of p-channel flash memory by using BTB scheme is faster than that by using CHE scheme. However, endurance characteristics with BTB programming scheme is not better than that with CHE programming scheme. In the case of elevated temperature, CHE programming speed is reduced due the gate current degradation but BTB programming speed is enhanced due to the increasing of gate current. Finally, the endurance characteristics of both schemes are improved due to the reduction of gate oxide traps.