http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Oh, Seyoung,Lee, Seung Won,Kim, Dongjun,Choi, Jeong-Hun,Chae, Hong-Chul,Choi, Sung Mook,Ahn, Ji-Hoon,Cho, Byungjin Hindawi Limited 2018 Journal of nanomaterials Vol.2018 No.-
<P>In this report, we demonstrated a reliable switching effect of carbon nanotube (CNT) field-effect transistor (FET) devices integrated with 99% semiconducting CNT as a channel and high-k oxide as the dielectric. CNT FET devices with high-k oxides of Al-ZrHfO2 and Al2O3 were electrically characterized and compared. There was no considerable hysteresis in the Al2O3-based CNT FET device. The Al-ZrHfO2 with a tetragonal phase-based high dielectric constant (~47), designed by an atomic layer deposition process, showed a reliable switching effect as well as low operation voltage (<±3 V). Charge trapping/detrapping process via oxygen vacancy-related defects of Al-ZrHfO2 was proposed as a primary mechanism to explain a current change of a counterclockwise direction and threshold voltage (Vth) shift for transfer properties. The suggested charge trapping model within bulk oxide was experimentally proven since the hysteresis from the adsorption/desorption of gas molecules to CNT surface was negligible. Endurance characteristics of the CNT switching devices remained stable without any serious current fluctuation during a repetitive cycling test. The memory device with reliable switching properties as well as low operation power would pave a road toward next-generation memory components of portable electronic gadgets.</P>
THE FAST TRUNCATED LAGRANGE METHOD FOR IMAGE DEBLURRING WITH ANTIREFLECTIVE BOUNDARY CONDITIONS
Oh, SeYoung,Kwon, SunJoo Chungcheong Mathematical Society 2018 충청수학회지 Vol.31 No.1
In this paper, under the assumption of the symmetry point spread function, antireflective boundary conditions(AR-BCs) are considered in connection with the fast truncated Lagrange(FTL) method. The FTL method is proposed as an image restoration method for large-scale ill-conditioned BTTB(block Toeplitz with Toeplitz block) and BTHHTB(block Toeplitz-plus-Hankel matrix with Toeplitz-plus-Hankel blocks) linear systems([13, 17]). The implementation and efficiency of the FTL method in the AR-BCs are further illustrated. Especially, by employing the AR-BCs, both the continuity of the image and the continuity of its normal derivative are preserved at the boundary. A reconstructed image with less artifacts at the boundary is obtained as a result.
A Parallel Algorithm for Large-Scale Linear Programs with a Special Structure
Oh, Seyoung 충청수학회 1993 충청수학회지 Vol.6 No.1
A new sequential algorithm and computational results for large-scale linear programs with a special structure were presented in the previous paper [9]. In this paper, a parallel version of the algorithm was developed for a hypercube multiprocessor architecture NCUBE2. Computational results using 128 processors are presented for a randomly generated large-scale sparse or dense problems with the number of variables up to 256 and constraints up to 5 million.
SPLITTING METHOD OF DENSE COLUMNS IN SPARSE LINEAR SYSTEMS AND ITS IMPLEMENTATION
Oh, Seyoung,Kwon, Sun Joo 충청수학회 1997 충청수학회지 Vol.10 No.1
It is important to solve the large sparse linear system appeared in many application field such as $AA^Ty={\beta}$ efficiently. In solving this linear system, the sparse solver using the splitting method for the relatively dense column is experimentally better than the direct solver using the Cholesky method.
CHOOSING REGULARIZATION PARAMETER BY GLOBAL L-CURVE CRITERION
Oh, SeYoung,Kwon, SunJoo Chungcheong Mathematical Society 2017 충청수학회지 Vol.30 No.1
As an efficient way to determine the regularization parameter in the discrete ill-posed problems with multiple right-hand sides, we suggest global L-curve criterion as an extension of L-curve technique for image restoration problems with single right-hand side.
AN ALGORITHM FOR MULTIPLICATIONS IN F<SUB>2</SUB><SUB>m</SUB>
Oh, SeYoung,Yoon, ChungSup 충청수학회 2003 충청수학회지 Vol.15 No.2
An efficient algorithm for the multiplication in a binary finite filed using a normal basis representation of $F_{2^m}$ is discussed and proposed for software implementation of elliptic curve cryptography. The algorithm is developed by using the storage scheme of sparse matrices.
ESOR METHOD WITH DIAGONAL PRECONDITIONERS FOR SPD LINEAR SYSTEMS
Oh, Seyoung,Yun, Jae Heon,Kim, Kyoum Sun The Korean Society for Computational and Applied M 2015 Journal of applied mathematics & informatics Vol.33 No.1
In this paper, we propose an extended SOR (ESOR) method with diagonal preconditioners for solving symmetric positive definite linear systems, and then we provide convergence results of the ESOR method. Lastly, we provide numerical experiments to evaluate the performance of the ESOR method with diagonal preconditioners.
MULTI-PARAMETER TIKHONOV REGULARIZATION PROBLEM WITH MULTIPLE RIGHT HAND SIDES
SeYoung Oh,SunJoo Kwon 충청수학회 2020 충청수학회지 Vol.33 No.4
This study shows that image deblurring problems can be transformed into the multi-parameter Tikhonov type with multiple right hand sides. Also, this paper proposes the extension of the global generalized cross validation to obtain an appropriate choice of the regularization parameters for this problem. The experimental results of using the preconditioned Gl-CGLS algorithm were analyzed.
IMAGE RESTORATION BY THE GLOBAL CONJUGATE GRADIENT LEAST SQUARES METHOD
Oh, Seyoung,Kwon, Sunjoo,Yun, Jae Heon The Korean Society for Computational and Applied M 2013 Journal of applied mathematics & informatics Vol.31 No.3
A variant of the global conjugate gradient method for solving general linear systems with multiple right-hand sides is proposed. This method is called as the global conjugate gradient linear least squares (Gl-CGLS) method since it is based on the conjugate gradient least squares method(CGLS). We present how this method can be implemented for the image deblurring problems with Neumann boundary conditions. Numerical experiments are tested on some blurred images for the purpose of comparing the computational efficiencies of Gl-CGLS with CGLS and Gl-LSQR. The results show that Gl-CGLS method is numerically more efficient than others for the ill-posed problems.