• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.6
• /
• pp.625-635
• /
• 2014

Multiple strips are required for large area mapping using ALS (Airborne Laser Scanner) system. LiDAR (Light Detection And Ranging) data collected from the ALS system has discrepancies between strips due to systematic errors of on-board laser scanner and GPS/INS, inaccurate processing of the system calibration as well as boresight misalignments. Such discrepancies deteriorate the overall geometric quality of the end products such as DEM (Digital Elevation Model), building models, and digital maps. Therefore, strip adjustment for minimizing discrepancies between overlapping strips is one of the most essential tasks to create seamless point cloud data. This study implemented area-based matching (ABM) to determine conjugate features for computing 3D transformation parameters. ABM is a well-known method and easily implemented for this purpose. It is obvious that the exact same LiDAR points do not exist in the overlapping strips. Therefore, the term "conjugate point" means that the location of occurring maximum similarity within the overlapping strips. Coordinates of the conjugate locations were determined with sub-pixel accuracy. The major drawbacks of the ABM are sensitive to scale change and rotation. However, there is almost no scale change and the rotation angles are quite small between adjacent strips to apply AMB. Experimental results from this study using both simulated and real datasets demonstrate validity of the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.335-341
• /
• 1998

In this paper, we present a real time implementation of CS-ACELP(Conjugate Structure Algebraic Code Excited Linear Prediction) speech coder. ITU-T has standardized the CS-ACELP algorithm as G.729. Areal-time implementation of CS-ACELP speech coder algorithm is achieved using 16 bit fixed-point DSP chip. To implement in fixed-point DSP Chip, integer simulation of CS-ACELP algorithm is used. Furthermore. input/output function and communication function included in CS-ACELP speech coder is described. We develope CS-ACELP speech coder in DSP evaluation board and evaluate in IMT-2000 Test-bed.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.5 no.4
• /
• pp.265-277
• /
• 1993

Recently, underground transmission system is growing continuously according to the electric power demand increase in the downtown area. Even if domestic cable makers are manufacturing 154kV oil filled cable and joint, the design technology of cable-joint has not been fully self-reliance. This study is aimed at the detail heat transfer analysis of 154kV cable-joint. So, that is cut into the five sections in order to analyze a conjugate natural convection in two dimensional $r-{\theta}$ coordinate. The streamline and temperature distributions are obtained for each sections. Also the changes of those are analyzed with respect to the variation of transmission currents and cable-joint surface heat transfer coefficients. The same analyses are also shown in view point of the maximum temperature of conductor and local equivalent conductivity.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.739-763
• /
• 2000

We are concerned with mathematical analysis related to the bi-pointwise control for a mixed type of wave equation. In particular, we are interested in the systematic build-up of the bi-pointwise control actuators;one at the boundary and the other at the interior point simultaneously. The main purpose is to examine Hilbert Uniqueness Method for the setting of bi-pointwise control actuators and to establish relevant algorithm based on our analysis. After discussing the weak solution for the state equation, we investigate bi-pointwise control mechanism and relevant mathematical analysis based on HUM. We then proceed to set up an algorithm based on the conjugate gradient method to establish bi-pointwise control actuators to halt the system.

• Journal of Korean language education
• /
• v.23 no.1
• /
• pp.101-122
• /
• 2012

To learn correctly how irregular verbs conjugate is one of the most important items which must be acquired by learners of Korean. Although a great deal of study has been made on irregular verbs, lots of problems seem to be remaining unsolved or even undescribed. The purpose of this paper is: (1) to give a definition of irregular conjugation of Korean from pedagogical point of view; (2) to describe an appearance of irregular verbs in the spoken and written context; (3) to show appropriate explanation how irregular verbs conjugate.

• Korean Management Science Review
• /
• v.21 no.1
• /
• pp.77-86
• /
• 2004

In this paper, we present a methodology for solving the multicommodity network flow problems using interior point methods. In our method, the minimum cost network flow problem extracted from the given multicommodity network flow problem is solved by primal-dual barrier method in which normal equations are solved partially using preconditioned conjugate gradient method. Based on the solution of the minimum cost network flow problem, a warm-start point is obtained from which Castro's specialized interior point method for multicommodity network flow problem starts. In the computational experiments, the effectiveness of our methodology is shown.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.151-170
• /
• 2009

Let m be a positive integer. We show that for any given real number ${\alpha}\;{\in}\;[0,\;1]$ and complex number $\mu$ with $|\mu|{\leq}1$ which satisfy $e^{2{\pi}i{\alpha}}{\mu}^m\;{\neq}\;1$, there exists a Blaschke product B of degree 2m + 1 which has a fixed point of multiplier ${\mu}^m$ at the point at infinity such that the restriction of the Blaschke product B on the unit circle is a critical circle map with rotation number $\alpha$. Moreover if the given real number $\alpha$ is irrational of bounded type, then a modified Blaschke product of B is quasiconformally conjugate to some rational function of degree m + 1 which has a fixed point of multiplier ${\mu}^m$ at the point at infinity and a Siegel disk whose boundary is a quasicircle containing its critical point.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.134-136
• /
• 1993

This paper presents a novel and efficient method to calculate the critical point of voltage collapse. Conjugate gradient and modified Newton-Raphson methods are employed to calculate two pairs of multiple load flow solutions for two operating conditions, i.e., both +mode and -mode voltages for two loading conditions respectively. Then these four voltage magnitude-load data sets of the bus which is most susceptible to voltage collapse, are fitted to third order polynomial using Lagrangian interpolation in order to represent approximate nose curve (P-V curve). This nose curve locates first estimate of the critical point of voltage collapse. The procedure described above is repeated near the critical point and the new estimate will be very close to the critical point. The proposed method is tested for the eleven bus Klos-Kerner system, with good accuracy and fast computation time.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.659-675
• /
• 2023

Let K be an algebraically closed field of characteristic 0 and let f be a non-fibered planar quadratic polynomial map of topological degree 2 defined over K. We assume further that the meromorphic extension of f on the projective plane has the unique indeterminacy point. We define the critical pod of f where f sends a critical point to another critical point. By observing the behavior of f at the critical pod, we can determine a good conjugate of f which shows its statue in GIT sense.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.90-100
• /
• 2011

We present a parallel bi-conjugate gradient (Bi-CG) matrix solver for large scale Bio-FET simulations based on recent graphics processing units (GPUs) which can realize a large-scale parallel processing with very low cost. The proposed method is focused on solving the Poisson equation in a parallel way, which requires massive computational resources in not only semiconductor simulation, but also other various fields including computational fluid dynamics and heat transfer simulations. As a result, our solver is around 30 times faster than those with traditional methods based on single core CPU systems in solving the Possion equation in a 3D FDM (Finite Difference Method) scheme. The proposed method is implemented and tested based on NVIDIA's CUDA (Compute Unified Device Architecture) environment which enables general purpose parallel processing in GPUs. Unlike other similar GPU-based approaches which apply usually 32-bit single-precision floating point arithmetics, we use 64-bit double-precision operations for better convergence. Applications on the CUDA platform are rather easy to implement but very hard to get optimized performances. In this regard, we also discuss the optimization strategy of the proposed method.