• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.18-28
• /
• 2004

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1399-1406
• /
• 2009

In the internet broadcast, efficient and scalable mechanism of multicast is needed for the communication between groups. Furthermore, Optimization of the multicast tree is required to improve the performance of overlay multicast. This optimization is well-known as NP-complete. If a node in the tree has limited out-degree, a user who wants to join the group has to find parent user who has already joined. In this paper, the users who want to join the group need to setup their level using delay test from source node. And then new users can find candidate parent nodes effectively using ACK-SEND approach and take proper position by comparing level. The closer node of the user to root node should be located in lower level. Also, even if a barrier is caused, fast recovery will be guaranteed using ACK-SEND approach. Through this, the newcomer node can fine their location in the multicast tree and join the group fast and effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.17-26
• /
• 2005

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects attached with electronic tags by using radio wave. For the implementation of an RFID system, an anti-collision algorithm is required to identify several tags within the RFID reader's range. Few researches report the performance trade-off among anti-collision algorithms in terms of the communications traffic between the reader and tags, the identification speed, and so on. In this paper, we analyze both tree based memoryless algorithms and slot aloha based algorithms that comprise of almost every class of existing anti-collision algorithms. To compare the performance, we evaluated each class of anti-collision algorithms with respect to low-cost RFID system with 96-bit EPC(Electronic Product Code). The results show that the collision tracking tree algorithm outperforms current tree based and aloha based algorithms by at least 2 times to 50 times.

• Journal of Life Science
• /
• v.25 no.9
• /
• pp.970-975
• /
• 2015

The goals of this study were to identify sequence variations in the mitochondrial cytochrome b (mtDNA cyt b) gene in White Hanwoo (Wh) and the genetic relationship between the Wh and other breeds. When whole sequences of the mtDNA cyt b gene in 14 Wh cattle were determined, a silent mutation and two haplotypes were detected in the Wh cattle. The major haplotype, H1, was found in 13 of 14 individuals in the Wh cattle. Haplotype diversity and nucleotide diversity were 0.143 and 0.00013, respectively. Compared to previous reports, these levels of genetic diversity are lower than other Korean and Chinese breeds. To identify the genetic relationship among Korean, Chinese, Japanese, and European cattle breeds, the neighbor-joining (NJ) tree was constructed based on Dxy genetic distances. Two distinct groups were identified and classified as A and B. Wh was found in the A group, which consisted of Bos taurus breeds. From calculating the Dxy genetic distances, Wh was found to be genetically more closely related to two breeds, Heugu (0.00018) and Yanbian (0.00021), than to other breeds. In conclusion, Wh is genetically related to Chikso, Heugu, and Yanbian breeds based on maternal inheritance. The results of this study will be useful for efficient management and sustainable utilization of Wh.

• Journal of agriculture & life science
• /
• v.45 no.4
• /
• pp.65-72
• /
• 2011

The objective of this research is to develop biomass allometric equation for Pinus densiflora in central region and Quercus variabilis. To develop the biomass allometric equation by species and tree component, data for Pinus densiflora in central region is collected to 30 plots (70 trees) and for Quercus variabilis is collected to 15 plots (32 trees). This study is used two independent values; (1) one based on diameter beast height, (2) the other, diameter beast height and height. And the equation forms were divided into exponential, logarithmic, and quadratic functions. The validation of biomass allometric equations were fitness index, standard error of estimate, and bias. From these methods, the most appropriate equations in estimating total tree biomass for each species are as follows: $W=aD^b$, $W=aD^bH^c$; fitness index were 0.937, 0.943 for Pinus densiflora in central region stands, and $W=a+bD+cD^2$, $W=aD^bH^c$; fitness index were 0.865, 0.874 for Quercus variabilis stands. in addition, the best performance of biomass allometric equation for Pinus densiflora in central region is $W=aD^b$, and Quercus variabilis is $W=a+bD+cD^2$. The results of this study could be useful to overcome the disadvantage of existing the biomass allometric equation and calculate reliable carbon stocks for Pinus densiflora in central region and Quercus variabilis in Korea.

• Korean Journal of Veterinary Service
• /
• v.39 no.1
• /
• pp.1-6
• /
• 2016

In this study, Bacillus licheniformis which has been used as probiotics was isolated from Korean traditional fermented soybean. A total of 69 strains were presumptively identified as B. licheniformis by phenotypic methods. Based on PCR amplification and 16S rRNA gene sequencing, the multilocus sequence typing of gyrA and rpoB, followed by phylogenetic analysis was performed. The isolates were distinctly differentiated and found to be closely related to B. amyloliquefaciens, B. subtilis, and B. aerius. The partial 16S rRNA gene sequences of those strains matched those of B. sonorensis (97%) and B. aerius (98%) in the phylogenetic tree. In contrast, multilocus phylogenetic analysis (MLPA) showed that only 61 (86.9%) out of 69 strains were B. licheniformis. The rest of those strains were found to be B. subtilis (5.8%), B. amyloliquefaciens (2.9%), and B. sonorensis (2.9%), respectively. Therefore, our results suggested that since the 16S rRNA gene sequencing alone was not sufficient to compare and discriminate closely related lineages of Bacillus spp., it was required to analyze the MLPA simultaneously to avoid any misleading phenotype-based grouping of these closely related species.

• Journal of the Korean Applied Science and Technology
• /
• v.38 no.6
• /
• pp.1735-1752
• /
• 2021

In this study, the Bodhi tree powder is used as an additive to Seolgi rice cake and the research is made how useful the additives are to the Seolgi rice cake. This research would be a good way to develop and distribute the Seolgi rice cake which is added with the powder of Bodhi tree. The results of the study are as follows. 1. The water contents of Bodhi tree was 81.64% with 1.75% of crude protein, 0.81% of crude fat, and 0.56% of crude ash. It was found out that the Bodhi tree has higher contents of polypherol and has the efficacy of anti-oxidation property and has the value as the food stuff. 2. When the Seolgi rice cake is made with the addition of Bodhi tree powder, the value of a and b, sugar, hardness, elasticity, texture and viscosity have risen while the contents of water, L value, pH, stickiness and cohesiveness were lowered. The property test showed that the addition of Bodhi tree to Seolgi rick cake would make all testing items "strong" and the addition of 4% of Bodhi tree in the manufacturing of Seolgi rice cake was most preferred. 3. As for the storage of Seolgi rice cake is concerned, as the period of storage goes by, the value a and b, hardness, elasticity and texture and viscosity have increased while the water contents, L value, stickiness and cohesiveness have reduced. As the period of storage gets longer, the total cell number has increased. But as the more volume of Bodhi tree is added to the rice cake, the total cell number has reduced, thus lengthening the storage period. The rest shows that in producing the Seolgi rice cake, the 4% of addition of Bodhi rice cake is deemed to be the best. It was confirmed that the proper volume of Bodhi powder is proper for the Seolgi rice cake and is also good for decorative and quality characteristics for the rice cake.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.253-261
• /
• 2005

In this paper, we propose an efficient block-based disparity estimation algorithm fur multiple view image coding in EE2 and EE3 in 3DAV. The proposed method emphasizes on visual quality improvement to satisfy the requirements for multiple view generation. Therefore, we perform an adaptive disparity estimation that constructs variable blocks by considering given image features. Examining neighboring features around desired block search range is set up to decrease complexity and additional information than only using quad-tree coding through applying binary-tree and quad-tree coding by taking into account stereo image feature having big disparity. The experimental results show that the proposed method improves PSNR about 1 to 2dB compared to existing other methods and decreases computational complexity up to maximum 68 percentages than FBMA.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.35 no.1
• /
• pp.1-8
• /
• 2011

An analytical study on the flow resistance of tree-shaped channel-flow architectures was carried out based on the principle of the constructal law; the evolutionary increase in the access to currents that flow through the channels with improvements in the flow configurations were studied in a square domain using two diameters. Two types of tree-shaped configurations were optimized. The minimized global flow resistance decreased steadily as the system size $N^2$ increased. From the two channel configurations, the one that resulted in better pressure drop was selected. Further, it was shown that the system performance can be enhanced by adopting the second tree-shaped configurations when the system size is greater than $18^2$.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1529-1541
• /
• 2006

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.