反辐射无人机在电子战中的应用及其效能分析

简要讨论了反辐射无人机系统的组成和两种典型的反辐射无人机,指出了其在电子战中的应用。并针对某型反辐射无人机的系统能力,即命中概率和毁伤概率进行了理论分析和计算。     

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

新型钢-混凝土组合板的力学性能研究

以加劲肋形式、组合板厚度和栓钉布置为参数,进行了9块新型组合板的力学性能试验.试验结果表明,组合板的正截面承载力可按基于修正平截面假定的极限状态计算;组合板的跨中挠度,可在按现行规范计算的基础上,加上考虑界面滑移影响的附加变形值予以修正.     

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     

An EOQ model with multiple suppliers and random capacity

We consider an EOQ model with multiple suppliers that have random capacities, which leads to uncertain yield in orders. A given order is fully received from a supplier if the order quantity is less than the supplier's capacity; otherwise, the quantity received is equal to the available capacity. The optimal order quantities for the suppliers can be obtained as the unique solution of an implicit set of equations in which the expected unsatisfied order is the same for each supplier. Further characterizations and properties are obtained for the uniform and exponential capacity cases with discussions on the issues related to diversification among suppliers. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Barrier Lyapunov functions-based dynamic surface control with tracking error constraints for ammunition manipulator electro-hydraulic system

This paper focuses on the dynamic tracking control of ammunition manipulator system. A standard state space model for the ammunition manipulator electro-hydraulic system (AMEHS) with inherent non-linearities and uncertainties considered was established. To simultaneously suppress the violation of tracking error constraints and the complexity of differential explosion, a barrier Lyapunov functions-based dynamic surface control (BLF-DSC) method was proposed for the position tracking control of the ammunition manipulator. Theoretical analysis prove the stability of the closed-loop overall system and the tracking error converges to a prescribed neighborhood asymptotically. The effectiveness and dynamic tracking performance of the proposed control strategy is validated via simulation and experi-mental results.     

大规模 MIMO系统中用户分层变长时隙分配方法研究

大规模MIMO系统时分双工模式中分配的物理时隙长度是固定的,不能根据不同时长的信道相干时间灵活地调整长度,二者长度的不匹配导致部分时频资源的浪费,因此系统的总体容量不能达到最优。针对此问题本文提出一种用户分层变长时隙分配方法,即根据不同终端的移动性对终端进行分层,并为不同层中的移动终端灵活地分配不同时长的物理时隙,使物理时隙长度与移动终端所对应信道的相干时长相匹配,从而减少时频资源的浪费,提高了资源利用率。同时,避免了低速移动终端过频繁的信道估计,降低了信道训练序列开销,使系统的总体数据容量得到很大的提升。实验仿真结果验证了本文所提方法的有效性。     

Optimally scheduling interfering and non‐interfering cranes

This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

A note on optimal pricing for finite capacity queueing systems with multiple customer classes

This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008