Pub Date : 2024-01-10DOI: 10.1007/s44227-023-00017-6
Sara Khernane, S. Bouam, C. Arar
{"title":"Renewable Energy Harvesting for Wireless Sensor Networks in Precision Agriculture","authors":"Sara Khernane, S. Bouam, C. Arar","doi":"10.1007/s44227-023-00017-6","DOIUrl":"https://doi.org/10.1007/s44227-023-00017-6","url":null,"abstract":"","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"5 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139440331","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 : 2024-01-03DOI: 10.1007/s44227-023-00018-5
Abdur Rahman Fahad, Nazme Al Nahian, Md Ahanaf Islam, R. Rahman
{"title":"Answer Agnostic Question Generation in Bangla Language","authors":"Abdur Rahman Fahad, Nazme Al Nahian, Md Ahanaf Islam, R. Rahman","doi":"10.1007/s44227-023-00018-5","DOIUrl":"https://doi.org/10.1007/s44227-023-00018-5","url":null,"abstract":"","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"53 23","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139389076","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-12-21DOI: 10.1007/s44227-023-00015-8
Tayebeh Khoshrooynemati, Ehsan Mousavi Khaneghah
{"title":"ExaPRR: A Framework for Support Dynamic and Interactive Events on Distributed Published Resource Repositories Mechanism in Distributed Exascale Computing Systems","authors":"Tayebeh Khoshrooynemati, Ehsan Mousavi Khaneghah","doi":"10.1007/s44227-023-00015-8","DOIUrl":"https://doi.org/10.1007/s44227-023-00015-8","url":null,"abstract":"","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"87 5","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138951468","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-12-06DOI: 10.1007/s44227-023-00016-7
N. S. Nithya, M. J. Idrisi
{"title":"Enhancements in Circle Rendering: An Improved Approach to the Midpoint Circle Drawing Algorithm","authors":"N. S. Nithya, M. J. Idrisi","doi":"10.1007/s44227-023-00016-7","DOIUrl":"https://doi.org/10.1007/s44227-023-00016-7","url":null,"abstract":"","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"76 2","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138596160","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-11-15DOI: 10.1007/s44227-023-00014-9
Madhukar Shrestha, Yonghyun Kim, Jeehyun Oh, Junghwan Rhee, Yung Ryn Choe, Fei Zuo, Myungah Park, Gang Qian
{"title":"ProvSec: Open Cybersecurity System Provenance Analysis Benchmark Dataset with Labels","authors":"Madhukar Shrestha, Yonghyun Kim, Jeehyun Oh, Junghwan Rhee, Yung Ryn Choe, Fei Zuo, Myungah Park, Gang Qian","doi":"10.1007/s44227-023-00014-9","DOIUrl":"https://doi.org/10.1007/s44227-023-00014-9","url":null,"abstract":"","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"66 1","pages":"112 - 123"},"PeriodicalIF":1.7,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139275813","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-11-08DOI: 10.1007/s44227-023-00013-w
Hiroaki Hirata, Atsushi Nunome
Abstract Binary search trees (BSTs) are one of the most important data structures in the field of computer science. We may easily write a parallel construction program of a BST by extending the sequential algorithm straightly. However, in such conventional approaches, the order of nodes inserted into a BST is determined dynamically, depending on the occasional state of the parallel thread execution. It results in a BST with a different structure (node position) generated on every execution of the parallel program. On the other hand, we have been developing parallel construction schemes of the BST with the same structure as a BST generated by the sequential algorithm. One is the speculatively parallel construction of a BST. And another is the purely (non-speculatively) parallel construction, but it was derived through the concept of thread-level speculation. This paper evaluates the performances of those construction schemes on several types of shared-memory multiprocessors. For the large enough size of BST, our new parallel programs can construct a BST with always the same structure on a little lower or sometimes higher performance than the program that makes a BST with a different structure on every execution. And in contrast with the general expectation that simply enlarging the size of parallel tasks increases misspeculation and damages the performance, we found that it sometimes enhances the performance of speculatively parallel execution.
{"title":"Performance Evaluation on Parallel Speculation-Based Construction of a Binary Search Tree","authors":"Hiroaki Hirata, Atsushi Nunome","doi":"10.1007/s44227-023-00013-w","DOIUrl":"https://doi.org/10.1007/s44227-023-00013-w","url":null,"abstract":"Abstract Binary search trees (BSTs) are one of the most important data structures in the field of computer science. We may easily write a parallel construction program of a BST by extending the sequential algorithm straightly. However, in such conventional approaches, the order of nodes inserted into a BST is determined dynamically, depending on the occasional state of the parallel thread execution. It results in a BST with a different structure (node position) generated on every execution of the parallel program. On the other hand, we have been developing parallel construction schemes of the BST with the same structure as a BST generated by the sequential algorithm. One is the speculatively parallel construction of a BST. And another is the purely (non-speculatively) parallel construction, but it was derived through the concept of thread-level speculation. This paper evaluates the performances of those construction schemes on several types of shared-memory multiprocessors. For the large enough size of BST, our new parallel programs can construct a BST with always the same structure on a little lower or sometimes higher performance than the program that makes a BST with a different structure on every execution. And in contrast with the general expectation that simply enlarging the size of parallel tasks increases misspeculation and damages the performance, we found that it sometimes enhances the performance of speculatively parallel execution.","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"51 S256","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135342687","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-08-27DOI: 10.1007/s44227-023-00011-y
Erdan Wang, Pouria Tayebi, Yeong-Tae Song
Abstract In a medical emergency situation, real-time patient data sharing may improve the survivability of a patient. In this paper, we explore how Digital Twin (DT) technology can be used for real-time data storage and processing in emergency healthcare. We investigated various enabling technologies, including cloud platforms, data transmission formats, and storage file formats, to develop a feasible DT storage solution for emergency healthcare. Through our analysis, we found Amazon AWS to be the most suitable cloud platform due to its sophisticated real-time data processing and analytical tools. Additionally, we determine that the MQTT protocol is suitable for real-time medical data transmission, and FHIR is the most appropriate medical file storage format for emergency healthcare situations. We propose a cloud-based DT storage solution, in which real-time medical data are transmitted to AWS IoT Core, processed by Kinesis Data Analytics, and stored securely in AWS HealthLake. Despite the feasibility of the proposed solution, challenges such as insufficient access control, lack of encryption, and vendor conformity must be addressed for successful practical implementation. Future work may involve Hyperledger Fabric technology and HTTPS protocol to enhance security, while the maturation of DT technology is expected to resolve vendor conformity issues. By addressing these challenges, our proposed DT storage solution has the potential to improve data accessibility and decision-making in emergency healthcare settings.
在医疗紧急情况下，实时患者数据共享可以提高患者的生存能力。在本文中，我们探讨了如何将数字孪生(DT)技术用于紧急医疗保健中的实时数据存储和处理。我们研究了各种启用技术，包括云平台、数据传输格式和存储文件格式，以便为紧急医疗保健开发可行的DT存储解决方案。通过我们的分析，我们发现亚马逊AWS是最合适的云平台，因为它有成熟的实时数据处理和分析工具。此外，我们确定MQTT协议适合实时医疗数据传输，而FHIR是最适合紧急医疗状况的医疗文件存储格式。我们提出了一种基于云的DT存储解决方案，将实时医疗数据传输到AWS IoT Core，由Kinesis data Analytics进行处理，并安全存储在AWS HealthLake中。尽管提出的解决方案是可行的，但是要想成功地实际实现，必须解决诸如访问控制不足、缺乏加密和供应商一致性等挑战。未来的工作可能涉及Hyperledger Fabric技术和HTTPS协议，以增强安全性，而DT技术的成熟有望解决供应商一致性问题。通过解决这些挑战，我们提出的DT存储解决方案有可能改善紧急医疗保健环境中的数据可访问性和决策。
{"title":"Cloud-Based Digital Twins’ Storage in Emergency Healthcare","authors":"Erdan Wang, Pouria Tayebi, Yeong-Tae Song","doi":"10.1007/s44227-023-00011-y","DOIUrl":"https://doi.org/10.1007/s44227-023-00011-y","url":null,"abstract":"Abstract In a medical emergency situation, real-time patient data sharing may improve the survivability of a patient. In this paper, we explore how Digital Twin (DT) technology can be used for real-time data storage and processing in emergency healthcare. We investigated various enabling technologies, including cloud platforms, data transmission formats, and storage file formats, to develop a feasible DT storage solution for emergency healthcare. Through our analysis, we found Amazon AWS to be the most suitable cloud platform due to its sophisticated real-time data processing and analytical tools. Additionally, we determine that the MQTT protocol is suitable for real-time medical data transmission, and FHIR is the most appropriate medical file storage format for emergency healthcare situations. We propose a cloud-based DT storage solution, in which real-time medical data are transmitted to AWS IoT Core, processed by Kinesis Data Analytics, and stored securely in AWS HealthLake. Despite the feasibility of the proposed solution, challenges such as insufficient access control, lack of encryption, and vendor conformity must be addressed for successful practical implementation. Future work may involve Hyperledger Fabric technology and HTTPS protocol to enhance security, while the maturation of DT technology is expected to resolve vendor conformity issues. By addressing these challenges, our proposed DT storage solution has the potential to improve data accessibility and decision-making in emergency healthcare settings.","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135138839","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-08-18DOI: 10.1007/s44227-023-00010-z
Wenqian Shang, Xintao Liu, Miaoran Song
{"title":"On-Chain Video Copy Detection Based on Swin-Transformer and Deep Hashing","authors":"Wenqian Shang, Xintao Liu, Miaoran Song","doi":"10.1007/s44227-023-00010-z","DOIUrl":"https://doi.org/10.1007/s44227-023-00010-z","url":null,"abstract":"","PeriodicalId":42585,"journal":{"name":"International Journal of Networked and Distributed Computing","volume":"21 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85161600","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
扫码关注我们
求助内容：
应助结果提醒方式：