يهدف البحث الحالي الى استكشاف علاقات التفاعل والتاثير بين الاحتكام للمكانة والتوجه للفردية– الجماعية والدمج التنظيمي مستنداً على مزج اختلاف القيم الشخصية مع افكار نظرية الهوية الاجتماعية لبلورة نموذج البحث. وفي ضوء هذا تم صياغة عدد من الفرضيات التي توضح علاقات التفاعل ما بين ابعاد الاحتكام للمكانة والتوجه للفردية– الجماعية للتنبؤ بوجود الدمج التنظيمي. جمعت البيانات باستخدام استمارة الاستبيان ووزعت على الكادر التدريسي والوظيفي في كلية الادارة والاقتصاد/ جامعة كربلاء شملت 112 فرد. وقد اشارت ابرز النتائج الى ان الافراد الذين يتصفون بالجماعية يزداد اندماجهم بالمنظمة عندما يدركون المكانة الخارجية، في حين ان الافراد الذين يتصفون بالفردية يزداد اندماجهم عندما يشعرون بالاحترام الداخلي. وبالاعتماد على هذه النتائج صيغت عدد من الاستنتاجات والتوصيات التي تهدف الى تعزيز الدمج التنظيمي لدى الافراد عينة البحث من خلال تعزيز هويتهم الشخصية والاجتماعية على ضوء الاختلاف في قيمهم الشخصية.
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, tra
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreWe introduce and discus recent type of fibrewise topological spaces, namely fibrewise bitopological spaces, Also, we introduce the concepts of fibrewise closed bitopological spaces, fibrewise open bitopological spaces, fibrewise locally sliceable bitopological spaces and fibrewise locally sectionable bitopological spaces. Furthermore, we state and prove several propositions concerning with these concepts.
In this paper, we used four classification methods to classify objects and compareamong these methods, these are K Nearest Neighbor's (KNN), Stochastic Gradient Descentlearning (SGD), Logistic Regression Algorithm(LR), and Multi-Layer Perceptron (MLP). Weused MCOCO dataset for classification and detection the objects, these dataset image wererandomly divided into training and testing datasets at a ratio of 7:3, respectively. In randomlyselect training and testing dataset images, converted the color images to the gray level, thenenhancement these gray images using the histogram equalization method, resize (20 x 20) fordataset image. Principal component analysis (PCA) was used for feature extraction, andfinally apply four classification metho
... Show MoreAn anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s
... Show MoreAn anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored. A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure. Pharmacological
... Show MoreAn anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s
... Show MoreThe main idea of this research is to consider fibrewise pairwise versions of the more important separation axioms of ordinary bitopology named fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise -Hausdorff spaces, fibrewise pairwise functionally -Hausdorff spaces, fibrewise pairwise -regular spaces, fibrewise pairwise completely -regular spaces, fibrewise pairwise -normal spaces and fibrewise pairwise functionally -normal spaces. In addition we offer some results concerning it.
Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric