• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.4
• /
• pp.15-20
• /
• 1982

Stabilization by decentralized control is an important problem in large scale systems and there has been an increasing interest in this area. The objective of this paper is to obtain the sufficient condition for an interconnected system to be stabilited by local feedback. Recently there has been many papers about this, and we further broaden the class of interconnections for which we can find a decentralized control to stabilize the overall system. The interconnection matrix may take any arbitrary time invariant values and this implies connective stability in some sense. The assumed model is mire general than most of previous ones, and as a special case, when each subsystem is given by companion form of a single inputs the result is compared with that of Ikeda and Siljak. The obtained result is illustrated by examples.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.6
• /
• pp.404-414
• /
• 2009

In the computational molecular analysis, 3D structural comparison for protein searching plays a very important role. As protein databases have been grown rapidly in size, exhaustive search methods cannot provide satisfactory performance. Because exhaustive search methods try to handle the structure of protein by using sphere set which is converted from atoms set, the similarity calculation about two sphere sets is very expensive. Instead, the filter-and-refine paradigm offers an efficient alternative to database search without compromising the accuracy of the answers. In recent, a very fast algorithm based on the inter-atomic distance has been suggested by Ballester and Richard. Since they adopted the moments of distribution with inter-atomic distance between atoms which are rotational invariant, they can eliminate the structure alignment and orientation fix process and perform the searching faster than previous methods. In this paper, we propose a new 3D shape descriptor. It has properties of the general shape distribution and useful property in screening the molecular database. We show some experimental results for the validity of our method.

• Journal of Computational Design and Engineering
• /
• v.2 no.2
• /
• pp.79-87
• /
• 2015

Surface segmentation and edge feature lines extraction from fractured fragments of relics are essential steps for computer assisted restoration of fragmented relics. As these fragments were heavily eroded, it is a challenging work to segment surface and extract edge feature lines. This paper presents a novel method to segment surface and extract edge feature lines from triangular meshes of irregular fractured fragments. Firstly, a rough surface segmentation is accomplished by using a clustering algorithm based on the vertex normal vector. Secondly, in order to differentiate between original and fracture faces, a novel integral invariant is introduced to compute the surface roughness. Thirdly, an accurate surface segmentation is implemented by merging faces based on face normal vector and roughness. Finally, edge feature lines are extracted based on the surface segmentation. Some experiments are made and analyzed, and the results show that our method can achieve surface segmentation and edge extraction effectively.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.657-668
• /
• 2016

Given a partition ${\lambda}=({\lambda}_1,{\lambda}_2,{\ldots},{\lambda}_l)$ of a positive integer n, let Tab(${\lambda}$, k) be the set of all tabloids of shape ${\lambda}$ whose weights range over the set of all k-compositions of n and ${\mathcal{OP}}^k_{\lambda}_{rev}$ the set of all ordered partitions into k blocks of the multiset $\{1^{{\lambda}_l}2^{{\lambda}_{l-1}}{\cdots}l^{{\lambda}_1}\}$. In [2], Butler introduced an inversion-like statistic on Tab(${\lambda}$, k) to show that the rank-selected $M{\ddot{o}}bius$ invariant arising from the subgroup lattice of a finite abelian p-group of type ${\lambda}$ has nonnegative coefficients as a polynomial in p. In this paper, we introduce an inversion-like statistic on the set of ordered partitions of a multiset and construct an inversion-preserving bijection between Tab(${\lambda}$, k) and ${\mathcal{OP}}^k_{\hat{\lambda}}$. When k = 2, we also introduce a major-like statistic on Tab(${\lambda}$, 2) and study its connection to the inversion statistic due to Butler.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.1017-1045
• /
• 2016

Using a combination of calculational and theoretical approaches, we establish results that relate two knot invariants, the Alexander polynomial, and the number of quandle colourings using any finite linear Alexander quandle. Given such a quandle, specified by two coprime integers n and m, the number of colourings of a knot diagram is given by counting the solutions of a matrix equation of the form AX = 0 mod n, where A is the m-dependent colouring matrix. We devised an algorithm to reduce A to echelon form, and applied this to the colouring matrices for all prime knots with up to 10 crossings, finding just three distinct reduced types. For two of these types, both upper triangular, we found general formulae for the number of colourings. This enables us to prove that in some cases the number of such quandle colourings cannot distinguish knots with the same Alexander polynomial, whilst in other cases knots with the same Alexander polynomial can be distinguished by colourings with a specific quandle. When two knots have different Alexander polynomials, and their reduced colouring matrices are upper triangular, we find a specific quandle for which we prove that it distinguishes them by colourings.

• Journal of Aquaculture
• /
• v.22 no.1
• /
• pp.51-55
• /
• 2009

Transcriptional response of the second isoform of glyceraldehyde (GAPDH-2) to infectious challenges using various bacterial species and the rockbream iridovirus (RBIV) was examined in the spleen of the barred knifejaw (Oplegnathus fasciatus). Bacterial challenges of the juvenile barred knifejaws with Escherichia coli, Edwardsiella tarda, Vibrio anguillarum and Streptococcus iniae resulted in the significant elevation of the GAPDH-2 transcripts in the spleen up to 12-fold relative to that in the non-challenged controls (PBS-injected). In addition, the barred knifejaw fingerlings injected with RBIV stock also represented the highly upregulated mRNA expression of the GAPDH-2 up to more than 20-fold when compared to that of control fingerings. Results obtained from this study strongly suggest that the GAPDH-2 is no longer a housekeeping glycolytic protein and rather than that it might be associated with immune-relevant cellular activities. From this finding, the traditional dogma for the use of GAPDH as an invariant standard for gene expression assays should be carefully revised depending on the kinds of biological stimulations applied in this species.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1636-1645
• /
• 1996

In this paper we proposed a new scheme for conditional two dimensional (2-D)moment-based classification of patterns on the basis of Gibbs random fields which are will suited for representing spatial continuity that is the characteristic of the most images. This implementation contains two parts: feature extraction and pattern classification. First of all, we extract feature vector which consists of conditional 2-D moments on the basis of estimated Gibbs parameter. Note that the extracted feature vectors are invariant under translation, rotation, size of patterns the corresponding template pattern. In order to evaluate the performance of the proposed scheme, classification experiments with training document sets of characters have been carried out on 486 66Mhz PC. Experiments reveal that the proposed scheme has high classification rate over 94%.

• Journal of Power Electronics
• /
• v.16 no.3
• /
• pp.1131-1140
• /
• 2016

A simple design for a sliding mode observer is proposed for EV lithium battery SOC estimation in this paper. The proposed observer does not have the limiting conditions of existing observers. Compared to the design of previous sliding mode observers, the new observer does not require a solving matrix equation and it does not need many observers for all of the state components. As a result, it is simple in terms of calculations and convenient for engineering applications. The new observer is suitable for both time-variant and time-invariant models of battery SOC estimation, and the robustness of the new observer is proved by Liapunov stability theorem. Battery tests are performed with simulated FUDS cycles. The proposed observer is used for the SOC estimation on both unchanging parameter and changing parameter models. The estimation results show that the new observer is robust and that the estimation precision can be improved base on a more accurate battery model.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.50 no.9
• /
• pp.431-437
• /
• 2001

Since the eddy current problem usually depends on the geometry of the moving conductive sheet and the shape of the pole projection area, there is no general method to find out its analytical solution. The analysis of the eddy current in a rotating disk is performed in the case of time-invariant field to find its analytical solution. As a method to solve the eddy current problem, the concept of the Coulomb charge and image method are proposed with the consideration of the boundary condition. Firstly, the line charge is obtained from the volume charge generated in the rotating disk and Coulomb's law is applied. Secondly, the finite disk radius is considered by introducing an imaginary eddy current to satisfy the boundary condition that the radial component of the eddy current is zero at the edge of the relating disk. Thirdly, the braking torque is calculated by applying Lorentz force law. Finally, the computed braking torque is compared with the measured one As a result, it can be said that the proposed model presents fairly accurate results in a low angular velocity range although a large error is observed as the angular velocity of the disk increases.