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     

信息熵与物元理论在某新型火炮技术阵地优选中的应用

针对某新型火炮武器系统的作战特点,运用数学理论探索其技术阵地的优选问题。提出并利用信息熵和物元理论相结合的优选方法,依据该型火炮技术阵地选择的主要因素,建立了该型火炮技术阵地优选的数学模型。并运用该模型,结合具体实例,对该型火炮的预选技术阵地进行了优选。与传统方法相比,该方法不仅计算简便、收敛快,而且考虑技术阵地选择的不确定因素充分,为辅助指挥员实现科学决策提供了参考。     

基于节点选择更新的简化LDPC译码算法

文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。     

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     

基于运载能力评估的固体运载火箭推力向量控制方案比较

从对运载能力影响角度开展固体运载火箭发动机推力向量控制系统比较分析研究。设计了三种采用不同发动机推力向量控制系统的多级固体运载火箭方案,将增广乘子法与共轭方向法相结合,对固体运载火箭上升段弹道进行了优化设计,给出运载能力评估结果。研究表明,起飞质量均为50 000kg,目标轨道均为300km太阳同步轨道时,采用栅格舵和侧喷流作为推力向量控制系统方案,比采用燃气舵和侧喷流作为推力向量控制系统方案,运载能力提高70kg,比各级固体发动机全部采用摆动喷管控制方案,运载能力提高115kg,为固体运载火箭总体方案论证提供理论依据。     

一种新型的P2P Tracker实现方法

流媒体数据已经在互联网流量中占据极高的比例,P2P是目前支撑互联网流媒体数据分发的重要手段。本文提出一种新型的P2P Tracker实现方法——eTracker。该方法通过网络边缘的eTracker分布实现peer列表的保存,不但消除传统集中式Tracker的性能瓶颈,而且通过eTracker对本地peer的识别,优化了P2P系统的peer选择。     

一种基于低扩散通量分裂方法的WENO格式研究

将低扩散通量分裂格式(LDFSS)和加权基本无振荡格式(WENO)相结合,构造出一种混合格式,其中WENO格式用于物理量重构,而LDFSS用于通量分裂。采用这种格式对Riemann问题、钝头体高超声速无粘绕流流场进行了计算,并对超声速平板湍流边界层进行了混合LES/RANS模拟,计算结果表明:相对于采用Lax-Fridrichs分裂的WENO格式来说,这种混合格式对于激波和接触间断的分辨率更高,并且在标量保正性方面更优,收敛性更好;而相对于采用带有Minmod限制器的MUSCL方法进行物理量高阶重构的LDFSS格式来说,这种混合格式在混合模拟的计算中能够更好地反映湍流流场的脉动特性,计算得到的湍流速度脉动量的统计值更加准确。     

基于DS/AHP的导弹发射阵地选择方法

战术导弹发射阵地选择是导弹作战兵力运筹的重要组成部分,其本质是一多准则多属性决策问题。传统的层次分析法无法明确描述这类问题中所蕴涵的不确定性,通过DS证据理论的引入,研究了战术导弹发射阵地选择的DS/AHP方法,应用实例说明了该方法的可行性和有效性。     

二维弹道修正弹及其制导控制技术综述

针对二维弹道修正弹这类具有广泛应用前景的智能弹药,综述了二维弹道修正弹的发展、主要修正机构方案及其制导控制技术.对二维弹道修正弹的研制历程进行总结,梳理发展脉络揭示其发展规律,分析二维修正弹的打击任务.对几种主流修正方案进行讨论,分析各机构的作用特点及研究难点.基于二维弹道修正弹打击任务需求,从气动辨识及状态估计算法、...     

Fully sequential indifference‐zone selection procedures with variance‐dependent sampling

Fully sequential indifference‐zone selection procedures have been proposed in the simulation literature to select the system with the best mean performance from a group of simulated systems. However, the existing sequential indifference‐zone procedures allocate an equal number of samples to the two systems in comparison even if their variances are drastically different. In this paper we propose new fully sequential indifference‐zone procedures that allocate samples according to the variances. We show that the procedures work better than several existing sequential indifference‐zone procedures when variances of the systems are different. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006