• 제목/요약/키워드: advanced benchmark

검색결과 154건 처리시간 0.024초

Development of a computer code for thermal-hydraulic design and analysis of helically coiled tube once-through steam generator

  • Zhang, Yaoli;Wang, Duo;Lin, Jianshu;Hao, Junwei
    • Nuclear Engineering and Technology
    • /
    • 제49권7호
    • /
    • pp.1388-1395
    • /
    • 2017
  • The Helically coiled tube Once-Through Steam Generator (H-OTSG) is a key piece of equipment for compact small reactors. The present study developed and verified a thermal-hydraulic design and performance analysis computer code for a countercurrent H-OTSG installed in a small pressurized water reactor. The H-OTSG is represented by one characteristic tube in the model. The secondary side of the H-OTSG is divided into single-phase liquid region, nucleate boiling region, postdryout region, and single-phase vapor region. Different heat transfer correlations and pressure drop correlations are reviewed and applied. To benchmark the developed physical models and the computer code, H-OTSGs developed in Marine Reactor X and System-integrated Modular Advanced ReacTor are simulated by the code, and the results are compared with the design data. The overall characteristics of heat transfer area, temperature distributions, and pressure drops calculated by the code showed general agreement with the published data. The thermal-hydraulic characteristics of a typical countercurrent H-OTSG are analyzed. It is demonstrated that the code can be utilized for design and performance analysis of an H-OTSG.

유한체적법에 의한 복잡한 형상을 갖는 3차원 가스터빈 연속기내의 복사열 전달 해석 (Prediction of Radiative Heat Transfer in a Three-Dimensional Gas Turbine Combustor with the Finite-Volume Method)

  • 김만영;백승욱
    • 대한기계학회논문집B
    • /
    • 제20권8호
    • /
    • pp.2681-2692
    • /
    • 1996
  • The finite-volume method for radiation in a three-dimensional non-orthogonal gas turbine combustion chamber with absorbing, emitting and anisotropically scattering medium is presented. The governing radiative transfer equation and its discretization equation using the step scheme are examined, while geometric relations which transform the Cartesian coordinate to a general body-fitted coordinate are provided to close the finite-volume formulation. The scattering phase function is modeled by a Legendre polynomial series. After a benchmark solution for three-dimensional rectangular combustor is obtained to validate the present formulation, a problem in three-dimensional non-orthogonal gas turbine combustor is investigated by changing such parameters as scattering albedo, scattering phase function and optical thickness. Heat flux in case of isotropic scattering is the same as that of non-scattering with specified heat generation in the medium. Forward scattering is found to produce higher radiative heat flux at hot and cold wall than backward scattering and optical thickness is also shown to play an important role in the problem. Results show that finite-volume method for radiation works well in orthogonal and non-orthogonal systems.

항공교통관제사를 위한 국내 비행장 관제시뮬레이터 구현 방향의 연구 (The Study on the Direction of Developing an Aerodrome Traffic Control Simulator for the Air Traffic Controller)

  • 홍승범;김도현
    • 한국항행학회논문지
    • /
    • 제18권2호
    • /
    • pp.114-120
    • /
    • 2014
  • 본 논문에서는 비행장 관제 시뮬레이터 구현을 위해 필요한 사항을 살펴본다. 비행단계 중 비행장에서의 이착륙 단계는 항공 안전관리 측면에서 매우 중요시 다루어져야 한다. 그 이유는 전 세계 항공기 사고 및 준사고의 60%이상이이 단계에서 발생하는 것으로 조사되기 때문이다. 본 논문에서 항공교통관제 시뮬레이터의 평가 기준인 실습 유형, 장비 형태, 그리고 현실성의 충실도를 통하여 국내 항공교통관제 시뮬레이터의 구현 단계를 평가하고, 현업에 종사하는 항공교통관제사의 설문을 통해 현재 운용 중인 시뮬레이터의 문제점을 검토하여 그 해결방안을 살펴보았다. 또한 이를 바탕으로 개선된 HI-FI 항공교통관제 시뮬레이터의 구현 방향을 제시하고자 하였다.

개선된 테스트 용이화를 위한 점진적 개선 방식의 데이타 경로 합성 알고리즘 (Stepwise Refinement Data Path Synthesis Algorithm for Improved Testability)

  • 김태환;정기석
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제29권6호
    • /
    • pp.361-368
    • /
    • 2002
  • 본 논문은 세 가지 중요한 설계 기준인 테스트 용이화, 설계 면적, 및 전체 수행 시간을 동시에 고려한 새로운 데이터 경로 합성 알고리즘을 제시한다. 우리는 테스트 용이화를 위한 선행 연구들에서 제시한 세 가지 기초적 척도들에 근거하여 새로운 테스트 용이화의 우수성에 대한 척도를 정의한다. 이 척도를 이용하여, 스케쥴링과 할당의 통합된 형태의, 단계식이며 점진적 개선을 통한, 합성 알고리즘을 제시한다. 벤치마크 설계와 다른 회로의 예를 통한 실험에서, 우리는 설계 면적과 수행 시간에 대해 매우 적은 추가 부담으로, 회로의 테스트 용이화가 향상됨을 보인다.

An Optimization Algorithm with Novel Flexible Grid: Applications to Parameter Decision in LS-SVM

  • Gao, Weishang;Shao, Cheng;Gao, Qin
    • Journal of Computing Science and Engineering
    • /
    • 제9권2호
    • /
    • pp.39-50
    • /
    • 2015
  • Genetic algorithm (GA) and particle swarm optimization (PSO) are two excellent approaches to multimodal optimization problems. However, slow convergence or premature convergence readily occurs because of inappropriate and inflexible evolution. In this paper, a novel optimization algorithm with a flexible grid optimization (FGO) is suggested to provide adaptive trade-off between exploration and exploitation according to the specific objective function. Meanwhile, a uniform agents array with adaptive scale is distributed on the gird to speed up the calculation. In addition, a dominance centroid and a fitness center are proposed to efficiently determine the potential guides when the population size varies dynamically. Two types of subregion division strategies are designed to enhance evolutionary diversity and convergence, respectively. By examining the performance on four benchmark functions, FGO is found to be competitive with or even superior to several other popular algorithms in terms of both effectiveness and efficiency, tending to reach the global optimum earlier. Moreover, FGO is evaluated by applying it to a parameter decision in a least squares support vector machine (LS-SVM) to verify its practical competence.

Intrusion Detection: Supervised Machine Learning

  • Fares, Ahmed H.;Sharawy, Mohamed I.;Zayed, Hala H.
    • Journal of Computing Science and Engineering
    • /
    • 제5권4호
    • /
    • pp.305-313
    • /
    • 2011
  • Due to the expansion of high-speed Internet access, the need for secure and reliable networks has become more critical. The sophistication of network attacks, as well as their severity, has also increased recently. As such, more and more organizations are becoming vulnerable to attack. The aim of this research is to classify network attacks using neural networks (NN), which leads to a higher detection rate and a lower false alarm rate in a shorter time. This paper focuses on two classification types: a single class (normal, or attack), and a multi class (normal, DoS, PRB, R2L, U2R), where the category of attack is also detected by the NN. Extensive analysis is conducted in order to assess the translation of symbolic data, partitioning of the training data and the complexity of the architecture. This paper investigates two engines; the first engine is the back-propagation neural network intrusion detection system (BPNNIDS) and the second engine is the radial basis function neural network intrusion detection system (BPNNIDS). The two engines proposed in this paper are tested against traditional and other machine learning algorithms using a common dataset: the DARPA 98 KDD99 benchmark dataset from International Knowledge Discovery and Data Mining Tools. BPNNIDS shows a superior response compared to the other techniques reported in literature especially in terms of response time, detection rate and false positive rate.

General Purpose Cross-section Analysis Program for Composite Rotor Blades

  • Park, Il-Ju;Jung, Sung-Nam;Kim, Do-Hyung;Yun, Chul-Yong
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제10권2호
    • /
    • pp.77-85
    • /
    • 2009
  • A two-dimensional cross-section analysis program based on the finite element method has been developed for composite blades with arbitrary cross-section profiles and material distributions. The modulus weighted approach is used to take into account the non-homogeneous material characteristics of advanced blades. The CLPT (Classical Lamination Plate Theory) is applied to obtain the effective moduli of the composite laminate. The location of shear center for any given cross-sections are determined according to the Trefftz' definition while the torsion constants are obtained using the St. Venant torsion theory. A series of benchmark examples for beams with various cross-sections are illustrated to show the accuracy of the developed cross-section analysis program. The cross section cases include thin-walled C-channel, I-beam, single-cell box, NACA0012 airfoil, and KARI small-scale blades. Overall, a reasonable correlation is obtained in comparison with experiments or finite element analysis results.

동적 역치 조정을 이용한 퍼지 단층 퍼셉트론 (Fuzzy Single Layer Perceptron using Dynamic Adjustment of Threshold)

  • 조재현;김광백
    • 한국컴퓨터정보학회논문지
    • /
    • 제10권5호
    • /
    • pp.11-16
    • /
    • 2005
  • 최근에 퍼지 이론을 인공 신경망에 접목하여 개선된 성능을 보이려는 경향이 많다. Goh는 퍼지단층 퍼셉트론 알고리즘과 일반적인 델타 규칙(Generalized delta rule)에 기반한 개선된 퍼지 퍼셉트론을 제안하여 Exclusive-OR(XOR) 문제 등을 해결하였다 그러나 이 방법은 계산량의 증가와 복잡한 영상인식에 적응하기에는 어려움이 있다. 논문에서는 동적 역치조정에 의한 개선된 퍼지 단층 퍼셉트론을 제안한다. 제안된 방법은 페턴인식의 벤치마크로 사용되는 XOR문제에 적용된다. 또한 영상 응용영역으로서 디지털 영상의 인식에 적용한다. 실험결과에서 항상 수렴하지는 않지만 그러나 제안된 모델은 학습시간의 개선과 높은 수렴율을 보였다.

  • PDF

An efficient metaheuristic for multi-level reliability optimization problem in electronic systems of the ship

  • Jang, Kil-Woong;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제38권8호
    • /
    • pp.1004-1009
    • /
    • 2014
  • The redundancy allocation problem has usually considered only the component redundancy at the lowest-level for the enhancement of system reliability. A system can be functionally decomposed into system, module, and component levels. Modular redundancy can be more effective than component redundancy at the lowest-level because in modular systems, duplicating a module composed of several components can be easier, and requires less time and skill. We consider a multi-level redundancy allocation problem in which all cases of redundancy for system, module, and component levels are considered. A tabu search of memory-based mechanisms that balances intensification with diversification via the short-term and long-term memory is proposed for its solution. To the best of our knowledge, this is the first attempt to use a tabu search for this problem. Our tabu search algorithm is compared with the previous genetic algorithm for the problem on the new composed test problems as well as the benchmark problems from the literature. Computational results show that the proposed method outstandingly outperforms the genetic algorithm for almost all test problems.

On the Global Convergence of Univariate Dynamic Encoding Algorithm for Searches (uDEAS)

  • Kim, Jong-Wook;Kim, Tae-Gyu;Choi, Joon-Young;Kim, Sang-Woo
    • International Journal of Control, Automation, and Systems
    • /
    • 제6권4호
    • /
    • pp.571-582
    • /
    • 2008
  • This paper analyzes global convergence of the univariate dynamic encoding algorithm for searches (uDEAS) and provides an application result to function optimization. uDEAS is a more advanced optimization method than its predecessor in terms of the number of neighborhood points. This improvement should be validated through mathematical analysis for further research and application. Since uDEAS can be categorized into the generating set search method also established recently, the global convergence property of uDEAS is proved in the context of the direct search method. To show the strong performance of uDEAS, the global minima of four 30 dimensional benchmark functions are attempted to be located by uDEAS and the other direct search methods. The proof of global convergence and the successful optimization result guarantee that uDEAS is a reliable and effective global optimization method.