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

Frontiers of Computer Science 2013年第3期7卷 350-358页

作者： Tao SONG Xiaolong SHI Jinbang XU Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Spiking neural （SN） P systems are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes. In this work, we investigate reversibility in SN P systems, as well as the computing power of reversible SN P systems. Reversible SN P systems are proved to have Turing creativity, that is, they can compute any recursively enumerable set of non-negative integers by simulating universal reversible register machine.

关键词： membrane computing spiking neural P system reversible computing model universality reversible register machine

来源：评论

学校读者我要写书评

暂无评论

Molecular dynamics study of the effects of deposition parameters on Si_0.5Ge_0.5 film growth on Ge(100) substrate

引用

Computational Materials Science 2025年 256卷

作者： Xie, Jianan Lin, Tao Wang, Cailin College of Automation and Information Engineering Xi'an University of Technology Xi'an 710048 China Shannxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology Xi'an 710048 China

With the widespread application of SiGe films in the semiconductor field, precisely controlling the growth process to obtain high-quality films has become an important research direction. This study focuses on the growth of Si_0.5Ge_0.5 films on Ge (100) substrates and investigates the effects of different deposition parameters (such as deposition interval, incident energy, incident angle, and substrate off-angle) on film quality. Through molecular dynamics simulations, the effects of these deposition parameters on the crystal structure, dislocation density, and surface roughness of the films are systematically analyzed. The results show that shorter deposition intervals lead to faster atomic deposition, increasing the proportion of disordered atoms;longer deposition intervals effectively reduce the proportion of disordered atoms, but excessively long intervals may increase surface roughness and form island-like structures. Additionally, appropriate incident energy, incident angle, and substrate off-angle can significantly optimize the film quality, with the surface roughness being minimized when the incident energy is 1 eV. © 2025 Elsevier B.V.

关键词： Deposition interval Ge/SiGe Incident energy Molecular dynamics Substrate off-angle

来源：评论

学校读者我要写书评

暂无评论

Unleashing Correlation and Continuity for Hyperspectral Reconstruction from RGB images

arXiv

引用

arXiv 2025年

作者： Feng, Fuxiang Cong, Runmin Wei, Shoushui Zhang, Yipeng Li, Jun Kwong, Sam Zhang, Wei The School of Control Science and Engineering Shandong University Jinan250061 China The Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan250061 China The University of California Los Angeles United States The Hubei Key Laboratory of Intelligent Geo-Information Processing The School of Computer Science China University of Geo-sciences Wuhan430078 China The Lingnan University Hong Kong

Reconstructing Hyperspectral images (HSI) from RGB images can yield high spatial resolution HSI at a lower cost, demonstrating significant application potential. This paper reveals that local correlation and global continuity of the spectral characteristics are crucial for HSI reconstruction tasks. Therefore, we fully explore these inter-spectral relationships and propose a Correlation and Continuity Network (CCNet) for HSI reconstruction from RGB images. For the correlation of local spectrum, we introduce the Group-wise Spectral Correlation Modeling (GrSCM) module, which efficiently establishes spectral band similarity within a localized range. For the continuity of global spectrum, we design the Neighborhood-wise Spectral Continuity Modeling (NeSCM) module, which employs memory units to recursively model the progressive variation characteristics at the global level. In order to explore the inherent complementarity of these two modules, we design the Patch-wise Adaptive Fusion (PAF) module to efficiently integrate global continuity features into the spectral features in a patch-wise adaptive manner. These innovations enhance the quality of reconstructed HSI. We perform comprehensive comparison and ablation experiments on the mainstream datasets NTIRE2022 and NTIRE2020 for the spectral reconstruction task. Compared to the current advanced spectral reconstruction algorithms, our designed algorithm achieves State-Of-The-Art (SOTA) performance. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Homophily Clustering: Structure Homophily Graph Learning with Adaptive Filter for Hyperspectral image

arXiv

引用

arXiv 2025年

作者： Ding, Yao Kang, Weijie Yang, Aitao Zhang, Zhili Zhao, Junyang Feng, Jie Hong, Danfeng Zheng, Qinghe The Key Laboratory of Intelligent Control PLA Rocket Force University of Engineering Xi’an710025 China The Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Xidian University Xi’an710071 China The Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China The School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China

Hyperspectral image (HSI) clustering has been a fundamental but challenging task with zero training labels. Currently, some deep graph clustering methods have been successfully explored for HSI due to their outstanding performance in effective spatial structural information encoding. Nevertheless, insufficient structural information utilization, poor feature presentation ability, and weak graph update capability limit their performance. Thus, in this paper, a homophily structure graph learning with an adaptive filter clustering method (AHSGC) for HSI is proposed. Specifically, homogeneous region generation is first developed for HSI processing and constructing the original graph. Afterward, an adaptive filter graph encoder is designed to adaptively capture the high and low frequency features on the graph for subsequence processing. Then, a graph embedding clustering self-training decoder is developed with KL Divergence, with which the pseudo-label is generated for network training. Meanwhile, homophily-enhanced structure learning is introduced to update the graph according to the clustering task, in which the orient correlation estimation is adopted to estimate the node connection, and graph edge sparsification is designed to adjust the edges in the graph dynamically. Finally, a joint network optimization is introduced to achieve network self-training and update the graph. The K-means is adopted to express the latent features. Extensive experiments and repeated comparative analysis have verified that our AHSGC contains high clustering accuracy, low computational complexity, and strong robustness. The code source will be available at https://***/DY-HYX. Copyright © 2025, The Authors. All rights reserved.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

Secure Consensus of Multi-agent Systems via Fully Distributed Dynamic Edge-based Event Triggered Under Denial-of-service Attacks

引用

International Journal of control, Automation and Systems 2025年第5期23卷 1337-1355页

作者： Li, Lei Liu, Lei Yan, Dongmei Liang, Chengqing School of Mathematics Hohai University Nanjing 211100 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai 200240 China School of Modern Posts Nanjing University of Posts and Telecommunications Nanjing 210003 China College of Artificial Intelligence and Automation Hohai University Changzhou 213200 China Key Laboratory of Maritime Intelligent Cyberspace Technology Hohai University Ministry of Education Nanjing 210000 China

This paper addresses the issue of ensuring secure consensus in linear multi-agent systems under Denial-of-Service attacks. At the outset, to address the issue of partially observable agent states, a state observer is engineered to offer state estimations for the agents. Using the capabilities of this observer, a novel fully distributed dynamic adaptive edge-based event triggered control mechanism is introduced, and a timing variable is utilized to ensure that the inter-event intervals for all communication links in the network are strictly positive, thereby excluding Zeno behavior. Following that, by leveraging the piecewise Lyapunov function approach, the necessary conditions are meticulously crafted to ensure that the system reaches a secure consensus, thereby establishing a quantitative link between control gains, the duration of attacks, and their frequencies. Ultimately, the effectiveness of the developed event-triggered control strategy is validated through a simulation example. © ICROS, KIEE and Springer 2025.

关键词： Denial-of-service attacks edge-based event triggered control multi-agent systems observer positive minimum interevent time secure consensus

来源：评论

学校读者我要写书评

暂无评论

A novel linear search-linear programming method for non-convex multi-objective sizing of standalone microgrids

引用

Energy Conversion and Management 2025年 337卷

作者： Yin, Zishan Jin, Jiashu Zeng, Linghong Tang, Xiyun Wang, Zhuo Li, Xi School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China Key Laboratory of Imaging Processing and Intelligent Control of Education Ministry Huazhong University of Science and Technology Hubei Wuhan430074 China Belt and Road Joint Laboratory on Measurement and Control Technology Huazhong University of Science and Technology Hubei Wuhan430074 China

Both the increased utilization of photovoltaic (PV) and the consequent expansion of energy storage, leading to higher costs, are critical factors in the development of a techno-economic microgrid. To address this trade-off, optimal sizing design of a multi-energy microgrid is essential. This paper proposes a novel linear search-linear programming method for optimizing the sizing of microgrids with diverse energy storage systems, including battery energy storage systems (BESS) and hydrogen energy storage systems (HESS). The method minimizes both the non-linear and non-convex life cycle cost and the PV curtailment rate. Simulation results demonstrate the feasibility and superiority of the proposed method, achieving enhanced computational efficiency: 52 times faster for PV/HESS microgrids, 124 times for PV/BESS, and 5 times for PV/HESS/BESS. Moreover, more comprehensive and accurate optimal configurations were identified, including 4289 PV units for both the PV/BESS and PV/HESS/BESS microgrids, and 6239 PV units along with 37 fuel cell units for the PV/HESS microgrid. Based on the advanced optimization outcomes, a techno-economic analysis shows that the PV/HESS/BESS microgrid optimally combines the advantages of both HESS and BESS, substantially improving overall system performance. © 2025

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

LDGCN: An Edge-End Lightweight Dual GCN Based on Single-Channel EEG for Driver Drowsiness Monitoring

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Huang, Jingwei Wang, Chuansheng Huang, Jiayan Fan, Haoyi Xue, Xingsi Zhang, Fuquan Fuzhou University College of Computer and Big Data Fuzhou China Polytechnic University of Catalonia Department of Automatic Control Barcelona Spain Putian University New Engineering Industry College Putian China Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian Fuzhou350118 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Minjiang University College of Computer and Control Engineering Fuzhou China Sichuan Conservatory of Music Digital Media Art Key Laboratory of Sichuan Province Chengdu China Minjiang University Fuzhou Technology Innovation Center of Intelligent Manufacturing information System Fuzhou China Fuzhou China

Driver drowsiness electroencephalogram (EEG) signal monitoring can promptly alert drivers of their drowsiness in edge-end Consumer Electronics (CE), thereby reducing the probability of traffic accidents. Graph convolutional networks (GCNs) have shown significant advancements in processing the non-stationary, time-varying, and non-Euclidean nature of EEG signals. However, the existing single-channel EEG adjacency graph construction process lacks interpretability, which hinders the ability of GCNs to effectively extract adjacency graph features, thus affecting the performance of drowsiness monitoring. To address this issue, we propose an edge-end Lightweight Dual Graph Convolutional Network (LDGCN). Specifically, we are the first to incorporate neurophysiological knowledge to design a Baseline Drowsiness Status Adjacency Graph (BDSAG), which characterizes driver drowsiness status. Additionally, to express more features within limited EEG data, we introduce the Augmented Graph-level Module (AGM). This module captures global and local information at the graph level, ensuring that BDSAG features remain intact while enhancing effective feature expression capability. To further enhance the application of CE, we apply Adaptive Pruning Optimization (APO) to the channels and neurons of LDGCN, which nearly halves the inference latency. Experiments on benchmark datasets demonstrate that LDGCN offers the best trade-off between monitoring performance and hardware resource utilization, outperforming existing state-of-the-art algorithms. © 1975-2011 IEEE.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Learning to Learn Transferable Generative Attack for Person Re-Identification

引用

IEEE Transactions on image processing 2025年 PP卷 PP页

作者： Bian, Yuan Liu, Min Wang, Xueping Ma, Yunfeng Wang, Yaonan Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Changsha China

Deep learning-based person re-identification (reid) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider cross-dataset and cross-model transferability, ignoring the cross-test capability to perturb models trained in different domains. To powerfully examine the robustness of real-world re-id models, the Meta Transferable Generative Attack (MTGA) method is proposed, which adopts meta-learning optimization to promote the generative attacker producing highly transferable adversarial examples by learning comprehensively simulated transfer-based crossmodel&dataset&test black-box meta attack tasks. Specifically, cross-model&dataset black-box attack tasks are first mimicked by selecting different re-id models and datasets for meta-train and meta-test attack processes. As different models may focus on different feature regions, the Perturbation Random Erasing module is further devised to prevent the attacker from learning to only corrupt model-specific features. To boost the attacker learning to possess cross-test transferability, the Normalization Mix strategy is introduced to imitate diverse feature embedding spaces by mixing multi-domain statistics of target models. Extensive experiments show the superiority of MTGA, especially in cross-model&dataset and cross-model&dataset&test attacks, our MTGA outperforms the SOTA methods by 20.0% and 11.3% on mean mAP drop rate, respectively. © 1992-2012 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Topological discrimination and lazy collision-Based multistage optimization of probabilistic roadmap algorithm for path planning

引用

Robotica 2025年

作者： Gong, Wenbin Luo, Hua Su, Yu Gu, Yu Chen, HongHao Jiang, Yutao Yuan, Tangju Li, Hongbing Chongqing Key Laboratory of Geological Environmental Monitoring and Disaster Early Warning The Three Gorges Reservoir Area Chongqing Three Gorges University Chongqing 404120 China Internet of Things and Intelligent Control Technology Chongqing Engineering Research Center Chongqing Three Gorges University Chongqing 404120 China Chongqing Municipal Key Laboratory of Intelligent Information Processing and Control Chongqing Three Gorges University Chongqing 404120 China

The selection of random sampling points is crucial for the path quality generated by probabilistic roadmap (PRM) algorithm. Increasing the number of sampling points can enhance path quality. However, it may also lead to extended convergence time and reduced computational efficiency. Therefore, an improved probabilistic roadmap algorithm (TL-PRM) is proposed based on topological discrimination and lazy collision. TL-PRM algorithm first generates a circular grid area among start and goal points. Then, it constructs topological nodes. Subsequently, elliptical sampling areas are created between each pair of adjacent topological nodes. Random sampling points are generated within these areas. These sampling points are interconnected using a layer connection strategy. An initial path is generated using a delayed collision strategy. The path is then adjusted by modifying the nodes on the convex outer edges to avoid obstacles. Finally, a reconnection strategy is employed to optimize the path. This reduces the number of path waypoints. In dynamic environments, TL-PRM algorithm employs pose adjustment strategies for semi-static and dynamic obstacles. It can use either the same or opposite pose adjustments to avoid dynamic obstacles. Experimental results indicate that TL-PRM algorithm reduces the average number of generated sampling points by 70.9% and average computation time by 62.1% compared with PRM∗ and PRM-Astar algorithms. In winding and narrow passage maps, TL-PRM algorithm significantly decreases the number of sampling points and shortens convergence time. In dynamic environments, the algorithm can adjust its pose orientation in real time. This allows it to safely reach the goal point. TL-PRM algorithm provides an effective solution for reducing the generation of sampling points in PRM algorithm. © 2025 The Author(s).

关键词： lazy collisions neighborhood connectivity path smoothing PRM algorithm region sampling topological nodes

来源：评论

学校读者我要写书评

暂无评论

Dynamics of Masked image Modeling in Hyperspectral image Classification

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Ma, Chen Li, Huayi Jiang, Junjun Aybar, Cesar Yao, Jiaqi Camps-Valls, Gustau Harbin Institute of Technology Research Center of Satellite Technology State Key Laboratory of Micro-Spacecraft Rapid Design and Intelligent Cluster School of Astronautics Harbin150001 China Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China University of València Image Signal Processing Laboratory València46980 Spain Tianjin Normal University Tianjin300387 China

Masked image modeling (MIM), a common self-supervised learning (SSL) technique, has been extensively studied for remote sensing (RS) image processing. Nevertheless, its effectiveness for hyperspectral imagery (HSI) remains underexplored due to the distinct data structures and high dimensionality. This article aims to provide a detailed understanding of MIM from different perspectives of representation learning and statistical analysis for HSI classification tasks. Our study reveals that the MIM paradigm injects inductive bias in the attention mechanism of the transformer model, which is advantageous for capturing the local discrepancies between the spectra. We also show that MIM can increase the diversity of the attention heads in every layer, which is beneficial for the model in extracting more discriminative features from different spectral bands. The similarity of representations from various layers further proves this. Furthermore, our investigation highlights how MIM introduces a dynamic perspective to spectral representations, enabling the model to learn more robust and discriminative features. The final numerical experiments indicate that a moderate mask ratio can enhance the performance of downstream tasks. This suggests that designing a more targeted masking strategy might be necessary to achieve higher and more stable gains in downstream task performance. Without bells and whistles, the vanilla MIM improves the overall classification accuracy by an average of 2.69% over its supervised learning (SL) counterpart. We hope that our findings can advance the understanding of MIM in HSI and inspire the design of a more stable SSL paradigm for HSI processing. © 1980-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：