超音速微粒沉积Ti-45Al-7Nb-4Cr涂层的摩擦学性能

针对铝合金表面硬度低和易磨损的问题,采用超音速微粒沉积技术在5083铝合金表面制备了Ti-45Al-7Nb-4Cr合金涂层。利用扫描电子显微镜(SEM)和X射线衍射仪(XRD)对涂层微观形貌和物相组成进行了观察和分析,并对比测试了5083铝合金、Ti-45Al-7Nb-4Cr合金铸锭和涂层的显微硬度和摩擦学性能。结果表明:Ti-45Al-7Nb-4Cr合金涂层内部颗粒间存在冶金结合和机械嵌合2种结合方式,涂层与5083铝合金基体的结合方式为机械嵌合;涂层主要相组成为γ-Ti Al、α2-Ti3Al和β-Ti相;通过在5083铝合金表面制备Ti-45Al-7Nb-4Cr合金涂层,显微硬度提高4倍以上,磨损体积减少69%以上;涂层的磨损机理为磨料磨损和氧化磨损,具有较好的耐磨性能。     

一种改进的证据理论合成规则

随着证据理论在信息融合领域中的广泛应用,对冲突证据的处理成为证据理论和应用研究热点。提出了一种基于证据重要度和聚焦度的新的合成规则,首先根据各个证据的重要度对冲突证据进行修正,再对冲突进行细化并考虑证据焦元的基数对D-S合成法则的影响,将冲突信息提取后加入组合规则中。通过实验比较和分析,结果说明该方法不仅能够处理一般性冲突问题,也能处理"一票否决"和"鲁棒性"问题。     

浅析如何抓好“合训”学员入学（伍）擒敌术基础训练

新学员入校的“合训”质量,将直接影响以后四年的学习、训练效果。从重视擒敌术专业、结合学员实际、讲究训练方法等方面入手,对抓好入学擒敌术训练具有事半功倍的作用。     

A note on the forecast performance of temporal aggregation

Earlier research on the effects of nonoverlapping temporal aggregation on demand forecasting showed the benefits associated with such an approach under a stationary AR(1) or MA(1) processes for decision making conducted at the disaggregate level. The first objective of this note is to extend those important results by considering a more general underlying demand process. The second objective is to assess the conditions under which aggregation may be a preferable approach for improving decision making at the aggregate level as well. We confirm the validity of previous results under more general conditions, and we show the increased benefit resulting from forecasting by temporal aggregation at lower frequency time units. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 489–500, 2014     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Timing of information acquisition in a competitive environment

This article investigates the impact of timing on sellers' information acquisition strategies in a duopoly setting. Market uncertainty is captured by a representative consumer who has a private taste for the product's horizontal attribute, and both sellers can acquire this information either before (ex‐ante acquisition) or after (ex‐post acquisition) observing their own product qualities. We identify several conflicting effects of information acquisition that vary significantly in its timing and market characteristics. In the monopoly scenario, information acquisition is unambiguously beneficial and ex‐ante acquisition is the dominant option, because it helps a seller not only design the proper product but also craft better pricing strategy. By contrast, when there is competition, information acquisition eliminates the buffer role of market uncertainty and leads to the fiercest production or pricing competition, which makes the subsequent effects of acquisition detrimental, and a seller's payoff is nonmonotonic in terms of its acquisition cost. Moreover, compared with the ex‐ante information acquisition, ex‐post information acquisition normally generates higher sellers' equilibrium payoffs by postponing the timing of acquisition and maintaining product differentiation. Nonetheless, ex‐post information acquisition also provides the seller with greater acquisition incentive and occasionally makes him worse off than that in the ex‐ante scenario. Thus, in a competitive environment, having the option of information acquisition and flexibility in its timing can be both detrimental and irresistible. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 3–22, 2016     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

Nonlinear pricing with consumer satiation

In various scenarios, consumers may become satiated with products, and the degree of satiation is directly associated with their prior experiences. Confronted with consumer satiation, the seller is unable to either identify consumers who have a higher likelihood of being satiated ex ante or distinguish satiated from non‐satiated consumers ex post. Therefore, the seller should address dynamic selling, valuation uncertainty, and quantity decisions, all of which are important operational issues. We consider a two‐period problem in which consumer types are influenced by their prior consumption experiences. Faced with these consumers, the seller intends to optimize quantities and adjust the prices of the products in each period to maximize revenue. We find that the seller may reduce ex ante production quantity as some consumers become satiated. Moreover, the ex ante quantity is first decreasing and then increasing with regard to the satiation rate. Furthermore, two‐period information asymmetries may provide a rationale for upward distortion in quantity when consumer preferences are highly sensitive to first‐period consumption. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 386–400, 2016     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016