A O(nm log(U/n)) time maximum flow algorithm

In this paper, we present an O(nm log(U/n)) time maximum flow algorithm. If U = O(n) then this algorithm runs in O(nm) time for all values of m and n. This gives the best available running time to solve maximum flow problems satisfying U = O(n). Furthermore, for unit capacity networks the algorithm runs in O(n^2/3m) time. It is a two‐phase capacity scaling algorithm that is easy to implement and does not use complex data structures. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 511–520, 2000     

毽球运动在新疆中小学推广的可行性分析

本文通过介绍毽球的特点,从新疆中小学体育教育现状出发,探讨毽球这项民族传统体育项目在新疆中小学体育教学中推广的必要性和可行性,为丰富当前中小学体育教学课程资源提供一些方法、手段和思路,并对民族传统体育项目的传承有积极意义。     

中世纪外国军事思想初探

军事思想是人们对战争、军队和国防的基本问题的理性认识。研究和总结人类各个时期军事思想的历史发展和特点,是对军事领域问题探讨的过程之一,是人类在军事领域自我认知的手段和途径,是超越自我、实现突破的必经之路。中世纪世界军事思想在特定的历史条件下.经历了一个缓慢的历史演变过程,其战争观、军队建设和战略战术思想有了较大的发展,呈现出缓慢性、演进性和多元性的特征。     

试论我军跨越式发展30年思想政治建设的历史经验

改革开放以来,在我军跨越式发展的历史进程中,思想政治建设发挥了巨大的作用,积累了丰富的经验,主要包括：坚持党对军队的绝对领导是推进军队跨越式发展的根本保证;坚持把思想政治建设放在一切工作的首位,是推进军队跨越式发展的必要前提;坚持思想政治建设的战斗力标准,是推进军队跨越式发展的基本途径,开创了我军思想政治建设的新境界。     

自然背景中伪装网的散射偏振度与成像研究

偏振遥感以目标散射光或辐射光的偏振特性作为识别信息,具有常规强度遥感所不具备的优点.为了研究伪装网的偏振伪装效果,在不同条件下对伪装网的散射偏振度和成像特征进行了测试.结果表明,伪装网的表面偏振散射特征受光照条件、探测条件和材料本身特性的影响,其散射光的偏振度与入射角度成正比,与表面反射率成反比.相对于草地背景,伪装网的偏振度较大,可以在偏振度图像中被清晰地识别出来,能够有效对抗多光谱遥感等传统侦察手段的伪装网在偏振遥感侦察下失去了伪装效果.偏振遥感对伪装技术提出了新的挑战.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

日照条件下伪装网热红外迷彩研究

采用热像仪记录伪装网样品不同时段的热图,分析了日照对伪装网热迷彩的影响.伪装网的热迷彩效果受装饰布太阳能吸收率影响非常大,甚至可以抵消或超过发射率差值因素.实验采用的伪装网深绿装饰布太阳能吸收率较高,热红外发射率比土黄装饰布低0.11以内时,在日照下深绿斑块辐射温度与土黄斑块接近或超过土黄斑块;深绿装饰布热红外发射率比土黄低0.27时,可保证在夏季的强日照下深绿斑块辐射温度低于土黄斑块,且有较大差值.     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003