• Title/Summary/Keyword: Paralle Mechanism

Search Result 4, Processing Time 0.017 seconds

A Study on the Optical Digital paralle Processor using Phase Conjugate Mirror (위상 공액경을 이용한 광 디지틀 병렬 연산기에 관한 연구)

  • 은재정;최평석
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.9
    • /
    • pp.135-141
    • /
    • 1995
  • An optical digital parallel processor using Self-Pumped Phase Conjugate Mirror and liquid crystal spatial light modulator is presented and experimentally implemented. To use self-pumped PCM as memory, the mechanism for phase conjugation in two coupled interaction regions with the photorefractive crystal BaTiO$_{3}$ is investigated, especially the temporal behavior and effects of incident beam position. The optical design and implementation of matrix-vector multiplication using LCSLM and PCM memory is presented.

  • PDF

Development of a parallel link typed wrist for robotic precision assembly (정밀조립을 위한 병렬다관절 구조를 가진 로봇손목기구의 개발)

  • 문창렬;조형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.281-286
    • /
    • 1993
  • In this paper, a parallel link typed wrist is developed for robotic precision assembly. The developed wrist can make the corrective motion required for compensating lateral and tilting errors. The mechanism of this wrist is one example of a motion simulator generating 6 DOF motion in space by 6 actuators connected in paralle. To make the wrist more compact, miniature DC motors containing reduction gears and servo system were used. The parallel link architecture enables a high positioning accuracy and high nominal load capacity. In this study, inverse kinematic problem is solved by using a Denavet-Hartenberg method and a simulational result about workspace of the proposed parallel mechanism is obtained.

  • PDF

Study on Precison Assembly Macchanism Using Joint Compliances (관절 콤플라이언스를 활용한 정밀 조립형 메카니즘에 관한 연구)

  • 김동구;김희국;이병주
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.04a
    • /
    • pp.395-400
    • /
    • 1994
  • Most of Commercial Remote Center Compliance(RCC) devices have been designed using deformable structures. In this work, we propose another type of assembly devices which generate the compliance effects by attaching the compliances (or spring) at the joints of the given mechainsm. The compliance models are derived for a serial-type, parallel-type, and hybrid-type mechanisms, respectively. In particular, a planar three-degree of freedom parallel structure is shown to have RCC points at the center of the workspace for its symmetric configuratings.

  • PDF

Parallel Range Query processing on R-tree with Graphics Processing Units (GPU를 이용한 R-tree에서의 범위 질의의 병렬 처리)

  • Yu, Bo-Seon;Kim, Hyun-Duk;Choi, Won-Ik;Kwon, Dong-Seop
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.669-680
    • /
    • 2011
  • R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.