• 한국시뮬레이션학회논문지
• /
• 제3권1호
• /
• pp.151-165
• /
• 1994

Broadband network based on the Asynchronous Transfer Mode(ATM) concept are becoming the target technology for the emerging Broadband Integrated Services Digital Network(B-ISDN). Since B-ISDN is very complex and requites a great amount of investment, optimum design and performance analysis of such systems are very important. Simulation can be widely used to analyze and examine the broadband network behavior. However, for the complicated system like broadband networks it is extremely difficult and time-consuming to develop a complete model for simulation. In this paper, an object-oriented modeling approach for the broadband network simulation is presented for the effective and efficient modeling. Object-oriented approaches can provide a good structuring capability for complicated simulation models and facilitate the development of reusable and extensible simulation models. We have developed an object-oriented model which consists of object model and behavior model. In the object mode., the components of the broadband network and both constant bit rate(CBR) and variable bit rate(VBR) traffic types of call level, burst level, and cell level are modeled as object classes. In the behavior model, the dynamic features for each object class are represented using the state transition diagram. It has been shown by illustration that objectoriented modeling is an effective tool for modeling the complicated B-ISDN.

• 한국경영과학회지
• /
• 제27권1호
• /
• pp.33-51
• /
• 2002

A fully connected Artificial Neural Network (ANN) contains many connections. Compared to the pruned ANN with fewer connections, the fully connected ANN takes longer time to produce solutions end may not provide appropriate solutions to new unseen date. Therefore, by reducing the sloe of ANN, we can overcome the overfitting problem and increase the computing speed. In this research, we reduced the size of ANN by destroying the connections. In other words, we investigated the performance change of the reduced ANN by systematically destroying the connections. Then we found the acceptable level of connection-destruction on which the resulting ANN Performs as well as the original fully connected ANN. In the previous researches on the sloe reduction of ANN, the reduced ANN had to be retrained every time some connections were eliminated. Therefore, It tool lolly time to obtain the reduced ANN. In this research, however, we provide the acceptable level of connection-destruction according to the size of the fully connected ANN. Therefore, by applying the acceptable level of connection-destruction to the fully connected ANN without any retraining, the reduced ANN can be obtained efficiently.

• International journal of advanced smart convergence
• /
• 제8권1호
• /
• pp.141-146
• /
• 2019

These days, there are many applications using neural networks as parts of their system. On the other hand, adversarial examples have become an important issue concerining the security of neural networks. A classifier in neural networks can be fooled and make it miss-classified by adversarial examples. There are many research to encounter adversarial examples by using denoising methods. Some of them using GAN (Generative Adversarial Network) in order to remove adversarial noise from input images. By producing an image from generator network that is close enough to the original clean image, the adversarial examples effects can be reduced. However, there is a chance when adversarial noise can survive the approximation process because it is not like a normal noise. In this chance, we propose a research that utilizes high-level representation in the classifier by combining GAN network with a trained U-Net network. This approach focuses on minimizing the loss function on high representation terms, in order to minimize the difference between the high representation level of the clean data and the approximated output of the noisy data in the training dataset. Furthermore, the generated output is checked whether it shows minimum error compared to true label or not. U-Net network is trained with true label to make sure the generated output gives minimum error in the end. At last, the remaining adversarial noise that still exist after low-level approximation can be removed with the U-Net, because of the minimization on high representation terms.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Nuclear Engineering and Technology
• /
• 제48권3호
• /
• pp.702-710
• /
• 2016

Global concern and interest in the safety of nuclear power plants have increased considerably since the Fukushima accident. In the event of a severe accident, the reactor vessel water level cannot be measured. The reactor vessel water level has a direct impact on confirming the safety of reactor core cooling. However, in the event of a severe accident, it may be possible to estimate the reactor vessel water level by employing other information. The cascaded fuzzy neural network (CFNN) model can be used to estimate the reactor vessel water level through the process of repeatedly adding fuzzy neural networks. The developed CFNN model was found to be sufficiently accurate for estimating the reactor vessel water level when the sensor performance had deteriorated. Therefore, the developed CFNN model can help provide effective information to operators in the event of a severe accident.

• 대한교통학회지
• /
• 제27권3호
• /
• pp.49-58
• /
• 2009

대전시를 사례로 위계수준을 달리한 4개의 노선망 대안(대안 1은 위계가 없는 노선망, 대안 2, 대안 3, 대안 4는 각각 초급, 중급, 상급 수준의 위계를 가진 노선망)을 작성하고, 평가지표(차내통행시간비용, 대기시간비용, 환승페널티비용)를 산출하여 대안간 비교를 통해 효율성을 분석하였다. 차내통행시간비용은 위계가 높은 대안일수록 감소하다가 위계가 매우 높아지면 다시 증가하는 것으로나타났다. 대기시간 비용은 위계가 높은 대안일수록 큰폭으로 감소하며, 환승페널티비용은 위계가 높은 대안일수록 증가하는 것으로 나타났다. 종합적으로 볼 때 총통행비용은 위계가 있는 노선망이 위계가 없는 노선망에 비하여 낮은 것으로 나타나 위계구조를 가진 노선망의 효율성이 높은 것으로 나타났다. 위계가 있는 노선망 중에서는 위계가 높을수록 총통행비용이 감소하다가 위계가 지나치게 높아지게 되면 오히려 증가하는 특성을 보임으로써 중급수준의 위계를 가진 노선망이 가장 효율성이 높은 것으로 분석되었다.

• 경영과학
• /
• 제14권1호
• /
• pp.205-227
• /
• 1997

Higher level representation splay an important role in model management systems. The role is to make decision makers friendly represent their problem using the representations. In this research, we address higher level representations including five distinctivenesses: Objective, Node, Link, Topological Constraint including five components, and Decision, Therefore, it is developed a system called HLRNET that implements the building procedure of network models using structural knowledge and object data The paper particularly elaborates all components included in each of distinctiveness extracted from structural characteristics of a lot of telecommunication network models. Higher level representations represented with five destinctivenesses should be converted into base level representations which are employed for semantic representations of linear and integer programming problems in a knowledge-assisted optimization modeling system. The system is illustrated with an example of the local access network model.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.550-552
• /
• 1999

This paper describes a control technique of coupled tank level using Evolutionary Neural Network. In general, the control of tank level without a dangerous overflow and with a high accuracy is difficult because of higher order time delay and nonlinearity. Nonetheless, proposed Evolution Neural Network controller in this paper was successfully implemented and simulation results of the superiority over a conventional PID one was investigated.

• 성인간호학회지
• /
• 제15권4호
• /
• pp.607-616
• /
• 2003

Purpose: The purpose of the study was to examine the relationships among social support (network, composition, and satisfaction), stress, and loneliness in migrant Yanbian Korean workers. Method: Data were collected by using Social Support Questionnaire 6, Visual Analogue Scale, and the Revised UCLA Loneliness Scale. Result: Results indicate that means for social support were 1.52 for network size and 4.83 for satisfaction. The proportion percentage of network for kin members was 67.37. Subjects felt the moderate level of stress and loneliness. The level of loneliness was negatively related to the level of social support. Conclusion: This study showed that there is necessity to reduce stress and loneliness among migrant Yanbian Korean workers. Adequate social support satisfaction is crucial to reduce the level of loneliness in migrant Yanbian Korean workers.

• Journal of Contemporary Eastern Asia
• /
• 제15권1호
• /
• pp.64-77
• /
• 2016

This case study takes a look at the hyperlink networks extracted from the websites of 367 international non-governmental organizations (NGOs) with datasets from 2010, 2012 and 2014. The first level of evaluation focuses on connections between the NGOs, identifying important nodes, groups and their relations. The second level takes into account the broad range of networked websites from the World Wide Web delivering insights into general networking patterns. The third level explores the underlying spatial configurations of the network which offers a great variety of geographic insights on information flows between and within continents, countries and cities. The most interesting findings of this study are a low level of interconnectedness between the NGOs and at the same time a strong spatial concentration of all embedded network actors.