液相色谱-质谱法测定2-氯乙烯胂酸

研究了用液相色谱-质谱两种电离技术测定路易氏剂1的降解产物2-氯乙烯胂酸,比较了在不同流动相中该化合物的响应情况,并且利用源内CID技术获得了丰富质谱碎片,对所鉴定的碎片进行了解释,用选择离子检测得到该化合物的检测限在APCI电离技术中为9ng,在ESI电离技术中为4ng．     

Short‐term capacity allocation problem with tool and setup constraints

We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

新疆高等教育资源配置的现状及问题研究

高等教育资源的合理配置是提高高校办学质量和效益的前提和关键。本文通过梳理新疆高等教育资源配置现状及存在的具体问题,进一步提出优化高等教育资源配置的对策建议,以期充分发挥高等教育在新疆社会发展中的巨大作用。     

面向装备作战仿真的弹药调拨供应决策建模方法研究

针对用线性规划方法在解决弹药调拨供应决策过程中存在的弹药调拨供应量的分配与弹药保障原则关联不紧密的问题,采用目标规划理论与方法,引入优先级区分主要作战方向和次要作战方向弹药库的重要程度,在同一优先级上以权重区分一梯队、二梯队及预备队弹药库的弹药保障优先顺序,使得模型的构建过程与弹药保障原则紧密相联。同时,在模型构建过程中,综合考虑了弹药消耗预测量、弹药储备标准和弹药运输时限等因素对弹药调拨供应决策的影响,并从本级弹药储备不足和充足两种情况进行了数值模型及分析,验证了模型的正确性与可靠性,为弹药调拨供应提供了决策支持与理论支撑。     

战时装备调配保障决策模型构建研究

分析了战时装备调配保障决策的特点,运用模糊聚类分析法对装备调配保障对象进行了分组和优先级排序,以此为基础,运用目标规划法构建了战时装备调配保障决策模型,最后,通过实例验证了模型的可行性和有效性．     

基于非对称balls-into-bins的高效平衡负载分配模型

在大规模数据中心和P2P覆盖网络等复杂网络负载平衡分配中,前人提出了多种多样的负载分配方法,但许多方法为了达到更好的平衡负载指标,追求越来越复杂的算法,使得时间复杂度和算法复杂度很难控制在合理的范围之内。本文在研究了经典balls-into-bins、Azar balls-into-bins和balls into non-uniformbins等模型的基础上,提出了一种新颖高效的非对称balls-into-bins平衡负载分配模型,该模型具有异构的balls、异构的bins,以及不同的bin选择概率,能以很高的概率将最大负载均衡地控制在合理的范围内,通信负载很小,且具有很好的可扩展性,通过拓展,该模型在负载平衡的诸多领域都将有广阔的应用空间。     

基于巡逻历史与道路优先级的武警巡逻策略

针对武警巡逻车辆配置问题,引入了Dijkstra最短路径算法、K—means聚类算法以及计算几何的相关理论,建立了一套警车巡逻模型,并提出了评价巡逻效果的量化评价标准。采用Dijkstra与K—means算法解决了静态警车配置问题;针对警车动态巡逻方案的设计,提出了基于巡逻历史与道路优先级的道路概率选择算法,并给出了不同情况下的警车配置以及巡逻方案。通过MATLAB仿真实验,证明了算法及模型的先进性和实用性。     

C4ISR系统体系结构设计集成环境

C4ISR系统体系结构设计是系统综合集成的基础.针对C4ISR体系结构框架2.0,分析了体系结构产品的特点,研究了体系结构产品设计工具的分类以及应该具有的功能,提出体系结构产品设计工具的集成框架和基于体系结构核心数据库的数据管理机制,并实现了体系结构产品设计工具以及体系结构设计集成环境.     

An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems

We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011