• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.6
• /
• pp.538-549
• /
• 2005

This paper proposes a method of generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method consists of two steps: computing matchings between cardinality nodes and generating XSLT scripts. Matching relationships between cardinality nodes are computed by using Proposed lexical and structural similarities. Based on the cardinality node matching relationships, an XSLT script is generated. Experimental results show that the proposed method has generated XSLT scripts that support the faster transformation of XML documents, compared with previous works.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.1-12
• /
• 2021

A dominating set S of a graph G is said to be nonsplit dominating set if the subgraph ⟨V - S⟩ is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number and is denoted by ��ns(G). For a minimum nonsplit dominating set S of G, a set T ⊆ S is called a forcing subset for S if S is the unique ��ns-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing nonsplit domination number of S, denoted by f��ns(S), is the cardinality of a minimum forcing subset of S. The forcing nonsplit domination number of G, denoted by f��ns(G) is defined by f��ns(G) = min{f��ns(S)}, where the minimum is taken over all ��ns-sets S in G. The forcing nonsplit domination number of certain standard graphs are determined. It is shown that, for every pair of positive integers a and b with 0 ≤ a ≤ b and b ≥ 1, there exists a connected graph G such that f��ns(G) = a and ��ns(G) = b. It is shown that, for every integer a ≥ 0, there exists a connected graph G with f��(G) = f��ns(G) = a, where f��(G) is the forcing domination number of the graph. Also, it is shown that, for every pair a, b of integers with a ≥ 0 and b ≥ 0 there exists a connected graph G such that f��(G) = a and f��ns(G) = b.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1213-1231
• /
• 2007

The domination number ${\gamma}(G)$ of a graph G=(V,E) is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than ${\gamma}(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3\;and\;C_n$ for all n.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.1-11
• /
• 2010

The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.258-263
• /
• 2001

This paper complements the shortcomings of the original edge following algorithm. We propose a new edge following method which exploits the uncertainty residing in fingerprint analysis. Based on fuzzy set theory, the proposed algorithm computes the current local quality of a fingerplinL image by considering two Jocal properties: a relative cardinality of fuzzy set and a local variance. According to the calculated local quality infonnation, we dynamically adopt the appropriate different methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.140-145
• /
• 2008

Fuzzy partition is a conceptual vehicle that encapsulates data into information granules. Fuzzy equalization concerns a process of building information granules that are semantically and experimentally meaningful. A few algorithms generating fuzzy partitions with fuzzy equalization have been suggested. Simulations and experiments have showed that fuzzy partition representing more characteristics of given input distribution usually produces meaningful results. In this paper, given two points and cardinality of fuzzy partition, we prove that it is not true that there always exists a fuzzy partition with fuzzy equalization in which two of points having peaks fall on the given two points. Then, we establish an algorithm that minimizes the maximum distance between given two points and adjacent points having peaks in the partition. A numerical example is presented to show the validity of the suggested algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.264-270
• /
• 2011

A new method for creating a logical data model is proposed. The logical data model developed by the method defines table, primary key, foreign key, and fields. The framework of the logical data model is constructed by modeling the relationships between events and their related entity types. The proposed method consists of a series of objective and quantitative decisions such as maximum cardinality of relationships and functional dependency between the primary key and attributes. Even beginners to database design can use the methology as long as they understand such basic concepts about relational databases as primary key, foreign key, relationship cardinality, parent-child relationship, and functional dependency. The simple and systematic approach minimizes decision errors made by a database designer. In practial database design the method creates a logical data model in Boyce-Codd normal form unless the user of the method makes a critical decision error, which is very unlikely.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.667-673
• /
• 2019

Let A be a finite set of integers. For any integer $h{\geq}1$, let h-fold sumset hA be the set of all sums of h elements of A and let h-fold restricted sumset $h^{\wedge}A$ be the set of all sums of h distinct elements of A. In this paper, we give a survey of problems and results on sumsets and restricted sumsets of a finite integer set. In details, we give the best lower bound for the cardinality of restricted sumsets $2^{\wedge}A$ and $3^{\wedge}A$ and also discuss the cardinality of restricted sumset $h^{\wedge}A$.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.741-752
• /
• 2023

A new variant of vertex edge domination, namely semi total vertex edge domination has been introduced in the present paper. A subset S of the vertex set V of a graph G is said to be a semi total vertex edge dominating set(stved - set), if it is a vertex edge dominating set of G and each vertex in S is within a distance two of another vertex in S. An stved-set of G having minimum cardinality is said to be an γ_stve(G)- set and its cardinality is denoted by γ_stve(G). Bounds for γ_stve(G) - set have been given in terms of various graph theoretic parameters and graphs attaining the bounds have been characterized. In particular, bounds for trees have been obtained and extremal trees have been characterized.

• Korean Journal of Mathematics
• /
• v.31 no.4
• /
• pp.505-519
• /
• 2023

Let G = (V, E) be a graph. A subset S of V is called a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum cardinality taken over all dominating sets of G. A dominating set S is called a connected dominating set if the subgraph induced by S is connected. The minimum cardinality taken over all connected dominating sets of G is called the connected domination number of G, and is denoted by γ_c(G). In this paper, we investigate the Nordhaus-Gaddum type results for the connected domination number and its derived graphs like line graph, subdivision graph, power graph, block graph and total graph, and characterize the extremal graphs.