• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.679-689
• /
• 2010

By developing and using certain operators like those initiated by Burchnall-Chaundy, the authors aim at investigating several decomposition formulas associated with the $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ function $F_{2:0;0}^{0:3;3}$ [x, y]. For this purpose, many operator identities involving inverse pairs of symbolic operators are constructed. By employing their decomposition formulas, they also present a new group of integral representations of Eulerian type for the $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ function $F_{2:0;0}^{0:3;3}$ [x, y], some of which include several hypergeometric functions such as $_2F_1$, $_3F_2$, an Appell function $F_3$, and the $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ functions $F_{2:0;0}^{0:3;3}$ and $F_{1:0;1}^{0:2;3}$.

• Journal of the Korean Geotechnical Society
• /
• v.22 no.9
• /
• pp.45-59
• /
• 2006

The successful performance of any numerical geotechnical simulation depends on the accuracy and efficiency of the numerical implementation of constitutive model used to simulate the stress-strain (constitutive) response of the soil. The corner stone of the numerical implementation of constitutive models is the numerical integration of the incremental form of soil-plasticity constitutive equations over a discrete sequence of time steps. In this paper a well known two-surface soil plasticity model is implemented using a generalized implicit return mapping algorithm to arbitrary convex yield surfaces referred to as the Closest-Point-Projection method (CPPM). The two-surface model describes the nonlinear behavior of coarse-grained materials by incorporating a bounding surface concept together with isotropic and kinematic hardening as well as fabric formulation to account for the effect of fabric formation on the unloading response. In the course of investigating the performance of the CPPM integration method, it is proven that the algorithm is an accurate, robust, and efficient integration technique useful in finite element contexts. It is also shown that the algorithm produces a consistent tangent operator $\frac{d\sigma}{d\varepsilon}$ during the iterative process with quadratic convergence rate of the global iteration process.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.27 no.6
• /
• pp.782-786
• /
• 1994

Integrated finite difference method (IFDM) is used to solve one dimensional free oscillation problem in the coastal area. To evaluate the solution accuracy of IFDM in free oscillation analysis, two finite difference equations based on area discretization method and point discretization method are derived from the governing equations of free oscillation, respectively. The difference equations are transformed into a generalized eigenvalue problem, respectively. A numerical example is presented, for which the analytical solution is available, for comparing IFDM to conventional finite difference equation (CFDM), qualitatively. The eigenvalue matrices are solved by sub-space iteration method. The numerical results of the two methods are in good agreement with analytical ones, however, IFDM yields better solution than CFDM in lower modes because IFDM only includes first order differential operator in finite difference equation by Green's theorem. From these results, it is concluded that IFDM is useful for the free oscillation analysis in the coastal area.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.983-989
• /
• 2006

Current emigration and immigration control inspects passports by the naked eye, registers them by manual input, and compares them with items of database. In this paper, we propose the method to recognize information codes of passports. The proposed passport recognition method extracts character-rows of information codes by applying sobel operator, horizontal smearing, and contour tracking algorithm. The extracted letter-row regions is binarized. After a CDM mask is applied to them in order to recover the individual codes, the individual codes are extracted by applying vertical smearing. The recognizing of individual codes is performed by the RBF network whose hidden layer is applied by ART 2 algorithm and whose learning between the hidden layer and the output layer is applied by a generalized delta learning method. After a photo region is extracted from the reference of the starting point of the extracted character-rows of information codes, that region is verified by the information of luminance, edge, and hue. The verified photo region is certified by the classified features by the ART 2 algorithm. The comparing experiment with real passport images confirmed the good performance of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.98-109
• /
• 2000

While the bispectrum has desirable properties in itself and therefore has a lot of potential to be applied to signal and Image restoration. few real-world application results have appeared in literature The major problem with this IS the difficulty In realizing the expectation operator of the true bispectrum, due to the lack of realizations. In this paper, the true bispectrum is defined as the expectation of the sample bispectrum, which IS the Fourier representation of the triple correlation given one realization The characteristics of the sample bispectrum are analyzed and a way to obtain an estimate of the true bispectrum without stochastic expectation, using the generalized theory of weighted regularization is shown. The bispectrum estimated by the proposed algorithm is experimentally demonstrated to be useful for signal recovery under blurred noisy condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.486-492
• /
• 2003

The vigilance threshold of conventional fuzzy ART algorithm decide whether to permit the mismatch between any input pattern and stored pattern. If the vigilance threshold was large, despite of little difference among input and stored patterns, the input pattern may be classified to new category. On the other hand, if the vigilance threshold was small, the similarity between two patterns may be accepted in spite of lots of difference and the input pattern are classified to category of the stored pattern. Therefore, the vigilance threshold for the image recognition must be experientially set for the good result. Moreover, it may occur in the fuzzy ART algorithm that the information of stored patterns is lost in the weight-adjusting process and the rate of pattern recognition is dropped. In this paper, I proposed the enhanced fuzzy ART algorithm that supports the dynamical setting of the vigilance threshold using the generalized intersection operator of fuzzy logic and the weight value being adaptively set in proportional to the current weight change and the previous weight by reflecting the frequency of the selection of winner node. For the performance evaluation of the proposed method, we applied to the recognition of container identifiers from shipping container images. The experiment showed that the proposed method produced fewer clusters than conventional ART2 and fuzzy ART algorithm. and had tile higher recognition rate.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.135-142
• /
• 2013

Contour detection is important for many computer vision applications, such as shape discrimination and object recognition. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Therefore, local edge features, which only look at a small neighborhood of each pixel, cannot be reliable indicators of the presence of a contour, and some global analysis is needed. The novelty of this operator is that dilation is limited to Deluanary triangular. An efficient implementation is presented. The grouping algorithm is then embedded in a multi-threshold contour detector. At each threshold level, small groups of edges are removed, and contours are completed by means of a generalized reconstruction from markers. Both qualitative and quantitative comparison with existing approaches prove the superiority of the proposed contour detector in terms of larger amount of suppressed texture and more effective detection of low-contrast contour.

• Korean Journal of Remote Sensing
• /
• v.31 no.3
• /
• pp.227-244
• /
• 2015

Synthetic Aperture Radar is able to provide images of wide coverage in day, night, and all-weather conditions. Recently, as the SAR image resolution improves up to the sub-meter level, their applications are rapidly expanding accordingly. Especially there is a growing interest in the use of geographic information of high resolution SAR images and the change detection will be one of the most important technique for their applications. In this paper, an automatic threshold tracking and change detection algorithm is proposed applicable to high-resolution SAR images. To detect changes within SAR image, a reference image is generated using log-ratio operator and its amplitude distribution is estimated through K-S test. Assuming SAR image has a non-gaussian amplitude distribution, a generalized thresholding technique is applied using Kittler and Illingworth minimum-error estimation. Also, MoLC parametric estimation method is adopted to improve the algorithm performance on rough ground target. The implemented algorithm is tested and verified on the simulated SAR raw data. Then, it is applied to the spaceborne high-resolution SAR images taken by Cosmo-Skymed and KOMPSAT-5 and the performances are analyzed and compared.

• Journal of Life Science
• /
• v.34 no.2
• /
• pp.86-93
• /
• 2024

Since replication of plasmids must be strictly controlled, plasmids that generally perform rolling circle replication generally maintain a constant copy number by strictly controlling the replication initiator Rep at the transcriptional and translational levels. Plasmid pJB01 contains three orfs (copA, repB, repC or repABC) consisting of a single operon. From analysis of amino acid sequence, pJB01 CopA was homologous to the Cops, as a copy number control protein, of other plasmids. When compared with a CopG of pMV158, CopA seems to form the RHH (ribbon-helix-helix) known as a motif of generalized repressor of plasmids. The result of gel mobility shift assay (EMSA) revealed that the purified fusion CopA protein binds to the operator region of the repABC operon. To examine the functional role of CopA on transcriptional level, 3 point mutants were constructed in coding frame of copA such as CopA R16M, K26R and E50V. The repABC mRNA levels of CopA R16M, K26R and E50V mutants increased 1.84, 1.78 and 2.86 folds more than that of CopA wt, respectively. Furthermore, copy numbers owing to mutations in three copA genes also increased 1.86, 1.68 and 2.89 folds more than that of copA wt, respectively. These results suggest that CopA is the transcriptional repressor, and lowers the copy number of pJB01 by reducing repABC mRNA and then RepB, as a replication initiator.