• 산업기술연구
• /
• 제21권A호
• /
• pp.141-146
• /
• 2001

XML is fast emerging as the dominant standard to represent and exchange data in the Web. As the amount of data available in the Web has increased dramatically in recent years, the data resides in different forms ranging from semi-structured data to highly structured data in relational database. As semi-structured data will be represented by XML, XML will increase the ability of semi-structured data. In this paper, we propose an idea for extracting schema in XML document using DTD.

• Journal of applied mathematics & informatics
• /
• 제36권5_6호
• /
• pp.419-428
• /
• 2018

Let us think of adding each digit of a natural number, in bases b, that are e-powered. By studying for a number becoming greater than or equal to oneself, we will consider values of ${\lim}_{b{\rightarrow}{\infty}}{\frac{N(e,b)}{b^e}}$.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.31-41
• /
• 1992

An extension of generalized linear multiple choice knapsack problem [1] is presented and an algorithm of order 0([n .n$_{max}$]$_{2}$) is developed by exploiting its extended properties, where n and n$_{max}$ denote the total number of variables and the cardinality of the largest multiple choice set, respectively. A numerical example is presented and computational aspects are discussed.sed.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.525-532
• /
• 2004

For two vertices u and v of an oriented graph D, the set I(u, v) consists of all vertices lying on a u-v geodesic or v-u geodesic in D. If S is a set of vertices of D, then I(S) is the union of all sets 1(u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the subsets S of V(D) with I(S) = V(D). In this paper, we give a partial answer for the conjecture by G. Chartrand and P. Zhang and present some results on orient able geodetic number.

• 한국경영과학회지
• /
• 제26권3호
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

• Kyungpook Mathematical Journal
• /
• 제56권3호
• /
• pp.745-754
• /
• 2016

In a graph G = (V, E), a non-empty set $S{\subseteq}V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by ${\rho}^{\circ}$. In this paper, we examine the effect of ${\rho}^{\circ}$ when G is modified by deleting a vertex.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 춘계학술대회 학술발표 논문집
• /
• pp.250-255
• /
• 2001

본 논문은 지문 이미지에 존재하는 애매함을 퍼지 로직을 이용한 표현으로 기존의 융선 추적법의 단점을 보완한다. 지문의 근방의 질을 퍼지 집합의 상대 크기와 근방 명암의 분산을 이용하여 판단한 후 근방의 지문의 질이 좋고 나쁨에 즉각적으로 다른 방법을 사용하여 지문의 융선을 추적하는 새로운 융선 추적법을 제안 설계한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2019년도 춘계학술발표대회
• /
• pp.33-35
• /
• 2019

서로 다른 아이템 집합의 연관성을 분석하는 것을 연관규칙분석이라 한다. 대표적인 알고리즘으로 Apriori 알고리즘이 있지만 DB스캔 횟수가 많아질 수 있고 후보 집합 생성으로 인해서 속도가 느려질 수 있다는 단점이 있다. 이를 효율적으로 개선한 FP-Growth 알고리즘을 구현하여 임의의 데이터를 이용하여 알고리즘의 속도에 대해 연구한다.

• 호남수학학술지
• /
• 제43권1호
• /
• pp.17-25
• /
• 2021

A set D ⊆ V (G) is an independent transversal dominating set of G if D is a dominating set and also intersects every maximum independent set in G. The minimum cardinality of such a set is equal to the transversal domination number, denoted by ��it(G). This paper is devoted to the computation of the independent transversal domination number of some complementary prism.

• 대한수학회보
• /
• 제58권1호
• /
• pp.253-267
• /
• 2021

We study linearly dependent subsets with prescribed cardinality s of a multiprojective space. If the set S is a circuit, there is an upper bound on the number of factors of the minimal multiprojective space containing S. B. Lovitz gave a sharp upper bound for this number. If S has higher dependency, this may be not true without strong assumptions (and we give examples and suitable assumptions). We describe the dependent subsets S with #S = 6.