• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• 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.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.1740-1745
• /
• 2004

A simplified resistor network model for electrical and mass transport in anode-supported planar solid oxide fuel cell (SOFC) was constructed in order to investigate the effect of interconnect rib geometry on the cell performance. For accurate potential calculation, activation and concentration over-potentials at the electrode/electrolyte interfaces were fully considered in this calculation. When contact resistance was not considered, the optimum interconnect rib length were calculated to be $0.1{\sim}0.2$ mm for 2 mm half unit cell for given operation conditions and properties. However, with realistic contact resistance, the interconnect rib length should be increased to provide larger contact area and thus to obtain better performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.488-491
• /
• 1997

The PMGS(Plant Model Generating System) was developed based on modular modeling method and fluid network calculation concept. Fluid network calculation is used as a method of real-time computation of fluid network, and the module which has a topology with node and branch is defined to take advantages of modular modeling. Also, the database which have a shared memory as an instance is designed to manage simulation data in real-time. The applicability of the PMGS was examined implementing the HRSG(Heat Recovery Steam Generator) control logic on DCS.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.4
• /
• pp.533-542
• /
• 1994

This paper presents the new algorithm for fault analysis and this algorithm obtains requisite term for fault analysis by the two-port network technique. Therefore, the fault calculation time is composed of only few fundamental arithmetic calculation. The graphic user environment for fault analysis is implemented in mouse-oriented user interface with window and pull-down menu. The result of the algorithm proved to be identical with the sample system in Ref.[8]. this package can be a useful tool for fault analysis.

• Proceedings of the KIEE Conference
• /
• 2008.11a
• /
• pp.50-52
• /
• 2008

We have limited the transfer power to capital area below a certain level which is called "The Capital Area Transfer Power Limit", and calculated on every Thursday for the application next week. This level is very important in our network operation, because if this level is not set properly, our power network can be fallen under great danger in case of a fault among the transfer power line. But the calculation procedure for the limit level is so complicated and iterative that it mace us spend much time and do much work. So, when a sudden trip of the related facility to the limit level we can't recalculate the limit level fast enough. And this can drop our network reliability below our standards, therefore our network can be dangerous. To avoid this kind of problems, we have figured out a method to calculate simply the limit level. That method uses the index related to the level. We think this method can make short of the calculation procedures for the level. This paper deals with the simplified method for the calculation of the level limit.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.271-276
• /
• 2002

The test statistic in ANOVA tests has a single or doubly noncentral F distribution and the noncentral F distribution is applied to the calculation of the power functions of tests of general linear hypotheses. Although various approximations of noncentral F distribution are suggested, they are troublesome to compute. In this paper, the calculation of noncentral F distribution is applied to the neural network theory, to solve the computation problem. The neural network consists of the multi-layer perceptron structure and learning process has the algorithm of the backpropagation. Using fables and figs, comparisons are made between the results obtained by neural network theory and the Patnaik's values. Regarding of accuracy and calculation, the results by neural network are efficient than the Patnaik's values.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.1405-1410
• /
• 2006

Purpose of this research is that offers basic data for optimized design using neural network method to calculate consolidation settlement in study area. In this research, preformed the neural network method that analyzed the settlement characteristics of soft ground nearby study area. Thus, data base established on ground properties and consolidation settlement of neighboring area. In addition, designed the optimum neural network model for prediction of settlement through network learning and consolidation settlement prediction using consolidation settlement DB and ground properties DB. Optimized neural network model decided by repeated learning for various case of hidden layers. In this study, proposed that the optimized consolidation settlement calculation method using neural network and verified which is the optimized consolidation settlement calculation method using neural network.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.43-46
• /
• 2008

Centrality has been actively studied in network analysis field. In this paper we show a calculation method of closeness centrality for WSN. Since nodes in a sensor network are very scarce in energy and computation capability the calculation of the closeness is done in two tiers by dividing network into clusters. In first step closeness centrality for cluster heads is calculated. In the second step closeness of member nodes of the chosen cluster is computed in respect to that cluster itself.

• Proceedings of the KSR Conference
• /
• 2000.11a
• /
• pp.696-703
• /
• 2000

This paper describes the capacity calculation of power supply system for light Rail Transit Three factors are considered for the design i.e. substation arrangements, line configuration and substation power capacity. In this study, we considered all of them for capacity calculation of power supply system for LRT. At first DC-fed-traction system is introduced on an outline, a characteristics of train and fed network, and design method of substation arrangements. Optimal design procedures are described, and program for capacity calculation of the system is presented. In addition, the computer simulated results are computed with the conventional simple calculation method.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2004.05a
• /
• pp.25-36
• /
• 2004

The key objective of this paper is to suggest a pilot model for mobile network interconnection charge calculation by bottom-up long-run incremental costing methodology. Interconnection issues have lately attracted considerable attention by network operators and regulators. However there is no standard by all the network operators' agreement. The costing method is an acute problem because the interconnection charge is directly related to the network operators' revenue. Thus Korea has planned to launch the new interconnection policy based on the current traffic distribution and then we simulate the model in a sample area with virtual data. The results propose objective and reasonable guideline for the mobile network element cost calculation. It can be helpful for calculating price floor or bottom-up long run incremental interconnection charge by regulator.