This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.
In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.
Most real-life situations need some sort of approximation to fit mathematical models. The beauty of using topology in approximation is achieved via obtaining approximation for qualitative subgraphs without coding or using assumption. The aim of this paper is to apply near concepts in the -closure approximation spaces. The basic notions of near approximations are introduced and sufficiently illustrated. Near approximations are considered as mathematical tools to modify the approximations of graphs. Moreover, proved results, examples, and counterexamples are provided.
Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to
... Show MoreThis work is concerned with the vibration attenuation of a smart beam interacting with fluid using proportional-derivative PD control and adaptive approximation compensator AAC. The role of the AAC is to improve the PD performance by compensating for unmodelled dynamics using the concept of function approximation technique FAT. The key idea is to represent the unknown parameters using the weighting coefficient and basis function matrices/vectors. The weighting coefficient vector is updated using Lyapunov theory. This controller is applied to a flexible beam provided with surface bonded piezo-patches while the vibrating beam system is submerged in a fluid. Two main effects are considered: 1) axial stretching of the vibrating beam that leads
... Show MoreIn this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact
... Show MoreIn This paper, we have been approximated Grűnwald-Letnikov Derivative of a function having m continuous derivatives by Bernstein Chlodowsky polynomials with proving its best approximation. As well as we have been solved Bagley-Torvik equation and Fokker–Planck equation where the derivative is in Grűnwald-Letnikov sense.
Improved oral bioavailability of lipophilic substances can be achieved using self-emulsifying drug delivery systems. However, because the properties of self-emulsifying are greatly influenced by surfactant amount and type, type of oil used, droplet size, charge, cosolvents, and physiological variables, the synthesis of self-emulsifying is highly complex; consequently, only a small number of excipient self-emulsifying formulations has been developed so far for clinical use. This study reports a highly effective procedure for developing self-emulsifying formulations using a novel approach based on the hydrophilic-lipophilic difference theory. Microemulsion characteristics, such as the constituents and amounts of oil and surfactant electrolyte
... Show MoreAssume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).
Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show More