Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Prabhu, S.a; * | Deepa, S.b | Arulperumjothi, M.c | Susilowati, Liliekd | Liu, Jia-Baoe
Affiliations: [a] Department Mathematics, Rajalakshmi Engineering College, Thandalam, Chennai, India | [b] Department of Mathematics, Easwari Engineering College, Chennai, India | [c] Department of Mathematics, Saveetha Engineering College, Thandalam, Chennai, India | [d] Department of Mathematics, Universitas Airlangga, Surabaya, Indonesia | [e] School of Mathematics and Physics, Anhui Jianzhu University, Hefei, P.R. China
Correspondence: [*] Corresponding author. S. Prabhu, Department Mathematics, Rajalakshmi Engineering College, Thandalam, Chennai 602105, India. E-mail: drsavariprabhu@gmail.com.
Abstract: Power utilities must track their power networks to respond to changing demand and availability conditions to ensure effective and efficient operation. As a result, several power companies continuously employ phase measuring units (PMUs) to continuously check their power networks. Supervising an electric power system with the fewest possible measurement equipment is precisely the vertex covering graph-theoretic problems otherwise a variation of the dominating set problem, in which a set D is defined as a power dominating set (PDS) of a graph if it supervises every vertex and edge in the system with a couple of rules. If the distance vector eccentrically characterizes each node in G with respect to the nodes in R, then the subset R of V (G) is a resolving set of G. The problem of finding power dominating set and resolving set problems are proven to be NP-complete in general. The finite subset R of V (G) is said to be resolving-power dominating set (RPDS) if it is both resolving and power dominating set, which is another NP-complete problem. The ηp (G) is the minimal cardinality of an RPDS of a graph G. A neural network is a collection of algorithms that tries to figure out the underlying correlations in a set of data by employing a method that replicates how the human brain functions. Various neural networks have seen rapid progress in multiple fields of study during the last few decades, including neurochemistry, artificial intelligence, automatic control, and informational sciences. Probabilistic neural networks (PNNs) offer a scalable alternative to traditional back-propagation neural networks in classification and pattern recognition applications. They do not necessitate the massive forward and backward calculations that ordinary neural networks entail. This paper investigates the resolving-power domination number of probabilistic neural networks.
Keywords: Metric dimension, basis, phasor measurement unit, power domination, probabilistic neural network, resolving set
DOI: 10.3233/JIFS-220218
Journal: Journal of Intelligent & Fuzzy Systems, vol. 43, no. 5, pp. 6253-6263, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl