杂合数据的粗糙集属性约简方法

针对决策表中属性取值为杂合数据的情况,提出了基于粗糙集理论的属性约简算法.首先给出了对象间在杂合数据下的相似度计算定义.为了获取合理的对象集合的软划分,给出了阈值计算的最优化模型,并基于粗糙集的上、下近似的概念,得到对象集合在条件属性下的上、下近似的覆盖划分.之后,通过各对象基于条件属性和决策属性的上、下近似下的分布矩阵描述,利用最大分布矩阵,直观地得到两种不同观点下的约简结果.实验结果表明了本算法的合理和有效性.     

合成坦克分队最佳火力分配模型

实际战斗中敌我双方均以多兵种进行交战,在兰切斯特方程基础上,利用不同作战单位的相对作战指数,以及各种作战单位之间的交战强度、掩护强度和循环交战强度,建立合成坦克分队最佳火力分配算法,并应用该算法定量计算二对二作战中坦克分队火力最佳分配的方案,为定量研究合成坦克分队火力运用打下了基础。     

Fitting Lanchester equations to the battles of Kursk and Ardennes

Lanchester equations and their extensions are widely used to calculate attrition in models of warfare. This paper examines how Lanchester models fit detailed daily data on the battles of Kursk and Ardennes. The data on Kursk, often called the greatest tank battle in history, was only recently made available. A new approach is used to find the optimal parameter values and gain an understanding of how well various parameter combinations explain the battles. It turns out that a variety of Lanchester models fit the data about as well. This explains why previous studies on Ardennes, using different minimization techniques and data formulations, have found disparate optimal fits. We also find that none of the basic Lanchester laws (i.e., square, linear, and logarithmic) fit the data particularly well or consistently perform better than the others. This means that it does not matter which of these laws you use, for with the right coefficients you will get about the same result. Furthermore, no constant attrition coefficient Lanchester law fits very well. The failure to find a good‐fitting Lanchester model suggests that it may be beneficial to look for new ways to model highly aggregated attrition. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

The gradual covering problem

In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于正交试验设计的内燃机缸套和活塞环磨合过程数学模型的建立

在对内燃机缸套和活塞环磨合过程进行试验研究的基础上,提出了基于正交试验设计的内燃机缸套-活塞环磨合过程磨损量和磨合时间的数学模型,并对试验结果进行了多元正交多项式回归分析,进而利用磨合过程的数学模型分析了各影响因素对磨合过程的影响.磨合模型的建立对确定合理的磨合时间和磨合规范,提供了理论和方法的依据.     

Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue

If the number of customers in a queueing system as a function of time has a proper limiting steady‐state distribution, then that steady‐state distribution can be estimated from system data by fitting a general stationary birth‐and‐death (BD) process model to the data and solving for its steady‐state distribution using the familiar local‐balance steady‐state equation for BD processes, even if the actual process is not a BD process. We show that this indirect way to estimate the steady‐state distribution can be effective for periodic queues, because the fitted birth and death rates often have special structure allowing them to be estimated efficiently by fitting parametric functions with only a few parameters, for example, 2. We focus on the multiserver M_t/GI/s queue with a nonhomogeneous Poisson arrival process having a periodic time‐varying rate function. We establish properties of its steady‐state distribution and fitted BD rates. We also show that the fitted BD rates can be a useful diagnostic tool to see if an M_t/GI/s model is appropriate for a complex queueing system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 664–685, 2015     

FORECASTING SERIES CONTAINING OFFSETTING BREAKS: OLD SCHOOL AND NEW SCHOOL METHODS OF FORECASTING TRANSNATIONAL TERRORISM

Transnational terrorism data are difficult to forecast because they contain an unknown number of structural breaks of unknown functional form. The rise of religious fundamentalism, the demise of the Soviet Union, and the rise of al Qaeda have changed the nature of transnational terrorism. ‘Old School’ forecasting methods simply smooth or difference the data. ‘New School’ methods use estimated break dates to control for regime shifts when forecasting. We compare the various forecasting methods using a Monte Carlo study with data containing different types of breaks. The study's results are used to forecast various types of transnational terrorist incidents.     

The impact of defense and non‐defense public spending on growth in Asia and Latin America∗

For a three‐sector Feder‐Ram framework, we present time‐series, cross‐sectional estimates for two cohorts, consisting of Asian and Latin American countries. The estimates indicate that private investment, and defense and non‐defense public spending are growth promoting for alternative error components representations. For the best error components representation, greater growth enhancement is associated with the two forms of public spending in Asia than in Latin America, while the opposite comparison characterizes private investment. Although defense is growth promoting, an opportunity cost exists insofar as non‐defense spending, financed by defense spending, appears to give a small net boost to growth in Latin America.     

Joint pricing,assortment, and inventory decisions for a retailer's product line

Consider a set of product variants that are differentiated by some secondary attributes such as flavor, color, or size. The retailer's problem is to jointly determine the set of variants to include in her product line (“assortment”), together with their prices and inventory levels, so as to maximize her expected profit. We model the consumer choice process using a multinomial logit choice model and consider a newsvendor type inventory setting. We derive the structure of the optimal assortment for some important special cases, including the case of horizontally differentiated items, and propose a dominance relationship for the general case that simplifies the search for an optimal assortment. We also discuss structural properties of the optimal prices. Finally, motivated by our analytical results, we propose a heuristic solution procedure, which is shown to be quite effective through a numerical study. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007