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

Identification of differential brain regions in MCI progression via clustering-evolutionary weighted SVM ensemble algorithm

引用

Frontiers of Computer Science 2021年第6期15卷 165-173页

作者： Xia-an BI Yiming XIE Hao WU Luyun XU Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha 410081China College of Information Science and Engineering Hunan Normal UniversityChangsha 410081China Business School of Hunan Normal University Changsha 410081China

Mild cognitive impairment(MCI)as the potential sign of serious cognitive decline could be divided into two stages,i.e.,late MCI(LMCI)and early MCI(EMCI).Although the different cognitive states in the MCI progression have been clinically defined,effective and accurate identification of differences in neuroimaging data between these stages still needs to be further *** this paper,a new method of clustering-evolutionary weighted support vector machine ensemble(CEWSVME)is presented to investigate the alterations from cognitively normal(CN)to EMCI to *** CEWSVME mainly includes two *** first step is to build multiple SVM classifiers by randomly selecting samples and *** second step is to introduce the idea of clustering evolution to eliminate inefficient and highly similar SVMs,thereby improving the final classification ***,we extracted the optimal features to detect the differential brain regions in MCI progression,and confirmed that these differential brain regions changed dynamically with the development of *** exactly,this study found that some brain regions only have durative effects on MCI progression,such as parahippocampal gyrus,posterior cingulate gyrus and amygdala,while the superior temporal gyrus and the middle temporal gyrus have periodic effects on the *** work contributes to understanding the pathogenesis of MCI and provide the guidance for its timely diagnosis.

关键词： machine learning MCI progression optimal feature extraction differential brain regions functional magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

引用

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

作者： keyu Zhong Fen Xiao Xieping Gao Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

来源：评论

学校读者我要写书评

暂无评论

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

引用

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

来源：评论

学校读者我要写书评

暂无评论

Scheduling optimization for upstream dataflows in edge computing

引用

Digital Communications and Networks 2023年第6期9卷 1448-1457页

作者： Haohao Wang Mengmeng Sun Lianming Zhang Pingping Dong Yehua Wei Jing Mei College of Information Science and Engineering Hunan Normal UniversityChangsha410081China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China Hunan Xiangjiang Artificial Intelligence Academy Hunan Normal UniversityChangsha410081China

Edge computing can alleviate the problem of insufficient computational resources for the user equipment,improve the network processing environment,and promote the user *** computing is well known as a prospective method for the development of the Internet of Things(IoT).However,with the development of smart terminals,much more time is required for scheduling the terminal high-intensity upstream dataflow in the edge server than for scheduling that in the downstream *** this paper,we study the scheduling strategy for upstream dataflows in edge computing networks and introduce a three-tier edge computing network *** propose a Time-Slicing Self-Adaptive Scheduling(TSAS)algorithm based on the hierarchical queue,which can reduce the queuing delay of the dataflow,improve the timeliness of dataflow processing and achieve an efficient and reasonable performance of dataflow *** experimental results show that the TSAS algorithm can reduce latency,minimize energy consumption,and increase system throughput.

关键词： Edge computing Time-slicing Dataflow scheduling Dynamic analysis

来源：评论

学校读者我要写书评

暂无评论

Improving mutation pathogenicity prediction of metal-binding sites in proteins with a panoramic attention mechanism

引用

Pattern Recognition 2025年

作者： Yuan Zhang Jiafeng Wu Qiuye Zhao Mingyuan Dong Junsheng Deng Xieping Gao Kai Hu Dapeng Xiong Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan 411105 China Department of Computational Biology Cornell University Ithaca NY 14853 USA Weill Institute for Cell and Molecular Biology Cornell University Ithaca NY 14853 USA Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha 410081 China

Accurately identifying the pathogenicity of mutations at protein-metal binding sites is crucial for uncovering the structural and functional complexity of metalloproteins, and the molecular mechanisms behind numerous diseases. In this study, we present a novel deep learning framework, CASTLE, for the accurate pathogenicity prediction of mutations at metal-binding sites through an effective depiction of the message-passing in local environment surrounding both the metals and metal-binding sites. Specifically, CASTLE weaves multiple attention-driven units to construct comprehensive panoramic message-passing paths, enabling the capture of intricate structural patterns associated with the metal-binding conformations. In addition, CASTLE seamlessly integrates structural information at both residue and atomic levels, and further deeply fuses structural and sequence representations to ensure the incorporation of more comprehensive information. We demonstrate that CASTLE significantly outperforms other state-of-the-art methods across all datasets we evaluated, showcasing its robustness and generalization abilities. Our interpretability analysis illustrates CASTLE's capability in capturing meaningful representations from the metal coordinate-dependent environments. Moreover, the model optimization reaffirms the advantages of our model building strategy, which can effectively capture distinct binding patterns for different metal types. Overall, CASTLE provides a powerful deep learning tool that may offer valuable insights into the study of metalloprotein-related disease mechanisms and drug design.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Short Flows Fast Transmission Algorithm Based on MPTCP Congestion Control 6th

A Short Flows Fast Transmission Algorithm Based on MPTCP Con...

引用

6th International Conference on Artificial Intelligence and Security, ICAIS 2020

作者： Zhong, Hua Dong, PingPing Tang, WenSheng Yang, Bo Xie, JingYun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030578831

With the development of cloud computing and big data technology, traffic in the network presents new features. Real-time online interactive applications are increasing, mainly including web services, instant messaging, online commerce, advertising systems. They have very stringent latency requirements. However, the data traffic generated by data backup, movie download, data mining require high bandwidth. When large and small flows are transmitted concurrently, a series of problems will arise. MPTCP treats long and short flows equally. In this way, packets of long flows will preempt bandwidth at the bottleneck link, fill the router’s whole queue buffer. This will cause the short flows transmission timeout. To solve these problems, we propose a novel algorithm named MPTCP-SPTA (MPTCP short flows fast transmission algorithm). The algorithm give high priority to short flows based on the congestion control algorithm, then introduce the Explicit Congestion Notification mechanism(ECN) in MPTCP. Through extensive network simulator (NS-3) simulations, we demonstrate that MPTCP-SPTA outperforms TCP and MPTCP in three typical network topology, which can significantly reduce the completion time of the small flow and effectively improving the total throughput of the network. © 2020, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge 14th

Parameterized Algorithms for Fixed-Order Book Drawing with B...

引用

14th International Conference on Combinatorial Optimization and Applications, COCOA 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030648428

Given a graph G= (V, E) and a fixed linear order of V, the problem fixed-order book drawing with bounded number of crossings per edge asks whether there is a k-page book drawing of G such that the maximum number of crossings per edge is upper-bounded by an integer b. This problem was posed by Bhore et al. (GD 2019;J. Graph Algorithms Appl. 2020) and thought to be interesting for further investigation. In this paper, we study the fixed-parameter tractable algorithms for this problem. More precisely, we show that this problem parameterized by both the bounded number b of crossings per edge and the vertex cover number τ of the graph admits an algorithm running in time (b+2)O(τ3)·|V|, and this problem parameterized by both the bounded number b of crossings per edge and the pathwidth κ of the vertex ordering admits an algorithm running in time (b+2)O(κ2)·|V|. Our results provide a specifical answer to Bhore et al.’s question. © 2020, Springer Nature Switzerland AG.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

GTK:A Hybrid-Search Algorithm of Top-Rank-k Frequent Patterns Based on Greedy Strategy

引用

Computers, Materials & Continua 2020年第6期63卷 1445-1469页

作者： Yuhang Long Wensheng Tang Bo Yang Xinyu Wang Hua Ma Hang Shi Xueyu Cheng Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China College of Information Science and Engineering Hunan UniversityChangsha410082China Clayton State University MorrowGA 30260USA

Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding *** the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining *** at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this *** this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long *** short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been *** the basis of the short patterns satisfying specific conditions,the long patterns are extracted through *** reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of *** algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational *** datasets and synthetic datasets are adopted in experiments to evaluate the proposed *** experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.

关键词： Top-rank-k frequent patterns greedy strategy hybrid-search

来源：评论

学校读者我要写书评

暂无评论

Novelty Detection-Based Automated Anomaly Identification via Optimized Deep Generative Model 9th

Novelty Detection-Based Automated Anomaly Identification via...

引用

9th CCF Conference on Big Data, BigData 2021

作者： Liu, Lianye Liu, Jinping Wu, Juanjuan Zhou, Jiaming Cai, Meiling Hunan Meteorological Science Institute Hunan Changsha410007 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Hunan Changsha410081 China

ISBN: (纸本)9789811697081

Novelty detection (ND) is a crucial task in machine learning to identify anomalies in the test data in some respects different from the training data. As an anomaly detection method, novelty detection only uses normal samples for model learning, which can well fit most of the natural scenes that the amount of abnormal samples is in fact strongly insufficient, such as network intrusion detection, industrial fault detection, and so on, due to the rareness of abnormal events or the high cost of abnormal samples collection. This paper proposes a reconstruction-based ND scheme by introducing an optimized deep generative model (ODGM), which combines the concept of Variational Auto-encoder (VAE) and the generative adversarial network (GAN) model jointly to efficiently and stably learn the essential characteristics from normal samples. A novelty index is established by combining signal reconstruction loss and feature loss between the original signal of the reconstructed signal based on the ODGM on normal samples for anomaly point identification in the test data. The effectiveness and superiority of the proposed model is validated and compared with other representative deep learning-based novelty detection models on two public data sets. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

An Analysis on the Training Mode of Master Students in Artificial Intelligence Field for Electronic Information Professional Degree—Take hunan Normal University as an Example 8th

An Analysis on the Training Mode of Master Students in Artif...

引用

8th EAI International Conference on e-Learning, e-Education, and Online Training, eLEOT 2022

作者： Fu, Weina Liu, Shuai Institute of Information Science and Engineering Hunan Normal University Hunan Changsha410081 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Changsha410081 China

ISBN: (纸本)9783031211638

The ability of independent innovation in the field of artificial intelligence is a key element to occupy the commanding heights of future technology and talent competition in China. The cultivation of artificial intelligence talents, especially the cultivation high-end talent, it is essential to promote the development of artificial intelligence industry. At present, the market for artificial intelligence talents is in great demand. There is a shortage of high-end artificial intelligence talents, the weak strength of artificial intelligence teachers in universities, and the incomplete education system for talent training and many other issues. This paper combines some measures taken by hunan Normal University for graduate students in the field of artificial intelligence in the degree of electronic information, the necessity and feasibility of artificial intelligence training senior talents are discussed for social needs in the field of artificial intelligence, The training goals and methods of postgraduate students in the field of artificial intelligence under the professional category of electronic information major are clarified, and the construction of artificial intelligence field is planned. © 2022, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Professional aspects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：