• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.150-154
• /
• 2024

In recent years, there are extensive researches on the applications of machine learning to the automation and decision support for medical experts during disease detection. However, the performance of machine learning still needs improvement so that machine learning model produces result that is more accurate and reliable for disease detection. Selecting the hyper-parameter that could produce the possible maximum classification accuracy on medical dataset is the most challenging task in developing decision support systems with machine learning algorithms for medical dataset classification. Moreover, selecting the features that best characterizes a disease is another challenge in developing machine-learning model with better classification accuracy. In this study, we have proposed an optimized decision tree model for heart disease classification by using heart disease dataset collected from kaggle data repository. The proposed model is evaluated and experimental test reveals that the performance of decision tree improves when an optimal number of features are used for training. Overall, the accuracy of the proposed decision tree model is 98.2% for heart disease classification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.911-919
• /
• 2004

IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.421-429
• /
• 2006

In this paper, we suggest a new capability aware spanning tree(CAST) algorithm for Ethernet bridged network which consists of both legacy Ethernet bridges and synchronous Ethernet ones. The legacy spanning tree algorithm specified in IEEE 802.1D standard select root bridge and construct tree based on each bridge's identifier without consideration of each bridge's capability. Thus we note that if the legacy STP may assign a synchronous bridge as a root bridge, the bridge may become a bottleneck for asynchronous trafficbecause of bandwidth limitation for asynchronous traffic. In this paper, the CAST algorithm constructsmultiple spanning tree by using of bridge capability and makes different transmission path for each traffics, can removes this kind of defect. From the simulation results, we can see that the proposed CAST algorithm has better end-to-end delay performance than legacy spanning tree algorithm in high traffic load and multiple hops environment.

• Korean Journal of Plant Resources
• /
• v.2 no.2
• /
• pp.306-311
• /
• 1989

This study was carried out to investigates the growth characteristics of chinese quince (chaenomels sinensi KOEHNE) in the southernarea of Korea.The results obtained were summarized as folLows .Leaf deveLoping time ofchaenomels sinensi KOEHNE was in the lastof March .BlOoming time of chaenomels sinensis KOEHNE was in the middle ofApri1.Chinese quince B line matures on October 20, 9 days earlier thannon -grafted .Grafted chinese quince tree showed earlier fruiting than non-grufted chinese quince tree.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.747-761
• /
• 2017

We study multiplication operators on the weighted Banach spaces of an infinite tree. We characterize the bounded and the compact operators, as well as determine the operator norm. In addition, we determine the spectrum of the bounded multiplication operators and characterize the isometries. Finally, we study the multiplication operators between the weighted Banach spaces and the Lipschitz space by characterizing the bounded and the compact operators, determining estimates on the operator norm, and showing there are no isometries.

• Korean Journal of Ichthyology
• /
• v.21 no.4
• /
• pp.291-298
• /
• 2009

A molecular phylogenetic relationship inferred from mitochondrial cytochrome b gene sequence was developed based on analysis of Zacco species distributed in Korea as well as China, Japan and Taiwan. A maximum parsimony (MP) tree showed that Korean Z. temminckii and Z. koreanus formed a monophyletic clade, but the populations of Z. temminckii and Z. koreanus in the 'South Korean Subdistrict' region had genetic similarity with Japanese Z. temminckii. Korean Z. platypus had a closer relationship with Japanese members of the clade than with Chinese Z. platypus, which was more closely related to Opsariichthys uncirostris amurensis. The analysis of neighbor joining (NJ) tree may support a hypothesis that the clade of Z. platypus had genetically diverged from the common ancestor of Zacco species comprising Z. koreanus, Z. temminckii, Z. sieboldii and other species; thereafter a cladogenesis of Z. koreanus and Z. temmminckii had occurred from the ancestor of Z. sieboldii. Moreover, the Chinese Z. platypus had diverged far from the Korean Z. platypus and formed a phylogenetic relationship with O. uncirostris amurensis. Therefore, a more detailed study of the taxonomy and systematics of Zacco species in regard to their zoogeographical distributions is needed.

• Journal of Plant Biology
• /
• v.9 no.1_2
• /
• pp.7-16
• /
• 1966

In order to determine the factors related to site quality, 13 areas of Larch growing in the Kwangung and its vicinity forest as sample plots, were examined. Sample plots included various site classes as well as age classes. Three were divided into two groups (major and minor trees). Average height of dominant trees was determined through messurement of 5 to 6 dominant tree in each sample plots. Average height of dominant 30 year-old trees was the basis for site index. A Standard Yield Table for the larch produced in Kwangnung forest was made by various data, which included age class 5, ranging from 10 to 45 years. The relationship of the height of the trees, the site conditions, and ground vegetation are investigated in this paper. The site indexes of 40 forest class age in 28-B and 28-G forest classes of the larch associations for ground vegetation had comparatively rarge differences due to the sampled areas. The relation of the direction of forest communities to the height and the diameter of the tree shwoed that its communiteis of northest and northwest parts appeared higher valueof the height and the diameter. The diameter and the height of trees were closely realted to each other. The samller the occupied area per tree and the smaller the average distance among trees, the more density was increased. The larger the density was the lower height of the trees. In the ground vegetation of the larch communities, there seems to be a definite correlation between the height of trees and the occupied area per tree or the average distance among the trees. The height of trees and site index of two larch communities were as follow: 28-B forest class site index 20.8, height 24.0m, 28-G forest class site index 18.4, height 20.9m. The ground layer was analyzed by the method of Quadrat(20/20sq. cm) with an interval of 1M. It set up 40 Quadrats of the larch communiteis. The community structure of the ground vegetation of two larch was analyzed, and important value was calculated and then evaluated. The ground vegetation under the larch had developed Burmannii Beauv stratal society below the 28-B and 28-G the forest class. Accordingly, the first important value of Burmannii Beauv was found in two ground vegetation below the larch. Therefore, this species could be quantitatively considered as the forest indicator species. Common species of each community appeared 18 species out of 34 species in the ground vegetation under two larch communities. The ground vegetation of the 28-B forest class showed more than that of the 28-G forest class. the similarity of the ground vegetation was measrued by the Frequency Index Community Coefficient. The differences between the associations were lcearly manifested by the ground vegetation tested by Gleason's Frequency Index of Community Coefficient for the analysis of each stratal society of all associations. According to F.I.C.C. the ground vegetation under two larch(28-B and 28-G) forest classes showed higher value. An investigation into the relationship of physical and chemical properties of soil and site was considered the next step to be taken in the study of the larch site classification.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.11
• /
• pp.62-71
• /
• 1996

In this paper we propose a method that improves PSNR at low bit rate and reduces computational complexity in fractal image coding based on discrete wavelet transform. The proposed method, which uses significant coefficient tree, improves PSNR of the reconstructed image and reduces computational comlexity of mapping domain block onto range block by matching only the significant coefficients of range block to coefficients of domain block. Also, the proposed method reduces error propagation form lower resolution subbands to higher resolution subbands by correcting error of lower resolution subbands. Some experimental results confirm that the proposed method reduces encoding and decoding time significantly and has fine reconstructed images having no blocking effect and clear edges at low bit rate.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.209-214
• /
• 1997

In this paper, we propose a new preorder tree method for binary images, named the Compact Complementary Quadtree (CCQ). In the proposed method we use type codes for representing nodes in the quadtree instead of using the symbols G, B, and W. From the experimental results, we have confirmed that the CCQ has a higher compression ratio than of the DF-expression. CCQ can be effectively applied to progressive transmission of binary images such as line drawings, geographical maps, and halftones.