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

Novel Sm3+ and Eu3+ co-doped Sr2YNbO6 red-emitting phosphor for white LED applications

Ceramics International 2025年第15期51卷 19901-19909页

作者： Zhang, Yuanfeng Shi, Youzhen Deng, Chaoyong Zhang, Min College of Big Data and Information Engineering Guizhou University Guiyang550025 China Key Laboratory of Electronic Functional Composite Materials of Guizhou Province Guiyang550025 China School of Science China University of Geosciences Beijing100083 China Guizhou Academy of Sciences Guiyang550001 China

A series Sm3+ and Eu3+ co-doped Sr2YNbO6 phosphors were prepared by high temperature solid state reaction method in this work. The photoluminescence properties and energy transfer process were studied, and the results revealed that the photoluminescence intensity was significantly enhanced by co-doped with Eu3+, with the optimal concentration of 0.15mol, and the energy transfer efficiency between Sm3+ and Eu3+ ions was as high as 94.25%. In addition, the diffuse reflectance spectrum results confirmed the excitation wavelength of the sample, and the optical band gap showed concentration dependence. Finally, the lower color temperature CCT=2502K and the higher color rendering index Ra=76.4 indicate that the material has potential application value in the fields of LED and anti-counterfeiting display. © 2025 Elsevier Ltd and Techna Group S.r.l.

关键词： Photoluminescence

来源：评论

学校读者我要写书评

暂无评论

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on Adaptive Perturbation on Federated Graph Learning 25

NI-GDBA: Non-Intrusive Distributed Backdoor Attack Based on ...

引用

34th ACM Web Conference, WWW 2025

作者： Li, Ken Shi, Bin Wei, Jiazhe Dong, Bo School of Computer Science and Technology Xi’an Jiaotong University Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China School of Distance Education Xi’an Jiaotong University Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an China

ISBN: (纸本)9798400712746

Federated Graph Learning (FedGL) is an emerging Federated Learning (FL) framework that learns the graph data from various clients to train better Graph Neural Networks(GNNs) model. Owing to concerns regarding the security of such framework, numerous studies have attempted to execute backdoor attacks on FedGL, with a particular focus on distributed backdoor attacks. However, all existing methods posting distributed backdoor attack on FedGL only focus on injecting distributed backdoor triggers into the training data of each malicious client, which will cause model performance degradation on original task and is not always effective when confronted with robust federated learning defense algorithms, leading to low success rate of attack. What’s more, the backdoor signals introduced by the malicious clients may be smoothed out by other clean signals from the honest clients, which potentially undermining the performance of the attack. To address the above significant shortcomings, we propose a non-intrusive graph distributed backdoor attack(NI-GDBA) that does not require backdoor triggers to be injected in the training data. Our attack trains an adaptive perturbation trigger generator model for each malicious client to learn the natural backdoor from the GNN model downloading from the server with the malicious client’s local data. In contrast to traditional distributed backdoor attacks on FedGL via trigger injection in training data, our attack on different datasets such as Molecules and Bioinformatics have higher attack success rate, stronger persistence and stealth, and has no negative impact on the performance of the global GNN model. We also explore the robustness of NI-GDBA under different defense strategies, and based on our extensive experimental studies, we show that our attack method is robust to current federated learning defense methods, thus it is necessary to consider non-intrusive distributed backdoor attacks on FedGL as a novel threat that requires custom d

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Contactless Vital Signs Monitoring for Animals

引用

IEEE Internet of Things Journal 2025年第11期12卷 16789-16796页

作者： Pitafi, Zaid Farooq Song, Yingjian Xie, Zaipeng Brainard, Benjamin Song, Wenzhan University of Georgia School of Electrical and Computer Engineering AthensGA30602 United States Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing211100 China University of Georgia College of Veterinary Medicine AthensGA30602 United States

Monitoring vital signs such as Heart Rate (HR) and Respiratory Rate (RR) is critical for veterinary medicine. The existing contact based systems are difficult to use on animals for longer periods as they may cause movement restriction. Contactless solutions have recently gained more popularity due to their ease-of-use. However, there are very few validated systems for animals. In this study, we propose a contactless vital signs monitoring system, CageDot for animals. Our system provides continuous real-time monitoring of HR and RR during hospitalization. The CageDot is placed under the animal cage and detects the heart vibrations using a geophone sensor. The CageDot also has a signal quality control algorithm to address the problem of obtaining high-quality cardiac data in real-life noisy environments such as hospitals. Compared to the existing works that use controlled environments, this is especially significant. The algorithm includes several steps that include background noise/movement removal, subject movement detection, heartbeat extraction and vital signs estimation. The experimental results on 16 hospitalized dogs and cats show that this system can achieve high accuracy for vital signs monitoring with a Mean Absolute Error (MAE) of 4.71 for Heart Rate (3.8 percent error rate) and 1.28 (8 percent error rate) for Respiratory Rate. © 2014 IEEE.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

Solving Multiobjective Combinatorial Optimization via Learning to Improve Method

引用

IEEE Transactions on Emerging Topics in Computational Intelligence 2025年第3期9卷 2122-2136页

作者： Ye, Te Zhang, Zizhen Zhang, Qingfu Chen, Jinbiao Wang, Jiahai Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510275 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong

Recently, neural combinatorial optimization (NCO) methods have been prevailing for solving multiobjective combinatorial optimization problems (MOCOPs). Most NCO methods are based on the "Learning to Construct"(L2C) paradigm, where the trained model(s) can directly generate a set of approximate Pareto optimal solutions. However, these methods still suffer from insufficient proximity and poor diversity towards the true Pareto front. In this paper, following the "Learning to Improve"(L2I) paradigm, we propose weight-related policy network (WRPN), a learning-based improvement method for solving MOCOPs. WRPN is incorporated into multiobjective evolutionary algorithm (MOEA) frameworks to effectively guide the search direction. A shared baseline for proximal policy optimization is presented to reduce variance in model training. A quality enhancement mechanism is designed to further refine the Pareto set during model inference. Computational experiments conducted on two classic MOCOPs, i.e., multiobjective traveling salesman problem and multiobjective vehicle routing problem, indicate that our method achieves remarkable results. Notably, our WRPN module can be easily integrated into various MOEA frameworks such as NSGA-II, MOEA/D and MOGLS, providing versatility and applicability across different problem domains. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

UARC:Unsupervised Anomalous Traffic Detection with Improved U-Shaped Autoencoder and RetNet Based Multi-clustering 26th

UARC:Unsupervised Anomalous Traffic Detection with Improved ...

引用

26th International Conference on Information and Communications Security, ICICS 2024

作者： Xie, Yunyang Chen, Kai Li, Shenghui Li, Bingqian Zhang, Ning Hubei Key Laboratory of Distributed System Security Hubei Engin eering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University Technology Wuhan430074 China

ISBN: (纸本)9789819787975

With the ongoing advancement of deep learning, modern network intrusion detection systems increasingly favor utilizing deep learning networks to improve their ability to learn traffic characteristics. To address the challenge of obtaining a substantial amount of labeled training data, many intrusion detection systems now focus on unsupervised anomaly detection methods. Despite this shift, researchers still face the daunting task of distinguishing a significant volume of anomalous traffic and dealing with data imbalance. To address these real-world challenges, we introduce UARC, a system capable of achieving unsupervised anomaly traffic detection through multi-clustering. UARC utilizes an enhanced U-shaped autoencoder and a feature fusion method incorporating Masked Retnet to effectively extract spatiotemporal features from network traffic. It combines these techniques with the HDBSCAN algorithm for multi-clustering of traffic, providing a form of reverse guidance for network learning. Experimental results on multiple datasets demonstrate that UARC can cluster various types of traffic with an impressive accuracy rate of up to 97.96%, while achieving a 99.70% AUC value for anomaly detection. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model

arXiv

引用

arXiv 2025年

作者： Hu, Yuxuan Zhang, Jing Chen, Xiaodong Zhao, Zhe Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China Engineering Research Center of Database and Business Intelligence Beijing China Tencent AI Lab Beijing China

Existing low-rank adaptation (LoRA) methods face challenges on sparse large language models (LLMs) due to the inability to maintain sparsity. Recent works introduced methods that maintain sparsity by augmenting LoRA techniques with additional masking mechanisms. Despite these successes, such approaches suffer from an increased memory and computation overhead, which affects efficiency of LoRA methods. In response to this limitation, we introduce LoRS, an innovative method designed to achieve both memory and computation efficiency when fine-tuning sparse LLMs. To mitigate the substantial memory and computation demands associated with preserving sparsity, our approach incorporates strategies of weight recompute and computational graph rearrangement. In addition, we also improve the effectiveness of LoRS through better adapter initialization. These innovations lead to a notable reduction in memory and computation consumption during the fine-tuning phase, all while achieving performance levels that outperform existing LoRA approaches. © 2025, CC BY.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

key Clues Guided Video Character Social Relationship Recognition Enhanced by LLM

Key Clues Guided Video Character Social Relationship Recogni...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Dong, Wenlong Zhu, Qing Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China

ISBN: (纸本)9798350368741

Video Character Social Relationship Recognition (VCSRR) requires a comprehensive consideration about spatio-temporal and multi-modal clues in videos. Most existing methods mainly focus on integrating multi-modal clues and modeling interactions among characters. However, they fail to discover key clues in the complex video data or fully understand the clues related to social relationships. In this article, we propose a novel Large Language Model Enhanced key Clues Selection (LEKCS) framework to address the aforementioned issues. The core of LE-KCS is to mine multi-scale key clues from the perspectives of time, space and multi-modality, then transfer the knowledge about social relationships of the Large Language Model to VCSRR for understanding the selected clues. We evaluated LEKCS on the MovieGraphs dataset and the experimental results indicate that our proposed LE-KCS achieves state-of-the-art performance. © 2025 IEEE.

关键词： large language model Social relationship recognition video understanding

来源：评论

学校读者我要写书评

暂无评论

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks 25

Dual-level Mixup for Graph Few-shot Learning with Fewer Task...

引用

34th ACM Web Conference, WWW 2025

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education China

ISBN: (纸本)9798400712746

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. © 2025 Copyright held by the owner/author(s).

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

data Aggregation Point Placement and Subnetwork Optimization for Smart Grids

引用

Computers, Materials & Continua 2025年第4期83卷 407-434页

作者： Tien-Wen Sung Wei Li Chao-Yang Lee Yuzhen Chen Qingjun Fang Fujian Provincial Key Laboratory of Big Data Mining and Applications College of Computer Science and MathematicsFujian University of TechnologyFuzhou350118China Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin640301TaiwanChina

To transmit customer power data collected by smart meters(SMs)to utility companies,data must first be transmitted to the corresponding data aggregation point(DAP)of the *** number of DAPs installed and the installation location greatly impact the whole *** the traditional DAP placement algorithm,the number of DAPs must be set in advance,but determining the best number of DAPs is difficult,which undoubtedly reduces the overall performance of the ***,the excessive gap between the loads of different DAPs is also an important factor affecting the quality of the *** address the above problems,this paper proposes a DAP placement algorithm,APSSA,based on the improved affinity propagation(AP)algorithm and sparrow search(SSA)algorithm,which can select the appropriate number of DAPs to be installed and the corresponding installation locations according to the number of SMs and their distribution locations in different *** algorithm adds an allocation mechanism to optimize the subnetwork in the *** is evaluated under three different areas and compared with other DAP placement *** experimental results validated that the method in this paper can reduce the network cost,shorten the average transmission distance,and reduce the load gap.

关键词： Smart grid data aggregation point placement network cost average transmission distance load gap

来源：评论

学校读者我要写书评

暂无评论

Multi-Quadrotor Cooperative Encirclement and Capture Approach in Obstacle Environments

Multi-Quadrotor Cooperative Encirclement and Capture Approac...

引用

2025 IEEE International Conference on Mechatronics, ICM 2025

作者： Li, Zhenyu Wu, Ruixin Wang, Jin Hu, Chuanqi Zheng, Zhi Meng, Jun Lu, Guodong Zhejiang University State Key Laboratory of Fluid Power and Mechatronic Systems Hangzhou310058 China Zhejiang University Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Hangzhou310058 China Robotics Research Center of Yuyao City Ningbo315400 China College of Electrical Engineering Zhejiang University Hangzhou310027 China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou310027 China

ISBN: (纸本)9798331533892

This article proposes an algorithm designed for autonomous quadrotors to capture target quadrotors in complex obstacle environments, enabling multiple pursuers to perform distributed capture while simultaneously avoiding obstacles and collisions. We first introduce a 3D obstacle space representation method based on safety-priority reachable region (SPRR) and implement real-time construction for general point cloud maps. Subsequently, leveraging SPRR, we employ an area minimization approach to ensure the effective capture of the evader within a limited time. The outcomes are then integrated into a MINCO-based trajectory planning framework to ensure their practical execution by real quadrotors. Relying on SPRR, the optimization problem is simplified and the solution efficiency is improved. In the scenario of simulating the dynamics of real quadrotors, we compare the proposed algorithm with state-of-the-art evasion and pursuit methods, validating its effectiveness and advancements. This work presents a practical solution for multi-quadrotor collaborative capture. © 2025 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：