全文获取类型
| 收费全文 | 580篇 |
| 免费 | 0篇 |
专业分类
| 580篇 |
出版年
| 2020年 | 5篇 |
| 2019年 | 12篇 |
| 2017年 | 17篇 |
| 2016年 | 10篇 |
| 2015年 | 14篇 |
| 2014年 | 15篇 |
| 2013年 | 111篇 |
| 2012年 | 5篇 |
| 2011年 | 5篇 |
| 2010年 | 8篇 |
| 2009年 | 11篇 |
| 2007年 | 6篇 |
| 2006年 | 8篇 |
| 2005年 | 9篇 |
| 2004年 | 11篇 |
| 2003年 | 5篇 |
| 2002年 | 10篇 |
| 2000年 | 7篇 |
| 1999年 | 6篇 |
| 1998年 | 12篇 |
| 1997年 | 6篇 |
| 1996年 | 8篇 |
| 1995年 | 4篇 |
| 1994年 | 15篇 |
| 1993年 | 14篇 |
| 1992年 | 8篇 |
| 1991年 | 14篇 |
| 1990年 | 8篇 |
| 1989年 | 14篇 |
| 1988年 | 14篇 |
| 1987年 | 15篇 |
| 1986年 | 16篇 |
| 1985年 | 12篇 |
| 1984年 | 8篇 |
| 1983年 | 7篇 |
| 1982年 | 7篇 |
| 1981年 | 8篇 |
| 1980年 | 5篇 |
| 1979年 | 8篇 |
| 1978年 | 12篇 |
| 1976年 | 7篇 |
| 1975年 | 6篇 |
| 1974年 | 8篇 |
| 1973年 | 7篇 |
| 1972年 | 9篇 |
| 1971年 | 4篇 |
| 1970年 | 9篇 |
| 1969年 | 6篇 |
| 1968年 | 4篇 |
| 1967年 | 6篇 |
排序方式： 共有580条查询结果，搜索用时 0 毫秒
101.
102.
Stephen J. Cimbala 《Defense & Security Analysis》2017,33(3):193-208
Nuclear deterrence and cyber war seem almost antithetical in their respective intellectual pedigrees. Nuclear weapons are unique in their ability to create mass destruction in a short time. Information or “cyber” weapons, at least for the most part, aim at sowing confusion or mass disruption instead of widespread physical destruction. Nevertheless, there are some intersections between cyber and nuclear matters, and these have the potential to become troublesome for the future of nuclear deterrence. For example, cyber attacks might complicate the management of a nuclear crisis. As well, information attacks on command-control and communications systems might lead to a mistaken nuclear launch based on false warnings, to erroneous interpretations of data or to panic on account of feared information blackout. It is not inconceivable that future nuclear strike planning will include a preliminary wave of cyber strikes or at least a more protracted “preparation of the battlefield” by roaming through enemy networks to plant malware or map vulnerabilities. 相似文献
103.
The manufacturing process for a computer chip is complex in that it involves a large number of distinct operations requiring a substantial lead‐time for completion. Our observations of such a manufacturing process at a large plant in the United States led us to identify several tactical and operational problems that were being addressed by the production planners on a recurring basis. This paper focuses on one such problem. At a tactical level, given a demand forecast of wafers to be manufactured, one specific problem deals with specifying which machine or machine groups will process different batches of wafers. We address this problem by recognizing the capacity limitations of the individual machines as well as the requirement for reducing operating and investment costs related to the machines. A mathematical model, which is a variation of the well‐known capacitated facility location problem, is proposed to solve this problem. Given the intractability of the model, we first develop problem specific lower bounding procedures based on Lagrangean relaxation. We also propose a heuristic method to obtain “good” solutions with reasonable computational effort. Computational tests, using hypothetical and industry‐based data, indicate that our heuristic approach provides optimal/near optimal solutions fairly quickly. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
104.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
105.
106.
Tobias Brueggemann Johann L. Hurink Tjark Vredeveld Gerhard J. Woeginger 《海军后勤学研究》2011,58(8):795-803
We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
107.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
108.
Doctor David J. Kilcullen 《战略研究杂志》2013,36(4):597-617
This article suggests that the War on Terrorism is actually a campaign against a globalized Islamist 1 insurgency. Therefore, counterinsurgency approaches are more relevant to the present conflict than traditional terrorism theory. Indeed, a counterinsurgency approach would generate subtly, but substantially different, policy choices in prosecuting the war against Al Qaeda. Based on this analysis, the article proposes a strategy of ‘disaggregation’ that seeks to dismantle, or break, the links in the global jihad.2 Like containment in the Cold War, disaggregation would provide a unifying strategic conception for the war – a conception that has been somewhat lacking to date. 相似文献
109.
In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013 相似文献
110.
Ronald J Kurth Former President of the U.S. Naval War College 《战略研究杂志》2013,36(2):261-280
This article is a portrait of Admiral Sergei Gorshkov, commander of the Soviet Navy for almost three decades, from 1956–85. The author, a retired US Navy admiral with a Harvard PhD in Russian studies who served as both defense and naval attaché in Moscow, draws on numerous face-to-face interactions with Gorshkov. He also explores Gorshkov's memoirs that were published recently in Russia but have not appeared in an English translation. The paper is not only a first-hand account of an important historical figure, but also a window into the world of military-to-military diplomacy and intelligence during the Cold War. 相似文献