• Title/Summary/Keyword: Priority Rules

Search Result 126, Processing Time 0.025 seconds

Construction of Knowledge Base for Fault Tracking Expert System in Semiconductor Production Line (반도체 생산 라인에서의 이탈 처리 추적 전문가 시스템의 지식베이스 구축)

  • 김형종;조대호;이칠기;김훈모;노용한
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.1
    • /
    • pp.54-61
    • /
    • 1999
  • Objective of the research is to put the vast and complex fault tracking knowledge of human experts in semiconductor production line into the knowledge base of computer system. We mined the fault tracking knowledge of domain experts(engineers of production line) for the construction of knowledge base of the expert system. Object oriented fact models which increase the extensibility and reusability have been built. The rules are designed to perform the fault diagnosis of the items in production device. We have exploited the evidence accumulation method to assign check priority in rules. The major contribution is in the overall design and implementation of the nile base and related facts of the expert system in object oriented paradigm for the application of the system in fault diagnosis in semiconductor production line.

  • PDF

Parallel Multiple Hashing for Packet Classification

  • Jung, Yeo-Jin;Kim, Hye-Ran;Lim, Hye-Sook
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.171-174
    • /
    • 2004
  • Packet classification is an essential architectural component in implementing the quality-of-service (QoS) in today's Internet which provides a best-effort service to ail of its applications. Multiple header fields of incoming packets are compared against a set of rules in packet classification, the highest priority rule among matched rules is selected, and the packet is treated according to the action of the rule. In this Paper, we proposed a new packet classification scheme based on parallel multiple hashing on tuple spaces. Simulation results using real classifiers show that the proposed scheme provides very good performance on the required number of memory accesses and the memory size compared with previous works.

  • PDF

A Study on Principles for Safe Driving of the Urban Railway Train (도시철도 열차의 안전 운전원칙에 관한 연구)

  • Jeon, Young-Seok;Ahn, Seung-Ho;Chung, Kwang-Woo;Kim, Jae-Moon;Kim, Chul-Su;Chung, Jong-Duk;Jeong, Rag-Gyo
    • Proceedings of the KSR Conference
    • /
    • 2009.05a
    • /
    • pp.628-635
    • /
    • 2009
  • To assure the safety of urban railway train, it is necessary to observe the specified driving principles under an essential condition during running on tracks. These principles arises from a great deal of experience for a long time and include safe distance between trains, the railway signaling, block system, regular block of the highest priority and driving prohibition of simple railway vehicle in the main track, etc. Therefore, it is important to apply these principles to domestic urban railway driving regulations and railway vehicle driving regulations. However, domestic urban railway administrator established his own operation rules within the regulation. In this study, domestic urban railway administration's own rules are examined and the appropriate driving regulation on the safe driving principles is proposed.

  • PDF

Rule Selection Method in Decision Tree Models (의사결정나무 모델에서의 중요 룰 선택기법)

  • Son, Jieun;Kim, Seoung Bum
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.4
    • /
    • pp.375-381
    • /
    • 2014
  • Data mining is a process of discovering useful patterns or information from large amount of data. Decision tree is one of the data mining algorithms that can be used for both classification and prediction and has been widely used for various applications because of its flexibility and interpretability. Decision trees for classification generally generate a number of rules that belong to one of the predefined category and some rules may belong to the same category. In this case, it is necessary to determine the significance of each rule so as to provide the priority of the rule with users. The purpose of this paper is to propose a rule selection method in classification tree models that accommodate the umber of observation, accuracy, and effectiveness in each rule. Our experiments demonstrate that the proposed method produce better performance compared to other existing rule selection methods.

A Comparative Analysis: Various Storage Rules in Container Yards and Their Performances

  • Ma, Yaowen;Kim, Kap-Hwan
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.3
    • /
    • pp.276-287
    • /
    • 2012
  • Determining storage locations of containers is an important issue for efficient operation of container terminals. This study assumes a storage yard with a horizontal layout in which blocks are laid out in parallel to the quay and trucks enter at the side of a block to deliver (receive) a container to (from) the yard crane. Various storage rules for determining storage locations of containers are introduced. Simulation studies are conducted for evaluating various rules. The following guidelines are derived from the result of our simulation study: when designing a block, consider a block configuration in which the longest gantry and the longest trolley travel times of rail-mounted gantry cranes (RMGCs) are similar; do not restrict the types of containers that can be stored in a storage area; if different roles are to be assigned to different storage areas, one possible way is to divide a bay into two areas so that some rows in the bay are allocated to inbound containers while the other rows in the same bay are allocated to outbound containers; reserve the space in bay unit for a high productivity of RMGCs but reserve the space in stack unit when the storage space is not enough; when the storage space is not sufficient, allocate storage location in a way of starting from the end and ending at the middle of a block; for reducing the travel distance of internal trucks, provide a higher priority to a block nearer to the berthing position of the corresponding vessel.

Collision Arbitration Rules for Best Effort Service in Wireless MAN: Design and Performance Analysis (무선 MAN에서 Best Effort 서비스를 위한 충돌 중재 방식: 설계 및 성능 분석)

  • Park, Jin-Kyung;Baang, Sung-Keun;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.78-87
    • /
    • 2009
  • In the IEEE 802.16 Wireless MAN standard, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision among the requests is unavoidable so that the standard adopted a binary exponential back-off rule to arbitrate a collision. Aiming at improving throughput performance, we present two generic collision arbitration rules based on p-persistence rule, (identified as pristine and metamorphosed rules), as alternatives in a wireless MAN. For each of these rules, we then develop an analytical method to calculate an approximate value of saturated throughput. In comparison with simulation results, we confirm the high accuracy of the analytical method. Also, the pristine and metamorphosed rules are observed to exhibit higher saturated throughput compared with the binary exponential back-off rule.

공정계획 전문가시스템의 개발-조선 블럭분할에의 응용

  • 박병태;이재원
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1993.04b
    • /
    • pp.370-374
    • /
    • 1993
  • This paper describes a study on the expert system based process planning of the block division process in shipbuilding. The prototype system developed deterines the block division line of the midship of crude-oil tanker. Case-based reasoning (CBR) approach relying on previous similar cases to solve the problem is applied instead of rule-based reasoning (RBR). Similar cases are retrieved from case base according to the similarity metrics between input problem and cases. The retrieved case with the highest priority is then adapted to fit to the input problem buy adaptation rules. The adapted solution is proposed as the division line for the input problem.

A Study on the Dispatching Rules of One-process Job Using Computer Simulation (시뮬레이션을 이용한 단공정작업의 스케줄링에 관한 연구)

  • 이기영;김영민
    • Journal of the Korea Safety Management & Science
    • /
    • v.2 no.2
    • /
    • pp.85-94
    • /
    • 2000
  • This paper deals with the selection of a proper dispatching rule for an one-process Job scheduling that follows a particular distribution of an order production. That is, it makes a distribution on an order per unit period and applies to simulation model that uses it. This study consists of two purposes either seeks adequately production scheduling using priority rule or seeks extension of the facilities that increase current production efficiency through computer simulation in scheduling.

  • PDF

Reinforcement Learning for Minimizing Tardiness and Set-Up Change in Parallel Machine Scheduling Problems for Profile Shops in Shipyard (조선소 병렬 기계 공정에서의 납기 지연 및 셋업 변경 최소화를 위한 강화학습 기반의 생산라인 투입순서 결정)

  • So-Hyun Nam;Young-In Cho;Jong Hun Woo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.60 no.3
    • /
    • pp.202-211
    • /
    • 2023
  • The profile shops in shipyards produce section steels required for block production of ships. Due to the limitations of shipyard's production capacity, a considerable amount of work is already outsourced. In addition, the need to improve the productivity of the profile shops is growing because the production volume is expected to increase due to the recent boom in the shipbuilding industry. In this study, a scheduling optimization was conducted for a parallel welding line of the profile process, with the aim of minimizing tardiness and the number of set-up changes as objective functions to achieve productivity improvements. In particular, this study applied a dynamic scheduling method to determine the job sequence considering variability of processing time. A Markov decision process model was proposed for the job sequence problem, considering the trade-off relationship between two objective functions. Deep reinforcement learning was also used to learn the optimal scheduling policy. The developed algorithm was evaluated by comparing its performance with priority rules (SSPT, ATCS, MDD, COVERT rule) in test scenarios constructed by the sampling data. As a result, the proposed scheduling algorithms outperformed than the priority rules in terms of set-up ratio, tardiness, and makespan.

Fuzzy-based Dynamic Packet Scheduling Algorithm for Multimedia Cognitive Radios (멀티미디어 무선인지 시스템을 위한 퍼지 기반의 동적 패킷 스케줄링 알고리즘)

  • Tung, Nguyen Thanh;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.1-7
    • /
    • 2012
  • Cognitive radio, a new paradigm for wireless communication, is being recently expected to support various types of multimedia traffics. To guarantee Quality of Service (QoS) from SUs, a static packet priority policy can be considered. However, this approach can easily satisfy Quality of Service of high priority application while that of lower priority applications is being degraded. In the paper, we propose a fuzzy-based dynamic packet scheduling algorithm to support multimedia traffics in which the dynamic packet scheduler modifies priorities of packets according to Fuzzy-rules with the information of priority and delay deadline of each packet, and determines which packet would be transmitted through the channel of the primary user in the next time slot in order to reduce packet loss rate. Our simulation result shows that packet loss rate can be improved through the proposed scheme when overall traffic load is not heavy.