• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1076-1085
• /
• 2004

Recently, the demands for real-time service and multimedia data are rapidly increasing. There are significant redundancies between header fields both within the same packet header and in consecutive packets belonging to the same packet stream. And there are many overheads in using the current UDP/IP protocol. Header compression is considered to enhance the transmission efficiency for the payload of small size. By sending the static field information only once initially and by utilizing dependencies and predictability for other fields, the header size can be significantly reduced for most packets. This work describes an implementation for header compression of the headers of IP/UDP protocols to reduce the overhead on Ethernet network. Typical UDP/IP Header packets can be compressed down to 7 bytes and the header compression system is designed and implemented in Linux environment. Using the Header compression system designed between a server and clients provides have the advantage of effective data throughput in network. Since the minimum packet size in Ethernet is 64 bytes, the amount of reduction by header compression in practical chatting environment was 6.6 bytes.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.398-408
• /
• 1994

It is true color that is allocated 1 byte to three basic colors, red, green, and blue in order to represent a pixel of an image. It is a merit that almost all colors are representable by using the true color. However, it requires a lot of storages. An efficient image compression method is necessary. Most of the existing compression methods have not considered the characteristics of the true color images. Therefore, the efficient compression has been almost impossible. The differences of each pixel and its adjacent pixels in the true color images are few. Only a few bits in 3 bytes data which represent a pixel have different values. But the different bits are scattered in 3 bytes, so efficient compression results are not achieved. Therefore, in the study it is shown that the similarities of data are increased by relocating the data structures of true color images. And an efficient compression strategy which uses the similarities of data is proposed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.4
• /
• pp.177-185
• /
• 2005

NAND-type flash memory is becoming increasingly popular as a large data storage for mobile computing devices. Since flash memory is an order of magnitude more expensive than magnetic disks, data compression can be effectively used in managing flash memory based storage systems. However, compressed data management in NAND-type flash memory is challenging because it supports only page-based I/Os. For example, when the size of compressed data is smaller than the page size. internal fragmentation occurs and this degrades the effectiveness of compression seriously. In this paper, we present an efficient flash compression layer (FCL) for NAND-type flash memory which stores several small compressed pages into one physical page by using a write buffer Based on prototype implementation and simulation studies, we show that the proposed scheme offers the storage of flash memory more than $140\%$ of its original size and expands the write bandwidth significantly.

• The Journal of Korean Academy of Orthopedic Manual Physical Therapy
• /
• v.26 no.2
• /
• pp.73-80
• /
• 2020

Background: This study examined the effects of myofascial release exercise using an inflatable compression therapy ball on spinal flexibility in adults to present basic data to improve spinal flexibility. Methods: The participants were assigned randomly to two groups: the myofascial release exercise group (MRE, n=60) and the stretching exercise group (SE, n=60). The MRE group performed myofascial release exercise for the erector spine muscles using an inflatable compression therapy ball. The SE group performed stretching exercises of the erector spine muscles. Each exercise was performed in 3 sets of 10 repetition daily for one week. Results: The within-group comparison revealed a statistically significant difference between the pre-intervention and post-intervention measurements in only MRE group (p<.05). On the other hand, the between-group comparison revealed the MRE group to show statistically significant improvement in spinal flexibility (p<.05). In effect size, the MRE group was -1.82 (95% CI= -2.24~-1.39), and the SE group was -.7 (95% CI= -1.15~-.41). Conclusion: Myofascial release exercise for the erector spine muscles using an inflatable compression therapy ball was more effective in improving spinal flexibility than stretching exercises for the erector spinae muscles. However, although myofascial release exercise using inflatable compression therapy ball is more effective than stretching exercise, it is insignificant, and research is also insignificant. It is believed that more diverse studies using props will be needed in the future.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1287-1294
• /
• 2021

This paper is a study on the implementation of a sensor-based smart compression system for improving home and street environments. Since modernization, the amount of garbage has been increasing every year, and this has seriously adversely affected not only people but also ecosystems such as marine pollution and soil pollution. In particular, in large cities with large floating populations, garbage is dumped on the streets without proper measures to deal with the amount of waste generated. In order to improve this problem, this paper intends to implement a system with automatic compression and opening/closing functions using sensors. This system is designed to activate automatic opening/closing function through an infrared sensor, and automatically opening and closing when the inclination is changed using an impact sensor. In addition, by installing a distance sensor, the amount of internal waste can be easily monitored from the outside, and a manual compression switch and a manual opening/closing switch is separately designed to enable opening and closing and compression as needed to increase the effectiveness.

• Journal of the Korean Wood Science and Technology
• /
• v.33 no.1 s.129
• /
• pp.38-47
• /
• 2005

Compression, lateral, and opposite woods in a branch of Pinus parviflora S. et Z. were described and compared in the qualitative anatomical aspects through light and scanning electron microscopy. Tracheid transition from earlywood to latewood in the compression wood appeared to be relatively more gradual than in the opposite or lateral wood. Growth ring width and proportion of latewood were thought to be greater in the compression wood than in the lateral or opposite wood. The latewood tracheids of compression wood in transverse surface were mostly round, differently from those of lateral and opposite woods with square to angular shapes. Also, intercellular spaces, helical cavities and checks, and slit-like pit apertures were observed only in the compression wood tracheids. Cross-field pitting in the compression wood appeared not to be used as diagnostic guide because of their severe alteration from normal fenestriform or window-like type to cupressoid to taxodioid types. In tangential surface, fusiform rays in the compression wood were wider but lower than those in the lateral wood or opposite wood. In conclusion, compression wood was different from lateral and opposite woods but lateral and opposite woods were almost identical in qualitative anatomical features.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.3
• /
• pp.125-132
• /
• 2022

Sentence compression is a natural language processing task that generates concise sentences that preserves the important meaning of the original sentence. For grammatically appropriate sentence compression, early studies utilized human-defined linguistic rules. Furthermore, while the sequence-to-sequence models perform well on various natural language processing tasks, such as machine translation, there have been studies that utilize it for sentence compression. However, for the linguistic rule-based studies, all rules have to be defined by human, and for the sequence-to-sequence model based studies require a large amount of parallel data for model training. In order to address these challenges, Deleter, a sentence compression model that leverages a pre-trained language model BERT, is proposed. Because the Deleter utilizes perplexity based score computed over BERT to compress sentences, any linguistic rules and parallel dataset is not required for sentence compression. However, because Deleter compresses sentences only considering perplexity, it does not compress sentences by reflecting the linguistic information of the words in the sentences. Furthermore, since the dataset used for pre-learning BERT are far from compressed sentences, there is a problem that this can lad to incorrect sentence compression. In order to address these problems, this paper proposes a method to quantify the importance of linguistic information and reflect it in perplexity-based sentence scoring. Furthermore, by fine-tuning BERT with a corpus of news articles that often contain proper nouns and often omit the unnecessary modifiers, we allow BERT to measure the perplexity appropriate for sentence compression. The evaluations on the English and Korean dataset confirm that the sentence compression performance of sentence-scoring based models can be improved by utilizing the proposed method.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.21-34
• /
• 2007

According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.

• Journal of Broadcast Engineering
• /
• v.24 no.2
• /
• pp.306-314
• /
• 2019

Since the resolutions of videos increase rapidly, there are continuing needs for effective video compression methods despite an increase in the transmission bandwidth. In order to satisfy such a demand, a reconstructive video coding (RVC) method by using a super resolution has been proposed. Since RVC reduces the resolution of the input video, when frames are compressed to the same size, the number of bits per pixel increases, thereby reducing coding artifacts caused by video coding. However, RVC method using super resolution is not effective in all target bitrates. Comparing the size of the loss generated while downsizing the resolution and the size of the loss caused by the video compression, only when the size of loss generated in the video compression is larger, RVC method can perform the improved compression performance compared to direct video coding. In particular, since HEVC has considerably higher compression performance than the previous standard video codec, it can be experimentally confirmed that the compression distortions become larger than the distortions of downsizing the resolution only in the very low-bitrate conditions. In this paper, we applied RVC based HEVC in various video types and measured the target bitrates that RVC method can be effectively applied.

• Journal of the Korea Concrete Institute
• /
• v.21 no.3
• /
• pp.291-302
• /
• 2009

A compression lap splice can be calculated longer than a tension lap splice in high strength concrete according to current design codes. New criteria for the compression lap splice including the effects of concrete strength are required for practical purpose of ultra-high strength concrete. Characteristics of compression lap splice have been extensively investigated and main parameters are derived. In addition, an experimental study has been conducted with column specimens in concrete strength of 40 and 60 MPa. The strength of the compression lap splice consists of bond and end bearing and two contributors are combined. Therefore, combined action of bond and end bearing should be assessed. Compared with tension splices, concrete strength significantly affects the strength of compression splices due to short splice length and existence of end bearing. Test results show that the splice strength can be evaluated to be proportional to square root of compressive strength of concrete. The stress states of concrete surrounding spliced bars govern the strengths of bond and end bearing. Because the axial stress of the concrete is relatively high, the splice strength is not dependent on clear spacing. End bearing strength is not affected by splice length and clear spacing and is expressed with a function of the square root of concrete strength. The failure mode of specimens is similar to side-face blowout of pullout test of anchors and the strength of end bearing can be evaluated using the equation of side-face blowout strength. Because the stresses developed by bond in compression splices are nearly identical to those in tension splices, strength increment of compression splices is attributed to end bearing only.