• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.1
• /
• pp.15-22
• /
• 2002

This paper proposes a new power flow method for distribution system analysis by modifying the conventional back/forward sweep method using symmetrical components. Since the proposed method backward and forward sweeps with the variables expressed by symmetrical components, this method reduces computation time for matrix calculations; therefore, it is able to reduce the computational burden for real-time distribution network analysis. The proposed method was also developed to effectively analyze the unbalanced distribution system installing AVR(Auto Voltage Regulator), shunt capacitors. The proposed algorithm was compared with the conventional Back/forward Sweep method by applying both methods to three phase unbalanced distribution system of IEEE 123-bus model, and the test results showed that the proposed method would outperformed the conventional method in real-time distribution system analysis.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.7
• /
• pp.166-175
• /
• 1989

In this paper, we present a method which is based on the concept of the rotation of subspaces. This method is highly related to the angle (or distance) between subspaces arising in many applications. An effective procedures is first derived for finding the optimal transformation matrix which rotates one subspace into another as closely as possible in the least squares sense , and then this algorithm is applied to the solution to general direction-of-arrival estimation problem of multiple broadband plane waves which may be a mixture of incoherent, partially coherent or coherent. In this typical application, the rotation of signal subspaces (ROSS) algorithm is effectively developed to achieve the high performance in the active systems for the case in which the noise field remains invariant with the measurement of the array spectral density matrix (or data matrix). It is not uncommon to observe this situation in sonar systems. The advantage of this techniques is not to require the preliminary processing and spatial prefiltering which is used in Wang-Kaveh's CSS focusing method. Furthermore, the array's geometry is not restricted. Simulation results are presented to illustrate the high performance achieved with this new approach relative to that obtained with Wang-Kaveh's CSS focusing method for incoherent sources and forward-backward spatial smoothed MUSIC for coherent sources including the signal eigenvector method (SEM).

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.629-632
• /
• 2007

While conventional interferometric SAR (InSAR) technique is an excellent tool for displacement observation, it is only sensitive to one-dimensional deformation along the satellite's line-of-sight (LOS). Recently, a multiple aperture interferogram (MAI) technique has been developed to overcome this drawback. This method successfully extracted along-track displacements from InSAR data, based on split-beam InSAR processing, to create forward- and backward- looking interferograms, and was superior to along-track displacements derived by pixel-offset algorithm. This method is useful to measure along-track displacements. However, it does not only decrease the coherence of MAI because three co-registration and resampling procedures are required for producing MAI, but also is confined to a suitable interferometric pair of SAR images having zero Doppler centroid. In this paper, we propose an efficient and robust method to generate MAI from interferometric pair having non-zero Doppler centroid. The proposed method efficiently improves the coherence of MAI, because the co-registration of forward- and backward- single look complex (SLC) images is carried out by time shift property of Fourier transform without resampling procedure. It also successfully removes azimuth flat earth and topographic phases caused by the effect of non-zero Doppler centroid. We tested the proposed method using ERS images of the Mw 7.1 1999 California, Hector Mine Earthquake. The result shows that the proposed method improved the coherence of MAI and generalized MAI processing algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.71-79
• /
• 1990

In this paper, the Double Shortest Arborescence & Merging method is presented as an efficient heuristic algorithm for the Public Vehicle Routing Problem which is to find the minimum total cost routes of M or less vehicles to traverse the required arcs(demand streets) at least once and return to their starting depot on a directed network. Double Shortest Arborescence which consists of forward shortest aborescence and backward one informs M or less shortest routes to traverse all required arcs. The number of these routes is reduced to M or less by merging routes. The computational experiment based on randomly generated networks reports that this algorithm is efficient.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.594-596
• /
• 2006

In this thesis, we propose a algorithm that is able to detect a user's motion. A minute noise of accelerometer arises cumulative error in case of converting velocity and distance, which makes it difficult to detect movement of sensor. We use a lowpass filter, ALS algorithm, and motion detection block to minimize such cumulative error. we experiment using a motion-detective module which is composed of accelerometer, micro-controller, and serial interface. Our scheme is capable of detecting such as up, down, left, right, forward, and backward movement of the module. It is expected that our scheme is applied to a game controller or user interface of a next generation PC.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.408-414
• /
• 2011

The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.134-138
• /
• 2002

The human faces do not have distinct features unlike other general objects. In general the features of eyes, nose and mouth which are first recognized when human being see the face are defined. These features have different characteristics depending on different human face. In this paper, We propose a face recognition algorithm using the hidden Markov model(HMM). In the preprocessing stage, we find edges of a face using the locally adaptive threshold scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability values calculated by the HMM to input data. Then the input face is recognized by the euclidean distance of face feature vector and the cross-correlation between the input image and the database image. Computer simulation shows that the proposed HMM algorithm gives higher recognition rate compared with conventional face recognition algorithms.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.509-512
• /
• 1995

The relaying algorithm to calculate the fault distance from only transient signal at faults in T/L is presented. In this paper. At faults the oscillation frequency components exist in both voltage and current and these components minimize the input impedance shown in fault point. The equivalent source impedance shown in relaying point is needed to calculate the fault distance using these components. To source impedance, the reflection coefficient between forward wave and backward and the Prony's analysis is also employed to extract the oscillation frequency component from transient signals. The case study show that the new distance relaying algorithm satisfies the high operation speed and high accuracy even if the algorithm uses only transient signals.

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

In this paper, we propose a face recognition algorithm using the hidden markov model and neural networks (HMM-NN). In the preprocessing stage, we find edges of a face using the locally adaptive threshold (LAT) scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In the training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability vlaues calculated by the HMM to subsequent neural networks (NN) as input data. Computer simulation shows that the proposed HMM-NN algorithm gives higher recognition rate compared with conventional face recognition algorithms.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.817-825
• /
• 2019

Difference equation is useful for control algorithm in the microprocessor. To approximate a derivative values from sampled data, it is used the methods of forward, backward and central differences. The key of computing discrete derivative values is the finite difference coefficient. The focus of this paper is a new approach method of finite difference formula. And we apply the proposed method to the recursive least squares(RLS) algorithm.