• 융합보안논문지
• /
• 제8권3호
• /
• pp.65-71
• /
• 2008

산업사회에서 유통문제는 점차 비중이 커지고 있다. 유통 네트워크를 운영하는 개인이나 기업은 지점들 간의 유통 문제가 빈번히 발생한다. 더구나 고유가로부터 야기된 운송비 상승뿐만 아니라, 교통량 증가로 인한 운송 장애로 물류비용이 점차로 증가하는 추세이다. 이러한 물류 환경에서 물류 네트워크 정보를 어떻게 사용하느냐에 따라 유통에 소요되는 비용과 시간은 달라질 수 있다. 본 연구에서는 이러한 개념을 바탕으로 유통 네트워크 정보에 MAX-Flow 알고리즘을 적용하여 유통량을 극대화하며, 극대화된 유통 네트워크에서 유통 관리 기능을 제공함으로써 물류시스템의 효율성을 향상시킨다. 본 연구에서는 물류 시스템의 운영에 있어서 유통 네트워크의 최적화로 물류 관리 비용을 절감하고 실제 산업현장의 여러 특성에 알맞게 적용할 수 있는 기반을 연구한다.

• 제어로봇시스템학회논문지
• /
• 제6권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.

• 한국재료학회지
• /
• 제20권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년 춘계학술대회논문집
• /
• 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.

• 한국게임학회 논문지
• /
• 제12권1호
• /
• pp.123-132
• /
• 2012

스마트 디바이스를 이용한 다양한 게임들이 증가하고 있는데, 음소인식은 스마트 디바이스를 사용한 효율적인 입력 방법은 음성이 될 수 있다. 게임에서 음성인식은 매우 빠르게 인식되면서 구동 되어야하는데, 본 연구에서는 게임 분야에서 유용하게 활용할 수 있는 최적화된 음소 인식 방법을 개발하였다. 본 논문에서 제안하는 음소 인식 방법은 음성 파장을 FFT로 전환하고, 해당 값을 Z평면에 도시한 후, 영역 데이터를 추출한 후 데이터베이스에 저장한다. 그리고 해당 값을 가중치 있는 두 갈래 그래프 최대 흐름 정합을 사용하여 음소 인식을 한다. 제안된 방법은 게임 또는 로봇과 같은 분야에서 빠른 음소 인식을 하고자 할 때 매우 유용한 방법이다.

• 한국경영과학회지
• /
• 제22권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
• /
• 제25권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.

• 핵의학기술
• /
• 제21권1호
• /
• pp.54-59
• /
• 2017

폐암(Lung cancer) 환자의 경우 PET/CT 검사에서 호흡으로 인하여 영상의 정합오차가 발생하게 되는데 이로 인해 정확한 SUV 와 Tumor volume측정을 방해하는 요인으로 작용된다. $SUV_{max}$를 이용하여 폐암 환자의 수술 후 예측 및 항암화학요법의 효과를 평가하고 있으며, 방사선치료의 예후 예측 및 평가를 위해 현재 Tumor volume과 SUV를 이용한 지표가 사용되고 있다. 그렇기 때문에 정합오차를 줄이기 위해 본원에서는 Respiratory gating method를 적용하여 검사를 시행하고 있다. 본 연구는 Step and Go 방식이 아닌 Flow mode를 적용하여 Non-gating 영상과 첫 번째 Respiratory Gating영상, 그리고 추가로 부분 Respiratory gating 촬영하여 Respiratory gating method의 유용성에대해 알아보았다. 2016년 6월부터 2016년 9월까지 분당서울대학교병원에서 PET/CT 검사를 한 폐암 환자 20명(남:12명, 여:8명)을 대상으로 amplitude rang 15% 미만인 호흡이 안정한 환자군 10명 15%초과한 호흡이 불안정한 환자군 10명으로 나누어 비교분석하였다. 전체 환자에서 Non-gating 영상의 $SUV_{max}$는 $9.43{\pm}3.93$, $SUV_{mean}$은 $1.77{\pm}0.89$, Tumor Volume은 $4.17{\pm}2.41$로 측정되었고 기존 Gating 영상에서 $SUV_{max}$는 $10.08{\pm}4.07$, $SUV_{mean}$은 $1.75{\pm}0.81$, Tumor Volume은 $3.56{\pm}2.11$로 측정되었다. 그리고 추가 Lung gating 영상에서 $SUV_{max}$는 $10.86{\pm}4.36$, $SUV_{mean}$은 $1.77{\pm}0.85$, Tumor volume은 $3.36{\pm}1.98$을 얻었다. Non-gating 영상과 기존 Gating 영상, 그리고 기존 Gating 영상과 추가 Lung gating 영상을 비교했을 때 둘 다 $SUV_{mean}$ 값에서 통계적으로 유의한 차이를 보이지 않았으나(P>0.05) $SUV_{max}$와 Tumor volume에서 유의한 차이를 보였다(P<0.05). 그중 호흡이 안정한 환자군보다 호흡이 불안정한 환자군에서의 증감률이 더 크게 나타났다. Amplitude range 폭은 전체 20명 중 12명(Signal이 안정된 환자 3명 불안정한 환자 9명)이 추가 Lung gating을 했을 때 기존 Gating 영상보다 더 낮게 나타났다. 본 연구에 의하면 Flow mode를 적용하여 Respiration Gating Method로 촬영한 결과 추가적인 CT 촬영 없이 호흡으로 인해 발생하는 병변의 움직임을 보정해 주어 $SUV_{max}$, Tumor volume을 Non-gating 영상보다 더 정확하게 측정할 수 있었다. 그리고 처음 Gating 할 때보다 추가 촬영 시 호흡의 안정에 따른 Amplitude range 폭의 낮아짐을 알 수 있었다. 따라서 Gating 영상이 Non-gating 영상보다 진단에 더 유용한 정보를 제공함을 알 수 있었고, Signal이 불규칙적인 환자에게 시간적 여유가 있다면 추가로 부분 촬영을 하는 것이 도움이 될 것이라고 사료된다.

• 지능정보연구
• /
• 제2권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.

• 한국컴퓨터정보학회논문지
• /
• 제21권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.