• 제목/요약/키워드: Fast Reduction

검색결과 904건 처리시간 0.024초

제조공정용 Fast Back 이송장치 진동·소음 저감에 관한 연구 (A Study on Vibration & Noise Reduction of Fast Back Feeding Device for Manufacturing Process)

  • 한두희;이승훈;손영득
    • 한국산학기술학회논문지
    • /
    • 제20권8호
    • /
    • pp.642-648
    • /
    • 2019
  • 본 논문은 스낵식품 가공 공정라인에서 사용하는 설비 중 하나로 이송물의 관성을 이용한 제조공정용 Fast Back 이송장치이다. 기존의 이송 장치는 벨트 컨베이어와 기계식 크랭크를 적용한 구동 장치로써 소음과 진동이 크고 환경 공해 발생하며 주기적인 유지보수가 필요하다. 이로 인해 본 논문에서는 제안하는 Fast Back 이송 장치는 크랭크식 구동장치 부분을 리니어 서보모터로 대체하고 가속에 따른 힘의 평형을 맞추기 위한 평형추 장치를 적용하여 안정된 동작을 확보하였다. 평형추 장치는 주기적으로 발생하는 충격형태의 가진력을 상쇄 시키는 것으로 진동해석을 통해 진동의 주요 원인을 파악하고 저감대책을 수립하였다. 시제품 제작을 통한 진동시험에서 약 10배 정도의 진동 저감에 대한 유효성을 검증하였다. 또한, PLC제어를 통한 전진과 후진에서의 속도, 가속도 조정을 가능하게 설계함으로써 직선형 구동력을 직접 발생시켜 별도의 기계적 변환장치가 필요하지 않아 에너지 손실이나 소음 및 진동을 발생시키지 않고 운전 속도에도 제한을 받지 않음을 증명하였다.

한국에 분포되어 있는 토착대두 근류균의 질산 환원 특성 (Dissimilatory Nitrate Reduction Characteristics of Indigenous Soybean Rhizobia Distributed in Korea Soils)

  • 최영주;최용락;윤한대;유진창;이상규;조무제
    • Applied Biological Chemistry
    • /
    • 제29권2호
    • /
    • pp.175-181
    • /
    • 1986
  • 연속적으로 대두를 재배한 토양과 신개간지 토양에서 재배한 대두 품종 단엽의 근류로부터 토착대두 근류근 87종을 분리하고 이들을 생장속도에 따라 Bradyrhizobium japonicum (slow-grower) 및 Rhizobium fredii (fast-grower)로 분류한 결과 전자가 55종, 후자가 32종이었다. 이두그룹의 대두 근류균을 질산염 환원특성에 따라 denitrifying fast-grower(F-1), nitrate respiring fast-grower(F-II), denitrifying slow-grower(S-I), 및 nitrate respiring slow-grower (S-II)로 세분 되었으며, 분리균주 총 87종중 S-I, S-II, F-I 및 F-II의 수는 각각 10, 22, 48 및 7종이었다. 이들 각 group 대두 근류균의 균체단백질의 전기영동 pattern상의의 차이를 1차 및 2차원 전기영동으로 분석한 결과 slow 및 fast-grower간에는 현저한 차이를 관찰할 수 있었으나 동일 생장속도를 가진 것 중 denitrifer와 nitrate repirer간에는 큰 차이가 없었다.

  • PDF

PWR 사용후핵연료 처리를 위한 금속전환공정 개발 (Development of an Oxide Reduction Process for the Treatment of PWR Spent Fuel)

  • 허진목;홍순석;정상문;이한수
    • 방사성폐기물학회지
    • /
    • 제8권1호
    • /
    • pp.77-84
    • /
    • 2010
  • 상용원자로에서 발생하는 산화물 사용후핵연료의 부피감용과 재활용을 위하여 산화물을 금속으로 환원시키는 공정에 대한 연구가 수행되어 왔다. 다양한 환원법 중에서, 한국원자력연구원은 LiCl-$Li_2O$ 용융염을 반응매질로 사용하는 전해환원공정을 현재 개발 중이다. 파이로 공정의 전단부에 해당하는 전해환원 공정은 PWR 산화물 연료 주기를 소듐냉각 고속로의 금속연료 주기에 연결시켜 준다. 이 논문은 금속전환 공정을 개발/개선하고, 용량 증대를 수행한 한국원자력연구원의 노력을 요약한다.

Fast Computation of the Visibility Region Using the Spherical Projection Method

  • Chu, Gil-Whoan;Chung, Myung-Jin
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제4권1호
    • /
    • pp.92-99
    • /
    • 2002
  • To obtain visual information of a target object, a camera should be placed within the visibility region. As the visibility region is dependent on the relative position of the target object and the surrounding object, the position change of the surrounding object during a task requires recalculation of the visibility region. For a fast computation of the visibility region so as to modify the camera position to be located within the visibility region, we propose a spherical projection method. After being projected onto the sphere the visibility region is represented in $\theta$-$\psi$ spaces of the spherical coordinates. The reduction of calculation space enables a fast modification of the camera location according to the motion of the surrounding objects so that the continuous observation of the target object during the task is possible.

스마트 영상 장비를 위한 BCS-SPL 복호화 기법의 효과적인 고속화 방안 (An Effective Fast Algorithm of BCS-SPL Decoding Mechanism for Smart Imaging Devices)

  • 류중선;김진수
    • 한국멀티미디어학회논문지
    • /
    • 제19권2호
    • /
    • pp.200-208
    • /
    • 2016
  • Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing in an under-sampled (i.e., under Nyquist rate) representation. A block compressed sensing with projected Landweber (BCS-SPL) framework is most widely known, but, it has high computational complexity at decoder side. In this paper, by introducing adaptive exit criteria instead of fixed exit criteria to SPL framework, an effective fast algorithm is designed in such a way that it can utilize efficiently the sparsity property in DCT coefficients during the iterative thresholding process. Experimental results show that the proposed algorithm results in the significant reduction of the decoding time, while providing better visual qualities than conventional algorithm.

Fast Holographic Image Reconstruction Using Phase-Shifting Assisted Depth Detection Scheme for Optical Scanning Holography

  • Lee, Munseob;Min, Gihyeon;Kim, Nac-Woo;Lee, Byung Tak;Song, Je-Ho
    • ETRI Journal
    • /
    • 제38권4호
    • /
    • pp.599-605
    • /
    • 2016
  • For the implementation of a real-time holographic camera, fast and automatic holographic image reconstruction is an essential technology. In this paper, we propose a new automatic depth-detection algorithm for fast holography reconstruction, which is particularly useful for optical scanning holography. The proposed algorithm is based on the inherent phase difference information in the heterodyne signals, and operates without any additional optical or electrical components. An optical scanning holography setup was created using a heterodyne frequency of 4 MHz with a 500-mm distance and 5-mm depth resolution. The reconstruction processing time was measured to be 0.76 s, showing a 62% time reduction compared to a recent study.

Extension of Fast Level Set Method with Relationship Matrix, Modified Chan-Vese Criterion and Noise Reduction Filter

  • Vu, Dang-Tran;Kim, Jin-Young;Choi, Seung-Ho;Na, Seung-You
    • The Journal of the Acoustical Society of Korea
    • /
    • 제28권3E호
    • /
    • pp.118-135
    • /
    • 2009
  • The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.

Secure Pre-authentication Schemes for Fast Handoff in Proxy Mobile IPv6

  • Baek, Jaejong
    • Journal of information and communication convergence engineering
    • /
    • 제14권2호
    • /
    • pp.89-96
    • /
    • 2016
  • In mobile communication, there are various types of handoff for the support of all forms of mobility. Proxy mobile IPv6 (PMIPv6) enables local network-based mobility management of a mobile node without any effect of mobility-related signaling. Recently, PMIPv6 has been considered for supporting mobility management in LTE/SAE-based mobile networks. To support seamless mobility in heterogeneous mobile networks, the overall cost of handoffs needs to be minimized and the procedure should be guaranteed to be secure. However, the reduction of the authentication cost has not been fully investigated to provide seamless connectivity when mobile users perform a handoff between the PMIPv6 domains. This paper proposes secure pre-authentication schemes, completing an authentication procedure before performing a handoff, for a fast handoff in PMIPv6. Analytic models have been used for measuring the authentication latency and for the overhead cost analysis. In addition to providing fast authentication, the proposed pre-authentication schemes can prevent threats such as replay attacks and key exposure.

최적 모드 예측을 이용한 고속 모드 결정 알고리즘 (Optimal Mode Prediction-based Fast Mode Decision Algorithm for H.264-based Mobile Devices)

  • 조용수;김용구;최영호
    • 전기학회논문지
    • /
    • 제56권10호
    • /
    • pp.1868-1871
    • /
    • 2007
  • This paper proposes a novel scheme to significantly reduce mode decision time by predicting optimal mode candidates. Unlike previous fast mode decision algorithms computing RDcost in a pre-defined mode order, the proposed scheme predicts optimal mode candidates and calculates their RDcosts first, increasing the possibility to satisfy early-exit conditions sooner, resulting in fast mode decision. This H.264 mode decision time reduction enables small computing power mobile devices to handle H.264 encoding effectively. Extensive simulations show that, when compared with JM10.2, AMD and LCIMS, the proposed scheme boosts H.264 encoding speed by up to 575% with a reasonable image quality degradation.

Depth-of-interest-based Bypass Coding-unit Algorithm for Inter-prediction in High-efficiency Video Coding

  • Rhee, Chae Eun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제5권4호
    • /
    • pp.231-234
    • /
    • 2016
  • The next-generation video coding standard known as High-Efficiency Video Coding (HEVC) was developed with the aim of doubling the bitrate reduction offered by H.264/Advanced Video Coding (AVC) at the expense of an increase in computational complexity. Mode decision with motion estimation is still one of the most time-consuming computations in HEVC, as it is with H.264/AVC. Several schemes for a fast mode decision have been presented in reference software and in other studies. However, a possible speed-up in conventional schemes is sometimes insignificant for videos that have inhomogeneous spatial and temporal characteristics. This paper proposes a bypass algorithm to skip large-block-size predictions for videos where small block sizes are preferred over large ones. The proposed algorithm does not overlap with those in previous works, and thus, is easily used with other fast algorithms. Consequently, an independent speed-up is possible.