• Title/Summary/Keyword: Rule-Based Model

Search Result 1,025, Processing Time 0.025 seconds

Moving object segmentation using Markov Random Field (마코프 랜덤 필드를 이용한 움직이는 객체의 분할에 관한 연구)

  • 정철곤;김중규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.221-230
    • /
    • 2002
  • This paper presents a new moving object segmentation algorithm using markov random field. The algorithm is based on signal detection theory. That is to say, motion of moving object is decided by binary decision rule, and false decision is corrected by markov random field model. The procedure toward complete segmentation consists of two steps: motion detection and object segmentation. First, motion detection decides the presence of motion on velocity vector by binary decision rule. And velocity vector is generated by optical flow. Second, object segmentation cancels noise by Bayes rule. Experimental results demonstrate the efficiency of the presented method.

Development of an Intelligent Program for Diagnosis of Electrical Fire Causes (전기화재 원인진단을 위한 지능형 프로그램 개발)

  • 권동명;홍성호;김두현
    • Journal of the Korean Society of Safety
    • /
    • v.18 no.1
    • /
    • pp.50-55
    • /
    • 2003
  • This paper presents an intelligent computer system, which can easily diagnose electrical fire causes, without the help of human experts of electrical fires diagnosis. For this system, a database is built with facts and rules driven from real electrical fires, and an intellectual database system which even a beginner can diagnose fire causes has been developed, named as an Electrical Fire Causes Diagnosis System : EFCDS. The database system has adopted, as an inference engine, a mixed reasoning approach which is constituted with the rule-based reasoning and the case-based reasoning. The system for a reasoning model was implemented using Delphi 3, one of program development tools, and Paradox is used as a database building tool. To verify effectiveness and performance of this newly developed diagnosis system, several simulated fire examples were tested and the causes of fire examples were detected effectively by this system. Additional researches will be needed to decide the minimal significant level of the solution and the weighting level of important factors.

DESIGN OF A FPGA BASED ABWR FEEDWATER CONTROLLER

  • Huang, Hsuanhan;Chou, Hwaipwu;Lin, Chaung
    • Nuclear Engineering and Technology
    • /
    • v.44 no.4
    • /
    • pp.363-368
    • /
    • 2012
  • A feedwater controller targeted for an ABWR has been implemented using a modern field programmable gate array (FPGA), and verified using the full scope simulator at Taipower's Lungmen nuclear power station. The adopted control algorithm is a rule-based fuzzy logic. Point to point validation of the FPGA circuit board has been executed using a digital pattern generator. The simulation model of the simulator was employed for verification and validation of the controller design under various plant initial conditions. The transient response and the steady state tracking ability were evaluated and showed satisfactory results. The present work has demonstrated that the FPGA based approach incorporated with a rule-based fuzzy logic control algorithm is a flexible yet feasible approach for feedwater controller design in nuclear power plant applications.

A Study on Stochastic Wave Propagation Model to Generate Various Uninterrupted Traffic Flows (다양한 연속 교통류 구현을 위한 확률파장전파모형의 개발)

  • Chang, Hyun-Ho;Baek, Seung-Kirl;Park, Jae-Beom
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.4 s.75
    • /
    • pp.147-158
    • /
    • 2004
  • A class of SWP(Stochastic Wane Propagation) models microscopically mimics individual vehicles' stochastic behavior and traffic jam propagation with simplified car-following models based on CA(Cellular Automata) theory and macroscopically captures dynamic traffic flow relationships based on statistical physics. SWP model, a program-oriented model using both discrete time-space and integer data structure, can simulate a huge road network with high-speed computing time. However, the model has shortcomings to both the capturing of low speed within a jam microscopically and that of the density and back propagation speed of traffic congestion macroscopically because of the generation of spontaneous jam through unrealistic collision avoidance. In this paper, two additional rules are integrated into the NaSch model. The one is SMR(Stopping Maneuver Rule) to mimic vehicles' stopping process more realistically in the tail of traffic jams. the other is LAR(Low Acceleration Rule) for the explanation of low speed characteristics within traffic jams. Therefore, the CA car-following model with the two rules prevents the lockup condition within a heavily traffic density capturing both the stopping maneuver behavior in the tail of traffic jam and the low acceleration behavior within jam microscopically, and generates more various macroscopic traffic flow mechanism than NaSch model's with the explanation of propagation speed and density of traffic jam.

Estimating the Behavior Path of Seafarer Involved in Marine Accidents by Hidden Markov Model (은닉 마르코프 모델을 이용한 해양사고에 개입된 선원의 행동경로 추정)

  • Yim, Jeong-Bin
    • Journal of Navigation and Port Research
    • /
    • v.43 no.3
    • /
    • pp.160-165
    • /
    • 2019
  • The conduct of seafarer is major cause of marine accidents. This study models the behavior of the seafarer based on the Hidden Markov Model (HMM). Additionally, through the path analysis of the behavior estimated by the model, the kind of situations, procedures and errors that may have caused the marine accidents were interpreted. To successfully implement the model, the seafarer behaviors were observed by means of the summarized verdict reports issued by the Korean Maritime Safety Tribunal, and the observed results converted into behavior data suitable for HMM learning through the behavior classification framework based on the SRKBB (Skill-, Rule-, and Knowledge-Based Behavior). As a result of modeling the seafarer behaviors by the type of vessels, it was established that there was a difference between the models, and the possibility of identifying the preferred path of the seafarer behaviors. Through these results, it is expected that the model implementation technique proposed in this study can be applied to the prediction of the behavior of the seafarer as well as contribute to the prioritization of the behavior correction among seafarers, which is necessary for the prevention of marine accidents.

A Methodology for Improving fitness of the Latent Growth Modeling using Association Rule Mining (연관규칙을 이용한 잠재성장모형의 개선방법론)

  • Cho, Yeong Bin;Jun, Jae-Hoon;Choi, Byungwoo
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.2
    • /
    • pp.217-225
    • /
    • 2019
  • The Latent Growth Modeling(LGM) is known as the typical analysis method of longitudinal data and it could be classified into unconditional model and conditional model. It is common to assume that the growth trajectory of unconditional model of LGM is linear. In the case of quasi-linear, the methodology for improving the model fitness using Sequential Pattern of Association Rule Mining is suggested. To do this, we divide longitudinal data into quintiles and extract periodic changes of the longitudinal data in each quintiles and make sequential pattern based on this periodic changes. To evaluate the effectiveness, the LGM module in SPSS AMOS was used and the dataset of the Youth Panel from 2001 to 2006 of Korea Employment Information Service. Our methodology was able to increase the fitness of the model compared to the simple linear growth trajectory.

A Study on Memetic Algorithm-Based Scheduling for Minimizing Makespan in Unrelated Parallel Machines without Setup Time (작업준비시간이 없는 이종 병렬설비에서 총 소요 시간 최소화를 위한 미미틱 알고리즘 기반 일정계획에 관한 연구)

  • Tehie Lee;Woo-Sik Yoo
    • Journal of the Korea Safety Management & Science
    • /
    • v.25 no.2
    • /
    • pp.1-8
    • /
    • 2023
  • This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

Risk Analysis for the Rotorcraft Landing System Using Comparative Models Based on Fuzzy (퍼지 기반 다양한 모델을 이용한 회전익 항공기 착륙장치의 위험 우선순위 평가)

  • Na, Seong Hyeon;Lee, Gwang Eun;Koo, Jeong Mo
    • Journal of the Korean Society of Safety
    • /
    • v.36 no.2
    • /
    • pp.49-57
    • /
    • 2021
  • In the case of military supplies, any potential failure and causes of failures must be considered. This study is aimed at examining the failure modes of a rotorcraft landing system to identify the priority items. Failure mode and effects analysis (FMEA) is applied to the rotorcraft landing system. In general, the FMEA is used to evaluate the reliability in engineering fields. Three elements, specifically, the severity, occurrence, and detectability are used to evaluate the failure modes. The risk priority number (RPN) can be obtained by multiplying the scores or the risk levels pertaining to severity, occurrence, and detectability. In this study, different weights of the three elements are considered for the RPN assessment to implement the FMEA. Furthermore, the FMEA is implemented using a fuzzy rule base, similarity aggregation model (SAM), and grey theory model (GTM) to perform a comparative analysis. The same input data are used for all models to enable a fair comparison. The FMEA is applied to military supplies by considering methodological issues. In general, the fuzzy theory is based on a hypothesis regarding the likelihood of the conversion of the crisp value to the fuzzy input. Fuzzy FMEA is the basic method to obtain the fuzzy RPN. The three elements of the FMEA are used as five linguistic terms. The membership functions as triangular fuzzy sets are the simplest models defined by the three elements. In addition, a fuzzy set is described using a membership function mapping the elements to the intervals 0 and 1. The fuzzy rule base is designed to identify the failure modes according to the expert knowledge. The IF-THEN criterion of the fuzzy rule base is formulated to convert a fuzzy input into a fuzzy output. The total number of rules is 125 in the fuzzy rule base. The SAM expresses the judgment corresponding to the individual experiences of the experts performing FMEA as weights. Implementing the SAM is of significance when operating fuzzy sets regarding the expert opinion and can confirm the concurrence of expert opinion. The GTM can perform defuzzification to obtain a crisp value from a fuzzy membership function and determine the priorities by considering the degree of relation and the form of a matrix and weights for the severity, occurrence, and detectability. The proposed models prioritize the failure modes of the rotorcraft landing system. The conventional FMEA and fuzzy rule base can set the same priorities. SAM and GTM can set different priorities with objectivity through weight setting.

Part-of-speech Tagging for Hindi Corpus in Poor Resource Scenario

  • Modi, Deepa;Nain, Neeta;Nehra, Maninder
    • Journal of Multimedia Information System
    • /
    • v.5 no.3
    • /
    • pp.147-154
    • /
    • 2018
  • Natural language processing (NLP) is an emerging research area in which we study how machines can be used to perceive and alter the text written in natural languages. We can perform different tasks on natural languages by analyzing them through various annotational tasks like parsing, chunking, part-of-speech tagging and lexical analysis etc. These annotational tasks depend on morphological structure of a particular natural language. The focus of this work is part-of-speech tagging (POS tagging) on Hindi language. Part-of-speech tagging also known as grammatical tagging is a process of assigning different grammatical categories to each word of a given text. These grammatical categories can be noun, verb, time, date, number etc. Hindi is the most widely used and official language of India. It is also among the top five most spoken languages of the world. For English and other languages, a diverse range of POS taggers are available, but these POS taggers can not be applied on the Hindi language as Hindi is one of the most morphologically rich language. Furthermore there is a significant difference between the morphological structures of these languages. Thus in this work, a POS tagger system is presented for the Hindi language. For Hindi POS tagging a hybrid approach is presented in this paper which combines "Probability-based and Rule-based" approaches. For known word tagging a Unigram model of probability class is used, whereas for tagging unknown words various lexical and contextual features are used. Various finite state machine automata are constructed for demonstrating different rules and then regular expressions are used to implement these rules. A tagset is also prepared for this task, which contains 29 standard part-of-speech tags. The tagset also includes two unique tags, i.e., date tag and time tag. These date and time tags support all possible formats. Regular expressions are used to implement all pattern based tags like time, date, number and special symbols. The aim of the presented approach is to increase the correctness of an automatic Hindi POS tagging while bounding the requirement of a large human-made corpus. This hybrid approach uses a probability-based model to increase automatic tagging and a rule-based model to bound the requirement of an already trained corpus. This approach is based on very small labeled training set (around 9,000 words) and yields 96.54% of best precision and 95.08% of average precision. The approach also yields best accuracy of 91.39% and an average accuracy of 88.15%.

Interval-Valued Fuzzy Set Backward Reasoning Using Fuzzy Petri Nets (퍼지 페트리네트를 이용한 구간값 퍼지 집합 후진추론)

  • 조상엽;김기석
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.559-566
    • /
    • 2004
  • In general, the certainty factors of the fuzzy production rules and the certainty factors of fuzzy propositions appearing in the rules are represented by real values between zero and one. If it can allow the certainty factors of the fuzzy production rules and the certainty factors of fuzzy propositions to be represented by interval -valued fuzzy sets, then it can allow the reasoning of rule-based systems to perform fuzzy reasoning in more flexible manner. This paper presents fuzzy Petri nets and proposes an interval-valued fuzzy backward reasoning algorithm for rule-based systems based on fuzzy Petri nets Fuzzy Petri nets model the fuzzy production rules in the knowledge base of a rule-based system, where the certainty factors of the fuzzy propositions appearing in the fuzzy production rules and the certainty factors of the rules are represented by interval-valued fuzzy sets. The algorithm we proposed generates the backward reasoning path from the goal node to the initial nodes and then evaluates the certainty factor of the goal node. The proposed interval-valued fuzzy backward reasoning algorithm can allow the rule-based systems to perform fuzzy backward reasoning in a more flexible and human-like manner.

  • PDF