• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.825-833
• /
• 1997

The purpose of this paper is to develop a method of postoptimality analysis that can be applied to an optimal solution of a maximum flow problem. We first use the transformed network corresponding to a given network. In such a network we conduct postoptimality analysis by determining changes in the optimal solution precipitated by changes in the capacity as the arc capacity varies from 0 to infinite. By this method we can easily calculate not only the characteristic region where the given optimal solution remains unchanged, but also the characteristic region where the value of the maximal flow gradually increases or decreases. The proposed method is demonstrated by numerical example.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.263-269
• /
• 1996

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc(MVA) in the maximum flow problem. We first define the transformed network corresponding In a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for a MVA consists of the arcs whose flow is at least as greate as the flow over every arc in a minimal cut As a result, we present a method in which the MVA is determined more easily by computing the minimal capacity in the transformed network. The proposed method is demonstrated by numerical example.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.11 no.4
• /
• pp.351-356
• /
• 2006

This study developed an artificial neural network (ANN) to estimate the growth of microorganisms during a fermentation process. The ANN relies solely on the cumulative consumption of alkali and the buffer capacity, which were measured on-line from the on/off control signal and pH values through automatic pH control. The two input variables were monitored on-line from a series of different batch cultivations and used to train the ANN to estimate biomass. The ANN was refined by optimizing the network structure and by adopting various algorithms for its training. The software estimator successfully generated growth profiles that showed good agreement with the measured biomass of separate batch cultures carried out between at 25 and $35^{\circ}C$.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.577-585
• /
• 2006

This paper presents a method for reliability evaluation of a telecommunication network with variable link-capacities when the simple paths of the network are known. The LP-EM, suggested by Lee and Park (2001), identifies a composite path as a subnetwork and adds only a minimal set of links at each step which gives maximal increase on the maximum capacity flow of the subnetwork. Thereby the LP-EM reduces the possible occurrence of redundant composite paths significantly over other existing methods. Based on the LP-EM, our method further reduces the possible redundancy by identifying such simple paths that could give no increase of maximum capacity flow on the current subnetwork and excluding those simple paths from consideration in the process of constructing composite paths.

• The KIPS Transactions:PartC
• /
• v.8C no.4
• /
• pp.405-414
• /
• 2001

전력연구원에서는 ATM WAN 통합망 기반 구축을 통하여 통신회선 임대비용의 절감과 안정적이고 고속의 인터넷 서비스를 수용함으로써 통신망의 경쟁력을 확보하는 것을 목표로 ATM 기반 전력통신망을 설계하였다. 이를 위하여 기존의 패킷 통신망 트래픽 통계 분석결과와 연간 트래픽 증가량 예측치를 기반으로 향후 서비스 수용계획을 고려한 토폴로지와 링크용량을 설계하였으며, 이를 바탕으로 전력통신망에서의 ATM 스위치 기반 네트워크 모델을 확립하였다. 본 논문에서는 ATM 기반 전력통신망의 설계결과를 요약한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.29-39
• /
• 2009

In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.4
• /
• pp.175-184
• /
• 2010

This paper designs a virtual USB drive for mobile devices which gives an illusion of a traditional USB flash memory drive and provides capacity-free storage space over IP network. The virtual USB drive operating with a S3C2410 hardware platform and embedded linux consists of USB device driver, an iSCSI-enabled network stack, and a seamless USB/iSCSI tunneling module. For performance enhancement, it additionally provides a kernel-level seamless USB/iSCSI tunneling module and data sharing with symbol references among kernel modules. Experiments reveal that the kernel-level implementation can improve the I/O performance up to 8 percentage, as compared with the user-level implementation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.664-669
• /
• 1994

This paper focuses on development and implementation of a performance management algorithm for IEEE802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisgy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. This paper presents a network perfomance manager that adjusts queue apacity as well as timers by using a set of fuzzy rules and fuzzy inference mechanism. The efficacy of the performance management has been demonstrated by a series of simulation experiments.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.136-147
• /
• 2002

In this paper, the maximal capacity of the data network link has attempted to be exploited by using the dynamic allocation strategy. We propose a new methodology based on the economic models for competing traffic classes (classes of sessions) in packet networks. As the demand for network services accelerates, users' satisfaction to the service level might decrease due to the congestion at the network nodes. To prevent this, efficient allocation of a networks resources, such as available bandwidth and switch capacity, is needed. By using the so-called user profile as well as the utility (e.g., data rate) functions, it is possible to allocate data rates and other utilities using the arbitrary number of QoS classes, say $0.01,...,$10.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.115-124
• /
• 2000

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc in the maximum flow problem. We first define the transformed network corresponding to a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for single most vital arc consists of the arcs whose flow is at least as great as the flow over every arc in a minimal cut. As a result we present a method in which the most vital arc is determined more easily by computing the minimal capacity in the transformed network. the proposed method is demonstrated by numerical example and computational experiment.