• Economic and Environmental Geology
• /
• v.48 no.1
• /
• pp.51-63
• /
• 2015

I produced a secular variation model of geomagnetic field by using the magnetic component data from four geomagnetic observatories located in Northeast Asia during the years between 1997 and 2011. The Earth's magnetic field varies with time and location due to the dynamics of fluid outer core and the magnetic observatories on the surface measure in time series. To adequately represent the magnetic field or secular variations of the Earth, a spatio-temporal model is required. In making a global model, satellite observations as well as limited observatory data are necessary to cover the regions and time intervals. However, you need a considerable work and time to process a huge amount of the dataset with complicated signal separation procedures. When you update the model, the same amount of chores is demanded. Besides, the global model might be affected by the measurement errors of each observatory that are biased and the processing errors in satellite data so that the accuracy of the model would be degraded. In this study, as considered these problems, I introduced a localized method in modeling secular variation of the Earth's magnetic field over Northeast Asia region. Secular variation data from three Japanese observatories and one Chinese observatory that are all in the INTERMAGNET are implemented in the model valid between 1997 to 2011 with the interval of 6 months. With the resulting model, I compared with the global model called CHAOS-4, which includes the main, secular variation and secular acceleration models between 1997 to 2013 by using the three satellites' databases and INTERMAGNET observatory data. Also, the geomagnetic 'jerk' which is known as a sudden change in the time derivatives of the main field of the Earth, was discussed from the localized secular acceleration coefficients derived from spline models.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.

• Journal of Intelligence and Information Systems
• /
• v.26 no.2
• /
• pp.1-25
• /
• 2020

In this paper, we suggest an application system architecture which provides accurate, fast and efficient automatic gasometer reading function. The system captures gasometer image using mobile device camera, transmits the image to a cloud server on top of private LTE network, and analyzes the image to extract character information of device ID and gas usage amount by selective optical character recognition based on deep learning technology. In general, there are many types of character in an image and optical character recognition technology extracts all character information in an image. But some applications need to ignore non-of-interest types of character and only have to focus on some specific types of characters. For an example of the application, automatic gasometer reading system only need to extract device ID and gas usage amount character information from gasometer images to send bill to users. Non-of-interest character strings, such as device type, manufacturer, manufacturing date, specification and etc., are not valuable information to the application. Thus, the application have to analyze point of interest region and specific types of characters to extract valuable information only. We adopted CNN (Convolutional Neural Network) based object detection and CRNN (Convolutional Recurrent Neural Network) technology for selective optical character recognition which only analyze point of interest region for selective character information extraction. We build up 3 neural networks for the application system. The first is a convolutional neural network which detects point of interest region of gas usage amount and device ID information character strings, the second is another convolutional neural network which transforms spatial information of point of interest region to spatial sequential feature vectors, and the third is bi-directional long short term memory network which converts spatial sequential information to character strings using time-series analysis mapping from feature vectors to character strings. In this research, point of interest character strings are device ID and gas usage amount. Device ID consists of 12 arabic character strings and gas usage amount consists of 4 ~ 5 arabic character strings. All system components are implemented in Amazon Web Service Cloud with Intel Zeon E5-2686 v4 CPU and NVidia TESLA V100 GPU. The system architecture adopts master-lave processing structure for efficient and fast parallel processing coping with about 700,000 requests per day. Mobile device captures gasometer image and transmits to master process in AWS cloud. Master process runs on Intel Zeon CPU and pushes reading request from mobile device to an input queue with FIFO (First In First Out) structure. Slave process consists of 3 types of deep neural networks which conduct character recognition process and runs on NVidia GPU module. Slave process is always polling the input queue to get recognition request. If there are some requests from master process in the input queue, slave process converts the image in the input queue to device ID character string, gas usage amount character string and position information of the strings, returns the information to output queue, and switch to idle mode to poll the input queue. Master process gets final information form the output queue and delivers the information to the mobile device. We used total 27,120 gasometer images for training, validation and testing of 3 types of deep neural network. 22,985 images were used for training and validation, 4,135 images were used for testing. We randomly splitted 22,985 images with 8:2 ratio for training and validation respectively for each training epoch. 4,135 test image were categorized into 5 types (Normal, noise, reflex, scale and slant). Normal data is clean image data, noise means image with noise signal, relfex means image with light reflection in gasometer region, scale means images with small object size due to long-distance capturing and slant means images which is not horizontally flat. Final character string recognition accuracies for device ID and gas usage amount of normal data are 0.960 and 0.864 respectively.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.08a
• /
• pp.80-81
• /
• 2012

Recently, one of the critical issues in the etching processes of the nanoscale devices is to achieve ultra-high aspect ratio contact (UHARC) profile without anomalous behaviors such as sidewall bowing, and twisting profile. To achieve this goal, the fluorocarbon plasmas with major advantage of the sidewall passivation have been used commonly with numerous additives to obtain the ideal etch profiles. However, they still suffer from formidable challenges such as tight limits of sidewall bowing and controlling the randomly distorted features in nanoscale etching profile. Furthermore, the absence of the available plasma simulation tools has made it difficult to develop revolutionary technologies to overcome these process limitations, including novel plasma chemistries, and plasma sources. As an effort to address these issues, we performed a fluorocarbon surface kinetic modeling based on the experimental plasma diagnostic data for silicon dioxide etching process under inductively coupled C4F6/Ar/O2 plasmas. For this work, the SiO2 etch rates were investigated with bulk plasma diagnostics tools such as Langmuir probe, cutoff probe and Quadruple Mass Spectrometer (QMS). The surface chemistries of the etched samples were measured by X-ray Photoelectron Spectrometer. To measure plasma parameters, the self-cleaned RF Langmuir probe was used for polymer deposition environment on the probe tip and double-checked by the cutoff probe which was known to be a precise plasma diagnostic tool for the electron density measurement. In addition, neutral and ion fluxes from bulk plasma were monitored with appearance methods using QMS signal. Based on these experimental data, we proposed a phenomenological, and realistic two-layer surface reaction model of SiO2 etch process under the overlying polymer passivation layer, considering material balance of deposition and etching through steady-state fluorocarbon layer. The predicted surface reaction modeling results showed good agreement with the experimental data. With the above studies of plasma surface reaction, we have developed a 3D topography simulator using the multi-layer level set algorithm and new memory saving technique, which is suitable in 3D UHARC etch simulation. Ballistic transports of neutral and ion species inside feature profile was considered by deterministic and Monte Carlo methods, respectively. In case of ultra-high aspect ratio contact hole etching, it is already well-known that the huge computational burden is required for realistic consideration of these ballistic transports. To address this issue, the related computational codes were efficiently parallelized for GPU (Graphic Processing Unit) computing, so that the total computation time could be improved more than few hundred times compared to the serial version. Finally, the 3D topography simulator was integrated with ballistic transport module and etch reaction model. Realistic etch-profile simulations with consideration of the sidewall polymer passivation layer were demonstrated.

• Cartoon and Animation Studies
• /
• s.37
• /
• pp.509-537
• /
• 2014

This paper proposes 'postfilimc metamorphosis' and 'reanimation' as two concepts that aim at giving account to the aesthtetic tendencies and genealogies of what Suzanne Buchan calls 'pervasive animation', a category that refers to the unprecedented expansion of animation's formal, technological and experiential boundaries. Buchan's term calls for an interdisciplinary approach to animation by highlighting a range of phenomena that signal the growing embracement of the images and media that transcend the traditional definition of animation, including the lens-based live-action image as the longstanding counterpart of the animation image, and the increasing uses of computer-generated imagery, and the ubiquity of various animated images dispersed across other media and platforms outside the movie theatre. While Buchan's view suggests the impacts of digital technology as a determining factor for opening this interdisciplinary, hybrid fields of 'pervasive animation', I elaborate upon the two concepts in order to argue that the various forms of metamorphorsis and motion found in these fields have their historical roots. That is, 'postfilmic metamorphosis' means that the transformative image in postfimic media such as video and the computer differs from that in traditional celluloid-based animation materially and technically, which demands a refashioned investigation into the history of the 'image-processing' video art which was categorized as experimental animation but largely marginalized. Likewise, 'reanimation' cne be defined as animating the still images (the photographic and the painterly images) or suspending the originally inscribed movement in the moving image and endowing it with a neewly created movement, and both technical procedues, developed in experimental filmmaking and now enabled by a variety of moving image installations in contemporary art, aim at reconsidering the borders between stillness and movement, and between film and photography. By discussing a group of contemporary moving image artworks (including those by Takeshi Murata, David Claerbout, and Ken Jacobs) that present the aesthetic features of 'postfilmic metamorphosis' and 'reanimation' in relation to their precursors, this paper argues that the aesthetic implications of the works that pertain to 'pervasive animation' lie in their challenging the tradition dichotomies of the graphic/the live-action images and stillness/movement. The two concepts, then, respond to a revisionist approach to reconfigure the history and ontology of other media images outside the traditional boundaries of animation as a way of offering a refasioned understanding of 'pervasive animation'.

• Journal of fish pathology
• /
• v.6 no.2
• /
• pp.93-101
• /
• 1993

The RNAI mutation of Saccharomyces cerevisia is a recessive and temperature sensitive lethal mutation which interferes with the production of mRNA, rRNA, and tRNA. However, the precise role of RNAI gene have not been revealed until yet. We have cloned rna1-1 mutant gene from rna1-1 mutant yeast strain(R49 ; trpl, ura3-52, rna1-1). The 3.4kb BglII fragment of wild type RNAI clone(81-2-6) contains whole RNAI gene. The genomic southern blotting with BglII digested R49 genomic DNA as a probe shows the unique and identical band with wild type 3.4kb BglII fragment. Therefore, We prepared partial BglII genomic library(3~4kb BglII fragments) into BamH I site of pUC19. The rna 1-1 mutant clone was screened with Digoxigenin(DIG)-lableled probe by high density colony hybridization. The 5'-flanking region of rna1-1 gene was sequenced by dideoxy chain termination method. The 5'-flanking sequence of RNAI gene contains three TATA-like sequence ; TAATA, TATA and TTTTAA at position of -67, -45, and -36 from first ATG codon respectively. The 5'-flanking region of wild type RNA I gene from ATG codon to -103nt was deleted with Bal31 exonuclease digestion, generating $pUC{\Delta}$/RNA I. After constructing $pYEP{\Delta}RNA$ I (consists of -103nt deleting RNA I gene, URA3 gene, $2{\mu}m$ rep. origin), pYEPrna1-1(consists of Xba I fragment of pUCrna1-1. URA3 gene, $2{\mu}m$ rep. origin), and pYEPRNAI. each plasmid was transformed into host strain(trpl, ura3-52, rna1-1) by electroporation, respectively. Yeast transformant carrying $pYEP{\Delta}RNA$ I did not complement the thermal sensitivity of rna1-1 gene. It means that TATA-like sequences in 5'-flanking region is not TATA sequence for transcribing RNAI gene and there may be other essential sequence in upstream region for the transcription of RNAI gene.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Progress in Medical Physics
• /
• v.19 no.4
• /
• pp.269-275
• /
• 2008

Although MR imaging is generally applicable to depict knee joint deterioration it, is sometimes occurred to mis-read and mis-diagnose the common knee joint diseases. In this study, we employed magnetization transfer ratio (MTR) method to improve the diagnosis of the various knee joint diseases. Spin-echo (SE) T2-weighted images (TR/TE 3,400-3,500/90-100 ms) were obtained in seven cases of knee joint deterioration, FSE T2-weighted images (TR/TE 4,500-5,000/100-108 ms) were obtained in seven cases of knee joint deterioration, gradient-echo (GRE) T2-weighted images (TR/TE 9/4.56/$50^{\circ}$ flip angle, NEX 1) were obtained in 3 cases of knee joint deterioration, In six cases of knee joint deterioration, fat suppression was performed using a T2-weighted short T1/tau inverse recovery (STIR) sequence (TR/TE =2,894-3,215 ms/70 ms, NEX 3, ETL 9). Calculation of MTR for individual pixels was performed on registration of unsaturated and saturated images. After processing to make MTR images, the images were displayed in gray color. For improving diagnosis, three-dimensional isotropic volume images, the MR tristimulus color mapping and the MTR map was employed. MTR images showed diagnostic images quality to assess the patients' pathologies. The intensity difference between MTR images and conventional MRI was seen on the color bar. The profile graph on MTR imaging effect showed a quantitative measure of the relative decrease in signal intensity due to the MT pulse. To diagnose the pathologies of the knee joint, the profile graph data was shown on the image as a small cross. The present study indicated that MTR images in the knee joint were feasible. Investigation of physical change on MTR imaging enables to provide us more insight in the physical and technical basis of MTR imaging. MTR images could be useful for rapid assessment of diseases that we examine unambiguous contrast in MT images of knee disorder patients.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.5 no.4
• /
• pp.267-275
• /
• 2000

In an effort to assess the reliability of satellite altimeter system, we conducted a comparative analysis of sea level data that were collected using the TOPEX/POSEIDON (T/P) altimeter and the 10 tide gauge (TG) stations in the satellite passing track. The analysis was made using data sets collected from marginal sea regions surrounding the Korean Peninsula at T/P cycles of 2 to 230, which correspond to October 1992 to December 1998. Because of strong tidal activity in the study area, treatment of tidal errors is a very critical step in data processing. Hence in the computation of dynamic heights from the Tn data, we adapted the procedures of Park and Gamberoni (1995) to reduce errors associated with it. When these T/P data were treated, the alias periods of M$_2$, S$_2$, and K$_1$ constitutions were found at 62.1, 58.7, and 173 days. The compatibility of the T/P and TG data sets were examined at various filtering periods. The results indicate that the low-frequency signal of Tn data can be interpreted more safely with longer filtering periods (such as up to the maximum selected values of 200 days). When RMS errors for 200-day low-pass filter period was compared among the whole 10 tidal stations, the values spanned in the range of 2.8 to 6.7 cm. The results of correlation analysis at this filtering period also showed a strong agreement between the Tn and TG data sets over the whole stations investigated (e.g., P values consistently less than 0.0001). According to our analysis, we conclude that the analysis of surface sea level using satellite altimeter data can be made safely and reasonably long filtering periods such as 200 days.