• Title/Summary/Keyword: Benchmark Problem

Search Result 460, Processing Time 0.023 seconds

A Study of Neutronics Effects of the Spacer Grids in a Typical PWR via Monte Carlo Calculation

  • Tran, Xuan Bach;Cho, Nam Zin
    • Nuclear Engineering and Technology
    • /
    • v.48 no.1
    • /
    • pp.33-42
    • /
    • 2016
  • Spacer grids play an important role in maintaining the proper form of the fuel assembly structure and ensuring the safety of reactor core design. This study applies the Monte Carlo method to the analysis of the neutronics effects of spacer grids in a typical pressurized water reactor (PWR). The core problem used to analyze the neutronics effects of spacer grids is a modified version of Korea Advanced Institute of Science and Technology benchmark problem 1B, based on an Advanced Power Reactor 1400 (APR1400) core model. The spacer grids are modeled and added to this test problem in various ways. Then, by running MCNP5 for all cases of spacer grid modeling, some important numerical results, such as the effective multiplication factor, the spatial distributions of neutron flux, and its energy spectrum are obtained. The numerical results of each case of spacer grid modeling are analyzed and compared to assess which type has more advantages in accuracy of numerical results and effectiveness in terms of geometry building. The conclusion is that the most realistic modeling for Monte Carlo calculation is the "volume-preserving" streamlined heterogeneous spacer grids, but the "banded" dissolution spacer grids modeling is a more practical yet accurate model for routine (deterministic) analysis.

Technology Mapping of Sequential Logic for TLU-Type FPGAs (TLU형 FPGA를 위한 순차회로 기술 매핑 알고리즘)

  • Park, Jang-Hyeon;Kim, Bo-Gwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.564-571
    • /
    • 1996
  • The logic synthesis systems for table look up(TLU) type field programmable e gate arrays(FPGAs) have so farstudied mostly the combinational logic problem m. This paper presents for mapping a sequential circuit onto a popular table look up architecture, theXilinx 3090 architecture. In thefirst for solving this problem, combinational and sequential elements which have 6 or7 input combinational and sequential elements which haveless thanor equal to 5 inputs. We heavily use the combinational synthesis techniques tosolve the sequential synthesis problem. Our syntheisis approach is very simple, but its results are reasonable. We compare seveal benchmark Examples with sis-pga(map_together and map_separate) synthesis system and the experimental results show that our synthesis system is 17% betterthan sis-pga sequential synthesis system for TLU PGAs.

  • PDF

Protecting Technique for the Executable File of Virtual Machines (가상기계 실행파일을 위한 보호 기법)

  • Park, Ji-Woo;Yi, Chang-Hwan;Oh, Se-Man
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.668-678
    • /
    • 2007
  • The development of a wire and wireless communication technologies might permit easily accessing on various information. But, the easiness of accessing information has basically the problem of an unintended information outflow. An executable file which has key algorithms, data and resources for itself has very weak point in the security. Because the various information such as algorithms, data and resources is included in an executable file on embedded systems or virtual machines, the information outflow problem may appear more seriously. In this paper, we propose a technique which can be protecting the executable file contents for resolving the outflow problem through the encryption. Experimentally, we applied the proposed technique to EVM-the virtual machine for embedded system and verified it. Also, we tried a benchmark test for the proposed technique and obtained reasonable performance overhead.

  • PDF

An Improvement of Performance for Cascade Correlation Learning Algorithm using a Cosine Modulated Gaussian Activation Function (코사인 모듈화 된 가우스 활성화 함수를 사용한 캐스케이드 코릴레이션 학습 알고리즘의 성능 향상)

  • Lee, Sang-Wha;Song, Hae-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.107-115
    • /
    • 2006
  • This paper presents a new class of activation functions for Cascade Correlation learning algorithm, which herein will be called CosGauss function. This function is a cosine modulated gaussian function. In contrast to the sigmoidal, hyperbolic tangent and gaussian functions, more ridges can be obtained by the CosGauss function. Because of the ridges, it is quickly convergent and improves a pattern recognition speed. Consequently it will be able to improve a learning capability. This function was tested with a Cascade Correlation Network on the two spirals problem and results are compared with those obtained with other activation functions.

  • PDF

Intelligent Route Construction Algorithm for Solving Traveling Salesman Problem

  • Rahman, Md. Azizur;Islam, Ariful;Ali, Lasker Ershad
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.4
    • /
    • pp.33-40
    • /
    • 2021
  • The traveling salesman problem (TSP) is one of the well-known and extensively studied NPC problems in combinatorial optimization. To solve it effectively and efficiently, various optimization algorithms have been developed by scientists and researchers. However, most optimization algorithms are designed based on the concept of improving route in the iterative improvement process so that the optimal solution can be finally found. In contrast, there have been relatively few algorithms to find the optimal solution using route construction mechanism. In this paper, we propose a route construction optimization algorithm to solve the symmetric TSP with the help of ratio value. The proposed algorithm starts with a set of sub-routes consisting of three cities, and then each good sub-route is enhanced step by step on both ends until feasible routes are formed. Before each subsequent expansion, a ratio value is adopted such that the good routes are retained. The experiments are conducted on a collection of benchmark symmetric TSP datasets to evaluate the algorithm. The experimental results demonstrate that the proposed algorithm produces the best-known optimal results in some cases, and performs better than some other route construction optimization algorithms in many symmetric TSP datasets.

Implementation and benchmarking of the local weight window generation function for OpenMC

  • Hu, Yuan;Yan, Sha;Qiu, Yuefeng
    • Nuclear Engineering and Technology
    • /
    • v.54 no.10
    • /
    • pp.3803-3810
    • /
    • 2022
  • OpenMC is a community-driven open-source Monte Carlo neutron and photon transport simulation code. The Weight Window Mesh (WWM) function and an automatic Global Variance Reduction (GVR) method was recently developed and implemented in a developmental branch of OpenMC. This WWM function and GVR method broaden OpenMC's usage in general purposes deep penetration shielding calculations. However, the Local Variance Reduction (LVR) method, which suits the source-detector problem, is still missing in OpenMC. In this work, the Weight Window Generator (WWG) function has been developed and benchmarked for the same branch. This WWG function allows OpenMC to generate the WWM for the source-detector problem on its own. Single-material cases with varying shielding and sources were used to benchmark the WWG function and investigate how to set up the particle histories utilized in WWG-run and WWM-run. Results show that there is a maximum improvement of WWM generated by WWG. Based on the above results, instructions on determining the particle histories utilized in WWG-run and WWM-run for optimal computation efficiency are given and tested with a few multi-material cases. These benchmarks demonstrate the ability of the OpenMC WWG function and the above instructions for the source-detector problem. This developmental branch will be released and merged into the main distribution in the future.

A Polynomial Time Algorithm for Aircraft Landing Problem (항공기 착륙 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.161-168
    • /
    • 2014
  • The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.

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

  • Kim, Man-Yeong;Baek, Seung-Uk
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.20 no.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.

Identification and Robust $H_\infty$ Control of the Rotational/Translational Actuator System

  • Tavakoli Mahdi;Taghirad Hamid D.;Abrishamchian Mehdi
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.3
    • /
    • pp.387-396
    • /
    • 2005
  • The Rotational/Translational Actuator (RTAC) benchmark problem considers a fourth-order dynamical system involving the nonlinear interaction of a translational oscillator and an eccentric rotational proof mass. This problem has been posed to investigate the utility of a rotational actuator for stabilizing translational motion. In order to experimentally implement any of the model-based controllers proposed in the literature, the values of model parameters are required which are generally difficult to determine rigorously. In this paper, an approach to the least-squares estimation of the parameters of a system is formulated and practically applied to the RTAC system. On the other hand, this paper shows how to model a nonlinear system as a linear uncertain system via nonparametric system identification, in order to provide the information required for linear robust $H_\infty$ control design. This method is also applied to the RTAC system, which demonstrates severe nonlinearities, due to the coupling from the rotational motion to the translational motion. Experimental results confirm that this approach can effectively condense the whole nonlinearities, uncertainties, and disturbances within the system into a favorable perturbation block.

Numerical Simulation of Free Surface Flow Using a Refined HRIC VOF Method (개선된 HRIC VOF 법에 의한 자유수면 유동해석)

  • Park, II-Ryong;Kim, Kwang-Soo;Kim, Jin;Van, Suak-Ho
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.47 no.3
    • /
    • pp.279-290
    • /
    • 2010
  • In this paper, a VOF method called RHRIC (refined high resolution intertace capturing) is introduced for solving the motion of the free surface and applied to the simulation of the advection of rigid interiaces of different shapes and a 20 dam-break problem, which are typical benchmark test cases. The numerical results for the interface advection cases are compared to the analytic solutions, while the available experimental data and other numerical results of various free surface methods for the dam-break problem are provided for the validation of the proposed VOF method. The same simulations were also carried out using the original HRIC scheme and a modified HRIC scheme called MHRIC for comparison. Although the RHRIC uses a simple order scheme, a basis of the original HRIC scheme, lower than the third-order ULTIMATE-QUICKEST used by the MHRIC, it provides an improved accuracy over the two previous HRIC methods.