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

engineering 2024年第12期 89-98页

作者：王光炜刘雪明肖颖袁烨潘林强管晓宏高建喜张海涛 The MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems State Key Laboratory of Digital Manufacturing Equipment and Technology School of Artificial Intelligence and Automation Huazhong University of Science and Technology Guangdong HUST Industrial Technology Research Institute Huazhong University of Science and Technology Guangdong Provincial Engineering Technology Center of Autonomous Unmanned Vessels MOE Key Laboratory of Intelligent Networks and Network Security&State Key Laboratory of Manufacturing Systems Xi'an Jiaotong University Tsinghua National Laboratory of Information Science and Technology Department of Automation Tsinghua University Department of Computer Science Rensselaer Polytechnic Institute

Ecosystems are undergoing unprecedented persistent deterioration due to unsustainable anthropogenic human activities, such as overfishing and deforestation, and the effects of such damage on ecological stability are uncertain. Despite recent advances in experimental and theoretical studies on regime shifts and tipping points, theoretical tools for understanding the extinction chain, which is the sequence of species extinctions resulting from overexploitation, are still lacking, especially for large-scale nonlinear networked systems. In this study, we developed a mathematical tool to predict regime shifts and extinction chains in ecosystems under multiple exploitation situations and verified it in 26 real-world mutualistic networks of various sizes and densities. We discovered five phases during the exploitation process: safe,partial extinction, bistable, tristable, and collapse, which enabled the optimal design of restoration strategies for degraded or collapsed systems. We validated our approach using a 20-year dataset from an eelgrass restoration project. Counterintuitively, we also found a specific region in the diagram spanning exploitation rates and competition intensities, where exploiting more species helps increase *** computational tool provides insights into harvesting, fishing, exploitation, or deforestation plans while conserving or restoring the biodiversity of mutualistic ecosystems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

反向连边在大型分层网络中的影响（英文）

引用

engineering 2024年第5期 240-249页

作者：曹浩森胡斌斌莫小雨陈都鑫高建喜袁烨陈关荣 Tamás Vicsek 管晓宏张海涛 MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems State Key Laboratory of Intelligent Manufacturing Equipment and Technology School of Artificial Intelligence and Automation Huazhong University of Science and Technology School of Mechanical and Aerospace Engineering Nanyang Technological University Jiangsu Key Laboratory of Networked Collective Intelligence School of Mathematics Southeast University Department of Computer Science Rensselaer Polytechnic Institute Department of Electronic Engineering City University of Hong Kong Department of Biological Physics E?tv?s University MOE Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi'an Jiaotong University

Hierarchical networks are frequently encountered in animal groups, gene networks, and artificial engineering systems such as multiple robots, unmanned vehicle systems, smart grids, wind farm networks,and so forth. The structure of a large directed hierarchical network is often strongly influenced by reverse edges from lower-to higher-level nodes, such as lagging birds' howl in a flock or the opinions of lowerlevel individuals feeding back to higher-level ones in a social group. This study reveals that, for most large-scale real hierarchical networks, the majority of the reverse edges do not affect the synchronization process of the entire network; the synchronization process is influenced only by a small part of these reverse edges along specific paths. More surprisingly, a single effective reverse edge can slow down the synchronization of a huge hierarchical network by over 60%. The effect of such edges depends not on the network size but only on the average in-degree of the involved subnetwork. The overwhelming majority of active reverse edges turn out to have some kind of ‘‘bunchingo effect on the information flows of hierarchical networks, which slows down synchronization processes. This finding refines the current understanding of the role of reverse edges in many natural, social, and engineering hierarchical networks,which might be beneficial for precisely tuning the synchronization rhythms of these networks. Our study also proposes an effective way to attack a hierarchical network by adding a malicious reverse edge to it and provides some guidance for protecting a network by screening out the specific small proportion of vulnerable nodes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RIDE: Redensification-based intrinsic density estimation for knowledge graphs

引用

Pattern Recognition 2026年 169卷

作者： Wei-Kun Kong Yiping Duan Xiaoming Tao Yueran Zu Department of Electronic Engineering Tsinghua University Haidian Beijing 100084 China State Key Laboratory of Space Network & Communications Haidian Beijing 100084 China Beijing National Research Center for Information Science and Technology (BNRist) Haidian Beijing 100084 China School of Computer Science and Technology Xinjiang University Tianshan Urumqi 830046 China

The rapid advancement of knowledge graphs has facilitated their widespread application across diverse tasks. However, the prohibitive costs associated with constructing knowledge graphs have resulted in pervasive incomplete issues, significantly constraining their overall utility and effectiveness. While considerable efforts have been made to enhance the completeness of knowledge graphs, there remains a lack of a universal quantitative framework for evaluating knowledge graph completeness. This study first delineates two primary sources of incompleteness in knowledge graphs. To measure the incompleteness arising from the insufficiency of facts, the concept of intrinsic density is introduced, which is defined as the completeness of the pattern encapsulated within the existing data of a knowledge graph. To operationalize this concept, we propose RIDE , a novel method that quantitatively measures intrinsic density by assessing a knowledge graph’s ability to regenerate missing facts based on the patterns embedded in its existing data. To the best of our knowledge, this is the first practical and general approach for quantitatively evaluating the completeness of knowledge graphs from an intrinsic perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v3: A Multiple-Backend Framework for Machine Learning Potentials

arXiv

引用

arXiv 2025年

作者： Zeng, Jinzhe Zhang, Duo Peng, Anyang Zhang, Xiangyu He, Sensen Wang, Yan Liu, Xinzijian Bi, Hangrui Li, Yifan Cai, Chun Zhang, Chengqian Du, Yiming Zhu, Jia-Xin Mo, Pinghui Huang, Zhengtao Zeng, Qiyu Shi, Shaochen Qin, Xuejian Yu, Zhaoxi Luo, Chenxing Ding, Ye Liu, Yun-Pei Shi, Ruosong Wang, Zhenyu Bore, Sigbjørn Løland Chang, Junhan Deng, Zhe Ding, Zhaohan Han, Siyuan Jiang, Wanrun Ke, Guolin Liu, Zhaoqing Lu, Denghui Muraoka, Koki Oliaei, Hananeh Singh, Anurag Kumar Que, Haohui Xu, Weihong Xu, Zhangmancang Zhuang, Yong-Bin Dai, Jiayu Giese, Timothy J. Jia, Weile Xu, Ben York, Darrin M. Zhang, Linfeng Wang, Han School of Artificial Intelligence and Data Science Unversity of Science and Technology of China Hefei China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China Department of Computer Science University of Toronto TorontoON Canada Department of Chemistry Princeton University PrincetonNJ08540 United States University of Chinese Academy of Sciences Beijing100871 China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEM College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China College of Integrated Circuits Hunan University Changsha410082 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Center for Smart Materials and Device Integration School of Material Science and Engineering Wuhan University of Technology Wuhan430070 China College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Extreme Matter and Applications National University of Defense Technology Changsha410073 China ByteDance Research Beijing100098 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Theoretical and Computational Photochemistry of Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Geosciences Princeton University PrincetonNJ08544 United States Department of Applied Physics and Applied Mathematics Columbia University New YorkNY10027 United States IKKEM Fujian Xiamen361005 China Graduate

In recent years, machine learning potentials (MLPs) have become indispensable tools in physics, chemistry, and materials science, driving the development of software packages for molecular dynamics (MD) simulations and related applications. These packages, typically built on specific machine learning frameworks such as TensorFlow, PyTorch, or JAX, face integration challenges when advanced applications demand communication across different frameworks. The previous TensorFlow-based implementation of DeePMD-kit exemplified these limitations. In this work, we introduce DeePMD-kit version 3, a significant update featuring a multi-backend framework that supports TensorFlow, PyTorch, JAX, and PaddlePaddle backends, and demonstrate the versatility of this architecture through the integration of other MLPs packages and of Differentiable Molecular Force Field. This architecture allows seamless backend switching with minimal modifications, enabling users and developers to integrate DeePMD-kit with other packages using different machine learning frameworks. This innovation facilitates the development of more complex and interoperable workflows, paving the way for broader applications of MLPs in scientific research. Copyright © 2025, The Authors. All rights reserved.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Energy Loss Estimation Based Reference-Free Quality Assessment of DIBR-Synthesized Views

Energy Loss Estimation Based Reference-Free Quality Assessme...

引用

第三十九届中国控制会议

作者： Huiqing Zhang Donghao Li Zhifang Xia Zichen Wang Guangchen Wang Faculty of Information Technology Beijing University of Technology Key Laboratory of Artificial Intelligence Ministry of Education Engineering Research Center of Digital Community Ministry of Education State Information Center National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University

The processes of warping and rendering in Depth Image-Based Rendering（DIBR） are usually performed without a reference image. Thus, an effective and fast reference-free（RF） image quality assessment（IQA） model devised for DIBRsynthesized views is more favorable. To this aim, this research propose a novel RF IQA method of DIBR-synthesized views based on Energy Loss Estimation. Firstly, considering that the geometric distortions caused by the processes of warping and rendering might increase the high-frequency（HF） information of a DIBR-synthesized view, the influence of the geometric distortion on the visual quality of a synthesized view can be effectively evaluated by estimating the HF information energies of a given DIBRsynthesized view in the log-gabor domain. Secondly, we estimate the energy loss in the process of JPEG compression as the image complexity, which is used to overcome the problem of different amounts of HF information contained in different content images. Finally, the proposed RF DIBR-synthesized IQA metric is obtained by using the energy loss in JPEG compression to normalize the HF information energy in the log-gabor domain. Experiments conducted on two public datasets demonstrate that the proposed method is advantageous over the relevant state-of-the-art RF IQA metrics.

关键词： Energy Loss Estimation Depth Image-Based Rendering Image Quality Assessment Reference-Free

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable Intelligence Surface Assisted Opportunistic Multiple Access in UAV-IoT networks

引用

IEEE Internet of Things Journal 2025年

作者： Zhang, Xi-Ran Sun, Wen-Bin Zhang, Zhaolin Wang, Ling Gao, Ang Cheng, Nan Meng, Wei-Xiao Leung, Victor C. M. Northwestern Polytechnical University School of Electronics And Information Xi'an China Xidian University State Key Laboratory of ISN Xi'an710071 China Xidian University School of Cyber Engineering Xi'an710071 China Harbin Institute of Technology Communication Research Center Harbin150001 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T1Z4 Canada

Due to the advantages of flexible deployment and strong environmental adaptability of an unmanned aerial vehicle (UAV), UAVs serve as aerial base stations (BSs) to meet Quality of Services (QoSs) of ground users in internet of things (IoT) networks. NOMA (Non-Orthogonal Multiple Access) is a potential technique in wireless communications area, which can significantly improve sum spectrum efficiency (SE) of systems. To avoid the limitation of perfect CSI, opportunistic beamforming (OBF) is proposed, where a set of randomly generated weights is used to preprocess transmitted signals. Due to multiuser diversity gain introduced by OBF, OBF-NOMA systems can achieve approximate sum SE to conventional NOMA systems. Additionally, reconfigurable intelligent surfaces (RISs) are involved to overcome obstruction and obtain further improvements of SE. Therefore, this paper proposes a RIS-aid OBF-NOMA system in UAV-IoT networks, where random weights and opportunistic phase matrix are respectively applied in a UAV and RIS. Statistical characteristics of equivalent channels are derived in Nakagami-m (m≥1) fading channels. Theoretical asymptotic analyses of SE and bit error rate (BER) are then presented. Furthermore, a non-convex optimization problem is formulated to maximize SE. To obtain the optimal solution, we divide the problem into two sub-optimization problems and apply a joint iterative algorithm. Numerical results show that the proposed method achieves a satisfactory SE without complex channel estimation and perfect CSI. © 2014 IEEE.

关键词： Micro air vehicle (MAV)

来源：评论

学校读者我要写书评

暂无评论

Identity-aware attribute recognition via real-time distributed inference in mobile edge clouds

arXiv

引用

arXiv 2020年

作者： Xu, Zichuan Zhou, Pan Wu, Jiangkai Ren, Jiankang Xia, Qiufen Liang, Huizhi Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China School of Software Dalian University of Technology Dalian China School of Computer Science Dalian University of Technology Dalian China Key Laboratory for Ubiquitous Network Service Software of Liaoning Province International School of Information Science and Engineering Dalian University of Technology Dalian China Department of Computer Science University of Reading Reading United Kingdom

With the development of deep learning technologies, attribute recognition and person re-identification (re-ID) have attracted extensive attention and achieved continuous improvement via executing computing-intensive deep neural networks in cloud datacenters. However, the datacenter deployment cannot meet the real-time requirement of attribute recognition and person re-ID, due to the prohibitive delay of backhaul networks and large data transmissions from cameras to datacenters. A feasible solution thus is to employ mobile edge clouds (MEC) within the proximity of cameras and enable distributed inference. In this paper, we design novel models for pedestrian attribute recognition with re-ID in an MEC-enabled camera monitoring system. We also investigate the problem of distributed inference in the MEC-enabled camera network. To this end, we first propose a novel inference framework with a set of distributed modules, by jointly considering the attribute recognition and person re-ID. We then devise a learning-based algorithm for the distributions of the modules of the proposed distributed inference framework, considering the dynamic MEC-enabled camera network with uncertainties. We finally evaluate the performance of the proposed algorithm by Copyright © 2020, The Authors. All rights reserved.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Incorporating Surprisingly Popular Algorithm and Euclidean Distance-based Adaptive Topology into PSO

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Han, Jizong Wang, Di Gao, Pengyue Cui, Quanlong Chen, Liang Liang, Yanchun Huang, Han Lee, Heow Pueh Miao, Chunyan Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore State Key Laboratory of Superhard Materials International Center for Computational Method and Software College of Physics Jilin University Changchun130012 China Commercial Quality and Efficiency Department Baidu Inc Beijing100085 China Department of Computer Science Shantou University Shantou515063 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China School of Software Engineering The South China University of Technology Guangzhou510641 China Department of Mechanical Engineering National University of Singapore 117575 Singapore School of Computer Science and Engineering Nanyang Technological University 639798 Singapore College of Software Jilin University Changchun130012 China

While many Particle Swarm Optimization (PSO) algorithms only use fitness to assess the performance of particles, in this work, we adopt Surprisingly Popular Algorithm (SPA) as a complementary metric in addition to fitness. Consequently, particles that are not widely known also have the opportunity to be selected as the learning exemplars. In addition, we propose a Euclidean distance-based adaptive topology to cooperate with SPA, where each particle only connects to k number of particles with the shortest Euclidean distance during each iteration. We also introduce the adaptive topology into heterogeneous populations to better solve large-scale problems. Specifically, the exploration sub-population better preserves the diversity of the population while the exploitation sub-population achieves fast convergence. Therefore, large-scale problems can be solved in a collaborative manner to elevate the overall performance. To evaluate the performance of our method, we conduct extensive experiments on various optimization problems, including three benchmark suites and two real-world optimization problems. The results demonstrate that our Euclidean distance-based adaptive topology outperforms the other widely adopted topologies and further suggest that our method performs significantly better than state-of-the-art PSO variants on small, medium, and large-scale problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

Synchronous Motion Generation of Multiple Continuum Robots Based on a Jacobian-Estimation Strategy

Synchronous Motion Generation of Multiple Continuum Robots B...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Ning Tan Ruikun Hu Yuyang Wu Xinyu Zhang Fenglei Ni Zhenglong Sun School of Computer Science and Engineering Sun Yat-sen University Guangzhou PR China State Key Laboratory of Robotics and Systems (HIT) Harbin PR China Engineering Research Center of Software/Hardware Co-Design Technology and Application Ministry of Education (East China Normal University) Shanghai PR China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9781665405362

In this paper, a novel model-free control scheme is proposed for synchronous motion control of multiple continuum robots. The control problem is formulated as two convex optimization routines in an adaptive and model-free closed-loop framework. The proposed approach is heading to address cooperative task execution for multiple continuum robots. The model-free feedback control guarantees the high portability for a wide range of continuum robots. Simulation studies are conducted on two kinds of tasks, which are cooperative task execution with two robots and simultaneously tracking control with three robots. Besides, the superiority of proposed approach is validated through comparisons with other methods. Simulation results prove the high accuracy and efficiency of this model-free feedback control scheme.

关键词： Jacobian matrices Adaptation models Tracking Simulation Conferences Convex functions Feedback control

来源：评论

学校读者我要写书评

暂无评论

Online Variant of Parcel Allocation in Last-Mile Delivery

Online Variant of Parcel Allocation in Last-Mile Delivery

引用

International Conference on Measuring Technology and Mechatronics Automation, ICMTMA

作者： Yuan Liang Changmei Mao Xiuguo Bao State Key Laboratory of Software Development Environment School of Computer Science Beihang University Beijing China School of Information Management and Engineering Shanghai University of Finance and Economics Shanghai China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing China

ISBN: (数字)9781728170817

ISBN: (纸本)9781728170824

We investigate the problem of last-mile delivery, where a large amount of crowd-workers have performed a great quantity of location-specific urban logistics parcels. Current existing approaches mainly focus on offline scenarios, where all the spatial-temporal information of parcels and workers are given. However, the offline scenarios can be impractical since parcels and workers appear dynamically in reality, and the information of workers is unknown in advance. In this paper, we study the problem of last-mile delivery on online scenarios to resolve the shortcomings of the offline setting. We first formalize the online parcel allocation in last-mile delivery problem, where all parcels were put in pop-stations in advance, and workers arrive dynamically. Then we propose a baseline algorithm with no competitive ratio, and an algorithm providing theoretical guarantee for the parcel allocation in last-mile delivery. Finally, we verify the effectiveness and efficiency of proposed algorithms through extensive experiments on real and synthetic datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：