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

A Passive RFID Temperature Sensor With 0.16°C Resolution, +0.42/-0.83 °C Inaccuracy and 0.234nJ / conversion

IEEE Sensors Journal 2025年第10期25卷 18136-18144页

作者： Xiao, Yu Li, Songting Yan, Dun Wang, Feng Hunan University College of Computer Science and Electronic Engineering Changsha410082 China National Univ. of Defense Technology College of Aerospace Science and Engineering Changsha410073 China

This paper presents an ultra-low power RFID with an embedded CMOS temperature sensor. The thermometry working flow of the Query01-Query00-Ack sequence is introduced, which is compatible with the EPC GEN-2 standard. A 2k-bits multi-time programmable (MTP) non-volatile memory (NVM) array with standard CMOS process is used to store tag information, tag-identification (TID), electronic product code (EPC), initialization parameter and temperature sensor (TS) data. The proposed rectifier can achieve a wide power dynamic range (PDR) of 21.5 dB with peak power conversion efficiency (PCE) of 65%@-15 dBm under a 100kΩ load. A protection mechanism for reliable reading and writing is presented to ensure proper tag initialization and avoid the ghost tag phenomenon. Time domain digital quantization is adopted to convert the signal that period varies with temperature into a digital signal for low power consumption. The temperature sensor achieves a resolution of 0.16°C and inaccuracy of +0.42/-0.83 °C after one point calibration at 0 °C in the temperature range from -20 °C to 30 °C. When the temperature sensor is powered at 1 V, it can achieve 0.234 nJ of energy per conversion in a conversion time of 1.8ms. The passive RFID temperature sensor occupies an area of 0.5579 mm2 in 0.13um CMOS process. At the frequency of ~910 MHz, measured tag sensitivity can reach -22 dBm and the 3 dB bandwidth is 51.5 MHz. © 2001-2012 IEEE.

关键词： CMOS integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Drug–target interactions prediction based on similarity graph features extraction and deep learning

引用

Neural Computing and Applications 2025年第6期37卷 4303-4322页

作者： Torkey, Hanaa El-Behery, Heba Attia, Abdel-Fattah El-Fishawy, Nawal Computer Science and Engineering Department Faculty of Electronic Engineering Menoufia University Menouf Egypt Department of Computer Science and Engineering Faculty of Engineering Kafrelsheikh University Kafrelsheikh Egypt Department of Computer Science College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia

Identifying drug–target interactions (DTIs) is a critical step in both drug repositioning. The labor-intensive, time-consuming, and costly nature of classic DTI laboratory studies makes it imperative to create efficient computer algorithms to forecast possible DTIs. However, current computational approaches that predict potential drug–target interactions (DTIs) suffer from some limitations, like finding the best similarity measures or negative samples, and thus require substantial performance improvement. This study proposes an integrated approach based on feature representation and deep learning to predict DTIs. We extract the relevant features of drugs and proteins from heterogeneous networks using graph mining techniques. The proposed approach constructs a heterogeneous graph from the known drug–protein interactions, protein–protein, and drug–drug similarities. Then applying two feature extraction techniques to extract the features, then utilizing these features in training a deep learning model to predict the potential DTIs. Also, a novel algorithm is proposed to find the negative samples based on the drug and protein similarity matrices. Four Benchmark datasets are used to evaluate the proposed approach. Our approach achieves the highest AUC (area under the ROC curve) across all datasets (0.98) with around 2% increases over the existing methods. Experimental results demonstrate that our proposed approach outperforms the baseline methods in predicting DTI, and our negative sample-identifying algorithm could be established as a competitive solution. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Event-based nonsingular fixed-time containment control for nonlinear multiagent systems with dynamic uncertainties

引用

science China(Information sciences) 2025年第5期68卷 413-414页

作者： Yuanbo SU Qihe SHAN Tieshan LI C.L.Philip CHEN Navigation College Dalian Maritime University School of Automation Engineering University of Electronic Science and Technology of China School of Computer Science and Engineering South China University of Technology

Owing to the extensive applications in many areas such as networked systems,formation flying of unmanned air vehicles,and coordinated manipulation of multiple robots,the distributed containment control for nonlinear multiagent systems (MASs) has received considerable attention,for example [1,2].Although the valued studies in [1,2] investigate containment control problems for MASs subject to nonlinearities,the proposed distributed nonlinear protocols only achieve the asymptotic *** a crucial performance indicator for distributed containment control of MASs,the fast convergence is conducive to achieving better control accuracy [3].The work in [4] first addresses the backstepping-based adaptive fuzzy fixed-time containment tracking problem for nonlinear high-order MASs with unknown external ***,the designed fixedtime control protocol [4] cannot escape the singularity problem in the backstepping-based adaptive control *** is well known,the singularity problem has become an inherent problem in the adaptive fixed-time control design,which may cause the unbounded control inputs and even the instability of controlled ***,how to solve the nonsingular fixed-time containment control problem for nonlinear MASs is still open and awaits breakthrough to the best of our knowledge.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impact of the chaotic semiconductor laser output power on time-delay-signature of chaos and random bit generation

引用

Chinese Physics B 2025年第3期34卷 325-330页

作者： Chenpeng Xue Xu Wang Likai Zheng Haoyu Zhang Yanhua Hong Zuxing Zhang College of Electronic and Optical Engineering and College of Flexible Electronics(Future Technology) Nanjing University of Posts and TelecommunicationsNanjing 210023China School of Computer Science and Engineering Bangor UniversityBangor LL571UTUK

We experimentally analyze the effect of the optical power on the time delay signature identification and the random bit generation in chaotic semiconductor laser with optical *** to the inevitable noise during the photoelectric detection and analog-digital conversion,the varying of output optical power would change the signal to noise ratio,then impact time delay signature identification and the random bit *** results show that,when the optical power is less than-14 dBm,with the decreasing of the optical power,the actual identified time delay signature degrades and the entropy of the chaotic signal ***,the extracted random bit sequence with lower optical power is more easily pass through the randomness testing.

关键词： chaos time delay signature entropy estimation random bit generation

来源：评论

学校读者我要写书评

暂无评论

A Novel CAPTCHA Recognition System Based on Refined Visual Attention

引用

computers, Materials & Continua 2025年第4期83卷 115-136页

作者： Zaid Derea Beiji Zou Xiaoyan Kui Monir Abdullah Alaa Thobhani Amr Abdussalam School of Computer Science and Engineering Central South UniversityChangsha410083China College of Computer Science and Information Technology Wasit UniversityWasit52001Iraq Department of Computer Science and Artificial Intelligence College of Computing and Information TechnologyUniversity of BishaBisha67714Saudi Arabia Electronic Engineering and Information Science Department University of Science and Technology of ChinaHefei230026China

Improving website security to prevent malicious online activities is crucial,and CAPTCHA(Completely Automated Public Turing test to tell computers and Humans Apart)has emerged as a key strategy for distinguishing human users from automated ***-based CAPTCHAs,designed to be easily decipherable by humans yet challenging for machines,are a common form of this ***,advancements in deep learning have facilitated the creation of models adept at recognizing these text-based CAPTCHAs with surprising *** our comprehensive investigation into CAPTCHA recognition,we have tailored the renowned UpDown image captioning model specifically for this *** approach innovatively combines an encoder to extract both global and local features,significantly boosting the model’s capability to identify complex details within CAPTCHA *** the decoding phase,we have adopted a refined attention mechanism,integrating enhanced visual attention with dual layers of Long Short-Term Memory(LSTM)networks to elevate CAPTCHA recognition *** rigorous testing across four varied datasets,including those from Weibo,BoC,Gregwar,and Captcha 0.3,demonstrates the versatility and effectiveness of our *** results not only highlight the efficiency of our approach but also offer profound insights into its applicability across different CAPTCHA types,contributing to a deeper understanding of CAPTCHA recognition technology.

关键词： Text-based CAPTCHA recognition refined visual attention web security computer vision

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Deep Exclusion Unfolding Network for Single Image Reflection Removal

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第6期47卷 4957-4973页

作者： Huang, Jun-Jie Liu, Tianrui Chen, Zihan Liu, Xinwang Wang, Meng Dragotti, Pier Luigi National University of Defense Technology College of Computer Science and Technology Changsha China Hefei University of Technology School of Computer Science and Information Engineering Hefei China Imperial College London Department of Electrical and Electronic Engineering London United Kingdom

Single Image Reflection Removal (SIRR) is a canonical blind source separation problem and refers to the issue of separating a reflection-contaminated image into a transmission and a reflection image. The core challenge lies in minimizing the commonalities among different sources. Existing deep learning approaches either neglect the significance of feature interactions or rely on heuristically designed architectures. In this paper, we propose a novel Deep Exclusion unfolding Network (DExNet), a lightweight, interpretable, and effective network architecture for SIRR. DExNet is principally constructed by unfolding and parameterizing a simple iterative Sparse and Auxiliary Feature Update (i-SAFU) algorithm, which is specifically designed to solve a new model-based SIRR optimization formulation incorporating a general exclusion prior. This general exclusion prior enables the unfolded SAFU module to inherently identify and penalize commonalities between the transmission and reflection features, ensuring more accurate separation. The principled design of DExNet not only enhances its interpretability but also significantly improves its performance. Comprehensive experiments on four benchmark datasets demonstrate that DExNet achieves state-of-the-art visual and quantitative results while utilizing only approximately 8% of the parameters required by leading methods. © 1979-2012 IEEE.

关键词： Blind source separation

来源：评论

学校读者我要写书评

暂无评论

TermDiffuSum: A Term-guided Diffusion Model for Extractive Summarization of Legal Documents 31

TermDiffuSum: A Term-guided Diffusion Model for Extractive S...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Dong, Xiangyun Li, Wei Le, Yuquan Jiang, Zhangyue Zhong, Junxi Wang, Zhong College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (纸本)9798891761964

Extractive summarization for legal documents aims to automatically extract key sentences from legal texts to form concise summaries. Recent studies have explored diffusion models for extractive summarization task, showcasing their remarkable capabilities. Despite these advancements, these models often fall short in effectively capturing and leveraging the specialized legal terminology crucial for accurate legal summarization. To address the limitation, this paper presents a novel term-guided diffusion model for extractive summarization of legal documents, named TermDiffuSum. It incorporates legal terminology into the diffusion model via a well-designed multifactor fusion noise weighting schedule, which allocates higher attention weight to sentences containing a higher concentration of legal terms during the diffusion process. Additionally, TermDiffuSum utilizes a re-ranking loss function to refine the model's selection of more relevant summaries by leveraging the relationship between the candidate summaries generated by the diffusion process and the reference summaries. Experimental results on a self-constructed legal summarization dataset reveal that TermDiffuSum outperforms existing diffusion-based summarization models, achieving improvements of 3.10 in ROUGE-1, 2.84 in ROUGE-2, and 2.89 in ROUGE-L. To further validate the generalizability of TermDiffuSum, we conduct experiments on three public datasets from news and social media domains, with results affirming the scalability of our approach. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Unveiling the Superiority of Unsupervised Learning on GPU Cryptojacking Detection: Practice on Magnetic Side Channel-based Mechanism

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4874-4889页

作者： Cao, Hangcheng Xu, Guowen He, Ziyang Shi, Shaoqing Xu, Shengmin Wu, Cong Ning, Jianting Hunan University College of Computer Science and Electronic Engineering China City University of Hong Kong Department of Computer Science Hong Kong University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu China Zhengzhou University School of Cyber Science and Engineering Zhengzhou China Zhengzhou University International College Zhengzhou China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou China Nanyang Technological University College of Computing and Data Science Singapore Wuhan University School of Cyber Science and Engineering Wuhan China City University of Macau Faculty of Data Science China

Ample profits of GPU cryptojacking attract hackers to recklessly invade victims’ devices, for completing specific cryptocurrency mining tasks. Such malicious invasion undoubtedly obstructs normal device usage and wastes computation resources. To resist the threat of GPU cryptojacking, existing works aim to timely detect and clear away it, by distinguishing the dissimilitude between it and legitimate applications. However, these detection mechanisms inappropriately rely on two conflict cornerstones, manifested in leveraging mutable samples of illegitimate cryptojacking to design supervision-based detection models requiring samples with stable patterns. This limitation compromises the practicability of existing detection mechanisms in the face of mutable cryptojacking samples. To fill the gap, we explore the superiority of unsupervised learning in handling this issue and further propose an unsupervised manner-enabled detection mechanism named MagInspector, only using legitimate applications’ magnetic signatures from GPU side channels for model construction. MagInspector innovates in training an unsupervised autoencoder network by an adversarial mode that well learns the stable signature patterns of legitimate applications, while incompatible with mutable cryptojacking ones. In the process of model training, we elaborately extract mutual energy cumulation distribution features to represent legitimate applications to overcome the impact of their inter-type differences. Meanwhile, a locality sensitive hashing-driven outlier removal algorithm is designed to enhance MagInspector’s robustness to the noise samples. Finally, extensive experiments are conducted on GPUs covering four generations of common NVIDIA architectures and two generations of AMD architectures;the results show that applying MagInspector to mutable cryptojacking signature detection achieves a significant average accuracy improvement of 25.5% and 17.8%, respectively. © 2005-2012 IEEE.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

HRMG-EA: Heterogeneous graph neural network recommendation with multi-level guidance based on enhanced-attributes

引用

Applied Intelligence 2025年第6期55卷 1-22页

作者： Wang, Longtao Yuan, Guiyuan Li, Chao Zhao, Yufei Duan, Hua Zeng, Qingtian College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China College of Electronic and Information Engineering Shandong University of Science and Technology Shandong Qingdao266590 China College of Mathematics and Systems Science Shandong University of Science and Technology Shandong Qingdao266590 China

Heterogeneous Graph Neural Networks are an efficient and powerful tool for modeling graph structure data in recommendation systems. However, existing heterogeneous graph neural networks often fail to model the dependencies between user and item attribute preferences, limiting graph structure optimization and consequently reducing the accuracy of recommendations. To overcome these issues, we propose a Heterogeneous graph neural network Recommendation with Multi-level Guidance based on Enhanced-Attributes (HRMG-EA). First, we design an attribute enhanced gated network to model user-item interaction attribute scenarios and obtain enhanced-attributes by capturing complex attribute dependencies. It effectively avoids the expansion of the graph scale in attribute graph scenarios and further covers personalized attribute relationship distribution characteristics of users and items. Then, we propose a novel multi-level graph structure guidance strategy based on enhanced-attributes. It guides graph structure learning from three optimization levels, optimizing from two perspectives: explicit (heterogeneity and homogeneity) and implicit (contrast enhancement). The former can screen higher-quality heterogeneous neighbor nodes in a direct interaction environment, and filter out redundant or erroneous edges under different similar semantic interest paths to improve the quality of the neighborhood environment. The latter aligns representation embeddings of enhanced-attributes and graph structure in a latent space, explores their potential commonalities, and obtains more comprehensive, fine-grained semantic and beneficial structural information. Finally, on two real-world datasets, HRMG-EA significantly outperforms the state-of-the-art baseline algorithms in both recall and normalized discounted cumulative gain. A large number of ablation experiments and analytical verifications also verify its effectiveness. © The Author(s), under exclusive licence to Springer science+Business Med

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning-Based Continuous Workflows Scheduling in Heterogeneous Environments

引用

IEEE Internet of Things Journal 2025年第10期12卷 14036-14050页

作者： Wang, Zhi Zhan, Wenhan Duan, Hancong Min, Geyong Huang, Hualong University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China University of Exeter College of Engineering Mathematics and Physical Sciences Department of Computer Science ExeterEX4 4QF United Kingdom

Workflow scheduling plays a critical role in optimizing completion time and throughput in distributed cloud environments, leveraging the parallelism of heterogeneous computing resources. However, existing workflow scheduling algorithms often fall short due to heuristic limitations and the challenges in adaptability within heterogeneous settings, leading to suboptimal scheduling solutions. In this paper, we present a novel deep reinforcement learning (DRL) framework tailored for continuous workflow scheduling in heterogeneous environments. First, we propose an intelligent scheduler that updates the policy network through interactions with a multi-tenant environment, triggered by scheduling events. Next, the framework incorporates a Graph Attention Network (GAT) and a self-attention MultiLayer Perceptron (MLP) to preprocess the workflow topology and embed dynamic features of ready tasks and available processors into the state input at each scheduling step. Additionally, a k-dimensional tree-based k-nearest neighbors (kNN) algorithm is employed to map the output action vector to a pair of executed ready task and processor, facilitating the transition from continuous to discrete action spaces and addressing challenges associated with dynamic action spaces. Experimental results demonstrate that our method converges effectively in continuous workflow scheduling scenarios and significantly outperforms the best-known methods in terms of average makespan and load balancing efficiency. © 2014 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：