一种新的IFFD生成算法

M. Liou, H. Dietz, H. Moskowitz, R. Plante
{"title":"一种新的IFFD生成算法","authors":"M. Liou, H. Dietz, H. Moskowitz, R. Plante","doi":"10.1109/PICMET.1991.183652","DOIUrl":null,"url":null,"abstract":"The authors describes the automated generation of optimal irregular fractional factorial designs (IFFDs), and for regular maximal subset designs (MSDs), for processes involving 2-level factors. They describe mechanisms on separating out confounded effects and new, efficient methods for IFFD generation. It is concluded that, although finding IFFD solutions by using a seed set of tests as a restriction shows some promise as a way to limit the search space, much work needs to be orchestrated toward solving a requirement set containing higher-order interactions.<<ETX>>","PeriodicalId":22349,"journal":{"name":"Technology Management : the New International Language","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new algorithm for IFFD generation\",\"authors\":\"M. Liou, H. Dietz, H. Moskowitz, R. Plante\",\"doi\":\"10.1109/PICMET.1991.183652\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors describes the automated generation of optimal irregular fractional factorial designs (IFFDs), and for regular maximal subset designs (MSDs), for processes involving 2-level factors. They describe mechanisms on separating out confounded effects and new, efficient methods for IFFD generation. It is concluded that, although finding IFFD solutions by using a seed set of tests as a restriction shows some promise as a way to limit the search space, much work needs to be orchestrated toward solving a requirement set containing higher-order interactions.<<ETX>>\",\"PeriodicalId\":22349,\"journal\":{\"name\":\"Technology Management : the New International Language\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Technology Management : the New International Language\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PICMET.1991.183652\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Technology Management : the New International Language","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICMET.1991.183652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

作者描述了最优不规则分数因子设计(iffd)的自动生成,以及规则最大子集设计(MSDs),涉及2级因素的过程。他们描述了分离混杂效应的机制和产生IFFD的新的、有效的方法。结论是,尽管通过使用一组种子测试作为限制来寻找IFFD解决方案显示了一些希望作为限制搜索空间的方法,但是需要为解决包含高阶交互的需求集进行许多工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new algorithm for IFFD generation
The authors describes the automated generation of optimal irregular fractional factorial designs (IFFDs), and for regular maximal subset designs (MSDs), for processes involving 2-level factors. They describe mechanisms on separating out confounded effects and new, efficient methods for IFFD generation. It is concluded that, although finding IFFD solutions by using a seed set of tests as a restriction shows some promise as a way to limit the search space, much work needs to be orchestrated toward solving a requirement set containing higher-order interactions.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信