• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.575-578
• /
• 2003

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.

• Korean Journal of Plant Resources
• /
• v.23 no.3
• /
• pp.223-227
• /
• 2010

In order to select superior tree from Korea, five major phenolic compounds including (-)-epicatechin(EC), chlorogenic acid (ChA), hyperoside (HP), isoquercitrin (IQ), and procyanidin B2 (PC-$B_2$) in hawthorn fruit were evaluated. We also compared these hawthorn fruits of five clones with Chinese hawthorn cultivars. HPLC with a diode-array detector was used to determine the contents of the individual compounds. Hawthorn fruits of five clones (selected from different area of Korea), and four Chinese hawthorn cultivars grown in the Korea Forest Research Institute (Suwon) were utilized. With their high functional components, Jungsun is the clone including the highest contents of EC (11.26 mg/g) and PC-$B_2$ (24.46 mg/g). The clone of Chuncheon 15 had highest HP (0.53 mg/g) and IQ (0.41 mg/g). From the results, the clone of Jungsun and Chuncheon 15 can be evaluated to be selected breeding material for cultivar development.

• Landscaping Tree
• /
• v.24 no.1_2
• /
• pp.34-34
• /
• 1995

• The Korean Journal of Ecology
• /
• v.26 no.4
• /
• pp.165-172
• /
• 2003

The objectives of this study were to examine the physiological responses to ozone and to measure ozone uptake rates of Betula species exposed to relatively high concentration of pollutants. At the end of the growing season, photosynthesis, pigments contents, antioxidants (SOD and GR) and ozone uptake rates were measured or estimated at the leaves of five Betula species (Betula costata, B. davurica, B. platyphylla var. japonica, B. schmidtii and B. ermanii) exposed to 100ppb ozone concentration. On the termination of the experiment, growth effects were determined by measuring leaf area and dry weights of leaf, stem and root. Ozone treatment showed the significant reduction the leaf area and dry weight of four Betula species, except for B. ermanii. Shoot / root (SR) ratio of five species represented two different types. SR ratio of B. costata and B. davurica were lower than control, in contrast, SR ratio of B. platyphylla var. japonica, B. schimidtii and B. emani, were higher than that of control. The photosynthetic responses of five species were different in responses to ozone exposure. Four species, except for B. emanii, maintained or increased the stomatal conductance, but B. emanii decreased both stomatal conductance and photosynthesis. SOD activities of five species decreased by the ozone exposure, especially B. ermanii showed the largest reduction, GR activities of B. platyphylla var. japonica and B. schmidtii increased, B. costata and B. emanii decreased. Instantaneous ozone uptake rate was the highest at the leaves of B. ermanii and B. costata, ozone uptake per seedling was the highest at the leaf of B. schmidtii and B. emanii. It was concluded that B. costata, B. davurica and B. platyphylla var. japonica, appeared the growth reduction and visible ozone injury, were sensitive species to ozone, and B. schmidtii with the increased antioxidant activity and B. ermanii without the growth reduction were relatively resistant species to high ozone concentration at the early growing stage.

• Journal of Korean Society of Forest Science
• /
• v.105 no.4
• /
• pp.441-448
• /
• 2016

The purpose of this study was to broaden our knowledge on the productivity and costs of felling operation in three different harvesting methods(whole tree, tree-length and cut-to-length). Felling was conducted in three different harvesting methods with two workers who have different work experiences. Worker A and B have had felling experiences for about 5 years and 15 years, respectively. Felling productivity in whole tree method was $10.3m^3/SMH$ for worker A and $12.7m^3/SMH$ for worker B. Felling costs for worker A and B were $2,066won/m^3$ and $2,201won/m^3$, respectively. Although felling productivity of worker B in whole tree method was higher than worker A, felling costs of worker A were similar to worker B because the wage of worker B was more expensive than the wage of worker A (p>0.05). In tree-length method, felling cost of worker B were cheaper than that of worker A. Felling productivity and cost in tree-length method were $2.2m^3/SMH$ and $9,890won/m^3$ for worker A and $3.3m^3/SMH$ and $8,459won/m^3$ for worker B, respectively (p<0.05). In cut-to-length method, felling productivity and cost were $2.3m^3/SMH$ and $9,584won/m^3$ for worker A and $3.0m^3/SMH$ and $9,395won/m^3$ for worker B, respectively. Felling productivity of worker B was higher than that of worker A(p>0.05). Our preliminary results found that harvesting methods and worker's experiences highly affect on the productivity and costs of felling operations. These results should be useful for forest managers when planning cost-effective harvesting operations.

• Journal of Advanced Navigation Technology
• /
• v.20 no.6
• /
• pp.625-630
• /
• 2016

Recently, various types of image contents are being produced, and interest in copyright protection technology is increasing. In this paper, we propose an image encryption technology for color images. This technique divides the image into RGB color components and then performs quad-tree decomposition based on the edge of image. After the quad-tree partitioning, encryption is performed on the selected blocks. Encryption is performed on color components to measure encryption efficiency, and encryption efficiency is measured even after reconstitution into a color image. The encryption efficiency uses a visual measurement method and an objective image quality evaluation method. The PSNR values were measured as 7~10 dB for color difference components and 16~19 dB for color images. The proposed image encryption technology will be used to protect copyright of various digital image contents in the future.

• Journal of the Korean Society of Costume
• /
• v.58 no.5
• /
• pp.13-34
• /
• 2008

In Headgear and Ornaments for Diadem in the Period of the Three States there was Conical Cap(or Pointed Cap), Feathered Cap(Trim), and Crown[Tree-typed Diadem and Tree and Antler-typed Diadem] was excavated from the tombs. Feathered Trim is 5 types, Feathered Trim I-A, Feathered Trim I-B, Feathered Trim II-A, Feathered Trim II-B, Feathered Trim II-C in according to upper part of central insert plate style. Feathered Trim I-A, I-B, II-B type was general style that was found in most of the old tombs in ancient Silla, Gaya. Feathered Trim II-A type was excavated from the only Silla tombs and II-C type was excavated from Gaya tombs. The Ornaments for Diadem in Baekje was excavated from the tombs is adorned with a arranged leaf-stems on either sides and the flower-shaped. They were distinguished with the original mode of Goguryeo and ancient Silla at the time. Tree-typed Diadem is five part in according to the Mountain(;山)-typed piled up. Only one Mountain(;山)-typed one in three stand-up ornament(I-1 type), and three step one in three stand-up one(I-2 type), modification one (I-3 type), three step one of four and five stand-up ones(I-4 type), and four step one of four and five stand-up ones (I-5 type). Tree and Antler-typed Diadem is three part in according to the step of Mountain(; 山)-typed and cross-shaped of the upper part. Three one of three step one of Mountain(;山)-typed and two Antler- typed (II-1 type), cross-shaped one(II-2 type), four step one(II-3 type).

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.520-534
• /
• 2003

In this paper, a performance evaluation model of the Fat-tree Network with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the switch network. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Two important parameters of the network performance, throughput and delay, are then evaluated. The proposed model takes simple and primitive switch networks, i.e., no flow control and drop packet, to demonstrate analysis procedures clearly. It, however, can not only be applied to any other complicate modern switch networks that have intelligent flow control but also estimate the performance of any size networks with multiple-buffered switches. To validate the proposed analysis model, the simulation is carried out on the various sizes of Fat-tree networks that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.593-604
• /
• 2001

A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.81-91
• /
• 1994

A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.