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

In order to find out whether BA can be obtained significantly in large scale or not, the research has been conducted. Platanus species is one of the most widely spreaded shade-tree on the road side in Korea. To examine BA content in the species, samples were collected from various locations in Seoul and Kyunggi Province at each season. The MeOH extracts were obtained from the air-dried and ground samples. BA fraction was obtained by partitioned with chloroform and water then the BA content was measured in HPLC. Consequently, it has been revealed that most of the Platanus species showed to have significant amount of BA all over the examined area and the best season is at the end of November to collect the tree branches for BA.

• Structural Engineering and Mechanics
• /
• v.61 no.6
• /
• pp.807-816
• /
• 2017

In this paper, we introduce an efficient new model reduction method, named the automated static condensation method, which is developed for the local analysis of large finite element models. The algebraic multilevel substructuring procedure is modified appropriately, and then applied to the original static condensation method. The retained substructure, which is the local finite element model to be analyzed, is defined, and then the remaining part of the global model is automatically partitioned into many omitted substructures in an algebraic perspective. For an efficient condensation procedure, a substructural tree diagram and substructural sets are established. Using these, the omitted substructures are sequentially condensed into the retained substructure to construct the reduced model. Using several large practical engineering problems, the performance of the proposed method is demonstrated in terms of its solution accuracy and computational efficiency, compared to the original static condensation method and the superelement technique.

• Journal of the Korean Wood Science and Technology
• /
• v.37 no.2
• /
• pp.171-176
• /
• 2009

The chemical constituents of Acer komarovii Pojark. which belongs to Aceraceae has never been reported. The bark of A. komarovii was extracted with 70% aqueous acetone, and the concentrated extract was successively partitioned with n-hexane, dichloromethane, ethyl acetate and $H_2O$. From the ethyl acetate soluble fraction, four compounds were isolated by the repeated Sephadex LH-20 and RP C-18 column chromatography. From the results of spectroscopic methods including FAB-MS, 1D and 2D NMR, the structures of the compounds were determined as quercetin (1), guaijaverin (2), hirsutrin (3) and hyperin (4). These compounds (1-4) have not been reported in this tree yet.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.4
• /
• pp.99-105
• /
• 1994

k-bounded circuits are combinational circuits proposed by Fujiwara whose subcircuits are partitioned in a way that they form a tree and have some restricted k inputs respectively. Fujiwara proposed a O($16^{k}m$) fault detection algorithm for k-bounded circuits where m is the number of signal lines in the circuit. This algorithm is very ineffective to be applied to real circuits, even for small values of k. In this paper, it is shown that a single stuck-at fault in k-bounded circuits can be detected in O($2^{k}m$)time, and multiple stuck-at faults are detected in O($4^{k}m$) time by using thable lookup and imput partitionsing.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.11
• /
• pp.128-139
• /
• 1996

In this paper, we propose an algorithm to solve the problem of placement of rectangular blocks whose sizes and shpaes are pre-determined. The proposed method solves the placement of many retangular blocks of different sizes and shapes in a hierarchical manner, so as to minimize the chip area. The placement problem is divided into several sub-problems: hierarchical partioning, hierarchical area/shape estimation, hierarchical pattern pacement, overlap removal, and module rotation. After the circuit is recursively partitioned to build a hierarchy tree, the necessary wiring area and module shpaes are estimated using the resutls of the partitioning and the pin information before the placement is performed. The placement templaes are defined to represent the relative positions of the modules. The area and the connectivity are optimized separately at each level of hierachy using the placement templates, so the minimization of chip area and wire length can be achieved in a short execution time. Experiments are made on the MCNC building block benchmark circuits and the results are compared with those of other published methods. The proposed technique is shown to produce good figures in tems of execution time and chip area.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.187-190
• /
• 2004

This paper proposes an efficient hardware implementation of SPIHT(Set Partitoning In Hierarchical Tree) algorithm for image compression with the discrete wavelet transform. An efficient technique to scan the coefficients which are located in partitioned spatial orientation trees by DWT is considered in terms of counter fields for sorting pass and refinement pass. The proposed image compression method using SPIHT has been modeled in VHDL and has been implemented by use of both TMS320C6000 as a DSP and Virtex2 as a Xilinx FPGA.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.5
• /
• pp.409-415
• /
• 2009

The head-related transfer function (HRTF), which has an important role in virtual sound localization has different characteristics across the subjects. Measuring HRTF is very time-consuming and requires a set of specific apparatus. Accordingly, HRTF customization is often employed. In this paper, we propose a method to search an adequate HRTF from a set of the HRTFs. To achieve rapid and reliable customization of HRTF, all HRTFs in the database are partitioned, where a binary search tree was employed. The distortion measurement adopted in HRTF partitioning was determined in a heuristic way, which predicts the differences in perceived sound location well. The DC-Davis CIPIC HRTF database set was used to evaluate the effectiveness of the proposed method. In the listening test, where 10 subjects were participated, the stimuli filtered by the HRTF obtained by the proposed method were closer to those by the personalized HRTF in terms of sound localization. Moreover, performance of the proposed method was shown to be superior to the previous customization method, where the HRFT is selected by using anthropometric data.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.627-630
• /
• 2014

The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2789-2800
• /
• 1996

Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.