全文获取类型
收费全文 | 63篇 |
免费 | 1篇 |
出版年
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2014年 | 1篇 |
2013年 | 19篇 |
2007年 | 1篇 |
2006年 | 1篇 |
2005年 | 1篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1970年 | 2篇 |
1968年 | 1篇 |
排序方式: 共有64条查询结果,搜索用时 453 毫秒
41.
42.
The Political Economy of Military Spending in the United States, Alex Mintz (ed), London and New York: Routledge, 1992, pp x, 334; ISBN 0–415–07595–5 Penser La Guerre, Penser L'Economie, Christian Schmidt, (Paris: Odile Jacob, 1991), 350p. Military Production and Innovation in Spain, Jordi Molas‐Gallart, Chur (CH): Harwood Academic Publishers, 1992, pp. vii, 212; ISBN 3–7186–5280–3 相似文献
43.
An availability‐oriented approach has been developed to decide when to replace an aging system. For an existing system, it is optimal to operate another year if and only if the incremental cost per available year is less than the lifetime average cost per available year of a new aircraft. We illustrate our approach using United States Air Force KC‐135 tanker data. In demonstrating our approach, we find it will be optimal to replace the KC‐135 by the end of the decade. 相似文献
44.
Edward T. Barrett 《Journal of Military Ethics》2013,12(1):4-17
While most normative evaluations of military cyber-operations have emerged from the legal community, this article assesses the legitimacy of such operations from a philosophical-ethical perspective. After reviewing the relationship between rights forfeiture and the jus ad bellum and jus in bello criteria of the just war tradition, it applies these criteria to several aspects of cyber-operations, including responses to cyber-activities, the use of cyber-capabilities affecting combatants and civilians, and the use of these capabilities by contractors. Finally, it briefly addresses the legitimacy of limiting rights to privacy and anonymity in service of preventing cyber-harm. 相似文献
45.
46.
47.
This paper presents a method for modeling cyclic inputs to a congested system in a discrete event digital simulation. Specifically, we express the mean of the interarrival time conditional on the last arrival as a linear combination of harmonic components whose coefficients can be determined by stepwise regression. We also assume that the conditional interarrival time normalized by its corresponding mean follows a distribution that is independent of time. The result can, in turn, be used to generate the desired input for a simulation, An example based on a set of actual data is used to illustrate the process of parameter estimation for the model. 相似文献
48.
Edward A Silver 《海军后勤学研究》1979,26(1):141-151
We consider a group (or family) of items having deterministic, but time-varying, demand patterns. The group is defined by a setup-cost structure that makes coordination attractive (a major setup cost for each group replenishment regardless of how many of the items are involved). The problem is to determine the timing and sizes of the replenishments of all of the items so as to satisfy the demand out to a given horizon in a cost-minimizing fashion. A dynamic programming formulation is illustrated for the case of a two-item family. It is demonstrated that the dynamic programming approach is computationally reasonable, in an operational sense, only for small family sizes. For large families heuristic solution methods appear necessary. 相似文献
49.
A nonparametric selection procedure ??bs was proposed by Bechhofer and Sobel (1958) and studied by Dudewicz (1971) in comparison with other procedures under normal and uniform alternatives. He found ??BS always required larger sample sizes, sometimes substantially so. For 2-point populations we find more extreme results. We also find that ??BS may be substantially better than reasonable competitors designed specifically for 2-point populations. Finally, a new nonparametric selection procedure (conjectured to be better than ??BS) is proposed. 相似文献
50.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献