基于模糊判断矩阵信息确定专家权重的方法

本文对群组模糊判断矩阵集结过程中确定专家权重的问题进行了研究,建立了模糊判断矩阵的特征矩阵和求解群集结矩阵的最优化模型,通过矩阵之间距离度量判断信息自身逻辑一致性程度和群体相容性程度,给出一种基于专家判断信息的可信度计算其后验权重的方法,最后用算例予以说明.     

区间数互补判断矩阵的一致性及其排序研究

由于目前国内外文献对区间数互补判断矩阵的性质研究较少,从而使得对排序方法的相关研究缺乏理论依据.针对这些缺陷,本文研究了区间数互补判断矩阵的性质及其排序方法问题.根据区间数互补判断矩阵的定义,给出了区间数互补判断矩阵的一致性、严格强传递性与弱传递性等定义,并研究了一致性判断矩阵的性质,并说明这些性质更符合人们的思维特征.在一致性性质的基础上建立了区间数互补判断矩阵排序的非线性规划模型,算例分析表明该方法是有效可行的.     

基于方差分析的资本结构决策模型

本文利用统计学原理与风险决策分析方法,提出了资本结构决策新的方差分析方法和矩阵模型.与原有的基于概率分析的方法比较,本文建立的模型方法克服和舍弃了模糊性和难操作性,有效地权衡了风险与收益,使资本结构决策模型更富可操作性和广泛适用性,能够为企业最优资本结构决策提供一定的决策依据.     

一种基于区间数判断矩阵的群决策新方法

针对基于区间数判断矩阵的群决策问题,提出了一种群决策新方法.借助于集值统计原理,构造了与区间数判断矩阵群信息等价的具有一定可靠度的确定数判断矩阵,建立了计算这类群信息集结值可靠度的模型,运用和积法对所得新判断矩阵进行处理,得到了一种简便的方案排序方法.最后,通过一个算例验证了该方法的有效性和实用性.     

一种新的高分辨定位去噪方法

高分辨定位技术在近几年得到人们的广泛注意,在这方面的研究工作相当活跃。本文提出一种新的多目标阵列接收信号协方差矩阵的去噪方法,并对结果进行了计算机模拟。     

Independent attributes control chart for Markov-dependent processes

Statistical process monitoring (SPM) is a very efficient tool to maintain and to improve the quality of a product. In many industrial processes, end product has two or more attribute-type quality characteristics. Some of them are independent, but the observations are Markovian dependent. It is essential to develop a control chart for such situations. In this article, we develop an Independent Attributes Control Chart for Markov Dependent Processes based on error probabilities criterion under the assumption of one-step Markov dependency. Implementation of the chart is similar to that of Shewhart-type chart. Performance of the chart has been studied using probability of detecting shift criterion. A procedure to identify the attribute(s) responsible for out-of-control status of the process is given.     

Confidence interval estimation and hypothesis testing for a common correlation coefficient

Several procedures have been proposed for testing the hypothesis that all off-diagonal elements of the correlation matrix of a multivariate normal distribution are equal. If the hypothesis of equal correlation can be accepted, it is then of interest to estimate and perhaps test hypotheses for the common correlation. In this paper, two versions of five different test statistics are compared via simulation in terms of adequacy of the normal approximation, coverage probabilities of confidence intervals, control of Type I error, and power. The results indicate that two test statistics based on the average of the Fisher z-transforms of the sample correlations should be used in most cases. A statistic based on the sample eigenvalues also gives reasonable results for confidence intervals and lower-tailed tests.     

Generalized information matrix tests for copulas

We propose a family of goodness-of-fit tests for copulas. The tests use generalizations of the information matrix (IM) equality of White and so relate to the copula test proposed by Huang and Prokhorov. The idea is that eigenspectrum-based statements of the IM equality reduce the degrees of freedom of the test’s asymptotic distribution and lead to better size-power properties, even in high dimensions. The gains are especially pronounced for vine copulas, where additional benefits come from simplifications of score functions and the Hessian. We derive the asymptotic distribution of the generalized tests, accounting for the nonparametric estimation of the marginals and apply a parametric bootstrap procedure, valid when asymptotic critical values are inaccurate. In Monte Carlo simulations, we study the behavior of the new tests, compare them with several Cramer–von Mises type tests and confirm the desired properties of the new tests in high dimensions.     

An algorithmic approach to construct D-optimal saturated designs for logistic model

In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.