• 제목/요약/키워드: Constraint Link

검색결과 125건 처리시간 0.03초

연선균열성장 저항곡선에 대한 2매개변수의 특성 (Two-Parameter Characterization for the Resistance Curves of Ductile Crack Growth)

  • X.K.Zhu
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제23권4호
    • /
    • pp.488-503
    • /
    • 1999
  • The present paper considers the constraint effect on J-R curves under the two-parameter $J-A_2$ controlled crack growth within a certain amount of crack extension. Since the parameter $A_2$ in $J-A_2$ three-term solution is independent of applied loading under fully plasticity or large-scale defor-mation $A_2$ is a proper constraint parameter uring crack extension. Both J and $A_2$ are used to char-acterize the resistance curves of ductile crack growth using J as the loading level and $A_2$ are used to char-acterize the resistance curves of ductile crack growth using J as the loading level and A2 as a con-straint parameter. Approach of the constraint-corrected J-R curve is proposed and a procedure of transferring the J-R curves determined from standard ASTM procedure to non-standard speci-mens or real cracked structures is outlined. The test data(e.g. initiation toughness JIC and tearing modulus $T_R$) of Joyce and Link(Engineer-ing Fracture Mechanics 1997, 57(4) : 431-446) for single-edge notched bend[SENB] specimen with from shallow to deep cracks is employed to demonstrate the efficiency of the present approach. The variation of $J_{IC}$ and $T_R$ with the constraint parameter $A_2$ is obtained and a con-straint-corrected J-R curves is constructed for the test material of HY80 steel. Comparisons show that the predicted J-R curves can very well match with the experimental data for both deep and shallow cracked specimens over a reasonably large amount of crack extension. Finally the present constraint-corrected J-R curve is used to predict the crack growth resistance curves for different fracture specimens. over a reasonably large amount of crack extension. Finally the present constraint-corrected J-R curve is used to predict the crack growth resistance curves for different fracture specimens. The constraint effects of specimen types and specimen sizes on the J-R curves can be easily obtained from the constrain-corrected J-R curves.

  • PDF

Determination of Identifiable Parameters and Selection of Optimum Postures for Calibrating Hexa Slide Manipulators

  • Park, Jong-Hyuck;Kim, Sung-Gaun;Rauf, Abdul;Ryu, Je-Ha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.2737-2742
    • /
    • 2003
  • Kinematic calibration enhances absolute accuracy by compensating for the fabrication tolerances and installation errors. Effectiveness of calibration procedures depends greatly on the measurements performed. While the Cartesian postures are measured completely, all of the geometric parameters can be identified to their true values. With partial pose measurements, however, few geometric parameters may not be identifiable and effectiveness of the calibration results may vary significantly within the workspace. QR decomposition of the identification Jacobian matrix can reveal the non-identifiable parameters. Selecting postures for measurement is also an important issue for efficient calibration procedure. Typically, the condition number of the identification Jacobian is minimized to find optimum postures. This paper investigates identifiable parameters and optimum postures for four different calibration procedures - measuring postures completely with inverse kinematic residuals, measuring postures completely with forward kinematics residuals, measuring only the three position components, and restraining the mobility of the end-effector using a constraint link. The study is performed for a six degree-of-freedom fully parallel HexaSlide type paralle manipulator, HSM. Results verify that all parameters are identifiable with complete posture measurements. For the case of position measurements, one and for the case of constraint link, three parameters were found non-identifiable. Optimal postures showed the same trend of orienting themselves on the boundaries of the search space.

  • PDF

모델 변환법을 이용한 점핑 로봇 제어의 운동경로 생성에 관한 연구 (A Study on Motion Planning Generation of Jumping Robot Control Using Model Transformation Method)

  • 서진호;산북창의;이권순
    • 한국정밀공학회지
    • /
    • 제21권4호
    • /
    • pp.120-131
    • /
    • 2004
  • In this paper, we propose the method of a motion planning generation in which the movement of the 3-link leg subsystem is constrained to a slider-link and a singular posture can be easily avoided. The proposed method is the jumping control moving in vertical direction which mimics a cat's behavior. That is, it is jumping toward wall and kicking it to get a higher-place. Considering the movement from the point of constraint mechanical system, the robotic system which realizes the motion changes its configuration according to the position and it has several phases such as; ⅰ) an one-leg phase, ⅱ) in an air-phase. In other words, the system is under nonholonomic constraint due to the reservation of its momentum. Especially, in an air-phase, we will use a control method using state transformation and linearization in order to control the landing posture. Also, an iterative learning control algorithm is applied in order to improve the robustness of the control. The simulation results for jumping control will illustrate the effectiveness of the proposed control method.

병렬구조 로봇의 보정을 위한 보정 가능 변수 판별과 최적 자세 선정에 관한 연구 (Study on the Identifiable Parameters and Optimum Postures for Calibrating Parallel Manipulators)

  • 박종혁;김성관;압둘라우프;류제하
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2003년도 추계학술대회
    • /
    • pp.1476-1481
    • /
    • 2003
  • Kinematic calibration enhances absolute accuracy by compensating for the fabrication tolerances and installation errors. Effectiveness of calibration procedures depends greatly on the measurements performed. This paper investigates identifiable parameters and optimum postures for four different calibration procedures - measuring postures completely with inverse kinematic residuals, measuring postures completely with forward kinematics residuals, measuring only the three position components, and restraining the mobility of the end-effector using a constraint link. The study is performed for a six degree-of-freedom fully parallel HexaSlide type parallel manipulator, HSM. Results verify that all parameters are identifiable with complete posture measurements. For the case of position measurements, one and for the case of constraint link, three parameters were found non-identifiable. Selecting postures for measurement is also an important issue for efficient calibration procedure. Typically, the condition number of the identification Jacobian is minimized to find optimum postures. Optimal postures showed the same trend of orienting themselves on the boundaries of the search space.

  • PDF

Power allocation for full-duplex NOMA relaying based underlay D2D communications

  • Li, Song;Li, Shuo;Sun, Yanjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권1호
    • /
    • pp.16-33
    • /
    • 2019
  • In this paper, a full-duplex NOMA relaying based underlay device-to-device (D2D) communication scheme is proposed, in which D2D transmitter assists cellular downlink transmission as a full-duplex relay. Specifically, D2D transmitter receives signals from base station and transmits the superposition signals to D2D receiver and cellular user in NOMA scheme simultaneously. Furthermore, we investigate the power allocation under the proposed scheme, aiming to maximize D2D link's achievable transmit rate under cellular link's transmit rate constraint and total power constraint. To tackle the power allocation problem, we first propose a power allocation method based on linear fractional programming. In addition, we derive closed-form expressions of the optimal transmit power for base station and D2D transmitter. Simulation results show that the performance of two solutions matches well and the proposed full-duplex NOMA relaying based underlay D2D communication scheme outperforms existing full-duplex relaying based D2D communication scheme.

영어의 접사 연구: 접사 -en, -ing 를 중심으로 (A study of English affixes: Concentrated on the affixes -en and -ing)

  • 박순봉
    • 영어어문교육
    • /
    • 제15권3호
    • /
    • pp.301-314
    • /
    • 2009
  • This study explores the function of the affixes -en and -ing that could influence the theta-roles of verbs to which the affixes are attached. The two affixes often appear in the synthetic compounds in English. The results are as follows. First, the affixes -en and -ing link the theta-role realized in the subject of the verb to the noun followed, which is proposed as Theta-linking Principle: that is, the affixes -en and -ing link the theta-role realized in the subject of the verb to the noun followed. Second, in the synthetic compounds including the affixes -en and -ing, the left element must not be the subject of the verb, which is the Synthetic Compound Constraint. And the affix -er link thematic roles of the sentential subject, such as Agent, Instrument. Thus, this study aims to find out the function of the affixes on the point of lexical functional approach.

  • PDF

평균 지연 시간과 트래픽 용량이 제한되는 스패닝 트리 문제의 2단계 휴리스틱 알고리즘 (Two Phase Heuristic Algorithm for Mean Delay constrained Capacitated Minimum Spanning Tree Problem)

  • 이용진
    • 정보처리학회논문지C
    • /
    • 제10C권3호
    • /
    • pp.367-376
    • /
    • 2003
  • 본 연구는 로컬 네트워크의 토폴로지를 설계하거나 루트 노드로부터 여러 개의 통신 경로를 구하는 데 사용될 수 있는 DCMST(Delay constrained Capacitated Minimum Spanning Tree) 문제를 다룬다. 기존의 CMST 문제는 루트 노드의 한 포트가 담당하는 트래픽의 용량에만 제한이 있는 데 비해 DCMST 문제에는 네트워크 평균 지연 시간의 제약 조건이 추가된다. 이 문제는 종단 노드의 트래픽 요구량과 네트워크의 평균 지연 시간을 만족시키는 스패닝 트리의 집합을 구하는 것으로 목적 함수는 전체 링크 비용을 최소로 하는 것이다. 본 연구에서는 트레이드-오프에 기준한 노드 교환 알고리즘과 노드 이동 알고리즘 그리고 평균 지연 알고리즘으로 구성되는 2 단계 휴리스틱을 제시한다. 실제 계산 경험과 성능 분석을 통해 제안한 알고리즘이 평균 지연을 고려한 기존의 CMST 알고리즘보다 비용 측면에 있어 더 우수한 해를 생성할 수 있음을 보였다.

공유 링크에서의 대역폭 기반 비선형 요금제 (Bandwidth-based Nonlinear Pricing on a Shared Link)

  • 조문교;박명철;최문기
    • 한국통신학회논문지
    • /
    • 제32권11B호
    • /
    • pp.709-717
    • /
    • 2007
  • 네트워크 서비스의 요금제는 경제적 효율성과 더불어 네트워크의 혼잡 제어라는 목적도 가지고 있다. 사용자들에 의해 공유되는 링크를 기반으로 네트워크 서비스를 제공하는 독점 공급자는 링크의 대역폭 제약 하에서 수익을 극대화하면서 사용자가 요구한 대역폭을 보장할 수 있는 요금제를 필요로 한다. 이 경우 비선형 요금제는 서비스 제공자의 목적과 사용자들의 다양한 요구를 만족시킬 수 있는 효율적인 요금제이다. 본 연구에서는 대역폭을 제공하는 네트워크 서비스에서 공유 링크의 대역폭 제약이 존재할 때 비선형 요금제가 어떻게 적용될 수 있는지 효용함수와 사용자 수요 특성의 확률 분포를 중심으로 살펴보고, 사용자의 수요 특성이 멱급수 법칙을 따르는 경우 비선형 요금제의 결과로 단위 대역폭당 가격이 일정한 선형 요금제가 나타날 수 있음을 보인다. 또한 사용자의 수요 분포에 대한 불완전한 정보를 가진 서비스 제공자가 네트워크의 혼잡도로부터 최적 요금제를 찾는 방법을 소개하고, 연구 결과에 근거하여 인터넷의 발전 방향과 인터넷 요금제의 관계를 생각한다.

Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing

  • Xiong, Ke;Qiu, Zheng-Ding;Guo, Yuchun;Zhang, Hongke
    • ETRI Journal
    • /
    • 제31권5호
    • /
    • pp.534-544
    • /
    • 2009
  • Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

Resource allocation in downlink SWIPT-based cooperative NOMA systems

  • Wang, Longqi;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권1호
    • /
    • pp.20-39
    • /
    • 2020
  • This paper considers a downlink multi-carrier cooperative non-orthogonal multiple access (NOMA) transmission, where no direct link exists between the far user and the base station (BS), and the communication between them only relies on the assist of the near user. Firstly, the BS sends a superimposed signal of the far and the near user to the near user, and then the near user adopts simultaneous wireless information and power transfer (SWIPT) to split the received superimposed signal into two portions for energy harvesting and information decoding respectively. Afterwards, the near user forwards the signal of the far user by utilizing the harvested energy. A minimum data is required to ensure the quality of service (QoS) of the far user. We jointly optimize power allocation, subcarrier allocation, time allocation, the power allocation (PA) coefficient and the power splitting (PS) ratio to maximize the number of data bits received at the near user under the energy causality constraint, the minimum data constraint and the transmission power constraint. The block-coordinate descent method and the Lagrange duality method are used to obtain a suboptimal solution of this optimization problem. In the final simulation results, the superiority of the proposed NOMA scheme is confirmed compared with the benchmark NOMA schemes and the orthogonal multiple access (OMA) scheme.