• Nuclear Engineering and Technology
• /
• 제55권4호
• /
• pp.1428-1438
• /
• 2023

A novel Fission Diffusion Synthetic Acceleration (FDSA) method is developed and implemented as a part of a hybrid neutronics method for source convergence acceleration and variance reduction in Monte Carlo (MC) criticality calculations. The acceleration of the MC calculation stems from constructing a synthetic operator and solving a low-order problem using information obtained from previous MC calculations. By applying the P₁ approximation, two correction terms, one for the scalar flux and the other for the current, can be solved in the low-order problem and applied to the transport solution. A variety of one-dimensional (1-D) and two-dimensional (2-D) numerical tests are constructed to demonstrate the performance of FDSA in comparison with the standalone MC method and the coupled MC and Coarse Mesh Finite Difference (MC-CMFD) method on both intended purposes. The comparison results show that the acceleration by a factor of 3-10 can be expected for source convergence and the reduction in MC variance is comparable to CMFD in both slab and full core geometries, although the effectiveness of such hybrid methods is limited to systems with small dominance ratios.

• Nuclear Engineering and Technology
• /
• 제49권5호
• /
• pp.920-927
• /
• 2017

With ever-advancing computer technology, the Monte Carlo (MC) neutron transport calculation is expanding its application area to nuclear reactor transient analysis. Dynamic MC (DMC) neutron tracking for transient analysis requires efficient algorithms for delayed neutron generation, neutron population control, and initial condition modeling. In this paper, a new MC steady-state simulation method based on time-dependent MC neutron tracking is proposed for steady-state initial condition modeling; during this process, prompt neutron sources and delayed neutron precursors for the DMC transient simulation can easily be sampled. The DMC method, including the proposed time-dependent DMC steady-state simulation method, has been implemented in McCARD and applied for two-dimensional core kinetics problems in the time-dependent neutron transport benchmark C5G7-TD. The McCARD DMC calculation results show good agreement with results of a deterministic transport analysis code, nTRACER.

• 한국수소및신에너지학회논문집
• /
• 제34권5호
• /
• pp.447-455
• /
• 2023

SAE J2601, hydrogen fueling protocols, proposes two charging methods. The first is the table-based fueling protocol, and the second is the MC formula-based fueling protocol. Among them, MC formula-based fueling protocol calculates and supplies the target pressure and pressure ramp rate (PRR) using the pre-cooling temperature of the hydrogen and the physical parameters of the tank in the vehicle. The coefficient of the MC formula for deriving MC varies depending on the physical parameters of the tank in the vehicle. However, most studies use the MC coefficient derived from SAE J2601 as it is, despite the difference in the physical parameters of the tank applied to the study and the tank used to derive the MC coefficient from SAE J2601. In this study, the MC coefficient was derived by applying the hydrogen tank currently used, and the difference with the fueling performance using the MC coefficient proposed in SAE J2601 was verified. In addition, the difference was confirmed by comparing and analyzing the fueling performance of the table-based method currently used in hydrogen fueling stations and the MC formula-based method using MC coefficient derived in this study.

• 한국산업정보학회논문지
• /
• 제18권1호
• /
• pp.25-35
• /
• 2013

Automatically deriving only individual don't-care minterms that can effectively reduce a Boolean logic expressions are being investigated. Don't-care conditions play an important role in optimizing logic design. The type of unknown don't-care minterms that can always reduce the number of product terms in Boolean expression are referred as single hypothetical don't-care (S-HDC) minterms. This paper describes the Quasi Quine-McCluskey method that systematically derives S-HDC minterms. For the most part, this method is similar to the original Quine-McCluskey method in deriving the prime implicants. However, the Quasi Quine-McCluskey method further derives S-HDC minterms by applying so-called a combinatorial comparison operation. Upon completion of the procedure, the designer can review generated S-HDC minterms to test its appropriateness for a particular application.

• 한국인터넷방송통신학회논문지
• /
• 제21권6호
• /
• pp.43-48
• /
• 2021

MC-CDMA 기법에서 효과적인 주파수 자원을 사용하기 위한 부채널 간섭을 줄이기 위해서 FFT 기법대신에 2 채널 필터 뱅크 기법을 제안하였다. 웨이브렛 특성을 가지는 원형 필터 뱅크는 보다 적은 sidelobe를 가지도록 설계되므로 가장 가까운 상호채널 간섭과 부호간의 간섭은 효과적으로 감소된다. 제안하는 MC-CDMA 시스템의 확산신호는 보다 적은 chip rate가 요구되고 자기상관 특징을 고려하지 않는 Walsh 코드가 최적의 신호 세트로 사용된다. 우리는 백색잡음 채널과 임의의 정현파 방해자가 존재하는 조건하에서 제안된 시스템의 성능을 추정하기 위해서 비트 오차 속도와 신호대잡음비를 고려하였다. 기존의 FFT 기반의 MC-CDMA 모의시험 결과와 비교하여 제안된 시스템이 간섭 효과를 줄이는 관점에서 기존의 MC-CDMA 기법보다 좋은 성능을 나타냄을 증명하였다.

• Nuclear Engineering and Technology
• /
• 제48권3호
• /
• pp.765-772
• /
• 2016

In analyzing residual radiation, researchers generally use a two-step Monte Carlo (MC) simulation. The first step (MC1) simulates neutron transport, and the second step (MC2) transports the decay photons emitted from the activated materials. In this process, the stochastic uncertainty estimated by the MC2 appears only as a final result, but it is underestimated because the stochastic error generated in MC1 cannot be directly included in MC2. Hence, estimating the true stochastic uncertainty requires quantifying the propagation degree of the stochastic error in MC1. The brute force technique is a straightforward method to estimate the true uncertainty. However, it is a costly method to obtain reliable results. Another method, called the adjoint-based method, can reduce the computational time needed to evaluate the true uncertainty; however, there are limitations. To address those limitations, we propose a new strategy to estimate uncertainty propagation without any additional calculations in two-step MC simulations. To verify the proposed method, we applied it to activation benchmark problems and compared the results with those of previous methods. The results show that the proposed method increases the applicability and user-friendliness preserving accuracy in quantifying uncertainty propagation. We expect that the proposed strategy will contribute to efficient and accurate two-step MC calculations.

• Nuclear Engineering and Technology
• /
• 제50권7호
• /
• pp.1043-1050
• /
• 2018

For an efficient Monte Carlo (MC) burnup analysis, an accurate high-order depletion scheme to consider the nonlinear flux variation in a coarse burnup-step interval is crucial accompanied with an accurate depletion equation solver. In a Seoul National University MC code, McCARD, the high-order depletion schemes of the quadratic depletion method (QDM) and the linear extrapolation/quadratic interpolation (LEQI) method and a depletion equation solver by the Chebyshev rational approximation method (CRAM) have been newly implemented in addition to the existing constant extrapolation/backward extrapolation (CEBE) method using the matrix exponential method (MEM) solver with substeps. In this paper, the quadratic extrapolation/quadratic interpolation (QEQI) method is proposed as a new high-order depletion scheme. In order to examine the effectiveness of the newly-implemented depletion modules in McCARD, four problems in the VERA depletion benchmarks are solved by CEBE/MEM, CEBE/CRAM, LEQI/MEM, QEQI/MEM, and QDM for gadolinium isotopes. From the comparisons, it is shown that the QEQI/MEM predicts ${k_{inf}}^{\prime}s$ most accurately among the test cases. In addition, statistical uncertainty propagation analyses for a VERA pin cell problem are conducted by the sensitivity and uncertainty and the stochastic sampling methods.

• 한국컴퓨터정보학회논문지
• /
• 제19권3호
• /
• pp.109-117
• /
• 2014

본 논문은 회로 최소화 문제에 대한 Quine-McCluskey 법을 개선한 알고리즘을 제안하였다. Quine-McCluskey 법은 주 내포 항을 반복적인 방법으로 찾고, 회로 최소화 방법으로 시행착오법, 분기한정법 또는 Petrick 법을 적용한다. 반면에 제안된 알고리즘은 사전에 항표를 생성하여 주 내포 항을 간단히 찾는 방법을 제안하였으며, 집합피복을 결정하는 방법을 적용하여 1차와 2차 필수 주 내포 항을 간단히 찾는 방법을 제안하였다. 3-변수와 4-변수 실험 데이터에 적용한 결과 제안된 알고리즘이 Quine-McCluskey 법에 비해 보다 간단하면서도 정확히 해를 구할 수 있었다.

• Nuclear Engineering and Technology
• /
• 제54권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.

• 충청수학회지
• /
• 제20권1호
• /
• pp.31-35
• /
• 2007

In dealing with transformation group, topological approach is very natural. But, it is not sufficient to investigate geometric properties of transformation group and we need geometric method. Frankel-McDuff Conjecture is very interesting in the point that it shows struggling between topological method and geometric method. In this paper, the author suggest generalized Frankel-McDuff conjecture as a topological version of the conjecture and construct a counterexample for the generalized version, and from this we assert that topological method does not work for Frankel-McDuff Conjecture.