• 한국공간정보시스템학회 논문지
• /
• 제8권1호
• /
• pp.107-118
• /
• 2006

본 논문에서는 GIS와 네트웍 알고리듬을 이용하여 통신관망의 설계를 최적화하였다. 구체적이고 계량적인 분석을 위해 신규로 조성되는 대규모의 도시개발지역을 대상으로 하여 기존의 설계방식에 의해 산출된 통신관망과 최적경로 알고리듬을 이용한 통신관망과의 건설비용을 비교하였다. 본 연구의 결과 GIS와 최적경로 알고리듬을 적용한 설계 결과가 기존의 설계방법에 비해 상당한 비용절감 효과가 있음을 보여준다. 연구 대상지역에서 기존설계에 의해 산출된 통신관로의 거리는 5,267m이며 최적경로를 적용한 결과는 4,807m로 460m(9.5%)의 차이를 보였다. 결과를 비용으로 산정했을 경우 약 19,469천원(8.7%)의 비용절감 효과를 보였다. 본 연구에서 제시된 최적화 기법은 기존 설계기법에 비해 통신관망의 공사비의 절감 이외에 설계과정의 표준화 및 자동화가 가능하므로 이를 이용한 자동설계 시스템 개발로 설계비용과 인력이동에 따른 설계업무 적응기간 단축과 인건비 절감이 가능하며, 또한 설계 결과에 대한 객관적 검증이 가능할 것으로 판단된다.

• 대한산업공학회지
• /
• 제41권1호
• /
• pp.25-33
• /
• 2015

From the viewpoint of applications to manufacturing, data mining is a useful method to find the meaningful knowledge or information about states of processes. But the data from manufacturing processes usually have two characteristics which are multicollinearity and imbalance distribution of data. Two characteristics are main causes which make bias to classification rules and select wrong variables as important variables. In the paper, we propose a new data mining procedure to solve the problem. First, to determine candidate variables, we propose the multiple hypothesis test. Second, to make unbiased classification rules, we propose the decision tree learning method with different weights for each category of quality variable. The experimental result with a real PDP (Plasma display panel) manufacturing data shows that the proposed procedure can make better information than other data mining procedures.

• 대한임베디드공학회논문지
• /
• 제8권5호
• /
• pp.285-293
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the Bit Pattern Prediction Algorithm(BPPA) for the efficient identification of the multiple tags. The BPPA is based on the tree algorithm using the time slot and identify the tag quickly and efficiently using accurate bit pattern prediction method. Through mathematical performance analysis, We proved that the BPPA is an O(n) algorithm by analyzing the worst-case time complexity and the BPPA's performance is improved compared to existing algorithms. Through MATLAB simulation experiments, we verified that the BPPA require the average 1.2 times query per one tag identification and the BPPA ensure stable performance regardless of the number of the tags.

• Nuclear Engineering and Technology
• /
• 제30권6호
• /
• pp.531-540
• /
• 1998

The DYLAM-3 code which overcomes the limitation of event tree/fault tree was applied to LOOP (Loss of Off-site Power) in the mid-loop operation employing HEPs (Human Error Probabilities) supplied by the ASEP (Accident Sequence Evaluation Program) and the SEPLOT (Systematic Evaluation Procedure for Low power/shutdown Operation Task) procedure in this study. Thus the time history of core uncovery frequency during the mid-loop operation was obtained. The sensitivity calculations in the operator's actions to prevent core uncovery under LOOP in the mid-loop operation were carried out. The analysis using the time dependent HEP was performed on the primary feed & bleed which has the most significant effect on core uncovery frequency. As the result, the increment of frequency is shown after 200 minutes duration of simulation conditions. This signifies the possibility of increment in risk after 200 minutes. The primary feed & bleed showed the greatest impact on core uncovery frequency and the recovery of the SCS (Shutdown Cooling System) showed the least impact. Therefore the efforts should be taken on the primary feed & bleed to reduce the core uncovery frequency in the mid-loop operation. And the capability of DYLAM-3 in applying to the time dependent concerns could be demonstrated.

• 한국콘텐츠학회논문지
• /
• 제7권8호
• /
• pp.13-20
• /
• 2007

의사결정나무는 대량의 데이터를 몇 개의 집단으로 분류하고, 미래상황을 예측하기 위해 자주 사용되는 분석기법 중의 하나이며, 각 노드에서 분할이 일어나면서 자라게 되고, 각 노드에 속하는 자료의 순수도가 효과적으로 증가하도록 진행된다. 또한 의사결정나무를 생성하는 과정에서 필요 이상의 가지(leaves)를 갖게 되면 노드의 분할을 정지하거나, 분류성능 향상에 큰 도움이 되지 못하는 가지를 잘라내게 된다. 이러한 가지치기의 결과로 의사결정나무의 형태가 변하게 되는데 이는 기존의 가지분할이 효율적이지 않았음을 의미하는 것이다. 본 연구에서는 가지치기의 교정뿐 아니라 새로운 분할과정을 혼합한 우수한 의사결정나무 추출 방법을 제안한다. 특히, 새로운 분할 노드의 선택에 있어 퍼지이론을 적용하여 분할의 효과성을 제고할 수 있는 방법을 제시하고자 한다.

• 대한한의학회지
• /
• 제33권4호
• /
• pp.1-8
• /
• 2012

Objectives: The purpose of this study was to specify major tongue diagnostic indicators and evaluate their significance in discriminating pattern identification subtypes in stroke patients. Methods: This study used a community based multi-center observational design. Participants (n=1,502) were stroke patients admitted to 11 oriental medical university hospitals between December 2006 and February 2010. To determine which tongue indicator affected each pattern identification, a decision tree analysis of the chi-square automatic interaction detector (CHAID) algorithm was performed. The chi-squared test was used as the criterion in splitting data with a p-value less than 0.05 for division, which is the main procedure for developing a decision tree. The minimum sample size for each node was specified as n =10, and branching was limited to two levels. Results: From the 9 tongue diagnostic indicators, 6 major tongue indicators (red tongue, pale tongue, yellow fur, white fur, thick fur, and teeth-marked tongue) were identified through the decision tree analysis. Furthermore, each pattern identification was composed of specific combinations of the 6 major tongue indicators. Conclusions: This study suggests that the 6 tongue indicators identified through the decision tree analysis can be used to discriminate pattern identification subtypes in stroke patients. However, it is still necessary to re-evaluate other pattern identification indicators to further the objectivity and reliability of traditional Korean medicine.

• 한국시뮬레이션학회논문지
• /
• 제19권4호
• /
• pp.11-19
• /
• 2010

ZigBee는 WPAN(Wireless Personal Area Networks)을 위해 IEEE 802.15.4 표준에 근거하여 저비용, 저전력 소모를 위해 만들어진 표준이다. ZigBee 표준에서 라우팅을 위해 AODV(Ad-hoc On-Demand Distance Vector)와 트리 라우팅(Tree Routing) 두 가지 방법이 제시되었다. 트리 라우팅은 IEEE 802.15.4 MAC 계층의 토폴로지 형성 과정 동안에 만들어진 부모-자식 관계에 근거하여 센서 노드로부터 싱크 노드(Sink node)로 데이터를 전송한다. 이 방법에서 새로운 노드가 네트워크에 가입하기 위해 RSSI(Received signal strength indicator) 신호가 가장 강한 노드를 부모 노드로 선택한다. 그러므로 트래픽 분산이 이루어지지 않아 일부 노드는 많은 트래픽 양을 전달하게 되고 에너지는 빠르게 고갈된다. 본 논문에서는 트래픽 분산을 위해 링크 품질과 트래픽 양 정보를 이용하는 새로운 메트릭(Metric)을 제시한다. 제안되는 방법은 RSSI 신호 세기를 사용하는 대신에 새롭게 제안된 메트릭을 사용하여 부모 노드를 선택하여 네트워크에 가입한다. TinyOS TOSSIM(TinyOS mote SIMulator) 환경에서 시험을 통하여 제안한 방법이 기존 트리 라우팅 방법에 비해 우수한 성능을 가짐을 알 수 있다.

• 한국CDE학회논문집
• /
• 제18권4호
• /
• pp.250-257
• /
• 2013

This paper introduces a failure analysis procedure that underpins real-time fault prognosis. In the previous study, we developed a systematic eventization procedure which makes it possible to reduce the original data size into a manageable one in the form of event logs and eventually to extract failure patterns efficiently from the reduced data. Failure patterns are then extracted in the form of event sequences by sequence-mining algorithms, (e.g. FP-Tree algorithm). Extracted patterns are stored in a failure pattern library, and eventually, we use the stored failure pattern information to predict potential failures. The two practical case studies (marine diesel engine and SIRIUS-II car engine) provide empirical support for the performance of the proposed failure analysis procedure. This procedure can be easily extended for wide application fields of failure analysis such as vehicle and machine diagnostics. Furthermore, it can be applied to human health monitoring & prognosis, so that human body signals could be efficiently analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권8호
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

• 한국CDE학회논문집
• /
• 제13권3호
• /
• pp.235-242
• /
• 2008

This paper proposes a method for improving the process plan quality by use of dimensional tolerances. Dimensioning and tolerancing plays a key role in manufacturing process plan because the final part must ensure conformance with the dimensions and tolerances in its drawing. As a first step for the improvement of process plan quality, two resultant tolerances in design and process plan should be compared each other, and so a tolerance chart is used for acquisition and comparison of the two tolerances. In addition to two kinds of design and manufacturing tolerances, operational sequences or paths for the resultant dimension and tolerance are additionally recognized for measuring the quality of process plan quantitatively. Rooted tree is applied to find the related paths for the manufacturing resultant tolerances. A quality coefficient is defined by the components of two tolerances and their relations, the paths related to manufacturing resultant tolerances and the difficulty of an operation. In order to improve the quality of manufacturing process plan, the paths that two kinds of tolerances are the same or different in the rooted tree are recognized respectively and a method for tolerance rearrangement is developed. A procedure for improving the quality is suggested by combining the coefficient and the tolerance rearrangement method. A case study is applied to illustrate the efficiency of improvement method.