胺、醇、醚类化合物电离能的自相关拓扑研究

原子的染色序数 fi 定义为 :fi=gi·xi,式中 gi 为原子i在分子中的序数 ,xi 为其染色系数 .基于fi 建立改进的原子序数自相关拓扑指数mF ,其中的1F对烷烃及其衍生物具有良好的结构选择性 .使用第一电离能 (Ip)与0 F ,1F的数量关系模型对 32种脂肪族胺、醇、醚进行估算、预测 ,结果令人满意     

调查问卷中含缺失数据的等级变量的补缺方法

讨论了调查问卷中等级变量缺失数据的补缺问题.基于多元统计学理论,并结合总体趋势和个体偏差,提出一种新的补缺方法,方法使得补缺值更加准确、真实,并且将此方法扩展到变量等级数不相等的调查问卷之中.     

Factorization in generalized power series

The field of generalized power series with real coefficients and exponents in an ordered abelian divisible group is a classical tool in the study of real closed fields. We prove the existence of irreducible elements in the ring consisting of the generalized power series with non-positive exponents. The following candidate for such an irreducible series was given by Conway (1976): . Gonshor (1986) studied the question of the existence of irreducible elements and obtained necessary conditions for a series to be irreducible. We show that Conway's series is indeed irreducible. Our results are based on a new kind of valuation taking ordinal numbers as values. If we can give the following test for irreducibility based only on the order type of the support of the series: if the order type is either or of the form and the series is not divisible by any monomial, then it is irreducible. To handle the general case we use a suggestion of
M.-H. Mourgues, based on an idea of Gonshor, which allows us to reduce to the special case . In the final part of the paper we study the irreducibility of series with finite support.

     

判断矩阵两类不一致性的检验与调整方法研究

通过对判断矩阵不一致性分类的研究,指出现有方法对顺序不一致性检验的不足.根据一致性矩阵的特点提出一种新的方法,该方法对顺序不一致性与传递不一致性的检验与调整均具有较好的适应性,计算量小,同时具有较高的精度,并通过两个算例进行验证.     

Statistical quality control for ternary ordinal quality data

The paper considers various aspects of statistical quality control by means of sample data received on a ternary ordinal scale. A new method for evaluating quality level and dispersion, free of any latent numerical scale assumptions, is proposed. The emphasis is on working with large samples, which enable the statistical analysis, estimation and control by the use of approximate analytical expressions of these measures to be considerably simplified. Two complementary studies demonstrate the usage of the proposed approach. Copyright © 2010 John Wiley & Sons, Ltd.     

Vector Ordinal Optimization

Ordinal optimization is a tool to reduce the computational burden in simulation-based optimization problems. So far, the major effort in this field focuses on single-objective optimization. In this paper, we extend this to multiobjective optimization and develop vector ordinal optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve (OPC) are redefined for multiobjective optimization. Our results lead to quantifiable subset selection sizes in the multiobjective case, which supplies guidance in solving practical problems, as demonstrated by the examples in this paper.This paper was supported in part by Army Contract DAAD19-01-1-0610, AFOSR Contract F49620-01-1-0288, and a contract with United Technology Research Center (UTRC). The first author received additional funding from NSF of China Grants 60074012 and 60274011, Ministry of Education (China), and a Tsinghua University (Beijing, China) Fundamental Research Funding Grant, and the NCET program of China.The authors are grateful to and benefited from two rounds of reviews from three anonymous referees.     

ELECTRE: Robust ordinal regression for outranking methods

We present a new method, called ELECTRE^GKMS, which employs robust ordinal regression to construct a set of outranking models compatible with preference information. The preference information supplied by the decision maker (DM) is composed of pairwise comparisons stating the truth or falsity of the outranking relation for some real or fictitious reference alternatives. Moreover, the DM specifies some ranges of variation of comparison thresholds on considered pseudo-criteria. Using robust ordinal regression, the method builds a set of values of concordance indices, concordance thresholds, indifference, preference, and veto thresholds, for which all specified pairwise comparisons can be restored. Such sets are called compatible outranking models. Using these models, two outranking relations are defined, necessary and possible. Whether for an ordered pair of alternatives there is necessary or possible outranking depends on the truth of outranking relation for all or at least one compatible model, respectively. Distinguishing the most certain recommendation worked out by the necessary outranking, and a possible recommendation worked out by the possible outranking, ELECTRE^GKMS answers questions of robustness concern. The method is intended to be used interactively with incremental specification of pairwise comparisons, possibly with decreasing confidence levels. In this way, the necessary and possible outranking relations can be, respectively, enriched or impoverished with the growth of the number of pairwise comparisons. Furthermore, the method is able to identify troublesome pieces of preference information which are responsible for incompatibility. The necessary and possible outranking relations are to be exploited as usual outranking relations to work out recommendation in choice or ranking problems. The introduced approach is illustrated by a didactic example showing how ELECTRE^GKMS can support real-world decision problems.     

Aggregation of ordinal information

Our interest is with the fusion of information which has an ordinal structure. Information fusion in this environment requires the availability of ordinal aggregation operations. Basic ordinal operations are first introduced. Next we investigate conjunctive and disjunction aggregations of ordinal information. The idea of a pseudo-log in the ordinal environment is presented. We discuss the introduction of a zero like point on an ordinal scale along with the related ideas of bipolarity (positive and negative values) and uni-norm aggregation operators. We introduce mean like aggregation operators as well weighted averages on a ordinal scale. The problem of selecting between ordinal models is considered.     

The Recursively Mahlo Property in Second Order Arithmetic

The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proof-theoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of β-model reflection in second order arithmetic. Further, this leads to a characterization of the reals recursively computable in the superjump functional. Mathematics Subject Classification: 03F35, 03F15, 03E70.     

A framework for positive dependence

This paper presents, for bivariate distributions, a unified framework for studying and relating three basic concepts of positive dependence. These three concepts are positive dependence orderings, positive dependence properties and measures of positive dependence. The latter two concepts are formally defined and their properties discussed. Interrelationships among these three concepts are given, and numerous examples are presented.Supported by the National Science Foundation under Grant DMS-8301361.Supported by the Air Force Office of Scientific Research under Contract 84-0113. Reproduction in whole or part is permitted for any purpose of the United States Government.