Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity
The aim of the present work is to define a new class of closed soft sets in soft closure spaces, namely, generalized closed soft sets (
The visual stimulus is the effective force in visual attraction that achieves visual and perceptual co-optation and is important in wooing the recipient, and many procedural processes in the design are interpreted on it as the visual stimulus achieves visual comfort and a sense of pleasure and gives (place) the interior space a transformation in its plastic structure as well as arousing attention through The kinetic rhythm and the formal diversity, which increases the possibility of breaking the routine and traditional constraints of design patterns through the coating and encapsulation of the vertical and horizontal levels . Thus, the research problem was launched based on the following question: What are the stimuli of the visual stimu
... Show MoreBased on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.
In this thesis, we introduced some types of fibrewise topological spaces by using a near soft set, various related results also some fibrewise near separation axiom concepts and a fibrewise soft ideal topological spaces. We introduced preliminary concepts of topological spaces, fibrewise topology, soft set theory and soft ideal theory. We explain and discuss new notion of fibrewise topological spaces, namely fibrewise soft near topological spaces, Also, we show the notions of fibrewise soft near closed topological spaces, fibrewise soft near open topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces. On the other hand, we studied fibrewise soft near forms of the more essent
... Show MoreThe theory of Topological Space Fiber is a new and essential branch of mathematics, less than three decades old, which is created in forced topologies. It was a very useful tool and played a central role in the theory of symmetry. Furthermore, interdependence is one of the main things considered in topology fiber theory. In this regard, we present the concept of topological spaces α associated with them and study the most important results.
The aim of this thesis is to introduce a new concept of fibrewise topological spaces which is said to be fibrewise slightly topological spaces. We generalize some of the main results that have been reached from fibrewise topology into fibrewise slightly topological space. We introduce the concepts of fibrewise slightly closed, fibrewise slightly open, fibrewise locally sliceable, and fibrewise locally sectionable slightly topological spaces. Also, state and prove several propositions related to these concepts. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise slightly T_0 spaces, fibrewise slightly T_1 spaces, fibrewise slightly R_0 spaces, fibrewise s
... Show MoreThe chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.
Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the
... Show More