In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between the met

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

The implementation of technology in the provision of public services and communication to citizens, which is commonly referred to as e-government, has brought multitude of benefits, including enhanced efficiency, accessibility, and transparency. Nevertheless, this approach also presents particular security concerns, such as cyber threats, data breaches, and access control. One technology that can aid in mitigating the effects of security vulnerabilities within e-government is permissioned blockchain. This work examines the performance of the hyperledger fabric private blockchain under high transaction loads by analyzing two scenarios that involve six organizations as case studies. Several parameters, such as transaction send ra

The best proximity point is a generalization of a fixed point that is beneficial when the contraction map is not a self-map. On other hand, best approximation theorems offer an approximate solution to the fixed point equation . It is used to solve the problem in order to come up with a good approximation. This paper's main purpose is to introduce new types of proximal contraction for nonself mappings in fuzzy normed space and then proved the best proximity point theorem for these mappings. At first, the definition of fuzzy normed space is given. Then the notions of the best proximity point and - proximal admissible in the context of fuzzy normed space are presented. The notion of α ̃–ψ ̃- proximal contractive mapping is introduced.

This paper presents a study of a syndrome coding scheme for different binary linear error correcting codes that refer to the code families such as BCH, BKLC, Golay, and Hamming. The study is implemented on Wyner’s wiretap channel model when the main channel is error-free and the eavesdropper channel is a binary symmetric channel with crossover error probability (0 < Pe ≤ 0.5) to show the security performance of error correcting codes while used in the single-staged syndrome coding scheme in terms of equivocation rate. Generally, these codes are not designed for secure information transmission, and they have low equivocation rates when they are used in the syndrome coding scheme. Therefore, to improve the transmiss

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over