[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_3e9ac07b-6a7b-4c00-a476-d87079cbc0dd":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:3e9ac07b-6a7b-4c00-a476-d87079cbc0dd,\"}":74},{"code":4,"data":5,"meta":20},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":22,"manageAffiliations":23,"indexDatabases":24,"url":25,"thumbnailPath":26,"statistic":27,"gsStatistic":20,"type":20,"analyzePriority":20},"3e9ac07b-6a7b-4c00-a476-d87079cbc0dd","2023-06-01T06:19:45.549+00:00","2025-12-02T10:27:01.810+00:00",[],"VNU-Journal-of-Science-Computer-Science-and-Communication-Engineering",{"issn":12,"title":14,"country":16},{"VOID":13},"26159260",{"EN":15},"VNU Journal of Science: Computer Science and Communication Engineering",{"VOID":17},"VN","PUBLISHER","VERIFIED",null,26,[],[],[],"https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F3e9ac07b-6a7b-4c00-a476-d87079cbc0dd\u002F97ee65f34f9e0e9b60eba6ce626d99eb.jpg",{"impactFactor":28,"impactFactorByYear":29,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":43,"totalCitation":52,"totalCitationByYear":53,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":64,"hindexLast5Year":73,"hindex":73},0,{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},0.5,0.55,0.36,0.26,0.43,0.56,0.52,0.33,0.23,0.35,6,1,132,{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},14,11,12,16,9,10,37,3,339,{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},43,87,15,70,29,28,13,41,2,2.57,{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},7.17,6.21,1.25,4.38,3.22,1.3,1.11,0.67,8,{"meta":75,"data":77},{"total":76},"131",[78,189,273,313,379,467,531,609,721,793],{"id":79,"createTime":80,"updateTime":81,"relativeEntities":82,"slug":83,"properties":84,"entityType":91,"verifyStatus":19,"verifyTime":80,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":41,"primaryUrl":93,"fullTextUrl":94,"authors":95,"publicationType":157,"publisherRelationship":158,"citationCount":28,"citationInfo":181,"publishDate":184,"publishYear":182,"citationAnalyzeStatus":185,"lastCitationAnalyze":186,"indexDatabases":187,"openAccess":20,"references":20,"isForceReanalyzing":188},"622f0bd6-e32c-4c27-be07-767f4db888a6","2023-06-13T08:16:51.844+00:00","2026-08-19T21:48:23.650+00:00",[],"-Selection-of-Appropriate-Number-of-CRs-in-Cooperative-Spectrum-Sensing-over-Suzuki-Fading",{"title":85,"gsPaper":87,"abstract":89},{"EN":86}," Selection of Appropriate Number of CRs in Cooperative Spectrum Sensing over Suzuki Fading",{"VOID":88},"13419640943049267412",{"EN":90},"With the rapid development of wireless communications, the radio spectrum is becoming scarce. However, researchers have shown that many portions of licensed spectrum remain unused for significant periods of time. Recently, cognitive radio has been proposed as a very eective mechanism which allows Cognitive Radio Users, or CRs to utilize the idle unused licensed bands.The main challenge for a CR is to detect the existence of Primary User, or PU in order to minimize the interference to it. In this paper, we study the cooperative spectrum sensing under Suzuki composite fading channel which is the mixture of Rayleigh fading channel and Log-normal shadowing channel. Besides, we also concentrate on finding the minimum number of CRs taking part in the collaborative spectrum sensing to avoid the overhead to the network but still guarantee the sensing performance through calculations and numerical results. Our analysis and simulation results suggest that collaboration may improve sensing performance significantly. ","PUBLICATION","f5f54d63-2632-4d93-b2b7-193707f8026d","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F92","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F92\u002F35",[96,122,140],{"id":97,"sortIndex":28,"researcher":20,"roles":98,"affiliations":99,"properties":117,"displayName":119,"givenName":20,"familyName":20},"873f9450-c898-49ee-a1c2-fd727e448f02",[],[100],{"id":101,"sortIndex":28,"affiliation":102,"properties":114},"cf638ada-8eca-4360-9ce7-09723bf399f5",{"id":101,"createTime":20,"updateTime":20,"relativeEntities":103,"slug":20,"properties":104,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":112,"statistic":20},[],{"title":105,"country":108,"abbreviation":109},{"EN":106,"VI":107},"VNU University of Engineering and Technology","Trường Đại học Công nghệ, Đại học Quốc Gia Hà Nội",{"VOID":17},{"VOID":110},"UET-VNU","https:\u002F\u002Fuet.vnu.edu.vn\u002F",[113],"12466116-8f60-4b01-8faf-2411483a0977",{"title":115},{"VI":116},"University of Engineering and Technology, VNU",{"title":118,"gsAuthor":120},{"VI":119},"Thai Mai Thi Dinh",{"VOID":121},"jMLdyh8AAAAJ",{"id":123,"sortIndex":28,"researcher":20,"roles":124,"affiliations":125,"properties":137,"displayName":139,"givenName":20,"familyName":20},"b8344b51-8191-4d58-8d97-124cbde0bd45",[],[126],{"id":101,"sortIndex":28,"affiliation":127,"properties":134},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":128,"slug":20,"properties":129,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":133,"statistic":20},[],{"title":130,"country":131,"abbreviation":132},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":135},{"VI":136},"University of Engineering and Technology, VNU.",{"title":138},{"VI":139},"Tuan Quoc Nguyen",{"id":141,"sortIndex":28,"researcher":20,"roles":142,"affiliations":143,"properties":154,"displayName":156,"givenName":20,"familyName":20},"687dd47c-6e58-4b14-a82d-cea43c8406fe",[],[144],{"id":101,"sortIndex":28,"affiliation":145,"properties":152},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":146,"slug":20,"properties":147,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":151,"statistic":20},[],{"title":148,"country":149,"abbreviation":150},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":153},{"VI":136},{"title":155},{"VI":156},"Long Thanh Nguyen","ARTICLE",{"url":93,"publisher":159,"properties":173},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":160,"slug":10,"properties":161,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":165,"manageAffiliations":166,"indexDatabases":167,"url":25,"thumbnailPath":26,"statistic":168,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":162,"title":163,"country":164},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":169,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":170,"totalCitation":52,"totalCitationByYear":171,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":172,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":174,"title":176,"volume":179},{"VOID":175},"2",{"EN":177,"VI":178},"Vol. 32 No. 2","Tập 32 Số 2",{"VOID":180},"32",{"total":28,"publishYear":182,"statisticByYear":183},2016,{},"2016-07-05","ERROR_IN_ANALYZE_CITATION","2026-08-19T21:48:23.649+00:00",[],false,{"id":190,"createTime":191,"updateTime":192,"relativeEntities":193,"slug":194,"properties":195,"entityType":91,"verifyStatus":19,"verifyTime":191,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":28,"primaryUrl":204,"fullTextUrl":205,"authors":206,"publicationType":157,"publisherRelationship":245,"citationCount":48,"citationInfo":268,"publishDate":271,"publishYear":269,"citationAnalyzeStatus":185,"lastCitationAnalyze":192,"indexDatabases":272,"openAccess":20,"references":20,"isForceReanalyzing":188},"666cdc97-f775-443e-896e-51b1dcbd0965","2023-06-13T08:20:45.391+00:00","2026-08-18T04:03:04.024+00:00",[],"-An-Elasticity-Framework-for-Distributed-Message-Queuing-Telemetry-Transport-Brokers",{"abstract":196,"title":198,"gsPaper":200,"doi":202},{"EN":197},"Internet of Things (IoT) applications are increasingly making impact in all areas of humanlife. Day by day, its chatty embedded devices have been generating tons of data requiring effectivenetwork infrastructure. To deliver millions of IoT messages back and fort with as few faults aspossible, participation of communication protocols like MQTT is a must. Lightweight blueprintand friendly battery are just two of many advantages of this protocol making it become a dominantin IoT world. In real application scenarios, distributed MQTT solutions are usually required sincecentralized MQTT approach is incapable of dealing with huge amount of data. Although distributedMQTT solutions are scalable, they do not adapt to fluctuations of traffic workload. This might costIoT service provider because of redundant computation resources. This leads to the need of a novelapproach that can adapt its size changes in workload. This article proposes such an elastic solutionby proposing a flexible MQTT framework. Our MQTT framework uses off-the-shelf componentsto obtain server’s elasticity while keeping IoT applications intact. Experiments are conducted tovalidate elasticity function provided by an implementation of our framework.\r\nKeywords\r\nMQTT broker, Elasticity, Internet of Things, Cloud computing\r\nReferences\r\n[1] Sharma, D. Panwar, Green IoT: Advancements and Sustainability with Environment by 2050, In: 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO), Noida, India, 2020, pp. 1127-1132.\r\n[2] Turner, D. Reinsel, J. F. Gantz, S. Minton, The Digital Universe of Opportunities: Rich Data and the Increasing Value of the Internet of Things, IDC Report Apr, 2014.\r\n[3] MQ Telemetry Transport, http:\u002F\u002Fmqtt.org\u002F, 2020 (accessed on: October 30th, 2020).\r\n[4] Mell, T. Grance, The NIST Definition of Cloud Computing (Draft), NIST Special Publication, Vol. 800, No. 145, 2011, pp. 1-3.\r\n[5] T. Eugster, P. A. Felber, R. Guerraoui, A. Kermarrec, The many Faces of Publish\u002Fsubscribe, ACM Comput, Surv, Vol. 35, No. 2, 2003, pp. 114-131.\r\n[6] Kawaguchi, M. Bandai, Edge Based MQTT Broker Architecture for Geographical IoT Applications, 2020 International Conference on Information Networking (ICOIN), Barcelona, Spain, 2020, pp. 232-235.\r\n[7] Gupta, S. Khera, N. Turk, MQTT Protocol Employing IOT Based Home Safety System with ABE Encryption, Multimed Tools Appl, 2020.\r\n[8] Mukambikeshwari, Poojary, Smart Watering System Using MQTT Protocol in IoT, Advances in Artificial Intelligence and Data Engineering, Advances in Intelligent Systems and Computing, Springer, Singapore, 2020.\r\n[9] C. See, E. X. Ho, IoT-Based Fire Safety System Using MQTT Communication Protocol, International Journal of Integrated Engineering, Vol. 12, No. 6, 2020, pp. 207-215.\r\n[10] Nazir, M. Kaleem, Reliable Image Notifications for Smart Home Security with MQTT, International Conference on Information Science and Communication Technology (ICISCT), Karachi, Pakistan, 2019, pp. 1-5.\r\n[11] Alqinsi, I. J. M. Edward, N. Ismail, W. Darmalaksana, IoT-Based UPS Monitoring System Using MQTT Protocols, 4th International Conference on Wireless and Telematics (ICWT), Nusa Dua, 2018, pp. 1-5.\r\n[12] Comparison of MQTT Brokers, https:\u002F\u002Ftewarid.github.io\u002F2019\u002F03\u002F21\u002Fcomparison-of-mqtt-brokers.html”\u002F, 2020 (accessed on: October 30th, 2020).\r\n[13] Collina, G. E. Corazza, A. Vanelli-Coralli, Introducing the QEST Broker: Scaling the IoT by Bridging MQTT and REST, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications-(PIMRC), Sydney, NSW, 2012, pp. 36-41.\r\n[14] Schmitt, F. Carlier, V. Renault, Data Exchange with the MQTT Protocol: Dynamic Bridge Approach, 2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring), Kuala Lumpur, Malaysia, 2019, pp. 1-5.\r\n[15] M. V. Zambrano, M. V. Zambrano, E. L. O. Mej´ıa, X. H. Calderon, SIGPRO: A Real-Time Progressive Notification System Using MQTT Bridges and Topic Hierarchy for Rapid Location of Missing Persons, in IEEE Access, Vol. 8, 2020, pp. 149190-149198.\r\n[16] The features that Various MQTT Servers (Brokers) Support, https:\u002F\u002Fgithub.com\u002Fmqtt\u002Fmqtt.github.io\u002Fwiki\u002Fserver-support”\u002F, 2020 (accessed on: October 30th, 2020).\r\n[17] Jutadhamakorn, T. Pillavas, V. Visoottiviseth, R. Takano, J. Haga, D. Kobayashi, A scalable and Low-cost MQTT Broker Clustering System, 2017 2nd International Conference on Information Technology (INCIT), Nakhonpathom, 2017, pp. 1-5.\r\n[18] Y. Thean, V. V. Yap, P. C. Teh, Container-Based MQTT Broker Cluster for Edge Computing, 2019 4th International Conference and Workshops on Recent Advances and Innovations in Engineering (ICRAIE), Kedah, Malaysia, 2019, pp. 1-6.\r\n[19] Detti, L. Funari, N. Blefari-Melazzi, Sub-Linear Scalability of MQTT Clusters in Topic-Based Publish-Subscribe Applications, in IEEE Transactions on Network and Service Management, Vol. 17, No. 3, 2020, pp. 1954-1968.\r\n[20] R. Righi, E, Correa, M. M. Gomes, C. A. Costa, Enhancing Performance of IoT Applications with Load Prediction and Cloud Elasticity, Future Generation Computer Systems, Vol. 109, 2020, pp. 689-701.\r\n[21] H. Fourati, S. Marzouk, K. Drira, M. Jmaiel, Dockeranalyzer: Towards Fine Grained Resource Elasticity for Microservices-Based Applications Deployed with Docker, 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Gold Coast, Australia, 2019, pp. 220-225.\r\n[22] Nardelli, V. Cardellini, E. Casalicchio, Multi-Level Elastic Deployment of Containerized Applications in Geo-Distributed Environments, 2018 IEEE 6th International Conference on Future Internet of Things and Cloud (FiCloud), Barcelona, 2018, pp. 1-8.\r\n[23] M. Pham, A Big Data Analytics Framework for IoT Applications in the Cloud, VNU Journal of Science: Computer Science and Communication Engineering, Vol. 31, No. 2, 2015, pp. 44-55.\r\n[24] F. Rodrigues, I. G. Wendt, R. R. Righi, C. A. Costa, J. L. V. Barbosa, A. M. Alberti, Brokel: Towards Enabling Multi-level Cloud Elasticity on Publish\u002Fsubscribe Brokers, International Journal of Distributed Sensor Networks, Vol. 13, No. 8, 2017, pp. 1-20.\r\n[25] Vavassori, J. Soriano, R. Fernandez, Enabling Large-Scale IoT-Based Services Through Elastic Publish\u002FSubscribe, Sensors, 2017.\r\n[26] A Distributed, Reliable Key-value Store, https:\u002F\u002Fetcd.io\u002Fdocs\u002Fv3.4.0\u002F, 2020 (accessed on: October 30th, 2020).\r\n[27] Roure, C. Goble, Software Design for Empowering Scientists, IEEE Software, Vol. 26, No. 1, 2009, pp. 88-95.\r\n[28] EMQX Broker, https:\u002F\u002Fdocs.emqx.io\u002Fbroker\u002Flatest\u002Fen\u002F, 2020 (accessed on: October 30th, 2020).\r\n[29] Kubernetes, https:\u002F\u002Fkubernetes.io\u002F, 2020 (accessed on: October 30th, 2020).\r\n[30] HAProxy, https:\u002F\u002Fwww.haproxy.com\u002Fsolutions\u002Fload-balancing\u002F, 2020 (accessed on: October 30th, 2020).\r\n[31] OpenStack: Open Source Cloud Computing Infrastructure, https:\u002F\u002Fwww.openstack.org\u002F, 2020 (accessed on: October 30th, 2020).\r\n[32] OpenStack Heat, https:\u002F\u002Fdocs.openstack.org\u002Fheat\u002Flatest\u002F, 2020 (accessed on: October 30th, 2020).\r\n[33] OpenStack Ceilometer, https:\u002F\u002Fdocs.openstack.org\u002Fceilometer\u002Flatest\u002F, 2020 (accessed on: October 30th, 2020).\r\n[34] OpenStack Aodh, https:\u002F\u002Fdocs.openstack.org\u002Faodh\u002Flatest\u002F, 2020 (accessed on: October 30th, 2020).\r\n[35] Gnocchi - Metric as a Service, https:\u002F\u002Fgnocchi.xyz\u002F, 2020 (accessed on: October 30th, 2020).\r\n[36] RabbitMQ, https:\u002F\u002Fwww.rabbitmq.com\u002F, 2020 (accessed on: October 30th, 2020).\r\n[37] Apache Jmeter, https:\u002F\u002Fjmeter.apache.org\u002F, 2020 (accessed on: October 30th, 2020).\r\n[38] M. Pham, T. T. Nguyen, M. D. Tran, A Benchmarking Tool for Elastic MQTT Brokers in IoT Applications, International Journal of Information and Communication Sciencesm, Vol. 4, No. 4, 2019, pp. 59-67.",{"EN":199}," An Elasticity Framework for Distributed Message Queuing Telemetry Transport Brokers",{"VOID":201},"5338553663554792565",{"VOID":203},"10.25073\u002F2588-1086\u002Fvnucsce.267","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F267","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F267\u002F125",[207,226],{"id":208,"sortIndex":28,"researcher":20,"roles":209,"affiliations":210,"properties":221,"displayName":223,"givenName":20,"familyName":20},"8a9bf99e-4f96-4efa-9c3a-b59702f4f1e2",[],[211],{"id":101,"sortIndex":28,"affiliation":212,"properties":219},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":213,"slug":20,"properties":214,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":218,"statistic":20},[],{"title":215,"country":216,"abbreviation":217},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":220},{"VI":106},{"title":222,"gsAuthor":224},{"VI":223},"Xuan Tung Hoang",{"VOID":225},"piaD2uUAAAAJ",{"id":227,"sortIndex":28,"researcher":20,"roles":228,"affiliations":229,"properties":240,"displayName":242,"givenName":20,"familyName":20},"febbae8e-ee86-4de7-9934-1566c1df524e",[],[230],{"id":101,"sortIndex":28,"affiliation":231,"properties":238},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":232,"slug":20,"properties":233,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":237,"statistic":20},[],{"title":234,"country":235,"abbreviation":236},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":239},{"VI":106},{"title":241,"gsAuthor":243},{"VI":242},"Linh Manh Pham",{"VOID":244},"WVPZOGIAAAAJ",{"url":204,"publisher":246,"properties":260},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":247,"slug":10,"properties":248,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":252,"manageAffiliations":253,"indexDatabases":254,"url":25,"thumbnailPath":26,"statistic":255,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":249,"title":250,"country":251},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":256,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":257,"totalCitation":52,"totalCitationByYear":258,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":259,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":261,"title":263,"volume":266},{"VOID":262},"1",{"EN":264,"VI":265},"Vol. 37 No. 1","Tập 37 Số 1",{"VOID":267},"37",{"total":48,"publishYear":269,"statisticByYear":270},2021,{},"2021-02-02",[],{"id":274,"createTime":275,"updateTime":276,"relativeEntities":277,"slug":278,"properties":279,"entityType":91,"verifyStatus":19,"verifyTime":286,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":41,"primaryUrl":287,"fullTextUrl":288,"authors":289,"publicationType":157,"publisherRelationship":290,"citationCount":28,"citationInfo":309,"publishDate":184,"publishYear":182,"citationAnalyzeStatus":185,"lastCitationAnalyze":311,"indexDatabases":312,"openAccess":20,"references":20,"isForceReanalyzing":188},"925d92ba-3c89-44d4-bf29-09ad8995ca62","2023-06-13T08:16:46.367+00:00","2026-08-14T17:34:20.929+00:00",[],"-Target-tracking-solution-for-multi-sensor-data-fusion-in-wireless-sensor-networks",{"title":280,"gsPaper":282,"abstract":284},{"EN":281}," Target tracking solution for multi-sensor data fusion in wireless sensor networks",{"VOID":283},"8639312181839063775",{"EN":285},"Wireless sensor networks are often composed of many sensor nodes, they are powered by batteries with limited capacity. The sensor nodes are randomly scattered within in the ranger monitoring and send – receiver data using radio waves. Many research projects had demonstrated the consumption of battery power by the data transceiver occupy large compared to the calculation on the sensor node. In this paper, we propose energy saving solutions of nodes in a cluster by only choosing some nodes in the cluster to track the target and transmit this data to cluster head nodes. We based on the location of the sensor nodes in the cluster compare with the location of target and cluster head nodes to perform this selection. The effectiveness of the proposed solutions will be evaluated based on the number of sensor nodes are selected considering the number of nodes in the cluster, this  is the base for the effectiveness of energy saving as well as the cluster nodes.","2023-06-13T08:16:46.366+00:00","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F117","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F117\u002F39",[],{"url":287,"publisher":291,"properties":305},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":292,"slug":10,"properties":293,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":297,"manageAffiliations":298,"indexDatabases":299,"url":25,"thumbnailPath":26,"statistic":300,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":294,"title":295,"country":296},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":301,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":302,"totalCitation":52,"totalCitationByYear":303,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":304,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":306,"title":307,"volume":308},{"VOID":175},{"EN":177,"VI":178},{"VOID":180},{"total":28,"publishYear":182,"statisticByYear":310},{},"2026-08-14T17:34:20.924+00:00",[],{"id":314,"createTime":315,"updateTime":316,"relativeEntities":317,"slug":318,"properties":319,"entityType":91,"verifyStatus":19,"verifyTime":315,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":51,"primaryUrl":328,"fullTextUrl":20,"authors":329,"publicationType":157,"publisherRelationship":350,"citationCount":372,"citationInfo":373,"publishDate":376,"publishYear":374,"citationAnalyzeStatus":185,"lastCitationAnalyze":377,"indexDatabases":378,"openAccess":20,"references":20,"isForceReanalyzing":188},"861db6f5-6c71-46ed-b8e9-0879534f19d1","2023-06-13T08:17:19.826+00:00","2026-07-28T04:41:53.240+00:00",[],"-A-General-Model-of-Fractional-Frequency-Reuse-Modelling-and-Performance-Analysis",{"abstract":320,"title":322,"gsPaper":324,"doi":326},{"EN":321},"Fractional Frequency Reuse (FFR) is a promising to improve the spectrum e ciency in the LongTerm Evolution (LTE) cellular network. In the literature, various research works have been conducted to evaluate the performance of FFR. However, the presented analytical approach only dealt with the special cases in which the users are divided into 2 groups and only two power levels are utilised. In this paper, we consider a general case of FFR in which the users are classified intogroups and each group is assigned a serving power level. The mathematical model of the general FFR is presented and analysed through a stochastic geometry approach. The derived analytical results in terms of average coverage probability can covered all the related well-known results in the literature.\r\nKeywords: \r\nFractional Frequency Reuse, LongTerm Evolution, coverage probability, stochastic geometry\r\nReferences\r\n[1] Cisco, Cisco visual networking index: Global mobile data traffic forecast update, 2015 - 2020, 2016.\r\n[2] A.S. Hamza, S.S. Khalifa, H.S. Hamza, K. Elsayed, A Survey on Inter-Cell Interference Coordination Techniques in OFDMA-Based Cellular Networks, IEEE Commun, Surveys & Tutorials 15(4) (2013) 1642-1670\r\n[3] 3GPP TR 36.819 V11.1.0, Coordinated multi-point operation for LTE physical layer aspects, 2011.\r\n[4] 3GPP Release 10 V0.2.1, LTE-Advanced (3GPP Release 10 and beyond), 2014.\r\n[5] 3GPP TS 36.211 V14.1.0, E-UTRA Physical Channels and Modulation, 2016.\r\n[6] R. Ghaffar, R. Knopp, Fractional frequency reuse and interference suppression for ofdma networks, in: 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2010, pp. 273-277.\r\n[7] Y. Kwon, O. Lee, J. Lee, M. Chung, Power Control for Soft Fractional Frequency Reuse in OFDMA System, Vol. 6018 of Lecture Notes in Comput.Science, Springer Berlin Heidelberg, 2010, book section 7 (2010) 63-71.\r\n[8] Enhancing LTE Cell-Edge Performance via PDCCH ICIC, in: FUJITSU NETWORK COMMUNICATIONS INC., 2011\r\n[9] A.S. Hamza, S.S. Khalifa, H.S. Hamza, K. Elsayed, A Survey on Inter-Cell Interference Coordination Techniques in OFDMA-Based Cellular Networks, IEEE Commun, Surveys & Tutorials 15(4) (2013) 1642-1670. https:\u002F\u002Fdoi.org\u002F10.1109\u002FSURV.2013.013013.00028.\r\n[10] A. Busson1, I. Lahsen-Cherif2, Impact of resource blocks allocation strategies on downlink interference and sir distributions in lte networks: A stochastic geometry approach, Wireless Communications and Mobile Computing.\r\n[11] H. ElSawy, E. Hossain, M. Haenggi, Stochastic Geometry for Modeling, Analysis and Design of Multi-Tier and Cognitive Cellular Wireless Networks: A Survey, IEEE Commun, Surveys Tutorials 15(3) (2013) 996-1019. https:\u002F\u002Fdoi.org\u002F10.1109\u002FSURV.2013.052213.00000.\r\n[12] W. Bao, B. Liang, Stochastic Analysis of Uplink Interference in Two-Tier Femtocell Networks: Open Versus Closed Access, IEEE Trans, Wireless Commun. 14(11) (2015) 6200-6215. https:\u002F\u002Fdoi.org\u002F10.1109\u002FTWC.2015.2450216 .\r\n[13] H. Tabassum, Z. Dawy, E. Hossain, M.S. Alouini, Interference Statistics and Capacity Analysis for Uplink Transmission in Two-Tier Small Cell Networks: A Geometric Probability Approach, IEEE Trans, Wireless Commun 13(7) (2014) 3837-3852.\r\n[14] J.G. Andrews, F. Baccelli, R.K. Ganti, A tractable approach to coverage and rate in cellular networks, IEEE Transactions on Communications 59(11) (2011) 3122-3134.\r\n[15] Y. Lin, W. Bao, W. Yu, B. Liang, Optimizing User Association and Spectrum Allocation in HetNets: A Utility Perspective, IEEE J. Sel. Areas Commun. 33(6) (2015) 1025-1039. https:\u002F\u002Fdoi.org\u002F10.1109\u002FJSAC.2015.2417011.\r\n[16] M. Haenggi, Stochastic Geometry for Wireless Networks, Cambridge Univ, Press, November 2012.\r\n[17] H. ElSawy, E. Hossain, M. Haenggi, Stochastic Geometry for Modeling, Analysis and Design of Multi-Tier and Cognitive Cellular Wireless Networks: A Survey, IEEE Commun, Surveys Tutorials 15(3) (2013) 996-1019.\r\n[18] Huawei, R1-050507: Soft Frequency Reuse Scheme for UTRAN LTE, in: 3GPP TSG RAN WG1 Meeting #41, 2005.\r\n[19] M.A. Stegun, I.A., Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, 9th Edition, Dover Publications, 1972.",{"VI":323}," A General Model of Fractional Frequency Reuse:  Modelling and Performance Analysis",{"VOID":325},"3385379115161340551",{"VOID":327},"10.25073\u002F2588-1086\u002Fvnucsce.221","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F221",[330],{"id":331,"sortIndex":28,"researcher":20,"roles":332,"affiliations":333,"properties":345,"displayName":347,"givenName":20,"familyName":20},"06ddd031-d49f-4d4a-86f3-4741fd7b10fa",[],[334],{"id":101,"sortIndex":28,"affiliation":335,"properties":342},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":336,"slug":20,"properties":337,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":341,"statistic":20},[],{"title":338,"country":339,"abbreviation":340},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":343},{"VI":344},"VNU - University of Engineering and Technology",{"title":346,"gsAuthor":348},{"VI":347},"Lam Sinh Cong",{"VOID":349},"L-Z-HmAAAAAJ",{"url":328,"publisher":351,"properties":365},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":352,"slug":10,"properties":353,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":357,"manageAffiliations":358,"indexDatabases":359,"url":25,"thumbnailPath":26,"statistic":360,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":354,"title":355,"country":356},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":361,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":362,"totalCitation":52,"totalCitationByYear":363,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":364,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":366,"title":367,"volume":370},{"VOID":262},{"EN":368,"VI":369},"Vol. 36 No. 1","Tập 36 Số 1",{"VOID":371},"36",7,{"total":372,"publishYear":374,"statisticByYear":375},2020,{"2020":41,"2021":51,"2024":41},"2020-05-18","2026-07-28T04:41:53.239+00:00",[],{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":91,"verifyStatus":19,"verifyTime":381,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":28,"primaryUrl":394,"fullTextUrl":395,"authors":396,"publicationType":157,"publisherRelationship":439,"citationCount":28,"citationInfo":461,"publishDate":464,"publishYear":462,"citationAnalyzeStatus":185,"lastCitationAnalyze":465,"indexDatabases":466,"openAccess":20,"references":20,"isForceReanalyzing":188},"4d19cdbe-e38f-4d40-949b-6e9fa6e18903","2023-06-13T08:19:59.056+00:00","2026-07-25T05:28:08.533+00:00",[],"-Vietnamese-Semantic-Role-Labelling",{"abstract":386,"title":388,"gsPaper":390,"doi":392},{"EN":387},"In this paper, we study semantic role labelling (SRL), a subtask of semantic parsing of natural language sentences and its application for the Vietnamese language. We present our effort in building Vietnamese PropBank, a first Vietnamese SRL corpus and a software system for labelling semantic roles of Vietnamese texts. In particular, we present a novel constituent extraction algorithm in the argument candidate identification step which is more suitable and more accurate than a common node-mapping method. In the learning machine part, our system integrates distributed word features produced by two recent unsupervised learning models in two learned statistical classifiers and makes use of integer linear programming inference procedure to improve the accuracy. The system is evaluated in a series of experiments and achieves a good result, an $F_1$ score of 74.77\\%. Our system, including corpus and software, is available as an open source project for free research and we believe that it is a good baseline for the development of future Vietnamese SRL systems.",{"VI":389}," Vietnamese Semantic Role Labelling",{"VOID":391},"16770229072328713328",{"VOID":393},"10.25073\u002F2588-1086\u002Fvnucsce.166","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F166","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F166\u002F77",[397,419],{"id":398,"sortIndex":28,"researcher":20,"roles":399,"affiliations":400,"properties":414,"displayName":416,"givenName":20,"familyName":20},"c78e1cd9-b98e-4510-b7a0-feef966fed5b",[],[401],{"id":402,"sortIndex":28,"affiliation":403,"properties":20},"e8d1641b-8def-4dbc-ae28-32c11cace16d",{"id":402,"createTime":20,"updateTime":20,"relativeEntities":404,"slug":20,"properties":405,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":412,"parentIds":413,"statistic":20},[],{"title":406,"country":409,"abbreviation":410},{"EN":407,"VI":408},"VNU University of Science","Trường Đại học Khoa học Tự nhiên, Đại học Quốc gia Hà Nội",{"VOID":17},{"VOID":411},"HUS-VNU","https:\u002F\u002Fhus.vnu.edu.vn\u002F",[113],{"title":415,"gsAuthor":417},{"VI":416},"Le Hong Phuong",{"VOID":418},"cIQiuKYAAAAJ",{"id":420,"sortIndex":28,"researcher":20,"roles":421,"affiliations":422,"properties":435,"displayName":437,"givenName":20,"familyName":20},"96883fe7-f944-4d1f-9b68-6fc7336e95fe",[],[423],{"id":424,"sortIndex":28,"affiliation":425,"properties":432},"e42cb37a-c99f-4f44-a694-8332ffebe3b1",{"id":424,"createTime":20,"updateTime":20,"relativeEntities":426,"slug":20,"properties":427,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":431,"statistic":20},[],{"title":428,"country":430},{"VI":429},"FPT University, Hanoi, Vietnam",{"VOID":17},[],{"title":433},{"VI":434},"FPT University",{"title":436,"gsAuthor":438},{"VI":437},"Pham Thai Hoang",{"VOID":418},{"url":394,"publisher":440,"properties":454},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":441,"slug":10,"properties":442,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":446,"manageAffiliations":447,"indexDatabases":448,"url":25,"thumbnailPath":26,"statistic":449,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":443,"title":444,"country":445},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":450,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":451,"totalCitation":52,"totalCitationByYear":452,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":453,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":455,"title":456,"volume":459},{"VOID":175},{"EN":457,"VI":458},"Vol. 33 No. 2","Tập 33 Số 2",{"VOID":460},"33",{"total":28,"publishYear":462,"statisticByYear":463},2018,{},"2018-03-11","2026-07-25T05:28:08.532+00:00",[],{"id":468,"createTime":469,"updateTime":470,"relativeEntities":471,"slug":472,"properties":473,"entityType":91,"verifyStatus":19,"verifyTime":482,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":28,"primaryUrl":483,"fullTextUrl":484,"authors":485,"publicationType":157,"publisherRelationship":506,"citationCount":525,"citationInfo":526,"publishDate":464,"publishYear":462,"citationAnalyzeStatus":185,"lastCitationAnalyze":529,"indexDatabases":530,"openAccess":20,"references":20,"isForceReanalyzing":188},"58655294-1406-477f-917f-51f4fbf285b2","2023-06-13T08:20:36.275+00:00","2026-07-23T18:49:34.734+00:00",[],"-Deep-Learning-for-Epileptic-Spike-Detection",{"abstract":474,"title":476,"gsPaper":478,"doi":480},{"EN":475},"In the clinical diagnosis of epilepsy using electroencephalogram (EEG) data, an accurate automatic epileptic spikes  detection system is highly useful and  meaningful in that the conventional manual process is not only very tedious and time-consuming, but also subjective since it depends on the knowledge and experience of the doctors. In this paper, motivated by significant advantages and lots of achieved successes of deep learning in  data mining, we apply Deep Belief Network (DBN), which is one of the breakthrough models laid the foundation for deep learning, to detect epileptic spikes in EEG data. It is really useful in practice because the promising quality evaluation of the spike detection system is higher than $90$\\%.  In particular, to construct  accurate detection model for non-spikes and spikes, a new set of detailed features of epileptic spikes is proposed. These features were then fed to the DBN which is modified from a generative model into a discriminative model to aim at classification accuracy. The experiment results indicate that it is possible to use deep learning models for epileptic spike detection with very high performance in item of sensitivity, selectivity, specificity and accuracy  92.82%,  97.83% , 96.41%, and 96.87%, respectively.",{"EN":477}," Deep Learning for Epileptic Spike Detection",{"VOID":479},"9344048952936697121",{"VOID":481},"10.25073\u002F2588-1086\u002Fvnucsce.156","2023-06-13T08:20:36.274+00:00","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F156","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F156\u002F80",[486],{"id":487,"sortIndex":28,"researcher":20,"roles":488,"affiliations":489,"properties":501,"displayName":503,"givenName":20,"familyName":20},"7ffd05a5-7f82-4e1f-a9c3-8b98a4da6f59",[],[490],{"id":101,"sortIndex":28,"affiliation":491,"properties":498},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":492,"slug":20,"properties":493,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":497,"statistic":20},[],{"title":494,"country":495,"abbreviation":496},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":499},{"VI":500},"UET",{"title":502,"gsAuthor":504},{"VI":503},"Tran Quoc Long",{"VOID":505},"_6GEXU4AAAAJ",{"url":483,"publisher":507,"properties":521},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":508,"slug":10,"properties":509,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":513,"manageAffiliations":514,"indexDatabases":515,"url":25,"thumbnailPath":26,"statistic":516,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":510,"title":511,"country":512},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":517,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":518,"totalCitation":52,"totalCitationByYear":519,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":520,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":522,"title":523,"volume":524},{"VOID":175},{"EN":457,"VI":458},{"VOID":460},53,{"total":525,"publishYear":462,"statisticByYear":527},{"2018":41,"2019":40,"2020":372,"2021":372,"2022":46,"2023":40,"2024":528,"2025":372,"2026":51},4,"2026-07-23T18:49:34.733+00:00",[],{"id":532,"createTime":533,"updateTime":534,"relativeEntities":535,"slug":536,"properties":537,"entityType":91,"verifyStatus":19,"verifyTime":533,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":51,"primaryUrl":544,"fullTextUrl":545,"authors":546,"publicationType":157,"publisherRelationship":579,"citationCount":28,"citationInfo":602,"publishDate":605,"publishYear":603,"citationAnalyzeStatus":606,"lastCitationAnalyze":607,"indexDatabases":608,"openAccess":20,"references":20,"isForceReanalyzing":188},"ce62dd70-c440-4ec2-a9a7-6b3ec0f629c3","2023-06-13T08:19:04.908+00:00","2026-07-23T11:20:37.610+00:00",[],"-Max-%C3%A2-Min-Composition-of-Linguistic-Intuitionistic-Fuzzy-Relations-and-Application-in-Medical-Diagnosis",{"title":538,"gsPaper":540,"abstract":542},{"EN":539}," Max – Min Composition of Linguistic Intuitionistic Fuzzy Relations and Application in Medical Diagnosis",{"VOID":541},"19166512730282638",{"EN":543},"In this paper, we first introduce notion of linguistic intuitionistic fuzzy relations. This notion may be useful in situations when each correspondence of objects is presented as two labels such that the first expresses degree of membership, and the second expresses degree of non-membership as in the intuitionistic fuzzy theory. Sanchez's approach for medical diagnosis is extended using linguistic intuitionistic fuzzy relation.","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F16","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F16\u002F9",[547,564],{"id":548,"sortIndex":28,"researcher":20,"roles":549,"affiliations":550,"properties":559,"displayName":561,"givenName":20,"familyName":20},"5339d2bb-b3e6-46a2-93c4-f9d7693c3e20",[],[551],{"id":552,"sortIndex":28,"affiliation":553,"properties":20},"77c24b19-4110-4c48-a7f0-f8ff8464c1f2",{"id":552,"createTime":20,"updateTime":20,"relativeEntities":554,"slug":20,"properties":555,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":558,"statistic":20},[],{"title":556},{"EN":557},"Faculty of Information Technology, National University of Civil Engineering",[],{"title":560,"gsAuthor":562},{"VI":561},"Phạm Hồng Phong",{"VOID":563},"rVTphAwAAAAJ",{"id":565,"sortIndex":28,"researcher":20,"roles":566,"affiliations":567,"properties":576,"displayName":578,"givenName":20,"familyName":20},"58b35cca-06c3-4c6e-893c-3b9e017eecd1",[],[568],{"id":569,"sortIndex":28,"affiliation":570,"properties":20},"0788b3c9-1a97-4ad3-a2ae-2b6622840f05",{"id":569,"createTime":20,"updateTime":20,"relativeEntities":571,"slug":20,"properties":572,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":575,"statistic":20},[],{"title":573},{"EN":574},"Vietnam Academy of Science and Technology, Vietnam",[],{"title":577},{"VI":578},"Bùi Công Cường",{"url":544,"publisher":580,"properties":594},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":581,"slug":10,"properties":582,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":586,"manageAffiliations":587,"indexDatabases":588,"url":25,"thumbnailPath":26,"statistic":589,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":583,"title":584,"country":585},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":590,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":591,"totalCitation":52,"totalCitationByYear":592,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":593,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":595,"title":597,"volume":600},{"VOID":596},"4",{"EN":598,"VI":599},"Vol. 30 No. 4","Tập 30 Số 4",{"VOID":601},"30",{"total":28,"publishYear":603,"statisticByYear":604},2015,{},"2015-01-06","PENDING","2026-07-23T11:20:37.609+00:00",[],{"id":610,"createTime":611,"updateTime":612,"relativeEntities":613,"slug":614,"properties":615,"entityType":91,"verifyStatus":19,"verifyTime":611,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":62,"primaryUrl":624,"fullTextUrl":625,"authors":626,"publicationType":157,"publisherRelationship":696,"citationCount":41,"citationInfo":717,"publishDate":719,"publishYear":269,"citationAnalyzeStatus":606,"lastCitationAnalyze":612,"indexDatabases":720,"openAccess":20,"references":20,"isForceReanalyzing":188},"1db6ffeb-50f7-4e8b-8434-e629d6e090f0","2023-06-13T08:19:48.473+00:00","2026-07-22T11:48:02.331+00:00",[],"-Ultra-High-Throughput-Multi-Core-AES-Encryption-Hardware-Architecture",{"abstract":616,"title":618,"gsPaper":620,"doi":622},{"EN":617},"Security issues in high-speed data transfer between devices are always a big challenge. On the other hand, new data transfer standards such as IEEE P802.3bs 2017 stipulate the maximum data rate up to 400 Gbps. So, security encryptions need high throughput to meet data transfer rates and low latency to ensure the quality of services. In this paper, we propose a multi-core AES encryption hardware architecture to achieve ultra-high-throughput encryption. To reduce area cost and power consumption, these cores share the same KeyExpansion blocks. Fully parallel, outer round pipeline technique is also applied to the proposed architecture to achieve low latency encryption. The design has been modelled at RTL (Register-Transfer-Level) in VHDL and then synthesized with a CMOS 45nm technology using Synopsys Design Compiler. With 10-cores fully parallel and outer round pipeline, the implementation results show that our architecture achieves a throughput of 1 Tbps at the maximum operating frequency of 800 MHz. These results meet the speed requirements of future communication standards. In addition, our design also achieves a high power-efficiency of 2377 Gbps\u002FW and area-efficiency of 833 Gbps\u002Fmm2, that is 2.6x and 4.5x higher than those of the other highest throughput of single-core AES, respectively.",{"VI":619}," Ultra-High-Throughput Multi-Core AES Encryption Hardware Architecture",{"VOID":621},"14602268935087301886",{"VOID":623},"10.25073\u002F2588-1086\u002Fvnucsce.290","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F290","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F290\u002F130",[627,645,660,677],{"id":628,"sortIndex":28,"researcher":20,"roles":629,"affiliations":630,"properties":642,"displayName":644,"givenName":20,"familyName":20},"e370be30-ed7f-4371-a17a-31821bc5a325",[],[631],{"id":101,"sortIndex":28,"affiliation":632,"properties":639},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":633,"slug":20,"properties":634,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":638,"statistic":20},[],{"title":635,"country":636,"abbreviation":637},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":640},{"VI":641},"VNU University of Engineering and Technology (VNU-UET)",{"title":643},{"VI":644},"Xuan Tu Tran",{"id":646,"sortIndex":28,"researcher":20,"roles":647,"affiliations":648,"properties":657,"displayName":659,"givenName":20,"familyName":20},"a72d8ad1-bdfa-4ada-944b-47cb71fb9a70",[],[649],{"id":650,"sortIndex":28,"affiliation":651,"properties":20},"b8f5aa98-a36d-4aec-ba8c-49178661aa0d",{"id":650,"createTime":20,"updateTime":20,"relativeEntities":652,"slug":20,"properties":653,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":656,"statistic":20},[],{"title":654},{"VI":655},"SISLAB, VNU University of Engineering and Technology",[],{"title":658},{"VI":659},"Pham Khoi Dong",{"id":661,"sortIndex":28,"researcher":20,"roles":662,"affiliations":663,"properties":672,"displayName":674,"givenName":20,"familyName":20},"bb7a53d5-57c4-4355-8139-6cdb975de91d",[],[664],{"id":665,"sortIndex":28,"affiliation":666,"properties":20},"f8479875-69e1-47ac-b2b0-1b2cf7f3b402",{"id":665,"createTime":20,"updateTime":20,"relativeEntities":667,"slug":20,"properties":668,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":20,"parentIds":671,"statistic":20},[],{"title":669},{"VI":670},"Universiti Teknologi PETRONAS",[],{"title":673,"gsAuthor":675},{"VI":674},"Fawnizu Azmadi Hussin",{"VOID":676},"nu__DyUAAAAJ",{"id":678,"sortIndex":28,"researcher":20,"roles":679,"affiliations":680,"properties":691,"displayName":693,"givenName":20,"familyName":20},"971dc1fb-e76a-4235-abee-62551c5e6bdb",[],[681],{"id":101,"sortIndex":28,"affiliation":682,"properties":689},{"id":101,"createTime":20,"updateTime":20,"relativeEntities":683,"slug":20,"properties":684,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":111,"parentIds":688,"statistic":20},[],{"title":685,"country":686,"abbreviation":687},{"EN":106,"VI":107},{"VOID":17},{"VOID":110},[113],{"title":690},{"VI":106},{"title":692,"gsAuthor":694},{"VI":693},"Hung K Nguyen",{"VOID":695},"gJ8RS40AAAAJ",{"url":624,"publisher":697,"properties":711},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":698,"slug":10,"properties":699,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":703,"manageAffiliations":704,"indexDatabases":705,"url":25,"thumbnailPath":26,"statistic":706,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":700,"title":701,"country":702},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":707,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":708,"totalCitation":52,"totalCitationByYear":709,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":710,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":712,"title":713,"volume":716},{"VOID":175},{"EN":714,"VI":715},"Vol. 37 No. 2","Tập 37 Số 2",{"VOID":267},{"total":41,"publishYear":269,"statisticByYear":718},{"2022":41},"2021-11-11",[],{"id":722,"createTime":723,"updateTime":724,"relativeEntities":725,"slug":726,"properties":727,"entityType":91,"verifyStatus":19,"verifyTime":723,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":51,"primaryUrl":736,"fullTextUrl":737,"authors":738,"publicationType":157,"publisherRelationship":765,"citationCount":41,"citationInfo":787,"publishDate":790,"publishYear":788,"citationAnalyzeStatus":606,"lastCitationAnalyze":791,"indexDatabases":792,"openAccess":20,"references":20,"isForceReanalyzing":188},"f57aec60-4739-4e40-8551-fb21a64c48d3","2023-06-13T08:17:18.149+00:00","2026-07-22T06:56:05.774+00:00",[],"-TTS-VLSP-2021-The-Thunder-Text-To-Speech-System",{"abstract":728,"title":730,"gsPaper":732,"doi":734},{"EN":729},"This paper describes our speech synthesis system participating in the Vietnamese Text-To-Speech track of the 2021 VLSP evaluation campaign. The goal of this challenge is to build a synthetic voice from a provided spontaneous speech corpus in Vietnamese. In this paper, we propose our implementation of FastSpeech2 model on spontaneous speech. We used a special strategy with spontaneous datasets using the TTS system. We present our utilization in generating mel-spectrograms from given texts and then synthesize speech from generated mel-spectrograms using a separately trained vocoder. In evaluation, our team achieved 3.943 mean score in MOS in-domain test, 3.3 in MOS out-domain test, and 85.00% SUS, which indicates the effectiveness of the proposed system.",{"VI":731}," TTS - VLSP 2021: The Thunder Text-To-Speech System",{"VOID":733},"7540370778190472045",{"VOID":735},"10.25073\u002F2588-1086\u002Fvnucsce.342","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F342","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F342\u002F141",[739],{"id":740,"sortIndex":28,"researcher":20,"roles":741,"affiliations":742,"properties":762,"displayName":764,"givenName":20,"familyName":20},"0a439078-1960-415f-b42c-a493d4a9020f",[],[743],{"id":744,"sortIndex":28,"affiliation":745,"properties":759},"a0ffb452-1e1c-4a15-8729-f8246de4493e",{"id":744,"createTime":20,"updateTime":20,"relativeEntities":746,"slug":20,"properties":747,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":757,"parentIds":758,"statistic":20},[],{"title":748,"address":751,"country":754,"abbreviation":755},{"EN":749,"VI":750},"Hanoi University of Science and Technology","Đại học Bách khoa Hà Nội",{"EN":752,"VI":753},"No. 1, Dai Co Viet Street, Bach Khoa Ward, Hai Ba Trung District, Hanoi City, Vietnam","Số 1, Đại Cồ Việt, Phường Bách Khoa, Quận Hai Bà Trưng, Thành phố Hà Nội, Việt Nam",{"VOID":17},{"VOID":756},"HUST","https:\u002F\u002Fhust.edu.vn",[],{"title":760},{"VI":761},"Hanoi university of science and technology",{"title":763},{"VI":764},"Nguyen Thi Ngoc Anh",{"url":736,"publisher":766,"properties":780},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":767,"slug":10,"properties":768,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":772,"manageAffiliations":773,"indexDatabases":774,"url":25,"thumbnailPath":26,"statistic":775,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":769,"title":770,"country":771},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":776,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":777,"totalCitation":52,"totalCitationByYear":778,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":779,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":781,"title":782,"volume":785},{"VOID":262},{"EN":783,"VI":784},"Vol. 38 No. 1","Tập 38 Số 1",{"VOID":786},"38",{"total":41,"publishYear":788,"statisticByYear":789},2022,{"2022":41},"2022-06-30","2026-07-22T06:56:05.773+00:00",[],{"id":794,"createTime":795,"updateTime":796,"relativeEntities":797,"slug":798,"properties":799,"entityType":91,"verifyStatus":19,"verifyTime":795,"verifyNote":92,"languages":20,"translateLanguages":20,"viewCount":28,"primaryUrl":806,"fullTextUrl":807,"authors":808,"publicationType":157,"publisherRelationship":852,"citationCount":528,"citationInfo":874,"publishDate":877,"publishYear":875,"citationAnalyzeStatus":606,"lastCitationAnalyze":796,"indexDatabases":878,"openAccess":20,"references":20,"isForceReanalyzing":188},"a0fab336-38ff-43e7-81f1-4e96fd7849f0","2023-06-13T08:15:56.112+00:00","2026-07-21T00:57:13.678+00:00",[],"-An-Experimental-Investigation-of-Part-Of-Speech-Taggers-for-Vietnamese",{"title":800,"gsPaper":802,"abstract":804},{"EN":801}," An Experimental Investigation of Part-Of-Speech Taggers for Vietnamese",{"VOID":803},"6499455994304056440",{"EN":805},"Part-of-speech (POS) tagging plays an important role in Natural Language Processing (NLP). Its applications can be found in many other NLP tasks such as named entity recognition, syntactic parsing and text chunking. Recent studies for common languages such as English and French gain very high precision for this core NLP task. However, current results for less common language like Vietnamese are not as good as for those languages. In our investigation, we utilized the techniques of two widely used toolkits, ClearNLP and Stanford POS Tagger, and made two new taggers to compare with three well-known Vietnamese taggers, namely JVnTagger, vnTagger and RDRPOSTagger. We created a unique evaluation scheme to make a systematic comparison and investigate that which tagger has the best accuracy and speed. The comparison revealed that our two new taggers built from ClearNLP and Stanford POS Tagger make overall accuracies of 94.50% and 94.39%, respectively, and outperform all other toolkits. Moreover, in our speed testing, RDRPOSTagger produces an impressive tagging speed and performs significantly faster than any other stochastic taggers.","https:\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fview\u002F128","\u002F\u002Fjcsce.vnu.edu.vn\u002Findex.php\u002Fjcsce\u002Farticle\u002Fdownload\u002F128\u002F45",[809,833],{"id":810,"sortIndex":28,"researcher":20,"roles":811,"affiliations":812,"properties":828,"displayName":830,"givenName":20,"familyName":20},"93a67863-52a5-4f6b-b390-5c65084f8260",[],[813],{"id":814,"sortIndex":28,"affiliation":815,"properties":826},"cbd131dd-8a85-41ec-bcfa-2ccaf9a8f2a0",{"id":814,"createTime":20,"updateTime":20,"relativeEntities":816,"slug":20,"properties":817,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":824,"parentIds":825,"statistic":20},[],{"title":818,"country":821,"abbreviation":822},{"EN":819,"VI":820},"Faculty of Information Technology, VNU University of Engineering and Technology","Khoa Công nghệ Thông tin, Trường Đại học Công nghệ, Đại học Quốc Gia Hà Nội",{"VOID":17},{"VOID":823},"FIT-UET","https:\u002F\u002Fwww.fit.uet.vnu.edu.vn\u002F",[101],{"title":827},{"VI":819},{"title":829,"gsAuthor":831},{"VI":830},"Tuan Phong Nguyen",{"VOID":832},"JXZlcpwAAAAJ",{"id":834,"sortIndex":28,"researcher":20,"roles":835,"affiliations":836,"properties":847,"displayName":849,"givenName":20,"familyName":20},"2c1867a9-d91b-40cb-aa3b-cf5b241e0470",[],[837],{"id":814,"sortIndex":28,"affiliation":838,"properties":845},{"id":814,"createTime":20,"updateTime":20,"relativeEntities":839,"slug":20,"properties":840,"entityType":20,"verifyStatus":20,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":20,"url":824,"parentIds":844,"statistic":20},[],{"title":841,"country":842,"abbreviation":843},{"EN":819,"VI":820},{"VOID":17},{"VOID":823},[101],{"title":846},{"VI":819},{"title":848,"gsAuthor":850},{"VI":849},"Anh Cuong Le",{"VOID":851},"fpBTRIUAAAAJ",{"url":806,"publisher":853,"properties":867},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":854,"slug":10,"properties":855,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":859,"manageAffiliations":860,"indexDatabases":861,"url":25,"thumbnailPath":26,"statistic":862,"gsStatistic":20,"type":20,"analyzePriority":20},[],{"issn":856,"title":857,"country":858},{"VOID":13},{"EN":15},{"VOID":17},[],[],[],{"impactFactor":28,"impactFactorByYear":863,"i10Index":40,"i10IndexLast5Year":41,"totalPublication":42,"totalPublicationByYear":864,"totalCitation":52,"totalCitationByYear":865,"totalCitationPerPublication":63,"totalCitationPerPublicationByYear":866,"hindexLast5Year":73,"hindex":73},{"2015":30,"2016":31,"2017":32,"2018":33,"2019":34,"2020":35,"2021":36,"2022":37,"2023":38,"2024":39},{"2014":40,"2015":44,"2016":45,"2017":46,"2018":47,"2019":48,"2020":44,"2021":49,"2022":50,"2023":51},{"2014":54,"2015":55,"2016":45,"2017":56,"2018":57,"2019":58,"2020":59,"2021":60,"2022":61,"2023":62},{"2014":65,"2015":66,"2016":41,"2017":67,"2018":68,"2019":69,"2020":62,"2021":70,"2022":71,"2023":72},{"issue":868,"title":870,"volume":873},{"VOID":869},"3",{"EN":871,"VI":872},"Vol. 32 No. 3","Tập 32 Số 3",{"VOID":180},{"total":528,"publishYear":875,"statisticByYear":876},2017,{"2017":41,"2018":41,"2020":41,"2024":41},"2017-01-03",[]]