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

16th Pacific Rim Conference on Lasers and Electro-Optics, CLEO-PR 2024

作者： Xu, Yuxi Li, Zongkai Zhang, Bin Wang, Dawei School of Electrical and Information Technology Sun Yat-sen University Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems Guangzhou China

We study two explicit singularities of the gradient projection method by analyzing and experimentally testing the Jacobian of the rotatable waveplate model for dynamic polarization control. © 2024 IEEE.

ISBN: (纸本)9798350372076

关键词： Polarization

来源：评论

学校读者我要写书评

暂无评论

A zeroing neurodynamics‐based location method for nodes in underwater acoustic sensor network

引用

CAAI Transactions on Intelligence technology 2023年第3期8卷 661-669页

作者： Shuqiao Wang Xiujuan Du Tiantai Deng College of Computer Qinghai Provincial Key Laboratory of loTQinghai Normal UniversityXiningChina The State Key Laboratory of Tibetan Intelligent Information Processing and Application XiningChina The Department of Electronics and Electrical Engineering The University of SheffieldSheffieldEnglandUnited Kingdom

Zeroing neurodynamics methodology,which dedicates to finding equilibrium points of equations,has been proven to be a powerful tool in the online solving of problems with considerable *** this paper,a method for underwater acoustic sensor network(UASN)localisation is proposed based on zeroing neurodynamics methodology to preferably locate moving underwater nodes.A zeroing neurodynamics model specifically designed for UASN localisation is constructed with rigorous theoretical analyses of its *** proposed zeroing neurodynamics model is compatible with some localisation algorithms,which can be utilised to eliminate error in non‐ideal situations,thus further improving its ***,the effectiveness and compatibility of the proposed zeroing neurodynamics model are substantiated by examples and computer simulations.

关键词： artificial neural network internet of things underwater acoustic sensor network

来源：评论

学校读者我要写书评

暂无评论

FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring

引用

Journal of computer Science & technology 2023年第5期38卷 970-984页

作者：胡春雨忽丽莎袁林陆佃杰吕蕾陈益强 Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250000China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 25000China Institute of Information Technology Hebei University of Economics and BusinessShijiazhuang 050061China School of Information Science and Engineering Shandong Normal UniversityJinan 250358China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power ***,most wearable health data is distributed across dfferent organizations,such as hospitals,research institutes,and companies,and can only be accessed by the owners of the data in compliance with data privacy *** first challenge addressed in this paper is communicating in a privacy-preserving manner among different *** second technical challenge is handling the dynamic expansion of the federation without model *** address the first challenge,we propose a horizontal federated learning method called Federated Extremely Random Forest(FedERF).Its contribution-based splitting score computing mechanism significantly mitigates the impact of privacy protection constraints on model *** on FedERF,we present a federated incremental learning method called Federated Incremental Extremely Random Forest(FedIERF)to address the second technical *** introduces a hardness-driven weighting mechanism and an importance-based updating scheme to update the existing federated model *** experiments show that FedERF achieves comparable performance with non-federated methods,and FedIERF effectively addresses the dynamic expansion of the *** opens up opportunities for cooperation between different organizations in wearable health monitoring.

关键词： federated learning incremental learning random forest wearable health monitoring

来源：评论

学校读者我要写书评

暂无评论

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

引用

Frontiers of computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Attentive Neighborhood Feature Augmentation for Semi-supervised Learning

引用

Intelligent Automation & Soft Computing 2023年第8期37卷 1753-1771页

作者： Qi Liu Jing Li Xianmin Wang Wenpeng Zhao School of Computer Science and Cyber Engineering Guangzhou UniversityGuangzhou510002China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang UniversityFuzhou350121China

Recent state-of-the-art semi-supervised learning(SSL)methods usually use data augmentations as core *** methods,however,are limited to simple transformations such as the augmentations under the instance’s naive representations or the augmentations under the instance’s semantic *** tackle this problem,we offer a unique insight into data augmentations and propose a novel data-augmentation-based semi-supervised learning method,called Attentive Neighborhood Feature Aug-mentation(ANFA).The motivation of our method lies in the observation that the relationship between the given feature and its neighborhood may contribute to constructing more reliable transformations for the data,and further facilitating the classifier to distinguish the ambiguous features from the low-dense ***,we first project the labeled and unlabeled data points into an embedding space and then construct a neighbor graph that serves as a similarity measure based on the similar representations in the embedding ***,we employ an attention mechanism to transform the target features into augmented ones based on the neighbor ***,we formulate a novel semi-supervised loss by encouraging the predictions of the interpolations of augmented features to be consistent with the corresponding interpolations of the predictions of the target *** carried out exper-iments on SVHN and CIFAR-10 benchmark datasets and the experimental results demonstrate that our method outperforms the state-of-the-art methods when the number of labeled examples is limited.

关键词： Semi-supervised learning attention mechanism feature augmentation consistency regularization

来源：评论

学校读者我要写书评

暂无评论

Cross-Task Knowledge Transfer for Semi-supervised Joint 3D Grounding and Captioning 24

Cross-Task Knowledge Transfer for Semi-supervised Joint 3D G...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Liu, Yang Liu, Daizong Guo, Zongming Hu, Wei Wangxuan Institute of Computer Technology State Key Laboratory of Multimedia Information Processing Peking University Beijing China

ISBN: (纸本)9798400706868

3D visual grounding is a fundamental yet important task in multimedia understanding, which aims to locate a specific object in a complicated 3D scene semantically according to a text description. However, this task requires a large number of annotations of labeled text-object pairs for training, so the scarcity of annotated data has been a key obstacle in this task. To this end, this paper makes the first attempt to introduce and address a new semi-supervised setting, where only a few text-object labels are provided during training. Considering most scene data has no annotation, we explore a new solution for unlabeled 3D grounding by additionally training and transferring knowledge from a correlated task, i.e., 3D captioning. Our main insight is that 3D grounding and captioning are complementary and can be iteratively trained with unlabeled data to provide object and text contexts for each other with pseudo-label learning. Specifically, we propose a novel 3D Cross-Task Teacher-Student Framework (3D-CTTSF) for joint 3D grounding and captioning in the semi-supervised setting, where each branch contains parallel grounding and captioning modules. We first pre-train the two modules of the teacher branch with limited labeled data for warm-up. Then, we train the student branch to mimic the ability of the teacher model and iteratively update both branches with the unlabeled data. In particular, we transfer the learned knowledge between the grounding and captioning modules across two branches to generate and refine the pseudo-labels of unlabeled data for providing reliable supervision. To further improve the quality of the pseudo-labels, we design a cross-task pseudo-label generation scheme, filtering low-quality pseudo-labels at the detection, captioning, and grounding levels, respectively. Experimental results on various datasets show competitive performances in both tasks compared to previous fully- and weakly-supervised methods, demonstrating the proposed 3D-CTTSF can se

关键词： Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Human Action Recognition Research Based on Channel-Temporal Self-Attention Block Network 6

Human Action Recognition Research Based on Channel-Temporal ...

引用

6th International Conference on Robotics and computer Vision, ICRCV 2024

作者： Han, Xiaowei Lu, Yunjing Guo, Qiuyang Liu, Jiwu Fei, Chaolong Harbin University of Commerce Postdoctoral research workstation of Northeast Asia Service Outsourcing Research Center Post-Doctoral Flow Station of Applied Economics Heilongjiang Provincial Key Laboratory of Electronic Commerce and Information Processing Harbi China Harbin University of Commerce Heilongjiang Provincial Key Laboratory of Electronic Commerce and Information Processing Harbin China Guangdong Technology College Heilongjiang Provincial Key Laboratory of Electronic Commerce and Information Processing Zhaoqing China

ISBN: (纸本)9798331527426

With the rapid development of information technology, video has become an important carrier for people to perceive information in daily life. If you want to analyze the action of people in the video data of various scenes and make use of the results, you must first identify the human action accurately. In this paper, a temporal self-attention module is proposed to help the network dynamically learn the correlation between different data frames, so as to better capture the dependency on the time of action. On this basis, a novel network structure, Channel-Temporal Self-Attention Block (C-TSAB), is further proposed. C-TSAB adaptively emphasizes the key channels of input features and focuses on the time dimension to enhance the model's ability to recognize and represent action features. In the ablation experiment, the Top-1 and Top-5 indicators in HMDB51 dataset were 58.54% and 81.70%, respectively, and the Top-1 and Top-5 indicators in UCF101 dataset were 58.54% and 82.73%, respectively. Comparative experiments were conducted on HMDB51 dataset and UCF101 dataset respectively, our model obtained a better Top-1 indicator, both of which were 58.54%, proving that our model has relatively good performance in video HAR task. © 2024 IEEE.

关键词： 3D residual network Attention mechanism Human action recognition

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Optimization Method for Weight Computation in Hypergraph Transductive Learning Model 9

An Optimization Method for Weight Computation in Hypergraph ...

引用

9th International Conference on Advanced Cloud and Big Data, CBD 2021

作者： Yang, Zhe Xu, Liangkui Bu, Ziyu Chen, Yipeng Information Processing Technology Provincial Key Laboratory for Computer Soochow University School of Computer Science and Technology Suzhou China

ISBN: (纸本)9781665407458

Compared with the graph structure, the hyper-graph structure can convey more complex and multivariate relationships. In addition, hypergraphs are more capable of portraying and mining higher-order nonlinear correlations among objects. Therefore, it has been widely used in feature selection, clustering classification, and addressing other issues, and hypergraph learning has also become an important branch in the field of machine learning. Hypergraph learning, however, is a relatively high time consuming learning algorithm, because in its iterative solving process, there are lots of high-dimension matrix computations with large-scale parameters. This paper proposes an optimization of the weights, which is constructed by Gaussian kernel, in hyper-graph transductive learning model the weight matrix is replaced by fixed parameters when constructing the hypergraph laplacian matrix, which reduces the time consuming of weights computation in iterative process. Extensive experimental with semi-supervised node classification experiment results on the UCI and Kaggle datasets show that the optimized model reduces the time consuming of the hypergraph model, while ensuring classification accuracy. After model optimization, the four accuracy indicators fluctuate on average 3.03%, the time consuming is reduced by 28.99% on average, and the maximum saving is 42.84%. © 2022 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：