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

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

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

• Clinical and Experimental Pediatrics
• /
• v.48 no.4
• /
• pp.387-394
• /
• 2005

Purpose : We performed this study to compare the TSH and free $T_4$ levels according to gestational age and birth weight, and to reevaluate the cut-off values in the neonatal screening test for congenital hypothyroidism. Methods : Total 2,133 neonates(1,749 healthy newborns and 384 sick neonates) were screened in Dankook University Hospital from May 2000 to January 2003. Neonates with abnormal TSH values (higher than $20{\mu}IU/mL$) or abnormal free $T_4$ levels(lower than 1 ng/dL) were recalled to recheck the thyroid function test. At that time, physical examinations and history-taking regarding perinatal problem, medication history, and mother's illness were undertaken. Results : Serum TSH and free $T_4$ values revealed no significant difference according to sex, delivery type, and Apgar score. The free $T_4$ levels showed statistically significant differences, with gestational age or birth weight(P<0.01). The recall rate of neonates due to abnormal screening test was 7.48 percent. Compared with original cut-off values, the recall rate of the new cut-off values setted to TSH higher than $20{\mu}IU/mL$ or free $T_4$ lower than 0.64 ng/dL decreased from 7.48 percent to 4.8 percent in the healthy group. But, it compromised sensitivity when applied to the sick group. Conclusion : In this study, neonatal free $T_4$ levels were significantly different according to birth weight, gestational age, and the presence of compromised condition. Although the recall rate by TSH > $20{\mu}IU/mL$ or free $T_4$ <1 ng/dL was relatively high, it was impossible to set up new cut-off values without compromising sensitivity. We think studies including a larger study population will be required to change the cut-off values.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.249-252
• /
• 2002

we have studied the characteristics of PHEMT's with gate recess etching method. The DC characterization of PHTMT fabricated with the wide single recess methods is a maximum drain current density of 319.4 ㎃/mm and a peak transconductance of 336.7 ㎳/mm. The RF measurements were obtained in the frequency range of 1~50GHz. At 50GHz, 3.69dB of 521 gain were obtained and a current gain cut-off frequency(f$_{T}$) of 113 CH and a maximum frequency of oscillation(f$_{max}$) of 172 Ghz were achieved from this device. On the other hand, a maximum drain current of 367 mA/mm, a peak transconduclancc of 504.6 mS/mm, S$_{21}$ gain of 2.94 dB, a current gain cut-off frequency(f$_{T}$) of 101 CH and a maximum frequency of oscillation(f$_{max}$) of 113 fa were achieved from the PHEMT's fabricated by the .narrow single recess methods.methods.

• Transactions of Materials Processing
• /
• v.23 no.5
• /
• pp.275-281
• /
• 2014

Broaching is widely used for the machining of inner shaped slots in work-pieces. The broach tool is moved vertically (usually by hydraulic power) through the work-piece. Broaching occurs with the work-pieced fix while the broach tool traverses through material and shears it. To produce a T/F driven gear both an outside cutting and an inside cutting are needed. The outside cut determines the tooth profile and the inside cut determines the inner dimension. Broaching can cause problems with concentricity. In the current study, the characteristics of shearing along the cutting blade and the broaching of a T/F driven gear are considered.

• The Research Journal of the Costume Culture
• /
• v.17 no.4
• /
• pp.616-625
• /
• 2009

With suffering financial crisis in 1997, Korea's fashion market has grown in the direction that satisfies the reasonable price and diverse consumer's sensitivity and needs. The aim of this study is to examine whether the cutting portion in the waist line is surely necessary for designing the jacket pattern in men's wear, by closely examining the effects of the cutting portion in the waist line on the external appearance and functionality given designing the jacket pattern in men's wear for the standard body type in 20s. The results of the study are as follows. As a result of evaluating the external appearance, when having evaluated by dividing into 14 items such as the whole surface, the side, and the back side, the experimental clothing, which wasn't cut the waist line, obtained the highest mark in 13 items and, the significant difference was indicated in 10 items except 4 items. As a result of evaluating performance, the experimental clothing, which wasn't cut the waist line, obtained the highest mark in 13 items among 25 items in the total. Next, the cutting portion in the waist line obtained the highest mark in 10 items for the experimental clothing with opening in 1.0cm. The next was indicated to be in order of the experimental clothing with 1.5cm and the experimental clothing with 0.5cm. Given seeing the above result, the cutting portion in the waist line given designing the jacket pattern for the standard body type in 20s could be known that the experimental clothing with the most excellent mark in the evaluation of performance was all the experimental clothing with 0.0cm whose waist line wasn't cut.

• Asian-Australasian Journal of Animal Sciences
• /
• v.4 no.1
• /
• pp.7-14
• /
• 1991

An experiment was carried out to investigate the effect of change in length of hay offered on eating and rumination behaviour in sheep using three types of hay diets (L: long, M: 8.0-cm cut, S: 1.2-cm cut) and 3 Japanese Corriedale wethers, and the experiment was designed as $3{\times}3$ latine square. The time spent eating per 100 g hay was significantly shorter with long (L) hay (p < 0.05) than with chopped (M and S) hay, and therefore, the eating rate (g D.M./min.) was significantly higher in the former (p < 0.05) than in the latter. Rumination appearance (the lag time after eating) tended to be longer with long hay than with chopped hay, but not significantly (p > 0.05). Daily time spent ruminating, the actual chewing time and daily number of chews tended to be more in feeding long hay than in feeding chopped hay, but not significantly. Daily number of rumination periods was significantly more with long hay (p < 0.01) than with chopped hay. Cyclic rate tended to be longer with long hay than with chopped hay, in particular, the difference in values between long hay and 8.0-cm cut hay was significant statistically (p < 0.01). The rumination index (time spent ruminating/100 g D.M, eaten) tended to be higher with long hay than with chopped hay, and the difference in values between long hay and 1.2-cm cut hay was significant statistically (p < 0.05). Bolus time was significantly longer with long hay (p < 0.01) than that with 8.0-cm cut hay. The circadian pattern of ruminating time was not changed by the changes in length of hay eaten.