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

scPEDSSC: proximity enhanced deep sparse subspace clustering method for scRNA-seq data

PLoS Computational Biology 2025年第4期21卷 e1012924页

作者： Wei, Xiaopeng Wu, Jingli Li, Gaoshi Liu, Jiafei Wu, Xi He, Chang Guangxi Key Lab of Multi-source Information Mining & Security Guangxi Normal University Guangxi Guilin China College of Computer Science and Engineering Guangxi Normal University Guangxi Guilin China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guangxi Guilin China

It is a significant step for single cell analysis to identify cell types through clustering single-cell RNA sequencing (scRNA-seq) data. However, great challenges still remain due to the inherent high-dimensionality, noise, and sparsity of scRNA-seq data. In this study, scPEDSSC, a deep sparse subspace clustering method based on proximity enhancement, is put forward. The self-expression matrix (SEM), learned from the deep auto-encoder with two part generalized gamma (TPGG) distribution, are adopted to generate the similarity matrix along with its second power. Compared with eight state-of-the-art single-cell clustering methods on twelve real biological datasets, the proposed method scPEDSSC can achieve superior performance in most datasets, which has been verified through a number of experiments. © 2025 Wei et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Hybrid-Feature-Based Autoencoder Model for Predicting Traffic Flow to Accelerate Ambulance Medical Response Time in Internet of Vehicles

引用

IEEE Internet of Things Journal 2025年第9期12卷 11397-11407页

作者： Li, Yongmeng Tian, Yu Liu, Wenjian Gao, Longxiang Tian, Hui Xing, Lumin The First Affiliated Hospital of Shandong First Medical University Shandong Provincial Qianfoshan Hospital Shandong Key Laboratory of Digital Diagnosis and Treatment of Thoracic Oncology Shandong Engineering Research Center of Intelligent Surgery Shandong Jinan250014 China Qilu Hospital of Shandong University Department of Thoracic Surgery Shandong Jinan250012 China City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250000 China The First Affiliated Hospital of Shandong First Medical University Shandong Provincial Qianfoshan Hospital Shandong Key Laboratory of Digital Diagnosis and Treatment of Thoracic Oncology Shandong Jinan250014 China

Traffic congestion during ambulance travel can delay medical response times. With the growing availab.lity of traffic data, computational methods for traffic flow prediction are attracting significant attention. However, current computational prediction models have the following shortcomings. Fully connected networks require extensive feature engineering yet struggle to capture local traffic flow features. Their high parameter count increases training time and overfitting risk, while varying traffic conditions hinder model generalization. Therefore, in this work, we propose a hybrid-feature-based autoencoder (HFAE) model to predict traffic flow and accelerate ambulance medical response time in Internet of Vehicles. Specifically, the HFAE model simultaneously considers local features from the convolutional neural network and global features from the fully connected neural network. Additionally, the HFAE model uses an autoencoder to reconstruct the original input, capturing the intrinsic structure of the traffic flow data. Specifically, the root mean-squared error and mean absolute error scores of the HFAE model are better than those of the three mainstream models. © 2014 IEEE.

关键词： Ambulances

来源：评论

学校读者我要写书评

暂无评论

Task Offloading and Resource Allocation Based on Reinforcement Learning and Load Balancing in Vehicular Networking

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Tian, Shujuan Xiang, Shuhuan Zhou, Ziqi Dai, Haipeng Yu, Enze Deng, Qingyong Xiangtan University Key Laboratory of Hunan Province for Internet of Things and Information Security Hunan International Scientific and Technological Cooperation Base of Intelligent network School of Computer Science and School of Cyberspace Security Xiangtan411105 China Nanjing University School of Computer Science and Technology Nanjing211189 China Guangxi Normal University Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guilin541004 China Guangxi Normal University Guangxi Key Lab of Multi-source Information Mining and Security Guilin541004 China

Due to limited on-board resources and the mobility characteristics of vehicles in a multi-access edge computing (MEC)-based vehicular network, efficient task offloading and resource allocation schemes are essential for achieving low-latency and low-energy consumption applications in the Internet of Vehicles (IoV). The spatial distribution of vehicles, influenced by various factors, leads to significant workload variations across MEC servers. In this paper, we address task offloading and resource allocation as a joint optimization problem and propose a Load-Balancing Deep Deterministic Policy Gradient (LBDDPG) algorithm to achieve optimal results. The joint optimization problem is modeled as a Markov Decision Process (MDP), enabling the LBDDPG algorithm to systematically address the challenges of workload imbalance and resource inefficiency. The algorithm incorporates a load optimization strategy to balance workload distribution across MEC servers, mitigating disparities caused by uneven vehicle distributions. The reward function is designed to account for both energy consumption and delay, ensuring an optimal trade-off between these critical factors. To enhance training efficiency, a noise-based exploration strategy is employed, preventing ineffective exploration during the early stages. Additionally, constraints such as computational capacity and latency thresholds are embedded to ensure the algorithm's practical applicability. Experimental results demonstrate that the proposed LBDDPG algorithm achieves faster convergence and superior performance in terms of energy consumption and latency compared to other reinforcement learning algorithms. © 1975-2011 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

LATEXBLEND: Scaling Multi-concept Customized Generation with Latent Textual Blending

arXiv

引用

arXiv 2025年

作者： Jin, Jian Yu, Zhenbo Shen, Yang Fu, Zhenyong Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Sci. & Tech. China

Customized text-to-image generation renders user-specified concepts into novel contexts based on textual prompts. Scaling the number of concepts in customized generation meets a broader demand for user creation, whereas existing methods face challenges with generation quality and computational efficiency. In this paper, we propose LATEXBLEND, a novel framework for effectively and efficiently scaling multi-concept customized generation. The core idea of LATEXBLEND is to represent single concepts and blend multiple concepts within a Latent Textual space, which is positioned after the text encoder and a linear projection. LATEXBLEND customizes each concept individually, storing them in a concept bank with a compact representation of latent textual features that captures sufficient concept information to ensure high fidelity. At inference, concepts from the bank can be freely and seamlessly combined in the latent textual space, offering two key merits for multi-concept generation: 1) excellent scalab.lity, and 2) significant reduction of denoising deviation, preserving coherent layouts. Extensive experiments demonstrate that LATEXBLEND can flexibly integrate multiple customized concepts with harmonious structures and high subject fidelity, substantially outperforming baselines in both generation quality and computational efficiency. Project Page. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Offloading and Caching in Full-Duplex-Enabled Edge Computing networks

引用

IEEE Transactions on Mobile Computing 2025年

作者： Dai, Xingxia Tian, Shujuan Liu, Haolin Li, Zhetao Jiang, Hongbo Deng, Qingyong Xiangtan University School of Computer Science School of Cyberspace Security Xiangtan411105 China Jinan University College of Information Science and Technology Guangzhou510632 China Hunan University College of Computer Science and Electronic Engineering Changsha Hunan410082 China Guangxi Normal University Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guilin541004 China Guangxi Key Lab of Multi-source Information Mining & Security Guangxi Normal University Guilin541004 China

Edge computing (EC) reduces task processing and content download delay by providing computation and caching resources directly to task offloading (TO) users and content request (CR) users. However, existing studies often focus exclusively on either TO users or CR users within EC networks, neglecting the interaction between these two groups. To address this gap, we investigate the offloading and caching decision-making in scenarios where TO and CR users coexist. Furthermore, we employ full-duplex (FD) technology to enhance spectral utilization for edge-end transmissions. Specifically, we jointly optimize offloading and caching in FD-enabled EC networks. To accomplish this, we decompose the formulated optimization problem into three sub-problems using the alternating optimization (AO) method. We then propose a three-subproblem alternating iterative delay minimization algorithm to effectively tackle the challenges of offloading and caching. Additionally, we analyze the convergence and complexity of our proposed algorithm. Finally, we conduct extensive simulations to evaluate the effectiveness of our approach. The simulation results demonstrate that the delay reduction achieved by our algorithm is between 24.78% and 89.23% greater than that of comparative algorithms. © 2002-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Hyper-Relational Knowledge Representation Learning with Multi-Hypergraph Disentanglement 25

Hyper-Relational Knowledge Representation Learning with Mult...

引用

Proceedings of the ACM on Web Conference 2025

作者： Jiecheng Li Xudong Luo Guangquan Lu Shichao Zhang School of Computer Science and Engineering Guangxi Normal University Guilin China Key Lab of Education Blockchain and Intelligent Technology of the Ministry of Education Guangxi Normal University Guilin China and Guangxi Key Lab of Multi-source Information Mining & Security Guangxi Normal University Guilin China

ISBN: (纸本)9798400712746

Hyper-relational knowledge graphs (HKGs) extend the traditional triplet-based knowledge graph by adding qualifiers to the relationships, making HKGs particularly useful for tasks that require more profound understanding and inference from relationships between entities. However, existing hyper-relational knowledge representation learning methods (HKRL) focus on direct neighbourhood information of entities only by neglecting the relational similarity of the main triple in hyper-relational facts and the attribute details in the qualifiers. In addition, few works extract common and private information across multiple views to minimize noise and interference. This paper proposes a multi-hypergraph disentanglement method for HKRL to address the above issues. Specifically, we first construct four hypergraphs to mine and utilise the inherent structure information of HKGs, and then propose to extract common representations among hypergraphs and private representations within individual hypergraphs to mine the semantic information and the task-relevant information, respectively. Experiment results on four real datasets demonstrate the effectiveness of the proposed method compared to SOTA methods in link prediction tasks on HKGs.

关键词： hyper-relational knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Uplink Control information Based Clustered Access and Discontinuous Reception Management for mMTC

引用

IEEE Communications Letters 2025年

作者： Wang, Shao-Di Wang, Chang-Long Wang, Hui-Ming Zhou, Feng Leung, Victor C. M. Xidian University Key Laboratory of Electronic Information Countermeasure and Simulation Technology of Ministry of Education Xi’an710071 China Xi’an Jiaotong University School of Information and Communication Engineering Ministry of Education Key Lab for Intelligent Networks and Network Security Xi’an710049 China Shenzhen MSU BIT University Artificial Intelligence Research Institute Shenzhen518172 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

Uplink control information (UCI) and discontinuous reception (DRX) play important roles for massive machine type communication (mMTC). Despite their standalone significance, a conspicuous gap exists in comprehensively exploring the synergy between UCI and DRX concerning both energy conservation and latency reduction for mMTC. In this letter, we propose a UCI-based clustered access and DRX management (UCADM) scheme that strikes a balance between these two critical performance metrics, reducing energy usage while preserving low latency in uplink-downlink interaction for mMTC. Specifically, we present a strictly feasible solution for the proposed UCADM scheme by using the spectral radius and the constraint projection, which can effectively solve DRX switching operations as indicated by scheduling information from UCI. Simulation results confirm the effectiveness of our scheme. © 1997-2012 IEEE.

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

D4A: An efficient and effective defense across agnostic adversarial attacks

引用

Neural networks 2025年 183卷 106938页

作者： Li, Xianxian Gan, Zeming Bai, Yan Su, Linlin Li, De Wang, Jinyan Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Guangxi Key Lab of Multi-source Information Mining and Security Guangxi Normal University Guilin China School of Computer Science and Engineering Guangxi Normal University Guilin China School of Engineering and Technology University of Washington Tacoma TacomaWA United States

Recent studies show that Graph Neural networks (GNNs) are vulnerable to structure adversarial attacks, which draws attention to adversarial defenses in graph data. Previous defenses designed heuristic defense strategies for specific attacks or graph properties, and are no longer sufficiently robust across all these attacks. To address this problem, we discuss the abnormal behaviors of GNNs in structure perturbations from a posterior distribution perspective. We suggest that the structural vulnerability of GNNs stems from their dependence on local graph smoothing, which can also lead to unfitting — a first-found phenomenon specific to the graph domain. We demonstrate that abnormal behaviors, except for unfitting, can attribute to a posterior distribution shift. To intrinsically prevent the occurrence of abnormal behaviors, we first propose smooth-less message passing to enhance the tolerance with respect to structure perturbations, while significantly mitigating the unfitting. We also propose the distribution shift constraint to restrict other abnormal behaviors of our model. Our approach is evaluated on six different datasets across over four kinds of attacks and compared to 11 representative baselines. The experimental results show that our method improves the defense performance across various attacks, and provides a great trade-off between accuracy and adversarial robustness. © 2024 Elsevier Ltd

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Guided Diffusion Model for Camouflaged Object Detection

引用

IEEE Transactions on Multimedia 2025年

作者： Yang, Jinsheng Zhong, Bineng Liang, Qihua Mo, Zhiyi Zhang, Shengping Song, Shuxiang Guangxi Normal University Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guilin541004 China Guangxi Normal University Guangxi Key Lab of Multi-Source Information Mining & Security China Wuzhou University Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou543002 China Harbin Institute of Technology School of Computer Science and Technology Weihai264209 China

Recently, diffusion models have significantly improved the performance of Camouflaged Object Detection (COD) by adding noise to a mask and iteratively denoising it to match the target distributions. Due to the direct extraction of features from noisy masks and the lack of conditional constraints on a prediction area, the diffusion model may deviate from a correct prediction range and produces mispredictions in regions with high uncertainty. To address this issue, we propose an uncertainty-guided diffusion model (UGDNet) for COD, which explicitly quantifies uncertainty and integrates it as an anchor condition into the diffusion models to provide an initialization of the diffusion regions. The core idea is first to utilize a probability representation and transformer to explicitly model uncertainty, aiming to identify areas where a model may generate overconfident mispredictions. Then, we use the uncertainty as an anchor condition to provide a reference prediction range for the diffusion model, guiding each step of the diffusion process. Furthermore, we use uncertainty to guide feature aggregation, prompting the model to pay extra attention to the semantic features of regions with high uncertainty to refine the segmentation results further. The experimental results indicate that our proposed UGDNet achieves higher accuracy than existing state-of-the-art models on five COD benchmarks, including COD10K, NC4K, CAMO, CHAMELEON, and CDS2K. © 1999-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Stable Data Trading for Unknown Market Based on Blockchain

引用

IEEE Transactions on Mobile Computing 2025年

作者： Deng, Qingyong Zuo, Qinghua Li, Zhetao Liu, Haolin Xie, Yong Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China Guangxi Key Lab of Multi-source Information Mining & Security Guangxi Normal University Guilin541004 China College of Information Science and Technology Jinan University Guangzhou510632 China School of Computer Science Xiangtan University Xiangtan Hunan411105 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu210042 China

Crowdsensing Data Trading (CDT) has emerged as a novel data trading paradigm, where market stability is crucial during the transaction matching process. However, most existing CDT systems usually assume that the preferences of both parties are known and the third-party trading platform is trustworthy, which is impractical in real-world scenarios and leads to significant challenges in reliability and privacy preservation. To address these challenges, we propose a Privacy-Preserving and Stable Data Trading for Unknown Market based on Blockchain and Bilateral Reputation (PPSDT-UMBBR) scheme in the decentralized CDT system. Firstly, a privacy-preserving bilateral preference initialization method is designed to achieve the initial matching of buyers and sellers without exposing their location and attribute privacy. Then, a stable matching method based on dynamic bilateral preference updating is proposed, integrating Differential Privacy, Stable matching theory, and a strategy based on Asymmetric Bilateral Preferences with Multi-armed Bandits (DPS-ABPMAB). Finally, we theoretically analyze the security and prove that the market outcome is δ stable. Furthermore, compared to other benchmark methods based on real datasets, our proposed DPS-ABPMAB algorithm improves the average accumulative reward by at least 4.22%, and reduces the average accumulative regret and the mean evaluation error rate by at least 66.86% and 7.35%, respectively. © 2025 IEEE.

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：