{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:03:57Z","timestamp":1783184637257,"version":"3.54.6"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lcomm.2019.2899603","type":"journal-article","created":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T19:38:32Z","timestamp":1550259512000},"page":"584-587","source":"Crossref","is-referenced-by-count":33,"title":["Round Trip Time Prediction Using Recurrent Neural Networks With Minimal Gated Unit"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0470-2491","authenticated-orcid":false,"given":"Ai","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6452-9999","authenticated-orcid":false,"given":"Zhijiang","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8981-6863","authenticated-orcid":false,"given":"Zhiyuan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/72.279181"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.06.042"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2582924"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-016-1006-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1994.8753425"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2007.12.036"},{"key":"ref18","first-page":"1764","article-title":"Towards end-to-end speech recognition with recurrent neural networks","author":"graves","year":"2014","journal-title":"Proc Int Conf Int Conf Mach Learn (ICML)"},{"key":"ref19","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","author":"sutskever","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CIRA.2001.1013203"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2782722"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1126\/science.1127647","article-title":"Reducing the dimensionality of data with neural networks","volume":"313","author":"hinton","year":"2006","journal-title":"Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.013114.132668"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-006-0042-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050335"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2816917"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4304\/jnw.4.6.528-535"},{"key":"ref20","first-page":"2085","article-title":"Phrase-based image captioning","author":"lebret","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref22","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2013.6761245"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8685247\/08642942.pdf?arnumber=8642942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:47:24Z","timestamp":1657745244000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8642942\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":22,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2019.2899603","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"value":"1089-7798","type":"print"},{"value":"1558-2558","type":"electronic"},{"value":"2373-7891","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}