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

32nd British Machine Vision Conference, BMVC 2021

作者： Wu, Kewei Wang, Tao Xie, Zhao Guo, Dan Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Human pose estimation is a challenging task that requires the comprehension of the pose structure. This work can refer to spatial relation inference in a pose structure model;how to model the dynamic spatial relation against various unreliable joints is critical. To this end, we propose a Distilling Dynamic Spatial Relation network (DDSR), which builds pose-based graph representation by exploiting the feature of spatial relation from the location distribution of joints. We use a dynamic message propagation mechanism to update the spatial relation on edges. Specifically, to filter out the noisy predictions, we select the joints with high confidence;to enhance the spatial relation in a large receptive field, we propagate multi-stage messages among joints. Besides, to reduce the computation cost of the multi-stage message propagation, we design a cross-resolution distillation framework. We use a new spatial distillation loss to verify the spatial relation between the teacher model and the student model. Experimental results on COCO and MPII datasets show that our method is superior to the state-of-the-art methods. The visualization results further verify the interpretability of our spatial relation. © 2021. The copyright of this document resides with its authors.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

A New Partial Task Offloading Method in a Cooperation Mode under Multi-Constraints for Multi-UE

引用

computers, Materials & Continua 2023年第9期76卷 2879-2900页

作者： Shengyao Sun Ying Du Jiajun Chen Xuan Zhang Jiwei Zhang Yiyi Xu School of Information Science and Technology Zhengzhou Normal UniversityZhengzhou450044China Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng475004China School of Geography and Tourism Zhengzhou Normal UniversityZhengzhou450044China Science and Engineering College South China University of TechnologyGuangzhou510641China Department of Electrical and Electronic Engineering Luohe Vocational Technology CollegeLuohe462002China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing100876China Cardiff School of Engineering Cardiff UniversityCardiffCF103XQ 15UK

In Multi-access Edge Computing(MEC),to deal with multiple user equipment(UE)’s task offloading problem of parallel relationships under the multi-constraints,this paper proposes a cooperation partial task offloading method(named CPMM),aiming to reduce UE’s energy and computation consumption,while meeting the task completion delay as much as *** first studies the task offloading of single-UE and then considers the task offloading ofmulti-UE based on single-UE task *** the critical path algorithmto divide the modules into key and non-key *** to some constraints of UE-self when offloading tasks,it gives priority to non-key modules for offloading and uses the evaluation decision method to select some appropriate key modules for *** on fully considering the competition between multiple UEs for communication resources and MEC service resources,CPMM uses the weighted queuing method to alleviate the competition for communication resources and uses the branch decision algorithm to determine the location of module offloading by BS according to the MEC servers’*** achieves its goal by selecting reasonable modules to offload and using the cooperation ofUE,MEC,andCloudCenter to determine the execution location of *** experiments demonstrate that CPMM obtains superior performances in task computation consumption reducing around 6%on average,task completion delay reducing around 5%on average,and better task execution success rate than other similar methods.

关键词： MEC partial task offloading parallel dependencies completion delay

来源：评论

学校读者我要写书评

暂无评论

Convolution Neural Network for Renal Function Assessment Based on Glomerular Filtration Rate

Convolution Neural Network for Renal Function Assessment Bas...

引用

2021 International Conference on Advanced Technologies and Applications of Modern Industry, ATAMI 2021

作者： Wu, Congzhong Wang, Lulu Yang, Zhen Wang, Jing Han, Li Li, Fei Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230601 China School of Computer and Information Hefei University of Technology Hefei Anhui230601 China The Second Hospital of Anhui Medical University Hefei Anhui230601 China

Objective: To develop a Convolution Neural Network (CNN) and discuss its performance in the estimation of Glomerular Fifiltration Rate (GFR) for patients with chronic kidney disease (CKD). Methods: A total of 112 patients with chronic kidney disease were enrolled in this study. The GFR is measured by 99mTc-DTPA renal dynamic and used as standard GFR after normalization by body surface area imaging. We established a CNN model and verified the performance of the model by comparing the GFR predicted by the model with the standard GFR. It turned out that the CNN could better evaluate the GFR of patients which is superior to the CG formula, MDRD formula, CKD-EPI formula and GRNN model. Conclusions: The CNN significantly evaluated GFR for patients with CKD, and it showed better performance than traditional methods and GRNN model and closer to the results of 99mTc-DTPA. The experimental results demonstrated that CNN could be used to estimate GFR. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Logic-Aware knowledge Graph Reasoning for Structural Sparsity under Large Language Model Supervision 25

Logic-Aware Knowledge Graph Reasoning for Structural Sparsit...

引用

34th ACM Web Conference, WWW 2025

作者： Pan, Yudai Hong, Jiajie Zhao, Tianzhe Song, Lingyun Liu, Jun Shang, Xuequn School of Computer Science Northwest Polytechnical University Shaanxi Xi’an China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Shaanxi Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an China Research & Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an China

ISBN: (纸本)9798400712746

knowledge Graph (KG) reasoning aims to predict missing entities in incomplete triples, which requires adequate structural information to derive accurate embeddings. However, KGs in the real world are not as dense as the idealized benchmarks, where sparse graph structures restrict the comprehensive structural information for superior performance. Although the logical semantics in KGs shows its potential in alleviating the impact of structural sparsity, there still exist some challenges. The deficient supervision and the semantic gap of logic make it difficult to introduce logical semantics in sparse KG reasoning. To this end, we propose a novel KG reasoning approach LoLLM injecting logic with the supervised information supplied by the Large Language Model (LLM), which is proved to be effective in evaluating and scoring. Firstly, LoLLM derives structural embeddings employing a graph convolutional network (GCN) with relation-aware and triple-aware attention. LoLLM secondly constructs reasoning paths instantiated from the first-order logic rules extracted from sparse KGs, and injects the logical semantics by a designed LLM-enhanced tuning strategy. We propose a textual loss (TL) and a logical loss (LL) in the optimization and obtain logical tuning embeddings of KG in this process. Finally, LoLLM fuses structural embeddings from the GCN and logical tuning embeddings from the LLM-enhanced tuning for scoring and incomplete triple prediction. Extensive experiments on two sparse KGs and a benchmark show that LoLLM outperforms state-of-the-art structure-based and Language Model (LM)-augmented baselines. Moreover, the logic rules with corresponding confidences provide explicit explanations as an interpretable paradigm. © 2025 Copyright held by the owner/author(s).

关键词： Structural analysis

来源：评论

学校读者我要写书评

暂无评论

Lightweight Fine-Tuning a Pretrained Protein Language Model for Protein Secondary Structure Prediction

SSRN

引用

SSRN 2023年

作者： Yang, Wei Liu, Chun Li, Zheng Henan Key Laboratory of Big Data Analysis and Processing Henan Engineering Laboratory of Spatial Information Processing School of Computer and Information Engineering Henan University Kaifeng475004 China

Pretrained large-scale protein language models, such as ESM-1b and ProtTrans, are becoming the fundamental infrastructure for various protein-related biological modeling tasks. Existing works use mainly pretrained protein language models in feature extraction. However, the knowledge contained in the embedding features directly extracted from a pretrained model is task-agnostic. To obtain task-specific feature representations, a reasonable approach is to fine-tune a pretrained model based on labeled datasets from downstream tasks. To this end, we investigate the fine-tuning of a given pretrained protein language model for protein secondary structure prediction tasks. Specifically, we propose a novel end-to-end protein secondary structure prediction framework involving the lightweight fine-tuning of a pretrained model. The framework first introduces a few new parameters for each transformer block in the pretrained model, then updates only the newly introduced parameters, and then keeps the original pretrained parameters fixed during training. Extensive experiments on seven test sets, namely, CASP12, CASP13, CASP14, CB433, CB634, TEST2016, and TEST2018, show that the proposed framework outperforms existing predictors and achieves new state-of-the-art prediction performance. Furthermore, we also experimentally demonstrate that lightweight fine-tuning significantly outperforms full model fine-tuning and feature extraction in enabling models to predict secondary structures. Further analysis indicates that only a few top transformer blocks need to introduce new parameters, while skipping many lower transformer blocks has little impact on the prediction accuracy of secondary structures. Our code and datasets are publicly available at https://***/fengtuan/LIFT_SS. © 2023, The Authors. All rights reserved.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Contamination-Resilient Anomaly Detection via Adversarial Learning on Partially-Observed Normal and Anomalous data 41

Contamination-Resilient Anomaly Detection via Adversarial Le...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Lv, Wenxi Su, Qinliang Wan, Hai Xu, Hongteng Xu, Wenchao School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Gaoling School of Artifical Intelligence Renmin University of China Beijing China Department of Computing The Hong Kong Polytechnic University Hong Kong

Many existing anomaly detection methods assume the availability of a large-scale normal dataset. But for many applications, limited by resources, removing all anomalous samples from a large unlabeled dataset is unrealistic, resulting in contaminated datasets. To detect anomalies accurately under such scenarios, from the probabilistic perspective, the key question becomes how to learn the normal-data distribution from a contaminated dataset. To this end, we propose to collect two additional small datasets that are comprised of partially-observed normal and anomaly samples, and then use them to help learn the distribution under an adversarial learning scheme. We prove that under some mild conditions, the proposed method is able to learn the correct normal-data distribution. Then, we consider the overfitting issue caused by the small size of the two additional datasets, and a correctness-guaranteed flipping mechanism is further developed to alleviate it. Theoretical results under incomplete observed anomaly types are also presented. Extensive experimental results demonstrate that our method outperforms representative baselines when detecting anomalies under contaminated datasets. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Feature Rotation Invariance Learning for Point Cloud Analysis 10

Feature Rotation Invariance Learning for Point Cloud Analysi...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Shi, Lu Cao, Qi Zhang, Guoqing Yi, Jin Huang, Yansen Cen, Yigang Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation The School of Computer Science and Technology Visual Intellgence +X International Cooperation Joint Laboratory of Moe Beijing100044 China University of Glasgow The School of Computing Science 567739 Singapore Beijing Jiaotong University With the Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education The State Key Laboratory of Advanced Rail Autonomous Operation The School of Computer and Information Technology Beijing100044 China Guizhou University Guizhou Lianjian Civil Engineering Quality Testing Monitoring Center Co. Ltd The College of Civil Engineering Guizhou550025 China

ISBN: (纸本)9798331520861

While deep learning has significantly advanced point cloud analysis, extracting effective features from their disordered structure remains challenging. Existing approaches often rely on complex network architectures or manual feature engineering to achieve rotation invariance, which increases inference latency. This paper offers a novel perspective on this challenge, showing that rotation-sensitive models can achieve performance comparable to rotation-invariant models when trained with rotation-augmented data. Given the significant differences in the feature distributions of rotation-sensitive and rotation-invariant models, we propose Feature Rotation Invariance Learning (FRIL), a framework that leverages Distance Metric Learning and rotation-based constraints to help rotation-sensitive models extract rotation-invariant features. This approach eliminates the need for additional modules, enabling robust performance against rotations. Extensive experiments demonstrate that FRIL consistently outperforms existing rotation-invariant methods across various visual tasks. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Anomaly Detection Method Fusing Isolation Forest and knowledge Graph Reasoning 19th

A Fine-Grained Anomaly Detection Method Fusing Isolation For...

引用

19th International Conference on Web information Systems and Applications, WISA 2022

作者： Xu, Jie Zhou, Jiantao College of Computer Science Engineering Research Center of Ecological Big Data Ministry of Education National and Local Joint Engineering Research Center of Mongolian Intelligent Information Processing Technology Inner Mongolia Cloud Computing and Service Software Engineering Laboratory Inner Mongolia Social Computing and Data Processing Key Laboratory Inner Mongolia Discipline Inspection and Supervision Big Data Key Laboratory Inner Mongolia Big Data Analysis Technology Engineering Laboratory Inner Mongolia University Hohhot China

ISBN: (纸本)9783031203084

Anomaly detection aims to find outliers data that do not conform to expected behaviors in a specific scenario, which is indispensable and critical in current safety environments related studies. However, when performing outlier detection on a large-scale multidimensional dataset, most of the traditional methods make no distinctions between classes of outliers and lack the reasoning ability and the explainability of the analysis results, which leads to the low accuracy of global outlier detection and the inability to effectively identify local outliers. In this paper, we propose a fine-grained anomaly detection method which well utilizes isolation forest and knowledge graph reasoning tactics. First, a better extracting data feature method and a more reasonable weighted strategy are used to find global outliers based on the traditional isolation forest algorithm, and then we construct a custom rule base according to the in-depth research and analysis of global abnormal data, and at last the ontology knowledge is reasoned based on such rule base to achieve the detection of local outliers. Through analysis of extensive experiment results, our method could effectively discover more abnormal data without big loss of time costs, has strong generalization, and correspondingly improves the performance for abnormal detection. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Prediction of Ionospheric TEC Based on BLS-LSTM-GRU Hybrid Model 14th

Prediction of Ionospheric TEC Based on BLS-LSTM-GRU Hybrid M...

引用

14th China Satellite Navigation Conference, CSNC 2024

作者： Li, Dengao Zhang, Xinfang Zhao, Jumin Wu, Fanming Feng, Ran Zhao, Jinhua Shi, Danyang College of Data Science Taiyuan University of Technology Taiyuan030024 China College of Information and Computer Taiyuan University of Technology Taiyuan030024 China Key Laboratory of Big Data Fusion Analysis and Application of Shanxi Province Taiyuan030024 China Intelligent Perception Engineering Technology Center of Shanxi Taiyuan030024 China Shanxi Province Engineering Technology Research Center of Spatial Information Network Taiyuan030024 China

ISBN: (纸本)9789819969272

In satellite communications, global navigation satellite systems(GNSS) and other important space activities, the value of total electron content (TEC) in the ionosphere directly affects the size of ionospheric delay. Achieving accurate prediction of ionospheric total electron content through modeling can effectively improve the reliability and accuracy of GNSS positioning. Considering the high prediction accuracy of long short-term memory neural network (LSTM) and the fast training speed of gated recurrent unit network (GRU), but it is easy to fall into the local optimum, while the width learning system(BLS) can effectively avoid this drawback. Therefore, this paper proposes a model for predicting the total electron content of the ionosphere, which consists of a broad learning system, an LSTM network and a GRU networks. Six parameters of TEC, geomagnetic index Dst, Kp, Ap, solar activity index F10.7, and hour (HD) are selected as input features from the observed data to predict the variation of the total ionospheric electron content. The results generate prediction maps of the total ionospheric electron content and are compared with empirical models and conventional neural network models at different times and solar activity conditions. The experimental results show that the root mean square error (RMSE) of the prediction results of this BLS-LSTM-GRU model is decreased by 23.07%, 17.48% and 9.46% compared with the IRI-2016, NeQuick and CNN-LSTM prediction models, respectively, with higher prediction accuracy. © 2024, Aerospace information Research Institute.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

RECC: A Relationship-Enhanced Content Caching Algorithm Using Deep Reinforcement Learning 6

RECC: A Relationship-Enhanced Content Caching Algorithm Usin...

引用

6th Asian Conference on Artificial Intelligence Technology, ACAIT 2022

作者： Ren, Jiarui Zhang, Haiyan Zhou, Xiaoping Zhu, Menghan Ningxia University School of Information Engineering Yinchuan China Beijing University of Civil Engineering and Architecture Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing China

ISBN: (纸本)9781665453110

Mobile edge caching (MEC) is a promising technology to alleviate traffic congestion in the network. Current studies explored deep reinforcement learning (DRL)-based MEC methods. These methods consider the dynamics of the request size to maximize the cache hit rate. However, they usually ignored the potential request relationships among contents. Two contents with a strong relationship are usually requested sequentially. Inspired by this assumption, this paper proposes a relationship-enhanced content caching algorithm using DRL, named RECC. Our RECC infers user preferences by mining the request relationships among contents. In this work, the relationships are modeled as request sequences, and the request features are learned by using graph embedding. These features will be used as input of state in our DRL-based algorithm. We utilize the Wolpertinger architecture to solve the limitation of large discrete action space. The simulation results indicate that our RECC outperformed the traditional cache policies and state-of-the-art DRL-based method in cache hit rate. Furthermore, the proposed RECC has advantages in long-term stability in the environment where content popularity changes dynamically, and also has a higher cache hit rate when handling the requests with number changes dynamically. © 2022 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：