霍普菲尔德神经网络中的人工龙算法,以获得最佳的精确布尔式k满足性表示
Ghassan Ahmed Ali1, Hamza Abubakar2, Shehab Abdulhabib Saeed Alzaeemi3
1College of Computer Science and Information Systems, Najran University, Najran, Saudi Arabia.
PloS one
|September 25, 2023
概括
一种新的混合计算方法将人工龙算法 (ADA) 和霍普菲尔德神经网络 (HNN) 结合起来,以获得最佳的精确布尔k-满足性 (EBkSAT) 表示. 这种ADA-HNN-EBkSAT模型提高了精度,并减少了复杂优化任务的计算时间.
科学领域:
- 计算智能是一种计算智能.
- 人工智能的人工智能
- 优化算法 优化算法
背景情况:
- 精确布尔式k-满足性 (EBkSAT) 问题在计算上具有挑战性.
- 现有的EBkSAT表示方法通常在训练速度和准确性方面面临限制.
- 优化逻辑规则表示对于各种计算任务至关重要.
研究的目的:
- 引入一种新的混合计算方法,将人工龙算法 (ADA) 与霍普菲尔德神经网络 (HNN) 集成.
- 调查ADA在加速HNN培训中的有效性,以优化EBkSAT逻辑表示.
- 评估拟议的ADA-HNN-EBkSAT模型的性能和稳定性.
主要方法:
- 开发一个混合的ADA-HNN计算模型.
- 构建一个特定的EBkSAT问题实例,使用模拟数据集进行评估.
- 使用全球最低比率 (GmR),RMSE,MAPE和计算时间 (CT) 等指标进行绩效评估.
主要成果:
- 与现有方法相比,拟议的ADA-HNN-EBkSAT模型显示出更高的准确性.
- 混合模型显著减少了EBkSAT表示所需的计算时间.
- 对比分析证实了HNN的ADA算法的有效性和稳定性.
结论:
- ADA-HNN-EBkSAT混合模型为最佳EBkSAT逻辑表示提供了有效和高效的解决方案.
- ADA与HNN具有很强的兼容性,提高了培训速度和解决方案质量.
- 这种方法对解决计算机科学,工程和商业领域复杂的优化问题具有重大意义.
相关概念视频
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
3.1K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.1K
Block Diagram Reduction
236
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
236
Relation between Mathematical Equations and Block Diagrams
399
In a spring-mass-damper system, the second-order differential equation describes the dynamic behavior of the system. When transformed into the Laplace domain under zero initial conditions, this equation can be effectively analyzed and manipulated. The transformation into the Laplace domain converts differential equations into algebraic equations, simplifying the process of isolating the output.
399
State Space Representation
228
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
Consider an RLC circuit, a...
228
Simplified Synchronous Machine Model
266
The Synchronous Machine Model is a fundamental tool in analyzing and ensuring the transient stability of power systems. This model simplifies the representation of a synchronous machine under balanced three-phase positive-sequence conditions, assuming constant excitation and ignoring losses and saturation. The model is pivotal for understanding the behavior of synchronous generators connected to a power grid, particularly during transient events.
In this model, each generator is connected to a...
In this model, each generator is connected to a...
266
SFG Algebra
132
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
132


