排序方式:
出版年(降序)
出版年(升序)
被引次数(降序)
被引次数(升序)
更新时间(降序)
更新时间(升序)
杂志中文名(升序)
杂志中文名(降序)
杂志英文名(升序)
杂志英文名(降序)
作者中文名(升序)
作者中文名(降序)
作者英文名(升序)
作者英文名(降序)
相关性
共有327条查询结果,搜索用时 234 毫秒
1.
Exporting Democracy: Fulfilling America's Destiny. By Joshua Muravchik, American Enterprise Institute (1991) ISSN 0–8447–3734–8. $12.95.
Generals in the Palacio. By Roderick Ai Camp. Oxford University Press, (1992), ISBN 0–19–507300–2, £45.
L'Armement en France. Genèse, Ampleur et Coût d'une Industrie By François Chesnais and Claude Serfati, Editions Nathan, Collection Economie/Sciences Sociales, Paris (1992), ISBN 2–09–190086–9.
The Têt Offensive. Intelligence Failure in War. By James Wirtz, Cornell University Press, New York (1991), ISBN 0–8014–2486–0. $38.50.
Restructuring of arms producton in Western Europe. Edited by Michael Brzoska and Peter Lock. Oxford University Press, Oxford (1992), ISBN 0–1982–9147–7. £25.00.
What is Proper Soldiering? A study of new perspectives for the future uses of the Armed Forces of the 1990s. By Michael Harbottle. The Centre for International Peacebuilding, Chipping Norton (1992), £3.50.
The Strategic Defence Initiative By Edward Reiss, Cambridge University Press, Cambridge (1992), ISBN 0–521–41097–5. £30.00. 相似文献
2.
从几个不同的技术角度,消除火控系统存在的误差,从而大大提高武器控制系统的射击精度,使命中效率明显增加。
相似文献
3.
异形燃气涡轮轴承的外环滚道截面形状为波瓣形,精度要求很高。本文采用的微位移进给驱动机构具有高频响、高精度、大行程,且控制简便的特点。在研究陶瓷结合剂CBN砂轮修整及磨削工艺的基础上,采用前馈与速度反馈的控制方法,对工件进行了加工,得到了较好的加工表面质量和滚道轮廓曲线
相似文献
4.
研究了双机组浮筏装置减振效果的估算问题,并给出了相应的计算公式。理论分析和实验结果表明,该公式能对实际的双机组浮筏装置减振效果给出较好的估算。
相似文献
5.
提出了潜艇多媒体侦察系统的工作原理和设计方案,建立了一个基于QDD—10对空导航潜望镜、CCD彩色摄像机和多媒体计算机之上的侦察系统,分析了海上目标图象的退化,并提出了一套相应的图象处理算法。
相似文献
6.
从一般封闭空间、混响声场的有源控制及控制器结构与算法三个方面对有源噪声控制进行了评述,并对今后的研究趋势提出了展望。
相似文献
7.
针对平行码临界路径跟踪故障模拟中最费时间的扇出源故障模拟,提出了若干加速技术。通过对电路结构进行的独立扇出分支、扇出源分类及扇出源的最终汇聚门等静态分析,结合对停止线及停止扇出源、测试码标记向量以及扇出源临界性确定前的预处理等动态计算,使得扇出源故障模拟区域及需要故障模拟的扇出源数目大大减少,极大地缩短了整个故障模拟时间。实验结果表明,平行码临界路径跟踪故障模拟算法,对少量和大批的随机码都非常有效,并且随着电路规模增加,其有效性更加明显。
相似文献
8.
As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010
相似文献
9.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008
相似文献
10.
We consider the problem of sequencing
n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an
O (
n log
n )‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020
相似文献