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

arXiv 2024年

作者： Li, Qingliang Mei, Weidong Ning, Boyu Zhang, Rui Chengdu China School of Science and Engineering Shenzhen Research Institute of Big Data Chinese University of Hong Kong Shenzhen China Department of Electrical and Computer Engineering National University of Singapore Singapore

Movable antennas (MAs) have received increasing attention in wireless communications due to their capability of antenna position adjustment to reconfigure wireless channels. However, moving MAs results in non-negligible delay, which may decrease the effective data transmission time. To reduce the movement delay, we study in this paper a new MA trajectory optimization problem. In particular, given the desired destination positions of multiple MAs, we aim to jointly optimize their associations with the initial MA positions and the trajectories for moving them from their respective initial to destination positions within a given two-dimensional (2D) region, such that the delay of antenna movement is minimized, subject to the inter- MA minimum distance constraints in the movement. However, this problem is a continuous-time mixed-integer linear programming (MILP) problem that is challenging to solve. To tackle this challenge, we propose a two-stage optimization framework that sequentially optimizes the MAs' position associations and trajectories, respectively. First, we relax the inter-MA distance constraints and optimally solve the resulted delay minimization problem. Next, we check if the obtained MA association and trajectory solutions satisfy the inter-MA distance constraints. If not satisfied, we then employ a successive convex approximation (SCA) algorithm to adjust the MAs' trajectories until they satisfy the given constraints. Simulation results are provided to show the effectiveness of our proposed trajectory optimization method in reducing the movement delay as well as draw useful insights. Copyright © 2024, The Authors. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

scBERC: A Batch Effect-Removed Clustering method for single-cell omics

scBERC: A Batch Effect-Removed Clustering method for single-...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Zhou, Yitao Yang, Fan Wang, Ying Zeng, Feng Department of Automation Xiamen University Xiamen China National Institute for Data Science in Health and Medicine Xiamen University Xiamen China Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Xiamen University Xiamen China State Key Laboratory of Cellular Stress Biology School of Life Sciences Xiamen University Xiamen China Research Unit of Cellular Stress of Cams Cancer Research Center School of Medicine Xiamen University Xiamen China

ISBN: (纸本)9798350337488

Single-cell clustering is a pivotal technique in deciphering single-cell omics data, enabling us to gain insights into cell function and heterogeneity. However, the presence of batch effects in single-cell omics data poses significant challenges to the accuracy and reliability of single-cell clustering. To address these challenges, we develop a Batch Effect-Removed Clustering method(scBERC) that incorporates a novel single-cell augmentation strategy and contrastive learning. By augmenting cells with artificially induced variations, our approach captures the full range of cell states, accounting for both biological heterogeneity and batch-specific variations. This augmentation strategy enriches the training data while the contrastive learning strategy better extracts real biological features, allowing the deep subspace clustering algorithm to learn robust and generalized patterns, thereby mitigating the biases introduced by batch effects. Experimental results on twelve real single-cell datasets demonstrate that scBERC outperforms existing single-cell clustering methods, significantly improving clustering performance and facilitating downstream analysis. © 2023 IEEE.

关键词： Batch effects Contrastive learning data augmentation Deep subspace clustering Single-cell

来源：评论

学校读者我要写书评

暂无评论

Multi-Pair Temporal Sentence Grounding via Multi-Thread Knowledge Transfer Network 39

Multi-Pair Temporal Sentence Grounding via Multi-Thread Know...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Fang, Xiang Fang, Wanlong Wang, Changshuo Liu, Daizong Tang, Keke Dong, Jianfeng Zhou, Pan Li, Beibei Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China Nanyang Technological University Singapore Peking University China Guangzhou University China Zhejiang Gongshang University China

ISBN: (纸本)157735897X

Given some video-query pairs with untrimmed videos and sentence queries, temporal sentence grounding (TSG) aims to locate query-relevant segments in these videos. Although previous respectable TSG methods have achieved remarkable success, they train each video-query pair separately and ignore the relationship between different pairs. To this end, in this paper, we pose a brand-new setting: Multi-Pair TSG, which aims to co-train these pairs. We propose a novel video-query co-training approach, Multi-Thread Knowledge Transfer Network, to locate a variety of video-query pairs effectively and efficiently. Firstly, we mine the spatial and temporal semantics across different queries to cooperate with each other. To learn intra- and inter-modal representations simultaneously, we design a cross-modal contrast module to explore the semantic consistency by a self-supervised strategy. To fully align visual and textual representations between different pairs, we design a prototype alignment strategy to 1) match object prototypes and phrase prototypes for spatial alignment, and 2) align activity prototypes and sentence prototypes for temporal alignment. Finally, we develop an adaptive negative selection module to adaptively generate a threshold for cross-modal matching. Extensive experiments show the effectiveness and efficiency of our proposed method. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

UGCM-LU: A Unified Stream and Batch Graph Computing Model with Local Update for Community Detection 19th

UGCM-LU: A Unified Stream and Batch Graph Computing Model w...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Li, Hong Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Unified stream and batch computing (USBC) aims to incorporate stream and batch computation into a unified framework, thereby enabling the development of a one-stop solution for stream and batch data processing and enhancing the generalization of the framework. However, research on unified graph computing models (UGCMs) faces several challenges. First, existing UGCMs need to consider all graph information in the cache during the incremental update phase, thus leading to decreased execution efficiency. Second, existing UGCMs use fixed bytes to store nodes without considering the actual space occupied by nodes resulting in wasted memory when dealing with large graphs. This paper proposes a UGCM with Local Updates for community detection (UGCM-LU). We first implement a local update strategy to consider partial information of the graph to achieve incremental updates. Secondly, we also designed a byte-compression-based module to store graph data according to the space occupied by nodes. The experimental results show the effectiveness and efficiency of the model in real-world and artificial networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lutetium alloys

来源：评论

学校读者我要写书评

暂无评论

A Novel DDoS Detection Model for SDN Using Single-Class Cluster Oversampling and Weighted Ensemble Method

A Novel DDoS Detection Model for SDN Using Single-Class Clus...

引用

International Conference on Network Protocols

作者： Hao Zhang Shuqi Wu Jie Pan Zhi Wang Xiaolong Sun College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou China

ISBN: (数字)9798350351712

ISBN: (纸本)9798350351729

The centralized control plane characteristic of Software Defined Networking (SDN) makes it a prime target for Distributed Denial of Service (DDoS) attacks. A significant issue in network traffic data is the severe imbalance between background traffic and various types of DDoS attack traffic. To address this challenge, we propose a novel DDoS detection model based on single-class cluster oversampling and weighted ensemble method. Initially, we design a multi-strategy feature selection using variance inflation factor and recursive feature elimination. Next, we construct a single-class cluster model based on the spatial distribution of samples, and create minority class samples independently within each cluster. Finally, detection results are determined using the weight vector of each base classifier in ensemble learning. The proposed DDoS detection model's performance is validated through simulations of various DDoS attack scenarios in an SDN environment. Experimental results indicate that the proposed strategy exhibits superior performance, showing improvements in precision, recall, and F1 score compared to state-of-the-art techniques.

关键词： Interpolation Protocols Telecommunication traffic Denial-of-service attack Feature extraction Vectors data models Ensemble learning Computer crime Software defined networking

来源：评论

学校读者我要写书评

暂无评论

D-FGNAE: Decentralized Federated Graph Normalized AutoEncoder 19th

D-FGNAE: Decentralized Federated Graph Normalized AutoEncode...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Liang, Yuting Cai, Weixin Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Graphs widely exist in real-world, and Graph Neural Networks (GNNs) have exhibited exceptional efficacy in graph learning in diverse fields. With the strengthening of data privacy protection worldwide in recent years, Federated graph neural networks (FedGNNs) have gained increasing attention in academia and industry owing to their ability to train the model in a collaborative manner while complying with the privacy protection regulations. However, in federated learning, the non-independent and identically distributed (non-IID) problem of local data possessed by multiple participants can significantly undermine model accuracy. We propose a new Decentralized Federated Graph Normalized AutoEncoder (D-FGNAE). First, the model is designed as a decentralized federated learning framework with dynamically assigned tripartite roles. This design eliminates the fixed server role found in traditional federated learning, enhances system fault tolerance, avoids single points of failure, and protects model privacy. Second, the splitting and correcting of calculation by layer in the model, along with the special design of the normalization layer, effectively tackle the non-IID problem in both the structural and attribute aspects. Experimental results on real-world networks demonstrate the effectiveness of D-FGNAE, which can achieve nearly the same accuracy as the centralized model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Movable Antenna Enabled Near-Field Communications: Channel Modeling and Performance Optimization

引用

IEEE Transactions on Communications 2025年

作者： Zhu, Lipeng Ma, Wenyan Xiao, Zhenyu Zhang, Rui National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore Beihang University School of Electronic and Information Engineering Beijing100191 China The Chinese University of Hong Kong School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Movable antenna (MA) technology offers promising potential to enhance wireless communication by allowing flexible antenna movement. To maximize spatial degrees of freedom (DoFs), larger movable regions are required, which may render the conventional far-field assumption for channels between transceivers invalid. In light of it, we investigate in this paper MA-enabled near-field communications, where a base station (BS) with multiple movable subarrays serves multiple users, each equipped with a fixed-position antenna (FPA). First, we extend the field response channel model for MA systems to the near-field propagation scenario. Next, we examine MA-aided multiuser communication systems under both digital and analog beamforming architectures. For digital beamforming, spatial division multiple access (SDMA) is utilized, where an upper bound on the minimum achievable rate across users is derived in closed form. A low-complexity algorithm based on zero-forcing (ZF) is then proposed to jointly optimize the antenna position vector (APV) and digital beamforming matrix (DBFM) to approach this bound. For analog beamforming, orthogonal frequency division multiple access (OFDMA) is employed, and an upper bound on the minimum achievable rate among users is also derived. An alternating optimization (AO) algorithm is proposed to iteratively optimize the APV, analog beamforming vector (ABFV), and power allocation until convergence. For both architectures, we further explore MA design strategies based on statistical channels, with the APV updated less frequently to reduce the antenna movement overhead. Simulation results demonstrate that our proposed algorithms achieve performance close to the derived bounds and also outperform the benchmark schemes using dense or sparse arrays with FPAs. 1972-2012 IEEE.

关键词： Near field communication

来源：评论

学校读者我要写书评

暂无评论

A modified iterative algorithm for solving split equality problems

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2021年第3期83卷 45-54页

作者： Fu, Yuanmin Zhu, Li-Jun Wei, Haicheng School of Mathematics and Information Science North Minzu University Yinchuan750021 China The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province North Minzu University Yinchuan750021 China Health Big Data Research Institute of North Minzu University Yinchuan750021 China Advanced Intelligent Perception Control Technology Innovative Team of NingXia North Minzu University Yinchuan750021 China

In this paper, we investigate the split equality problems in Hilbert spaces. We propose an iterative algorithm with self-adaptive step-size for solving split equality prob-lems. Convergent analysis of the suggested algorithm is proved under some suitable conditions. © 2021, Politechnica University of Bucharest. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

U-Star: AN Asymmetric U-Shaped Network Based on Element-Wise Multiplication to Segment Nuclei in H&E Stained Histological Images 22

U-Star: AN Asymmetric U-Shaped Network Based on Element-Wise...

引用

22nd IEEE International Symposium on Biomedical Imaging, ISBI 2025

作者： Yang, Guangzhengao Zhang, Li Zhao, Jie Chen, Zifan Li, Haoshen Dong, Bin Center for Data Science Peking University China Peking University National Engineering Laboratory for Big Data Analysis and Applications China Peking University Changsha Institute for Computing and Digital Economy China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China National Biomedical Imaging Center Peking University China

ISBN: (纸本)9798331520526

Nuclei segmentation in Hematoxylin and Eosin (H&E) stained images plays a crucial role in cancer diagnosis and pathological evaluation, enabling pathologists to identify abnormal cells and assess their morphology and distribution. While current automated nuclei segmentation methods predominantly employ convolutional neural networks and attention mechanisms, the potential of element-wise multiplication has been largely unexplored. This paper introduces U-Star, a novel asymmetric segmentation network based on the star block that leverages element-wise multiplication. U-Star adopts the classic encoder-decoder architecture and innovatively implements star-connection as an alternative to traditional skip-connections. In experiments on an H&E stained image dataset, U-Star achieved superior performance with a Dice coefficient of 0.8783, accuracy of 0.9089, and IoU of 0.7929, significantly outperforming baseline models. Extensive ablation studies validate the effectiveness of the star-connection and demonstrate the advantages of our proposed framework. Beyond advancing the application of element-wise multiplication techniques, U-Star shows promising potential for broader applications in medical image segmentation. © 2025 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Burst-Sensitive Traffic Forecast via Multi-Property Personalized Fusion in Federated Learning

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5598-5614页

作者： Xue, Jingjing Sun, Sheng Liu, Min Wang, Yuwei Meng, Xuying Wang, Jingyuan Zhang, JunBo Xu, Ke Chinese Academy of Sciences Institute of Computing Technology Beijing100045 China University of Chinese Academy of Sciences Beijing101408 China Zhongguancun Lab Beijing100190 China Beihang University School of Computer Science and Engineering Beijing100191 China Beihang University MIIT Key Laboratory of Data Intelligence and Management Beijing100191 China JD Technology JD iCity JD Intelligent Cities Research Beijing101111 China Tsinghua University Department of Computer Science and Technology Beijing100190 China Zhongguancun Laboratory Beijing100081 China

For distributed network traffic prediction with data localization and privacy protection, Federated Learning (FL) enables collaborative training without raw data exchange across Base Stations (BSs). Nevertheless, traffic across BSs exhibit inherently heterogeneous trend burst and smooth fluctuation properties, but existing FL methods model single-scale series from only one view, which cannot simultaneously capture diverse trend and fluctuation properties, especially distinct burst distributions. In this paper, we propose Personalized Federated Forecasting with Multi-property Self-fusion (P2FMS), which can represent multi-scale traffic properties from different views. With precise multi-property representations, a fusion-level prediction decision is learned for each client in a personalized manner to promptly sense traffic bursts and improve forecasting performance in non-IID settings. Specifically, P2FMS decomposes the traffic series into distinct time scales, based on which, we effectively extract closeness, period, and trend properties from different views. The closeness and period are embedded through global-view representations with spatial correlations, while non-stationary trends are individually fitted from the client-side view. Furthermore, a personalized combiner is designed to accurately quantify the proportion of general fluctuation raws (i.e., closeness and period) and specific trend property in predictions, which enables multi-property self-fusion for each client to accommodate heterogeneous traffic patterns and enhance prediction accuracy. Besides, an alternant training mechanism is introduced to optimize property representation and fusion modules with the convergence guarantee. Extensive experiments on real-world datasets show that P2FMS outperforms status quo methods in both prediction performance and convergence time. © 2002-2012 IEEE.

关键词： Weather forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：