• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-19
• /
• 2015

In order to guide the robots move along a collision-free path efficiently and reach the goal position quickly in the unknown multi-obstacle environment, this paper presented the navigation problem of a wheel mobile robot based on proximity sensors by fuzzy logic controller. Then a genetic algorithm was applied to optimize the membership function of input and output variables and the rule base of the fuzzy controller. Here the environment is unknown for the robot and contains various types of obstacles. The robot should detect the surrounding information by its own sensors only. For the special condition of path deadlock problem, a wall following method named angle compensation method was also developed here. The simulation results showed a good performance for navigation problem of mobile robots.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.20-28
• /
• 2001

In this paper, we present an efficient path-based multicast algorithm in wormhole-routed mesh networks. Our algorithm is based on a network partitioning strategy that uses two Hamiltonian paths. In the previous studies, only on a network partitioning strategy that uses two Hamiltonian paths. In the previous studies, only one Hamiltonian path was used. Thus messages traverse mire horizontal channels than vertical ones, leading to earlier network congestion. By incorporating additional vertical Hamiltonian path as well as the horizontal Hamiltonian path, messages are distributed evenly as much as possible, thus making network evenly as much as possible, thus making network performance better. We prove that this algorithm is deadlock-free. And by extensive simulations, we show that this algorithm is superior to the previous ones by 15∼20%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.287-299
• /
• 2000

In this paper, we classify multicast methods into three categories, i.e., tree-based, path-based, and hybrid-based multicasts, for a multicomputer employing the bidirectional torus network and wormhole routing. We propose the dynamic partition multicast routing (DPMR) as a path-based algorithm. As a hybrid-based algorithm, we suggest the hybrid multicast routing (HMR), which employs the tree-based approach in the first phase of routing and the path-based approach in the second phase. Performance is measured in terms of the average latency for various message length to compare three multicast routing algorithms. We also compare the performance of wormhole routing having variable buffer size with virtual cut-through switching. The message latency for each switching method is compared using the DPMR algorithm to evaluate the buffer size trade-off on the performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.373-382
• /
• 2000

The most important metric in wormhole-routed networks is the start-up latency. In this paper, we present new multicast algorithms that reduce node contention so that multiple multicast messages can be implemented with reduced latency. By exploiting available channels evenly as much as possible, these new algorithms show better performance than the existing multicast algorithms for wormhole 2D systems when multiple multicasts are involved. All algorithms presented are proven to be deadlock-free. A simulation study has been conducted that compares the performance of these multicast algorithms under various situations in a 2D mesh. We show that the overall performance of ours are up to 20% better than the previous studies. We observe that reducing the number of the generated multidestination messages closely related to shorter message latency. These proposed algorithms can be easily extended to 3D mesh systems.

• Journal of Popular Narrative
• /
• v.26 no.2
• /
• pp.191-219
• /
• 2020

This paper aims to identify the key features of the novel writing of Korean American immigrants and their meaning as one aspect of movement and contact occuring in the early modern period. The late return of the novels written by Nakcheong THUN in the 1930s is significant in that it restored ideas on the diversity of early modern mobility and confronted the history and culture of immigrants who were excluded from records and memories. Not only are these novels a product of the phenomenon of immigration, but they have also created a crack in the dichotomous perceptions of domination and subordination, center and periphery by envisioning it as a space that creates new history, culture, institutions and values. These novels treat the free love of intellectual, emotional, and ethical figures as a central event, demystifying Western free love, and at the same time, a society divided by various identities including class, race, and gender. The novels by Nakchung THUN visualize the active exchange between the immigrant and the indigenous community through the character of Jack, and imagines the heterotopia as a place where not for the immigrants' utopia, but for everyone's coexists. These novels have declared a kind of memory war on the subordinate and marginalized contact zones. The contact zones of the immigration area had been a place for experiencing extreme conflicts and discords, and at the same time, it has served as a place where various groups and communities are connected. The contact zones were common areas of solidarity and creation before being subject to division and occupation. The contact zones are far from the border or borderlands, so it is not a fixed and immutable deadlock. As a world free from central domination the contact zones have been a space that preoccupied history and culture through various encounters, and have been a community.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.277-286
• /
• 2000

Switch-based network is suitable for the environment of demanding high performance network. Traditional shared-medium Local Area Networks(LANs) do not provide sufficient throughput and latency. Specially, communication performance is more important with multimedia application. In these environments, switch-based network results in high performance. A kind of switch-based network provides higher bandwidth and low latency. Thus high-speed switch is essential to build switch-based LANs. An effective switch design is the most important factor of the switch-based network performance, and is required for the multicast message processing. In the previous cut-through switching technique, switch element reconfiguration has the capability of multicasting and deadlock-free. However, it has problems of low throughput as well as large scale of switch. Therfore, effective multicating can be implemented by using divided hardware unicast and multicast. The objective of this thesis is to suggest switch configuration with these features.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.55-62
• /
• 2011

To make service location protocol of IETF which is to be used in the wide area network to discover the location of desired service when computing resources are connected to the network, and to support simless connectivity between wired and wireless network in service viewpoint, to support the diversity trend of service agents in WIF, it needs to improve SLP, so as to add Liaison Agent and Forwarding Agent with FAAdvert message that is to communicate in between those entities. LA entity confirms the location of service located in wide area network, and FA transfers service information. The usage of existing messages such as SrvRqst, SrvRply, AttrRqst, AttrRply, DAAdvert, SrvReg, SrvAck, SrvDeReg is same as ever in wide area service network. The behaviors of improved protocol is modeled into petri-net and prove that it is free of deadlock and live-lock by execution of the model.

• Journal of Navigation and Port Research
• /
• v.38 no.5
• /
• pp.493-501
• /
• 2014

An automated lifting vehicle(ALV) used in an automated container terminal is a type of unmanned vehicle that can self-lift a container as well as self-transport it to a destination. To operate a fleet of ALVs efficiently, one needs to be able to determine a minimum-time route to a given destination whenever an ALV is to start its transport job. To find a route free from any collision or deadlock, the occupation time of the ALV on each segment of the route should be carefully scheduled to avoid any such hazard. However, it is not easy because not only the travel times of ALVs are uncertain due to traffic condition but also the operation times of cranes en route are not predicted precisely. In this paper, we propose a routing method based on an ant colony optimization algorithm that takes into account these uncertainties. The result of simulation experiment shows that the proposed method can effectively find good routes under uncertainty.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.360-374
• /
• 2004

The OSPF protocol is the most widely used Interior Gateway Routing Protocol. Therefore, for the reliability of behavior of gigabit swiching routers, it is essential to guarantee the interoperability and the safety of the OSPF protocol. In this paper, we analyze the standard document of the OSPF protocol, so that we provide a formal specification that specifies the protocol behaviors by detailed design level using the algebraic formal method. By referring available source codes of the OSPF protocol, we supplement the formal specification to express more detailed behaviors that is not specified definitely in the standard. We also formally verify the interoperability and the safety of the protocol state machine of the specification. By showing that the formal specification specify all of the states and the transition events that appear in the standard document of the OSPF protocol, we prove that the state machine has the completeness, and prove it has the interoperability. To prove that the specification of the protocol has the safety, we formally verify the reachability, the liveness, the livelock-free property, and the deadlock-free property. As a result, we prove the protocol has the consistency. The specification and the validation are also effective to the OSPF Version 3 that inherit the protocol mechanism of the OSPF Version 2.