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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Shenhai Zheng Sian Wen Congyu Li Qing Chen Laquan Li College of Computer Science and Technology Chongqing University of Posts and Telecommunications China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education China School of Science Chongqing University of Posts and Telecommunications China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Federated Learning (FL) is an advanced technology that tackles the challenge of blocked data arising from privacy concerns, enabling the training of deep learning models without the need for data sharing. However, FL faces difficulties with heterogeneous data and limited annotations in medical image segmentation. Motivated by this discovery, this study proposes a novel hybrid-supervised federated learning method (FedSLAG) that explores various types of annotations in medical imaging. To focus more on weakly-supervised and unsupervised scenarios within hybrid-supervised learning, a federated Gaussian enhancement module was proposed for heterogeneous sparse annotations (points and scribbles). The feature extraction module combines the features of multiple weakly-supervised clients and establishes the correlation of similar pixels, thus making up for the deficiency of scarce annotations and the insufficient feature extraction capability of a single machine. Then, a two-stage broadcast mechanism based on supervision sparsity was proposed to alleviate optimization deviation in local models. Experiments on breast tumor and skin lesion segmentation tasks demonstrate significant efficiency gains as well as highly competitive segmentation accuracy in many hybrid-supervised situations. Our codes are available at: https://***/TrivenDev/FedSLAG.

关键词： Training Image segmentation Breast tumors Annotations Federated learning Feature extraction Skin Lesions Speech processing Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

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

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan 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 Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

MSONoC: A Metasurface-assisted Hybrid Waveguide/FSO Network-on-Chip Architecture

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2024年

作者： Sun, Wei Li, Jingsi Guo, Pengxing He, Xiangyu Wang, Zimo Hu, Cong Liu, Weichen Hou, Weigang Guo, Lei School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Institute of Intelligent Communications and Network Security Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Guangxi Key Laboratory of Automatic Detecting Technology and Instruments Guilin University of Electronic Technology Guilin541004 China School of Computer Science and Engineering Nanyang Technological University Singapore

Optical networks-on-chips (ONoCs) have emerged as the most promising solution for on-chip interconnection networks, offering distinct advantages such as high bandwidth and low latency. However, traditional wired-based ONoCs often suffer from a high average number of hops, leading to challenges such as increased insertion loss, crosstalk noise, and energy consumption. Therefore, this paper presents a novel ONoC structure known as the metasurface ONoC (MSONoC), which integrates wired waveguide and free-space optical (FSO) transmission with the assistance of metasurfaces. Specifically, this work encompasses the design of a passive metasurface structure tailored for ONoCs, a virtual network cluster partitioning method, an optical metasurface access points select strategy, and a shortest-path routing algorithm. Performance verification is conducted using a modified Noxim simulator. The simulation results demonstrate that the proposed MSONoC offers advantages over traditional NoCs, radio frequency (RF)-based hybrid wired/wireless NoCs, and wired-based ONoCs in terms of throughput, delay, energy consumption, and signal-to-noise ratio under both synthetic traffic and real traffic models. These improvements proves the effectiveness of the MSONoC architecture in optimizing network performance, making it a promising solution for high-performance, energy-efficient communication in on-chip networks. © 2017 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

HPE Transformer: Learning to Optimize Multi-Group Multicast Beamforming Under Nonconvex QoS Constraints

arXiv

引用

arXiv 2024年

作者： Li, Yang Liu, Ya-Feng The Shenzhen Research Institute of Big Data Shenzhen518172 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

This paper studies the quality-of-service (QoS) constrained multi-group multicast beamforming design problem, where each multicast group is composed of a number of users requiring the same content. Due to the nonconvex QoS constraints, this problem is nonconvex and NP-hard. While existing optimization-based iterative algorithms can obtain a suboptimal solution, their iterative nature results in large computational complexity and delay. To facilitate real-time implementations, this paper proposes a deep learning-based approach, which consists of a beamforming structure assisted problem transformation and a customized neural network architecture named hierarchical permutation equivariance (HPE) transformer. The proposed HPE transformer is proved to be permutation equivariant with respect to the users within each multicast group, and also permutation equivariant with respect to different multicast groups. Simulation results demonstrate that the proposed HPE transformer outperforms state-of-the-art optimization-based and deep learning-based approaches for multi-group multicast beamforming design in terms of the total transmit power, the constraint violation, and the computational time. In addition, the proposed HPE transformer achieves pretty good generalization performance on different numbers of users, different numbers of multicast groups, and different signal-to-interference-plus-noise ratio targets. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Improved Fall-down Detection Algorithm: FE-YOLO

Improved Fall-down Detection Algorithm: FE-YOLO

引用

Chinese Control and Decision Conference, CCDC

作者： Yuchen Zhang Hongyan Ma Zongyuan Xie School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China School of Electrical and Information Engineering Institute of Distributed Energy Storage Safety Big Data Beijing Key Laboratory of Intelligent of Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

To address the concerns regarding dataset completeness and detection speed for common fall injuries in the elderly, a comprehensive dataset has been established. Additionally, a lightweight fall detection model named FE-YOLO, which is based on YOLOv8, has been developed. This model replaces the network’s internal feature extraction module with a more efficient Fasternet Block module and introduces an enhanced detection head that utilizes data sharing and grouped convolution techniques. When compared to the YOLOv8n model, the FE-YOLO model demonstrates a reduction in parameters by 43.1%, a decrease in GFLOPs by 51.9%, an improvement in model inference speed by 9.70%, and an increase in FPS by 10.5%. Notably, these enhancements do not significantly impact the average accuracy of the model. The efficiency of the FE-YOLO model renders it suitable for deployment on devices with limited computing power.

关键词： YOLO Convolution Computational modeling Feature extraction Inference algorithms data models Fall detection

来源：评论

学校读者我要写书评

暂无评论

NcoVis: A Visual Analysis Framework for Exploring Academic Collaboration Networks under New Collaborative Relationships 25

NcoVis: A Visual Analysis Framework for Exploring Academic C...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Yu, Ye Wu, Yao Liang, Xi Ma, Cheng Lu, Qiang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (纸本)9781665405270

Academic collaboration has become one of the topics of large-scale social network analysis. The information extracted from academic collaboration also shows the contextual value in combination with other data. For academic collaborative social networks with intricate collaborative relationships, previous research methods mainly focused on network structure and community discovery, lacking in mining the characteristics of relationships in collaborative networks. There were some limitations in the research perspective. In this work, we propose a collaborative relationship representation method that is more suitable for academic collaborative social networks. It marks the attribute characteristics of nodes in collaborative relationships and highlights collaborative relationships in visualization. By adopting this new representation of collaborative relationships, we designed a visual analysis framework NcoVis, to visualize academic collaborative social networks. We further visually analyze the link relationship groups guided by nodes, and explore the potential representation of the structure and attribute characteristics of link relationships, so that analysts can explore the theme and structural change characteristics of link relationships, communities and the whole network in collaborative social networks. To prove the proposed framework, we conducted a case study on the academic collaboration literature data set, and analyzed the questionnaire with Likert scale through the user evaluation experiment, which verified the effectiveness of our method and the practicability of NcoVis. © 2022 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

D3still: Decoupled Differential Distillation for Asymmetric Image Retrieval

D3still: Decoupled Differential Distillation for Asymmetric ...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yi Xie Yihong Lin Wenjie Cai Xuemiao Xu Huaidong Zhang Yong Du Shengfeng He South China University of Technology Independent Researcher State Key Laboratory of Subtropical Building Science Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information Ministry of Education Key Laboratory of Big Data and Intelligent Robot Ocean University of China Singapore Management University

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Existing methods for asymmetric image retrieval employ a rigid pairwise similarity constraint between the query network and the larger gallery network. However, these one-to-one constraint approaches often fail to maintain retrieval order consistency, especially when the query network has limited representational capacity. To overcome this problem, we introduce the Decoupled Differential Distillation (D3still) framework. This framework shifts from absolute one-to-one supervision to optimizing the relational differences in pairwise similarities produced by the query and gallery networks, thereby preserving a consistent retrieval order across both networks. Our method involves computing a pairwise similarity differential matrix within the gallery domain, which is then decomposed into three components: feature representation knowledge, inconsistent pairwise similarity differential knowledge, and consistent pairwise similarity differential knowledge. This strategic decomposition aligns the retrieval ranking of the query network with the gallery network effectively. Extensive experiments on various bench-mark datasets reveal that D3still surpasses state-of-the-art methods in asymmetric image retrieval. Code is available at https://***/SCY-X/D3still.

关键词： Computer vision Codes Accuracy Image retrieval Pattern recognition Matrix decomposition Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Detent Force Reduction in Permanent Magnet Synchronous Linear Motor Based on Arc-teeth

Detent Force Reduction in Permanent Magnet Synchronous Linea...

引用

Chinese Control and Decision Conference, CCDC

作者： Yuxin Shen Rong Guo Hongyan Ma School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China School of Electrical and Information Engineering Institute of Distributed Energy Storage Safety Big Data Beijing Key Laboratory of Intelligent of Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

Permanent Magnet Synchronous Linear Motors (PMSLM) has the advantages of high thrust force density, high acceleration, high speed, high precision, high efficiency etc. However, the detent force of PMSLM is an inevitable problem, caused by their inherent end-disconnection structure. Excessive detent force will cause thrust fluctuations and reduce the system’s stability. To resolve the above problems, an improved PMSLM structure based on arc-teeth is proposed to reduce detent force. Firstly, the motor permeability distribution is analyzed at different moments based on the flux-tube method, and the expression of detent force is derived. Second, the finite element model of PMSLM is established to optimize the height of arc-teeth, and the optimal structural parameters of the motor is obtained. Finally, the performance advantages of the proposed PMSLM are verified by comparing with traditional linear motor.

关键词： Fluctuations Shape Force Stators Motors Harmonic analysis Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

Environment-aware dynamic graph learning for out-of-distribution generalization 23

Environment-aware dynamic graph learning for out-of-distribu...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Haonan Yuan Qingyun Sun Xingcheng Fu Ziwei Zhang Cheng Ji Hao Peng Jianxin Li Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University and School of Computer Science and Engineering Beihang University Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University Department of Computer Science and Technology Tsinghua University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Dynamic graph neural networks (DGNNs) are increasingly pervasive in exploiting spatio-temporal patterns on dynamic graphs. However, existing works fail to generalize under distribution shifts, which are common in real-world scenarios. As the generation of dynamic graphs is heavily influenced by latent environments, investigating their impacts on the out-of-distribution (OOD) generalization is critical. However, it remains unexplored with the following two major challenges: (1) How to properly model and infer the complex environments on dynamic graphs with distribution shifts? (2) How to discover invariant patterns given inferred spatio-temporal environments? To solve these challenges, we propose a novel Environment-Aware dynamic Graph LEarning (EAGLE) framework for OOD generalization by modeling complex coupled environments and exploiting spatiotemporal invariant patterns. Specifically, we first design the environment-aware EADGNN to model environments by multi-channel environments disentangling. Then, we propose an environment instantiation mechanism for environment diversification with inferred distributions. Finally, we discriminate spatio-temporal invariant patterns for out-of-distribution prediction by the invariant pattern recognition mechanism and perform fine-grained causal interventions node-wisely with a mixture of instantiated environment samples. Experiments on real-world and synthetic dynamic graph datasets demonstrate the superiority of our method against state-of-the-art baselines under distribution shifts. To the best of our knowledge, we are the first to study OOD generalization on dynamic graphs from the environment learning perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prompt-based Unifying Inference Attack on Graph Neural Networks 39

Prompt-based Unifying Inference Attack on Graph Neural Netwo...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wei, Yuecen Fu, Xingcheng Liu, Lingyun Sun, Qingyun Peng, Hao Hu, Chunming School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University China

ISBN: (纸本)157735897X

Graph neural networks (GNNs) provide important prospective insights in applications such as social behavior analysis and financial risk analysis based on their powerful learning capabilities on graph data. Nevertheless, GNNs' predictive performance relies on the quality of task-specific node labels, so it is common practice to improve the model's generalization ability in the downstream execution of decision-making tasks through pre-training. Graph prompting is a prudent choice but risky without taking measures to prevent data leakage. In other words, in high-risk decision scenarios, prompt learning can infer private information by accessing model parameters trained on private data (publishing model parameters in pre-training, i.e., without directly leaking the raw data, is a tacitly accepted trend). However, myriad graph inference attacks necessitate tailored module design and processing to enhance inference capabilities due to variations in supervision signals. In this paper, we propose a novel Prompt-based unifying Inference Attack framework on GNNs, named ProIA. Specifically, ProIA retains the crucial topological information of the graph during pre-training, enhancing the background knowledge of the inference attack model. It then utilizes a unified prompt and introduces additional disentanglement factors in downstream attacks to adapt to task-relevant knowledge. Finally, extensive experiments show that ProIA enhances attack capabilities and demonstrates remarkable adaptability to various inference attacks. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：