YWYanfeng Wang

Yanfeng Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yanfeng Wang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Dynamic analysis of FN–HR neural network coupled of bistable memristor and encryption application based on Fibonacci Q-Matrix

    by Junwei Sun, Chuangchuang Li, Yanfeng Wang, Zicheng Wang

    In this paper, a cosine hyperbolic memristor model is proposed with bistable asymmetric hysteresis loops. A neural network of coupled hyperbolic memristor is constructed by using the Fitzhugh–Nagumo model and the Hindmarsh–Rose model. The coupled neural network with a large number of equilibrium points is obtained by numerical analysis. In addition, the coexisting discharge behavior of the coupled neural network is revealed using local attractor basins. The complex dynamic properties of the memristor-coupled neural network are verified by analyzing the two-parameter Lyapunov exponential map and spectral entropy map, and the equivalent circuit of the coupled neural network is designed to prove the accuracy of the numerical analysis. Finally, an image encryption algorithm is proposed, which combines coupled neural network and Fibonacci Q-Matrix. The numerical analysis demonstrates that the algorithm exhibits strong security and resistance against cracking attempts.


  • Open Access

    Cell-like P Systems with Channel States and Synchronization Rule

    by Suxia Jiang, Tao Liang, Bowen Xu, Zhichao Shen, Xiaoliang Zhu, Yanfeng Wang

    Cell-like P systems with channel states and symport/antiport rules (CCS P systems) are a type of nondeterministic parallel biological computing model, where there exists a channel between adjacent regions and there is a state on each channel to control the execution of symport/antiport rules. In this work, a synchronization rule is introduced into CCS P systems, a variant of CCS P systems called CCS P systems with synchronization rule (CCSs P systems) is proposed. The universality of CCSs P systems with only uniport (symport or antiport) rules is investigated. By simulating the register machine, we proved that CCSs P systems have the ability to simulate any Turing machine in the following three cases: having two membranes, two channel states and using symport rules of length at most 2; having one membrane, three channel states and using symport rules of length at most 2; and having one membrane, two channel states and using antiport rules of length at most 3.