• Title/Summary/Keyword: Link segment

Search Result 66, Processing Time 0.023 seconds

A Two-Segment Trunk Model for Reach Prediction (동작 자세 예측을 위한 2-지체 몸통 모델)

  • Jung, Eui-S.;Lim, Sung-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.3
    • /
    • pp.393-403
    • /
    • 1999
  • In this research, a reach posture prediction based on a two-segment trunk model was made. Recently, reach posture prediction models have used inverse kinematics to provide a single posture that a person naturally takes, with a single segment trunk model that had some shortcomings. A two-segment trunk model was first developed with two links; pelvis link and lumbar-thoracic link. The former refers to the link from the hip joint to L5/S1 joint while the latter does the link from L5/S1 to the shoulder joint. Second, a reach prediction model was developed using the two-segment trunk model. As a result, more reliable equations for two-segment trunk motion were obtained, and the lean direction which refers to the movement direction of the trunk was not found to have a significant effect on the two-segment trunk motion. The results also showed that the hip joint is more preferred over L5/S1 to serve as a reference point for trunk models and the reach prediction model being developed predicted the real posture accurately.

  • PDF

Study of the Center of Gravity in the Human Body and each Segment (인체 중심과 분절 중심에 대한 연구)

  • Chung Hyung-Kuk;Bae Sung-Soo
    • The Journal of Korean Physical Therapy
    • /
    • v.5 no.1
    • /
    • pp.61-69
    • /
    • 1993
  • It was performed to encourage for Physical Therapist to apply the theory of center of the human body and segments in clinical situations. This study was investigated literarily on center of the human body and segments. Methods which search for the center-2 types, that is, method using reaction broad and segmental method-was suggested. The center location difference of gravity in human body depends on individual character. Generally, the center location is in kent of 2nd sacrum, that is, at $55\%$ of height from foot. The center of each segment is on 'link'. In the first place we must how the weight of segment we can search for the center easily. Mean segment coater location of extremities is at $42.33\%$ from each proximal end, and mean center of head and trunk lies at $45\%$.

  • PDF

The Ground Interface Concept of the KOMPSAT-II DLS

  • Lee, Sang-Taek;Lee, Sang-Gyu;Lee, Jong-Tae;Youn, Heong-Sik
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.228-228
    • /
    • 2002
  • The DLS(Data Link System) is located in the PDTS(Payload Data Transmission Subsystem) of KOMPSAT-II, and its main function is to provide communication link with Ground Segment as a space segment. DLS receive the data of MSC, OBC from DCSU(Data Compression Storage Unit) and transmit to the Ground Station by X-Band RF link. DLS is consist of CCU(Channel Coding Unit), QTX(QPSK Transmitter, ASU(Antenna Switch Unit) CCU makes a packet for communication after several kind of data processing such like Ciphering, RS Coding. QTX transmit PDTS data by OQPSK. Modulation. ASU is the unit for reliability of antenna switching. So, DLS's function is consists of ciphering, RS coding, CCSDS packetizing, randomizing, modulation and switching to antenna. These DLS's functions are controlled by PMU(Payload Management Unit). All commands to DLS are sent by PMU and all telemetries of DLS are sent to the PMU. The PMU receives commands from OBC and sends telemetries to the OBC. The OBC communicates with Ground Station by S-Band RF link. This paper presents the on-orbit DLS operation concept through the ground segment.

  • PDF

Vision-based Kinematic Modeling of a Worm's Posture (시각기반 웜 자세의 기구학적 모형화)

  • Do, Yongtae;Tan, Kok Kiong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.3
    • /
    • pp.250-256
    • /
    • 2015
  • We present a novel method to model the body posture of a worm for vision-based automatic monitoring and analysis. The worm considered in this study is a Caenorhabditis elegans (C. elegans), which is popularly used for research in biological science and engineering. We model the posture by an open chain of a few curved or rigid line segments, in contrast to previously published approaches wherein a large number of small rigid elements are connected for the modeling. Each link segment is represented by only two parameters: an arc angle and an arc length for a curved segment, or an orientation angle and a link length for a straight line segment. Links in the proposed method can be readily related using the Denavit-Hartenberg convention due to similarities to the kinematics of an articulated manipulator. Our method was tested with real worm images, and accurate results were obtained.

Study on Map Matching Using Characteristics of Vehicular Movements (차량 주행 특성을 이용한 지도 매칭에 대한 연구)

  • Lee, Se-Hwan;Lee, Choul-Ki;Yun, Ilsoo;Kim, Nam-Sun;Kang, Da-Mi
    • International Journal of Highway Engineering
    • /
    • v.17 no.5
    • /
    • pp.75-82
    • /
    • 2015
  • PURPOSES : In link matching using vehicular trajectory in a car navigation system, it is technically difficult to match the location of the subject vehicle with a link on an electronic map in the vehicle on a grade separation highway segment consisting of an elevated highway and atgrade highway, because of the overlap of geometric lines of the two highways. This study was initiated to propose a link matching algorithm using the characteristics of vehicular movement of the subject vehicle. METHODS : The selected test site is the highway segment between Jeong-reung IC and Gil-eum IC where the Inner Circulation Road and Jeong-reung-ro run together. To evaluate the proposed algorithm, this study collected the raw packet data of vehicles that drove on the test site. In a simulation environment, link matching was performed using an existing algorithm as well as the proposed algorithm. RESULTS: It was clearly found that the characteristics of vehicular movements are different on the two highways. CONCLUSIONS: The proposed algorithm outperformed the existing algorithm.

VSC with three-segment nonlinear sliding mode for robot manipulator (로봇 매니퓰레이터를 위한 삼분 비선형 슬라이딩 모드를 가지는 가변구조 제어)

  • 최성훈;전경한;최봉열
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.69-72
    • /
    • 1996
  • In this paper robust tracking control scheme using the new three-segment nonlinear sliding mode technique for nonlinear rigid robotic manipulator is developed. Sliding mode consists of three segments, the promotional acceleration segment, the constant velocity segment and the deceleration segment using terminal sliding mode. Strong robustness and fast error convergence can be obtained for rigid robotic manipulators with large uncertain dynamics by using the new three-segment nonlinear sliding mode technique together with a few useful structural properties of rigid robotic manipulator. The efficiency of the proposed method for the tracking has been demonstrated by simulations for two-link robot manipulator.

  • PDF

Traffic Engineering with Segment Routing under Uncertain Failures

  • Zheng, Zengwei;Zhao, Chenwei;Zhang, Jianwei;Cai, Jianping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2589-2609
    • /
    • 2021
  • Segment routing (SR) is a highly implementable approach for traffic engineering (TE) with high flexibility, high scalability, and high stability, which can be established upon existing network infrastructure. Thus, when a network failure occurs, it can leverage the existing rerouting methods, such as rerouting based on Interior Gateway Protocol (IGP) and fast rerouting with loop-free alternates. To better exploit these features, we propose a high-performance and easy-to-deploy method SRUF (Segment Routing under Uncertain Failures). The method is inspired by the Value-at-Risk (VaR) theory in finance. Just as each investment risk is considered in financial investment, SRUF also considers each traffic distribution scheme's risk when forwarding traffic to achieve optimal traffic distribution. Specifically, SRUF takes into account that every link may fail and therefore has inherent robustness and high availability. Also, SRUF considers that a single link failure is a low-probability event; hence it can achieve high performance. We perform experiments on real topologies to validate the flexibility, high-availability, and load balancing of SRUF. The results show that when given an availability requirement, SRUF has greater load balancing performance under uncertain failures and that when given a demand requirement, SRUF can achieve higher availability.

A Novel Shared Segment Protection Algorithm for Multicast Sessions in Mesh WDM Networks

  • Lu, Cai;Luo, Hongbin;Wang, Sheng;Li, Lemin
    • ETRI Journal
    • /
    • v.28 no.3
    • /
    • pp.329-336
    • /
    • 2006
  • This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

  • PDF

Optimal TCP Segment Size for Mobile Contents Server Access over Wireless Links of Cellular Networks (이동통신망에서의 모바일 컨텐츠 서버 통신을 위한 최적의 TCP 세그먼트 길이)

  • Lee, Goo-Yeon;Jeong, Choong-Kyo;Kim, Hwa-Jong;Lee, Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.31-41
    • /
    • 2006
  • Internet access from mobile phones over cellular networks suffer from severe bandwidth limitations and high bit error rates over wireless access links. Tailoring TCP connections to best fit the characteristics of this bottleneck link is thus very important for overall performance improvement. In this work, we propose a simple algorithm in deciding the optimal TCP segment size to maximize the utilization of the bottleneck wireless TCP connection for mobile contents server access, taking the dynamic TCP window variation into account. The proposed algorithm can be used when the product of the access rate and the propagation time is not large. With some numerical examples, it is shown that the optimal TCP segment size becomes a constant value when the TCP window size exceeds a threshold. One can set the maximum segment size of a wireless TCP connection to this optimal segment size for mobile contents server access for maximum efficiency on the expensive wireless link.