In this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset. We also discuss the results of weak and strong convergence for this scheme.
Throughout this work, compactness condition of m-th iterate of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative
... Show MoreThe load shedding scheme has been extensively implemented as a fast solution for unbalance conditions. Therefore, it's crucial to investigate supply-demand balancing in order to protect the network from collapsing and to sustain stability as possible, however its implementation is mostly undesirable. One of the solutions to minimize the amount of load shedding is the integration renewable energy resources, such as wind power, in the electric power generation could contribute significantly to minimizing power cuts as it is ability to positively improving the stability of the electric grid. In this paper propose a method for shedding the load base on the priority demands with incorporating the wind po
... Show MoreThis 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
... Show More
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
... Show Morein this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.
We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.
In this article, the partially ordered relation is constructed in geodesic spaces by betweeness property, A monotone sequence is generated in the domain of monotone inward mapping, a monotone inward contraction mapping is a monotone Caristi inward mapping is proved, the general fixed points for such mapping is discussed and A mutlivalued version of these results is also introduced.