• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.104-115
• /
• 2001

A new content-based color image retrieval method integrating the features of the color adjacency and the gradient is proposed in this paper. As the most used feature of color image, color histogram has its own advantages that it is invariant to the changes in viewpoint and the rotation of the image etc., and the computation of the feature is simple and fast. However, it is difficult to distinguish those different images having similar color distributions using histogram-based image retrieval, because the color histogram is generated on uniformly quantized colors and the histogram itself contains no spatial information. And another shortcoming of the histogram-based image retrieval is the storage of the features is usually very large. In order to prevent the above drawbacks, the gradient that is the largest color difference of neighboring pixels is calculated in the proposed method instead of the uniform quantization which is commonly used at most histogram-based methods. And the color adjacency information which indicates major color composition feature of an image is extracted and represented as a binary form to reduce the amount of feature storage. The two features are integrated to allow the retrieval more robust to the changes of various external conditions.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1137-1145
• /
• 1996

A Steinhaus graph is a labelled graph whose adjacency matrix $A = (a_{i,j})$ has the Steinhaus property : $a_{i,j} + a{i,j+1} \equiv a_{i+1,j+1} (mod 2)$. We consider random Steinhaus graphs with n labelled vertices in which edges are chosen independently and with probability $\frac{1}{2}$. We prove that almost all Steinhaus graphs are Hamiltonian like as in random graph theory.

• Journal of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.841-857
• /
• 2009

In this paper, we give and study the notion of computer topological function space between computer topological spaces with $k_i$ adjacency, i $\in$ {0, 1}. Using this notion, we study various properties of topologies of a computer topological function space.

• Korean Journal of Mathematics
• /
• v.12 no.2
• /
• pp.201-209
• /
• 2004

We define the incidence matrices of oriented and nonoriented ${\kappa}$-hypergraphs, respectively. We discuss the ranks of some circulant matrices and show that the rank of the incidence matrices of oriented and nonoriented ${\kappa}$-hypergraphs H are $n$ under a certain condition on the ${\kappa}$-edge set or ${\kappa}$-arc set of H.

• Honam Mathematical Journal
• /
• v.25 no.1
• /
• pp.153-162
• /
• 2003

Recently, the generalized digital $(k_{0},\;k_{1})$-continuity and its properties are investigated. Furthermore, the k-type digital fundamental group for digital image has been studies with the generalized k-adjacencies. The main goal of this paper is to find some properties of the k-type digital fundamental group of Boxer and to investigate some properties of minimal simple closed k-curves with relation to their embedding into some spaces in ${\mathbb{Z}}^n(2{\leq}n{\leq}3)$.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.505-512
• /
• 2005

In this paper, we introduce another statement of a digital $(k_{0}, k_{1})-homeomorphism$ which is suitable for an approach to write an efficient algorithm for discriminating digital images with respect to the digital $(k_{0}, k_{1})-homeomorphism$.

• Korean Management Science Review
• /
• v.18 no.2
• /
• pp.87-96
• /
• 2001

Mobility of service users makes Registration and Paging (R/P) procedures indispensable features in mobile communication networks. Importance of optimizing the configuration of R/P areas has been increased by the growth of R/P related signaling. Given the network topology (cell locations and adjacency between them) and R/P related traffics generated by each cell, we deal with the problem of finding optimal R/P areas minimizing the amount of R/P related signalling while the constraints on paging channel capacity and network configurations are satisfied.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.2
• /
• pp.85-89
• /
• 1987

The large sparse matrix problems arise in many applications areas, such as structural analysis, network analysis. In dealing with such sparse systems proper preprogramming techniques such as permuting rows and columns simultaneously, will be needed in order to reduce the number of arithmetic operations and storage spaces.

• Honam Mathematical Journal
• /
• v.29 no.3
• /
• pp.341-350
• /
• 2007

A dynamical system with a skew-commuting involution map is called a flip system. Every flip system on a subshift of finite type is represented by a pair of matrices, one of which is a permutation matrix. The transposition number of this permutation matrix is studied. We define an invariant, called the flip number, that measures the complexity of a flip system, and prove some results on it. More properties of flips on subshifts of finite type with symmetric adjacency matrices are investigated.