• Korean Journal of Microbiology
• /
• v.24 no.4
• /
• pp.400-405
• /
• 1986

We have constructed a phylogenetic tree for eleven species by comparing their tRNA sequences. The tree suggests that prokaryotes diverged very early before the emergence of animals. The fact that H. volcano, an archaebacterium, clusters with eukaryotes implied that eukaryotes did not diverge directly from thier common ancestor with eubacteria. The branching order of phage $T_{4}$ and phage $T_{5}$ indicates that they have diverged separately from thier hosts and they might have evolved independently. A correlation between nucleotide substitution in tRNAs and paleontological record was observed. We verified that our phylogenetic tree fits very well with traditional ones very well by imposing the molecular clock on the tree.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.77-82
• /
• 2018

Go is the most complex board game in which the computer can not search all possible moves using an exhaustive search to find the best one. Prior to AlphaGo, all powerful computer Go programs have used the Monte-Carlo Tree Search (MCTS) to overcome the difficulty in positional evaluation and the very large branching factor in a game tree. In this paper, we tried to find the best sequence of moves using an MCTS on a very small Go board. We found that a $2{\times}2$ Go game would be ended in a tie and the size of Komi should be 0 point; Meanwhile, in a $3{\times}3$ Go Black can always win the game and the size of Komi should be 9 points.

• East Asian mathematical journal
• /
• v.31 no.5
• /
• pp.695-706
• /
• 2015

Let ${\mathcal{H}}$ be an infinite dimensional complex Hilbert space, and let $B({\mathcal{H}})$ be the algebra of all bounded linear operators on ${\mathcal{H}}$. Recall that an operator $T{\in}B({\mathcal{H})$ has property B(n) if ${\mid}T^n{\mid}{\geq}{\mid}T{\mid}^n$, $n{\geq}2$, which generalizes the class A-operator. We characterize the property B(n) of weighted shifts $S_{\lambda}$ over (${\eta},\;{\kappa}$)-type directed trees which appeared in the study of subnormality of weighted shifts over directed trees recently. In addition, we discuss the property B(n) of weighted shifts $S_{\lambda}$ over (2, 1)-type directed trees with nonzero weights are being distinct with respect to $n{\geq}2$. And we give some properties of weighted shifts $S_{\lambda}$ over (2, 1)-type directed trees with property B(2).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.153-168
• /
• 1994

This paper is concerned with the development of tree-search algorithm for the exact solution to the vehicle problem (VRP), where set of vehicles of known capacity based at depot, have to be routed in order to supply customers with known requirements. When is required is to design routes, so that the total cost (i. e. total route length or time duration, ect.) is minimized. For obtianing the exact solution, the most important factors are the value of bound and branching strategy. Using the bound based on with bound ascent procedures from subgradient and state-space ascents, the incorporation of bounds into tree search algorithm to solve the problem is shown. Computational results of the corresponding algorithm show that VRPs with up to 40 customers can be solved optimally with this algorithm.

• Journal of Korea Game Society
• /
• v.17 no.3
• /
• pp.63-70
• /
• 2017

In AI research Go is regarded as the most challenging board game due to the positional evaluation difficulty and the huge branching factor. MCTS is an exciting breakthrough to overcome these problems. The idea behind AlphaGo was to estimate the winning rate of a given position and then to lead deeper search for finding the best promising move. In this paper, using non-strategic MCTS we verified the fact that most pro players regard the best first move as Tengen (Origin of heaven) in $9{\times}9$ Go is correct. We also compared the average winning rates of the most popular first moves.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• Journal of Forest and Environmental Science
• /
• v.31 no.3
• /
• pp.235-240
• /
• 2015

Zelkova serrata is an important hardwood species for the timber industry in Japan. Tree breeding programs for this species have mainly focused on growth characteristics such as stem diameter (D), tree height (TH), stem form, and branching. In order to fulfill timber industry needs, wood quality improvement should be included in the tree breeding program of this species. In the present study, growth characteristics, such as D and TH, and the stress-wave velocity (SWV), which is highly correlated with Young's modulus of wood, were measured for 20-year-old Z. serrata from eight half-sib families planted in a progeny test site with three different initial spacings. Significant differences in all the measured characteristics were found among the eight half-sib families. The variance components of the half-sib families for D, TH, and SWV were 27.2%, 47.3%, and 33.5%, respectively. These results indicate that all the measured characteristics of this species could be improved by tree breeding programs. In addition, only low correlation coefficients were obtained between the growth characteristics and SWV, indicating that extensive selection on SWV in tree breeding programs may not always lead to a reduction in yield volume.

• The Journal of Korean Medicine
• /
• v.33 no.4
• /
• pp.1-8
• /
• 2012

Objectives: The purpose of this study was to specify major tongue diagnostic indicators and evaluate their significance in discriminating pattern identification subtypes in stroke patients. Methods: This study used a community based multi-center observational design. Participants (n=1,502) were stroke patients admitted to 11 oriental medical university hospitals between December 2006 and February 2010. To determine which tongue indicator affected each pattern identification, a decision tree analysis of the chi-square automatic interaction detector (CHAID) algorithm was performed. The chi-squared test was used as the criterion in splitting data with a p-value less than 0.05 for division, which is the main procedure for developing a decision tree. The minimum sample size for each node was specified as n =10, and branching was limited to two levels. Results: From the 9 tongue diagnostic indicators, 6 major tongue indicators (red tongue, pale tongue, yellow fur, white fur, thick fur, and teeth-marked tongue) were identified through the decision tree analysis. Furthermore, each pattern identification was composed of specific combinations of the 6 major tongue indicators. Conclusions: This study suggests that the 6 tongue indicators identified through the decision tree analysis can be used to discriminate pattern identification subtypes in stroke patients. However, it is still necessary to re-evaluate other pattern identification indicators to further the objectivity and reliability of traditional Korean medicine.

• Korean Journal of Veterinary Research
• /
• v.6 no.1
• /
• pp.57-75
• /
• 1966

This study was conducted to observe the condition of the ramifications of the bronchus and pulmonary blood vascular system by injecting the vinylite into the bronchial tree and pulmonary blood vessels in 100 normal adult dogs. The results obtained were summarized as follows: 1. Lungs of dog were composed of the same pulmonary territories as in lungs of human. 2. Cardiac lobe corresponding to R.medio-bassalis of human lungs was well developed and situated as a independent cardiac lobe, in ventral side of right lung. 3. Bronchial tree were in the patterns of axial divergency and blood vascular systems were (in general) branched along the bronchial tree, arteries lying near the bronchial tree but veins apart from it. 4. Among the branching patterns of bronchus pulmonary artery and pulmonary vein in each lobe, the type presented most frequently were noted, which were designated basic type by the author. 5. Pulmonary blood vessels were not always branched in accordance with bronchial tree, diverged inmore complex patterns, especially in venous vascular system. 6. Ramus anterior (lobe apicalis) was always observed in all casting specimen. 7. There was a case of peculiar variation patterns of the ramification in the bronchi directing into the left apical and cardiac lobe, arose respectivelly, at independent origin of bifurcation in the left bronchial stem, and a case of peculiar variation pattern of the artery entering left apical lobe and cardiac lobe, had a same origin of the bifurcation at rami pulmonary artery, and then divided respectivelly into the rami medi artery and rami left apical lobe artery. 8. In the classification based on the patterns of bronchial and blood vasculor divergencys, there were a lot of significant combination cases in their patterns.

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

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.