{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:01:18Z","timestamp":1767830478942,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11424-023-3093-9","type":"journal-article","created":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T06:01:41Z","timestamp":1698213701000},"page":"1233-1250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Class of Strong Orthogonal Arrays of Strength Three"],"prefix":"10.1007","volume":"37","author":[{"given":"Chunyan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Qian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"key":"3093_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-8847-1","volume-title":"The Design and Analysis of Computer Experiments","author":"T J Santner","year":"2018","unstructured":"Santner T J, Williams B J, and Notz W I, The Design and Analysis of Computer Experiments, 2nd Edition, Springer, New York, 2018.","edition":"2nd Edition"},{"key":"3093_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034899","volume-title":"Design and Modeling for Computer Experiments","author":"K T Fang","year":"2005","unstructured":"Fang K T, Li R, and Sudjianto A, Design and Modeling for Computer Experiments, Chapman and Hall\/CRC, New York, 2005."},{"key":"3093_CR3","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1080\/00401706.2012.725994","volume":"54","author":"H Moon","year":"2012","unstructured":"Moon H, Dean A M, and Santner T J, Two-stage sensitivity-based group screening in computer experiments, Technometrics, 2012, 54: 376\u2013387.","journal-title":"Technometrics"},{"key":"3093_CR4","volume-title":"Handbook of Uncertainty Quantification","author":"D C Woods","year":"2016","unstructured":"Woods D C and Lewis S M, Design of experiments for screening, Handbook of Uncertainty Quantification, Eds. by Ghanem R, Higdon D, and Owhadi H, Springer, New York, 2016."},{"key":"3093_CR5","volume-title":"Advances in Modeling and Simulation","author":"J P Kleijnen","year":"2017","unstructured":"Kleijnen J P, Design and analysis of simulation experiments: Tutorial, Advances in Modeling and Simulation, Eds. by Tolk A, Fowler J, Shao G, et al., Springer, New York, 2017."},{"key":"3093_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9781119470007","volume-title":"Experiments: Planning, Analysis, and Optimization","author":"C F J Wu","year":"2021","unstructured":"Wu C F J and Hamada M S, Experiments: Planning, Analysis, and Optimization, 3rd Edition, Wiley, New York, 2021.","edition":"3rd Edition"},{"key":"3093_CR7","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1093\/biomet\/asv002","volume":"102","author":"V R Joseph","year":"2015","unstructured":"Joseph V R, Gul E, and Ba S, Maximum projection designs for computer experiments, Biometrika, 2015, 102: 371\u2013380.","journal-title":"Biometrika"},{"key":"3093_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1214\/18-AOS1705","volume":"47","author":"F Sun","year":"2019","unstructured":"Sun F, Wang Y, and Xu H, Uniform projection designs, Ann. Statist., 2019, 47: 641\u2013661.","journal-title":"Ann. Statist."},{"key":"3093_CR9","first-page":"239","volume":"21","author":"M McKay","year":"1979","unstructured":"McKay M, Beckman R, and Conover W, A comparison of three methods for selecting values of input variables in the analysis of output from acomputercode, Technometrics, 1979, 21: 239\u2013245.","journal-title":"Technometrics"},{"key":"3093_CR10","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1080\/01621459.1993.10476423","volume":"88","author":"B Tang","year":"1993","unstructured":"Tang B, Orthogonal array-based Latin hypercubes, J. Amer. Statist. Assoc., 1993, 88: 1392\u20131397.","journal-title":"J. Amer. Statist. Assoc."},{"key":"3093_CR11","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1093\/biomet\/asp045","volume":"96","author":"P Z G Qian","year":"2009","unstructured":"Qian P Z G, Nested Latin hypercube designs, Biometrika, 2009, 96: 957\u2013970.","journal-title":"Biometrika"},{"key":"3093_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/01621459.2011.644132","volume":"107","author":"P Z G Qian","year":"2012","unstructured":"Qian P Z G, Sliced Latin hypercube designs, J. Amer. Statist. Assoc., 2012, 107: 393\u2013399.","journal-title":"J. Amer. Statist. Assoc."},{"key":"3093_CR13","first-page":"1239","volume":"24","author":"H Xie","year":"2014","unstructured":"Xie H, Xiong S, Qian P Z G, et al., General sliced Latin hypercube designs, Statist. Sinica, 2014, 24: 1239\u20131256.","journal-title":"Statist. Sinica"},{"key":"3093_CR14","first-page":"211","volume":"24","author":"J Yang","year":"2014","unstructured":"Yang J, Liu M Q, and Lin D K J, Construction of nested orthogonal Latin hypercube designs, Statist. Sinica, 2014, 24: 211\u2013219.","journal-title":"Statist. Sinica"},{"key":"3093_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1093\/biomet\/93.2.279","volume":"93","author":"D M Steinberg","year":"2006","unstructured":"Steinberg D M and Lin D K J, A construction method for orthogonal Latin hypercube designs, Biometrika, 2006, 93: 279\u2013288.","journal-title":"Biometrika"},{"key":"3093_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/biomet\/asn057","volume":"96","author":"D Bingham","year":"2009","unstructured":"Bingham D, Sitter R R, and Tang B, Orthogonal and nearly orthogonal designs for computer experiments, Biometrika, 2009, 96: 51\u201365.","journal-title":"Biometrika"},{"key":"3093_CR17","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1093\/biomet\/asp058","volume":"96","author":"F Sun","year":"2009","unstructured":"Sun F, Liu M Q, and Lin D K J, Construction of orthogonal Latin hypercube designs, Biometrika, 2009, 96: 971\u2013974.","journal-title":"Biometrika"},{"key":"3093_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/biomet\/asn064","volume":"96","author":"C D Lin","year":"2009","unstructured":"Lin C D, Mukerjee R, and Tang B, Construction of orthogonal and nearly orthogonal Latin hypercubes, Biometrika, 2009, 96: 243\u2013247.","journal-title":"Biometrika"},{"key":"3093_CR19","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1214\/09-AOS757","volume":"38","author":"C D Lin","year":"2010","unstructured":"Lin C D, Bingham D, Sitter R R, et al., A new and flexible method for constructing designs for computer experiments, Ann. Statist., 2010, 38: 1460\u20131477.","journal-title":"Ann. Statist."},{"key":"3093_CR20","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1016\/j.jspi.2012.04.009","volume":"142","author":"M Ai","year":"2012","unstructured":"Ai M, He Y, and Liu S, Some new classes of orthogonal Latin hypercube designs, J. Statist. Plann. Inference, 2012, 142: 2809\u20132818.","journal-title":"J. Statist. Plann. Inference"},{"key":"3093_CR21","first-page":"101","volume":"24","author":"S D Georgiou","year":"2014","unstructured":"Georgiou S D and Efthimiou I, Some classes of orthogonal Latin hypercube designs, Statist. Sinica, 2014, 24: 101\u2013120.","journal-title":"Statist. Sinica"},{"key":"3093_CR22","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1080\/01621459.2016.1159211","volume":"112","author":"F Sun","year":"2017","unstructured":"Sun F and Tang B, A method of constructing space-filling orthogonal designs, J. Amer. Statist. Assoc., 2017, 112: 683\u2013689.","journal-title":"J. Amer. Statist. Assoc."},{"key":"3093_CR23","first-page":"1503","volume":"28","author":"L Wang","year":"2018","unstructured":"Wang L, Sun F, Lin D K J, et al., Construction of orthogonal symmetric Latin hypercube designs, Statist. Sinica, 2018, 28: 1503\u20131520.","journal-title":"Statist. Sinica"},{"key":"3093_CR24","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/biomet\/ass065","volume":"100","author":"Y He","year":"2013","unstructured":"He Y and Tang B, Strong orthogonal arrays and associated Latin hypercubes for computer experiments, Biometrika, 2013, 100: 254\u2013260.","journal-title":"Biometrika"},{"key":"3093_CR25","first-page":"1713","volume":"25","author":"H Liu","year":"2015","unstructured":"Liu H and Liu M Q, Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays, Statist. Sinica, 2015, 25: 1713\u20131734.","journal-title":"Statist. Sinica"},{"key":"3093_CR26","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1093\/biomet\/asz043","volume":"106","author":"Y Zhou","year":"2019","unstructured":"Zhou Y and Tang B, Column-orthogonal strong orthogonal arrays of strength two plus and three minus, Biometrika, 2019, 106: 997\u20131004.","journal-title":"Biometrika"},{"key":"3093_CR27","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.jspi.2020.12.005","volume":"215","author":"W Li","year":"2021","unstructured":"Li W, Liu M Q, and Yang J F, Column-orthogonal nearly strong orthogonal arrays, J. Statist. Plann. Inference, 2021, 215: 184\u2013192.","journal-title":"J. Statist. Plann. Inference"},{"key":"3093_CR28","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00362-021-01249-w","volume":"63","author":"W Li","year":"2022","unstructured":"Li W, Liu M Q, and Yang J F, Construction of column-orthogonal strong orthogonal arrays, Statist. Papers, 2022, 63: 515\u2013530.","journal-title":"Statist. Papers"},{"key":"3093_CR29","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1214\/14-AOS1225","volume":"42","author":"Y He","year":"2014","unstructured":"He Y and Tang B, A characterization of strong orthogonal arrays of strength three, Ann. Statist., 2014, 42: 1347\u20131360.","journal-title":"Ann. Statist."},{"key":"3093_CR30","doi-asserted-by":"publisher","first-page":"418","DOI":"10.3150\/19-BEJ1130","volume":"26","author":"C Shi","year":"2020","unstructured":"Shi C and Tang B, Construction results for strong orthogonal arrays of strength three, Bernoulli, 2020, 26: 418\u2013431.","journal-title":"Bernoulli"},{"key":"3093_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays: Theory and Applications","author":"A S Hedayat","year":"1999","unstructured":"Hedayat A S, Sloane N J A, and Stufken J, Orthogonal Arrays: Theory and Applications, Springer, New York, 1999."},{"key":"3093_CR32","first-page":"1225","volume":"32","author":"C Wang","year":"2022","unstructured":"Wang C, Yang J, and Liu M Q, Construction of strong group-orthogonal arrays. Statist. Sinica, 2022, 32: 1225\u20131243.","journal-title":"Statist. Sinica"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-3093-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-023-3093-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-3093-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T02:37:59Z","timestamp":1712543879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-023-3093-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,25]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["3093"],"URL":"https:\/\/doi.org\/10.1007\/s11424-023-3093-9","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,25]]},"assertion":[{"value":"15 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}