• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.499-505
• /
• 2004

In this paper, we studied about AGVs modeling and material handling automation simulation using a virtual AGV. The proposed virtual AGV model that operates independently each other is based on a real AGV. Continuous straight-line and workstation model using vector drawing method that could easily, rapidly work system modeling are suggested. Centralized traffic control, which could collision avoidance in intersection and should not stop AGV as possible, and algorithm for detour routing which performs when another AGV is working in pre-routed path are proposed. The traffic control and the algorithm have been proved efficience by simulation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.6
• /
• pp.744-749
• /
• 2013

The protection switching technology is widely adopted in the fiber-optical transmission equipments based on TDM(Time Division Multiplexing), such as PDH, SDH/SONET. A variety of protection switching algorithms for Ethernet networks and the progress of standardization are summarized in the document. There are several kinds of protection switching algorithms for Ethernet networks, such as STP, RSTP, MSTP and etc. However, since Ethernet signal move through detour route, it causes much time to recover. Accordingly, it is difficult to secure a usability of Ethernet networks and QOS(Quality of Service). Also, if the protection switching protocol standardized by IEEE and ITU-T is used, it remains a inherent network switching time for protection. Therefore, a specific protection switching algorithm for Ethernet are needed for seamless and stable operation of Ethernet networks service for Distribution Automation System(DAS). A reliable protection algorithm with no switching delay time is very important to implement Self-healing service for DAS. This study of FPGA based protection switching algorithm for Ethernet networks shows that in case of faults occurrence on distribution power network, immediate fault isolation and restoration are conducted through interaction with distribution equipments using P2P(Peer to Peer) communication for protection coordination. It is concluded that FPGA based protection switching algorithm for Ethernet networks available 0ms switching time is crucial technology to secure reliability of DAS.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.133-140
• /
• 2012

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

• Education of Primary School Mathematics
• /
• v.27 no.1
• /
• pp.91-110
• /
• 2024

The purpose of this study is to explore visual models for deriving the fractional division algorithm, to see how students understand this integrated model, the rectangular partition model, when taught in elementary school classrooms, and how they structure relationships between fractional division situations. The conclusions obtained through this study are as follows. First, in order to remind the reason for multiplying the reciprocal of the divisor or the meaning of the reciprocal, it is necessary to explain the calculation process by interpreting the fraction division formula as the context of a measurement division or the context of the determination of a unit rate. Second, the rectangular partition model can complement the detour or inappropriate parts that appear in the existing model when interpreting the fraction division formula as the context of a measurement division, and can be said to be an appropriate model for deriving the standard algorithm from the problem of the context of the inverse of a Cartesian product. Third, in the context the inverse of a Cartesian product, the rectangular partition model can naturally reveal the calculation process in the context of a measurement division and the context of the determination of a unit rate, and can show why one division formula can have two interpretations, so it can be used as an integrated model.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.427-439
• /
• 2006

The SBF (Simple Boundary Follower) is a boundary-following algorithm, and is used mainly for image recognition and presentation. The SBF is very popular because of its simplicity and efficiency in tracing the boundary of an object from an acquired binary image; however, it does have two drawbacks. First, the SBF cannot consistently process inner or inner-outer corners according to the follower's position and direction. Second, the SBF requires movement operations for the non-boundary pixels that are connected to boundary pixels. The MSBF (Modified Simple Boundary Follower) has a diagonal detour step for preventing inner-outer corner inconsistency, but is still inconsistent with inner-corners and still requires extra movement operations on non-boundary pixels. In this paper, we propose the ISBF (Improved Simple Boundary Follower), which solves the inconsistencies and reduces the extra operations. In addition, we have classified the tour maps by paths from a current boundary pixel to the next boundary pixel and have analyzed SBF, MSBF, and ISBF. We have determined that the ISBF has no inconsistency issues and reduces the overall number of operations.

• Journal of Korean Society of Transportation
• /
• v.29 no.2
• /
• pp.91-100
• /
• 2011

Hub network design for freight transportation is a decision process that determines hub locations together with freight transportation routes among shippers so as to ultimately minimize total logistics cost. This study presents the optimal location of hubs by strict hub network design policy with single allocation, which overcomes the limitation of Kim et al. (2008) that does not allow direct transportation among shippers. The greedy-interchange algorithm is employed for hub location decision process, and EMME/2 is adopted for the route searching process. Application of the processes to the nationwide highway network shows that the best hub locations in order are Seoul metropolitan, GyeongNam, Chung-nam, Jeon-Nam, Gyeong-Buk, Chung-Buk, and the locations are concentrated on the Seoul-Busan corridor. The strict hubnetwork design policy with single allocation increases the transportation distance but decreases the transportation cost by passing through the hubs instead of direct transportation. The reduction in total transportation cost can be achieved as the number of hubs increases, but the amount of the reduction gradually decreases because the cost reduction from the decrease in detour transportation distance between non-hubs and hubs becomes less than the discount reduction from dispersion of inter-hubs transportation volumes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.12
• /
• pp.17-23
• /
• 2010

In the mobile cloud computing, the mobile node should request and receive the services while being connected. In PMIPv6, all packets sent by mobile nodes or correspondent nodes are transferred through the local mobility anchor. This unnecessary detour still results in high delivery latency and significant processing cost. Several PMIPv6 route optimization schemes have been proposed to solve this issue. However, they also suffer from the high signaling costs and handover latency when determining the optimized path. We propose the route optimization handover scheme which adopts the prediction algorithm in PFMIPv6. In the proposed scheme, the new mobile access gateway establishes the bi-directional tunnel with the correspondent node's MAG using the context message when the mobile node's handover is imminent. This tunnel may eliminate the need of separate route optimization procedure. Hence, the proposed scheme can reduce the signaling cost than other conventional schemes do. Analytical performance evaluation is preformed to show the effectiveness of the proposed scheme. The result shows that our scheme is more effective than other schemes.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.447-454
• /
• 2003

Optical burst switching (OBS) has been proposed to reduce the use of fiber delay lines (FDLs) and to realize the optical switching paradigm of the next-generation ail optical networks. The OBS can provide improvements over wavelength routing in terms of bandwidth efficiency and core network scalability via statistical multiplexing of bursts. Recently, another challenging issue is how to upport quality of service (QoS) in the optical burst switching networks. In this paper, we propose a deflection routing scheme to guarantee the QoS for the OBS networks to detour lower priority burst forward to the deflection routing path when congested. A big advantage of the proposed scheme is the simplicity of QoS provision, that comes from the simple QoS provisioning algorithm. Also, the QoS provisioning scheme be able to make efficient networks by fairly traffic distributing with the reduce of the use of FDLs at core routers. The QoS provisioning scheme has been verified to reliably guarantee the QoS of priority 0, 1, 2 burst and to efficiently utilize network resources by computer simulations using OPNET As results, the end-to-end delay of high priority burst is improved, and the network efficiency is also improved.