• Structural Engineering and Mechanics
• /
• v.34 no.1
• /
• pp.1-14
• /
• 2010

The innovative intelligent fuzzy weighted input estimation method which efficiently and robustly estimates the unknown time-varying input force in on-line is presented in this paper. The algorithm includes the Kalman Filter (KF) and the recursive least square estimator (RLSE), which is weighted by the fuzzy weighting factor proposed based on the fuzzy logic inference system. To directly synthesize the Kalman filter with the estimator, this work presents an efficient robust forgetting zone, which is capable of providing a reasonable compromise between the tracking capability and the flexibility against noises. The capability of this inverse method are demonstrated in the input force estimation cases of the plate structure system. The proposed algorithm is further compared by alternating between the constant and adaptive weighting factors. The results show that this method has the properties of faster convergence in the initial response, better target tracking capability, and more effective noise and measurement bias reduction.

• Structural Engineering and Mechanics
• /
• v.30 no.3
• /
• pp.351-368
• /
• 2008

The purpose of this paper is to propose a simple analysis method of axial deformation of base-isolation rubber bearings in a building subjected to earthquake loading and present its applicability to the analysis of the bound of the aspect ratio of base-isolated buildings. The base shear coefficient is introduced as a key parameter for the bound analysis. The bound of the aspect ratio of base-isolated buildings is analyzed based on the relationship of the following four quantities; (i) ultimate state of the tensile stress of rubber bearings based on a proposed simple recursive analysis for seismic loading, (ii) ultimate state of drift of the base-isolation story for seismic loading, (iii) ultimate state of the axial compressive stress of rubber bearings under dead loads, (iv) prediction of the overturning moment at the base for seismic loading. In particular, a new recursive analysis method of axial deformation of rubber bearings is presented taking into account the nonlinear tensile behavior of rubber bearings and it is shown that the relaxation of the constraint on the ultimate state of the tensile stress of rubber bearings increases the limiting aspect ratio.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3
• /
• pp.81-85
• /
• 1997

In this paper, a recursive estimation algorithm for FIR systems is proposed using the 3rd and 4th order cumulants. To obtain the Overdetermined Recursive Instrumental Variable(ORIV) method type algorithm, we transform the 3'th and 4'th order cumulant relationship to a certain matrix form which is consist of only output data. From the matrix form, we induce the proposed algorithm procedure following the ORIV method. The proposed algorithm provides improved estimation accuracy with smaller data and can be applied to a time varying system as well. In addition, it reduces the estimation error due to the additive Gaussian noise compared to conventional 2'rd order based algorithms since it only uses higher than 2'rd order cumulant. Simulation results are presented to compare the performance with other HOS-based algorithms.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• Journal of Auto-vehicle Safety Association
• /
• v.16 no.2
• /
• pp.51-59
• /
• 2024

This study presents a method for health monitoring of rotating objects for mobility based on multiple recursive least squares(RLS) algorithms. The performance degradation of the rotating objects causes low handing / low driving performances and even fatal accidents. Therefore, health monitoring algorithm of rotating objects is one of the important technologies for mobility fail-safe and maintenance areas. In order for health monitoring of rotating objects, four recursive least squares algorithms with forgetting factor were designed in this study. The health monitoring algorithm proposed in this study consists of two steps such as uncertainty estimation and parameter changes estimation. In order to improve estimation accuracy, time delay function was applied to the estimated signals based on the first order differential equation and forgetting factors used for the RLS were reasonably tuned. The health monitoring algorithm was constructed in Matlab/Simulink environment and simulation-based performance evaluation was conducted using DC motor model. The evaluation results showed that the proposed algorithm estimates the actual parameter differences reasonably using velocity and current information.

• Korean Journal of Construction Engineering and Management
• /
• v.22 no.3
• /
• pp.21-30
• /
• 2021

This study proposes a 5-month rebar price prediction method using the recursive prediction method of deep learning. This approach predicts a long-term point in time by repeating the process of predicting all the characteristics of the input data and adding them to the original data and predicting the next point in time. The predicted average accuracy of the rebar prices for one to five months is approximately 97.24% in the manner presented in this study. Through the proposed method, it is expected that more accurate cost planning will be possible than the existing method by supplementing the systematicity of the price estimation method through human experience and judgment. In addition, it is expected that the method presented in this study can be utilized in studies that predict long-term prices using time series data including building materials other than rebar.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.2
• /
• pp.124-129
• /
• 2002

This paper demonstrates that the largest Lyapunov exponent λ of recurrent neural networks can be controlled efficiently by a stochastic gradient method. An essential core of the proposed method is a novel stochastic approximate formulation of the Lyapunov exponent λ as a function of the network parameters such as connection weights and thresholds of neural activation functions. By a gradient method, a direct calculation to minimize a square error (λ - λ$\^$obj/)$^2$, where λ$\^$obj/ is a desired exponent value, needs gradients collection through time which are given by a recursive calculation from past to present values. The collection is computationally expensive and causes unstable control of the exponent for networks with chaotic dynamics because of chaotic instability. The stochastic formulation derived in this paper gives us an approximation of the gradients collection in a fashion without the recursive calculation. This approximation can realize not only a faster calculation of the gradient, but also stable control for chaotic dynamics. Due to the non-recursive calculation. without respect to the time evolutions, the running times of this approximation grow only about as N$^2$ compared to as N$\^$5/T that is of the direct calculation method. It is also shown by simulation studies that the approximation is a robust formulation for the network size and that proposed method can control the chaos dynamics in recurrent neural networks efficiently.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.8
• /
• pp.1492-1501
• /
• 2011

A wide-area protection intelligent technique has been used to improve a reliability in power systems and to prevent a blackout. Nowadays, voltage and current phasor estimation has been executed by GPS-based synchronized PMU, which has become an important way of wide-area blackout protection for the prevention of expending faults in power systems. As this technique has the difficulties in collecting and sharing of information, there have been used a FNET method for the wide-area intelligent protection. This technique is very useful for the prediction of the inception fault and for the prevention of fault propagation with accurate monitoring frequency and frequency deviation. It consists of FDRs and IMS. It is well known that FNET can detect the dynamic behavior of system and obtain the real-time frequency information. Therefore, FDRs must adopt a optimal frequency estimation method that is robust to noise and fault. In this paper, we present comparative studies for the frequency estimation method using IRDWT(improved recursive discrete wavelet transform), for the frequency estimation method using FRDWT(fast recursive discrete wavelet transform). we used the Republic of Korea 345kV power system modeling data by EMTP-RV. The user-defined arbitrary waveforms were used in order to evaluate the performance of the proposed two kinds of RDWT. Also, the frequency variation data in various range, both large range and small range, were used for simulation. The simulation results showed that the proposed frequency estimation technique using FRDWT can be the optimal frequency measurement method applied to FDRs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3093-3115
• /
• 2020

Network anomaly detection system plays an essential role in detecting network anomaly and ensuring network security. Anomaly detection system based machine learning has become an increasingly popular solution. However, due to the unbalance and high-dimension characteristics of network traffic, the existing methods unable to achieve the excellent performance of high accuracy and low false alarm rate. To address this problem, a new network anomaly detection method based on data balancing and recursive feature addition is proposed. Firstly, data balancing algorithm based on improved KNN outlier detection is designed to select part respective data on each category. Combination optimization about parameters of improved KNN outlier detection is implemented by genetic algorithm. Next, recursive feature addition algorithm based on correlation analysis is proposed to select effective features, in which a cross contingency test is utilized to analyze correlation and obtain a features subset with a strong correlation. Then, random forests model is as the classification model to detection anomaly. Finally, the proposed algorithm is evaluated on benchmark datasets KDD Cup 1999 and UNSW_NB15. The result illustrates the proposed strategies enhance accuracy and recall, and decrease the false alarm rate. Compared with other algorithms, this algorithm still achieves significant effects, especially recall in the small category.

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

In this paper, we propose a novel approach to improve the performance of minima controlled recursive averaging (MCRA) which is based on the second-order conditional maximum a posteriori (CMAP). From an investigation of the MCRA scheme, it is discovered that the MCRA method cannot take full consideration of the inter-frame correlation of voice activity since the noise power estimate is adjusted by the speech presence probability depending on an observation of the current frame. To avoid this phenomenon, the proposed MCRA approach incorporates the second-order CMAP criterion in which the noise power estimate is obtained using the speech presence probability conditioned on both the current observation and the speech activity decisions in the previous two frames. Experimental results show that the proposed MCRA technique based on second-order conditional MAP yields better results compared to the conventional MCRA method.