[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_67a8868b-bf79-4b91-866a-844e46e5dc28":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:67a8868b-bf79-4b91-866a-844e46e5dc28,\"}":939},{"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":795,"indexYears":796,"academicFieldIds":797,"indexDatabaseRanking":799},"6ace2085-a177-4a27-b309-8813b832111e",{"id":786,"createTime":28,"updateTime":28,"relativeEntities":787,"label":788,"description":790,"key":792,"publicationTags":793,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":789,"VI":789},"Scopus - Elsevier",{"EN":789,"VI":791},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[794],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[798],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":801,"indexDatabase":802,"url":814,"indexYears":28,"academicFieldIds":815,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":810,"publicationTags":811,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":806,"VI":806},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":808,"VI":809},"ESCI database","Cơ sở dữ liệu ESCI","esci",[812,813],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[816],"0db73426-2364-455f-81a4-efe0f91d712e","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":881,"manageAffiliations":894,"indexDatabases":910,"url":933,"thumbnailPath":28,"statistic":934,"gsStatistic":28,"type":55,"analyzePriority":28},"67a8868b-bf79-4b91-866a-844e46e5dc28","2024-04-11T05:08:34.682+00:00","2025-11-21T09:49:36.697+00:00",[],"Journal-of-Membrane-Computing",{"issn":874,"title":876,"eissn":878},{"VOID":875},"2523-8914",{"EN":877},"Journal of Membrane Computing",{"VOID":879},"2523-8906","PENDING",[882,888],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":884,"label":885,"description":887,"parentId":28,"standard":28,"scholarHubFieldId":28},"e8c4e2fa-b139-4154-a158-595bd93d381c",[],{"EN":886},"Computational Theory and Mathematics",{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":890,"label":891,"description":893,"parentId":28,"standard":28,"scholarHubFieldId":28},"ee33e266-088e-4829-aa2f-5ea59917dac0",[],{"EN":892},"Applied Mathematics",{},[895,903],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":897,"slug":28,"properties":898,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":901,"statistic":28},"6b6d67d8-1887-4ca8-86c5-a38f66f10928",[],{"title":899},{"EN":900},"Springer Verlag",[902],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":904,"createTime":28,"updateTime":28,"relativeEntities":905,"slug":28,"properties":906,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":909,"statistic":28},"8e7fce10-23c9-4f81-8998-abcf28ea16a0",[],{"title":907},{"EN":908},"Springer Nature",[902],[911,923],{"id":912,"indexDatabase":913,"url":918,"indexYears":919,"academicFieldIds":920,"indexDatabaseRanking":799},"50d53904-b44b-4445-bf92-be191f246af6",{"id":786,"createTime":28,"updateTime":28,"relativeEntities":914,"label":915,"description":916,"key":792,"publicationTags":917,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101048368","2019-2025",[921,922],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","f58e9119-c14c-473f-8a7c-5a035e4ab69a",{"id":924,"indexDatabase":925,"url":930,"indexYears":28,"academicFieldIds":931,"indexDatabaseRanking":28},"1ac85400-5c6a-4470-8f68-037cc804c406",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":926,"label":927,"description":928,"key":810,"publicationTags":929,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],"https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=2523-8906",[932],"874c55e0-262a-4246-b3d1-85e02c3c09db","https:\u002F\u002Flink.springer.com\u002Fjournal\u002F41965",{"impactFactor":32,"impactFactorByYear":935,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":936,"totalCitation":32,"totalCitationByYear":937,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":938,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"meta":940,"data":942},{"total":941},"95",[943,1059,1183,1300,1428,1529,1670,1754,1889,2004],{"id":944,"createTime":945,"updateTime":946,"relativeEntities":947,"slug":948,"properties":949,"entityType":958,"verifyStatus":26,"verifyTime":946,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":960,"fullTextUrl":28,"authors":961,"publicationType":1002,"publisherRelationship":1003,"citationCount":28,"citationInfo":28,"publishDate":1055,"publishYear":1056,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1057,"openAccess":28,"references":28,"isForceReanalyzing":1058},"113d2f6f-f412-4510-aa30-db5199b14199","2024-01-21T09:43:52.294+00:00","2025-02-08T16:00:40.738+00:00",[],"Spiking-neural-P-systems-with-a-flat-maximally-parallel-use-of-rules",{"abstract":950,"title":952,"references":954,"doi":956},{"EN":951},"Spiking neural P systems (SN P systems) are a class of distributed and parallel computation models, which are inspired by the way in which neurons process information by means of spikes, where rules in each neuron are applied in a sequential mode in the sense that at every step at most one rule is executed in each neuron. In this work, a flat maximally parallel mode of using rules is introduced into SN P systems, where at every step, a maximal set of applicable rules in each neuron is chosen and each rule in the chosen set is applied exactly once. The computation power of SN P systems working in the flat maximally parallel mode is investigated. Specifically, it is demonstrated that such systems are Turing universal as both number generating devices and function computing devices. Moreover, it is shown that 68 neurons are sufficient for constructing a universal SN P working in the flat maximally parallel mode and using standard rules as a function computing device. These results indicate that the computation power of SN P systems is robust regarding their mode of flat maximal parallelism.",{"EN":953},"Spiking neural P systems with a flat maximally parallel use of rules",{"VOID":955},"Adleman, L. M. (1994). Molecular computation of solutions to combinatorial problems. Science, 266(5187), 1021–1024.\nAman, B., & Ciobanu, G. (2019). Synchronization of rules in membrane computing. Journal of Membrane Computing, 1(4), 233–240.\nAndreu-Guzmán, J. A., & Valencia-Cabrera, L. (2020). A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators. Journal of Membrane Computing, 2(1), 1–13.\nCabarle, F. G. C., Adorna, H. N., Jiang, M., & Zeng, X. (2017). Spiking neural P systems with scheduled synapses. IEEE Transactions on Nanobioscience, 16(8), 792–801.\nCabarle, F. G. C., Adorna, H. N., Pérez-Jiménez, M. J., & Song, T. (2015). Spiking neural P systems with structural plasticity. Neural Computing and Applications, 26(8), 1905–1917.\nChen, H., Freund, R., Ionescu, M., Păun, Gh, & Pérez-Jiménez, M. J. (2007). On string languages generated by spiking neural P systems. Fundamenta Informaticae, 75(1–4), 141–162.\nChen, Z., Zhang, P., Wang, X., Shi, X., Wu, T., & Zheng, P. (2018). A computational approach for nuclear export signals identification using spiking neural P systems. Neural Computing and Applications, 29(3), 695–705.\nCiobanu, Gh., Păun, Gh., & Ştefǎnescu, G. (2003). Sevilla carpets associated with P systems. In M. Cavaliere, C. Martin-Vide & Gh. Păun (Eds.), Proceedings of the brainstorming week on membrane computing (pp. 135–140). Tarragona, Spain.\nde la Cruz, R. T. A., Cabarle, F. G., & Adorna, H. N. (2019). Generating context-free languages using spiking neural P systems with structural plasticity. Journal of Membrane Computing, 1(3), 161–177.\nDíaz-Pernil, D., Gutiérrez-Naranjo, M. A., & Peng, H. (2019). Membrane computing and image processing: A short survey. Journal of Membrane Computing, 1(1), 58–73.\nDíaz-Pernil, D., Peña-Cantillana, F., & Gutiérrez-Naranjo, M. A. (2013). A parallel algorithm for skeletonizing images by using spiking neural P systems. Neurocomputing, 115, 81–91.\nHopcroft, J., Motwani, R., & Ullman, J. (1979). Introduction to automata theory, languages, and computation (Vol. 3). Reading, Boston: Addison-wesley.\nIonescu, M., Păun, Gh., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71(2, 3), 279–308.\nIonescu, M., Păun, Gh, & Yokomori, T. (2007). Spiking neural P systems with an exhaustive use of rules. International Journal of Unconventional Computing, 3(2), 135–154.\nIshdorj, T. O., Leporati, A., Pan, L., Zeng, X., & Zhang, X. (2010). Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources. Theoretical Computer Science, 411(25), 2345–2358.\nJiang, Y., Su, Y., & Luo, F. (2019). An improved universal spiking neural P system with generalized use of rules. Journal of Membrane Computing, 1(4), 270–278.\nJimenez, Z. B., Cabarle, F. G. C., de la Cruz, R. T. A., Buño, K. C., Adorna, H. N., Hernandez, N. H. S., et al. (2019). Matrix representation and simulation algorithm of spiking neural P systems with structural plasticity. Journal of Membrane Computing, 1(3), 145–160.\nJuayong, R. A. B., & Adorna, H. N. (2020). A survey of results on evolution-communication P systems with energy. Journal of Membrane Computing, 2(1), 59–69.\nKorec, I. (1996). Small universal register machines. Theoretical Computer Science, 168(2), 267–301.\nLiu, Y., Nicolescu, R., & Sun, J. (2020). Formal verification of cP systems using PAT3 and ProB. Journal of Membrane Computing, 2(2), 80–94.\nMartín-Vide, C., Păun, Gh., Pazos, J., & Rodríguez-Patón, A. (2003). Tissue P systems. Theoretical Computer Science, 296(2), 295–326.\nMinsky, M. (1967). Computation: Finite and infinite machines. Englewood Cliffs, N.J.: Prentice-Hall.\nOchirbat, O., Ishdorj, T. O., & Cichon, G. (2020). An error-tolerant serial binary full-adder via a spiking neural P system using HP\u002FLP basic neurons. Journal of Membrane Computing, 2(1), 42–48.\nPan, L., Păun, Gh, & Pérez-Jiménez, M. J. (2011). Spiking neural P systems with neuron division and budding. Science China Information Sciences, 54(8), 1596–1607.\nPan, L., Păun, Gh, & Song, B. (2016). Flat maximal parallelism in P systems with promoters. Theoretical Computer Science, 623, 83–91.\nPan, L., Păun, Gh, Zhang, G., & Neri, F. (2017). Spiking neural P systems with communication on request. International Journal of Neural Systems, 27(08), 1750042.\nPan, L., Wu, T., Su, Y., & Vasilakos, A. V. (2017). Cell-like spiking neural P systems with request rules. IEEE Transactions on Nanobioscience, 16(6), 513–522.\nPan, L., & Zeng, X. (2009). A note on small universal spiking neural P systems. International workshop on membrane computing (pp. 436–447). Berlin: Springer.\nPan, L., & Zeng, X. (2011). Small universal spiking neural P systems working in exhaustive mode. IEEE Transactions on Nanobioscience, 10(2), 99–105.\nPăun, A., & Păun, Gh. (2007). Small universal spiking neural P systems. BioSystems, 90(1), 48–60.\nPăun, G., Rozenberg, G., & Salomaa, A. (2010). The Oxford handbook of membrane computing. New York: Oxford University Press.\nPăun, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143.\nPăun, Gh. (2012). Membrane computing: An introduction. Berlin, Germany: Springer.\nPăun, Gh, Pérez-Jiménez, M. J., & Rozenberg, G. (2006). Spike trains in spiking neural P systems. International Journal of Foundations of Computer Science, 17(04), 975–1002.\nRong, H., Yi, K., Zhang, G., Dong, J., Paul, P., & Huang, Z. (2019). Automatic implementation of fuzzy reasoning spiking neural P systems for diagnosing faults in complex power systems. Complexity, 2019, 2635714.\nRosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6), 386.\nSiegelmann, H. T., & Sontag, E. D. (1995). On the computational power of neural nets. Journal of Computer and System Sciences, 50(1), 132–150.\nSong, B., Li, K., Orellana-Martín, D., Valencia-Cabrera, L., & Pérez-Jiménez, M. J. (2020). Cell-like P systems with evolutional symport\u002Fantiport rules and membrane creation. Information and Computation, 275, 104542.\nSong, T., Pan, L., Wu, T., Zheng, P., Wong, M. D., & Rodríguez-Patón, A. (2019). Spiking neural P systems with learning functions. IEEE Transactions on Nanobioscience, 18(2), 176–190.\nSong, T., Pang, S., Hao, S., Rodríguez-Patón, A., & Zheng, P. (2019). A parallel image skeletonizing method using spiking neural P systems with weights. Neural Processing Letters, 50(2), 1485–1502.\nSong, B., Pérez-Jiménez, M. J., Păun, Gh, & Pan, L. (2016). Tissue P systems with channel states working in the flat maximally parallel way. IEEE Transactions on Nanobioscience, 15(7), 645–656.\nSong, T., Rodríguez-Patón, A., Zheng, P., & Zeng, X. (2017). Spiking neural P systems with colored spikes. IEEE Transactions on Cognitive and Developmental Systems, 10(4), 1106–1115.\nSong, B., Zeng, X., Jiang, M., & Pérez-Jiménez, M. J. (2020). Monodirectional tissue P systems with promoters. IEEE Transactions on Cybernetics,. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTCYB.2020.3003060.\nSong, B., Zeng, X., & Rodríguez-Patón, A. Monodirectional tissue P systems with channel states. Information Sciences, 546, 206–219.\nSong, T., Zheng, P., Wong, M. D., & Wang, X. (2016). Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control. Information Sciences, 372, 380–391.\nValencia-Cabrera, L., & Song, B. (2020). Tissue P systems with promoter simulation with MeCoSim and P-Lingua framework. Journal of Membrane Computing, 2(2), 95–107.\nWang, J., Hoogeboom, H. J., Pan, L., Păun, Gh, & Pérez-Jiménez, M. J. (2010). Spiking neural P systems with weights. Neural Computation, 22(10), 2615–2646.\nWang, T., Zhang, G., Zhao, J., He, Z., Wang, J., & Pérez-Jiménez, M. J. (2015). Fault diagnosis of electric power systems based on fuzzy reasoning spiking neural P systems. IEEE Transactions on Power Systems, 30(3), 1182–1194.\nWu, T., Bîlbîe, F. D., Păun, A., Pan, L., & Neri, F. (2018). Simplified and yet turing universal spiking neural P systems with communication on request. International Journal of Neural Systems, 28(08), 1850013.\nWu, T., & Pan, L. (2020). The computation power of spiking neural P systems with polarizations adopting sequential mode induced by minimum spike number. Neurocomputing, 401, 392–404.\nWu, T., Pan, L., & Alhazov, A. (2019). Computation power of asynchronous spiking neural P systems with polarizations. Theoretical Computer Science, 777, 474–489.\nWu, T., Pan, L., Yu, Q., & Tan, K. C. (2020). Numerical spiking neural P systems. IEEE Transactions on Neural Networks and Learning Systems,. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTNNLS.2020.3005538.\nWu, T., Păun, A., Zhang, Z., & Pan, L. (2018). Spiking neural P systems with polarizations. IEEE Transactions on Neural Networks and Learning Systems, 29(8), 3349–3360.\nWu, T., Wang, Y., Jiang, S., Su, Y., & Shi, X. (2018). Spiking neural P systems with rules on synapses and anti-spikes. Theoretical Computer Science, 724, 13–27.\nWu, T., Zhang, Z., Păun, Gh, & Pan, L. (2016). Cell-like spiking neural P systems. Theoretical Computer Science, 623, 180–189.\nZhang, X., Pan, L., & Păun, A. (2015). On the universality of axon P systems. IEEE Transactions on Neural Networks and Learning Systems, 26(11), 2816–2829.\nZhang, X., Wang, B., & Pan, L. (2014). Spiking neural P systems with a generalized use of rules. Neural Computation, 26(12), 2925–2943.",{"VOID":957},"10.1007\u002Fs41965-020-00069-5","PUBLICATION","Auto Verify","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00069-5",[962,987],{"id":963,"sortIndex":32,"researcher":28,"roles":964,"affiliations":966,"properties":984,"displayName":986,"givenName":28,"familyName":28},"29393cfd-1583-4f07-acdc-9ba1cd46456d",[965],"AUTHOR",[967,975],{"id":968,"sortIndex":32,"affiliation":969,"properties":28},"351d04c0-0b1c-4102-a555-8e0f8a7eadd1",{"id":968,"createTime":28,"updateTime":28,"relativeEntities":970,"slug":28,"properties":971,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":974,"statistic":28},[],{"title":972},{"VI":973},"School of Computer Science and Technology, Soochow University, Suzhou, China",[],{"id":976,"sortIndex":40,"affiliation":977,"properties":983},"115722f4-bb4a-4252-8754-21029254693b",{"id":976,"createTime":28,"updateTime":28,"relativeEntities":978,"slug":28,"properties":979,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":982,"statistic":28},[],{"title":980},{"VI":981},"Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou, China",[],{},{"title":985},{"VI":986},"Tingfang Wu",{"id":988,"sortIndex":40,"researcher":28,"roles":989,"affiliations":990,"properties":999,"displayName":1001,"givenName":28,"familyName":28},"f7c5952e-3dbb-45a2-8211-23f62385f460",[965],[991],{"id":992,"sortIndex":32,"affiliation":993,"properties":28},"757d5c11-2d32-478f-9b28-887c14aeeb17",{"id":992,"createTime":28,"updateTime":28,"relativeEntities":994,"slug":28,"properties":995,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":998,"statistic":28},[],{"title":996},{"EN":997},"School of Electric and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou, China",[],{"title":1000},{"VI":1001},"Suxia Jiang","ARTICLE",{"url":960,"publisher":1004,"properties":1050},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1005,"slug":872,"properties":1006,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1010,"manageAffiliations":1019,"indexDatabases":1030,"url":933,"thumbnailPath":28,"statistic":1045,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1007,"title":1008,"eissn":1009},{"VOID":875},{"EN":877},{"VOID":879},[1011,1015],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1012,"label":1013,"description":1014,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1016,"label":1017,"description":1018,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1020,1025],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1021,"slug":28,"properties":1022,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1024,"statistic":28},[],{"title":1023},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1026,"slug":28,"properties":1027,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1029,"statistic":28},[],{"title":1028},{"EN":908},[902],[1031,1038],{"id":912,"indexDatabase":1032,"url":918,"indexYears":919,"academicFieldIds":1037,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1033,"label":1034,"description":1035,"key":792,"publicationTags":1036,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1039,"url":930,"indexYears":28,"academicFieldIds":1044,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1040,"label":1041,"description":1042,"key":810,"publicationTags":1043,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1046,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1047,"totalCitation":32,"totalCitationByYear":1048,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1049,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1051,"volume":1053},{"VOID":1052},"221-231",{"VOID":1054},"3","2021-06-24",2021,[812,794],false,{"id":1060,"createTime":1061,"updateTime":1062,"relativeEntities":1063,"slug":1064,"properties":1065,"entityType":958,"verifyStatus":26,"verifyTime":1062,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1074,"fullTextUrl":28,"authors":1075,"publicationType":1002,"publisherRelationship":1130,"citationCount":28,"citationInfo":28,"publishDate":1181,"publishYear":1056,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1182,"openAccess":28,"references":28,"isForceReanalyzing":1058},"11931482-73f6-4d05-91e9-68d9636c3f16","2024-01-18T19:00:44.800+00:00","2024-12-29T22:51:43.693+00:00",[],"Implementation-of-RSA-cryptographic-algorithm-using-SN-P-systems-based-on-HP-LP-neurons",{"abstract":1066,"title":1068,"references":1070,"doi":1072},{"EN":1067},"Asymmetric cryptographic systems are often more complex and require more computational power than symmetric systems. This is why they might be implemented using unconventional computing systems, such as P systems, spiking neural systems, and DNA computing. In this work, we design an implementation model for RSA encryption and decryption algorithms in the framework of Spiking neural P systems with HP\u002FLP basic neurons.",{"EN":1069},"Implementation of RSA cryptographic algorithm using SN P systems based on HP\u002FLP neurons",{"VOID":1071},"Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science,266(5187), 1021–1024. https:\u002F\u002Fdoi.org\u002F10.1126\u002Fscience.7973651. https:\u002F\u002Fscience.sciencemag.org\u002Fcontent\u002F266\u002F5187\u002F1021.\nBarak, B. (2017). The complexity of public-key cryptography (pp. 45–77). Cham: Springer International Publishing. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-57048-8_2.\nBuchanan, W., & Woodward, A. (2017). Will quantum computers be the end of public key encryption? Journal of Cyber Security Technology, 1(1), 1–22. https:\u002F\u002Fdoi.org\u002F10.1080\u002F23742917.2016.1226650.\nBuiu, C., & Florea, A. G. (2019). Membrane computing models and robot controller design, current results and challenges. Journal of Membrane Computing, 1(4), 262–269. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-019-00029-8.\nFan, S., Paul, P., Wu, T., Rong, H., & Zhang, G. (2020). On applications of Spiking Neural p systems. Applied Sciences, 10(20), 7011. https:\u002F\u002Fdoi.org\u002F10.3390\u002Fapp10207011.\nGuo, P., & Xu, W. (2016). A family P system of realizing RSA algorithm. In M. Gong, L. Pan, T. Song, & G. Zhang (Eds.), Bio-inspired computing—theories and applications (pp. 155–167). Singapore: Springer.\nHussain, N., Balamurugan, C., & Mariappan, R. (2015). A novel dna computing based encryption and decryption algorithm. Procedia Computer Science, 46, 463–475. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.procs.2015.02.045.\nIonescu, M., Păun, A., Păun, G., & Pérez-Jiménez, M.J. (2006). Computing with Spiking Neural P systems: Traces and small universal systems. In: Mao C. and Yokomori T. (Eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg 4287(16), 1–16. https:\u002F\u002Fdoi.org\u002F10.1007\u002F11925903_1\nIonescu, M., Păun, G., & Yokomori, T. (2006). Spiking Neural P systems. Fundamenta Informaticae, 71(2), 279–308.\nIshdorj, T. O. (2006). Minimal parallelism for polarizationless P systems. In C. Mao & T. Yokomori (Eds.), DNA Computing (pp. 17–32). Berlin: Springer.\nIshdorj, T. O., & Leporati, A. (2008). Uniform solutions to SAT and 3-SAT by Spiking Neural P systems with pre-computed resources. Natural Computing, 7(4), 519–534. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11047-008-9081-0.\nIshdorj, T.O., Ochirbat, O., & Naimannaran, C. (2020). A \\(\\mu\\)-fluidic biochip design for Spiking Neural P systems. International Journal of Unconventional Computation\nIshdorj, T. O., & Petre, I. (2008). Gene assembly models and boolean circuits. International Journal of Foundations of Computer Science, 19(05), 1133–1145.\nIshdorj, T. O., Petre, I., & Rogojin, V. (2007). Computational power of intramolecular gene assembly. International Journal of Foundations of Computer Science, 18(05), 1123–1136.\nKari, L., & Rozenberg, G. (2008). The many facets of natural computing. Communications of the ACM, 51, 72–83. https:\u002F\u002Fdoi.org\u002F10.1145\u002F1400181.1400200.\nKarimi, A., & Shahhoseini, H. S. (2012). Cryptanalysis of a substitution-permutation network using gene assembly in ciliates. International Journal of Communications, Network and System Sciences, 5, 154–164.\nLiu, Y., Nicolescu, R., & Sun, J. (2020). Formal verification of cP systems using PAT3 and ProB. Journal of Membrane Computing, 2(2), 80–94. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-020-00036-0.\nMavroeidis, V., Vishi, K., Zych, M., & Jøsang, A. (2018). The impact of quantum computing on present cryptography. International Journal of Advanced Computer Science and Applications. https:\u002F\u002F. https:\u002F\u002Fdoi.org\u002F10.14569\u002FIJACSA.2018.090354.\nMitrana, V. (2019). Polarization: a new communication protocol in networks of bio-inspired processors. Journal of Membrane Computing, 1(2), 127–143. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-018-0001-9.\nNarendren., Yathish, Y.B., & Mohan, C. (2018). A cryptosystem using two layers of security-dna and rsa cryptography.\nOchirbat, O., Ishdorj, T. O., & Cichon, G. (2020). An error-tolerant serial binary full-adder via a Spiking Neural P system using HP\u002FLP basic neurons. Journal of Membrane Computing, 2(1), 42–48. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-020-00033-3.\nPăun, G. (2002). Membrane computing: an introduction. Berlin: Springer-Verlag.\nRivest, R., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21, 120–126.\nShor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509. https:\u002F\u002Fdoi.org\u002F10.1137\u002FS0097539795293172.\nWang, H., Zhou, K., Zhang, G., Paul, P., Duan, Y., Qi, H., & Rong, H. (2020). Application of weighted Spiking Neural P systems with rules on synapses for breaking RSA encryption. International Journal of Unconventional Computing, 15, 37–58.\nWang, X., & Zhang, Q. (2009). DNA computing-based cryptography. In: 2009 Fourth International on Conference on Bio-Inspired Computing, pp. 1–3.\nWeng-Long, C., Lin, K., Chen, J. C., Chih-Chiang, W., Lai, L., Guo, M., & Michael, H. (2011). molecular solutions of the RSA public-key cryptosystem on a DNA-based computer. The Journal of Supercomputing - TJS, 61, 1–31. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11227-011-0627-z.\nWeste, N. H. E., & Eshraghian, K. (1985). Principles of CMOS VLSI design: a systems perspective. Boston: Addison-Wesley Longman Publishing Co. Inc.\nXie, H., Li, B., Qin, J., Huang, Z., Zhu, Y., & Lin, B. (2009). A splicing model based DNA computing approach on microfluidic chip. Electrophoresis, 30(20), 3514–3518. https:\u002F\u002Fdoi.org\u002F10.1002\u002Felps.200900323.\nXu, Z., Cavaliere, M., An, P., Vrudhula, S., & Cao, Y. (2014). The stochastic loss of spikes in Spiking Neural P systems: Design and implementation of reliable arithmetic circuits. Fundamenta Informaticae, 134(1–2), 183–200. https:\u002F\u002Fdoi.org\u002F10.3233\u002FFI-2014-1098.\nZhang, G., Shang, Z., Verlan, S., Martínez-del Amor, M. A., Yuan, C., Valencia-Cabrera, L., & Pérez-Jiménez, M. J. (2020). An overview of hardware implementation of membrane computing models. ACM Computing Surveys. https:\u002F\u002Fdoi.org\u002F10.1145\u002F3402456.",{"VOID":1073},"10.1007\u002Fs41965-021-00073-3","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-021-00073-3",[1076,1091,1104,1117],{"id":1077,"sortIndex":32,"researcher":28,"roles":1078,"affiliations":1079,"properties":1088,"displayName":1090,"givenName":28,"familyName":28},"f148ed1f-60a9-4fee-a2de-d67330847d82",[965],[1080],{"id":1081,"sortIndex":32,"affiliation":1082,"properties":28},"64f9c189-0da8-47da-a21c-06a1987595dc",{"id":1081,"createTime":28,"updateTime":28,"relativeEntities":1083,"slug":28,"properties":1084,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1087,"statistic":28},[],{"title":1085},{"VI":1086},"School of Information and Communication Technology, Mongolian University of Science and Technology, Ulaanbaatar, Mongolia",[],{"title":1089},{"VI":1090},"Ganbat Ganbaatar",{"id":1092,"sortIndex":40,"researcher":28,"roles":1093,"affiliations":1094,"properties":1101,"displayName":1103,"givenName":28,"familyName":28},"91308f38-e96b-474f-9877-c2de2c99bb2e",[965],[1095],{"id":1081,"sortIndex":32,"affiliation":1096,"properties":28},{"id":1081,"createTime":28,"updateTime":28,"relativeEntities":1097,"slug":28,"properties":1098,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1100,"statistic":28},[],{"title":1099},{"VI":1086},[],{"title":1102},{"VI":1103},"Dugar Nyamdorj",{"id":1105,"sortIndex":123,"researcher":28,"roles":1106,"affiliations":1107,"properties":1114,"displayName":1116,"givenName":28,"familyName":28},"35069d7a-3bae-4092-9b65-44c5f46d25fc",[965],[1108],{"id":1081,"sortIndex":32,"affiliation":1109,"properties":28},{"id":1081,"createTime":28,"updateTime":28,"relativeEntities":1110,"slug":28,"properties":1111,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1113,"statistic":28},[],{"title":1112},{"VI":1086},[],{"title":1115},{"VI":1116},"Gordon Cichon",{"id":1118,"sortIndex":42,"researcher":28,"roles":1119,"affiliations":1120,"properties":1127,"displayName":1129,"givenName":28,"familyName":28},"af1477cf-ad18-4058-a414-addc325eba6f",[965],[1121],{"id":1081,"sortIndex":32,"affiliation":1122,"properties":28},{"id":1081,"createTime":28,"updateTime":28,"relativeEntities":1123,"slug":28,"properties":1124,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1126,"statistic":28},[],{"title":1125},{"VI":1086},[],{"title":1128},{"VI":1129},"Tseren-Onolt Ishdorj",{"url":1074,"publisher":1131,"properties":1177},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1132,"slug":872,"properties":1133,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1137,"manageAffiliations":1146,"indexDatabases":1157,"url":933,"thumbnailPath":28,"statistic":1172,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1134,"title":1135,"eissn":1136},{"VOID":875},{"EN":877},{"VOID":879},[1138,1142],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1139,"label":1140,"description":1141,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1143,"label":1144,"description":1145,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1147,1152],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1148,"slug":28,"properties":1149,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1151,"statistic":28},[],{"title":1150},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1153,"slug":28,"properties":1154,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1156,"statistic":28},[],{"title":1155},{"EN":908},[902],[1158,1165],{"id":912,"indexDatabase":1159,"url":918,"indexYears":919,"academicFieldIds":1164,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1160,"label":1161,"description":1162,"key":792,"publicationTags":1163,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1166,"url":930,"indexYears":28,"academicFieldIds":1171,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1167,"label":1168,"description":1169,"key":810,"publicationTags":1170,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1173,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1174,"totalCitation":32,"totalCitationByYear":1175,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1176,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1178,"volume":1180},{"VOID":1179},"22-34",{"VOID":1054},"2021-03-11",[812,794],{"id":1184,"createTime":1185,"updateTime":1186,"relativeEntities":1187,"slug":1188,"properties":1189,"entityType":958,"verifyStatus":26,"verifyTime":1202,"verifyNote":959,"languages":28,"translateLanguages":1203,"viewCount":32,"primaryUrl":1204,"fullTextUrl":28,"authors":1205,"publicationType":1002,"publisherRelationship":1247,"citationCount":28,"citationInfo":28,"publishDate":1298,"publishYear":1056,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1299,"openAccess":28,"references":28,"isForceReanalyzing":1058},"14e6e672-c293-4b89-a07f-e5f9b322a81a","2024-01-25T15:42:55.351+00:00","2025-01-24T21:24:21.626+00:00",[],"On-the-power-of-P-systems-with-active-membranes-using-weak-non-elementary-membrane-division",{"abstract":1190,"title":1193,"keywords":1196,"references":1198,"doi":1200},{"VI":1191,"EN":1192},"Được biết rằng các hệ thống P không phân cực với màng hoạt động có thể giải quyết các bài toán hoàn chỉnh thuộc lớp $$\\mathrm {PSPACE}$$ trong thời gian đa thức mà không sử dụng các quy tắc giao tiếp bên trong nhưng sử dụng các quy tắc phân chia màng không cơ bản mạnh (còn gọi là quy tắc phân chia không cơ bản). Trong bài báo này, chúng tôi chỉ ra rằng điều này cũng đúng khi các quy tắc giao tiếp bên trong được cho phép nhưng các quy tắc phân chia không cơ bản mạnh được thay thế bằng các quy tắc phân chia không cơ bản yếu, một loại quy tắc mà là một mở rộng của phân chia màng cơ bản sang các màng không cơ bản. Vì đã biết rằng trong trường hợp không có quy tắc giao tiếp bên trong, các hệ thống P này chỉ có thể giải quyết các vấn đề thuộc lớp $$\\mathrm {P}^{\\text {NP}}$$ trong thời gian đa thức, kết quả của chúng tôi chứng tỏ rằng các quy tắc này đóng vai trò như một ranh giới giữa $$\\mathrm {P}^{\\text {NP}}$$ và $$\\mathrm {PSPACE}$$ liên quan đến sức mạnh tính toán của các hệ thống P này.","It is known that polarizationless P systems with active membranes can solve \n                \n                  \n                \n                $$\\mathrm {PSPACE}$$\n                \n              -complete problems in polynomial time without using in-communication rules but using the classical (also called strong) non-elementary membrane division rules. In this paper, we show that this holds also when in-communication rules are allowed but strong non-elementary division rules are replaced with weak non-elementary division rules, a type of rule which is an extension of elementary membrane divisions to non-elementary membranes. Since it is known that without in-communication rules, these P systems can solve in polynomial time only problems in \n                \n                  \n                \n                $$\\mathrm {P}^{\\text {NP}}$$\n                \n              , our result proves that these rules serve as a borderline between \n                \n                  \n                \n                $$\\mathrm {P}^{\\text {NP}}$$\n                \n               and \n                \n                  \n                \n                $$\\mathrm {PSPACE}$$\n                \n               concerning the computational power of these P systems.",{"EN":1194,"VI":1195},"On the power of P systems with active membranes using weak non-elementary membrane division","Về khả năng của các hệ thống P với màng hoạt động sử dụng quy tắc phân chia màng không cơ bản yếu",{"VI":1197},"",{"VOID":1199},"Alhazov, A., Pérez-Jiménez, M.J. (2007). Uniform solution of QSAT using polarizationless active membranes. International Conference on Machines, Computations and Universality, 122–133.\nAlhazov, A., Leporati, A., Manzoni, L., Mauri, G., & Zandron, C. (2021). Alternative space definitions for P systems with active membranes. Journal of Membrane Computing, 3, 87–96.\nAlhazov, A., Martín-Vide, C., & Pan, L. (2003). Solving a \\(\\rm PSPACE\\)-complete problem by P systems with restricted active membranes. Fundamenta Informaticae, 58, 67–77.\nAlhazov, A., Pan, L., & Păun, Gh. (2004). Trading polarizations for labels in P systems with active membranes. Acta Informatica, 41(2–3), 111–144.\nBuño, K., & Adorna, H. (2020). Distributed computation of a kP system with active membranes for SAT using clause completion. Journal of Membrane Computing, 2(2), 108–120.\nGazdag, Zs. (2014). Solving SAT by P systems with active membranes in linear time in the number of variables. In: A. Alhazov, S. Cojocaru, M. Gheorghe, Y. Rogozhin, G. Rozenberg, A. Salomaa (Eds.), Membrane Computing: 14th International Conference, LNCS (vol. 8340, pp. 189–205)\nGazdag, Zs., Kolonits, G. (2013). A new approach for solving SAT by P systems with active membranes. In: E. Csuhaj-Varjú, M. Gheorghe, G. Rozenberg, A. Salomaa, G. Vaszil (Eds.), Membrane Computing: 13th International Conference, LNCS (vol. 7762, pp. 195–207)\nGazdag, Zs., Kolonits, G. (2017). Remarks on the computational power of some restricted variants of P systems with active membranes. In: A. Leporati, G. Rozenberg, A. Salomaa, C. Zandron (Eds.), Membrane Computing, 17th International Conference, LNCS (vol. 10105, pp. 209–232)\nGazdag, Zs., & Kolonits, G. (2019). A new method to simulate restricted variants of polarizationless P systems with active membranes. Journal of Membrane Computing, 1(4), 251–261.\nGensler, H. J. (2002). Introduction to logic. Routledge.\nGutierrez-Naranjo, M.A., Perez-Jimenez, M.J., Riscos-Núñez, A., Romero-Campero, F.J. (2006). On the power of dissolution in P systems with active membranes. In: R. Freund, Gh. Păun, G. Rozenberg, A. Salomaa (eds.), Membrane computing: 6th international workshop, LNCS (vol. 3850, pp. 224–240)\nKrishna, S. N., & Rama, R. (1999). A variant of P systems with active membranes: Solving NP-complete problems. Romanian Journal of Information Science and Technology, 2(4), 357–367.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C. (2014). Simulating elementary active membranes, with an application to the P conjecture. In: M. Gheorghe, G. Rozenberg, A. Salomaa, P. Sosík, C. Zandron (Eds.), Membrane computing – 15th international conference, CMC15, LNCS (vol. 8961, pp. 284–299)\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C. (2016). Monodirectional P systems. Natural Computing, 15, 551–564\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C. (2017). Solving a special case of the P conjecture using dependency graphs with dissolution. In: M. Gheorghe, G. Rozenberg, A. Salomaa, C. Zandron (eds.), Membrane computing: 18th international conference, LNCS (vol. 10725, pp. 196–213)\nLeporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M. J., & Zandron, C. (2009). Complexity aspects of polarizationless membrane systems. Natural Computing, 8(4), 703–717.\nLeporati, A., Manzoni, L., Mauri, G., Porreca, A. E., & Zandron, C. (2019). Characterizing PSPACE with shallow non-confluent P systems. Journal of Membrane Computing, 1, 75–84.\nMurphy, N., Woods, D. (2007). Active membrane systems without charges and using only symmetric elementary division characterise P. In: G. Eleftherakis, P. Kefalas, Gh. Păun, G. Rozenberg, A. Salomaa (eds.), Membrane computing: 8th international workshop, LNCS (vol. 4860, pp. 367–384)\nMurphy, N., Woods, D. (2009). On acceptance conditions for membrane systems: Characterisations of \\(\\mathbf{L}\\) and \\(\\mathbf{NL}\\). In T. Neary, D. Woods, T. Seda, N. Murphy (eds.), Proceedings international workshop on the complexity of simple programs, Cork, Ireland, Volume 1 of Electronic Proceedings in Theoretical Computer Science., Open Publishing Association (pp. 172–184)\nMurphy, N., & Woods, D. (2011). The computational power of membrane systems under tight uniformity conditions. Natural Computing, 10(1), 613–632.\nMurphy, N., & Woods, D. (2014). Uniformity is weaker than semi-uniformity for some membrane systems. Fundamental Information, 134(1–2), 129–152.\nOrellana-Martín, D., & Riscos-Núnez, A. (2020). Seeking computational efficiency boundaries: The Păun’s conjecture. Journal of Membrane Computing, 2, 323–331.\nPan, L., & Alhazov, A. (2006). Solving HPP and SAT by P systems with active membranes and separation rules. Acta Informatica, 43(2), 131–145.\nPan, L., Alhazov, A., & Ishdorj, T.-O. (2004). Further remarks on P systems with active membranes, separation, merging, and release rules. Soft Computing, 9(9), 686–690.\nPăun, Gh. (2005). Further twenty six open problems in membrane computing. In: Third Brainstorming Week on Membrane Computing, (pp. 249–262). Fénix Editora, Sevilla\nPăun, Gh. (2001). P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6(1), 75–90.\nPăun, Gh., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford Handbook of Membrane Computing. Oxford University Press.\nPérez-Jiménez, M. J., Romero-Jiménez, Á., & Sancho-Caparrini, F. (2003). Complexity classes in models of cellular computing with membranes. Natural Computing, 2(3), 265–285.\nPérez-Jiménez, M. J., Romero-Jiménez, Á., & Sancho-Caparrini, F. (2006). A polynomial complexity class in P systems using membrane division. Journal of Automata, Languages and Combinatorics, 11(4), 423–434.\nSalomaa, A. (1973). Formal languages. Academic Press.\nSosík, P. (2003). The computational power of cell division in P systems. Natural Computing, 2(3), 287–298.\nSosík, P. (2019). P systems attacking hard problems beyond NP: A survey. Journal of Membrane Computing, 1, 198–208.\nSosík, P., & Rodríguez-Patón, A. (2007). Membrane computing and complexity theory: A characterization of PSPACE. Journal of Computer and System Sciences, 73(1), 137–152.\nWoods, D., Murphy, N., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2009). Membrane dissolution and division in P. In: C.S. Calude, J.F.G. da Costa, N. Dershowitz, E. Freire, G. Rozenberg (Eds.), Unconventional computation: 8th international conference, LNCS (vol. 5715, pp. 262–276)\nZandron, C., Ferretti, C., Mauri, G. (2001). Solving NP-complete problems using P systems with active membranes. In: Unconventional models of computation, UMC’2K: Proceedings of the second international conference on unconventional models of computation (pp. 289–301). Springer London, London\nZandron, C. (2020). Bounding the space in P systems with active membranes. Journal of Membrane Computing, 2, 137–145.",{"VOID":1201},"10.1007\u002Fs41965-021-00082-2","2025-01-23T04:48:13.380+00:00",[30],"https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-021-00082-2",[1206,1221,1234],{"id":1207,"sortIndex":32,"researcher":28,"roles":1208,"affiliations":1209,"properties":1218,"displayName":1220,"givenName":28,"familyName":28},"658b38ab-006d-4736-90cf-3b7c44d31bfc",[965],[1210],{"id":1211,"sortIndex":32,"affiliation":1212,"properties":28},"cd241255-a430-4917-96a1-0037df278861",{"id":1211,"createTime":28,"updateTime":28,"relativeEntities":1213,"slug":28,"properties":1214,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1217,"statistic":28},[],{"title":1215},{"VI":1216},"Institute of Informatics, University of Szeged, Szeged, Hungary",[],{"title":1219},{"VI":1220},"Zsolt Gazdag",{"id":1222,"sortIndex":40,"researcher":28,"roles":1223,"affiliations":1224,"properties":1231,"displayName":1233,"givenName":28,"familyName":28},"06b738ae-3873-4858-9bbb-0be99c22ce20",[965],[1225],{"id":1211,"sortIndex":32,"affiliation":1226,"properties":28},{"id":1211,"createTime":28,"updateTime":28,"relativeEntities":1227,"slug":28,"properties":1228,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1230,"statistic":28},[],{"title":1229},{"VI":1216},[],{"title":1232},{"VI":1233},"Károly Hajagos",{"id":1235,"sortIndex":123,"researcher":28,"roles":1236,"affiliations":1237,"properties":1244,"displayName":1246,"givenName":28,"familyName":28},"8d291039-c222-4c52-b032-0d7d137dc1bb",[965],[1238],{"id":1211,"sortIndex":32,"affiliation":1239,"properties":28},{"id":1211,"createTime":28,"updateTime":28,"relativeEntities":1240,"slug":28,"properties":1241,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1243,"statistic":28},[],{"title":1242},{"VI":1216},[],{"title":1245},{"VI":1246},"Szabolcs Iván",{"url":1204,"publisher":1248,"properties":1294},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1249,"slug":872,"properties":1250,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1254,"manageAffiliations":1263,"indexDatabases":1274,"url":933,"thumbnailPath":28,"statistic":1289,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1251,"title":1252,"eissn":1253},{"VOID":875},{"EN":877},{"VOID":879},[1255,1259],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1256,"label":1257,"description":1258,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1260,"label":1261,"description":1262,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1264,1269],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1265,"slug":28,"properties":1266,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1268,"statistic":28},[],{"title":1267},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1270,"slug":28,"properties":1271,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1273,"statistic":28},[],{"title":1272},{"EN":908},[902],[1275,1282],{"id":912,"indexDatabase":1276,"url":918,"indexYears":919,"academicFieldIds":1281,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1277,"label":1278,"description":1279,"key":792,"publicationTags":1280,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1283,"url":930,"indexYears":28,"academicFieldIds":1288,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1284,"label":1285,"description":1286,"key":810,"publicationTags":1287,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1290,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1291,"totalCitation":32,"totalCitationByYear":1292,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1293,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1295,"volume":1297},{"VOID":1296},"258-269",{"VOID":1054},"2021-10-05",[812,794],{"id":1301,"createTime":1302,"updateTime":1303,"relativeEntities":1304,"slug":1305,"properties":1306,"entityType":958,"verifyStatus":26,"verifyTime":1303,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1315,"fullTextUrl":28,"authors":1316,"publicationType":1002,"publisherRelationship":1373,"citationCount":28,"citationInfo":28,"publishDate":1425,"publishYear":1426,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1427,"openAccess":28,"references":28,"isForceReanalyzing":1058},"18bb6ca4-9961-4c14-9f5e-9560f5badd68","2024-02-21T04:34:33.501+00:00","2025-01-21T07:40:16.352+00:00",[],"Membrane-computing-with-water",{"abstract":1307,"title":1309,"references":1311,"doi":1313},{"EN":1308},"We introduce water tank systems as a new class of membrane systems inspired by a decentrally controlled circulation of water or other liquids throughout cells called tanks and capillaries called pipes. To our best knowledge, this is the first proposal addressing the behavioural principle of floating and stored water for modelling of information processing in terms of membrane computing. The volume of water within a tank stands for a non-negative rational value when acting in an analogue computation or it can be interpreted in a binary manner by distinction of “(nearly) full” or “(nearly) empty”. Water tanks might be interconnected by pipes for directed transport of water. Each pipe can be equipped with valves which in turn either fully open or fully close the hosting pipe according to permanent measurements whether the filling level in a dedicated water tank exceeds a certain threshold or not. We demonstrate dedicated water tank systems together with simulation case studies: a ring oscillator for generation of clock signals and for iteratively making available amounts of water in a cyclic scheme, analogue arithmetics by implementation of addition, non-negative subtraction, division, and multiplication complemented by systems in binary mode for implementation of selected logic gates.",{"EN":1310},"Membrane computing with water",{"VOID":1312},"Angrist, S. (1964). Fluid control devices. Scientific American, 211(6), 80–88.\nBelsterling, C. A. (1971). Fluidic systems design. New York: Wiley Interscience.\nBerque, D., Serlin, I., & Vlahov, A. (2004). A brief water excursion: Introducing computer organization students to a water driven 1-bit half-adder. ACM SIGCSE Bulletin, 36(2), 52–56.\nBissell, C. (2007). Historical perspectives—the Moniac. A Hydromechanical Analog Computer of the 1950s. IEEE Control Systems Magazine, 27(1), 69–74.\nCheow, L. F., Yobas, L., & Kwong, D. L. (2007). Digital microfluidics: Droplet based logic gates. Applied Physics Letters, 90, 054107.\nHead, T., & Gal, S. (2004). Aqueous computing: Writing into fluid memory. Current Trends in Theoretical Computer Science, 1(1), 493–503.\nHead, T., & Gal, S. (2006). Aqueous computing: Writing on molecules dissolved in water. In J. Chen, N. Jonoska, & G. Rozenberg (Eds.), Nanotechnology: Science and computation (pp. 321–331). Berlin: Springer.\nHinze, T., Fassler, R., Lenser, T., & Dittrich, P. (2009). Register machine computations on binary numbers by oscillating and catalytic chemical reactions modelled using mass-action kinetics. International Journal of Foundations of Computer Science, 20(3), 411–426.\nHinze, T. (2018). The Java Environment for Nature-inspired Approaches (JENA): A workbench for biocomputing and biomodelling enthusiasts. In C. Graciani, A. Riscos-Nunez, G. Păun, G. Rozenberg, A. Salomaa (Eds.) Enjoying natural computing, lecture notes in computer science, vol. 11270, pp. 155-169.\nKass, M. A., & Sears, M. L. (1977). Hormonal regulation of intraocular pressure. Survey of Ophthalmology, 22(3), 153–176.\nKatsikis, G., Cybulski, J. S., & Prakash, M. (2015). Synchronous universal droplet logic and control. Nature Physics, 11, 588–596.\nKirshner, J. (1975). Design theory of fluidic components. New York: Academic Press.\nLukyanov, V. S. (1939). Hydraulic apparatus for engineering computations. Bulletin of the Russian Academy of Sciences: Physics URSS, Otdeleniye Tekhnicheskikh Nauk, 2, 53–67.\nMahatantila, K., et al. (2008). Spatial and temporal changes of hydrogeochemistry in ancient tank cascade systems in Sri Lanka: Evidence for a constructed wetland. Water and Environment Journal, 22, 17–24.\nMano, M. M., & Kime, C. R. (2004). Logic and computer design fundamentals. New Jersey: Pearson Education International.\nManca, V. (2019). Metabolic computing. Journal of Membrane Computing, 1(3), 223–232.\nMertaniemi, H., Forchheimer, R., Ikkala, O., & Ras, R. H. A. (2012). Rebounding droplet-droplet collisions on superhydrophobic surfaces: From the phenomenon to droplet logic. Advanced Materials, 24(42), 5738–5743.\nPăun, G. (2003). Membrane Computing. In A. Lingas, B.J. Nilsson (Eds). Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol. 2751, pp. 284-295\nPăun, G., Rozenberg, G., & Salomaa, A. (2010). The oxford handbook of membrane computing. Oxford: Oxford University Press.\nPetrovic, A. (2004). Development of the first hydraulic analog computer. Archives Internationales d’Histoire des Sciences, 54(153), 97–110.\nRamos, A., et al. (1995). Enzyme basis for pH regulation of citrate and pyruvate metabolism by Leuconostoc oenos. Applied and Environmental Microbiology, 61(4), 1303–1310.\nRhee, M., & Burns, M. A. (2009). Microfluidic pneumatic logic circuits and digital pneumatic microprocessors for integrated microfluidic systems. Lab on a Chip, 9(21), 3131–3143.\nTaberlet, N., Marsal, Q., Ferrand, J., & Plihon, N. (2018). Hydraulic logic gates: building a digital water computer. European Journal of Physics, European Physical Society, 39(2), 025801.\nTrogemann, G., Nitussov, A. Y., & Ernst, W. (2001). Computing in Russia: The history of computer devices and information technology revealed. Köln: Vieweg.\nWang, Y., & Huang, J. (2014). A water-based molecular flip-flop. The European Physical Journal Applied Physics, 68(3), 30403.",{"VOID":1314},"10.1007\u002Fs41965-020-00041-3","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00041-3",[1317,1332,1345,1360],{"id":1318,"sortIndex":32,"researcher":28,"roles":1319,"affiliations":1320,"properties":1329,"displayName":1331,"givenName":28,"familyName":28},"53da381d-dab7-413b-a749-679cefe60fb1",[965],[1321],{"id":1322,"sortIndex":32,"affiliation":1323,"properties":28},"c2b0fa96-97d7-4c82-9e5c-e74c3e18aa15",{"id":1322,"createTime":28,"updateTime":28,"relativeEntities":1324,"slug":28,"properties":1325,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1328,"statistic":28},[],{"title":1326},{"VI":1327},"Department of Bioinformatics, Friedrich Schiller University Jena, Jena, Germany",[],{"title":1330},{"VI":1331},"Thomas Hinze",{"id":1333,"sortIndex":40,"researcher":28,"roles":1334,"affiliations":1335,"properties":1342,"displayName":1344,"givenName":28,"familyName":28},"2cfca46d-128c-461c-8dd3-3c08970e03bc",[965],[1336],{"id":1322,"sortIndex":32,"affiliation":1337,"properties":28},{"id":1322,"createTime":28,"updateTime":28,"relativeEntities":1338,"slug":28,"properties":1339,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1341,"statistic":28},[],{"title":1340},{"VI":1327},[],{"title":1343},{"VI":1344},"Hendrik Happe",{"id":1346,"sortIndex":123,"researcher":28,"roles":1347,"affiliations":1348,"properties":1357,"displayName":1359,"givenName":28,"familyName":28},"8804a4ac-914b-448b-9af7-7879a734d7b7",[965],[1349],{"id":1350,"sortIndex":32,"affiliation":1351,"properties":28},"51374bae-d148-4ca6-b0dd-5f494311f442",{"id":1350,"createTime":28,"updateTime":28,"relativeEntities":1352,"slug":28,"properties":1353,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1356,"statistic":28},[],{"title":1354},{"VI":1355},"The University of Auckland, Auckland, New Zealand",[],{"title":1358},{"VI":1359},"Alec Henderson",{"id":1361,"sortIndex":42,"researcher":28,"roles":1362,"affiliations":1363,"properties":1370,"displayName":1372,"givenName":28,"familyName":28},"81eb83ec-1a35-446d-bda9-3951d4445d03",[965],[1364],{"id":1350,"sortIndex":32,"affiliation":1365,"properties":28},{"id":1350,"createTime":28,"updateTime":28,"relativeEntities":1366,"slug":28,"properties":1367,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1369,"statistic":28},[],{"title":1368},{"VI":1355},[],{"title":1371},{"VI":1372},"Radu Nicolescu",{"url":1315,"publisher":1374,"properties":1420},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1375,"slug":872,"properties":1376,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1380,"manageAffiliations":1389,"indexDatabases":1400,"url":933,"thumbnailPath":28,"statistic":1415,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1377,"title":1378,"eissn":1379},{"VOID":875},{"EN":877},{"VOID":879},[1381,1385],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1382,"label":1383,"description":1384,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1386,"label":1387,"description":1388,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1390,1395],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1391,"slug":28,"properties":1392,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1394,"statistic":28},[],{"title":1393},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1396,"slug":28,"properties":1397,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1399,"statistic":28},[],{"title":1398},{"EN":908},[902],[1401,1408],{"id":912,"indexDatabase":1402,"url":918,"indexYears":919,"academicFieldIds":1407,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1403,"label":1404,"description":1405,"key":792,"publicationTags":1406,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1409,"url":930,"indexYears":28,"academicFieldIds":1414,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1410,"label":1411,"description":1412,"key":810,"publicationTags":1413,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1416,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1417,"totalCitation":32,"totalCitationByYear":1418,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1419,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1421,"volume":1423},{"VOID":1422},"121-136",{"VOID":1424},"2","2020-05-25",2020,[812,794],{"id":1429,"createTime":1430,"updateTime":1431,"relativeEntities":1432,"slug":1433,"properties":1434,"entityType":958,"verifyStatus":26,"verifyTime":1443,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1444,"fullTextUrl":28,"authors":1445,"publicationType":1002,"publisherRelationship":1476,"citationCount":28,"citationInfo":28,"publishDate":1527,"publishYear":1426,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1528,"openAccess":28,"references":28,"isForceReanalyzing":1058},"193a7bb7-5cdc-44df-999f-5848f569401f","2024-02-12T09:28:36.228+00:00","2025-01-11T19:24:19.257+00:00",[],"Generating-pictures-in-string-representation-with-P-systems-the-case-of-space-filling-curves",{"abstract":1435,"title":1437,"references":1439,"doi":1441},{"EN":1436},"The computing model of P system with its several variants is known to be a very convenient framework for dealing with different kinds of problems. P systems have been constructed for the generation of approximating geometric patterns of space-filling curves, such as the Peano curve, the Hilbert curve and others. We present the state-of-the-art in the generation of space-filling curves, and related curves, with P systems with parallel rewriting.",{"EN":1438},"Generating pictures in string representation with P systems: the case of space-filling curves",{"VOID":1440},"Bader, M. (2013). Space-filling Curves - An Introduction with applications in Scientific Computing. Springer, New York: Texts in Computational Science and Engineering.\nBera, S., Ceterchi, R., Pan, L., & Subramanian, K.G. (2020). Array Representations of Wunderlich Type Space-Filling Curves (submitted)\nCeterchi, R., Mutyam, M., Pǎun, Gh, & Subramanian, K. G. (2003). Array - rewriting P systems. Natural Computing, 2, 229–249.\nCeterchi, R., Subramanian, K.G., & Venkat, I. (2015). P Systems with parallel rewriting for chain code picture languages. In: Proceedings of 11th Conference on Computability in Europe (CiE), pp. 145–155 .\nCeterchi, R., Nagar, A.K., & Subramanian, K.G. (2018). Approximating polygons for space-filling curves generated with P systems. In: C. Graciani et al. (Eds.): Pérez-Jiménez Festschrift, LNCS 11270, pp. 57–65. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-00265-7_5\nCeterchi, R., Nagar, A.K., & Subramanian, K.G. (2019). Chain Code P System Generating a Variant of the Peano Space-filling Curve. In: T. Hinze et al. (Eds.): CMC 2018, LNCS 11399, Springer Nature (2019). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-030-12797-8_6\nCeterchi R., Nagar A.K., Pan L., & Subramanian K.G. (2019). P Systems Generating Array Representations of Peano Type Space-Filling Curves. Proceedings of the 20th International Conference on Membrane Computing, CMC20, August 5–8, 2019, Curtea de Argeş, Romania (Gh. Păun editor) Bibliostar, Râmnicu Vâlcea 309–324.\nCeterchi, R., & Subramanian, K.G. (2019). P Systems for Generating Pictures in String Representations: The Case of Space-Filling Curves, Proceedings of the 20th International Conference on Membrane Computing, CMC20, August 5–8, Curtea de Argeş, Romania (Gh. Păun editor) Bibliostar, Râmnicu Vâlcea (2019) 63–80.\nCeterchi, R., Zhang, L., Pan, L., Subramanian, K. G., & Zhang, G. (2019). Generating Hilbert Words in Array Representation with P Systems, ACMC2019, November 14–16. China: Xiamen.\nCeterchi, R., Orellana-Martin, D., & Zhang, G. (2020). Division Rules for Tissue P Systems Inspired by Space Filling Curves (to appear in Proceedings ICMC2020).\nDassow, J., Habel, A., & Taubenberger, S. (1996). Chain-code pictures and collages generated by hyperedge replacement. Lecture Notes in Computer Science, 1073, 412–427.\nDharani, A., Stella Maragatham, R., Nagar, A. K., & Subramanian, K. G. (2018). Chain Code P System for Generation of Approximation Patterns of Sierpiński Curve. IWCIA2018, LNCS 11255 43–52\nDrewes, F. (2000). Some remarks on the generative power of collage grammars and chain-code grammars. Lecture Notes in Computer Science, 1764, 1–14.\nFreund, R. (2019). Playing with Derivation Modes, Proceedings of the 20th International Conference on Membrane Computing, CMC20, August 5–8, 2019, Curtea de Argeş, Romania (Gh. Păun editor) Bibliostar, Râmnicu Vâlcea, pp. 109–122.\nFreund, R. (2020). How derivation modes and halting conditions may influence the computational power of P systems. Journal of Membrane Computing, 2(1), 14–25.\nGheorghe, M., Pǎun, Gh, Pérez Jiménez, M. J., & Rozenberg, G. (2013). Research frontiers of membrane computing: Open problems and research topics. International Journal of Foundations of Computer Science, 24(5), 547–624.\nGiammarresi, D., & Restivo, A. (1997). Two-dimensional languages. In G. Rozenberg & A. Salomaa (Eds.), Handbook of Formal Languages (Vol. 3, pp. 215–267). Heidelberg: Springer.\nHilbert, D. (1891). Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen, 38, 459–460.\nMaurer, H. A., Rozenberg, G., & Welzl, E. (1982). Using string languages to describe picture languages. Information Control, 54, 155–185.\nMoore, E. H. (1900). On certain crinkly curves. Transactions of the American Mathematical Society, 1, 72–90.\nPeano, G. (1890). Sur une courbe qui remplit toute une aire plane. Mathematische Annalen, 36, 157–160.\nPǎun, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61, 108–143.\nPǎun, Gh. (2002). Membrane Computing: An Introduction. Springer-Verlag Berlin, Heidelberg.\nSalomaa, A. (1973). Formal Languages. London: Academic Press.\nSagan, H. (1994). Space-Filling Curves. New York: Springer.\nSierpiński, W. (1912). Sur une nouvelle courbe continnue qui remplit toute une aire plane. Bull. Acad. Sci. de Cracovie (Sci. math et nat., Série A) 462–478.\nSiromoney, R., & Subramanian, K. G. (1983). Space-filling curves and Infinite graphs. Lecture Notes in Computer Science, 153, 380–391.\nSubramanian, K.G., Venkat, I., & Pan, L. (2012). P Systems generating chain code picture languages, Proc. Asian Conf. Membrane Computing, pp. 115–123.\nWunderlich, W. (1973). Über Peano-Kurven. Elemente der Mathematik, 28, 1–10.",{"VOID":1442},"10.1007\u002Fs41965-020-00061-z","2025-01-11T19:24:19.256+00:00","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00061-z",[1446,1461],{"id":1447,"sortIndex":32,"researcher":28,"roles":1448,"affiliations":1449,"properties":1458,"displayName":1460,"givenName":28,"familyName":28},"efba53ce-2574-4861-accf-e73ac3f8e07e",[965],[1450],{"id":1451,"sortIndex":32,"affiliation":1452,"properties":28},"ade9eea1-9f66-40b3-8e52-e5120564ea21",{"id":1451,"createTime":28,"updateTime":28,"relativeEntities":1453,"slug":28,"properties":1454,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1457,"statistic":28},[],{"title":1455},{"VI":1456},"Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania",[],{"title":1459},{"VI":1460},"Rodica Ceterchi",{"id":1462,"sortIndex":40,"researcher":28,"roles":1463,"affiliations":1464,"properties":1473,"displayName":1475,"givenName":28,"familyName":28},"f3a3edcb-28c8-4be0-8084-2c7785767ae0",[965],[1465],{"id":1466,"sortIndex":32,"affiliation":1467,"properties":28},"632777ae-003a-418c-9d6d-ba0c59d55471",{"id":1466,"createTime":28,"updateTime":28,"relativeEntities":1468,"slug":28,"properties":1469,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1472,"statistic":28},[],{"title":1470},{"VI":1471},"Faculty of Science, Liverpool Hope University, Liverpool, UK",[],{"title":1474},{"VI":1475},"K. G. Subramanian",{"url":1444,"publisher":1477,"properties":1523},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1478,"slug":872,"properties":1479,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1483,"manageAffiliations":1492,"indexDatabases":1503,"url":933,"thumbnailPath":28,"statistic":1518,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1480,"title":1481,"eissn":1482},{"VOID":875},{"EN":877},{"VOID":879},[1484,1488],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1485,"label":1486,"description":1487,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1489,"label":1490,"description":1491,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1493,1498],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1494,"slug":28,"properties":1495,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1497,"statistic":28},[],{"title":1496},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1499,"slug":28,"properties":1500,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1502,"statistic":28},[],{"title":1501},{"EN":908},[902],[1504,1511],{"id":912,"indexDatabase":1505,"url":918,"indexYears":919,"academicFieldIds":1510,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1506,"label":1507,"description":1508,"key":792,"publicationTags":1509,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1512,"url":930,"indexYears":28,"academicFieldIds":1517,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1513,"label":1514,"description":1515,"key":810,"publicationTags":1516,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1519,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1520,"totalCitation":32,"totalCitationByYear":1521,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1522,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1524,"volume":1526},{"VOID":1525},"369-379",{"VOID":1424},"2020-11-11",[812,794],{"id":1530,"createTime":1531,"updateTime":1532,"relativeEntities":1533,"slug":1534,"properties":1535,"entityType":958,"verifyStatus":26,"verifyTime":1532,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1544,"fullTextUrl":28,"authors":1545,"publicationType":1002,"publisherRelationship":1615,"citationCount":28,"citationInfo":28,"publishDate":1667,"publishYear":1668,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1669,"openAccess":28,"references":28,"isForceReanalyzing":1058},"199e2c8c-574d-463d-ad30-2b493d5517f0","2023-12-28T11:10:51.459+00:00","2025-02-13T12:18:14.898+00:00",[],"ConvSNP-a-deep-learning-model-embedded-with-SNP-like-neurons",{"abstract":1536,"title":1538,"references":1540,"doi":1542},{"EN":1537},"Inspired from spiking mechanisms in spiking neural P (SNP) systems, this paper proposes a new type of neurons, termed as SNP-like neurons. The mathematical model for SNP-like neurons is a generalized linear function. Based on SNP-like neurons, a new class of deep learning models are developed, called ConvSNP models. By referring the structures of the existing convolutional neural networks (CNNs), five ConvSNP models are designed. The five ConvSNP models are evaluated on three benchmark data sets and compared with the corresponding CNNs. The comparison results demonstrate the availability and effectiveness of ConvSNP models for three classical classification tasks.",{"EN":1539},"ConvSNP: a deep learning model embedded with SNP-like neurons",{"VOID":1541},"Pǎun, Gh., Rozenberg, G., & Salomaa, A. (2010). The Oxford Handbook of Membrane Computing. New York: Oxford University Press.\nIonescu, M., Pǎun, Gh., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71, 279–308.\nPǎun, Gh. (2007). Spiking neural P systems with astrocyte-like control. Journal of Universal Computer Science, 13(11), 1707–1721.\nPan, L., & Pǎun, G. (2009). Spiking neural P systems with anti-spikes. International Journal of Computers Communications & Control, 4(3), 273–282.\nPan, L., Păun, Gh., Zhang, G., Neri, F. (2017). Spiking neural p systems with communication on request. International Journal of Neural Systems, 28(8), 1750042: 1–13.\nPeng, H., Yang, J., Wang, J., Wang, T., Sun, Z., Song, X., Lou, X., & Huang, X. (2017). Spiking neural P systems with multiple channels. Neural Networks, 95, 66–71.\nWu, T., Pǎun, A., Zhang, Z., & Pan, L. (2017). piking neural P systems with polarizations. IEEE Transactions on Neural Networks and Learning Systems, 29(8), 3349–3360.\nCabarle, F. G. C., Adorna, H. N., Pérenz-Jiménez, M. J., & Song, T. (2015). Spiking neural P systems with structural plasticity. Neural Computing and Applications, 26(8), 1905–1917.\nSong, T., Pan, L., & Păun, Gh. (2014). Spiking neural P systems with rules on synapses. Theoretical Computer Science, 529, 82–95.\nSong, X., Valencia-Cabrera, L., Peng, H., Wang, J., Pérenz-Jiménez, M.J. (2021). Spiking neural P systems with delay on synapses. International Journal of Neural Systems, 31(1), 2050042: 1–19.\nPeng, H., Li, B., Wang, J., Song, X., Wang, T., Valencia-Cabrera, L., Pérez-Hurtado, I., Riscos-Núñez, A., & Pérenz-Jiménez, M. J. (2020). Spiking neural P systems with inhibitory rules. Knowledge-Based Systems, 188, 1–10.\nPeng, H., Wang, J., Pérez-Jiménez, M. J., & Riscos-Núñez, A. (2019). Dynamic threshold neural P systems. Knowledge-Based Systems, 163, 875–884.\nPeng, H., Wang, J.. Coupled neural P systems. IEEE Transactions on Neural Networks and Learning Systems, 30(6), 1672–1682.\nPeng, H., Bao, T., Luo, X., Wang, J., Song, X., Riscos-Núñez, A., & Pérenz-Jiménez, M. J. (2020). Dendrite P systems. Neural Networks, 127, 110–120.\nPeng, H., Lv, Z., Li, B., Luo, X., Wang, J., Song, X., Wang, T., Pérenz-Jiménez, M.J., Riscos-Núñez, A. (2020). Nonlinear spiking neural P systems. International Journal of Neural Systems, 30(10), 2050008: 1–17.\nde la Cruz, R. T. A., Cabarle, F. G., & Adorna, H. N. (2019). Generating context-free languages using spiking neural P systems with structural plasticity. Journal of Membrane Computing, 1(3), 161–177.\nJiang, Y., Su, Y., & Luo, F. (2019). An improved universal spiking neural P system with generalized use of rules. Journal of Membrane Computing, 1(3), 270–278.\nBao, T., Zhou, N., Lv, Z., Peng, H., & Wang, J. (2020). Sequential dynamic threshold neural P systems. Journal of Membrane Computing, 2(4), 255–268.\nde la Cruz, R. T. A., Cabarle, F. G. C., Macababayao, I. C. H., Adorna, H. N., & Zeng, X. (2021). Homogeneous spiking neural P systems with structural plasticity. Journal of Membrane Computing, 3(1), 10–21.\nWu, T., & Jiang, S. (2021). Spiking neural P systems with a flat maximally parallel use of rules. Journal of Membrane Computing, 3(3), 221–231.\nLv, Z., Yang, Q., Peng, H., Song, X., & Wang, J. (2021). Computational power of sequential spiking neural P systems with multiple channels. Journal of Membrane Computing, 3(4), 270–283.\nDíaz-Pernil, D., Gutiérrez-Naranjo, M. A., & Peng, H. (2019). Membrane computing and image processing: a short survey. Journal of Membrane Computing, 1(1), 58–73.\nLi, B., Peng, H., Wang, J., & Huang, X. (2020). Multi-focus image fusion based on dynamic threshold neural P systems and surfacelet transform. Knowledge-Based Systems, 196(105794), 1–12.\nLi, B., Peng, H., Luo, X., Wang, J., Song, X., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2021). Medical image fusion method based on coupled neural p systems in nonsubsampled shearlet transform domain. International Journal of Neural Systems, 31(1), 2050050: 1–17.\nLi, B., Peng, H., & Wang, J. (2021). A novel fusion method based on dynamic threshold neural P systems and nonsubsampled contourlet transform for multi-modality medical images. Signal Processing, 178(107793), 1–13.\nPeng, H., Li, B., Yang, Q., & Wang, J. (2021). Multi-focus image fusion approach based on CNP systems in NSCT domain. Computer Vision and Image Understanding, 210(103228), 1–14.\nMi, S., Zhang, L., Peng, H., & Wang, J. (2021). Medical image fusion based on DTNP systems and Laplacian pyramid. Journal of Membrane Computing, 3(4), 284–295.\nLiu, Q., Long, L., Yang, Q., Peng, H., Wang, J., & Luo, X. (2022). LSTM-SNP: A long short-term memory model inspired from spiking neural P systems. Knowledge-Based Systems, 235, 107656.\nQ. Liu, L. Long, H. Peng, J. Wang, Q. Yang, X. Song, A. Riscos-Núñez, M.J. Pérenz-Jiménez, Gated spiking neural p systems for time series forecasting, IEEE Transactions on Neural Networks and Learning Systems, 2022. Available at https:\u002F\u002Fdoi.org\u002F10.1109\u002FTNNLS.2021.3134792.\nGoodfellow, I. J., Bengio, Y., & Courville, A. C. (2016). Deep learning. MIT Press.\nHinton, G., Deng, L., Yu, D., Dahl, G. E., & Kingsbury, B. (2012). Deep neural networks for acoustic modeling in speech recognition: the dhared views of four research groups. IEEE Signal Processing Magazine, 29(6), 82–97.\nLong J., Shelhamer E., Darrell T. (2015). Fully convolutional networks for semantic segmentation. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 3431–3440.\nKrizhevsky, A., Sutskever, I., & Hinton, G. E. (2012). ImageNet classification with deep convolutional neural networks. Advances in Neural Information Processing Systems, 25, 1106–1114.\nGreff, K., Srivastava, R. K., Koutnik, J., Steunebrink, B. R., & Schmidhuber, J. (2017). LSTM: a search space odyssey. IEEE Transactions on neural Networks and Learning Systems, 28(10), 2222–2232.\nHaykin S. (2009). Neural networks and learning machines. 3rd edition. Pearson.\nLeCun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998). Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11), 2278–2324.\nLin M., Chen Q., Yan S. (2013). Network In network. arXiv:1312.4400.\nHe K., Zhang X., Ren S., Sun J. (2016). Deep residual learning for image recognition. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 770–778.\nSimonyan K., Zisserman A. (2014). Very deep convolutional networks for large-scale image recognition, arXiv:1409.1556.",{"VOID":1543},"10.1007\u002Fs41965-022-00094-6","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-022-00094-6",[1546,1561,1574,1587,1600],{"id":1547,"sortIndex":32,"researcher":28,"roles":1548,"affiliations":1549,"properties":1558,"displayName":1560,"givenName":28,"familyName":28},"99ca5b39-2f99-4849-b8dd-706c6aff1509",[965],[1550],{"id":1551,"sortIndex":32,"affiliation":1552,"properties":28},"17e76e5b-a27c-43d5-9f6e-1061542b5f5a",{"id":1551,"createTime":28,"updateTime":28,"relativeEntities":1553,"slug":28,"properties":1554,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1557,"statistic":28},[],{"title":1555},{"EN":1556},"School of Computer and Software Engineering, Xihua University, Chengdu, China",[],{"title":1559},{"VI":1560},"Shuwei Zhao",{"id":1562,"sortIndex":40,"researcher":28,"roles":1563,"affiliations":1564,"properties":1571,"displayName":1573,"givenName":28,"familyName":28},"abd70931-d857-4a8e-99c6-488dd368921c",[965],[1565],{"id":1551,"sortIndex":32,"affiliation":1566,"properties":28},{"id":1551,"createTime":28,"updateTime":28,"relativeEntities":1567,"slug":28,"properties":1568,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1570,"statistic":28},[],{"title":1569},{"EN":1556},[],{"title":1572},{"VI":1573},"Li Zhang",{"id":1575,"sortIndex":123,"researcher":28,"roles":1576,"affiliations":1577,"properties":1584,"displayName":1586,"givenName":28,"familyName":28},"ced81540-772a-4d61-98fb-317658165043",[965],[1578],{"id":1551,"sortIndex":32,"affiliation":1579,"properties":28},{"id":1551,"createTime":28,"updateTime":28,"relativeEntities":1580,"slug":28,"properties":1581,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1583,"statistic":28},[],{"title":1582},{"EN":1556},[],{"title":1585},{"VI":1586},"Zhicai Liu",{"id":1588,"sortIndex":42,"researcher":28,"roles":1589,"affiliations":1590,"properties":1597,"displayName":1599,"givenName":28,"familyName":28},"e131d8e8-3a83-4034-963a-558a02f1c59f",[965],[1591],{"id":1551,"sortIndex":32,"affiliation":1592,"properties":28},{"id":1551,"createTime":28,"updateTime":28,"relativeEntities":1593,"slug":28,"properties":1594,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1596,"statistic":28},[],{"title":1595},{"EN":1556},[],{"title":1598},{"VI":1599},"Hong Peng",{"id":1601,"sortIndex":45,"researcher":28,"roles":1602,"affiliations":1603,"properties":1612,"displayName":1614,"givenName":28,"familyName":28},"deecd168-5b02-4712-8599-89654f67f0e3",[965],[1604],{"id":1605,"sortIndex":32,"affiliation":1606,"properties":28},"81839ad1-9bbf-4a18-98b7-f3024ecf1f45",{"id":1605,"createTime":28,"updateTime":28,"relativeEntities":1607,"slug":28,"properties":1608,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1611,"statistic":28},[],{"title":1609},{"VI":1610},"School of Electrical Engineering and Electronic Information, Xihua University, Chengdu, China",[],{"title":1613},{"VI":1614},"Jun Wang",{"url":1544,"publisher":1616,"properties":1662},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1617,"slug":872,"properties":1618,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1622,"manageAffiliations":1631,"indexDatabases":1642,"url":933,"thumbnailPath":28,"statistic":1657,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1619,"title":1620,"eissn":1621},{"VOID":875},{"EN":877},{"VOID":879},[1623,1627],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1624,"label":1625,"description":1626,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1628,"label":1629,"description":1630,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1632,1637],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1633,"slug":28,"properties":1634,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1636,"statistic":28},[],{"title":1635},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1638,"slug":28,"properties":1639,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1641,"statistic":28},[],{"title":1640},{"EN":908},[902],[1643,1650],{"id":912,"indexDatabase":1644,"url":918,"indexYears":919,"academicFieldIds":1649,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1645,"label":1646,"description":1647,"key":792,"publicationTags":1648,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1651,"url":930,"indexYears":28,"academicFieldIds":1656,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1652,"label":1653,"description":1654,"key":810,"publicationTags":1655,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1658,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1659,"totalCitation":32,"totalCitationByYear":1660,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1661,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1663,"volume":1665},{"VOID":1664},"87-95",{"VOID":1666},"4","2022-03-07",2022,[812,794],{"id":1671,"createTime":1672,"updateTime":1673,"relativeEntities":1674,"slug":1675,"properties":1676,"entityType":958,"verifyStatus":26,"verifyTime":1673,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1685,"fullTextUrl":28,"authors":1686,"publicationType":1002,"publisherRelationship":1701,"citationCount":28,"citationInfo":28,"publishDate":1752,"publishYear":1426,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1753,"openAccess":28,"references":28,"isForceReanalyzing":1058},"19f3d47c-766c-4e8a-9d6f-45ae8f2d72ed","2024-01-15T21:08:08.884+00:00","2025-01-18T02:48:28.424+00:00",[],"Coping-with-dynamical-reaction-system-topologies-using-deterministic-P-modules-a-case-study-of-photosynthesis",{"abstract":1677,"title":1679,"references":1681,"doi":1683},{"EN":1678},"The topology of chemical reaction networks is commonly treated as a static structure. This might be sufficient if substrate concentrations and kinetic parameter values exclusively determine the behaviour of all considered reactions. In contrast, numerous phenomena observed in life sciences imply a different nature by dynamical composition of reaction schemes. Single reactions or functional groups of reactions (modules) become activated or deactivated by external signals such as light intensity while the system is in operation. In other scenarios, reactions emerge or disappear while modules can connect to each other or disconnect due to presence or absence of corresponding trigger signals. We capture dynamical reaction network structures by an extended version of deterministic P modules with evaluation of trigger signals which facilitates detailed in-silico simulation studies and hence an easier understanding and prediction of complex biological systems. A case study dedicated to photosynthesis in plants demonstrates its usefulness beyond pure employment of ordinary differential equations by consideration of events, non-differentiable external trigger signals, and thresholds which collaterally modify the underlying reaction scheme.",{"EN":1680},"Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis",{"VOID":1682},"Ardelean, I., & Cavaliere, M. (2003). Modelling biological processes by using a probabilistic P system software. Natural Computing, 2, 173–197.\nAsahi, R., & Jinnouchi, R. (2020). Atomistic modeling of photoelectric cells for artificial photosynthesis. In: Multiscale simulations for electrochemical devices (pp. 107–147). Berlin: Springer.\nButcher, J. C. (2008). Numerical methods for ordinary differential equations. Hoboken: Wiley.\nCavaliere, M., & Ardelean, I. (2006). Modeling respiration in bacteria and respiration\u002Fphotosynthesis interaction in cyanobacteria using a P system simulator. Applications of Membrane Computing, 1, 129–158.\nEdgar, R., Domrachev, M., & Lash, A. E. (2002). Gene Expression Omnibus: NCBI gene expression and hybridization array data repository. Nucleic Acids Research, 30(1), 207–210.\nGheorghe, M., Manca, V., & Romero-Campero, F. J. (2010). Deterministic and stochastic P systems for modelling cellular processes. Natural Computing, 9, 457–473.\nHall, D., & Rao, K. (1999). Photosynthesis. Cambridge: Cambridge University Press.\nHinze, T. (2017) Coping with dynamical structures for interdisciplinary applications of membrane computing. In: Conference on Membrane Computing, CMC17. LNCS, vol. 10105, pp. 16–27. Springer\nHinze, T., Bodenstein, C., Schau, B., Heiland, I., & Schuster, S. (2012). Chemical analog computers for clock frequency control based on P Modules. In: Conference on Membrane Computing, CMC12. LNCS, vol. 7184, pp. 182–202. Springer\nHinze, T., Fassler, R., Lenser, T., Matsumaru, N., & Dittrich, P. (2009). Event-driven metamorphoses of P Systems. In: Membrane Computing. Proceedings Ninth International Workshop on Membrane Computing (WMC9). LNCS, vol. 5391, pp. 231–245. Springer\nHinze, T., Happe, H., Henderson, A., & Nicolescu, R. (2020). Membrane computing with water. Journal of Membrane Computing, 2(2), 121–136.\nHinze, T., Lenser, T., & Dittrich, P. (2006). A protein substructure based P system for description and analysis of cell signalling networks. In: Proceedings Seventh Workshop on Membrane Computing (WMC7). LNCS, vol. 4361, pp. 409–423. Springer\nHinze, T., Schell, B., Schumann, M., & Bodenstein, C. (2013). Maintenance of chronobiological information by P System mediated assembly of control units for oscillatory waveforms and frequency. In: Conference on Membrane Computing, CMC13. LNCS, vol. 7762, pp. 208–227. Springer\nHoops, S., Sahle, S., Gauges, R., Lee, C., Pahle, J., Simus, N., et al. (2006). COPASI—a complex pathway simulator. Bioinformatics, 22(24), 3067–3074.\nKanehisa, M., & Goto, S. (2000). KEGG: Kyoto encyclopedia of genes and genomes. Nucleic Acids Research, 28(1), 27–30.\nKirk, J. T. (2000). Light & photosynthesis in aquatic ecosystems. Cambridge: Cambridge University Press.\nKlipp, E., Liebermeister, W., Wierling, C., & Kowald, A. (2013). Introduction to systems biology. Hoboken: Wiley VCH.\nKulakovskis, D., & Navakauskas, D. (2017). Automated metabolic P system placement in FPGA. Electrical, Control and Communication Engineering, 10(1), 5–12.\nLaisk, A., & Nedbal, L. E. G. (2009). Photosynthesis in silico. Berlin: Springer.\nLutz, M. (2013). Learning python (5th ed.). Newton: O’Reilly Media.\nManca, V. (2019). Metabolic computing. Journal of Membrane Computing, 1(3), 223–232.\nManca, V., Pagliarini, R., & Zorzan, S. (2009). A photosynthetic process modelled by a metabolic P system. Natural Computing, 8, 847–864.\nMuniyandi, R., & Zin, A. M. (2009). Modeling of biological processes by using membrane computing formalism. American Journal of Applied Sciences, 6(11), 1960–1968.\nNishida, T. Y. (2002). Simulations of photosynthesis by a \\(K\\)-Subset transforming system with membrane. Fundamenta Informaticae, 49(1–3), 249–259.\nNishida, T. Y. (2006). A membrane computing model of photosynthesis. Applications of Membrane Computing, 1, 181–202.\nNovere, N., Bornstein, B., Broicher, A., Courtot, M., Donizelli, M., Dharuri, H., et al. (2006). BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems. Nucleic Acids Research, 34(1), 689–691.\nPaun, G. (2001). P Systems with Activ membranes: attacking NP complete problems. Journal of Automata, Languages and Combinatorics, 6(1), 75–90.\nPaun, G. (2002). Membrane computing: An introduction. Berlin: Springer.\nPaun, G., Rozenberg, G., & Salomaa, A. (2010). The Oxford handbook of membrane computing. Oxford: Oxford University Press.\nPescini, D., Besozzi, D., Mauri, G., & Zandron, C. (2006). Dynamical probabilistic P systems. International Journal of Foundations of Computer Science, 17(1), 183–204.\nRubio, F., Camacho, F., Sevilla, J., Chisti, Y., & Grima, E. (2003). A mechanistic model of photosynthesis in microalgae. Biotechnology and Bioengineering, 81(4), 459–473.\nWang, H., Chen, S., & Luo, L. (2020). A diffusion algorithm based on P systems for continuous global optimization. Journal of Computational Science, 44, 101–112.",{"VOID":1684},"10.1007\u002Fs41965-020-00054-y","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00054-y",[1687],{"id":1688,"sortIndex":32,"researcher":28,"roles":1689,"affiliations":1690,"properties":1699,"displayName":1331,"givenName":28,"familyName":28},"1cb64e42-e1da-4d0a-9c25-42f419b4569a",[965],[1691],{"id":1692,"sortIndex":32,"affiliation":1693,"properties":28},"25614506-0d96-4729-a3e7-88bdebcf930f",{"id":1692,"createTime":28,"updateTime":28,"relativeEntities":1694,"slug":28,"properties":1695,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1698,"statistic":28},[],{"title":1696},{"VI":1697},"Friedrich Schiller University Jena, Jena, Germany",[],{"title":1700},{"VI":1331},{"url":1685,"publisher":1702,"properties":1748},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1703,"slug":872,"properties":1704,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1708,"manageAffiliations":1717,"indexDatabases":1728,"url":933,"thumbnailPath":28,"statistic":1743,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1705,"title":1706,"eissn":1707},{"VOID":875},{"EN":877},{"VOID":879},[1709,1713],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1710,"label":1711,"description":1712,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1714,"label":1715,"description":1716,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1718,1723],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1719,"slug":28,"properties":1720,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1722,"statistic":28},[],{"title":1721},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1724,"slug":28,"properties":1725,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1727,"statistic":28},[],{"title":1726},{"EN":908},[902],[1729,1736],{"id":912,"indexDatabase":1730,"url":918,"indexYears":919,"academicFieldIds":1735,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1731,"label":1732,"description":1733,"key":792,"publicationTags":1734,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1737,"url":930,"indexYears":28,"academicFieldIds":1742,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1738,"label":1739,"description":1740,"key":810,"publicationTags":1741,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1744,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1745,"totalCitation":32,"totalCitationByYear":1746,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1747,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1749,"volume":1751},{"VOID":1750},"281-289",{"VOID":1424},"2020-10-22",[812,794],{"id":1755,"createTime":1756,"updateTime":1756,"relativeEntities":1757,"slug":28,"properties":1758,"entityType":958,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1767,"fullTextUrl":28,"authors":1768,"publicationType":1002,"publisherRelationship":1836,"citationCount":28,"citationInfo":28,"publishDate":1887,"publishYear":1668,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":1888,"openAccess":28,"references":28,"isForceReanalyzing":1058},"1b71b233-71b4-49b8-bdd3-485ff3865ad3","2024-01-10T10:43:28.241+00:00",[],{"abstract":1759,"title":1761,"references":1763,"doi":1765},{"EN":1760},"Spiking neural P systems (SNP systems) are biologically inspired models of computation based on the firing behavior of neurons. Variations of these systems have been proposed to solve more specific problems. A more recent variation called the numerical spiking neural P systems combines concepts from SNP systems and numerical P systems to create a new model of computation. This model allows continuous production functions and, in effect, allows for faster computation. In this work, we propose a matrix representation and a corresponding simulation algorithm for NSNP systems. Having a matrix representation and a simulation algorithm allows for testing of solutions in silico. We also present an NSNP system that solves the subset sum problem, and use the matrix representation and simulation algorithm to obtain the solution.",{"EN":1762},"Matrix representation and simulation algorithm of numerical spiking neural P systems",{"VOID":1764},"Calude, C., & Paun, G. (2000). Computing with cells and atoms: An introduction to quantum, DNA and membrane computing. CRC Press.\nIonescu, M., Păun, G., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta Informaticae, 71(2, 3), 279–308.\nPăun, G., & Păun, R. (2006). Membrane computing and economics: Numerical p systems. Fundamenta Informaticae, 73(1, 2), 213–227.\nLeporati, A., Zandron, C., Ferretti, C., & Mauri, G. (2007). Solving numerical np-complete problems with spiking neural p systems. In G. Eleftherakis, P. Kefalas, G. Păun, G. Rozenberg, & A. Salomaa (Eds.), Membrane computing (pp. 336–352). Springer.\nSong, T., Pang, S., Hao, S., Rodríguez-Patón, A., & Zheng, P. (2018). A parallel image skeletonizing method using spiking neural p systems with weights. Neural Processing Letters, 50, 1485–1502. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11063-018-9947-9\nZeng, X., Adorna, H., Martínez-del-Amor, M. Á., Pan, L., & Pérez-Jiménez, M. J. (2011). Matrix representation of spiking neural P systems. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (Eds.) Membrane computing: 11th international conference, CMC 2010, Jena, Germany, August 24–27, 2010. Revised selected papers (pp. 377–391). Berlin, Heidelberg: Springer. https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-642-18123-8_29\nCabarle, F. G. C., Adorna, H. N., Martínez-del-Amor, M. A., & Pérez-Jiménez, M. J. (2012). Improving GPU simulations of spiking neural p systems. Romanian Journal of Information Science and Technology, 15, 5–20.\nCarandang, J. P. A., Cabarle, F. G. C., Adorna, H. N., Hernandez, N. H. S., Martínez-del-Amor, M. A. (2017). Nondeterminism in spiking neural P systems: algorithms and simulations. In: 6th Asian conference on membrane computing (ACMC2017), 21–25 September, 2017, Chengdu, China.\nCarandang, J. P. A., Villaflores, J. M. B., Cabarle, F. G. C., Adorna, H. N., & Martínez-del-Amor, M. A. (2017). Cusnp: Spiking neural p systems simulators in cuda. Romanian Journal of Information Science and Technology, 20, 57–70.\nJimenez, Z. B., Cabarle, F. G. C., de la Cruz, R. T. A., Buño, K. C., Adorna, H., Hernandez, N. H. S., & Zeng, X. (2019). Matrix representation and simulation algorithm of spiking neural p systems with structural plasticity. Journal of Membrane Computing, 1, 145–160.\nCabarle, F. G. C., De La Cruz, R. T. A., Cailipan, D. P. P., Zhang, D., Liu, X., & Zeng, X. (2019). On solutions and representations of spiking neural p systems with rules on synapses. Information Sciences, 501, 30–49.\nDupaya, A. G. S., Galano, A. C. A. P., Cabarle, F. G. C., de La Cruz, R. T., Ballesteros, K. J., & Lazo, P. P. L. (2022). A web-based visual simulator for spiking neural P systems. Journal of Membrane Computing. https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs41965-022-00092-8\nFernandez, A. D. C., Fresco, R. M., Cabarle, F. G. C., de la Cruz, R. T. A., Macababayao, I. C. H., Ballesteros, K. J., & Adorna, H. N. (2021). Snapse: A visual tool for spiking neural p systems. Processes, 9(1), 72.\nAboy, B. C. D., Bariring, E. J. A., Carandang, J. P., Cabarle, F. G. C., Cruz, R. T. D. L., Adorna, H. N., & Martínez-del-Amor, M. Á. (2019). Optimizations in cusnp simulator for spiking neural p systems on cuda gpus. In: 2019 international conference on high performance computing simulation (HPCS) (pp. 535–542). https:\u002F\u002Fdoi.org\u002F10.1109\u002FHPCS48598.2019.9188174\nHernández-Tello, J., Martínez-Del-Amor, M. Á., Orellana-Martín, D., & Cabarle, F. G. (2021). Sparse matrix representation of spiking neural P Systems on GPUs. In: International conference on membrane computing, Debrecen, Hungary.\nMartínez-del-Amor, M. Á., Orellana-Martín, D., Pérez-Hurtado, I., Cabarle, F. G. C., & Adorna, H. N. (2021). Simulation of spiking neural p systems with sparse matrix-vector operations. Processes. https:\u002F\u002Fdoi.org\u002F10.3390\u002Fpr9040690\nWu, T., Pan, L., Yu, Q., & Tan, K. C. (2020) Numerical spiking neural p systems. IEEE Transactions on Neural Networks and Learning Systems, 32(6), 2443–2457. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTNNLS.2020.3005538.\nAdorna, H. N. (2019). Matrix representation of spiking neural P systems: Revisited. In: G. Păun (Ed.) Proceedings 20th international conference on membrane computing, August 3–8, 2019 (pp. 227–248). Râmnicu Vâlcea, Romania: Editura BIBLIOSTAR.\nCabarle, F. G. C., de la Cruz, R. T. A., Cailipan, D. P. P., Zhang, D., Liu, X., & Zeng, X. (2019). On solutions and representations of spiking neural p systems with rules on synapses. Information Sciences, 501, 30–49.\nLeporati, A., Mauri, G., Zandron, C., Păun, G., & Pérez-Jiménez, M. J. (2009). Uniform solutions to sat and subset sum by spiking neural p systems. Natural computing, 8(4), 681–702.\nYin, X., Liu, X., Sun, M., & Ren, Q. (2021). Novel numerical spiking neural p systems with a variable consumption strategy. Processes. https:\u002F\u002Fdoi.org\u002F10.3390\u002Fpr9030549\nSong, T., Pan, L., Wu, T., Zheng, P., Wong, M. L. D., & Rodríguez-Patón, A. (2019). Spiking neural p systems with learning functions. IEEE Transactions on NanoBioscience, 18(2), 176–190.",{"VOID":1766},"10.1007\u002Fs41965-022-00093-7","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-022-00093-7",[1769,1784,1797,1810,1823],{"id":1770,"sortIndex":32,"researcher":28,"roles":1771,"affiliations":1772,"properties":1781,"displayName":1783,"givenName":28,"familyName":28},"c3faaa3a-7a4a-42ae-b8aa-87998cc41150",[965],[1773],{"id":1774,"sortIndex":32,"affiliation":1775,"properties":28},"2a04310e-8753-4309-a673-ff3deca1039d",{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":1776,"slug":28,"properties":1777,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1780,"statistic":28},[],{"title":1778},{"VI":1779},"Algorithms and Complexity, Department of Computer Science, University of the Philippines, Quezon City, Philippines",[],{"title":1782},{"VI":1783},"Korsie J. Ballesteros",{"id":1785,"sortIndex":40,"researcher":28,"roles":1786,"affiliations":1787,"properties":1794,"displayName":1796,"givenName":28,"familyName":28},"70ba5ae4-55ce-403d-95e1-4d851823c57e",[965],[1788],{"id":1774,"sortIndex":32,"affiliation":1789,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":1790,"slug":28,"properties":1791,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1793,"statistic":28},[],{"title":1792},{"VI":1779},[],{"title":1795},{"VI":1796},"Dionne Peter P. Cailipan",{"id":1798,"sortIndex":123,"researcher":28,"roles":1799,"affiliations":1800,"properties":1807,"displayName":1809,"givenName":28,"familyName":28},"59656def-bfea-4697-9311-35e9b4c5c7c0",[965],[1801],{"id":1774,"sortIndex":32,"affiliation":1802,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":1803,"slug":28,"properties":1804,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1806,"statistic":28},[],{"title":1805},{"VI":1779},[],{"title":1808},{"VI":1809},"Ren Tristan A. de la Cruz",{"id":1811,"sortIndex":42,"researcher":28,"roles":1812,"affiliations":1813,"properties":1820,"displayName":1822,"givenName":28,"familyName":28},"fa58d395-9845-4159-84a9-c925758d984f",[965],[1814],{"id":1774,"sortIndex":32,"affiliation":1815,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":1816,"slug":28,"properties":1817,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1819,"statistic":28},[],{"title":1818},{"VI":1779},[],{"title":1821},{"VI":1822},"Francis George C. Cabarle",{"id":1824,"sortIndex":45,"researcher":28,"roles":1825,"affiliations":1826,"properties":1833,"displayName":1835,"givenName":28,"familyName":28},"350aea3a-72c6-44fc-9cf0-1187dfac21d5",[965],[1827],{"id":1774,"sortIndex":32,"affiliation":1828,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":1829,"slug":28,"properties":1830,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1832,"statistic":28},[],{"title":1831},{"VI":1779},[],{"title":1834},{"VI":1835},"Henry N. Adorna",{"url":1767,"publisher":1837,"properties":1883},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1838,"slug":872,"properties":1839,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1843,"manageAffiliations":1852,"indexDatabases":1863,"url":933,"thumbnailPath":28,"statistic":1878,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1840,"title":1841,"eissn":1842},{"VOID":875},{"EN":877},{"VOID":879},[1844,1848],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1845,"label":1846,"description":1847,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1849,"label":1850,"description":1851,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1853,1858],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1854,"slug":28,"properties":1855,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1857,"statistic":28},[],{"title":1856},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1859,"slug":28,"properties":1860,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1862,"statistic":28},[],{"title":1861},{"EN":908},[902],[1864,1871],{"id":912,"indexDatabase":1865,"url":918,"indexYears":919,"academicFieldIds":1870,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1866,"label":1867,"description":1868,"key":792,"publicationTags":1869,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1872,"url":930,"indexYears":28,"academicFieldIds":1877,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1873,"label":1874,"description":1875,"key":810,"publicationTags":1876,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1879,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1880,"totalCitation":32,"totalCitationByYear":1881,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1882,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1884,"volume":1886},{"VOID":1885},"41-55",{"VOID":1666},"2022-03-28",[812,794],{"id":1890,"createTime":1891,"updateTime":1892,"relativeEntities":1893,"slug":1894,"properties":1895,"entityType":958,"verifyStatus":26,"verifyTime":1892,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1904,"fullTextUrl":28,"authors":1905,"publicationType":1002,"publisherRelationship":1951,"citationCount":28,"citationInfo":28,"publishDate":2002,"publishYear":1056,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":2003,"openAccess":28,"references":28,"isForceReanalyzing":1058},"1b8c31f0-0311-45de-b095-46fb248ff0ce","2024-01-15T15:21:23.076+00:00","2025-02-19T02:41:21.970+00:00",[],"P-systems-with-limited-number-of-objects",{"abstract":1896,"title":1898,"references":1900,"doi":1902},{"EN":1897},"P systems are a model of compartmentalized multiset rewriting inspired by the structure of living cells and the way they function. In this paper, we focus of a variant in P systems in which membranes have limited capacity, i.e., the number of objects they may hold is limited by a fixed bound. This feature corresponds to an important physical property of cellular compartments. We propose several possible semantics of limited capacity and show that one of them allows real-time simulations of partially blind register machines, while the other one allows for obtaining computational completeness.",{"EN":1899},"P systems with limited number of objects",{"VOID":1901},"Alhazov, A. (2006). P systems without multiplicities of symbol-objects. Information Processing Letters, 100(3), 124–129.\nAlhazov, A., & Freund, R. (2014). P systems with toxic objects. In Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., & Zandron C. (Eds.), Membrane Computing – 15th International Conference, CMC 2014, Prague, Czech Republic, August 20–22, 2014, Revised Selected Papers, volume 8961 of Lecture Notes in Computer Science, pages 99–125. Springer.\nAlhazov, A., & Freund, R. (2014). Length P systems. Fundamenta Informaticae, 134(1–2), 17–37.\nAlhazov, A., Freund, R., & Ivanov, S. (2020). P systems with limited capacity. In David Orellana-Martín, Gheorghe Păun, Agustín Riscos-Núñez, and Ignacio Pérez-Hurtado, editors, Proceedings 18th Brainstorming Week on Membrane Computing, Sevilla, February 4–7, 2020, pages 33–47. RGNC REPORT 1\u002F2020, Research Group on Natural Computing, Universidad de Sevilla.\nAlhazov, A., Freund, R., & Ivanov, S. (2020). P systems with limiting the number of objects in membranes. In Rudolf Freund and Tseren-Onolt Ishdorj, editors, Electronic Proceedings of the International Conference on Membrane Computing 2020 (ICMC 2020), Wien, September 14–17, 2020, pp. 83–98. TU Wien.\nAlhazov, A., Freund, R., & Riscos-Núñez, A. (2006). Membrane division, restricted membrane creation and object complexity in P systems. International Journal of Computer Mathematics, 83(7), 529–547.\nDassow, J., & Păun, Gh. (1989). Regulated Rewriting in Formal Language Theory. Berlin: Springer.\nFreund, R., Kari, L., Oswald, M., & Sosík, P. (2005). Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science, 330(2), 251–266.\nFreund, R., & Sosík, P. (2015). On the power of catalytic P systems with one catalyst. In Grzegorz Rozenberg, Arto Salomaa, José M. Sempere, and Claudio Zandron, editors, Membrane Computing – 16th International Conference, CMC 2015, Valencia, Spain, August 17–21, 2015, Revised Selected Papers, volume 9504 of Lecture Notes in Computer Science, pages 137–152. Springer.\nMarvin, L. (1967). Computation. Finite and Infinite Machines. Englewood Cliffs: Prentice Hall.\nPăun, Gh. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143.\nPăun, Gh. (2002). Membrane Computing: An Introduction. Berlin: Springer.\nPăun, Gh., Rozenberg, G., & Salomaa, A. (Eds.). (2010). The Oxford Handbook of Membrane Computing. Oxford: Oxford University Press.\nRozenberg, G., & Salomaa, A. (Eds.). (1997). Handbook of Formal Languages. Berlin: Springer.\nThe P Systems Website. (2019). http:\u002F\u002Fppage.psystems.eu\u002F.",{"VOID":1903},"10.1007\u002Fs41965-020-00068-6","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs41965-020-00068-6",[1906,1921,1936],{"id":1907,"sortIndex":32,"researcher":28,"roles":1908,"affiliations":1909,"properties":1918,"displayName":1920,"givenName":28,"familyName":28},"39c04af7-4399-4d73-9a19-f17af1049c27",[965],[1910],{"id":1911,"sortIndex":32,"affiliation":1912,"properties":28},"0ab65fe9-f0e2-456c-845d-c0d407d41eed",{"id":1911,"createTime":28,"updateTime":28,"relativeEntities":1913,"slug":28,"properties":1914,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1917,"statistic":28},[],{"title":1915},{"VI":1916},"Vladimir Andrunachievici Institute of Mathematics and Computer Science, Chișinău, Moldova",[],{"title":1919},{"VI":1920},"Artiom Alhazov",{"id":1922,"sortIndex":40,"researcher":28,"roles":1923,"affiliations":1924,"properties":1933,"displayName":1935,"givenName":28,"familyName":28},"35da2177-a28f-417f-aacf-2dc008d3fdc9",[965],[1925],{"id":1926,"sortIndex":32,"affiliation":1927,"properties":28},"aa488a8c-2606-4b99-b73d-efd12ccbaa1f",{"id":1926,"createTime":28,"updateTime":28,"relativeEntities":1928,"slug":28,"properties":1929,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1932,"statistic":28},[],{"title":1930},{"VI":1931},"Faculty of Informatics, TU Wien, Wien, Austria",[],{"title":1934},{"VI":1935},"Rudolf Freund",{"id":1937,"sortIndex":123,"researcher":28,"roles":1938,"affiliations":1939,"properties":1948,"displayName":1950,"givenName":28,"familyName":28},"08b4ff45-6484-4ca0-abd5-d7081e004f6a",[965],[1940],{"id":1941,"sortIndex":32,"affiliation":1942,"properties":28},"6910555c-4aab-4958-99ef-9ea595af611a",{"id":1941,"createTime":28,"updateTime":28,"relativeEntities":1943,"slug":28,"properties":1944,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1947,"statistic":28},[],{"title":1945},{"VI":1946},"IBISC, IBISC, Université Évry, Évry, France",[],{"title":1949},{"VI":1950},"Sergiu Ivanov",{"url":1904,"publisher":1952,"properties":1998},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1953,"slug":872,"properties":1954,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1958,"manageAffiliations":1967,"indexDatabases":1978,"url":933,"thumbnailPath":28,"statistic":1993,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":1955,"title":1956,"eissn":1957},{"VOID":875},{"EN":877},{"VOID":879},[1959,1963],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":1960,"label":1961,"description":1962,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":1964,"label":1965,"description":1966,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[1968,1973],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":1969,"slug":28,"properties":1970,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1972,"statistic":28},[],{"title":1971},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":1974,"slug":28,"properties":1975,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1977,"statistic":28},[],{"title":1976},{"EN":908},[902],[1979,1986],{"id":912,"indexDatabase":1980,"url":918,"indexYears":919,"academicFieldIds":1985,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":1981,"label":1982,"description":1983,"key":792,"publicationTags":1984,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":1987,"url":930,"indexYears":28,"academicFieldIds":1992,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":1988,"label":1989,"description":1990,"key":810,"publicationTags":1991,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":1994,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":1995,"totalCitation":32,"totalCitationByYear":1996,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":1997,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":1999,"volume":2001},{"VOID":2000},"1-9",{"VOID":1054},"2021-03-04",[812,794],{"id":2005,"createTime":2006,"updateTime":2007,"relativeEntities":2008,"slug":2009,"properties":2010,"entityType":958,"verifyStatus":26,"verifyTime":2007,"verifyNote":959,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":2019,"fullTextUrl":28,"authors":2020,"publicationType":1002,"publisherRelationship":2097,"citationCount":28,"citationInfo":28,"publishDate":2148,"publishYear":1668,"citationAnalyzeStatus":880,"lastCitationAnalyze":28,"indexDatabases":2149,"openAccess":28,"references":28,"isForceReanalyzing":1058},"1c7e9213-d361-4818-81dd-fa6cda2a5ffe","2023-12-09T03:44:55.214+00:00","2024-09-23T05:47:37.734+00:00",[],"A-web-based-visual-simulator-for-spiking-neural-P-systems",{"abstract":2011,"title":2013,"references":2015,"doi":2017},{"EN":2012},"Under the active area of membrane computing, Spiking Neural P systems (SN P systems) are models of computations which take inspirations from biological neurons, e.g. by the sending of spikes through the synapses connecting the neurons. As more research is done in this area, previous works are focused on creating simulators to aid in the creation, experimentation, and understanding of SN P systems. Most simulators are mainly text-based, with little or no visualizations of the systems and their computations. In this work we introduce a novel tool known as WebSnapse. WebSnapse is a web-based simulator which addresses the need for a visual tool for the study and experimentation (e.g. creation, modification) of SN P systems and their computations. We list some limitations of WebSnapse, e.g. in terms of the amount of memory allocated to the web browser during simulations. Any modern web browser, including those for some mobile devices such as phones or tablet computers, can run WebSnapse. In this way, both touch or mouse-based inputs are available to the user in learning about SN P systems in WebSnapse. Our results and testing show promise in the use of web-based technologies in visualising SN P systems and their computations to aid both old and new users.",{"EN":2014},"A web-based visual simulator for spiking neural P systems",{"VOID":2016},"Păun, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143. https:\u002F\u002Fdoi.org\u002F10.1006\u002Fjcss.1999.1693.\nIonescu, M., Păun, G., & Yokomori, T. (2006). Spiking neural P systems. Fundamenta informaticae 71(2, 3), 279–308.\nPăun, G. (2008). From cells to (silicon) computers, and back. New computational paradigms (pp. 343–371). New York: Springer.\nGhosh-Dastidar, S., & Adeli, H. (2009). Third generation neural networks: Spiking neural networks. Advances in computational intelligence (pp. 167–178). New York: Springer.\nValencia-Cabrera, L., Pérez-Hurtado, I., & Martínez-del-Amor, M.Á. (2020). Simulation challenges in membrane computing. Journal of Membrane Computing, 1–11.\nGheorghe, M., Lefticaru, R., Konur, S., Niculescu, I. M., & Adorna, H. N. (2021). Spiking neural P systems: Matrix representation and formal verification. Journal of Membrane Computing, 3(2), 133–148.\nFernandez, A. D. C., Fresco, R. M., Cabarle, F. G. C., de la Cruz, R. T. A., Macababayao, I. C. H., Ballesteros, K. J., & Adorna, H. N. (2021). Snapse: A visual tool for spiking neural P systems. Processes, 9(1), 72.\nPăun, G. (2007). Spiking neural P systems. A tutorial. Bulletin European Association Theory Computer Science, 91, 145–159.\nIonescu, M., & Sburlan, D. (2012). Some applications of spiking neural P systems. Computing and Informatics, 27(3), 515–528.\nPăun, G., & Pérez-Jiménez, M. J. (2006). Membrane computing: Brief introduction, recent results and applications. Biosystems, 85(1), 11–22.\nLeporati, A., Mauri, G., Zandron, C., Păun, G., & Pérez-Jiménez, M. J. (2009). Uniform solutions to SAT and Subset Sum by spiking neural P systems. Natural Computing, 8(4), 681.\nChen, H., Ionescu, M., & Ishdorj, T.-O. (2006). On the efficiency of spiking neural P systems. Proceedings of the Fourth Brainstorming Week on Membrane Computing, Vol. I. Sevilla, ETS de Ingeniería Informática, 30 de Enero-3 de Febrero, pp. 195–206.\nGanbaatar, G., Nyamdorj, D., Cichon, G., & Ishdorj, T.-O. (2021). Implementation of RSA cryptographic algorithm using SN P systems based on HP\u002FLP neurons. Journal of Membrane Computing, 1–13.\nCarandang, J. P., Cabarle, F. G. C., Adorna, H. N., Hernandez, N. H. S., & Martínez-del-Amor, M. Á. (2019). Handling non-determinism in spiking neural P systems: Algorithms and simulations. Fundamenta Informaticae, 164(2–3), 139–155.\nZeng, X., Adorna, H., Martínez-del-Amor, M. Á., Pan, L., & Pérez-Jiménez, M. J. (2010). Matrix representation of spiking neural P systems. International conference on membrane computing (pp. 377–391). Berlin: Springer.\nCarandang, J. P., Villaflores, J. M. B., Cabarle, F. G. C., Adorna, H. N., & Martinez-del-Amor, M. A. (2017). CuSNP: Spiking neural P systems simulators in cuda. Romanian Journal of Information Science and Technology, 20(1), 57–70.\nMartínez-del-Amor, M. Á., Orellana-Martín, D., Pérez-Hurtado, I., Cabarle, F. G. C., & Adorna, H. N. (2021). Simulation of spiking neural p systems with sparse matrix-vector operations. Processes, 9(4), 690.\nFonseca, Í.A., & Gaspar, H.M. (2019). A prime on web-based simulation. In: ECMS (European Council for Modelling and Simulation) (pp. 23–29).\nResearch Group on Natural Computing. (2005). The P-Lingua Website. http:\u002F\u002Fwww.p-lingua.org\u002Fwiki\u002Findex.php\u002FMain_Page\nMacías-Ramos, L. F., Pérez-Hurtado, I., García-Quismondo, M., Valencia-Cabrera, L., Pérez-Jiménez, M. J., & Riscos-Núñez, A. (2011). A p-lingua based simulator for spiking neural P systems. International conference on membrane computing (pp. 257–281). Berlin: Springer.\nPérez-Hurtado, I., Valencia-Cabrera, L., Pérez-Jiménez, M.J., Colomer, M.A., & Riscos-Núñez, A. (2010). MeCoSim: A general purpose software tool for simulating biological phenomena by means of P systems. In: 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) (pp. 637–643). https:\u002F\u002Fdoi.org\u002F10.1109\u002FBICTA.2010.5645199\nGuo, P., Quan, C., & Ye, L. (2019). UPSimulator: A general P system simulator. Knowledge-Based Systems, 170, 20–25. https:\u002F\u002Fdoi.org\u002F10.1016\u002Fj.knosys.2019.01.013.\nHeiner, M., Herajy, M., Liu, F., Rohr, C., & Schwarick, M. (2012). Snoopy—A Unifying Petri Net Tool. In S. Haddad & L. Pomello (Eds.), Application and theory of petri nets (pp. 398–407). Berlin: Springer.\nRoger, S. (2009). JFLAP. http:\u002F\u002Fwww.jflap.org\u002F\nSchwarze, M. (2009). Web-based Petri net animation (in German). Diploma thesis, FH Lausitz, Dep. of CS.\nValdez, A. A. (2020). Snapse. https:\u002F\u002Fsecretmapper.github.io\u002FSnapse\u002F\nFranz, M., Lopes, C. T., Huck, G., Dong, Y., Sumer, O., & Bader, G. D. (2016). Cytoscape. js: A graph theory library for visualisation and analysis. Bioinformatics, 32(2), 309–311.\nCabarle, F. G. C., Adorna, H. N., Martínez del Amor, M. Á., & Pérez Jiménez, M. D. J. (2012). Improving GPU simulations of spiking neural P systems. Romanian Journal of Information Science and Technology, 15(1), 5–20.\nOpenJS Foundation. (2021). Electron. Build cross-platform desktop apps with JavaScript, HTML, and CSS. https:\u002F\u002Fwww.electronjs.org\u002F\nGutiérrez Naranjo, M.Á., & Leporati, A. (2009). Performing arithmetic operations with spiking neural P systems. In Proceedings of the seventh brainstorming week on membrane computing (Vol. I, pp. 181–198). Sevilla, ETS de Ingeniería Informática, 2-6 de Febrero.\nCeterchi, R., & Tomescu, A.I. (2008). Spiking neural P systems–a natural model for sorting networks. In Proceedings of the sixth brainstorming week on membrane computing (pp. 93–105). Sevilla, ETS de Ingeniería Informática, 4-8 de Febrero\nVerlan, S., Freund, R., Alhazov, A., Ivanov, S., & Pan, L. (2020). A formal framework for spiking neural P systems. Journal of Membrane Computing, 2(4), 355–368.\nAdorna, H. N. (2020). Computing with SN P systems with I\u002FO mode. Journal of Membrane Computing, 2(4), 230–245.\nFrancis, G. C., Cabarle, M.J.P.-J.H., Adorna, N., & Song, T. (2015). Spiking neural P systems with structural plasticity. Neural Computing and Applications, 26, 1905–1917.\nde la Cruz, R. T. A., Cabarle, F. G. C., Macababayao, I. C. H., Adorna, H. N., & Zeng, X. (2021). Homogeneous spiking neural P systems with structural plasticity. Journal of Membrane Computing, 3(1), 10–21.\nLazo, P. P., Cabarle, F. G., & Yap, J. M. (2021). A return to stochasticity and probability in spiking neural P systems. Journal of Membrane Computing, 3(2), 149–161.\nValdez, A. A. M., Filbert Wee, F. G. C. C., & Martinez-del-Amor, M. A. (2021). Gpu simulations of spiking neural p systems on modern web browsers. In: (accepted) International conference on membrane computing (ICMC2021), Chengdu, China and Debrecen, Hungary, August 24–28, 2021.",{"VOID":2018},"10.1007\u002Fs41965-022-00092-8","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs41965-022-00092-8",[2021,2034,2047,2059,2072,2084],{"id":2022,"sortIndex":32,"researcher":28,"roles":2023,"affiliations":2024,"properties":2031,"displayName":2033,"givenName":28,"familyName":28},"d29c7204-79f5-4d68-bd4e-e6ae370b50d2",[965],[2025],{"id":1774,"sortIndex":32,"affiliation":2026,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":2027,"slug":28,"properties":2028,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2030,"statistic":28},[],{"title":2029},{"VI":1779},[],{"title":2032},{"VI":2033},"Annysia Glynis S. Dupaya",{"id":2035,"sortIndex":40,"researcher":28,"roles":2036,"affiliations":2037,"properties":2044,"displayName":2046,"givenName":28,"familyName":28},"b6d22bf9-d31a-4dcb-9be8-ebe9ea24d831",[965],[2038],{"id":1774,"sortIndex":32,"affiliation":2039,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":2040,"slug":28,"properties":2041,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2043,"statistic":28},[],{"title":2042},{"VI":1779},[],{"title":2045},{"VI":2046},"Anica Clarice Antonella P. Galano",{"id":2048,"sortIndex":123,"researcher":28,"roles":2049,"affiliations":2050,"properties":2057,"displayName":1822,"givenName":28,"familyName":28},"13b1a309-c300-40cd-b443-e6136b68c400",[965],[2051],{"id":1774,"sortIndex":32,"affiliation":2052,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":2053,"slug":28,"properties":2054,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2056,"statistic":28},[],{"title":2055},{"VI":1779},[],{"title":2058},{"VI":1822},{"id":2060,"sortIndex":42,"researcher":28,"roles":2061,"affiliations":2062,"properties":2069,"displayName":2071,"givenName":28,"familyName":28},"5a36386c-b9b0-42af-b017-a574f3fedd2e",[965],[2063],{"id":1774,"sortIndex":32,"affiliation":2064,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":2065,"slug":28,"properties":2066,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2068,"statistic":28},[],{"title":2067},{"VI":1779},[],{"title":2070},{"VI":2071},"Ren Tristan De La Cruz",{"id":2073,"sortIndex":45,"researcher":28,"roles":2074,"affiliations":2075,"properties":2082,"displayName":1783,"givenName":28,"familyName":28},"49003681-e2c2-4eb8-b41b-1245801c43d7",[965],[2076],{"id":1774,"sortIndex":32,"affiliation":2077,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":2078,"slug":28,"properties":2079,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2081,"statistic":28},[],{"title":2080},{"VI":1779},[],{"title":2083},{"VI":1783},{"id":2085,"sortIndex":46,"researcher":28,"roles":2086,"affiliations":2087,"properties":2094,"displayName":2096,"givenName":28,"familyName":28},"30f4280b-745a-4974-bef3-6e0f9139d244",[965],[2088],{"id":1774,"sortIndex":32,"affiliation":2089,"properties":28},{"id":1774,"createTime":28,"updateTime":28,"relativeEntities":2090,"slug":28,"properties":2091,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2093,"statistic":28},[],{"title":2092},{"VI":1779},[],{"title":2095},{"VI":2096},"Prometheus Peter L. Lazo",{"url":2019,"publisher":2098,"properties":2144},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2099,"slug":872,"properties":2100,"entityType":25,"verifyStatus":880,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2104,"manageAffiliations":2113,"indexDatabases":2124,"url":933,"thumbnailPath":28,"statistic":2139,"gsStatistic":28,"type":55,"analyzePriority":28},[],{"issn":2101,"title":2102,"eissn":2103},{"VOID":875},{"EN":877},{"VOID":879},[2105,2109],{"id":883,"createTime":28,"updateTime":28,"relativeEntities":2106,"label":2107,"description":2108,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":886},{},{"id":889,"createTime":28,"updateTime":28,"relativeEntities":2110,"label":2111,"description":2112,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":892},{},[2114,2119],{"id":896,"createTime":28,"updateTime":28,"relativeEntities":2115,"slug":28,"properties":2116,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2118,"statistic":28},[],{"title":2117},{"EN":900},[902],{"id":904,"createTime":28,"updateTime":28,"relativeEntities":2120,"slug":28,"properties":2121,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2123,"statistic":28},[],{"title":2122},{"EN":908},[902],[2125,2132],{"id":912,"indexDatabase":2126,"url":918,"indexYears":919,"academicFieldIds":2131,"indexDatabaseRanking":799},{"id":786,"createTime":28,"updateTime":28,"relativeEntities":2127,"label":2128,"description":2129,"key":792,"publicationTags":2130,"standard":28},[],{"EN":789,"VI":789},{"EN":789,"VI":791},[794],[921,922],{"id":924,"indexDatabase":2133,"url":930,"indexYears":28,"academicFieldIds":2138,"indexDatabaseRanking":28},{"id":803,"createTime":28,"updateTime":28,"relativeEntities":2134,"label":2135,"description":2136,"key":810,"publicationTags":2137,"standard":28},[],{"EN":806,"VI":806},{"EN":808,"VI":809},[812,813],[932],{"impactFactor":32,"impactFactorByYear":2140,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":123,"totalPublicationByYear":2141,"totalCitation":32,"totalCitationByYear":2142,"totalCitationPerPublication":32,"totalCitationPerPublicationByYear":2143,"hindexLast5Year":32,"hindex":32},{},{"2020":40,"2021":40},{},{},{"pages":2145,"volume":2147},{"VOID":2146},"21-40",{"VOID":1666},"2022-03-09",[812,794]]