• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.2
• /
• pp.184-194
• /
• 2016

In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1359-1360
• /
• 2015

본 논문에서는 FAST 코너점과 EMD를 이용한 다수의 이동물체 식별 알고리즘을 제안한다. 제안하는 방법은 먼저 영상 내의 이동물체를 추출하기 위한 기법으로 GMM을 기반으로 배경을 모델링 하며, 모델링 된 배경에서 추출된 이동물체를 인식하기 위해 라벨링 기법을 수행한다. 그 다음 인식된 다수의 이동물체 식별을 위해 FAST 코너점과 색상 기반의 EMD 알고리즘을 융합한 다수의 이동물체 식별 방법을 제안하며, 최종적으로, 실내 환경 내에서의 실험을 통해 제안한 방법의 응용 가능성을 증명한다.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.1-12
• /
• 2000

In this study, we deals with the implementation of an optimal basis identification procedure for interior point methods. Our implementation is based on Megiddo’s strongly polynomial algorithm applied to Andersen and Ye’s approximate LP construction. Several techniques are explained such as the use of effective indicator for obtaining optimal partition when constructing the approximate LP, the efficient implementation of the problem reduction technique proposed by Andersen, the crashing procedure needed for fast dual phase of Megiddo’s algorithm and the construction of the stable initial basis. By experimental comparison, we show that our implementation is superior to the crossover scheme implementation.

• Information and Communications Magazine
• /
• v.7 no.3
• /
• pp.27-34
• /
• 1990

The $(L,\psi)$ feature description on the binary boundary air craft image is introduced of classifying 3-D object (aircraft) identification. Three types for associative matrix memories are employed and tested for their classification performance. The fast association involved in these memories can be implemented using a parallel optical matrix-vector operation. Two associative memories are based on pseudoinverse solutions and the third one is interoduced as a paralell version of a nearest-neighbor classifier. Detailed simulation results for each associative processor are provided.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.3-6
• /
• 2004

In this paper, the problem of identifying a time-varying nonlinear system in an adaptive way was considered, whereby the time-varying second-order Volterra series was employed to model the system and the filtered weighted least squares (FWLS) algorithm was utilized for the fast parameter tracking capability with low computational burden. Finally, the performance of the proposed approach was demonstrated by providing some computer simulation results.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.311-315
• /
• 2007

This paper proposes a revised query tree algorithm in RFID systems. The proposed QT_ecfi algorithm revises the QT algorithm, which has a memory-less property. In the QT_ecfi algorithm, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. When the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ecfi algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.869-877
• /
• 2011

In this paper, we propose an efficient two-flow zero-knowledge blind identification protocol on the elliptic curve cryptographic (ECC) system. A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. But our protocol is secure under such attacks because of using the hash function. In particular, it is fast because we don't use the pairing operation and consists of only two message flows. It does not rely on any underlying signature or encryption scheme. Our protocol is secure assuming the hardness of the Discrete-Logarithm Problem in bilinear groups.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.3
• /
• pp.40-49
• /
• 1992

In this paper, an approach to identify fuzzy rules is proposed. The decision of the optimal number of fuzzy rule is made by means of fuzzy c-means clustering. The identification of the parameters of fuzzy implications is carried out by use of genetic algorithms. For the efficinet and fast parameter identification, the reduction thechnique of search areas of genetica algorithms is proposed. The feasibility of the proposed approach is evaluated through the identification of the fuzzy model to describe an input-output relation of Gas Furnace. Despite the simplicity of the propsed apprach the accuracy of the identified fuzzy model of gas furnace is superior as compared with that of other fuzzy modles.

• Structural Engineering and Mechanics
• /
• v.14 no.4
• /
• pp.417-434
• /
• 2002

This paper explores the possibility of using a combination of the empirical mode decomposition (EMD) and the Hilbert transform (HT), termed the Hilbert-Huang transform (HHT) method, to identify the modal damping ratios of the structure with closely spaced modal frequencies. The principle of the HHT method and the procedure of using the HHT method for modal damping ratio identification are briefly introduced first. The dynamic response of a two-degrees-of-freedom (2DOF) system under an impact load is then computed for a wide range of dynamic properties from well-separated modal frequencies to very closely spaced modal frequencies. The natural frequencies and modal damping ratios identified by the HHT method are compared with the theoretical values and those identified using the fast Fourier transform (FFT) method. The results show that the HHT method is superior to the FFT method in the identification of modal damping ratios of the structure with closely spaced modes of vibration. Finally, a 36-storey shear building with a 4-storey light appendage, having closely spaced modal frequencies and subjected to an ambient ground motion, is analyzed. The modal damping ratios identified by the HHT method in conjunction with the random decrement technique (RDT) are much better than those obtained by the FFT method. The HHT method performing in the frequency-time domain seems to be a promising tool for system identification of civil engineering structures.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.199-208
• /
• 2014

In this paper, we represent a system of identification and feature search for scanned comics in consideration of their content characteristics. For creating the feature of the scanned comics, we utilize a method of hierarchical symmetry fingerprinting. Proposed identification and search system is designed to give online service provider, such as Webhard, an immediate identification result under conditions of huge volume of the scanned comics. In simulation part, we analyze the robustness of the identification of the fingerprint to image modification such as rotation and translation. Also, we represent a structure of database for fast matching in feature point database, and compare search performance between other existing searching methods such as full-search and most significant feature search.