Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

把培育当代军人核心价值观作为一项战略性基础工程抓紧抓实

把培育当代革命军人核心价值观作为一项战略性基础工程来抓,就必须把加强党的创新理论武装作为主线;把深入持久开展四项教育作为主渠道;把军事斗争准备实践作为主课堂。     

Search and the introduction of improved technologies

Modeling R&D as standard sequential search, we consider a monopolist who can implement a sequence of technological discoveries during the technology search process: he earns revenue on his installed technology while he engages in R&D to find improved technology. What is not standard is that he has a finite number of opportunities to introduce improved technology. We show that his optimal policy is characterized by thresholds ξ_i(x): introduce the newly found technology if and only if it exceeds ξ_i(x) when x is the state of the currently installed technology and i is the number of remaining introductions allowed. We also analyze a nonstationary learning‐by‐doing model in which the monopolist's experience in implementing new technologies imparts increased capability in generating new technologies. Because this nonstationary model is not in the class of monotone stopping problems, a number of surprising results hold and several seemingly obvious properties of the stationary model no longer hold. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

The equivalence of general set-covering and implicit integer programming formulations for shift scheduling

In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (P1) [11, 13]. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate. © 1996 John Wiley & Sons, Inc.     

磁悬浮列车悬浮电磁铁设计研究

本文简要地介绍了日本HSST-03磁悬浮列车的悬浮电磁铁结构形式,并应用电磁场的基本理论和分析方法,对该悬浮系统电磁铁设计的主要公式进行了详细的推导;对设计中的气隙磁密、磁铁长度、气隙大小等主要参数的选择进行了分析;进而归纳出了该悬浮系统电磁铁设计的方法和步骤。此外,本文还给出了应用该设计步骤和方法设计完成的750kg悬浮电磁铁的理论计算与实验测试曲线。     

线性调频基带数字产生的关键技术研究

介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较，然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案，分析了基带数字产生的主要关键技术，并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。     

导弹落点散布的序贯概率比(SPR)检验的随机模拟

本文简述了对导弹落点散布的SPR检验的随机模拟的步骤和计算公式。对于落点的标准偏差进行了序贯截尾和不截尾的随机模拟,并对所得结朱进行了初步的分析。分析表明:通过随机模拟得到的OC 函数L~*(σ)优于由近似公式计算的L(σ),而E_σ~*(n)比E_σ(n)要大,所以在选择参数α、β和λ时利用L~*(σ)和E_σ~*(n),同时参考L(σ)和E_σ(n)比较好。本文对截尾方案进行了讨论,对某些问题提出了一些看法。