• Title/Summary/Keyword: Design tree

Search Result 1,049, Processing Time 0.026 seconds

A Study on G-Condition Examination Scheme to Improve the Heuristics for Grade Of Services Steiner Minimum Tree Problem (Grade Of Services Steiner Minimum Tree 문제에 대한 휴리스틱의 성능 개선을 위한 G-Condition 검사 방법에 대한 연구)

  • Kim, In-Bum;Kim, Chae-Kak
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.44-52
    • /
    • 2008
  • This paper is on the enhancement of our heuristics for Grade Of Services Steiner Minimum Tree (GOSST) problem that can apply to the design of communication networks offering manifold grade of services in multimedia communication area. GOSST problem known as one of NP-Hard problems asks for a network topology meeting the G-Condition with minimum construction cost. In our prior researches, we proposed some heuristics for the problem. In this paper, we suggest a strategy of G-Condition scrutiny sequence to fortify our previous heuristics. In the experiment results, the ameliorated achieves 71.9% economy of execution times, 28.9% of required Steiner points and 1.1% of network construction costs.

  • PDF

Design and Implementation of Index for RFID Tag Objects (RFID 태그 객체를 위한 구간 색인 구조의 설계 및 구현)

  • Ban, Chae-Hoon;Hong, Bong-Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.143-146
    • /
    • 2008
  • For tracing tag locations, a trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry and we should extend the region of a query to find the tag that remains in a reader. In this paper, we propose an interval data model of tag's trajectory in order to solve the problem. For the interval data model. we propose a new index scheme called the IR-tree(Interval R-tree) and algorithms of insert and split for processing query efficiently. We also evaluate the performance of the proposed index scheme and compare it with the previous indexes.

  • PDF

Design of Heuristic Decision Tree (HDT) Using Human Knowledge (인간 지식을 이용한 경험적 의사결정트리의 설계)

  • Yoon, Tae-Tok;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.4
    • /
    • pp.525-531
    • /
    • 2009
  • Data mining is the process of extracting hidden patterns from collected data. At this time, for collected data which take important role as the basic information for prediction and recommendation, the process to discriminate incorrect data in order to enhance the performance of analysis result, is needed. The existing methods to discriminate unexpected data from collected data, mainly relies on methods which are based on statistics or simple distance between data. However, for these methods, the problematic point that even meaningful data could be excluded from analysis due that the environment and characteristic of the relevant data are not considered, exists. This study proposes a method to endow human heuristic knowledge with weight value through the comparison between collected data and human heuristic knowledge, and to use the value for creating a decision tree. The data discrimination by the method proposed is more credible as human knowledge is reflected in the created tree. The validity of the proposed method is verified through an experiment.

Study on the Prediction Model for Employment of University Graduates Using Machine Learning Classification (머신러닝 기법을 활용한 대졸 구직자 취업 예측모델에 관한 연구)

  • Lee, Dong Hun;Kim, Tae Hyung
    • The Journal of Information Systems
    • /
    • v.29 no.2
    • /
    • pp.287-306
    • /
    • 2020
  • Purpose Youth unemployment is a social problem that continues to emerge in Korea. In this study, we create a model that predicts the employment of college graduates using decision tree, random forest and artificial neural network among machine learning techniques and compare the performance between each model through prediction results. Design/methodology/approach In this study, the data processing was performed, including the acquisition of the college graduates' vocational path survey data first, then the selection of independent variables and setting up dependent variables. We use R to create decision tree, random forest, and artificial neural network models and predicted whether college graduates were employed through each model. And at the end, the performance of each model was compared and evaluated. Findings The results showed that the random forest model had the highest performance, and the artificial neural network model had a narrow difference in performance than the decision tree model. In the decision-making tree model, key nodes were selected as to whether they receive economic support from their families, major affiliates, the route of obtaining information for jobs at universities, the importance of working income when choosing jobs and the location of graduation universities. Identifying the importance of variables in the random forest model, whether they receive economic support from their families as important variables, majors, the route to obtaining job information, the degree of irritating feelings for a month, and the location of the graduating university were selected.

A Ternary Tree-based Authenticated Group Key Agreement For Dynamic Peer Group (동적 피어 그룹을 위한 삼진 트리방식의 인증된 그룹 키 합의 프로토콜)

  • Kim, Ho-Hee;Kim, Soon-Ja
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.6
    • /
    • pp.1253-1263
    • /
    • 2012
  • As a result of the increased popularity of group oriented applications, the design of an efficient authenticated group key agreement protocol has received a lot of attention. Lee et al. proposed a tree-based group key agreement protocol, which applies a ternary key tree structure and pairing-based cryptography to the key agreement of Dynamic Peer Group. In their protocol, only the group sponsor knows all member's session random keys computes all blinded keys. In addition, when the group sponsor leaves a group, all nodes of the tree should be changed. In this paper, we present the modified protocol that has several sponsors. Since a secret value for each member isn't given to the group sponsor, the key renewing of our protocol is more secure and efficient than that of Lee et al.'s protocol in the previous case. Therefore, our protocol is suitable to Dynamic Peer Groups.

A Study on Obtaining Tree Data from Green Spaces in Parks Using Unmanned Aerial Vehicle Images: Focusing on Mureung Park in Chuncheon

  • Lee, Do-Hyung;Kil, Sung-Ho;Lee, Su-Been
    • Journal of People, Plants, and Environment
    • /
    • v.24 no.4
    • /
    • pp.441-450
    • /
    • 2021
  • Background and objective: The purpose of study is to analyze the three-dimensional (3D) structure by creating a 3D model for green spaces in a park using unmanned aerial vehicle (UAV) images. Methods: After producing a digital surface model (DSM) and a digital terrain model (DTM) using UAV images taken in Mureung Park in Chuncheon-si, we generated a digital tree height model (DHM). In addition, we used the mean shift algorithm to test the classification accuracy, and obtain accurate tree height and volume measures through field survey. Results: Most of the tree species planted in Mureung Park were Pinus koraiensis, followed by Pinus densiflora, and Zelkova serrata, and most of the shrubs planted were Rhododendron yedoense, followed by Buxus microphylla, and Spiraea prunifolia. The average height of trees measured at the site was 7.8 m, and the average height estimated by the model was 7.5 m, showing a difference of about 0.3 m. As a result of the t-test, there was no significant difference between height values of the field survey data and the model. The estimated green coverage and volume of the study site using the UAV were 5,019 m2 and 14,897 m3, respectively, and the green coverage and volume measured through the field survey were 6,339 m2 and 17,167 m3. It was analyzed that the green coverage showed a difference of about 21% and the volume showed a difference of about 13%. Conclusion: The UAV equipped with RTK (Real-Time Kinematic) and GNSS (Global Navigation Satellite System) modules used in this study could collect information on tree height, green coverage, and volume with relatively high accuracy within a short period of time. This could serve as an alternative to overcome the limitations of time and cost in previous field surveys using remote sensing techniques.

A Study on the Improvement of Injection Molding Process Using CAE and Decision-tree (CAE와 Decision-tree를 이용한 사출성형 공정개선에 관한 연구)

  • Hwang, Soonhwan;Han, Seong-Ryeol;Lee, Hoojin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.4
    • /
    • pp.580-586
    • /
    • 2021
  • The CAT methodology is a numerical analysis technique using CAE. Recently, a methodology of applying artificial intelligence techniques to a simulation has been studied. A previous study compared the deformation results according to the injection molding process using a machine learning technique. Although MLP has excellent prediction performance, it lacks an explanation of the decision process and is like a black box. In this study, data was generated using Autodesk Moldflow 2018, an injection molding analysis software. Several Machine Learning Algorithms models were developed using RapidMiner version 9.5, a machine learning platform software, and the root mean square error was compared. The decision-tree showed better prediction performance than other machine learning techniques with the RMSE values. The classification criterion can be increased according to the Maximal Depth that determines the size of the Decision-tree, but the complexity also increases. The simulation showed that by selecting an intermediate value that satisfies the constraint based on the changed position, there was 7.7% improvement compared to the previous simulation.

Analysis of sustainable interior design elements (지속가능한 실내디자인 요소 분석)

  • Lee, Hyun-Chang;Nam, Kyung-Sook
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2007.11a
    • /
    • pp.169-172
    • /
    • 2007
  • Sustainable interior design elements are related with human health. We know that a demand for environmental-friendly housing and all about the others demanding are for human health. We have to make up basement of natural environment for sustainable space composition. If natural environment is polluted that surrounded by human, we have to effort to revive without any pollution. We have to get accomplished stability, comfortable, security, convenience and organize interior design elements for sustainable space to enhance for the quality of life. Furthermore, it needs to get a respect lifestyle on personal. To study composing of the sustainable interior design, we arranged interior design elements to compose sustainable space of housing. We investigated how to compose energy-efficiency, sustainable, interior tree-planting, alterable of the space.

  • PDF

Design of Omok AI using Genetic Algorithm and Game Trees and Their Parallel Processing on the GPU (유전 알고리즘과 게임 트리를 병합한 오목 인공지능 설계 및 GPU 기반 병렬 처리 기법)

  • Ahn, Il-Jun;Park, In-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.66-75
    • /
    • 2010
  • This paper proposes an efficient method for design and implementation of the artificial intelligence (AI) of 'omok' game on the GPU. The proposed AI is designed on a cooperative structure using min-max game tree and genetic algorithm. Since the evaluation function needs intensive computation but is independently performed on a lot of candidates in the solution space, it is computed on the GPU in a massive parallel way. The implementation on NVIDIA CUDA and the experimental results show that it outperforms significantly over the CPU, in which parallel game tree and genetic algorithm on the GPU runs more than 400 times and 300 times faster than on the CPU. In the proposed cooperative AI, selective search using genetic algorithm is performed subsequently after the full search using game tree to search the solution space more efficiently as well as to avoid the thread overflow. Experimental results show that the proposed algorithm enhances the AI significantly and makes it run within the time limit given by the game's rule.

Formative Aesthetic of Head Accessory Design in Korean Women (우리나라 여성의 머리 장신구 디자인에 대한 조형미)

  • Yang, Lee-Na;Choi, Na-Young
    • The Journal of Natural Sciences
    • /
    • v.9 no.1
    • /
    • pp.153-168
    • /
    • 1997
  • The purpose of this study was to investigate the formative aesthetic of head accessory design in korean women. Coming to Chosen, women from the court ir the nobility were Jukui, Wonsam, Whalot, Dangui and so on and as for the hair-form in this era, there were a long trees of hair for single and Unzonmeri(By making a tree with hair and raised up roundly) and Jjokmeri(Doing one's hair up in a chignon on the back of one's head) for married, as for a wig for ceremony they used Daeshu(As a same with today's wig added various head accessory design), Kunmeri(Putting a big hair made with a tree of Dukuji on Ayemeri) and Ayemeri(A big hair made with Darae on the head) and as for an head accessory design, there were Biye, Ddelgam and Chupji, which hadn't regularly developed untill the era Chosun. As is known, coming to the era of Chosun, the widely and generally used Biye and Duykokii fitted well to the most usual Jjokmeri.

  • PDF