网格环境下基于任务的虚拟物流资源匹配策略

网格环境下的虚拟物流资源调度问题,实质就是资源与任务如何匹配的问题。以首先满足任务需求为前提,综合考虑任务以及资源两方面的匹配要求,建立了资源任务一对一匹配模型,通过量化任务（资源）各条件因素基准值及其所占权重比率,结合循环匹配算法,提出了一种基于任务的资源任务匹配策略,有效避免多任务对资源的争抢,实现了资源任务匹配的准确性和有效性。     

谈部队基层干部队伍建设

部队建设的关键在基层,基层建设的关键在中队干部,他们素质的高低直接影响到基层建设的好坏。根据当前消防中队干部队伍的现状,加强基层干部队伍建设的着力点应在于：夯实中队干部思想基础,提高中队干部履职能力,完善中队干部管理措施。     

雷达利用极化信息区分真假目标浅析

首先介绍了电大目标回波信号极化特征和电子假目标信号极化特征,接着探讨了理论上雷达根据极化信息区分电子假目标信号和真实目标回波信号的方法,分析了实际应用中可能存在的困难,说明了这种方法在目前和今后雷达目标识别技术发展中是有实际意义的。最后说明了无论是现在,还是今后,极化信息对于雷达目标识别来说都是一个极其重要的参数。     

无线认知网络中一种分布式最大频谱分配算法

无线认知网络被认为是下一代无线网络的核心架构之一。该网络能解决日益增长的频谱使用需求和低下的频谱使用率之间的矛盾。通过伺机接入临时可用频谱资源,其频谱利用率能得到大幅的提高。由于频谱资源分配是影响频谱资源利用率的关键,因此如何对频谱资源进行高效的分配一直是无线认知网络的重要研究领域之一。我们证明了在异构频谱使用概率条件下的最优频谱分配是NP难的问题。为了有效解决该问题,本文提出了一种基于分布式最大加权独立集的频谱分配算法——DMWIS。该算法的时间复杂度为O(V2/2)。通过大量的仿真实验,验证了在90%以上的不同随机网络环境下算法能在3轮内收敛,并且该算法一般能获得最优解90%的性能。     

饱和系统的线性最优容错不变集

针对饱和系统的容错控制问题,提出了一种D稳定约束下系统吸引域的估计方法。分别以不变集和参考集的容量为优化目标,给出了两个优化容错不变集的充分条件。为解决不变集优化中出现的双线性矩阵不等式(BMI)问题,通过构造包含线性矩阵不等式(LMI)的目标函数,将它转化为非线性规划的形式进行求解。通过一个仿真实例对该方法进行验证。     

面向普适计算应用的构件定义语言UCDL

普适计算的适应性特征对于软件重用的要求决定了构件模型是目前普适计算软件体系结构的理想选择.在面向普适计算的自适应软件平台UbiStar的研究过程中,为了准确地对普适应用中构件的外部特征进行抽象描述,参考了CORBA构件模型使用IDL3和CIDL对构件进行特征抽象的方法,结合UbiStar普适计算平台的特点与需求,提出了一种适用于普适计算环境的构件定义语言UCDL,并且给出了一个应用示例.     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008