{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:23:11Z","timestamp":1773840191615,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:00:00Z","timestamp":1674518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:00:00Z","timestamp":1674518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862003"],"award-info":[{"award-number":["61862003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11227-023-05054-0","type":"journal-article","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:22:34Z","timestamp":1674577354000},"page":"9964-9984","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An evolutionary fault diagnosis algorithm for interconnection networks under the PMC model"],"prefix":"10.1007","volume":"79","author":[{"given":"Jiarong","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"issue":"2","key":"5054_CR1","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TPDS.2021.3093243","volume":"33","author":"LM Lin","year":"2021","unstructured":"Lin LM, Huang YZ, Xu L, Hsieh SY (2021) A pessimistic fault diagnosability of large-scale connected networks via extra connectivity. IEEE Trans Parallel Distrib Syst 33(2):415\u2013428","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"9","key":"5054_CR2","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1109\/TPDS.2014.2350480","volume":"26","author":"LC Ye","year":"2015","unstructured":"Ye LC, Liang JR (2015) Five-round adaptive diagnosis in Hamiltonian networks. IEEE Trans Parallel Distrib Syst 26(9):2459\u20132464","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"5054_CR3","doi-asserted-by":"publisher","first-page":"5340","DOI":"10.1109\/ACCESS.2017.2672602","volume":"5","author":"JR Liang","year":"2017","unstructured":"Liang JR, Zhang Q (2017) The $$t\/s$$-diagnosability of hypercube networks under PMC and comparison models. IEEE Access 5(1):5340\u20135346","journal-title":"IEEE Access"},{"issue":"1","key":"5054_CR4","doi-asserted-by":"publisher","first-page":"216","DOI":"10.21629\/JSEE.2018.01.22","volume":"29","author":"JR Liang","year":"2018","unstructured":"Liang JR, Zhou N, Yun L (2018) A new t\/k-diagnosis algorithm for n-dimensional hypercube network under the comparison model. J Syst Eng Electron 29(1):216\u2013222","journal-title":"J Syst Eng Electron"},{"key":"5054_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ins.2017.11.047","volume":"433","author":"YL Lv","year":"2018","unstructured":"Lv YL, Fan JX, Hsu DF, Lin CK (2018) Structure connectivity and substructure connectivity of $$k$$ -ary $$n$$-cube networks. Inf Sci 433:115\u2013124","journal-title":"Inf Sci"},{"key":"5054_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2020.10.017","volume":"849","author":"YL Wei","year":"2021","unstructured":"Wei YL, Xu M (2021) Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model. Theoret Comput Sci 849:163\u2013172","journal-title":"Theoret Comput Sci"},{"issue":"9","key":"5054_CR7","doi-asserted-by":"publisher","first-page":"2884","DOI":"10.1109\/TC.2015.2506562","volume":"65","author":"LC Ye","year":"2016","unstructured":"Ye LC, Liang JR, Lin HX (2016) A fast pessimistic diagnosis algorithm for hypercube-like networks under the comparison model. IEEE Trans Comput 65(9):2884\u20132888","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"5054_CR8","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1007\/s11227-020-03419-3","volume":"77","author":"Y Yang","year":"2021","unstructured":"Yang Y, Li X, Li J (2021) Structure fault tolerance of balanced hypercubes. J Supercomput 77(4):3885\u20133898","journal-title":"J Supercomput"},{"issue":"6","key":"5054_CR9","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"FP Preparata","year":"1967","unstructured":"Preparata FP, Metze G, Chien RT (1967) On the connection assignment problem of diagnosable systems. IEEE Trans Comput 16(6):848\u2013854","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"5054_CR10","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TDSC.2017.2726541","volume":"16","author":"L Lin","year":"2019","unstructured":"Lin L, Xu L, Chen R, Hsieh S-Y, Wang D (2019) Relating extra connectivity and extra conditional diagnosability in regular networks. IEEE Trans Dependable Secure Comput 16(6):1068\u20131097","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"7","key":"5054_CR11","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.1109\/TC.2013.64","volume":"63","author":"Q Zhu","year":"2014","unstructured":"Zhu Q, Guo GD, Wang DJ (2014) Relating diagnosability, strong diagnosability and conditional diagnosability of strong networks. IEEE Trans Comput 63(7):1847\u20131851","journal-title":"IEEE Trans Comput"},{"issue":"12","key":"5054_CR12","first-page":"366","volume":"225","author":"W Yang","year":"2013","unstructured":"Yang W, Lin H, Qin C (2013) On the $$t\/k$$-diagnosability of BC networks. Appl Math Comput 225(12):366\u2013371","journal-title":"Appl Math Comput"},{"issue":"10","key":"5054_CR13","doi-asserted-by":"publisher","first-page":"2540","DOI":"10.1109\/TC.2013.128","volume":"63","author":"W Yang","year":"2014","unstructured":"Yang W, Lin H (2014) Reliability evaluation of BC networks in terms of extra vertex- and edge-connectivity. IEEE Trans Comput 63(10):2540\u20132548","journal-title":"IEEE Trans Comput"},{"key":"5054_CR14","doi-asserted-by":"crossref","unstructured":"Dahbura AT, Masson GM (1984) An $$O(n^{2.5})$$ fault identification algorithm for diagnosable systems. IEEE Trans Comput 33(6):721\u2013732","DOI":"10.1109\/TC.1984.1676472"},{"issue":"6","key":"5054_CR15","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1002\/cpe.4358","volume":"30","author":"M Xie","year":"2018","unstructured":"Xie M, Ye L, Liang JR (2018) A $$t\/k$$ diagnosis algorithm on hypercube-like networks. Concurr Comput: Pract Experience 30(6):1683\u20131690","journal-title":"Concurr Comput: Pract Experience"},{"issue":"11","key":"5054_CR16","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/TC.1978.1674996","volume":"27","author":"G Meyer","year":"2006","unstructured":"Meyer G, Masson G (2006) An efficient fault diagnosis algorithm for symmetric multiple processor architecture. IEEE Trans Comput 27(11):1059\u20131063","journal-title":"IEEE Trans Comput"},{"key":"5054_CR17","doi-asserted-by":"crossref","unstructured":"Elhadef M, Ayeb B (2000) An evolutionary algorithm for identifying faults in $$t$$-diagnosable systems. In: Proceedings the IEEE Symposium on Reliable Distributed Systems, pp 74\u201383","DOI":"10.1109\/RELDI.2000.885395"},{"issue":"5","key":"5054_CR18","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1057\/jors.1996.82","volume":"47","author":"KS Al-sultan","year":"1996","unstructured":"Al-sultan KS, Hussain MF, Nizami JS (1996) A genetic algorithm for the set covering problem. J Oper Res Soc 47(5):702\u2013709","journal-title":"J Oper Res Soc"},{"key":"5054_CR19","doi-asserted-by":"crossref","unstructured":"Yotchon P, Jewajinda Y (2020) Hybrid multipopulation evolution based on genetic algorithm and regularized. In: 17th International Joint Conference on Computer Science and Software Engineering, pp 183\u2013187","DOI":"10.1109\/JCSSE49651.2020.9268416"},{"key":"5054_CR20","doi-asserted-by":"crossref","unstructured":"Ma X (2016) Intelligent tourism route optimization method on the improved genetic algorithm. In: 2016 International Conference on Smart Grid and Electrical Automation, pp 124\u2013127","DOI":"10.1109\/ICSGEA.2016.64"},{"key":"5054_CR21","doi-asserted-by":"crossref","unstructured":"Latif U, Javaid N, Zarin S et al (2018) Cost optimization in home energy management system using genetic algorithm, bat algorithm and hybrid bat genetic algorithm. In: 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications, pp 667\u2013677","DOI":"10.1109\/AINA.2018.00102"},{"key":"5054_CR22","doi-asserted-by":"crossref","unstructured":"Khair U, Lestari YD, Perdana A et al (2018) Genetic algorithm modification analysis of mutation operators in max one problem. In: 2018 3rd International Conference on Informatics and Computing, pp 22\u201325","DOI":"10.1109\/IAC.2018.8780463"},{"key":"5054_CR23","doi-asserted-by":"crossref","unstructured":"Wang J (2022) An improved genetic algorithm for web phishingdetection feature selection. In: 2022 Asia Conference on Algorithms, Computing and Machine Learning, pp 130\u2013134","DOI":"10.1109\/CACML55074.2022.00029"},{"issue":"1","key":"5054_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TLT.2012.22","volume":"6","author":"ML Nguen","year":"2013","unstructured":"Nguen ML, Hui S, Fong A (2013) Large-scal multiobjective static test generation for web-based testing with integer programming. IEEE Trans Learn Technol 6(1):46\u201359","journal-title":"IEEE Trans Learn Technol"},{"issue":"1","key":"5054_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E Balas","year":"1980","unstructured":"Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. Math Program 12(1):37\u201360","journal-title":"Math Program"},{"key":"5054_CR26","doi-asserted-by":"crossref","unstructured":"Borzabadi A. H, Alemy H (2015) Dual simplex method for solving fully fuzzy linear programming problems. In: 4th Iranian Joint Congress on Fuzzy and Intelligent Systems, pp 10\u201313","DOI":"10.1109\/CFIS.2015.7391653"},{"key":"5054_CR27","doi-asserted-by":"crossref","unstructured":"Gu S, Chen X (2020) The basic algorithm for zero-one unconstrained quadratic programming problem with k-diagonal matrix. In: 12th International Conference on Advanced Computational Intelligence, pp 14\u201316","DOI":"10.1109\/ICACI49185.2020.9177717"},{"issue":"4","key":"5054_CR28","first-page":"640","volume":"38","author":"H Xuan","year":"2016","unstructured":"Xuan H, Miao C, Zhao D (2016) System-level fault diagnosis based on bat algorithm. Comput Eng Sci 38(4):640\u2013647","journal-title":"Comput Eng Sci"},{"key":"5054_CR29","doi-asserted-by":"crossref","unstructured":"Falcon R, Almeida M, Nayak A (2010) A binary particle swarm optimization approach to fault diagnosis in parallel and distributed systems. In: IEEE Congress on Evolutionary Computation, pp 1\u20138","DOI":"10.1109\/CEC.2010.5586002"},{"issue":"3","key":"5054_CR30","first-page":"226","volume":"53","author":"H Xuan","year":"2017","unstructured":"Xuan H, Zhao D, Miao C, Zhang R, Liu T (2017) MWOFD algorithm based on PMC model. Comput Eng Appl 53(3):226\u2013230","journal-title":"Comput Eng Appl"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05054-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05054-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05054-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T22:06:36Z","timestamp":1682373996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05054-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,24]]},"references-count":30,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["5054"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05054-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,24]]},"assertion":[{"value":"5 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}