97 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이성환-
dc.date.accessioned2021-01-12T05:54:07Z-
dc.date.available2021-01-12T05:54:07Z-
dc.date.issued2002-01-
dc.identifier.citation한국생산제조학회지, v. 11, no. 1, page. 45-51en_US
dc.identifier.issn2508-5093-
dc.identifier.issn2508-5107-
dc.identifier.urihttp://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00923220?-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/156904-
dc.description.abstractTo reduce the cost and increase reliability of die and mold products, automation of the finishing (polishing) process is essential. A major element of automation is a reliable database and a knowledge base for polishing status. This paper presents a polishing expert system which can determine optimal polishing sequences and conditions by using an empirical formula and an experimental database. The sinplex method was used for the curve fittings of the experimental results. Also a graphical user interface, which visualizes the optimized results, was developed.en_US
dc.language.isoko_KRen_US
dc.publisher한국생산제조학회en_US
dc.subjectPolishing Automation(연마 자동화)en_US
dc.subjectPolishing Parameter(연마 파라미터)en_US
dc.subjectPolishing Expert System(전문가 시스템)en_US
dc.subjectDownhill Simplex Method(심플렉스 메소드)en_US
dc.title금형면 자동다듬질 전문가 시스템 개발에 관한 연구 IIen_US
dc.title.alternativeDevelopment of an Expert System for Optimizing Die and Mold Polishing-Ⅱen_US
dc.typeArticleen_US
dc.relation.journal한국공작기계학회논문집-
dc.contributor.googleauthor민헌식-
dc.contributor.googleauthor이성환-
dc.contributor.googleauthor안유민-
dc.contributor.googleauthor조남규-
dc.contributor.googleauthor한창수-
dc.relation.code2012101361-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentDEPARTMENT OF MECHANICAL ENGINEERING-
dc.identifier.pidsunglee-
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > MECHANICAL ENGINEERING(기계공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE