Let f and g be a self – maps of a rational exterior space . A natural number m is called a minimal coincidence period of maps f and g if f^m and g^m have a coincidence point which is not coincidence by any earlier iterates. This paper presents a complete description of the set of algebraic coincidence periods for self - maps of a rational exterior space which has rank 2 .
This work addressed the assignment problem (AP) based on fuzzy costs, where the objective, in this study, is to minimize the cost. A triangular, or trapezoidal, fuzzy numbers were assigned for each fuzzy cost. In addition, the assignment models were applied on linguistic variables which were initially converted to quantitative fuzzy data by using the Yager’sorankingi method. The paper results have showed that the quantitative date have a considerable effect when considered in fuzzy-mathematic models.
An improved Metal Solar Wall (MSW) with integrated thermal energy storage is presented in this research. The proposed MSW makes use of two, combined, enhanced heat transfer methods. One of the methods is characterized by filling the tested ducts with a commercially available copper Wired Inserts (WI), while the other one uses dimpled or sinusoidal shaped duct walls instead of plane walls. Ducts having square or semi-circular cross sectional areas are tested in this work.
A developed numerical model for simulating the transported thermal energy in MSW is solved by finite difference method. The model is described by system of three governing energy equations. An experimental test rig has been built and six new duct configurations have b
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
Developed countries are facing many challenges to convert large areas of existing services to electronic modes, reflecting the current nature of workflow and the equipment utilized for achieving such services. For instance, electricity bill collection still tend to be based on traditional approaches (paper-based and relying on human interaction) making them comparatively time-consuming and prone to human error.
This research aims to recognize numbers in mechanical electricity meters and convert them to digital figures utilizing Optical Character Recognition (OCR) in Matlab. The research utilized the location of red region in color electricity meters image to determine the crop region that contain the meters numbers, then
... Show MoreIn this article, performing and deriving the probability density function for Rayleigh distribution by using maximum likelihood estimator method and moment estimator method, then crating the crisp survival function and crisp hazard function to find the interval estimation for scale parameter by using a linear trapezoidal membership function. A new proposed procedure used to find the fuzzy numbers for the parameter by utilizing ( to find a fuzzy numbers for scale parameter of Rayleigh distribution. applying two algorithms by using ranking functions to make the fuzzy numbers as crisp numbers. Then computed the survival functions and hazard functions by utilizing the real data application.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreUltraviolet spectrophotometric studies for antibiotic (amino glycoside) derivatives including, Neomycin, Streptomycin, Gentamycin and Kanamycin with special reagents, which are benzoyl chloride; benzene sulfonyl chloride, toluenesulfonyl chloride and phthalic anhydride were made. Amino glycosides derivatives were followed through measurements of the ultraviolet absorbance (A) from which the absorptivity (ε) of the complexes was deduced and molar absorbances using Ultraviolet for products and calculate the number of reagents molecule that combine to amino glycosides.
Decision-making in Operations Research is the main point in various studies in our real-life applications. However, these different studies focus on this topic. One drawback some of their studies are restricted and have not addressed the nature of values in terms of imprecise data (ID). This paper thus deals with two contributions. First, decreasing the total costs by classifying subsets of costs. Second, improving the optimality solution by the Hungarian assignment approach. This newly proposed method is called fuzzy sub-Triangular form (FS-TF) under ID. The results obtained are exquisite as compared with previous methods including, robust ranking technique, arithmetic operations, magnitude ranking method and centroid ranking method. This
... Show MoreThis article is devoted to presenting results on invariant approximations over a non-star-shsped weakly compact subset of a complete modular space by introduced a new notion called S-star-shaped with center f: if be a mapping and , . Then the existence of common invariant best approximation is proved for Banach operator pair of mappings by combined the hypotheses with Opial’s condition or demi-closeness condition