• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.769-775
• /
• 2011

Custom power devices such as dynamic voltage restorer (DVR) and DSTATCOM are used to improve the power quality in distribution systems. These devices require real power to compensate the deep voltage sag during sufficient time. An interline DVR (IDVR) consists of several DVRs in different feeders. In this paper, a neural network is proposed to control the IDVR performance to achieve optimal mitigation of voltage sags, swell, and unbalance, as well as improvement of dynamic performance. Three multilayer perceptron neural networks are used to identify and regulate the dynamics of the voltage on sensitive load. A backpropagation algorithm trains this type of network. The proposed controller provides optimal mitigation of voltage dynamic. Simulation is carried out by MATLAB/Simulink, demonstrating that the proposed controller has fast response with lower total harmonic distortion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.429-432
• /
• 2003

In this paper, a novel neural network approach is proposed for cleaning robot to complete coverage path planning with obstacle avoidance in stationary and dynamic environments. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation derived from Hodgkin and Huxley's membrane equation. There are only local lateral connections among neurons. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location without any prior knowledge of the dynamic environment.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.205-215
• /
• 2008

As static traffic assignment has reached its limitation with ITS policy applications and due to the increase of interest in studies of ITS policies since the late 1980's, dynamic traffic assignment has been considered a tool to overcome such limitations. This study used the Dynameq program, which simulates route choice behavior by macroscopic modeling and dynamic network loading and traffic flow by microscopic modeling in consideration of the feasibility of the analysis of practical traffic policy. The essence of this study is to evaluate the feasibility for analysis in practical transportation policy of using the dynamic traffic assignment technique. The study involves the verification of the values estimated from the dynamic traffic assignment with South Korea's expressway network and dynamic O/D data by comparing results with observed link traffic volumes. This study used dynamic O/D data between each toll booth, which can be accurately obtained from the highway Toll Collection System. Then, as an example of its application, exclusive bus-lane policies were analyzed with the dynamic traffic assignment model while considering hourly variations.

• 한국ITS학회:학술대회논문집
• /
• 2003.11a
• /
• pp.132-135
• /
• 2003

• Convergence Security Journal
• /
• v.12 no.4
• /
• pp.49-55
• /
• 2012

In this paper, we consider the limit of the previous works for ad-hoc network, then propose a dynamic routing scheme which employs a 2-tier hierarchical structure. We adopt the advantages of proactive and reactive routing scheme for efficient network management. We define this method as NSDR(New Secure Dynamic Routing) scheme. We also propose a trustworthy authentication and key management for the proposed ad-hoc network. We currently study the possibility that ad-hoc networks can provide a service such as key management and authentication for the next generation mobile network.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.951-958
• /
• 2004

This paper describes problems when visited ISP subscriber gets dynamic IP address in home ISP for wireless internet service on GPRS network. We propose a specific DHCP relay for wireless internet service of visited ISP subscriber on GPRS network. We designed and implemented the specific DHCP relay and installed it in ISP testbed. We show the allocated dynamic IP address using specific DHCP relay for visited ISP subscriber on GPRS network. Now we think it is possible the visited ISP subscriber can access wireless internet service on GPRS network using specific DHCP relay, and UMTS system can be managed IP address for subscriber roaming.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.691-698
• /
• 2003

Throughput response characteristics depending on the network bandwidth allocation need to be modeled to devise adaptive control mechanism to support QoS of the network. Thus, two models are proposed in this study. The first one is a dynamic system model and the other one is a stochastic model. The dynamic system model is developed to represent dynamic characteristics of the network and the stochastic model is developed to represent distribution of measured throughput data. An optimization technique is used for decision of proposed model's factor. The result confirms that the characteristics of proposed models are similar with actual network's characteristics.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.756-761
• /
• 2021

Dynamic route guidance (DRG) finds the fastest path from a source to a destination location considering the real-time congestion information. In Korea, the traffic state information is available by the public transportation data (PTD) which is indexed on top of the node-link map (NLM). While the NLM is the authoritative low-detailed road network for major roads only, the OpenStreetMap road network (ORN) supports not only a high-detailed road network but also a few open-source routing engines, such as OSRM and Valhalla. In this paper, we propose a DRG framework based on road network matching between the NLM and ORN. This framework regularly retrieves the NLM-indexed PTD to construct a historical speed profile which is then mapped to ORN. Next, we extend the Valhalla routing engine to support dynamic routing based on the historical speed profile. The numerical results at the Yeoui-do island with collected 11-month PTD show that our DRG framework reduces the travel time up to 15.24 % and improves the estimation accuracy of travel time more than 5 times.

• Nuclear Engineering and Technology
• /
• v.40 no.5
• /
• pp.375-386
• /
• 2008

Conventional static reliability analysis methods are inadequate for modeling dynamic interactions between components of a system. Various techniques such as dynamic fault tree, dynamic Bayesian networks, and dynamic reliability block diagrams have been proposed for modeling dynamic systems based on improvement of the conventional modeling methods. In this paper, we review these methods briefly and introduce dynamic nodes to the existing reliability graph with general gates (RGGG) as an intuitive modeling method to model dynamic systems. For a quantitative analysis, we use a discrete-time method to convert an RGGG to an equivalent Bayesian network and develop a software tool for generation of probability tables.