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

Memristor-Based Circuit of Sequential Associative Memory with Memory Interactions and Stimulus Similarity Effect

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Xiong, Dongdong Wang, Xiaoping Jiang, Yiming Yang, Chao Jiang, Man Lai, Jingang Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China Hubei Key Laboratory of Braininspired Intelligent Systems Wuhan430074 China Huazhong University of Science and Technology Institute of Artificial Intelligence School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China Guangxi University of Science and Technology School of Computer Science and Technology Liuzhou545006 China Huazhong University of Science and Technology Department of Physiology School of Basic Medicine and Tongji Medical College Wuhan430030 China

Most proposed memristor-based circuits of associative memory consider various mechanisms in only one associative memory. Few works on circuit design of sequential associative memory have been reported. In this paper, a memristor-based circuit of sequential associative memory with memory interactions and stimulus similarity effect is designed. Two associative memories, the prior associative memory (PAM) and the later associative memory (LAM), are formed successively. The PAM modifies the rate of the formation of the LAM, and the LAM, in turn, affects the strength of the PAM, which are two interactions in sequential associative memory, called transfer and retroaction. In addition, the magnitudes of transfer and retroaction are determined by the similarity of the conditioned stimuli. The above functions are realized by the ring input processing module, memory module, transfer module and retroaction module. It has been identified in circuit analysis that the proposed circuit is power efficient and has good robustness. Furthermore, the proposed circuit has promising applications for fire rescue robots. © 2016 IEEE.

关键词： Associative storage

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization via Gradient Descent with Event-Triggered Zooming over Quantized Communication

arXiv

引用

arXiv 2023年

作者： Rikos, Apostolos I. Jiang, Wei Charalambous, Themistoklis Johansson, Karl H. The Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA02215 United States Hong Kong The Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus The Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland The Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden

In this paper, we study unconstrained distributed optimization strongly convex problems, in which the exchange of information in the network is captured by a directed graph topology over digital channels that have limited capacity (and hence information should be quantized). Distributed methods in which nodes use quantized communication yield a solution at the proximity of the optimal solution, hence reaching an error floor that depends on the quantization level used;the finer the quantization the lower the error floor. However, it is not possible to determine in advance the optimal quantization level that ensures specific performance guarantees (such as achieving an error floor below a predefined threshold). Choosing a very small quantization level that would guarantee the desired performance, requires information packets of very large size, which is not desirable (could increase the probability of packet losses, increase delays, etc) and often not feasible due to the limited capacity of the channels available. In order to obtain a communication-efficient distributed solution and a sufficiently close proximity to the optimal solution, we propose a quantized distributed optimization algorithm that converges in a finite number of steps and is able to adjust the quantization level accordingly. The proposed solution uses a finite-time distributed optimization protocol to find a solution to the problem for a given quantization level in a finite number of steps and keeps refining the quantization level until the difference in the solution between two successive solutions with different quantization levels is below a certain pre-specified threshold. Therefore, the proposed algorithm progressively refines the quantization level, thus eventually achieving low error floor with a reduced communication burden. The performance gains of the proposed algorithm are demonstrated via illustrative examples. © 2023, CC BY.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Broad-Deep Network-Based Fuzzy Emotional Inference Model with Personal Information for Intention Understanding

引用

IFAC-PapersOnLine 2023年第2期56卷 7071-7076页

作者： Min Li Luefeng Chen Min Wu Min Ding Kaoru Hirota Witold Pedrycz School of Automation China University of Geosciences Wuhan 430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan 430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan 430074 China Tokyo Institute of Technology Yokohama 226-8502 Japan Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6R 2G7 Canada

A broad-deep fusion network-based fuzzy emotional inference model with personal information (BDFEI) is proposed for emotional intention understanding in human-robot interaction. It aims to understand students’ intentions in the university teaching scene. Specifically, feature extraction is carried out by convolution and maximum pooling, and then the ridge regression algorithm is used for emotional behavior recognition, which reduce the influence of the complex structure and slow network updates in deep learning. Multivariate analysis of variance is used to select the key personal information affecting the intention and obtain the coefficient of influence degree. Finally, fuzzy inference is used to understand the intention. According to the recognition results, the accuracy on FABO database of our proposal is 1.89%, 12.21% and 0.78% higher than those of the Residual Network combined with geodesic flow kernel (ResNet-101+GFK), a fuzzy deep neural network with sparse autoencoder (FDNNSA), and an affect recognition on a video-skeleton of bimodal information with a hierarchical classification fusion strategy (HCFS), respectively, indicating that our proposal can effectively capture the emotional intention of students in the teaching scene.

关键词： Convolution Neural Networks Broad Learning Emotional Intention Human-Robot Interaction

来源：评论

学校读者我要写书评

暂无评论

DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing

DeepRicci: Self-supervised Graph Structure-Feature Co-Refine...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Li Sun Zhenhao Huang Hua Wu Junda Ye Hao Peng Zhengtao Yu Philip S. Yu School of Control and Computer Engineering North China Electric Power University Beijing China School of Computer Science Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming China Department of Computer Science University of Illinois at Chicago IL USA

Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined graph. In the literature, most GSL solutions either primarily focus on structure refinement with task-specific supervision (i.e., node classification), or overlook the inherent weakness of GNNs themselves (e.g., over-squashing), resulting in suboptimal performance despite sophisticated designs. In light of these limitations, we propose to study self-supervised graph structure-feature co-refinement for effectively alleviating the issue of over-squashing in typical GNNs. In this paper, we take a fundamentally different perspective of the Ricci curvature in Riemannian geometry, in which we encounter the challenges of modeling, utilizing and computing Ricci curvature. To tackle these challenges, we present a self-supervised Riemannian model, DeepRicci. Specifically, we introduce a latent Riemannian space of heterogeneous curvatures to model various Ricci curvatures, and propose a gyrovector feature mapping to utilize Ricci curvature for typical GNNs. Thereafter, we refine node features by geometric contrastive learning among different geometric views, and simultaneously refine graph structure by backward Ricci flow based on a novel formulation of differentiable Ricci curvature. Finally, extensive experiments on public datasets show the superiority of DeepRicci, and the connection between backward Ricci flow and over-squashing. Codes of our work are given in https://***/RiemanGraph/.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Application of Deep Learning Method to Estimate Bottomhole Pressure Dynamics of Oil Wells

Application of Deep Learning Method to Estimate Bottomhole P...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Haibo Cheng Shichao Li Peng Zeng Valeriy Vyatkin State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå Sweden Department of Electrical Engineering and Automation Aalto University Helsinki Finland

Surrogate models, which have become an effective and popular method to close loop reservoir management problems, use a data-driven approach to predict dynamic injection and production wells parameters and optimize waterflooding development. In this study, a deep learning-based surrogate model method is proposed to estimate bottomhole pressure (BHP) of production wells in waterflooding reservoirs. Bidirectional long short-term memory (BiLSTM) network, as an efficient deep learning approach, is applied to BHP estimation using fluctuation data. Extended Fourier amplitude sensitivity test (EFAST) method is employed to analyse the influence of different input factors on BHP dynamics, and a reduced dataset is rebuilt to predict BHP parameter based on BiLSTM-EFAST algorithm. The estimation results are tested on a dataset from Volve oilfield in North Sea, and compared with other deep learning methods. The test results indicate that the proposed method can achieve higher prediction accuracy. A reduced dataset-based approach provides a new attempt to reduce model complexity and improve calculation speed for big data-driven surrogate model in oil and gas industry.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation

RLSAC: Reinforcement Learning enhanced Sample Consensus for ...

引用

International Conference on computer Vision (ICCV)

作者： Chang Nie Guangming Wang Zhe Liu Luca Cavalli Marc Pollefeys Hesheng Wang Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai Jiao Tong University Department of Computer Science ETH Zürich MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Microsoft Mixed Reality and AI Zürich Lab

Robust estimation is a crucial and still challenging task, which involves estimating model parameters in noisy environments. Although conventional sampling consensus-based algorithms sample several times to achieve robustness, these algorithms cannot use data features and historical information effectively. In this paper, we propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. The feedback of downstream tasks serves as the reward for unsupervised training. Therefore, RL-SAC can avoid differentiating to learn the features and the feedback of downstream tasks for end-to-end robust estimation. In addition, RLSAC integrates a state transition module that encodes both data and memory features. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis. Through analysis, it is apparent that RLSAC can be easily transferred to other sampling consensus-based robust estimation tasks. To the best of our knowledge, RLSAC is also the first method that uses reinforcement learning to sample consensus for end-to-end robust estimation. We release our codes at https://***/IRMVLab/RLSAC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Multi-population Integrated Approach for Capacitated Location Routing

arXiv

引用

arXiv 2024年

作者： He, Pengfei Hao, Jin-Kao Wu, Qinghua School of Automation Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Southeast University Nanjing210096 China Department of Computer Science LERIA University of Angers 2 Boulevard Lavoisier Angers49045 France School of Management Huazhong University of Science and Technology No. 1037 Luoyu Road Wuhan China

The capacitated location-routing problem involves determining the depots from a set of candidate capacitated depot locations and finding the required routes from the selected depots to serve a set of customers whereas minimizing a cost function that includes the cost of opening the chosen depots, the fixed utilization cost per vehicle used, and the total cost (distance) of the routes. This paper presents a multi-population integrated framework in which a multi-depot edge assembly crossover generates promising offspring solutions from the perspective of both depot location and route edge assembly. The method includes an effective neighborhood-based local search, a feasibility-restoring procedure and a diversification-oriented mutation. Of particular interest is the multi-population scheme which organizes the population into multiple subpopulations based on depot configurations. Extensive experiments on 281 benchmark instances from the literature show that the algorithm performs remarkably well, by improving 101 best-known results (new upper bounds) and matching 84 best-known results. Additional experiments are presented to gain insight into the role of the key elements of the algorithm. © 2024, CC BY-NC-ND.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Efficient Time-Delay System Optimization with Auto-Configured Metaheuristics

Efficient Time-Delay System Optimization with Auto-Configure...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Roman Senkerik Aleksander Byrski Hubert Guzowski Peter Janku Tomas Kadavy Zuzana Kominkova Oplatkova Radek Matusu Michal Pluhacek Libor Pekar Maciej Smolka Adam Viktorin Department of Informatics and Artificial Intelligence A.I. Lab Faculty of Applied Informatics Tomas Bata University in Zlin Czech Republic Department of Automation and Control Engineering Faculty of Applied Informatics Tomas Bata University in Zlin Czech Republic Institute of Computer Science AGH University of Science and Technology Krakow Poland

This paper presents an experimental study that compares the performance of four selected metaheuristic algorithms for optimizing a time delay system model. Time delay system models are complex and challenging to optimize due to their inherent characteristics, such as non-linearity, multi-modality, and constraints. The study includes an explanation of the choice and core functionality of the selected algorithms, which are both baseline and state-of-the-art variants of self-organizing migrating algorithm (SOMA), state-of-the-art variant from the Success-History-based Adaptive Differential Evolution family of algorithms, with emphasis on diverse search (DISH algorithm), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. The hyperparameters of the metaheuristic algorithms were set using the iRace automatic algorithm configuration framework. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delay systems to develop more effective and efficient control strategies and precise model identifications. The experimental results highlight the effectiveness of the state-of-the-art algorithms with specific adaptive mechanisms like population organization process, diverse search and adaptation mechanisms ensuring a gradual transition from exploration to exploitation. Overall, this study contributes to understanding the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of modern metaheuristic algorithms and can help guide the selection of appropriate adaptive mechanisms of metaheuristics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Probabilistic Coordinate Fields for Robust Correspondences

arXiv

引用

arXiv 2023年

作者： Zhao, Weiyue Lu, Hao Ye, Xinyi Cao, Zhiguo Li, Xin Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Lane Department of Computer Science and Electrical Engineering West Virginia University MorgantownWV26506-6109 United States

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-invariant coordinate representation for image correspondence problems. In contrast to standard Cartesian coordinates, PCFs encode coordinates in correspondence-specific barycentric coordinate systems (BCS) with affine invariance. To know when and where to trust the encoded coordinates, we implement PCFs in a probabilistic network termed PCF-Net, which parameterizes the distribution of coordinate fields as Gaussian mixture models. By jointly optimizing coordinate fields and their confidence conditioned on dense flows, PCF-Net can work with various feature descriptors when quantifying the reliability of PCFs by confidence maps. An interesting observation of this work is that the learned confidence map converges to geometrically coherent and semantically consistent regions, which facilitates robust coordinate representation. By delivering the confident coordinates to keypoint/feature descriptors, we show that PCF-Net can be used as a plug-in to existing correspondence-dependent approaches. Extensive experiments on both indoor and outdoor datasets suggest that accurate geometric invariant coordinates help to achieve the state of the art in several correspondence problems, such as sparse feature matching, dense image registration, camera pose estimation, and consistency filtering. Further, the interpretable confidence map predicted by PCF-Net can also be leveraged to other novel applications from texture transfer to multi-homography classification. Copyright © 2023, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

A2B: Anchor to Barycentric Coordinate for Robust Correspondence

arXiv

引用

arXiv 2023年

作者： Zhao, Weiyue Lu, Hao Cao, Zhiguo Li, Xin The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Lane Department of Computer Science and Electrical Engineering West Virginia University Commonwealth of Virginia Morgantown 15461 United States

There is a long-standing problem of repeated patterns in correspondence problems, where mismatches frequently occur because of inherent ambiguity. The unique position information associated with repeated patterns makes coordinate representations a useful supplement to appearance representations for improving feature correspondences. However, the issue of appropriate coordinate representation has remained unresolved. In this study, we demonstrate that geometric-invariant coordinate representations, such as barycentric coordinates, can significantly reduce mismatches between features. The first step is to establish a theoretical foundation for geometrically invariant coordinates. We present a seed matching and filtering network (SMFNet) that combines feature matching and consistency filtering with a coarse-to-fine matching strategy in order to acquire reliable sparse correspondences. We then introduce DEGREE, a novel anchor-to-barycentric (A2B) coordinate encoding approach, which generates multiple affine-invariant correspondence coordinates from paired images. DEGREE can be used as a plug-in with standard descriptors, feature matchers, and consistency filters to improve the matching quality. Extensive experiments in synthesized indoor and outdoor datasets demonstrate that DEGREE alleviates the problem of repeated patterns and helps achieve state-of-the-art performance. Furthermore, DEGREE also reports competitive performance in the third Image Matching Challenge at CVPR 2021. This approach offers a new perspective to alleviate the problem of repeated patterns and emphasizes the importance of choosing coordinate representations for feature correspondences. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：