一种新的两级RFFD生成算法

M. Liou, H. Dietz, H. Moskowitz, R. Plante
{"title":"一种新的两级RFFD生成算法","authors":"M. Liou, H. Dietz, H. Moskowitz, R. Plante","doi":"10.1109/PICMET.1991.183651","DOIUrl":null,"url":null,"abstract":"The authors have developed and analyzed a novel algorithm for generation of all two-level RFFDs (regular fractional factoral designs) which met a user-specified requirement set. Although Franklin's algorithm could have been applied many times to obtain the same designs, the proposed algorithm directly, and relatively quickly, produces all such RFFDs (without repeats). This allows the user to make intelligent choices between alternative RFFDs. The FFDs are optimized to provide specific information using the fewest tests.<<ETX>>","PeriodicalId":22349,"journal":{"name":"Technology Management : the New International Language","volume":"25 1","pages":"328-331"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new algorithm for two-level RFFD generation\",\"authors\":\"M. Liou, H. Dietz, H. Moskowitz, R. Plante\",\"doi\":\"10.1109/PICMET.1991.183651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors have developed and analyzed a novel algorithm for generation of all two-level RFFDs (regular fractional factoral designs) which met a user-specified requirement set. Although Franklin's algorithm could have been applied many times to obtain the same designs, the proposed algorithm directly, and relatively quickly, produces all such RFFDs (without repeats). This allows the user to make intelligent choices between alternative RFFDs. The FFDs are optimized to provide specific information using the fewest tests.<<ETX>>\",\"PeriodicalId\":22349,\"journal\":{\"name\":\"Technology Management : the New International Language\",\"volume\":\"25 1\",\"pages\":\"328-331\"},\"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.183651\",\"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.183651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

作者开发并分析了一种新的算法,用于生成满足用户指定需求集的所有两级rffd(规则分数因子设计)。虽然Franklin的算法可以多次应用以获得相同的设计,但所提出的算法直接且相对较快地生成了所有此类rffd(无需重复)。这允许用户在可选rffd之间做出明智的选择。ffd经过优化,可以使用最少的测试提供特定的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new algorithm for two-level RFFD generation
The authors have developed and analyzed a novel algorithm for generation of all two-level RFFDs (regular fractional factoral designs) which met a user-specified requirement set. Although Franklin's algorithm could have been applied many times to obtain the same designs, the proposed algorithm directly, and relatively quickly, produces all such RFFDs (without repeats). This allows the user to make intelligent choices between alternative RFFDs. The FFDs are optimized to provide specific information using the fewest tests.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信