检索结果-内蒙古大学图书馆

Pushing AI to wireless network edge: an overview on integrated sensing, communication, and computation towards 6G

science China(Information sciences) 2023年第3期66卷 7-25页

作者： Guangxu ZHU Zhonghao LYU Xiang JIAO Peixi LIU Mingzhe CHEN Jie XU Shuguang CUI Ping ZHANG Shenzhen Research Institute of Big Data Future Network of Intelligence Institute (FNii) The Chinese University of Hong Kong (Shenzhen) School of Science and Engineering (SSE) The Chinese University of Hong Kong (Shenzhen) State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Peking University Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Peng Cheng Laboratory State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Pushing artificial intelligence(AI) from central cloud to network edge has reached board consensus in both industry and academia for materializing the vision of artificial intelligence of things(AIoT) in the sixth-generation(6G) era. This gives rise to an emerging research area known as edge intelligence, which concerns the distillation of human-like intelligence from the vast amount of data scattered at the wireless network edge. Typically, realizing edge intelligence corresponds to the processes of sensing, communication,and computation, which are coupled ingredients for data generation, exchanging, and processing, ***, conventional wireless networks design the three mentioned ingredients separately in a task-agnostic manner, which leads to difficulties in accommodating the stringent demands of ultra-low latency, ultra-high reliability, and high capacity in emerging AI applications like auto-driving and metaverse. This thus prompts a new design paradigm of seamlessly integrated sensing, communication, and computation(ISCC) in a taskoriented manner, which comprehensively accounts for the use of the data in downstream AI tasks. In view of its growing interest, this study provides a timely overview of ISCC for edge intelligence by introducing its basic concept, design challenges, and enabling techniques, surveying the state-of-the-art advancements, and shedding light on the road ahead.

关键词： sixth-generation (6G) edge intelligence artificial intelligence of things (AIoT) integrated sensing communication and computation (ISCC)

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preservation Method for Attributed Social network Based on Negative Representation of Information

引用

Computer Modeling in Engineering & sciences 2024年第7期140卷 1045-1075页

作者： Hao Jiang Yuerong Liao Dongdong Zhao Wenjian Luo Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei230601China Chongqing Research Institute School of Computer Science and Artificial IntelligenceWuhan University of TechnologyWuhan430070China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and TechnologyHarbin Institute of TechnologyShenzhen518055China

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many *** by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network ***,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called ***,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept ***,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social *** evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social *** experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding *** experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

关键词： Attributed social network topology privacy node attribute privacy negative representation of information negative survey negative database

来源：评论

学校读者我要写书评

暂无评论

SDGNN: Symmetry-Preserving Dual-Stream Graph Neural networks

引用

IEEE/CAA Journal of Automatica Sinica 2024年第7期11卷 1717-1719页

作者： Jiufang Chen Ye Yuan Xin Luo the College of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065 the Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China the College of Computer and Information Science Southwest UniversityChongqing 400715China IEEE

Dear Editor,This letter proposes a symmetry-preserving dual-stream graph neural network(SDGNN) for precise representation learning to an undirected weighted graph(UWG). Although existing graph neural networks(GNNs) are influential instruments for representation learning to a UWG, they invariably adopt a unique node feature matrix for illustrating the sole node set of a UWG.

关键词： representation preserving undirected

来源：评论

学校读者我要写书评

暂无评论

Qualitative and Quantitative Model Checking Against Recurrent Neural networks

引用

Journal of Computer science & technology 2024年第6期39卷 1292-1311页

作者： Zhen Liang Wan-Wei Liu Fu Song Bai Xue Wen-Jing Yang Ji Wang Zheng-Bin Pang Institute for Quantum Information&State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China College of Computer Science and Technology National University of Defense TechnologyChangsha 410073China School of Information Science and Technology ShanghaiTech UniversityShanghai 201210China Institute of Software Chinese Academy of SciencesBeijing 100190China

Recurrent neural networks (RNNs) have been heavily used in applications relying on sequence data such as time series and natural languages. As a matter of fact, their behaviors lack rigorous quality assurance due to the black-box nature of deep learning. It is an urgent and challenging task to formally reason about the behaviors of RNNs. To this end, we first present an extension of linear-time temporal logic to reason about properties with respect to RNNs, such as local robustness, reachability, and some temporal properties. Based on the proposed logic, we formalize the verification obligation as a Hoare-like triple, from both qualitative and quantitative perspectives. The former concerns whether all the outputs resulting from the inputs fulfilling the pre-condition satisfy the post-condition, whereas the latter is to compute the probability that the post-condition is satisfied on the premise that the inputs fulfill the pre-condition. To tackle these problems, we develop a systematic verification framework, mainly based on polyhedron propagation, dimension-preserving abstraction, and the Monte Carlo sampling. We also implement our algorithm with a prototype tool and conduct experiments to demonstrate its feasibility and efficiency.

关键词： recurrent neural network model checking temporal logic qualitative/quantitative verification

来源：评论

学校读者我要写书评

暂无评论

An Improved YOLOv5s-Based Smoke Detection System for Outdoor Parking Lots

引用

Computers, Materials & Continua 2024年第8期80卷 3333-3349页

作者： Ruobing Zuo Xiaohan Huang Xuguo Jiao Zhenyong Zhang State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China School of Information and Control Engineering Qingdao University of TechnologyQingdao266520China State Key Laboratory of Industrial Control Technology College of Control Science and EngineeringZhejiang UniversityHangzhou310027China Key Laboratory of Computing Power Network and Information Security Ministry of EducationQilu University of Technology(Shandong Academy of Sciences)Jinan250353China Text Computing&Cognitive Intelligence Engineering Research Center of National Education Ministry Guizhou UniversityGuiyang550025China

In the rapidly evolving urban landscape,outdoor parking lots have become an indispensable part of the city’s transportation *** growth of parking lots has raised the likelihood of spontaneous vehicle combus-tion,a significant safety hazard,making smoke detection an essential preventative ***,the complex environment of outdoor parking lots presents additional challenges for smoke detection,which necessitates the development of more advanced and reliable smoke detection *** paper addresses this concern and presents a novel smoke detection technique designed for the demanding environment of outdoor parking ***,we develop a novel dataset to fill the gap,as there is a lack of publicly available *** dataset encompasses a wide range of smoke and fire scenarios,enhanced with data augmentation to ensure robustness against diverse outdoor ***,we utilize an optimized YOLOv5s model,integrated with the Squeeze-and-Excitation network(SENet)attention mechanism,to significantly improve detection accuracy while maintaining real-time processing ***,this paper implements an outdoor smoke detection system that is capable of accurately localizing and alerting in real time,enhancing the effectiveness and reliability of emergency *** show that the system has a high accuracy in terms of detecting smoke incidents in outdoor scenarios.

关键词： YOLOv5s smoke detection deep learning SENet

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Federated Stochastic Primal-Dual Learning for Internet of Vehicles

引用

IEEE Internet of Things Journal 2025年第11期12卷 17034-17050页

作者： Li, Yiwei Wang, Shuai Chang, Tsung-Hui Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China The Chinese University of Hong Kong Shenzhen School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Federated learning (FL) has the potential to empower Internet-of-Vehicles (IoV) networks by enabling smart vehicles (SVs) to participate in the learning process under the orchestration of a vehicular service provider while keeping data locally. In this paper, we propose a novel federated stochastic primal-dual algorithm with differential privacy (FedSPD-DP) to ensure robust privacy protection for FL based IoV (FL-IoV) systems. The FedSPD-DP algorithm leverages multiple steps of local stochastic gradient descent (SGD) and partial client participation (PCP) to improve communication efficiency while incorporating differential privacy (DP) to ensure privacy protection. Our theoretical analysis explores the impact of these strategies on learning performance. Specifically, we demonstrate that the data sampling strategy and PCP enhance data privacy, while a larger number of local SGD steps may increase privacy leakage, revealing a non-trivial tradeoff between communication efficiency and privacy protection. Extensive experiments on real-world data validate the effectiveness of the proposed algorithm, showing superior performance compared to state-of-the-art FL algorithms, and confirming the analytical results and properties. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Extractive Automatic Summarization Method for Chinese Long Text 9th

An Extractive Automatic Summarization Method for Chinese Lon...

引用

19th International Conference on Advanced data Mining and Applications, ADMA 2023

作者： Zhu, Jizhao Duan, Wenyu Yu, Naitong Pan, Xinlong Fan, Chunlong Shenyang Aerospace University Shenyang China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Beijing China Naval Aviation University Yantai China

ISBN: (纸本)9783031466632

The extractive automatic summarization method is capable of quickly and efficiently generating summaries through the steps of scoring, extracting and eliminating redundant sentences. Currently, most extractive methods utilize deep learning technology to treat automatic summarization as a binary classification task. However, the effectiveness of automatic summarization for Chinese long text is limited by the maximum input length of the model, and it requires a large amount of training data. This paper proposes an unsupervised extractive automatic summarization method which solves the long text encoding problem by incorporating contextual semantics into sentence-level encoding. Firstly, we obtain the semantic representation of sentences by using the RoBERTa model. Secondly, we propose an improved k-Means algorithm to cluster sentence representations. By defining sparse and dense clusters, we improve the accuracy of summary sentence selection while preserving maximum semantic information from the original text. Experimental results on the CAIL2020 dataset show that our method outperforms baselines by 6.64/7.68/7.14% respectively on ROUGE-1/2/L. Moreover, we further enhance the automatic summarization results by 4.5/5.36/3.24% by adding domain rules tailored to the dataset’s characteristics. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Augmentation-Aware Self-Supervision for data-Efficient GAN Training 37

Augmentation-Aware Self-Supervision for Data-Efficient GAN T...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Hou, Liang Cao, Qi Yuan, Yige Zhao, Songtao Ma, Chongyang Pan, Siyuan Wan, Pengfei Wang, Zhongyuan Shen, Huawei Cheng, Xueqi CAS Key Laboratory of AI Safety and Security Institute of Computing Technology Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Kuaishou Technology China

ISBN: (纸本)9781713899921

Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting. Previously proposed differentiable augmentation demonstrates improved data efficiency of training GANs. However, the augmentation implicitly introduces undesired invariance to augmentation for the discriminator since it ignores the change of semantics in the label space caused by data transformation, which may limit the representation learning ability of the discriminator and ultimately affect the generative modeling performance of the generator. To mitigate the negative impact of invariance while inheriting the benefits of data augmentation, we propose a novel augmentation-aware self-supervised discriminator that predicts the augmentation parameter of the augmented data. Particularly, the prediction targets of real data and generated data are required to be distinguished since they are different during training. We further encourage the generator to adversarially learn from the self-supervised discriminator by generating augmentation-predictable real and not fake data. This formulation connects the learning objective of the generator and the arithmetic - harmonic mean divergence under certain assumptions. We compare our method with state-of-the-art (SOTA) methods using the class-conditional BigGAN and unconditional StyleGAN2 architectures on data-limited CIFAR-10, CIFAR-100, FFHQ, LSUN-Cat, and five low-shot datasets. Experimental results demonstrate significant improvements of our method over SOTA methods in training data-efficient GANs. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction by Disentangled Subgraph Structure

引用

Tsinghua science and technology 2024年第5期29卷 1566-1579页

作者： Guiduo Duan Rui Guo Wenlong Luo Guangchun Luo Tianxi Huang Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of ChinaChengdu 611731Chinaand also with Trusted Cloud Computing and Big Data Key Laboratory of Sichuan ProvinceChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Hangzhou NetEase Cloud Music Technology Co. Ltd.Hangzhou 310052China Department of Fundamental Courses Chengdu Textile CollegeChengdu 611700China

Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.

关键词： disentangled subgraph structure knowledge graph completion Gated Recurrent Unit(GRU) feature updating

来源：评论

学校读者我要写书评

暂无评论

Edge computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：