乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T14:29:37Z","timestamp":1721226577216},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:00:00Z","timestamp":1617321600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1016\/j.jco.2016.10.007","type":"journal-article","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T19:31:58Z","timestamp":1478201518000},"page":"111-121","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On second order orthogonal Latin hypercube designs"],"prefix":"10.1016","volume":"39","author":[{"given":"Haralambos","family":"Evangelaras","sequence":"first","affiliation":[]},{"given":"Markos V.","family":"Koutras","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jco.2016.10.007_br000005","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1016\/j.jspi.2012.04.009","article-title":"Some new classes of Orthogonal Latin Hypercube designs","volume":"142","author":"Ai","year":"2012","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/j.jco.2016.10.007_br000010","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1093\/biomet\/asn057","article-title":"Orthogonal and nearly orthogonal designs for computer experiments","volume":"96","author":"Bingham","year":"2009","journal-title":"Biometrika"},{"key":"10.1016\/j.jco.2016.10.007_br000015","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1093\/biomet\/88.3.847","article-title":"Optimal and Orthogonal Latin Hypercube designs for computer experiments","volume":"88","author":"Butler","year":"2001","journal-title":"Biometrika"},{"key":"10.1016\/j.jco.2016.10.007_br000020","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1016\/j.jco.2015.02.002","article-title":"Construction of second-order orthogonal sliced Latin hypercube designs","volume":"31","author":"Cao","year":"2015","journal-title":"J. Complexity"},{"key":"10.1016\/j.jco.2016.10.007_br000025","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/jcd.21408","article-title":"A note on the construction of orthogonal latin hypercube designs","volume":"24","author":"Dey","year":"2016","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.jco.2016.10.007_br000030","doi-asserted-by":"crossref","first-page":"2381","DOI":"10.1002\/qre.1942","article-title":"Enumeration and evaluation of small Orthogonal Latin Hypercube Designs for polynomial regression models","volume":"32","author":"Evangelaras","year":"2016","journal-title":"Qual. Reliab. Eng. Int."},{"key":"10.1016\/j.jco.2016.10.007_br000035","series-title":"Design and Modeling for Computer Experiments","author":"Fang","year":"2006"},{"key":"10.1016\/j.jco.2016.10.007_br000040","series-title":"Handbook of Statistics, Vol. 22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0169-7161(03)22006-X","article-title":"Uniform experimental designs and their applications, in industry","author":"Fang","year":"2003"},{"key":"10.1016\/j.jco.2016.10.007_br000045","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.1016\/j.jspi.2008.08.016","article-title":"Orthogonal Latin Hypercube designs from generalized orthogonal designs","volume":"139","author":"Georgiou","year":"2009","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/j.jco.2016.10.007_br000050","first-page":"101","article-title":"Some classes of Orthogonal Latin Hypercube designs","volume":"24","author":"Georgiou","year":"2014","journal-title":"Statist. Sinica"},{"key":"10.1016\/j.jco.2016.10.007_br000055","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1016\/j.jspi.2010.12.006","article-title":"Block-circulant matrices for constructing optimal Latin hypercube designs","volume":"141","author":"Georgiou","year":"2011","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/j.jco.2016.10.007_br000060","series-title":"Orthogonal Designs: Quadratic Forms and Hadamard Matrices","author":"Geramita","year":"1979"},{"key":"10.1016\/j.jco.2016.10.007_br000065","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/S0025-5718-98-00894-1","article-title":"A generalized discrepancy and quadrature error bound","volume":"67","author":"Hickernell","year":"1998","journal-title":"Math. Comp."},{"key":"10.1016\/j.jco.2016.10.007_br000070","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0378-3758(90)90122-B","article-title":"Minimax and maximin distance designs","volume":"26","author":"Johnson","year":"1990","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/j.jco.2016.10.007_br000075","series-title":"New developments in designs for computer experiments and physical experiments","author":"Lin","year":"2008"},{"key":"10.1016\/j.jco.2016.10.007_br000080","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1214\/09-AOS757","article-title":"A new and flexible method for constructing designs for computer experiments","volume":"38","author":"Lin","year":"2010","journal-title":"Ann. Statist."},{"key":"10.1016\/j.jco.2016.10.007_br000085","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/biomet\/asn064","article-title":"Construction of orthogonal and nearly Orthogonal Latin Hypercubes","volume":"96","author":"Lin","year":"2009","journal-title":"Biometrika"},{"key":"10.1016\/j.jco.2016.10.007_br000090","first-page":"239","article-title":"A comparison of three methods for selecting values of input variables in the analysis of output from a computer code","volume":"21","author":"McKay","year":"1979","journal-title":"Technometrics"},{"key":"10.1016\/j.jco.2016.10.007_br000095","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.csda.2008.10.026","article-title":"Orthogonal-column Latin hypercube designs with small samples","volume":"53","author":"Prescott","year":"2009","journal-title":"Comput. Statist. Data Anal."},{"key":"10.1016\/j.jco.2016.10.007_br000100","series-title":"The Design and Analysis of Computer Experiments","author":"Santner","year":"2003"},{"key":"10.1016\/j.jco.2016.10.007_br000105","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1093\/biomet\/93.2.279","article-title":"A construction method for Orthogonal Latin Hypercube designs","volume":"93","author":"Steinberg","year":"2006","journal-title":"Biometrika"},{"key":"10.1016\/j.jco.2016.10.007_br000110","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1093\/biomet\/asp058","article-title":"Construction of Orthogonal Latin Hypercube designs","volume":"96","author":"Sun","year":"2009","journal-title":"Biometrika"},{"key":"10.1016\/j.jco.2016.10.007_br000115","doi-asserted-by":"crossref","first-page":"3236","DOI":"10.1016\/j.jspi.2010.04.023","article-title":"Construction of Orthogonal Latin Hypercube designs with flexible run sizes","volume":"140","author":"Sun","year":"2010","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/j.jco.2016.10.007_br000120","doi-asserted-by":"crossref","first-page":"433","DOI":"10.5705\/ss.2010.021","article-title":"Construction of orthogonal and nearly Orthogonal Latin Hypercube designs from orthogonal designs","volume":"22","author":"Yang","year":"2012","journal-title":"Statist. Sinica"},{"key":"10.1016\/j.jco.2016.10.007_br000125","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1080\/01621459.1998.10473803","article-title":"Orthogonal column Latin hypercubes and their application in computer experiments","volume":"93","author":"Ye","year":"1998","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.jco.2016.10.007_br000130","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0378-3758(00)00105-1","article-title":"Algorithmic construction of optimal symmetric Latin hypercube designs","volume":"90","author":"Ye","year":"2000","journal-title":"J. Statist. Plann. Inference"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X16300929?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X16300929?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T13:37:13Z","timestamp":1617370633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X16300929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":26,"alternative-id":["S0885064X16300929"],"URL":"https:\/\/doi.org\/10.1016\/j.jco.2016.10.007","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On second order orthogonal Latin hypercube designs","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jco.2016.10.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}