• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.4
• /
• pp.188-196
• /
• 2001

This paper presents and efficient algorithm for the loss minimization by automatic sectionalizing switch operation in distribution systems. Ant colony algorithm is multi-agent system in which the behaviour of each single agent, called artificial ant, is inspired by the behaviour of real ants. Ant colony algorithm is suitable for combinatiorial optimization problem as network reconfiguration because it use the long term memory, called pheromone, and heuristic information with the property of the problem. The proposed methodology with some adoptions have been applied to improve the computation time and convergence property. Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.505-507
• /
• 2005

이 논문에서는 Wireless Network Mobility(NEMO) 환경하에서 지속적인 인터넷 연결성을 지원하고 또한 multi-angular routing 을 방지하여 최적화된 경로를 제공하기 위한 메커니즘을 제안한다. 이를 위해 각각의 NEMO 들은 parent-child 관계를 가지는 계층적 멀티 홉 NEMO 구조로 표현하고, 네트워크 이동성을 제공하기 필요한 최소한의 Mobile IPv6 Extension 에 대해서 설명한다. 또한 Wireless NEMO 환경하에서 hop by hop 터널링 기법을 이용한 최적화된 라우팅 동작에 대해 기술한다.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.757-759
• /
• 1996

This paper proposes an application of artificial neural networks to the bus-bar separation in a substation for radial network operation. For the effective bus-bar operation, the insecurity index of transmission line load is introduced. For the radial network operation. the constraints of bus-bar switch is formulated in the performance function with the insecurity index. The determination of bus-bar switching is to find the states of 0 or 1 in the circuit breakers. In this paper, it is tested that the bus-bar separation of binary optimization problem can be solved by Hopfield networks with adequate manipulations.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.453-458
• /
• 2010

In the paper, we propose an energy efficient sensor network management scheme. In the proposed scheme, the modified game theory and ${\varepsilon}$-constraint techniques are sophisticatedly combined to establish energy efficient routing paths. Simulation results indicate that the proposed scheme can strike an appropriate performance balance between conflicting requirements while other existing schemes cannot offer such an attractive performance.

• IE interfaces
• /
• v.24 no.1
• /
• pp.87-96
• /
• 2011

In this paper, we address an optimization problem for minimizing the inspection and rework cost in an inspection-rework system, which forms a network of nodes including a K-stage inspection system, storage areas for items, a source inspection shop, and a re-inspection shop. We assume that (n, 0) acceptance sampling is performed in the source inspection shop and that only 100(1-r)% of items of rejected lots are re-inspected in the re-inspection shop. Since all the nodes are interrelated, in order to formulate our steady-state objective function, we make a steady-state network flow analysis between nodes, and derive both the steady-state amount of flows between nodes and the steady-state fraction defectives by solving a nonlinear balance equation. Finally we provide some fundamental properties and an enumeration procedure for determining the optimal values of (K, r) which both minimizes our objective function and attains a given target average outgoing quality.

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.49-62
• /
• 1991

This paper examines the problems of database partitioning and file allocation in a fixed topology distributed computer network. The design objective is to make files as collections of attributes and to allocate these files to network nodes so that a minimum total transmission cost is achieved subject to storage capacity constraints. A mathematical model for solving the problem is formulated and, the resulting optimization problem is shown to fall in a class of NP-complete problems. A new heuristic algorithm is developed which uses the idea of allocating attributes according to the transaction requirements at each computer node and then making files using the allocated attributes. Numerical results indicate that the heuristic algorithm yields practicable low cost solutions in comparison with the existing methods which deal with the file allocation problems and database partitioning problems independently.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.237-242
• /
• 2011

LTE/SAE has presented the handover key management to revoke the compromised keys and to isolate corrupted network devices. In this paper, we identify that the handover key management is vulnerable to so-called de-synchronization attacks, which is jeopardizing the forward secrecy of handover key management. We place an emphasis on periodic root key update to minimize the effect of the de-synchronization attacks. An optimal value for the root key update interval is suggested in order to minimize signaling load and ensure security of user traffic.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.88.5-88
• /
• 2001

We propose a neural network solver for an inverse problem. The problem is that input data with complete teaching include defects and predict the defect value. The solver is constructed of a three layer neural network whose learning method is combined from BP and reconstruction learning. The input data for the defects are unknown; therefore, the circulation of an arithmetic progression replaces them; rightly, the learning procedure is not converged for the circulation data vut for the normal data. The learning is quitted after such a learning status id kept. Then, we search a minimum of the differences between teaching data and output of the circulation. Then, we search a minimum of the ...

• Geomechanics and Engineering
• /
• v.2 no.1
• /
• pp.57-69
• /
• 2010

A major consideration in the design of tunnels in urban areas is the prediction of the ground movements and surface settlements associated with the tunneling operations. Excessive ground movements can damage adjacent building and utilities. In this paper, a neural network model is used to predict the maximum surface settlement, based on instrumented results from three separate EPB tunneling projects in Singapore. This paper demonstrates that by coupling the trained neural network model to a spreadsheet optimization technique, the reliability assessment of the settlement serviceability limit state can be carried out using the first-order reliability method. With this method, it is possible to carry out sensitivity studies to examine the effect of the level of uncertainty of each parameter uncertainty on the probability that the serviceability limit state has been exceeded.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.165-175
• /
• 2019

Networks use relatively slow heartbeat mechanisms, usually in routing protocols, to detect failures when there is no hardware signaling to help out. The time to detect failures available in the existing protocols is no better than a second, which is far too long for some applications and represents a great deal of lost data at 10 Gigabit rates. We compare the convergence time of routing protocol applying Bidirectional Forwarding Detection (BFD) protocol in wired mesh network topology. This paper suggests the combinations of protocols improving fail-over performance. Through the performance analysis, we contribute to reduce convergence time when system is fail-over.