• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.9
• /
• pp.723-732
• /
• 2017

Simplified factorizing-technique to improve the efficiency on computational procedure and the complexity of the conventional back-projection algorithm, which is used to reconstruct airborne FMCW-SAR image, is suggested, and the reconstruction process of SAR image by this simplified factorizing-technique are presented in this paper. This technique can be efficiently applied to airborne FMCW-SAR having a relatively narrow beamwidth and long synthetic aperture length, and its basic rationale is to exclude the data that has low level of contribution during computational procedure. Using the raw data of practical airborne FMCW-SAR system, performances of this proposed technique such as SAR image quality and processing time were compared and analyzed.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2003.03a
• /
• pp.481-490
• /
• 2003

This paper presents an efficient eigensolution method for non-proportionally damped systems. The proposed method is obtained by applying the accelerated Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linearized form of the quadratic eigenproblem. A step length and a selective scheme are introduced to increase the convergence of the solution. The step length can be evaluated by minimizing the norm of the residual vector using the least square method. While the singularity may occur during factorizing process in other iteration methods such as the inverse iteration method and the subspace iteration method if the shift value is close to an exact eigenvalue, the proposed method guarantees the nonsingularity by introducing the orthonormal condition of the eigenvectors, which can be proved analytically. A numerical example is presented to demonstrate the effectiveness of the proposed method.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.49-62
• /
• 1998

The purpose of this paper is to develope a large-scale simplex method program LPAKO. Various up-to-date techniques are argued and implemented. In LPAKO, basis matrices are stored in a LU factorized form, and Reid's method is used to update LU maintaining high sparsity and numerical stability, and further Markowitz's ordering is used in factorizing a basis matrix into a sparse LU form. As the data structures of basis matrix, Gustavson's data structure and row-column linked list structure are considered. The various criteria for reinversion are also discussed. The dynamic steepest-edge simplex algorithm is used for selection of an entering variable, and a new variation of the MINOS' perturbation technique is suggested for the resolution of degeneracy. Many preprocessing and scaling techniques are implemented. In addition, a new, effective initial basis construction method are suggested, and the criteria for optimality and infeasibility are suggested respectively. Finally, LPAKO is compared with MINOS by test results.

• Computational Structural Engineering
• /
• v.11 no.1
• /
• pp.205-216
• /
• 1998

A solution method is presented to solve the eigenvalue problem arising in the dynamic analysis of nonclassicary damped structural systems with multiple eigenvalues. The proposed method is obtained by applying the modified Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linear eigenproblem through matrix augmentation of the quadratic eigenvalue problem. In the iteration methods such as the inverse iteration method and the subspace iteration method, singularity may be occurred during the factorizing process when the shift value is close to an eigenvalue of the system. However, even though the shift value is an eigenvalue of the system, the proposed method provides nonsingularity, and that is analytically proved. Since the modified Newton-Raphson technique is adopted to the proposed method, initial values are need. Because the Lanczos method effectively produces better initial values than other methods, the results of the Lanczos method are taken as the initial values of the proposed method. Two numerical examples are presented to demonstrate the effectiveness of the proposed method and the results are compared with those of the well-known subspace iteration method and the Lanczos method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.11-25
• /
• 2018

While being believed that decrypting any RSA ciphertext is as hard as factorizing the RSA modulus, it was also shown that, if additional information is available, breaking the RSA cryptosystem may be much easier than factoring. For example, Coppersmith showed that, given the 1/2 fraction of the least or the most significant bits of one of two RSA primes, one can factorize the RSA modulus very efficiently, using the lattice-based technique. More recently, introducing the so called cold boot attack, Halderman et al. showed that one can recover cryptographic keys from a decayed DRAM image. And, following up this result, Heninger and Shacham presented a polynomial-time attack which, given 0.27-fraction of the RSA private key of the form (p, q, d, $d_p$, $d_q$), can recover the whole key, provided that the given bits are uniformly distributed. And, based on the work of Heninger and Shacham, this paper presents a different approach for recovering RSA private key bits from decayed key information, under the assumption that some random portion of the private key bits is known. More precisely, we present the algorithm of recovering RSA private key bits from erased key material and elaborate the formula of describing the number of partially-recovered RSA private key candidates in terms of the given erasure rate. Then, the result is justified by some extensive experiments.