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

Impulsive Control of Nonlinear Multiagent Systems: A Hybrid Fuzzy Adaptive and Event-Triggered Strategy

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1889-1898页

作者： Han, Fang Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Wuhan430074 China

In this article, we present a hybrid control approach that integrates an adaptive fuzzy mechanism with an event-triggered impulse strategy to address consensus control challenges in nonlinear multiagent systems (MASs) with uncertain information, both in leader and leaderless scenarios. First, a fuzzy logic-based adaptive control mechanism is proposed to handle system nonlinearity and uncertainty. This mechanism dynamically adjusts fuzzy control rules in real time, enabling the system to adapt to changing conditions and enhancing its robustness against nonlinear disturbances. Second, to alleviate communication overhead and reduce control frequency, an event-triggered impulse strategy is implemented. This strategy activates impulse control only under specific conditions, effectively minimizing control actions while maintaining system consensus. Using Lyapunov stability theory, sufficient conditions for achieving system consensus are established, demonstrating the global consensus and robustness of the MASs under certain criteria. Finally, numerical simulations and experimental evaluations validate the proposed method's effectiveness and its practical advantages. © 1993-2012 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

TransMatch: Employing Bridging Strategy to Overcome Large Deformation for Feature Matching in Gastroscopy Scenario

引用

IEEE Transactions on Medical Imaging 2025年第6期44卷 2643-2656页

作者： Zhu, Guosong Qin, Zhen Yu, Linfang Ding, Yi Qin, Zhiguang University of Electronic Science and Technology of China Network and Data Security Key Laboratory of Sichuan Province Chengdu611731 China Industrial Research Institute Chengdu610000 China

Feature matching is widely applied in the image processing field. However, both traditional feature matching methods and previous deep learning-based methods struggle to accurately match the features with severe deformations and large displacements, particularly in gastroscopy scenario. To fill this gap, an effective feature matching framework named TransMatch is proposed, which addresses the largely displacements issue by matching features with global information leveraged via Transformer structure. To address the severe deformation of features, an effective bridging strategy with a novel bidirectional quadratic interpolation network is employed. This bridging strategy decomposes and simplifies the matching of features undergoing severe deformations. A deblurring module for gastroscopy scenario is specifically designed to address the potential blurriness. Experiments have illustrated that proposed method achieves state-of-the-art performance of feature matching and frame interpolation in gastroscopy scenario. Moreover, a large-scale gastroscopy dataset is also constructed for multiple tasks. © 1982-2012 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Minimal Context-Switching data Race Detection with dataflow Tracking

引用

Journal of Computer science & Technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：评论

学校读者我要写书评

暂无评论

Fine extraction of multi-crop planting area based on deep learning with Sentinel- 2 time-series data

引用

Environmental science and Pollution research 2025年第19期32卷 11931-11949页

作者： Jiang, Jingmin Zhang, Jiahua Wang, Xue Zhang, Shichao Kong, Delong Wang, Xiaopeng Ali, Shawkat Ullah, Hidayat Space Information and Big Earth Data Research Center School of Computer Science and Technology Qingdao University Qingdao266071 China Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China

Accurate and timely access to the spatial distribution of crops is crucial for sustainable agricultural development and food security. However, extracting multi-crop areas based on high-resolution time-series data and deep learning still faces challenges. Therefore, this study aims to provide an effective model for multi-crop classification using high-resolution remote sensing time-series data. We designed two deep learning models based on convolutional neural network-long short-term memory (CNN-LSTM) and bidirectional long short-term memory (Bi-LSTM). The monthly synthetic time series of the normalized difference vegetation index (NDVI) from Sentinel-2 data will be used as input features to extract the multi-crop planting area in Shandong province’s northwestern, southwestern, and eastern regions. The results showed that deep learning models achieved higher accuracy compared to the random forest (RF) and extreme gradient boosting (XGBoost) models, with CNN-LSTM achieving the highest overall accuracy of 96.48%. At the county level, the coefficients of determination (R2) for the CNN-LSTM model were 0.91 for wheat, 0.88 for maize, and 0.73 for spring cotton. This study demonstrates that the CNN-LSTM model combined with monthly synthetic time-series NDVI provides a feasible approach for accurately mapping high-resolution multi-crop planting areas and also contributes significantly to decision support and resource management in agricultural production. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Deep learning High-resolution Monthly synthetic time-series NDVI Multi-crop classification Remote sensing Sentinel- 2

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of Computer science & Technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

引用

Journal of Computer science & Technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

来源：评论

学校读者我要写书评

暂无评论

Robust and Verifiable Privacy Federated Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第4期5卷 1895-1908页

作者： Lu, Zhi Lu, Songfeng Tang, Xueming Wu, Junjun Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518063 China

Federated learning (FL) safeguards user privacy by uploading gradients instead of raw data. However, inference attacks can reconstruct raw data using gradients uploaded by users in FL. To mitigate this issue, researchers have combined privacy computing techniques with FL. However, these techniques may not ensure the Byzantine robustness of aggregation or the integrity of the aggregated outcomes. Most current robust privacy FL methods assess differences between gradients and benchmarks in the direction, allowing adversaries to poison the aggregation against the magnitude. Furthermore, these methods cannot ensure the integrity of the aggregation results. To overcome these challenges, this study proposes a novel algorithm, robust and verifiable privacy federated learning (RVPFL), which can more effectively eliminate the poisoning attack of the opponent by measuring the direction and magnitude of the gradient in the ciphertext state. The proposed algorithm guarantees the integrity of server aggregation results while safeguarding user privacy. In this study, comprehensive theoretical analysis and experimental validation of RVPFL are conducted to demonstrate its superiority. The proposed RVPFL algorithm solves the Byzantine robustness problem of aggregation and the integrity problem of aggregation results, which helps to research and develop more robust and effective privacy-preserving federal learning techniques. © 2020 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved estimation method of secondary path uncertainties for feedback active noise control earphones

Noise Control Engineering Journal

引用

Noise Control Engineering Journal 2024年第3期72卷 166-174页

作者： Guo, Jianfeng Xun, Ziyou Ren, Zhenxing Yin, Lan Wang, Han The College of Computer Science and Technology College of Data Science Taiyuan University of Technology Taiyuan030024 China The Key Laboratory of Noise and Vibration Research Institute of Acoustics Chinese Academy of Sciences Beijing100190 China

The fixed feedback control has been widely used for active noise-canceling earphones due to its simple structure and higher performance for low-frequency noise reduction. Although some disk-based models have been done to design robust controllers, they usually overestimate the uncertainty and thus limit noise reduction. In this article, we analyze the distribution of measured secondary paths and propose the tri-rectangle model to provide the uncertainty bound. The cascade biquad controllers are optimized by solving the multi-constrained optimization problem, with H2 performance criteria and H1 performance criteria and constraints of secondary path uncertainty and noise amplification. Simulation and experiment results show that the proposed tri-rectangle model provides a more accurate estimate of the uncertainty than disk-based models, and the designed controller achieves good noise attenuation with acceptable noise enhancement and strong stability. © 2024 Institute of Noise Control Engineering.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Visual abstraction of dynamic network via improved multi-class blue noise sampling

引用

Frontiers of Computer science 2023年第1期17卷 171-185页

作者： Yanni PENG Xiaoping FAN Rong CHEN Ziyao YU Shi LIU Yunpeng CHEN Ying ZHAO Fangfang ZHOU School of Computer Science and Engineering Central South UniversityChangsha 410083China Institute of Big Data Hunan University of Finance and EconomicsChangsha 410205China Rail Data Research and Application Key Laboratory of Hunan Province Changsha 410083China

Massive sequence view (MSV) is a classic timeline-based dynamic network visualization approach. However, it is vulnerable to visual clutter caused by overlapping edges, thereby leading to unexpected misunderstanding of time-varying trends of network communications. This study presents a new edge sampling algorithm called edge-based multi-class blue noise (E-MCBN) to reduce visual clutter in MSV. Our main idea is inspired by the multi-class blue noise (MCBN) sampling algorithm, commonly used in multi-class scatterplot decluttering. First, we take a node pair as an edge class, which can be regarded as an analogy to classes in multi-class scatterplots. Second, we propose two indicators, namely, class overlap and inter-class conflict degrees, to measure the overlapping degree and mutual exclusion, respectively, between edge classes. These indicators help construct the foundation of migrating the MCBN sampling from multi-class scatterplots to dynamic network samplings. Finally, we propose three strategies to accelerate MCBN sampling and a partitioning strategy to preserve local high-density edges in the MSV. The result shows that our approach can effectively reduce visual clutters and improve the readability of MSV. Moreover, our approach can also overcome the disadvantages of the MCBN sampling (i.e., long-running and failure to preserve local high-density communication areas in MSV). This study is the first that introduces MCBN sampling into a dynamic network sampling.

关键词： dynamic network visualization massive sequence view multi-class blue noise sampling visual abstraction

来源：评论

学校读者我要写书评

暂无评论

research progress of quantum artificial intelligence in smart city

引用

Intelligent and Converged Networks 2024年第2期5卷 116-133页

作者： Sumin Wang Ning Wang Tongyu Ji Yiyun Shi Chao Wang the Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication Shanghai UniversityShanghai 200444China School of Information Engineering Ganzhou Key Laboratory of Cloud Computing and Big Data ResearchGannan University of Science and TechnologyGanzhou 341000China

The rapid accumulation of big data in the Internet era has gradually decelerated the progress of Artificial Intelligence(AI).As Moore’s Law approaches its limit,it is imperative to break the constraints that are holding back artificial *** computing and artificial intelligence have been advancing along the highway of human civilization for many years,emerging as new engines driving economic and social *** article delves into the integration of quantum computing and artificial intelligence in both research and *** introduces the capabilities of both universal quantum computers and special-purpose quantum computers that leverage quantum *** discussion further explores how quantum computing enhances classical artificial intelligence from four perspectives:quantum supervised learning,quantum unsupervised learning,quantum reinforcement learning,and quantum deep *** an effort to address the limitations of smart cities,this article explores the formidable potential of quantum artificial intelligence in the realm of smart *** does so by examining aspects such as intelligent transportation,urban operation assurance,urban planning,and information communication,showcasing a plethora of practical achievements in the *** the foreseeable future,Quantum Artificial Intelligence(QAI)is poised to bring about revolutionary development to smart *** urgency lies in developing quantum artificial intelligence algorithms that are compatible with quantum computers,constructing an efficient,stable,and adaptive hybrid computing architecture that integrates quantum and classical computing,preparing quantum data as needed,and advancing controllable qubit hardware equipment to meet actual *** ultimate goal is to shape the next generation of artificial intelligence that possesses common sense cognitive abilities,robustness,excellent generalization capabilities,and interpretability.

关键词： quantum artificial intelligence smart city D-Wave quantum computer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：