• Bulletin of the Korean Chemical Society
• /
• v.18 no.12
• /
• pp.1281-1285
• /
• 1997

The time-dependent tracking inversion method is developed to extract the potential of the excited state from frequency-domain measurements, such as the absorption profile. Based on the relay of the regularized inversion procedure and time-dependent wave-packet propagation, the algorithm extract the underlying potential piece by piece by tracking the time-dependent data which can be synthesized from frequency-domain measurements. We have demonstrated the algorithm to extract the potential of excited state for a model diatomic molecule. Finally, we describe the merits of the time-dependent tracking inversion method compared to the time-dependent inversion and discuss several extensions of the algorithm.

• Korean Journal of Remote Sensing
• /
• v.24 no.5
• /
• pp.427-436
• /
• 2008

This paper presents radar remote sensing of soil moisture and surface roughness for vegetated surfaces. A precise volume scattering model for a vegetated surface is derived based on the first-order radiative transfer technique. At first, the scattering mechanisms of the scattering model are analyzed for various conditions of the vegetation canopies. Then, the scattering model is simplified step by step for developing an appropriate inversion algorithm. For verifying the scattering model and the inversion algorithm, the polarimetric backscattering coefficients at 1.85 GHz, as well as the ground truth data, of a tall-grass field are measured for various soil moisture conditions. The genetic algorithm is employed in the inversion algorithm for retrieving soil moisture and surface roughness from the radar measurements. It is found that the scattering model agrees quite well with the measurements. It is also found that the retrieved soil moisture and surface roughness parameters agree well with the field-measured ground truth data.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.3
• /
• pp.425-437
• /
• 2017

For efficient hardware (HW) implementation of elliptic curve cryptography (ECC), various sub-modules for the underlying finite field operations should be implemented efficiently. Among these sub-modules, modular inversion (MI) requires the most computation; therefore, its performance might be a dominant factor of the overall performance of an ECC module. To determine the most efficient MI algorithm for an HW ECC module, we implement various classes of MI algorithms and analyze their performance. In contrast to the common belief in previous research, our results show that the right-shift binary inversion (RS) algorithm performs well when implemented in hardware. In addition, we present optimization methods to reduce the area overhead and improve the speed of the RS algorithm. By applying these methods, we propose a new RS-variant that is both fast and compact. The proposed MI module is more than twice as fast as the other two classes of MI: shifting Euclidean (SE) and left-shift binary inversion (LS) algorithms. It consumes only 15% more area and even 5% less area than SE and LS, respectively. Finally, we show that how our new method can be applied to optimize an HW ECC module.

• Bulletin of the Korean Chemical Society
• /
• v.22 no.5
• /
• pp.455-462
• /
• 2001

The time-dependent tracking inversion method is studied to extract the potential energy surface of the electronic excited state in the photodissociation of triatomic molecules. Based on the relay of the regularized inversion procedure and time-dependent wave packet propagation, the algorithm extracts the underlying potential energy surface piece by piece by tracking the time-dependent data, which can be synthesized from Raman excitation profiles. We have demonstrated the algorithm to extract the potential energy surface of electronic excited state for NO2 molecule where the wave packet split on a saddle-shaped surface. Finally, we describe the merits of the time-dependent tracking inversion method compared with the time-independent inversion method and discussed several extensions of the algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.130-138
• /
• 2003

The classical image reconstruction for stripmap-mode Synthetic Aperture Radar is the Range-Doppler algorithm. When the spotlight-mode SAR system was envisioned, Range-Doppler algorithm turned out to fail rapidly in this SAR imaging modality. Thus, what is referred to as Polar format algorithm, which is based on the Plane wave approximation, was introduced for imaging from spotlight-mode SAR raw- data. In this paper, we have studied for the raw data processing schemes in the spotlight-mode Synthetic Aperture Radar. We apply the Wavefront Reconstruction scheme that does not utilize the approximation in spotlight-mode SAR imaging modelity, and compare the performance of target imaging with the Polar format inversion scheme.

• The Journal of Society for e-Business Studies
• /
• v.11 no.2
• /
• pp.1-11
• /
• 2006

This paper proposes an efficient inversion algorithm for Galois field GF(2n) by using a modified multi-bit shifting method based on the Montgomery algorithm. It is well known that the efficiency of arithmetic algorithms depends on the basis and many foregoing papers use either polynomial or optimal normal basis. An inversion algorithm, which modifies a multi-bit shifting based on the Montgomery algorithm, is studied. Trinomials and AOPs (all-one polynomials) are tested to calculate the inverse. It is shown that the suggested inversion algorithm reduces the computation time up to 26 % of the forgoing multi-bit shifting algorithm. The modified algorithm can be applied in various applications and is easy to implement.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.318-326
• /
• 2011

Public key cryptosystem applications are very difficult in Ubiquitos environments due to computational complexity, memory and power constrains. HECC offers the same of levels of security with much shorter bit-lengths than RSA or ECC. Scalar multiplication is the core operation in HECC. T.Lange proposed inverse free scalar multiplication on genus 2 HECC. However, further coordinate must be access to SCA and need more storage space. This paper developed secure scalar multiplication algorithm with simultaneous inversion algorithm in HECC. To improve the over all performance and security, the proposed algorithm adopt the comparable technique of the simultaneous inversion algorithm. The proposed algorithm is resistant to DPA and SPA.

• Geophysics and Geophysical Exploration
• /
• v.22 no.4
• /
• pp.186-194
• /
• 2019

Deterministic optimization, commonly used to find the geophysical inverse solutions, have its limitation that it cannot find the proper solution since it might converge into the local minimum. One of the solutions to this problem is to use global optimization based on a stochastic approach, among which a large number of particle swarm optimization (PSO) applications have been introduced. In this paper, I developed a geophysical inversion algorithm applying PSO method for the layered-earth resistivity inversion of the small-loop electromagnetic (EM) survey data and carried out numerical inversion experiments on synthetic datasets. From the results, it is confirmed that the PSO inversion algorithm could increase the inversion success rate even when attempting the inversion of small-loop EM survey data from which it might be difficult to find a best solution by applying the Gauss-Newton inversion algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.6
• /
• pp.309-316
• /
• 2005

This paper Presents the geoacoustic inversion with Parallel Multi-Population Genetic Algorithm (PMPGA). This method is the modified form of simple genetic algorithm (SGA), which is devised for complementing the defects of simple genetic algorithm. The light bulb source and vertical line array (VLA) receiver are used for geoacoustic inversion. The results of this study show the geoacoustic Parameters can be estimated by PMPGA and the proposed algorithm is 1.7 times as fast as serial one on an average.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.121-135
• /
• 1999

This paper studies the problem of inverting minimal path sets to obtain minimal cut sets for complex system. We describe efficiency of inversion algorithm by the use of boolean algebra and we develop inclusion-exclusion algorithm and pivotal decomposition algorithm for reliability calculation of complex system. Several examples are illustrated and the computation speeds between the two algorithms are undertaken.