• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.3
• /
• pp.107-114
• /
• 2011

In this study, when interpreting leakage using the concept of geographical dispersion based on grid, to choose an appropriate spatial resolution, the statistical characteristics of drainage path length and the pattern of change of hydrodynamic parameters have been observed. Drainage path length has been calculated using an 8-direction algorithm from digital elevation model, from which the hydrodynamic parameters of the watershed were estimated. The scales of topographical map for this analysis are 1:5,000 and 1:25,000, appling grid sizes 5, 10, 15, 20 m and 20, 30, 50, 100, 150, 200 m, respectively. As results of this analysis, depending on the scale of stream networks, the statistical characteristics of drainage path length by spatial resolution and hydrodynamic parameters of the watershed have been changed. Based on the above results, when interpreting leakage using the concept of the geographical dispersion based on grid, in the case of 1:5,000 scale topographical map, a spatial resolution of 5 m will be better showing geographical and hydrodynamic characteristics to apply to the well developed stream network in basins, spatial resolution of 5~20 m to the less developed stream network in basins. And in the case of 1:25,000 scale topographical map, spatial resolution below 50 m is more desirable to show above two characteristics to apply to both cases.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.3 s.309
• /
• pp.31-40
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.835-837
• /
• 2012

In this paper, we have been analyzed conduction path by device parameter of double gate(DG) structure that have top gate and bottom gate. The Possion equation is used to analytical. The change of conduction path have been investigated for various channel lengths, channel thickness and gate oxide thickness using this model, given that these parameters are very important in design of DGMOSFET. The optimum channel doping concentration is determined as the deviation of conduction path is considered according to channel doping concentration.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.917-921
• /
• 2013

This paper have analyzed the change of breakdown voltage for conduction path of double gate(DG) MOSFET. The low breakdown voltage among the short channel effects of DGMOSFET have become obstacles of device operation. The analytical solution of Poisson's equation have been used to analyze the breakdown voltage, and Gaussian function been used as carrier distribution to analyze closely for experimental results. The change of breakdown voltages for conduction path have been analyzed for device parameters such as channel length, channel thickness, gate oxide thickness and doping concentration. Since this potential model has been verified in the previous papers, we have used this model to analyze the breakdown voltage. Resultly, we know the breakdown voltage is greatly influenced on the change of conduction path for device parameters of DGMOSFET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.337-346
• /
• 2004

Punctured convolutional codes increase transmission efficiency without increasing hardware complexity. However, Viterbi decoder supporting punctured codes requires long decoding length and large survivor memory to achieve sifficiently low bit error rate (BER), when compared to the Viterbi decoder for a rate 1/2 convolutional code. This Paper presents novel architecture adopting a pipelined trace-forward unit reducing survivor memory requirements in the Viterbi decoder. The proposed survivor path architecture reduces the memory requirements by removing the initial decoding delay needed to perform trace-back operation and by accelerating the trace-forward process to identify the survivor path in the Viterbi decoder. Experimental results show that the area of survivor path unit has been reduced by 16％ compared to that of conventional hybrid survivor path unit.

• Journal of the Korean Society of Physical Medicine
• /
• v.17 no.4
• /
• pp.103-111
• /
• 2022

PURPOSE: This study was performed to investigate the effects of the whole-body vibration exercise combined with ankle joint mobilization on the gait and balancing ability in patients with hemiplegic stroke. METHODS: A total of 19 patients at a rehabilitation hospital who had suffered a hemiplegic stroke were randomly assigned to the experimental group (whole-body vibration exercise combined with ankle joint mobilization, n=10) or control group (whole-body vibration exercise, n=9). All participants underwent 30 min of comprehensive rehabilitation therapy (5 × /week for 6 weeks). Additionally, the experimental group performed the whole body vibration exercise and ankle joint mobilization (15 minutes each, 30 minutes total, 3 × / week for 6 weeks). In the control group, only the whole- body vibration exercise was performed in the same manner and not the ankle joint mobilization. The gait and balancing abilities were measured before and after the 6-week training. RESULTS: Significant improvements were observed in the 10-m walk test, timed up-and-go (TUG) test, center of pressure (COP) path length, and COP path velocity in the experimental group (p < .05). The experimental group showed a larger decrease in the COP path length and velocity than the control group (COP path length, -10.27 mm vs. -3.67 mm, p < .05; COP path velocity, -.33 cm/sec vs. -.13 cm/sec, p < .05, respectively). CONCLUSION: The whole-body vibration exercise combined with ankle joint mobilization could be effective in improving the gait and balancing ability of stroke patients and could also be more effective for improving the static balance ability than the general whole-body vibration exercise alone.