• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.683-695
• /
• 2007

A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph. In a recent article, the authors proved that a regular c-partite tournament with $r{\geq}2$ vertices in each partite set contains a cycle with exactly r-1 vertices from each partite set, with exception of the case that c=4 and r=2. Here we will examine the existence of cycles with r-2 vertices from each partite set in regular multipartite tournaments where the r-2 vertices are chosen arbitrarily. Let D be a regular c-partite tournament and let $X{\subseteq}V(D)$ be an arbitrary set with exactly 2 vertices of each partite set. For all $c{\geq}4$ we will determine the minimal value g(c) such that D-X is Hamiltonian for every regular multipartite tournament with $r{\geq}g(c)$.

• KOGO NEWS
• /
• v.6 no.1
• /
• pp.29-33
• /
• 2006

Gene set analysis is a new concept and method. to analyze and interpret microarray gene expression data and tries to extract biological meaning from gene expression data at gene set level rather than at gene level. Compared with methods which select a few tens or hundreds of genes before gene ontology and pathway analysis, gene set analysis identifies important gene ontology terms and pathways more consistently and performs well even in gene expression data sets with minimal or moderate gene expression changes. Moreover, gene set analysis is useful for comparing multiple gene expression data sets dealing with similar biological questions. This review briefly summarizes the rationale behind the gene set analysis and introduces several algorithms and tools now available for gene set analysis.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.263-269
• /
• 1996

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc(MVA) in the maximum flow problem. We first define the transformed network corresponding In a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for a MVA consists of the arcs whose flow is at least as greate as the flow over every arc in a minimal cut As a result, we present a method in which the MVA is determined more easily by computing the minimal capacity in the transformed network. The proposed method is demonstrated by numerical example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.115-124
• /
• 2000

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc in the maximum flow problem. We first define the transformed network corresponding to a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for single most vital arc consists of the arcs whose flow is at least as great as the flow over every arc in a minimal cut. As a result we present a method in which the most vital arc is determined more easily by computing the minimal capacity in the transformed network. the proposed method is demonstrated by numerical example and computational experiment.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2005.10a
• /
• pp.205-206
• /
• 2005

The plan for Shinseon Seolleongtang Restaurant in Kimpo has as its goal to create an environment strongly fused with the design of the modern city and the spirit of food culture craftsmanship, and it proceeded as follows. In order to carry out the goal of the plan, the direction of the design concept was set to be a harmonious blending of Ecology and Minimal. Also, for detailed plan direction, in the Minimal domain, conciseness, cleanliness, and high quality were established as the ultimate goals in order to create a spacious food and drink area in today's complicated and energy-draining society, and in the Ecology domain, ancient hieroglyphs representing the forms of natural objects were used that prayed for years of plentiful harvest and blessing, and colorfully expressed the events of the populace.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.595-603
• /
• 1992

It has been establisued that the reliability of communication networks is NP hard problem owing to computationally and complexity as the number of componeuts is Increased in large networks. This paper proposed an algorithm for determining upper and lower bounds In the reliability of source-to-terminal in communication networks to solve this problem. The evaluation method follows the next procedures. First, minimal pathset and minimal cut set are serched. Second, it is sorted that the number of components is the same events and the reliability bounds Is evaluated by the section function to extract common variable. The performance of proposed algorithm is also estimate(1 as compared to the reliability of Esary-Proschan, Shogan and Copal.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.49-53
• /
• 2011

In this paper, we adopt a numerical method to establish the smallest set to contain all Ger$\v{s}$gorin discs of a given complex matrix and its some similar matrices. With the smallest set, a new estimation for all eigenvalues of the matrix is obtained.

• Journal of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.837-851
• /
• 2014

We consider ${\omega}$-chaos as defined by S. H. Li in 1993. We show that c-dense ${\omega}$-scrambled sets are present in every transitive system with two-sided limit shadowing property (TSLmSP) and that every transitive map on topological graph has a dense Mycielski ${\omega}$-scrambled set. As a preliminary step, we provide a characterization of dynamical properties of maps with TSLmSP.

• MALSORI
• /
• no.35_36
• /
• pp.145-155
• /
• 1998

This study intended to determine the most appropriate POS(Part of Speech) sets for predicting prosodic boundary strength efficiently. We used 3-level POB bets which Kim(1997), one of the authors, has devised. Three POS sets differ from each other according to how much grammatical information they have: the first set has maximal syntactic and morphological information which possibly affects prosodic phrasing, and the third set has minimal one. We hand-labelled 150 sentences using each of three POS sets and conducted perception test. Based on the results of the test, stochastic language modeling method was used to predict prosodic boundary strength. The results showed that the use of each POS set led to not too much different efficiency in the prediction, but the second set was a little more efficient than the other two. As far as the complexity in stochastic language modeling is concerned, however, the third set may be also preferable.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.739-748
• /
• 2024

The intention of this paper is to acquaint domination, total domination on bipolar intuitionistic fuzzy graphs. Subsequently for bipolar intuitionistic fuzzy graphs the domination number and the total domination number are defined. Consequently we proved necessary and sufficient condition for a d-set to be minimal d-set, bounds for domination number and equality conditions for domination number and order.