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

• Proceedings of the KSRS Conference
• /
• 2000.04a
• /
• pp.96-101
• /
• 2000

SAR(Synthetic Aperture Radar) interferometry 기술은 co-registration, 정밀궤도 계산, phase unwrapping, 지형보정과 같은 기술로 구성되어있다. 구속화된 위상값을 절대 위상값으로 변환하는 과정인 phase unwrapping 기술은 정밀지형고도를 얻는데 있어서 핵심기술이다. 본 연구에서는 JERS-1 SAR 영상으로부터 interferogram을 구하고, 이로부터 추출된 위상정보를 이용하여 branch cut(Goldstein et. al, 1988), minimum discontinuity(Flynn, 1997) 그리고 minimum $L^p$-norm(Ghiglia and Romero, 1996)방법 적용결과에 대한 비교 분석을 실시하였다. Goldstein 알고리즘은 수행속동가 매우 빠르지만 residue를 연결한 branch cut에 의해 분활된 영역 내에서, 서로 다른 적분 경로로 인해 위상이 단절되었다. 영상내의 모든 화소에서 절대 위상을 구한 minimum discontinuity와 minimum $L^p$-norm 알고리즘 수행 결과는 상관관계가 0.995로 매우 유사하였는데, 가중된 불연속선의 합을 최소화하는 minimum discontinuity 알고리즘이 minimum $L^p$-norm에 비해 영상 일부 지역에서 발생하는 위상 오차를 전파시키지 않는다는 장점이 있다. Minimum $L^p$-norm 방법은 다른 두 방법과 달리 위상정보 내에 많은 잡음이 있더라도 적절한 해를 구할 수 있다는 장점이 있다. 각 방법은 대상 자료의 특성에 따라 효율성이 있으나 Flynn의 알고리즘이 지역적 특성과 무관하게 가장 효과적임을 알 수 있었다.

• Journal of Astronomy and Space Sciences
• /
• v.23 no.2
• /
• pp.117-126
• /
• 2006

The Diurnal variation of galactic cosmic ray (GCR) flux intensity observed by the ground Neutron Monitor (NM) shows a sinusoidal pattern with the amplitude of $1{\sim}2%$ of daily mean. We carried out a statistical study on tendencies of the local times of GCR intensity daily maximum aad minimum. To test the influences of the solar activity and the location (cut-off rigidity) on the distribution in the local times of maximum and minimum GCR intensity, we have examined the data of 1996 (solar minimum) and 2000 (solar maximum) at the low-latitude Haleakala (latitude: 20.72 N, cut-off rigidity: 12.91 GeV) and the high-latitude Oulu (latitude: 65.05 N, cut-off rigidity: 0.81 GeV) NM stations. The most frequent local times of the GCR intensity daily maximum and minimum come later about $2{\sim}3$ hours in the solar activity maximum year 2000 than in the solar activity minimum you 1996. Oulu NM station whose cut-off rigidity is smaller has the most frequent local times of the GCR intensity maximum and minimum later by $2{\sim}3$ hours from those of Haleakala station. This feature is more evident at the solar maximum. The phase of the daily variation in GCR is dependent upon the interplanetary magnetic field varying with the solar activity and the cut-off rigidity varying with the geographic latitude.

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

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.16 no.6
• /
• pp.125-132
• /
• 2007

Inherent dynamic interaction between flexible disk and workpiece creates partially non-flat surface profile. A flat zone was defined using minimum depth of engagement. Several key parameters were defined to explain the characteristics of the zone. Process conditions including disk rotation speed, initial depth of cut and feed speed were varied to produce product profile database. Correlation between key factors was examined to find the characteristic dependencies. Trends of key parameters were displayed and explained. Higher flat zone ratio was observed for lower depth of cut and higher disk rotation speed. Ratio of minimum depth of cut against target depth of cut increased for higher feed speed and disk rotation speed but was insensitive to the depth of cut variation. The process transition was visualized by continuously displaying instantaneous orientation of the deflected disk and the location of key parameters were clearly marked for comparison.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.233-241
• /
• 2014

This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.04a
• /
• pp.376-381
• /
• 2003

Ultra precision diamond cutting is a very efficient manufacturing method for optical parts such as HOE, Fresnel lenses, diffraction lenses, and others. During micro cutting, the rake angle is likely to become negative because the tool edge radius is considerably large compared to the sub-micrometer-order depth of cut. Depending on the ratio of the tool edge radius to the depth of cut, different micro-cutting mechanism modes appear. Therefore, the tool edge sharpness is the most important factor affecting the qualities of machined parts. That is why diamond especially mono-crystal diamond, which has the sharpest edge among all other materials is widely used in micro-cutting. The question arises, given a diamond tool, what is the minimum (critical) depth of cut to get continuous chips while in the cutting process\ulcorner In this paper, the micro machinability around the critical depth of cut is investigated in micro grooving with a diamond tool, and introduce the minimizing method of cutting depth using vibration cutting. The experimental results show the characteristics of micro cutting in terms of cutting force ratio (Fx/Fy), chip shape, surface roughness, and surface hardeing around the critical depth of cut.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

• 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 Engineering Geology
• /
• v.22 no.4
• /
• pp.375-385
• /
• 2012

Infiltration characteristics of cut-slope safety factors are considered for precipitation duration and intensity. Infiltration characteristics (infiltration module) and safety factor (slope module) changes of a cut-slope are analyzed under various conditions of precipitation intensity and duration, using the Soilworks program. The results indicate that the addition safety factors of the slope decreased immediately after the end of precipitation due to an increase in pore water pressure. The minimum safety factor for cut-slope infiltration analysis should be considered because of the because of the decrement of safety factors after precipitation that exceeds the decrement of safety factor during the duration of precipitation.