The theories of metric spaces and fuzzy metric spaces are crucial topics in mathematics.   

Compactness is one of the most important and fundamental properties that have been widely used in Functional Analysis. In this paper, the definition of compact fuzzy soft metric space is introduced and some of its important theorems are investigated. Also, sequentially compact fuzzy soft metric space and locally compact fuzzy soft metric space are defined and the relationships between them are studied. Moreover, the relationships between each of the previous two concepts and several other known concepts are investigated separately. Besides, the compact fuzzy soft continuous functions are studie

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

     The inefficient use of spectrum is the key subject to overcome the upcoming spectrum crunch issue. This paper presents a study of performance of cooperative cognitive network via hard combining of decision fusion schemes. Simulation results presented different cooperative hard decision fusion schemes for cognitive network. The hard-decision fusion schemes provided different discriminations for detection levels. They also produced small values of Miss-Detection Probability at different values of Probability of False Alarm and adaptive threshold levels. The sensing performance was investigated under the influence of channel condition for proper operating conditions. An increase in the detection performance was achi

This paper deals with the continuous classical optimal control problem for triple partial differential equations of parabolic type with initial and boundary conditions; the Galerkin method is used to prove the existence and uniqueness theorem of the state vector solution for given continuous classical control vector. The proof of the existence theorem of a continuous classical optimal control vector associated with the triple linear partial differential equations of parabolic type is given. The derivation of the Fréchet derivative for the cost function is obtained. At the end, the theorem of the necessary conditions for optimality of this problem is stated and is proved.

In this paper, author’s study sub diffusion bio heat transfer model and developed explicit finite difference scheme for time fractional sub diffusion bio heat transfer equation by using caputo fabrizio fractional derivative. Also discussed conditional stability and convergence of developed scheme. Furthermore numerical solution of time fractional sub diffusion bio heat transfer equation is obtained and it is represented graphically by Python.

In this paper, the continuous classical boundary optimal control problem (CCBOCP) for triple linear partial differential equations of parabolic type (TLPDEPAR) with initial and boundary conditions (ICs & BCs) is studied. The Galerkin method (GM) is used to prove the existence and uniqueness theorem of the state vector solution (SVS) for given continuous classical boundary control vector (CCBCV). The proof of the existence theorem of a continuous classical boundary optimal control vector (CCBOCV) associated with the TLPDEPAR is proved. The derivation of the Fréchet derivative (FrD) for the cost function (CoF) is obtained. At the end, the theorem of the necessary conditions for optimality (NCsThOP) of this problem is stated and prov

Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence

In the present work, an image compression method have been modified by combining The Absolute Moment Block Truncation Coding algorithm (AMBTC) with a VQ-based image coding. At the beginning, the AMBTC algorithm based on Weber's law condition have been used to distinguish low and high detail blocks in the original image. The coder will transmit only mean of low detailed block (i.e. uniform blocks like background) on the channel instate of transmit the two reconstruction mean values and bit map for this block. While the high detail block is coded by the proposed fast encoding algorithm for vector quantized method based on the Triangular Inequality Theorem (TIE), then the coder will transmit the two reconstruction mean values (i.e. H&L)

In the current work, the mixing ratios ( 𝛿 ) of gamma transitions were calculated from energy levels in the isotopes neodymium 60𝑁𝑎 142−150 populated in the 60Nd 142− 150 (n, n ˊγ) 60Nd 142− 150 using the 𝑎2 ratio method. We used the experimental coefficient (𝑎2 ) for two γ-transitions from the initial state itself, the statistical tensor 𝜌2(𝐽𝑖), associated with factor 𝑎2 , would be the same for the two transitions. The results obtained are in good agreement or within the experimental error with -those previously published. And existing contradictions resulting from inaccuracies in the empirical results of previous work. The current results confirm that the , 𝑎2 − method is used to calculate th

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie