• 제목/요약/키워드: recursively generated

검색결과 29건 처리시간 0.022초

Dynamic Analysis of a Chain of Rigid Rods

  • Attia, Hazem Ali
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제8권2호
    • /
    • pp.75-86
    • /
    • 2004
  • In this study, a recursive algorithm for generating the equations of motion of a chain of rigid rods is presented. The methods rests upon the idea of replacing the rigid body by a dynamically equivalent constrained system of particles. The concepts of linear and angular momentums are used to generate the rigid body equations of motion without either introducing any rotational coordinates or the corresponding transformation matrices. For open-chain, the equations of motion are generated recursively along the serial chains. For closed-chain, the system is transformed to open-chain by cutting suitable kinematic joints with the addition of cut-joints kinematic constraints. An example of a closed-chain of rigid rods is chosen to demonstrate the generality and simplicity of the proposed method.

  • PDF

Dynamic Modelling of Planar Mechanisms Using Point Coordinates

  • Attia, Hazem-Ali
    • Journal of Mechanical Science and Technology
    • /
    • 제17권12호
    • /
    • pp.1977-1985
    • /
    • 2003
  • In the present study, the dynamic modelling of planar mechanisms that consist of a system of rigid bodies is carried out using point coordiantes. The system of rigid bodies is replaced by a dynamically equivalent constrained system of particles. Then for the resulting equivalent system of particles, the concepts of linear and angular momentums are used to generate the equations of motion without either introducing any rotational coordinates or distributing the external forces and force couples over the particles. For the open loop case, the equations of motion are generated recursively along the open chains. For the closed loop case, the system is transformed to open loops by cutting suitable kinematic joints with the addition of cut-joints kinematic constraints. An example of a multi-branch closed-loop system is chosen to demonstrate the generality and simplicity of the proposed method.

투영을 이용한 피라미드 영상 부호화 (Pyramid Image Coding Using Projection)

  • 원용관;김준식;박래홍
    • 전자공학회논문지B
    • /
    • 제30B권5호
    • /
    • pp.90-102
    • /
    • 1993
  • In this paper, we propose a prgressive image transmission technique using hierarchical pyramid data structure which is constructed based on the projection data of an image. To construct hierarchical Gaussian pyramids, we first divide an image into 4$\times$4 subblocks and generate the projection data of each block along the horizontal, vertical, diagonal, and antidiagonal directions. Among images reconstructed by backprojecting the projection data along a single direction, the one giving the minimum distortion is selected. The Gaussian pyramid is recursively generated by the proposed algorithm and the proposed Gaussian images are shown to preserve edge information well. Also, based on the projection concept a new transmission scheme of the lowest Laplacian plane is presented. Computer simulation shows that the quantitative performance of the proposed pyramid coding technique using projection concept is similar to those of the conventional methods with transmission rate reduced by 0.1 ~ 0.2 bpp and its subjective performance is shown to be better due to the edge preserving property of a projection operation.

  • PDF

On Semi-cubically Hyponormal Weighted Shifts with First Two Equal Weights

  • Baek, Seunghwan;Jung, Il Bong;Exner, George R.;Li, Chunji
    • Kyungpook Mathematical Journal
    • /
    • 제56권3호
    • /
    • pp.899-910
    • /
    • 2016
  • It is known that a semi-cubically hyponormal weighted shift need not satisfy the flatness property, in which equality of two weights forces all or almost all weights to be equal. So it is a natural question to describe all semi-cubically hyponormal weighted shifts $W_{\alpha}$ with first two weights equal. Let ${\alpha}$ : 1, 1, ${\sqrt{x}}$(${\sqrt{u}}$, ${\sqrt{v}}$, ${\sqrt{w}}$)^ be a backward 3-step extension of a recursively generated weight sequence with 1 < x < u < v < w and let $W_{\alpha}$ be the associated weighted shift. In this paper we characterize completely the semi-cubical hyponormal $W_{\alpha}$ satisfying the additional assumption of the positive determinant coefficient property, which result is parallel to results for quadratic hyponormality.

모듈러 RMT의 구조형태 생성을 위한 새로운 방법 (A New Method for Generating Structural Configurations of Modular-Reconfigurable Machine Tool)

  • 최영휴;박현만;장성현;최응영;김인수;박종권
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2005년도 춘계학술대회 논문집
    • /
    • pp.435-440
    • /
    • 2005
  • This study describes a new method of constructing Reconfigurable machine tools configurations from a set of modules or components. This proposed method defines combinability vector for each module and mutual combinability coefficient matrix for adjacent two modules. All of machine configurations possible to be generated from any two adjacent modules can be determined by quadratic form of two associated combinability vectors. Furthermore, all of possible RMT configurations generating from a series of multiple modules also can be obtained by multiplying quadratic form of two adjacent conbinability vectors recursively. Our proposed RMT configuration generating method can be successfully applied to determining all of possible machine configurations from several modules or components at conceptual- or preliminary- design stage.

  • PDF

3차원 컨테이너 적재 문제를 위한 발견적 해법 (A Heuristic for the Container Loading Problem)

  • 장창식;강맹규
    • 산업경영시스템학회지
    • /
    • 제28권3호
    • /
    • pp.156-165
    • /
    • 2005
  • A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper, This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.

DF-DPD와 DPD-RGPR에 대한 성능 분석 (A Performance Analysis of DF-DPD and DPD-RGPR)

  • 정진두;전용선;정정화
    • 전자공학회논문지 IE
    • /
    • 제47권4호
    • /
    • pp.39-47
    • /
    • 2010
  • 본 논문은 결정 궤환(Decision Feedback) 기반 차동 위상 검출 방식인 DF-DPD와 DPD-RGPR의 성능이 차동 복호(Differential Decoding)를 갖는 동기 검출 (Coherent Detection) 방식의 성능에 근접한다는 것을 수치적으로 증명한다. M-ary DPSK에 대한 기존 차장 위삼 검출 빙식은 수신기 구조를 간단하게 만들지만, 참조 위상으로 활용되는 이전 심볼에서의 잡음 성분으로 인해 열화된 수신 성능을 갖는다. 기존 차동 검출 방식의 수신 성능을 향상시키기 위해 DF-DPD, DPD-RGPR 등을 포함하는 다중 심볼 차동 검출 방식들이 제시되었다. 하지만, 이러한 방식들의 검출 성능에 대한 분석 및 비교에 대한 연구는 거의 진행되지 않았다. 그러므로, 본 논문에서는 DF-DPD와 DPD-RGPR 등의 결정 궤환 기반 차동 위상 검출 방식들의 성능을 수치적으로 분석한다. 수치적 분석 결파, 결정 궤환을 갖는 차동 위상 검출 방식들은 차동 복호를 갖는 동기 검출의 성능에 근접할 수 있으며 향상된 성능을 갖는 비동기 검출 (Noncoherent Detection)에 활용될 수 있음을 볼 수 있었다. 하드웨어 복잡도를 고려하면, 검출 길이가 증가함에 따라 복잡도가 증가하는 구조에 기반한 DF-DPD 방식보다 반복적으로 갱신되는 참조 위상을 사용하는 검출 방식에 기반한 DPD-RGPR 방식이 구현에 더욱 효과적임을 알 수 있었다.

결정규칙의 자동생성을 위한 패턴공간의 재귀적 퍼지분할 (Recursive Fuzzy Partition of Pattern Space for Automatic Generation of Decision Rules)

  • 김봉근;최형일
    • 한국지능시스템학회논문지
    • /
    • 제5권2호
    • /
    • pp.28-43
    • /
    • 1995
  • 본 논문에서는 패턴분류기를 위해 효과적인 퍼지규칙을 자동으로 생성하기 위한 새로운 방법을 제안한다. 퍼지 규칙은 특징공간에 대해 가상구체를 재귀적으로 정의함으로써 추출되고, 가상구체는 패턴 클래스의 중심벡터와 클래스에 속하는 모든 패턴을 충분히 포함할 수 있는 경계거리로 정의된다. 특히 공간을 분할하기 위해 가상구체를 이용하는 방법은 기존에 많이 사용되고 있는 가상사각형 형태의 분할 방법에 비해 클래스의 형태를 효과적으로 표현할 수 있으므로 패턴 분류기의 정화성을 향상시킬 수 있고, 퍼지규칙의 전제부를 매우 간단하게 표현할 수 있을 뿐만 아니라 제귀적 가상구체의 정의를 통해 추출되는 퍼지규칙들이 계층적인 구조를 갖을 수 있게 함으로써 입력되는 패턴의 신속한 분류를 가능하게 한다. 본 논문에서는 제안된 방법을 기존의 가상사각형을 이용한 퍼지규칙 추출 방법과 비교한다.

  • PDF

단일 레이저 스캐너와 Integrated Probabilistic Data Association Filter를 이용한 도심환경에서의 다중 차량추적 (Multiple Vehicle Tracking in Urban Environment using Integrated Probabilistic Data Association Filter with Single Laser Scanner)

  • 김동철;한재현;선우명호
    • 한국자동차공학회논문집
    • /
    • 제21권4호
    • /
    • pp.33-42
    • /
    • 2013
  • This paper describes a multiple vehicle tracking algorithm using an integrated probabilistic data association filter (IPDAF) in urban environments. The algorithm consists of two parts; a pre-processing stage and an IPDA tracker. In the pre-processing stage, measurements are generated by a feature extraction method that manipulates raw data into predefined geometric features of vehicles as lines and boxes. After that, the measurements are divided into two different objects, dynamic and static objects, by using information of ego-vehicle motion. The IPDA tracker estimates not only states of tracks but also existence probability recursively. The existence probability greatly assists reliable initiation and termination of track in cluttered environment. The algorithm was validated by using experimental data which is collected in urban environment by using single laser scanner.

HF 채널에서의 SFH/MFSK 신호의 시간 추적 (Tracking of SFH/MFSK Signal in HF Channel)

  • 최세열
    • 한국통신학회논문지
    • /
    • 제19권3호
    • /
    • pp.442-450
    • /
    • 1994
  • 본 논문에서는 SFH/MFSK 시스템에서 DFT를 recursive하게 구현한 대역통과 필터뱅크와 병렬 상관기를 이용하여 시간추적을 하는 방법에 대하여 연구하였다. 심볼 주기동안 샘플링 주기의 n배 간격으로 M개의 스펙드럼을 분석한다. hop 주기동안 저장된 대역통과필터뱅크의 출력값은 병렬 상관기에 입력되어 최대출력값이 나타나는 샘플링 위치와 상관 시간을 이용하여 송수신 시간차를 교정한다. 제안된 시간추적방법의 HF 채널환경에서의 성능은 컴퓨터 시뮬레이션을 통하여 동기 신호의 검출율과 최대 상관값의 분포를 구하여 분석 하였다.

  • PDF