• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.49-61
• /
• 1996

Back-propagation(BP) algorithm needs a lot of time to train the artificial neural network (ANN) to get high accuracy level in classification tasks. So there have been extensive researches to process back-propagation algorithm on parallel processors. This paper prsents a linear systolic array which calculates forward-backward propagation of BP algorithm at the same time using effective space-time transformation and PE structure. First, we analyze data flow of forwared and backward propagations and then, represent the BP algorithm into data dapendency graph (DG) which shows parallelism inherent in the BP algorithm. Next, apply space-time transformation on the DG of ANN is turn with orthogonal direction projection. By doing so, we can get a snakelike systolic array. Also we calculate the interval of input for parallel processing, calculate the indices to make the right datas be used at the right PE when forward and bvackward propagations are processed in the same PE. And then verify the correctness of output when forward and backward propagations are executed at the same time. By doing so, the proposed system maximizes parallelism of BP algorithm, minimizes th enumber of PEs. And it reduces the execution time by 2 times through making idle PEs participate in forward-backward propagation at the same time.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.514-519
• /
• 2009

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimates the signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. FE-PAST (Forward-Backward PAST) is one of the results from the improvement studies. In this paper, we propose a new algorithm to improve the orthogonality of the FB-PAST (Forward-Backward PAST).

• IE interfaces
• /
• v.17 no.spc
• /
• pp.141-151
• /
• 2004

As today's business environment has become more and more competitive, forward as well as backward flows of products among members belonging to a supply chain have been increased. The backward flows of products, which are common in most industries, result from increasing amount of products that are returned, recalled, or need to be repaired. Effective management for the backward flows of products has become an important issue for businesses because of opportunities for simultaneously enhancing profitability and customer satisfaction from returned products. Since third party logistics service providers (3PLs) are playing an important role in reverse logistics operations, they should perform two simultaneous logistics operations for a number of different clients who want to improve their logistics operations for both forward and reverse flows. In this case, distribution networks have been independently designed with respect to either forward or backward flows so far. This paper proposes a mixed integer programming model for the design of network integrating both forward and reverse logistics. Since the network design problem belongs to a class of NP-hard problems, we present an efficient heuristic algorithm based on genetic algorithm (GA), of which the performance is compared to the lower bound by Lagrangian relaxation. Finally, the validity of proposed algorithm is tested using numerical examples.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.437-442
• /
• 2005

The measurement of RTT (Round Trip Time) can be used for the analysis of Internet congestion. However, simple measuring of RTT which measures only hun around time of a packet can not infer a packet forward/backward delay variation. In this thesis, we present a new algorithm which can be used for the estimation of forward/backward delay variation of packets. These delay variations are implication of network congestion state. In this algorithm, the reference forward/backward delay can be determined based on the minimum RTT value. The delay variation of each packet can be calculated by comparing reference delay with the packet delay. We verified our proposed algorithm by NS-2 simulation and delay measuring in a real network.

• Industrial Engineering and Management Systems
• /
• v.12 no.4
• /
• pp.380-388
• /
• 2013

Large variation in electrocardiogram (ECG) waveforms continues to present challenges in defining R-wave locations in ECG signals. This research presents a procedure to extract the R-wave locations by forward-backward (FB) algorithm and classify the arrhythmic beat conditions by using RR intervals. The FB algorithm shows forward and backward searching rules from QRS onset and eliminates lower-amplitude signals near the baseline using a statistical process control concept. The proposed algorithm was trained the optimal parameters by using MIT-BIH arrhythmia database (MITDB), and it was verified by actual Holter ECG signals from a local hospital. The signals are classified into normal (N) and three arrhythmia beat types including premature ventricular contraction (PVC), ventricular flutter/fibrillation (VF), and second-degree heart block (BII) beat. This work produces 98.54% accuracy in the detection of R-wave location; 98.68% for N beats; 91.17% for PVC beats; and 87.2% for VF beats in the collected Holter ECG signals, and the results are better than what are reported in literature.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.442-446
• /
• 2004

This paper propose scene change detection algorithm using coefficient of forward prediction macro-block, backward prediction macro-block, and intra-coded macro-block on getting motion estimation. Proposed method detect scene change with correlation according picture type forward two picture or forward and backward two picture on video sequences. Proposed algorithm is high accuracy and can detect all scene change on video, and detect to occur scene change on P, B, I-picture.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.11
• /
• pp.984-990
• /
• 2002

We propose a new type of nonlinear fixed interval smoother to which an existing nonlinear smoother is modified. The nonlinear smoother is derived from two-filter formulas. For the backward filter. the propagation and the update equation of error states are derived. In particular, the modified update equation of the backward filter uses the estimated error terms from the forward filter. Data fusion algorithm, which combines the forward filter result and the backward filter result, is altered into the compatible form with the new type of the backward filter. The proposed algorithm is more efficient than the existing one because propagation in backward filter is very simple from the implementation point of view. We apply the proposed nonlinear smoothing algorithm to off-line navigation system and show the proposed algorithm estimates position, and altitude fairly well through the computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1425-1429
• /
• 1996

A conventional sequence search algorithm for PRI analysis occurs the harmonic problem under missing pulses. An improved PRI analysis algorithm is proposedto remedy the harmonic problem. After dividing an overall PRI range into subbands withoug harmonic, a sequence search is done into forward and backward in time. The proposed algorithm increases the preformance compared with that of conventional sequence search algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1326-1337
• /
• 1995

In this paper, we transformed the bilinear filter into an equivalent linear multichannel filter and derived QR decomposition based recursive least squares algorithms for bilinear lattice filters. We also defined order update relation of the forward and the backward input vectors by using the channel decomposition. The forward and the backward data matrices were defined by using the forward and the backward input vectors and orthogonalized with the QR decomposition. we can obtain the lattice equations of the bilinear filters by using the channel decomposition. we can be derived the lattice equations of the bilinear filters using this decomposition process which are the same as the lattice equations derived by Baik, we can use the coefficient transformation algorithm proposed by Baik. We derived the equation error and the output error algorithm of the QRD based RLS bilinear lattice algorithm. Also, we evaluated the performance of the proposed algorithms through the system identification of the bilinear system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.5
• /
• pp.314-326
• /
• 2016

The purpose of variable selection techniques is to select a subset of relevant variables for a particular learning algorithm in order to improve the accuracy of prediction model and improve the efficiency of the model. We conduct an empirical analysis to evaluate and compare seven well-known variable selection techniques for multiple linear regression model, which is one of the most commonly used regression model in practice. The variable selection techniques we apply are forward selection, backward elimination, stepwise selection, genetic algorithm (GA), ridge regression, lasso (Least Absolute Shrinkage and Selection Operator) and elastic net. Based on the experiment with 49 regression data sets, it is found that GA resulted in the lowest error rates while lasso most significantly reduces the number of variables. In terms of computational efficiency, forward/backward elimination and lasso requires less time than the other techniques.