{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:18:48Z","timestamp":1771003128446,"version":"3.50.1"},"reference-count":22,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>Pattern design has a wide range of applications in daily life, such as decoration design, web design, and so on. Common design methods include artificial design and intelligent design, and design methods based on intelligent technology tend to have higher efficiency. In order to make the generation of plane pattern intelligent design more convenient and fast, a pattern design generation method based on Reversible Jump Markov Chain Monte Carlo (RJMCMC) algorithm was proposed, and the correlation was carried out. At the same time, the same type of genetic algorithm (GA) and ant colony algorithm (AC) were introduced for performance comparison and verification. The research results show that the maximum pattern sampling accuracy of the RJMCMC algorithm is about 0.972, and the AUC value corresponding to the ROC curve is about 0.936, which are higher than other algorithms. In the algorithm iteration process, the iterative efficiency of the RJMCMC algorithm is also higher than the other two algorithms. At the same time, in the same pattern sampling processing time, the sampling number of RJMCMC algorithm is significantly higher than the other two algorithms. In the comparison of the loss value curve, the RJMCMC algorithm shows a better fitting effect, and its loss value is lower than the other two algorithms after iteration. In addition, after iteration, the error of RJMCMC algorithm is also smaller than the other two algorithms. Comprehensive analysis shows that the RJMCMC algorithm has excellent performance in pattern sampling, which can provide great help for the design and generation of plane patterns.<\/jats:p>","DOI":"10.1177\/14727978251321731","type":"journal-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T02:54:27Z","timestamp":1741748067000},"page":"752-765","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Intelligent design generation of plane pattern based on RJMCMC algorithm"],"prefix":"10.1177","volume":"25","author":[{"given":"Xiaoyun","family":"Shi","sequence":"first","affiliation":[{"name":"Chuzhou Polytechnic"}]}],"member":"179","published-online":{"date-parts":[[2025,3,11]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ergon.2018.09.003"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1111\/cote.12483"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00024-020-02436-w"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/sim.8511"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ipr.2020.0709"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2878543"},{"issue":"2","key":"e_1_3_2_8_2","first-page":"465","article-title":"An RJMCMC-Based method for tracking and resolving collisions of drosophila larvae","volume":"16","author":"Michels T","year":"2019","unstructured":"Michels T, Berh D, Jiang X. An RJMCMC-Based method for tracking and resolving collisions of drosophila larvae. IEEE ACM T Comput Bi 2019; 16(2): 465\u2013474.","journal-title":"IEEE ACM T Comput Bi"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417856"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystemseng.2020.07.004"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2878322"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2018.06.007"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3016964"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/env.2615"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2281"},{"issue":"99","key":"e_1_3_2_16_2","first-page":"1","article-title":"Retrieval of canopy gap fraction from terrestrial laser scanning data based on the Monte Carlo method","volume":"19","author":"Xu Y","year":"2021","unstructured":"Xu Y, Li S, You H, et al. Retrieval of canopy gap fraction from terrestrial laser scanning data based on the Monte Carlo method. IEEE Geosci Remote S 2021; 19(99): 1\u20135.","journal-title":"IEEE Geosci Remote S"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2021.07.020"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2999568"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3058425"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.100.053309"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2910389"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42952-020-00059-4"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106998"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251321731","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14727978251321731","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251321731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:31:30Z","timestamp":1771000290000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14727978251321731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1177\/14727978251321731"],"URL":"https:\/\/doi.org\/10.1177\/14727978251321731","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}