• Bulletin of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1649-1654
• /
• 2014

A tournament T is an orientation of a complete graph and an arc in T is called pancyclic if it is contained in a cycle of length l for all $3{\leq}l{\leq}n$, where n is the cardinality of the vertex set of T. In 1994, Moon [5] introduced the graph parameter h(T) as the maximum number of pancyclic arcs contained in the same Hamiltonian cycle of T and showed that $h(T){\geq}3$ for all strong tournaments with $n{\geq}3$. Havet [4] later conjectured that $h(T){\geq}2k+1$ for all k-strong tournaments and proved the case k = 2. In 2005, Yeo [7] gave the lower bound $h(T){\geq}\frac{k+5}{2}$ for all k-strong tournaments T. In this note, we will improve his bound to $h(T){\geq}\frac{2k+7}{3}$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.214-219
• /
• 2007

생성 규칙(Production Rule)과 이를 기반으로 하는 규칙 엔진(Rule Engine)을 기반으로 한 OWL 추론 엔진은 메타 규칙((Meta Rule)에 의존해 왔다. 메타 규칙은 OWL의 의미론 (Semantics)을 표현하기 용이하여 보다 손쉽게 OWL 추론 엔진을 구현할 수 있다는 장점을 제공하였으나 OWL 추론 성능에 있어 추론 속도와 대용량 온톨로지 처리 측면에서 모두 만족할 만한 성과를 얻지 못하였다. 본 논문은 DLP(Description Logic Programming)의 번역 접근법을 기반으로 한 번역 규칙(Translation Rules)을 메타 규칙과 혼용하는 OWL 추론 기법을 소개한다. LUBM 벤치마크를 통해 이 기법이 메타 규칙만을 이용했을 때 보다 100% 이상 추론 성능을 향상시켰을 뿐 아니라 메모리 사용량도 대폭 축소시켰음을 확인할 수 있었다. 또한, 번역을 통해 제한없는 차수 제약(Cardinality Restriction) 관련 추론을 지원하는 등 보다 넓은 범위의 OWL 추론을 지원할 수 있다.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.25-29
• /
• 2007

In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1109-1112
• /
• 2002

A non-coherent synchronous all-optical code-division multiple-access (CDMA) network is proposed. In this network, symmetric codes derived from prime sequence codes are used. We present the construction of symmetric codes and show that the pseudo-orthogonality of the new codes is the same as that of the original prime-sequence codes while the cardinality of the new codes is larger than that of the prime sequence codes and the modified prime codes in the same field GF(p). Therefore, an optical CDMA LAN using symmetric codes can have a larger number of potential subscribers. The new codes allow designing fully programmable serial all-optical transmitter and receiver suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that compared to systems using modified prime codes the proposed system can achieve better BER performance for low received chip optical power.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.33-44
• /
• 1990

An efficient algorithm is developed for the linear programming relaxation of generalized multiple choice knaspack problem. The generalized multiple choice knaspack problem is an extension of the multiple choice knaspack problem whose relaxed LP problem has been studied extensively. In the worst case, the computational coimplexity of the proposed algorithm is of order 0(n. $n_{max}$)$^{2}$), where n is the total number of variables and $n_{max}$ denotes the cardinality of the largest multiple choice set. The algorithm can be easily embedded in a branch-and-bound procedure for the generalized multiple choice knapsack problem. A numerical example is presented and computational aspects are discussed.sed.

• Korean Journal of Mathematics
• /
• v.5 no.2
• /
• pp.177-183
• /
• 1997

Let ${\sigma}(X,x_0,G)$ be the fundamental group of a transformation group (X,G). Let $R({\varphi},{\psi})$) be the generalized Reidemeister number for an endomorphism $({\varphi},{\psi}):(X,G){\rightarrow}(X,G)$. In this paper, our main results are as follows ; we prove some sufficient conditions for $R({\varphi},{\psi})$ to be the cardinality of $Coker(1-({\varphi},{\psi})_{\bar{\sigma}})$, where 1 is the identity isomorphism and $({\varphi},{\psi})_{\bar{\sigma}}$ is the endomorphism of ${\bar{\sigma}}(X,x_0,G)$, the quotient group of ${\sigma}(X,x_0,G)$ by the commutator subgroup $C({\sigma}(X,x_0,G))$, induced by (${\varphi},{\psi}$). In particular, we prove $R({\varphi},{\psi})={\mid}Coker(1-({\varphi},{\psi})_{\bar{\sigma}}){\mid}$, provided that (${\varphi},{\psi}$) is eventually commutative.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.127-133
• /
• 1997

O. Mayer[9] introduced an almost linear space (als), a generalization of a linear space. The notion of a basis for an als was introduced by G. Godini[3]. Later, man properties of an als established by a number of authors. In this paper, we prove that the cardinality of bases for an als is unique. All spaces involved in this paper are over the real field $R$. Let us denote by $R_+$ the set ${\lambda \in R : \lambda \geq 0}$. We recall some definitions used in this paper.

• The Pure and Applied Mathematics
• /
• v.2 no.1
• /
• pp.43-51
• /
• 1995

In this paper, we introduce the almost linear spaces, a generalization of linear spaces. We prove that if the almost linear space X has a finite basis then, as in the case of a linear space, the cardinality of bases for the almost linear space X is unique. In the case X = Wx ＋ Vx, we prove that B'= {$\chi$'$_1,...,x'_n} is a basis for the algebraic dual X$^#$ of X if B = {$\chi$'$_1,...,x'_n} is a basis for the almost linear space X. And we have an example X($\neq$Wx ＋ Vx) which has no such a basis.

• East Asian mathematical journal
• /
• v.26 no.5
• /
• pp.655-670
• /
• 2010

The complete multipartite graph $K_{n(m)}$ with n $ {\geq}$ 4 partite sets of size m is shown to have a decomposition into 4-cycles in such a way that vertices of each cycle belong to distinct partite sets of $K_{n(m)}$, if 4 divides the number of edges. Such cycles are called gregarious, and were introduced by Billington and Hoffman ([2]) and redefined in [3]. We independently came up with the result of [3] by using a difference set method, and improved the result so that the composition is circulant, in the sense that it is invariant under the cyclic permutation of partite sets. The composition is then used to construct gregarious 4-cycle decompositions when one partite set of the graph has different cardinality than that of others. Some results on joins of decomposable complete multipartite graphs are also presented.