Search results for: poset

Authors: Walied Hazim Sharif

Abstract:

The problem of faithful extension with the condition of keeping constant height h and constant width w, i.e. for h w -inextensibility, seems more interesting than the brute extension of finite poset (partially ordered set). We shall investigate some theorems of hw-inextensive and hw-exrensive posets that can be used to formulate the faithful extension problem. A theorem in its general form of hw-inextensive posets is given to implement the presented theorems.

Keywords: faithful extension, poset, extension, inextension, height, width, hw-extensive, hw-inextensive

Procedia PDF Downloads 383

Authors: Hossein Pourali

Abstract:

In this paper, we extend the concepts of primal and weakly primal ideals for posets. Further, the diameter of the zero divisor graph of a poset with respect to a non-primal ideal is determined. The relation between primary and primal ideals in posets is also studied.

Keywords: ‎associated prime ideal, ‎‎ideal, ‎‎primary ideal, primal ideal‎, prime‎ ‎ideal, semiprime ideal, ‎weakly primal ideal, zero divisors graph

Procedia PDF Downloads 254

Authors: Walied Hazim Sharif

Abstract:

The problem of faithful extension with the condition of keeping constant height h and constant width w, i.e. for hw-inextensibility, seems more interesting than the brute extension of finite poset (partially ordered set). We shall investigate some theorems of hw-inextensive and hw-extensive posets that can be used to formulate the faithful extension problem. A theorem in its general form of hw-inextensive posets are given to implement the presented theorems.

Keywords: faithful extension, poset, extension, inextension, height, width, hw-extensive, hw-inextensive

Procedia PDF Downloads 258

Authors: Mina Rahmani Pour

Abstract:

Negative consequences of unemployment are: increasing age at marriage, addiction, depression, drug trafficking, divorce, immigration, elite, frustration, delinquency, theft, murder, etc., has led to addressing the issue of employment by economic planners, public authorities, chief executive economic conditions in different countries and different time is important. All countries are faced with the problem of unemployment. By identifying the influential factors of occupational employment and employing strengths in the basic steps can be taken to reduce unemployment. In this study, the most significant factors affecting employment has identified 12 variables based on interviews conducted Choose Vtasyrafzaysh engaged in three main business is discussed. DRGAM next question the 8 expert ministry to respond to it is distributed and for weight Horns AZFN Shannon entropy and the ranking criteria of the (SAW, TOPSIS) used. According to the results of the above methods are not compatible with each other, to reach a general consensus on the rating criteria of the technique of integrating (POSET) involving average, Borda, copeland is used. Ultimately, there is no difference between the employments in the economic sector jobs of increased employment.

Keywords: employment, effective techniques, SAW, TOPSIS

Procedia PDF Downloads 233

Authors: Xiuzhan Guo, Arthur Berrill, Ajinkya Kulkarni, Kostya Belezko, Min Luo

Abstract:

Ontology operations, e.g., aligning and merging, were studied and implemented extensively in different settings, such as categorical operations, relation algebras, and typed graph grammars, with different concerns. However, aligning and merging operations in the settings share some generic properties, e.g., idempotence, commutativity, associativity, and representativity, labeled by (I), (C), (A), and (R), respectively, which are defined on an ontology merging system (D~M), where D is a non-empty set of the ontologies concerned, ~ is a binary relation on D modeling ontology aligning and M is a partial binary operation on D modeling ontology merging. Given an ontology repository, a finite set O ⊆ D, its merging closure Ô is the smallest set of ontologies, which contains the repository and is closed with respect to merging. If (I), (C), (A), and (R) are satisfied, then both D and Ô are partially ordered naturally by merging, Ô is finite and can be computed, compared, and sorted efficiently, including sorting, selecting, and querying some specific elements, e.g., maximal ontologies and minimal ontologies. We also show that the ontology merging system, given by ontology V -alignment pairs and pushouts, satisfies the properties: (I), (C), (A), and (R) so that the merging system is partially ordered and the merging closure of a given repository with respect to pushouts can be computed efficiently.

Keywords: ontology aligning, ontology merging, merging system, poset, merging closure, ontology V-alignment pair, ontology homomorphism, ontology V-alignment pair homomorphism, pushout

Procedia PDF Downloads 893