模糊粗糙近似算子公理集的独立性

用双论域上的模糊关系定义了广义模糊粗糙近似算子,并讨论了近似算子的性质。用公理刻画了模糊集合值算子,各种公理化的近似算子可以保证找到相应的二元模糊关系,使得由模糊关系通过构造性方法定义的模糊粗糙近似算子恰好就是用公理定义的近似算子。讨论了刻画各种特殊近似算子的公理集的独立性,从而给出各种特殊模糊关系所对应的模糊粗糙近似算子的最小公理集。     

Measurable multiattribute value functions defined on binary attributes

A set of preference independence conditions is defined with respect to a binary attribute set. It is argued that these conditions can be used to show that a value function describing the preference for alternatives over binary attributes has an additive form. This argument emphasizes that strengthened independence concepts are necessary in the binary attribute case since solvability axioms cannot be defined to allow an algebraic proof of additivity based on the independence conditions of an additive conjoint structure.     

Monte Carlo simulation techniques for group decision making with incomplete information

In this paper we deal with group decision-making problems where several decision makers elicit their own preferences separately. The decision makers’ preferences are quantified using a decision support system, which admits incomplete information concerning the decision makers’ responses to the questions they are asked. Consequently, each decision maker proposes classes of utility functions and attribute weight intervals for the different attributes. We introduce an approach based on Monte Carlo simulation techniques for aggregating decision maker preferences that could be the starting point for a negotiation process, if necessary. The negotiation process would basically involve the decision maker tightening the imprecise component utilities and weights to output more meaningful results and achieve a consensus alternative. We focus on how attribute weights and the component utilities associated with a consequence are randomly generated in the aggregation process taking into account the decision-makers’ preferences, i.e., their respective attribute weight intervals and classes of utility functions. Finally, an application to the evaluation of intervention strategies for restoring a radionuclide contaminated lake illustrates the usefulness and flexibility of this iterative process.     

Sensitivity analysis incorporating fuzzy evaluation for scaling constants of multiattribute utility functions

A multiattribute utility function can be represented by a function of single-attribute utility functions if the decision maker’s preference satisfies additive independence or mutually utility independence. Additive independence is a preference condition stronger than mutually utility independence, and the multiattribute utility function is in the additive form if the former condition is satisfied, otherwise it is in the multiplicative form. In this paper, we propose a method for sensitivity analysis of multiattribute utility functions in multiplicative form, taking into account the imprecision of the decision maker’s judgment in the procedures for determining scaling constants (attribute weights).     

群体多指标决策的偏好集结方法

研究多个指标条件下,利用个体决策结果形成群体一致偏好的方法、假设个体有加性效用函数,将个体多指标效用函数表示成单个指标评价函数的加权和,群体指标评价函数表示成个体指标评价函数的加权和.通过协商指标权重、指标评价函数、支付意愿三个参数,成对个体达成双方一致.提出了(n-1)对个体之间达成双方一致,从而得出群体效用函数的决策方法,这种分析框架同样可以扩展到联盟协商一致中.     

Propagating belief functions in qualitative Markov trees

This article is concerned with the computational aspects of combining evidence within the theory of belief functions. It shows that by taking advantage of logical or categorical relations among the questions we consider, we can sometimes avoid the computational complexity associated with brute-force application of Dempster's rule.The mathematical setting for this article is the lattice of partitions of a fixed overall frame of discernment. Different questions are represented by different partitions of this frame, and the categorical relations among these questions are represented by relations of qualitative conditional independence or dependence among the partitions. Qualitative conditional independence is a categorical rather than a probabilistic concept, but it is analogous to conditional independence for random variables.We show that efficient implementation of Dempster's rule is possible if the questions or partitions for which we have evidence are arranged in a qualitative Markov tree—a tree in which separations indicate relations of qualitative conditional independence. In this case, Dempster's rule can be implemented by propagating belief functions through the tree.     

On the distribution of three-valued functions over pre-complete classes

A system of 36 ??axioms?? binding pre-complete classes of a three-valued logic is proposed. On the basis on these axioms (and their duals), a set of 406 rows is built in which all possible cases of distributions of three-valued functions over pre-complete classes are presented.     

Unbounded expected utility and continuity

This paper develops an axiom system for expected utility in a setting wherepreferences are defined directly on probability distributions of outcomes. The axioms do not imply boundedness of the utility function. The approach is topological, and conditions for continuity of the utility function are brought out.     

Discounting axioms imply risk neutrality

Although most applications of discounting occur in risky settings, the best-known axiomatic justifications are deterministic. This paper provides an axiomatic rationale for discounting in a stochastic framework. Consider a representation of time and risk preferences with a binary relation on a real vector space of vector-valued discrete-time stochastic processes on a probability space. Four axioms imply that there are unique discount factors such that preferences among stochastic processes correspond to preferences among present value random vectors. The familiar axioms are weak ordering, continuity and nontriviality. The fourth axiom, decomposition, is non-standard and key. These axioms and the converse of decomposition are assumed in previous axiomatic justifications for discounting with nonlinear intraperiod utility functions in deterministic frameworks. Thus, the results here provide the weakest known sufficient conditions for discounting in deterministic or stochastic settings. In addition to the four axioms, if there exists a von Neumann-Morgenstern utility function corresponding to the binary relation, then that function is risk neutral (i.e., affine). In this sense, discounting axioms imply risk neutrality.     

Stein's method and Plancherel measure of the symmetric group

We initiate a Stein's method approach to the study of the Plancherel measure of the symmetric group. A new proof of Kerov's central limit theorem for character ratios of random representations of the symmetric group on transpositions is obtained; the proof gives an error term. The construction of an exchangeable pair needed for applying Stein's method arises from the theory of harmonic functions on Bratelli diagrams. We also find the spectrum of the Markov chain on partitions underlying the construction of the exchangeable pair. This yields an intriguing method for studying the asymptotic decomposition of tensor powers of some representations of the symmetric group.

     

Partition Identities Involving Gaps and Weights,II

In this second paper under the same title, some more weighted representations are obtained for various classical partition functions including p(n), the number of unrestricted partitions ofn , Q(n), the number of partitions ofn into distinct parts and the Rogers-Ramanujan partitions ofn (of both types). The weights derived here are given either in terms of congruence conditions satisfied by the parts or in terms of chains of gaps between the parts. Some new connections between partitions of the Rogers-Ramanujan, Schur and Göllnitz–Gordon type are revealed.     

Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets

Covering rough sets generalize traditional rough sets by considering coverings of the universe instead of partitions, and neighborhood-covering rough sets have been demonstrated to be a reasonable selection for attribute reduction with covering rough sets. In this paper, numerical algorithms of attribute reduction with neighborhood-covering rough sets are developed by using evidence theory. We firstly employ belief and plausibility functions to measure lower and upper approximations in neighborhood-covering rough sets, and then, the attribute reductions of covering information systems and decision systems are characterized by these respective functions. The concepts of the significance and the relative significance of coverings are also developed to design algorithms for finding reducts. Based on these discussions, connections between neighborhood-covering rough sets and evidence theory are set up to establish a basic framework of numerical characterizations of attribute reduction with these sets.     

Generating functions for plane partitions of a given shape

For fixed integers α and β, planar arrays of integers of a given shape, in which the entries decrease at least by α along rows and at least by β along columns, are considered. For various classes of these (α,β)-plane partitions we compute three different kinds of generating functions. By a combinatorial method, determinantal expressions are obtained for these generating functions. In special cases these determinants may be evaluated by a simple determinant lemma. All known results concerning plane partitions of a given shape are included. Thus our approach of a given shape provides a uniform proof method and yields numerous generalizations of known results.     

Measures of Association for Hilbertian Subspaces and Some Applications

Measures of association are introduced for Hilbertian subspaces, that are defined by a few axioms and are shown to be symmetric nondecreasing functions of the canonical coefficients. When particular subspaces are considered, classical measures of association are obtained as particular cases. Moreover, the proposed framework allows one to introduce new approaches for measuring partial noncorrelation, partial independence and linear predictability of a stationary process.     

Two-person bargaining: An experimental test of the Nash axioms

Tests were carried out on thirty pairs of subjects, using three different sets of conditions, for the purpose of experimentally validatingNash's axioms (and also, incidentally, certain other hypotheses of two-person bargaining). Under validation, it was found that subjects' responses conformed to both thesymmetry andindependence of irrelevant alternatives axioms. On the other hand, the axiom ofinvariance under linear transformations of utility was constantly violated. This may be due to the fact that subjects, whenever possible, try to effect an interpersonal comparison of utility.     

Optimal techniques for class-dependent attribute discretization

Preprocessing of raw data has been shown to improve performance of knowledge discovery processes. Discretization of quantitative attributes is a key component of preprocessing and has the potential to greatly impact the efficiency of the process and the quality of its outcomes. In attribute discretization, the value domain of an attribute is partitioned into a finite set of intervals so that the attribute can be described using a small number of discrete representations. Discretization therefore involves two decisions, on the number of intervals and the placement of interval boundaries. Previous approaches for quantitative attribute discretization have used heuristic algorithms to identify partitions of the attribute value domain. Therefore, these approaches cannot be guaranteed to provide the optimal solution for the given discretization criterion and number of intervals. In this paper, we use linear programming (LP) methods to formulate the attribute discretization problem. The LP formulation allows the discretization criterion and the number of intervals to be integral considerations of the problem. We conduct experiments and identify optimal solutions for various discretization criteria and numbers of intervals.     

Some bitopological concepts based on the alternative effects of closure and interior operator

In this paper we give an approach for constructing classes of near open and near closed sets which have unusual implication relations. These new classes of subsets are based on the alternative effect of closure and interior operators with respect to two topologies. Also these classes of subsets are applied for constructing several classes of near continuous functions and some types of separation axioms called mildly binormal, almost ij-normal, almost ij-regular, quasi ij-regular and strongly S-ij-regular. Using the introduced functions, we generalize several preservation theorems of normality and regularity to bitopological spaces. Implications between notions are given and counter examples for some reverse directions are obtained. It should be noted that considering the space time as the product of two topologies, the topology of space and that of the space time will open the way for new line of research in the field of quantum gravity initiated by Witten and El-Naschie and many others (cf. [Chaos, Solitons & Fractals 17 (2003) 989; Chaos, Solitons & Fractals 7 (1996) 499; Int. J. Theor. Phys. 37 (1998) 2935; Phys. Today (1996) 24]).     

Elementary Proofs of Identities for Schur Functions and Plane Partitions

We use elementary methods to prove formulas that represent sums of restricted classes of Schur functions as ratios of determinants. This includes recent formulas for sums over bounded partitions with even parts and sums over bounded partitions whose conjugates have only even parts. All of these formulas imply plane partition generating functions.     

Solving Partition Problems with Colour-Bipartitions

Polar, monopolar, and unipolar graphs are defined in terms of the existence of certain vertex partitions. Although it is polynomial to determine whether a graph is unipolar and to find whenever possible a unipolar partition, the problems of recognizing polar and monopolar graphs are both NP-complete in general. These problems have recently been studied for chordal, claw-free, and permutation graphs. Polynomial time algorithms have been found for solving the problems for these classes of graphs, with one exception: polarity recognition remains NP-complete in claw-free graphs. In this paper, we connect these problems to edge-coloured homomorphism problems. We show that finding unipolar partitions in general and finding monopolar partitions for certain classes of graphs can be efficiently reduced to a polynomial-time solvable 2-edge-coloured homomorphism problem, which we call the colour-bipartition problem. This approach unifies the currently known results on monopolarity and extends them to new classes of graphs.