• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.153-162
• /
• 2011

The minimum cut problem is to minimize c(S,T), that is, to determine source S and sink T such that the capacity of the S-T cut is minimal. The flow-based algorithm is mostly used to find the bottleneck arcs by calculating flow network, and does not presents the minimum cut. This paper suggests an algorithm that simply includes the maximum capacity vertex to adjacent set S or T and finds the minimum cut without obtaining flow network in advance. On applying the suggested algorithm to 13 limited graphs, it can be finds the minimum cut value $_{\min}c$(S, T) with simply and correctly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• 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).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.27-33
• /
• 2019

The min-cut problem that decides the maximum flow in a complex network flows from source(s) to sink(t) is known as a hard problem. The augmenting path algorithm divides into single path and decides the bottleneck point(edge), but the min-cut section to be decide additionally. This paper suggests O(n) time complexity heuristic greedy algorithm for the number of vertices n that applies free agent system in a pro-sports field. The free agent method assumes $N_G(S),N_G(T)$vertices among $v{\in}V{\backslash}\{s,t\}$to free agent players, and this players transfer into the team that suggest more annual income. As a result of various networks, this algorithm can be finds all of min-cut sections and min-cut value for whole cases.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2003.07a
• /
• pp.193-198
• /
• 2003

가. 시금치를 기계로 일시에 수확하기 위해서는 기계파종에 의한 균일한 재배가 선행되어야 한다. 나. 시금치 수확요인시험 결과는 다음과 같다. (1) 절단날의 경사각이 0$^{\circ}$일 때 토양절단부하가 가장 적고 토양거동변화가 적어 시금치의 수확에 유리하였다. (2) 시금치 뿌리절단시험에서 뿌리절단날 종류별 뿌리절단부하는 산형 뿌리절단날의 내각이 작을수록 작았고, 일자날 일 때 크게 나타나는 경향을 보였으며, 일자날이 뿌리절단날의 토양절단 깊이에 대한 평균 뿌리절단길이가 가장 근접한 것으로 나타났다. (3) 뿌리가 절단된 시금치를 걷어올리는 시험에서는 주행속도 0.3m/sec, 체인컨베이어의 이송속도 0.5m/sec, 체인컨베이어의 이송각도 24$^{\circ}$, 지면에서 체인의 높이가 5cm 일 때 뿌리절단깊이 4cm 이하에서 시금치의 걷어올림 및 흙 분리가 양호한 것으로 나타났다. (중략)

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.10a
• /
• pp.151-152
• /
• 2006

• Applied Biological Chemistry
• /
• v.38 no.6
• /
• pp.522-527
• /
• 1995

To develop an antiviral agent for the rice black-streaked dwarf virus (RBSDV), a hammerhead type ribozyme, which has a potential target site on the genome segment 3, was designed. Oligonucleotides for the ribozyme and its substrate were synthesized, annealed, and cloned into a plasmid pBluescript II KS(+). Ribozyme and substrate RNAs were then synthesized by in vitro transcription with $T_3$ RNA polymerase, obtaining RNAs in expected size, 193 and 182 nucleotides, respectively. The substrate RNA was efficiently cleaved into two fragments when incubated with the ribozyme at $55^{\circ}C$, while the cleavage was not detected at $37^{\circ}C$. In addition, the segment 3 RNA of RBSDV was also cleaved into two fragments by the same ribozyme at $55^{\circ}C$. Taken together, our results demonstrated that the hammerhead ribozyme has an in vitro endonucleolytic activity and may be used as an antiviral agent in transgenic plants.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.418-421
• /
• 2005

The objective of this research work is to investigate the effects of process parameters, such as power of laser, travel speed of laser and material thickness, on kerfwidth and characteristics of the cut surface for the case of cutting of CSP 1N sheet using high power continuous wave Nd:YAG laser. In order to find relationship between the process parameters on the quality of the cut section, such as kerfwidth, surface roughness and the striation formation, several laser cutting experiments are carried out. From the results of experiments, an optimal cutting speed for each cutting condition has been obtained to improve the quality of the cut surface.

• Journal of the Korean Chemical Society
• /
• v.42 no.2
• /
• pp.209-213
• /
• 1998

The higher order structure of Pseudomonas alcaligenes 5S rRNA has been investigated by using ($\eta^{6}$-mesitylene) manganese (Ⅰ) tricarbonyl hexafluorophosphate[MTH-Mn (Ⅰ)], dimethylpyrocarbonate, potassium permanganate as chemical probes. The sequences cleaved strongly by MTH-Mn (Ⅰ) on the tertiary structure of the 5S rRNA are $G_{12}AUGG_{16}$ of loop a, $G_{51}AAGUGAAGC_{60}$ of the region b-C, $U_{65}-AGCG_{69}$. of the region B-a, and $G_{72}AUGG_{76}$ of loop d. Based on such cleavage patterns of 5S rRNA by MTH-Mn(Ⅰ) and other chemical probes, we presume that the sequences strongly cleaved form pocket-like structure as in the the corner of L structure of $tRNA^{Phe}$. We also presume that the region b-C and loop d together play a role of hinge in forming the pocket-like structure in the 5S rRNA.