Microtubules as a Quantum Hopfield Network

Image encryption is a confidential strategy to keep the information in digital images from being leaked. Due to excellent chaotic dynamic behavior, self-feedbacked Hopfield networks have been used to design image ciphers. However, Self-feedbacked Hopfield networks have complex structures, large computational amount and fixed parameters; these properties limit the application of them. In this paper, a single neuronal dynamical system in self-feedbacked Hopfield network is unveiled. The discrete form of single neuronal dynamical system is derived from a self-feedbacked Hopfield network. Chaotic performance evaluation indicates that the system has good complexity, high sensitivity, and a large chaotic parameter range. The system is also incorporated into a framework to improve its chaotic performance. The result shows the system is well adapted to this type of framework, which means that there is a lot of room for improvement in the system. To investigate its applications in image encryption, an image encryption scheme is then designed. Simulation results and security analysis indicate that the proposed scheme is highly resistant to various attacks and competitive with some exiting schemes.

Download Full-text

An Application of the Associate Hopfield Network for Pattern Matching in Chart Analysis

Applied Sciences ◽

10.3390/app11093876 ◽

2021 ◽

Vol 11 (9) ◽

pp. 3876

Author(s):

Weiming Mai ◽

Raymond S. T. Lee

Keyword(s):

Time Series ◽

Pattern Matching ◽

Time Series Data ◽

Financial Time Series ◽

Noisy Data ◽

Hopfield Neural Network ◽

Hopfield Network ◽

Series Data ◽

Financial Time ◽

Chart Patterns

Chart patterns are significant for financial market behavior analysis. Lots of approaches have been proposed to detect specific patterns in financial time series data, most of them can be categorized as distance-based or training-based. In this paper, we applied a trainable continuous Hopfield Neural Network for financial time series pattern matching. The Perceptually Important Points (PIP) segmentation method is used as the data preprocessing procedure to reduce the fluctuation. We conducted a synthetic data experiment on both high-level noisy data and low-level noisy data. The result shows that our proposed method outperforms the Template Based (TB) and Euclidean Distance (ED) and has an advantage over Dynamic Time Warping (DTW) in terms of the processing time. That indicates the Hopfield network has a potential advantage over other distance-based matching methods.

Download Full-text

Bogdanov–Takens bifurcation in a Hopfield network model with bidirectional connection and multiple delays

IMA Journal of Mathematical Control and Information ◽

10.1093/imamci/dnv035 ◽

2015 ◽

pp. dnv035

Author(s):

Aws Ben Hamed ◽

Bassem Ben Hamed

Keyword(s):

Network Model ◽

Hopfield Network ◽

Multiple Delays

Download Full-text

Efficient matching algorithm by a hybrid Hopfield network for object recognition

10.1117/12.139967 ◽

1992 ◽

Author(s):

Jung H. Kim ◽

Sung H. Yoon ◽

Yong H. Kim ◽

Evi H. Park ◽

Celestine A. Ntuen ◽

...

Keyword(s):

Object Recognition ◽

Hopfield Network ◽

Matching Algorithm ◽

Efficient Matching

Download Full-text

EVALUATION OF TASK ALLOCATION IN MESH-BASED MULTICOMPUTERS USING GENETIC, NEURAL, AND TRADITIONAL ALGORITHMS

International Journal of Artificial Intelligence Tools ◽

10.1142/s0218213094000042 ◽

1994 ◽

Vol 03 (01) ◽

pp. 47-60

Author(s):

R.A. McCONNELL ◽

B.L. MENEZES

Keyword(s):

Task Allocation ◽

Bin Packing ◽

Packing Problem ◽

Allocation Problem ◽

Hopfield Network ◽

Processor Allocation ◽

Classical Level ◽

Bin Packing Problem ◽

Residual Space ◽

Computer Tasks

This article compares three techniques for allocating tasks in a mesh-based multi-computer. Tasks are expressed as rectangles of a certain width and height corresponding to the topology of processors desired. The task allocation problem, is thus a variant of the bin-packing problem, with one major difference: in the bin-packing problem one seeks to minimize the height of the bin, while here we seek to maximize the utilization of processors in a multicomputer. The three techniques compared are a classical level-by-level algorithm, a connectionist simulated annealing variant of the Hopfield network, and a genetic algorithm. An extension to the dynamic processor allocation problem is modeled by fixing some rectangles in place and packing the request rectangles in the residual space on the mesh; this corresponds to a pre-existing condition, i.e., some tasks have already been allocated to the Processor Mesh. Implementation and experimental results are presented.

Download Full-text