基于原型逼近法的招标代理机构转化业主需求机理

为了使编制的招标文件真实地反映业主的需求,提高招标文件的编制质量,促进招标代理机构自身业务水平的提升,利用原型逼近的方法,设计出项目需求的转化机理,确定项目初始需求、还原逼近真实需求,并在招标文件的编写中予以体现,达到业主需求的最终转化目的。     

模糊概率决策系统的属性约简

基于模糊等价关系及论域上的概率分布建立模糊概率信息系统,并给出了模糊概率信息系统的熵与条件熵.最后基于模糊概率信息系统的条件熵提出模糊概率决策信息系统的属性约简并给出了算法.     

基于评级模型的违约率估计

违约率是信用风险建模的核心输入变量,文章基于评级模型对违约率进行估计。估计违约数据很少的低违约组合的违约率是一个比较困难的问题,用最大谨慎原则方法解决这类问题时结果偏大,过于保守。文章将最大谨慎原则的思想与极大似然方法相结合,估计了低违约组合的违约率。估计的结果比仅用最大谨慎原则得到的结果很大程度上降低了保守度。     

独立逆抽样下优势比的置信区间

本文对独立逆抽样设计下优势比的置信区间的构造进行了研究,包括三个已有的方法,以及本文引入的鞍点逼近方法。通过模拟比较了这四个方法给出的置信区间。模拟结果表明,基于鞍点逼近方法给出的置信区间不比另外三种方法差。并且在一些情况下表现还优于其它三个方法。     

Bayesian and likelihood-based inference for the bivariate normal correlation coefficient

The paper develops some objective priors for correlation coefficient of the bivariate normal distribution. The criterion used is the asymptotic matching of coverage probabilities of Bayesian credible intervals with the corresponding frequentist coverage probabilities. The paper uses various matching criteria, namely, quantile matching, highest posterior density matching, and matching via inversion of test statistics. Each matching criterion leads to a different prior for the parameter of interest. We evaluate their performance by comparing credible intervals through simulation studies. In addition, inference through several likelihood-based methods have been discussed.     

Symbolic computation for approximating distributions of some families of one and two-sample nonparametric test statistics

A conditional saddlepoint approximation was provided by Gatto and Jammalamadaka (1999) for computing the distribution function of many test statistics based on dependent quantities like multinomial frequencies, spacing frequencies, etc. The considerable complexity of the formulas involved can be bypassed by symbolic computation. This article illustrates the effectiveness of symbolic computation to evaluate the saddlepoint approximation for the likelihood ratio, the exponential score, and the Wald-Wolfowitz test statistics. The case of composite hypotheses is also discussed.     

Statistical Analysis of Marginal Count Failure Data

Manufacturers want to assess the quality andreliability of their products. Specifically, they want to knowthe exact number of failures from the sales transacted duringa particular month. Information available today is sometimesincomplete as many companies analyze their failure data simplycomparing sales for a total month from a particular departmentwith the total number of claims registered for that given month.This information—called marginal count data—is, thus,incomplete as it does not give the exact number of failures ofthe specific products that were sold in a particular month. Inthis paper we discuss nonparametric estimation of the mean numbersof failures for repairable products and the failure probabilitiesfor nonrepairable products. We present a nonhomogeneous Poissonprocess model for repairable products and a multinomial modeland its Poisson approximation for nonrepairable products. A numericalexample is given and a simulation is carried out to evaluatethe proposed methods of estimating failure probabilities undera number of possible situations.     

Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

Motivated by a real world application, we study the multiple knapsack problem with assignment restrictions (MKAR). We are given a set of items, each with a positive real weight, and a set of knapsacks, each with a positive real capacity. In addition, for each item a set of knapsacks that can hold that item is specified. In a feasible assignment of items to knapsacks, each item is assigned to at most one knapsack, assignment restrictions are satisfied, and knapsack capacities are not exceeded. We consider the objectives of maximizing assigned weight and minimizing utilized capacity.We focus on obtaining approximate solutions in polynomial computational time. We show that simple greedy approaches yield 1/3-approximation algorithms for the objective of maximizing assigned weight. We give two different 1/2-approximation algorithms: the first one solves single knapsack problems successively and the second one is based on rounding the LP relaxation solution. For the bicriteria problem of minimizing utilized capacity subject to a minimum requirement on assigned weight, we give an (1/3,2)-approximation algorithm.     

供应商管理库存环境下的分销网络连续近似模型

本文在现有连续近似(CA)模型的基础上,从供应商管理库存(VMI)角度出发,引入了PowerofTwo(POT)周期配送策略,构建了VMI环境下分销网络设计的CA模型。该模型的目标函数不仅包括了分销中心的建设 运营费用、运输费用,而且引进了实际中关注的存储费和订货费;该模型在确定分销网络结构的同时,也确定了各分销中心的库存策略和对其客户的配送策略。文中给出了模型的解法,利用此解法对算例进行求解,并分析了求解的结果,得出各参数变化对解的影响。