• Title/Summary/Keyword: Operation Sequence

Search Result 572, Processing Time 0.025 seconds

Decay Beat Removal and Operator's Intervention During A Very Small L()CA (매우 작은 규모의 냉각재 상실 사고 동안 잔열 제거와 운전자의 개입)

  • Hee Cheon No
    • Nuclear Engineering and Technology
    • /
    • v.16 no.1
    • /
    • pp.11-17
    • /
    • 1984
  • Sample calculations were done for KORI-1 to develop a better understanding of what happens after very small LOCA ($\leq$0.05 ft$^2$). For a water-side break with the break size larger than 0.006 ft$^2$, fluid-loss through break exceeds the makeup. If the break size is larger than 0.008ft$^2$, decay heat can be completely removed through break. Based on these results, it was concluded that KORI-1 is fairly safe for the whole spectrum of sizes in very small LOCA. However, for the reactor with 900 MWe or 1200 MWe, a certain spectrum of sizes in very small LOCA should be carefully considered. In the accident sequence the transition from natural circulation to pool boiling or from pool boiling to natural circulation may be troublesome to the operator or in the safety analysis. Operator's intervention was discussed; primary pump shutoff, HPI pump shutoff, break isolation, and opening relief valve. It was proved that continuous operation of HPI pumps after shutdown will not threaten the integrity of the primary system.

  • PDF

Integrated Supply Chain Model of Advanced Planning and Scheduling (APS) and Efficient Purchasing for Make-To-Order Production (주문생산을 위한 APS 와 효율적 구매의 통합모델)

  • Jeong Chan Seok;Lee Young Hae
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.449-455
    • /
    • 2002
  • This paper considers that advanced planning and scheduling (APS) in manufacturing and the efficient purchasing where each customer order has its due date and multi-suppliers exit We present a Make-To­Order Supply Chan (MTOSC) model of efficient purchasing process from multi-suppliers and APS with outsourcing in a supply chain, which requires the absolute due date and minimized total cost. Our research has included two states. One is for efficient purchasing from suppliers: (a) selection of suppliers for required parts; (b) optimum part lead­time of selected suppliers. Supplier selection process has received considerable attention in the business­management literature. Determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions usually is complex and unstructured. These influence factors can be divided into quantitative and qualitative factors. In the first level, linguistic values are used to assess the ratings for the qualitative factors such as profitability, relationship closeness and quality. In the second level a MTOSC model determines the solutions (supplier selection and order quantity) by considering quantitative factors such as part unit price, supplier's lead-time, and storage cost, etc. The other is for APS: (a) selection of the best machine for each operation; (b) deciding sequence of operations; (c) picking out the operations to be outsourcing; and (d) minimizing makespan under the due date of each customer's order. To solve the model, a genetic algorithm (GA)-based heuristic approach is developed. From the numerical experiments, GA­based approach could efficiently solve the proposed model, and show the best process plan and schedule for all customers' orders.

  • PDF

Emission Reduction of Air Pollutants Produced from Chemical Plants

  • Lee, Byeong-Kyu;Cho, Sung-Woong
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.15 no.E
    • /
    • pp.29-38
    • /
    • 1999
  • This study identified emission sources and emissions of air pollutants such as volatile organic compounds (VOCs), solvents, and acid gases produced from chemical plants. We collected air samples from various processes, reactors and facilities using VOC detectors and workers' experience. We identified chemical structures and emission concentrations of air pollutants. We analyzed total emissions of air pollutants emitted from the chemical plants. Also, we developed some emission reduction technologies based on chemical types and emission situations of the identified air pollutants. For reduction of air emissions of acid gases, we employed a method improving solubility of pollutants by reducing scrubber operation temperature, increasing surface area for effective contact of gas and liquid, and modifying or changing chemicals used in the acid scrubbers. In order to reduce air emissions of both amines and acid gases, which have had different emission sources each other but treated by one scrubber, we first could separate gas components. And then different control techniques based on components of pollutants were applied to the emission sources. That is, we first applied condensation and then acid scrubbing method using H2SO4 solution for amine treatment. However, we only used an acid scrubbing method using H2O and NaOH solution for acid gas treatment. In order to reduce air emissions of solvents such as dimethylformamide and toluene, we applied condensation and activated carbon adsorption. In order to reduce air emissions of mixture gases containing acid gases and slovents, which could not be separated in the processes, we employed a combination of various air pollution control devices. That is, the mixture gases were passed into the first condenser, the acid scrubber, the second condenser, and the activated carbon adsorption tower in sequence. In addition, for improvement of condensation efficiency of VOCs, we changed the type of the condensers attached in the reactors as a control device modification. Finally, we could successfully reduce air emissions of pollutants produced from various chenmical processes or facilities by use of proper control methods according to the types and specific emission situations of pollutants.

  • PDF

Fixed Homography-Based Real-Time SW/HW Image Stitching Engine for Motor Vehicles

  • Suk, Jung-Hee;Lyuh, Chun-Gi;Yoon, Sanghoon;Roh, Tae Moon
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1143-1153
    • /
    • 2015
  • In this paper, we propose an efficient architecture for a real-time image stitching engine for vision SoCs found in motor vehicles. To enlarge the obstacle-detection distance and area for safety, we adopt panoramic images from multiple telegraphic cameras. We propose a stitching method based on a fixed homography that is educed from the initial frame of a video sequence and is used to warp all input images without regeneration. Because the fixed homography is generated only once at the initial state, we can calculate it using SW to reduce HW costs. The proposed warping HW engine is based on a linear transform of the pixel positions of warped images and can reduce the computational complexity by 90% or more as compared to a conventional method. A dual-core SW/HW image stitching engine is applied to stitching input frames in parallel to improve the performance by 70% or more as compared to a single-core engine operation. In addition, a dual-core structure is used to detect a failure in state machines using rock-step logic to satisfy the ISO26262 standard. The dual-core SW/HW image stitching engine is fabricated in SoC with 254,968 gate counts using Global Foundry's 65 nm CMOS process. The single-core engine can make panoramic images from three YCbCr 4:2:0 formatted VGA images at 44 frames per second and frequency of 200 MHz without an LCD display.

Development of a Walking-type Solar Panel Cleaning Robot Capable of Driving on Inclined Solar Panel (경사진 패널 위에서 주행이 가능한 보행형 태양광 패널 청소로봇 시스템 개발)

  • Park, Sunggwan;Jang, Woojin;Kim, Dong-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.5
    • /
    • pp.79-88
    • /
    • 2020
  • This paper propose the method to drive a solar panel cleaning robot efficiently on an inclined panel using vacuum pad pressure. In this method, the rubber pads using the vacuum pressure are used to attach robot body to the panel surface. By applying the linkage mechanism to the vacuum pads, it was possible to reduce robot weight and power consumption and to prevent slipping of the robot. In addition, the use of solenoid valves, proximity sensors, and encoders to detect movement of the robot body and the control of the pad pressure dedicate to the driving of the robot on an inclined panel. In order to move the robot forward, the operation sequence of multiple solenoid valves was completed, and the six vacuum pads mounted to both legs were accurately controlled to form vacuum and atmospheric pressure in right order so that the robot could move forward without slipping. At last, it was confirmed through experiments that straight-forward moving and rotational movement could be performed up to 36 degrees of inclination angle of solar panel.

Adaptive Shot Change Detection Technique Using Histogram Mean within Extension Sliding Window and Its Implementation on Portable Multimedia Player (확장 참조 구간의 히스토그램 평균값을 이용한 적응적인 장면 전환 검출 기법과 휴대용 멀티미디어 재생기에서의 구현)

  • Kim, Won-Hee;Cho, Gyeong-Yeon;Kim, Jong-Nam
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.23-33
    • /
    • 2009
  • A shot change detection technique is an important technique for effective management of video data, thus it requires an adaptive algorithm for various video sequences to detect an accurate shot change frames. In this paper, we propose an adaptive shot change detection algorithm using histogram mean of frames within extension sliding window. Our algorithm calculates a frame feature value using histogram and defines an adaptive threshold using an average of histogram mean of frames within the extension sliding window and determines a shot change by comparing the feature value and the threshold. We obtained better detection rate than the conventional methods maximally by 15% in the experiment with the same test sequence. We verified real-time operation of shot change detection in the hardware platform with low performance by implementing it on TVUS HM-900 PLUS model of Homecast. The Proposed algorithm can be useful in the hardware platform such as portable multimedia player(PMP) or cellular phone with low CPU performance.

Verification of Automatic PAR Control System using DEVS Formalism (DEVS 형식론을 이용한 공항 PAR 관제 시스템 자동화 방안 검증)

  • Sung, Chang-ho;Koo, Jung;Kim, Tag-Gon;Kim, Ki-Hyung
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.3
    • /
    • pp.1-9
    • /
    • 2012
  • This paper proposes automatic precision approach radar (PAR) control system using digital signal to increase the safety of aircraft, and discrete event systems specification (DEVS) methodology is utilized to verify the proposed system. Traditionally, a landing aircraft is controlled by the human voice of a final approach controller. However, the voice information can be missed during transmission, and pilots may also act improperly because of incorrectness of auditory signals. The proposed system enables the stable operation of the aircraft, regardless of the pilot's capability. Communicating DEVS (C-DEVS) is used to analyze and verify the behavior of the proposed system. A composed C-DEVS atomic model has overall composed discrete state sets of models, and the state sequence acquired through full state search is utilized to verify the safeness and the liveness of a system behavior. The C-DEVS model of the proposed system shows the same behavior with the traditional PAR control system.

Memory-Efficient Time-Memory Trade-Off Cryptanalysis (메모리 효율적인 TMTO 암호 해독 방법)

  • Kim, Young-Sik;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.28-36
    • /
    • 2009
  • Time-memory trade-off (TMTO) cryptanalysis proposed by Hellman can be applied for the various crypto-systems such as block ciphers, stream ciphers, and hash functions. In this paper, we propose a novel method to reduce memory size for storing TMTO tables. The starting points in a TMTO table can be substituted by the indices of n-bit samples from a sequence in a family of pseudo-random sequences with good cross-correlation, which results in the reduction of memory size for the starting points. By using this method, it is possible to reduce the memory size by the factor of 1/10 at the cost of the slightly increasing of operation time in the online phase. Because the memory is considered as more expensive resource than the time, the TMTO cryptanalysis will be more feasible for many real crypto systems.

Temporal Pattern Mining of Moving Objects for Location based Services (위치 기반 서비스를 위한 이동 객체의 시간 패턴 탐사 기법)

  • Lee, Jun-Uk;Baek, Ok-Hyeon;Ryu, Geun-Ho
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.335-346
    • /
    • 2002
  • LBS(Location Based Services) provide the location-based information to its mobile users. The primary functionality of these services is to provide useful information to its users at a minimum cost of resources. The functionality can be implemented through data mining techniques. However, conventional data mining researches have not been considered spatial and temporal aspects of data simultaneously. Therefore, these techniques are inappropriate to apply on the objects of LBS, which change spatial attributes over time. In this paper, we propose a new data mining technique for identifying the temporal patterns from the series of the locations of moving objects that have both temporal and spatial dimension. We use a spatial operation of contains to generalize the location of moving point and apply time constraints between the locations of a moving object to make a valid moving sequence. Finally, the spatio-temporal technique proposed in this paper is very practical approach in not only providing more useful knowledge to LBS, but also improving the quality of the services.

Searching for an Intra-block Remarshalling Plan for Multiple Transfer Cranes (복수 트랜스퍼 크레인을 활용하는 블록 내 재정돈 계획 탐색)

  • Oh Myung-Seob;Kang Jae-Ho;Ryu Kwang-Ryel;Kim Kap-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.7
    • /
    • pp.624-635
    • /
    • 2006
  • This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.