• Title/Summary/Keyword: Dynamic Link

Search Result 712, Processing Time 0.03 seconds

Manipulator Joint Friction Identification using Genetic Algorithm and its Experimental Verification (유전 알고리듬을 이용한 매니퓰레이터 조인트의 마찰력 규명 및 실험적 검증)

  • Kim, Gyeong-Ho;Park, Yun-Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.6 s.177
    • /
    • pp.1633-1642
    • /
    • 2000
  • Like many other mechanical dynamic systems, flexible manipulator systems experience stiction or sticking friction, which may cause input-dependent instabilities. Manipulator performance can be enha nced by identifying friction but it is hard and expensive to measure friction by direct and precise sensing of contact displacements and forces. This study addresses the problem of identifying flexible manipulator joint friction. A dynamic model of a two-link flexible manipulator based upon finite element and Lagrange's method is constructed. The dynamic model includes the effects of joint compliances and actuator dynamics. Friction is also incorporated in the dynamic model to account for stick-slip at the joints. Next, the friction parameters are to be determined. The identification problem is posed as an optimization problem to be solved using nonlinear programming methods. A genetic algorithm is used to increase the convergence rate and the chances of finding the global optimum. The identified friction parameters are experimentally verified and it is expected that the identification technique is applicable to a system parameter identification problem associated with a wide class of nonlinear systems.

Dynamic Analysis of Finger Joint Torque for Tip Pinch Task (두 점 집기 작업 시 손가락 관절토크의 역학적 해석)

  • Kim, Yoon-Jeong;Jeong, Gwang-Hun;Rhee, Kye-Han;Lee, Soo-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.6
    • /
    • pp.657-682
    • /
    • 2011
  • This paper presents the dynamic analysis on the joint torque of a finger for the tip pinch task. The dynamic model on finger movement was developed in order to predict the joint torques of an index finger, and the finger was assumed as a three-link planar manipulator. Analysis of the model revealed that the joint stiffness was one of the most important parameters affecting the joint torque. The stiffness of the finger joint was experimentally measured, and it was used in analyzing the finger joint torque required for performing the tip pinch task. The obtained joint torque for the tip pinch task will be used as the design requirements of the finger exoskeletal orthosis actuated by the polymer actuator whose allowable torque limit is relatively low compared to that of a mechanical actuator.

Study on the Static/Dynamic Measurements and Structural Analysis Procedure of Wheel Loaders (휠로더의 정적/동적 실차 계측 및 강도 평가법에 대한 연구)

  • Choung, Joon-Mo;Kim, Gyu-Sung;Jang, Young-Sik;Choe, Ick-Hung;Heo, Min-Soo
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1303-1309
    • /
    • 2003
  • This paper presents the static and dynamic measurements for the strength and motion characteristics as well as the improved procedures to assess strength of wheel loaders. Two scenarios for static measurement were decided by which cylinder was actuating. The dynamic measurement was performed for two types of motion, that is, simple reciprocation of the working devices and actual working motion including traveling, digging and dumping. The measured items were stresses, cylinder pressures and strokes. Stress induced by bucket working showed higher level than that by boom working. The measured cylinder speeds were relatively superior to the design speeds. Working stress histories were thought to be closer to static rather than dynamic. A fully assembled FE model was prepared for structural analysis. In this paper, a more simple method was suggested to avoid nonlinearity caused by heave of rear frame under digging forces. Also how brake affected on structural behavior and digging force was examined closely in relation with tire pressure. It was confirmed that the overall stress level of wheel loader during turning traveling with loaded bucket was far lower than the yield stress of material.

  • PDF

A Dynamic Defense Using Client Puzzle for Identity-Forgery Attack on the South-Bound of Software Defined Networks

  • Wu, Zehui;Wei, Qiang;Ren, Kailei;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.846-864
    • /
    • 2017
  • Software Defined Network (SDN) realizes management and control over the underlying forwarding device, along with acquisition and analysis of network topology and flow characters through south bridge protocol. Data path Identification (DPID) is the unique identity for managing the underlying device, so forged DPID can be used to attack the link of underlying forwarding devices, as well as carry out DoS over the upper-level controller. This paper proposes a dynamic defense method based on Client-Puzzle model, in which the controller achieves dynamic management over requests from forwarding devices through generating questions with multi-level difficulty. This method can rapidly reduce network load, and at the same time separate attack flow from legal flow, enabling the controller to provide continuous service for legal visit. We conduct experiments on open-source SDN controllers like Fluid and Ryu, the result of which verifies feasibility of this defense method. The experimental result also shows that when cost of controller and forwarding device increases by about 2%-5%, the cost of attacker's CPU increases by near 90%, which greatly raises the attack difficulty for attackers.

An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing

  • Xiao, Bin;Cao, Jiannong;Shao, Zili;Sha, Edwin H.M.
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.499-510
    • /
    • 2007
  • Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.

A Link-Based Label Correcting Multi-Objective Shortest Paths Algorithm in Multi-Modal Transit Networks (복합대중교통망의 링크표지갱신 다목적 경로탐색)

  • Lee, Mee-Young;Kim, Hyung-Chul;Park, Dong-Joo;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.1
    • /
    • pp.127-135
    • /
    • 2008
  • Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

The Burst Effect Analysis of 2.5 Gb/s TDM-PON Systems Using a SOA Link Extender (반도체광증폭기로 전송거리 확장된 2.5 Gb/s TDM-PON에서 버스트 효과에 의한 신호왜곡 분석)

  • Choi, Bo-Hun;Lee, Sang Soo
    • Korean Journal of Optics and Photonics
    • /
    • v.23 no.1
    • /
    • pp.6-11
    • /
    • 2012
  • A bidirectional TDM-PON link to support 2.5 Gb/s upstream signals of 256 ONUs was considered for an extended transmission distance of 50 km. The power budget of the link was 58 dB for the upstream signal and a SOA was applied as a link extender which had a 25 dB gain. Receiver sensitivity of the upstream signal was -25 dBm for -30 dBm input power to the SOA. When the input power was -10 dBm, pulse overshooting caused by gain transient of the SOA was maximum at 45% and the signal performance degradation gave a power penalty of 1.55 dB for $10^{-12}$ BER. However the penalties diminished rapidly and became negligible as the input power went below -15 dBm. So this input power dynamic range of up to -15 dBm means that it is not positively necessary to use gain control methods for the next generation TDM-PON systems.

Energy dissipation system for earthquake protection of cable-stayed bridge towers

  • Abdel Raheem, Shehata E.;Hayashikawa, Toshiro
    • Earthquakes and Structures
    • /
    • v.5 no.6
    • /
    • pp.657-678
    • /
    • 2013
  • For economical earthquake resistant design of cable-stayed bridge tower, the use of energy dissipation systems for the earthquake protection of steel structures represents an alternative seismic design method where the tower structure could be constructed to dissipate a large amount of earthquake input energy through inelastic deformations in certain positions, which could be easily retrofitted after damage. The design of energy dissipation systems for bridges could be achieved as the result of two conflicting requirements: no damage under serviceability limit state load condition and maximum dissipation under ultimate limit state load condition. A new concept for cable-stayed bridge tower seismic design that incorporates sacrificial link scheme of low yield point steel horizontal beam is introduced to enable the tower frame structure to remain elastic under large seismic excitation. A nonlinear dynamic analysis for the tower model with the proposed energy dissipation systems is carried out and compared to the response obtained for the tower with its original configuration. The improvement in seismic performance of the tower with supplemental passive energy dissipation system has been measured in terms of the reduction achieved in different response quantities. Obtained results show that the proposed energy dissipation system of low yield point steel seismic link could strongly enhance the seismic performance of the tower structure where the tower and the overall bridge demands are significantly reduced. Low yield point steel seismic link effectively reduces the damage of main structural members under earthquake loading as seismic link yield level decreases due their exceptional behavior as well as its ability to undergo early plastic deformations achieving the concentration of inelastic deformation at tower horizontal beam.

An Experimental Study on Web Link Analysis of the Korean National Archives (국가기록원 웹사이트 링크정보 분석에 관한 실험적 연구)

  • Park, Zi-Young
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.2
    • /
    • pp.167-181
    • /
    • 2008
  • In this study, web link analysis of the Korean National Archives has been Performed using LexiURL to show the dynamic web flow of the National Archives and to identify which closely related institutions the archives should seek to cooperate with for developing an institutional strategic plan. Inlink and co-inlink analysis were performed and, to identify related institutions of the Korean National Archives. a comparison was made with other countries such as Australia, England and the United Stats. Through web link analysis, several features can be detected and future directions are suggested. Most inlinks and co-inlink of the Korean National Archives were from public institutions, indicating that relationships with educational or research institutions are weak. Moreover, Korean National Archives involve fewer web links related to international activities than other countries. Proceeding from these results, educational function, research function and international activities should be fortified. Korean National Archives need to provide more materials for supporting educational and research activities and more cultural interchange among related institutions. Further research with different heritage institutions such as libraries or museums is needed.

Software-Defined HoneyNet: Towards Mitigating Link Flooding Attacks (링크 플러딩 공격 완화를 위한 소프트웨어 정의 네트워크 기반 허니넷)

  • Kim, Jinwoo;Lee, Seungsoo;Shin, Seungwon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.152-155
    • /
    • 2018
  • Over the past years, Link Flooding Attacks (LFAs) have been introduced as new network threats. LFAs are indirect DDoS attacks that selectively flood intermediate core links, while legacy DDoS attacks directly targets end points. Flooding bandwidth in the core links results in that a wide target area is affected by the attack. In the traditional network, mitigating LFAs is a challenge since an attacker can easily construct a link map that contains entire network topology via traceroute. Security researchers have proposed many solutions, however, they focused on reactive countermeasures that respond to LFAs when attacks occurred. We argue that this reactive approach is limited in that core links are already exposed to an attacker. In this paper, we present SDHoneyNet that prelocates vulnerable links by computing static and dynamic property on Software-defined Networks (SDN). SDHoneyNet deploys Honey Topology, which is obfuscated topology, on the nearby links. Using this approach, core links can be hidden from attacker's sight, which leads to effectively building proactive method for mitigating LFAs.

  • PDF