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

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Yongzhe Jia Xuyun Zhang Bowen Liu Wanchun Dou Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Guangdong Laboratory of Artificial Intelligence and Digital Economy(SZ) Shenzhen China Department of Computing Macquarie University Sydney NSW Australia Faculty of Data Science Shiga University Hikone Japan

Federated learning (FL) is an emerging machine learning paradigm that allows distributed participants to train a global model collaboratively. In edge networks, FL involves numerous edge devices updating the local models with the assistance of a central server while keeping the local data on the devices. However, edge devices are commonly resource-limited while neural network models used in FL require significant resource consumption to reach a satisfactory accuracy. Moreover, different devices are various in terms of system capabilities, and employing a uniform model on all devices leads to the derogation of model accuracy. Several pioneer work integrate model pruning techniques into the FL process and focus on reducing the resource consumption on edge devices, whereas neglecting the impact of model generality on accuracy. In our work, we propose FedACP, an efficient FL approach with adaptive channel pruning for edge devices to achieve better resource-accuracy trade-offs. Specifically, we design a two-phase channel pruning approach to adaptively prune local models, in which both the resource constraints and model generalities are taken into consideration. In addition, we also design an aggregation algorithm for aggregating heterogeneous local models produced by the two-phase channel pruning approach. To evaluate the performance of the FedACP, we implement it with a real FL framework FedML and compare it with several state-of-the-art methods. The experimental results show that FedACP achieves better model accuracy while simultaneously reducing 22.41% to 27.34% model parameters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CIXG: A Comprehensive Approach to Driver Gene Identification and Causal Interpretation

CIXG: A Comprehensive Approach to Driver Gene Identification...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yawen Liu Yiwen Chen Shanling Nie Hai Yang Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Center for Continuing and Lifelong Education National University of Singapore Faculty of Engineering The University of Sydney Australia

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

With the ongoing advancements in science and technology and the increasing research focus on cancer-related issues, there has been a proliferation of omics-related resources for in-depth analysis and exploration. This burgeoning volume and complexity of biological data have fostered the integration of machine-learning techniques into biology. As a result, numerous machine-learning strategies have been established to identify driver mutations. Yet, many of these strategies produce complex models, complicating comprehension and thereby clouding the impact of input features on the resulting predictions. Our analysis presented the CIXG framework, which integrates a driver gene prediction module using XGBoost with a causality interpretation module anchored on CXPlain. This architecture enables quantifying each input feature’s contribution to the prediction outcome and ensures precise predictions of driver genes. When benchmarked against the state-of-the-art (SOTA) method, CIXG demonstrated superior accuracy in pinpointing driver genes across pan-cancer studies and within the 32 specific cancer types. Importantly, our results underscored that mutation features chiefly influence CIXG’s predictive prowess, with additional support from other omics features.

关键词： Accuracy Biological system modeling Cause effect analysis Machine learning Predictive models Benchmark testing Complexity theory Bioinformatics Cancer

来源：评论

学校读者我要写书评

暂无评论

ESM all-atom: multi-scale protein language model for unified molecular modeling 24

ESM all-atom: multi-scale protein language model for unified...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Kangjie Zheng Siyu Long Tianyu Lu Junwei Yang Xinyu Dai Ming Zhang Zaiqing Nie Wei-Ying Ma Hao Zhou School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University-Anker Embodied AI Lab Peking University Beijing China School of Artificial Intelligence National Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science Tsinghua University Institute for AI Industry Research (AIR) Tsinghua University and PharMolix Inc. Institute for AI Industry Research (AIR) Tsinghua University

Protein language models have demonstrated significant potential in the field of protein engineering. However, current protein language models primarily operate at the residue scale, which limits their ability to provide information at the atom level. This limitation prevents us from fully exploiting the capabilities of protein language models for applications involving both proteins and small molecules. In this paper, we propose ESMAA (ESM All-Atom), a novel approach that enables atom-scale and residue-scale unified molecular modeling. ESM-AA achieves this by pretraining on multi-scale code-switch protein sequences and utilizing a multi-scale position encoding to capture relationships among residues and atoms. Experimental results indicate that ESM-AA surpasses previous methods in protein-molecule tasks, demonstrating the full utilization of protein language models. Further investigations reveal that through unified molecular modeling, ESM-AA not only gains molecular knowledge but also retains its understanding of proteins.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph Convolutional Network with Long Time Memory for Skeleton-based Action Recognition

Graph Convolutional Network with Long Time Memory for Skelet...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yanpeng Qi Chen Pang Yiliang Liu Hong Liu Lei Lyu School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Academy of Education Recruitment and Examination Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China

Skeleton-based action recognition task has been widely studied in recent years. Currently, the most popular researches use graph convolutional network (GCN) to solve this task by modeling human joints data as spatio-temporal graph. However, a large number of long-term temporal motion relationships cannot be effectively captured by GCN. Thus, recurrent neural network (RNN) is introduced to solve this defect. In this work, we propose a model namely graph convolutional network with long time memory (GCN-LTM). Specifically, there are two task streams in our proposed model: GCN stream and RNN stream, respectively. The GCN stream aims to capture the spatial motion relationships as well as the RNN stream focuses on extracting the long-term temporal patterns. In addition, we introduce the contrastive learning strategy to better facilitate feature learning between these two streams. The multiple ablation experiments have verified the feasibility of our proposed model. Numerous experiments show that the proposed model is superior to the current state-of-the-art method under two large-scale datasets including NTU-RGBD and NTU-RGBD-120.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LECF: recommendation via learnable edge collaborative filtering

引用

science China(Information sciences) 2022年第1期65卷 116-130页

作者： Shitao XIAO Yingxia SHAO Yawen LI Hongzhi YIN Yanyan SHEN Bin CUI School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Technology Peking University National Engineering Laboratory for Big Data Analysis and Applications Peking University

The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering(CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering(LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges(i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.

关键词： collaborative filtering recommender system implicit feedback edge-edge similarity line graph

来源：评论

学校读者我要写书评

暂无评论

Adaptive Student Inference Network for Efficient Single Image Super-Resolution

Adaptive Student Inference Network for Efficient Single Imag...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Kang Miao Zhao Zhang Jiahuan Ren Mingbo Zhao Haijun Zhang Richang Hong School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Yunnan Key Laboratory of Software Engineering Kunming China School of Information Science and Technology Donghua University Shanghai China Department of Computer Science Harbin Institute of Technology (Shenzhen) Shenzhen China

Recent advances in single image super-resolution (SISR) have achieved remarkable performance through deep learning. However, the high computational cost hinders the deployment of SISR models on edge devices. Instead of proposing new SISR models, a new trend is emerging to improve network efficiency by reducing parameters, FLOPs, and inference time through slight modifications to the original models. However, recent methods usually focus on reducing only one of three metrics, i.e., FLOPs, parameters and inference time, which inevitably increases the other two metrics. In this paper, we propose a novel Adaptive Student Inference Network (ASIN) on popular SISR models, which aims at reducing FLOPs and inference time while maintaining the number of parameters and restoring clearer high-resolution images. Specifically, our ASIN divides a SISR model into three components (head, body and tail) and adopts various strategies for each part. For head and tail parts, to ensure the restored images contain more detailed information, a novel auxiliary Enhanced Teacher Network (ETNet) is designed, which is trained with the ground-truth images to obtain more prior knowledge to guide student network to extract more accurate textures using a new knowledge distillation method. For the body part, owing to the varying difficulties of the reconstructions in different regions, we propose an Adaptive Depth Predicted Module (ADPM) to dynamically shorten average depth of network to reduce the computational cost of overall network. Extensive experiments on two datasets demonstrate the effectiveness and state-of-the-art performance of our ASIN compared to its counterparts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PEFN: A Patches Enhancement and Hierarchical Fusion Network for Robust Vehicle Re-Identification

引用

IEEE Internet of Things Journal 2025年

作者： He, Wenying Wang, Feiyu Bai, Yude Xiong, Neal N. Xu, Guangquan Guo, Fei Hebei University of Technology School of Artificial Intelligence Tianjin300401 China Hebei University of Technology Hebei Province Key Laboratory of Big Data Calculation Tianjin300130 China Tiangong University School of Software Tianjin300387 China Northeastern State University Department of Mathematics and Computer Science TahlequahOK74464 United States Tianjin300350 China Central South University School of Computer Science and Engineering Changsha410083 China

Vehicle Re-Identification (Re-ID), which is a significant application in the Internet of Things, aims to accurately retrieve the remaining images of a given vehicle across different cameras views. The improvement in vehicle Re-ID performance largely stems from better addressing the issues of inter-class similarity and intra-class variance. Existing methods, relying solely on max or average pooling after using attention modules, fail to obtain significantly complete and pure global and local features, and neglect the false guidance that some unique individual information on images bring to re-identification. Moreover, models combining global and local features have shown good results in vehicle Re-ID, but these successes neglect the interaction between features across different convolutional layers, resulting in the loss of crucial details for vehicle Re-ID. To tackle these issues, we introduce a Patches Enhancement and hierarchical Fusion Network (PEFN) based on a multi-branch architecture, divided into a Global and Local Attention Supplement (GLAS) branch, and an Enhanced Hierarchical feature fusion (EnHi) branch. The GLAS branch, through the Identity-related Feature Remodeling (IDFR) module’s staged supplementation of spatial and channel features, has achieved the enhancement of both global and local features and effectively mitigated the negative impacts of individual information. The EnHi branch enhances the robustness of feature representation by interacting hierarchical features. Extensive experiments on two large-scale vehicle re-identification datasets demonstrate that our PEFN method outperforms state-of-the-art vehicle re-identification approaches. Specifically, without utilizing extra data and re-ranking, our model achieves 85.15% mAP on the VeRi776 dataset. © 2014 IEEE.

关键词： Reamers

来源：评论

学校读者我要写书评

暂无评论

Improving local search for minimum weighted connected dominating set problem by inner-layer local search 27

Improving local search for minimum weighted connected domina...

引用

27th International Conference on Principles and Practice of Constraint Programming, CP 2021

作者： Li, Bohan Wang, Kai Wang, Yiyuan Cai, Shaowei State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Information Technology Northeast Normal University Changchun China Key Laboratory of Applied Statistics of MOE Northeast Normal University Chnagchun China

ISBN: (纸本)9783959772112

The minimum weighted connected dominating set (MWCDS) problem is an important variant of connected dominating set problems with wide applications, especially in heterogenous networks and gene regulatory networks. In the paper, we develop a nested local search algorithm called NestedLS for solving MWCDS on classic benchmarks and massive graphs. In this local search framework, we propose two novel ideas to make it effective by utilizing previous search information. First, we design the restart based smoothing mechanism as a diversification method to escape from local optimal. Second, we propose a novel inner-layer local search method to enlarge the candidate removal set, which can be modelled as an optimized version of spanning tree problem. Moreover, inner-layer local search method is a general method for maintaining the connectivity constraint when dealing with massive graphs. Experimental results show that NestedLS outperforms state-of-the-art meta-heuristic algorithms on most instances. © Bohan Li, Kai Wang, Yiyuan Wang, and Shaowei Cai.

关键词： Operations research

来源：评论

学校读者我要写书评

暂无评论

Manifold Alignment for Semantically Aligned Style Transfer

Manifold Alignment for Semantically Aligned Style Transfer

引用

International Conference on computer Vision (ICCV)

作者： Jing Huo Shiyin Jin Wenbin Li Jing Wu Yu-Kun Lai Yinghuan Shi Yang Gao State Key Laboratory for Novel Software Technology Nanjing University School of Computer Science & Informatics Cardiff University

ISBN: (纸本)9781665428132

Most existing style transfer methods follow the assumption that styles can be represented with global statistics (e.g., Gram matrices or covariance matrices), and thus address the problem by forcing the output and style images to have similar global statistics. An alternative is the assumption of local style patterns, where algorithms are designed to swap similar local features of content and style images. However, the limitation of these existing methods is that they neglect the semantic structure of the content image which may lead to corrupted content structure in the output. In this paper, we make a new assumption that image features from the same semantic region form a manifold and an image with multiple semantic regions follows a multi-manifold distribution. Based on this assumption, the style transfer problem is formulated as aligning two multi-manifold distributions and a Manifold Alignment based Style Transfer (MAST) framework is proposed. The proposed frame-work allows semantically similar regions between the output and the style image share similar style patterns. Moreover, the proposed manifold alignment method is flexible to allow user editing or using semantic segmentation maps as guidance for style transfer. To allow the method to be applicable to photorealistic style transfer, we propose a new adaptive weight skip connection network structure to preserve the content details. Extensive experiments verify the effectiveness of the proposed framework for both artistic and photorealistic style transfer. Code is available at https://***/NJUHuoJing/MAST.

关键词： Manifolds Image segmentation computer vision Codes Adaptive systems Semantics Covariance matrices

来源：评论

学校读者我要写书评

暂无评论

Coupled Axisymmetric Peridynamics with Stabilized Correspondence Material Model for Ablation and Fracture Problems

SSRN

引用

SSRN 2024年

作者： Zhang, Hanbo Liu, Zhenhai Li, Chengxuan Ye, Hongfei Zhang, Hongwu Li, Hui Zheng, Yonggang State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial Equipment Department of Engineering Mechanics School of Mechanics and Aerospace Engineering Dalian University of Technology Dalian116024 China Science and Technology on Reactor System Design Technology Laboratory Nuclear Power Institute of China Chengdu610200 China

A coupled axisymmetric peridynamics with a stabilized correspondence material model (CA-PD-SCMM) is proposed in this work to effectively simulate the ablation and ductile fracture behaviors of metals under high temperatures. To quantify the damage resulting from compression and shearing deformations, a strain energy density decomposition method is incorporated into the ductile damage model. Furthermore, a novel axisymmetric stabilization method based on peridynamics linearization theory is introduced to mitigate numerical oscillations arising from zero-energy modes in both thermal and mechanical scenarios. To capture the varying geometries and update the boundary conditions during ablation, a moving boundary model is developed based on temperature-associated criteria. To validate the capacity of the proposed CA-PD-SCMM, several representative numerical experiments are conducted. These examples not only affirm its ability to stabilize numerical oscillations in coupled axisymmetric thermoplastic problems but also demonstrate its capability for accurately simulating ablation and predicting crack propagation. © 2024, The Authors. All rights reserved.

关键词： Ductile fracture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：