• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.77.2-77
• /
• 2002

Human upright standing posture in the sagittal plane is studied, when it exposed in the antero-posterior vibration. A two link inverted pendulum model is considered and described its functional behavior in terms of ankle and hip joint according to the dominant joints that provides the largest contribution to the corresponding human reactionary motion. The data is analyzed, both in the time domain and the frequency domain. Subjects behave as a non-rigid pendulum with a mass and a spring throughout the whole period of the platform motion. When vision was allowed, each segment of body shows more stabilized.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.539-544
• /
• 1991

In order to verify robot motions for a desired work, it is necessary to visualize it on a computer screen. This paper presents a simulation algorithm for robot manipulator motion. Kinematic description is based on the Denavit- Hartenberg link representation. In order to be applied to various types of the robot manipulator, inverse kinematics make use of the Newton-Raphson iterative method with the least squares method. Joint variables are interpolated by the lowest polynomial segment satisfying acceleration continuity. The robot motions are generated and then animated on a computer screen in the form of skeleton type.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.2
• /
• pp.15-25
• /
• 2007

This paper aims at testing the applicability of RFID (radio frequency identification) based link travel time estimation algorithm in urban street settings in Jeju island Korea. For this, we developed algorithm and compared link travel times derived from the RFID probe based algorithm with those from (already available) GPS based link travel time estimation algorithm and with the actual link travel times from survey. RFID readers are composed of master reader and slave reader and the participating passenger cars were supposed to be equipped with RFID tag inside the vehicle. The data were sent to traffic information center and we used those data in comparison. The algorithm produced link travel times in a successful manner and the accuracy of those link travel times was about 88%. For the same link segments, the accuracy of GPS based link travel times was 93%. The t-test showed that both RFID and GPS based link travel times were not different in accuracy from statistical point of view. The applicability of RFID was tested successfully and the algorithm proposed seemed to be used in similar urban settings. Some limits and future research agenda have also been presented.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.891-900
• /
• 2010

In this paper, a map-matching (MM) algorithm which combines an estimated position with digital road data is proposed. The presented algorithm using a virtual track is appropriate for a MEMS-based pedestrian dead reckoning (PDR) system, which can be used in mobile devices. Most of the previous MM algorithms are for car navigation systems and GPS-based navigation system, so existing MM algorithms are not appropriate for the pure DR-based pedestrian navigation system. The biggest problem of previous MM algorithms is that they cannot determine the correct road segment (link) due to the DR characteristics. In DR-based navigation system, the current position is propagated from the previous estimated position. This means that the MM result can be placed on a wrong link when MM algorithm fails to decide the correct link at once. It is a critical problem. Previous algorithms never overcome this problem because they did not consider pure DR characteristics. The MM algorithm using the virtual track is proposed to overcome this problem with improved accuracy. Performance of the proposed MM algorithm was verified by experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.590-593
• /
• 2005

In this paper, it is analyzed a transmission time of ACL Packet in bluetooth wireless link. In order for segment to improve the transfer capability in bluetooth system, it is fragmented in TCP total messages that are coming down from upper layer and then the packets are sent one at time in baseband. And it is studied that transmission time for bluetooth wireless link according to DM1, DM3 or DM5 packet type in bluetooth piconet environment. From the results, we were able to obtain ACL packet transmission time, optimal TCP packet size and DM packet size.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.119-124
• /
• 2021

Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.31-43
• /
• 2008

Travel time prediction is an indispensable to many advanced traveler information systems(ATIS) and intelligent transportation systems(ITS). In this paper we propose a method to predict travel time using $Na{\ddot{i}}ve$ Bayesian classification method which has exhibited high accuracy and processing speed when applied to classily large amounts of data. Our proposed prediction algorithm is also scalable to road networks with arbitrary travel routes. For a given route, we consider time-varying average segment velocity to perform more accuracy of travel time prediction. We compare the proposed method with the existing prediction algorithms like link-based prediction algorithm [1] and Micro T* algorithm [2]. It is shown from the performance comparison that the proposed predictor can reduce MARE (mean absolute relative error) significantly, compared with the existing predictors.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.199-209
• /
• 2008

This paper is described the concepts and limitations for the traditional directional design hour volume estimation. The main objective of this paper is to establish an estimation method of probabilistic directional design hour volume in order to improve the limitation for the traditional approach method. To express the traffic congestion of specific road segment, this paper proposed the link travel time as the probability that the road capacity can accommodate a certain traffic demand at desired service level. Also, the link travel time threshold was derived from chance-constrained stochastic model. Such successive probabilistic process could determine optimal ranked design hour volume and directional design hour volume. Therefore, the probabilistic directional design hour volume can consider the traffic congestion and economic aspect in road planning and design stage. It is hoped that this study will provide a better understanding of various issues involved in the short term prediction of directional design hourly volume on different types of roads.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.148-157
• /
• 2002

This paper investigates schemes to improve TCP performance in multipath forwarding networks. In multipath routing, packets to the same destination are sent to multiple next-hops in either packet-level or flow-level forwarding mode. Effective bandwidth is increased since we can utilize unused capacity of multiple paths to the destination. In packet-level multipath forwarding networks, TCP performance may not be enhanced due to frequent out-of-order segment arrivals at the receiver because of different delays among paths. To overcome this problem, we propose simple TCP modifications. At the sender, the fast retransmission threshold is adjusted taking the number of paths into consideration. At the receiver, the delayed acknowledgment scheme is modified such that an acknowledgment for an out-of-order segment arrival is delayed in the same way for the in-order one. The number of unnecessary retransmissions and congestion window reductions is diminished, which is verified by extensive simulations. In flow-level multipath forwarding networks, hashing is used at routers to select outgoing link of a packet. Here, we show by simulations that TCP performance is increased in proportion to the number of paths regardless of delay differences.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.783-785
• /
• 2003

In recent years, the use of video in GIS is considered to be an important subject and many related studies result in VideoGIS. The virtual navigation is an important function that can be applied to various VideoGIS applications. For virtual navigation by video, the following problems must be solved. 1) Because the video route may be not exactly coincided with route that user wants to navigate, parts of several video clips may be required for single navigation. Virtual navigation should allow the user to move from one video to another at the proper position. We suggest the video segmentation method based on geographic data combined with video. 2) From a point to a destination, the change frequency of video must be minimized. The frequent change of video make user to mislead navigation route and cause the wasteful use of computing resource. We suggest methods that structure video segments and calculate weight value of each node and link.