Measuring credibility of compensatory preference statements when trade-offs are interval determined

This paper studies how an overall fuzzy preference relation can be constructed in the compensatory context of the simple additive difference model, when imprecision on the trade-offs has to be taken into account. Three credibility indices of preferences are analysed and illustrated by a numerical example. Arguments are presented supporting the use of the third index, for which an interesting transitivity property (which was an open problem) is proved.     

常系数齐次线性微分方程组与其相应的差分方程组之间的联系

给出了求解常系数线性齐次微分方程组和常系数线性齐次差分方程组的一个方法,指出了这两种方程组之间存在的一个有趣关系．     

A Population Approach to Analysis of Variance Models

Several authors have contributed to what can now be considered a rather complete theory for analysis of variance in cases with orthogonal factors. By using this theory on an assumed basic reference population, the orthogonality concept gives a natural definition of independence between factors in the population. By looking upon the treated units in designed experiments as a formal sample from a future population about which we want to make inference, a natural parametrization of expectations and variances connected to such experiments arises. This approach seems to throw light upon several controversial questions in the theory of mixed models. Also, it gives a framework for discussing the choice of conditioning in models     

Finite mixture models with concomitant information: assessing diagnostic criteria for diabetes

The World Health Organization (WHO) diagnostic criteria for diabetes mellitus were determined in part by evidence that in some populations the plasma glucose level 2 h after an oral glucose load is a mixture of two distinct distributions. We present a finite mixture model that allows the two component densities to be generalized linear models and the mixture probability to be a logistic regression model. The model allows us to estimate the prevalence of diabetes and sensitivity and specificity of the diagnostic criteria as a function of covariates and to estimate them in the absence of an external standard. Sensitivity is the probability that a test indicates disease conditionally on disease being present. Specificity is the probability that a test indicates no disease conditionally on no disease being present. We obtained maximum likelihood estimates via the EM algorithm and derived the standard errors from the information matrix and by the bootstrap. In the application to data from the diabetes in Egypt project a two-component mixture model fits well and the two components are interpreted as normal and diabetes. The means and variances are similar to results found in other populations. The minimum misclassification cutpoints decrease with age, are lower in urban areas and are higher in rural areas than the 200 mg dl^-1 cutpoint recommended by the WHO. These differences are modest and our results generally support the WHO criterion. Our methods allow the direct inclusion of concomitant data whereas past analyses were based on partitioning the data.     

Estimation for Continuous Branching Processes

The maximum-likelihood estimator for the curved exponential family given by continuous branching processes with immigration is investigated. These processes originated from population biology but also model the dynamics of interest rates and development of the state of technology in economics. It is proved that in contrast to branching processes with discrete space and/or time the MLE gives a unified approach to the inference. In order to include singular subdomains of the parameter space we modify the MLE slightly. Consistency and asymptotic normality for the MLE are considered. Concerning the asymptotic theory of the experiments, all three properties LAQ, LAN, and LAMN occur for different submodels     

On the shrinkage of local linear curve estimators

Local linear curve estimators are typically constructed using a compactly supported kernel, which minimizes edge effects and (in the case of the Epanechnikov kernel) optimizes asymptotic performance in a mean square sense. The use of compactly supported kernels can produce numerical problems, however. A common remedy is ridging, which may be viewed as shrinkage of the local linear estimator towards the origin. In this paper we propose a general form of shrinkage, and suggest that, in practice, shrinkage be towards a proper curve estimator. For the latter we propose a local linear estimator based on an infinitely supported kernel. This approach is resistant against selection of too large a shrinkage parameter, which can impair performance when shrinkage is towards the origin. It also removes problems of numerical instability resulting from using a compactly supported kernel, and enjoys very good mean squared error properties.     

The web proxy location problem in general tree of rings networks

The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn ²) time complexity.This research has been supported by NSF of China (No. 10371028) and the Educational Department grant of Zhejiang Province (No. 20030622).     

Flow shop scheduling with deteriorating jobs under dominating machines

This paper addresses no-wait or no-idle flow shop scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting time. A simple linear deterioration function is assumed and some dominating relationships between machines can be satisfied. It is shown that for the problems to minimize makespan or weighted sum of completion time, polynomial algorithms still exist, although these problems are more complicated than the classical ones. When the objective is to minimize maximum lateness or maximum tardiness, the solutions of a classical version may not hold.     

异质产品供应链定价控制权与零售商横向兼并效应分析

针对一部线性合约与供应商是否具有绝对定价控制权,比较分析零售商横向兼并集中度提高对消费者福利的影响.结果表明,(1)当供应商具有绝对定价控制权时,零售商横向兼并对消费者产生的影响取决于产品替代性程度大小:若替代性程度较高,则将产生有利影响,反之,将产生不利影响;(2)当供应商没有绝对定价控制权时,零售商横向兼并对消费者产生的影响取决于零售商兼并前的相对定价控制权强弱与兼并后的相对定价控制权增幅大小:若零售商在供应链中处于相对弱势地位,且零售商横向兼并使零售商的定价控制权增幅较大,则兼并将对消费者产生有利影响,否则,将对消费者产生不利影响.     

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.