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

A parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

SPECIFICATION AND ANALYSIS OF parallel DISTRIBUTED SOFTWARE AND SYSTEMS BY PETRI NETS WITH TRANSITION ENABLING FUNCTIONS

引用

IEEE TRANSACTIONS ON SOFTWARE engineering 1992年第3期18卷 252-261页

作者： PAPELIS, YE CASAVANT, TL Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa City IA 52242

This paper investigates a new approach for visually specifying parallel/distributed software using Petri Nets (PN's) extended with Transition Enabling Functions (TEF's). The approach is demonstrated to be useful in the specification of decision-making activities that control distributed computing systems. PN's are employed because of their highly visual nature that can give insight into the nature of the controller of such a system and because of their well-known analytical properties. In order to increase the expressive power of PN's, the extension of TEF's is used. The main focus of this paper is the specification and analysis of parallel/distributed software and systems. A key element of this approach is a set of rules derived to automatically transform such an extended net into a basic PN. Once the rules have been applied to transform the specification, well-known analytical methods can be used to investigate characteristic properties of the system and validate correct operation.

关键词： DISTRIBUTED SOFTWARE parallel SOFTWARE SOFTWARE SPECIFICATION parallel PETRI NETS TRANSITION ENABLING FUNCTIONS CONCURRENCY

来源：评论

学校读者我要写书评

暂无评论

Reduced-Order Consensus Protocols with Pure Relative Output: Design, Existence, and Dual Results

引用

IEEE Transactions on Automatic Control 2025年

作者： Ma, Yuwen Li, Xianwei Li, Shaoyuan Lin, Zongli Shanghai Jiao Tong University Department of Automation Shanghai200240 China State Key Laboratory of Submarine Geoscience China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China University of Virginia Charles L. Brown Department of Electrical and Computer Engineering CharlottesvilleVA22904 United States

This paper studies reduced-order dynamic consensus protocols for homogeneous linear multi-agent systems using pure relative output information. By applying H∞ control theory, a separation principle-like method with an additional small-gain constraint is proposed for designing an (nx-nu)th order protocol, where nx and nu are the numbers of states and inputs of each agent, respectively. Existence conditions for the protocol are then systematically discussed from the graph, low gain and high gain perspectives, respectively. It is revealed that the protocol always exists and can be found by the proposed design method for three cases: 1) directed acyclic networks, 2) agents with all eigenvalues in the closed left-half complex plane and 3) agents of minimum phase. Another reduced-order protocol of (nx - ny)th order is further discussed through duality. Finally, a numerical example is provided to illustrate the effectiveness of the proposed method. © 1963-2012 IEEE.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

The NeRF Signature: Codebook-Aided Watermarking for Neural Radiance Fields

arXiv

引用

arXiv 2025年

作者： Luo, Ziyuan Rocha, Anderson Shi, Boxin Guo, Qing Li, Haoliang Wan, Renjie Department of Computer Science Hong Kong Baptist University Hong Kong Institute of Computing University of Campinas Brazil State Key Laboratory of Multimedia Information Processing and National Engineering Research Center of Visual Technology School of Computer Science Peking University Beijing100871 China A*STAR Singapore Department of Electrical Engineering City University of Hong Kong Hong Kong

Neural Radiance Fields (NeRF) have been gaining attention as a significant form of 3D content representation. With the proliferation of NeRF-based creations, the need for copyright protection has emerged as a critical issue. Although some approaches have been proposed to embed digital watermarks into NeRF, they often neglect essential model-level considerations and incur substantial time overheads, resulting in reduced imperceptibility and robustness, along with user inconvenience. In this paper, we extend the previous criteria for image watermarking to the model level and propose NeRF Signature, a novel watermarking method for NeRF. We employ a Codebook-aided Signature Embedding (CSE) that does not alter the model structure, thereby maintaining imperceptibility and enhancing robustness at the model level. Furthermore, after optimization, any desired signatures can be embedded through the CSE, and no fine-tuning is required when NeRF owners want to use new binary signatures. Then, we introduce a joint pose-patch encryption watermarking strategy to hide signatures into patches rendered from a specific viewpoint for higher robustness. In addition, we explore a Complexity-Aware Key Selection (CAKS) scheme to embed signatures in high visual complexity patches to enhance imperceptibility. The experimental results demonstrate that our method outperforms other baseline methods in terms of imperceptibility and robustness. The source code is available at: https://***/luo-ziyuan/NeRF_Signature. Copyright © 2025, The Authors. All rights reserved.

关键词： Image watermarking

来源：评论

学校读者我要写书评

暂无评论

Direct Multipath-Based SLAM

引用

IEEE Transactions on Signal processing 2025年

作者： Liang, Mingchao Leitinger, Erik Meyer, Florian University of California San Diego Department of Electrical and Computer Engineering La Jolla CA92093 United States Graz University of Technology Signal Processing and Speech Communication Laboratory Graz8010 Austria University of California San Diego Scripps Institution of Oceanography La Jolla CA92093 United States

Radio-based localization approaches that make use of reflections in the propagation environment to improve the accuracy and robustness of location estimates have a variety of potential applications in future wireless communication networks. Multipath-based simultaneous localization and mapping (SLAM) aims at estimating the position of agents and reflecting features in the environment by exploiting the relationship between the local geometry and multipath components (MPCs) in received radio signals. Existing multipath-based SLAM methods preprocess received radio signals using a channel estimator. The channel estimator lowers the data rate by extracting a set of dispersion parameters for each MPC. These parameters are then used as measurements for SLAM. Bayesian estimation for multipath-based SLAM is facilitated by the lower data rate. However, due to finite resolution capabilities limited by signal bandwidth, channel estimation is prone to errors and MPC parameters may be extracted incorrectly and lead to a reduced SLAM performance. We propose a multipath-based SLAM approach that directly uses received radio signals as inputs. A new statistical model that can effectively be represented by a factor graph is introduced. The factor graph is the starting point for the development of an efficient belief propagation (BP) method for multipath-based SLAM that avoids data preprocessing by a channel estimator. Numerical results based on synthetic and real data in challenging single-input, single-output (SISO) scenarios demonstrate that the proposed method outperforms conventional methods in terms of localization and mapping accuracy. © 1991-2012 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A Stackelberg Game Approach for Signal Temporal Logic Control Synthesis with Uncontrollable Agents

arXiv

引用

arXiv 2025年

作者： Cui, Bohan Yu, Xinyi Giua, Alessandro Yin, Xiang Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai200240 China Thomas Lord Department of Computer Science University of Southern California Los AngelesCA90089 United States Department of Electrical and Electronic Engineering University of Cagliari Cagliari09123 Italy

In this paper, we investigate the control synthesis problem for Signal Temporal Logic (STL) specifications in the presence of uncontrollable agents. Existing works mainly address this problem in a robust control setting by assuming the uncontrollable agents are adversarial and accounting for the worst-case scenario. While this approach ensures safety, it can be overly conservative in scenarios where uncontrollable agents have their own objectives that are not entirely opposed to the system’s goals. Motivated by this limitation, we propose a new framework for STL control synthesis within the Stackelberg game setting. Specifically, we assume that the system controller, acting as the leader, first commits to a plan, after which the uncontrollable agents, acting as followers, take a best response based on the committed plan and their own objectives. Our goal is to synthesize a control sequence for the leader such that, for any rational followers producing a best response, the leader’s STL task is guaranteed to be satisfied. We present an effective solution to this problem by transforming it into a single-stage optimization problem and leveraging counterexample guided synthesis techniques. We demonstrate that the proposed approach is sound and identify conditions under which it is optimal. Simulation results are also provided to illustrate the effectiveness of the proposed framework. © 2025, CC BY.

关键词： Control system synthesis

来源：评论

学校读者我要写书评

暂无评论

RDVC: Efficient Deep Video Compression with Regulable Rate and Complexity Optimization

引用

IEEE Transactions on Multimedia 2025年

作者： Wei, Xiaojie Lin, Jielian Xu, Jiawei Gao, Wei Zhao, Tiesong Putian University School of Mechanical Electrical & Information Engineering PutianFujian China Shenzhen Graduate School Peking University School of Electronic and Computer Engineering Shenzhen518055 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fujian Science & Technology Innovation Laboratory for Optoelectronic Information of China Fuzhou350108 China Tsinghua University Department of Electronic Engineering Beijing100084 China

Deep video coding has paved a way to break through the performance bottleneck of reigning hybrid video coding. However, unlike hybrid video codecs, existing deep video codecs cannot offer both flexible rates and regulable complexities within one single codec, which limits their applications. In this paper, we propose a Regulable Deep Video Codec (RDVC) to address the above issue. First, we propose an Adaptive Feature Compression (AFC) network that generates variable rates while ensuring Rate-Distortion (RD) performance. The network introduces a two-stage coarse-to-fine rate adjustment that can be controlled by a user-specified rate level. Second, we propose a Spatio-Temporal Feature Propagation (STFP) mechanism to provide high-quality reference information for AFC process. Third, we also utilize slimmable convolutional components in our framework to adjust decoding complexity constrained by user configuration. Experimental results demonstrate that RDVC can adjust the codec structure flexibly according to different user configurations while maintaining advanced performance. On average, it reduces the bit-per-pixel (bpp) by 9.35%/58.12% while maintaining the same PSNR/MS-SSIM as the reference software VTM-13.2. Sourcecode is available at: https://***/WXJ0001/RDVC. © 2025 IEEE.

关键词： Signal distortion

来源：评论

学校读者我要写书评

暂无评论

NOMA Assisted Semi-Grant-Free Transmission for UAV Networks: A Multi-User Scheduling Approach

引用

IEEE Transactions on Communications 2025年

作者： Huang, Junlin Lu, Huabing Tang, Jie Zhao, Nan Shi, Zhaoyuan Wang, Xianbin Dalian University of Technology School of Information and Communication Engineering Dalian116024 China Nanchang University School of Information Engineering Jiangxi Provincial Key Laboratory of Advanced Signal Processing and Intelligent Communications Nanchang330031 China South China University of Technology School of Electronic and Information Engineering Guangzhou510640 China Anqing Normal University School of Computer and Information Anqing246052 China Western University Department of Electrical and Computer Engineering LondonN6A 5B9 Canada

Non-orthogonal multiple access (NOMA) assisted semi-grant-free (SGF) transmission, which enables grant-based users to share their spectrum with grant-free (GF) users, becomes an effective solution to the challenge of massive connections. However, this improvement is limited as most of the existing schemes can only admit one GF user. In this paper, we propose a novel NOMA-assisted SGF transmission scheme to support the access of multiple GF users in unmanned aerial vehicle networks. Moreover, in order to further enhance the advantages of the multi-user SGF scheme, two SGF schemes with power matching are devised to further improve the performance by employing the benefits of distributed contention. For ease of performance evaluation, the theoretical expressions of achievable sum rate and average age of information of the three SGF schemes are derived by applying order statistics. We also investigate the high signal-to- noise approximation expressions of sum rate for these schemes to give more insight. Finally, simulation results are provided to demonstrate the performance improvement of three proposed SGF schemes and validate the correctness of the theoretical analysis expressions. © 1972-2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

A Risk-Averse Just-In-Time Scheme for Learning-Based Operation of Microgrids With Coupled Electricity-Hydrogen-Ammonia Under Uncertainties

引用

IEEE Transactions on Sustainable Energy 2025年

作者： Li, Longyan Ning, Chao Pan, Guangsheng Zhang, Leiqi Gu, Wei Zhao, Liang Du, Wenli Shahidehpour, Mohammad Shanghai Jiao Tong University Department of Automation Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China School of Electrical Engineering Southeast University Nanjing210096 China Zhejiang Key Laboratory of Distributed Generations and Microgrid Technology State Grid Zhejiang Electric Power Research Institute Hangzhou310014 China Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology China Department of Electrical and Computer Engineering Illinois Institute of Technology ChicagoIL60616 United States

This paper proposes a Risk-Averse Just-In-Time (RAJIT) operation scheme for Ammonia-Hydrogen-based Micro-Grids (AHMGs) to boost electricity-hydrogen-ammonia coupling under uncertainties. First, an off-grid AHMG model is developed, featuring a novel multi-mode ammonia synthesis process and a hydrogen-ammonia dual gas turbine with tunable feed-in ratios. Subsequently, a state-behavior mapping strategy linking hydrogen storage levels with the operation modes of ammonia synthesis is established to prevent cost-ineffective shutdowns. The proposed model substantially improves operational flexibility but results in a challenging nonlinear fractional program. Based upon this model, a data-driven RAJIT scheme is developed for the real-time rolling optimization of AHMGs. Unlike conventional one-size-fits-all schemes using one optimization method throughout, the data-driven RAJIT intelligently switches between cost-effective deterministic optimization and risk-averse online-learning distributionally robust optimization depending on actual risk profiles, thus capitalizing on the respective strengths of these two optimization methods. To facilitate the solution of the resulting nonlinear program, we develop an equivalent-reformulation-based solution methodology by leveraging a constraint-tightening technique. Numerical simulations demonstrate that the proposed scheme guarantees safety and yields an overall cost reduction up to 14.6% compared with several state-of-the-art methods. © 2025 IEEE.

关键词： Ammonia

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：