{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:08:12Z","timestamp":1740103692169,"version":"3.37.3"},"reference-count":18,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T00:00:00Z","timestamp":1595808000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2018YFB1700403","2018FY10090002","61872388"],"award-info":[{"award-number":["2018YFB1700403","2018FY10090002","61872388"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Natural Science and Technology Fundamental Resources Investigation Program of China","award":["2018YFB1700403","2018FY10090002","61872388"],"award-info":[{"award-number":["2018YFB1700403","2018FY10090002","61872388"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2018YFB1700403","2018FY10090002","61872388"],"award-info":[{"award-number":["2018YFB1700403","2018FY10090002","61872388"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,7,27]]},"abstract":"<jats:p>The so-called learned sorting, which was first proposed by Google, achieves data sorting by predicting the placement positions of unsorted data elements in a sorted sequence based on machine learning models. Learned sorting pioneers a new generation of sorting algorithms and shows a great potential because of a theoretical time complexity <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mi>O<\/mml:mi><mml:mfenced open=\"(\" close=\")\" separators=\"|\"><mml:mrow><mml:mi>N<\/mml:mi><\/mml:mrow><\/mml:mfenced><\/mml:math> and easy access to hardware-driven accelerating approaches. However, learned sorting has two problems: controlling the monotonicity and boundedness of the predicted placement positions and dealing with placement conflicts of repetitive elements. In this paper, a new learned sorting algorithm named LS is proposed. We integrate a back propagation neural network with the technique of look-up-table in LS to guarantee the monotonicity and boundedness of the predicted placement positions. We design a data structure called the self-regulating index in LS to tentatively store and duly update placement positions for eliminating potential placement conflicts. Results of three controlled experiments demonstrate that LS can effectively control the monotonicity and boundedness, achieve a better time consumption than quick sort and Google\u2019s learned sorting, and present an excellent stability when the data size or the number of repetitive elements increases.<\/jats:p>","DOI":"10.1155\/2020\/4793545","type":"journal-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T23:34:31Z","timestamp":1595892871000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Sorting Data via a Look-Up-Table Neural Network and Self-Regulating Index"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4200-5200","authenticated-orcid":true,"given":"Ying","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"},{"name":"Rail Data Research and Application Key Laboratory of Hunan Province, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongli","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxia","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zitong","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Automation, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-1026","authenticated-orcid":true,"given":"Chao","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Systems Engineering, Academy of Military Sciences, People\u2019s Liberation Army, Beijing 100000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4760-0551","authenticated-orcid":true,"given":"Fangfang","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"doi-asserted-by":"publisher","key":"1","DOI":"10.14778\/2735479.2735481"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1016\/j.ejor.2017.07.005"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/mm.2008.31"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.3390\/sym9090176"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1007\/978-3-662-48683-2_20"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/access.2019.2920917"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1145\/227717.227725"},{"year":"2009","key":"17"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/tvcg.2019.2934655"},{"doi-asserted-by":"publisher","key":"19","DOI":"10.1007\/s12650-018-0530-2"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1002\/cplx.21807"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1002\/cplx.21715"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1002\/cplx.21826"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1007\/s00521-014-1550-z"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1038\/nature14539"},{"doi-asserted-by":"publisher","key":"31","DOI":"10.1109\/12.863045"},{"doi-asserted-by":"publisher","key":"32","DOI":"10.1109\/2.485891"},{"doi-asserted-by":"publisher","key":"33","DOI":"10.1023\/a:1007618119488"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4793545.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4793545.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/4793545.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T23:34:35Z","timestamp":1595892875000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/4793545\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,27]]},"references-count":18,"alternative-id":["4793545","4793545"],"URL":"https:\/\/doi.org\/10.1155\/2020\/4793545","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,7,27]]}}}