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

arXiv 2023年

作者： Liu, Yuan Shen, Hong-Bin Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

The advent of highly accurate protein structure prediction methods has fueled an exponential expansion of the protein structure database. Consequently, there is a rising demand for rapid and precise structural homolog search. Traditional alignment-based methods are dedicated to precise comparisons between pairs, exhibiting high accuracy. However, their sluggish processing speed is no longer adequate for managing the current massive volume of data. In response to this challenge, we propose a novel deep-learning approach FoldExplorer. It harnesses the powerful capabilities of graph attention neural networks and protein large language models for protein structures and sequences data processing to generate embeddings for protein structures. The structural embeddings can be used for fast and accurate protein search. And the embeddings also provide insights into the protein space. FoldExplorer demonstrates a substantial performance improvement of 5% to 8% over the current state-of-the-art algorithm on the benchmark datasets. Meanwhile, FoldExplorer does not compromise on search speed and excels particularly in searching on a large-scale dataset. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

NPIPVis:A visualization system involving NBA visual analysis and integrated learning model prediction

引用

Virtual Reality & intelligent Hardware 2022年第5期4卷 444-458页

作者： Zhuo SHI Mingrui LI Meng WANG Jing SHEN Wei CHEN Xiaonan LUO Department of Art and Design University of Guilin Electronic TechnologyGuilin 541004China Department of Computer and Information Security University of Guilin Electronic TechnologyGuilin 541004China Department of Guangxi Key Laboratory of Image and Graphic Intelligent Processing University of Guilin Electronic TechnologyGuilin 541004China Department of State Key Laboratory of CAD&CG University of ZhejiangHangzhou 310058China

Background Data-driven event analysis has gradually become the backbone of modern competitive sports analysis. Competitive sports data analysis tasks increasingly use computer vision and machine-learning models for intelligent data analysis. Existing sports visualization systems focus on the player–team data visualization, which is not intuitive enough for team season win–loss data and game time-series data visualization and neglects the prediction of all-star players. Methods This study used an interactive visualization system designed with parallel aggregated ordered hypergraph dynamic hypergraphs, Calliope visualization data story technology,and i Storyline narrative visualization technology to visualize the regular statistics and game time data of players and teams. NPIPVis includes dynamic hypergraphs of a team’s wins and losses and game plot narrative visualization components. In addition, an integrated learning-based all-star player prediction model, SRR-voting, which starts from the existing minority and majority samples, was proposed using the synthetic minority oversampling technique and Random Under Sampler methods to generate and eliminate samples of a certain size to balance the number of allstar and average players in the datasets. Next, a random forest algorithm was introduced to extract and construct the features of players and combined with the voting integrated model to predict the all-star players, using GridSearch CV, to optimize the hyperparameters of each model in integrated learning and then combined with five-fold cross-validation to improve the generalization ability of the model. Finally, the SHapley Additive ex Planations(SHAP) model was introduced to enhance the interpretability of the model. Results The experimental results of comparing the SRR-voting model with six common models show that the accuracy, F1-score, and recall metrics are significantly improved, which verifies the effectiveness and practicality of the SRR-voting model. Conc

关键词： Sports visualization Parallel aggregated ordered hypergraph Calliope IStoryline Integrated learning SHAP model

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient Personalized Distributed Learning with Data and Node Heterogeneity

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Tian, Zhuojun Zhang, Zhaoyang Li, Yiwei Bennis, Mehdi Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China University of Oulu Center for Wireless Communications Oulu90014 Finland State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multimodal Communication Networks and Intelligent Information Processing Hangzhou310027 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China

To jointly tackle the challenges of data and node heterogeneity in decentralized learning, we propose a distributed strong lottery ticket hypothesis (DSLTH), based on which a communication-efficient personalized learning algorithm is developed. In the proposed method, each local model is represented as the ‌Hadamard product of global real-valued parameters and a personalized binary mask for pruning. The local model is learned by updating and fusing the personalized binary masks while the real-valued parameters are fixed among different agents. To further reduce the complexity of hardware implementation, we incorporate a group sparse regularization term in the loss function, enabling the learned local model to achieve structured sparsity. Then, a binary mask aggregation algorithm is designed by introducing an intermediate aggregation tensor and adding a personalized fine-tuning step in each iteration, which constrains model updates towards the local data distribution. The proposed method effectively leverages the relativity among agents while meeting personalized requirements in heterogeneous node conditions. We also provide a theoretical proof for the DSLTH, establishing it as the foundation of the proposed method. Numerical simulations confirm the validity of the DSLTH and demonstrate the effectiveness of the proposed algorithm. © 2015 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Convolutional Knowledge Tracing Method based on Graph Embedding

A Convolutional Knowledge Tracing Method based on Graph Embe...

引用

Computer Engineering and intelligent Communications (ISCEIC), International Symposium on

作者： Guimin Huang Ying Li Qingkai Guo Nanxiao Deng Jianxing Lin School of Computer Science and Information Security Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin China

With online education rapidly developing, it is a significant issue to evaluate students’ grasp of knowledge more accurately. Knowledge tracing models are good at it, in which convolutional knowledge tracing (CKT) based on convolutional neural networks(CNN) gets better performance. However, we found that the CKT model ignores the relation between the knowledge points, which we believe has an important impact on the correctness of students’ answers. Therefore, we put forward a graph embedding based convolutional knowledge tracing model (CKT-GE), which feeds the relation between the knowledge points with other inputs into model for improving the effectiveness of knowledge tracing. Our model outperforms existing models on two classic datasets, and improves the performance over the original CKT model, allowing for more accurate assessment of student performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deepfake Detection Method Based on Face Edge Bands 9

Deepfake Detection Method Based on Face Edge Bands

引用

9th International Conference on Digital Home, ICDH 2022

作者： Deng, Zhengjie Zhang, Bao He, Shuqian Wang, Yizhen Hainan Normal University School of Information Science and Technology Haikou China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin China Hainan Normal University School of Physics and Electronic Engineering Haikou China

ISBN: (数字)9781665454780

ISBN: (纸本)9781665454780

The rapid development of face forgery technology and the generation of realistic fake videos have caused serious harm to individuals, society and even the country, so it is important to detect deepfake videos. There are many detection methods available for forged videos, but the overall performance is yet to be improved and does not cope well with high quality forged images or videos. Observing that existing forgery algorithms leave synthetic forgery traces at the edges of faces when creating videos, this paper proposes a new method for detecting forged videos. It first finds the face edges from the video frames, then extracts the face edge bands as deep learning inputs and trains them based on EfficientNet-B3 to achieve effective detection of deepfake videos. Experiments show that the method in this paper can achieve more than 99.8% AUC values on all four forgery methods of the Face-Forensics++ dataset. © 2022 IEEE.

关键词： image enhancement

来源：评论

学校读者我要写书评

暂无评论

A fault isolation method using kernel canonical variate analysis-based contribution

A fault isolation method using kernel canonical variate anal...

引用

第35届中国过程控制会议

作者： Hongxin Wang Lingxia Mu Nan Feng Han Liu Ding Liu Department of Information and Control Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology School of Intelligence Science and Technology University of Science and Technology Beijing

Fault diagnosis and isolation is important for industrial system. In this paper, a kernel canonical variate analysis(KCVA) is proposed for fault isolation. KCVA is originally used as a data dimension reduction technique which can account for nonlinearity and correlations in the industrial dynamical process data. But there are some difficulties using KCVA in the construction of the contribution for the fault isolation. On the one hand, it is difficult to compute the contributions of individual variables because it is scarcely possible to find an inverse mapping from the feature space to the original space. On the other hand, a smearing effect is hardly avoided. To solve the problem, a KCVA-based contributions is proposed using the state subspace and the residual subspace which can isolate the faulty variables effectively. Simulations are conducted on the Tennessee Eastman process to verify the performance of the proposed method.

关键词： Kernel canonical variate analysis contribution plot fault isolation

来源：评论

学校读者我要写书评

暂无评论

A Deep Knowledge Tracking Model Based on Forgetting Features and Self-Attention Mechanism

A Deep Knowledge Tracking Model Based on Forgetting Features...

引用

Computer Engineering and intelligent Communications (ISCEIC), International Symposium on

作者： Guimin Huang Xiong Wei Qingkai Guo Nanxiao Deng Jianxing Lin School of Computer Science and Information Security Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin China

The integration of large education and artificial intelligence technologies is gradually deepening, and how to provide personalized user profiling services for learners is an important research problem. In response to the long-term dependency problem and lack of learning features of today’s deep knowledge tracking models, a deep knowledge tracking model (FSA-MuLSTM) based on forgetting features and the self-attentiveness mechanism is proposed. Firstly, the model combines the learner’s historical learning interaction tuple sequences with learning times and memory residuals to obtain the input vector based on the LSTM; secondly, the correlation weights between tuples are captured using the self-attention mechanism; finally, the deep information between tuple sequences is captured using the stacking of multilayer LSTMs. The probability of correctly answering the current question is derived from the hidden vectors and the self-attentive weights of the output of the multilayer LSTM. Two public datasets are used for the experiments, and the combined analysis outperforms existing knowledge-tracking models in terms of performance and improves the accuracy of prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Vision-based Autonomous Landing of UAV on Dynamic Apron

Vision-based Autonomous Landing of UAV on Dynamic Apron

引用

2023 IEEE International Conference on Unmanned Systems, ICUS 2023

作者： Yue, Pengyu Xin, Jing Mao, Zhijie Lu, Yongchang Zhang, Youmin Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an710048 China Industrial & Aerospace Engineering Concordia University Department of Mechanical MontrealQCH3G 1M8 Canada

ISBN: (纸本)9798350316308

Aiming at the landing problem of Unmanned Aerial Vehicle (UAV) without landmarks and global coordinates, this paper proposes an efficient vision-based UAV autonomous landing solution. Firstly, image information is obtained from the bottom visual sensor of the UAV, and the YOLOV5 object detection method is employed to determine the initial position of the dynamic apron. Subsequently, an improved dynamic apron tracking method based on Spatio-Temporal Transformer is designed. This method updates an initial template through target detection algorithm and utilizes multi-source perceptual data for confidence evaluation and dynamic template updates. It outputs the distribution estimation of the predicted bounding box corner coordinates, and achieves the high reliability continuous positional smoothing estimation and dynamic apron loss re-detection based on UAV vision. Finally, the UAV calculates the horizontal control quantity based on the horizontal relative position between the UAV and the apron obtained. The vertical control quantity is calculated based on the vertical relative position between the UAV and the apron. The vertical relative position is estimated using laser ranging and visual odometry techniques. Based on the results of horizontal tracking control and vertical regulation, velocity commands for the UAV in all three directions are generated, enabling the UAV to achieve autonomous landing on the dynamic apron. This paper achieves precise landing for dynamic apron in real-world environments. The experimental results demonstrate that this method avoids the limitations of labeled data and global information on autonomous landing of UAV. Even under GPS-denied conditions, the UAV can generate control commands based on visual data and achieve autonomous landing for randomly moving apron. © 2023 IEEE.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Distributed Fixed-Time Algorithms for Time-Varying Constrained Optimization Problems

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： He, Xing Li, Yue Zhang, Meng Huang, Tingwen Southwest University Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Chongqing400715 China Shenzhen University of Advanced Technology Faculty of Computer Science and Control Engineering Shenzhen518055 China

In this paper, the distributed form of the zeroing neural network for solving time-varying optimal problems is put forward. Compared with traditional centralized algorithms, distributed algorithms possess better privacy and scalability. This paper initially proposes a centralized time-varying optimisation algorithm with fixed-time convergence and certain robustness, which is based on the integration-enhanced zeroing neural network. Subsequently, the algorithm is enhanced, and two distributed algorithms are designed separately. Both of these two algorithms have a fixed convergence time and certain robustness. Additionally, this paper utilizes the penalty function approach to handle time-varying optimization problems with inequality constraints, thereby making the algorithm more widely applicable. The effectiveness of the algorithm is verified through several numerical examples, and the applicability of the algorithm is demonstrated by solving the package-level state-of-charge balancing problem. © 2020 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

引用

information Science, Parallel and Distributed Systems (ISPDS), International Conference on

作者： Ya Zhou Ning Zhao Guimin Huang Nanxiao Deng Qingkai Guo Guangxi Key Laboratory of Image and Graphic Intelligent Processing School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China

In sentence similarity research methods, sentence similarity is often calculated from semantic aspects, however, the influence of other features is ignored. For example, the influence of sentence syntactic structure and word order on sentence similarity is not considered. Therefore, This paper proposes a method to measure the degree of similarity between sentences based on a multi-feature fusion of semantics, syntactic similarity and word order similarity, respectively. For the aspect of semantic similarity, in this paper, we first preprocess the sentence and obtain the word vectors, and then obtains sentence vector features through neural networks, so as to calculate the sentence semantic similarity; Finally, for the aspect of word order similarity, word order is considered as the auxiliary feature information to calculate sentence similarity since word order has a smaller effect on sentence similarity compared to the above information. The experimental results show that the proposed model has an accuracy of 77.4 % and an F1 value of 84.3% on the MRPC dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：