This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, transitive, tolerance, dominance and equivalence in table.
Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show MoreThis research dealt with the impact of internal control on tax performance using balanced scorecard indicators because of its special importance in improving tax performance and reform. The internal control system is a safety valve for senior management in all organizations, it plays an important role in the regularity and development of work and the fight against corruption To provide reliable and accurate data and information, follow up on compliance with laws, regulations and instructions. The aim of this research is to demonstrate how control affects tax performance and how to adapt internal control components to improve tax performance. In the General Authority for taxes and its branches,. The research resulted in a number of conclu
... Show MoreThe research included five sections containing the first section on the introduction of the research and its importance and was addressed to the importance of the game of gymnastic and skilled parallel effectiveness and the importance of learning, but the problem of research that there is a difference in learning this skill and difficulty in learning may be one of the most important reasons are fear and fear of falling and injury, And a lack of sense of the movement of the movement is one of the obstacles in the completion of the skill and the goal of research to design a device that helps in learning the skill of descending Almtor facing with half a cycle according to the typical locomotor track on the parallel device of the technical men'
... Show MoreThis study concluded detection of Toxoplasma gondii in milk, immunologically by using Elisa and nested PCR)nPCR (based on B1 gene, also to investigate the effect of toxoplasmosis, parity, breed and flock on some milk composition in the Iraqi local and Shami goats in the middle of Iraq. A total of 80 milk samples of the lactating goats were collected. Results of this study showed the prevalence of Toxoplasmosis was 21.25% and 28.75% by Elisa and nPCR respectively without significant differences. The sensitivity of Elisa was a low (30.43%) whereas the specificity was a high (82.45%). The degree of agreement estimated by Kappa coefficient revealed a slight agreement (0.14) between two methods. The results indicated that goats infected
... Show MoreThe 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.
The significance fore supra topological spaces as a subject of study cannot be overstated, as they represent a broader framework than traditional topological spaces. Numerous scholars have proposed extension to supra open sets, including supra semi open sets, supra per open and others. In this research, a notion for ⱨ-supra open created within the generalizations of the supra topology of sets. Our investigation involves harnessing this style of sets to introduce modern notions in these spaces, specifically supra ⱨ - interior, supra ⱨ - closure, supra ⱨ - limit points, supra ⱨ - boundary points and supra ⱨ - exterior of sets. It has been examining the relationship with supra open. The research was also enriched with many
... Show MoreIn this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.
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.
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More