• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.15 no.3
• /
• pp.219-230
• /
• 2017

This study was conducted to predict and evaluate the uncertainty of safety after closure of the second phase surface disposal facility of the Gyeongju intermediate and low level repository in Korea. In this study, four scenarios are developed considering both intact and degraded states of multi-layered covers and disposal containers; also, the fluid flow by a rainfall into the disposal facility is simulated. The rainfall conditions are implemented based on the monthly average data of the past 30 years (1985~2014); the simulation period is 300 years, the management period regulated by institutional provisions. As a result of the evaluation of the basic scenario, in which the integrity of both of the containers and the covers is maintained, it was confirmed that penetration of rainfall does not completely saturate the inside of the disposal facility. It is revealed that the multiple cover layers and concrete containers effectively play the role of barrier against the permeation of rainfall.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.116-123
• /
• 2009

Feature point matching, which is finding the corresponding points from two images with different viewpoint, has been used in various vision-based applications and the demand for the real-time operation of the matching is increasing these days. This paper presents a real-time feature point matching method by using a local descriptor derived by Zernike moments. From an input image, we find a set of feature points by using an existing fast corner detection algorithm and compute a local descriptor derived by Zernike moments at each feature point. The local descriptor based on Zernike moments represents the properties of the image patch around the feature points efficiently and is robust to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions with fixed size in advance and store them in lookup tables. The initial matching results are acquired by an Approximate Nearest Neighbor (ANN) method and false matchings are eliminated by a RANSAC algorithm. In the experiments we confirmed that the proposed method matches the feature points in images with various transformations in real-time and outperforms existing methods.

• Computational Structural Engineering
• /
• v.4 no.1
• /
• pp.20-27
• /
• 1991

본 논문에서는 유체-구조 상호작용해석의 일종의 3차원 접수구조물의 진동해석을 효과적으로 수행하기 위한 해석방법을 제시하기 위하여 동적재해석기법을 검토하였다. 접수구조물의 유한구조 상호작용해석 결과는 구조진동의 관심 주파수역에서는 3차원 연성 부가수질량으로 표현되는 관성력으로 나타난다. 따라서 구조질량행렬에 부가수질량 행렬이 더해져서 전체 관성력으로 표현된다. 이 부가수질량을 추가질량으로 보고 재해석기법을 응용하는 방법을 수치실험을 통해 검증하였다. 이 때 재해석기법이 갖추어야 할 조건은 원구조의 질량과 거의 같은 정도의 질량이 추가되고 또한 완전 연성질량이 추가된 경우에도 정확한 해를 주어야 한다는 것이다. 이를 검증하기 위해 직접재해석기법과 섭동법을 이용한 재해석기법으로 4질량 스프링지지구조에 대한 해석을 수행한 결과 직접재해석기법의 응용이 적합함을 쉽게 입증할 수 있었다. 접수구조물의 예로는 3차원 잠수주상체에 대해 접수진동해석을 수행하였으며 그 결과 선체진동해석에 전통적으로 이용되고 있는 2차원 부가수질량과 3차원 수정계수를 사용한 기준차수법에서는 수지모드와 수평-비틔 연성모드와 같이 서로 독립적인 모드에 대해서는 따로 진동해석을 수행해 주어야 하는 단점이 발견되었다. 이 단점을 보완한 각 모드의 3차원 수정계수행렬을 이용한 재해석기법을 도입하여 모드에 상관없이 동시에 해를 구할 수 있었다. 그러나, 이 방법은 3차원 수정계수가 구해져 있는 경우에 한해서만 적용가능하며 실제 선체진동의 경우에는 10Hz 미만의 저차 주선체 진동에 한해서만 적용가능한 방법이다. 고차의 진도옴드에는 3차원 수정계수를 구할 수 없기 때문에 유체-구조 상호작용 해석결과로부터 얻은 3차원 연성 부가수질량을 이용하게 되며 이 때 이 행렬이 접수구조 표면의 전 자유도와 연성되어 있기 때문에 방대한 방정식을 푸어야 하지만 직접재해석기법을 적용함으로써 정확한 해를 구할 수 있었다. 또한 3차원 부가수질량을 이용한 직접재해석기법은 종래의 2차원 부가수질량과 3차원 수정계수를 이용한 방법에 비해 해석시간 면에서도 전혀 불리한 점이 없는 경제적 방법임이 밝혀졌다. 앞으로 Slamming 혹은 수중폭파 등의 충격하중에 의한 천이 구조응답 해석을 위한 효과적인 방법에 대해서도 연구결과를 발표할 계획이다.

• Nuclear Engineering and Technology
• /
• v.25 no.1
• /
• pp.148-153
• /
• 1993

A fifth-order Fourier series technique is applied in Core Operating Limit Supervisory System (COLSS) to construct the on-line core average axial power shape from in-core detector signals because of its simplicity and fast computation. Such a synthesizing accuracy depends on number of Fourier series modes and axial boundary conditions. COLSS currently uses the five-mode Fourier series technique which utilizes the five axially located fixed in-core detector signals and a constant axial boundary condition. Therefore, the constant axial boundary condition should be appropriately chosen based on the evaluation of its effect on the accuracy of the on-line calculations. The four cases of axial buckling (0.75, 0.8, 0.9 and 1.0) were examined for Yonggwang Nuclear Units 3&4 as the axial boundary conditions in this paper. The core average axial power shapes and the operating margins were compared for each case to determine the optimal constant axial buckling. The axial buckling of 0.9 was found to be the optimal value.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10A
• /
• pp.809-815
• /
• 2011

In this paper, we have proposed and implemented a novel architecture which can be used to effectively design the modified Euclidean (ME) algorithm for key equation solver (KES) block in high-speed Reed-Solomon (RS) decoder. With polynomial expressions of newly-defined state variables for controlling each processing element (PE), the proposed architecture has simple input/output signals and requires less hardware complexity because no degree computation circuits are needed. In addition, since each PE circuit is independent of the error correcting capability t of RS codes, it has the advantage of linearly increase of the hardware complexity of KES block as t increases. For comparisons, KES block for RS(255,239,8) decoder is implemented using Verilog HDL and synthesized with 0.13um CMOS cell library. From the results, we can see that the proposed architecture can be used for a high-speed RS decoder with less gate count.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.69-76
• /
• 2015

In this paper, we propose and analyze a M-ary transmission scheme in time hopping ultra-wide band(UWB) system using mutually orthogonal modified Hermite polynomial(MHP) pulses. The proposed M-ary transmission scheme employs the orthogonal property between different ordered pulses and N data bits make the M-ary signals by linear combination of M MHP pluses. The theoretical analysis and simulation results show that the proposed system has better performance and higher data rate than conventional M-ary UWB system. We derive the general form of correlation function for MHP pulses and analyze bit error rate(BER) performance over additive white Gaussian noise(AWGN) with the presence of timing jitter. We show that the proposed system has the improved BER performance and robustness to timing jitter and low power spectrum density compared with conventional M-ary UWB system.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.3
• /
• pp.31-40
• /
• 2001

Low-order panel methods are being used to design marine propellers. Since the potential value over each panel for these methods is assumed to be a constant, the accuracy of prediction is known to be limited. Therefore, a higher order boundary element method(HOBEM) has been studied to enhance the accuracy of prediction. In this paper, a HOBEM representing the body boundary surfaces and physical quantities by a 9-node Lagrangian shape function is employed to analyse the flow around marine propellers in steady potential flow. First, the numerical results for a circular wing with thickness variations are compared with Jordan's linear solution. Then, the computational results of two propellers(DTRC 4119 & DTRC 4842 propeller) are compared with the experimental and numerical results published. The pressure distribution on the surface of the propeller is also compared with experimental data.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.3
• /
• pp.41-48
• /
• 2004

Finite field multiplication and division are important arithmetic operation in error-correcting codes and cryptosystems. The elements of the finite field GF($2^m$) are represented by bases with a primitive polynomial of degree m over GF(2). We can be easily realized for multiplication or computing multiplicative inverse in GF($2^m$) based on a normal basis representation. The number of product terms of logic function determines a complexity of the Messay-Omura multiplier. A normal basis exists for every finite field. It is not easy to find the optimal normal element for a given primitive polynomial. In this paper, the generating method of normal basis is investigated. The normal bases whose product terms are less than other bases for multiplication in GF($2^m$) are found. For each primitive polynomial, a list of normal elements and number of product terms are presented.