Dominance measuring methods are a recent approach for dealing with complex decisionmaking problems with imprecise, incomplete or partial information within multi-attribute value/utility theory. These methods compute pairwise dominance values and exploit the information included in the dominance matrix in different ways to derive measures of dominance intensity to rank the alternatives under con...

The paper investigates relationships between chemical structure, surface active properties and antibacterial activity of 70 bis-quaternary imidazolium chlorides. Chemical structure and properties of imidazolium chlorides were described by 7 condition attributes and antimicrobial properties were mapped by a decision attribute. Dominance-based Rough Set Approach (DRSA) was applied to discover a p...

In this study, 76 men came into the lab in pairs and engaged in a 7-minute videotaped mate competition for the attention of an attractive female confederate. Pre-competition testosterone (T) levels were positively associated with men’s dominance behaviors and with how much the confederate indicated that she ‘‘clicked’’ with each participant. Dyadic analyses showed that self-reported dominance m...

Dominance-based Rough Set Approach (DRSA) is an extension of classical Rough Set Theory (RST). Approximation of class unions is a very important approach in DRSA. Aiming at the disadvantage of the classical method we presented a new methodology for approximation of class unions based on dominance-matrix. It only needs to calculate the dominance-matrix and does not need to consider the preferenc...

We establish for the first time a formal relationship between dominance graphs, used for modeling semantics, and grammar formalisms with underspecified dominance links, used for modeling syntax. We present a translation of normal dominance graphs into Unordered Vector Grammars with Dominance Links (UVG-DL) and prove that the configurations of the dominance graph correspond to the derivation tre...

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...