• 한국공간구조학회논문집
• /
• 제24권3호
• /
• pp.43-51
• /
• 2024

Dynamic responses of nuclear power plant structure subjected to earthquake loads should be carefully investigated for safety. Because nuclear power plant structure are usually constructed by material of reinforced concrete, the aging deterioration of R.C. have no small effect on structural behavior of nuclear power plant structure. Therefore, aging deterioration of R.C. nuclear power plant structure should be considered for exact prediction of seismic responses of the structure. In this study, a machine learning model for seismic response prediction of nuclear power plant structure was developed by considering aging deterioration. The OPR-1000 was selected as an example structure for numerical simulation. The OPR-1000 was originally designated as the Korean Standard Nuclear Power Plant (KSNP), and was re-designated as the OPR-1000 in 2005 for foreign sales. 500 artificial ground motions were generated based on site characteristics of Korea. Elastic modulus, damping ratio, poisson's ratio and density were selected to consider material property variation due to aging deterioration. Six machine learning algorithms such as, Decision Tree (DT), Random Forest (RF), Support Vector Machine (SVM), K-Nearest Neighbor (KNN), Artificial Neural Networks (ANN), eXtreme Gradient Boosting (XGBoost), were used t o construct seispic response prediction model. 13 intensity measures and 4 material properties were used input parameters of the training database. Performance evaluation was performed using metrics like root mean square error, mean square error, mean absolute error, and coefficient of determination. The optimization of hyperparameters was achieved through k-fold cross-validation and grid search techniques. The analysis results show that neural networks present good prediction performance considering aging deterioration.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.247-250
• /
• 2001

In this paper, we propose an growing and pruning algorithm to design the adaptive structure of modular wavelet neural network(MWNN) with F-projection and geometric growing criterion. Geometric growing criterion consists of estimated error criterion considering local error and angle criterion which attempts to assign wavelet function that is nearly orthogonal to all other existing wavelet functions. These criteria provide a methodology that a network designer can constructs wavelet neural network according to one's intention. The proposed growing algorithm grows the module and the size of modules. Also, the pruning algorithm eliminates unnecessary node of module or module from constructed MWNN to overcome the problem due to localized characteristic of wavelet neural network which is used to modules of MWNN. We apply the proposed constructing algorithm of the adaptive structure of MWNN to approximation problems of 1-D function and 2-D function, and evaluate the effectiveness of the proposed algorithm.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권1호
• /
• pp.53-59
• /
• 2017

Optical character recognition (OCR) automatically recognizes text in an image. OCR is still a challenging problem in computer vision. A successful solution to OCR has important device applications, such as text-to-speech conversion and automatic document classification. In this work, we analyze character recognition performance using the current state-of-the-art deep-learning structures. One is the AlexNet structure, another is the LeNet structure, and the other one is the SPNet structure. For this, we have built our own dataset that contains digits and upper- and lower-case characters. We experiment in the presence of salt-and-pepper noise or Gaussian noise, and report the performance comparison in terms of recognition error. Experimental results indicate by five-fold cross-validation that the SPNet structure (our approach) outperforms AlexNet and LeNet in recognition error.

• Earthquakes and Structures
• /
• 제6권3호
• /
• pp.301-316
• /
• 2014

This paper is devoted to investigate the effects of SSI on strength reduction factor of multistory buildings. A new formula is proposed to estimate strength reduction factors for MDOF structure-soil systems. It is concluded that SSI reduces the strength reduction factor of MDOF systems. The amount of this reduction is relevant to the fundamental period of structure, soil flexibility, aspect ratio and ductility of structure, and could be significantly different from corresponding fixed-base value. Using this formula, measuring the amount of this error could be done with acceptable accuracy. For some practical cases, the error attains up to 50%.

• 전기학회논문지
• /
• 제57권1호
• /
• pp.128-136
• /
• 2008

In this paper, we propose a new cache structure for effective error correction of soft error. We added check bit and SEEB(soft error evaluation block) to evaluate the status of cache line. The SEEB stores result of parity check into the two-bit shit register and set the check bit to '1' when parity check fails twice in the same cache line. In this case the line where parity check fails twice is treated as a vulnerable to soft error. When the data is filled into the cache, the new replacement algorithm is suggested that it can only use the valid block determined by SEEB. This structure prohibits the vulnerable line from being used and contributes to efficient use of cache by the reuse of line where parity check fails only once can be reused. We tried to minimize the side effect of the proposed cache and the experimental results, using SPEC2000 benchmark, showed 3% degradation in hit rate, 15% timing overhead because of parity logic and 2.7% area overhead. But it can be considered as trivial for SEEB because almost tolerant design inevitably adopt this parity method even if there are some overhead. And if only parity logic is used then it can have $5%{\sim}10%$ advantage than ECC logic. By using this proposed cache, the system will be protected from the threat of soft error in cache and the hit rate can be maintained to the level without soft error in the cache.

• 한국인터넷방송통신학회논문지
• /
• 제12권5호
• /
• pp.107-114
• /
• 2012

본 논문은 기존 블라인드 등화기의 성능인 수렴 특성과 잔류 부호간 간섭의 영향을 경감시키기 위해 축소 신호점을 사용하고 비용 함수를 실수부와 허수부로 분리하여 처리하는 한 이중 구조 CR-CMA(Constellation Reduction CMA)에 관한 것이다. 기존의 CMA는 진폭만을 보상하고 위상은 보상을 하지 못하며, 이를 해결하기 위해 MCMA(Modified CMA)는 비용 함수만을 실수부와 허수부를 따로 처리하여 진폭과 위상을 보상하지만 진폭의 보상 능력과 초기 수렴 속도에서는 CMA보다 성능이 열악해지는 문제점이 있다. 제안하는 이중 구조 CR-CMA는 CMA와 MCMA(Modified CMA) 알고리즘 장점만을 살릴 수 있도록 비용 함수와 오차 함수를 실수부와 허수부로 나누어 처리하고 축소 신호점을 적용할 수 있도록 개량하여 진폭과 위상의 보상, 빠른 수렴 속도 및 잔류 ISI와 MD(Maximum Distortion) 량의 감소 그리고 MSE(Mean Square Error)와 양호한 심볼 오류율 (SER : symbol error ratio) 특성을 얻을 수 있음을 컴퓨터 시뮬레이션으로 확인하였다.

• 한국CDE학회논문집
• /
• 제17권4호
• /
• pp.282-293
• /
• 2012

This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.258-260
• /
• 2007

Nowadays the automotive circuit design becomes more complicated a practical modern car circuit usually contains thousands of wires. So the error connection between connector and pins becomes more difficult to be located. This paper proposes a general way to locate all error wires in an automotive circuit design. Firstly, we give an exact definition of error wire to guide our job. This definition also composes the core part of our algorithm. Then we limit the area of the error wires by several steps. During these steps, we apply breadth-first search method to step over all wires under consideration of reducing time cost. In addition, we apply bidirectional stack technique to organize the data structure for algorithm optimization. This algorithm can get a result with all error wires and doubtful wires in a very efficient way. The analysis of this algorithm shows that the complexity is linear. We also discuss some possible improvement of this algorithm.

• 동력기계공학회지
• /
• 제17권5호
• /
• pp.86-93
• /
• 2013

This paper proposes the used of genetic algorithm for optimizing PI controller and describes the dynamic modeling simulation for the permanent magnet synchronous motor driven by simplified vector control with the aid of MATLAB-Simulink environment. Furthermore, three kinds of error criterion minimization, integral absolute error, integral square error, and integral time absolute error, are used as objective function in the genetic algorithm. The modeling procedures and simulation results are described and presented in this paper. Computer simulation results indicate that the genetic algorithm was able to optimize the PI controller and gives good control performance of the system. Moreover, simplified vector control on permanent magnet synchronous motor does not need to regulate the direct axis component current. This makes simplified vector control of the permanent magnet synchronous motor very useful for some special applications that need simple control structure and low cost performance.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.167-176
• /
• 2007

In multimedia communication systems, efficient transmission system design should incorporate the use of matching unequal error protection (UEP), since source coders exhibit unequal bit error sensitivity. In this paper, we present UEP schemes which exploit differences in bit error protection levels in orthogonal frequency division multiplexing (OFDM) systems over frequency selective fading channels. We introduce an UEP scheme which improves the link performance with multiple transmit and receive antennas. Especially, we propose a new receiver structure based on two stage Maximum Likelihood detection (MLD) schemes which can approach the performance of a full search MLD receiver with much reduced computational complexity. In the performance analysis, we derive a generalized pairwise error probability expression for the proposed UEP schemes. Simulation results show that the proposed schemes achieve a significant performance gain over the conventional equal error protection (EEP) scheme.