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

In situ resource utilization of lunar soil for highly efficient extraterrestrial fuel and oxygen supply

National science Review 2023年第2期10卷 224-231页

作者： Yuan Zhong Jingxiang Low Qing Zhu Yawen Jiang Xiwen Yu Xinyu Wang Fei Zhang Weiwei Shang Ran Long Yingfang Yao Wei Yao Jun Jiang Yi Luo Weihua Wang Jinlong Yang Zhigang Zou Yujie Xiong Hefei National Research Center for Physical Sciences at the Microscale School of Chemistry and Materials Science National Synchrotron Radiation Laboratory School of Information Science and TechnologyUniversity of Science and Technology of China Eco-Materials and Renewable Energy Research Center (ERERC) Jiangsu Key Laboratory for Nano Technology National Laboratory of Solid State MicrostructuresSchool of PhysicsCollaborative Innovation Center of Advanced MicrostructuresCollege of Engineering and Applied SciencesNanjing University Qian Xuesen Laboratory of Space Technology China Academy of Space Technology

Building up a lunar settlement is the ultimate aim of lunar ***, limited fuel and oxygen supplies restrict human survival on the ***,we demonstrate the in situ resource utilization of lunar soil for extraterrestrial fuel and oxygen production,which may power up our solely natural satellite and supply respiratory ***,the lunar soil is loaded with Cu species and employed for electro catalytic CO2conversion,demonstrating significant production of *** addition,the selected component in lunar soil（***3） loaded with Cu can reach a CH4F aradaic efficiency of 72.05% with a CH4production rate of 0.8 mL/min at 600 mA/***,an O2production rate of 2.3 mL/min can be ***,we demonstrate that our developed process starting from catalyst preparation to electrocatalytic CO2conversion is so accessible that it can be operated in an unmmaned manner via a robotic *** a highly efficient extraterrestrial fuel and oxygen production system is expected to push forward the development of mankind's civilization toward an extraterrestrial settlement.

关键词： Chang’E-5 lunar soil fuel production CO2 conversion extraterrestrial settlement in situ resource utilization

来源：评论

学校读者我要写书评

暂无评论

Tackling Real-world Complexity: Hierarchical Modeling and Dynamic Prompting for Multimodal Long Document Classification

引用

IEEE Transactions on Circuits and systems for Video technology 2025年第6期35卷 5776-5790页

作者： Liu, Tengfei Hu, Yongli Li, Mingjie Yi, Junfei Chang, Xiaojun Gao, Junbin Yin, Baocai Beijing University of Technology Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing Institute of Artificial Intelligence School of Information Science and Technology Beijing100124 China Stanford University Department of Radiation Oncology StanfordCA94305 United States Hunan University National Engineering Laboratory of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha410082 China University of Technology Sydney ReLER Laboratory Australian Artificial Intelligence Institute Faculty of Engineering and Information Technology UltimoNSW2007 Australia The University of Sydney Business School The University of Sydney Discipline of Business Analytics CamperdownNSW2006 Australia

With the rapid growth of internet content, multimodal long document data has become increasingly prominent, drawing significant attention from researchers. However, most existing methods primarily focus on scenarios where all modalities are present, often overlooking more challenging and realistic cases involving missing image modality. To address this limitation, we propose a robust multimodal long document classification (MLDC) framework that integrates hierarchical modeling and dynamic prompting to handle complex multimodal long document data. Our approach begins by leveraging hierarchical modeling combined with an Adaptive Correlation Multimodal Transformer (ACMT) to effectively capture relationships between text and images at both section and sentence levels. We also introduce a Dynamic Prompt Generation (DPG) module at both levels to enhance the model's robustness in handling missing image data. By evaluating sample uncertainty, the DPG module dynamically adjusts both the number of prompts and the prompts themselves, allowing the model to better adapt to the varying needs of different samples. Finally, a Hierarchical Heterogeneous Graph (HHG) is introduced to enhance feature interactions across levels, further improving the coherence and accuracy of the model. Extensive experiments on four multi-modal long document datasets demonstrate that our model shows superior performance compared to existing state-of-the-art MLDC classification methods in various conditions. © 1991-2012 IEEE.

关键词： Adaptation models Transformers Data models Correlation Circuits and systems Electronic mail Robustness Uncertainty Training Complexity theory

来源：评论

学校读者我要写书评

暂无评论

MULTI-ROBOT PATH PLANNING AND COOPERATIVE OBSTACLE AVOIDANCE BASED ON MONTE-CARLO TREE SEARCH 10

MULTI-ROBOT PATH PLANNING AND COOPERATIVE OBSTACLE AVOIDANCE...

引用

10th International Symposium on Test Automation and Instrumentation, ISTAI 2024

作者： Dai, Juan Jing, Yanzhang Su, Zhong Zhu, Cui Beijing Key Laboratory of High Dynamic Navigation Technology Beijing Information Science & Technology University Beijing China Key Laboratory of Modern Measurement and Control Technology Ministry of Education Beijing China School of Automation Beijing Information Science & Technology University Beijing China School of Information and Communication Engineering Beijing Information Science & Technology University Beijing China

ISBN: (纸本)9781837242672

With the rapid development of artificial intelligence technologies, multi-robot cooperative processing tasks are becoming more and more common in various applications. However, traditional single-robot planning algorithms show obvious limitations in dealing with complex social interactions and dynamic environments in the real world. To address this challenge, this paper applies Monte Carlo Tree Search (MCTS) to multi-robot path planning and proposes a collaborative obstacle avoidance motion planning algorithm based on MCTS. Specifically, the algorithm prunes the Monte Carlo tree by excluding cases that do not meet the robot speed constraints and potential collisions, which significantly improves the computational speed and success rate of the algorithm, making it applicable to the multi-robot path conflict problem. In addition, we design a policy space that conforms to the robot's operation and a cost function that meets the requirements of robot path planning to plan an efficient cooperative path for each robot. Through a series of simulation experiments, we demonstrate the algorithm's path planning and obstacle avoidance performance in a variety of conflict scenarios. The results show that the method is highly cooperative and effective in complex environments. © The Institution of engineering & technology 2024.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Sparsity-based efficient simulation of cluster targets electromagnetic scattering

引用

Journal of systems engineering and Electronics 2023年第2期34卷 299-306页

作者： TIAN Yuguang LIU Yixin CHEN Xuan CHEN Penghui WANG Jun CHEN Junwen Communication University of China Beijing 100024China School of Electronic and Information Engineering Beihang UniversityBeijing 100191China Science and Technology on Electromagnetic Scattering Laboratory Beijing 100854China

An efficient and real-time simulation method is proposed for the dynamic electromagnetic characteristics of cluster targets to meet the requirements of engineering practical ***,the coordinate transformation method is used to establish a geometric model of the observation scene,which is described by the azimuth angles and elevation angles of the radar in the target reference frame and the attitude angles of the target in the radar reference ***,an approach for dynamic electromagnetic scattering simulation is ***,a fast-computing method based on sparsity in the time domain,space domain,and frequency domain is *** method analyzes the sparsity-based dynamic scattering characteristic of the typical cluster *** error between the sparsity-based method and the benchmark is small,proving the effectiveness of the proposed method.

关键词： geometric model of the observation scene dynamic electromagnetic scattering simulation sparsity-based method

来源：评论

学校读者我要写书评

暂无评论

Grape Leaf Disease Detection and Recognition Method Based on Improved Model RTDETR-DRA 4

Grape Leaf Disease Detection and Recognition Method Based on...

引用

4th International Conference on Electronic information engineering and Computer technology, EIECT 2024

作者： Chen, Zhiyuan Yang, Yanhua School of Information Science & Engineering Yunnan University Yunnan China School of Information Science & Engineering University Key Laboratory of Internet of Things Technology and Application Yunnan University Yunnan China

ISBN: (纸本)9798331528850

In recent years, the rapid development of artificial intelligence has revolutionized agriculture, particularly in the detection and identification of plant diseases. Grape leaf diseases pose a significant threat to grape production, directly impacting yield and quality. To address the limitations of existing disease detection models, such as high computational cost and inefficient deployment on resource-limited devices, we propose an improved model based on RTDETR, named RTDETR-DRA. This model integrates the DRBNCSPELAN module, leveraging multi-path feature fusion and channel split design to optimize real-time detection accuracy while minimizing computational cost. Experimental results show that RTDETR-DRA outperforms the original RTDETR model, achieving higher accuracy in disease detection with significantly reduced parameters and GFLOPs, making it suitable for lightweight deployment on platforms like mobile devices. Our proposed method contributes to the advancement of efficient and precise plant disease detection technologies. © 2024 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Detection of Perfect Stealthy Attacks on Cyber-Physical systems Subject to Measurement Quantizations: A Watermark-Based Strategy

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 114-125页

作者： Yu-Ang Wang Zidong Wang Lei Zou Bo Shen Hongli Dong the College of Information Science and Technology Donghua University the Engineering Research Center of Digitalized Textile and Fashion Technology Ministry of Education IEEE the College of Electrical Engineering and Automation Shandong University of Science and Technology the Department of Computer Science Brunel University London Uxbridge the Sanya Offshore Oil and Gas Research Institute Northeast Petroleum University the Artificial Intelligence Energy Research Institute Northeast Petroleum University Heilongjiang Provincial Key Laboratory of Networking and Intelligent Control Northeast Petroleum University

In this paper, the attack detection problem is investigated for a class of closed-loop systems subjected to unknownbutbounded noises in the presence of stealthy attacks. The measurement outputs from the sensors are quantized before transmission.A specific type of perfect stealthy attack, which meets certain rather stringent conditions, is taken into account. Such attacks could be injected by adversaries into both the sensor-toestimator and controller-to-actuator channels, with the aim of disrupting the normal data flow. For the purpose of defending against these perfect stealthy attacks, a novel scheme based on watermarks is developed. This scheme includes the injection of watermarks(applied to data prior to quantization) and the recovery of data(implemented before the data reaches the estimator).The watermark-based scheme is designed to be both timevarying and hidden from adversaries through incorporating a time-varying and bounded watermark signal. Subsequently, a watermark-based attack detection strategy is proposed which thoroughly considers the characteristics of perfect stealthy attacks,thereby ensuring that an alarm is activated upon the occurrence of such attacks. An example is provided to demonstrate the efficacy of the proposed mechanism for detecting attacks.

关键词： Attack detection cyber-physical systems (CPSs) perfect stealthy attacks watermark-based strategy

来源：评论

学校读者我要写书评

暂无评论

Optimisation of sparse deep autoencoders for dynamic network embedding

引用

CAAI Transactions on Intelligence technology 2024年第6期9卷 1361-1376页

作者： Huimei Tang Yutao Zhang Lijia Ma Qiuzhen Lin Liping Huang Jianqiang Li Maoguo Gong College of Computer Science and Software Engineering Shenzhen UniversityShenzhenChina Institute for Infocomm Research Agency for Science Technology and ResearchSingaporeSingapore Key Laboratory of Collaborative Intelligence Systems Ministry of EducationXidian UniversityXi'anChina

Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature ***,the existing deep learningbased NE methods are time-consuming as they need to train a dense architecture for deep neural networks with extensive unknown weight parameters.A sparse deep autoencoder(called SPDNE)for dynamic NE is proposed,aiming to learn the network structures while preserving the node evolution with a low computational *** tries to use an optimal sparse architecture to replace the fully connected architecture in the deep autoencoder while maintaining the performance of these models in the dynamic ***,an adaptive simulated algorithm to find the optimal sparse architecture for the deep autoencoder is *** performance of SPDNE over three dynamical NE models(*** architecture-based deep autoencoder method,DynGEM,and ElvDNE)is evaluated on three well-known benchmark networks and five real-world *** experimental results demonstrate that SPDNE can reduce about 70%of weight parameters of the architecture for the deep autoencoder during the training process while preserving the performance of these dynamical NE *** results also show that SPDNE achieves the highest accuracy on 72 out of 96 edge prediction and network reconstruction tasks compared with the state-of-the-art dynamical NE algorithms.

关键词： deep autoencoder dynamic networks low-dimensional feature space network embedding sparse structure

来源：评论

学校读者我要写书评

暂无评论

Specification of Complex Analytics Workflows: A Formal Language Model of Decision Options 20th

Specification of Complex Analytics Workflows: A Formal Lang...

引用

20th International Conference on the Economics of Grids, Clouds, systems, and Services, GECON 2024

作者： Miri, Pouriya Kochovski, Petar Tuler de Oliveira, Marcela Stankovski, Vlado Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Department of Engineering Systems Delft University of Technology Delft Netherlands

ISBN: (纸本)9783031812255

The specification of experiments expressed as Complex Analytics Workflows is a complex task that involves many decision-making steps with various degrees of complexity. The use of the context, the expert knowledge, and the potential for its sharing and reuse in the context of experiment specification have not been addressed sufficiently until now. Moreover, to make such knowledge instrumental, it should be coupled with specific probabilistic measures, such as particular assurances, ranking, and verification of various options. The paper aims to present a novel semantic model for probabilistic reasoning in any experimentation context coupled with a functional system for knowledge generation, reuse, and sharing. The result of our work can be used within existing experimentation engines. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Empirical techniques for effort estimation in designing effective ML models

引用

International Journal of Computers and Applications 2025年第2期47卷 226-234页

作者： Padmanabha Reddy, Y.C.A. Kosuru, Sai Sathwik Sirisalla, Nageswara Rao Vivekananda, G.N. Perala, Venkata Akanksha Department of Artificial Intelligence and Machine Learning Chaitanya Bharati Institute of Technology Telangana Hyderabad India Department of CSE B V Raju Institute of Technology Telangana Narsapur India Department of Computer Science and Engineering K.S.R.M. College of Engineering AP Kadapa India School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India

Machine Learning Research often involves the use of diverse libraries, modules, and pseudocodes for data processing, cleaning, filtering, pattern recognition, and computer intelligence. Quantization of Effort Required for the above cumulative processes is rarely discussed in the existing works and The time to reach the desired level of the model's functionality is essential to gauge the environment training for the model training and pre-deployment testing. In this study, we empirically defined the manual-cum-computational effort required for the model development in terms of 2-time factors: time-to-live (time until 1st code modification) and time-for-modification (time between 2 codebase changes) taken together in a mathematical model to compute Effort Factor(quantitative measure of determining effort needed to design ML algorithms). The study is novel in terms of how the effort required to create ML models is calculated with a particular focus on the manual effort direction. The results and the findings obtained can be used for determining the total time needed to synthesize ML models and frameworks in terms of code change cycles and implementation strategies marking a 25% performance increase in the current method above the Standard Pipeline. © 2025 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Pipeline codes

来源：评论

学校读者我要写书评

暂无评论

Data-Filtered Prediction with Decomposition and Amplitude-Aware Permutation Entropy for Workload and Resource Utilization in Cloud Data Centers

引用

IEEE Internet of Things Journal 2025年第12期12卷 19189-19201页

作者： Yuan, Haitao Hu, Qinglong Wang, Meijia Wang, Shen Bi, Jing Buyya, Rajkumar Shi, Shuyuan Yang, Jinhong Zhang, Jia Zhou, MengChu Beihang University School of Automation Science and Electrical Engineering Beijing100191 China City University of Hong Kong Department of Computer Science Hong Kong999077 Hong Kong Beijing University of Technology School of Software Engineering The Faculty of Information Technology Beijing100124 China Lab School of Computing and Information Systems MelbourneVIC3010 Australia Beihang University School of Integrated Circuit Science and Engineering Beijing China CSSC Systems Engineering Research Institute Beijing China Southern Methodist University Department of Computer Science The Lyle School of Engineering DallasTX75205 United States New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States

In recent years, cloud computing has witnessed widespread applications across numerous organizations. Predicting workload and computing resource data can facilitate proactive service operation management, leading to substantial improvements in quality of service and cost efficiency. However, these data often exhibit non-linearity, high volatility, and interdependencies across different categories, presenting challenges for accurate forecasting. Consequently, there is a critical need to develop a method that thoroughly and comprehensively analyzes all available data to forecast future trends effectively. This work proposes a novel integrated data-enhanced prediction model named SVAPI for achieving high-accuracy workload prediction in cloud computing systems. SVAPI employs the Savitzky-Golay filter, Variational mode decomposition, and the mode selection based on Amplitude-aware Permutation entropy for feature processing, whose features are subsequently utilized by Informer for multivariate joint analysis of the enhanced data, achieving high-precision prediction. Ablation and comparative experiments with advanced prediction models are conducted on the Google cluster trace and other typical datasets. Realistic data-driven results indicate that SVAPI improves the prediction accuracy by 37.7% compared to the original Informer, with each module contributing to the performance enhancement. Furthermore, compared with Autoformer, SVAPI enhances the prediction accuracy of workload, CPU, and memory by 65.6%, 66.9%, and 70.8%, respectively, demonstrating that SVAPI owns strong abilities in noise filtering, feature processing, and multivariate joint analysis for achieving higher prediction accuracy. © 2014 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：