语义Web服务匹配方法分析

语义Web服务是实现数据和应用集成的一种有效机制。随着Web服务规模的快速增长,自动、准确地获取Web服务成为目前研究的热点问题。服务发现的关键问题是如何提高匹配算法的准确性和高效性。首先归纳了语义Web服务匹配的相关概念,然后总结了语义Web服务匹配算法的研究内容和目标,分析比较了语义Web服务匹配中基于相似度匹配、逻辑匹配和混合匹配三类主流算法的设计侧重点及性能,最后总结了全文并给出了下一步研究方向。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

防空导弹武器系统射击次数的建模方法*

为评估防空导弹武器系统射击效能,在一定假设条件下,通过对防空导弹武器系统射击过程的分析,对单目标通道建立了射击次数模型.该模型考虑了目标的航路捷径和飞行高度.单目标通道射击次数模型经适当变换可求出第一个目标通道的射击次数,并根据一个射击循环中可用目标通道数受遭遇时间的限制,分三种情况对多目标通道防空导弹武器系统建立了射击次数模型.最后举例进行了仿真计算,得到了不同T值下的射击次数和遭遇点.计算结果符合实际,表明该模型具有较好的适用性.     

国防科技工业质量与可靠性信息共享机制研究与思考

信息共享机制的缺失已经成为质量与可靠性信息工作的瓶颈，严重制约了信息的分析与利用深度。根据质量与可靠性信息工作的新需求，应用现代质量管理理论及系统工程方法，阐述了国防科技工业质量与可靠性信息共享的内涵、目的、总体框架、实施框架与建设措施，为开展质量与可靠性信息共享研究与实践提供方法指导。     

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030     

C4ISR系统中军用卫星系统若干关键技术

卫星系统在C4ISR系统这样一个综合性大系统中的应用无庸置疑,首先介绍了C4ISR系统中卫星系统的分类,然后分析了军用卫星通信系统在战场信息传输中的若干关键技术,包括卫星定位技术、与地面网络互联技术、抗干扰技术和卫星终端技术等,最后指出了卫星通信系统发展的方向.     

空地制导武器发展的核心理念

文章研究为了在未来空地作战中占据优势,空地制导武器正朝着远程化、精准化、小型化、高能化和网络化的方向发展。远程化可以确保战机实施有效的"防区外攻击";精准化可以确保"首发命中",提高战机生存能力;小型化可以提高战机的载弹量,同时减少爆炸后的附带损伤,降低负面效应;高能化可以确保"小炸弹具有大威力";网络化则使弹药在发射后其制导信息仍然能够随着目标的变化而及时得到更新,确保命中目标。     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Mean residual life of coherent systems consisting of multiple types of dependent components

Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied.