• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.379-389
• /
• 2000

FORD and FULKERSON have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optimal dynamic flow. this paper presents the remark that temporally repeated flows may be not optimal for a minimal dynamic flow and an algorithm for such a flow. a numerical example is presented.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.133-135
• /
• 2018

In these days, providing flexible and personalized network services subject to customers' requirements becomes an interesting issue for network service providers. Moreover, because each network service provider own finite network resources and infrastructure, dynamic network provisioning is essential to leverage the limited network resources efficiently and effectively for supporting personalized network services. Recently, as the population of mobile devices increases, the location-awareness becomes as important as the QoS-awareness to provision a network service dynamically. In this paper, we propose a framework for providing location-aware dynamic network services. This framework includes the web user interface for obtaining customers' requirements such as locations and QoS, the network generator for mapping the requested locations and network infrastructure, the network path calculator for selecting routes to meet the requested QoS and the network controller for deploying a prepared network services into SDN(Software-Defined Networking) enabled network infrastructure.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1073-1081
• /
• 2000

This paper proposes a new fault-tolerant technique for bitonic sorting networks which can be used for designing ATM switches based on Batcher-Banyan network. The main goal in this paper is to design a cost-effective fault-tolerant bitonic sorting network. In order to recover a fault, additional comparison elements and additional links are used. A Dynamic Redundant Bitonic Sorting (DRBS) network is based on the Dynamic Redundant network and can be constructed with several different variations. The proposed fault-tolerant sorting network offers high fault-tolerance; low time delays; maintenance of cell sequence; simple routing; and regularity and modularity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.189-199
• /
• 1999

This paper presents an optimization algorithm for a stable Self Dynamic Neural Network(SDNN) using genetic algorithm. Optimized SDNN is applied to a problem of controlling nonlinear dynamical systems. SDNN is dynamic mapping and is better suited for dynamical systems than static forward neural network. The real-time implementation is very important, and thus the neuro controller also needs to be designed such that it converges with a relatively small number of training cycles. SDW has considerably fewer weights than DNN. Since there is no interlink among the hidden layer. The object of proposed algorithm is that the number of self dynamic neuron node and the gradient of activation functions are simultaneously optimized by genetic algorithms. To guarantee convergence, an analytic method based on the Lyapunov function is used to find a stable learning for the SDNN. The ability and effectiveness of identifying and controlling a nonlinear dynamic system using the proposed optimized SDNN considering stability is demonstrated by case studies.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1683-1690
• /
• 2005

This study examines dynamic flow control method in UDP, analyzes packet loss which is frequently used element in measuring existing dynamic flow control and characteristics of round trip time, and proposes a new method of measurement, RSST. The algorithm that uses the proposed RSST enables accurate measurement of network status by considering both the currently measured network status and the past history of network status in controlling the transmission rate. For comparison study, a network status measurement software program that displays detailed information about volume of transmission generation of network status, and flow pattern of network was developed. The performance test shows that the proposed algorithm can better adjust to network condition in terms of low pack loss rate over existing algorithms.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.9
• /
• pp.113-119
• /
• 2021

With the increasing pressure of international competition, urban agglomeration cooperation and innovation had become an important means of regional economic development. This study analyzed the spatial characteristics of the Urban Cooperative Innovation Network in Guangdong-Hong Kong-Macao Greater Bay Area, found out the dynamic evolution law of innovation, provided suggestions for policy management departments, and effectively planned the industrial layout. According to the data of the State Intellectual Property Office of China, this study researched invention patents from 2005 to 2019. This paper constructed the urban cooperative innovation network, and took 11 cities in the bay area as the research objects, and used social network analysis to study the spatial structure and dynamic evolution of the urban innovation network. Every indicator reflected the urban cooperative innovation, but they all showed a certain decline in 2008-2010. And it is inferred that the innovation network space of each city will be "obvious fist advantages, significant spillover effect and weakening role of Hong Kong and Macao". This paper divided urban cooperative innovation of Guangdong-Hong Kong-Macao Greater Bay Area into three stages. Summing up the characteristics of each stage is helpful to recognize the changes of urban cooperative innovation and to do a good job in industrial layout planning.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.120-127
• /
• 1995

A nonlinear empirical state-space model of the Artificial Neural Network(ANN) has been developed. The nonlinear model structure incorporates characteristic, so as to enable identification of the transient response, as well as the steady-state response of a dynamic system. A hybrid feedfoward/feedback neural network, namely a Local Time Delayed Recurrent Multi-layer Perception(RMLP), is the model structure developed in this paper. RMLP is used to identify nonlinear dynamic system in an input/output sense. The feedfoward protion of the network architecture provides with the well-known curve fitting factor, while local recurrent and cross-talk connections provides the dynamics of the system. A dynamic learning algorithm is used to train the proposed network in a supervised manner. The derived dynamic learning algorithm exhibit a computationally desirable characteristic; both network sweep involved in the algorithm are performed forward, enhancing its parallel implementation. RMLP state-space and its associate learning algorithm is demonstrated through a simple examples. The simulation results are very encouraging.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.147-147
• /
• 2021

A partition of water distribution network (WDN) into district metered areas (DMAs) brings the efficiency and efficacy for water network operation and management (O&M), especially in monitoring pressure and leakage. Traditionally, the DMA configurations (i.e., number, shape, and size of DMAs) are permanent and cannot be changed occasionally. This leads to changes in water quality and reduced network redundancy lowering network resilience against abnormal conditions such as water demand variability and mechanical failures. This study proposes a framework to automatically divide a WDN into dynamic DMA configurations, in which the DMA layouts can self-adapt in response to abnormal scenarios. To that aim, a complex graph theory is adopted to sectorize a WDN into multiscale DMA layouts. Then, different failure-based scenarios are investigated on the existing DMA layouts. Here, an optimization-based model is proposed to convert existing DMA layouts into dynamic layouts by considering existing valves and possibly placing new valves. The objective is to minimize the alteration of flow paths (i.e., flow direction and velocity in the pipes) while preserving the hydraulic performance of the network. The proposed method is tested on a real complex WDN for demonstration and validation of the approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.1
• /
• pp.5-19
• /
• 2015

Literatures on open innovation have two major limitations. First, either on a firm level or on an industry level did they analyze the open innovation issues. The results of a firm's innovation can be diffused through the whole network and the firm can learn back from the network knowledge. Prior literatures did not consider the feedback loop among firms and network in which the firms are involved. Second, most open innovation research had a static perspective on firm's innovation performance. Since the diffusion, spill-over and learning among network members are involved over time, the open innovation is intrinsically dynamic. From the dynamic perspective, we can appreciate the fundamental attributes of the open innovation network which involves diverse firms, research institutes, and universities. In order to overcome the limitations, we suggest a dynamic model for open innovation network. We build an agent-based model which consists of heterogeneous firms. The firms are connected through a scale-free network which is formed by preferential attachment. Through the diverse scenario of simulation, we collect massive data on the firm level and analyze them both on firm and industry level. From the analysis, we found that, on industry level, the overall performance of open innovation increases as the internal research capability, absorptive capacity, and learning curve coefficient increase. Noticeably, as the deprecation rate of knowledge increases, the variability of knowledge increases. From the firm level analysis, we found that the industry-level variables had a significant effect on the firm's innovation performance lasting through all the time, whereas the firm-level variables had only on the early phase of innovation.