[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_feb78979-7e5a-4b6f-8487-c4f21ed98fc2":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:feb78979-7e5a-4b6f-8487-c4f21ed98fc2,\"}":882},{"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,783,800],{"id":773,"indexDatabase":774,"url":779,"indexYears":780,"academicFieldIds":781,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":775,"label":776,"description":777,"key":94,"publicationTags":778,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[782],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf",{"id":784,"indexDatabase":785,"url":797,"indexYears":28,"academicFieldIds":798,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":786,"createTime":28,"updateTime":28,"relativeEntities":787,"label":788,"description":790,"key":793,"publicationTags":794,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":789,"VI":789},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":791,"VI":792},"ESCI database","Cơ sở dữ liệu ESCI","esci",[795,796],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[799],"0db73426-2364-455f-81a4-efe0f91d712e",{"id":801,"indexDatabase":802,"url":812,"indexYears":813,"academicFieldIds":814,"indexDatabaseRanking":816},"6ace2085-a177-4a27-b309-8813b832111e",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":809,"publicationTags":810,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":806,"VI":806},"Scopus - Elsevier",{"EN":806,"VI":808},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[811],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[815],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE","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":880,"indexDatabases":881,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},"feb78979-7e5a-4b6f-8487-c4f21ed98fc2","2023-12-24T03:33:37.836+00:00","2024-12-27T13:58:55.791+00:00",[],"IEEE-Transactions-on-Systems-Man-and-Cybernetics-Part-B-Cybernetics-",{"issn":874,"title":876},{"VOID":875},"19410492",{"EN":877},"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)","PENDING",[],[],[],{"meta":883,"data":885},{"total":884},"26",[886,959,990,1073,1152,1213,1276,1341,1419,1492],{"id":887,"createTime":888,"updateTime":889,"relativeEntities":890,"slug":891,"properties":892,"entityType":903,"verifyStatus":26,"verifyTime":904,"verifyNote":905,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":906,"fullTextUrl":907,"authors":908,"publicationType":938,"publisherRelationship":939,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":957,"openAccess":28,"references":28,"isForceReanalyzing":958},"16821045-16c5-4e24-99ea-e64866944427","2023-12-24T03:34:54.816+00:00","2025-01-12T08:14:22.715+00:00",[],"Embedding-fuzzy-mechanisms-and-knowledge-in-box-type-reinforcement-learning-controllers",{"abstract":893,"title":895,"keywords":897,"references":899,"doi":901},{"EN":894},"In this paper, we report our study on embedding fuzzy mechanisms and knowledge into box-type reinforcement learning controllers. One previous approach for incorporating fuzzy mechanisms can only achieve one successful run out of nine tests compared to eight successful runs in a nonfuzzy learning control scheme. After analysis, the credit assignment problem and the weighting domination problem are identified. Furthermore, the use of fuzzy mechanisms in temporal difference seems to play a negative factor. Modifications to overcome those problems are proposed. Furthermore, several remedies are employed in that approach. The effects of those remedies applied to our learning scheme are presented and possible variations are also studied. Finally, the issue of incorporating knowledge into reinforcement learning systems is studied. From our simulations, it is concluded that the use of knowledge for the control network can provide good learning results, but the use of knowledge for the evaluation network alone seems unable to provide any significant advantages. Furthermore, we also employ Makarovic's (1988) rules as the knowledge for the initial setting of the control network. In our study, the rules are separated into four groups to avoid the ordering problem.",{"EN":896},"Embedding fuzzy mechanisms and knowledge in box-type reinforcement learning controllers",{"EN":898},"Fuzzy control,Supervised learning,Control systems,Unsupervised learning,System performance,Testing,Learning systems,Control system synthesis,Neural networks,Fuzzy systems",{"VOID":900},"10.1109\u002F91.273126\n10.1109\u002F72.159061\n10.1109\u002FICSMC.1999.816639\nschoknecht, 1999, using reinforcement learning for engine control, Proceedings of 9th International Conference on Artificial Neural Networks ICANN 99, 1, 329, 10.1049\u002Fcp:19991130\n10.1109\u002FIJCNN.1999.833414\n10.1109\u002FICIT.2000.854247\n10.1109\u002F3477.836376\n10.1007\u002FBF00115009\nhsieh, 1997, On the study of embedding fuzzy concept and prior knowledge in reinforcement learning\nkim, 1995, Analysis and study of neural-networks-based reinforcement learning\n10.1109\u002FTAC.1965.1098193\n10.1109\u002FJRPROC.1961.287775\n10.1109\u002FTSMC.1983.6313077\n10.1147\u002Frd.33.0210\n10.1002\u002Fint.4550060105\n10.1109\u002F37.24809\nlin, 1996, Neural Fuzzy System A Neuro-Fuzzy Synergism to Intelligent Systems\nkokar, 1992, learning control methods, needs, and architectures, An Introduction to Intelligent and Autonomous Control\n10.1080\u002F02533839.2001.9670633\n10.1109\u002FTSMC.1985.6313399\nyager, 1994, Essentials of Fuzzy Modeling and Control\n10.1109\u002FFUZZY.1992.258745\n10.1109\u002F21.97472\n10.1109\u002FTAC.1997.633847\nmakarovic, 1988, A qualitative way of solving the pole balancing problem",{"VOID":902},"10.1109\u002FTSMCB.2002.1033183","PUBLICATION","2025-01-12T08:14:22.714+00:00","Auto Verify","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033183\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033183",[909,925],{"id":910,"sortIndex":32,"researcher":28,"roles":911,"affiliations":913,"properties":922,"displayName":924,"givenName":28,"familyName":28},"a7a0f814-29eb-484d-a8fb-c52e7f20f18e",[912],"AUTHOR",[914],{"id":915,"sortIndex":32,"affiliation":916,"properties":28},"210aabd1-e38d-4753-9537-0056528556c6",{"id":915,"createTime":28,"updateTime":28,"relativeEntities":917,"slug":28,"properties":918,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":921,"statistic":28},[],{"title":919},{"VI":920},"National Taiwan University of Science and Technology, Taipei, Taiwan",[],{"title":923},{"VI":924},"Shun-Feng Su",{"id":926,"sortIndex":40,"researcher":28,"roles":927,"affiliations":928,"properties":935,"displayName":937,"givenName":28,"familyName":28},"28aef2d0-5103-4acb-a5b8-d325e42305ff",[912],[929],{"id":915,"sortIndex":32,"affiliation":930,"properties":28},{"id":915,"createTime":28,"updateTime":28,"relativeEntities":931,"slug":28,"properties":932,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":934,"statistic":28},[],{"title":933},{"VI":920},[],{"title":936},{"VI":937},"Sheng-Hsiung Hsieh","ARTICLE",{"url":906,"publisher":940,"properties":948},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":941,"slug":872,"properties":942,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":945,"manageAffiliations":946,"indexDatabases":947,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":943,"title":944},{"VOID":875},{"EN":877},[],[],[],{"issue":949,"pages":951,"volume":953},{"VOID":950},"5",{"VOID":952},"645-653",{"VOID":954},"32","2002-10-01",2002,[],false,{"id":960,"createTime":961,"updateTime":961,"relativeEntities":962,"slug":28,"properties":963,"entityType":903,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":972,"fullTextUrl":973,"authors":974,"publicationType":938,"publisherRelationship":975,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":989,"openAccess":28,"references":28,"isForceReanalyzing":958},"1e7d997f-599e-4b54-bbb5-89d024009e3b","2023-12-24T03:36:02.088+00:00",[],{"abstract":964,"title":966,"keywords":968,"doi":970},{"EN":965},"Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.",{"EN":967},"Call for papers",{"EN":969},"Genetics,Calculus",{"VOID":971},"10.1109\u002FTSMCB.2002.1033191","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033191\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033191",[],{"url":972,"publisher":976,"properties":984},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":977,"slug":872,"properties":978,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":981,"manageAffiliations":982,"indexDatabases":983,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":979,"title":980},{"VOID":875},{"EN":877},[],[],[],{"issue":985,"pages":986,"volume":988},{"VOID":950},{"VOID":987},"700-700",{"VOID":954},[],{"id":991,"createTime":992,"updateTime":993,"relativeEntities":994,"slug":995,"properties":996,"entityType":903,"verifyStatus":26,"verifyTime":1009,"verifyNote":905,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1010,"fullTextUrl":1011,"authors":1012,"publicationType":938,"publisherRelationship":1056,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":1070,"lastCitationAnalyze":1071,"indexDatabases":1072,"openAccess":28,"references":28,"isForceReanalyzing":958},"204e2efe-10fe-48dc-80d3-9e101ca9bfdb","2023-12-24T03:34:25.163+00:00","2026-02-18T12:34:39.259+00:00",[],"Modified-Gath-Geva-fuzzy-clustering-for-identification-of-Takagi-Sugeno-fuzzy-models",{"abstract":997,"title":999,"gsPaper":1001,"keywords":1003,"references":1005,"doi":1007},{"EN":998},"The construction of interpretable Takagi-Sugeno (TS) fuzzy models by means of clustering is addressed. First, it is shown how the antecedent fuzzy sets and the corresponding consequent parameters of the TS model can be derived from clusters obtained by the Gath-Geva (GG) algorithm. To preserve the partitioning of the antecedent space, linearly transformed input variables can be used in the model. This may, however, complicate the interpretation of the rules. To form an easily interpretable model that does not use the transformed input variables, a new clustering algorithm is proposed, based on the expectation-maximization (EM) identification of Gaussian mixture models. This new technique is applied to two well-known benchmark problems: the MPG (miles per gallon) prediction and a simulated second-order nonlinear process. The obtained results are compared with results from the literature.",{"EN":1000},"Modified Gath-Geva fuzzy clustering for identification of Takagi-Sugeno fuzzy models",{"VOID":1002},"[]",{"EN":1004},"Takagi-Sugeno model,Fuzzy sets,Fuzzy systems,Optimization methods,Clustering algorithms,Partitioning algorithms,Input variables,Multidimensional systems,Predictive models,Nonlinear systems",{"VOID":1006},"10.1007\u002F978-3-642-60767-7\nhoppner, 1999, Fuzzy Cluster Analysis&#x2014 Methods for Classification Data Analysis and Image Recognition\n10.1109\u002FFUZZY.1996.552396\njang, 1997, Neuro-Fuzzy and Soft Computing A Computational Approach to Learning and Machine Intelligence\n10.1109\u002F5.364486\n10.1109\u002F91.842154\njohansen, 2002, on multi-objective identification of takagi-sugeno fuzzy model parameters, Preprints 15th IFAC World Congress\n10.1109\u002F91.855918\nkambhatala, 1996, Local models and Gaussian mixture models for statistical data processing\n10.1109\u002F91.728458\n10.1109\u002FT-C.1975.224317\n10.1007\u002F978-3-642-60767-7_2\ndraper, 1994, Applied regression analysis\nbishop, 1995, Neural Networks for Pattern Recognition\n10.1038\u002F16873\n10.1109\u002F34.192473\nbabus˘ka babuska, 1998, Fuzzy Modeling for Control, 10.1007\u002F978-94-011-4868-9\ngustafson, 1979, fuzzy clustering with fuzzy covariance matrix, Proc IEEE CDC, 761\nabonyi, 2000, local and global identification and interpretation of parameters in takagi-sugeno fuzzy models, Proc IEEE ICFS, 835\nmurray-smith, 1997, Multiple Model Approaches to Nonlinear Modeling and Control\n10.1016\u002F0165-0114(86)90010-2\n10.1109\u002FFUZZY.2000.839128\n10.1109\u002FTSMC.1985.6313399\n10.1109\u002FTFUZZ.1993.390281\n10.1109\u002F91.705503",{"VOID":1008},"10.1109\u002FTSMCB.2002.1033180","2024-05-11T15:04:14.702+00:00","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033180\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033180",[1013,1028,1043],{"id":1014,"sortIndex":32,"researcher":28,"roles":1015,"affiliations":1016,"properties":1025,"displayName":1027,"givenName":28,"familyName":28},"21c97a32-1d9f-4448-b9ee-dbb6f1b12fe2",[912],[1017],{"id":1018,"sortIndex":32,"affiliation":1019,"properties":28},"fa5f80c4-9e2d-4cd9-a5e9-4ed626852c46",{"id":1018,"createTime":28,"updateTime":28,"relativeEntities":1020,"slug":28,"properties":1021,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1024,"statistic":28},[],{"title":1022},{"VI":1023},"Department of Process Engineering, University of Veszprem, Veszprem, Hungary",[],{"title":1026},{"VI":1027},"J. Abonyi",{"id":1029,"sortIndex":40,"researcher":28,"roles":1030,"affiliations":1031,"properties":1040,"displayName":1042,"givenName":28,"familyName":28},"3675211d-0a20-4190-8653-37b74cc336c8",[912],[1032],{"id":1033,"sortIndex":32,"affiliation":1034,"properties":28},"7152879d-22fb-4160-8dc7-e4b809d08606",{"id":1033,"createTime":28,"updateTime":28,"relativeEntities":1035,"slug":28,"properties":1036,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1039,"statistic":28},[],{"title":1037},{"VI":1038},"Control Systems Engineering Group, Department of Information Technology and Systems, Delft University of Technnology, Delft, Netherlands",[],{"title":1041},{"VI":1042},"R. Babuska",{"id":1044,"sortIndex":123,"researcher":28,"roles":1045,"affiliations":1046,"properties":1053,"displayName":1055,"givenName":28,"familyName":28},"7a922521-7ddf-4fc5-86bb-17864c0b87ea",[912],[1047],{"id":1018,"sortIndex":32,"affiliation":1048,"properties":28},{"id":1018,"createTime":28,"updateTime":28,"relativeEntities":1049,"slug":28,"properties":1050,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1052,"statistic":28},[],{"title":1051},{"VI":1023},[],{"title":1054},{"VI":1055},"F. Szeifert",{"url":1010,"publisher":1057,"properties":1065},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1058,"slug":872,"properties":1059,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1062,"manageAffiliations":1063,"indexDatabases":1064,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1060,"title":1061},{"VOID":875},{"EN":877},[],[],[],{"issue":1066,"pages":1067,"volume":1069},{"VOID":950},{"VOID":1068},"612-621",{"VOID":954},"ERROR_IN_GET_PLATFORM_ID","2026-02-18T12:34:39.258+00:00",[],{"id":1074,"createTime":1075,"updateTime":1076,"relativeEntities":1077,"slug":1078,"properties":1079,"entityType":903,"verifyStatus":26,"verifyTime":1090,"verifyNote":905,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1091,"fullTextUrl":1092,"authors":1093,"publicationType":938,"publisherRelationship":1137,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1151,"openAccess":28,"references":28,"isForceReanalyzing":958},"24bb2195-a7e2-4760-868e-4723fd3cfdf6","2023-12-24T03:33:47.175+00:00","2024-12-11T06:43:08.159+00:00",[],"A-generic-knowledge-guided-image-segmentation-and-labeling-system-using-fuzzy-clustering-algorithms",{"abstract":1080,"title":1082,"keywords":1084,"references":1086,"doi":1088},{"EN":1081},"Segmentation of an image into regions and the labeling of the regions is a challenging problem. In this paper, an approach that is applicable to any set of multifeature images of the same location is derived. Our approach applies to, for example, medical images of a region of the body; repeated camera images of the same area; and satellite images of a region. The segmentation and labeling approach described here uses a set of training images and domain knowledge to produce an image segmentation system that can be used without change on images of the same region collected over time. How to obtain training images, integrate domain knowledge, and utilize learning to segment and label images of the same region taken under any condition for which a training image exists is detailed. It is shown that clustering in conjunction with image processing techniques utilizing an iterative approach can effectively identify objects of interest in images. The segmentation and labeling approach described here is applied to color camera images and two other image domains are used to illustrate the applicability of the approach.",{"EN":1083},"A generic knowledge-guided image segmentation and labeling system using fuzzy clustering algorithms",{"EN":1085},"Image segmentation,Labeling,Fuzzy systems,Clustering algorithms,Color,Partitioning algorithms,Cameras,Machine vision,Magnetic resonance,Computer science",{"VOID":1087},"anderson, 1978, An Introduction to the Statistical Analysis of Data\n10.1016\u002FS0165-0114(96)00232-1\n10.1109\u002F69.755625\n10.1016\u002FS0954-1810(98)00021-1\n10.1007\u002FBF00114160\n10.1038\u002Fsj\u002Fjors\u002F0450408\n10.1145\u002F312129.312220\nturney, 1995, cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm, J Artif Intell Res, 2, 369, 10.1613\u002Fjair.120\n10.1109\u002F34.310684\nquinlan, 1993, C4 5 Programs for Machine Learning\n10.1016\u002F1049-9660(91)90065-W\n10.1016\u002FS0933-3657(00)00073-7\n10.1109\u002F42.57771\n10.1109\u002F42.511748\n10.1016\u002F0031-3203(94)00124-5\nezquerra, 1996, knowledge-guided segmentation of 3-d imagery, CVGIP Graph Models Image Process, 58, 512\n10.1016\u002F0895-6111(91)90081-6\n10.1109\u002FTPAMI.1985.4767704\n10.1109\u002F42.700731\n10.1142\u002FS0218001400000660\n10.1016\u002F0031-3203(95)00120-4\n10.1016\u002FS0020-7373(87)80034-2\nclarke, 1992, comparison of supervised pattern recognition techniques and unsupervised methods for mri segmentation, Proc SPIE, 1652, 668, 10.1117\u002F12.59477\n10.1109\u002F34.85677\n10.1016\u002F0730-725X(95)00012-6\nbezdek, 1992, Fuzzy Models for Pattern Recognition\n10.1007\u002FBF00114265\n10.1109\u002F3477.809032\n10.1109\u002F34.643893\n10.1002\u002F(SICI)1098-111X(199711\u002F12)12:11\u002F12\u003C793::AID-INT2>3.3.CO;2-X\n10.1118\u002F1.597000\n10.1109\u002FTPAMI.1986.4767852\njain, 1995, Machine Vision\ndempster, 1977, maximum likelihood from incomplete data via the em algorithm, J R Statist Soc B, 39, 185\ngiarratano, 1994, Expert Systems Principles and Programming\n10.1109\u002F91.366564\n10.1006\u002Fciun.1994.1014\ngonzalez, 2001, Digital Image Processing\nhayes-roth, 1983, Building Expert Systems\n10.1016\u002F0146-664X(79)90001-7",{"VOID":1089},"10.1109\u002FTSMCB.2002.1033177","2024-12-11T06:43:08.158+00:00","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033177\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033177",[1094,1109,1124],{"id":1095,"sortIndex":32,"researcher":28,"roles":1096,"affiliations":1097,"properties":1106,"displayName":1108,"givenName":28,"familyName":28},"32fec8cd-2b6c-4e04-a966-686c0d040080",[912],[1098],{"id":1099,"sortIndex":32,"affiliation":1100,"properties":28},"94cbb897-b789-4edb-89f5-18256d065819",{"id":1099,"createTime":28,"updateTime":28,"relativeEntities":1101,"slug":28,"properties":1102,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1105,"statistic":28},[],{"title":1103},{"VI":1104},"Department of Computer Science, Winona State University, Winona, MN, USA",[],{"title":1107},{"VI":1108},"Mingrui Zhang",{"id":1110,"sortIndex":40,"researcher":28,"roles":1111,"affiliations":1112,"properties":1121,"displayName":1123,"givenName":28,"familyName":28},"58298a60-bc7b-463e-9c90-7ccd82da1f19",[912],[1113],{"id":1114,"sortIndex":32,"affiliation":1115,"properties":28},"dd9d4f6b-16ce-4684-a35a-36f076610248",{"id":1114,"createTime":28,"updateTime":28,"relativeEntities":1116,"slug":28,"properties":1117,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1120,"statistic":28},[],{"title":1118},{"VI":1119},"Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA",[],{"title":1122},{"VI":1123},"L.O. Hall",{"id":1125,"sortIndex":123,"researcher":28,"roles":1126,"affiliations":1127,"properties":1134,"displayName":1136,"givenName":28,"familyName":28},"14567234-1cb0-4dcf-adc3-92a0b3df2a64",[912],[1128],{"id":1114,"sortIndex":32,"affiliation":1129,"properties":28},{"id":1114,"createTime":28,"updateTime":28,"relativeEntities":1130,"slug":28,"properties":1131,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1133,"statistic":28},[],{"title":1132},{"VI":1119},[],{"title":1135},{"VI":1136},"D.B. Goldgof",{"url":1091,"publisher":1138,"properties":1146},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1139,"slug":872,"properties":1140,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1143,"manageAffiliations":1144,"indexDatabases":1145,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1141,"title":1142},{"VOID":875},{"EN":877},[],[],[],{"issue":1147,"pages":1148,"volume":1150},{"VOID":950},{"VOID":1149},"571-582",{"VOID":954},[],{"id":1153,"createTime":1154,"updateTime":1154,"relativeEntities":1155,"slug":28,"properties":1156,"entityType":903,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1167,"fullTextUrl":1168,"authors":1169,"publicationType":938,"publisherRelationship":1198,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1212,"openAccess":28,"references":28,"isForceReanalyzing":958},"2a6f8585-6889-4734-bf10-cc5ac3194b71","2023-12-24T03:35:03.404+00:00",[],{"abstract":1157,"title":1159,"keywords":1161,"references":1163,"doi":1165},{"EN":1158},"A dual neural network is presented for the real-time joint torque optimization of kinematically redundant manipulators, which corresponds to global kinetic energy minimization of robot mechanisms. Compared to other computational strategies on inverse kinematics, the dual network is developed at the acceleration level to resolve redundancy of limited-joint-range manipulators. The dual network has a simple architecture with only one layer of neurons and is proved to be globally exponentially convergent to optimal solutions. The dual neural network is simulated with the PUMA 560 robot arm to demonstrate effectiveness.",{"EN":1160},"A dual neural network for constrained joint torque optimization of kinematically redundant manipulators",{"EN":1162},"Neural networks,Torque,Constraint optimization,Manipulators,Robots,Kinetic energy,Computer networks,Kinematics,Acceleration,Energy resolution",{"VOID":1164},"10.1109\u002F3477.826952\nkazerounian, 1987, redundancy resolution of robotic manipulators at the acceleration level, Proc 7th World Congress Theory of Machines and Mechanisms (IFToMM)\nsuh, 1987, local versus global torque optimization of redundant manipulators, Proc IEEE Int Conf Robotics and Automation\n10.1109\u002F72.788651\n10.1109\u002F41.744418\n10.1109\u002F3477.907567\n10.1109\u002F3477.907574\nbazaraa, 1993, Nonlinear Programming&#x2014 Theory and Algorithms\nbertsekas, 1989, Parallel and Distributed Computation Numerical Methods\n10.1007\u002FBF01268170\n10.1109\u002F70.631238\n10.1177\u002F027836498500400201\n10.1002\u002Frob.4620060508\n10.1109\u002FJRA.1987.1087111\n10.1002\u002F(SICI)1097-4563(199603)13:3\u003C177::AID-ROB5>3.0.CO;2-P\n10.1002\u002Frob.4620100206\n10.1017\u002FS0263574797000027\nsciavicco, 2000, Modeling and Control of Robot Manipulators, 10.1007\u002F978-1-4471-0449-0\n10.1109\u002F41.510637\n10.1137\u002FS1052623493246045\n10.1109\u002F72.857782\n10.1137\u002FS0363012992241673\n10.1109\u002FROBOT.1994.351360\n10.1109\u002F9.917666",{"VOID":1166},"10.1109\u002FTSMCB.2002.1033184","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033184\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033184",[1170,1185],{"id":1171,"sortIndex":32,"researcher":28,"roles":1172,"affiliations":1173,"properties":1182,"displayName":1184,"givenName":28,"familyName":28},"98270eba-50c8-410c-8e1e-381b890be168",[912],[1174],{"id":1175,"sortIndex":32,"affiliation":1176,"properties":28},"eb06e0e4-d6fa-4191-b12c-39a73bacb3fc",{"id":1175,"createTime":28,"updateTime":28,"relativeEntities":1177,"slug":28,"properties":1178,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1181,"statistic":28},[],{"title":1179},{"VI":1180},"Department of Automation and Computer-Aided Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China",[],{"title":1183},{"VI":1184},"Yunong Zhang",{"id":1186,"sortIndex":40,"researcher":28,"roles":1187,"affiliations":1188,"properties":1195,"displayName":1197,"givenName":28,"familyName":28},"d7f7e921-bdb9-4d12-be90-6a7496b76f60",[912],[1189],{"id":1175,"sortIndex":32,"affiliation":1190,"properties":28},{"id":1175,"createTime":28,"updateTime":28,"relativeEntities":1191,"slug":28,"properties":1192,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1194,"statistic":28},[],{"title":1193},{"VI":1180},[],{"title":1196},{"VI":1197},"Jun Wang",{"url":1167,"publisher":1199,"properties":1207},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1200,"slug":872,"properties":1201,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1204,"manageAffiliations":1205,"indexDatabases":1206,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1202,"title":1203},{"VOID":875},{"EN":877},[],[],[],{"issue":1208,"pages":1209,"volume":1211},{"VOID":950},{"VOID":1210},"654-662",{"VOID":954},[],{"id":1214,"createTime":1215,"updateTime":1215,"relativeEntities":1216,"slug":28,"properties":1217,"entityType":903,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1228,"fullTextUrl":1229,"authors":1230,"publicationType":938,"publisherRelationship":1261,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1275,"openAccess":28,"references":28,"isForceReanalyzing":958},"49fe52b4-5bc6-45ea-bf52-4af80188896e","2023-12-24T03:34:32.412+00:00",[],{"abstract":1218,"title":1220,"keywords":1222,"references":1224,"doi":1226},{"EN":1219},"By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set with the resulting multivariable function being constructed within any specified precision to the original sample set. The given sample sets are first decomposed into a cluster of simpler sample sets such that a single input fuzzy system is constructed readily for a sample set extracted directly from the cluster independent of the other variables. Once the relevant fuzzy rules and membership functions are constructed for each of the variables completely independent of the other variables, the resulting decomposed fuzzy rules and membership functions are integrated back into the fuzzy system appropriate for the original sample set requiring only a moderate cost of computation in the required decomposition and composition processes. After proving two basic theorems which we need to ensure the validity of the decomposition and composition processes of the system construction, we have demonstrated a constructive algorithm of a multivariable fuzzy system. Exploiting an implicit error bound analysis available at each of the construction steps, the present Fourier method is capable of implementing a more stable fuzzy system than the power series expansion method of ParNeuFuz and PolyNeuFuz, covering and implementing a wider range of more robust applications.",{"EN":1221},"An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method",{"EN":1223},"Fuzzy systems,Fourier series,Fuzzy sets,Control systems,Computer science,Input variables,Inference algorithms,Cost function,Computational efficiency,Error analysis",{"VOID":1225},"harding, 1985, Fourier Series and Transforms\nishibuchi, 1995, determination of type ii membership functions by fuzzified neural networks, Proc EUFIT, 529\n10.1016\u002F0165-0114(92)90032-Y\njager, 1995, Fuzzy logic in control\n10.1109\u002F72.159060\nkarr, 1991, design of an adaptive fuzzy logic controller using a genetic algorithm, Proc 4th ICGA, 450\n10.1109\u002FANNES.1993.323062\nkhan, 1993, neural network-based algorithms for rule evaluation and defuzzification in fuzzy logic design, Proc WCNN, ii, 31\n10.1007\u002F3-540-60607-6_4\n10.1109\u002FFUZZY.1993.327412\n10.1109\u002FICNN.1995.487352\n10.1016\u002FS0165-0114(99)00042-1\nchen, 1996, automatic generating of fuzzy system by neural networks, Chin J Acta Electron Sinica, 24, 32\n10.1109\u002FANZIIS.1995.705734\nchen, 1995, generate multivariable fuzzy system through neural networks, Proc IEEE ICNNSP, 1, 301\nchen, 1995, using neural networks to extract fuzzy rules and membership functions, Proc ICONIP, 2, 517\ncauchy, 1847, methode generale pour la resolution des systemes d'equations simultanees, Comp Rend Acad Sci Paris, 23, 536\nczarnecki, 1995, the application of fuzzy logic to real time multiple robot collision avoidance, Proc ICSC Fuzzy Logic Symp, 116c\n10.1109\u002F12.324566\n10.1109\u002F21.52551\nmeredith, 1992, the use of genetic algorithms in the design of fuzzy logic controllers, Proc 3rd Workshop Neural Networks, 549\nluenberger, 1984, Linear and Nonlinear Programming\nschwartz, 1990, fuzzy systems in the real world, AI Expert, 5, 28\npress, 1986, Numberical Recipes",{"VOID":1227},"10.1109\u002FTSMCB.2002.1033181","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033181\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033181",[1231,1246],{"id":1232,"sortIndex":32,"researcher":28,"roles":1233,"affiliations":1234,"properties":1243,"displayName":1245,"givenName":28,"familyName":28},"cf93a724-7181-4e7b-b4e7-4851f8c9a1fc",[912],[1235],{"id":1236,"sortIndex":32,"affiliation":1237,"properties":28},"1fed907c-5607-4065-bd69-bc478b6e2223",{"id":1236,"createTime":28,"updateTime":28,"relativeEntities":1238,"slug":28,"properties":1239,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1242,"statistic":28},[],{"title":1240},{"VI":1241},"Department of Math and Computer Science, University of Northern British Columbia, Prince George, BC, Canada",[],{"title":1244},{"VI":1245},"Liang Chen",{"id":1247,"sortIndex":40,"researcher":28,"roles":1248,"affiliations":1249,"properties":1258,"displayName":1260,"givenName":28,"familyName":28},"53c20a70-a9e5-43ec-8f56-074c697e207a",[912],[1250],{"id":1251,"sortIndex":32,"affiliation":1252,"properties":28},"0121688f-accf-4f6a-9b7a-6c9fabcdbbc8",{"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},"Department of Computer Science, Utsunomiya University, Utsunomiya, Japan",[],{"title":1259},{"VI":1260},"N. Tokuda",{"url":1228,"publisher":1262,"properties":1270},{"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":1268,"indexDatabases":1269,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1265,"title":1266},{"VOID":875},{"EN":877},[],[],[],{"issue":1271,"pages":1272,"volume":1274},{"VOID":950},{"VOID":1273},"622-629",{"VOID":954},[],{"id":1277,"createTime":1278,"updateTime":1279,"relativeEntities":1280,"slug":1281,"properties":1282,"entityType":903,"verifyStatus":26,"verifyTime":1279,"verifyNote":905,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1293,"fullTextUrl":1294,"authors":1295,"publicationType":938,"publisherRelationship":1326,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1340,"openAccess":28,"references":28,"isForceReanalyzing":958},"6cad2707-17e5-4035-9bfe-94b412f021d4","2023-12-24T03:34:12.558+00:00","2025-01-15T21:56:01.827+00:00",[],"Complexity-reduction-for-large-image-processing",{"abstract":1283,"title":1285,"keywords":1287,"references":1289,"doi":1291},{"EN":1284},"We present a method for sampling feature vectors in large (e.g., 2000 \u002Fspl times\u002F 5000 \u002Fspl times\u002F 16 bit) images that finds subsets of pixel locations which represent c \"regions\" in the image. Samples are accepted by the chi-square (\u002Fspl chi\u002F\u002Fsup 2\u002F) or divergence hypothesis test. A framework that captures the idea of efficient extension of image processing algorithms from the samples to the rest of the population is given. Computationally expensive (in time and\u002For space) image operators (e.g., neural networks (NNs) or clustering models) are trained on the sample, and then extended noniteratively to the rest of the population. We illustrate the general method using fuzzy c-means (FCM) clustering to segment Indian satellite images. On average, the new method can achieve about 99% accuracy (relative to running the literal algorithm) using roughly 24% of the image for training. This amounts to an average savings of 76% in CPU time. We also compare our method to its closest relative in the group of schemes used to accelerate FCM: our method averages a speedup of about 4.2, whereas the multistage random sampling approach achieves an average acceleration of 1.63.",{"EN":1286},"Complexity reduction for \"large image\" processing",{"EN":1288},"Image processing,Image sampling,Clustering algorithms,Acceleration,Pixel,Testing,Computer networks,Neural networks,Image segmentation,Satellites",{"VOID":1290},"10.1007\u002F978-3-642-88087-2\n1993, Interactive Data Language (IDL) Ver 3 1 Users Guide\nde la paz, 1986, approximate fuzzy \u003Cformula>\u003Ctex>$c$\u003C\u002Ftex>\u003C\u002Fformula>-means (afcm) cluster analysis of medical magnetic resonance image (mri) data—a system for medical research and education, IEEE Transactions on Geoscience and Remote Sensing, ge 25, 815\nmorrison, 1994, an introduction to segmentation of magnetic resonance images, Aust Comput J, 26, 90\n10.1109\u002FTPAMI.1986.4767778\n10.1109\u002FTGRS.1986.289598\n10.1016\u002F0031-3203(94)90118-X\n10.1109\u002FNAFIPS.2001.944766\numa shankar, 1994, ffcm: an effective approach for large data sets, Proc 3rd Int Conf Fuzzy Logic Neural Nets and Soft Computing IIZUKA, 331\ncheng, 1995, fast clustering with application to fuzzy rule generation, Proceedings of the IEEE International Conference on Fuzzy Systems, 2289\n10.1145\u002F223784.223812\n10.1016\u002FS0306-4379(01)00008-4\nbezdek, 2002, Some Notes on Alternating Optimization in Advances in Soft Computing AFSS, 289\ndomingos, 2001, a general method for scaling up machine learning algorithms and its application to clustering, Proc 18th Int Conf Machine Learning, 106\n10.1080\u002F01621459.1963.10500830\nharalick, 1992, Computer and Robot Vision, 1\ngonzalez, 1992, Digital Image Processing\nkendall, 1979, The Advanced Theory of Statistics Vol 2 Inference and Relationship\ngibbons, 1992, Nonparametric Statistical Inference\ncochran, 1977, Sampling Techniques\nkullback, 1959, Information Theory and Statistics\n10.1007\u002F978-1-4757-0450-1\n10.1111\u002Fj.1365-2818.1990.tb02958.x\nchen, 2000, intelligent methodology for sensing, modeling and control of pulsed gtaw: part ii—butt joint welding, Weld Res Supplement, 164\n10.1109\u002F72.159057\nzhang, 1995, birch: an efficient data clustering method for very large databases, Proc ACM SIGMOD, 103\nfayyad, 1995, from massive data sets to science catalogs: applications and challenges, Proc Workshop Massive Data Sets\n10.1002\u002Fjmri.1880050520\n10.1109\u002F2.781633\nbradley, 1998, scaling clustering algorithms to large databases, Proc 4th Int Conf Knowledge Discovery and Data Mining, 9\nchen, 2000, intelligent methodology for sensing, modeling, and control of pulsed gtaw: part i—bead-on-plate welding, Weld Res Supplement, 151\n10.1109\u002FICDE.1999.754966\nbowyer, 1996, the digital database for screening mammography, Proc 3rd Int Workshop Digital Mammography 58\nfisher, 1954, Statistical Methods for Research Workers\n10.1109\u002F91.660808\nrosenfeld, 1982, Digital Picture Processing\n10.1007\u002Fb106267\nhathaway, 0, convergence of alternating optimization, Comput Optim Appl\n10.1109\u002FFUZZY.1994.343855\njain, 1996, image segmentation by clustering, Advances in Image Understanding, 65\n10.1109\u002F91.917113",{"VOID":1292},"10.1109\u002FTSMCB.2002.1033179","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033179\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033179",[1296,1311],{"id":1297,"sortIndex":32,"researcher":28,"roles":1298,"affiliations":1299,"properties":1308,"displayName":1310,"givenName":28,"familyName":28},"68eaeb4e-287c-4678-895f-a629dcfe065e",[912],[1300],{"id":1301,"sortIndex":32,"affiliation":1302,"properties":28},"290ed5c3-b868-4ec5-a037-c7efacb708e0",{"id":1301,"createTime":28,"updateTime":28,"relativeEntities":1303,"slug":28,"properties":1304,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1307,"statistic":28},[],{"title":1305},{"VI":1306},"Electronics and Communication Sciences Unit, Indian Statistical Institute, Calcutta, India",[],{"title":1309},{"VI":1310},"N.R. Pal",{"id":1312,"sortIndex":40,"researcher":28,"roles":1313,"affiliations":1314,"properties":1323,"displayName":1325,"givenName":28,"familyName":28},"0787228f-1495-4a24-98ae-892e2e56f85a",[912],[1315],{"id":1316,"sortIndex":32,"affiliation":1317,"properties":28},"18886b9a-1984-4917-a5a1-f53c75fcdef1",{"id":1316,"createTime":28,"updateTime":28,"relativeEntities":1318,"slug":28,"properties":1319,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1322,"statistic":28},[],{"title":1320},{"VI":1321},"Department of Computer Science, University of West Florida, Pensacola, FL, USA",[],{"title":1324},{"VI":1325},"J.C. Bezdek",{"url":1293,"publisher":1327,"properties":1335},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1328,"slug":872,"properties":1329,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1332,"manageAffiliations":1333,"indexDatabases":1334,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1330,"title":1331},{"VOID":875},{"EN":877},[],[],[],{"issue":1336,"pages":1337,"volume":1339},{"VOID":950},{"VOID":1338},"598-611",{"VOID":954},[],{"id":1342,"createTime":1343,"updateTime":1344,"relativeEntities":1345,"slug":1346,"properties":1347,"entityType":903,"verifyStatus":26,"verifyTime":1344,"verifyNote":905,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1358,"fullTextUrl":1359,"authors":1360,"publicationType":938,"publisherRelationship":1404,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1418,"openAccess":28,"references":28,"isForceReanalyzing":958},"811f0f98-4c8c-410e-99f5-37532c2ac6fe","2023-12-24T03:35:30.945+00:00","2025-01-12T12:01:57.743+00:00",[],"Generating-learning-sequences-for-decision-makers-through-data-mining-and-competence-set-expansion",{"abstract":1348,"title":1350,"keywords":1352,"references":1354,"doi":1356},{"EN":1349},"For each decision problem, there is a competence set, proposed by Yu (1990), consisting of ideas, knowledge, information, and skills required for solving the problem. Thus, it is reasonable that we view a set of useful patterns discovered from a relational database by data mining techniques as a needed competence set for solving one problem. Significantly, when decision makers have not acquired the competence set, they may lack confidence in making decisions. In order to effectively acquire a needed competence set to cope with the corresponding problem, it is necessary to find appropriate learning sequences for acquiring those useful patterns, the so-called competence set expansion. This paper thus proposes an effective method consisting of two phases to generate learning sequences. The first phase finds a competence set consisting of useful patterns by using a proposed data mining technique. The other phase expands that competence set with minimum learning cost by the minimum spanning table method (Feng and Yu (1998)). From a numerical example, we can see that it is possible to help decision makers to solve the decision problems by use of the data mining technique and the competence set expansion, enabling them to make better decisions.",{"EN":1351},"Generating learning sequences for decision makers through data mining and competence set expansion",{"EN":1353},"Data mining,Relational databases,Costs,Decision making,Fuzzy sets,Pattern analysis,Time measurement,Information management,Technology management,Mathematics",{"VOID":1355},"10.1109\u002F3477.604117\nhan, 2001, Data Mining Concepts and Techniques\n10.1109\u002F91.413232\n10.1109\u002F3477.790443\n10.1016\u002FS0360-8352(02)00136-5\n10.1109\u002F21.199466\n10.1109\u002F91.273127\n10.1007\u002F978-1-4757-0450-1\nagrawal, 1995, fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, 307\n10.1007\u002FBF02196594\nhwang, 2001, multistages optimal expansion of competence sets in fuzzy environment, Int J Fuzzy Syst, 3, 486\n10.1016\u002F0165-4896(90)90005-R\n10.1023\u002FA:1021755117744\n10.1016\u002FS0950-7051(02)00079-5\n10.1016\u002F0020-0255(75)90036-5\n10.1016\u002FS0019-9958(65)90241-X\n10.1145\u002F345124.345167\nberry, 1997, Data Mining Techniques For Marketing Sales and Customer Support\n10.1007\u002F978-94-015-7949-0\nhu, 2001, discovering fuzzy concepts for expanding competence set, Proc 2nd Int Symp Advanced Intelligent Systems, 396\nadriaans, 1996, Data Mining\npedrycz, 1998, An Introduction to Fuzzy Sets Analysis and Design, 10.7551\u002Fmitpress\u002F3926.001.0001\n10.1007\u002F978-3-642-61295-4\n10.1016\u002FS0377-2217(98)00397-X",{"VOID":1357},"10.1109\u002FTSMCB.2002.1033188","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033188\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033188",[1361,1376,1389],{"id":1362,"sortIndex":32,"researcher":28,"roles":1363,"affiliations":1364,"properties":1373,"displayName":1375,"givenName":28,"familyName":28},"b9272453-5acc-4eb7-967a-5fb6a5fc6cdf",[912],[1365],{"id":1366,"sortIndex":32,"affiliation":1367,"properties":28},"8ee47d62-8701-49f2-98bc-bd0dbd5eaad8",{"id":1366,"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":1372,"statistic":28},[],{"title":1370},{"VI":1371},"Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan",[],{"title":1374},{"VI":1375},"Yi-Chung Hu",{"id":1377,"sortIndex":40,"researcher":28,"roles":1378,"affiliations":1379,"properties":1386,"displayName":1388,"givenName":28,"familyName":28},"03ef980d-fa36-4aca-8ed1-bddec33e0e72",[912],[1380],{"id":1366,"sortIndex":32,"affiliation":1381,"properties":28},{"id":1366,"createTime":28,"updateTime":28,"relativeEntities":1382,"slug":28,"properties":1383,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1385,"statistic":28},[],{"title":1384},{"VI":1371},[],{"title":1387},{"VI":1388},"Ruey-Shun Chen",{"id":1390,"sortIndex":123,"researcher":28,"roles":1391,"affiliations":1392,"properties":1401,"displayName":1403,"givenName":28,"familyName":28},"c830e53b-74a4-43e1-be56-1e511371c5b3",[912],[1393],{"id":1394,"sortIndex":32,"affiliation":1395,"properties":28},"594de789-4bd0-4434-a3e9-24374113163f",{"id":1394,"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":1400,"statistic":28},[],{"title":1398},{"VI":1399},"Institute of Management of Technology, National Chiao Tung University, Hsinchu, Taiwan",[],{"title":1402},{"VI":1403},"Gwo-Hshiung Tzeng",{"url":1358,"publisher":1405,"properties":1413},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1406,"slug":872,"properties":1407,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1410,"manageAffiliations":1411,"indexDatabases":1412,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1408,"title":1409},{"VOID":875},{"EN":877},[],[],[],{"issue":1414,"pages":1415,"volume":1417},{"VOID":950},{"VOID":1416},"679-686",{"VOID":954},[],{"id":1420,"createTime":1421,"updateTime":1422,"relativeEntities":1423,"slug":1424,"properties":1425,"entityType":903,"verifyStatus":878,"verifyTime":1422,"verifyNote":1436,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1437,"fullTextUrl":1438,"authors":1439,"publicationType":938,"publisherRelationship":1477,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1491,"openAccess":28,"references":28,"isForceReanalyzing":958},"88d1659e-6304-40f6-9736-2fadd365d1e7","2023-12-24T03:35:06.879+00:00","2025-01-07T19:12:33.622+00:00",[],"A-merge-based-condensing-strategy-for-multiple-prototype-classifiers",{"abstract":1426,"title":1428,"keywords":1430,"references":1432,"doi":1434},{"EN":1427},"A class-conditional hierarchical clustering framework has been used to generalize and improve previously proposed condensing schemes to obtain multiple prototype classifiers. The proposed method conveniently uses geometric properties and clusters to efficiently obtain reduced sets of prototypes that accurately represent the data while significantly keeping its discriminating power. The benefits of the proposed approach are empirically assessed with regard to other previously proposed algorithms which are similar in their foundations. Other well-known multiple prototype classifiers have also been taken into account in the comparison.",{"EN":1429},"A merge-based condensing strategy for multiple prototype classifiers",{"EN":1431},"Prototypes,Clustering algorithms,Nearest neighbor searches,Neural networks,Adaptive algorithm",{"VOID":1433},"kohonen, 1995, Self-Organizing Maps, 10.1007\u002F978-3-642-97610-0\n10.1016\u002F0031-3203(93)90040-4\n10.1016\u002F0167-8655(94)00070-J\n10.1093\u002Fcomjnl\u002F26.4.354\n10.1109\u002FIVELEC.2009.5193407\n10.1109\u002FICNN.1988.23829\nking, 1992, Statlog Databases\n10.1016\u002FS0167-8655(97)00035-4\n10.1109\u002FTSMC.1972.4309137\n1997, LVQ PAK The learning vector quantization package\n10.1109\u002F21.278999\n10.1109\u002FTIT.1968.1054155\nchang, 1974, finding prototypes for nearest neighbor classifiers, IEEE Trans Computes, c 23, 1179, 10.1109\u002FT-C.1974.223827\n10.1109\u002F5326.661099\n10.1109\u002F5326.661091\n10.1109\u002F5.58325\ndevijver, 1982, Pattern Recognition a Statistical Approach\nmollineda, 2001, Hierarchical agglomerative clustering for prototype selection and distance-based classification use in cyclic strings\ndasarathy, 1991, Nearest Neighbor (NN) Norms NN Pattern Classification Techniques\nwebb, 1999, Statistical Pattern Recognition",{"VOID":1435},"10.1109\u002FTSMCB.2002.1033185","Author affiliation is blank","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033185\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033185",[1440,1455,1470],{"id":1441,"sortIndex":32,"researcher":28,"roles":1442,"affiliations":1443,"properties":1452,"displayName":1454,"givenName":28,"familyName":28},"547325fc-903b-4c8c-a013-c08ba0c57ea4",[912],[1444],{"id":1445,"sortIndex":32,"affiliation":1446,"properties":28},"fc2b6ccb-4ecd-4ac3-a643-f2829cef7246",{"id":1445,"createTime":28,"updateTime":28,"relativeEntities":1447,"slug":28,"properties":1448,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1451,"statistic":28},[],{"title":1449},{"VI":1450},"Institut Tecnològic dInformàtica, Universitat Politécnica de Valéncia, Valencia, Spain",[],{"title":1453},{"VI":1454},"R.A. Mollineda",{"id":1456,"sortIndex":40,"researcher":28,"roles":1457,"affiliations":1458,"properties":1467,"displayName":1469,"givenName":28,"familyName":28},"754ff62f-0149-46b1-b6ba-9cfcc443faa3",[912],[1459],{"id":1460,"sortIndex":32,"affiliation":1461,"properties":28},"0f361b62-b141-4768-8211-73392f709553",{"id":1460,"createTime":28,"updateTime":28,"relativeEntities":1462,"slug":28,"properties":1463,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1466,"statistic":28},[],{"title":1464},{"VI":1465},"Departamento dInformática, Universitat de València, Burjassot, Spain",[],{"title":1468},{"VI":1469},"F.J. Ferri",{"id":1471,"sortIndex":123,"researcher":28,"roles":1472,"affiliations":1473,"properties":1474,"displayName":1476,"givenName":28,"familyName":28},"de4e6003-eb0d-40f4-b905-124cbf29c5f7",[912],[],{"title":1475},{"VI":1476},"E. Vidal",{"url":1437,"publisher":1478,"properties":1486},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1479,"slug":872,"properties":1480,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1483,"manageAffiliations":1484,"indexDatabases":1485,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1481,"title":1482},{"VOID":875},{"EN":877},[],[],[],{"issue":1487,"pages":1488,"volume":1490},{"VOID":950},{"VOID":1489},"662-668",{"VOID":954},[],{"id":1493,"createTime":1494,"updateTime":1495,"relativeEntities":1496,"slug":1497,"properties":1498,"entityType":903,"verifyStatus":26,"verifyTime":1509,"verifyNote":905,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1510,"fullTextUrl":1511,"authors":1512,"publicationType":938,"publisherRelationship":1543,"citationCount":28,"citationInfo":28,"publishDate":955,"publishYear":956,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1557,"openAccess":28,"references":28,"isForceReanalyzing":958},"9e25fab5-00d9-4c10-a39e-f061698f721a","2023-12-24T03:33:37.832+00:00","2025-01-28T14:57:05.826+00:00",[],"Defect-detection-in-textured-materials-using-optimized-filters",{"abstract":1499,"title":1501,"keywords":1503,"references":1505,"doi":1507},{"EN":1500},"The problem of automated defect detection in textured materials is investigated. A new approach for defect detection using linear FIR filters with optimized energy separation is proposed. The performance of different feature separation criteria with reference to fabric defects has been evaluated. The issues relating to the design of optimal filters for supervised and unsupervised web inspection are addressed. A general web inspection system based on the optimal filters is proposed. The experiments on this new approach have yielded excellent results. The low computational requirement confirms the usefulness of the approach for industrial inspection.",{"EN":1502},"Defect detection in textured materials using optimized filters",{"EN":1504},"Finite impulse response filter,Inspection,Gabor filters,IIR filters,Fabrics,Information filtering,Information filters,Quality assurance,Textile industry,Production",{"VOID":1506},"Özdemir, 1996, markov random fields and karhunen-loève transforms for defect inspection of textile products, Proc IEEE Conf Emerging Technologies and Factory Automation EFTA 96, 2, 697\n10.1109\u002FIAS.2001.955418\n10.1117\u002F1.601751\ncampbell, 1997, Flaw detection in woven textiles using space-dependent fourier transform\n10.1117\u002F1.601692\n10.1117\u002F1.600663\n10.1117\u002F1.601054\nvachtsevanos, 1998, Method and apparatus for analyzing an image to detect and identify defects\n10.1117\u002F1.1327837\n10.1109\u002F28.993164\nmead, 1978, Method for Automatic Fabric Inspection\n10.1109\u002F28.871274\n10.1016\u002F0143-8166(95)00044-O\n10.1109\u002F28.806035\n10.1109\u002FISIE.1999.796918\n10.1016\u002F0167-8655(84)90044-8\n10.1109\u002FICPR.1992.201654\nade, 1984, comparison of various filter sets for defect detection in textiles, Proc 7th Int Conf Pattern Recognit, 1, 428\n10.1109\u002FIECON.1993.339359\n10.1142\u002FS0218001496000554\n10.1016\u002FS0262-8856(99)00009-8\n10.1177\u002F004051759606600710\n10.1016\u002F0031-3203(91)90143-S\n10.1109\u002F21.105080\n10.1007\u002FBF01213639\nranden, 1996, optimal filtering for unsupervised texture feature extraction, Proc SPIE Conf Visual Communications and Image Process, 430\nranden, 1997, optimal texture filter design using feature extraction modeling, Working papers from H&#x2298 gskolen i Stavanger no 27\npapoulis, 1991, Probability Random Variables and Stochastic Processes 3rd ed\n10.1016\u002FS0262-8856(00)00041-X\ncohen, 1991, automated inspection of textile fabrics using textural models, IEEE Trans Pattern Anal Machine Intelll, 803, 10.1109\u002F34.85670\n10.1177\u002F004051750007000902\n10.1177\u002F004051759506501109\nlane, 1998, Textile fabric inspection system\n10.1109\u002FICSMC.1998.727546\n10.1109\u002FICSMC.1998.727529\n10.1109\u002F34.3870\n10.1109\u002FTPAMI.1983.4767446\n10.1177\u002F004051759506500301\n10.1109\u002FTENCON.1997.647318\n10.1016\u002FS0169-7552(98)00211-6\nkumar, 2001, Automated defect detection in textured materials\n10.1016\u002F0957-4158(95)00004-O\n10.1007\u002F978-1-4471-3201-1_23\n10.1177\u002F004051759506500101\n10.1117\u002F12.164868\nfukunaga, 1990, Statistical Pattern Recognition 2nd ed\n10.1117\u002F12.171200\n10.1016\u002F0165-1684(86)90095-2\nmahalanobis, 1994, correlation filters for texture recognition and applications to terrain-delimitation in wide-area surveillance, Proc Int Conf Acousti Speech Signal Processing ICASSP 94, 5, 153\n10.1109\u002FICIP.1995.529724\n10.1109\u002F83.753744\n10.1117\u002F12.223998\n10.1109\u002FROBOT.1997.620007\n10.1364\u002FAO.33.002173\ncampbell, 1996, Linear flaw detection in woven textiles using model-based clustering",{"VOID":1508},"10.1109\u002FTSMCB.2002.1033176","2025-01-28T14:57:05.825+00:00","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1033176\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1033176",[1513,1528],{"id":1514,"sortIndex":32,"researcher":28,"roles":1515,"affiliations":1516,"properties":1525,"displayName":1527,"givenName":28,"familyName":28},"7a1c2fac-0fb3-4fcc-a044-3f9e640fd38c",[912],[1517],{"id":1518,"sortIndex":32,"affiliation":1519,"properties":28},"5fdb4820-a24d-41a6-9e8b-e55709689703",{"id":1518,"createTime":28,"updateTime":28,"relativeEntities":1520,"slug":28,"properties":1521,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1524,"statistic":28},[],{"title":1522},{"VI":1523},"Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China",[],{"title":1526},{"VI":1527},"A. Kumar",{"id":1529,"sortIndex":40,"researcher":28,"roles":1530,"affiliations":1531,"properties":1540,"displayName":1542,"givenName":28,"familyName":28},"ceb38ed6-da25-44d2-9ba4-437f373f39bc",[912],[1532],{"id":1533,"sortIndex":32,"affiliation":1534,"properties":28},"21f53f36-af44-4afb-803c-59ec7c4163c7",{"id":1533,"createTime":28,"updateTime":28,"relativeEntities":1535,"slug":28,"properties":1536,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1539,"statistic":28},[],{"title":1537},{"VI":1538},"Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong, China",[],{"title":1541},{"VI":1542},"G.K.H. Pang",{"url":1510,"publisher":1544,"properties":1552},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1545,"slug":872,"properties":1546,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1549,"manageAffiliations":1550,"indexDatabases":1551,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1547,"title":1548},{"VOID":875},{"EN":877},[],[],[],{"issue":1553,"pages":1554,"volume":1556},{"VOID":950},{"VOID":1555},"553-570",{"VOID":954},[]]