• Journal of the military operations research society of Korea
• /
• v.28 no.2
• /
• pp.34-55
• /
• 2002

This paper deals with the multiple attribute decision making problem when a decision maker incompletely articulates his/her preferences about the attribute weight and alternative value. Furthermore, we consider the attribute tree which is structured hierarchically. Techniques for establishing dominance with linear partial information are proposed in a hierarchically structured attribute tree. The linear additive value function under certainty is used in the model. The incompletely specified information constructs a feasible region of linear constraints and therefore the pairwise dominance relationship between alternatives leads to intractable non-linear programming. Hence, we propose solution techniques to handle this difficulty. Also, to handle the tree structure, we break down the attribute tree into sub-trees. Due to there cursive structure of the solution technique, the optimization results from sub-trees can be utilized in computing the value interval on the topmost attribute. The value intervals computed by the proposed solution techniques can be used to establishing the pairwise dominance relation between alternatives. In this paper, pairwise dominance relation will be represented as strict dominance and weak dominance, which ware already defined in earlier researches.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.71-79
• /
• 2001

In Incremental attribute evaluation algorithm, a new input attribute is exact1y compared with a previous input attribute tree, and then determine which subtrees from the old should be used in constructing the new one. In this paper incremental attribute evaluation algorithm was used to make incremental evlauation of hierarchical attribute grammar more efficient1y, and reconstructing the incremental attribute evaluation algorithm by analyzing that of Carle and Pollock, finally the incremental attribute evaluation algorithm for optimalized attribute tree d' copy was constructed by applying element of attribute !ree dcopy to a new attribute tree d' copy. Also proving that how the reused nod and type of defined parameter in input program carried out the incremental attribute evaluation by using that algorithm.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.209-216
• /
• 2001

The effective way to apply incremental attribute grammar to a complex language process is the use of optimized algorithm. In optimized algorithm for incremental attribute grammar, the new input attribute tree should be exactly compared with the previous input attribute tree, in order to determine which subtrees from the old should be used in constructing the new one. In this paper the new optimized algorithm was reconstructed by analyzing the algorithm suggested by Carle and Pollock, and a generation process of new attribute tree d’copy was added. Through the performance evaluation for the suggested matching algorithm, the run time is approximately improved by 19.5%, compared to the result of existing algorithm.

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.271-282
• /
• 1999

In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.394-405
• /
• 2001

Since most real-world application data involve continuous-valued attributes, properly addressing the discretization process for constructing a decision tree is an important problem. A continuous-valued attribute is typically discretized during decision tree generation by partitioning its range into two intervals recursively. In this paper, by removing the restriction to the binary discretization, we present a hybrid multi-interval discretization algorithm for discretizing the range of continuous-valued attribute into multiple intervals. On the basis of experiment using semiconductor etching machine, it has been verified that our discretization algorithm constructs a more efficient incremental decision tree compared to previously proposed discretization algorithms.

• Current Research on Agriculture and Life Sciences
• /
• v.26
• /
• pp.45-54
• /
• 2008

The purpose of this research is to develope street trees management program for more an effective street trees management. The principal point of this program is to relate spatial data and attribute data that is the main concept in GIS(Geographic Information System). To do this function, MapObjects which is ESRI's mapping and GIS components was used to process spatial data and Access which had been developed by MS was used to manipulate attribute data in this program. Visual Basic also was used to design and develop user interfaces and procedures, relate two sort of data, and lastly complete Application. Relational data model was adopted to design tables and their relation, Antenucci's GIS development model was selected to design and complete this program. The configuration of this application is composed of management data and reference data. The management data includes the location of street tree, a growth condition, a surrounding environment, the characters of tree, an equipments, a management records and etc. The reference data include general information about tree, blight and insects.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.1
• /
• pp.55-65
• /
• 2020

With the development of display hardware, image interpolation techniques have been used in various fields such as image zooming and medical imaging. Traditional image interpolation methods, such as bi-linear interpolation, bi-cubic interpolation and edge direction-based interpolation, perform interpolation in the spatial domain. Recently, interpolation techniques in the discrete cosine transform or wavelet domain are also proposed. Using these various existing interpolation methods and machine learning, we propose decision tree classification-based image interpolation methods. In other words, this paper is about the method of adaptively applying various existing interpolation methods, not the interpolation method itself. To obtain the decision model, we used Weka's J48 library with the C4.5 decision tree algorithm. The proposed method first constructs attribute set and select classes that means interpolation methods for classification model. And after training, interpolation is performed using different interpolation methods according to attributes characteristics. Simulation results show that the proposed method yields reasonable performance.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.21 no.3
• /
• pp.89-98
• /
• 1993

It is necessary for the park tree manager to have the current information about the status of trees, which can help him with right decisions. However, there are many problems in the existing management method such as huge amount of data, tedious work, and the difficult update work due to the lack of necessary data or the inappropriate data record and management method. The sole use of database management system(DBMS) cannot slove these problems because it cannot handle graphic data based on the locational information. So, it is imperative for the park manager to have locational data as well as attribute data of the park tree concerned. Therefore, the purpose of this study is to develop the personal computer-based, user friendly park tree management information system, which deals with attribute data(DBMS) and graphic data(using the CAD) together within the integrated environment. The park tree management information system developed in this study provides a complete operating environment for data input, update, query, delete, and retrieve. The major advantages of this system are as follows: 1) To search the location and distribution of trees. 2) To record, store, and manage data easily. 3) When the manager is changed, delivery of the park tree work is convenient. 4) The system can help the manager with the correct information for the efficient park tree management.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.3
• /
• pp.358-363
• /
• 2014

In this paper, we present two constructions of the attribute-based broadcast encryption(ABBE) algorithm. Attribute-based encryption(ABE) algorithm enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. ABBE algorithm can be used to construct ABE algorithm with revocation mechanism. Revocation has a useful property that revocation can be done without affecting any non-revoked uers. The main difference between our algorithm and the classical ones derived from the complete subtree paradigm which is apt for military hierarchy. Our algorithm improve the efficiency from the previously best ABBE algorithm, in particular, our algorithm allows one to select or revoke users by sending ciphertext of constant size with respect to the number of attributes and by storing logarithm secret key size of the number of users. Therefore, our algorithm can be an option to applications where computation cost is a top priority and can be applied to military technologies in the near future.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.282-287
• /
• 2011

The attribute grammar is a grammar for static semantic rules to overcome the difficulties of type checking. But this attribute grammar is difficult to write and understand by its additional rules. A grammar would be preferable if it has simple and small size of an attribute grammar. This paper shows how to decrease the size of an attribute grammar for an expression using LH method. This approach considers the types of an expression. That is, the construction of a semantic relation between the types of the expression can make it possible that an attribute grammar be written with its simpler and smaller size.