• Journal of the Optical Society of Korea
• /
• v.19 no.1
• /
• pp.13-21
• /
• 2015

In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.26-31
• /
• 2014

In this paper, we present performance analysis of video smoke detection based on BPN-Network that is using multi-smoke feature, and Neural Network. Conventional smoke detection method consist of simple or mixed functions using color, temporal, spatial characteristics. However, most of all, they don't consider the early fire conditions. In this paper, we analysis the smoke color and motion characteristics, and revised distinguish the candidate smoke region. Smoke diffusion, transparency and shape features are used for detection stage. Then it apply the BPN-Network (Back-Propagation Neural Network). The simulation results showed 91.31% accuracy and 2.62% of false detection rate.

• IE interfaces
• /
• v.11 no.2
• /
• pp.39-48
• /
• 1998

It is strongly believed that Video on Demand(VOD) will become one of the most promising services for Broadband Integrated Services Digital Network(B-ISDN). VOD service can be classified into two types of services: Near VOD(NVOD) and Interactive VOD(IVOD). Although VOD network requires many kinds of resources, we only consider video servers, programs. and storages. In the network. some video servers should be installed at some nodes(especially, at the root node for NVOD service). so that each node with video server stores video programs and distributes stored programs to customers. We take into account three kinds of costs related with the above resources: a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to the locations of video servers and the kinds of programs stored at each video server. Given a multi-level VOD network and the total number of programs being served in the network. the resource. optimization problem for providing both IVOD and NVOD services is to determine where to install video servers, and which and how many programs should be stored at each video server, in order to minimize the total cost. In this paper we develop an efficient dynamic programming algorithm to solve the problem. We also implement the algorithm based on two different service policies assumed in this paper.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.451-453
• /
• 2019

Recently, as the use of wireless communication devices has increased, the wireless network usage has increased, and a wired network and a wireless network have been mixed to form a network. Existing TCP algorithms are designed for wired networks. Therefore, in the modern network environment, packet loss can not be accurately distinguished and improper congestion control is performed, resulting in degradation of TCP performance. In this paper, we propose SLDA (Support Vector Machine based Loss Discrimination Algorithm) which can accurately classify the packet loss environment to improve TCP performance and evaluate its performance.

• Journal of Conservation Science
• /
• v.21
• /
• pp.21-32
• /
• 2007

Low-viscosity alkoxysilanes that polymerize into the porous network of decayed stone by a sol-gel process are widely used as stone consolidants. During drying, the gel network contracts due to capillary pressure generated by solvent evaporation. We have prepared tetraethoxysilane mixed solution containing methyltrisilane, ethyl trisilane and (3-glycidyloxypropyl)trimethoxysilane having epoxy ring in order to reduce the shrinkage happened inside the stone porous structure during the gel formation. Mixed solutions were applied into sandstone and granites and characterized by FT-IR, SEM. The gelation time, water uptake, contact angles were measured and compared with those of the commercial stone conservation materials.

• Journal of Korean Elementary Science Education
• /
• v.39 no.3
• /
• pp.323-337
• /
• 2020

To achieve effective learning, knowledge must be shared and developed through interaction with peer learners. Therefore, science education emphasizes small group inquiry activities that solves tasks through the interaction of members. The effect of small group inquiry activities depends on how to compose small groups. The way in which a group is composed is a very important factor for improving interaction. In particular, it has been reported that the gender of peer is a very important factor in the interaction between students in the composition of small groups. Meanwhile, studies are being conducted on the types and stability of verbal interactions in small group inquiry activities using social network analysis. The purpose of this study is to analyze the types and stability of verbal interaction types and stability according to gender-grouping in elementary school students' small group activities using social network analysis. To this end, 60 5th graders in elementary school were conducted with different gender in the composition of the group of male, female and mixed-gender students. The study found that the composition of a group by gender had little impact on the type or stability of verbal interaction. However, the frequency of verbal interactions was higher in mixed-gender groups than in other groups. Through this process, the gender-grouping in elementary school students' small group activities suggests a mixed-gender group.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.34-36
• /
• 2022

In the existing text sentiment analysis models, the entire text is usually directly modeled as a whole, and the hierarchical relationship between text contents is less considered. However, in the practice of sentiment analysis, many texts are mixed with multiple emotions. If the semantic modeling of the whole is directly performed, it may increase the difficulty of the sentiment analysis model to judge the sentiment, making the model difficult to apply to the classification of mixed-sentiment sentences. Therefore, this paper proposes a sentiment analysis model BHGCN that considers the text hierarchy. In this model, the output of hidden states of each layer of BERT is used as a node, and a directed connection is made between the upper and lower layers to construct a graph network with a semantic hierarchy. The model not only pays attention to layer-by-layer semantics, but also pays attention to hierarchical relationships. Suitable for handling mixed sentiment classification tasks. The comparative experimental results show that the BHGCN model exhibits obvious competitive advantages.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.205-213
• /
• 2019

Network robustness is one of the most important characteristics needed as the network. Over the military tactical communication network, robustness is a key function for maintaining attack phase constantly. Tactical Information Communication Network, called TICN, has mixed characteristics of lattice- and tree-type network topology, which looks somewhat weak in the viewpoint of network robustness. In this paper, we search articulation points and bridges in a current Tactical Information Communication Network using graph theory. To improve the weak points empirically searched, we try to add links to create the concrete network and then observe the change of network-based verification values through diminishing nodes. With these themes, we evaluate the generated networks through SNA techniques. Experimental results show that the generated networks' robustness is improved compared with current network structure.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.142-145
• /
• 2013

Network virtualization opens the door to novel infrastructure services offering connectivity and node manageability. In this letter, we focus on the cost-efficient embedding of on-demand virtual optical network requests for interconnecting geographically distributed data centers. We present a mixed integer linear programming formulation that introduces flexibility in the virtual-physical node mapping to optimize the usage of the underlying physical resources. Illustrative results show that flexibility in the node mapping can reduce the number of add-drop ports required to serve the offered demands by 40%.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.845-851
• /
• 2002

An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.