• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.637-657
• /
• 2021

In this paper, we decompose (under unitary similarity) the Kronecker sum A ⊞ A (= A ⊗ I + I ⊗ A) into a direct sum of irreducible matrices, when A is a 3×3 matrix. As a consequence we identify 𝒦(A⊞A) as the direct sum of several full matrix algebras as predicted by Artin-Wedderburn theorem, where 𝒦(T) is the unital algebra generated by Tand T^*.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.34-43
• /
• 2012

Determining the similarity between two strings can be applied various area such as information retrieval, spell checker and spam filtering. Similarity calculation between Korean strings based on dynamic programming methods firstly requires a definition of the similarity between phonemes. However, existing methods have a limitation that they use manually set similarity scores. In this paper, we propose a method to automatically calculate inter-phoneme similarity from a given set of variant words using a PAM-like probabilistic model. Our proposed method first finds the pairs of similar words from a given word set, and derives derivation rules from text alignment results among the similar word pairs. Then, similarity scores are calculated from the frequencies of variations between different phonemes. As an experimental result, we show an improvement of 10.1%~14.1% and 8.1%~11.8% in terms of sensitivity compared with the simple match-mismatch scoring scheme and the manually set inter-phoneme similarity scheme, respectively, with a specificity of 77.2%~80.4%.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.47 no.5
• /
• pp.379-383
• /
• 2002

Allelic diversity of 44 microsatellite marker loci originated from the coding regions of specific genes or the non-coding regions of barley genome was analyzed for 19 barley genotypes. Multi-allelic variation was observed at the most of marker loci except for HVM13, HVM15, HVM22, and HVM64. The number of different alleles ranged from 2 to 12 with a mean of 4.0 alleles per micro-satellite. Twenty-one alleles derived from 10 marker loci are specific for certain genotypes. The level of polymorphism (Polymorphic Information Content, PIC) based on the band pattern frequencies among genotypes was relatively high at the several loci such as HVM3, HVM5, HVM14, HVM36, HVM62 and HVM67. In the cluster analysis using genetic similarity matrix calculated from microsatellite-derived DNA profiles, two major groups were classified and the spike-row type was a major factor for clustering. Correlation between genetic similarity matrices based on microsatellite markers and pedigree data was highly significant ($r=0.57^{**}$), but these two parameters were moderately associated each other. On the other hand, RAPD-based genetic similarity matrix was more highly associated with microsatellite-based genetic similarity ($r=0.63^{**}$) than coefficient of parentage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2052-2058
• /
• 2009

As the operating frequency of digital system increases and voltage swing decreases, an accurate and high speed analysis of PCB board becomes very important. Transmission matrix method, which use the multiple products of unit column matrix, is the highest speedy method in PCB board analysis. In this paper a new method to reduce the calculation time of PCB board impedances is proposed. First, in this method the eigenvalue and eigenvectors of the transmission matrix for unit column of PCB are calculated and the transmission matrix for the unit column is transformed using similarity transform to reduce the number of multiplication on the matrix elements. This method using the similarity transform can reduce the calculation time greatly comparing the previous method. The proposed method is applied to the 1.3 inch by 1.9 inch board and shows about 10 times reduction of calculation time. This method can be applied to the PCB design which needs a lots of repetitive calculation of board impedances.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.255-264
• /
• 2008

This paper proposes a novel method using K-means and Non-negative matrix factorization (NMF) for topic -based multi-document summarization. NMF decomposes weighted term by sentence matrix into two sparse non-negative matrices: semantic feature matrix and semantic variable matrix. Obtained semantic features are comprehensible intuitively. Weighted similarity between topic and semantic features can prevent meaningless sentences that are similar to a topic from being selected. K-means clustering removes noises from sentences so that biased semantics of documents are not reflected to summaries. Besides, coherence of document summaries can be enhanced by arranging selected sentences in the order of their ranks. The experimental results show that the proposed method achieves better performance than other methods.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1090-1102
• /
• 2006

This paper suggests a new algorithm for detecting the plagiarism among a set of source codes, constrained to be functionally equivalent, such are submitted for a programming assignment or for a programming contest problem. The typical algorithms largely exploited up to now are based on Greedy-String Tiling, which seeks for a perfect match of substrings, and analysis of similarity between strings based on the local alignment of the two strings. This paper introduces a new method for detecting the similar interval of the given programs based on an adaptive similarity matrix, each entry of which is the logarithm of the probabilities of the keywords based on the frequencies of them in the given set of programs. We experimented this method using a set of programs submitted for more than 10 real programming contests. According to the experimental results, we can find several advantages of this method compared to the previous one which uses fixed similarity matrix(+1 for match, -1 for mismatch, -2 for gap) and also can find that the adaptive similarity matrix can be used for detecting various plagiarism cases.

• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.202-204
• /
• 2006

A new method is presented to design RF filters without the Similarity Transform of their coupling coefficient matrix as circuit parameters which is very tedious due to pivoting and deciding rotation angles needed during the iterations. The transfer function of a filter is directly used for the design and its desired form is derived by the optimized rational-function fitting technique. A 3rd order Coaxial Lowpass filter and an 8th order dual-mode elliptic integral function response filter are taken as an example to validate the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1346-1353
• /
• 2007

In this paper, the methods are presented for the calculation of general coupling coefficient matrixes used in the band pass filter design. They are calculated from transmission coefficient($S_{21}$) and reflection coefficient($S_{11}$) with desired characteristics derived from the poles of filter function and return loss(RL). The calculated matrixes from this method are transformed to the folded canonical filter structure using similarity transformation which lends us the practical filter design. Based on the resulting matrix, the folded canonical filter has been designed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.6
• /
• pp.599-605
• /
• 2003

A dual-mode asymmetric canonical filter is widely used in an input demultiplexer for satellite transponder. This paper deals with a simple synthesis method fur an asymmetric canonical filter. The coupling matrix of an asymmetric canonical filter is obtained by applying plane rotation technique to the coupling matrix of a symmetric canonical filter. This paper gives a list of pivots and rotation angles to obtain the coupling matrix of asymmetric canonical structure filters. The coupling matrix of 8th and 10th order asymmetric canonical filter is obtained by this proposed method. It is shown that the frequency response of asymmetric canonical filter is identical to that of symmetric canonical filter.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.367-376
• /
• 2002

XML allows users to define elements using arbitrary words and organize them in a nested structure. These features of XML offer both challenges and opportunities in information retrieval and document management. In this paper, we propose a new methodology for computing similarity considering XML semantics - meanings of the elements and nested structures of XML documents. We generate extended-element vectors, using thesaurus, to normalize synonyms, compound words, and abbreviations and build similarity matrix using them. And then we compute similarity between XML elements. We also discover and minimize XML structure using automata(NFA(Nondeterministic Finite Automata) and DFA(Deterministic Finite automata). We compute similarity between XML structures using similarity matrix between elements and minimized XML structures. Our methodology considering XML semantics shows 100% accuracy in identifying the category of real documents from on-line bookstore.