• Nuclear Engineering and Technology
• /
• v.55 no.10
• /
• pp.3515-3524
• /
• 2023

A reinforcement learning framework is proposed for the control problem of outlet steam pressure of the once-through steam generator(OTSG) in this paper. The double-layer controller using Proximal Policy Optimization(PPO) algorithm is applied in the control structure of the OTSG. The PPO algorithm can train the neural networks continuously according to the process of interaction with the environment and then the trained controller can realize better control for the OTSG. Meanwhile, reinforcement learning has the characteristic of difficult application in real-world objects, this paper proposes an innovative pretraining method to solve this problem. The difficulty in the application of reinforcement learning lies in training. The optimal strategy of each step is summed up through trial and error, and the training cost is very high. In this paper, the LSTM model is adopted as the training environment for pretraining, which saves training time and improves efficiency. The experimental results show that this method can realize the self-adjustment of control parameters under various working conditions, and the control effect has the advantages of small overshoot, fast stabilization speed, and strong adaptive ability.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.13 no.1
• /
• pp.617-627
• /
• 2021

Underwater Acoustic Channels (UAC) have inherent sparse characteristics. The traditional adaptive equalization techniques do not utilize this feature to improve the performance. In this paper we consider the Variable Adaptive Subgradient Projection (V-ASPM) method to derive a new sparse equalization algorithm based on the Minimum Symbol Error Rate (MSER) criterion. Compared with the original MSER algorithm, our proposed scheme adds sparse matrix to the iterative formula, which can assign independent step-sizes to the equalizer taps. How to obtain such proper sparse matrix is also analyzed. On this basis, the selection scheme of the sparse matrix is obtained by combining the variable step-sizes and equalizer sparsity measure. We call the new algorithm Sparse-Control Proportional-MSER (SC-PMSER) equalizer. Finally, the proposed SC-PMSER equalizer is embedded into a turbo receiver, which perform turbo decoding, Digital Phase-Locked Loop (DPLL), time-reversal receiving and multi-reception diversity. Simulation and real-field experimental results show that the proposed algorithm has better performance in convergence speed and Bit Error Rate (BER).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.155-159
• /
• 2014

In this paper, we describe algorithm and digital circuit implementation of touch screen controller that has the faster response time. We enhance the response time by adaptive search method instead of linear search method of step level in the pulse width decision. The faster response time might bring effects of feeling better in the touch keyboard. The performance of the proposed algorithm and function is verified by using logic simulation and FPGA test board. It is expected to use in the mobile touch screen.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.8
• /
• pp.1123-1129
• /
• 2012

This paper presents the fast steady state analysis using time-stepping finite element method for a high power three-phase transformer. The high power transformer spends huge computational cost of the time-stepping finite element method. It is because that the high power transformer requires a lot of time to reach steady state by its large inductance component. In order to reduce computational cost, in this paper, the adaptive time-step control algorithm combined with the embedded 2nd 4th singly diagonally implicit Runge-Kutta method and the analysis strategy using variation of the winding resistance are studied, and their numerical results are compared with those from the typical time-stepping finite element method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.4084-4104
• /
• 2021

Visual place recognition (VPR) is a fundamental yet challenging task of mobile robot navigation and localization. The existing VPR methods are usually based on some pairwise similarity of image descriptors, so they are sensitive to visual appearance change and also computationally expensive. This paper proposes a simple yet effective four-step method that achieves adaptive convolutional neural network (CNN) landmark matching for VPR. First, based on the features extracted from existing CNN models, the regions with higher significance scores are selected as landmarks. Then, according to the coordinate positions of potential landmarks, landmark matching is improved by removing mismatched landmark pairs. Finally, considering the significance scores obtained in the first step, robust image retrieval is performed based on adaptive landmark matching, and it gives more weight to the landmark matching pairs with higher significance scores. To verify the efficiency and robustness of the proposed method, evaluations are conducted on standard benchmark datasets. The experimental results indicate that the proposed method reduces the feature representation space of place images by more than 75% with negligible loss in recognition precision. Also, it achieves a fast matching speed in similarity calculation, satisfying the real-time requirement.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.49-57
• /
• 1994

An efficient approach for the computationtion of the optimum convergence factor is proposed for the LMS algorithm applied to a transversal FIR structure in this study. The approach automatically leads to an optimum step size algorithm at each weight in every iteration that results in a dramatic reduction in terms of convergence time. The algorithm is evaluated in system identification application where two alternative computer simulations are considered for time-invariant and time-varying system cases. The results show that the proposed algorithm needs not appropriate convergence factor and has better performance than AGC(Automatic Gain Control) algorithm and Karni algorithm, which require the convergence factors controlled arbitrarily in computer simulation for time-invariant system and time-varying systems. Also, itis shown that the proposed algorithm has the excellent adaptability campared with NLMS(Normalized LMS) algorithm and RLS (Recursive least Square) algorithm for time-varying circumstances.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.361-368
• /
• 2014

The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.26 no.2
• /
• pp.157-164
• /
• 2016

The paper studies a comparison analysis of semi-active control strategies for a Macpherson strut type suspension system consisting of MR(magneto-rheological) damper. As a first step, in order to formulate governing, a dynamic full model of a Macpherson strut is developed considering the kinematics. The nonlinear equation of motion of the strut is then linearized around the equilibrium point. A new adaptive moving sliding model controller is developed for fast response of the system. A newly proposed adaptive moving sliding mode control strategy is then compared with conventional sliding mode controller and skyhook controller. The comparison is made for two different types of road inputs; bump and random road profiles showing superior vibration control performance in time and frequency domains.

• The Journal of Korean Institute of Information Technology
• /
• v.15 no.12
• /
• pp.157-164
• /
• 2017

Mobile ECG signal measurement is a technique to measure small signals of several mV, and many studies have been conducted to remove noise including wandering scheme. Removal of the equipotential line noise caused by shaking or movement of the electrode cable is one of the core research contents for the electrocardiogram measurement. In this study, we proposed a modified step-size of combined NLMS(normalized least squares) and DLMS(delayed least squares) adaptive filter to eliminate baseline noise from ECG signals. The proposed method mainly adjusts initial filter step-size to reduce distortion of original ECG signals characteristic after eliminating baseline noise. The modified filter step-size is scaled by filter order size and distortion minimization factor. This method is suitable for portable ECG device with a small processor and less power consumption. This technique also decreases computation time which is essential for real-time filtering. The proposed filter also increase the signal to noise ratio (SNR) compared to conventional NLMS filter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.