• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.594-596
• /
• 1998

In this paper, a path control switch has been developed for self-healing operation in SDH-based transmission system. The proposed switch is suitable for self-healing operations in both an Unidirectional Path Switched Ring and a 2-fiber Bidirectional Line Switched Ring. The path control switch is implemented with $0.8{\mu}m$ CMOS LSI chip. The self-healing operation of the switch is effectively done by the configuration information stored in the registers of the switch. The switch has an AU-3(51.84Mb/s) TSI(Time Slot Interchange) and has 1.25Gb/s throughput. But the higher throughput can be realized by combining two identical switches or more with the parallel architecture.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.13 no.1
• /
• pp.758-771
• /
• 2021

This paper presents a novel control scheme for the three-dimensional (3D) path following of underactuated Autonomous Underwater Vehicle (AUVs) subject to unknown internal and external disturbances, in term of the time scale decomposition method. As illustration, two-time scale motions are first artificially forced into the closed-loop control system, by appropriately selecting the control gain of the integrator. Using the singular perturbation theory, the integrator is considered as a fast dynamical control law that designed to shape the space configuration of fast variable. And then the stabilizing controller is designed in the reduced model independently, based on the time scale decomposition method, leading to a relatively simple control law. The stability of the resultant closed-loop system is demonstrated by constructing a composite Lyapunov function. Finally, simulation results are provided to prove the efficacy of the proposed controller for path following of underactuated AUVs under internal and external disturbances.

• Journal of Aerospace System Engineering
• /
• v.14 no.2
• /
• pp.1-11
• /
• 2020

Detecting obstacles and generating a suitable path to avoid obstacles in real time is a prime mission requirement for UAVs. In areas, close to buildings and people, detecting obstacles in the path and estimating its own position (egomotion) in GPS degraded/denied environments are usually addressed with vision-based Simultaneous Localization and Mapping (SLAM) techniques. This presents possibilities and challenges for the feasible path generation with constraints of vehicle dynamics in the configuration space. In this paper, a near real-time feasible path is shown to be generated in the ORB-SLAM framework using a chain-based path planning approach in a force field with dynamic constraints on path length and minimum turn radius. The chain-based path plan approach generates a set of nodes which moves in a force field that permits modifications of path rapidly in real time as the reward function changes. This is different from the usual approach of generating potentials in the entire search space around UAV, instead a set of connected waypoints in a simulated chain. The popular ORB-SLAM, suited for real time approach is used for building the map of the environment and UAV position and the UAV path is then generated continuously in the shortest time to navigate to the goal position. The principal contribution are (a) Chain-based path planning approach with built in obstacle avoidance in conjunction with ORB-SLAM for the first time, (b) Generation of path with minimum overheads and (c) Implementation in near real time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.487-491
• /
• 2010

In this paper we propose a new single-query path planning algorithm for working well in high-dimensional configuration space. With the notice of the similarity between single-query algorithms with exploration algorithms, we propose a new path planning algorithm, which applies the Remembering Exploration method, which is one of exploration algorithms, to a path-planning problem by selecting a node from a roadmap, finding out the neighbor nodes from the node, and then inserting the neighbor nodes into the roadmap, recursively. For the performance comparison, we had experiments in 2D and 3D environments and compared the time to find out the path. In the results our algorithm shows the superior performance than other path planning algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• Korean Institute of Interior Design Journal
• /
• v.23 no.4
• /
• pp.120-128
• /
• 2014

Due to prolonged recession and limited spending of the consumers, domestic fashion brands are putting their efforts in pursuing competitiveness in order to survive in an intense competition, and because of this reason, VMD is being considered significant as a strategy for store environment improvement. An empirical research regarding analysis for systematic strategic VMD configuration factors of fashion retail store and relationship of repurchase intention that have effects on increase in sales was conducted. Thus, this study considers importance and spatial interrelation of VMD configuration factors of fashion retail store through theoretical consideration, and based on this, VMD configuration factors were restructured into reconcilability, attractiveness and epidemicity. An empirical validation through theoretical hypotheses and survey for relationships among VMD configuration factors, brand preference and repurchase intention was conducted. As a result of path analysis, VMD configuration factors reconcilability, attractiveness and epidemicity have effects on repurchase intention, and it was analyzed that epidemicity has the biggest effect on consumers. Also, it was found that brand preference has effects on repurchase intention and through this, as favorability and customer satisfaction for brand has effects on repurchase intention, it is judged that creating a strong brand image and brand image building is important the most for improving brand preference.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3367-3378
• /
• 1999

ATM technology, which acts as a representative high-speed bandwidth technology, plays an important role in Internet environment. ATM network, supporting QoS(Quality of Service) and various traffic characters in high speed, configures many VPC(Virtual Path Connection)/VCC(Virtual Channel Connection). It is important to guarantee the QoS of each connection and it is necessary for the network manager to search element affecting the QoS of VPC/VCC and to control ATM network correctly. In the paper, the management information of VPC/VCC, that ATM network manager Using the fault notification for ATM switch, we can manage the configuration, fault and performance of ATM network. Thus, we extracted the configuration, fault and performance monitoring item from the ATM-MIB and SNMP M4 Network Element View MIB. And we designed the ATM network configuration, fault and performance management system based on the extracted item.

• The Journal of the Acoustical Society of Korea
• /
• v.1 no.1
• /
• pp.19-26
• /
• 1982

n optimization technique is adapted to determine the stage enclosure configuration preferred by performers. The merit function which quantifies the ease of ensemble among the performers is derived from a set of qualitative conditions recommended by researchers of hall acoustics. The ray path tracing technique based on the modified method of images is used to analyze acoustical characteristics at any locations of performers in stage enclosure. The gradient search technique is employed to find the geometric parameters which maximmize the merit function. As an example, optimum stage enclosure configuration of the trio chamber music is obtained using the computer program developed. The developed technique can be used in the design of concert hall stage and also in forming a special enclosure with movable reflecting surfaces.