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

Chinese Control and Decision Conference, CCDC

作者： Liyao Yang Hongyan Ma Yingda Zhang Shengyan Li 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 Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

An improved support vector machine model for energy consumption prediction is proposed to achieve efficient energy saving in buildings. In this paper, firstly, a gray correlation analysis model is used to measure the correlation between temperature, humidity, sunlight and other factors and building energy consumption. Secondly, the sparrow search algorithm (SSA) is introduced to optimize the penalty coefficient c and kernel function parameter g of the support vector machine, and then the SSA-SVM energy consumption prediction model is established. Finally, the experimental results are analyzed by comparing with the data derived from the support vector machine prediction (SVM) model and BP neural network energy consumption prediction. The experimental results show that compared with SVM and BP neural network, the prediction results of SSA-SVM model perform better in error index, indicating that the energy consumption prediction of SSA-SVM model has higher prediction accuracy; the maximum relative error of SSA-SVM prediction model is 0.0514, and the maximum relative errors of the other two models are greater than 0.55, indicating that SSA-SVM model has a higher degree of reliability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LDVNet: Lightweight and Detail-Aware Vision Network for Image Recognition Tasks in Resource-Constrained Environments 29

LDVNet: Lightweight and Detail-Aware Vision Network for Imag...

引用

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

作者： Liu, Yuchen Liang, Hu Qiu, Ran Zhao, Shengrong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Qilu University of Technology Shandong Academy of Sciences 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

In many underwater application scenarios, recognition tasks need to be executed promptly on computationally limited platforms. However, models designed for this field often exhibit spatial locality, and existing works lack the ability to capture crucial details in images. Therefore, a lightweight and detail-aware vision network (LDVNet) for resource-constrained environments is proposed to overcome the limitations of these approaches. Firstly, in order to enhance the accuracy of target image recognition, we introduce transformer modules to acquire global information, thus addressing the issue of spatial locality inherent in traditional convolutional neural networks (CNNs). Secondly, to maintain the network's lightweight nature, we integrate the transformer module with convolutional operations, thereby mitigating the substantial parameter and floating point operations (FLOPs) overhead. Thirdly, for the efficient extraction of crucial fine-grained details from feature maps, we have devised a channel and spatial attention module (C&SA). This module aids in recognizing intricate and fine-grained visual tasks and enhances image understanding. It is seamlessly integrated into LDVNet with nearly negligible parameter overhead. The experimental results demonstrate that LDVNet outperforms other lightweight networks and hybrid networks in different recognition tasks, while being suitable for resource-constrained environments. © 2023 IEEE.

关键词： Detail-aware Image recognition Lightweight

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

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

作者： Zhang, Yunan Wang, Chaohui 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

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

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

作者： Li, Xinying 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

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Watermarking Method for Latent Diffusion Models via Low-Rank Adaptation

arXiv

引用

arXiv 2024年

作者： Lin, Dongdong Li, Yue Tondi, Benedetta Li, Bin Barni, Mauro Guangdong Provincial Key Laboratory of Intelligent Information Processing The Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Huaqiao University China Xiamen Key Laboratory of Data Security and Blockchain Technology Xiamen361021 China Department of Information Engineering and Mathematics The University of Siena Italy

The rapid proliferation of deep neural networks (DNNs) is driving a surge in model watermarking technologies, as the trained deep models themselves serve as intellectual properties. The core of existing model watermarking techniques involves modifying or tuning the models’ weights. However, with the emergence of increasingly complex models, ensuring the efficiency of watermarking process is essential to manage the growing computational demands. Prioritizing efficiency not only optimizes resource utilization, making the watermarking process more applicable, but also minimizes potential impacts on model performance. In this letter, we propose an efficient watermarking method for latent diffusion models (LDMs) which is based on Low-Rank Adaptation (LoRA). We specifically choose to add trainable low-rank matrices to the existing weight matrices of the models to embed watermark, while keeping the original weights frozen. Moreover, we also propose a dynamic loss weight tuning algorithm to balance the generative task with the watermark embedding task, ensuring that the model can be watermarked with a limited impact on the quality of the generated images. Experimental results show that the proposed method ensures fast watermark embedding and maintains a very low bit error rate of the watermark, a high-quality of the generated image, and a zero false negative rate (FNR) for verification. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Incentive Mechanism Design for Federated Learning With Dynamic Network Pricing

引用

IEEE Transactions on Mobile Computing 2025年

作者： Ding, Ningning Gao, Lin Huang, Jianwei Data Science and Analytics Thrust Internet of Things Thrust Information Hub Guangzhou China Harbin Institute of Technology School of Electronics and Information Engineering Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology Shenzhen China The Chinese University of Hong Kong School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen Shenzhen518172 China

Federated learning protects users' data privacy by sharing users' local model parameters (instead of raw data) with a server. However, when massive users train a large machine learning model through federated learning, the dynamically varying and often heavy communication overhead can put significant pressure on the network operator. The operator may choose to dynamically change the network prices in response, which will eventually affect the payoffs of the server and users. This paper considers the under-explored yet important issue of the joint design of participation incentives (for encouraging users' contribution to federated learning) and network pricing (for managing network resources). Due to heterogeneous users' private information and multi-dimensional decisions, the optimization problems in Stage I of multi-stage games are non-convex. Nevertheless, we are able to analytically derive the corresponding optimal contract and pricing mechanism through proper transformations of constraints, variables, and functions, under three interaction structures of the participants. We show that the coordinated structure is better than the two uncoordinated structures, as it avoids the selfish behaviors of the network operator and the server;the vertically uncoordinated structure is better than the horizontally uncoordinated structure, as it avoids the interests misalignment between the server and the network operator. We also propose multi-period network pricing to reduce the implementation complexity of dynamic pricing. Numerical results based on real-world datasets show that our proposed mechanisms decrease the server's cost by up to 24.87% and increase the network operator's profit by up to 1245.25%, compared with the state-of-the-art benchmarks. © 2025 IEEE. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Ultra-Wideband Cascaded Power Amplifier for Military Individual Radio

An Ultra-Wideband Cascaded Power Amplifier for Military Indi...

引用

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Fei Gao Jingchang Nan Hongji Fan Cong Wang Panpan Tang Zhaoqi Li Liaoning Key Laboratory of Radio Frequency and Big Data for Intelligent Applications Liaoning Technical University Huludao China Southeast University Nanjing China Department of Microwave Engineering Harbin Institute of Technology Harbin China

ISBN: (数字)9798350384437

ISBN: (纸本)9798350384444

In recent years, there has been a tremendous interest in military individual radio in wireless communication. To obtain sufficient operating distance and long standby time, the output power and efficiency of power amplifiers have become the research focus by some of the research teams. GaN has higher electron mobility and forbidden bandwidth than other materials. Nowadays, GaN has become the mainstream key technology for radio frequency (RF) power amplifiers in 5G communication systems. In this work, a 500MHz~2500MHz GaN-based HEMT wideband cascaded power amplifier was designed. The output power of the driver amplifier is 36.6dBm ± 0.5dB, the input return loss is < -5dB, the drain efficiency is > 20%, the DC power consumption is < 25W, the input power is 5dBm, 1dB compression point is 7.8dBm, 0 dBm signal input and 33dBm signal output. The input power of the output stage is 36dBm; the output power is 44.75dB, the efficiency is more than 30%, and the input return loss < -8dB, small signal gain >10 dB, input voltage standing wave ratio < -10dB, output voltage standing wave ratio < -3dB. The demonstrated high performance of the cascaded power amplifier validates its applications in military wireless communication.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Network Based on Generative Adversarial Network 29

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Net...

引用

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

作者： Qiu, Ran Liang, Hu Liu, Yuchen Zhao, Shengrong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Qilu University of Technology Shandong Academy of Sciences 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

Image inpainting, which aims to reconstruct reasonably clear and realistic images from known pixel information, is one of the core problems in computer vision. However, due to the complexity and variability of the underwater environment, the inability to extract valid pixel points and insufficient correlation between feature information in existing image inpainting techniques lead to blurring in the generated images. Therefore, a novel gated attention feature fusion image inpainting network based on generative adversarial networks (GAF-GAN) is proposed. The accuracy of feature similarity matching depends heavily on the validity of the information contained in the features. On the one hand, gating values are dynamically generated by gated convolution to reduce the interference of invalid information. On the other hand, semantic information at distant locations in an image is accurately acquired by the attention mechanism. For these reasons, we designed an improved gated attention mechanism. Gated attention mechanism make the network focus on effective information such as high-frequency texture and color fidelity of restored images. In addition, the dense feature fusion module is added to expand the overall receptive field of the network to fully learn the image features. Experimental results show that the proposed method can effectively repair defective images with complex texture structures and improve the reality and integrity of image details and structures. © 2023 IEEE.

关键词： Dense feature fusion module Gated attention mechanism Image inpainting Underwater environment

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

Uncertainty-based Model Acceleration for Cancer Classificati...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Gao, Zeyu Mao, Anyu Wu, Jialun Li, Yang Wang, Chunbao Ding, Caixia Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China The First Affiliated Hospital of Xi'an Jiaotong University Department of Pathology Xi'an China Shaanxi Provincial Cancer Hospital Department of Pathology Xi'an China

ISBN: (纸本)9781665468190

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as 'suspicious' regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance. © 2022 IEEE.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：