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 .
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
In this study, we report a statistical study for the relationship between coronal mass ejections (CMEs) and sunspot number (SSN) that were registered during the period 2008-2017 for the solar cycle 24. SSN was extracted from Sunspot Index and Long-term Solar Observations (SILSO), while CMEs number from observations made by the Large Angle and Spectrometric Coronagraph (LASCO) on board the Solar and Heliospheric Observatory mission (SOHO). The present period was adopted to conduct the investigation and obtain the mutual correlation between SSN and CMEs. The relationship between CME, the speed of halo CME, and partial halo CMEs for solar cycle 24 were studied. The analysis of results indicated that the average speed of halo CMEs is almost
... Show MoreIn this paper an authentication based finger print biometric system is proposed with personal identity information of name and birthday. A generation of National Identification Number (NIDN) is proposed in merging of finger print features and the personal identity information to generate the Quick Response code (QR) image that used in access system. In this paper two approaches are dependent, traditional authentication and strong identification with QR and NIDN information. The system shows accuracy of 96.153% with threshold value of 50. The accuracy reaches to 100% when the threshold value goes under 50.
In this paper, some basic notions and facts in the b-modular space similar to those in the modular spaces as a type of generalization are given. For example, concepts of convergence, best approximate, uniformly convexity etc. And then, two results about relation between semi compactness and approximation are proved which are used to prove a theorem on the existence of best approximation for a semi-compact subset of b-modular space.
Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre
... Show More