• Title/Summary/Keyword: Algorithms and Procedures

Search Result 242, Processing Time 0.03 seconds

Load Test Simulator Development for Steam Turbine-Generator System of Nuclear Power Plant

  • Jeong, Chang-Ki;Kim, Jong-An;Kim, Byung-Chul;Choi, In-Kyu;Woo, Joo-Hee
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1384-1386
    • /
    • 2005
  • This paper focuses on development of load test simulator of a steam turbine-generator in a nuclear power plant. When load is taken off from electrical power network, it is very difficult to effectively control the steam flow to turbine of the nuclear turbine-generator, because of disturbances, such as electrical load and network unbalance on electrical network. Up to the present time, the conventional control system has been used for the load control on nuclear steam generator, owing to the easy control algorithms and the advantage which have been proven on the nuclear power plant. However, since there are problems with stability control during low power and start-up, only a highly experienced operator can operate during those procedures. Also, a great deal of time and an expensive simulator is needed for the training of an operator. The KEPRI is developed simulator for 600MW nuclear power plant to take a test of generator load rejection, throttle valve, and turbine load control. Total load test is implemented before start up.

  • PDF

Fuzzy Indexing and Retrieval in CBR with Weight Optimization Learning for Credit Evaluation

  • Park, Cheol-Soo;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.491-501
    • /
    • 2002
  • Case-based reasoning is emerging as a leading methodology for the application of artificial intelligence. CBR is a reasoning methodology that exploits similar experienced solutions, in the form of past cases, to solve new problems. Hybrid model achieves some convergence of the wide proliferation of credit evaluation modeling. As a result, Hybrid model showed that proposed methodology classify more accurately than any of techniques individually do. It is confirmed that proposed methodology predicts significantly better than individual techniques and the other combining methodologies. The objective of the proposed approach is to determines a set of weighting values that can best formalize the match between the input case and the previously stored cases and integrates fuzzy sit concepts into the case indexing and retrieval process. The GA is used to search for the best set of weighting values that are able to promote the association consistency among the cases. The fitness value in this study is defined as the number of old cases whose solutions match the input cases solution. In order to obtain the fitness value, many procedures have to be executed beforehand. Also this study tries to transform financial values into category ones using fuzzy logic approach fur performance of credit evaluation. Fuzzy set theory allows numerical features to be converted into fuzzy terms to simplify the matching process, and allows greater flexibility in the retrieval of candidate cases. Our proposed model is to apply an intelligent system for bankruptcy prediction.

  • PDF

In-Plane Inextensional and Extensional Vibration Analysis of Curved Beams Using DQM (미분구적법(DQM)을 이용한 곡선보의 내평면 비신장 및 신장 진동해석)

  • Kang, Ki-jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.11
    • /
    • pp.8064-8073
    • /
    • 2015
  • One of the efficient procedures for the solution of partial differential equations is the method of differential quadrature. This method has been applied to a large number of cases to circumvent the difficulties of the complex algorithms of programming for the computer, as well as excessive use of storage due to conditions of complex geometry and loading. In-plane vibrations of curved beams with inextensibility and extensibility of the arch axis are analyzed by the differential quadrature method (DQM). Fundamental frequencies are calculated for the member with various end conditions and opening angles. The results are compared with exact experimental and numerical results by other methods for cases in which they are available. The DQM gives good accuracy even when only a limited number of grid points is used, and new results according to diverse variation are also suggested.

Absolute Atmospheric Correction Procedure for the EO-1 Hyperion Data Using MODTRAN Code

  • Kim, Sun-Hwa;Kang, Sung-Jin;Chi, Jun-Hwa;Lee, Kyu-Sung
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.1
    • /
    • pp.7-14
    • /
    • 2007
  • Atmospheric correction is one of critical procedures to extract quantitative information related to biophysical variables from hyperspectral imagery. Most atmospheric correction algorithms developed for hyperspectral data have been based upon atmospheric radiative transfer (RT) codes, such as MODTRAN. Because of the difficulty in acquisition of atmospheric data at the time of image capture, the complexity of RT model, and large volume of hyperspectral data, atmospheric correction can be very difficult and time-consuming processing. In this study, we attempted to develop an efficient method for the atmospheric correction of EO-1 Hyperion data. This method uses the pre-calculated look-up-table (LUT) for fast and simple processing. The pre-calculated LUT was generated by successive running of MODTRAN model with several input parameters related to solar and sensor geometry, radiometric specification of sensor, and atmospheric condition. Atmospheric water vapour contents image was generated directly from a few absorption bands of Hyperion data themselves and used one of input parameters. This new atmospheric correction method was tested on the Hyperion data acquired on June 3, 2001 over Seoul area. Reflectance spectra of several known targets corresponded with the typical pattern of spectral reflectance on the atmospherically corrected Hyperion image, although further improvement to reduce sensor noise is necessary.

A Case Series of Ingested Open Safety Pin Removal Using a Proposed Endoscopic Removal Technique Algorithm

  • Demiroren, Kaan
    • Pediatric Gastroenterology, Hepatology & Nutrition
    • /
    • v.22 no.5
    • /
    • pp.441-446
    • /
    • 2019
  • Purpose: Safety pin ingestion is common in some regions of the world and may lead to severe morbidity and mortality. The aim of this study was to present some practical suggestions for ingested safety pins using an accompanying algorithm, presented for the first time in the literature to the best of our knowledge. Methods: Twenty children with ingested safety pins during a 4-year period were retrospectively included in the study. Results: Median age of patients was 9.5 months (interquartile range, 6.3-14 months), and 70% were girls. On endoscopic examination, safety pins were observed in the stomach (25%), duodenal bulb (20%), upper esophagus (15%), middle esophagus (10%), and second part of the duodenum (10%) but were not observed in 20% of the cases. Safety pins were removed using endoscopy in 15 cases (75%). In four cases (20%), no safety pin was observed on endoscopic examination. In one case (5%) involving a 6-month-old infant, the safety pin could not be removed although it was observed using endoscopy. No surgical intervention was needed for any patient. No complications such as perforation or deaths developed, except for erosions, due to the foreign body removal procedure. Conclusion: Safety pins are easily removed endoscopically. The best option is to remove the safety pin using endoscopy while it is still in the esophagus and stomach. For this reason, endoscopic procedures should be performed as soon as possible in children who have ingested safety pins.

Navigation of a Mobile Robot Using Hand Gesture Recognition (손 동작 인식을 이용한 이동로봇의 주행)

  • Kim, Il-Myeong;Kim, Wan-Cheol;Yun, Gyeong-Sik;Lee, Jang-Myeong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.7
    • /
    • pp.599-606
    • /
    • 2002
  • A new method to govern the navigation of a mobile robot using hand gesture recognition is proposed based on the following two procedures. One is to achieve vision information by using a 2-DOF camera as a communicating medium between a man and a mobile robot and the other is to analyze and to control the mobile robot according to the recognized hand gesture commands. In the previous researches, mobile robots are passively to move through landmarks, beacons, etc. In this paper, to incorporate various changes of situation, a new control system that manages the dynamical navigation of mobile robot is proposed. Moreover, without any generally used expensive equipments or complex algorithms for hand gesture recognition, a reliable hand gesture recognition system is efficiently implemented to convey the human commands to the mobile robot with a few constraints.

Design of Low Complexity Human Anxiety Classification Model based on Machine Learning (기계학습 기반 저 복잡도 긴장 상태 분류 모델)

  • Hong, Eunjae;Park, Hyunggon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.9
    • /
    • pp.1402-1408
    • /
    • 2017
  • Recently, services for personal biometric data analysis based on real-time monitoring systems has been increasing and many of them have focused on recognition of emotions. In this paper, we propose a classification model to classify anxiety emotion using biometric data actually collected from people. We propose to deploy the support vector machine to build a classification model. In order to improve the classification accuracy, we propose two data pre-processing procedures, which are normalization and data deletion. The proposed algorithms are actually implemented based on Real-time Traffic Flow Measurement structure, which consists of data collection module, data preprocessing module, and creating classification model module. Our experiment results show that the proposed classification model can infers anxiety emotions of people with the accuracy of 65.18%. Moreover, the proposed model with the proposed pre-processing techniques shows the improved accuracy, which is 78.77%. Therefore, we can conclude that the proposed classification model based on the pre-processing process can improve the classification accuracy with lower computation complexity.

Voltage Stability Prediction on Power System Network via Enhanced Hybrid Particle Swarm Artificial Neural Network

  • Lim, Zi-Jie;Mustafa, Mohd Wazir;Jamian, Jasrul Jamani
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.3
    • /
    • pp.877-887
    • /
    • 2015
  • Rapid development of cities with constant increasing load and deregulation in electricity market had forced the transmission lines to operate near their threshold capacity and can easily lead to voltage instability and caused system breakdown. To prevent such catastrophe from happening, accurate readings of voltage stability condition is required so that preventive equipment and operators can execute security procedures to restore system condition to normal. This paper introduced Enhanced Hybrid Particle Swarm Optimization algorithm to estimate the voltage stability condition which utilized Fast Voltage Stability Index (FVSI) to indicate how far or close is the power system network to the collapse point when the reactive load in the system increases because reactive load gives the highest impact to the stability of the system as it varies. Particle Swarm Optimization (PSO) had been combined with the ANN to form the Enhanced Hybrid PSO-ANN (EHPSO-ANN) algorithm that worked accurately as a prediction algorithm. The proposed algorithm reduced serious local minima convergence of ANN but also maintaining the fast convergence speed of PSO. The results show that the hybrid algorithm has greater prediction accuracy than those comparing algorithms. High generalization ability was found in the proposed algorithm.

IRK vs Structural Integrators for Real-Time Applications in MBS

  • Dopico D.;Lugris U.;Gonzalez M.;Cuadrado J.
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.spc1
    • /
    • pp.388-394
    • /
    • 2005
  • Recently, the authors have developed a method for real-time dynamics of multibody systems, which combines a semi-recursive formulation to derive the equations of motion in dependent relative coordinates, along with an augmented Lagrangian technique to impose the loop closure conditions. The following numerical integration procedures, which can be grouped into the so-called structural integrators, were tested : trapezoidal rule, Newmark dissipative schemes, HHT rule, and the Generalized-${\alpha}$ family. It was shown that, for large multi body systems, Newmark dissipative was the best election since, provided that the adequate parameters were chosen, excellent behavior was achieved in terms of efficiency and robustness with acceptable levels of accuracy. In the present paper, the performance of the described method in combination with another group of integrators, the Implicit Runge-Kutta family (IRK), is analyzed. The purpose is to clarify which kind of IRK algorithms can be more suitable for real-time applications, and to see whether they can be competitive with the already tested structural family of integrators. The final objective of the work is to provide some practical criteria for those interested in achieving real-time performance for large and complex multibody systems.

A Minimization Technique for BDD based on Microcanonical Optimization (Microcanonical Optimization을 이용한 BDD의 최소화 기법)

  • Lee, Min-Na;Jo, Sang-Yeong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.1
    • /
    • pp.48-55
    • /
    • 2001
  • Using BDD, we can represent Boolean functions uniquely and compactly, Hence, BDD have become widely used for CAD applications, such as logic synthesis, formal verification, and etc. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variables. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm based on the $\mu$O(microcanonical optimization). $\mu$O consists of two distinct procedures that are alternately applied : Initialization and Sampling. The initialization phase is to executes a fast local search, the sampling phase leaves the local optimum obtained in the previous initialization while remaining close to that area of search space. The proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to a algorithm based on simulated annealing.

  • PDF