메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
In industry, multihead automatic combination weighers are used to provide accurate weights at high speed. To minimize giveaway, greater accuracy is desired, especially for valuable products. This paper describes a combination algorithm based on bit operation. The combination method is simple and saves time, since only the elements to be considered for combination are generated. The total number of combinations from which the desired output weight is chosen can be increased by extending the combination from memory hoppers to include some weighing hoppers. For an eight-channel weigher, three or four combination elements are best. In addition to targeting approximately equal amounts of products in each channel, this study investigated other schemes. Simulation results show that schemes targeting combination elements with an unequal distribution of the output weight are more accurate. The most accurate scheme involves supplying products to all memory and weighing hoppers before commencing the combination operation. However, this scheme takes more time.

목차

1. Introduction
2. Hardware Layout and Operation
3. Combination Algorithm
4. Results and Analysis
5. Conclusions
REFERENCES

참고문헌 (8)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-555-016780655