• Journal of the Korean Society for information Management
• /
• v.23 no.2
• /
• pp.265-285
• /
• 2006

In text categorization a certain level of correctness of labels assigned to training documents is assumed without solid knowledge on that of real-world collections. Our research attempts to explore the quality of pre-assigned subject categories in a real-world collection, and to identify the relationship between the quality of category assignment in training set and text categorization performance. Particularly, we are interested in to what extent the performance can be improved by enhancing the quality (i.e., correctness) of category assignment in training documents. A collection of 1,150 abstracts in computer science is re-classified by an expert group, and divided into 907 training documents and 227 test documents (15 duplicates are removed). The performances of before and after re-classification groups, called Initial set and Recat-1/Recat-2 sets respectively, are compared using a kNN classifier. The average correctness of subject categories in the Initial set is 16%, and the categorization performance with the Initial set shows 17% in $F_1$ value. On the other hand, the Recat-1 set scores $F_1$ value of 61%, which is 3.6 times higher than that of the Initial set.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.181-187
• /
• 2020

In this paper, we proposed a register allocation algorithm and resource allocation algorithm in the high level synthesis process for the SoC design synthesis system of high performance vehicles We have analyzed to the operator characteristics and structure of datapath in the most important high-level synthesis. We also introduced the concept of virtual operator for the scheduling of multi-cycle operations. Thus, we demonstrated the complexity to implement a multi-cycle operation of the operator, regardless of the type of operation that can be applied for commonly use in the resources allocation algorithm. The algorithm assigns the functional operators so that the number of connecting signal lines which are repeatedly used between the operators would be minimum. This algorithm provides regional graphs with priority depending on connected structure when the registers are allocated. The registers with connecting structure are allocated to the maximum cluster which is generated by the minimum cluster partition algorithm. Also, it minimize the connecting structure by removing the duplicate inputs for the multiplexor in connecting structure and arranging the inputs for the multiplexor which is connected to the operators. In order to evaluate the scheduling performance of the described algorithm, we demonstrate the utility of the proposed algorithm by executing scheduling on the fifth digital wave filter, a standard bench mark model.

• Journal of Cadastre & Land InformatiX
• /
• v.49 no.1
• /
• pp.103-112
• /
• 2019

Extraction of region of interest for satellite image classification is one of the important techniques for efficient management of the national land space. However, recent studies on satellite image classification often depend on the information of the selected image in selecting the region of interest. This study propose an effective method of selecting the area of interest using the continuous digital topographic map constructed from high resolution images. The spatial information used in this research is based on the digital topographic map from 2013 to 2017 provided by the National Geographical Information Institute and the 2015 Sejong City land cover map provided by the Ministry of Environment. To verify the accuracy of the extracted area of interest, KOMPSAT-3A satellite images were used which taken on October 28, 2018 and July 7, 2018. The baseline samples for 2015 were extracted using the unchanged area of the continuous digital topographic map for 2013-2015 and the land cover map for 2015, and also extracted the baseline samples in 2018 using the unchanged area of the continuous digital topographic map for 2015-2017 and the land cover map for 2015. The redundant areas that occurred when merging continuous digital topographic maps and land cover maps were removed to prevent confusion of data. Finally, the checkpoints are generated within the region of interest, and the accuracy of the region of interest extracted from the K3A satellite images and the error matrix in 2015 and 2018 is shown, and the accuracy is approximately 93% and 72%, respectively. The accuracy of the region of interest can be used as a region of interest, and the misclassified region can be used as a reference for change detection.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.5
• /
• pp.52-62
• /
• 2023

The objective of this study is to propose an automated algorithm for precise cutting length of slab rebar complying with regulations such as anchorage length, standard hooks, and lapping length. This algorithm aims to improve the traditional manual quantity take-off process typically outsourced by external contractors. By providing accurate rebar quantity data at BBS(Bar Bending Schedule) level from the bidding phase, uncertainty in quantity take-off can be eliminated and reliance on out-sourcing reduced. In addition, the algorithm allows for early determination of precise quantities, enabling construction firms to preapre competitive and optimized bids, leading to increased profit margins during contract negotiations. The proposed algorithm not only streamlines redundant tasks across various processes, including estimating, budgeting, and BBS generation but also offers flexibility in handling post-contract structural drawing changes. In particular, the proposed algorithm, when combined with BIM, can solve the technical problems of using BIM in the early phases of construction, and the algorithm's formulas and shape codes that built as REVIT-based family files, can help saving time and manpower.