• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.484-510
• /
• 2017

Network security is rapidly developing, but so are attack methods. Network worms are one of the most widely used attack methods and have are able to propagate quickly. As an active defense approach to network worms, the honeynet technique has long been limited by the closed architecture of traditional network devices. In this paper, we propose a closed loop defense system of worms based on a Software-Defined Networking (SDN) technology, called Worm-Hunter. The flexibility of SDN in network building is introduced to structure the network infrastructures of Worm-Hunter. By using well-designed flow tables, Worm-Hunter is able to easily deploy different honeynet systems with different network structures and dynamically. When anomalous traffic is detected by the analyzer in Worm-Hunter, it can be redirected into the honeynet and then safely analyzed. Throughout the process, attackers will not be aware that they are caught, and all of the attack behavior is recorded in the system for further analysis. Finally, we verify the system via experiments. The experiments show that Worm-Hunter is able to build multiple honeynet systems on one physical platform. Meanwhile, all of the honeynet systems with the same topology operate without interference.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.68-70
• /
• 1996

A fuzzy network using genetic algorithm is investigated in the context of control for finite dimensional nonlinear discrete systems. The proposed FN(Fuzzy Network) constructed to identify various parameter of fuzzy control is used for the nonlinear system control. Each of two FN, presented FN control system is based on a framework of closed loop control. A proposed FNN model trains using the modeling error and the closed loop error. That case study shows that the presented FN model and closed loop control system is very useful in practical sense.

• Journal of Internet Computing and Services
• /
• v.21 no.2
• /
• pp.121-130
• /
• 2020

This paper suggests evaluating the military closed network data as an image which is generated by Generative Adversarial Network (GAN), applying an image evaluation method such as the InceptionV3 model-based Inception Score (IS) and Frechet Inception Distance (FID). We employed the famous image classification models instead of the InceptionV3, added layers to those models, and converted the network data to an image in diverse ways. Experimental results show that the Densenet121 model with one added Dense Layer achieves the best performance in data converted using the arctangent algorithm and 8 * 8 size of the image.

• KDI Journal of Economic Policy
• /
• v.36 no.2
• /
• pp.175-196
• /
• 2014

This paper is a theoretical attempt to analyze and understand Yeonjulmang and Yeongyeolmang, which are terms for social networks with negative and positive connotation respectively in Korean Sociology. To do that, we analyze a social network where unilateral help are reciprocated. A social network in this context is a network where the past behaviors of its members are transmitted. With the information how the members behaved before, a social norm can emerge in the network, which facilitate the indirect reciprocation of unilateral help. In this norm, an agent's helping now will be rewarded by his being helped in the future. Since the reward happens in the future, this norm may not be sustained even if it is efficient. To sustain the reciprocation of the help, a norm can evolve to punish the violation of the norm more severely. If the punishment becomes too severe, the reciprocation of the help can be sustained even if it is not efficient any more in that the cost of help exceeds the benefit. If we allow the exit of the network, members have incentive to do it as belonging to the network is not beneficial any more. Then the social network may collapse. To avoid the collapse of the network, the exclusive norm, which exclude even mutually beneficial relationship with outsiders, may emerge. This can explain the emergence of Yeonjulmang, or a closed network, which is inefficient in double senses; 1) it may sustain inefficient reciprocation of help, and 2) the mutually beneficial relationship is excluded between an insider and an outsider of the network.

• Journal of Information Management
• /
• v.36 no.4
• /
• pp.199-215
• /
• 2005

Experts participating in the knowledge expert network externalize their implicit knowledge by providing information or writing reports. Almost all the members of the network share externalized knowledge and the network facilitate the dissemination and diffusion of knowledge. Individuals reproduce another implicit knowledge by internalizing shared knowledge through the network and re-created knowledge is externalized, establishing knowledge circulation. In this paper, we analyze the expert groups of the Global Network of Korean Scientists & Engineers(KOSEN, www.kosen21.org), the Korea's No. 1 science and engineering knowledge expert community, with the application of the theory of policy network proposed by Marsh & Rhodes. According to the principal standards of policy network classification such as the number of participants, interaction among participants, consistency, distribution of resources and dependency, we categorize the KOSEN expert groups as closed policy network and opened issue network, and divide closed policy network into core community and periphery community.

• International Journal of Air-Conditioning and Refrigeration
• /
• v.15 no.3
• /
• pp.137-146
• /
• 2007

CFD simulation is a very useful tool to predict the concentration of contaminant generated from the building materials in a single room. However, there is a limitation on analyzing air movement and contaminant concentration in a multi-room when the door of each room is closed. In this study, network based simulation was coupled with contaminant simulation for the multi-room condition, using an network simulation tool 'ESP-r'. The coupled simulation was first validated with experimental measurements which performed to define the characteristics of the analyzed space prior to the simulation, and indoor air flow and contaminant concentration between rooms were then analyzed when the door of each room was open and closed in the case of natural and forced ventilation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.27-44
• /
• 2000

In this study we consider a spares provisioning problem for repairable items in which a parts inventory system is incorporated. If a machine fails, a replacement part must be obtained at the parts inventory system before the failed machine enters the repair center. The inventory policy adopted at the parts inventory system is the (S, Q) policy. Operating times of the machine before failure, ordering lead times and repair times are assumed to follow a two-stage Coxian distribution. For this system, we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of machines at each station and the probability that a part will wait at the parts inventory system. For the analysis of the proposed system, we model the system as a closed queueing network and analyze it using a product-form approximation method. A recursive technique as well as an iterative procedure is used to analyze the sub-network. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interest.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.582-591
• /
• 2018

In this paper, we present a performance analysis of large-scale multi-input multi-output (MIMO) systems for wireless backhaul networks. We focus on fully connected N nodes in a wireless meshed and multi-hop network topology. We also consider a large number of antennas at both the receiver and transmitter. We investigate the transmission schemes to support fully connected N nodes for half-duplex and full-duplex transmission, analyze the achievable ergodic sum rate among N nodes, and propose a closed-form expression of the achievable ergodic sum rate for each scheme. Furthermore, we present numerical evaluation results and compare the resuts with closed-form expressions.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 1997.11a
• /
• pp.282-288
• /
• 1997

The purpose of this paper is to predict the situation of leak in closed space using an Artificial Neural Network (ANN). The existing system can't monitor the whole He situations with on/off signals. Especially the first stage of data determines the leak spot and intensity is disregarded in gas accidents. To complement these faults, a new prototype of monitoring system is proposed. Ihe system is composed of'sensing systenL data acquisition system computer, and ANN implemented in software and is capable of identifying the leak spot and intensity in closed space. The concentration of gas is measured at the 4 different places. The network has 3 layers that are composed of 4 input Processing Element (PE),24 hidden PEs, md 4 output PEs. The ANN has optimum condition through several experiments and as a consequence the recognition rate of93.75% is achieved finally

• Journal of Communications and Networks
• /
• v.1 no.2
• /
• pp.89-98
• /
• 1999

In a synchronization (sync) $network^1$containing N nodes, it is shown (Theorem 1c) that an arbitrarily connected sync network & is the union of a countable set of isolated connecting sync networks${&_i,i= 1,2,.., L}, I.E., & = \bigcup_{I=1}^L&_i$ It is shown(Theorem 2e) that aconnecting sync network is the union of a set of disjoint irreducible subnetworks having one or more nodes. It is further shown(Theorem 3a) that there exists at least one closed irreducible subnetwork in $&_i$. It is further demonstrated that a con-necting sync network is the union of both a master group and a slave group of nodes. The master group is the union of closed irreducible subnetworks in $&_i$. The slave group is the union of non-colsed irre-ducible subnetworks in $&_i$. The relationships between master-slave(MS), mutual synchronous (MUS) and hierarchical MS/MUS ent-works are clearly manifested [1]. Additionally, Theorem 5 shows that each node in the slave group is accessible by at least on node in the master group. This allows one to conclude that the synchro-nization information avilable in the master group can be reliably transported to each node in the slave group. Counting and combinatorial arguments are used to develop a recursive algorithm which counts the number $A_N$ of arbitrarily connected sync network architectures in an N-nodal sync network and the number $C_N$ of isolated connecting sync network in &. EXamples for N=2,3,4,5 and 6 are provided. Finally, network examples are presented which illustrate the results offered by the theorems. The notation used and symbol definitions are listed in Appendix A.