• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.156-160
• /
• 2005

We introduce a fully automatic clustering method to classier candidate paralog clusters from a set of protein sequences within one genome. A set of protein sequences is represented as a set of nodes, each represented by the amino acid sequence for a protein with the sequence similarities among them constituting a set of edges in a graph of protein relationships. We use graph-based clustering methods to identify structurally consistent sets of nodes which are strongly connected with each other. Our results are consistent with those from current leading systems such as COG/KOG and KEGG based on manual curation. All the results are viewable at http://www.cs.rutgers.edu/${\sim}$seabee.

• Kyungpook Mathematical Journal
• /
• v.55 no.4
• /
• pp.753-771
• /
• 2015

A complete invariant defined for (closed connected orientable) 3-manifolds is an invariant defined for the 3-manifolds such that any two 3-manifolds with the same invariant are homeomorphic. Further, if the 3-manifold itself can be reconstructed from the data of the complete invariant, then it is called a characteristic invariant defined for the 3-manifolds. In a previous work, a characteristic lattice point invariant defined for the 3-manifolds was constructed by using an embedding of the prime links into the set of lattice points. In this paper, a characteristic rational invariant defined for the 3-manifolds called the characteristic genus defined for the 3-manifolds is constructed by using an embedding of a set of lattice points called the PDelta set into the set of rational numbers. The characteristic genus defined for the 3-manifolds is also compared with the Heegaard genus, the bridge genus and the braid genus defined for the 3-manifolds. By using this characteristic rational invariant defined for the 3-manifolds, a smooth real function with the definition interval (-1, 1) called the characteristic genus function is constructed as a characteristic invariant defined for the 3-manifolds.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.11
• /
• pp.140-148
• /
• 1993

High Integration ratio of CMOS circuits incredily increases the test cost during the design and fabrication processes because of the FET fault(Stuck-on faults and Stuck-off faults) which are due to the operational characteristics of CMOS circuits. This paper proposes a test generation algorithm for an arbitrarily large CMOS circuit, which can unify the test steps during the design and fabrication procedure and be applied to both static and dynaic circuits. This algorithm uses the logic equations set for the subroutines resulted from arbitrarily dividing the full circuit hierarchically or horizontally. Also it involves a driving procedure from output stage to input stage, in which to drive a test set corresponding to a subcircuit, only the subcircuits connected to that to be driven are used as the driving resource. With this algorithm the test cost for the large circuit such as VLSI can be reduced very much.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.10 no.2
• /
• pp.143-151
• /
• 2010

In this work, we propose a single electron memory 'SEM' design which consist of two key blocs: A memory bloc, with a voltage source $V_{Mem}$, a pure capacitor connected to a tunnel junction through a metallic memory node coupled to the second bloc which is a Single Electron Transistor "SET" through a coupling capacitance. The "SET" detects the potential variation of the memory node by the injection of electrons one by one in which the drainsource current is presented during the memory charge and discharge phases. We verify the design of the SET/SEM cell by the SIMON tool. Finally, we have developed a MAPLE code to predict the retention time and nonvolatility of various SEM structures with a wide operating temperature range.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.287-302
• /
• 2008

The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that V(D) = $V(C_1)\;{\cup}\;V(C_2)$, and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that $V(C_1)\;{\cup}\;V(C_2)$ contains vertices of all partite sets of D. The problem of complementary cycles in 2-connected tournaments was completely solved by Reid [4] in 1985 and Z. Song [5] in 1993. They proved that every 2-connected tournament T on at least 8 vertices has complementary cycles of length t and ${\mid}V(T)\mid$ - t for all $3\;{\leq}\;t\;{\leq}\;{\mid}V(T)\mid/2$. Recently, Volkmann [8] proved that each regular multipartite tournament D of order ${\mid}V(D)\mid\;\geq\;8$ is cycle complementary. In this article, we analyze multipartite tournaments that are weakly cycle complementary. Especially, we will characterize all 3-connected c-partite tournaments with $c\;\geq\;3$ that are weakly cycle complementary.

• Kyungpook Mathematical Journal
• /
• v.51 no.3
• /
• pp.293-300
• /
• 2011

In this paper, we obtain that the space $\mathcal{W}_2$ of minimally supported frequency wavelets, the supports of whose Fourier transforms consist of two intervals, is path-connected.

• The Pure and Applied Mathematics
• /
• v.4 no.2
• /
• pp.145-149
• /
• 1997

Suppose $\Omega$ is a bounded n-connected domain in C with $C^2$ smooth boundary. Then we prove that the Szego kernel extends continuously to $\Omega\times\Omega$ except the boundary diagonal set.

• Kyungpook Mathematical Journal
• /
• v.63 no.1
• /
• pp.123-129
• /
• 2023

For an ordered set W = {w₁, w₂, . . . , w_k} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w₁), d(v, w₂), . . . , d(v, w_k)) is called the metric representation of v with respect to W, where d(x, y) is the distance between the vertices x and y. A set W is called a resolving set for G if distinct vertices of G have distinct metric representations with respect to W. The minimum cardinality of a resolving set for G is its metric dimension dim(G), and a resolving set of minimum cardinality is a basis of G. The corona product, G ⊙ H of graphs G and H is obtained by taking one copy of G and n(G) copies of H, and by joining each vertex of the ith copy of H to the ith vertex of G. In this paper, we obtain bounds for dim(G ⊙ K₁), characterize all graphs G with dim(G ⊙ K₁) = dim(G), and prove that dim(G ⊙ K₁) = n - 1 if and only if G is the complete graph K_n or the star graph K_1,n-1.

• Journal of Power Electronics
• /
• v.15 no.4
• /
• pp.1006-1017
• /
• 2015

This paper presents a finite control set model predictive control (FCS-MPC) strategy for the AC/DC matrix converter used in grid-connected battery energy storage system (BESS). First, to control the grid current properly, the DC current is also included in the cost function because of input and output direct coupling. The DC current reference is generated based on the dynamic relationship of the two currents, so the grid current gains improved transient state performance. Furthermore, the steady state error is reduced by adding a closed-loop. Second, a Luenberger observer is adopted to detect the AC input voltage instead of sensors, so the cost is reduced and the reliability can be enhanced. Third, a switching state pre-selection method that only needs to evaluate half of the active switching states is presented, with the advantages of shorter calculation time, no high dv/dt at the DC terminal, and less switching loss. The robustness under grid voltage distortion and parameter sensibility are discussed as well. Simulation and experimental results confirm the good performance of the proposed scheme for battery charging and discharging control.