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

arXiv 2024年

作者： Hu, Rui Li, Chenxu Tian, Kun Cui, Jianan Chen, Yunmei Liu, Huafeng State Key Laboratory of Modern Optical Instrumentation College of Optical Science and Engineering Zhejiang University Hangzhou China Institute of Information Processing and Automation College of Information Engineering Zhejiang University of Technology Hangzhou310001 China Department of Mathematics University of Florida GainesvilleFL32611 United States Jiaxing Key Laboratory of Photonic Sensing & Intelligent Imaging Jiaxing314000 China

Time-of-flight (TOF) information provides more accurate location data for annihilation photons, thereby enhancing the quality of PET reconstruction images and reducing noise. List-mode reconstruction has a significant advantage in handling TOF information. However, current advanced TOF PET listmode reconstruction algorithms still require improvements when dealing with low-count data. Deep learning algorithms have shown promising results in PET image reconstruction. Nevertheless, the incorporation of TOF information poses significant challenges related to the storage space required by deep learning methods, particularly for the advanced deep unrolled methods. In this study, we propose a deep unrolled primal dual network for TOF-PET list-mode reconstruction. The network is unrolled into multiple phases, with each phase comprising a dual network for list-mode domain updates and a primal network for image domain updates. We utilize CUDA for parallel acceleration and computation of the system matrix for TOF list-mode data, and we adopt a dynamic access strategy to mitigate memory consumption. Reconstructed images of different TOF resolutions and different count levels show that the proposed method outperforms the list-mode ordered subset expectation maximization (LM-OSEM), total-variation regularized list-mode expectation maximization (LM-EMTV), list-mode stochastic primal dual hybrid gradient (LM-SPDHG), total variation regularized stochastic primal dual hybrid gradient (LM-SPDHG-TV) and FastPET method in both visually and quantitative analysis. These results demonstrate the potential application of deep unrolled methods for TOF-PET list-mode data and show better performance than current mainstream TOF-PET list-mode reconstruction algorithms, providing new insights for the application of deep learning methods in TOF list-mode data. The codes for this work are available at https://***/RickHH/LMPDnet Copyright © 2024, The Authors. All rights reserved.

关键词： Positron emission tomography

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Sandwich Control of Some Nonlinear Systems with a Number of Stochastically Occurring Impulses 13

Fuzzy Sandwich Control of Some Nonlinear Systems with a Numb...

引用

13th International Conference on information Science and technology, ICIST 2023

作者： Onasanya, Babatunde Oluwaseun Dai, Xiangguang Feng, Yuming Zhang, Wei School of Computer Science and Engineering Chongqing Three Gorges University Chongqing Wanzhou404100 China Department of Mathematics University of Ibadan Ibadan200284 Nigeria Chongqing Engineering Research Center of Internet of Things and Intelligent Control Technology Chongqing Three Gorges University Chongqing Wanzhou404100 China Three Gorges Institute of Artificial Intelligence Chongqing Three Gorges University Chongqing Wanzhou404100 China Key Laboratory of Intelligent Information Processing and Control Chongqing Three Gorges University Chongqing Wanzhou404100 China

ISBN: (纸本)9798350313925

In this paper, rather than have a fixed constant matrix in the sandwich control of the nonlinear system, a fuzzy control matrix was used. In addition, simple inequalities that do not require additional computational time and skills in computer programming were used rather than the usual LMI. The result of this method is that the period T required in the control process is shorter and the control time is also reached much faster or reduced compared to the existing sandwich methods that used constant matrices. In other words, the control time of this method is shorter than the control time achieved when using constant matrices. Besides, this method also can be used to control more nonlinear chaotic systems such as Lorenz's, Rössler's and Chen's systems. Numerical simulations were used to demonstrate the effectiveness of this method. © 2023 IEEE.

关键词： Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

SASA-Net: A spatial-aware self-attention mechanism for building protein 3D structure directly from inter-residue distances

SASA-Net: A spatial-aware self-attention mechanism for build...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Gong, Tiansu Ju, Fusong Sun, Shiwei Bu, Dongbo Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Zhongke Big Data Academy Henan Zhengzhou450046 China

ISBN: (纸本)9781665401265

Protein structure prediction has achieved considerable progresses mainly due to the increased accuracy of inter-residue distance estimation and the application of deep learning *** of the distance-based ab initio prediction approaches adopt a two-step diagram: constructing a potential function based on the estimated inter-residue distances, and then build a 3D structure that minimizes the potential function. These approaches have proven very promising;however, they still suffer from several limitations, especially the inaccuracies incurred by the handcrafted potential ***, we present SASA-Net, a deep learning-based approach that directly learns protein 3D structure from the estimated inter-residue distances. Unlike the existing approach simply representing protein structures as coordinates of atoms, SASA-Net represents protein structures using pose of residues, i.e., the coordinate system of each individual residue in which all backbone atoms of this residue are fixed. The key element of SASA-Net is a spatial-aware self-attention mechanism, which is able to adjust a residue's pose according to all other residues' features and the estimated distances between residues. By iteratively applying the spatial-aware self-attention mechanism, SASA-Net continuously improves the structure and finally acquires a structure with high accuracy. Using the CATH35 proteins as representatives, we demonstrate that SASA-Net is able to accurately and efficiently build structures from the estimated inter-residue distances. The high accuracy and efficiency of SASA-Net enables an end-to-end neural network model for protein structure prediction through combining SASA-Net and an neural network for inter-residue distance prediction. Source code of SASA-Net is available at https://*** gongtiansu/SASA-Net/ © 2021 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Parametric Transformation of Timed Weighted Marked Graphs:Applications in Optimal Resource Allocation

引用

IEEE/CAA Journal of Automatica Sinica 2021年第1期8卷 179-188页

作者： Zhou He Ziyue Ma Zhiwu Li Alessandro Giua the College of Mechanical and Electrical Engineering Shaanxi University of Science and TechnologyXi’an 710021China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi’an University of TechnologyXi’an 710048China the School of Electro-Mechanical Engineering Xidian UniversityXi’an 710071China Institute of Systems Engineering Macao University of Science and TechnologyTaipa 999078MacaoChina the Department of Electrical and Electronic Engineering University of CagliariCagliari 09124Italy

Timed weighted marked graphs are a subclass of timed Petri nets that have wide applications in the control and performance analysis of flexible manufacturing *** to the existence of multiplicities(i.e.,weights)on edges,the performance analysis and resource optimization of such graphs represent a challenging *** this paper,we develop an approach to transform a timed weighted marked graph whose initial marking is not given,into an equivalent parametric timed marked graph where the edges have unitary *** order to explore an optimal resource allocation policy for a system,an analytical method is developed for the resource optimization of timed weighted marked graphs by studying an equivalent ***,we apply the proposed method to a flexible manufacturing system and compare the results with a previous heuristic *** analysis shows that the developed approach is superior to the heuristic approach.

关键词： Discrete event system resource allocation timed Petri net weighted marked graph

来源：评论

学校读者我要写书评

暂无评论

Robust flocking for non-identical second-order nonlinear multi-agent systems

引用

Autonomous intelligent Systems 2021年第1期1卷 81-90页

作者： Xiuxian Li Housheng Su Li Li Department of Control Science and Engineering College of Electronics and Information Engineeringand Shanghai Research Institute for Intelligent Autonomous SystemsTongji UniversityShanghai 200092China Institute for Advanced Study Tongji UniversityShanghai 200092China School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of ChinaHuazhong University of Science and TechnologyLuoyu Road 1037Wuhan 430074China

This paper investigates the robust flocking problem for second-order nonlinear systems with a leader and external *** contrast with most of second-order systems in the literature,the intrinsic dynamics here are nonlinear and non-identical that depend not only on the velocity but also on the position,which is more ***,the interaction topology is undirected and *** that the leader’s velocity may be constant or time-varying,two distributed flocking control laws have been proposed for two cases to make the differences of the velocities between all followers and the leader approach to zero *** proposed distributed flocking control laws are both model-independent which results in the effectiveness of the controllers to cope with the different intrinsic dynamics of the followers and the leader under some assumptions on boundedness of several *** example is given to illustrate the validity of the theoretical results.

关键词： Flocking Multi-agent systems Second-order nonlinear systems Non-identical dynamics

来源：评论

学校读者我要写书评

暂无评论

Understanding the Robustness of 3D Object Detection with Bird'View Representations in Autonomous Driving

Understanding the Robustness of 3D Object Detection with Bir...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Zijian Zhu Yichi Zhang Hai Chen Yinpeng Dong Shu Zhao Wenbo Ding Jiachen Zhong Shibao Zheng Institute of Image Communication and Network Engineering Shanghai Jiao Tong University Dept. of Comp. Sci. and Tech. THBI Lab Institute for AI Tsinghua University BNRist Center Zhongguancun Laboratory Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Information Materials and Intelligent Sensing Laboratory of Anhui Province School of Computer Science and Technology Anhui University SAIC Motor AI Lab

3D object detection is an essential perception task in autonomous driving to understand the environments. The Bird's-Eye-View (BEV) representations have significantly improved the performance of 3D detectors with camera inputs on popular benchmarks. However, there still lacks a systematic understanding of the robustness of these vision-dependent BEV models, which is closely related to the safety of autonomous driving systems. In this paper, we evaluate the natural and adversarial robustness of various representative models under extensive settings, to fully understand their behaviors influenced by explicit BEV features compared with those without BEV. In addition to the classic settings, we propose a 3D consistent patch attack by applying adversarial patches in the 3D space to guarantee the spatiotemporal consistency, which is more realistic for the scenario of autonomous driving. With substantial experiments, we draw several findings: 1) BEV models tend to be more stable than previous methods under different natural conditions and common corruptions due to the expressive spatial representations; 2) BEV models are more vulnerable to adversarial noises, mainly caused by the redundant BEV features; 3) Camera-LiDARfusion models have superior performance under different settings with multi-modal inputs, but BEV fusion model is still vulnerable to adversarial noises of both point cloud and image. These findings alert the safety issue in the applications of BEV detectors and could facilitate the development of more robust models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Short-Term Hybrid Prognostics of Fuel Cells: A Comparative and Improvement Study

SSRN

引用

SSRN 2024年

作者： Sheng, Chuang Fu, Jun Zu, YanMin Deng, ZhongHua Li, Xi School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control Education Ministry Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518055 China School of Electronic Information Engineering Jingchu University of Technology Jingmen448000 China

Accurately predicting the performance degradation trend of fuel cells helps take measures in advance and prolong the service life of the stack, which led to the creation of a novel hybrid forecasting approach. The first grey model prediction method based on residual exponential smoothing optimization (ES-R-GM) can capture the voltage deterioration trend. The integration of two different ES techniques, specifically the double ES (ES2) and cubic ES (ES3), is explored to investigate their effect on improving the predictive accuracy of the GM model. The second method of the adaptive network fuzzy inference system (ANFIS) can characterize local nonlinear behaviour. The simulated annealing (SA) algorithm is utilized to optimize ANFIS results under different fuzzy rule selection strategies. The outcomes of the two types of prediction methods mentioned above are combined to create a hybrid prediction using the data fusion method and the moving window technique. Different hybrid methods are evaluated under general conditions and further detailed optimization. The proposed hybrid framework is verified by the data obtained from the experimental platform. Moreover, when applied to consistent public datasets, the hybrid approach maintains its robustness and accuracy compared with other prognostic methods. © 2024, The Authors. All rights reserved.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Glo-net: A dual task branch based neural network for multi-class glomeruli segmentation

引用

Computers in Biology and Medicine 2025年 186卷 109670-109670页

作者： Wang, Xiangxue Zhang, Jingkai Xu, Yuemei Huang, Yang Ming, Wenlong Jiao, Yiping Liu, Bicheng Fan, Xiangshan Xu, Jun Jiangsu Key Laboratory of Intelligent Medical Image Computing School of Future Technology Nanjing University of Information Science and Technology Nanjing210044 China Department of Pathology Nanjing Drum Tower Hospital The Affiliated Hospital of Nanjing University Medical School Nanjing210008 China Institute of Nephrology Zhong Da Hospital Southeast University School of Medicine 210009 China

Accurate segmentation and classification of glomeruli are fundamental to histopathology slide analysis in renal pathology, which helps to characterize individual kidney disease. Accurate segmentation of glomeruli of different types faces two main challenges compared to traditional primitives segmentation in computational image analysis. Limited by small kernel size, traditional convolutional neural networks could hardly understand the complete context information of different glomeruli. Moreover, typical semantic segmentation networks lack adequate attention to difficult glomerular samples during the training process due to serious class imbalance between different glomeruli types. We propose a new deep learning approach, Glo-Net, which accurately segments and classifies glomeruli based on digitized pathology slides. Specifically, Glo-Net divides the traditional semantic segmentation network into two branches, i.e., segmentation and classification. While the segmentation branch specifically aims at localizing and delineating the boundary of individual glomerulus, the classification branch could focus on differentiating the glomerular types based on segmented pixels. In addition, an innovative loss function is added to the classification task to compensate for the class imbalance and minor types of glomeruli. The proposed network's average accuracy and F-score in classification tasks on the multi-institution datasets (including an external validation set) are 0.858 and 0.704, respectively. The average intersection over union (IoU) in segmentation tasks is 0.866. The Glo-Net demonstrates a 5 % improvement in classification accuracy, with up to 14 % increases for minor classes and an average 6 % IoU increase for segmentation tasks. Quantitative results show that our network achieves overall higher accuracy for segmentation and classification among nine subtypes of glomeruli compared to previous work with improved robustness and generalizability. © 2025 Elsevier Ltd

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Dynamics-Based Algorithm-Level Privacy Preservation for Push-Sum Average Consensus

arXiv

引用

arXiv 2023年

作者： Cheng, Huqiang Xie, Mengying Yang, Xiaowei Lü, Qingguo Li, Huaqing Key Laboratory of Dependable Services Computing in Cyber Physical Society-Ministry of Education College of Computer Science Chongqing University Chongqing401331 China School of Software Engineering South China University of Technology Guangzhou510006 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China

In the intricate dance of multi-agent systems, achieving average consensus is not just vital–it is the backbone of their functionality. In conventional average consensus algorithms, all agents reach an agreement by individual calculations and sharing information with their respective neighbors. Nevertheless, the information interactions that occur in the communication network may make sensitive information be revealed. In this paper, we develop a new privacy-preserving average consensus method on unbalanced directed networks. Specifically, we ensure privacy preservation by carefully embedding randomness in mixing weights to confuse communications and introducing an extra auxiliary parameter to mask the state-updated rule in initial several iterations. In parallel, we exploit the intrinsic robustness of consensus dynamics to guarantee that the average consensus is precisely achieved. Theoretical results demonstrate that the designed algorithms can converge linearly to the exact average consensus value and can guarantee privacy preservation of agents against both honest-but-curious and eavesdropping attacks. © 2023, CC BY.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Feature Selection Based on Consistent Granulation

SSRN

引用

SSRN 2024年

作者： Yang, Tian Shen, Shuo Deng, Jinsheng Liang, Jie Qian, Yuhua Dai, Jianhua Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Hunan Changsha410081 China College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha410073 China Institute of Big Data Science and Industry Shanxi university Shanxi Taiyuan030006 China

Classifying large-scale data is a challenging task in machine learning. Feature selection and feature construction can improve the classification performances of classifiers. However, existing feature selections struggle to handle large-scale data. Granulation is the key process for generating accurate and efficient models. In this paper, we propose a novel granulation approach based on rough sets, consistent granulation, and a novel feature construction based on consistent granulation to improve the computation speed, scale, and classification performance of feature selection. As a result, the time and space complexities are reduced to a linear level in terms of sample scales. Moreover, consistent granulation can precisely represent the topological structure of the data and reduce the parameter space from [0, 1] to a finite set lowering the difficulty of optimal parameter searching. Experiments show that the proposed algorithm, FCG, outperforms four classical feature selection algorithms in handling datasets with millions of samples or tens of thousands of dimensions. Additionally, on the first thirteen datasets, FCG reduces the average runtime by 1145.68 times (NARNeMF), 883.11 times (HANDI), 1333.10 times (GBNRS), and 3.73 times (RMDPS), while increasing the average classification accuracy by 2.73% (FARNeMF), 2.30% (HANDI), 4.61% (GBNRS) and 14.33% (RMDPS) compared to these methods. © 2024, The Authors. All rights reserved.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：