Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.10056282
Yuxi Zhang, Yu Zhao
{"title":"Hierarchical neural network detection model based on deep context and attention mechanism","authors":"Yuxi Zhang, Yu Zhao","doi":"10.1504/ijcsm.2023.10056282","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10056282","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"18 1","pages":"162-175"},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66727947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.10057938
S. A, Viswanathan K. Iyer
{"title":"Some computational aspects of terminal Wiener index","authors":"S. A, Viswanathan K. Iyer","doi":"10.1504/ijcsm.2023.10057938","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10057938","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66728427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.10058564
Doli Phukan, B. Soni, Souvik Chowdhury
{"title":"Incorporation of Question Segregation Procedure in Visual Question Answering Models","authors":"Doli Phukan, B. Soni, Souvik Chowdhury","doi":"10.1504/ijcsm.2023.10058564","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10058564","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66728571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.10059990
Kalyani Debnath
{"title":"Data analysis using Maximum Probabilistic Rough Set in R Environment","authors":"Kalyani Debnath","doi":"10.1504/ijcsm.2023.10059990","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10059990","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135106755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.10059129
Abdisa Shiferaw Melese, Legesse Lemecha Obsu, Oluwole Daniel Makinde
{"title":"Modelling and optimal control analysis of coffee berry disease with cost-effectiveness in the presence of temperature variability","authors":"Abdisa Shiferaw Melese, Legesse Lemecha Obsu, Oluwole Daniel Makinde","doi":"10.1504/ijcsm.2023.10059129","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10059129","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135496933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.133635
Miao Zhang
To achieve cross language text similarity analysis, an improved fragment merging algorithm based on dynamic programming is proposed. Dynamic programming is introduced into the fragment merging algorithm to improve the merging algorithm, so as to improve the cross language detection, gradually merge fragments from keyword detection, and verify the performance of the algorithm, such as recall, accuracy and detection time, through comparative analysis experiments. The results show that the recall and accuracy of the merging algorithm based on dynamic programming are more than 80% in the performance test. In addition, it can be found that the fragment merging algorithm has faster fragment merging speed and plagiarism detection speed in the comparison of algorithms. The performance of the improved fragment merging algorithm in plagiarism detection has great advantages, but also has great application value, which provides a new solution for the field of text similarity calculation.
{"title":"Research on bilingual text similarity detection and analysis based on improved fragment merging algorithm","authors":"Miao Zhang","doi":"10.1504/ijcsm.2023.133635","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.133635","url":null,"abstract":"To achieve cross language text similarity analysis, an improved fragment merging algorithm based on dynamic programming is proposed. Dynamic programming is introduced into the fragment merging algorithm to improve the merging algorithm, so as to improve the cross language detection, gradually merge fragments from keyword detection, and verify the performance of the algorithm, such as recall, accuracy and detection time, through comparative analysis experiments. The results show that the recall and accuracy of the merging algorithm based on dynamic programming are more than 80% in the performance test. In addition, it can be found that the fragment merging algorithm has faster fragment merging speed and plagiarism detection speed in the comparison of algorithms. The performance of the improved fragment merging algorithm in plagiarism detection has great advantages, but also has great application value, which provides a new solution for the field of text similarity calculation.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135799465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijcsm.2023.10059181
Qi Cao, Wensheng Yang
{"title":"Dynamics of a delayed stage structure predator-prey model with predator-dependent prey refuge","authors":"Qi Cao, Wensheng Yang","doi":"10.1504/ijcsm.2023.10059181","DOIUrl":"https://doi.org/10.1504/ijcsm.2023.10059181","url":null,"abstract":"","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135496539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：