• Title/Summary/Keyword: Programming Rules

Search Result 149, Processing Time 0.024 seconds

A Study on the Fault Diagnosis Expert System for 765kV Substations (765kV 변전소의 고장진단 전문가 시스템에 관한 연구)

  • Lee, Heung-Jae;Kang, Hyun-Jae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.7
    • /
    • pp.1276-1280
    • /
    • 2009
  • This paper presents a fault diagnosis expert system for 765kV substation. The proposed system includes the topology processor and intelligent alarm processing subsystems. This expert system estimates the fault section through the inference process using heuristic knowledge and the output of topology processor and intelligent alarm processing system. The rule-base of this expert system is composed of basic rules suggested by Korea Electric Power Corporation and heuristic rules. This expert system is developed using PROLOG language. Also, user friendly Graphic User Interface is developed using visual basic programming in the windows XP environment. The proposed expert system showed a promising performance through the several case studies.

A Branch-and-Bound Algorithm for U-line Line Balancing (U라인 라인밸런싱을 위한 분지한계법)

  • 김여근;김재윤;김동묵;송원섭
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.83-101
    • /
    • 1998
  • Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

  • PDF

A Splitter Location-Allocation Problem in Designing FTTH-PON Access Networks (FTTH-PON 가입자망 설계에서 Splitter Location-Allocation 문제)

  • Park, Chan-Woo;Lee, Young-Ho;Han, Jung-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.36 no.2
    • /
    • pp.1-14
    • /
    • 2011
  • In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

Identification and Extraction of Reusable Linear Programming Model Components (재사용 가능한 성형계획모형 요소의 인식과 추출에 관한 연구)

  • 박성주;권오병
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.3
    • /
    • pp.79-100
    • /
    • 1993
  • This paper proposes an idea of reverse modeling that analyzes LP models and then converts them into an object-oriented model repository. The process of reverse modeling consists of (1) identifying and analyzing source models by meta processor, (2) model decomposition and generalization to scan the models and divide them into model components, and (3) deriving model selection rules from the components by rule generator. Through the process, we can extract reusable model components and build a model base with model selectioon rules. Examples with models created by SML and MODLER modeling languages are given to illustrate the methods. The model base management capabilities provided by reverse modeling can increase the reusabioity of current modeling tools.

  • PDF

Efficient Rule-based OWL Reasoning by Combing Meta Rules and Translation (메타 규칙과 번역의 혼용을 통한 규칙엔진 기반 OWL 추론 엔진의 성능 향상 방법)

  • Jang, Min-Su;Sohn, Joo-Chan;Cho, Young-Jo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.214-219
    • /
    • 2007
  • 생성 규칙(Production Rule)과 이를 기반으로 하는 규칙 엔진(Rule Engine)을 기반으로 한 OWL 추론 엔진은 메타 규칙((Meta Rule)에 의존해 왔다. 메타 규칙은 OWL의 의미론 (Semantics)을 표현하기 용이하여 보다 손쉽게 OWL 추론 엔진을 구현할 수 있다는 장점을 제공하였으나 OWL 추론 성능에 있어 추론 속도와 대용량 온톨로지 처리 측면에서 모두 만족할 만한 성과를 얻지 못하였다. 본 논문은 DLP(Description Logic Programming)의 번역 접근법을 기반으로 한 번역 규칙(Translation Rules)을 메타 규칙과 혼용하는 OWL 추론 기법을 소개한다. LUBM 벤치마크를 통해 이 기법이 메타 규칙만을 이용했을 때 보다 100% 이상 추론 성능을 향상시켰을 뿐 아니라 메모리 사용량도 대폭 축소시켰음을 확인할 수 있었다. 또한, 번역을 통해 제한없는 차수 제약(Cardinality Restriction) 관련 추론을 지원하는 등 보다 넓은 범위의 OWL 추론을 지원할 수 있다.

  • PDF

The Method to Estimate Quality Degradation from Information Hiding in JPEG Compression Environment (JPEG 압축 환경의 정보은닉에서 영상 질 저하 예측방법)

  • Choi, Yong-Soo;Kim, Hyoung-Joong;Lee, Dal-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.551-555
    • /
    • 2008
  • In these days, compressed file is useful in internet environment and has many advantages. So a lot of data hiding algorithms works on JPEG compressed file. Of course they know basic rules of transformation and quantization and they utilize those rules to implement their programming. But most of them evaluate the affection of data hiding after data modification. We propose how to predict the affection of data modification in course of data hiding process. Through some kind of experiments, several valuable facts are revealed which used in data hiding in compressed domain such as JPEG. These facts will improve existing data hiding algorithms (F3, F4 and F5 which including Matrix Encoding)[1],[5],[6].

  • PDF

A Study of Criteria of the Reliability Test for C# programming software in Weapon System (C# 프로그래밍 무기체계 소프트웨어에 대한 신뢰성 시험 기준 연구)

  • Shin, Bongdeug;Oh, Hyukjun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.4
    • /
    • pp.13-24
    • /
    • 2016
  • Defense Acquisition Program Administration's weapon system software development and management guideline specifies the criteria of software reliability tests including static and dynamic tests mainly on C/C++ languages. Recently, Defense Acquisition Program Administration expanded the scope of software reliability test for the various languages including C#, java etc. but specific criteria for them are not established. This study suggests the reliability test procedures and standards on C# programming software in weapon system. For the static test, considering the nature of the C# which depends on .NET framework, this paper introduces applying coding rules recommended by Microsoft Corp. Visual Studio 2012. Block coverage provided by Visual Studio is applied on dynamic tests and the achievement objectives for block coverage according to the software levels(A, B, C) are suggested. Also, the software reliability test procedures and standards proposed by this paper are properly verified through the case study. The result of this study can be used for establishing the specific criteria of the software reliability test for C# programming software in weapon system.

Game Agent Learning with Genetic Programming in Pursuit-Evasion Problem (유전 프로그래밍을 이용한 추격-회피 문제에서의 게임 에이전트 학습)

  • Kwon, O-Kyang;Park, Jong-Koo
    • The KIPS Transactions:PartB
    • /
    • v.15B no.3
    • /
    • pp.253-258
    • /
    • 2008
  • Recently, game players want new game requiring more various tactics and strategies in the complex environment beyond simple and repetitive play. Various artificial intelligence techniques have been suggested to make the game characters learn within this environment, and the recent researches include the neural network and the genetic algorithm. The Genetic programming(GP) has been used in this study for learning strategy of the agent in the pursuit-evasion problem which is used widely in the game theories. The suggested GP algorithm is faster than the existing algorithm such as neural network, it can be understood instinctively, and it has high adaptability since the evolving chromosomes can be transformed to the reasoning rules.

Deriving Robust Reservoir Operation Policy under Changing Climate: Use of Robust Optimiziation with Stochastic Dynamic Programming

  • Kim, Gi Joo;Kim, Young-Oh
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2020.06a
    • /
    • pp.171-171
    • /
    • 2020
  • Decision making strategies should consider both adaptiveness and robustness in order to deal with two main characteristics of climate change: non-stationarity and deep uncertainty. Especially, robust strategies are different from traditional optimal strategies in the sense that they are satisfactory over a wider range of uncertainty and may act as a key when confronting climate change. In this study, a new framework named Robust Stochastic Dynamic Programming (R-SDP) is proposed, which couples previously developed robust optimization (RO) into the objective function and constraint of SDP. Two main approaches of RO, feasibility robustness and solution robustness, are considered in the optimization algorithm and consequently, three models to be tested are developed: conventional-SDP (CSDP), R-SDP-Feasibility (RSDP-F), and R-SDP-Solution (RSDP-S). The developed models were used to derive optimal monthly release rules in a single reservoir, and multiple simulations of the derived monthly policy under inflow scenarios with varying mean and standard deviations are undergone. Simulation results were then evaluated with a wide range of evaluation metrics from reliability, resiliency, vulnerability to additional robustness measures. Evaluation results were finally visualized with advanced visualization tools that are used in multi-objective robust decision making (MORDM) framework. As a result, RSDP-F and RSDP-S models yielded more risk averse, or conservative, results than the CSDP model, and a trade-off relationship between traditional and robustness metrics was discovered.

  • PDF

Comparative Analysis of Optimization Algorithms and the Effects of Coupling Hedging Rules in Reservoir Operations

  • Kim, Gi Joo;Kim, Young-Oh
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2021.06a
    • /
    • pp.206-206
    • /
    • 2021
  • The necessity for appropriate management of water resources infrastructures such as reservoirs, levees, and dikes is increasing due to unexpected hydro-climate irregularities and rising water demands. To meet this need, past studies have focused on advancing theoretical optimization algorithms such as nonlinear programming, dynamic programming (DP), and genetic programming. Yet, the optimally derived theoretical solutions are limited to be directly implemented in making release decisions in the real-world systems for a variety of reasons. This study first aims to comparatively analyze the two prominent optimization methods, DP and evolutionary multi-objective direct policy search (EMODPS), under historical inflow series using K-fold cross validation. A total of six optimization models are formed each with a specific formulation. Then, one of the optimization models was coupled with the actual zone-based hedging rule that has been adopted in practice. The proposed methodology was applied to Boryeong Dam located in South Korea with conflicting objectives between supply and demand. As a result, the EMODPS models demonstrated a better performance than the DP models in terms of proximity to the ideal. Moreover, the incorporation of the real-world policy with the optimal solutions improved in all indices in terms of the supply side, while widening the range of the trade-off between frequency and magnitude measured in the sides of demand. The results from this study once again highlight the necessity of closing the gap between the theoretical solutions with the real-world implementable policies.

  • PDF