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

IEEE International Conference on Big Data

作者： Yi Zu Jiacong Mi Lingning Song Shan Lu Jieyue He School of Computer Science and Engineering Key Lab of Computer Network and Information Integration MOE Southeast University Nanjing China School of Software Engineering Southeast University Nanjing China Nanjing Fenghuo Tiandi Communication Technology Co. Ltd Nanjing China

The core of quantitative investment lies in predicting future trends in stock prices. The future trend of a stock is closely related to the industry it belongs to and its relationship with other stocks. Although some research has focused on stock trend prediction in recent years, most studies have only considered the stock’s own time series feature, neglecting the spatial features between stocks. Some research has incorporated spatial information, but typically only considered predefined static relationships. At the same time, capturing dynamic spatial information in the market has been a long-standing challenge. Thus, we propose a spatio-temporal model, Finformer, in order to go beyond traditional time series models. We designed a sparse static-dynamic transformer to capture dynamic market spatial information as it changes over time and combined predefined relationships to extract highly correlated spatial features in the stock market. To effectively integrate spatial and temporal features, we introduced an adaptive spatio-temporal fusion module that dynamically fuses spatio-temporal features based on market conditions at different periods. Experiments on two real-world stock market datasets show that our proposed model outperforms the state-of-the-art baselines in the signal-based and portfolio-based metrics, which are widely concerned in the financial field. Ablation study and hyper-parameter study further reveal the effectiveness of each module in the model and the impact of hyper-parameters. The code will be made publicly available. 1

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gradient sparsification for efficient wireless federated learning with differential privacy

引用

Science China(Information Sciences) 2024年第4期67卷 272-288页

作者： Kang WEI Jun LI Chuan MA Ming DING Feng SHU Haitao ZHAO Wen CHEN Hongbo ZHU School of Electronic and Optical Engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education Data61 Commonwealth Scientific and Industrial Research Organisation School of Information and Communication Engineering Hainan University School of Communications and Information Engineering Nanjing University of Posts and Telecommunications School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University

Federated learning(FL) enables distributed clients to collaboratively train a machine learning model without sharing raw data with each other. However, it suffers from the leakage of private information from uploading models. In addition, as the model size grows, the training latency increases due to the limited transmission bandwidth and model performance degradation while using differential privacy(DP)protection. In this paper, we propose a gradient sparsification empowered FL framework with DP over wireless channels, to improve training efficiency without sacrificing convergence performance. Specifically, we first design a random sparsification algorithm to retain a fraction of the gradient elements in each client's local model, thereby mitigating the performance degradation induced by DP and reducing the number of transmission parameters over wireless channels. Then, we analyze the convergence bound of the proposed algorithm, by modeling a non-convex FL problem. Next, we formulate a time-sequential stochastic optimization problem for minimizing the developed convergence bound, under the constraints of transmit power, the average transmitting delay, as well as the client's DP requirement. Utilizing the Lyapunov drift-plus-penalty framework, we develop an analytical solution to the optimization problem. Extensive experiments have been implemented on three real-life datasets to demonstrate the effectiveness of our proposed algorithm. We show that our proposed algorithms can fully exploit the interworking between communication and computation to outperform the baselines, i.e., random scheduling, round robin, and delay-minimization algorithms.

关键词： federated learning differential privacy gradient sparsification Lyapunov drift convergence analysis

来源：评论

学校读者我要写书评

暂无评论

Age of Information Minimization in Intelligent Reflecting Surface-Aided Covert communications

Age of Information Minimization in Intelligent Reflecting Su...

引用

2022 IEEE GLOBECOM Workshops, GC Wkshps 2022

作者： Wang, Chao Li, Zan Zhao, Yue Ng, Derrick Wing Kwan Al-Dhahir, Naofal Xidian University State Key Laboratory of Integrated Service Network Xi'an710071 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing210003 China Southeast University National Mobile Communications Research Laboratory Nanjing210096 China University of New South Wales School of Electrical Engineering and Telecommunications Sydney2052 Australia The University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75080 United States

ISBN: (纸本)9781665459754

In this work, we investigate the covert information freshness in intelligent reflecting surface (IRS)-aided multi antenna communications, where a public full-duplex user (Alice) and a private full-duplex user (Bob) exchange information in the presence of a watchful warden (Willie). Specifically, the covert transmission from Bob to Alice is shielded from Willie under the mask of Alice's undisguised signal transmission. To minimize the covert information age, we exploit the channel statistics to jointly design the active beamforming at Alice and Bob, the passive beamforming at the IRS, and the blocklength of the confidential data packet under the constraints of the maximum tolerable age of information (AoI) at Bob and communication covertness. Although the considered joint optimization problem is nonconvex, we employ the successive convex approximation to design an iterative algorithm to obtain an efficient suboptimal solution. Numerical results demonstrate the superiority of our proposed joint optimization algorithm and further show that the enhanced covert channel quality can reduce the required blocklength to improve information freshness. © 2022 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

The Proof is in the Pudding: Decision-Oriented Machine-Type Wireless Video Transmission

The Proof is in the Pudding: Decision-Oriented Machine-Type ...

引用

IEEE Conference on Global communications (GLOBECOM)

作者： Jie Song Yun Gao Dan Wu Liang Zhou Yi Qian Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing China Institute of Communications Engineering Army Engineering University of PLA Nanjing China Department of Electrical and Computer Engineering University of Nebraska-Lincoln Lincoln USA

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

With the rise of the Internet of Everything, machine-type wireless video applications like intelligent surveillance are increasingly becoming mainstream network services. However, the massive transmission of video streams heavily burdens wireless networks. Existing methods typically establish a correlation between the transmitted content and the quality of experience or service, making it challenging to balance trade-offs among decision quality, bandwidth utilization, and latency requirements. To address this issue fundamentally, this paper proposes a novel perspective by designing wireless video transmission strategies from the angle of decision quality, where only the content that impacts the decision outcomes is transmitted. The highlight of this paper is designing a lightweight yet efficient binary classifier that predicts whether the current content will change decision outcomes based on content discrepancies, measured only through pixel-level differences and macroblock-level similarity. Furthermore, these discrepancies can be used to distinguish the background, thereby further saving bandwidth by reusing the background information. Additionally, a fine-tuning module is incorporated to flexibly update the classifier model, ensuring adaptability across various scenarios. Extensive results demonstrate that the proposed strategy achieves over 81% redundant bandwidth savings while maintaining decision quality and catering to strict latency requirements on computation-constrained devices.

关键词： Correlation Wireless networks Surveillance Current measurement Bandwidth Streaming media Quality of experience Internet of Things Global communication Streams

来源：评论

学校读者我要写书评

暂无评论

Robot and its living space:A roadmap for robot development based on the view of living space

引用

Digital communications and networks 2021年第4期7卷 505-517页

作者： Xiaofeng Cai Huansheng Ning Sahraoui Dhelim Rongjuan Zhou Tao Zhang Yang Xu Yueliang Wan School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083China Beijing Engineering Research Center for Cyberspace Data Analysis and Applications Beijing 100083China School of Foreign Studies University of Science and Technology Beijing Beijing 100083China Key Lab of Information Network Security Ministry of Public SecurityChina Run Technologies Co. LidBeijing China

Robot’s living space Human-robot relationship Robot humanization Hybrid intelligence Human-robot integrated society Robots,as the creation of humans,became an irreplaceable component in human *** the advancement of technologies,robots have become more and more intelligent and have been widely used in many fields,such as disease diagnosis,customer services,healthcare for the older people,and so *** robots made our lives much more convenient than ever before,they also brought many potential risks and challenges in technology,security,and *** better understand the development of robots,we proposed a concept of a robot’s living space and analyzed the role of robots in our *** this paper,we focus on setting a theoretical framework of the robot’s living space to further understand the human-robot *** research in this paper contains three central ***,we interpret the concept of the robot’s living space and the functions of each ***,we analyze and summarize the relative technologies which support robots living well in each ***,we provide advice and improvement measures based on a discussion of potential problems caused by the developments of *** the trend of robots humanization and human-robot society integration,we should seriously consider how to collaborate with intelligent robots to achieve hybrid *** build a harmonious human-robot integrated society,studying the robot’s living space and its relationship with humans is the prerequisite and roadmap.

关键词： Robot's living space Human-robot relationship Robot humanization Hybrid intelligence Human-robot integrated society

来源：评论

学校读者我要写书评

暂无评论

Video smoke removal based on low-rank tensor completion via spatial-temporal continuity constraint

Video smoke removal based on low-rank tensor completion via ...

引用

作者： Zhu, Hu Xu, Guoxia Liu, Lu Deng, Lizhen Jiangsu Province Key Lab on Image Processing and Image Communication Nanjing University of Posts and Telecommunication Nanjing China Department of Computer Science Norwegian University of Science and Technology Gjovik Norway National Engineering Research Center of Communication and Network Technology Nanjing University of Posts and Telecommunication Nanjing China

Smoke has a very bad effect on the outdoor vision system. Not only are the videos with poor visual effects obtained, but also the quality and structure of the videos are reduced. In this paper, we propose a video smoke removal method based on low-rank tensor completion via spatial-temporal continuity constraint. The proposed method is based on the smoke mixing model and consider the sparseness of smoke and the global and local consistency of clean video. Then, the optimal solution of the smoke removal algorithm model is quickly realized by the Alternating Direction Method of Multiplier. Finally, we evaluate the experiment results of real-world data and simulated data from the visual effects and objective indicators. And the experiment results show that our proposed algorithm can achieve better smoke removal results. © 2021 John Wiley & Sons, Ltd.

关键词： Smoke

来源：评论

学校读者我要写书评

暂无评论

Deep Feature Surgery: Towards Accurate and Efficient Multi-Exit networks

arXiv

引用

arXiv 2024年

作者： Gong, Cheng Chen, Yao Luo, Qiuyang Lu, Ye Li, Tao Zhang, Yuzhi Sun, Yufei Zhang, Le College of Software Nankai University China College of Computer Science Nankai University China National University of Singapore Singapore School of Information and Communication Engineering University of Electronic Science and Technology of China China HAIHE Lab of ITAI China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education

Multi-exit network is a promising architecture for efficient model inference by sharing backbone networks and weights among multiple exits. However, the gradient conflict of the shared weights results in sub-optimal accuracy. This paper introduces Deep Feature Surgery (DFS), which consists of feature partitioning and feature referencing approaches to resolve gradient conflict issues during the training of multi-exit networks. The feature partitioning separates shared features along the depth axis among all exits to alleviate gradient conflict while simultaneously promoting joint optimization for each exit. Subsequently, feature referencing enhances multi-scale features for distinct exits across varying depths to improve the model accuracy. Furthermore, DFS reduces the training operations with the reduced complexity of backpropagation. Experimental results on Cifar100 and ImageNet datasets exhibit that DFS provides up to a 50.00% reduction in training time and attains up to a 6.94% enhancement in accuracy when contrasted with baseline methods across diverse models and tasks. Budgeted batch classification evaluation on MSDNet demonstrates that DFS uses about 2× fewer average FLOPs per image to achieve the same classification accuracy as baseline methods on Cifar100. The code is available at https: //***/GongCheng1919/dfs. Copyright © 2024, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Heuristic Computing Methods for Contact Plan Design in the Spatial-Node-Based Internet of Everything

引用

China communications 2019年第3期16卷 53-68页

作者： Cuiqin Dai Qingyang Song School of Computer Science and Engineering Northeastern University Chongqing Key Lab of Mobile Communication Technology Chongqing University of Posts and Telecommunications School of Communication and Information Engineering Chongqing University of Posts and Telecommunications

To satisfy the increasing demands of high-speed transmission, high-efficiency computing, and real-time communications in the high-dynamic and heterogeneous networks, the Contact Plan Design(CPD) has attracted continuous attention in recent years, especially for the spatial-node-based Internet of Everything(IoE). In this paper, we study the NP-hardness of contact scheduling and the attenuation of atmospheric precipitation in the spatial-node-based IoE. Two heuristic computing methods for contact plan design are proposed by comprehensively considering the time-varying topology, the intermittent connectivity, and the adaptive transmission in different weather conditions, which are named Contact Plan Design-Particle Swarm Optimization(CPD-PSO) and Contact Plan Design-Greedy algorithm with the Minimum Delivery Time(CPD-GMDT) separately. For the population-based algorithm, CPD-PSO not only solves the CPD problem with a limited-resource condition, but also dynamically adjusts the search scope to ensure the continuous searching capability of the algorithm. For the CPD-GMDT that makes CP decisions based on the current state, the algorithm uses the idea of greedy algorithm to schedule Satellite-Platform Links(SPLs) and Inter Satellite Links(ISLs) respectively using the strategies of optimal matching and load balancing. The simulation results show that the proposed CPD-PSO outperforms Contact Plan Design-Genetic Algorithm(CPD-GA) in terms of fitness and delivery time, and CPD-GMDT presents better overall delay than Fair Contact Plan(FCP).

关键词： Internet of Everything heuristic computing contact plan design particle swarm optimization greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Uplink Control Information Based Clustered Access and Discontinuous Reception Management for mMTC

引用

IEEE communications Letters 2025年

作者： Wang, Shao-Di Wang, Chang-Long Wang, Hui-Ming Zhou, Feng Leung, Victor C. M. Xidian University Key Laboratory of Electronic Information Countermeasure and Simulation Technology of Ministry of Education Xi’an710071 China Xi’an Jiaotong University School of Information and Communication Engineering Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an710049 China Shenzhen MSU BIT University Artificial Intelligence Research Institute Shenzhen518172 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

Uplink control information (UCI) and discontinuous reception (DRX) play important roles for massive machine type communication (mMTC). Despite their standalone significance, a conspicuous gap exists in comprehensively exploring the synergy between UCI and DRX concerning both energy conservation and latency reduction for mMTC. In this letter, we propose a UCI-based clustered access and DRX management (UCADM) scheme that strikes a balance between these two critical performance metrics, reducing energy usage while preserving low latency in uplink-downlink interaction for mMTC. Specifically, we present a strictly feasible solution for the proposed UCADM scheme by using the spectral radius and the constraint projection, which can effectively solve DRX switching operations as indicated by scheduling information from UCI. Simulation results confirm the effectiveness of our scheme. © 1997-2012 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Dynamic Spectrum Access Scheme of Joint Power Control in Underlay Mode Based on Deep Reinforcement Learning

Dynamic Spectrum Access Scheme of Joint Power Control in Und...

引用

IEEE International Conference on communications in China (ICCC)

作者： Xiping Chen Xianzhong Xie Zhaoyuan Shi Zishen Fan Chongqing Key Laboratory of Computer Network and Communication Technology Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9781728173276

ISBN: (纸本)9781728173283

With the increasing complexity of wireless networks and the increasing shortage of spectrum resources, a novel dynamic spectrum access (DSA) solution is urgently needed. For complex and dynamic cognitive radio networks (CRN), this paper proposes a joint DSA and power control scheme based on deep reinforcement learning (DRL). In order to improve the convergence speed of the algorithm, the DRL is improved to a hierarchical DRL, centralized DSA is implemented through CBS, and distributed power control is implemented at each secondary user (SU). Sufficient simulation experiments show that the proposed algorithm has faster convergence speed and lower packet loss.

关键词： Heuristic algorithms Power control Dynamic spectrum access Packet loss Reinforcement learning Cognitive radio Convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：