• Journal of the Korean Wood Science and Technology
• /
• v.18 no.3
• /
• pp.26-33
• /
• 1990

To study the wood quality factors of Populus nigra $\times$ maxmowiczii known a rapidly growing species, the variations of green moisture contents, bulk density, wood fibre dimensions, microfibril angles, and number of leaf knot in stem wood were investigated. The heartwood contained a higher moisture content than the corresponding sapwood. Bulk density in radial patterns variations decrease outward from the pith, then increase toward the bark. The wood-fiber length and diameters had somewhat smaller values than on Populus alba $\times$ glandulosa or Populus euramericana. The microfibril angles decreased rapidly toward the outside, and their mean values were about 16 degree. The grain angles run nearly parallel to the cell axies. Number of leaf knot showed a fluctural change above ground level to a point near the base of the crown and then increased rapidly to the top of tree and average number of leaf knot varied exclusively from tree to tree.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.30-33
• /
• 2001

The number of hidden neurons of the feed-forward neural networks is generally decided on the basis of experience. The method usually results in the lack or redundancy of hidden neurons, and causes the shortage of capacity for storing information of learning overmuch. This research proposes a new method for optimizing the number of hidden neurons bases on information entropy, Firstly, an initial neural network with enough hidden neurons should be trained by a set of training samples. Second, the activation values of hidden neurons should be calculated by inputting the training samples that can be identified correctly by the trained neural network. Third, all kinds of partitions should be tried and its information gain should be calculated, and then a decision-tree correctly dividing the whole sample space can be constructed. Finally, the important and related hidden neurons that are included in the tree can be found by searching the whole tree, and other redundant hidden neurons can be deleted. Thus, the number of hidden neurons can be decided. In the case of building a neural network with the best number of hidden units for tea quality evaluation, the proposed method is applied. And the result shows that the method is effective

• Kyungpook Mathematical Journal
• /
• v.59 no.4
• /
• pp.797-820
• /
• 2019

For every tree T, we introduce a topological invariant, called the T-cross-index, for connected graphs. The T-cross-index of a graph is a non-negative integer or infinity according to whether T is a tree basis of the graph or not. It is shown how this cross-index is independent of the other topological invariants of connected graphs, such as the Euler characteristic, the crossing number and the genus.

• Journal of Korean Society for Quality Management
• /
• v.20 no.1
• /
• pp.118-125
• /
• 1992

Studies upto date for estimating the reliability by means of one accarate value contain risks of many erroneous options. The objective of this paper is to presents a fault tree analueis model on the basis of the membership functions of trape Zoidal fuzzy number after imposing an interval of Confidence on the residual possibility theory. The results from the model Show that the value of Stability was reliable.

• Journal of Korean Society of Forest Science
• /
• v.110 no.4
• /
• pp.601-609
• /
• 2021

The fructification characteristics, fruit quality, and yield of the 'Hwangsil' jujube tree were analyzed at various stages of growth age (3-8 years old) to obtain basic data for developing high-quality jujube production technology. The average height, crown area, stem diameter near the root, stem clear length, the number of the main branches, and the distance between any two main branches were 230.8 cm (224.4~247.2 cm), 3.0 m² (2.1~3.8m²), 4.8 cm (2.4~6.2 cm), 69.1 cm (46.6~78.0 cm), 12.9 (8.6~19.6), and 8.1 cm (7.4~9.0 cm), respectively. Tree age was positively correlated with the crown area, stem diameter near the root, but stem clear length negatively correlated with the number of main branches. The average number of fruits per mother bearing shoot and tree was 20.0 (14.3~26.3) and 302.8 (257.3~373.5), respectively. There was no correlation between tree age and fructification characteristics, such as the number of fruit-bearing mother shoots per the main branch, the number of fruit-bearing shoots per fruit-bearing mother shoot, and the number of fruits per fruit-bearing shoot. Since the shape of the jujube tree is constantly managed based onthe growing area and type of greenhouse where the tree grown. The average fruit weight, fruit hardness, and soluble solid content were 24.2 g (22.4~26.8 g), 28.4 N (27.3~30.0 N), and 19.0% (17.1~19.8%), respectively, with no correlation between the tree age and fruit quality. The average yield was 7.4 kg per tree (5.7~9.1 kg), with significantly high quantities were produced in six and seven years old trees.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.753-768
• /
• 2003

In this paper, we propose a multi-dimensional index structure, tailed a VA(Vector Approximate)-tree that is constructed with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR(Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is a suitable index structure for large amount of multi-dimensional data.

• Journal of the Korean Wood Science and Technology
• /
• v.47 no.6
• /
• pp.700-708
• /
• 2019

To verify the possibility of using resistograph to estimate the age of big old living trees, we selected three Zelkova serrata and seven Pinus densiflora in Goesan. The mean diameters at breast height of Z. serrata and P. densiflora were 102 (92-116) cm and 80 (65-110) cm, respectively. The heights measured from the ground using a resistograph ranged at 1.2-4.3 m and 0.6-1.1 m for Z. serrata and P. Densiflora, respectively. The most appropriate needle speed to determine tree-ring boundaries for measuring ring width was 1500 r/min for both tree species. Alternatively, the suitable feed speeds for Z. serrata and P. densiflora were 50 cm/min and 150 cm/min, respectively. From the measured data, the mean numbers of tree rings of Z. serrata and P. densiflora were 57 (43-68) and 104 (93-124), respectively, and the mean tree-ring widths were 4.27 mm (3.18-5.09 mm) and 2.93 mm (2.32-3.34 mm), respectively. A comparison between the time series of tree-ring widths by resistograph and that from the local master chronologies tallied for the heartwood part. Finally, this study showed that resistograph can be used to estimate tree ages when a local master chronology is available.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.17-22
• /
• 2022

With the spread of web services, data types are becoming more diversified. In addition to the form of storing data such as images, videos, and texts, the number and form of properties and metadata expressing the data are different for each data. In order to efficiently process such unstructured data, a key-value store is widely used for state-of-the-art applications. LSM-Tree (Log Structured Merge Tree) is the core data structure of various commercial key-value stores. LSM-Tree is optimized to provide high performance for small writes by recording all write and delete operations in a log manner. However, there is a problem in that the delay time and processing speed of user requests are lowered as batches of deletion operations for expired data are inserted into the LSM-Tree as special key-value data. This paper presents a Filtered LSM-Tree (FLSM-Tree) that solves the above problem by separating the deleted key from the main tree structure while maintaining all the advantages of the existing LSM-Tree. The proposed method is implemented in LevelDB, a commercial key-value store and it shows that the read performance is improved by up to 47% in performance evaluation.

• Journal of Power Electronics
• /
• v.8 no.1
• /
• pp.101-107
• /
• 2008

In this paper, the features extracted from vibration time signals are used to detect the bearing fault condition. The decision tree is applied to diagnose the bearing status, which has the benefits of being an expert system that is based on knowledge history and is simple to understand. This paper also suggests a genetic algorithm (GA) as a method to reduce the number of features. In order to show the potentials of this method in both aspects of accuracy and simplicity, the reduced-feature decision tree is compared with the non reduced-feature decision tree and the PCA-based decision tree.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.267-276
• /
• 2004

Much of previous attention on researches of the decision tree focuses on the splitting criteria and optimization of tree size. Nowadays the quantity of the data increase and relation of variables becomes very complex. And hence, this comes to have plenty number of unnecessary node and leaf. Consequently the confidence of the explanation and forecasting of the decision tree falls off. In this research report, we propose some decision tree algorithms considering the interaction of predictor variables. A generic algorithm, the k-1 Algorithm, dealing with the interaction with a combination of all predictor variable is presented. And then, the extended version k-k Algorithm which considers with the interaction every k-depth with a combination of some predictor variables. Also, we present an improved algorithm by introducing control parameter to the algorithms. The algorithms are tested by real field credit card data, census data, bank data, etc.