首页 > 最新文献

High-Confidence Computing最新文献

英文 中文
Device authentication for 5G terminals via Radio Frequency fingerprints 通过射频指纹对 5G 终端进行设备验证
IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-26 DOI: 10.1016/j.hcc.2024.100222
The development of wireless communication network technology has provided people with diversified and convenient services. However, with the expansion of network scale and the increase in the number of devices, malicious attacks on wireless communication are becoming increasingly prevalent, causing significant losses. Currently, wireless communication systems authenticate identities through certain data identifiers. However, this software-based data information can be forged or replicated. This article proposes the authentication of device identity using the hardware fingerprint of the terminal’s Radio Frequency (RF) components, which possesses properties of being genuine, unique, and stable, holding significant implications for wireless communication security. Through the collection and processing of raw data, extraction of various features including time-domain and frequency-domain features, and utilizing machine learning algorithms for training and constructing a legal fingerprint database, it is possible to achieve close to a 97% recognition accuracy for Fifth Generation (5G) terminals of the same model. This provides an additional and robust hardware-based security layer for 5G communication security, enhancing monitoring capability and reliability.
无线通信网络技术的发展为人们提供了多样化的便捷服务。然而,随着网络规模的扩大和设备数量的增加,针对无线通信的恶意攻击日益猖獗,造成了重大损失。目前,无线通信系统通过某些数据标识符来验证身份。然而,这种基于软件的数据信息可以被伪造或复制。本文提出利用终端射频(RF)组件的硬件指纹来验证设备身份,该指纹具有真实、唯一和稳定的特性,对无线通信安全具有重要意义。通过收集和处理原始数据,提取包括时域和频域特征在内的各种特征,并利用机器学习算法进行训练和构建合法指纹数据库,可以使相同型号的第五代(5G)终端达到接近 97% 的识别准确率。这为 5G 通信安全提供了一个额外的、基于硬件的稳健安全层,提高了监控能力和可靠性。
{"title":"Device authentication for 5G terminals via Radio Frequency fingerprints","authors":"","doi":"10.1016/j.hcc.2024.100222","DOIUrl":"10.1016/j.hcc.2024.100222","url":null,"abstract":"<div><div>The development of wireless communication network technology has provided people with diversified and convenient services. However, with the expansion of network scale and the increase in the number of devices, malicious attacks on wireless communication are becoming increasingly prevalent, causing significant losses. Currently, wireless communication systems authenticate identities through certain data identifiers. However, this software-based data information can be forged or replicated. This article proposes the authentication of device identity using the hardware fingerprint of the terminal’s Radio Frequency (RF) components, which possesses properties of being genuine, unique, and stable, holding significant implications for wireless communication security. Through the collection and processing of raw data, extraction of various features including time-domain and frequency-domain features, and utilizing machine learning algorithms for training and constructing a legal fingerprint database, it is possible to achieve close to a 97% recognition accuracy for Fifth Generation (5G) terminals of the same model. This provides an additional and robust hardware-based security layer for 5G communication security, enhancing monitoring capability and reliability.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":3.2,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140404945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph isomorphism—Characterization and efficient algorithms 图同构--特征和高效算法
IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-26 DOI: 10.1016/j.hcc.2024.100224
The Graph isomorphism problem involves determining whether two graphs are isomorphic and the computational complexity required for this determination. In general, the problem is not known to be solvable in polynomial time, nor to be NP-complete. In this paper, by analyzing the algebraic properties of the adjacency matrices of the undirected graph, we first established the connection between graph isomorphism and matrix row and column interchanging operations. Then, we prove that for undirected graphs, the complexity in determining whether two graphs are isomorphic is at most O(n3).
图同构问题涉及确定两个图是否同构以及确定所需的计算复杂度。一般来说,这个问题既不能在多项式时间内求解,也不是 NP-完全问题。本文通过分析无向图邻接矩阵的代数性质,首先建立了图同构与矩阵行列互换操作之间的联系。然后,我们证明了对于无向图,判断两个图是否同构的复杂度最多为 O(n3)。
{"title":"Graph isomorphism—Characterization and efficient algorithms","authors":"","doi":"10.1016/j.hcc.2024.100224","DOIUrl":"10.1016/j.hcc.2024.100224","url":null,"abstract":"<div><div>The Graph isomorphism problem involves determining whether two graphs are isomorphic and the computational complexity required for this determination. In general, the problem is not known to be solvable in polynomial time, nor to be NP-complete. In this paper, by analyzing the algebraic properties of the adjacency matrices of the undirected graph, we first established the connection between graph isomorphism and matrix row and column interchanging operations. Then, we prove that for undirected graphs, the complexity in determining whether two graphs are isomorphic is at most <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":3.2,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140402465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A comprehensive study on IoT privacy and security challenges with focus on spectrum sharing in Next-Generation networks (5G/6G/beyond) 以下一代网络(5G/6G/beyond)频谱共享为重点的物联网隐私和安全挑战综合研究
Pub Date : 2024-03-12 DOI: 10.1016/j.hcc.2024.100220
Lakshmi Priya Rachakonda , Madhuri Siddula , Vanlin Sathya

The emergence of the Internet of Things (IoT) has triggered a massive digital transformation across numerous sectors. This transformation requires efficient wireless communication and connectivity, which depend on the optimal utilization of the available spectrum resource. Given the limited availability of spectrum resources, spectrum sharing has emerged as a favored solution to empower IoT deployment and connectivity, so adequate planning of the spectrum resource utilization is thus essential to pave the way for the next generation of IoT applications, including 5G and beyond. This article presents a comprehensive study of prevalent wireless technologies employed in the field of the spectrum, with a primary focus on spectrum-sharing solutions, including shared spectrum. It highlights the associated security and privacy concerns when the IoT devices access the shared spectrum. This survey examines the benefits and drawbacks of various spectrum-sharing technologies and their solutions for various IoT applications. Lastly, it identifies future IoT obstacles and suggests potential research directions to address them.

物联网(IoT)的出现引发了众多领域的大规模数字化转型。这种转型需要高效的无线通信和连接,而这取决于对可用频谱资源的优化利用。鉴于可用频谱资源有限,频谱共享已成为增强物联网部署和连接能力的首选解决方案,因此必须对频谱资源利用进行充分规划,以便为下一代物联网应用(包括 5G 及其他)铺平道路。本文全面研究了频谱领域采用的主流无线技术,主要关注频谱共享解决方案,包括共享频谱。文章强调了物联网设备访问共享频谱时的相关安全和隐私问题。本调查研究了各种频谱共享技术及其解决方案在各种物联网应用中的优缺点。最后,它指出了未来物联网的障碍,并提出了解决这些问题的潜在研究方向。
{"title":"A comprehensive study on IoT privacy and security challenges with focus on spectrum sharing in Next-Generation networks (5G/6G/beyond)","authors":"Lakshmi Priya Rachakonda ,&nbsp;Madhuri Siddula ,&nbsp;Vanlin Sathya","doi":"10.1016/j.hcc.2024.100220","DOIUrl":"10.1016/j.hcc.2024.100220","url":null,"abstract":"<div><p>The emergence of the Internet of Things (IoT) has triggered a massive digital transformation across numerous sectors. This transformation requires efficient wireless communication and connectivity, which depend on the optimal utilization of the available spectrum resource. Given the limited availability of spectrum resources, spectrum sharing has emerged as a favored solution to empower IoT deployment and connectivity, so adequate planning of the spectrum resource utilization is thus essential to pave the way for the next generation of IoT applications, including 5G and beyond. This article presents a comprehensive study of prevalent wireless technologies employed in the field of the spectrum, with a primary focus on spectrum-sharing solutions, including shared spectrum. It highlights the associated security and privacy concerns when the IoT devices access the shared spectrum. This survey examines the benefits and drawbacks of various spectrum-sharing technologies and their solutions for various IoT applications. Lastly, it identifies future IoT obstacles and suggests potential research directions to address them.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000230/pdfft?md5=bdf9742a3a93b2c58a0a21f62393cc7c&pid=1-s2.0-S2667295224000230-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140276247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adversarial robustness analysis of LiDAR-included models in autonomous driving 自动驾驶中包含激光雷达模型的对抗鲁棒性分析
Pub Date : 2024-03-01 DOI: 10.1016/j.hcc.2024.100203
Bo Yang , Zizhi Jin , Yushi Cheng , Xiaoyu Ji , Wenyuan Xu

In autonomous driving systems, perception is pivotal, relying chiefly on sensors like LiDAR and cameras for environmental awareness. LiDAR, celebrated for its detailed depth perception, is being increasingly integrated into autonomous vehicles. In this article, we analyze the robustness of four LiDAR-included models against adversarial points under physical constraints. We first introduce an attack technique that, by simply adding a limited number of physically constrained adversarial points above a vehicle, can make the vehicle undetectable by the LiDAR-included models. Experiments reveal that adversarial points adversely affect the detection capabilities of both LiDAR-only and LiDAR–camera fusion models, with a tendency for more adversarial points to escalate attack success rates. Notably, voxel-based models are more susceptible to deception by these adversarial points. We also investigated the impact of the distance and angle of the added adversarial points on the attack success rate. Typically, the farther the victim object to be hidden and the closer to the front of the LiDAR, the higher the attack success rate. Additionally, we have experimentally proven that our generated adversarial points possess good cross-model adversarial transferability and validated the effectiveness of our proposed optimization method through ablation studies. Furthermore, we propose a new plug-and-play, model-agnostic defense method based on the concept of point smoothness. The ROC curve of this defense method shows an AUC value of approximately 0.909, demonstrating its effectiveness.

在自动驾驶系统中,感知至关重要,主要依靠激光雷达和摄像头等传感器来感知环境。激光雷达因其细致的深度感知而闻名,正被越来越多地集成到自动驾驶汽车中。在本文中,我们分析了四种包含激光雷达的模型在物理约束条件下对抗对抗点的鲁棒性。我们首先介绍了一种攻击技术,只需在车辆上方添加数量有限的物理约束对抗点,就能使包含激光雷达的模型无法探测到车辆。实验表明,对抗点会对纯激光雷达模型和激光雷达与相机融合模型的探测能力产生不利影响,对抗点越多,攻击成功率越高。值得注意的是,基于体素的模型更容易受到这些对抗点的欺骗。我们还研究了新增对抗点的距离和角度对攻击成功率的影响。通常情况下,要隐藏的受害对象越远,离激光雷达的前端越近,攻击成功率就越高。此外,我们还通过实验证明了我们生成的对抗点具有良好的跨模型对抗转移性,并通过烧蚀研究验证了我们提出的优化方法的有效性。此外,我们还提出了一种基于点平滑度概念的即插即用、模型无关的新防御方法。该防御方法的 ROC 曲线显示 AUC 值约为 0.909,证明了其有效性。
{"title":"Adversarial robustness analysis of LiDAR-included models in autonomous driving","authors":"Bo Yang ,&nbsp;Zizhi Jin ,&nbsp;Yushi Cheng ,&nbsp;Xiaoyu Ji ,&nbsp;Wenyuan Xu","doi":"10.1016/j.hcc.2024.100203","DOIUrl":"10.1016/j.hcc.2024.100203","url":null,"abstract":"<div><p>In autonomous driving systems, perception is pivotal, relying chiefly on sensors like LiDAR and cameras for environmental awareness. LiDAR, celebrated for its detailed depth perception, is being increasingly integrated into autonomous vehicles. In this article, we analyze the robustness of four LiDAR-included models against adversarial points under physical constraints. We first introduce an attack technique that, by simply adding a limited number of physically constrained adversarial points above a vehicle, can make the vehicle undetectable by the LiDAR-included models. Experiments reveal that adversarial points adversely affect the detection capabilities of both LiDAR-only and LiDAR–camera fusion models, with a tendency for more adversarial points to escalate attack success rates. Notably, voxel-based models are more susceptible to deception by these adversarial points. We also investigated the impact of the distance and angle of the added adversarial points on the attack success rate. Typically, the farther the victim object to be hidden and the closer to the front of the LiDAR, the higher the attack success rate. Additionally, we have experimentally proven that our generated adversarial points possess good cross-model adversarial transferability and validated the effectiveness of our proposed optimization method through ablation studies. Furthermore, we propose a new plug-and-play, model-agnostic defense method based on the concept of point smoothness. The ROC curve of this defense method shows an AUC value of approximately 0.909, demonstrating its effectiveness.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000060/pdfft?md5=7e68638f7a7e1d0186a514efa45060f4&pid=1-s2.0-S2667295224000060-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139539738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving human activity sensing: A survey 保护隐私的人类活动传感:调查
Pub Date : 2024-03-01 DOI: 10.1016/j.hcc.2024.100204
Yanni Yang , Pengfei Hu , Jiaxing Shen , Haiming Cheng , Zhenlin An , Xiulong Liu

With the prevalence of various sensors and smart devices in people’s daily lives, numerous types of information are being sensed. While using such information provides critical and convenient services, we are gradually exposing every piece of our behavior and activities. Researchers are aware of the privacy risks and have been working on preserving privacy while sensing human activities. This survey reviews existing studies on privacy-preserving human activity sensing. We first introduce the sensors and captured private information related to human activities. We then propose a taxonomy to structure the methods for preserving private information from two aspects: individual and collaborative activity sensing. For each of the two aspects, the methods are classified into three levels: signal, algorithm, and system. Finally, we discuss the open challenges and provide future directions.

随着各种传感器和智能设备在人们日常生活中的普及,无数类型的信息被感知。在利用这些信息提供关键和便捷服务的同时,我们的行为和活动也逐渐暴露无遗。研究人员意识到了隐私风险,并一直致力于在感知人类活动的同时保护隐私。本调查回顾了有关保护隐私的人类活动传感的现有研究。我们首先介绍与人类活动相关的传感器和捕获的隐私信息。然后,我们提出了一个分类法,从个体活动传感和协作活动传感两个方面来构建保护隐私信息的方法。针对这两个方面,我们将方法分为三个层次:信号、算法和系统。最后,我们讨论了面临的挑战,并提出了未来的发展方向。
{"title":"Privacy-preserving human activity sensing: A survey","authors":"Yanni Yang ,&nbsp;Pengfei Hu ,&nbsp;Jiaxing Shen ,&nbsp;Haiming Cheng ,&nbsp;Zhenlin An ,&nbsp;Xiulong Liu","doi":"10.1016/j.hcc.2024.100204","DOIUrl":"10.1016/j.hcc.2024.100204","url":null,"abstract":"<div><p>With the prevalence of various sensors and smart devices in people’s daily lives, numerous types of information are being sensed. While using such information provides critical and convenient services, we are gradually exposing every piece of our behavior and activities. Researchers are aware of the privacy risks and have been working on preserving privacy while sensing human activities. This survey reviews existing studies on privacy-preserving human activity sensing. We first introduce the sensors and captured private information related to human activities. We then propose a taxonomy to structure the methods for preserving private information from two aspects: individual and collaborative activity sensing. For each of the two aspects, the methods are classified into three levels: signal, algorithm, and system. Finally, we discuss the open challenges and provide future directions.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000072/pdfft?md5=11d4ed6df16203f7528f36440b10fd65&pid=1-s2.0-S2667295224000072-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139632503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Survey on Large Language Model (LLM) Security and Privacy: The Good, The Bad, and The Ugly 大型语言模型 (LLM) 安全与隐私调查:好、坏、丑
Pub Date : 2024-03-01 DOI: 10.1016/j.hcc.2024.100211
Yifan Yao, Jinhao Duan, Kaidi Xu, Yuanfang Cai, Zhibo Sun, Yue Zhang

Large Language Models (LLMs), such as ChatGPT and Bard, have revolutionized natural language understanding and generation. They possess deep language comprehension, human-like text generation capabilities, contextual awareness, and robust problem-solving skills, making them invaluable in various domains (e.g., search engines, customer support, translation). In the meantime, LLMs have also gained traction in the security community, revealing security vulnerabilities and showcasing their potential in security-related tasks. This paper explores the intersection of LLMs with security and privacy. Specifically, we investigate how LLMs positively impact security and privacy, potential risks and threats associated with their use, and inherent vulnerabilities within LLMs. Through a comprehensive literature review, the paper categorizes the papers into “The Good” (beneficial LLM applications), “The Bad” (offensive applications), and “The Ugly” (vulnerabilities of LLMs and their defenses). We have some interesting findings. For example, LLMs have proven to enhance code security (code vulnerability detection) and data privacy (data confidentiality protection), outperforming traditional methods. However, they can also be harnessed for various attacks (particularly user-level attacks) due to their human-like reasoning abilities. We have identified areas that require further research efforts. For example, Research on model and parameter extraction attacks is limited and often theoretical, hindered by LLM parameter scale and confidentiality. Safe instruction tuning, a recent development, requires more exploration. We hope that our work can shed light on the LLMs’ potential to both bolster and jeopardize cybersecurity.

大型语言模型(LLMs),如 ChatGPT 和 Bard,已经彻底改变了自然语言的理解和生成。它们具有深度语言理解能力、类人文本生成能力、上下文感知能力和强大的问题解决能力,这使它们在各个领域(如搜索引擎、客户支持、翻译)都具有无价之宝。与此同时,LLM 在安全领域也获得了广泛关注,揭示了安全漏洞,并展示了其在安全相关任务中的潜力。本文探讨了 LLM 与安全和隐私的交叉点。具体来说,我们将研究 LLM 如何对安全和隐私产生积极影响、与使用 LLM 相关的潜在风险和威胁,以及 LLM 固有的漏洞。通过全面的文献综述,本文将论文分为 "好"(有益的 LLM 应用)、"坏"(攻击性应用)和 "丑"(LLM 的漏洞及其防御)三类。我们有一些有趣的发现。例如,事实证明 LLM 可增强代码安全性(代码漏洞检测)和数据私密性(数据保密保护),优于传统方法。不过,由于 LLM 具备类似人类的推理能力,它们也可以被用于各种攻击(尤其是用户级攻击)。我们已经确定了需要进一步研究的领域。例如,对模型和参数提取攻击的研究十分有限,而且往往是理论性的,受到 LLM 参数规模和保密性的阻碍。安全指令调整是最近的一项发展,需要更多的探索。我们希望我们的工作能够揭示 LLM 在促进和危害网络安全方面的潜力。
{"title":"A Survey on Large Language Model (LLM) Security and Privacy: The Good, The Bad, and The Ugly","authors":"Yifan Yao,&nbsp;Jinhao Duan,&nbsp;Kaidi Xu,&nbsp;Yuanfang Cai,&nbsp;Zhibo Sun,&nbsp;Yue Zhang","doi":"10.1016/j.hcc.2024.100211","DOIUrl":"https://doi.org/10.1016/j.hcc.2024.100211","url":null,"abstract":"<div><p>Large Language Models (LLMs), such as ChatGPT and Bard, have revolutionized natural language understanding and generation. They possess deep language comprehension, human-like text generation capabilities, contextual awareness, and robust problem-solving skills, making them invaluable in various domains (e.g., search engines, customer support, translation). In the meantime, LLMs have also gained traction in the security community, revealing security vulnerabilities and showcasing their potential in security-related tasks. This paper explores the intersection of LLMs with security and privacy. Specifically, we investigate how LLMs positively impact security and privacy, potential risks and threats associated with their use, and inherent vulnerabilities within LLMs. Through a comprehensive literature review, the paper categorizes the papers into “The Good” (beneficial LLM applications), “The Bad” (offensive applications), and “The Ugly” (vulnerabilities of LLMs and their defenses). We have some interesting findings. For example, LLMs have proven to enhance code security (code vulnerability detection) and data privacy (data confidentiality protection), outperforming traditional methods. However, they can also be harnessed for various attacks (particularly user-level attacks) due to their human-like reasoning abilities. We have identified areas that require further research efforts. For example, Research on model and parameter extraction attacks is limited and often theoretical, hindered by LLM parameter scale and confidentiality. Safe instruction tuning, a recent development, requires more exploration. We hope that our work can shed light on the LLMs’ potential to both bolster and jeopardize cybersecurity.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S266729522400014X/pdfft?md5=1984f6886539e5ada13eeb8c49a9ef8b&pid=1-s2.0-S266729522400014X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140543306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cooperative multi-agent game based on reinforcement learning 基于强化学习的多代理合作游戏
Pub Date : 2024-03-01 DOI: 10.1016/j.hcc.2024.100205
Hongbo Liu

Multi-agent reinforcement learning holds tremendous potential for revolutionizing intelligent systems across diverse domains. However, it is also concomitant with a set of formidable challenges, which include the effective allocation of credit values to each agent, real-time collaboration among heterogeneous agents, and an appropriate reward function to guide agent behavior. To handle these issues, we propose an innovative solution named the Graph Attention Counterfactual Multiagent Actor–Critic algorithm (GACMAC). This algorithm encompasses several key components: First, it employs a multi-agent actor–critic framework along with counterfactual baselines to assess the individual actions of each agent. Second, it integrates a graph attention network to enhance real-time collaboration among agents, enabling heterogeneous agents to effectively share information during handling tasks. Third, it incorporates prior human knowledge through a potential-based reward shaping method, thereby elevating the convergence speed and stability of the algorithm. We tested our algorithm on the StarCraft Multi-Agent Challenge (SMAC) platform, which is a recognized platform for testing multi-agent algorithms, and our algorithm achieved a win rate of over 95% on the platform, comparable to the current state-of-the-art multi-agent controllers.

多代理强化学习(Multi-agent reinforcement learning)在革新不同领域的智能系统方面具有巨大潜力。然而,它也伴随着一系列艰巨的挑战,其中包括为每个代理有效分配信用值、异构代理之间的实时协作以及指导代理行为的适当奖励函数。为了解决这些问题,我们提出了一种创新的解决方案,即图形注意反事实多代理代理批评算法(GACMAC)。该算法包含几个关键部分:首先,它采用多代理代理批评框架和反事实基线来评估每个代理的单独行动。其次,它整合了图注意网络,以加强代理之间的实时协作,使异构代理在处理任务时有效地共享信息。第三,它通过基于潜能的奖励塑造方法纳入了人类的先验知识,从而提高了算法的收敛速度和稳定性。我们在星际争霸多代理挑战赛(SMAC)平台上测试了我们的算法,该平台是公认的多代理算法测试平台,我们的算法在该平台上的胜率超过 95%,与目前最先进的多代理控制器相当。
{"title":"Cooperative multi-agent game based on reinforcement learning","authors":"Hongbo Liu","doi":"10.1016/j.hcc.2024.100205","DOIUrl":"10.1016/j.hcc.2024.100205","url":null,"abstract":"<div><p>Multi-agent reinforcement learning holds tremendous potential for revolutionizing intelligent systems across diverse domains. However, it is also concomitant with a set of formidable challenges, which include the effective allocation of credit values to each agent, real-time collaboration among heterogeneous agents, and an appropriate reward function to guide agent behavior. To handle these issues, we propose an innovative solution named the Graph Attention Counterfactual Multiagent Actor–Critic algorithm (GACMAC). This algorithm encompasses several key components: First, it employs a multi-agent actor–critic framework along with counterfactual baselines to assess the individual actions of each agent. Second, it integrates a graph attention network to enhance real-time collaboration among agents, enabling heterogeneous agents to effectively share information during handling tasks. Third, it incorporates prior human knowledge through a potential-based reward shaping method, thereby elevating the convergence speed and stability of the algorithm. We tested our algorithm on the StarCraft Multi-Agent Challenge (SMAC) platform, which is a recognized platform for testing multi-agent algorithms, and our algorithm achieved a win rate of over 95% on the platform, comparable to the current state-of-the-art multi-agent controllers.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000084/pdfft?md5=0bf06b4b71bd2935634b00877ef59fba&pid=1-s2.0-S2667295224000084-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139539639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A survey for light field super-resolution 光场超分辨率调查
Pub Date : 2024-03-01 DOI: 10.1016/j.hcc.2024.100206
Mingyuan Zhao , Hao Sheng , Da Yang , Sizhe Wang , Ruixuan Cong , Zhenglong Cui , Rongshan Chen , Tun Wang , Shuai Wang , Yang Huang , Jiahao Shen

Compared to 2D imaging data, the 4D light field (LF) data retains richer scene’s structure information, which can significantly improve the computer’s perception capability, including depth estimation, semantic segmentation, and LF rendering. However, there is a contradiction between spatial and angular resolution during the LF image acquisition period. To overcome the above problem, researchers have gradually focused on the light field super-resolution (LFSR). In the traditional solutions, researchers achieved the LFSR based on various optimization frameworks, such as Bayesian and Gaussian models. Deep learning-based methods are more popular than conventional methods because they have better performance and more robust generalization capabilities. In this paper, the present approach can mainly divided into conventional methods and deep learning-based methods. We discuss these two branches in light field spatial super-resolution (LFSSR), light field angular super-resolution (LFASR), and light field spatial and angular super-resolution (LFSASR), respectively. Subsequently, this paper also introduces the primary public datasets and analyzes the performance of the prevalent approaches on these datasets. Finally, we discuss the potential innovations of the LFSR to propose the progress of our research field.

与二维成像数据相比,四维光场(LF)数据保留了更丰富的场景结构信息,可显著提高计算机的感知能力,包括深度估计、语义分割和 LF 渲染。然而,在 LF 图像采集期间,空间分辨率和角度分辨率之间存在矛盾。为了克服上述问题,研究人员逐渐将目光投向了光场超分辨率(LFSR)。在传统解决方案中,研究人员基于贝叶斯模型和高斯模型等各种优化框架实现了 LFSR。与传统方法相比,基于深度学习的方法具有更好的性能和更强大的泛化能力,因此更受欢迎。在本文中,目前的方法主要分为传统方法和基于深度学习的方法。我们分别在光场空间超分辨率(LFSSR)、光场角度超分辨率(LFASR)和光场空间与角度超分辨率(LFSASR)中讨论这两个分支。随后,本文还介绍了主要的公共数据集,并分析了这些数据集上常用方法的性能。最后,我们讨论了 LFSR 的潜在创新,以提出我们研究领域的进展。
{"title":"A survey for light field super-resolution","authors":"Mingyuan Zhao ,&nbsp;Hao Sheng ,&nbsp;Da Yang ,&nbsp;Sizhe Wang ,&nbsp;Ruixuan Cong ,&nbsp;Zhenglong Cui ,&nbsp;Rongshan Chen ,&nbsp;Tun Wang ,&nbsp;Shuai Wang ,&nbsp;Yang Huang ,&nbsp;Jiahao Shen","doi":"10.1016/j.hcc.2024.100206","DOIUrl":"10.1016/j.hcc.2024.100206","url":null,"abstract":"<div><p>Compared to 2D imaging data, the 4D light field (LF) data retains richer scene’s structure information, which can significantly improve the computer’s perception capability, including depth estimation, semantic segmentation, and LF rendering. However, there is a contradiction between spatial and angular resolution during the LF image acquisition period. To overcome the above problem, researchers have gradually focused on the light field super-resolution (LFSR). In the traditional solutions, researchers achieved the LFSR based on various optimization frameworks, such as Bayesian and Gaussian models. Deep learning-based methods are more popular than conventional methods because they have better performance and more robust generalization capabilities. In this paper, the present approach can mainly divided into conventional methods and deep learning-based methods. We discuss these two branches in light field spatial super-resolution (LFSSR), light field angular super-resolution (LFASR), and light field spatial and angular super-resolution (LFSASR), respectively. Subsequently, this paper also introduces the primary public datasets and analyzes the performance of the prevalent approaches on these datasets. Finally, we discuss the potential innovations of the LFSR to propose the progress of our research field.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000096/pdfft?md5=71deba58809585186ae13284da5a82d9&pid=1-s2.0-S2667295224000096-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139631869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data cube-based storage optimization for resource-constrained edge computing 基于数据立方体的存储优化,适用于资源受限的边缘计算
IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-02-28 DOI: 10.1016/j.hcc.2024.100212
In the evolving landscape of the digital era, edge computing emerges as an essential paradigm, especially critical for low-latency, real-time applications and Internet of Things (IoT) environments. Despite its advantages, edge computing faces severe limitations in storage capabilities and is fraught with reliability issues due to its resource-constrained nature and exposure to challenging conditions. To address these challenges, this work presents a tailored storage mechanism for edge computing, focusing on space efficiency and data reliability. Our method comprises three key steps: relation factorization, column clustering, and erasure encoding with compression. We successfully reduce the required storage space by deconstructing complex database tables and optimizing data organization within these sub-tables. We further add a layer of reliability through erasure encoding. Comprehensive experiments on TPC-H datasets substantiate our approach, demonstrating storage savings of up to 38.35% and time efficiency improvements by 3.96x in certain cases. Furthermore, our clustering technique shows a potential for additional storage reduction up to 40.41%.
在不断发展的数字时代,边缘计算成为一种重要的模式,对于低延迟、实时应用和物联网(IoT)环境尤为重要。尽管边缘计算具有诸多优势,但由于其资源受限的特性和暴露在挑战性条件下,边缘计算在存储能力方面面临着严重的限制,并且充满了可靠性问题。为了应对这些挑战,本研究提出了一种为边缘计算量身定制的存储机制,重点关注空间效率和数据可靠性。我们的方法包括三个关键步骤:关系因式分解、列聚类和压缩擦除编码。我们通过分解复杂的数据库表并优化这些子表内的数据组织,成功地减少了所需的存储空间。我们还通过擦除编码进一步增加了可靠性。在 TPC-H 数据集上进行的综合实验证实了我们的方法,在某些情况下,存储空间节省高达 38.35%,时间效率提高了 3.96 倍。此外,我们的聚类技术还显示出额外减少 40.41% 存储空间的潜力。
{"title":"Data cube-based storage optimization for resource-constrained edge computing","authors":"","doi":"10.1016/j.hcc.2024.100212","DOIUrl":"10.1016/j.hcc.2024.100212","url":null,"abstract":"<div><div>In the evolving landscape of the digital era, edge computing emerges as an essential paradigm, especially critical for low-latency, real-time applications and Internet of Things (IoT) environments. Despite its advantages, edge computing faces severe limitations in storage capabilities and is fraught with reliability issues due to its resource-constrained nature and exposure to challenging conditions. To address these challenges, this work presents a tailored storage mechanism for edge computing, focusing on space efficiency and data reliability. Our method comprises three key steps: relation factorization, column clustering, and erasure encoding with compression. We successfully reduce the required storage space by deconstructing complex database tables and optimizing data organization within these sub-tables. We further add a layer of reliability through erasure encoding. Comprehensive experiments on TPC-H datasets substantiate our approach, demonstrating storage savings of up to 38.35% and time efficiency improvements by 3.96x in certain cases. Furthermore, our clustering technique shows a potential for additional storage reduction up to 40.41%.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":3.2,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140464490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An investigation of the private-attribute leakage in WiFi sensing 对 WiFi 传感中私人属性泄露的调查
IF 3.2 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-02-03 DOI: 10.1016/j.hcc.2024.100209
WiFi sensing is critical to many applications, such as localization, human activity recognition, and contact-less health monitoring. With metaverse and ubiquitous sensing advances, WiFi sensing becomes increasingly imperative. However, as shown in this paper, WiFi sensing data leaks users’ private attributes (e.g., height, weight, and gender), violating increasingly stricter privacy protection laws and regulations. To demonstrate the leakage of private attributes in WiFi sensing, we investigate two public WiFi sensing datasets and apply a deep learning model to recognize users’ private attributes. Our experimental results clearly show that our model can identify users’ private attributes in WiFi sensing data collected by general WiFi applications, with almost 100% accuracy for gender inference, less than 4 cm error for height inference, and about 4 kg error for weight inference, respectively. Our finding calls for research efforts to preserve data privacy while enabling WiFi sensing-based applications.
WiFi 传感对许多应用都至关重要,例如定位、人类活动识别和非接触式健康监测。随着元数据和无处不在的传感技术的发展,WiFi 传感变得越来越必要。然而,正如本文所示,WiFi 感知数据会泄露用户的私人属性(如身高、体重和性别),从而违反日益严格的隐私保护法律法规。为了证明 WiFi 感知中私人属性的泄露,我们研究了两个公共 WiFi 感知数据集,并应用深度学习模型来识别用户的私人属性。实验结果清楚地表明,我们的模型可以识别一般 WiFi 应用收集的 WiFi 感知数据中的用户隐私属性,性别推断的准确率几乎达到 100%,身高推断的误差小于 4 厘米,体重推断的误差约为 4 千克。我们的研究结果要求在实现基于 WiFi 感知的应用的同时,努力保护数据隐私。
{"title":"An investigation of the private-attribute leakage in WiFi sensing","authors":"","doi":"10.1016/j.hcc.2024.100209","DOIUrl":"10.1016/j.hcc.2024.100209","url":null,"abstract":"<div><div>WiFi sensing is critical to many applications, such as localization, human activity recognition, and contact-less health monitoring. With metaverse and ubiquitous sensing advances, WiFi sensing becomes increasingly imperative. However, as shown in this paper, WiFi sensing data leaks users’ private attributes (e.g., height, weight, and gender), violating increasingly stricter privacy protection laws and regulations. To demonstrate the leakage of private attributes in WiFi sensing, we investigate two public WiFi sensing datasets and apply a deep learning model to recognize users’ private attributes. Our experimental results clearly show that our model can identify users’ private attributes in WiFi sensing data collected by general WiFi applications, with almost 100% accuracy for gender inference, less than 4 cm error for height inference, and about 4 kg error for weight inference, respectively. Our finding calls for research efforts to preserve data privacy while enabling WiFi sensing-based applications.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":null,"pages":null},"PeriodicalIF":3.2,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139817746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
High-Confidence Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1