• Convergence Security Journal
• /
• v.8 no.3
• /
• pp.65-71
• /
• 2008

Network Flow has been playing important role in the modern industrial society. No matter what people or company run the network, both of them can't avoid circulating goods among the many branches. But in practical situations, not only the price rising in network increase the transportation costs, but the huge traffic flow volumes increase the transportation costs. Given to such a network environment, how to flow goods in the network is very important. In this paper, the MAX-Flow algorithm will be applied to network flow in order to maximize the network flow volumes. As far as the functions of network are correctly provided, the optimized network system always can make the flow process efficiently.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

• Korean Journal of Materials Research
• /
• v.20 no.2
• /
• pp.90-96
• /
• 2010

The recirculating electrochemical flow reactor developed at UCLA has been employed to fabricate nanostructured GMR multilayers. For comparison, Ni/Cu multilayers have been electrodeposited from a single bath, from dual baths and from the recirculating electrochemical flow reactor. For a magnetic field of 1.5 kOe, higher GMR (Max. -5%) Ni/Cu multilayers with low electrical resistivity (< $10\;{\mu}{\Omega}{\cdot}cm$) were achieved by the electrochemical flow reactor system than by the dual bath (Max. GMR = -4.2% and < $20\;{\mu}{\Omega}{\cdot}cm$) or the single bath (Max. GMR = -2.1% and < $90\;{\mu}{\Omega}{\cdot}cm$) techniques. Higher GMR effects have been obtained by producing smoother, contiguous layers at lower current densities and by the elimination of oxide film formation by conducting deposition under an inert gas environment. Our preliminary GMR measurements of Ni/Cu multilayers from the electrochemical flow reactor obtained at low magnetic field of 0.15 T, which may approach or exceed the highest reported results (-7% GMR) at magnetic fields > 5 kOe.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.04a
• /
• pp.269-276
• /
• 2009

The local preconditioning method has both robust convergence and accurate solutions by using local flow properties for parameters in the preconditioning matrix. Preconditioning methods have been very effective to low speed inviscid flows. In the viscous and turbulent flows, deterioration of convergence should be overcame on the high aspect ratio grids to get better convergence and accuracy. In the present study, the local time stepping and min-CFL/max-VNN definitions are applied to compare the results and we propose the method that switches between two methods. The min-CFL definition is applied for inviscid flow problems and the min-CFL/max-VNN definition is implemented to viscous and turbulent flow problems.

• Journal of Korea Game Society
• /
• v.12 no.1
• /
• pp.123-132
• /
• 2012

There are many of games using smart devices. Voice recognition is can be useful way for input. In the game, voice have to be quickly recognized, at the same time it have to be manipulated promptly as well. In this study, we developed the optimized real-time phoneme recognition using max flow matching that it can be efficiently used in the game field. Firstly, voice wavelength is transformed to FFT, secondly, transformed value is made by a graph in Z plane, thirdly, data is extracted in specific area, and then data is saved in database. After all the value is recognized using weighted bipartite max flow matching. This way would be useful method in game or robot field when researchers hope to recognize the fast voice recognition.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.13-29
• /
• 1997

This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.
ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

• Journal of Oral Medicine and Pain
• /
• v.25 no.4
• /
• pp.345-353
• /
• 2000

This study was to investigate normal salivary flow rates and normal indices of Quantitative analysis of salivary scintigraphy. 96 adult volunteers were studied by Questionnaire evaluating salivary conditions and clinical examinations. 35(male 23, female 12, age range 23-31years) that absented subjective and objective symptoms related saliva were classified as normal group. The normal group underwent measurement unstimulated and stimulated salivary flow rates and salivary scintigraphy. The obtained results were as follows: 1. There were not significant in sex differences of unstimulated and stimulated salivary flow rates. The unstimulated salivary flow rate was $0.66{\pm}0.41g/min$, stimulated salivary flow rates was $1.61{\pm}0.69g/min$. 2. As comparing of parameters of salivary scintigraphy, the Uptake ratio(UR), $T_{max}$, $T_{min}$, Maximum accumulation (MA), Maximum secretion(MS) of parotid and submandibular glands were not significant in sex and side-ralated differences. 3. The UR, $T_{max}$, MA, MS of parotid gland were significantly higher than those of submandibular gland; in the parotid gland, UR, $3.67{\pm}0.88$, $T_{max}$, $18.77{\pm}0.43min$, MA, $41.35{\pm}9.22%$, MS, $43.13{\pm}9.13%$; in the submandibular gland, UR, $3.04{\pm}0.10$, $T_{max}$, $18.48{\pm}0.52min$, MA, $36.47{\pm}14.18%$, MS, $36.88{\pm}12.20%$. 4. As classifying of time-activity curve, the most of parotid gland was N-type(97.1%), submandibular gland was observed in order of M-type(67.1%), N-type(21.4%), F-type(11.4%), however, was not observed S-type. 5. As the type of time-activity curve of submandibular gland was more flattened, the UR, $T_{max}$, MA, MS were significantly decresed.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.21 no.1
• /
• pp.54-59
• /
• 2017

Purpose The present study aimed at assessing the effectiveness of the respiratory gating method used in the flow mode and additional localized respiratory-gated imaging, which differs from the step and go method. Materials and Methods Respiratory gated imaging was performed in the flow mode to twenty patients with lung cancer (10 patients with stable signals and 10 patients with unstable signals), who underwent PET/CT scanning of the torso using Biograph mCT Flow PET/CT at Bundang Seoul University Hospital from June 2016 to September 2016. Additional images of the lungs were obtained by using the respiratory gating method. SUVmax, SUVmean, and Tumor Volume ($cm^3$) of non-gating images, gating images, and additional lung gating images were found with Syngo,bia (Siemens, Germany). A paired t-test was performed with GraphPad Prism6, and changes in the width of the amplitude range were compared between the two types of gating images. Results The following results were obtained from all patients when the respiratory gating method was applied: $SUV_{max}=9.43{\pm}3.93$, $SUV_{mean}=1.77{\pm}0.89$, and $Tumor\;Volume=4.17{\pm}2.41$ for the non-gating images, $SUV_{max}=10.08{\pm}4.07$, $SUV_{mean}=1.75{\pm}0.81$, and $Tumor\;Volume=3.56{\pm}2.11$ for the gating images, and $SUV_{max}=10.86{\pm}4.36$, $SUV_{mean}=1.77{\pm}0.85$, $Tumor\;Volume=3.36{\pm}1.98$ for the additional lung gating images. No statistically significant difference in the values of $SUV_{mean}$ was found between the non-gating and gating images, and between the gating and lung gating images (P>0.05). A significant difference in the values of $SUV_{max}$ and Tumor Volume were found between the aforementioned groups (P<0.05). The width of the amplitude range was smaller for lung gating images than gating images for 12 from 20 patients (3 patients with stable signals, 9 patients with unstable signals). Conclusion In PET/CT scanning using the respiratory gating method in the flow mode, any lesion movements caused by respiration were adjusted; therefore, more accurate measurements of $SUV_{max}$, and Tumor Volume could be obtained from the gating images than the non-gating images in this study. In addition, the width of the amplitude range decreased according to the stability of respiration to a more significant degree in the additional lung gating images than the gating images. We found that gating images provide information that is more useful for diagnosis than the one provided by non-gating images. For patients with irregular signals, it may be helpful to perform localized scanning additionally if time allows.

• Journal of Intelligence and Information Systems
• /
• v.2 no.1
• /
• pp.93-107
• /
• 1996

A flexible flow line(FFL) consists of several groups of identical machines. All work-orders flow along the same path through successive machine groups. Thus, we emphasized the balancing of workloads between machine groups in order to maximize total productivity. On the other hand, many different types of work-orders, in varying batch or lot sizes, are produced simultaneously. The mix of work-orders, their lot sizes, and the sequence in which they are produced affect the amount of workload. However, the work-orders and their lot sizes are prefixed and cannot be changed. Because of these reasons, we have developed an optimal route selection model using heuristic search and Min-Max algorithm for balancing the workload between machine groups in the FFL.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.