• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.261-267
• /
• 2001

In this paper, we have illustrated implementations and there results of network attacks and detections. We consider two attacks, smurf attach and network mapping attack, which are one of the typical intrusions using the ICMP The NFR/sup TM/ is used to capture all of our interesting packets within the network traffic. We implement the smurf and network mapping attacks with the UNIX raw socket, and build the NFR's backend for it's detection. The N-Code programming is used to build the backend. The implementing results show the possibility of preventing illegal intruding to network systems.

• Journal of Korea Water Resources Association
• /
• v.32 no.5
• /
• pp.557-564
• /
• 1999

Monitoring of groundwater Quality is essential for the preservation of groundwater resources. In practice. however, groundwater monitoring network is designed based on the experience and intuition of experts or on the convenience. This study proposes a simulation-optimization approach for the optimal design of monitoring networks. In it, the predicted three-dimensional concentration data are used as the input of an optimization problem. Various design objectives and constraints are considered and the problem is formulatcu as the 0-1 integer programming. The methodology was applied to a sanitary landfill site. The results show that the monitoring network configuration changes as the monitoring goal, operation time and constraints vary. The proposed method turns out to be an efficient tool for the wide range of groundwater Quality monitoring network design problems.oblems.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.4
• /
• pp.87-104
• /
• 2014

This paper proposes regionally centralized multistage reverse logistics (cmRL) networks and regionally decentralized multistage reverse logistics (dmRL) networks. cmRL considers whole area of RL network, while dmRL regionally distributed area of RL network. Each type is formulated by the mixed integer programming (MIP) models, which are realized in genetic algorithm (GA) approach. Two types of numerical experiments using RL network are presented and various measures of performance are used for comparing the efficiency of the cmRL and the dmRL. Finally, it is proved that the performance of the cmRL is superior to that of the dmRL.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1616-1640
• /
• 2006

In this paper, we deal with a network optimization problem arising from the deployment of Ethernet-based BcN access network. BcN convergence services require that access networks satisfy QoS measures. BcN services have two types of traffics: stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer programming model. The proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose tabu search heuristic algorithms for solving the problem, and simulate tabu result. We demonstrate the computational efficacy of the proposed algorithm by solving a network design problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3789-3808
• /
• 2017

This paper studies a multi-antenna wireless relay network in the presence of a jammer. In this network, the source node transmits signals to the destination node through a multi-antenna relay node which adopts the amplify-and-forward scheme, and the jammer attempts to inject additive signals on all antennas of the relay node. With the linear beamforming scheme at the relay node, this network can be modeled as an equivalent Gaussian arbitrarily varying channel (GAVC). Based on this observation, we deduce the mathematical closed-forms of the capacities for two special cases and the suboptimal achievable rate for the general case, respectively. To reduce complexity, we further propose an optimal structure of the beamforming matrix. In addition, we present a second order cone programming (SOCP)-based algorithm to efficiently compute the optimal beamforming matrix so as to maximize the transmission rate between the source and the destination when the perfect channel state information (CSI) is available. Our numerical simulations show significant improvements of our propose scheme over other baseline ones.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.42.4-42
• /
• 2002

With the research of simplified neural networks, we propose an AND/OR neural network; a kind of brief, fast network Then, we present an OCR solution that equip the network in one-chip FPGA and design it by using HDL. We selected the representative hexadecimal character as the recognition feature class and used a Feature Vector Recognition Method in the statistic pattern recognition. The result feature vector was encoded into a 7 bit array and inputted into the AND/OR network to finish learning.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.29-34
• /
• 2011

We present a network coding scheme which is designed for improving throughput in multi-hop wireless network with multi-radio multi-channel. The co-channel interference and unreliability of wireless transmissions cause the wireless network to reduce throughput. In wireless network, multi-radio multi-channel technology shows benefit to cut down channel interferences and contentions. And network coding can reduce the complexity of scheduling and improve throughput by increasing usage of links in wireless network. In this paper, we propose a method of channel assignment and transmission scheduling in intra-session network coding that efficiently improve throughput for multi-hop wireless network by using mathematical modeling and linear programming. Moreover, we evaluate the performance of the intra-session network coding scheme by using AMPL with CPLEX. The simulation results show that intra-session network coding can achieve better throughput than traditional routing.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.504-504
• /
• 1994

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2013

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.1
• /
• pp.13-27
• /
• 2014

In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for the SRS problem by implementing Miller-Tucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and then apply the reformulation-linearization technique (RLT) to enhance the lower bound obtained by the LP relaxation. By exploiting the ring-star structure of underlying network, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure.