[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_f35e085e-7029-4b30-978f-9dccfbcd7231":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:f35e085e-7029-4b30-978f-9dccfbcd7231,\"}":952},{"meta":4,"data":6},{"total":5},"117",[7,56,246,295,379,474,535,646,710,744],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":25,"verifyStatus":26,"verifyTime":27,"verifyNote":28,"languages":29,"translateLanguages":28,"viewCount":32,"subjectFields":33,"manageAffiliations":34,"indexDatabases":35,"url":36,"thumbnailPath":28,"statistic":28,"gsStatistic":37,"type":55,"analyzePriority":28},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":14,"issn":16,"title":18,"introduce":21,"gsId":23},{"VOID":15},"VN",{"VOID":17},"08667535",{"EN":19,"VI":20},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":22},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":24},"MS2_GJQAAAAJ","PUBLISHER","VERIFIED","2025-10-27T06:27:25.058+00:00",null,[30,31],"VI","EN",0,[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":38,"totalPublicationByYear":39,"totalCitation":43,"totalCitationByYear":44,"totalCitationPerPublication":52,"totalCitationPerPublicationByYear":53,"hindexLast5Year":42,"hindex":42},483,{"0":40,"2020":40,"2021":40,"2022":40,"2024":40,"2025":41,"2026":42},1,475,3,117,{"2017":40,"2018":40,"2019":45,"2020":46,"2021":46,"2022":47,"2023":48,"2024":49,"2025":50,"2026":51},4,5,11,6,7,53,15,0.24,{"2020":46,"2021":46,"2022":47,"2024":49,"2025":54,"2026":46},0.11,"JOURNAL",{"id":57,"createTime":58,"updateTime":10,"relativeEntities":59,"slug":60,"properties":61,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":70,"manageAffiliations":71,"indexDatabases":84,"url":101,"thumbnailPath":28,"statistic":102,"gsStatistic":195,"type":55,"analyzePriority":28},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":62,"issn":63,"title":65,"gsId":67},{"VOID":15},{"VOID":64},"08667136",{"EN":66},"Vietnam Journal of Mechanics",{"VOID":68},"B98qpzgAAAAJ",29,[],[72],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":74,"slug":28,"properties":75,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":83,"statistic":28},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":76,"country":79,"abbreviation":80},{"EN":77,"VI":78},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":15},{"VOID":81},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[85],{"id":86,"indexDatabase":87,"url":97,"indexYears":98,"academicFieldIds":99,"indexDatabaseRanking":28},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":89,"label":90,"description":92,"key":94,"publicationTags":95,"standard":28},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":91,"VI":91},"ACI - Asean Citation Index",{"EN":93,"VI":93},"Cơ sở dữ liệu ACI","aci",[96],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[100],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":32,"impactFactorByYear":103,"i10Index":122,"i10IndexLast5Year":123,"totalPublication":124,"totalPublicationByYear":125,"totalCitation":143,"totalCitationByYear":144,"totalCitationPerPublication":163,"totalCitationPerPublicationByYear":164,"hindexLast5Year":146,"hindex":146},{"1994":104,"1995":105,"1997":54,"1998":106,"1999":105,"2000":107,"2001":108,"2002":107,"2003":107,"2004":109,"2005":110,"2006":111,"2007":105,"2008":110,"2010":112,"2011":113,"2012":114,"2013":115,"2014":105,"2015":116,"2016":111,"2017":116,"2018":117,"2019":109,"2020":118,"2021":119,"2022":115,"2023":120,"2024":121},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":126,"1980":127,"1981":128,"1982":129,"1983":51,"1984":129,"1985":130,"1986":128,"1987":51,"1988":51,"1989":122,"1990":128,"1991":129,"1992":128,"1993":131,"1994":132,"1995":133,"1996":133,"1997":132,"1998":131,"1999":128,"2000":122,"2001":134,"2002":130,"2003":135,"2004":122,"2005":136,"2006":133,"2007":137,"2008":138,"2009":131,"2010":134,"2011":47,"2012":139,"2013":131,"2014":134,"2015":131,"2016":135,"2017":140,"2018":132,"2019":131,"2020":141,"2021":122,"2022":142,"2023":130,"2024":123},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":40,"1982":40,"1983":40,"1991":132,"1992":45,"1993":48,"1994":49,"1995":145,"1996":146,"1997":134,"1998":140,"1999":47,"2000":136,"2001":127,"2002":128,"2003":147,"2004":148,"2005":131,"2006":149,"2007":150,"2008":151,"2009":152,"2010":153,"2011":154,"2012":155,"2013":156,"2014":152,"2015":157,"2016":158,"2017":138,"2018":159,"2019":160,"2020":159,"2021":161,"2022":162,"2023":45},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":165,"1982":106,"1983":112,"1991":166,"1992":167,"1993":52,"1994":168,"1995":169,"1996":170,"1997":171,"1998":172,"1999":119,"2000":172,"2001":173,"2002":174,"2003":175,"2004":176,"2005":172,"2006":177,"2007":178,"2008":179,"2009":180,"2010":181,"2011":182,"2012":183,"2013":184,"2014":185,"2015":186,"2016":187,"2017":188,"2018":189,"2019":190,"2020":191,"2021":192,"2022":193,"2023":194},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":28,"impactFactorByYear":28,"i10Index":196,"i10IndexLast5Year":128,"totalPublication":197,"totalPublicationByYear":198,"totalCitation":203,"totalCitationByYear":204,"totalCitationPerPublication":219,"totalCitationPerPublicationByYear":220,"hindexLast5Year":126,"hindex":199},42,1244,{"0":147,"1979":146,"1980":127,"1981":127,"1982":199,"1983":199,"1984":129,"1985":129,"1986":128,"1987":129,"1988":51,"1989":140,"1990":127,"1991":129,"1992":129,"1993":133,"1994":147,"1995":132,"1996":69,"1997":132,"1998":131,"1999":134,"2000":140,"2001":131,"2002":134,"2003":131,"2004":133,"2005":132,"2006":131,"2007":200,"2008":138,"2009":140,"2010":132,"2011":122,"2012":201,"2013":132,"2014":140,"2015":148,"2016":122,"2017":202,"2018":69,"2019":140,"2020":69,"2021":132,"2022":139,"2023":130,"2024":133,"2025":131,"2026":138},16,47,41,32,2194,{"1997":126,"1998":205,"1999":126,"2000":145,"2001":145,"2002":126,"2003":205,"2004":127,"2005":129,"2006":146,"2007":132,"2008":136,"2009":47,"2010":131,"2011":138,"2012":206,"2013":207,"2014":208,"2015":162,"2016":209,"2017":209,"2018":210,"2019":211,"2020":212,"2021":213,"2022":214,"2023":215,"2024":216,"2025":217,"2026":218},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":221,"1998":222,"1999":223,"2000":224,"2001":118,"2002":223,"2003":222,"2004":225,"2005":226,"2006":115,"2007":227,"2008":228,"2009":229,"2010":230,"2011":231,"2012":232,"2013":233,"2014":234,"2015":235,"2016":236,"2017":237,"2018":238,"2019":239,"2020":240,"2021":48,"2022":241,"2023":242,"2024":243,"2025":244,"2026":245},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":247,"createTime":248,"updateTime":10,"relativeEntities":249,"slug":250,"properties":251,"entityType":25,"verifyStatus":26,"verifyTime":261,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":147,"subjectFields":262,"manageAffiliations":263,"indexDatabases":264,"url":273,"thumbnailPath":28,"statistic":274,"gsStatistic":290,"type":55,"analyzePriority":28},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":252,"eissn":253,"issn":255,"title":257,"gsId":259},{"VOID":15},{"VOID":254},"25881132",{"VOID":256},"26159309",{"EN":258},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":260},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[265],{"id":266,"indexDatabase":267,"url":272,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":268,"label":269,"description":270,"key":94,"publicationTags":271,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":32,"impactFactorByYear":275,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":276,"totalPublicationByYear":277,"totalCitation":282,"totalCitationByYear":283,"totalCitationPerPublication":284,"totalCitationPerPublicationByYear":285,"hindexLast5Year":45,"hindex":45},{"2019":106,"2020":110,"2021":104,"2022":104,"2023":109,"2024":108},360,{"2016":140,"2017":278,"2018":69,"2019":148,"2020":279,"2021":200,"2022":280,"2023":281,"2024":200},34,48,49,50,163,{"2016":145,"2017":145,"2018":135,"2019":140,"2020":50,"2021":135,"2022":128,"2023":48},0.45,{"2016":224,"2017":117,"2018":286,"2019":287,"2020":288,"2021":284,"2022":289,"2023":104},0.72,0.87,1.1,0.37,{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":136,"totalPublicationByYear":291,"totalCitation":127,"totalCitationByYear":292,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":294,"hindexLast5Year":123,"hindex":42},{"0":123,"2014":40,"2015":40,"2016":130},{"2016":40,"2019":123,"2021":123,"2023":45,"2024":42,"2025":40,"2026":40},0.71,{"2016":106},{"id":296,"createTime":297,"updateTime":10,"relativeEntities":298,"slug":299,"properties":300,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":51,"subjectFields":310,"manageAffiliations":311,"indexDatabases":312,"url":313,"thumbnailPath":28,"statistic":314,"gsStatistic":349,"type":55,"analyzePriority":28},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":301,"eissn":302,"issn":304,"title":306,"gsId":308},{"VOID":15},{"VOID":303},"28155947",{"VOID":305},"08863166",{"EN":307},"Communications in Physics",{"VOID":309},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":32,"impactFactorByYear":315,"i10Index":199,"i10IndexLast5Year":45,"totalPublication":321,"totalPublicationByYear":322,"totalCitation":326,"totalCitationByYear":327,"totalCitationPerPublication":335,"totalCitationPerPublicationByYear":336,"hindexLast5Year":126,"hindex":126},{"2008":110,"2009":316,"2010":165,"2011":317,"2012":317,"2013":112,"2014":318,"2015":105,"2016":108,"2017":116,"2018":318,"2019":52,"2020":319,"2021":284,"2022":320,"2023":116,"2024":222},0.3,0.03,0.16,0.34,0.28,738,{"2007":323,"2008":145,"2009":145,"2010":136,"2011":139,"2012":324,"2013":138,"2014":151,"2015":69,"2016":151,"2017":325,"2018":142,"2019":50,"2020":201,"2021":141,"2022":152,"2023":150,"2024":278,"2025":123},14,107,56,947,{"2007":148,"2008":49,"2009":49,"2010":127,"2011":328,"2012":155,"2013":278,"2014":329,"2015":206,"2016":330,"2017":331,"2018":332,"2019":333,"2020":334,"2021":127,"2022":132,"2023":148},52,94,86,129,76,91,106,1.28,{"2007":337,"2008":338,"2009":338,"2010":293,"2011":339,"2012":340,"2013":341,"2014":342,"2015":179,"2016":232,"2017":343,"2018":344,"2019":180,"2020":345,"2021":346,"2022":347,"2023":348},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":28,"impactFactorByYear":28,"i10Index":133,"i10IndexLast5Year":145,"totalPublication":350,"totalPublicationByYear":351,"totalCitation":355,"totalCitationByYear":356,"totalCitationPerPublication":363,"totalCitationPerPublicationByYear":364,"hindexLast5Year":145,"hindex":323},1117,{"0":48,"1972":40,"1991":127,"1992":51,"1993":49,"1994":47,"1995":323,"1996":42,"1997":40,"1998":146,"1999":146,"2000":205,"2001":47,"2002":128,"2003":136,"2004":132,"2005":136,"2006":148,"2007":141,"2008":149,"2009":352,"2010":353,"2011":196,"2012":208,"2013":280,"2014":354,"2015":150,"2016":328,"2017":137,"2018":142,"2019":325,"2020":152,"2021":139,"2022":139,"2023":142,"2024":148,"2025":147,"2026":132},33,44,92,1611,{"2004":46,"2005":357,"2006":47,"2007":47,"2008":126,"2009":140,"2010":69,"2011":147,"2012":147,"2013":147,"2014":208,"2015":353,"2016":201,"2017":280,"2018":161,"2019":358,"2020":212,"2021":331,"2022":212,"2023":359,"2024":360,"2025":361,"2026":362},8,85,153,178,188,132,1.44,{"2004":365,"2005":169,"2006":289,"2007":320,"2008":117,"2009":171,"2010":366,"2011":367,"2012":368,"2013":225,"2014":369,"2015":288,"2016":171,"2017":370,"2018":371,"2019":231,"2020":372,"2021":373,"2022":374,"2023":375,"2024":376,"2025":377,"2026":378},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":394,"translateLanguages":28,"viewCount":127,"subjectFields":395,"manageAffiliations":396,"indexDatabases":404,"url":418,"thumbnailPath":28,"statistic":419,"gsStatistic":446,"type":55,"analyzePriority":28},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":386,"issn":387,"title":389,"gsId":392},{"VOID":15},{"VOID":388},"18139663",{"EN":390,"VI":391},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":393},"hVh9fuMAAAAJ",[30,31],[],[397],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":398,"slug":28,"properties":399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":403,"statistic":28},[],{"title":400,"country":401,"abbreviation":402},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[405],{"id":406,"indexDatabase":407,"url":412,"indexYears":413,"academicFieldIds":414,"indexDatabaseRanking":28},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":408,"label":409,"description":410,"key":94,"publicationTags":411,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[100,415,416,417],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":32,"impactFactorByYear":420,"i10Index":129,"i10IndexLast5Year":42,"totalPublication":425,"totalPublicationByYear":426,"totalCitation":431,"totalCitationByYear":432,"totalCitationPerPublication":438,"totalCitationPerPublicationByYear":439,"hindexLast5Year":323,"hindex":323},{"2013":107,"2014":107,"2015":111,"2016":365,"2017":107,"2018":421,"2019":117,"2020":422,"2021":227,"2022":423,"2023":368,"2024":424},0.04,0.32,0.39,0.57,1184,{"2012":427,"2013":358,"2014":278,"2015":428,"2016":429,"2017":51,"2018":430,"2019":148,"2020":130,"2021":136,"2022":199,"2023":132,"2024":42},473,71,251,134,995,{"2012":433,"2013":434,"2014":434,"2015":333,"2016":435,"2017":436,"2018":437,"2019":211,"2020":281,"2021":434,"2022":126,"2023":152},149,45,114,51,232,0.84,{"2012":422,"2013":440,"2014":232,"2015":335,"2016":284,"2017":441,"2018":442,"2019":443,"2020":189,"2021":444,"2022":348,"2023":445},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":28,"impactFactorByYear":28,"i10Index":150,"i10IndexLast5Year":132,"totalPublication":447,"totalPublicationByYear":448,"totalCitation":449,"totalCitationByYear":450,"totalCitationPerPublication":192,"totalCitationPerPublicationByYear":460,"hindexLast5Year":51,"hindex":199},1105,{"0":47,"1981":40,"1985":199,"1986":135,"1987":136,"1988":323,"1989":126,"1990":199,"1991":127,"1992":126,"1993":47,"1994":129,"1995":130,"1996":132,"1997":142,"1998":148,"1999":201,"2000":196,"2001":353,"2002":353,"2003":352,"2004":132,"2005":131,"2006":148,"2007":147,"2008":133,"2009":131,"2010":139,"2011":201,"2012":281,"2013":142,"2014":202,"2015":69,"2016":140,"2017":136,"2018":140,"2019":134,"2020":134,"2021":133,"2022":134,"2023":134,"2024":136,"2025":49},3272,{"2007":145,"2008":323,"2009":46,"2010":48,"2011":129,"2012":148,"2013":140,"2014":69,"2015":152,"2016":160,"2017":162,"2018":451,"2019":452,"2020":453,"2021":454,"2022":455,"2023":456,"2024":457,"2025":458,"2026":459},109,173,236,318,398,469,442,440,297,{"2007":461,"2008":115,"2009":194,"2010":318,"2011":462,"2012":227,"2013":286,"2014":463,"2015":175,"2016":464,"2017":465,"2018":466,"2019":467,"2020":468,"2021":469,"2022":470,"2023":471,"2024":472,"2025":473},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":475,"createTime":476,"updateTime":382,"relativeEntities":477,"slug":478,"properties":479,"entityType":25,"verifyStatus":26,"verifyTime":491,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":202,"subjectFields":492,"manageAffiliations":493,"indexDatabases":509,"url":510,"thumbnailPath":28,"statistic":511,"gsStatistic":525,"type":55,"analyzePriority":28},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":480,"issn":481,"title":483,"introduce":486,"gsId":489},{"VOID":15},{"VOID":482},"23541210",{"EN":484,"VI":485},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":487,"VI":488},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"VOID":490},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[494],{"id":495,"createTime":28,"updateTime":28,"relativeEntities":496,"slug":28,"properties":497,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":507,"parentIds":508,"statistic":28},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":498,"address":501,"country":504,"abbreviation":505},{"EN":499,"VI":500},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":502,"VI":503},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam",{"VOID":15},{"VOID":506},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":32,"impactFactorByYear":512,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":520,"totalCitationByYear":521,"totalCitationPerPublication":108,"totalCitationPerPublicationByYear":523,"hindexLast5Year":45,"hindex":45},{"2022":513,"2023":111,"2024":106},0.01,1556,{"2020":47,"2021":516,"2022":517,"2023":518,"2024":519,"2025":122},57,306,801,358,161,{"2021":146,"2022":280,"2023":522},99,{"2021":524,"2022":318,"2023":104},0.23,{"impactFactor":28,"impactFactorByYear":28,"i10Index":123,"i10IndexLast5Year":123,"totalPublication":526,"totalPublicationByYear":527,"totalCitation":526,"totalCitationByYear":528,"totalCitationPerPublication":40,"totalCitationPerPublicationByYear":531,"hindexLast5Year":49,"hindex":49},476,{"0":205,"2019":123,"2021":139,"2022":459,"2023":451,"2024":357,"2025":49,"2026":48},{"2021":42,"2022":123,"2023":161,"2024":529,"2025":360,"2026":530},136,83,{"2021":105,"2022":513,"2023":532,"2024":127,"2025":533,"2026":534},0.62,25.43,13.83,{"id":536,"createTime":537,"updateTime":382,"relativeEntities":538,"slug":539,"properties":540,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":552,"translateLanguages":28,"viewCount":133,"subjectFields":553,"manageAffiliations":554,"indexDatabases":555,"url":556,"thumbnailPath":557,"statistic":558,"gsStatistic":594,"type":55,"analyzePriority":28},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":541,"issn":542,"title":544,"introduce":547,"gsId":550},{"VOID":15},{"VOID":543},"25252445",{"EN":545,"VI":546},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":548,"VI":549},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":551},"jyihv3YAAAAJ",[30,31],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":32,"impactFactorByYear":559,"i10Index":560,"i10IndexLast5Year":205,"totalPublication":561,"totalPublicationByYear":562,"totalCitation":568,"totalCitationByYear":569,"totalCitationPerPublication":579,"totalCitationPerPublicationByYear":580,"hindexLast5Year":140,"hindex":140},{"2007":317,"2010":112,"2011":109,"2012":421,"2013":165,"2014":421,"2015":421,"2016":111,"2017":116,"2018":104,"2019":109,"2020":320,"2021":284,"2022":168,"2023":116,"2024":108},67,1200,{"2002":51,"2003":51,"2004":47,"2005":352,"2006":142,"2007":131,"2008":147,"2009":139,"2010":278,"2011":138,"2012":69,"2013":206,"2014":137,"2015":69,"2016":196,"2017":563,"2018":209,"2019":564,"2020":565,"2021":566,"2022":530,"2023":567,"2024":428,"2025":281},130,78,90,80,61,3204,{"2002":42,"2003":123,"2004":123,"2005":570,"2006":47,"2007":127,"2008":571,"2009":572,"2010":196,"2011":573,"2012":130,"2013":560,"2014":574,"2015":149,"2016":325,"2017":575,"2018":576,"2019":577,"2020":578,"2021":453,"2022":206,"2023":205,"2025":51},189,223,765,246,98,171,377,355,199,2.67,{"2002":194,"2003":116,"2004":365,"2005":581,"2006":582,"2007":226,"2008":583,"2009":584,"2010":585,"2011":586,"2012":228,"2013":585,"2014":587,"2015":588,"2016":589,"2017":232,"2018":590,"2019":591,"2020":592,"2021":593,"2022":347,"2023":318,"2025":316},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":28,"impactFactorByYear":28,"i10Index":595,"i10IndexLast5Year":596,"totalPublication":597,"totalPublicationByYear":598,"totalCitation":609,"totalCitationByYear":610,"totalCitationPerPublication":625,"totalCitationPerPublicationByYear":626,"hindexLast5Year":142,"hindex":152},379,311,2120,{"0":361,"1960":40,"1971":40,"1975":40,"1987":40,"1988":40,"1989":40,"1990":45,"1992":40,"1993":40,"1994":46,"1995":46,"1996":45,"1997":42,"1998":49,"1999":42,"2000":123,"2001":42,"2002":48,"2003":46,"2004":145,"2005":131,"2006":51,"2007":131,"2008":135,"2009":146,"2010":127,"2011":122,"2012":148,"2013":352,"2014":201,"2015":149,"2016":599,"2017":600,"2018":601,"2019":209,"2020":602,"2021":603,"2022":604,"2023":605,"2024":606,"2025":607,"2026":608},77,75,97,143,167,156,182,231,230,128,13225,{"2003":149,"2004":150,"2005":201,"2006":196,"2007":157,"2008":436,"2009":328,"2010":611,"2011":612,"2012":333,"2013":522,"2014":613,"2015":520,"2016":614,"2017":615,"2018":616,"2019":617,"2020":618,"2021":619,"2022":620,"2023":621,"2024":622,"2025":623,"2026":624},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":627,"2004":628,"2005":629,"2006":630,"2007":186,"2008":631,"2009":45,"2010":632,"2011":633,"2012":634,"2013":42,"2014":635,"2015":636,"2016":192,"2017":637,"2018":638,"2019":628,"2020":639,"2021":640,"2022":641,"2023":642,"2024":643,"2025":644,"2026":645},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":647,"createTime":648,"updateTime":382,"relativeEntities":649,"slug":650,"properties":651,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":665,"translateLanguages":28,"viewCount":142,"subjectFields":666,"manageAffiliations":667,"indexDatabases":668,"url":677,"thumbnailPath":678,"statistic":679,"gsStatistic":699,"type":55,"analyzePriority":28},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":652,"eissn":653,"issn":655,"title":657,"introduce":660,"gsId":662},{"VOID":15},{"VOID":654},"25881140",{"VOID":656},"26159317",{"EN":658,"VI":659},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":661},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":663},"ZfBridMAAAAJ","Admin update database",[30,31],[],[],[669],{"id":670,"indexDatabase":671,"url":676,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":672,"label":673,"description":674,"key":94,"publicationTags":675,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":32,"impactFactorByYear":680,"i10Index":130,"i10IndexLast5Year":40,"totalPublication":682,"totalPublicationByYear":683,"totalCitation":685,"totalCitationByYear":686,"totalCitationPerPublication":691,"totalCitationPerPublicationByYear":692,"hindexLast5Year":47,"hindex":47},{"2000":317,"2005":513,"2007":107,"2010":513,"2011":317,"2012":106,"2013":107,"2014":317,"2015":107,"2016":107,"2017":421,"2018":317,"2019":421,"2020":113,"2021":582,"2022":681,"2023":194,"2024":104},0.19,1700,{"1985":131,"1986":353,"1987":130,"1988":69,"1989":69,"1990":200,"1991":196,"1992":146,"1993":279,"1994":148,"1995":200,"1996":201,"1999":278,"2000":140,"2001":128,"2002":202,"2003":353,"2004":138,"2005":202,"2006":136,"2007":278,"2008":139,"2009":137,"2010":141,"2011":278,"2012":132,"2013":202,"2014":202,"2015":278,"2016":684,"2017":359,"2018":160,"2019":162,"2020":281,"2021":157,"2022":436,"2023":358,"2024":136,"2025":135},165,870,{"1995":123,"1999":123,"2001":45,"2002":130,"2003":40,"2004":123,"2005":42,"2007":69,"2008":687,"2009":352,"2010":688,"2011":137,"2012":127,"2013":47,"2014":46,"2015":146,"2016":331,"2017":689,"2018":331,"2019":690,"2020":353,"2021":567,"2022":130,"2023":357},82,60,55,102,0.51,{"1995":421,"1999":165,"2001":167,"2002":532,"2003":107,"2004":165,"2005":111,"2007":693,"2008":694,"2009":287,"2010":445,"2011":695,"2012":119,"2013":319,"2014":318,"2015":696,"2016":338,"2017":118,"2018":697,"2019":219,"2020":698,"2021":341,"2022":423,"2023":111},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":28,"impactFactorByYear":28,"i10Index":126,"i10IndexLast5Year":123,"totalPublication":570,"totalPublicationByYear":700,"totalCitation":701,"totalCitationByYear":702,"totalCitationPerPublication":703,"totalCitationPerPublicationByYear":704,"hindexLast5Year":46,"hindex":205},{"0":48,"1999":146,"2000":47,"2001":45,"2002":40,"2003":199,"2004":123,"2005":42,"2006":123,"2007":145,"2008":145,"2009":46,"2010":49,"2011":47,"2012":47,"2013":49,"2014":45,"2015":45,"2016":157,"2017":40},425,{"2008":42,"2009":357,"2010":47,"2011":51,"2012":199,"2013":135,"2014":323,"2015":51,"2016":278,"2017":69,"2018":69,"2019":137,"2020":142,"2021":140,"2022":148,"2023":122,"2024":202,"2025":135,"2026":126},2.25,{"2008":169,"2009":705,"2010":706,"2011":707,"2012":342,"2013":42,"2014":636,"2015":708,"2016":709,"2017":69},1.6,1.57,1.36,3.75,0.54,{"id":711,"createTime":712,"updateTime":382,"relativeEntities":713,"slug":714,"properties":715,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":28,"translateLanguages":28,"viewCount":150,"subjectFields":727,"manageAffiliations":728,"indexDatabases":729,"url":730,"thumbnailPath":731,"statistic":732,"gsStatistic":738,"type":55,"analyzePriority":28},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":716,"issn":717,"title":719,"introduce":722,"gsId":725},{"VOID":15},{"VOID":718},"28155637",{"EN":720,"VI":721},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":723,"VI":724},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":726},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":32,"impactFactorByYear":733,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":329,"totalPublicationByYear":735,"totalCitation":134,"totalCitationByYear":736,"totalCitationPerPublication":524,"totalCitationPerPublicationByYear":737,"hindexLast5Year":123,"hindex":123},{"2024":734},0.17,{"2022":136,"2023":278,"2024":142},{"2022":357,"2023":126,"2024":123},{"2022":169,"2023":224,"2024":165},{"impactFactor":28,"impactFactorByYear":28,"i10Index":45,"i10IndexLast5Year":45,"totalPublication":330,"totalPublicationByYear":739,"totalCitation":154,"totalCitationByYear":740,"totalCitationPerPublication":741,"totalCitationPerPublicationByYear":742,"hindexLast5Year":46,"hindex":46},{"0":123,"2022":134,"2023":136,"2024":69,"2025":145},{"2023":46,"2024":136,"2025":201,"2026":278},1.22,{"2023":113,"2024":340,"2025":743},4.56,{"id":745,"createTime":746,"updateTime":747,"relativeEntities":748,"slug":749,"properties":750,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":762,"manageAffiliations":763,"indexDatabases":771,"url":817,"thumbnailPath":28,"statistic":818,"gsStatistic":850,"type":55,"analyzePriority":28},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":751,"eissn":752,"issn":754,"title":756,"introduce":758,"gsId":760},{"VOID":15},{"VOID":753},"26159783",{"VOID":755},"08667187",{"EN":757},"Vietnam Journal of Earth Sciences",{"EN":759},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":761},"5htfr3YAAAAJ",[],[764],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":765,"slug":28,"properties":766,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":770,"statistic":28},[],{"title":767,"country":768,"abbreviation":769},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[772,789,800],{"id":773,"indexDatabase":774,"url":784,"indexYears":785,"academicFieldIds":786,"indexDatabaseRanking":788},"6ace2085-a177-4a27-b309-8813b832111e",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":776,"label":777,"description":779,"key":781,"publicationTags":782,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":778,"VI":778},"Scopus - Elsevier",{"EN":778,"VI":780},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[783],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[787],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":790,"indexDatabase":791,"url":796,"indexYears":797,"academicFieldIds":798,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":792,"label":793,"description":794,"key":94,"publicationTags":795,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[799],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf",{"id":801,"indexDatabase":802,"url":814,"indexYears":28,"academicFieldIds":815,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":810,"publicationTags":811,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":806,"VI":806},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":808,"VI":809},"ESCI database","Cơ sở dữ liệu ESCI","esci",[812,813],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[816],"0db73426-2364-455f-81a4-efe0f91d712e","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":879,"manageAffiliations":898,"indexDatabases":914,"url":28,"thumbnailPath":28,"statistic":947,"gsStatistic":28,"type":55,"analyzePriority":28},"f35e085e-7029-4b30-978f-9dccfbcd7231","2024-04-10T01:25:20.372+00:00","2025-11-21T10:05:28.635+00:00",[],"Wireless-Networks",{"issn":874,"title":876},{"VOID":875},"15728196",{"VOID":877},"Wireless Networks","PENDING",[880,886,892],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":882,"label":883,"description":885,"parentId":28,"standard":28,"scholarHubFieldId":28},"f0f0ec9c-bb68-4288-a6f1-ee3d47dc35eb",[],{"EN":884},"Computer Networks and Communications",{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":888,"label":889,"description":891,"parentId":28,"standard":28,"scholarHubFieldId":28},"3ca6493e-aecd-4733-965c-52fbf88fe329",[],{"EN":890},"Electrical and Electronic Engineering",{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":894,"label":895,"description":897,"parentId":28,"standard":28,"scholarHubFieldId":28},"c41bb0c4-b86d-4bd6-ac06-d1efed5edcce",[],{"EN":896},"Information Systems",{},[899,907],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":901,"slug":28,"properties":902,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":905,"statistic":28},"b2bfac93-563a-4fa4-bd81-e546a66bf9bd",[],{"title":903},{"EN":904},"Springer Netherlands",[906],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":908,"createTime":28,"updateTime":28,"relativeEntities":909,"slug":28,"properties":910,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":913,"statistic":28},"26a19206-5cad-4456-bb2f-49abd254fbc6",[],{"title":911},{"EN":912},"SPRINGER",[],[915,933],{"id":916,"indexDatabase":917,"url":928,"indexYears":28,"academicFieldIds":929,"indexDatabaseRanking":28},"e1a09229-dfb5-4281-9d10-d088dd3d206d",{"id":918,"createTime":28,"updateTime":28,"relativeEntities":919,"label":920,"description":922,"key":925,"publicationTags":926,"standard":28},"a4921856-b128-4d9f-8f1f-e80813d3bbd4",[],{"EN":921,"VI":921},"ISI\u002FSCIE - Science Citation Index Expanded",{"EN":923,"VI":924},"SCIE database","Cơ sở dữ liệu SCIE","scie",[927,813],"SCIE","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1022-0038",[930,931,932],"751df115-4b08-418e-b118-c9d9a4c8e64c","5e7ab733-08f6-4bda-8a2e-55af36fcbd05","9115cead-3791-48e5-afe4-132081f08acd",{"id":934,"indexDatabase":935,"url":940,"indexYears":941,"academicFieldIds":942,"indexDatabaseRanking":946},"af3631db-053c-4e49-8f71-6fb90e905a45",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":936,"label":937,"description":938,"key":781,"publicationTags":939,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F17569","1995-2025",[943,944,945],"a81768cc-7885-48eb-a85a-170d5a0a5f4f","499fd762-4414-45c1-b2b3-cc8d2abe204b","b4ee5f56-1514-428f-b517-37576cea076b","SCOPUS__Q1",{"impactFactor":32,"impactFactorByYear":948,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":949,"totalCitation":32,"totalCitationByYear":950,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":951,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"meta":953,"data":955},{"total":954},"2963",[956,1064,1201,1319,1432,1520,1668,1866,1986,2089],{"id":957,"createTime":958,"updateTime":959,"relativeEntities":960,"slug":961,"properties":962,"entityType":971,"verifyStatus":26,"verifyTime":959,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":123,"primaryUrl":973,"fullTextUrl":28,"authors":974,"publicationType":1004,"publisherRelationship":1005,"citationCount":28,"citationInfo":28,"publishDate":1060,"publishYear":1061,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1062,"openAccess":28,"references":28,"isForceReanalyzing":1063},"003815ed-5824-45f0-b265-bcef600be8c4","2023-12-05T06:12:30.929+00:00","2025-02-22T05:20:15.771+00:00",[],"Dynamic-resource-allocation-algorithm-in-multi-user-cooperative-OFDMA-systems-considering-QoS-and-fairness-constraints",{"abstract":963,"title":965,"references":967,"doi":969},{"EN":964},"Wireless transmission systems are constrained by several parameters such as the available spectrum bandwidth, mobile battery energy, transmission channel impairments and users’ minimum quality-of-service. In this paper, a new strategy is investigated that aims at improving the allocation of resources in a dual hop OFDMA cooperative network consisting in multi source–destination pairs and multiple decode-and-forward relays. First, the joint optimization of three types of resources: power, sub-channel and relay nodes, is formulated as a problem of subchannel-relay assignment and power allocation, with the objective of minimizing overall transmission power under the bit-error-rate and data rate constraints. However, the optimal solution to the optimization problem is computationally complex to obtain and may be unfair. Assuming knowledge of the instantaneous channel gains for all links in the entire network, an iterative three-step resource allocation algorithm with low complexity is proposed. In order to guarantee the fairness of users, several fairness criteria are also proposed to provide attractive trade-offs between network performance (i.e. overall transmission power, average network lifetime and average outage probability) and fairness to all users. Numerical studies are conducted to evaluate the performance of the proposed algorithm in two practical scenarios. Simulation results show that the proposed allocation algorithm achieves an efficient trade-off between network performance and fairness among users.",{"EN":966},"Dynamic resource allocation algorithm in multi-user cooperative OFDMA systems: considering QoS and fairness constraints",{"VOID":968},"Marx, F., Farah, J., & Francis, C. (2005). Iterative correction of phase noise and non-linear distortion in orthogonal frequency division multiplexing (OFDM) systems. Annals of Telecommunications, 60(9–10), 1197–1218.\nMarx, F., & Farah, J. (Sep. 2005). Iterative baseband correction of phase noise in OFDM systems for transmission over multi-path and AWGN channels. In Proceedings of the IEEE vehicular technology conference, USA.\nFarah, J., & Marx, F. (2007). Combining strategies for the optimization of resource allocation in a wireless multiuser OFDM system. International Journal of Electronics and Communications (AEU), 61, 665–677.\nSendonaris, A., Erkip, E., & Aazhang, B. (2003). User cooperation diversity: Part I system description. IEEE Transactions on Communications, 51(11), 1927–1938.\nSendonaris, A., Erkip, E., & Aazhang, B. (2003). User cooperation diversity: Part II implementation aspects and performance analysis. IEEE Transactions on Communications, 51(11), 1939–1948.\nLaneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.\nKramer, G., Gastpar, M., & Gupta, P. (2005). Cooperative strategies and capacity theorems for relay networks. IEEE Transactions on Information Theory, 51(9), 3037–3063.\nMaham, B., Hjørungnes, A., & Debbah, M. (2009). Power allocations in minimum-energy SER constrained cooperative networks. Annals of Telecommunications, 64(7), 545–555.\nIEEE802.16e. (2006) IEEE standard for local and metropolitan area networks part 16 and amendment 2. In IEEE.\nEkstrom, H., Furuskar, A., Karlsson, J., Meyer, M., Parkvall, S., Torsner, J., et al. (2006). Technical solutions for the 3G long-term evolution. IEEE Communications Magazine, 44, 38–45.\nDai, L., Gui, B., & Cimini, L. J., Jr. (2007). Selective relaying in OFDM multihop cooperative networks. In Proceeding of WCNC’07 (pp. 963–968), Hong Kong.\nGui, B., Dai, L., & Cimini, L. J., Jr. (2008) Selective relaying in cooperative OFDM systems: Two-hop random network. In Proceeding of WCNC’08 (pp. 996–100), Las Vegas.\nGui, B., & Cimini, L. J., Jr. (2008). Bit loading algorithms for cooperative OFDM systems. EURASIP Journal on Wireless Communications and Networking, 2008. http:\u002F\u002Fwww.hindawi.com\u002Fjournals\u002Fwcn\u002F2008\u002F476797\u002F. doi:10.1155\u002F2008\u002F476797.\nIEEE802.16j (2006). IEEE standard for local and metropolitan area networks Part 16: Air interface for fixed and mobile broadband wireless access systems—multihop relay specification.\nKivanc, D., Guo-qing, L., & Hui, L. (2003). Computationally efficient bandwidth allocation and power control for OFDMA. IEEE Transactions on Wireless Communication, 2(6), 1150–1158.\nJang, J., & Lee, K. B. (2003). Transmit power adaptation for multiuser OFDM systems. IEEE Journal on Selected Areas in Communications, 21(2), 171–178.\nGui, B., Dai, L., & Cimini, L. J., Jr. (2006). OFDM for cooperative networking with limited channel state information. In Proceeding of Milcom, Washington, DC.\nHammerstrom, I., & Wittneben, A. (2006) On the optimal power allocation for nonregenerative OFDM relay links. In Proceeding of IEEE ICC’06, Vol. 10, pp. 4463–4468.\nHammerstrom, I., & Wittneben, A. (2006) Joint power allocation for nonregenerative MIMO-OFDM relay links. In Proceeding of IEEE ICASSP’06, Vol. 4, pp. 49–52.\nMu, H., Tao, M., Dang, W., & Xiao, Y. (2009) Joint subcarrier-relay assignment and power allocation for decode-and-forward multi-relay OFDM systems. In Proceeding of ChinaCom’09, pp. 26–28, Xi’an.\nDang, W., Tao, M., Mu, H., & Huang, J. (2010). Subcarrier-pair based resource allocation for cooperative multi-relay OFDM systems. IEEE Transactions on Wireless Communication, 9(5), 1640–1649.\nLi, G., & Liu, H. (2006). Resource allocation for OFDMA relay networks with fairness constraints. IEEE Journal on Selected Areas in Communications, 24(11), 2061–2069.\nNg, T. C., & Yu, W. (2007). Joint optimization of relay strategies and resource allocations in a cooperative cellular network. IEEE Journal on Selected Areas in Communications, 25(2), 328–339.\nLi, H., Luo, H., Wang, X., & Li, C. (2009) Throughput maximization for OFDMA cooperative relaying networks with fair subchannel allocation. In Proceeding of WCNC, pp. 1–6.\nHan, Z., Himsoon, T., Siriwongpairat, W. P., & Liu, K. J. R. (2009). Resource allocation for multiuser cooperative OFDM networks: Who helps whom and how to cooperate. IEEE Transactions on Vehicular Technology, 58(5), 2378–2391.\nBletsas, A., Khisti, A., Reed, D. P., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas in Communications, 24(3), 659–672.\nPapadogiannis, A., Saadani, A., & Hardouin, E. (2009). Exploiting dynamic relays with limited overhead in cellular systems. Paper presented at the Proceeding of GLOBECOM, Honolulu, HI.\nCatreux, S., Driessen, P., & Greenstein, L. (2002). Data throughputs using multiple-input multiple-output (MIMO) techniques in a noise-limited cellular environment. IEEE Transactions on Wireless Communication, 1(2), 226–239.\nFischer, R., & Huber, J. B. (1996) A new loading algorithm for discrete multitone transmission. In Proceeding of IEEE Globecom, Vol. 1, pp. 724–728, London, UK.\nGross, J., & Bohge, M. (2006). Dynamic mechanisms in OFDM wireless systems: A survey on mathematical and system engineering contributions. Berlin: Tech. Rep. TKN-06-001, Telecommunication Networks Group, Technische University.\nBoyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press.\nKim, K., Kim, H., Han, Y., & Kim, S. L. (2004) Iterative and greedy resource allocation in an uplink OFDMA system. In Proceeding of the international symposium on personal, indoor and mobile radio communications (pp. 2377–2381).\nWong, C. Y., Cheng, R. S., Letaief, K. B., & Murch, R. D. (1999). Multiuser OFDM with adaptive subcarrier, bit, and power allocation. IEEE Journal on Selected Areas in Communications, 17(10), 1747–1758.\nDai, L., Chen, W., & Cimini, L. J., Jr. (2009). Fairness improves throughput in energy-constrained cooperative ad-hoc networks. IEEE Transactions on Wireless Communication, 8(7), 3679–3690.\nDing, J. X., & Zhou, Z. (2003). A suboptimal multiple access scheme for multiuser OFDM system. Journal of Beijing University of Posts and Telecommunications, 26(2), 33–36.\nCOST207 (1989). Digital land mobile radio communications. Luxembourg: Office for Official Publications of the European Communities, Final report.",{"VOID":970},"10.1007\u002Fs11276-011-0405-0","PUBLICATION","Auto Verify","http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs11276-011-0405-0",[975,991],{"id":976,"sortIndex":32,"researcher":28,"roles":977,"affiliations":979,"properties":988,"displayName":990,"givenName":28,"familyName":28},"0eb33c23-659b-45c5-9b38-d4d575a4e8d2",[978],"AUTHOR",[980],{"id":981,"sortIndex":32,"affiliation":982,"properties":28},"b3474a7e-152d-4db1-8fe1-8f234e591c79",{"id":981,"createTime":28,"updateTime":28,"relativeEntities":983,"slug":28,"properties":984,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":987,"statistic":28},[],{"title":985},{"VI":986},"School of Electrical Engineering Department, Yazd University, Yazd, Iran",[],{"title":989},{"VI":990},"Hamed Banizaman",{"id":992,"sortIndex":40,"researcher":28,"roles":993,"affiliations":994,"properties":1001,"displayName":1003,"givenName":28,"familyName":28},"aacabefc-9e42-457a-8f1b-b411cc60c8e4",[978],[995],{"id":981,"sortIndex":32,"affiliation":996,"properties":28},{"id":981,"createTime":28,"updateTime":28,"relativeEntities":997,"slug":28,"properties":998,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1000,"statistic":28},[],{"title":999},{"VI":986},[],{"title":1002},{"VI":1003},"Seyed Mohammad Taghi Almodarresi","ARTICLE",{"url":973,"publisher":1006,"properties":1055},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1007,"slug":872,"properties":1008,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1011,"manageAffiliations":1024,"indexDatabases":1035,"url":28,"thumbnailPath":28,"statistic":1050,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1009,"title":1010},{"VOID":875},{"VOID":877},[1012,1016,1020],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1013,"label":1014,"description":1015,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1017,"label":1018,"description":1019,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1021,"label":1022,"description":1023,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1025,1030],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1026,"slug":28,"properties":1027,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1029,"statistic":28},[],{"title":1028},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1031,"slug":28,"properties":1032,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1034,"statistic":28},[],{"title":1033},{"EN":912},[],[1036,1043],{"id":916,"indexDatabase":1037,"url":928,"indexYears":28,"academicFieldIds":1042,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1038,"label":1039,"description":1040,"key":925,"publicationTags":1041,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1044,"url":940,"indexYears":941,"academicFieldIds":1049,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1045,"label":1046,"description":1047,"key":781,"publicationTags":1048,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1051,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1052,"totalCitation":32,"totalCitationByYear":1053,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1054,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1056,"volume":1058},{"VOID":1057},"365-380",{"VOID":1059},"18","2011-12-15",2011,[927,946],false,{"id":1065,"createTime":1066,"updateTime":1067,"relativeEntities":1068,"slug":1069,"properties":1070,"entityType":971,"verifyStatus":26,"verifyTime":1083,"verifyNote":972,"languages":28,"translateLanguages":1084,"viewCount":32,"primaryUrl":1085,"fullTextUrl":28,"authors":1086,"publicationType":1004,"publisherRelationship":1143,"citationCount":28,"citationInfo":28,"publishDate":1198,"publishYear":1199,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1200,"openAccess":28,"references":28,"isForceReanalyzing":1063},"004598e6-34ba-494f-a874-591346938cb2","2023-12-12T19:59:45.469+00:00","2025-02-13T20:51:26.103+00:00",[],"An-efficient-data-collection-and-load-balance-algorithm-in-wireless-sensor-networks",{"abstract":1071,"title":1074,"keywords":1077,"references":1079,"doi":1081},{"EN":1072,"VI":1073},"The nature of multi-hop data transmission in wireless sensor network will cause serious load unbalance which will produce great restrains in related applications considering the limited energy resource. Relative load balance algorithms are usually performed inside the clusters without considering about the energy consumption of the whole network. A cluster-based balanced energy consumption algorithm (BECA) is proposed by introducing in multiple inter-cluster links to distribute the load, so as to achieve global load balance. Moreover, an efficient data collecting mechanism is proposed based on BECA to improve the traffic balance further. Simulating results based on NS2 show that BECA can obtain better balance properties and prolong the network lifetime effectively.\n","Bản chất của việc truyền dữ liệu đa bước trong mạng cảm biến không dây sẽ gây ra sự mất cân bằng tải nghiêm trọng, điều này sẽ tạo ra những hạn chế lớn trong các ứng dụng liên quan, với việc xem xét nguồn năng lượng hạn chế. Các thuật toán cân bằng tải tương đối thường được thực hiện trong các cụm mà không xem xét đến việc tiêu thụ năng lượng của toàn bộ mạng. Một thuật toán tiêu thụ năng lượng cân bằng dựa trên cụm (BECA) được đề xuất bằng cách giới thiệu nhiều liên kết liên cụm để phân phối tải, nhằm đạt được sự cân bằng tải toàn cầu. Hơn nữa, một cơ chế thu thập dữ liệu hiệu quả dựa trên BECA được đề xuất nhằm cải thiện hơn nữa sự cân bằng lưu lượng. Kết quả giả lập dựa trên NS2 cho thấy BECA có thể đạt được các thuộc tính cân bằng tốt hơn và prolong tuổi thọ mạng hiệu quả.",{"EN":1075,"VI":1076},"An efficient data collection and load balance algorithm in wireless sensor networks","Một thuật toán thu thập dữ liệu và cân bằng tải hiệu quả trong mạng cảm biến không dây",{"VI":1078},"",{"VOID":1080},"Nam, W. H., Kim, T., Hong, E. M., Choi, J. Y., et al. (2017). A wireless sensor network (WSN) application for irrigation facilities management based on information and communication technologies (ICTs). Computers and Electronics in Agriculture, 143, 185–192.\nXie, K., Ning, X. P., Wang, X., He, S. M., & Qin, Z. (2017). An efficient privacy-preserving compressive data gathering scheme in WSNs. Information Sciences, 390, 82–94.\nPandey, O. J., & Hegde, R. M. (2017). Node localization over small world WSNs using constrained average path length reduction. Ad Hoc Networks, 67, 87–102.\nTawalbeh, L., Hashish, S., & Tawalbeh, H. (2017). Quality of service requirements and challenges in generic WSN infrastructures. Procedia Computer Science, 109, 1116–1121.\nMohamed, S. M., Hamza, H. S., & Saroit, I. A. (2017). Coverage in mobile wireless sensor networks (M-WSN): a survey. Computer Communications, 110, 133–150.\nDu, T., Qu, S. N., Liu, K. Q., Xu, J. W., et al. (2016). An efficient data aggregation algorithm for WSNs based on dynamic message list. Procedia Computer Science, 83, 98–106.\nSingh, R., & Verma, A. K. (2017). Efficient image transfer over WSN using cross layer architecture. Optik-International Journal for Light and Electron Optics, 130, 499–504.\nRan, G., Zhang, H., & Gong, S. (2010). Improving on LEACH protocol of wireless sensor networks using fuzzy logic. JICS, 7, 213–218.\nLi, J., & Shi, X. (2007). Improved HEED routing protocol in wireless sensor networks. Computer Engineering and Applications, 43, 165–167.\nHu, J. H., Liu, X. C., & Tan, Z. F. (2014). Improved scheme based on PEGASIS algorithm. Microelectronics and Computer, 11, 36–40.\nRosset, V., Paulo, M. A., & Cespedes, J. G. (2017). Enhancing the reliability on data delivery and energy efficiency by combining swarm intelligence and community detection in large-scale WSNs. Expert Systems with Applications, 78, 89–102.\nLi, L., Sun, J., & Li, Y. S. (2017). Thermal load and bending analysis of heat collection element of direct-steam-generation parabolic-trough solar power plant. Applied Thermal Engineering, 127, 1530–1542.\nGao, C., Zhen, Z. Y., & Gong, H. J. (2016). A self-organized search and attack algorithm for multiple unmanned aerial vehicles. Aerospace Science and Technology, 54, 229–240.\nPatil, V. U., & Kapur, A. R. (2015). Real Time alert data acquisition system USING dynamic IP embedded webserver by USB modem. Procedia Computer Science, 49, 187–193.\nSabunas, A., & Kanapickas, A. (2017). Estimation of climate change impact on energy consumption in a residential building in Kaunas, Lithuania, using HEED Software. Energy Procedia, 128, 92–99.\nAkkari, W., Bouhdid, B., & Belghith, A. (2015). LEATCH: Low energy adaptive tier clustering hierarchy. Procedia Computer Science, 52, 365–372.\nNita, V., Narissa, W., Jeremy, C., Lindsey, W., et al. (2017). TEEN HEED: Design of a clinical-community youth diabetes prevention intervention. Contemporary Clinical Trials, 57, 23–28.\nLo, S. M., Lin, W. H., Chen, C. Y., et al. (2017). Optimal coloring for data collection in tree-based wireless sensor networks. Theoretical Computer Science, 700, 23–36.\nJasaswi, P. M., Mandal, C., & Reade, C. (2017). Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information. Computer Networks, 123, 137–152.\nZhou, X., Liu, Y. H., Wang, J., & Li, C. (2017). A density based link clustering algorithm for overlapping community detection in networks. Physica A: Statistical Mechanics and its Applications, 486, 65–78.\nDabrowski, K. K., & Paulusma, D. (2017). Contracting bipartite graphs to paths and cycles. Information Processing Letters, 127, 37–42.\nZhao, D., Huang, Z. Y., Li, H. Y., et al. (2017). An improved EEMD method based on the adjustable cubic trigonometric cardinal spline interpolation. Digital Signal Processing, 64, 41–48.\nPark, B., Sohn, H., & Liu, P. (2017). Accelerated noncontact laser ultrasonic scanning for damage detection using combined binary search and compressed sensing. Mechanical Systems and Signal Processing, 92, 315–333.",{"VOID":1082},"10.1007\u002Fs11276-017-1652-5","2025-02-05T19:57:13.461+00:00",[30],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs11276-017-1652-5",[1087,1102,1115,1128],{"id":1088,"sortIndex":32,"researcher":28,"roles":1089,"affiliations":1090,"properties":1099,"displayName":1101,"givenName":28,"familyName":28},"85b18856-d308-4e13-bfe7-91adf7280061",[978],[1091],{"id":1092,"sortIndex":32,"affiliation":1093,"properties":28},"b42019b6-b957-46e9-b569-a235d341dde8",{"id":1092,"createTime":28,"updateTime":28,"relativeEntities":1094,"slug":28,"properties":1095,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1098,"statistic":28},[],{"title":1096},{"VI":1097},"Heilongjiang University, Harbin, People’s Republic of China",[],{"title":1100},{"VI":1101},"Danyang Qin",{"id":1103,"sortIndex":40,"researcher":28,"roles":1104,"affiliations":1105,"properties":1112,"displayName":1114,"givenName":28,"familyName":28},"69393c63-b636-49a3-93a1-2b1728c9c83a",[978],[1106],{"id":1092,"sortIndex":32,"affiliation":1107,"properties":28},{"id":1092,"createTime":28,"updateTime":28,"relativeEntities":1108,"slug":28,"properties":1109,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1111,"statistic":28},[],{"title":1110},{"VI":1097},[],{"title":1113},{"VI":1114},"Ping Ji",{"id":1116,"sortIndex":123,"researcher":28,"roles":1117,"affiliations":1118,"properties":1125,"displayName":1127,"givenName":28,"familyName":28},"8032b0e3-fa32-4a56-8328-4aa915fa5a0e",[978],[1119],{"id":1092,"sortIndex":32,"affiliation":1120,"properties":28},{"id":1092,"createTime":28,"updateTime":28,"relativeEntities":1121,"slug":28,"properties":1122,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1124,"statistic":28},[],{"title":1123},{"VI":1097},[],{"title":1126},{"VI":1127},"Songxiang Yang",{"id":1129,"sortIndex":42,"researcher":28,"roles":1130,"affiliations":1131,"properties":1140,"displayName":1142,"givenName":28,"familyName":28},"16a225d0-691c-417f-912b-1f2d3536a450",[978],[1132],{"id":1133,"sortIndex":32,"affiliation":1134,"properties":28},"d02b5e68-3579-4f99-b218-e6f1b2b8eb4c",{"id":1133,"createTime":28,"updateTime":28,"relativeEntities":1135,"slug":28,"properties":1136,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1139,"statistic":28},[],{"title":1137},{"VI":1138},"Dire-dawa Institute of Technology, Dire Dawa, Ethiopia",[],{"title":1141},{"VI":1142},"Teklu Merhawit Berhane",{"url":1085,"publisher":1144,"properties":1193},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1145,"slug":872,"properties":1146,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1149,"manageAffiliations":1162,"indexDatabases":1173,"url":28,"thumbnailPath":28,"statistic":1188,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1147,"title":1148},{"VOID":875},{"VOID":877},[1150,1154,1158],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1151,"label":1152,"description":1153,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1155,"label":1156,"description":1157,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1159,"label":1160,"description":1161,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1163,1168],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1164,"slug":28,"properties":1165,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1167,"statistic":28},[],{"title":1166},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1169,"slug":28,"properties":1170,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1172,"statistic":28},[],{"title":1171},{"EN":912},[],[1174,1181],{"id":916,"indexDatabase":1175,"url":928,"indexYears":28,"academicFieldIds":1180,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1176,"label":1177,"description":1178,"key":925,"publicationTags":1179,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1182,"url":940,"indexYears":941,"academicFieldIds":1187,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1183,"label":1184,"description":1185,"key":781,"publicationTags":1186,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1189,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1190,"totalCitation":32,"totalCitationByYear":1191,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1192,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1194,"volume":1196},{"VOID":1195},"3703-3714",{"VOID":1197},"25","2018-02-12",2018,[927,946],{"id":1202,"createTime":1203,"updateTime":1204,"relativeEntities":1205,"slug":1206,"properties":1207,"entityType":971,"verifyStatus":26,"verifyTime":1204,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1216,"fullTextUrl":28,"authors":1217,"publicationType":1004,"publisherRelationship":1261,"citationCount":28,"citationInfo":28,"publishDate":1316,"publishYear":1317,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1318,"openAccess":28,"references":28,"isForceReanalyzing":1063},"0096e1c0-5f8d-49d6-a76f-6b3d0a5ad13b","2024-01-09T14:26:11.462+00:00","2025-02-03T22:39:28.241+00:00",[],"Cognitive-ocean-of-things-a-comprehensive-review-and-future-trends",{"abstract":1208,"title":1210,"references":1212,"doi":1214},{"EN":1209},"The scientific and technological revolution in Internet of Things is set off in oceanography. Humans have always observed the ocean outside the ocean to study the ocean. In recent years, it changes have been made into the interior of the ocean and the laboratories have been built on the sea floor. Approximately 71% of the Earth’s surface is covered by water. Ocean of things is expected to be important for disaster prevention, ocean resource exploration, and underwater environmental monitoring. Different from traditional wireless sensor networks, ocean of things has its own unique features, such as low reliability and narrow bandwidth. These features may be great challenges for ocean of things. Furthermore, the integration of artificial intelligence and ocean of things has become a topic of increasing interests for oceanology research fields. Cognitive ocean of things (COT) will become the mainstream of future ocean science and engineering development. In this paper, we provide the definition of COT, and the main contributions of this paper are (1) we review the ocean observing networks all the world; (2) we propose the COT architecture and describe the details of it; (3) important and useful applications are discussed; (4) we point out the future trends of COT researches.",{"EN":1211},"Cognitive ocean of things: a comprehensive review and future trends",{"VOID":1213},"Industry 4.0: The fourth industrial revolution. https:\u002F\u002Fwww.i-scoop.eu\u002Findustry-4-0\u002F.\nArrott, M., Chave, A., & Farcas, C. (2011). Building transparent data access for ocean observatories: Coordination of US IOOS DMAC with NSFs OOI cyberinfrastructure. In OCEANS (pp. 1–9).\nSuyehiro, K., Mikada, H., & Asakwawa, K. (2003). Japanese seafloor observing systems: Present and future. Marine Technology Society Journal, 37(3), 102–114.\nPerson, R., Favali, P., & Ruhl, H. (2015). ESONET multidisciplinary scientific community to EMSO novel European research infrastructure for ocean observing. In R. Person (Ed.), Seafloor observatories: A new vision of the earth from the abyss (pp. 531–564). Berlin: Springer.\nBarnes, C., Best, M., & Johnson, F. (2013). Challenges, benefits, and opportunities in installing and operating cabled ocean observatories: Perspectives from NEPTUNE Canada. IEEE Journal of Oceanic Engineering, 38(1), 144–157.\nMoloney, J., Hillis, C., Mouy, X., Urazghildiiev, I., & Dakin, T. (2014). Autonomous multichannel acoustic recorders on the VENUS ocean observatory. In Proceedings of the of IEEE oceans (pp. 1–6).\nKaneda, Y. (2010). The advanced ocean floor real time monitoring system for mega thrust earthquakes and tsunamis-application of DONET and DONET2 data to seismological research and disaster mitigation. In Proceedings of IEEE oceans (pp. 1–6).\nShim, J., Lee, D., & Kim, S. (2009). Application of a large ocean observation buoy in the middle area of the Yellow Sea. Ocean and Polar Research, 31(4), 401–414.\nLewis, P. Internet of Things. http:\u002F\u002Fwww.duluthenergydesign.com\u002FContent\u002FDocuments\u002FGeneralInfo\u002FPresentationMaterials\u002F2017\u002FDay2\u002FInternet-of-Things-LaForge.pdf. Accessed 2017.\nDomingo, M. (2012). An overview of the internet of underwater things. Journal of Network and Computer Applications, 35, 1879–1890.\nDemirors, E., Sklivanitis, G., Melodia, T., Batalama, S., & Pados, D. (2015). Software-defined underwater acoustic networks: Toward a high-rate real-time reconfigurable modem. IEEE Communications Magazine, 53(11), 64–71.\nKaushal, H., & Kaddoum, G. (2016). Underwater optical wireless communication. IEEE Access, 4, 1518–1547.\nMandić, F., Rendulić, I., Mišković, N., & Nađ, Đ. (2016). Underwater object tracking using sonar and USBL measurements. Journal of Sensors. https:\u002F\u002Fdoi.org\u002F10.1155\u002F2016\u002F8070286.\nXie, S., Chen, J., Luo, J., Xie, P., & Tang, W. (2012). Detection and tracking of underwater object based on forward-scan sonar. In Proceedings of the international conference on intelligent robotics and applications (pp. 341–347).\nLi, M., Ji, H., Wang, X., Weng, L., & Gong, Z. (2013). Underwater object detection and tracking based on multi-beam sonar image processing. In Proceedings of IEEE international conference on robotics and biomimetics (pp. 1–5).\nSnyder, J., Silverman, Y., Bai, Y., & Maclver, M. (2013). Underwater object tracking using electrical impedance tomography. In: Proceedings of the IEEE\u002FRSJ international conference on intelligent robots and systems (pp. 1–6).\nWalther, D., Edgington, D., & Koch, C. (2004). Detection and tracking of objects in underwater video. In Proceedings of the 2004 computer society conference on computer vision and pattern recognition (pp. 1–5).\nChuang, M., Hwang, J., Ye, J., Huang, S., & Williams, K. (2016). Underwater fish tracking for moving cameras based on deformable multiple kernels. arXiv:1603.01695.\nLee, D., Kim, G., Kim, D., Myung, H., & Choi, H. (2012). Vision-based object detection and tracking for autonomous navigation of underwater robots. Ocean Engineering, 48, 59–68.\nIHI. (2014). Power generation using the Kuroshio current. IHI Engineering Review, 46(2), 1–5.\nPattle, R. (1954). Production of electric power by mixing fresh and salt water in the hydroelectric pile. Nature, 174(4431), 660.\nMitra, U., Choudhary, S., Hover, F., Hummel, R., Kumar, N., Naryanan, S., et al. (2015). Structured sparse methods for active ocean observation systems with communication constraints. IEEE Communications Magazine, 53(11), 88–96.\nGhassemlooy, Z., Zvanovec, S., Khalighi, M., Popoola, W., & Perze, J. (2017). Optical wireless communication systems. Optik, 151, 1–6.\nHan, G., Jiang, J., Shu, L., Xu, Y., & Wang, F. (2012). Localization algorithms of underwater wireless sensor networks. Sensors, 12(2), 2026–2061.\nChandrasekhar, V., Seah, W. K., Choo, Y. S., & Ee, H. V. (2006). Localization in underwater sensor networks: Survey and challenges. In Proceedings of the 1st ACM international workshop on underwater networks, Los Angeles, CA, USA, 25 September 2006 (pp. 33–40).\nLi, Y. (2017). Deep reinforcement learning: An overview. arXiv:1701.07274.\nSerikawa, S., & Lu, H. (2014). Underwater image dehazing using joint trilateral filter. Computers & Electrical Engineering, 40(1), 41–50.\nLu, H., Li, Y., Zhang, L., & Serikawa, S. (2015). Contrast enhancement for image in turbid water. Journal of the Optical Society of America A, 32(5), 886–893.\nMcGillivary, P., & Zykov, V. (2016). Ship-based cloud computing for advancing oceanographic research capabilities. Proceedings of IEEE Oceans, 2016, 1–6.\nWeng, T., Chen, Y., & Lu, H. (in press). On parallelization of image dehazing with OpenMP. International Journal of High Performance Computing and Networking, 1–12.\nLu, H., Wang, D., Li, Y., Li, J., Li, X., Kim, H., Serikawa, S., & Humar, I. (2019). CONet: A cognitive ocean network. IEEE Wireless Communications, 1–8.\nStack, J. (2011). Automation for underwater mine recognition: Current trends and future strategy. Proceedings of SPIE, 80170K, 1–21.\nDobeck, G. J., Hyland, J. C., & Smedley, L. (1997). Automated detection\u002Fclassification of sea mines in sonar imagery. Proceedings of SPIE, 3079, 90–110.\nSternlicht, D. D., Dikeman, R. D., Lemonds, D. W., Korporaal, M. T., & Teranishi, A. M. (2003). Target confirmation architecture for a buried object scanning sonar. Proceedings of IEEE OCEANS, 1, 1–9.\nNevis, A., Bryan, J., Taylor, J. S., & Cordes, B. (2002). Object detection using a background anomaly approach for electro-optic identification sensors. http:\u002F\u002Fwww.dtic.mil, ADA749176. Accessed 12 June 2018.\nRedmon, J., & Farhadi, A. (2017). YOLO9000: Better, faster, stronger. In Proceedings of the CVPR (pp. 7263–7271).\nLu, H., Li, Y., Chen, M., Kim, H., & Serikawa, S. (2018). Brain intelligence: Go beyond artificial intelligence. Mobile Networks and Application, 23, 368–375.\nManjula, R., & Manvi, S. (2013). Coverage optimization based sensor deployment by using PSO for anti-submarine detection in UWASNs. In Proceedings of the international symposium on ocean eletronics, Athani, India (pp. 1–6).\nCayirci, E., Tezcan, H., Dogan, Y., & Coskun, V. (2006). Wireless sensor networks for underwater surveillance systems. Ad Hoc Networks, 4, 431–446.\nKanazawa, T. (2013). Japan Trench earthquake and tsunami monitoring network of cable-linked 150 ocean bottom observatories and its impact to earth disaster science. In: Proceedings of the 2013 IEEE international underwater technology symposium (pp. 1–6).",{"VOID":1215},"10.1007\u002Fs11276-019-01953-4","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs11276-019-01953-4",[1218,1233,1246],{"id":1219,"sortIndex":32,"researcher":28,"roles":1220,"affiliations":1221,"properties":1230,"displayName":1232,"givenName":28,"familyName":28},"e5fc9cdf-0248-48e4-9821-153a6eff9bd3",[978],[1222],{"id":1223,"sortIndex":32,"affiliation":1224,"properties":28},"2424d098-3dc6-4414-98f2-1bb2ac5cf36f",{"id":1223,"createTime":28,"updateTime":28,"relativeEntities":1225,"slug":28,"properties":1226,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1229,"statistic":28},[],{"title":1227},{"VI":1228},"Faculty of Engineering, Fukuoka University, Fukuoka, Japan",[],{"title":1231},{"VI":1232},"Yujie Li",{"id":1234,"sortIndex":40,"researcher":28,"roles":1235,"affiliations":1236,"properties":1243,"displayName":1245,"givenName":28,"familyName":28},"21f89e8f-be84-4552-9b1f-fdb7424e23a9",[978],[1237],{"id":1223,"sortIndex":32,"affiliation":1238,"properties":28},{"id":1223,"createTime":28,"updateTime":28,"relativeEntities":1239,"slug":28,"properties":1240,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1242,"statistic":28},[],{"title":1241},{"VI":1228},[],{"title":1244},{"VI":1245},"Shinya Takahashi",{"id":1247,"sortIndex":123,"researcher":28,"roles":1248,"affiliations":1249,"properties":1258,"displayName":1260,"givenName":28,"familyName":28},"c75ed579-de96-4b17-8dd8-07d1c7cbed7a",[978],[1250],{"id":1251,"sortIndex":32,"affiliation":1252,"properties":28},"bd1f4edb-c90c-46ea-a3d0-50019d56413b",{"id":1251,"createTime":28,"updateTime":28,"relativeEntities":1253,"slug":28,"properties":1254,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1257,"statistic":28},[],{"title":1255},{"VI":1256},"School of Engineering, Kyushu Institute of Technology, Kitakyushu, Japan",[],{"title":1259},{"VI":1260},"Seiichi Serikawa",{"url":1216,"publisher":1262,"properties":1311},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1263,"slug":872,"properties":1264,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1267,"manageAffiliations":1280,"indexDatabases":1291,"url":28,"thumbnailPath":28,"statistic":1306,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1265,"title":1266},{"VOID":875},{"VOID":877},[1268,1272,1276],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1269,"label":1270,"description":1271,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1273,"label":1274,"description":1275,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1277,"label":1278,"description":1279,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1281,1286],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1282,"slug":28,"properties":1283,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1285,"statistic":28},[],{"title":1284},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1287,"slug":28,"properties":1288,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1290,"statistic":28},[],{"title":1289},{"EN":912},[],[1292,1299],{"id":916,"indexDatabase":1293,"url":928,"indexYears":28,"academicFieldIds":1298,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1294,"label":1295,"description":1296,"key":925,"publicationTags":1297,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1300,"url":940,"indexYears":941,"academicFieldIds":1305,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1301,"label":1302,"description":1303,"key":781,"publicationTags":1304,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1307,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1308,"totalCitation":32,"totalCitationByYear":1309,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1310,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1312,"volume":1314},{"VOID":1313},"917-926",{"VOID":1315},"28","2019-01-29",2019,[927,946],{"id":1320,"createTime":1321,"updateTime":1321,"relativeEntities":1322,"slug":28,"properties":1323,"entityType":971,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1332,"fullTextUrl":28,"authors":1333,"publicationType":1004,"publisherRelationship":1375,"citationCount":28,"citationInfo":28,"publishDate":1429,"publishYear":1430,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1431,"openAccess":28,"references":28,"isForceReanalyzing":1063},"009d4177-f1b2-4e2a-b7f4-59e53f082af0","2024-02-05T13:23:22.567+00:00",[],{"abstract":1324,"title":1326,"references":1328,"doi":1330},{"EN":1325},"Recently, mobile phones are extremely used in lifestyle. Historical records of mobile users (MUs) play an important role in predicting future movements of new visitors of the underlying registration area. Handover (handoff) is one of important quality of service (QoS) parameter that affects the continuity of the call when MUs move from a cell to its neighbors in the same registration area (RA). In this paper, a novel ant based Algorithm, has been introduced, which is called Ant Prediction Algorithm (APA). The main target of APA is to reduce handover impact on the performance of personal communication service (PCS) networks. To accomplish such aim, APA tries to minimize the number of dropped calls by predicting the long-term movement of MUs based on the Sectored Diurnal Mobility Model (SDMM). APA consists of two Parts, namely; (i) the Ant Prediction Engine (APE), which relies on the movement history of the other MUs to predict the future movement of the considered MU, and (ii) the SDMM design, which predicts the exact future sector and cell of the considered MU. Simulations have been presented to validate the proposed scheme in terms of prediction accuracy and handoff blocking probability.",{"EN":1327},"Ant colony prediction by using sectorized diurnal mobility model for handover management in PCS networks",{"VOID":1329},"Saleh, A. I. (2010). A new strategy for managing user’s locations in PCS networks using hot spots topology: discussion and analysis. International Journal of Mobile Network Design and Innovation, 3(3), 169–190.\nKeshav, T. (2006). Location management in wireless cellular networks. https:\u002F\u002Fwww.cse.wustl.edu\u002F~jain\u002Fcse574-06\u002Fftp\u002Fcellular_location\u002Findex.html.\nZhang, J. (2002). Location management in cellular networks. New York: Wiley.\nNayyar, A., & Singh, R. (2014). A comprehensive review of ant colony optimization (ACO) based energy-efficient routing protocols for wireless sensor networks. International Journal of Wireless Networks and Broadband Technologies (IJWNBT), 3(3).\nLim, C. P., & Dehuri, S. (2009). Innovations in swarm intelligence. New York: Springer.\nBeni, G. (2005). From swarm intelligence to swarm robotics. In Swarm robotics, pp. 1–9.\nBonabeau, E., et al. (1999). Swarm intelligence: From natural to artificial systems. Oxford: Oxford University Press.\nDorigo, M., & Stützle, T. (2003). The ant colony optimization metaheuristic: Algorithms, applications, and advances. In Handbook of metaheuristics. Springer, pp. 250–285.\nSchoonderwoerd, R., et al. (1997). Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5(2), 169–207.\nRoy, B., et al. (2012). Ant colony based routing for mobile ad-hoc networks towards improved quality of services. Journal of Emerging Trends in Computing and Information Sciences, 3(1), 10–14.\nKumar, S. B., & Myilsamy, G. (2013). Ant-colony-based algorithm for multi-target tracking in mobile sensor networks. International Journal of Computer Applications, 64(2), 16–20.\nNayyar, A., & Singh, R. (2017). Simulation and performance comparison of ant colony optimization (ACO) routing protocol with AODV, DSDV, DSR routing protocols of wireless sensor networks using NS-2 simulator. American Journal of Intelligent Systems, 7(1), 19–30.\nShah, P. A., et al. (2013). An enhanced procedure for mobile IPv6 route optimization to reduce handover delay and signaling overhead. In International multi topic conference. Springer.\nLiu, C. (2013). A two-step vertical handoff decision algorithm based on dynamic weight compensation. In Proceedings of the ICC 2013.\nZhang, H., Ma, W., Jiang, C., & Li, W. (2011) Signaling cost evaluation of handover management schemes in LTE-advanced femtocell. In IEEE VTC, Budapest, pp. 1–5.\nZhang, H., Jiang, C., Cheng, J., & Leung, V. (2015). Cooperative interference mitigation and handover management for heterogeneous cloud small cell networks. IEEE Wireless Communications, 22(3), 92–99.\nSaleh, A. I. M. (2016). A Hybrid mobility prediction (HMP) strategy for PCS networks. Pattern Analysis and Applications, 19(1), 173–206.\nLu, L., et al. (2011). A dynamic ant colony optimization for load balancing in MRN\u002FMLN. In Asia communications and photonics conference and exhibition, Optical Society of America.\nClaes, R., & Holvoet, T. (2010). Maintaining a distributed symbiotic relationship using delegate multiagent systems. In Simulation conference (WSC), proceedings of the 2010 winter. IEEE.\nClaes, R., et al. (2011). A decentralized approach for anticipatory vehicle routing using delegate multiagent systems. IEEE Transactions on Intelligent Transportation Systems, 12(2), 364–373.\nChellappa, R., et al. (2003). The sectorized mobility prediction algorithm for wireless networks. In Proceedings of the ICT.\nSadhukhan, S. K., et al. (2010). A novel direction-based diurnal mobility model for handoff estimation in cellular networks. In India conference (INDICON), 2010 annual IEEE. IEEE.\nLin, Y.-B., et al. (2013). Predicting human movement based on telecom’s handoff in mobile networks. IEEE Transactions on Mobile Computing, 12(6), 1236–1241.\nDaoui, M., et al. (2008). Mobility prediction based on an ant system. Computer Communications, 31(14), 3090–3097.\nLiu, T., et al. (1998). Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks. IEEE Journal on Selected Areas in Communications, 16(6), 922–936.\nMartinez-Zeron, E., et al. (2014). Method to improve airborne pollution forecasting by using ant colony optimization and neuro-fuzzy algorithms. International Journal of Intelligence Science, 4(04), 81.\nChen, B., & Chen, L. (2014). A link prediction algorithm based on ant colony optimization. Applied Intelligence, 41(3), 694–708.\nDavoodi, M., & Mesgari, M. (2015). GIS-based route finding using ant colony optimization and urban traffic data from different sources. The International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, 40(1), 129.\nEl Fachtali, I., et al. (2016). Vertical handover decision algorithm using ants’ colonies for 4G heterogeneous wireless networks. Journal of Computer Networks and Communications, 2016, 4.\nHamza, A. A., Saleh, A. I., & Mostafa, M. (2016). A mixed movement predictor (MMP) for handling handover problem in PCS networks. Ciencia e Tecnica Vitivinicola Journal, 31(5), 24–45.\nLi, P., et al. (2017). Energy optimization of ant colony algorithm in wireless sensor network. International Journal of Distributed Sensor Networks, 13(4), 1550147717704831.\nSu, D. (2010). A self-optimizing mobility management scheme based on cell ID information in high velocity environment. In Proceedings of the IEEE ICCNT, pp. 285–288.\nZhang, W. (2012). Mobility robustness optimization in femtocell networks based on ant colony algorithm. IEICE Transactions on Communications, E95-B(4), 1455–1458.\nZhang, C. (2017). Fog radio access networks: Mobility management, interference mitigation and resource optimization. IEEE Wireless Communications.\nZhang, C. (2017). Network slicing based 5G and future mobile networks: Mobility, resource management, and challenges. IEEE Communications Magazine, 55(8), 138–145.\nShanghai. (2009). A novel self-optimizing handover mechanism for multi-service provisioning in LTE-advanced. In Proceedings of IEEE ICRCCS’09, pp. 221–224.\nHeng, H. Z., et al. (2013). Mobility robustness optimization in self-organizing LTE femtocells networks. EURASIP Journal on Wireless Communications and Networking.",{"VOID":1331},"10.1007\u002Fs11276-017-1590-2","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs11276-017-1590-2",[1334,1349,1362],{"id":1335,"sortIndex":32,"researcher":28,"roles":1336,"affiliations":1337,"properties":1346,"displayName":1348,"givenName":28,"familyName":28},"ba60cfa2-4457-4ca7-98ae-5b513be929e9",[978],[1338],{"id":1339,"sortIndex":32,"affiliation":1340,"properties":28},"f8b2ad12-dbe4-4207-9133-c1ccf6ee1eee",{"id":1339,"createTime":28,"updateTime":28,"relativeEntities":1341,"slug":28,"properties":1342,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1345,"statistic":28},[],{"title":1343},{"VI":1344},"Computer Engineering and Systems Department, Faculty of Engineering, Mansoura University, Mansoura, Egypt",[],{"title":1347},{"VI":1348},"Ahmed I. Saleh",{"id":1350,"sortIndex":40,"researcher":28,"roles":1351,"affiliations":1352,"properties":1359,"displayName":1361,"givenName":28,"familyName":28},"6092057b-0802-4e47-a99b-92490c97cf81",[978],[1353],{"id":1339,"sortIndex":32,"affiliation":1354,"properties":28},{"id":1339,"createTime":28,"updateTime":28,"relativeEntities":1355,"slug":28,"properties":1356,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1358,"statistic":28},[],{"title":1357},{"VI":1344},[],{"title":1360},{"VI":1361},"Mohamed S. Elkasas",{"id":1363,"sortIndex":123,"researcher":28,"roles":1364,"affiliations":1365,"properties":1372,"displayName":1374,"givenName":28,"familyName":28},"bf6d8940-859e-421e-b99b-c2915c7d6a26",[978],[1366],{"id":1339,"sortIndex":32,"affiliation":1367,"properties":28},{"id":1339,"createTime":28,"updateTime":28,"relativeEntities":1368,"slug":28,"properties":1369,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1371,"statistic":28},[],{"title":1370},{"VI":1344},[],{"title":1373},{"VI":1374},"Alyaa A. Hamza",{"url":1332,"publisher":1376,"properties":1425},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1377,"slug":872,"properties":1378,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1381,"manageAffiliations":1394,"indexDatabases":1405,"url":28,"thumbnailPath":28,"statistic":1420,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1379,"title":1380},{"VOID":875},{"VOID":877},[1382,1386,1390],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1383,"label":1384,"description":1385,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1387,"label":1388,"description":1389,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1391,"label":1392,"description":1393,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1395,1400],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1396,"slug":28,"properties":1397,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1399,"statistic":28},[],{"title":1398},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1401,"slug":28,"properties":1402,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1404,"statistic":28},[],{"title":1403},{"EN":912},[],[1406,1413],{"id":916,"indexDatabase":1407,"url":928,"indexYears":28,"academicFieldIds":1412,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1408,"label":1409,"description":1410,"key":925,"publicationTags":1411,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1414,"url":940,"indexYears":941,"academicFieldIds":1419,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1415,"label":1416,"description":1417,"key":781,"publicationTags":1418,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1421,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1422,"totalCitation":32,"totalCitationByYear":1423,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1424,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1426,"volume":1428},{"VOID":1427},"765-775",{"VOID":1197},"2017-10-11",2017,[927,946],{"id":1433,"createTime":1434,"updateTime":1435,"relativeEntities":1436,"slug":1437,"properties":1438,"entityType":971,"verifyStatus":26,"verifyTime":1435,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1447,"fullTextUrl":28,"authors":1448,"publicationType":1004,"publisherRelationship":1464,"citationCount":28,"citationInfo":28,"publishDate":1517,"publishYear":1518,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1519,"openAccess":28,"references":28,"isForceReanalyzing":1063},"00b064ee-d806-4c57-ac57-72ff41686c80","2024-01-12T18:01:20.430+00:00","2025-02-12T05:42:01.257+00:00",[],"Designing-an-online-vocal-learning-based-on-ZigBee-enabled-wireless-platform",{"abstract":1439,"title":1441,"references":1443,"doi":1445},{"EN":1440},"Vocal learning has found its proliferation in recent years due to the advancement in wireless networking. Vocal art encompasses profound cultural values and aesthetic preferences, making wireless platforms, e.g. Wi-Fi and ZigBee, essential for the enhancement of online vocal learning. ZigBee, as a wireless platform, has more recently been used quite frequently for online vocal learning and music. This paper aims to design an efficient wireless-enabled platform by using the lightweight features of ZigBee to support online vocal learning and expressions. The platform enables data transmission, storage, analysis, and playback of vocal learning sounds through the ZigBee network. It is built on a cloud platform, utilizing Docker virtualization technology to deploy a Hadoop distributed cluster, effectively simulating a distributed environment. The platform incorporates a model for recognizing musical sound and noise signals, empowering the online learning control platform to detect various characteristics of vocal music tones. Vocal music learning is enhanced by extracting endpoint fusion spectrum features and employing a tone adjustment and dynamic detection model. The proposed method improves anti-interference capability, online learning control, vocal tone recognition, and emotional expression accuracy. Simulation results demonstrate its effectiveness in vocal music, online learning control, and tone recognition, leading to more precise vocal music pronunciation and intonation registration.",{"EN":1442},"Designing an online vocal learning based on ZigBee-enabled wireless platform",{"VOID":1444},"Lv, Z., Qiao, L., & Nowak, R. (2022). Energy-efficient resource allocation of wireless energy transfer for the internet of everything in digital twins. IEEE Communications Magazine, 60(8), 68–73.\nKong, H., Lu, L., Yu, J., Chen, Y., & Tang, F. (2021). Continuous authentication through finger gesture interaction for smart homes using WiFi. IEEE Transactions on mobile computing, 20(11), 3148–3162.\nMi, C., Huang, S., Zhang, Y., Zhang, Z., & Postolache, O. (2022). Design and implementation of 3-D measurement method for container handling target. Journal of Marine Science and Engineering, 10(12), 1961.\nPeng, Z., Hu, J., Shi, K., Luo, R., Huang, R., Ghosh, B. K., & Huang, J. (2020). A novel optimal bipartite consensus control scheme for unknown multi-agent systems via model-free reinforcement learning. Applied Mathematics and Computation, 369, 124821.\nLi, B., Li, Q., Zeng, Y., Rong, Y., & Zhang, R. (2021). 3D trajectory optimization for energy-efficient UAV communication: A control design perspective. IEEE Transactions on Wireless Communications, 21(6), 4579–4593.\nLi, B., Zhang, M., Rong, Y., & Han, Z. (2021). Transceiver optimization for wireless powered time-division duplex MU-MIMO systems: Non-robust and robust designs. IEEE Transactions on Wireless Communications, 21(6), 4594–4607. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTWC.2021.3131595\nWang, H., Cui, Z., Liu, R., Fang, L., & Sha, Y. (2023). A multi-type transferable method for missing link prediction in heterogeneous social networks. IEEE Transactions on Knowledge and Data Engineering.\nLu, S., Ding, Y., Liu, M., Yin, Z., Yin, L., & Zheng, W. (2023). Multiscale feature extraction and fusion of image and text in VQA. International Journal of Computational Intelligence Systems, 16(1), 54.\nCao, K., Wang, B., Ding, H., Lv, L., Dong, R., Cheng, T., & Gong, F. (2021). Improving physical layer security of uplink NOMA via energy harvesting Jammers. IEEE Transactions on information forensics and Security, 16, 786–799.\nCao, K., Wang, B., Ding, H., Lv, L., Tian, J., Hu, H., & Gong, F. (2021). Achieving reliable and secure communications in wireless-powered NOMA systems. IEEE Transactions on Vehicular Technology, 70, 1978–1983.\nBesser, A., Lotem, S., & Zeigler-Hill, V. (2020). Psychological stress and vocal symptoms among university professors in Israel: Implications of the shift to online synchronous teaching during the COVID-19 pandemic. Journal of Voice, 36(2), 291.e9-291.e16.\nBedoya, D., Arias, P., Rachman, L., et al. (1840). Even violins can cry: Specifically, vocal emotional behaviours also drive the perception of emotions in non-vocal music. Philosophical Transactions of the Royal Society B: Biological Sciences, 2021(376), 20200396.\nRiddell, F. (2020). Disembodied vocal innocence: John Addington Symonds, the Victorian Chorister, and Queer musical consumption. Victorian Literature and Culture, 48(3), 485–517.\nHunter, E. J., Berardi, M. L., & Whitling, S. (2022). A semiautomated protocol towards quantifying vocal effort with vocal performance during a vocal loading task. Journal of Voice: official journal of the Voice Foundation, 63(4), 221–226.\nPaul, A., McLendon, H., Rally, V., et al. (2021). Behavioral discrimination and time-series phenotyping of birdsong performance. PLOS Computational Biology, 17(4), 1–21.\nMini, P., Thomas, T., & Gopikakumari, R. (2021). EEG-based direct speech BCI system using a fusion of SMRT and MFCC\u002FLPCC features with ANN classifier. Biomedical Signal Processing and Control, 68(2), 102625.\nHuizen, R., Kurniati, F. T. (2021). Feature extraction with mel scale separation method on noise audio recordings. 24(2), 815-824.\nSoundarya, B., Krishnaraj, R., & Mythili, S. (2021). Visual speech recognition using convolutional neural network. IOP Conference Series Materials Science and Engineering, 1084(1), 012020.\nHe, H., Chen, X., Mehmood, A., et al. (2020). ClothFace: A batteryless RFID-based textile platform for handwriting recognition. Sensors, 20(17), 4878.\nTian, H., Liu, J., Chang, C., et al. (2020). Detecting steganography in inactive voice-over-IP frames based on statistic characteristics of fundamental frequency. IEEE Access, 8, 6117–6129.\nSun, J. (2020). Research on resource allocation of vocal music teaching system based on mobile edge computing. Computer Communications, 160(2), 342–350.\nVelayutham, S., Pandiyan, S., Lawrence, T. S., et al. (2020). A performance-aware dynamic scheduling algorithm for cloud-based IoT applications. Computer Communications, 160(1), 512–520.\nYao, F., Yang, S. H., & Xia, B. (2008). A ZigBee based home automation: System design and implementation. Measurement and Control, 41(10), 310–314.\nOrand, A., Tomita, Y., Okamoto, S. and Sonoda, S., (2015). On the design and development of a Zigbee-based multimodal input-output monitoring-actuating system. International Journal of Electrical & Computer Engineering (2088–8708), 5(5).\nBenalia, E., Bitam, S., & Mellouk, A. (2020). Data dissemination for Internet of the vehicle based on 5G communications: A survey. Transactions on Emerging Telecommunications Technologies, 31(5), e3881.\nNikoukar, A., Raza, S., Poole, A., Güneş, M., & Dezfouli, B. (2018). Low-power wireless for the Internet of Things: Standards and applications. IEEE Access, 6, 67893–67926.\nSwan, M. (2012). Sensor mania! the Internet of Things, wearable computing, objective metrics, and the quantified self-2.0. Journal of Sensor and Actuator Networks, 1(3), 217–253.\nTyack, P. L. (2020). A taxonomy for vocal learning. Philosophical Transactions of The Royal Society B Biological Sciences, 375(1789), 20180406.\nYalagi, P. S., Dixit, R. K., & Nirgude, M. A. (2021). Effective use of online teaching-learning platform and MOOC for virtual learning. Journal of Physics: Conference Series, 1854(1), 012019.\nSun, J. (2020). Research on resource allocation of vocal music teaching system based on mobile edge computing. Computer Communications, 160(1), 342–350.\nCastro, V. P. (2022). Noise and signal as ground and figure: Emergence and interference in media ecologies. Palgrave Communications, 9(1), 1–9.\nAslam, A., & Khalid, Z. (2020). Joint SO(3)-spectral domain filtering of spherical signals in the presence of anisotropic noise. IEEE Signal Processing Letters, 27, 2109–2113.\nUpadhyaya, V., Sharma, G., Kumar, A., et al. (2021). Quality parameter index estimation for compressive sensing based sparse audio signal reconstruction. IOP Conference Series: Materials Science and Engineering, 1119(1), 012005.\nChen, W., & Chen, C. (2016). Research on online voice learning platform design based on ZigBee wireless network technology. Wireless Personal Communications, 86(2), 729–745.\nWang, J., Liu, F., & Chen, H. (2019). Design and implementation of an online voice learning system based on ZigBee wireless network. Journal of Physics: Conference Series, 1194(4), 042085.",{"VOID":1446},"10.1007\u002Fs11276-023-03443-0","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs11276-023-03443-0",[1449],{"id":1450,"sortIndex":32,"researcher":28,"roles":1451,"affiliations":1452,"properties":1461,"displayName":1463,"givenName":28,"familyName":28},"31f3fd5d-801a-4595-89f9-d4ec3598b856",[978],[1453],{"id":1454,"sortIndex":32,"affiliation":1455,"properties":28},"fe092735-df26-418e-9046-7192fa3d9e5f",{"id":1454,"createTime":28,"updateTime":28,"relativeEntities":1456,"slug":28,"properties":1457,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1460,"statistic":28},[],{"title":1458},{"VI":1459},"Nanjing Normal University Taizhou College, Taizhou City, China",[],{"title":1462},{"VI":1463},"Mingxia Wan",{"url":1447,"publisher":1465,"properties":1514},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1466,"slug":872,"properties":1467,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1470,"manageAffiliations":1483,"indexDatabases":1494,"url":28,"thumbnailPath":28,"statistic":1509,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1468,"title":1469},{"VOID":875},{"VOID":877},[1471,1475,1479],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1472,"label":1473,"description":1474,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1476,"label":1477,"description":1478,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1480,"label":1481,"description":1482,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1484,1489],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1485,"slug":28,"properties":1486,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1488,"statistic":28},[],{"title":1487},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1490,"slug":28,"properties":1491,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1493,"statistic":28},[],{"title":1492},{"EN":912},[],[1495,1502],{"id":916,"indexDatabase":1496,"url":928,"indexYears":28,"academicFieldIds":1501,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1497,"label":1498,"description":1499,"key":925,"publicationTags":1500,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1503,"url":940,"indexYears":941,"academicFieldIds":1508,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1504,"label":1505,"description":1506,"key":781,"publicationTags":1507,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1510,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1511,"totalCitation":32,"totalCitationByYear":1512,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1513,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1515},{"VOID":1516},"1-14","2023-08-16",2023,[927,946],{"id":1521,"createTime":1522,"updateTime":1523,"relativeEntities":1524,"slug":1525,"properties":1526,"entityType":971,"verifyStatus":26,"verifyTime":1535,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1536,"fullTextUrl":28,"authors":1537,"publicationType":1004,"publisherRelationship":1611,"citationCount":28,"citationInfo":28,"publishDate":1666,"publishYear":1317,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1667,"openAccess":28,"references":28,"isForceReanalyzing":1063},"0108f034-8bd0-4a0e-9607-66ec523fcf60","2024-01-12T15:47:55.443+00:00","2025-01-05T16:25:28.740+00:00",[],"A-new-algorithm-for-optimization-of-quality-of-service-in-peer-to-peer-wireless-mesh-networks",{"abstract":1527,"title":1529,"references":1531,"doi":1533},{"EN":1528},"Nowadays, wireless mesh networks are known as important parts of different commercial, scientific, and industrial processes. Their prevalence increases day-by-day and the future of the world is associated with such technologies for better communication. However, the issue of improving quality of service for dealing with more complex and intense flow of data has been always a remarkable research problem, as a result of improved wireless communication systems. In this sense, objective of this study is to provide a new algorithm for contributing to the associated literature. In the study, peer to peer wireless mesh networks and the concept of service quality were examined first and then an approach for improving service quality in such networks has been proposed accordingly. In detail, the proposed an approach allows profiting data transfer capability by data packet and using this information for routing and preventing overcrowd in network nodes and finally, distributing the load over it. When middle nodes overcrowd, they withhold to send control messages of route creating or do that by delay. The proposed approach has been evaluated and the findings revealed that at least 10% of undue delays through network can be prevented while permittivity does not reduce, thanks to the approach. Also energy consumption within network nodes partially increases due to adding table and the search which can be overlooked.",{"EN":1530},"A new algorithm for optimization of quality of service in peer to peer wireless mesh networks",{"VOID":1532},"Wang, T., Yang, Q., Tan, K., et al. (2018). DCAP: Improving the capacity of WiFi networks with distributed cooperative access points. IEEE Transactions on Mobile Computing, 17(2), 320–333.\nChang, N., Rashidzadeh, R., & Ahmadi, M. (2010). Robust indoor positioning using differential Wi-Fi access points. IEEE Transactions on Consumer Electronics, 56(3), 1860–1867.\nKoo, J., & Cha, H. (2011). Localizing WiFi access points using signal strength. IEEE Communications Letters, 15(2), 187–189.\nHeegard, C., Coffey, J. T., Gummadi, S., Murphy, P. A., Provencio, R., Rossin, E. J., et al. (2001). High performance wireless Ethernet. IEEE Communications Magazine, 39(11), 64–73.\nJudd, G., & Steenkiste, P. (2002). Fixing 802. 11 access point selection. ACM SIGCOMM Computer Communication Review, 32(3), 31.\nJones, K., Liu, L. (2007). What where wi: An analysis of millions of wi-fi access points. In Portable information devices, 2007. PORTABLE 07. IEEE international conference on (pp. 1–4). IEEE.\nAkyildiz, I. F., Wang, X., & Wang, W. (2005). Wireless mesh networks: A survey. Computer Networks, 47(4), 445–487.\nAlotaibi, E., & Mukherjee, B. (2012). A survey on routing algorithms for wireless ad-hoc and mesh networks. Computer Networks, 56(2), 940–965.\nHossain, E., & Leung, K. K. (Eds.). (2007). Wireless mesh networks: Architectures and protocols. Berlin: Springer.\nMisra, S., Misra, S. C., & Woungang, I. (Eds.). (2009). Guide to wireless mesh networks (vol. 995). Berlin: Springer.\nSingh, M. (2019). Wireless mesh networks architecture. In Node-to-node approaching in wireless mesh connectivity (pp. 11–14). Springer, Singapore.\nComer, D. E. (2018). The internet book: Everything you need to know about computer networking and how the Internet works. London: Chapman and Hall\u002FCRC.\nLoo, J., Mauri, J. L., & Ortiz, J. H. (Eds.). (2016). Mobile ad hoc networks: Current status and future trends. London: CRC Press.\nAggelou, G. (2008). Wireless mesh networking. New York: McGraw-Hill Professional.\nHeld, G. (2005). Wireless mesh networks. Philadelphia, PA: Auerbach Publications.\nCrow, B. P., Widjaja, I., Kim, J. G., & Sakai, P. T. (1997). IEEE 802.11 wireless local area networks. IEEE Communications Magazine, 35(9), 116–126.\nCali, F., Conti, M., & Gregori, E. (1998). IEEE 802.11 wireless LAN: Capacity analysis and protocol enhancement. In INFOCOM’98. Seventeenth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE (vol. 1, pp. 142–149). IEEE.\nO’hara, B., & Petrick, A. (2005). IEEE 802.11 handbook: A designer’s companion. IEEE Standards Association.\nXiao, Y., & Rosdahl, J. (2002). Throughput and delay limits of IEEE 802.11. IEEE Communications Letters, 6(8), 355–357.\nKumar, K. A., & Balakrishna, R. (2017). Comparative analysis of delay and throughput using IEEE 802.11 and receiver centric-MAC protocol in wireless sensor networks. In Power and advanced computing technologies (i-PACT), 2017 Innovations in (pp. 1–5). IEEE.\nGoode, B. (2002). Voice over internet protocol (VoIP). Proceedings of the IEEE, 90(9), 1495–1517.\nAhson, S. A., & Ilyas, M. (Eds.). (2008). VoIP handbook: Applications, technologies, reliability, and security. London: CRC Press.\nGanguly, S., & Bhatnagar, S. (2008). VoIP: Wireless, P2P and new enterprise voice over IP. London: Wiley.\nGeer, D. (2009). The future of mobile VoIP in the enterprise. Computer, 42(6), 15–18.\nKaushal, S., Kumar, H., Singh, S., Aggarwal, S., Kaur, J., & Vaidyanathan, S. (2018). Modelling and simulation of an analytical approach to handle real-time traffic in VoIP network. International Journal of Simulation and Process Modelling, 13(1), 35–42.\nJiang, Y., & Tang, S. (2017). An efficient and secure VoIP communication system with chaotic mapping and message digest. Multimedia Systems, 24(3).\nIs4Profit.com. (2012). Using VoIP to increase efficiency and reduce costs. Is4Profit.com Web—Tech. Online: http:\u002F\u002Fis4profit.com\u002Fusing-voip-to-increase-efficiency-and-reduce-costs\u002F. Accessed on 28th Dec 2018.\nChu, C. Y., Chen, S., Yen, Y. C., Yeh, S. L., Chu, H. H., & Huang, P. (2018). EQ: A QoE-centric rate control mechanism for VoIP calls. ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), 3(1), 4.\nHarkat, Y., & Amrouche, A. (2012). A comparative evaluation of VoWLAN call capacity with and without codec’s silence suppression. In Microelectronics (ICM), 2012 24th International Conference on (pp. 1–4). IEEE.\nUlseth, T., & Engelstad, P. (2006). Voice over WLAN (VoWLAN): A wireless voice alternative. TELEKTRONIKK, 102(1), 82.\nBadia, L., Merlin, S., Zanella, A., & Zorzi, M. (2006). Pricing VoWLAN services through a micro-economic framework. IEEE Wireless Communications, 13(1), 6–13.\nGhaderzadeh, A., Kargahi, M., & Reshadi, M. (2018). ReDePoly: Reducing delays in multi-channel P2P live streaming systems using distributed intelligence. Telecommunication Systems, 67(2), 231–246.\nMerani, M. L., & Natali, L. (2016). Adaptive streaming in P2P live video systems: A distributed rate control approach. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM), 12(3), 46.\nQiu, D., & Srikant, R. (2004). Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In ACM SIGCOMM computer communication review (vol. 34, no. 4, pp. 367–378). ACM.\nLan, H. B. T., & Nguyen, H. S. (2011). A low-delay push-pull based application layer multicast for p2p live video streaming. In 2011 Third international conference on knowledge and systems engineering (pp. 104–111). IEEE.\nNarkdej, K., Choochaisri, S., & Intanagonwiwat, C. (2011). A reinforcement-based push-pull approach for peer-to-peer live streaming. In Wireless communications, networking and mobile computing (WiCOM), 2011 7th international conference on (pp. 1–4). IEEE.\nBrogle, M., Milic, D., Bettosini, L., & Braun, T. (2009). A performance comparison of native IP Multicast and IP Multicast tunneled through a Peer-to-Peer overlay network. In Ultra modern telecommunications and workshops, 2009. ICUMT’09. International conference on (pp. 1–6). IEEE.\nFerreira, F. H., da Silva, A. P. C., & Vieira, A. B. (2016). Characterizing peers communities and dynamics in a P2P live streaming system. Peer-to-Peer Networking and Applications, 9(1), 1–15.\nPal, K., Govil, M. C., & Ahmed, M. (2019). Utilization-based hybrid overlay for live video streaming in P2P network. In Recent findings in intelligent computing techniques (pp. 331–338). Springer, Singapore.\nAl-Maqri, M. A., Alrshah, M. A., & Othman, M. (2018). Review on QoS provisioning approaches for supporting video traffic in IEEE802. 11e: Challenges and issues. IEEE Access, 6, 55202–55219.\nFelber, P., Kermarrec, A. M., Leonini, L., Riviere, E., & Voulgaris, S. (2012). PULP: An adaptive gossip-based dissemination protocol for multi-source message streams. Peer-to-Peer Networking and Applications, 5(1), 74–91.\nPerkins, C., Belding-Royer, E., & Das, S. (2003). Ad hoc on-demand distance vector (AODV) routing. No. RFC 3561.\nPerkins, C. E. (2001). Ad hoc networking (Vol. 1). Reading: Addison-Wesley.\nMuhammad, A. R. I. F., Guojun, W. A. N. G., & Valentina, Emilia B. A. L. A. S. (2018). Secure VANETs: Trusted communication scheme between vehicles and infrastructure based on fog computing. Studies in Informatics and Control, 27(2), 235–246.\nRoyer, E. M., & Toh, C. K. (1999). A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 6(2), 46–55.\nGheisari, M., et al. (2017). MAPP: A modular arithmetic algorithm for privacy preserving in IoT. In Ubiquitous computing and communications (ISPA\u002FIUCC), 2017 IEEE international symposium on parallel and distributed processing with applications and 2017 IEEE international conference on. IEEE.\nAbolhasan, M., Wysocki, T., & Dutkiewicz, E. (2004). A review of routing protocols for mobile ad hoc networks. Ad Hoc Networks, 2(1), 1–22.\nAL-Dhief, F. T., Sabri, N., Salim, M. S., Fouad, S., & Aljunid, S. A. (2018). MANET routing protocols evaluation: AODV, DSR and DSDV perspective. In MATEC web of conferences (vol. 150, p. 06024). EDP Sciences.\nTseng, C. Y., Balasubramanyam, P., Ko, C., Limprasittiporn, R., Rowe, J., & Levitt, K. (2003). A specification-based intrusion detection system for AODV. In Proceedings of the 1st ACM workshop on security of ad hoc and sensor networks (pp. 125–134). ACM.\nAde, S. A., & Tijare, P. A. (2010). Performance comparison of AODV, DSDV, OLSR and DSR routing protocols in mobile ad hoc networks. International Journal of Information Technology and Knowledge Management, 2(2), 545–548.\nCai, S., Bao, G., Ma, X., Wu, W., Bian, G., Rodrigues, J. J., & de Albuquerque, V. H. C. (2019). Parameters optimization of the dust absorbing structure for photovoltaic panel cleaning robot based on orthogonal experiment method. Journal of Cleaner Production.\nCasas-Ramírez, M. S., & Camacho-Vallejo, J. F. (2017). Solving the p-median bilevel problem with order through a hybrid heuristic. Applied Soft Computing, 60, 73–86.\nKabalci, Y. (2018). An improved approximation for the Nakagami-m inverse CDF using artificial bee colony optimization. Wireless Networks, 24(2), 663–669.\nTorres-Escobar, R., Marmolejo-Saucedo, J. A., & Litvinchev, I. (2018). Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wireless Networks, 1–10.\nGeorge, R., & Hemanth, J. (2011). Application of an optimization algorithm for channel assignment in mobile communication. In IJCA special issue on “novel aspects of digital imaging applications” DIA, 29–35.\nHildmann, H., Atia, D. Y., Ruta, D., Khrais, S. S., & Isakovic, A. F. (2019). A model for wireless-access network topology and a PSO-based approach for its optimization. In Recent advances in computational optimization (pp. 87–116). Springer, Cham.",{"VOID":1534},"10.1007\u002Fs11276-019-01982-z","2025-01-05T16:25:28.739+00:00","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs11276-019-01982-z",[1538,1553,1568,1581,1596],{"id":1539,"sortIndex":32,"researcher":28,"roles":1540,"affiliations":1541,"properties":1550,"displayName":1552,"givenName":28,"familyName":28},"db820459-a341-4be2-8626-26085194ac38",[978],[1542],{"id":1543,"sortIndex":32,"affiliation":1544,"properties":28},"7ff1892b-05f0-42de-bd54-3410b47ab2f5",{"id":1543,"createTime":28,"updateTime":28,"relativeEntities":1545,"slug":28,"properties":1546,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1549,"statistic":28},[],{"title":1547},{"VI":1548},"Guangdong University of Technology, Guangzhou, China",[],{"title":1551},{"VI":1552},"Mehdi Gheisari",{"id":1554,"sortIndex":40,"researcher":28,"roles":1555,"affiliations":1556,"properties":1565,"displayName":1567,"givenName":28,"familyName":28},"4dfef2a2-91bc-4945-8dd5-96db9a4cc8e4",[978],[1557],{"id":1558,"sortIndex":32,"affiliation":1559,"properties":28},"ed13d059-2971-4b09-a46d-25c29970c8ae",{"id":1558,"createTime":28,"updateTime":28,"relativeEntities":1560,"slug":28,"properties":1561,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1564,"statistic":28},[],{"title":1562},{"VI":1563},"Al-Balqa Applied University, Al-Salt, Jordan",[],{"title":1566},{"VI":1567},"Jafar Alzubi",{"id":1569,"sortIndex":123,"researcher":28,"roles":1570,"affiliations":1571,"properties":1578,"displayName":1580,"givenName":28,"familyName":28},"9af8f9f5-0bd1-408d-b39c-f518c3f2f767",[978],[1572],{"id":1543,"sortIndex":32,"affiliation":1573,"properties":28},{"id":1543,"createTime":28,"updateTime":28,"relativeEntities":1574,"slug":28,"properties":1575,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1577,"statistic":28},[],{"title":1576},{"VI":1548},[],{"title":1579},{"VI":1580},"Xiaobo Zhang",{"id":1582,"sortIndex":42,"researcher":28,"roles":1583,"affiliations":1584,"properties":1593,"displayName":1595,"givenName":28,"familyName":28},"a0b41665-e0be-41ca-8c41-b7216f0fbb3a",[978],[1585],{"id":1586,"sortIndex":32,"affiliation":1587,"properties":28},"16acb910-55c1-403c-833b-bc7abeb95260",{"id":1586,"createTime":28,"updateTime":28,"relativeEntities":1588,"slug":28,"properties":1589,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1592,"statistic":28},[],{"title":1590},{"VI":1591},"Suleyman Demirel University, Isparta, Turkey",[],{"title":1594},{"VI":1595},"Utku Kose",{"id":1597,"sortIndex":45,"researcher":28,"roles":1598,"affiliations":1599,"properties":1608,"displayName":1610,"givenName":28,"familyName":28},"a5be3099-d891-44e7-8e08-7c5f1e827670",[978],[1600],{"id":1601,"sortIndex":32,"affiliation":1602,"properties":28},"46da0020-7a2d-4141-a21d-99fc79fc08b0",{"id":1601,"createTime":28,"updateTime":28,"relativeEntities":1603,"slug":28,"properties":1604,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1607,"statistic":28},[],{"title":1605},{"EN":1606},"Universidad Panamericana, Mexico, Mexico",[],{"title":1609},{"VI":1610},"Jose Antonio Marmolejo Saucedo",{"url":1536,"publisher":1612,"properties":1661},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1613,"slug":872,"properties":1614,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1617,"manageAffiliations":1630,"indexDatabases":1641,"url":28,"thumbnailPath":28,"statistic":1656,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1615,"title":1616},{"VOID":875},{"VOID":877},[1618,1622,1626],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1619,"label":1620,"description":1621,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1623,"label":1624,"description":1625,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1627,"label":1628,"description":1629,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1631,1636],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1632,"slug":28,"properties":1633,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1635,"statistic":28},[],{"title":1634},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1637,"slug":28,"properties":1638,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1640,"statistic":28},[],{"title":1639},{"EN":912},[],[1642,1649],{"id":916,"indexDatabase":1643,"url":928,"indexYears":28,"academicFieldIds":1648,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1644,"label":1645,"description":1646,"key":925,"publicationTags":1647,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1650,"url":940,"indexYears":941,"academicFieldIds":1655,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1651,"label":1652,"description":1653,"key":781,"publicationTags":1654,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1657,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1658,"totalCitation":32,"totalCitationByYear":1659,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1660,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1662,"volume":1664},{"VOID":1663},"4965-4973",{"VOID":1665},"26","2019-03-23",[927,946],{"id":1669,"createTime":1670,"updateTime":1671,"relativeEntities":1672,"slug":1673,"properties":1674,"entityType":971,"verifyStatus":26,"verifyTime":1671,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1683,"fullTextUrl":28,"authors":1684,"publicationType":1004,"publisherRelationship":1810,"citationCount":28,"citationInfo":28,"publishDate":1864,"publishYear":1317,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1865,"openAccess":28,"references":28,"isForceReanalyzing":1063},"011de841-7e9a-400b-8a1a-cffce6a00e31","2023-12-05T11:48:33.896+00:00","2024-12-17T01:08:47.797+00:00",[],"Double-Blinded-Finder-a-two-side-secure-children-face-recognition-system",{"abstract":1675,"title":1677,"references":1679,"doi":1681},{"EN":1676},"When taking photos of a suspicious missing child in the street and posting them to the social network is becoming a feasible way to find missing children, the exposure of photos may cause privacy issues. To address this problem, we propose Double-Blinded Finder, an efficient and double-blinded system for finding missing children via low-dimensional multi-attribute representation of child face and blind face matching. To obtain enough knowledge for representing child faces, we build the Labeled Child Face in the Wild dataset, which contains 60K Internet images with 6K unique identities. Based on this dataset, we further train a multi-task deep face model to describe a child face as a 128d fixed-point feature vector and extensive gender and age attributes. Using the keys generated from face descriptors, the face photos from the social network and face representation from the parent(s) of missing children are both encrypted. In addition, we devise inner-production encryption to run blind face matching in the public cloud. In this manner, Double-Blinded Finder can provide efficient face matching while protecting the privacies of both sides: (1) the suspicious missing children side for avoiding the invasion of the human rights, and (2) the true missing children side for preserving the secondary victimization. The experiments show that our system can achieve practical performance of child face matching with negligible leakage of privacy.",{"EN":1678},"Double-Blinded Finder: a two-side secure children face recognition system",{"VOID":1680},"Amos, B., Bartosz, L., & Satyanarayanan, M. (2016). Openface: A general-purpose face recognition library with mobile applications. Technical report, CMU-CS-16-118, CMU School of Computer Science.\nAvidan, S., & Butman, M. (2006). Efficient methods for privacy preserving face detection. In NIPS (pp. 57–64).\nBost, R., Popa, R. A., Tu, S., & Goldwasser, S. (2015). Machine learning classification over encrypted data. In NDSS.\nDaemen, J., & Rijmen, V. (2002). The design of Rijndael. New York: Springer.\nHu, P., & Ramanan, D. (2017). Finding tiny faces. In IEEE CVPR (pp. 1522–1530).\nJiang, Q., Zeng, W., Ou, W., & Xu, R. (2016). A scrambling and encryption algorithm for selective block of identification photo. In 2016 8th International conference on wireless communications and signal processing (WCSP) (pp. 1–5). IEEE.\nJin, X., Ge, S., Song, C., Li, X., Lei, J., Wu, C., & Yu, H. (2019). Double-blinded finder: A two-side privacy-preserving approach for finding missing children. In EAI International conference on robotic sensor networks (ROSENET), Kitakyushu, Japan, 17 August.\nJin, X., Li, Y., Ge, S., Song, C., Wu, L., & Zhou, X. (2019). Secure face retrieval for group mobile users. Soft Computing. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00500-019-03834-6.\nJin, X., Liu, Y., Li, X., Zhao, G., Chen, Y., & Guo, K. (2015). Privacy preserving face identification in the cloud through sparse representation. In Proceedings of biometric recognition: 10th Chinese conference, CCBR 2015, Tianjin, China, November 13–15, 2015 (pp. 160–167). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-25417-3_20.\nJin, X., Yin, S., Liu, N., Li, X., Zhao, G., & Ge, S. (2018). Color image encryption in non-rgb color spaces. Multimedia Tools and Applications, 77(12), 15851–15873. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11042-017-5159-y.\nJin, X., Yuan, P., Li, X., Song, C., Ge, S., Zhao, G., & Chen, Y. (2017). Efficient privacy preserving viola-jones type object detection via random base image representation. In 2017 IEEE international conference on multimedia and expo, ICME 2017, Hong Kong, China, July 10–14, 2017 (pp. 673–678). https:\u002F\u002Fdoi.org\u002F10.1109\u002FICME.2017.8019497.\nKatz, J., Sahai, A., & Waters, B. (2008). Predicate encryption supporting disjunctions, polynomial equations and inner products. In EUROCRYPT (Vol. 17, pp. 146–162).\nKrizhevsky, A., Sutskever, I., & Hinton, G. (2012). Imagenet classification with deep convolutional neural networks. In NIPS (pp. 453–464).\nLu, H., Liu, G., Li, Y., Kim, H., & Serikawa, S. (2019). Cognitive internet of vehicles for automatic driving. IEEE Network, 33, 12–20.\nLu, H., Wang, D., Li, Y., Li, J., Li, X., Kim, H., Serikawa, S., & Humar, I. (2019). Conet: A cognitive ocean network. arXiv preprint arXiv:1901.06253.\nMiller, E. L., Huang, G. B., & RoyChowdhury, A. (2016). Labeled faces in the wild: A survey. In M. Kawulok, E. Celebi, & B. Smolka (Eds.), Advances in face detection and facial image analysis (pp. 189–248). New York: Springer.\nOkamoto, T., & Takashima, K. (2016). Adaptively attribute-hiding (hierarchical) inner product encryption. IEICE Transactions on Fundamentals of Electronics, Communications and Computer, E99–A(1), 92–117.\nOsadchy, M., Pinkas, B., Jarrous, A., & Moskovich, B. (2010). Scifi: A system for secure face identification. In IEEE S & P (Vol. 16, pp. 239–254).\nOu, W., Luan, X., Gou, J., Zhou, Q., Xiao, W., Xiong, X., et al. (2018). Robust discriminative nonnegative dictionary learning for occluded face recognition. Pattern Recognition Letters, 107, 41–49.\nOu, W., You, X., Tao, D., Zhang, P., Tang, Y., & Zhu, Z. (2014). Robust face recognition via occlusion dictionary learning. Pattern Recognition, 47(4), 1559–1572.\nSahai, A., & Waters, B. (2008). Functional encryption: Beyond public key cryptography. Technical report, INS.\nSakai, Y., Lu, H., Tan, J. K., & Kim, H. (2019). Recognition of surrounding environment from electric wheelchair videos based on modified yolov2. Future Generation Computer Systems, 92, 157–161.\nSchroff, F., Kalenichenko, D., & Philbin, J. (2015). Facenet: A unified embedding for face recognition and clustering. In IEEE CVPR (pp. 815–823).\nSohn, H., Plataniotis, K. N., & Ro, Y. M. (2010). Privacy-preserving watch list screening in video surveillance system. In PCM (pp. 622–632).\nXu, X., Lu, H., Song, J., Yang, Y., Shen, H. T., & Li, X. (2019). Ternary adversarial networks with self-supervision for zero-shot cross-modal retrieval. IEEE Transactions on Cybernetics. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTCYB.2019.2928180.\nZhang, P., You, X., Ou, W., Chen, C. P., & Cheung, Y. (2016). Sparse discriminative multi-manifold embedding for one-sample face identification. Pattern Recognition, 52, 249–259.",{"VOID":1682},"10.1007\u002Fs11276-019-02199-w","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs11276-019-02199-w",[1685,1727,1747,1762,1777,1790],{"id":1686,"sortIndex":32,"researcher":28,"roles":1687,"affiliations":1688,"properties":1724,"displayName":1726,"givenName":28,"familyName":28},"20aa90cb-25ee-472d-a861-c26b8b934029",[978],[1689,1697,1706,1715],{"id":1690,"sortIndex":32,"affiliation":1691,"properties":28},"d1ee5da5-4507-4f19-9c75-16c8b7706cca",{"id":1690,"createTime":28,"updateTime":28,"relativeEntities":1692,"slug":28,"properties":1693,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1696,"statistic":28},[],{"title":1694},{"VI":1695},"Beijing Electronic Science and Technology Institute, Beijing, China",[],{"id":1698,"sortIndex":40,"affiliation":1699,"properties":1705},"b17477e3-ba5b-4b14-96ad-d814e032c977",{"id":1698,"createTime":28,"updateTime":28,"relativeEntities":1700,"slug":28,"properties":1701,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1704,"statistic":28},[],{"title":1702},{"VI":1703},"State Key Laboratory of Cryptology, Beijing, China",[],{},{"id":1707,"sortIndex":123,"affiliation":1708,"properties":1714},"9afde3bb-0183-4480-b03d-97efb9559603",{"id":1707,"createTime":28,"updateTime":28,"relativeEntities":1709,"slug":28,"properties":1710,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1713,"statistic":28},[],{"title":1711},{"VI":1712},"CETC Big Data Research Institute Co., Ltd., Guiyang, China",[],{},{"id":1716,"sortIndex":42,"affiliation":1717,"properties":1723},"d4b06a65-d4f7-48dd-87a4-01077dcbf6dc",{"id":1716,"createTime":28,"updateTime":28,"relativeEntities":1718,"slug":28,"properties":1719,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1722,"statistic":28},[],{"title":1720},{"VI":1721},"Big Data Application on Improving Government Governance Capabilities National Engineering Laboratory, Guiyang, China",[],{},{"title":1725},{"VI":1726},"Xin Jin",{"id":1728,"sortIndex":40,"researcher":28,"roles":1729,"affiliations":1730,"properties":1744,"displayName":1746,"givenName":28,"familyName":28},"ff7227a7-c9ba-45ad-a1de-03c0f2089987",[978],[1731,1737],{"id":1707,"sortIndex":32,"affiliation":1732,"properties":28},{"id":1707,"createTime":28,"updateTime":28,"relativeEntities":1733,"slug":28,"properties":1734,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1736,"statistic":28},[],{"title":1735},{"VI":1712},[],{"id":1716,"sortIndex":40,"affiliation":1738,"properties":1743},{"id":1716,"createTime":28,"updateTime":28,"relativeEntities":1739,"slug":28,"properties":1740,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1742,"statistic":28},[],{"title":1741},{"VI":1721},[],{},{"title":1745},{"VI":1746},"Jicheng Lei",{"id":1748,"sortIndex":123,"researcher":28,"roles":1749,"affiliations":1750,"properties":1759,"displayName":1761,"givenName":28,"familyName":28},"c4cbd3bc-048c-48ba-b843-1032c7ededf2",[978],[1751],{"id":1752,"sortIndex":32,"affiliation":1753,"properties":28},"b8d5e563-851b-41c5-9ab7-61b5c417071f",{"id":1752,"createTime":28,"updateTime":28,"relativeEntities":1754,"slug":28,"properties":1755,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1758,"statistic":28},[],{"title":1756},{"VI":1757},"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",[],{"title":1760},{"VI":1761},"Shiming Ge",{"id":1763,"sortIndex":42,"researcher":28,"roles":1764,"affiliations":1765,"properties":1774,"displayName":1776,"givenName":28,"familyName":28},"9d44913a-3a2e-44ad-9608-66c3eb3fccc4",[978],[1766],{"id":1767,"sortIndex":32,"affiliation":1768,"properties":28},"f203944b-722e-47be-9db0-ce2059fa56d8",{"id":1767,"createTime":28,"updateTime":28,"relativeEntities":1769,"slug":28,"properties":1770,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1773,"statistic":28},[],{"title":1771},{"VI":1772},"OracleChain Technology, Beijing, China",[],{"title":1775},{"VI":1776},"Chenggen Song",{"id":1778,"sortIndex":45,"researcher":28,"roles":1779,"affiliations":1780,"properties":1787,"displayName":1789,"givenName":28,"familyName":28},"8977a5e9-e8ca-4771-aaf3-b51720914b50",[978],[1781],{"id":1690,"sortIndex":32,"affiliation":1782,"properties":28},{"id":1690,"createTime":28,"updateTime":28,"relativeEntities":1783,"slug":28,"properties":1784,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1786,"statistic":28},[],{"title":1785},{"VI":1695},[],{"title":1788},{"VI":1789},"Haoyang Yu",{"id":1791,"sortIndex":46,"researcher":28,"roles":1792,"affiliations":1793,"properties":1807,"displayName":1809,"givenName":28,"familyName":28},"b9f8fb26-1ffb-413a-a444-3974f26f2669",[978],[1794,1800],{"id":1707,"sortIndex":32,"affiliation":1795,"properties":28},{"id":1707,"createTime":28,"updateTime":28,"relativeEntities":1796,"slug":28,"properties":1797,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1799,"statistic":28},[],{"title":1798},{"VI":1712},[],{"id":1716,"sortIndex":40,"affiliation":1801,"properties":1806},{"id":1716,"createTime":28,"updateTime":28,"relativeEntities":1802,"slug":28,"properties":1803,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1805,"statistic":28},[],{"title":1804},{"VI":1721},[],{},{"title":1808},{"VI":1809},"Chuanqiang Wu",{"url":1683,"publisher":1811,"properties":1860},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1812,"slug":872,"properties":1813,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1816,"manageAffiliations":1829,"indexDatabases":1840,"url":28,"thumbnailPath":28,"statistic":1855,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1814,"title":1815},{"VOID":875},{"VOID":877},[1817,1821,1825],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1818,"label":1819,"description":1820,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1822,"label":1823,"description":1824,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1826,"label":1827,"description":1828,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1830,1835],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1831,"slug":28,"properties":1832,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1834,"statistic":28},[],{"title":1833},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1836,"slug":28,"properties":1837,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1839,"statistic":28},[],{"title":1838},{"EN":912},[],[1841,1848],{"id":916,"indexDatabase":1842,"url":928,"indexYears":28,"academicFieldIds":1847,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1843,"label":1844,"description":1845,"key":925,"publicationTags":1846,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1849,"url":940,"indexYears":941,"academicFieldIds":1854,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1850,"label":1851,"description":1852,"key":781,"publicationTags":1853,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1856,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1857,"totalCitation":32,"totalCitationByYear":1858,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1859,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1861,"volume":1863},{"VOID":1862},"927-936",{"VOID":1315},"2019-12-03",[927,946],{"id":1867,"createTime":1868,"updateTime":1869,"relativeEntities":1870,"slug":1871,"properties":1872,"entityType":971,"verifyStatus":26,"verifyTime":1869,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1881,"fullTextUrl":28,"authors":1882,"publicationType":1004,"publisherRelationship":1928,"citationCount":28,"citationInfo":28,"publishDate":1983,"publishYear":1984,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1985,"openAccess":28,"references":28,"isForceReanalyzing":1063},"01271bdd-9b1a-48c3-a75a-7b34dbcf3707","2023-12-25T03:47:41.362+00:00","2025-02-04T00:39:29.000+00:00",[],"MRSVP-A-Resource-Reservation-Protocol-for-an-Integrated-Services-Network-with-Mobile-Hosts",{"abstract":1873,"title":1875,"references":1877,"doi":1879},{"EN":1874},"This paper describes a reservation protocol to provide real-time services to mobile users in an Integrated Services Packet Network. Mobility of hosts has significant impact on the quality of service provided to a real-time application. The currently proposed network system architecture and mechanisms to provide real-time services to fixed hosts are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. Mobile hosts may experience wide variations of quality of service due to mobility. To reduce the impacts of mobility on QoS guarantees, a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. The currently proposed reservation protocol in the Internet, RSVP, is not adequate to make such reservations for mobile hosts. In this paper, we describe a new reservation protocol, MRSVP, for supporting integrated services in a network with mobile hosts.",{"EN":1876},"MRSVP: A Resource Reservation Protocol for an Integrated Services Network with Mobile Hosts",{"VOID":1878},"A.S. Acampora and M. Naghshineh, An architecture and methodology for mobile–executed handoff in cellular ATM networks, IEEE Journal on Selected Areas in Communications 12(8) (October 1994).\nB.R. Badrinath and A.K. Talukdar, IPv6 + Mobile—IP + MRSVP = Internet Cellular Phone?, in: Proceedings of the International Workshop on Quality of Service, Columbia University, New York (May 1997).\nA. Bakre and B.R. Badrinath, Handoff and system support for indirect TCP\u002FIP, in: Proceedings of the 2nd USENIX Symposium on Mobile and Location—independent Computing, Ann Arbor, MI (April 1995) pp. 11–24.\nH. Balakrishnan, V. Padmanabhan, S. Seshan and R.H. Katz, A comparison of mechanisms for improving TCP performance over wireless links, in: Proceedings of the ACM SIGCOMM '96, Stanford, CA (1996) pp. 256–269.\nA.J. Ballardie, P.F. Francis and J. Crowcroft, Core Based Trees (CBT), in: Proceedings of the ACM SIGCOMM '93, San Francisco, CA (August 1993).\nS. Berson, R. Lindell and R. Braden, An architecture for advance reservations in the Internet, Technical report, USC Information Sciences Institute, Marina del Rey, CA (July 1998).\nV. Bharghavan and J.P. Mysore, Profile—based next—cell prediction in indoor wireless LANS, in: Proceedings of the IEEE Singapore International Conference on Networking (1997).\nB. Braden, D. Clark and S. Shenker, Integrated services in the Internet architecture: an overview, Request for comment 1633, Internet Engineering Task Force (June 1994).\nB. Braden, L. Zhang, S. Berson, S. Herzog and S. Jamin, Resource ReSerVation Protocol (RSVP), Version 1, Functional specification, Request for comment 2205, Internet Engineering Task Force (September 1997).\nD.D. Clark, S. Shenker and L. Zhang, Supporting real—time applications in an integrated services packet network: Architecture and mechanism, in: Proceedings of the ACM SIGCOMM '92, Baltimore, MD (August 1992).\nS. Deering, ICMP router discovery messages, Request for comment 1256, Internet Engineering Task Force (September 1991).\nS. Deering and D. Cheriton, Multicast routing in datagram internetworks and extended lans, ACM Transactions on Computer Systems 8(2) (May 1990) 85–110.\nS. Deering and R.M. Hinden, Internet Protocol version 6 (IPv6) specification, Request for comment 1883, Internet Engineering Task Force (December 1995).\nM. Degermark, T. Kohler, S. Pink and O. Schelen, Advance reservations for predictive service, in: Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video, Durham, New Hampshire (April 1995).\nR. Droms, Dynamic Host Configuration Protocol (DHCP), Request for comment 1541, Internet Engineering Task Force (October 1993).\nD. Estrin, V. Jacobson, D. Farinacci, L. Wei, S. Deering, M. Handley, D. Thaler, C. Liu, P. Sharma and A. Helmy, Protocol Independent Multicast — Sparse Mode (PIM—SM): Motivation and architecture, Internet draft, Internet Engineering Task Force (August 1998) (work in progress).\nD. Ferrari, A. Gupta and G. Ventre, Distributed advance reservations of real—time connections, in: Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video, Durham, New Hampshire (April 1995) pp. 15–26.\nM.P. Jayanth and V. Bharghavan, A multicasting architecture for supporting mobility in packet switched internetworks, in: Proceedings of the 3rd Annual ACM\u002FIEEE International Conference on Mobile Computing and Networking (MOBICOM '97), Budapest, Hungary (September 1997).\nS. Jiang, D.H.K. Tsang and B. Li, Subscriber—assisted handoff support in multimedia PCS, ACM Mobile Computing and Communications Review 1(3) (1997).\nK. Keeton, B.A. Mah, S. Seshan, R.H. Katz and D. Ferrari, Providing connection—oriented network services to mobile hosts, in: Proceedings of the USENIX Mobile and Location—independent Computing Symposium, August 2—3, 1993, Cambridge, MA, USA, USENIX Association, Berkeley, CA (August 1993) pp. 83–102.\nK. Lee, Adaptive network support for mobile multimedia, in: Proceedings of the 1st Annual ACM\u002FIEEE International Conference on Mobile Computing and Networking (MOBICOM '95), Berkeley, CA (November 1995).\nD.A. Levine, I.F. Akyildiz and M. Naghshineh, The Shadow Cluster concept for resource allocation and call admission in ATM—based wireless networks, in: Proceedings of the 1st Annual ACM\u002FIEEE International Conference on Mobile Computing and Networking (MOBICOM '95), Berkeley, CA (November 1995).\nG. Liu and G.Q. Maguire Jr., A predictive mobility management algorithm for wireless mobile computing and communications, in: IEEE International Conference on Universal Personal Communications (ICUPC '95), Tokyo, Japan (November 1995).\nT. Liu, P. Bahl and I. Chlamtac, A hierarchical position prediction algorithm for efficient management of resources in cellular networks, in: Proceedings of the GLOBECOM '97, Phoenix, AZ (November 1997).\nS. Lu and V. Bharghavan, Adaptive resource management algorithms for indoor mobile computing environments, in: Proceedings of the ACM SIGCOMM '96, Stanford, CA (August 1996) pp. 231–242.\nC. Perkins and D.B. Johnson, Mobility support in IPv6, in: Proceedings of the 2nd Annual ACM\u002FIEEE International Conference on Mobile Computing and Networking (MOBICOM '96), Rye, NY (November 1996).\nC. Perkins, Mobile IP (Addison-Wesley, Reading, MA, 1998).\nJ. Postel, User Datagram Protocol (UDP), Request for comment 768, Internet Engineering Task Force (August 1980).\nS. Singh, Quality of service guarantees in mobile computing, Journal of Computer Communications 19 (1996).\nA.K. Talukdar, B.R. Badrinath and A. Acharya, Integrated services packet networks with mobile hosts: Architecture and performance, Wireless Networks 5(2) (1999) 111–124.\nA.K. Talukdar, B.R. Badrinath and A. Acharya, On accommodating mobile hosts in an integrated services packet network, in: Proceedings of the IEEE INFOCOM'97 (April 1997) pp. 1048–1055.\nA. Terzis, J. Krawczyk, J. Wroclawski and L. Zhang, RSVP operation over IP tunnels, Internet draft, Internet Engineering Task Force (May 1999), http:\u002F\u002Fwww.ietf.org\u002Finternet-drafts\u002F draft-ietf-rsvp-tunnel-04.txt (work in progress).\nA. Terzis, M. Srivastava and L. Zhang, A simple QoS signalling protocol for mobile hosts in the integrated services Internet, in: Proceedings of the IEEE INFOCOM '99, New York, NY (March 1999).\nJ. Veizades, E. Guttman, C. Perkins and S. Kaplan, Service Location Protocol (SLP), Request for comment 2165, Internet Engineering Task Force (June 1997).\nL. Wolf, L. Delgrossi, R. Steinmetz, S. Schaller and H. Wittig, Issues of reserving resources in advance, in: Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '95), Durham, New Hampshire (April 1995) pp. 27–37.\nJ. Wroclawski, The use of RSVP with integrated services, Request for comment 2210, Internet Engineering Task Force (September 1997).\nL. Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala, RSVP: A new resource ReSerVation Protocol, IEEE Network (September 1993) 8–18.",{"VOID":1880},"10.1023\u002FA:1009035929952","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1023\u002FA:1009035929952",[1883,1898,1913],{"id":1884,"sortIndex":32,"researcher":28,"roles":1885,"affiliations":1886,"properties":1895,"displayName":1897,"givenName":28,"familyName":28},"256b9d29-37e9-4fff-ba6e-cca75aac55e5",[978],[1887],{"id":1888,"sortIndex":32,"affiliation":1889,"properties":28},"cec49e72-a581-4034-9221-7ad60ce6635f",{"id":1888,"createTime":28,"updateTime":28,"relativeEntities":1890,"slug":28,"properties":1891,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1894,"statistic":28},[],{"title":1892},{"VI":1893},"Communication Systems Research Laboratory, Motorola Labs, Schaumburg, USA",[],{"title":1896},{"VI":1897},"Anup Kumar Talukdar",{"id":1899,"sortIndex":40,"researcher":28,"roles":1900,"affiliations":1901,"properties":1910,"displayName":1912,"givenName":28,"familyName":28},"6aaf8336-2182-4364-8d9c-bca01fda7e85",[978],[1902],{"id":1903,"sortIndex":32,"affiliation":1904,"properties":28},"097dbd6b-a90f-40bb-93b0-cffdd5211dcd",{"id":1903,"createTime":28,"updateTime":28,"relativeEntities":1905,"slug":28,"properties":1906,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1909,"statistic":28},[],{"title":1907},{"EN":1908},"[Department of Computer Science, Rutgers University, New Brunswick, USA]",[],{"title":1911},{"VI":1912},"B.R. Badrinath",{"id":1914,"sortIndex":123,"researcher":28,"roles":1915,"affiliations":1916,"properties":1925,"displayName":1927,"givenName":28,"familyName":28},"6ecf19b8-5016-4f08-99f2-0b0b17c8e9d3",[978],[1917],{"id":1918,"sortIndex":32,"affiliation":1919,"properties":28},"05dccb84-0369-4a39-8aea-8280fd563351",{"id":1918,"createTime":28,"updateTime":28,"relativeEntities":1920,"slug":28,"properties":1921,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1924,"statistic":28},[],{"title":1922},{"VI":1923},"C&C Research Labs, NEC USA, Princeton, USA",[],{"title":1926},{"VI":1927},"Arup Acharya",{"url":1881,"publisher":1929,"properties":1978},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1930,"slug":872,"properties":1931,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1934,"manageAffiliations":1947,"indexDatabases":1958,"url":28,"thumbnailPath":28,"statistic":1973,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1932,"title":1933},{"VOID":875},{"VOID":877},[1935,1939,1943],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1936,"label":1937,"description":1938,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1940,"label":1941,"description":1942,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1944,"label":1945,"description":1946,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[1948,1953],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":1949,"slug":28,"properties":1950,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1952,"statistic":28},[],{"title":1951},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":1954,"slug":28,"properties":1955,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1957,"statistic":28},[],{"title":1956},{"EN":912},[],[1959,1966],{"id":916,"indexDatabase":1960,"url":928,"indexYears":28,"academicFieldIds":1965,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":1961,"label":1962,"description":1963,"key":925,"publicationTags":1964,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":1967,"url":940,"indexYears":941,"academicFieldIds":1972,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1968,"label":1969,"description":1970,"key":781,"publicationTags":1971,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":1974,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":1975,"totalCitation":32,"totalCitationByYear":1976,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1977,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":1979,"volume":1981},{"VOID":1980},"5-19",{"VOID":1982},"7","2001-01-01",2001,[927,946],{"id":1987,"createTime":1988,"updateTime":1989,"relativeEntities":1990,"slug":1991,"properties":1992,"entityType":971,"verifyStatus":26,"verifyTime":1989,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":40,"primaryUrl":2001,"fullTextUrl":28,"authors":2002,"publicationType":1004,"publisherRelationship":2033,"citationCount":28,"citationInfo":28,"publishDate":2087,"publishYear":1199,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2088,"openAccess":28,"references":28,"isForceReanalyzing":1063},"012c9f15-84c3-450b-8ee6-4197508826e5","2023-12-14T10:03:36.253+00:00","2024-12-25T03:09:12.666+00:00",[],"Modelling-of-ultra-high-frequency-television-band-radio-signal-propagation-in-underground-mine-environment",{"abstract":1993,"title":1995,"references":1997,"doi":1999},{"EN":1994},"Solutions operating at ultra high frequency television band (UHF TV) have been deployed in above ground networks and communication systems providing data connectivity for different applications, but its’ deployment for underground communications haven’t been tested to date. Signal level and throughput measurements have been organised inside a mine environment that exploits platinum ore in the Republic of South Africa.\n Signal propagation has been modelled using scatter and direct signal component for which losses follow 15th and 6th power of the distance on the crossing and in the tunnel respectively. Measurements taken in the mine showed a connectivity with UDP level throughputs in the order of 1 Mb\u002Fs for distances of 350 m. It was demonstrated that the proposed deployment could be combined with Wi-Fi networks in 2.4 and 5 GHz for connecting standard smart devices from underground to above ground communication systems including the provision of internet services. It is expected that communication systems based on UHF TV band could supplement or even replace existing communications that are usually based on leaky feeders since they can provide wireless broadband data connectivity in a mining environment.",{"EN":1996},"Modelling of ultra high frequency television band radio signal propagation in underground mine environment",{"VOID":1998},"United States Department of Labor. (2006). Mine improvement and new emergency response act of 2006 (MINER Act) (pp. 109–236). Arlington: United States Public Laws.\nZhou, C., et al. (2015). RF propagation in mines and tunnels: Extensive measurements for vertically, horizontally, and cross-polarized signals in mines and tunnels. IEEE Antennas and Propagation Magazine, 57(4), 88–102.\nBoutin, M., et al. (2008). Radio wave characterization and modeling in underground mine tunnels. IEEE Transactions on Antennas and Propagation, 56(2), 540–549.\nLiénard, M., & Degauque, P. (2000). Natural wave propagation in mine environments. IEEE Transactions on Antennas and Propagation, 48(9), 1326–1339.\nEmslie, A. G., et al. (1975). Theory of the propagation of UHF radio waves in coal mine tunnels. IEEE Transactions on Antennas and Propagation, 23(2), 192–205.\nSun J. P., & Zhang, H. W. (2006). A simple method to analyze the propagation of electromagnetic wave in rectangular coal mine tunnel. In 7th International Symposium on Antennas, Propagation and EM Theory. https:\u002F\u002Fdoi.org\u002F10.1109\u002Fisape.2006.353496.\nWang, S. (2010). Radio wave attenuation character in the confined environments of rectangular mine tunnel. Modern Applied Science, 4(2), 65–70.\nZhang, Y. P., Zheng, G. X., & Sheng, J. H. (2001). Radio propagation at 900 MHz in underground coal mines. IEEE Transactions on Antennas and Propagation, 49(5), 757–762.\nNiu, L., et al. (2007). Analysis and comparison of the performance about wireless modulation technologies in the empty and straight mine laneway. In IEEE 2007 international symposium on microwave, antenna, propagation, and EMC technologies for wireless communications (Vol. 1, pp. 756–760). https:\u002F\u002Fdoi.org\u002F10.1109\u002Fmape.2007.4393734.\nForooshani, A. E., et al. (2013). A Survey of wireless communications and propagation modeling in underground mines. IEEE Communications Surveys and Tutorials, 15(4), 1524–1545. https:\u002F\u002Fdoi.org\u002F10.1109\u002FSURV.2013.031413.00130.\nQaraqe, K. A., Yarkan, S., Guzelgoz, S., & Arslan, H. (2013). Statistical wireless channel propagation characteristics in underground mines at 900 MHz: A comparative analysis with indoor channels. Ad Hoc Networks, 11(4), 1472–1483.\nVujic, D. S., & Dukic, M. L. (2014). On applications of TVWS systems. In PosTel 2014 (Vol. 1, pp. 209–214).\nIEEE 802.11af-2013. IEEE Standard for information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 5: Television White Spaces (TVWS) Operation.\nParsons, J. D. (2007). The mobile propagation channel (2nd ed.). Chichester: Wiley.\nSaunders, S., & Aragon-Zavala, A. (2007). Antennas and propagation for wireless communication systems (2nd ed.). Chichester: Wiley.\nSiwiak, K., & Bahreini, Y. (2007). Radiowave propagation and antennas for personal communications (3rd ed.). Norwood: Artech House.\nPinel, N., & Boulier, C. (2013). Electromagnetic wave scattering from random rough surfaces—Asymptotic models. Hoboken: Wiley.\nSana, S. (2013). Radio propagation measurement and channel modelling. Chichester: Wiley.\nBarclay, L. (2013). Propagation of radiowaves (3rd ed.). London: Institute of Engineering and Technology.\nHrovat, A., Kandus, G., & Javornik, T. (2014). A survey of radio propagation modeling for tunnels. IEEE Communications Surveys and Tutorials, 16(2), 658–669.\nFarjow, W., Raahemifar, K., & Fernando, X. (2015). Novel wireless channels characterization model for underground mines. Applied Mathematical Modelling, 39(19), 5997–6007.\n802.11n-2009—IEEE Standard for Information technology—Local and metropolitan area networks—Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications Amendment 5: Enhancements for Higher Throughput.",{"VOID":2000},"10.1007\u002Fs11276-018-1801-5","http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs11276-018-1801-5",[2003,2018],{"id":2004,"sortIndex":32,"researcher":28,"roles":2005,"affiliations":2006,"properties":2015,"displayName":2017,"givenName":28,"familyName":28},"48f8b72d-5db3-483f-a077-820c56c90993",[978],[2007],{"id":2008,"sortIndex":32,"affiliation":2009,"properties":28},"91741208-6ed1-4220-a156-7fb586b59acc",{"id":2008,"createTime":28,"updateTime":28,"relativeEntities":2010,"slug":28,"properties":2011,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2014,"statistic":28},[],{"title":2012},{"VI":2013},"Cardinality Ltd, Surrey, UK",[],{"title":2016},{"VI":2017},"Dejan S. Vujić",{"id":2019,"sortIndex":40,"researcher":28,"roles":2020,"affiliations":2021,"properties":2030,"displayName":2032,"givenName":28,"familyName":28},"6868bc92-9a51-4ff9-8074-3ab3a54bcd50",[978],[2022],{"id":2023,"sortIndex":32,"affiliation":2024,"properties":28},"d89bcad5-c162-4d70-8e96-29a52ad3fccf",{"id":2023,"createTime":28,"updateTime":28,"relativeEntities":2025,"slug":28,"properties":2026,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2029,"statistic":28},[],{"title":2027},{"VI":2028},"University of Belgrade — School of Electrical Engineering, Belgrade, Serbia",[],{"title":2031},{"VI":2032},"Jelena D. Ćertić",{"url":2001,"publisher":2034,"properties":2083},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2035,"slug":872,"properties":2036,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2039,"manageAffiliations":2052,"indexDatabases":2063,"url":28,"thumbnailPath":28,"statistic":2078,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2037,"title":2038},{"VOID":875},{"VOID":877},[2040,2044,2048],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":2041,"label":2042,"description":2043,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":2045,"label":2046,"description":2047,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":2049,"label":2050,"description":2051,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[2053,2058],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":2054,"slug":28,"properties":2055,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2057,"statistic":28},[],{"title":2056},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":2059,"slug":28,"properties":2060,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2062,"statistic":28},[],{"title":2061},{"EN":912},[],[2064,2071],{"id":916,"indexDatabase":2065,"url":928,"indexYears":28,"academicFieldIds":2070,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":2066,"label":2067,"description":2068,"key":925,"publicationTags":2069,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":2072,"url":940,"indexYears":941,"academicFieldIds":2077,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2073,"label":2074,"description":2075,"key":781,"publicationTags":2076,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":2079,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":2080,"totalCitation":32,"totalCitationByYear":2081,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":2082,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":2084,"volume":2086},{"VOID":2085},"2117-2128",{"VOID":1197},"2018-07-23",[927,946],{"id":2090,"createTime":2091,"updateTime":2092,"relativeEntities":2093,"slug":2094,"properties":2095,"entityType":971,"verifyStatus":26,"verifyTime":2104,"verifyNote":972,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":2105,"fullTextUrl":28,"authors":2106,"publicationType":1004,"publisherRelationship":2179,"citationCount":28,"citationInfo":28,"publishDate":2234,"publishYear":2235,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2236,"openAccess":28,"references":28,"isForceReanalyzing":1063},"01307b30-d87b-4c9b-9db6-d89913679a5e","2024-02-07T08:29:19.418+00:00","2025-01-18T17:04:42.159+00:00",[],"Low-loss-TCP-IP-header-compression-for-wireless-networks",{"abstract":2096,"title":2098,"references":2100,"doi":2102},{"EN":2097},"Wireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless links will probably always be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communication. Therefore, it is necessary for network protocols to utilize the available bandwidth efficiently. Headers of IP packets are growing and the bandwidth required for transmitting headers is increasing. With the coming of IPv6 the address size increases from 4 to 16 bytes and the basic IP header increases from 20 to 40 bytes. Moreover, most mobility schemes tunnel packets addressed to mobile hosts by adding an extra IP header or extra routing information, typically increasing the size of TCP\u002FIPv4 headers to 60 bytes and TCP\u002FIPv6 headers to 100 bytes. In this paper, we provide new header compression schemes for UDP\u002FIP and TCP\u002FIP protocols. We show how to reduce the size of UDP\u002FIP headers by an order of magnitude, down to four to five bytes. Our method works over simplex links, lossy links, multi‐access links, and supports multicast communication. We also show how to generalize the most commonly used method for header compression for TCP\u002FIPv4, developed by Jacobson, to IPv6 and multiple IP headers. The resulting scheme unfortunately reduces TCP throughput over lossy links due to unfavorable interaction with TCP's congestion control mechanisms. However, by adding two simple mechanisms the potential gain from header compression can be realized over lossy wireless networks as well as point‐to‐point modem links.",{"EN":2099},"Low‐loss TCP\u002FIP header compression for wireless networks",{"VOID":2101},"M.G. Baker, X. Zhao, S. Cheshire and J. Stone, Supporting mobility in MosquitoNet, in: Proceedings of USENIX Technical Conference, San Diego, CA (January 1996).\nH. Balakrishnan, S. Seshan, E. Amir and R.H. Katz, Improving TCP\u002FIP performance over wireless networks, in: Proceedings of Mobile Computing and Networking Conference (MobiCom '95) (ACM Press, 1995) pp. 2–11.\nD.D. Clark, The design philosophy of the DARPA Internet protocols, Comp. Comm. Rev. 18(4) (1988) 106–114. Also in Comp. Comm. Rev. 25(1) (1995) 102–111.\nS. Deering, Host extensions for IP multicasting, Request For Comment 1112, Internet Engineering Task Force (1989). ftp:\u002F\u002F ds.internic.net\u002Frfc\u002Frfc1112. {ps,txt}.\nS. Deering and R. Hinden, Internet protocol, version 6 (IPv6) specifi-cation, Request For Comment 1883, Internet Engineering Task Force (1995). ftp:\u002F\u002Fds.internic.net\u002Frfc\u002Frfc1883.txt.\nS. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu and L. Wei, An architecture for wide-area multicast routing, Comp. Comm. Rev. 24(4) (1994) 126–135.\nM. Degermark, B. Nordgren and S. Pink, Header compression for IPv6, Internet Draft (work in progress), Internet Engineering Task Force (1996). draft-degermark-ipv6-hc-02.txt.\nD. Eckhardt and P. Steenkiste, Measurement and analysis of the error characteristics of an in-building wireless network, Comp. Comm. Rev. 26(4) (1996) 243–254.\nD. Feldmeier and A. MacAuley, We owe the concept of a booster protocol to them.\nV. Jacobson, Compressing TCP\u002FIP headers for low-speed serial links, Request For Comment 1144, Internet Engineering Task Force (1990). ftp:\u002F\u002Fds.internic.net\u002Frfc\u002Frfc1144. {ps,txt}.\nS. Keshav, The REAL network simulator. http:\u002F\u002Fminnie.cs.adfa.oz.au\u002F REAL\u002F.\nA. Mathur and M. Lewis, Compressing IPX headers over WAN media (CIPX), Request For Comment 1553, Internet Engineering Task Force (1993). ftp:\u002F\u002Fds.internic.net\u002Frfc\u002Frfc1553.txt.\nNetwork Research Group, Lawrence Berkeley National Laboratory, ns – LBNL Network Simulator. http:\u002F\u002Fwww-nrg.ee.lbl.gov\u002Fns\u002F.\nG.T. Nguyen, R.H. Katz, B. Noble and M. Satyanarayanan, A trace-based approach for modeling wireless channel behaviour, in: Proceedings of Winter Simulation Conference (1996). http:\u002F\u002F daedalus.cs.berkeley.edu\u002Fpublications\u002Fwsc96.ps.gz.\nC. Partridge, Gigabit Networking (Addison-Wesley, Reading, MA, 1993).\nC. Perkins, ed., IP mobility support, Internet draft (work in progress), Internet Engineering Task Force (1996). draft-ietf-mobileipprotocol-16.txt.\nC. Perkins and D.B. Johnson, Mobility support in IPv6, Internet draft (work in progress), Internet Engineering Task Force (1996). draft-ietf-mobileip-ipv6-00.txt.\nJ.L. Romkey, A non standard for transmission of IP datagrams over serial lines: SLIP, Request For Comment 1055, Internet Engineering Task Force (1988).\nW. Simpson, The point-to-point protocol (PPP), Request For Comment 1661, Internet Engineering Task Force (1994).\nW. Simpson, PPP in HDLC-like framing, Request For Comment 1662, Internet Engineering Task Force (1994).\nL. Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala, RSVP: a new resource reservation protocol, IEEE Network Magazine (September 1993) 8–18.",{"VOID":2103},"10.1023\u002FA:1019138108114","2025-01-18T17:04:42.158+00:00","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1023\u002FA:1019138108114",[2107,2122,2135,2157],{"id":2108,"sortIndex":32,"researcher":28,"roles":2109,"affiliations":2110,"properties":2119,"displayName":2121,"givenName":28,"familyName":28},"ef2b4a32-fefc-4618-a1f3-119b48c43b9f",[978],[2111],{"id":2112,"sortIndex":32,"affiliation":2113,"properties":28},"6cc89f43-df99-46db-91f5-9cd105d83abe",{"id":2112,"createTime":28,"updateTime":28,"relativeEntities":2114,"slug":28,"properties":2115,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2118,"statistic":28},[],{"title":2116},{"VI":2117},"CDT\u002FDept.of Computer Science, Lule University of Technology, Luleå, Sweden",[],{"title":2120},{"VI":2121},"Mikael Degermark",{"id":2123,"sortIndex":40,"researcher":28,"roles":2124,"affiliations":2125,"properties":2132,"displayName":2134,"givenName":28,"familyName":28},"989baa2a-8e64-4a11-9ccb-5755e6810e27",[978],[2126],{"id":2112,"sortIndex":32,"affiliation":2127,"properties":28},{"id":2112,"createTime":28,"updateTime":28,"relativeEntities":2128,"slug":28,"properties":2129,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2131,"statistic":28},[],{"title":2130},{"VI":2117},[],{"title":2133},{"VI":2134},"Mathias Engan",{"id":2136,"sortIndex":123,"researcher":28,"roles":2137,"affiliations":2138,"properties":2154,"displayName":2156,"givenName":28,"familyName":28},"baec88b9-dcba-4d2f-a199-6a2447f13476",[978],[2139,2145],{"id":2112,"sortIndex":32,"affiliation":2140,"properties":28},{"id":2112,"createTime":28,"updateTime":28,"relativeEntities":2141,"slug":28,"properties":2142,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2144,"statistic":28},[],{"title":2143},{"VI":2117},[],{"id":2146,"sortIndex":40,"affiliation":2147,"properties":2153},"e3f46826-2604-43c9-b861-1d3f1e9de2d5",{"id":2146,"createTime":28,"updateTime":28,"relativeEntities":2148,"slug":28,"properties":2149,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2152,"statistic":28},[],{"title":2150},{"VI":2151},"Telia Research AB, Luleå, Sweden",[],{},{"title":2155},{"VI":2156},"Björn Nordgren",{"id":2158,"sortIndex":42,"researcher":28,"roles":2159,"affiliations":2160,"properties":2176,"displayName":2178,"givenName":28,"familyName":28},"a88509ce-55a9-48c5-b5ee-7519fb6e28ec",[978],[2161,2167],{"id":2112,"sortIndex":32,"affiliation":2162,"properties":28},{"id":2112,"createTime":28,"updateTime":28,"relativeEntities":2163,"slug":28,"properties":2164,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2166,"statistic":28},[],{"title":2165},{"VI":2117},[],{"id":2168,"sortIndex":40,"affiliation":2169,"properties":2175},"ae5e7e08-9bfb-446e-b8d7-14c80b149684",{"id":2168,"createTime":28,"updateTime":28,"relativeEntities":2170,"slug":28,"properties":2171,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2174,"statistic":28},[],{"title":2172},{"VI":2173},"Swedish Institute of Computer Science, Kista, Sweden",[],{},{"title":2177},{"VI":2178},"Stephen Pink",{"url":2105,"publisher":2180,"properties":2229},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2181,"slug":872,"properties":2182,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2185,"manageAffiliations":2198,"indexDatabases":2209,"url":28,"thumbnailPath":28,"statistic":2224,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2183,"title":2184},{"VOID":875},{"VOID":877},[2186,2190,2194],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":2187,"label":2188,"description":2189,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":2191,"label":2192,"description":2193,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":2195,"label":2196,"description":2197,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},[2199,2204],{"id":900,"createTime":28,"updateTime":28,"relativeEntities":2200,"slug":28,"properties":2201,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2203,"statistic":28},[],{"title":2202},{"EN":904},[906],{"id":908,"createTime":28,"updateTime":28,"relativeEntities":2205,"slug":28,"properties":2206,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2208,"statistic":28},[],{"title":2207},{"EN":912},[],[2210,2217],{"id":916,"indexDatabase":2211,"url":928,"indexYears":28,"academicFieldIds":2216,"indexDatabaseRanking":28},{"id":918,"createTime":28,"updateTime":28,"relativeEntities":2212,"label":2213,"description":2214,"key":925,"publicationTags":2215,"standard":28},[],{"EN":921,"VI":921},{"EN":923,"VI":924},[927,813],[930,931,932],{"id":934,"indexDatabase":2218,"url":940,"indexYears":941,"academicFieldIds":2223,"indexDatabaseRanking":946},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2219,"label":2220,"description":2221,"key":781,"publicationTags":2222,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[943,944,945],{"impactFactor":32,"impactFactorByYear":2225,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":40,"totalPublicationByYear":2226,"totalCitation":32,"totalCitationByYear":2227,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":2228,"hindexLast5Year":32,"hindex":32},{},{"2018":40},{},{},{"pages":2230,"volume":2232},{"VOID":2231},"375-387",{"VOID":2233},"3","1997-10-01",1997,[927,946]]