In this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.
Since the time it emerged, stylistics, as a field of knowledge which combines both linguistics and literature, acquired a special status in the linguistic arena. Its significance in complementing the meaning delivered by linguistic means has been proven and acknowledged through numerous stylistic analytic attempts of different literary works and in different languages. The question put forward in this paper is whether or not the stylistic analysis can work as effectively on translated texts as it does on the original ones without having the results reached by the analysis distorting the meaning of the original text. An attempt to investigate this question is made herein by conducting a lexical stylistic analysi
... Show MoreAbstract
The population is sets of vocabulary common in character or characters and it’s study subject or research . statistically , this sets is called study population (or abridgement population ) such as set of person or trees of special kind of fruits or animals or product any country for any commodity through infinite temporal period term ... etc.
The population maybe finite if we can enclose the number of its members such as the students of finite school grade . and maybe infinite if we can not enclose the number of it is members such as stars or aquatic creatures in the sea . when we study any character for population the statistical data is concentrate by two metho
... Show Morehe genus Hirudo is an invertebrate animal that got major concerns to human. However, genetics of Hirudo has been unwell considered in Iraq. In order to gain a deeper understanding in the outline of the genetic of Hirudo that were used in alternative medicine clinics, nineteen specimens of Hirudo were obtained. Fourteen of them (H.verbana, n=10; H. orientalis, n=4) were obtained from some different clinics and scientific centres in Baghdad, Iraq between January and March 2022, these specimens were considered as non-local leeches. The other (native isolates) leeches (H. orientalis, n=5) were collected in 2014 from two localities in Erbil, northern Iraq. ITS-2, COI and 12S-rRNA of Hirudo spp were amplified using conventional polymerase chain r
... Show MoreA finite element is a study that is capable of predicting crack initiation and simulating crack propagation of human bone. The material model is implemented in MATLAB finite element package, which allows extension to any geometry and any load configuration. The fracture mechanics parameters for transverse and longitudinal crack propagation in human bone are analyzed. A fracture toughness as well as stress and strain contour are generated and thoroughly evaluated. Discussion is given on how this knowledge needs to be extended to allow prediction of whole bone fracture from external loading to aid the design of protective systems.
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 MoreSuppose that
Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f
... Show MoreIn this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.
This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.