{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:07:23Z","timestamp":1746245243115,"version":"3.40.4"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"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":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-024-19548-3","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T04:01:30Z","timestamp":1718078490000},"page":"13445-13468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Implementation and testing of parallel PSO to attain speedup on general purpose computer systems"],"prefix":"10.1007","volume":"84","author":[{"given":"Lalit","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manish","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitul Kumar","family":"Ahirwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"issue":"3","key":"19548_CR1","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization- Overview and conceptual comparison. ACM Comput Surv (CSUR) 35(3):268\u2013308. https:\/\/doi.org\/10.1145\/937503.937505","journal-title":"ACM Comput Surv (CSUR)"},{"key":"19548_CR2","unstructured":"Glover FW, Kochenberger GA (eds) (2006) Handbook of metaheuristics, vol 57. Springer Science & Business Media"},{"key":"19548_CR3","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Academic Press, London, UK"},{"key":"19548_CR4","volume-title":"Fundamentals of computational swarm intelligence","author":"AP Engelbrecht","year":"2005","unstructured":"Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Hoboken, NJ, USA"},{"key":"19548_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-405163-8.00001-6","volume-title":"Swarm intelligence and bio-inspired computation: theory and applications","author":"XS Yang","year":"2013","unstructured":"Yang XS, Cui ZH, Gandom AH, Karamanoglu M (2013) Swarm intelligence and bio-inspired computation: theory and applications. Elsevier, London, UK"},{"key":"19548_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jocs.2020.101104","volume":"46","author":"XS Yang","year":"2020","unstructured":"Yang XS (2020) Nature-inspired optimization algorithms- challenges and open problems. J Comput Sci 46:101\u2013104","journal-title":"J Comput Sci"},{"key":"19548_CR7","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In Proceedings of ICNN'95-international conference on neural networks, vol 4. pp 1942\u20131948,\u00a0ieee","DOI":"10.1109\/ICNN.1995.488968"},{"key":"19548_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella L (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"19548_CR9","doi-asserted-by":"publisher","unstructured":"Kumar L, Bharti KK (2019) A novel hybrid BPSO\u2013SCA approach for feature selection. Nat Comput 1\u201323. https:\/\/doi.org\/10.1007\/s11047-019-09769-z","DOI":"10.1007\/s11047-019-09769-z"},{"issue":"5","key":"19548_CR10","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/ett.1062","volume":"16","author":"GD Caro","year":"2005","unstructured":"Caro GD, Ducatelle F, Gambardella LM (2005) AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443\u2013455. https:\/\/doi.org\/10.1002\/ett.1062","journal-title":"Eur Trans Telecommun"},{"key":"19548_CR11","unstructured":"Fister Jr I, Yang XS, Fister I, Brest J, Fister D (2013) A brief review of nature-inspired algorithms for optimization. arXiv preprint arXiv:1307.4186"},{"key":"19548_CR12","doi-asserted-by":"crossref","unstructured":"Yang XS (2005) Engineering optimizations via nature-inspired virtual bee algorithms. International Work-Conference on the Interplay between Natural and Artificial Computation. Springer, Berlin, Heidelberg, pp. 317\u2013323","DOI":"10.1007\/11499305_33"},{"key":"19548_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2016.04.018","volume":"59","author":"AK Kar","year":"2016","unstructured":"Kar AK (2016) Bio inspired computing\u2013a review of algorithms and scope of applications. Expert Syst Appl 59:20\u201332. https:\/\/doi.org\/10.1016\/j.eswa.2016.04.018","journal-title":"Expert Syst Appl"},{"key":"19548_CR14","doi-asserted-by":"crossref","unstructured":"Alba E (2005) Parallel metaheuristics: a new class of algorithms. John Wiley & Sons","DOI":"10.1002\/0471739383"},{"issue":"2","key":"19548_CR15","first-page":"141","volume":"10","author":"E Cant\u00fa-Paz","year":"1998","unstructured":"Cant\u00fa-Paz E (1998) A survey of parallel genetic algorithms. Calculateurs paralleles, reseaux et systems repartis 10(2):141\u2013171","journal-title":"Calculateurs paralleles, reseaux et systems repartis"},{"key":"19548_CR16","doi-asserted-by":"crossref","unstructured":"Gies D, Rahmat-Samii Y (2003) Reconfigurable array design using parallel particle swarm optimization. In: IEEE Antennas and Propagation Society International Symposium. Digest. Held in conjunction with: USNC\/CNC\/URSI North American Radio Sci. Meeting (Cat. No. 03CH37450) vol. 1, pp 177\u2013180. IEEE","DOI":"10.1109\/APS.2003.1217429"},{"key":"19548_CR17","doi-asserted-by":"publisher","unstructured":"Schutte JF, Reinbolt JA, Fregly BJ, Haftka RT, George AD (2004) Parallel global optimization with the particle swarm algorithm. Int J Numer Methods Eng 61.13:2296\u20132315. https:\/\/doi.org\/10.1002\/nme.1149","DOI":"10.1002\/nme.1149"},{"issue":"8","key":"19548_CR18","doi-asserted-by":"publisher","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181\u20135197. https:\/\/doi.org\/10.1016\/j.asoc.2011.05.042","journal-title":"Appl Soft Comput"},{"key":"19548_CR19","doi-asserted-by":"crossref","unstructured":"Aljarah I, Ludwig, SA (2012) Parallel particle swarm optimization clustering algorithm based on mapreduce methodology. In: 2012 fourth world congress on nature and biologically inspired computing (NaBIC) pp 104\u2013111. IEEE","DOI":"10.1109\/NaBIC.2012.6402247"},{"key":"19548_CR20","doi-asserted-by":"publisher","unstructured":"Khoshahval F, Zolfaghari A, Minuchehr H, Abbasi MR (2014) A new hybrid method for multi-objective fuel management optimization using parallel PSO-SA. Prog Nucl Energy 76:112\u2013121. https:\/\/doi.org\/10.1016\/j.pnucene.2014.05.014","DOI":"10.1016\/j.pnucene.2014.05.014"},{"key":"19548_CR21","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.compfluid.2014.05.020","volume":"110","author":"A Ouyang","year":"2015","unstructured":"Ouyang A, Tang Z, Zhou X, Xu Y, Pan G, Li K (2015) Parallel hybrid pso with cuda for ld heat conduction equation. Comput Fluids 110:198\u2013210. https:\/\/doi.org\/10.1016\/j.compfluid.2014.05.020","journal-title":"Comput Fluids"},{"issue":"4","key":"19548_CR22","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/S0141-0296(96)00076-4","volume":"19","author":"G Thierauf","year":"1997","unstructured":"Thierauf G, Cai J (1997) Parallel evolution strategy for solving structural optimization. Eng Struc 19(4):318\u2013324","journal-title":"Eng Struc"},{"key":"19548_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.jpdc.2016.04.014","volume":"98","author":"R Skinderowicz","year":"2016","unstructured":"Skinderowicz R (2016) The GPU-based parallel ant colony system. J Parallel Distrib Comput 98:48\u201360. https:\/\/doi.org\/10.1016\/j.jpdc.2016.04.014","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"19548_CR24","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. EEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"19548_CR25","unstructured":"Wilt N (2013) The cuda handbook: a comprehensive guide to gpu programming. Pearson Education"},{"issue":"1","key":"19548_CR26","first-page":"10","volume":"5","author":"Y Ortakci","year":"2017","unstructured":"Ortakci Y (2017) Parallel particle swarm optimization in data clustering. Int J Soft Comput Artif Intell (IJSCAI) 5(1):10\u201314","journal-title":"Int J Soft Comput Artif Intell (IJSCAI)"},{"key":"19548_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.patrec.2018.10.015","volume":"116","author":"F Yan","year":"2018","unstructured":"Yan F (2018) Autonomous vehicle routing problem solution based on artificial potential field with parallel ant colony optimization (ACO) algorithm. Pattern Recogn Lett 116:195\u2013199","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"19548_CR28","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1007\/s13369-018-03713-6","volume":"44","author":"S Lalwani","year":"2019","unstructured":"Lalwani S, Sharma H, Satapathy SC, Deep K, Bansal JC (2019) A survey on parallel particle swarm optimization algorithms. Arab J Sci Eng 44(4):2899\u20132923. https:\/\/doi.org\/10.1007\/s13369-018-03713-6","journal-title":"Arab J Sci Eng"},{"key":"19548_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.01.011","author":"R Skinderowicz","year":"2020","unstructured":"Skinderowicz R (2020) Implementing a GPU-based parallel MAX-MIN ant system. Futur Gener Comput Syst. https:\/\/doi.org\/10.1016\/j.future.2020.01.011","journal-title":"Futur Gener Comput Syst"},{"issue":"6","key":"19548_CR30","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1007\/s42979-023-02227-9","volume":"4","author":"V Charilogis","year":"2023","unstructured":"Charilogis V, Tsoulos IG, Tzallas A (2023) An improved parallel particle swarm optimization. SN Comput Sci 4(6):766","journal-title":"SN Comput Sci"},{"issue":"21","key":"19548_CR31","doi-asserted-by":"publisher","first-page":"31947","DOI":"10.1007\/s11042-023-14444-8","volume":"82","author":"M Yassami","year":"2023","unstructured":"Yassami M, Ashtari P (2023) A novel hybrid optimization algorithm: dynamic hybrid optimization algorithm. Multimed Tools Applic 82(21):31947\u201331979","journal-title":"Multimed Tools Applic"},{"key":"19548_CR32","doi-asserted-by":"publisher","first-page":"110329","DOI":"10.1016\/j.asoc.2023.110329","volume":"142","author":"L Kumar","year":"2023","unstructured":"Kumar L, Pandey M, Ahirwal MK (2023) Parallel global best-worst particle swarm optimization algorithm for solving optimization problems. Appl Soft Comput 142:110329","journal-title":"Appl Soft Comput"},{"key":"19548_CR33","doi-asserted-by":"publisher","unstructured":"Branke J, Kau\u00dfler T, Smidt C, Schmeck H (2000) A multi-population approach to dynamic optimization problems. Evol Des Manuf 299\u2013307 Springer, London. https:\/\/doi.org\/10.1007\/978-1-4471-0519-0_24","DOI":"10.1007\/978-1-4471-0519-0_24"},{"key":"19548_CR34","doi-asserted-by":"publisher","unstructured":"Blackwell T, Branke, J (2004) Multi-swarm optimization in dynamic environments. Workshops on Applications of Evolutionary Computation 489\u2013500 Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-24653-4_50","DOI":"10.1007\/978-3-540-24653-4_50"},{"key":"19548_CR35","doi-asserted-by":"publisher","first-page":"300","DOI":"10.4028\/www.scientific.net\/AMM.667.300","volume":"667","author":"GP Zeng","year":"2014","unstructured":"Zeng GP, Fan HL (2014) Two-subpopulation particle swarm optimization based on pheromone diffusion. Appl Mech Mater 667:300\u2013308","journal-title":"Appl Mech Mater"},{"key":"19548_CR36","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compeleceng.2017.01.025","volume":"58","author":"DV Medhane","year":"2017","unstructured":"Medhane DV, Sangaiah AK (2017) Search space-based multi-objective optimization evolutionary algorithm. Comput Electr Eng 58:126\u2013143. https:\/\/doi.org\/10.1016\/j.compeleceng.2017.01.025","journal-title":"Comput Electr Eng"},{"key":"19548_CR37","doi-asserted-by":"publisher","first-page":"108731","DOI":"10.1016\/j.asoc.2022.108731","volume":"121","author":"T Li","year":"2022","unstructured":"Li T, Shi J, Deng W, Hu Z (2022) Pyramid particle swarm optimization with novel strategies of competition and cooperation. Appl Soft Comput 121:108731","journal-title":"Appl Soft Comput"},{"issue":"1","key":"19548_CR38","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1527\/tjsai.23.27","volume":"3","author":"KJ Binkley","year":"2008","unstructured":"Binkley KJ, Hagiwara M (2008) Balancing exploitation and exploration in particle swarm optimization: velocity-based reinitialization. Inf Media Technol 3(1):103\u2013111. https:\/\/doi.org\/10.1527\/tjsai.23.27","journal-title":"Inf Media Technol"},{"key":"19548_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.12.004","volume":"11","author":"BO Arani","year":"2013","unstructured":"Arani BO, Mirzabeygi P, Panahi MS (2013) An improved PSO algorithm with a territorial diversity-preserving scheme and enhanced exploration\u2013exploitation balance. Swarm Evol Comput 11:1\u201315. https:\/\/doi.org\/10.1016\/j.swevo.2012.12.004","journal-title":"Swarm Evol Comput"},{"key":"19548_CR40","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.asoc.2017.04.050","volume":"59","author":"MJ Islam","year":"2017","unstructured":"Islam MJ, Li X, Mei Y (2017) A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO. Appl Soft Comput 59:182\u2013196. https:\/\/doi.org\/10.1016\/j.asoc.2017.04.050","journal-title":"Appl Soft Comput"},{"issue":"18","key":"19548_CR41","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.ifacol.2018.09.311","volume":"51","author":"L Hongru","year":"2018","unstructured":"Hongru L, Jinxing H, Shouyong J (2018) A hybrid PSO based on dynamic clustering for global optimization. IFAC-PapersOnLine 51(18):269\u2013274. https:\/\/doi.org\/10.1016\/j.ifacol.2018.09.311","journal-title":"IFAC-PapersOnLine"},{"key":"19548_CR42","doi-asserted-by":"publisher","unstructured":"Lv X, Wang Y, Deng J, Zhang G, Zhang L (2018) Improved particle swarm optimization algorithm based on last-eliminated principle and enhanced information sharing. Comput Intell Neurosci 5025672. https:\/\/doi.org\/10.1155\/2018\/5025672","DOI":"10.1155\/2018\/5025672"},{"key":"19548_CR43","doi-asserted-by":"publisher","unstructured":"\u00c7omak E (2019) A particle swarm optimizer with modified velocity update and adaptive diversity regulation. Expert Syst 36(1):e12330. https:\/\/doi.org\/10.1111\/exsy.12330","DOI":"10.1111\/exsy.12330"},{"key":"19548_CR44","doi-asserted-by":"publisher","first-page":"105404","DOI":"10.1016\/j.knosys.2019.105404","volume":"193","author":"D Pelusi","year":"2020","unstructured":"Pelusi D, Mascella R, Tallini L, Nayak J, Naik B, Deng Y (2020) Improving exploration and exploitation via a Hyperbolic Gravitational Search Algorithm. Knowl-Based Syst 193:105404. https:\/\/doi.org\/10.1016\/j.knosys.2019.105404","journal-title":"Knowl-Based Syst"},{"key":"19548_CR45","doi-asserted-by":"publisher","first-page":"106605","DOI":"10.1016\/j.compeleceng.2020.106605","volume":"84","author":"AM Pereira","year":"2020","unstructured":"Pereira AM, Vieira T, Costa EB (2020) Balancing exploration and exploitation- An image-based approach to item retrieval with enhanced diversity. Comput Electr Eng 84:106605. https:\/\/doi.org\/10.1016\/j.compeleceng.2020.106605","journal-title":"Comput Electr Eng"},{"key":"19548_CR46","doi-asserted-by":"publisher","unstructured":"Ren M, Huang X, Zhu X, Shao, L (2020) Optimized PSO algorithm based on the simplicial algorithm of fixed-point theory. Appl Intell 1\u201316. https:\/\/doi.org\/10.1007\/s10489-020-01630-6","DOI":"10.1007\/s10489-020-01630-6"},{"issue":"5","key":"19548_CR47","doi-asserted-by":"publisher","first-page":"4099","DOI":"10.1007\/s00521-022-07854-6","volume":"35","author":"JO Agushaka","year":"2023","unstructured":"Agushaka JO, Ezugwu AE, Abualigah L (2023) Gazelle optimization algorithm: a novel nature-inspired metaheuristic optimizer. Neural Comput Appl 35(5):4099\u20134131","journal-title":"Neural Comput Appl"},{"key":"19548_CR48","doi-asserted-by":"publisher","first-page":"101248","DOI":"10.1016\/j.swevo.2023.101248","volume":"77","author":"Z Ma","year":"2023","unstructured":"Ma Z, Wu G, Suganthan PN, Song A, Luo Q (2023) Performance assessment and exhaustive listing of 500+ nature-inspired metaheuristic algorithms. Swarm Evol Comput 77:101248","journal-title":"Swarm Evol Comput"},{"key":"19548_CR49","unstructured":"Ardeh, MA (2016) BenchmarkFcns Toolbox: a collection of benchmark functions for optimization"},{"issue":"2","key":"19548_CR50","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","volume":"4","author":"J Momin","year":"2013","unstructured":"Momin J, Yang XS (2013) A literature survey of benchmark functions for global optimization problems. J Mathe Modell Numer Optim 4(2):150\u2013194. https:\/\/doi.org\/10.1504\/IJMMNO.2013.055204","journal-title":"J Mathe Modell Numer Optim"},{"issue":"1","key":"19548_CR51","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/88.481664","volume":"4","author":"S Sahni","year":"1996","unstructured":"Sahni S, Thanvantri V (1996) Parallel computing: performance metrics and models. IEEE Parallel Distrib Technol 4(1):43\u201356","journal-title":"IEEE Parallel Distrib Technol"},{"issue":"13\u201314","key":"19548_CR52","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1016\/S0167-8191(99)00073-3","volume":"25","author":"P Cremonesi","year":"1999","unstructured":"Cremonesi P, Rosti E, Serazzi G, Smirni E (1999) Performance evaluation of parallel systems. Parallel Comput 25(13\u201314):1677\u20131698. https:\/\/doi.org\/10.1016\/S0167-8191(99)00073-3","journal-title":"Parallel Comput"},{"key":"19548_CR53","doi-asserted-by":"crossref","unstructured":"Amdahl GM (1967) Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18-20, 1967, spring joint computer conference, pp 483\u2013485","DOI":"10.1145\/1465482.1465560"},{"key":"19548_CR54","unstructured":"J\u00e9J\u00e9 J (1992) An introduction to parallel algorithms. Addison-Wesley, Reading, MA, 10, p. 133889"},{"key":"19548_CR55","unstructured":"Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing. Benjamin\/Cummings, Redwood City, CA Vol. 110"},{"issue":"200","key":"19548_CR56","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"issue":"205","key":"19548_CR57","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2279372","volume":"34","author":"F Milton","year":"1939","unstructured":"Milton F (1939) A correction: the use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 34(205):109. https:\/\/doi.org\/10.2307\/2279372","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"19548_CR58","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86\u201392. https:\/\/doi.org\/10.1214\/aoms\/1177731944","journal-title":"Ann Math Stat"},{"key":"19548_CR59","first-page":"209","volume":"87","author":"J L\u00fcroth","year":"1876","unstructured":"L\u00fcroth J (1876) Comparison of two values of the probable error. Astron News 87:209","journal-title":"Astron News"},{"key":"19548_CR60","doi-asserted-by":"publisher","unstructured":"Pfanzagl J, Sheynin, O (1996) Studies in the history of probability and statistics XLIV A forerunner of the t-distribution. Biometrika 891\u2013898. https:\/\/doi.org\/10.1093\/biomet\/83.4.891","DOI":"10.1093\/biomet\/83.4.891"},{"issue":"1","key":"19548_CR61","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF00374700","volume":"49","author":"O Sheynin","year":"1995","unstructured":"Sheynin O (1995) Helmert\u2019s work in the theory of errors. Arch Hist Exact Sci 49(1):73\u2013104","journal-title":"Arch Hist Exact Sci"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-19548-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-024-19548-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-19548-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T13:34:02Z","timestamp":1746192842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-024-19548-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,11]]},"references-count":61,"journal-issue":{"issue":"14","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["19548"],"URL":"https:\/\/doi.org\/10.1007\/s11042-024-19548-3","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2024,6,11]]},"assertion":[{"value":"24 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}