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

A Framework for Multiclass Contour Visualization

IEEE Transactions on Visualization and computer Graphics 2023年第1期29卷 353-362页

作者： Li, Sihang Yu, Jiacheng Li, Mingxuan Liu, Le Zhang, Xiaolong Luke Yuan, Xiaoru Laboratory of Machine Perception Ministry of Education School of AI Peking University China Center for Data Science Academy for Advanced Interdisciplinary Studies Peking University China National Engineering Laboratory for Big Data Analysis and Application Peking University China School of Computer Science Northwestern Polytechnical University China College of Information Sciences and Technology Pennsylvania State University United States

Multiclass contour visualization is often used to interpret complex data attributes in such fields as weather forecasting, computational fluid dynamics, and artificial intelligence. However, effective and accurate representations of underlying data patterns and correlations can be challenging in multiclass contour visualization, primarily due to the inevitable visual cluttering and occlusions when the number of classes is significant. To address this issue, visualization design must carefully choose design parameters to make visualization more comprehensible. With this goal in mind, we proposed a framework for multiclass contour visualization. The framework has two components: a set of four visualization design parameters, which are developed based on an extensive review of literature on contour visualization, and a declarative domain-specific language (DSL) for creating multiclass contour rendering, which enables a fast exploration of those design parameters. A task-oriented user study was conducted to assess how those design parameters affect users' interpretations of real-world data. The study results offered some suggestions on the value choices of design parameters in multiclass contour visualization. © 2022 IEEE.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Key Clues Guided Video Character Social Relationship Recognition Enhanced by LLM

Key Clues Guided Video Character Social Relationship Recogni...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Dong, Wenlong Zhu, Qing Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China

ISBN: (纸本)9798350368741

Video Character Social Relationship Recognition (VCSRR) requires a comprehensive consideration about spatio-temporal and multi-modal clues in videos. Most existing methods mainly focus on integrating multi-modal clues and modeling interactions among characters. However, they fail to discover key clues in the complex video data or fully understand the clues related to social relationships. In this article, we propose a novel Large Language Model Enhanced Key Clues Selection (LEKCS) framework to address the aforementioned issues. The core of LE-KCS is to mine multi-scale key clues from the perspectives of time, space and multi-modality, then transfer the knowledge about social relationships of the Large Language Model to VCSRR for understanding the selected clues. We evaluated LEKCS on the MovieGraphs dataset and the experimental results indicate that our proposed LE-KCS achieves state-of-the-art performance. © 2025 IEEE.

关键词： large language model Social relationship recognition video understanding

来源：评论

学校读者我要写书评

暂无评论

Differentially Private and Heterogeneity-Robust Federated Learning With Theoretical Guarantee

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6369-6384页

作者： Wang, Xiuhua Wang, Shuai Li, Yiwei Fan, Fengrui Li, Shikang Lin, Xiaodong Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Guelph School of Computer Science GuelphONN1G 2W1 Canada

Federated learning (FL) is a popular distributed paradigm where enormous clients collaboratively train a machine learning (ML) model under the orchestration of a central server without knowing the clients' private raw data. The development of effective FL algorithms faces multiple practical challenges including data heterogeneity and clients' privacy protection. Despite that numerous attempts have been made to deal with data heterogeneity or rigorous privacy protection, none have effectively tackled both issues simultaneously. In this article, we propose a differentially private and heterogeneity-robust FL algorithm, named DP-FedCVR to mitigate the data heterogeneity by following the client-variance-reduction strategy. Besides, it adopts a sophisticated differential privacy (DP) mechanism where the privacy-amplified strategy is applied, to achieve a rigorous privacy protection guarantee. We show that the proposed DP-FedCVR algorithm maintains its heterogeneity-robustness though DP noises are incorporated, while achieving a sublinear convergence rate for a nonconvex FL problem. Numerical experiments based on image classification tasks are presented to demonstrate that DP-FedCVR provides superior performance over the benchmark algorithms in the presence of data heterogeneity and various DP privacy budgets. © 2020 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Offloading Algorithm for Opportunistic Networks Integrating Node Influence Prediction 18th

Probabilistic Offloading Algorithm for Opportunistic Networ...

引用

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Tang, Qi Xu, Xiaodong Li, Shuai Seah, Winston Xu, Gang College of Computer Science Inner Mongolia University Hohhot010021 China The Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia University Hohhot010021 China Victoria University of Wellington Wellington New Zealand

ISBN: (纸本)9783031714634

In Opportunistic Network based mobile data diversion algorithms, the need for multi-hop transmission makes the selection of the next hop node critical. The traditional Prophet algorithm calculates the encounter delivery probability of a node based on historical encounter information as a forwarding condition. However, algorithms for data diversion are more concerned with the issue of nodes’ propagation influence in the network. Therefore, in this paper, we propose a metric to measure the dynamic influence of a node (sir) and use the CNN-BiLSTM-Attention model to predict the sir value of a node during the current time period in the route. After that, a data diversion algorithm based on deep learning prediction of node influence is proposed in combination with encounter delivery probability. The experimental results show that the NS-Prophet algorithm performs well in terms of performance metrics in opportunistic networks, and the triage efficiency in cellular networks is also improved. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： data diversion deep learning prediction node influence opportunistic networks

来源：评论

学校读者我要写书评

暂无评论

Multilingual Knowledge Graph Completion via Multimodal Decouple and Relation-based Ensemble Inference 29

Multilingual Knowledge Graph Completion via Multimodal Decou...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Xiaojing Jiang, Xuesong Yi, Fengge Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

The objective of Multimodal Knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance. © 2023 IEEE.

关键词： knowledge graph knowledge graph completion multimodal fusion

来源：评论

学校读者我要写书评

暂无评论

Grassland Mouse Hole Recognition Model Based on UAV Remote Sensing and Improved YOLOv7

Grassland Mouse Hole Recognition Model Based on UAV Remote S...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yu Han Xiangyu Bai Xiaochen Gao Haoran Cheng Kexin Zhou Engineering Research Center of Ecological Big Data Ministry of Education College of Computer Science Inner Mongolia University Hohhot China Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

As the most widely distributed vegetation type on Earth, grasslands are the second largest ecosystem after forests, and are known as the “skin of the earth”. However, the frequency of rodent infestation has been increasing year by year in recent years due to climate change, loose soil and other factors. As the current traditional monitoring methods are time-consuming and laborious, while the deep learning method has the advantages of low cost, high efficiency and high accuracy. Therefore, this paper proposes a combination of UAV remote sensing and deep learning methods to monitor grassland mouse hole. First, because there is no publicly available grassland mouse hole dataset, this study used a UAV to capture images to create a grassland mouse hole dataset. Second, an improved YOLOv7 model, YOLOAPM, is proposed with the goal of improving the accuracy of small target recognition. Through ablation and comparison experiments, the validity of the improved model as well as the method of this paper are verified to be improved compared to other models. Finally, in order to facilitate the monitoring task of the researchers, a monitoring system is established and the mouse hole identification of this paper is embedded into the system.

关键词： Deep learning Earth Grasslands Accuracy Target recognition Rodents Rats Autonomous aerial vehicles Monitoring Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Aggregating Structural Features for Computational Analysis of Mutations in BRCT Domains of BRCA1 Protein

Aggregating Structural Features for Computational Analysis o...

引用

2023 International Conference on Informatics, Multimedia, Cyber and Information Systems, ICIMCIS 2023

作者： Hidayat, Alam Ahmad Nirwantono, Rudi Isnan, Mahmud Trinugroho, Joko Pebrianto Pardamean, Bens Bina Nusantara University School of Computer Science Bioinformatics and Data Science Research Center Mathematics Department Jakarta11480 Indonesia Bina Nusantara University Faculty of Engineering Bioinformatics and Data Science Research Center Biotechnology Department Jakarta11480 Indonesia Bina Nusantara University Bioinformatics and Data Science Research Center Jakarta11480 Indonesia Binus Graduate Program Bioinformatics and Data Science Research Center Computer Science Department Jakarta11480 Indonesia

ISBN: (纸本)9798350307306

Understanding the mechanistic interpretability of mutation effects in a protein can help predict the clinical implications of the genetic variants. Hence, computational variant effect predictions that involve protein structural features of the protein mutations might be suitable in this case. In this work, we focus on BRCT domains of BRCA1 gene that is widely studied in breast cancer studies. We retrieved 88 selected missense variants found in BRCT domains annotated in both ClinVar and gnomAD databases. To computationally characterize the pathogenic property of the mutations we used two types of features extracted from protein structures: a change in free Gibbs energy and a set of features derived from molecular dynamics simulations of each mutant. Using a dimensional reduction and Gaussian mixture model (GMM)-based clustering we demonstrate that the variants are segregated into two regions that may correspond to their pathogenic status. This method can be a potential computational pipeline for providing the preliminary mechanistic interpretation of mutation effects in terms of their thermodynamic and structural features. © 2023 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

ES-Mask: Evolutionary Strip Mask for Explaining Time Series Prediction 37

ES-Mask: Evolutionary Strip Mask for Explaining Time Series ...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Sun, Yifei Song, Cheng Lu, Feng Li, Wei Jin, Hai Zomaya, Albert Y. National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia

ISBN: (纸本)9781577358800

Machine learning models are increasingly used in time series prediction with promising results. The model explanation of time series prediction falls behind the model development and makes less sense to users in understanding model decisions. This paper proposes ES-Mask, a post-hoc and model-agnostic evolutionary strip mask-based saliency approach for time series applications. ES-Mask designs the mask consisting of strips with the same salient value in consecutive time steps to produce binary and sustained feature importance scores over time for easy understanding and interpretation of time series. ES-Mask uses an evolutionary algorithm to search for the optimal mask by manipulating strips in rounds, thus is agnostic to models by involving no internal model states in the search. The initial experiments on MIMIC-III data set show that ES-Mask outperforms state-of-the-art methods. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Predicting CircRNA-Disease Associations Through Non-negative Matrix Factorization and Adversarially Regularized Variational Graph Autoencoder

Predicting CircRNA-Disease Associations Through Non-negative...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lu, Mianshuo Wang, Lei Sun, Jinzhu Li, Yang Wei, Mengmeng Wei, Yu Liu, Changchun Li, Zhengwei China University of Mining and Technology School of Computer Science and Technology Xuzhou221116 China Guangxi Academy of Sciences Big Data and Intelligent Computing Research Center Nanning530007 China Zaozhuang Mental Health Center Zaozhuang277100 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Zaozhuang Univerity College of Information Science and Enginnering 277100 China

ISBN: (纸本)9798350386226

Circular RNA (circRNA) is an RNA molecule that plays an important role in both pathology and physiology. Accurate identification of associations between circRNAs and diseases is crucial for further physiology research. However, verifying the circRNA-disease associations (CDA) through biological experimental methods is time-consuming. Here, we propose a novel method combines Non-negative Matrix Factorization (NMF) and Adversarially Regularized Variational Graph Autoencoder (ARVGA) to accurately predict CDA. Our model first fuses multi-source information in order to build circRNA similarity, disease similarity and circRNA-disease association matrices. Thereby our model constructs graphs for circRNA and disease respectively and optimize them using a K-means clustering algorithm. We obtain linear features using NMF and non-linear features using ARVGA. Finally, an Extremely Randomized Trees classifier is employed to predict CDA. On the gold standard dataset CircR2Disease, our model achieved a prediction accuracy of 94.8% and an AUC of 0.984 under 5-fold cross-validation. In case study, 19 of top 20 predicted circRNAs associated with Hepatocellular Carcinoma were confirmed in relevant literature. Furthermore, ablation experiment, classifier experiment and independent datasets test fully demonstrate the effectiveness and robustness of our model. © 2024 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

LOPO: An Out-of-order Layer Pulling Orchestration Strategy for Fast Microservice Startup 42

LOPO: An Out-of-order Layer Pulling Orchestration Strategy f...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Gu, Lin Huang, Junhao Huang, Shaoxing Zeng, Deze Li, Bo Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China China University of Geosciences School of Computer Science Wuhan China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Container based microservices have been widely applied to promote the cloud elasticity. The mainstream Docker containers are structured in layers, which are organized in stack with bottom-up dependency. To start a microservice, the required layers are pulled from a remote registry and stored on its host server, following the layer dependency order. This incurs long microservice startup time and hinders the performance efficiency. In this paper, we discover that, for the first time, the layer pulling order can be adjusted to accelerate the microservice startup. Specifically, we address the problem on microservice layer pulling orchestration for startup time minimization and prove it as NP-hard. We propose a Longest-chain based Out-of-order layer Pulling Orchestration (LOPO) strategy with low computational complexity and guaranteed approximation ratio. Through extensive real-world trace driven experiments, we verify the efficiency of our LOPO and demonstrate that it reduces the microservice startup time by 22.71% on average in comparison with state-of-the-art solutions. © 2023 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：