全文获取类型
| 收费全文 | 630篇 |
| 免费 | 0篇 |
专业分类
| 630篇 |
出版年
| 2019年 | 16篇 |
| 2018年 | 7篇 |
| 2017年 | 21篇 |
| 2016年 | 14篇 |
| 2015年 | 16篇 |
| 2014年 | 16篇 |
| 2013年 | 128篇 |
| 2012年 | 6篇 |
| 2011年 | 7篇 |
| 2010年 | 8篇 |
| 2009年 | 11篇 |
| 2007年 | 7篇 |
| 2006年 | 8篇 |
| 2005年 | 9篇 |
| 2004年 | 12篇 |
| 2003年 | 6篇 |
| 2002年 | 10篇 |
| 2000年 | 8篇 |
| 1999年 | 6篇 |
| 1998年 | 12篇 |
| 1997年 | 6篇 |
| 1996年 | 11篇 |
| 1995年 | 4篇 |
| 1994年 | 16篇 |
| 1993年 | 15篇 |
| 1992年 | 9篇 |
| 1991年 | 14篇 |
| 1990年 | 9篇 |
| 1989年 | 15篇 |
| 1988年 | 14篇 |
| 1987年 | 15篇 |
| 1986年 | 17篇 |
| 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篇 |
排序方式： 共有630条查询结果，搜索用时 0 毫秒
131.
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. 相似文献
132.
Robbie J. Totten 《Defense & Security Analysis》2015,31(3):199-212
What are relationships between epidemics, national security, and US immigration policy? This question is important because it sheds light on transnational or nontraditional security areas, American immigration policy, and a pressing issue for US leaders who have recently faced epidemics such as the West Africa Ebola outbreak that began in 2013. This article answers it and lays ground in the area by reviewing epidemics in world history, using International Relations and Security Studies works to specify dangers of contagions for states, and identifying three general immigration measures that American leaders have utilized from the seventeenth century to the present day to protect against contagions, which are (1) policies restricting entrance of foreigners thought to carry specified diseases, (2) the isolation or quarantining of immigrants with contagious disease, and (3) delegating the President with authority to stop immigration in the event of an epidemic abroad. This study has implications for research and contemporary US immigration policy. 相似文献
133.
AirSea Battle (ASB) has generated significant publicity, controversy, and debate among scholars, analysts, commentators, and observers of US defense strategy. However, a research gap exists concerning formal analysis of the impact of the operational concept on the relationship between the US Air Force (USAF) and the US Navy (USN). The impact of the ASB operational concept on the USAF–USN relationship is examined across the issue areas of strategy, budgets, weapons procurement, and training. These four issue areas represent important areas of historical conflict and competition between the Air Force and Navy. The conclusion is that ASB is ushering in a new era of Air Force–Navy partnership that advances the inter-service dynamic from “jointness” toward integration. The emergent USAF–USN partnership therefore represents a significant development in US defense politics and defense strategy. 相似文献
134.
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 相似文献
135.
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. 相似文献
136.
Assemble in Advance (AIA) policy reduces assembly cost due to advance planning, while Assemble to Order (ATO) policy eliminates assembly of excessive (more than demanded) units. The tradeoffs between the two policies have been studied in the past for single product environments. Moreover, it was shown that it is beneficial to employ AIA and ATO simultaneously. In this article, we study the employment of such a composite assembly policy in a multiproduct environment with component commonality. When common components are used, ATO may also enable us to benefit from the risk pooling effect. We provide important managerial insights such as: the multiperiod problem is myopic and changes in inventory levels due to the use of common components, and demonstrate the potential profit increase compared to other policies.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
137.
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 相似文献
138.
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 相似文献
139.
140.
Alan J. Kaplan 《海军后勤学研究》1976,23(4):687-695
We address a single product, continuous review model with stationary Poisson demand. Such a model has been effectively studied when mean demand is known. However, we are concerned with managing new items for which only a Bayesian prior distribution on the mean is available. As demand occurs, the prior is updated and our control parameters are revised. These include the reorder point (R) and reorder quantity (Q). Deemer, taking a clue from some earlier RAND work, suggested using a model appropriate for known mean, but using a Compound Poisson distribution for demand rather than Poisson to reflect uncertainty about the mean. Brown and Rogers also used this approach but within a periodic review context. In this paper we show how to compute optimum reorder points for a special problem closely related to the problem of real interest. In terms of the real problem, subject to a qualification to be discussed, the reorder points found are upper bounds for the optimum. At the same time, the reorder points found can never exceed those found by the Compound Poisson (Deemer) approach. And they can be smaller than those found when there is no uncertainty about the mean. As a check, the Compound Poisson and proposed approach are compared by simulation. 相似文献