• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.2
• /
• pp.89-97
• /
• 2007

We study the maximum integer multiflow problem and the minimum multicut problem in a ring network. Both problems in a general network are known to be NP-hard. In this paper, we develop polynomial time algorithms to solve the problems. We also prove that even In a ring network, maximum multiflow is not always integral, which implies that the amount of maximum integer flow does not always reach the minimum capacity of multicut.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.48-56
• /
• 1995

This paper presents a method of implementing efficient optical flow estimation for dynamic scene analysis using the hierarchical Hopfield neural networks. Given the two consequent inages, Zhou and Chellappa suggested the Hopfield neural network for computing the optical flow. The major problem of this algorithm is that Zhou and Chellappa's network accompanies self-feedback term, which forces them to check the energy change every iteration and only to accept the case where the lower the energy level is guaranteed. This is not only undesirable but also inefficient in implementing the Hopfield network. The another problem is that this model cannot allow the exact computation of optical flow in the case that the disparities of the moving objects are large. This paper improves the Zhou and Chellapa's problems by modifying the structure of the network to satisfy the convergence condition of the Hopfield model and suggesting the hierarchical algorithm, which enables the computation of the optical flow using the hierarchical structure even in the presence of large disparities.

• Tunnel and Underground Space
• /
• v.4 no.1
• /
• pp.1-16
• /
• 1994

The study on the flow characteristics and analysis of groundwater in discontinuous rock mass is very important, since the water inflow into the underground opening during excavation induces serious stability and environmental problems. To investigate the flow through single rock joint, the effect of various aperture distribution on the groundwater flow has been analyzed. Observed through the analysis is the "channel flow", the phenomenon that the flow is dominant along the path of large aperture for given joint. The equivalent hydraulic conductivity is estimated and verified through the application of the joint network analysis for 100 joint maps generated statistically. Both the analytic aproach based on isotropic continuum premise and the joint network analysis are tested and compared analyzing the gorundwater inflow for underground openings of different sizes and varying joint density. The joint network analysis is considered better to reflect the geometric properties of joint distribution in analyzing the groundwater flow.ater flow.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.130-138
• /
• 2023

The traffic flow in an urban area is affected by the date, weather, and regional traffic flow. The existing methods are weak to model the dynamic road network features, which results in inadequate long-term prediction performance. To solve the problems regarding insufficient capacity for dynamic modeling of road network structures and insufficient mining of dynamic spatio-temporal features. In this study, we propose a novel traffic flow prediction framework called shared spatio-temporal attention convolution optimization network (SSTACON). The shared spatio-temporal attention convolution layer shares a spatio-temporal attention structure, that is designed to extract dynamic spatio-temporal features from historical traffic conditions. Subsequently, the graph optimization module is used to model the dynamic road network structure. The experimental evaluation conducted on two datasets shows that the proposed method outperforms state-of-the-art methods at all time intervals.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.603-620
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) is a network-based mobility support protocol and it does not require Mobile Nodes (MNs) to be involved in the mobility support signaling. In the case when multiple interfaces are active in an MN simultaneously, each data flow can be dynamically allocated to and redirected between different access networks to adapt to the dynamically changing network status and to balance the workload. Such a flow redistribution control is called "flow mobility". In the existing PMIPv6-based flow mobility support, although the MN's logical interface can solve the well-known problems of flow mobility in a heterogeneous network, some missing procedures, such as an MN-derived flow handover, make PMIPv6-based flow mobility incomplete. In this paper, an enhanced flow mobility support is proposed for actualizing the flow mobility support in PMIPv6. The proposed scheme is also based on the MN's logical interface, which hides the physical interfaces from the network layer and above. As new functional modules, the flow interface manager is placed at the MN's logical interface and the flow binding manager in the Local Mobility Anchor (LMA) is paired with the MN's flow interface manager. They manage the flow bindings, and select the proper access technology to send packets. In this paper, we provide the complete flow mobility procedures which begin with the following three different triggering cases: the MN's new connection/disconnection, the LMA's decision, and the MN's request. Simulation using the ns-3 network simulator is performed to verify the proposed procedures and we show the network throughput variation caused by the network offload using the proposed procedures.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.424-428
• /
• 2001

The methodologies of power transmission pricing are normally divided into two categories such as marginal cost method and embedded cost allocation method. This paper, first, discusses the possible problems that can occur when the marginal cost method is applied to pricing the transmission services. Next, the paper proposes a method to apply the power flow tracing to the transmission network charge. The result of the power flow tracing method is then used in MW-mile method to charge individual loads for the use of transmission network. Effectiveness of the algorithm is verified by computer simulations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

• Convergence Security Journal
• /
• v.16 no.5
• /
• pp.41-48
• /
• 2016

In this paper we propose a new method of security visualization, VisFlow, using traffic flows to solve the problems of existing traffic flows based visualization techniques that were a loss of end-to-end semantics of communication, reflection problem by symmetrical address coordinates space, and intuitive loss problem in mass of traffic. VisFlow, a simple and effective security visualization interface, can do a real-time analysis and monitoring the situation in the managed network with visualizing a variety of network behavior not seen in the individual traffic data that can be shaped into patterns. This is a way to increase the intuitiveness and usability by identifying the role of nodes and by visualizing the highlighted or simplified information based on their importance in 2D/3D space. In addition, it monitor the network security situation as a way to increase the informational effectively using the asymmetrical connecting line based on IP addresses between pairs of nodes. Administrator can do a real-time analysis and monitoring the situation in the managed network using VisFlow, it makes to effectively investigate the massive traffic data and is easy to intuitively understand the entire network situation.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.1-5
• /
• 2014

When renewable sources are connected to the distribution network in the form of a distributed generators(DGs), the effect of intermittent output appears as voltage fluctuation. The surplus power at the consumer ends results in the reverse power flow to the distribution network. This reverse power flow causes several problems to the distribution network such as overvoltage. Application of the reactive power control equipment and power flow control by means of BTB inverter have been suggested as the general solutions to overcome the overvoltage, but they are not economically feasible since they require high cost devices. Herein, we suggest the feeder loop line switch control method to solve the problem.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.