• Title/Summary/Keyword: Constraint Link

Search Result 125, Processing Time 0.025 seconds

Approximate Synthesis of 5-SS Multi Link Suspension Systems for Steering Motion (조향 운동을 고려한 5-SS 멀티링크 현가장치의 근사 합성)

  • Kim, Seon-Pyeong;Sim, Jae-Gyeong;An, Byeong-Ui;Lee, Eon-Gu
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.1
    • /
    • pp.32-38
    • /
    • 2001
  • This paper presents an approximate synthesis of 5-SS multi link suspension for 2 D.O.F motions. In the proposed synthesis method, alteration curves of camber, toe, kingpin and caster angles are optimized during the bump rebound and the steering motions. And joint positions can be located within desired boundari es. Especially, steering motions are considered for control of kingpin offset and caster trail. Prescribed motions contain both wheel center positions and imaginary kingpin axes in the multi link type suspension. Constraint equations are formulated with di splacement matrix and velocity matrix using instantaneous screw axis.

A Study on Referential Integrity Constraint on Web Page (웹 페이지에서 참조무결성 제약조건에 관한 연구)

  • 유남현;손철수;김원중
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.569-572
    • /
    • 2004
  • The Web site which many people manage and maintenance much HTML page is so difficult to solve broken link like as dangling reference and inaccurate contents reference. That is, in the case we update or delete connections structure between HTML documents, it is difficult to guarantee referential integrity of Web Pages. In this chapter, we surveyed and defined integrity constraints condition between the parent page and child page, and studied about method to express by extension UML. WWW, Constraints, UML

  • PDF

Topology Design of Rigid-String Mechanism Using Constraint Force Design Method (구속조건 힘 설계기법을 이용한 강체와 스트링의 위상 최적설계)

  • Heo, Jae-Chung;Yoon, Gil-Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.7
    • /
    • pp.745-750
    • /
    • 2012
  • This study extends the constraint force design method allowing topology optimization for planar rigid-link and string mechanisms. To our best knowledge, by applying conventional machine and mechanism design theories, it is likely that it is possible to find out optimal locations of joints and lengths of rigid-links but somewhat difficult to find out optimal topology of rigid-links. To achieve optimal topology of rigid links, there is our previous contribution so called the new constraint force design method with the binary design variables determining the existence of the auxiliary forces imposing apparent lengths among unit masses. By adding new binary design variables, this research extends the constraint force design method to find out optimal mechanism consisting of stringy links as well as rigid links that seems impossible in the conventional machine and mechanism design theories.

Bypass-Based Star Aggregation Using Link Attributes for Improving the Information Accuracy

  • Kwon, Sora;Jeon, Changho
    • Journal of Communications and Networks
    • /
    • v.17 no.4
    • /
    • pp.428-439
    • /
    • 2015
  • In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O($N^3$) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.

Dynamic Equations of Robots and Sensitivity Analysis (로봇 운동방정식과 감도해석)

  • Song, Sung-Jae;Lee, Jang-Moo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.6
    • /
    • pp.105-111
    • /
    • 1995
  • The inverse dynamic equations for 5 link robot including a closed chain have been derived. The closed chain is virtually cut open, and the kinematics and dynamics of the virtual open chain robot are analyzed. The constraints are applied to the virtually cut joints by the Jacobian matrix which represents the configuration of the closed chain. The topology of tree structrued open chain robot is described by a FATHER array. The FATHER array of a link indicates the link tha tis connected in the direction of base link. Based on the inverse dynamic equations, the torque sensitivity models of the 5 link robot have been developed. The sensitivity models characterize the sensitivity of the driving torque with respect to the link parameters. All the procedures are illustrated through the 2 link robot.

  • PDF

Dynamic Balancing in a Link Motion Punch Press (링크모션 펀치프레스의 다이나믹 발란싱)

  • Suh, Jin-Sung
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.17 no.5 s.122
    • /
    • pp.415-426
    • /
    • 2007
  • In a link motion punch press, numerous links are interconnected and each link executes a constrained motion at high speed. As a consequence, dynamic unbalance force and moment are transmitted to the main frame of the press, which results in unwanted vibration. This degrades productivity and precise stamping work of the press. This paper presents an effective method for reducing dynamic unbalance in a link motion punch press based upon kinematic and dynamic analyses. Firstly, the kinematic analysis is carried out in order to understand the fundamental characteristics of the link motion mechanism. Then design variable approach is presented in order to automate the model setup for the mechanism whenever design changes are necessary. To obtain the inertia properties of the links such as mass, mass moment of inertia, and the center of mass, 3-dimensional CAD software was utilized. Dynamic simulations were carried out for various combinations of design changes on some links having significant influences on kinematic and dynamic behavior of the mechanism.

Approximate Synthesis of 5-SS Multi Link Suspension System (근사 합성법을 이용한 5-SS 멀티 링크 현가장치의 기구학적 설계)

  • 김선평;심재경;안병의;이언구
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.11
    • /
    • pp.2665-2671
    • /
    • 2000
  • Dimensional Synthesis, which is apart of kinematic synthesis, is to determine the dimensions of a mechanism of preconceived typer for a specified task and prescribed performance. In this paper, in an effort to provide designers with flexibility, a dimensional approximate synthesis method is presented for utilizing prescribed tolerance both the displacement and joint positions of a mechanism to be synthesized. For this, a constrained optimization problem is formulated with displacement parameters and joint positions as variables. The proposed method is applied to the synthesis of a 5-SS multi link suspension mechanism. The method discussed here, however, can be easily applied to any mechanism of which the kinematic constraint equations can be derived.

Column Generation Approach to the Constraint Based Explicit Routing Problem in MPLS Based IP Networks (MPLS 기반 IP 방에서 열생성 기법을 이용한 경로 설정 해법)

  • Kim Deokseong;Park Sungsoo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.410-417
    • /
    • 2002
  • We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

  • PDF

An Efficient Search Method for High Confidence Association Rules Using CP(Confidence Pattern)-Tree Structure (CP-Tree구조를 이용한 높은 신뢰도를 갖는 연관 규칙의 효율적 탐색 방법)

  • 송한규;김재련
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.25 no.1
    • /
    • pp.1-8
    • /
    • 2002
  • The traditional approaches of association rule mining have relied on high support condition to find interesting rules. However, in some application such as analyzing the web page link and discovering some unusual combinations of some factors that have always caused some disease, we are interested in rules with high confidence that have very low support or need not have high support. In these cases, the traditional algorithms are not suitable since it relies on first satisfying high support. In this paper, we propose a new model, CP(Confidence Pattern)-Tree, to identify high confidence rule between 2-items without support constraint. constraint. In addition, we discuss confidence association rule between two more items without support constraint.

Enhanced Second-order Implicit Constraint Enforcement for Dynamic Simulations

  • Hong, Min;Welch, Samuel W.J.;Jung, Sun-Hwa;Choi, Min-Hyung;Park, Doo-Soon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.1
    • /
    • pp.51-62
    • /
    • 2008
  • This paper proposes a second-order implicit constraint enforcement method which yields enhanced controllability compared to a first-order implicit constraints enforcement method. Although the proposed method requires solving a linear system twice, it yields superior accuracy from the constraints error perspective and guarantees the precise and natural movement of objects, in contrast to the first-order method. Thus, the proposed method is the most suitable for exact prediction simulations. This paper describes the numerical formulation of second-order implicit constraints enforcement. To prove its superiority, the proposed method is compared with the firstorder method using a simple two-link simulation. In this paper, there is a reasonable discussion about the comparison of constraints error and the analysis of dynamic behavior using kinetic energy and potential energy.