首页 > 最新文献

Journal of Information and Intelligence最新文献

英文 中文
Cooperative target allocation for heterogeneous agent models using a matrix-encoding genetic algorithm 利用矩阵编码遗传算法实现异构代理模型的合作目标分配
Pub Date : 2024-07-15 DOI: 10.1016/j.jiixd.2024.07.002
Shan Gao , Lei Zuo , Xiaofei Lu , Bo Tang
Heterogeneous platforms collaborate to execute tasks through different operational models, resulting in the task allocation problem that incorporates different agent models. In this paper, we address the problem of cooperative target allocation for heterogeneous agent models, where we design the task-agent matching model and the multi-agent routing model. Since the heterogeneity and cooperativity of agent models lead to a coupled allocation problem, we propose a matrix-encoding genetic algorithm (MEGA) to plan reliable allocation schemes. Specifically, an integer matrix encoding is resorted to represent the priority between targets and agents in MEGA and a ranking rule is designed to decode the priority matrix. Based on the proposed encoding-decoding framework, we use the discrete and continuous optimization operators to update the target-agent match pairs and task execution orders. In addition, to adaptively balance the diversity and intensification of the population, a dynamical supplement strategy based on Hamming distance is proposed. This strategy adds individuals with different diversity and fitness at different stages of the optimization process. Finally, simulation experiments show that MEGA algorithm outperforms the conventional target allocation algorithms in the heterogeneous agent scenario.
异构平台通过不同的操作模型协作执行任务,导致了包含不同代理模型的任务分配问题。本文针对异构智能体模型的协同目标分配问题,设计了任务-智能体匹配模型和多智能体路由模型。针对智能体模型的异质性和协同性导致的耦合分配问题,提出了一种矩阵编码遗传算法(MEGA)来规划可靠的分配方案。具体而言,采用整数矩阵编码表示MEGA中目标与智能体之间的优先级,并设计排序规则对优先级矩阵进行解码。基于所提出的编解码框架,我们使用离散和连续优化算子来更新目标-代理匹配对和任务执行顺序。此外,为了自适应平衡种群的多样性和集约化,提出了一种基于汉明距离的动态补充策略。该策略在优化过程的不同阶段加入不同多样性和适应度的个体。最后,仿真实验表明,在异构agent场景下,MEGA算法优于传统的目标分配算法。
{"title":"Cooperative target allocation for heterogeneous agent models using a matrix-encoding genetic algorithm","authors":"Shan Gao ,&nbsp;Lei Zuo ,&nbsp;Xiaofei Lu ,&nbsp;Bo Tang","doi":"10.1016/j.jiixd.2024.07.002","DOIUrl":"10.1016/j.jiixd.2024.07.002","url":null,"abstract":"<div><div>Heterogeneous platforms collaborate to execute tasks through different operational models, resulting in the task allocation problem that incorporates different agent models. In this paper, we address the problem of cooperative target allocation for heterogeneous agent models, where we design the task-agent matching model and the multi-agent routing model. Since the heterogeneity and cooperativity of agent models lead to a coupled allocation problem, we propose a matrix-encoding genetic algorithm (MEGA) to plan reliable allocation schemes. Specifically, an integer matrix encoding is resorted to represent the priority between targets and agents in MEGA and a ranking rule is designed to decode the priority matrix. Based on the proposed encoding-decoding framework, we use the discrete and continuous optimization operators to update the target-agent match pairs and task execution orders. In addition, to adaptively balance the diversity and intensification of the population, a dynamical supplement strategy based on Hamming distance is proposed. This strategy adds individuals with different diversity and fitness at different stages of the optimization process. Finally, simulation experiments show that MEGA algorithm outperforms the conventional target allocation algorithms in the heterogeneous agent scenario.</div></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"3 2","pages":"Pages 154-172"},"PeriodicalIF":0.0,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141698757","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 polarisation coding scheme based on an integrated sensing and communication system 基于综合传感与通信系统的极化编码方案
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.02.008
Yao Zeng, Luping Xiang, Kun Yang

Integrated sensing and communication (ISAC) technology enhances the spectrum utilization of the system by interchanging the spectrum between communication and sensing, which has gained popularity in scenarios such as vehicle-to-everything (V2X). With the aim of providing more dependable services for vehicles in high-speed mobile scenarios, we propose a scheme based on sense-assisted polarisation coding. Specifically, the base station acquires the vehicle's positional information and channel strength parameters through the forward time slot echo information. This information informs the creation of the coding architecture for the following time slot. This approach not only optimizes resource consumption but also enhances system dependability. Our simulation results confirm that the introduced scheme displays a notable improvement in the bit error rate (BER) when compared to traditional communication frameworks, maintaining this advantage across both unimpeded and compromised channel conditions.

综合传感与通信(ISAC)技术通过在通信和传感之间交换频谱来提高系统的频谱利用率,在车对物(V2X)等场景中得到了广泛应用。为了在高速移动场景中为车辆提供更可靠的服务,我们提出了一种基于感知辅助极化编码的方案。具体来说,基站通过前向时隙回波信息获取车辆的位置信息和信道强度参数。这些信息可为下一时隙的编码架构提供参考。这种方法不仅能优化资源消耗,还能提高系统的可靠性。我们的仿真结果证实,与传统的通信框架相比,引入的方案在误码率(BER)方面有明显的改进,而且在无障碍和受干扰的信道条件下都能保持这一优势。
{"title":"A polarisation coding scheme based on an integrated sensing and communication system","authors":"Yao Zeng,&nbsp;Luping Xiang,&nbsp;Kun Yang","doi":"10.1016/j.jiixd.2024.02.008","DOIUrl":"https://doi.org/10.1016/j.jiixd.2024.02.008","url":null,"abstract":"<div><p>Integrated sensing and communication (ISAC) technology enhances the spectrum utilization of the system by interchanging the spectrum between communication and sensing, which has gained popularity in scenarios such as vehicle-to-everything (V2X). With the aim of providing more dependable services for vehicles in high-speed mobile scenarios, we propose a scheme based on sense-assisted polarisation coding. Specifically, the base station acquires the vehicle's positional information and channel strength parameters through the forward time slot echo information. This information informs the creation of the coding architecture for the following time slot. This approach not only optimizes resource consumption but also enhances system dependability. Our simulation results confirm that the introduced scheme displays a notable improvement in the bit error rate (BER) when compared to traditional communication frameworks, maintaining this advantage across both unimpeded and compromised channel conditions.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 289-301"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000131/pdfft?md5=536a83f349ccc8ad1a305fb97ca19139&pid=1-s2.0-S2949715924000131-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141582575","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
Integration of communications, sensing and computing 通信、传感和计算一体化
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.05.004
Zhi-Quan Luo, Hongwei Liu, Zhi Tian, Nan Zhao
{"title":"Integration of communications, sensing and computing","authors":"Zhi-Quan Luo,&nbsp;Hongwei Liu,&nbsp;Zhi Tian,&nbsp;Nan Zhao","doi":"10.1016/j.jiixd.2024.05.004","DOIUrl":"https://doi.org/10.1016/j.jiixd.2024.05.004","url":null,"abstract":"","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 287-288"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000398/pdfft?md5=776426c73a955932ce337a2dd3a51d5e&pid=1-s2.0-S2949715924000398-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141582577","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 sensing, communication and computation resource allocation in mobile edge computing-enabled vehicular networks 支持边缘计算的移动车载网络中的合作传感、通信和计算资源分配
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.02.006
Zhenyu Li , Yuchuan Fu , Mengqiu Tian , Changle Li

The combination of integrated sensing and communication (ISAC) with mobile edge computing (MEC) enhances the overall safety and efficiency for vehicle to everything (V2X) system. However, existing works have not considered the potential impacts on base station (BS) sensing performance when users offload their computational tasks via uplink. This could leave insufficient resources allocated to the sensing tasks, resulting in low sensing performance. To address this issue, we propose a cooperative power, bandwidth and computation resource allocation (RA) scheme in this paper, maximizing the overall utility of Cramér-Rao bound (CRB) for sensing accuracy, computation latency for processing sensing information, and communication and computation latency for computational tasks. To solve the RA problem, a twin delayed deep deterministic policy gradient (TD3) algorithm is adopted to explore and obtain the effective solution of the RA problem. Furthermore, we investigate the performance tradeoff between sensing accuracy and summation of communication latency and computation latency for computational tasks, as well as the relationship between computation latency for processing sensing information and that of computational tasks by numerical simulations. Simulation demonstrates that compared to other benchmark methods, TD3 achieves an average utility improvement of 97.11% and 27.90% in terms of the maximum summation of communication latency and computation latency for computational tasks and improves 3.60 and 1.04 times regarding the maximum computation latency for processing sensing information.

综合传感与通信(ISAC)与移动边缘计算(MEC)的结合提高了车对万物(V2X)系统的整体安全性和效率。然而,现有研究并未考虑用户通过上行链路卸载计算任务时对基站(BS)传感性能的潜在影响。这可能导致分配给传感任务的资源不足,从而降低传感性能。为解决这一问题,我们在本文中提出了一种协同功率、带宽和计算资源分配(RA)方案,最大限度地提高感知精度的克拉梅尔-拉奥约束(CRB)、处理感知信息的计算延迟以及计算任务的通信和计算延迟的整体效用。为解决 RA 问题,我们采用了孪生延迟深度确定性策略梯度(TD3)算法,探索并获得了 RA 问题的有效解决方案。此外,我们还通过数值模拟研究了传感精度与通信延迟和计算任务计算延迟之间的性能权衡,以及处理传感信息的计算延迟与计算任务计算延迟之间的关系。仿真表明,与其他基准方法相比,TD3 在计算任务的最大通信延迟和计算延迟总和方面的平均效用分别提高了 97.11% 和 27.90%,在处理传感信息的最大计算延迟方面分别提高了 3.60 倍和 1.04 倍。
{"title":"Cooperative sensing, communication and computation resource allocation in mobile edge computing-enabled vehicular networks","authors":"Zhenyu Li ,&nbsp;Yuchuan Fu ,&nbsp;Mengqiu Tian ,&nbsp;Changle Li","doi":"10.1016/j.jiixd.2024.02.006","DOIUrl":"https://doi.org/10.1016/j.jiixd.2024.02.006","url":null,"abstract":"<div><p>The combination of integrated sensing and communication (ISAC) with mobile edge computing (MEC) enhances the overall safety and efficiency for vehicle to everything (V2X) system. However, existing works have not considered the potential impacts on base station (BS) sensing performance when users offload their computational tasks via uplink. This could leave insufficient resources allocated to the sensing tasks, resulting in low sensing performance. To address this issue, we propose a cooperative power, bandwidth and computation resource allocation (RA) scheme in this paper, maximizing the overall utility of Cramér-Rao bound (CRB) for sensing accuracy, computation latency for processing sensing information, and communication and computation latency for computational tasks. To solve the RA problem, a twin delayed deep deterministic policy gradient (TD3) algorithm is adopted to explore and obtain the effective solution of the RA problem. Furthermore, we investigate the performance tradeoff between sensing accuracy and summation of communication latency and computation latency for computational tasks, as well as the relationship between computation latency for processing sensing information and that of computational tasks by numerical simulations. Simulation demonstrates that compared to other benchmark methods, TD3 achieves an average utility improvement of 97.11% and 27.90% in terms of the maximum summation of communication latency and computation latency for computational tasks and improves 3.60 and 1.04 times regarding the maximum computation latency for processing sensing information.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 339-354"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000118/pdfft?md5=7da67833638c1d345742ffcf41afbff6&pid=1-s2.0-S2949715924000118-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141582578","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
Cluster-based RSU deployment strategy for vehicular ad hoc networks with integration of communication, sensing and computing 集群式 RSU 部署策略,用于集成通信、传感和计算功能的车载 Ad Hoc 网络
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.02.002
Xinrui Gu, Shengfeng Wang, Zhiqing Wei, Zhiyong Feng

The integration of communications, sensing and computing (I-CSC) has significant applications in vehicular ad hoc networks (VANETs). A roadside unit (RSU) plays an important role in I-CSC by performing functions such as information transmission and edge computing in vehicular communication. Due to the constraints of limited resources, RSU cannot achieve full coverage and deploying RSUs at key cluster heads of hierarchical structures of road networks is an effective management method. However, direct extracting the hierarchical structures for the resource allocation in VANETs is an open issue. In this paper, we proposed a network-based renormalization method based on information flow and geographical location to hierarchically deploy the RSU on the road networks. The renormalization method is compared with two deployment schemes: genetic algorithm (GA) and memetic framework-based optimal RSU deployment (MFRD), to verify the improvement of communication performance. Our results show that the renormalization method is superior to other schemes in terms of RSU coverage and information reception rate.

通信、传感和计算一体化(I-CSC)在车载特设网络(VANET)中有着重要的应用。路边单元(RSU)在 I-CSC 中发挥着重要作用,它在车辆通信中承担着信息传输和边缘计算等功能。由于资源有限,RSU 无法实现全覆盖,在路网分层结构的关键簇头部署 RSU 是一种有效的管理方法。然而,在 VANET 中直接提取分层结构进行资源分配是一个尚未解决的问题。在本文中,我们提出了一种基于信息流和地理位置的网络重归一化方法,在路网中分层部署 RSU。我们将重归一化方法与两种部署方案:遗传算法(GA)和基于记忆框架的 RSU 优化部署(MFRD)进行了比较,以验证通信性能的提高。结果表明,就 RSU 覆盖范围和信息接收率而言,重归一化方法优于其他方案。
{"title":"Cluster-based RSU deployment strategy for vehicular ad hoc networks with integration of communication, sensing and computing","authors":"Xinrui Gu,&nbsp;Shengfeng Wang,&nbsp;Zhiqing Wei,&nbsp;Zhiyong Feng","doi":"10.1016/j.jiixd.2024.02.002","DOIUrl":"10.1016/j.jiixd.2024.02.002","url":null,"abstract":"<div><p>The integration of communications, sensing and computing (I-CSC) has significant applications in vehicular ad hoc networks (VANETs). A roadside unit (RSU) plays an important role in I-CSC by performing functions such as information transmission and edge computing in vehicular communication. Due to the constraints of limited resources, RSU cannot achieve full coverage and deploying RSUs at key cluster heads of hierarchical structures of road networks is an effective management method. However, direct extracting the hierarchical structures for the resource allocation in VANETs is an open issue. In this paper, we proposed a network-based renormalization method based on information flow and geographical location to hierarchically deploy the RSU on the road networks. The renormalization method is compared with two deployment schemes: genetic algorithm (GA) and memetic framework-based optimal RSU deployment (MFRD), to verify the improvement of communication performance. Our results show that the renormalization method is superior to other schemes in terms of RSU coverage and information reception rate.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 325-338"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000076/pdfft?md5=a20a6663048dfba2bb125f3763e3db1b&pid=1-s2.0-S2949715924000076-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140467533","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 statistical sensing method by utilizing Wi-Fi CSI subcarriers: Empirical study and performance enhancement 利用 Wi-Fi CSI 子载波的统计传感方法:实证研究与性能提升
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.05.002
Tao Deng , Bowen Zheng , Rui Du , Fan Liu , Tony Xiao Han

In modern Wi-Fi systems, channel state information (CSI) serves as a foundational support for various sensing applications. Currently, existing CSI-based techniques exhibit limitations in terms of environmental adaptability. As such, optimizing the utilization of subcarrier CSI stands as a critical avenue for enhancing sensing performance. Within the OFDM communication framework, this work derives sensing outcomes for both detection and estimation by harnessing the CSI from every individual measured subcarrier, subsequently consolidating these outcomes. When contrasted against results derived from CSI based on specific extraction protocols or those obtained through weighted summation, the methodology introduced in this study offers substantial improvements in CSI-based detection and estimation performance. This approach not only underscores the significance but also serves as a robust exemplar for the comprehensive application of CSI.

在现代 Wi-Fi 系统中,信道状态信息(CSI)是各种传感应用的基础支持。目前,基于 CSI 的现有技术在环境适应性方面表现出局限性。因此,优化子载波 CSI 的利用是提高传感性能的关键途径。在 OFDM 通信框架内,这项工作通过利用每个单独测量的子载波的 CSI 来获得检测和估算的传感结果,然后将这些结果进行整合。与基于特定提取协议或通过加权求和获得的 CSI 结果相比,本研究中引入的方法大大提高了基于 CSI 的检测和估计性能。这种方法不仅凸显了 CSI 的重要意义,也为 CSI 的全面应用提供了一个强有力的范例。
{"title":"A statistical sensing method by utilizing Wi-Fi CSI subcarriers: Empirical study and performance enhancement","authors":"Tao Deng ,&nbsp;Bowen Zheng ,&nbsp;Rui Du ,&nbsp;Fan Liu ,&nbsp;Tony Xiao Han","doi":"10.1016/j.jiixd.2024.05.002","DOIUrl":"10.1016/j.jiixd.2024.05.002","url":null,"abstract":"<div><p>In modern Wi-Fi systems, channel state information (CSI) serves as a foundational support for various sensing applications. Currently, existing CSI-based techniques exhibit limitations in terms of environmental adaptability. As such, optimizing the utilization of subcarrier CSI stands as a critical avenue for enhancing sensing performance. Within the OFDM communication framework, this work derives sensing outcomes for both detection and estimation by harnessing the CSI from every individual measured subcarrier, subsequently consolidating these outcomes. When contrasted against results derived from CSI based on specific extraction protocols or those obtained through weighted summation, the methodology introduced in this study offers substantial improvements in CSI-based detection and estimation performance. This approach not only underscores the significance but also serves as a robust exemplar for the comprehensive application of CSI.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 365-374"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000374/pdfft?md5=90504ae06b478f8e48c78218ff4dd240&pid=1-s2.0-S2949715924000374-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141132936","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
Deep learning-based fall detection using commodity Wi-Fi 利用商品 Wi-Fi 进行基于深度学习的跌倒检测
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.04.001
Tingwei Chen , Xiaoyang Li , Hang Li , Guangxu Zhu

As the phenomenon of an aging population gradually becomes common worldwide, the pressure on the elderly has seen a notable increase. To address this challenge, fall detection systems are important in ensuring the safety of the elderly population, particularly those living alone. Wi-Fi sensing, as a privacy-preserving method of perception, can be deployed indoors for detecting human activities such as falls, based on the reflective properties of electromagnetic waves. Signals generated by transmitters experience reflections from various objects within indoor environments, leading to distinct propagation paths. These signals eventually aggregate at the receiver, incorporating details about the objects’ orientation and their activity states. In this study, within practical experimental environments, we collect dataset and utilize deep learning method to classify the falling events.

随着全球人口老龄化现象逐渐普遍,老年人所承受的压力也明显增加。为了应对这一挑战,跌倒检测系统对于确保老年人,尤其是独居老人的安全非常重要。基于电磁波的反射特性,Wi-Fi 传感作为一种保护隐私的感知方法,可以在室内部署,用于检测跌倒等人类活动。发射器产生的信号会受到室内环境中各种物体的反射,从而形成不同的传播路径。这些信号最终会在接收器处汇聚,并包含物体方位及其活动状态的详细信息。在本研究中,我们在实际实验环境中收集数据集,并利用深度学习方法对坠落事件进行分类。
{"title":"Deep learning-based fall detection using commodity Wi-Fi","authors":"Tingwei Chen ,&nbsp;Xiaoyang Li ,&nbsp;Hang Li ,&nbsp;Guangxu Zhu","doi":"10.1016/j.jiixd.2024.04.001","DOIUrl":"10.1016/j.jiixd.2024.04.001","url":null,"abstract":"<div><p>As the phenomenon of an aging population gradually becomes common worldwide, the pressure on the elderly has seen a notable increase. To address this challenge, fall detection systems are important in ensuring the safety of the elderly population, particularly those living alone. Wi-Fi sensing, as a privacy-preserving method of perception, can be deployed indoors for detecting human activities such as falls, based on the reflective properties of electromagnetic waves. Signals generated by transmitters experience reflections from various objects within indoor environments, leading to distinct propagation paths. These signals eventually aggregate at the receiver, incorporating details about the objects’ orientation and their activity states. In this study, within practical experimental environments, we collect dataset and utilize deep learning method to classify the falling events.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 355-364"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000283/pdfft?md5=f31939e6bf88241fc2bd69185c959aa9&pid=1-s2.0-S2949715924000283-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140775565","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
Structural knowledge-driven meta-learning for task offloading in vehicular networks with integrated communications, sensing and computing 在集成通信、传感和计算功能的车载网络中进行结构知识驱动的元学习以实现任务卸载
Pub Date : 2024-07-01 DOI: 10.1016/j.jiixd.2024.02.005
Ruijin Sun , Yao Wen , Nan Cheng , Wei Wang , Rong Chai , Yilong Hui

Task offloading is a potential solution to satisfy the strict requirements of computation-intensive and latency-sensitive vehicular applications due to the limited onboard computing resources. However, the overwhelming upload traffic may lead to unacceptable uploading time. To tackle this issue, for tasks taking environmental data as input, the data perceived by roadside units (RSU) equipped with several sensors can be directly exploited for computation, resulting in a novel task offloading paradigm with integrated communications, sensing and computing (I-CSC). With this paradigm, vehicles can select to upload their sensed data to RSUs or transmit computing instructions to RSUs during the offloading. By optimizing the computation mode and network resources, in this paper, we investigate an I-CSC-based task offloading problem to reduce the cost caused by resource consumption while guaranteeing the latency of each task. Although this non-convex problem can be handled by the alternating minimization (AM) algorithm that alternatively minimizes the divided four sub-problems, it leads to high computational complexity and local optimal solution. To tackle this challenge, we propose a creative structural knowledge-driven meta-learning (SKDML) method, involving both the model-based AM algorithm and neural networks. Specifically, borrowing the iterative structure of the AM algorithm, also referred to as structural knowledge, the proposed SKDML adopts long short-term memory (LSTM) network-based meta-learning to learn an adaptive optimizer for updating variables in each sub-problem, instead of the handcrafted counterpart in the AM algorithm. Furthermore, to pull out the solution from the local optimum, our proposed SKDML updates parameters in LSTM with the global loss function. Simulation results demonstrate that our method outperforms both the AM algorithm and the meta-learning without structural knowledge in terms of both the online processing time and the network performance.

由于车载计算资源有限,任务卸载是满足计算密集型和延迟敏感型车辆应用严格要求的一种潜在解决方案。然而,过大的上传流量可能会导致无法接受的上传时间。为解决这一问题,对于以环境数据为输入的任务,可直接利用配备多个传感器的路边装置(RSU)感知的数据进行计算,从而形成一种集成通信、传感和计算(I-CSC)的新型任务卸载模式。在这种模式下,车辆可以在卸载过程中选择将感知数据上传到 RSU 或将计算指令传输到 RSU。通过优化计算模式和网络资源,本文研究了基于 I-CSC 的任务卸载问题,以在保证每个任务的延迟的同时降低资源消耗所造成的成本。虽然交替最小化(AM)算法可以处理这个非凸问题,即交替最小化所划分的四个子问题,但它会导致较高的计算复杂度和局部最优解。为了应对这一挑战,我们提出了一种创造性的结构知识驱动元学习(SKDML)方法,其中涉及基于模型的 AM 算法和神经网络。具体来说,借用 AM 算法的迭代结构(也称为结构知识),所提出的 SKDML 采用基于长短期记忆(LSTM)网络的元学习来学习用于更新每个子问题中变量的自适应优化器,而不是 AM 算法中的手工制作的对应优化器。此外,为了从局部最优中提取解决方案,我们提出的 SKDML 利用全局损失函数更新 LSTM 中的参数。仿真结果表明,就在线处理时间和网络性能而言,我们的方法优于 AM 算法和不具备结构知识的元学习方法。
{"title":"Structural knowledge-driven meta-learning for task offloading in vehicular networks with integrated communications, sensing and computing","authors":"Ruijin Sun ,&nbsp;Yao Wen ,&nbsp;Nan Cheng ,&nbsp;Wei Wang ,&nbsp;Rong Chai ,&nbsp;Yilong Hui","doi":"10.1016/j.jiixd.2024.02.005","DOIUrl":"10.1016/j.jiixd.2024.02.005","url":null,"abstract":"<div><p>Task offloading is a potential solution to satisfy the strict requirements of computation-intensive and latency-sensitive vehicular applications due to the limited onboard computing resources. However, the overwhelming upload traffic may lead to unacceptable uploading time. To tackle this issue, for tasks taking environmental data as input, the data perceived by roadside units (RSU) equipped with several sensors can be directly exploited for computation, resulting in a novel task offloading paradigm with integrated communications, sensing and computing (I-CSC). With this paradigm, vehicles can select to upload their sensed data to RSUs or transmit computing instructions to RSUs during the offloading. By optimizing the computation mode and network resources, in this paper, we investigate an I-CSC-based task offloading problem to reduce the cost caused by resource consumption while guaranteeing the latency of each task. Although this non-convex problem can be handled by the alternating minimization (AM) algorithm that alternatively minimizes the divided four sub-problems, it leads to high computational complexity and local optimal solution. To tackle this challenge, we propose a creative structural knowledge-driven meta-learning (SKDML) method, involving both the model-based AM algorithm and neural networks. Specifically, borrowing the iterative structure of the AM algorithm, also referred to as structural knowledge, the proposed SKDML adopts long short-term memory (LSTM) network-based meta-learning to learn an adaptive optimizer for updating variables in each sub-problem, instead of the handcrafted counterpart in the AM algorithm. Furthermore, to pull out the solution from the local optimum, our proposed SKDML updates parameters in LSTM with the global loss function. Simulation results demonstrate that our method outperforms both the AM algorithm and the meta-learning without structural knowledge in terms of both the online processing time and the network performance.</p></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 4","pages":"Pages 302-324"},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2949715924000106/pdfft?md5=40b4034f42d124042f5327bc76eb93ca&pid=1-s2.0-S2949715924000106-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140433037","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
Unsupervised meta-learning with domain adaptation based on a multi-task reconstruction-classification network for few-shot hyperspectral image classification 基于多任务重建分类网络的域自适应无监督元学习多镜头高光谱图像分类
Pub Date : 2024-06-20 DOI: 10.1016/j.jiixd.2024.06.001
Yu Liu , Caihong Mu , Shanjiao Jiang , Yi Liu
Although the deep-learning method has achieved great success for hyperspectral image (HSI) classification, the few-shot HSI classification deserves sufficient study because it is difficult and expensive to acquire labeled samples. In fact, the meta-learning methods can improve the performance for few-shot HSI classification effectively. However, most of the existing meta-learning methods for HSI classification are supervised, which still heavily rely on the labeled data for meta-training. Moreover, there are many cross-scene classification tasks in the real world, and domain adaptation of unsupervised meta-learning has been ignored for HSI classification so far. To address the above issues, this paper proposes an unsupervised meta-learning method with domain adaptation based on a multi-task reconstruction-classification network (MRCN) for few-shot HSI classification. MRCN does not need any labeled data for meta-training, where the pseudo labels are generated by multiple spectral random sampling and data augmentation. The meta-training of MRCN jointly learns a shared encoding representation for two tasks and domains. On the one hand, we design an encoder-classifier to learn the classification task on the source-domain data. On the other hand, we devise an encoder-decoder to learn the reconstruction task on the target-domain data. The experimental results on four HSI datasets demonstrate that MRCN preforms better than several state-of-the-art methods with only two to five labeled samples per class. To the best of our knowledge, the proposed method is the first unsupervised meta-learning method that considers the domain adaptation for few-shot HSI classification.
尽管深度学习方法在高光谱图像(HSI)分类中取得了巨大的成功,但由于获取标记样本的难度和成本较高,少量的高光谱图像分类值得充分研究。事实上,元学习方法可以有效地提高少量HSI分类的性能。然而,现有的用于HSI分类的元学习方法大多是监督式的,仍然严重依赖于标记数据进行元训练。此外,现实世界中存在许多跨场景的分类任务,迄今为止,无监督元学习的领域适应在HSI分类中被忽视。为了解决上述问题,本文提出了一种基于多任务重构分类网络(MRCN)的无监督元学习领域自适应方法,用于小样本HSI分类。MRCN不需要任何标记数据进行元训练,其中伪标签是通过多谱随机采样和数据增强生成的。MRCN的元训练共同学习两个任务和域的共享编码表示。一方面,我们设计了一个编码器分类器来学习对源域数据的分类任务。另一方面,我们设计了一个编码器-解码器来学习目标域数据上的重构任务。在四个HSI数据集上的实验结果表明,MRCN比几个最先进的方法表现得更好,每个类别只有两到五个标记样本。据我们所知,所提出的方法是第一个考虑对少量HSI分类的领域自适应的无监督元学习方法。
{"title":"Unsupervised meta-learning with domain adaptation based on a multi-task reconstruction-classification network for few-shot hyperspectral image classification","authors":"Yu Liu ,&nbsp;Caihong Mu ,&nbsp;Shanjiao Jiang ,&nbsp;Yi Liu","doi":"10.1016/j.jiixd.2024.06.001","DOIUrl":"10.1016/j.jiixd.2024.06.001","url":null,"abstract":"<div><div>Although the deep-learning method has achieved great success for hyperspectral image (HSI) classification, the few-shot HSI classification deserves sufficient study because it is difficult and expensive to acquire labeled samples. In fact, the meta-learning methods can improve the performance for few-shot HSI classification effectively. However, most of the existing meta-learning methods for HSI classification are supervised, which still heavily rely on the labeled data for meta-training. Moreover, there are many cross-scene classification tasks in the real world, and domain adaptation of unsupervised meta-learning has been ignored for HSI classification so far. To address the above issues, this paper proposes an unsupervised meta-learning method with domain adaptation based on a multi-task reconstruction-classification network (MRCN) for few-shot HSI classification. MRCN does not need any labeled data for meta-training, where the pseudo labels are generated by multiple spectral random sampling and data augmentation. The meta-training of MRCN jointly learns a shared encoding representation for two tasks and domains. On the one hand, we design an encoder-classifier to learn the classification task on the source-domain data. On the other hand, we devise an encoder-decoder to learn the reconstruction task on the target-domain data. The experimental results on four HSI datasets demonstrate that MRCN preforms better than several state-of-the-art methods with only two to five labeled samples per class. To the best of our knowledge, the proposed method is the first unsupervised meta-learning method that considers the domain adaptation for few-shot HSI classification.</div></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"3 2","pages":"Pages 103-112"},"PeriodicalIF":0.0,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143175025","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
PGCF: Perception graph collaborative filtering for recommendation PGCF:用于推荐的感知图协同过滤
Pub Date : 2024-05-27 DOI: 10.1016/j.jiixd.2024.05.003
Caihong Mu , Keyang Zhang , Jiashen Luo , Yi Liu
Extensive studies have fully proved the effectiveness of collaborative filtering (CF) recommendation models based on graph convolutional networks (GCNs). As an advanced interaction encoder, however, GCN-based CF models do not differentiate neighboring nodes, which will lead to suboptimal recommendation performance. In addition, most GCN-based CF studies pay insufficient attention to the loss function and they simply select the Bayesian personalized ranking (BPR) loss function to train the model. However, we believe that the loss function is as important as the interaction encoder and deserves more attentions. To address the above issues, we propose a novel GCN-based CF model, named perception graph collaborative filtering (PGCF). Specifically, for the interaction encoder, we design a neighborhood-perception GCN to enhance the aggregation of interest-related information of the target node during the information aggregation process, while weakening the propagation of noise and irrelevant information to help the model learn better embedding representation. For the loss function, we design a margin-perception Bayesian personalized ranking (MBPR) loss function, which introduces a self-perception margin, requiring the predicted score of the user-positive sample to be greater than that of the user-negative sample, and also greater than the sum of the predicted score of the user-negative sample and the margin. The experimental results on five benchmark datasets show that PGCF is significantly superior to multiple existing CF models.
大量研究充分证明了基于图卷积网络(GCN)的协同过滤(CF)推荐模型的有效性。然而,作为一种先进的交互编码器,基于 GCN 的 CF 模型并不区分相邻节点,这将导致推荐效果不理想。此外,大多数基于 GCN 的 CF 研究对损失函数不够重视,只是简单地选择贝叶斯个性化排名(BPR)损失函数来训练模型。然而,我们认为损失函数与交互编码器同样重要,值得更多关注。针对上述问题,我们提出了一种基于 GCN 的新型 CF 模型,命名为感知图协同过滤(PGCF)。具体来说,对于交互编码器,我们设计了一个邻域感知 GCN,以增强信息聚合过程中目标节点与兴趣相关信息的聚合,同时弱化噪声和无关信息的传播,帮助模型学习更好的嵌入表示。在损失函数方面,我们设计了边际感知贝叶斯个性化排名(MBPR)损失函数,引入了自我感知边际,要求用户积极样本的预测得分大于用户消极样本的预测得分,同时也大于用户消极样本的预测得分与边际之和。在五个基准数据集上的实验结果表明,PGCF 明显优于现有的多种 CF 模型。
{"title":"PGCF: Perception graph collaborative filtering for recommendation","authors":"Caihong Mu ,&nbsp;Keyang Zhang ,&nbsp;Jiashen Luo ,&nbsp;Yi Liu","doi":"10.1016/j.jiixd.2024.05.003","DOIUrl":"10.1016/j.jiixd.2024.05.003","url":null,"abstract":"<div><div>Extensive studies have fully proved the effectiveness of collaborative filtering (CF) recommendation models based on graph convolutional networks (GCNs). As an advanced interaction encoder, however, GCN-based CF models do not differentiate neighboring nodes, which will lead to suboptimal recommendation performance. In addition, most GCN-based CF studies pay insufficient attention to the loss function and they simply select the Bayesian personalized ranking (BPR) loss function to train the model. However, we believe that the loss function is as important as the interaction encoder and deserves more attentions. To address the above issues, we propose a novel GCN-based CF model, named perception graph collaborative filtering (PGCF). Specifically, for the interaction encoder, we design a neighborhood-perception GCN to enhance the aggregation of interest-related information of the target node during the information aggregation process, while weakening the propagation of noise and irrelevant information to help the model learn better embedding representation. For the loss function, we design a margin-perception Bayesian personalized ranking (MBPR) loss function, which introduces a self-perception margin, requiring the predicted score of the user-positive sample to be greater than that of the user-negative sample, and also greater than the sum of the predicted score of the user-negative sample and the margin. The experimental results on five benchmark datasets show that PGCF is significantly superior to multiple existing CF models.</div></div>","PeriodicalId":100790,"journal":{"name":"Journal of Information and Intelligence","volume":"2 6","pages":"Pages 525-534"},"PeriodicalIF":0.0,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441318","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
期刊
Journal of Information and Intelligence
全部 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1