• 공학교육연구
• /
• 제15권4호
• /
• pp.41-47
• /
• 2012

Data mining and knowledge discovery techniques have shown to be effective in finding hidden underlying rules inside large database in an automated fashion. On the other hand, analyzing, assessing, and applying students' survey data are very important in science and engineering education because of various reasons such as quality improvement, engineering design process, innovative education, etc. Among those surveys, analyzing the students' views on science-technology-society can be helpful to engineering education. Because, although most researches on the philosophy of science have shown that science is one of the most difficult concepts to define precisely, it is still important to have an eye on science, pseudo-science, and scientific misconducts. In this paper, we report the experimental results of applying decision tree induction algorithms for analyzing the questionnaire results of high school students' views on science-technology-society (HS-VOSTS). Empirical results on various settings of decision tree induction on HS-VOSTS results from one South Korean university students indicate that decision tree induction algorithms can be successfully and effectively applied to automated knowledge discovery from students' survey data.

• 자연과학논문집
• /
• 제18권1호
• /
• pp.91-97
• /
• 2007

The Korean name "Bizooki" tree was named by the shape of winter bud which is like a slim bow. There are four scientific names in the tree which are Cleyera japonica Thunberg, Cleyera ochnacea DC, Sakakia ochnacea Nakai, and Ternstroemia gymnanthera. And the English name are Japanese Ternstroemia and Japanese Cleyera. "Bizooki" tree has planted at Buddhist temples in Japan for the ritual. The best result of stem cutting in "Bizooki" tree, 100 percent of rooting, could be accomplished in July when cuttings were done on the mixture-soil containing the same rates by volume of vermiculite, peatmoss and perlite with cuts processed with IBA 1,000 mg/l under the circumstances that 70% of shade, plastic mulching, and mist were conditioned.

• 한국염색가공학회지
• /
• 제21권2호
• /
• pp.29-39
• /
• 2009

The color mixture, obtained from Indigo and Japanese pagoda tree, was applied to cellulose fibers such as cotton, linen and rayon to diversify color gamut of natural dyes. The color mixture was tried with two different methods. The first process was that cellulose fibers were dyed with $5{\sim}25%$ owf Japanese pagoda tree solution, and then dyed 1 to 4 times with Indigo. The second process was dyeing 1 to 7 times with Indigo, followed by dyeing with $5{\sim}25%$ owf Japanese pagoda tree solution. K/S value of the dyed fibers with one colorant and color mixture increased in the order of linen, cotton, rayon. It was also found that the first process could give higher K/S values than the second process.

• 한국콘텐츠학회논문지
• /
• 제11권10호
• /
• pp.49-58
• /
• 2011

결함 트리 분석(Fault Tree Analysis)은 결함 트리를 구축하여 시스템의 안전성 분석을 수행한다. 그러나 결함 트리를 구성하는 작업은 대상 시스템의 도메인에 대한 지식과 경험을 필요로 하며 많은 시간과 노력을 소요한다. 이 논문에서는 시스템 설계 산출물인 상태 전이 모델을 기반으로 결함 트리를 체계적으로 구성하는 방법을 제안한다. 이를 위해 시스템 상태 전이 모델의 안정성 확보에 필요한 조건들을 식별하고 결함 트리를 구성할 수 있는 템플리트를 개발한다. 이 논문에서는 제안된 방법을 철도 건널목 제어 시스템에 적용한 결과도 기술한다.

• 한국컴퓨터산업학회논문지
• /
• 제10권3호
• /
• pp.79-86
• /
• 2009

본 논문은 센서 네트워크를 구성하는 센서노드와 베이스 스테이션들을 제한 길이 간선 최소 신장 트리를 이용하여 신속하고 효과적으로 연결하는 방법을 제안한다. 이 방법은 센서 네트워크에서 라우팅 등에 활용될 수 있는 연결 트리를 신속하게 구축한다. 2000개 입력 노드 대상의 실험에서, 제안된 방법은 단순 최소 신장 트리 방법과 비교하여 네트워크 길이의 증가 없이 네트워크 구축 시간을 94.7% 단축하였다. 이것은 제안된 방법이 센서 네트워크를 신속히 구축해야 하는 응용 등에 잘 적용될 수 있음을 보인다.

• 융합신호처리학회논문지
• /
• 제3권2호
• /
• pp.89-95
• /
• 2002

글로벌 라우팅(global routing)은 VLSI 설계 과정중의 하나로, 네트리스트의 모든 네트들을 연결하기 위하여 각 네트들을 라우팅 영역(routing area)에 할당시키는 문제이며, 글로벌 라우팅에서 최적의 해를 얻기 위해 maze routing 알고리즘, line-probe 알고리즘, shortest path 기반 알고리즘, Steiner tree 기반 알고리즘등이 이용된다. 본 논문에서는 라우팅 그래프에서 최단 경로 Steiner tree 탐색방법인 weighted network heuristic(WNH)과 이를 기반으로 하는 글로벌 라우팅 유전자 알고리즘(genetic algorithm; GA)을 제안하였으며, 제안한 방식을 시뮬레이티드 어닐링(SA) 방식과 비교, 분석하였다.

• 한국환경과학회지
• /
• 제32권1호
• /
• pp.11-24
• /
• 2023

This study aimed to provide preliminary data for the improvement of the tree doctor qualification test (first written test), which was newly created by enforcing the Forest Protection Act on June 28, 2018., The high demand for system improvement accelerated this study. The results were analyzeds through literature and questionnaire surveys. Writing test questions and the license of the tree doctor qualification exam are currently managed by the Korea Forestry Research Institute, and it is deemed that the test should be entrusted to Human Resources Development Service of Korea for fair and transparent management. Additionally, the plan for the improvement of the subject-wise scope of examination questions writing, difficulty of test questions, and acceptance rate of the first test should be prepared after public hearings or seminars related to the examination questions.

• 경영과학
• /
• 제11권3호
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• 융합신호처리학회논문지
• /
• 제11권3호
• /
• pp.250-254
• /
• 2010

As the number of input and fuzzy set of a fuzzy system increase, the size of the rule base increases exponentially and becomes unmanageable (curse of dimensionality). In this paper, tree architectures of fuzzy controller (TAFC) is proposed to overcome the curse of dimensionality problem occurring in the design of fuzzy controller. TAFC is constructed with the aid of AND and OR fuzzy neurons. TAFC can guarantee reduced size of rule base with reasonable performance. For the development of TAFC, genetic algorithm constructs the binary tree structure by optimally selecting the nodes and leaves, and then random signal-based learning further refines the binary connections (two-step optimization). An inverted pendulum system is considered to verify the effectiveness of the proposed method by simulation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.208-212
• /
• 1998

This paper suggests the method to recognize the various defect patterns of cold mill strip using binary decision tree constructed by genetic algorithm automatically. In case of classifying the complex the complex patterns with high similarity like the defect patterns of cold mill strip, the selection of the optimal feature set and the structure of recognizer is important for high recognition rate. In this paper genetic algorithm is used to select a subset of the suitable features at each node in binary decision tree. The feature subset of maximum fitness is chosen and the patterns are classified into two classes by linear decision function. After this process is repeated at each node until all the patterns are classified respectively into individual classes. In this way , binary decision tree classifier is constructed automatically. After construction binary decision tree, the final recognizer is accomplished by the learning process of neural network using a set of standard p tterns at each node. In this paper, binary decision tree classifier is applied to recognition of the defect patterns of cold mill strip and the experimental results are given to show the usefulness of the proposed scheme.