• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.23 no.6
• /
• pp.125-135
• /
• 2020

The uncontrolled urban expansion causes various social, economic problems and natural/environmental problems. Therefore, it is necessary to forecast urban expansion by identifying various factors related to urban expansion. This study aims to forecast it using a decision tree that is widely used in various areas. The study used geographic data such as the area of use, geographical data like elevation and slope, the environmental conservation value assessment map, and population density data for 2006 and 2018. It extracted the new urban expansion areas by comparing the residential, industrial, and commercial zones of the zoning in 2006 and 2018 and derived a decision tree using the 2006 data as independent variables. It is intended to forecast urban expansion in 2030 by applying the data for 2018 to the derived decision tree. The analysis result confirmed that the distance from the green area, the elevation, the grade of the environmental conservation value assessment map, and the distance from the industrial area were important factors in forecasting the urban area expansion. The AUC of 0.95051 showed excellent explanatory power in the ROC analysis performed to verify the accuracy. However, the forecast of the urban area expansion for 2018 using the decision tree was 15,459.98㎢, which was significantly different from the actual urban area of 4,144.93㎢ for 2018. Since many regions use decision tree to forecast urban expansion, they can be useful for identifying which factors affect urban expansion, although they are not suitable for forecasting the expansion of urban region in detail. Identifying such important factors for urban expansion is expected to provide information that can be used in future land, urban, and environmental planning.

• Journal of Semiconductor Engineering
• /
• v.2 no.3
• /
• pp.136-141
• /
• 2021

This paper analyzes the tree expansion for multiple-input multiple-output (MIMO) detection in the viewpoint of hardware implementation. The tree expansion is to calculate path metrics of child nodes performed in every visit to a node while traversing the detection tree. Accordingly, the tree-expansion unit (TEU), which is responsible for such a task, has been an essential component in a MIMO detector. Despite the paramount importance, the analyses on the TEUs in the literature are not thorough enough. Accordingly, we further investigate the hardware complexity of the TEUs to suggest a guideline for selection. In this paper, we focus on a pair of major ways to implement the TEU: 1) a full parallel realization; 2) a transformation of the formulae followed by common subexpression elimination (CSE). For a logical comparison, the numbers of multipliers and adders are first enumerated. To evaluate them in a more practical manner, the TEUs are implemented in a 65-nm CMOS process, and their propagation delays, gate counts, and power consumptions were measured explicitly. Considering the target specification of a MIMO system and the implementation results comprehensively, one can choose which architecture to adopt in realizing a detector.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.57-68
• /
• 2004

We present a new parallel algorithm for extending the domain of a UOWHF. Our algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [8], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its prallelizability performance is less efficient than complete tree based constructions. However if l is getting larger then the parallelizability of the construction is also getting near to that of complete tree based constructions.tructions.

• Animal cells and systems
• /
• v.10 no.1
• /
• pp.27-40
• /
• 2006

Tree of heaven (Ailanthus altissima Swingle) as an invasive alien plant, appeared usually in the disturbed locations such as road-side, incised slope, and trampling path-side. They appeared abundantly in the trampling pathside but they did not appear or were rare in the interior of forest. Density and importance value of tree of heaven were proportionate to the relative light intensity measured according to distance from the trampling path toward forest interior and closely related to the breadth of trampling path as well. They were associated with annual, other exotic species or ruderal plants well. Distributional pattern of mature trees of them in the study area and its surrounding environments implied that they were introduced intentionally. Size class distribution of them showed that they are in expansion and artificial interferences such as, installing physical training space and developing hiking course functioned as trigger factors in their invasion and expansion. The results support the facts known generally in relation to invasion and expansion of the invasive alien plants. In this viewpoint, we suggest a management plan that applies ecological restoration principles to address ecosystems infected with tree of heaven by restoring the integral feature of the degraded nature and conserving the remained nature more thoroughly.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.125-137
• /
• 1994

Manufacturing environs constantly change, and any efficient software system to be used in manufacturing must be able to adapt to the varying situations. In a CAPP (Computer-Aided Process Planning) system, a learning capability is necessary for the CAPP system to do change along with the manufacturing system. Unfortunately only a few CAPP systems currently possess learning capabilities. This research aims at the development of a learning system which can increase the knowledge in a CAPP system. A part in the system is represented by frames and described interactively. The process information and process planning logic is represented using a decision tree. The knowledge expansion is carried out through an interactive expansion of the decision tree according to human advice. Algorithms for decision tree modification are developed. A path can be recommended for an unknown part of limited scope. The processes are selected according to the criterion such as minimum time or minimum cost. The decision tree, and the process planning and learning procedures are formally defined.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2596-2604
• /
• 1997

There are two kinds of backends in ACK:code generator(full-fledged backend) and code expander(fast backend). Code generators generate target code using string pattern matching and code expanders generate target code using macro expansion. ACK translates EM to SPARC code using code expander. The corresponding SPARC code sequences for a EM code are generated and then push-pop optimization is performed. But, there is the problem of maintaining hybrid stack. And code expander is not considered to passes parameters of a procedure call through register windows. The purpose of this paper is to improve SPARC code quality. We suggest a method of SPARC cod generation using EM tree. Our method is divided into two phases:EM tree building phase and code expansion phase. The EM tree building phase creates the EM tree and code expansion phase translates it into SPARC code. EM tree is designed to pass parameters of a procedure call through register windows. To remove hybrid stack, we extract an additional information from EM code. We improved many disadvantages that arise from code expander in ACK.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.381-386
• /
• 2003

In this paper, we consider the problem of embedding complete binary trees into 3-dimensional meshes. The method of embedding a complete binary tree into 3-dimensional mesh with the link congestion two is considered in [1], and the embedding in [2] shows that a complete binary tree can be embedded into a ,3-dimensional mesh of expansion 1.27. The proposed embedding in this paper shows that a complete binary tree can be embedded into a 3-dimensional mesh of expansion approximately 1.125 with the link congestion one, using the dimensional ordered routing. Such method yields some improved features in terms of minimizing the link congestion or the expansion of embedding comparing to the previous results.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.6
• /
• pp.113-120
• /
• 2024

With the advancement of information and communication technology, we can easily generate various forms of data in our daily lives. To efficiently manage such a large amount of data, systematic classification into categories is essential. For effective search and navigation, data is organized into a tree-like hierarchical structure known as a category tree, which is commonly seen in news websites and Wikipedia. As a result, various techniques have been proposed to classify large volumes of documents into the terminal nodes of category trees. However, document classification methods using category trees face a problem: as the height of the tree increases, the number of terminal nodes multiplies exponentially, which increases the probability of misclassification and ultimately leads to a reduction in classification accuracy. Therefore, in this paper, we propose a new node expansion-based classification algorithm that satisfies the classification accuracy required by the application, while enabling detailed categorization. The proposed method uses a greedy approach to prioritize the expansion of nodes with high classification accuracy, thereby maximizing the overall classification accuracy of the category tree. Experimental results on real data show that the proposed technique provides improved performance over naive methods.

• Korean Journal of Construction Engineering and Management
• /
• v.20 no.3
• /
• pp.64-76
• /
• 2019

Aged apartments lack parking space and are suffering from severe parking difficulties due to the increase in the supply of private cars due to the economic improvement. Efficient remodeling technology is required as a way to solve the problem of a shortage of parking spaces, but there is a lack of establishing a technology for remodeling plans that can reflect the characteristics of various parks. This study was conducted to analyze the functions of the parking lot expansion technology using the technology tree and to derive the final technology through the function deployment. As a result of functional deployment of the plan to expand the parking lot, the fifth function was deployed and a total of 22 technologies were derived. Four types of technologies are categorized, four technologies for underground expansion, 12 technologies for underground and ground expansion, two technologies for ground expansion, and four technologies for ground-based expansion. As a result of the functional deployment of the main entrance plan, the fifth function was deployed and derived with 22 technologies. The total technologies were grouped into four categories, four technologies for direct underground entry, 11 technologies for indirect underground entry, three technologies for direct access to ground, and four technologies for indirect entry to ground. Through case verification, the detailed technologies applied to the semi-industrial complex of remodeling were identified and expert surveys and interviews were conducted to verify the adequacy of the technology tree.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.73-83
• /
• 2017

In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.