• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.8-16
• /
• 2022

In this paper, we propose a method of reconstructing the file system to obtain digital forensics information from the APFS file system when meta information that can know the structure of the file system is deleted due to partial damage to the disk. This method is to reconstruct the tree structure of the file system by only retrieving the B-tree node where file/directory information is stored. This method is not a method of constructing nodes based on structural information such as Container Superblock (NXSB) and Volume Checkpoint Superblock (APSB), and B-tree root and leaf node information. The entire disk cluster is traversed to find scattered B-tree leaf nodes and to gather all the information in the file system to build information. It is a method of reconstructing a tree structure of a file/directory based on refined essential data by removing duplicate data. We demonstrate that the proposed method is valid through the results of applying the proposed method by generating numbers of user files and directories.

• Journal of Korean Society of Forest Science
• /
• v.90 no.6
• /
• pp.756-766
• /
• 2001

A phytosociological study on the community structure was carried out in the evergreen broad-leaved forests around Baegunbong area in Wando from June to August, 2000. A total of 31 plots, the size of which was $10m{\times}30m$, were set up in the study area. Cluster analysis for the total 54 tree species appearing in the 31 plots, showed that forest community cloud be classified into 5 groups, such as : Quercus acuta community, Quercus acuta-Camellia japonica community, Quercus acuta-Deciduous broad-leaved tree species community, Quercus acuta-Evergreen Deciduous broad-leaved tree species community, Quereus acuta-Carpinus tschonoskii community. The species of high appearance frequency ratio in 31 plots were Quercus acuta, Camellia japonica, Styrax japonica, Eurya japonica, Ligustrum japonicum, Cinnamomum japonicum, Sapium japonicum and Acer psuedo-sieboldianum. Dominant tree species were covered with Quercus acuta, Styrax japonica, Prunus sargentii, Carpinus laxiflora and Quercus serrata, and Quercus acuta, Camellia japonica, Eurya japonica, Ligustrum japonicum, Cinnamomum japonicum and Sapium japonicum at sub-canopy. The forest vegetation in the surveyed area except the summit of Baegunbong will be proceeding with Quercus acuta community. The species diversity of Quercus acuta community, Quercus acuta-Camellia japonica community, Quercus acuta-Deciduous broad-leaved tree species community, Quercus acuta-Evergreen Deciduous broad-leaved tree species community, and Quercus acuta-Carpinus tschonoskii community were 0.687, 0.866, 0.933, 0.966, and 1.018, respectively. The species diversity of Quercus acuta community was rather low.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.149-156
• /
• 2010

As following the development of the USN technology, sensor node used in sensor network has capability of quick data process and storage to support efficient network configuration is enabled. In addition, tree-based structure was transformed to cluster in the construction of sensor network. However, query processing based on existing tree structure could be inefficient under the cluster-based network. In this paper, we suggest energy efficient query processing mechanism using filtering through data attribute classification in cluster-based sensor network. The suggestion mechanism use advantage of cluster-based network so reduce energy of query processing and designed more intelligent query dissemination. And, we prove excellence of energy efficient side with MATLab.

• Journal of Forest and Environmental Science
• /
• v.28 no.4
• /
• pp.199-204
• /
• 2012

This study was conducted to estimate climax index by eco-morphology for major 36 tree and sub-tree species in natural deciduous forests so as to interpret seral position of each species in the forest community. Fourteen eco-morphological characters which were considered to be associated with successional gradient in the forest were selected for the study. Four levels per character for each species were given on a standardized scale of increasing climax, and the index was computed by the proportion of the sum of total scores, expressed by percent values. With calculated mean value of 54.8 for all indices, Carpinus cordata had the highest index value of 90.5, and Populus davidiana recorded the lowest of 13.2. The most climax group, greater than 70 of the index, contained only 8 species, intermediate group, between 41 to 70 of the index, had 23 species, and the most pioneer group, less than 40 of the index comprised 5 species. The result has noticed that the large number of species would take advantage of most diverse resource and niche in the intermediate stage of the sere in the forest. By cluster analysis all 36 species were subjected to be classified into several species groups which had common similar eco-morphological characteristics. The indices were additionally plotted on the two dimensional graph to recognize the positions related to the light absorption factor and reproduction factor. The climax index of tree and sub-tree species developed by this study could be applied to understand the present status of successional stage on the basis of species composition by the method of summing up the indices. And comparison of forest successional stage among various forest communities could be done by summing up the climax indices of composed species in each community. However, this kind of applied methodology should be limited to the forest of similar species composition and site condition.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.4
• /
• pp.143-150
• /
• 1999

The purpose of this research is to find som ways to model tree forms more efficiently in reference with surveying structural data and handling parameters in plant Editor of AccuRender, the AutoCAD-based rendering software adopting the procedural plant modeling technique. In case of modelling a new tree, because it is efficient to modify an existing tree data as a template, we attempted to classify 81 species' data from existing plant library including conifers and deciduous tree. According to the qualitative characteristics and quantitative parameters of geometrical and branching structure, 8 types of tree form were classified with factor and cluster analysis. Some critical aspects found in the distributions of standardized scores of parameters in each type were discussed for explaining the tree forms intuitively. For adaptability of the resulted classification and typical parameters, 10 species of tree were measured and modelled, and proved to be very similar to the real structures of tree forms. CG or CAD-based plant modelling technique would be recommended not only as a presentation tool but for planting design, landscape simulation and assessment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.44-57
• /
• 1995

In this paper GFI (Generalized Fuzzy Isodata) and FI (Fuzzy Isodata) algorithms are studied and applied to the tire tread pattern classification problem. GFI algorithm which repeatedly grouping the partitioned cluster depending on the fuzzy partition matrix is general form of GI algorithm. In the constructing the binary tree using GFI algorithm cluster validity, namely, whether partitioned cluster is feasible or not is checked and construction of the binary tree is obtained by FDH clustering algorithm. These algorithms show the good performance in selecting the prototypes of each patterns and classifying patterns. Directions of edge in the preprocessed image of tire tread pattern are selected as features of pattern. These features are thought to have useful information which well represents the characteristics of patterns.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.846-856
• /
• 2016

Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing.

• Convergence Security Journal
• /
• v.11 no.6
• /
• pp.25-30
• /
• 2011

MANET has a weak construction in security more because it is consisted of only moving nodes and doesn't have central management system. The DDoS attack is a serious attack among these attacks which threaten wireless network. The DDoS attack has various object and trick and become intelligent. In this paper, we propose the technique to raise DDoS detection rate by classifying abnormal traffic pattern. Cluster head performs sentinel agent after nodes which compose MANET are made into cluster. The decision tree is applied to detect abnormal traffic pattern after the sentinel agent collects all traffics and it judges traffic pattern and detects attack also. We confirm high attack detection rate of proposed detection technique in this study through experimentation.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.959-969
• /
• 2009

Decision tree is a typical tool for data classification. This tool is implemented in DAVIS (Huh and Song, 2002). All the visualization tools and statistical clustering tools implemented in DAVIS can communicate with the decision tree. This paper presents methods to apply data visualization techniques to the decision tree using a real data set.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.150-155
• /
• 2003

Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is, the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. This paper proposes an algorithm that reduces the multicast routing costs using a clustering method. Multicast tree is constructed by minimum-cost Steiner tree. It is important to solve the mnimum-cost Steiner tree problem in the multicast routing problems. Hence, this paper proposes a genetic algorithm for multicast routing problems using clustering method.