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

arXiv 2025年

作者： Ming, Yuhang Ma, Di Dai, Weichen Yang, Han Fan, Rui Zhang, Guofeng Kong, Wanzeng School of Computer Science Key Laboratory of Brain Machine Collaborative Intelligence of Zhejiang Province Hangzhou Dianzi University Hangzhou310018 China College of Electronics & Information Engineering Shanghai Institute of Intelligent Science and Technology Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China State Key Lab of CAD&CG Zhejiang University Hangzhou310058 China

Targeting the notorious cumulative drift errors in NeRF SLAM, we propose a Semantic-guided Loop Closure using Shared Latent Code, dubbed SLC2-SLAM. We argue that latent codes stored in many NeRF SLAM systems are not fully exploited, as they are only used for better reconstruction. In this paper, we propose a simple yet effective way to detect potential loops using the same latent codes as local features. To further improve the loop detection performance, we use the semantic information, which are also decoded from the same latent codes to guide the aggregation of local features. Finally, with the potential loops detected, we close them with a graph optimization followed by bundle adjustment to refine both the estimated poses and the reconstructed scene. To evaluate the performance of our SLC2-SLAM, we conduct extensive experiments on Replica and ScanNet datasets. Our proposed semantic-guided loop closure significantly outperforms the pre-trained NetVLAD and ORB combined with Bag-of-Words, which are used in all the other NeRF SLAM with loop closure. As a result, our SLC2-SLAM also demonstrated better tracking and reconstruction performance, especially in larger scenes with more loops, like ScanNet. Copyright © 2025, The Authors. All rights reserved.

关键词： SLAM robotics

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Can thermal nonreciprocity improve the radiative cooling efficiency?

arXiv

引用

arXiv 2024年

作者： Liu, Mengqi Jin, Shenghao Zhou, Chenglong Wang, Boxiang Zhao, Changying Qiu, Cheng-Wei Institute of Engineering Thermophysics MOE Key Laboratory for Power Machinery and Engineering School of Mechanical Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore School of Energy Science and Engineering Harbin Institute of Technology Harbin150001 China 2020 X-Lab Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai200050 China State Key Laboratory of Transducer Technology Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai200050 China School of Graduate Study University of Chinese Academy of Sciences Beijing100049 China

关键词： Radiative Cooling

来源：评论

学校读者我要写书评

暂无评论

LAVS: A LIGHTWEIGHT AUDIO-VISUAL SALIENCY PREDICTION MODEL

LAVS: A LIGHTWEIGHT AUDIO-VISUAL SALIENCY PREDICTION MODEL

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Zhu, Dandan Zhao, Defang Min, Xiongkuo Han, Tian Zhou, Qiangqiang Yu, Shaobo Chen, Yongqing Zhai, Guangtao Yang, Xiaokang MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University China School of Software Engineering Tongji University China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University China Department of Computer Science Stevens Institute of Technology United States School of Software Jiangxi Normal University China Information Technology Services East China Normal University China College of Information and Communication Hainan University China

ISBN: (纸本)9781665438643

Audio information is essential for guiding human attention and visual perception, which has been verified by many comprehensive psychological studies. However, the audio modality has been rather neglected in modeling visual attention, most of the current visual attention models heavily depend on visual information. Additionally, current existing high-performing visual attention models rely on deeper convolution neural networks (CNNs), benefiting from their extraordinary feature learning ability but incurring high computational cost. To this end, we propose a novel lightweight audio-visual saliency (LAVS) model to efficiently address the problem of fixation prediction in videos. To the best of our knowledge, our proposed model constitutes the first attempt to exploit a lightweight network and combines the visual and audio cues to perform saliency estimation in videos. Specifically, our proposed model consists of four modules, which are spatial-temporal visual saliency estimation module, audio features extraction module, source sound localization module, and audio-visual saliency fusion module. Extensive experiments across datasets validate the effectiveness and real-time performance of the proposed LAVS model, which outperforms the other state-of-the-art methods. © 2021 IEEE

关键词： Behavioral research

来源：评论

学校读者我要写书评

暂无评论

Research on Single Bottleneck Optimization Based on Intelligent Manufacturing Mode

Research on Single Bottleneck Optimization Based on Intellig...

引用

Control, Electronics and computer Technology (ICCECT), IEEE International Conference on

作者： Han Hu Jun Cao Guan Hui Wuhan Vocational College of Software and Engineering Wuhan China State Key Lab of Digital Manufacturing Equipment and Technology Hust-Sany Joint Lab of Advanced Manufacturing School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan China Wuhan Railway Vocation College of Technology Wuhan China College of Languages and Culture Northwest A&F University Xianyang China

More and more manufacturing companies are adopting a multi-variety, low-volume production model, and there are bottlenecks in the workshop due to the different demands on machine capacity for different products. The presence of the bottleneck in the workshop will severely limit the daily output of the workshop, reducing productivity and profits. In this paper, an improved Jaya algorithm based on problem characteristics is proposed to solve the single bottleneck optimization problem within intelligent manufacturing mode. Firstly, under the single bottleneck of intelligent manufacturing mode, the flexible factor of the manufacturing machine is considered, which effectively solves the problem of machine load distribution in the workshop. Secondly, based on the basic JAYA algorithm, a two-layer encoding mechanism and decoding mechanism based on problem characteristics are proposed, as well as the improvement of the similarity method. Finally, the effectiveness of the improved algorithm in this problem is demonstrated by comparing it with other algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resistance potential of soil bacterial communities along a biodiversity gradient in forest ecosystems

引用

mLife 2022年第4期1卷 399-411页

作者： Jialiang Kuang Dongmei Deng Shun Han Colin T.Bates Daliang Ning Wensheng Shu Jizhong Zhou The Key Lab of Pollution Control and Ecosystem Restoration in Industry Clusters Ministry of EducationSchool of Environment and EnergySouth China University of TechnologyGuangzhouChina Institute for Environmental Genomics and Department of Microbiology and Plant BiologyUniversity of OklahomaNormanOklahomaUSA State Key Laboratory of Biocontrol Guangdong Key Laboratory of Plant Resources and Conservation of Guangdong Higher Education InstitutesCollege of Ecology and EvolutionSun Yat-sen UniversityGuangzhouChina Guangxi Key Laboratory of Green Processing of Sugar Resources College of Biological and Chemical EngineeringGuangxi University of Science and TechnologyLiuzhouChina School of Life Sciences South China Normal UniversityGuangzhouChina School of Civil Engineering and Environmental Sciences University of OklahomaNormanOklahomaUSA School of Computer Sciences University of OklahomaNormanOklahomaUSA.8Earth and Environmental SciencesLawrence Berkeley National LaboratoryBerkeleyCaliforniaUSA.

Higher biodiversity is often assumed to be a more desirable scenario for maintaining the functioning of ecosystems,but whether species-richer communities are also more disturbance-tolerant remains *** this study,we investigated the bacterial communities based on 472 soil samples from 28 forests across China with associated edaphic and climatic *** developed two indexes(i.e.,community mean tolerance breadth[CMTB]and community mean response asynchrony[CMRA])to explore the relationship between diversity and community resistance ***,we examined this resistance potential along the climatic and latitudinal *** revealed that CMTB was significantly and negatively related to species richness,resulting from the changes in balance between relative abundances of putative specialists and *** comparison,we found a unimodal relationship between CMRA and richness,suggesting that higher biodiversity might not always lead to higher community ***,our results showed differential local patterns along *** particular,local patterns in the northern region mainly followed general relationships rather than those for the southern forests,which may be attributed to the differences in annual means and annual variations of climate *** findings highlight that the community resistance potential depends on the composition of diverse species with differential environmental tolerance and *** study provides a new,testable evaluation by considering tolerance breadth and response asynchrony at the community level,which will be helpful in assessing the influence of disturbance under rapid shifts in biodiversity and species composition as a result of global environmental change.

关键词： ecological resistance forest soil bacterial community latitudinal gradient specialist–generalist balance species richness

来源：评论

学校读者我要写书评

暂无评论

Constrained maximum weighted bipartite matching:a novel approach to radio broadcast scheduling

引用

Science China(Information Sciences) 2019年第7期62卷 156-169页

作者： Shaojiang WANG Tianyong WU Yuan YAO Dongbo BU Shaowei CAI State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences Beijing Key Lab of Human-Computer Interaction Institute of SoftwareChinese Academy of Sciences Institute of Computing Technology Chinese Academy of Sciences

Given a set of radio broadcast programs, the radio broadcast scheduling problem is to allocate a set of devices to transmit the programs to achieve the optimal sound quality. In this article, we propose a complete algorithm to solve the problem, which is based on a branch-and-bound(BnB) algorithm. We formulate the problem with a new model, called constrained maximum weighted bipartite matching(CMBM),i.e., the maximum matching problem on a weighted bipartite graph with constraints. For the reduced matching problem, we propose a novel BnB algorithm by introducing three new strategies, including the highest quality first, the least conflict first and the more edge first. We also establish an upper bound estimating function for pruning the search space of the algorithm. The experimental results show that our new algorithm can quickly find the optimal solution for the radio broadcast scheduling problem at small scales, and has higher scalability for the problems at large scales than the existing complete algorithm.

关键词： radio broadcast scheduling branch-and-bound algorithm constrained maximum weighted bipartite matching Kuhn-Munkres algorithm strategy combinations

来源：评论

学校读者我要写书评

暂无评论

Digital Twin Aided Predictive Scheduling and Bandwidth Allocation for Multi-Vehicle Cooperative Perception Systems

Digital Twin Aided Predictive Scheduling and Bandwidth Alloc...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Binbin Lu Xumin Huang Yuan Wu Liping Qian Dusit Niyato Tony Q. S. Quek Cheng-Zhong Xu State Key Lab of Internet of Things for Smart City Macau China School of Automation Guangdong University of Technology Guangzhou China Zhuhai- UM Science and Technology Research Institute Zhuhai China College of Information Engineering Zhejiang University of Technology Hangzhou China School of Computer Science and Engineering Nangyang Technological University Singapore Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

As an emerging technology, Digital Twin (DT) can provide a virtual presentation of the physical Intelligent Trans-portation Systems (ITS) to enhance the applications of ITS such as cooperation perception. In cooperative perception, accurate location is crucial for selecting proper cooperative vehicles (CoVs) to improve the perception performance. However, due to the high mobility of vehicles, the deviation between DT and physical world may lead to non-negligible location errors, which raises the challenges for achieving efficient CoV selection in cooperative perception. In this paper, we propose a DT-empowered multi-vehicle cooperative perception system, in which the CoV selection and bandwidth allocation are jointly optimized to improve the performance of cooperative perception. Specifically, an asyn-chronous federated learning scheme is deployed in DT for location prediction to mitigate the effect of the deviation. Based on the prediction results, the problem of joint predictive scheduling and bandwidth allocation is then formulated as the average delay minimization problem while reaching the required performances. The adaptive CoV selection and bandwidth allocation algorithm based on deep reinforcement learning is proposed to find the optimal scheduling strategy. Simulation results demonstrate that the proposed algorithm achieves the lowest average delay while effectively guaranteeing the performance requirement.

关键词： Vehicular and wireless technologies Federated learning Simulation Optimal scheduling Channel allocation Prediction algorithms Minimization

来源：评论

学校读者我要写书评

暂无评论

Devils in the Clouds: An Evolutionary Study of Telnet Bot Loaders

Devils in the Clouds: An Evolutionary Study of Telnet Bot Lo...

引用

IEEE International Conference on Communications (ICC)

作者： Yuhui Zhu Zhenxiang Chen Qiben Yan Shanshan Wang Alberto Giaretta Enlong Li Lizhi Peng Chuan Zhao Mauro Conti Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan China School of Information Science and Engineering University of Jinan China Department of Computer Science and Engineering Michigan State University USA AASS MPI Lab Örebro University Sweden Department of Mathematics University of Padua Italy

One of the innovations brought by Mirai and its derived malware is the adoption of self-contained loaders for infecting IoT devices and recruiting them in botnets. Functionally decoupled from other botnet components and not embedded in the payload, loaders cannot be analysed using conventional approaches that rely on honeypots for capturing samples. Different approaches are necessary for studying the loaders evolution and defining a genealogy. To address the insufficient knowledge about loaders' lineage in existing studies, in this paper, we propose a semantic-aware method to measure, categorize, and compare different loader servers, with the goal of highlighting their evolution, independent from the payload evolution. Leveraging behavior-based metrics, we cluster the discovered loaders and define eight families to determine the genealogy and draw a homology map. Our study shows that the source code of Mirai is evolving and spawning new botnets with new capabilities, both on the client side and the server side. In turn, shedding light on the infection loaders can help the cybersecurity community to improve detection and prevention tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Microelectronic System of Antagonism Inhibiting Spasticity Based on Electro-Myo-Graphic Bridge

Research on Microelectronic System of Antagonism Inhibiting ...

引用

International Conference on Integrated Circuits and Microsystems (ICICM)

作者： Peng-Yu Lou Yun-Hua Feng Yun-Long Wang Xiao-Ying Lü Zhi-Gong Wang College of Computer and Information Hohai University Nanjing China School of Software Pingdingshan University Pingdingshan China State Key Lab of Bioelectronics Southeast University Nanjing China Institute of RF-& OE-ICs Southeast University Nanjing China

ISBN: (纸本)9781665460583

In this paper, based on the principle of stimulating antagonistic muscles, functional electrical stimulation (FES) is used to achieve the purpose of spasticity suppression. The microelectronic system for spasticity suppression was designed and studied, and then used to simulated spasticity of healthy people. First, based on the characteristics of spastic EMG signals, obtained by the EMG signal detection system of the research group, a detection module was designed to detect EMG signals of voluntary movement, simulated EMG signals of spastic patients. Furthermore, an adaptive pattern recognition algorithm for spasticity was designed to identify spasticity signals from the detected EMG signals. Then, on basis of the functional electrical stimulation core circuit of the research group, a microelectronic FES system based on the myoelectric bridge was designed. Finally, the functional verification experiment of the FES system to stimulate antagonist muscle to inhibit spasm was carried out, The results show that the system is effective for stimulating the wrist extensor muscle as an antagonist muscle to inhibit spasm.

关键词： Wrist Micromechanical devices Bridge circuits Muscles Electromyography Iron Microelectronics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：