乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:17:30Z","timestamp":1740111450864,"version":"3.37.3"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,12,11]],"date-time":"2021-12-11T00:00:00Z","timestamp":1639180800000},"content-version":"vor","delay-in-days":1471,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001332","name":"Council\u00a0for\u00a0Scientific and Industrial Research, South Africa","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001332","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005999","name":"Bangladesh Council of Scientific and Industrial Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005999","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1016\/j.dam.2017.08.023","type":"journal-article","created":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T23:31:43Z","timestamp":1506036703000},"page":"8-22","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Mixed covering arrays on 3-uniform hypergraphs"],"prefix":"10.1016","volume":"232","author":[{"given":"Yasmeen","family":"Akhtar","sequence":"first","affiliation":[]},{"given":"Soumen","family":"Maity","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2017.08.023_b1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/j.dam.2017.08.023_b2","series-title":"Hypergraphs- Combinatorics of Finite Sets","volume":"vol. 45","author":"Berge","year":"1989"},{"issue":"1","key":"10.1016\/j.dam.2017.08.023_b3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1008379710317","article-title":"Covering arrays of strength three","volume":"16","author":"Chateauneuf","year":"1999","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"10.1016\/j.dam.2017.08.023_b4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jcd.10002","article-title":"On the state of strength-three covering arrays","volume":"10","author":"Chateauneuf","year":"2002","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.dam.2017.08.023_b5","doi-asserted-by":"crossref","unstructured":"C. Cheng, A. Dumitrescu, P. Schroeder, Generating small combinatorial test suites to cover input\u2013output relationships, in: Proc. 3rd Intern. Conference on Quality Software, 2003, pp. 76\u201382.","DOI":"10.1109\/QSIC.2003.1319088"},{"issue":"7","key":"10.1016\/j.dam.2017.08.023_b6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/32.605761","article-title":"The AETG system: An approach to testing based on combinatorial design","volume":"23","author":"Cohen","year":"1997","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"10.1016\/j.dam.2017.08.023_b7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/52.536462","article-title":"The combinatorial design approach to automatic test generation","volume":"13","author":"Cohen","year":"1996","journal-title":"IEEE Softw."},{"key":"10.1016\/j.dam.2017.08.023_b8","first-page":"121","article-title":"Combinatorial aspects of covering arrays","volume":"58","author":"Colbourn","year":"2004","journal-title":"Matematiche (Catania)"},{"year":"2007","series-title":"The CRC Handbook of Combinatorial Designs","author":"Colbourn","key":"10.1016\/j.dam.2017.08.023_b9"},{"key":"10.1016\/j.dam.2017.08.023_b10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1002\/jcd.20065","article-title":"Products of mixed covering arrays of strength two","volume":"14","author":"Colbourn","year":"2006","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.dam.2017.08.023_b11","unstructured":"M.H. Graham, On the Universal Relation, Technical Report, University of Toronto, Toronto, Ontario, Canada, 1979."},{"key":"10.1016\/j.dam.2017.08.023_b12","series-title":"Combinatorics and Algorithms, Interdisciplinary Applications, Vol. 34","first-page":"237","article-title":"Software and hardware testing using combinatorial covering suites in Graph Theory","author":"Hartman","year":"2006"},{"key":"10.1016\/j.dam.2017.08.023_b13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","article-title":"Problems and algorithms for covering arrays","volume":"284","author":"Hartman","year":"2004","journal-title":"Discrete Math."},{"year":"1999","series-title":"Orthogonal Arrays-Theory and Applications","author":"Hedayat","key":"10.1016\/j.dam.2017.08.023_b14"},{"year":"2008","series-title":"Graphs and Homomorphisms","author":"Hell","key":"10.1016\/j.dam.2017.08.023_b15"},{"key":"10.1016\/j.dam.2017.08.023_b16","doi-asserted-by":"crossref","unstructured":"S. Maity, Software testing with budget constraints, in: Proc. 9th IEEE International Conference on Information Technology New Generation, ITNG12, 2012, pp. 258\u2013268.","DOI":"10.1109\/ITNG.2012.44"},{"key":"10.1016\/j.dam.2017.08.023_b17","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1587\/transinf.E95.D.2227","article-title":"3-way software testing with budget constraints","volume":"E95-D","author":"Maity","year":"2012","journal-title":"IEICE Trans. Inf. Syst."},{"key":"10.1016\/j.dam.2017.08.023_b18","unstructured":"S. Maity, A. Nayak, Improved test generation algorithms for pair-wise testing, in: Proc. 16th IEEE International Symposium on Software Reliability Engineering, ISSRE05, 2005, pp. 235\u2013244."},{"key":"10.1016\/j.dam.2017.08.023_b19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jcd.20149","article-title":"Mixed covering arrays on graphs","volume":"15","author":"Meagher","year":"2007","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.dam.2017.08.023_b20","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.jctb.2005.03.005","article-title":"Covering arrays on graphs","volume":"95","author":"Meagher","year":"2005","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2017.08.023_b21","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/jcd.10059","article-title":"Covering arrays with mixed alphabet sizes","volume":"11","author":"Moura","year":"2003","journal-title":"J. Combin. Des."},{"key":"10.1016\/j.dam.2017.08.023_b22","unstructured":"S. Raaphorst, Variable Strength Covering Arrays (Ph.D. thesis), University of Ottawa, Ottawa, 2013."},{"key":"10.1016\/j.dam.2017.08.023_b23","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.disc.2014.06.025","article-title":"Improved monochromatic loose cycle partitions in hypergraphs","volume":"334","author":"S\u00e1rk\u00f6zy","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2017.08.023_b24","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/18.6031","article-title":"Vector sets for exhaustive testing of logic circuits","volume":"34","author":"Seroussi","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dam.2017.08.023_b25","unstructured":"B. Stevens, Transversal Covers and Packings (Ph.D. thesis), University of Toronto, Toronto, 1998."},{"year":"2009","series-title":"Introduction to Graph and Hypergraph Theory","author":"Voloshin","key":"10.1016\/j.dam.2017.08.023_b26"},{"year":"2001","series-title":"Introduction to Graph Theory","author":"West","key":"10.1016\/j.dam.2017.08.023_b27"},{"key":"10.1016\/j.dam.2017.08.023_b28","series-title":"E Proc. of the IEEE Computer Software and Applications Conf","first-page":"306","article-title":"An algorithm for tree-query membership of distributed query","author":"Yu","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17304092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17304092?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,12,11]],"date-time":"2021-12-11T06:01:40Z","timestamp":1639202500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17304092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":28,"alternative-id":["S0166218X17304092"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2017.08.023","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mixed covering arrays on 3-uniform hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2017.08.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}