• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.141-148
• /
• 1994

Both the neural network classifier utilizing multi-layer perceptron and the linear tree classifier composed of hierarchically structured linear discriminating functions can form arbitrarily complex decision boundaries in the feature space and have very similar decision making processes. In this paper, a new method for automatically choosing the number of neurons in the hidden layers and for initalzing the connection weights between the layres and its supporting theory are presented by mapping the sequential structure of the linear tree classifier to the parallel structure of the neural networks having one or two hidden layers. Experimental results on the real data obtained from the military ship images show that this method is effective, and that three exists no siginificant difference in the classification acuracy of both classifiers.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.401-408
• /
• 2004

The Bluetooth Scatternet based on tree structure has several merits such as small numb of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.

• Journal of Korea Multimedia Society
• /
• v.25 no.6
• /
• pp.783-792
• /
• 2022

Versatile Video Coding (VVC) is the latest video coding standard, which had been developed by the Joint Video Experts Team (JVET) of ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Picture Experts Group (MPEG) in 2020. Although VVC can provide powerful coding performance, it requires tremendous computational complexity to determine the optimal block structures during the encoding process. In this paper, we propose a fast ternary tree decision method using two neural networks with 7 nodes as input vector based on the multi-layer perceptron structure, names STH-NN and STV-NN. As a training result of neural network, the STH-NN and STV-NN achieved accuracies of 85% and 91%, respectively. Experimental results show that the proposed method reduces the encoding complexity up to 25% with unnoticeable coding loss compared to the VVC test model (VTM).

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.624-640
• /
• 2004

Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

• Proceedings of the Korean Statistical Society Conference
• /
• 2001.11a
• /
• pp.89-94
• /
• 2001

In this study we focus on variable selection in decision tree growing structure. Some of the splitting rules and variable selection algorithms are discussed. We propose a competitive variable selection method based on Kruskal-Wallis test, which is a nonparametric version of ANOVA F-test. Through a Monte Carlo study we note that CART has serious bias in variable selection towards categorical variables having many values, and also QUEST using F-test is not so powerful to select informative variables under heavy tailed distributions.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.5
• /
• pp.398-406
• /
• 1991

This paper presents a graphics accelerator for fast image generation. The accelarator has three major functional blocks: linear interpolator, multipliers and Edgee Painting Tree. Linear interpolator with coupled binary tree structure interpolates functional values of two end points. Two multipliers compute input values of interpolator in parallel. Mask pattern which removes out invalid data is generated by Edge Painting Tree. The proposed architecture in this paper is responsible for 64 pixels and can process about 5,900 10x10polygons per second.

• East Asian mathematical journal
• /
• v.21 no.2
• /
• pp.249-260
• /
• 2005

Experimentation using computer plays an important part in education and research in graph theory. The purpose of this paper is to develop the CAS techniques for the hands-on approach in graph theory specifically on the topic of constructing the spanning tree. This paper discusses the advantages of CAS as the software system for doing graph theory and introduces the software solutions integrating multimedia user interface developed by the author, which extend the functionality of the existing CAS-based graph theory software package.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.371-374
• /
• 2000

This paper proposes a 16-bit ${\times}$ 16-bit multiplier for 2 twos-complement binary numbers with tree-like structure and implements it on a FPGA. The space and time complexity analysis shows that the 16-bit Tree-like multiplier represents lower circuit complexity and computes more quickly than both Booth array multiplier md Modified array multiplier.