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

Hierarchical Model Checking of SystemVerilog-Specified Asynchronous Circuits for Deadlock Detection

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2424-2437页

作者： Lu, Longlong Pan, Minxue Lu, Yifei Li, Xuandong Nanjing University State Key Laboratory for Novel Software Technology and the Software Institute Jiangsu Province Nanjing210093 China Nanjing University State Key Laboratory for Novel Software Technology and School of Computer Science Jiangsu Province Nanjing210023 China

Specifying channel-based asynchronous circuits in SystemVerilog is a promising alternative design paradigm to combine the advantages of asynchronous circuits and industrial EDA supports. However, communicating through channels can be error-prone, potentially introducing deadlocks that cannot be detected easily through simulation. In contrast, model checking can reliably identify deadlocks, but faces challenges related to scalability and modeling capability. This research proposes a novel model checking approach, named, to detect deadlocks of channel-based asynchronous circuits specified in SystemVerilog. To address the issue of modeling capability, extracts inter-module communication behavior from SystemVerilog circuit designs and builds models in Communication Protocols specifically designed for this purpose. Additionally, employs a novel hierarchical model checking algorithm that conducts localized verification of well-formed groups of the system from the bottom up, thus reducing the size of the checking problems and presenting the opportunity to parallelize the checking process. Extensive experimental evaluations confirm the efficiency of in publicly accessible and randomly synthesized large-scale asynchronous circuits. Remarkably, significant benefits of the hierarchical checking approach are demonstrated through an ablative experiment. © 1982-2012 IEEE.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Sleep Modulation and Quality Classification Strategy Based EEG Signals and Multi-Scale Attention Deep Learning

引用

IEEE Internet of Things Journal 2025年第11期12卷 17377-17386页

作者： Lou, Yajun Zhou, Lu Song, Fanlei Xu, Fanyao Wang, Xuejing Li, Weitao Qian, Zhiyu Nanjing University of Aeronautics and Astronautics Key Laboratory of Multimodal Brain-Computer Precision Drive Ministry of Industry and Information Technology the Key Laboratory of Digital Medical Equipment and Technology of Jiangsu Province Department of Biomedical Engineering College of Automation Engineering Nanjing210016 China

Sleep disorders have become the second most prevalent mental health condition globally, posing a significant challenge to public health. Consequently, there is an imperative need for the development of effective, non-pharmacological interventions to enhance sleep quality. In this study, a novel sleep modulation technique utilizing transcutaneous electrical nerve stimulation (TENS) is introduced. A specialized stimulation mode is designed by integrating sine waves of varying frequencies, including spindle waveform components. Additionally, to facilitate an accurate evaluation of sleep quality and enable individualized interventions, a multi-scale attention-based deep learning model (MSA-Net) is proposed for sleep quality classification. It consists of a two-branch convolution block (TBC-block), an adaptive feature recalibration (AFR) module, three dense blocks, three attention transition blocks. By extracting the deep features of the electroencephalography (EEG) raw data, the sleep quality classification is realized. Experimental results indicate that the proposed stimulation effectively enhances and stabilizes slow-wave activity, significantly extending the duration of deep sleep and enhancing overall sleep stability. In addition, the MSA-Net demonstrates robust performance, achieving exceptional performance with an overall accuracy of 0.881, F1 score of 0.903, and Kappa score of 0.845, outperforming baseline models across all evaluation metrics. These results demonstrate the potential of combining TENS-based sleep modulation with deep learning techniques, offering an effective framework for enhancing sleep quality and advancing personalized sleep modulation strategies. © 2025 IEEE.

关键词： Sleep research

来源：评论

学校读者我要写书评

暂无评论

Mobility-Aware Multi-Task Migration and Offloading Scheme for Internet of Vehicles

引用

Chinese Journal of Electronics 2023年第6期32卷 1192-1202页

作者： LI Xujie TANG Jing XU Yuan SUN Ying College of Computer and Information Hohai University State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Key Lab for Wireless Sensor Network and Communication Shanghai Institute of Microsystem School of Information Engineering Jiangsu Open University

In Internet of vehicles, vehicular edge computing(VEC) as a new paradigm can effectively accomplish various tasks. Due to limited computing resources of the roadside units(RSUs), computing ability of vehicles can be a powerful supplement to computing resources. Then the task to be processed in data center can be offloaded to the vehicles by the RSUs. Due to mobility of the vehicles, the tasks will be migrated among the RSUs. How to effectively offload multiple tasks to the vehicles for processing is a challenging problem. A mobility-aware multi-task migration and offloading scheme for Internet of vehicles is presented and analyzed. Considering the coupling between migration and offloading, the joint migration and offloading optimization problem is formulated. The problem is a NP-hard problem and it is very hard to be solved by the conventional methods. To tackle the difficult problem, the idea of alternating optimization and divide and conquer is introduced. The problem can be decoupled into two sub-problems: computing resource allocation problem and vehicle node selection problem. If the vehicle node selection is given, the problem can be solved based on Lagrange function. And if the allocation of computing resource is given, the problem turns into a 0-1 integer programming problem, and the linear relaxation of branch bound algorithm is introduced to solve it. Then the optimization value is obtained through continuous iteration. Simulation results show that the proposed algorithm can effectively improve system performance.

关键词： Costs Computational modeling System performance Simulation Programming Multitasking Resource management

来源：评论

学校读者我要写书评

暂无评论

Two-Layer Information Granulation:Mapping-Equivalence Neighborhood Rough Set and Its Attribute Reduction

引用

Intelligent Automation & Soft Computing 2023年第8期37卷 2059-2075页

作者： Changshun Liu Yan Liu Jingjing Song Taihua Xu School of Computer Jiangsu University of Science and TechnologyZhenjiang212100China Key Laboratory of Oceanographic Big Data Mining&Application of Zhejiang Province Zhejiang Ocean UniversityZhoushan316022China

Attribute reduction,as one of the essential applications of the rough set,has attracted extensive attention from *** granulation is a key step of attribute reduction,and its efficiency has a significant impact on the overall efficiency of attribute *** information granulation of the existing neighborhood rough set models is usually a single layer,and the construction of each information granule needs to search all the samples in the universe,which is *** fill such gap,a new neighborhood rough set model is proposed,which aims to improve the efficiency of attribute reduction by means of two-layer information *** first layer of information granulation constructs a mapping-equivalence relation that divides the universe into multiple mutually independent mapping-equivalence *** second layer of information granulation views each mapping-equivalence class as a sub-universe and then performs neighborhood informa-tion granulation.A model named mapping-equivalence neighborhood rough set model is derived from the strategy of two-layer information *** results show that compared with other neighborhood rough set models,this model can effectively improve the efficiency of attribute reduction and reduce the uncertainty of the *** strategy provides a new thinking for the exploration of neighborhood rough set models and the study of attribute reduction acceleration problems.

关键词： Attribute reduction information granulation mapping-equiva-lence relation neighborhood rough set

来源：评论

学校读者我要写书评

暂无评论

Dynamic Staleness Control for Asynchronous Federated Learning in Decentralized Topology 18th

Dynamic Staleness Control for Asynchronous Federated Learni...

引用

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Ma, Qianpiao Liu, Jianchun Jia, Qingmin Zhou, Xiaomao Hu, Yujiao Xie, Renchao Purple Mountain Laboratories Jiangsu Nanjing China School of Computer Science and Technology University of Science and Technology of China Anhui Hefei China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9783031714665

Decentralized federated learning (DFL) has emerged as a promising paradigm for distributed machine learning over edge nodes (i.e., workers) without relying on a centralized parameter server. Most existing DFL researches rely on synchronous communication among workers. However, due to edge heterogeneity and dynamic network conditions, synchronous DFL mechanisms may suffer from inefficient model training and poor scalability. Meanwhile, the existing asynchronous DFL (ADFL) mechanisms present the challenge of stale models among workers, leading to diminished training quality, especially on Non-IID data. In this paper, we propose a novel staleness-aware ADFL (SA-ADFL) mechanism, aiming to realize a trade-off between model training efficiency and quality by dynamic staleness control. Specifically, we provide rigorous theoretical proof for SA-ADFL and formulate the worker scheduling problem to minimize total model training time under flexible long-term staleness constraints. Then we decompose the original round-coupled problem into a series of single-round sub-problems by leveraging the Lyapunov optimization, enabling efficient worker selection to minimize training time in each round while ensuring staleness queue stability. Experimental results demonstrate that our SA-ADFL accelerates model training by approximately 52.9% while maintaining equivalent model training accuracy compared with the state-of-the-art mechanisms. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TEF: Causality-Aware Taxonomy Expansion via Front-Door Criterion 31

TEF: Causality-Aware Taxonomy Expansion via Front-Door Crite...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Meng, Yuan Zhai, Songlin Zhang, Yuxin Hu, Zhongjian Qi, Guilin School of Computer Science and Engineering Southeast University Jiangsu Province China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China

ISBN: (纸本)9798891761964

Taxonomy expansion is a primary method for enriching taxonomies, involves appending a large number of additional nodes (i.e., queries) to an existing taxonomy (i.e., seed), with the crucial step being the identification of the appropriate anchor (parent node) for each query by incorporating the structural information of the seed. Despite advancements, existing research still faces an inherent challenge of spurious query-anchor matching, often due to various interference factors (e.g., the consistency of sibling nodes), resulting in biased identifications. To address the bias in taxonomy expansion caused by unobserved factors, we introduce the Structural Causal Model (SCM), known for its bias elimination capabilities, to prevent these factors from confounding the task through backdoor paths. Specifically, we employ the Front-Door Criterion, which guides the decomposition of the expansion process into a parser module and a connector. This enables the proposed causal-aware Taxonomy Expansion model to isolate confounding effects and reveal the true causal relationship between the query and the anchor. Extensive experiments on three benchmarks validate the effectiveness of TEF, with a notable 6.1% accuracy improvement over the state-of-the-art on the SemEval16-Environment dataset. © 2025 Association for Computational Linguistics.

关键词： Expansion

来源：评论

学校读者我要写书评

暂无评论

A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory

引用

Mathematical Biosciences and Engineering 2024年第2期21卷 2626-2645页

作者： Hua, Mingfeng Xu, Taihua Yang, Xibei Chen, Jianjun Yang, Jie School of Computer Jiangsu University of Science and Technology Zhenjiang212100 China Key Laboratory of Oceanographic Big Data Mining Application of Zhejiang Province Zhejiang Ocean University Zhoushan316022 China School of Physics and Electronic Science Zunyi Normal University Zunyi563002 China

Calculating single-source shortest paths (SSSPs) rapidly and precisely from weighted digraphs is a crucial problem in graph theory. As a mathematical model of processing uncertain tasks, rough sets theory (RST) has been proven to possess the ability of investigating graph theory problems. Recently, some efficient RST approaches for discovering different subgraphs (e.g. strongly connected components) have been presented. This work was devoted to discovering SSSPs of weighted digraphs by aid of RST. First, SSSPs problem was probed by RST, which aimed at supporting the fundamental theory for taking RST approach to calculate SSSPs from weighted digraphs. Second, a heuristic search strategy was designed. The weights of edges can be served as heuristic information to optimize the search way of k-step R-related set, which is an RST operator. By using heuristic search strategy, some invalid searches can be avoided, thereby the efficiency of discovering SSSPs was promoted. Finally, the W3SP@R algorithm based on RST was presented to calculate SSSPs of weighted digraphs. Related experiments were implemented to verify the W3SP@R algorithm. The result exhibited that W3SP@R can precisely calculate SSSPs with competitive efficiency. © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Potential mechanisms of non-coding RNA regulation in Alzheimer's disease

引用

Neural Regeneration Research 2026年第1期21卷 265-280页

作者： Yue Sun Xinping Pang Xudong Huang Dinglu Liu Jingyue Huang Pengtao Zheng Yanyu Wei Chaoyang Pang College of Computer Science Sichuan Normal UniversityChengduSichuan ProvinceChina School of Science Xi’an Jiaotong-Liverpool UniversitySuzhouJiangsu ProvinceChina Neurochemistry Laboratory Department of PsychiatryMassachusetts General Hospital and Harvard Medical SchoolCharlestownMAUSA National Key Laboratory of Science and Technology on Vacuum Electronics School of Electronic Science and EngineeringUniversity of Electronic Science and Technology of ChinaChengduSichuan ProvinceChina

Alzheimer's disease,a progressively degenerative neurological disorder,is the most common cause of dementia in the *** its precise etiology remains unclear,researchers have identified diverse pathological characteristics and molecular pathways associated with its *** in scientific research have increasingly highlighted the crucial role of non-coding RNAs in the progression of Alzheimer's *** non-coding RNAs regulate several biological processes critical to the advancement of the disease,offering promising potential as therapeutic targets and diagnostic ***,this review aims to investigate the underlying mechanisms of Alzheimer's disease onset,with a particular focus on microRNAs,long non-coding RNAs,and circular RNAs associated with the *** review elucidates the potential pathogenic processes of Alzheimer's disease and provides a detailed description of the synthesis mechanisms of the three aforementioned non-coding *** comprehensively summarizes the various non-coding RNAs that have been identified to play key regulatory roles in Alzheimer's disease,as well as how these noncoding RNAs influence the disease's progression by regulating gene expression and protein *** example,miR-9 targets the UBE4B gene,promoting autophagy-mediated degradation of Tau protein,thereby reducing Tau accumulation and delaying Alzheimer's disease ***,the long non-coding RNA BACE1-AS stabilizes BACE1 mRNA,promoting the generation of amyloid-βand accelerating Alzheimer's disease ***,circular RNAs play significant roles in regulating neuroinflammatory *** integrating insights from these regulatory mechanisms,there is potential to discover new therapeutic targets and potential biomarkers for early detection and management of Alzheimer's *** review aims to enhance the understanding of the relationship between Alzheimer's disease and non-coding RNAs,potentially pav

关键词： Alzheimer's disease biomarkers circular RNA long non-coding RNA microRNA ncRNA regulation neurodegeneration non-coding RNA pathogenesis therapeutic targets

来源：评论

学校读者我要写书评

暂无评论

Research on Metaverse Security and Forensics

引用

computers, Materials & Continua 2023年第10期77卷 799-825页

作者： Guangjun Liang Jianfang Xin Qun Wang Xueli Ni Xiangmin Guo Pu Chen Department of Computer Information and Cyber Security Jiangsu Police InstituteNanjingChina Engineering Research Center of Electronic Data Forensics Analysis NanjingChina Key Laboratory of Digital Forensics Department of Public Security of Jiangsu ProvinceNanjingChina School of Intelligent Engineering Nanjing Institute of Railway TechnologyNanjingChina

As a subversive concept,the metaverse has recently attracted widespread attention around the world and has set off a wave of enthusiasm in academic,industrial,and investment ***,while the metaverse brings unprecedented opportunities for transformation to human society,it also contains related *** is a digital living space with information infrastructure,interoperability system,content production system,and value settlement system as the underlying structure in which the inner core is to connect real residents through applications and *** social incentives and governance rules,the metaverse reflects the digital migration of human *** article will conduct an in-depth analysis of the metaverse from the perspective of electronic data ***,from the perspective of Internet development,the background and development process of the metaverse is *** systematically elaborating on the concept and connotation of the metaverse,this paper summarizes the different views of current practitioners,experts,and scholars on the ***,from the perspective of metaverse security,the social risk and crime risks of the metaverse are *** the importance of metaverse forensics is ***,from the perspective of blockchain,smart wearable devices,and virtual reality devices,the objects and characteristics of metaverse forensics have been studied in *** smart wearable devices as an example,this paper gives the relevant experimental process of smart bracelet ***,many challenges faced by metaverse forensics are summarized by us which provide readers with some exploratory guidance.

关键词： Metaverse forensics blockchain smart wear virtual reality

来源：评论

学校读者我要写书评

暂无评论

A Trusted Multi-Task Distribution Mechanism for Internet of Vehicles Based on Smart Contract

引用

China Communications 2023年第4期20卷 212-226页

作者： Xujie Li Yuan Xu Jing Tang Ying Sun Shaoshuai Fan Fei Shen College of Computer and Information Hohai UniversityNanjing 210098China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China School of Information Engineering Jiangsu Open UniversityNanjing 210017China Shanghai Institute of Microsystem and Information Technology Chinese Academy of SciencesShanghai 200050China

In this paper,a trusted multi-task distribution mechanism for Internet of Vehicles based on smart contract is proposed to improve the security and efficiency for the task distribution in Internet of ***,a three-tier trusted multi-task distribution framework is presented based on smart *** smart contract will be triggered by the task *** the important part of the smart contract,the task distribution algorithm is stored on the blockchain and run *** the process of the task distribution,the cost of the task distribution and the system stability play a critical ***,the task distribution problem is formulated to minimize the cost of the task distribution whilst maintaining the stability of the system based on Lyapunov ***,this problem is a mixed integer nonlinear programming problem with NP-hard *** tackle this,the optimization problem is decomposed into two sub problems of computing resource allocation and task distribution decision,and an effective task distribution algorithm is *** results show that the proposed algorithm can effectively improves system performance.

关键词： task distribution resource allocation Lyapunov optimization smart contract

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：