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

arXiv 2023年

作者： Zhou, Binggui Yang, Xi Ma, Shaodan Gao, Feifei Yang, Guanghua The School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China The State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau 999078 China The Shanghai Key Laboratory of Multidimensional Information Processing School of Communication and Electronic Engineering East China Normal University Shanghai200241 China Department of Automation Tsinghua University Beijing100084 China The School of Intelligent Systems Science and Engineering The GBA and B&R International Joint Research Center for Smart Logistics Jinan University Zhuhai519070 China

To reap the promising benefits of massive multiple-input multiple-output (MIMO) systems, accurate channel state information (CSI) is required through channel estimation. However, due to the complicated wireless propagation environment and large-scale antenna arrays, precise channel estimation for massive MIMO systems is significantly challenging and costs an enormous training overhead. Considerable time-frequency resources are consumed to acquire sufficient accuracy of CSI, which thus severely degrades systems’ spectral and energy efficiencies. In this paper, we propose a dual-attention-based channel estimation network (DACEN) to realize accurate channel estimation via low-density pilots, by jointly learning the spatial-temporal domain features of massive MIMO channels with the temporal attention module and the spatial attention module. To further improve the estimation accuracy, we propose a parameter-instance transfer learning approach to transfer the channel knowledge learned from the high-density pilots pre-acquired during the training dataset collection period. Experimental results reveal that the proposed DACEN-based method achieves better channel estimation performance than the existing methods under various pilot-density settings and signal-to-noise ratios. Additionally, with the proposed parameter-instance transfer learning approach, the DACEN-based method achieves additional performance gain, thereby further demonstrating the effectiveness and superiority of the proposed method. Copyright © 2023, The Authors. All rights reserved.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Runtime reconfiguration of a modular mobile robot with serial and parallel mechanisms

Runtime reconfiguration of a modular mobile robot with seria...

引用

2007 IEEE/RSJ International Conference on Intelligent Robots and systems

作者： H. X. Zhang S.Y. Chen W. Wang J. W. Zhang G. H. Zong Institute of Technical Aspects of Multimodal Systems Department of Computer Science University of Hamburg Hamburg Germany Dept of Informatics University of Hamburg Germany College of Information Engineering Zhejiang University of Technology Hangzhou China Robotic Institute School of Mechanical Engineering and Automation Beijing Aeronautics and Astronautics University Beijing China Cognitive Technology Laboratory Shenzhen Institute of Advanced Technology Shenzhen China

This paper presents a novel field robot JL-I based on a reconfigurable concept for urban search and rescue applications. The robot consists of three identical modules; each module is an entire robotic system that can perform distributed activities. It features three-degrees-of-freedom (DOF) active joints actuated by serial and parallel mechanisms for changing shape and flexible docking mechanism. The docking mechanism enables adjacent modules to connect or disconnect flexibly and automatically. DOF analysis, working space analysis and the kinematics of the 3D active joint between connected modules are studied thoroughly. In the end a series of successful tests confirm the principles and the robot's capabilities.

关键词： Runtime Mobile robots Orbital robotics Robotics and automation Space technology Intelligent robots Kinematics Testing Prototypes Accidents

来源：评论

学校读者我要写书评

暂无评论

Model-Driven Deep Learning for Non-Coherent Massive Machine-Type Communications

arXiv

引用

arXiv 2023年

作者： Ma, Zhe Wu, Wen Gao, Feifei Shen, Xuemin The Institute for Artificial Intelligence Tsinghua University State Key Lab of Intelligent Technologies and Systems Beijing National Research Center for Information Science and Technology Department of Automation Tsinghua University Beijing100084 China The Frontier Research Center Peng Cheng Laboratory Guangdong Shenzhen518055 China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

In this paper, we investigate the joint device activity and data detection in massive machine-type communications (mMTC) with a one-phase non-coherent scheme, where data bits are embedded in the pilot sequences and the base station simultaneously detects active devices and their embedded data bits without explicit channel estimation. Due to the correlated sparsity pattern introduced by the noncoherent transmission scheme, the traditional approximate message passing (AMP) algorithm cannot achieve satisfactory performance. Therefore, we propose a deep learning (DL) modified AMP network (DL-mAMPnet) that enhances the detection performance by effectively exploiting the pilot activity correlation. The DL-mAMPnet is constructed by unfolding the AMP algorithm into a feedforward neural network, which combines the principled mathematical model of the AMP algorithm with the powerful learning capability, thereby benefiting from the advantages of both techniques. Trainable parameters are introduced in the DL-mAMPnet to approximate the correlated sparsity pattern and the large-scale fading coefficient. Moreover, a refinement module is designed to further advance the performance by utilizing the spatial feature caused by the correlated sparsity pattern. Simulation results demonstrate that the proposed DL-mAMPnet can significantly outperform traditional algorithms in terms of the symbol error rate performance. © 2023, CC BY-NC-SA.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

WaterTS: Integrating Enhanced Transformer, Sliding Block, and Channel Independence for Long-term Water Quality Prediction

WaterTS: Integrating Enhanced Transformer, Sliding Block, an...

引用

IEEE International Conference on automation science and Engineering (CASE)

作者： Jing Bi Lifeng Xu Ziqi Wang Haitao Yuan Shichao Chen Mu Gu MengChu Zhou Faculty of Information Technology Beijing University of Technology Beijing China School of Automation Science and Electrical Engineering Beihang University Beijing China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences and Beijing Huairou Academy of Parallel Sensing Beijing China Beijing Aerospace Smart Manufacturing Technology Development Co. Ltd Beijing China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

ISBN: (数字)9798350358513

ISBN: (纸本)9798350358520

Nowadays, the deterioration of water resources leads to negative ecological impacts. To effectively inhibit the deterioration of water resources, a water quality prediction model based on enhanced transformer, sliding block, and channel independence (WaterTS) is proposed by comprehensively analyzing the indicators of water resources and making long-term predictions of the dissolved oxygen index. WaterTS adopts a sliding block method to extract the short-term temporal features of the water quality series and combine them with channel independence to make independent predictions of multi-featured data. Moreover, it upgrades the internal encoder structure of the transformer and improves the attention mechanism to Probsparse-attention and Auto-Correlation to speed up the prediction speed. Furthermore, Post LayerNormal is adjusted to Pre LayerNormal, which makes the training gradient more stable and enhances the accuracy of predictions. Experiments are conducted using real-world water environment data, and comparison results with state-of-the-art prediction models show that the WaterTS achieves accurate predictions on both short-term and long-term water quality data.

关键词： Training Accuracy Biological system modeling Time series analysis Water quality Predictive models Transformers Feature extraction Real-time systems Water resources

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Weipeng Cao Xuyang Yao Zhiwu Xu Yinghui Pan Yixuan Sun Dachuan Li Bohua Qiu Muheng Wei Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model's capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods.

关键词： Visualization Adaptation models Semantics Zero shot learning Neural networks Termination of employment Transformers Market research Sun Optimization

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2023 Challenge on Efficient Super-Resolution: Methods and Results

NTIRE 2023 Challenge on Efficient Super-Resolution: Methods ...

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Li, Yawei Zhang, Yulun Timofte, Radu Van Gool, Luc Yu, Lei Li, Youwei Li, Xinpeng Jiang, Ting Wu, Qi Han, Mingyan Lin, Wenjie Jiang, Chengzhi Luo, Jinting Fan, Haoqiang Liu, Shuaicheng Wang, Yucong Cai, Minjie Li, Mingxi Zhang, Yuhang Fan, Xian-Jun Sheng, Yankai Mao, Yanyu Zhang, Nihao Wang, Qian Zheng, Mingjun Sun, Long Pan, Jinshan Dong, Jiangxin Tang, Jinhui Yang, Zhongbao Wang, Yan Pan, Erlin Cai, Qixuan Dai, Xinan Zhussip, Magauiya Kalyazin, Nikolay Vyal, Dmitry Zou, Xueyi Yan, Youliang Chung, Heaseo Zhang, Jin Yu, Gaocheng Zhang, Feng Wang, Hongbin Liao, Bohao Du, Zhibo Wu, Yu-Liang Shi, Gege Peng, Long Wang, Yang Cao, Yang Zha, Zhengjun Huang, Zhi-Kai Chen, Yi-Chung Chiang, Yuan-Chun Yang, Hao-Hsiang Chen, Wei-Ting Chang, Hua-En Chen, I-Hsiang Hsieh, Chia-Hsuan Kuo, Sy-Yen Liu, Xin Pan, Jiahao Yu, Hongyuan Yu, Weichen Ge, Lin Dong, Jiahua Zou, Yajun Wu, Zhuoyuan Han, Binnan Zhang, Xiaolin Zhang, Heng Yin, Xuanwu Zuo, Kunlong Deng, Weijian Yuan, Hongjie Lu, Zengtong Ouyang, Mingyu Ma, Wenzhuo Liu, Nian Zheng, Hanyou Zhang, Yuantong Zhang, Junxi Chen, Zhenzhong Gendy, Garas Sabor, Nabil Hou, Jingchao He, Guanghui Zhu, Yurui Wang, Xi Fu, Xueyang Zha, Zheng-Jun Yin, Daheng Liu, Mengyang Chen, Baijun Li, Ao Luo, Lei Jin, Kangjun Zhu, Ce Zhang, Xiaoming Xie, Chengxing Li, Linze Meng, Haiteng Zhang, Tianlin Li, Tianrui Zhao, Xiaole Zhang, Zhao Li, Baiang Zheng, Huan Zhao, Suiyi Gao, Yangcheng Ren, Jiahuan Hu, Kang Shi, Jingpeng Wu, Zhijian Huang, Dingjiang Zhu, Jinchen Li, Hui Xv, Qianru Liu, Tianle Weng, Shizhuang Wu, Gang Jiang, Junpeng Liu, Xianming Jiang, Junjun Zhang, Mingjian Hu, Jing Wu, Chengxu Fan, Qinrui Feng, Chengming Luo, Ziwei Hu, Shu Lyu, Siwei Wu, Xi Wang, Xin Computer Vision Lab ETH Zurich Switzerland Computer Vision Lab University of Würzburg Germany Megvii Technology China MicroBT China College of Computer Science and Electronic Engineering Hunan University China Attrsense Xian University of Posts and Telecommunications Xi'an China National Engineering Laboratory for Cyber Event Warning and Control Technologies China Nanjing University of Science and Technology China Nankai University China University of Electronic Science and Technology of China China Tianjin University China Noah's Ark Lab Huawei Technologies McMaster University Canada Espresomedia Korea Republic of AntGroup China University of Science and Technology of China China Department of Electrical Engineering National Taiwan University Taiwan Graduate Institute of Communication Engineering National Taiwan University Taiwan Graduate Institute of Electronics Engineering National Taiwan University Taiwan ServiceNow United States China Mobile Research Institute China Chongqing University of Technology China Multimedia Department Xiaomi Inc. China Institute of Automation Chinese Academy of Sciences China Shenyang Institute of Automation Chinese Academy of Sciences China School of Information and Communication Engineering Communication University of China China Smart Classroom Division Ruijie Networks Co. Ltd. China School of Remote Sensing and Information Engineering Wuhan University China Micro-Nano Electronics Department Shanghai Jiao Tong University Shanghai200240 China Electrical Engineering Department Faculty of Engineering Assiut University Assiut71516 Egypt Southeast University China University of Electronic Science and Technology of China Chengdu China Chongqing University of Posts and Telecommunications Chongqing China Information Technology Co. Ltd Hangzhou China Southwest Jiaotong University China National Space Science Center Chinese Academy of Science China Hefei University of Technology Hefei China Anhui University China Fried Ric

ISBN: (纸本)9798350302493

This paper reviews the NTIRE 2023 challenge on efficient single-image super-resolution with a focus on the proposed solutions and results. The aim of this challenge is to devise a network that reduces one or several aspects such as runtime, parameters, FLOPs, activations, memory footprint, and depth of RFDN while at least maintaining the PSNR of 29.00dB on DIV2K validation datasets. The challenge had 272 registered participants, and 35 teams made valid submissions. They gauge the state-of-the-art for efficient single-image super-resolution. © 2023 IEEE.

关键词： Optical resolving power

来源：评论

学校读者我要写书评

暂无评论

TemPrompt: Multi-Task Prompt Learning for Temporal Relation Extraction in RAG-based Crowdsourcing systems

arXiv

引用

arXiv 2024年

作者： Yang, Jing Zhao, Yu Yang, Linyao Wang, Xiao Chen, Long Wang, Fei-Yue Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China National Key Laboratory of Information Systems Engineering National University of Defense Technology Changsha410000 China Zhejiang Lab Hangzhou311121 China School of Artificial Intelligence Anhui University Hefei266114 China Department of Computer and Information Science University of Macau 999078 China Faculty of Innovation Engineering Macau University of Science and Technology 999078 China

Temporal relation extraction (TRE) aims to grasp the evolution of events or actions, and thus shape the workflow of associated tasks, so it holds promise in helping understand task requests initiated by requesters in crowdsourcing systems. However, existing methods still struggle with limited and unevenly distributed annotated data. Therefore, inspired by the abundant global knowledge stored within pre-trained language models (PLMs), we propose a multi-task prompt learning framework for TRE (TemPrompt), incorporating prompt tuning and contrastive learning to tackle these issues. To elicit more effective prompts for PLMs, we introduce a task-oriented prompt construction approach that thoroughly takes the myriad factors of TRE into consideration for automatic prompt generation. In addition, we design temporal event reasoning in the form of masked language modeling as auxiliary tasks to bolster the model’s focus on events and temporal cues. The experimental results demonstrate that TemPrompt outperforms all compared baselines across the majority of metrics under both standard and few-shot settings. A case study on designing and manufacturing printed circuit boards is provided to validate its effectiveness in crowdsourcing scenarios. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Timeliness of Status Update System: The Effect of Parallel Transmission Using Heterogeneous Updating Devices

arXiv

引用

arXiv 2024年

作者： Chen, Zhengchuan Lang, Kang Pappas, Nikolaos Yang, Howard H. Wang, Min Tian, Zhong Quek, Tony Q.S. School of Microelectronics and Communication Engineering Chongqing University Chongqing China Department of Computer and Information Science Linköping University Linköping581 83 Sweden Zhejiang University University of Illinois at Urbana-Champaign Institute Zhejiang University Haining314400 China School of Optoelectronics Engineering Chongqing University of Posts and Telecommunications Chongqing China Postdoctoral Research Center of Chongqing Key Laboratory of Optoelectronic Information Sensing and Transmission Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore

Timely status updating is the premise of emerging interaction-based applications in the Internet of Things (IoT). Using redundant devices to update the status of interest is a promising method to improve the timeliness of information. However, parallel status updating leads to out-of-order arrivals at the monitor, significantly challenging timeliness analysis. This work studies the Age of information (AoI) of a multi-queue status update system where multiple devices monitor the same physical process. Specifically, two systems are considered: the Basic System, which only has type-1 devices that are ad hoc devices located close to the source, and the Hybrid System, which contains additional type-2 devices that are infrastructure-based devices located in fixed points compared to the Basic System. Using the Stochastic Hybrid systems (SHS) framework, a mathematical model that combines discrete and continuous dynamics, we derive the expressions of the average AoI of the considered two systems in closed form. Numerical results verify the accuracy of the analysis. It is shown that when the number and parameters of the type-1 devices/type-2 devices are fixed, the logarithm of average AoI will linearly decrease with the logarithm of the total arrival rate of type-2 devices or that of the number of type-1 devices under specific condition. It has also been demonstrated that the proposed systems can significantly outperform the FCFS M/M/N status update system. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：