全文获取类型
收费全文 | 593篇 |
免费 | 15篇 |
出版年
2021年 | 11篇 |
2019年 | 21篇 |
2018年 | 11篇 |
2017年 | 11篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 13篇 |
2013年 | 139篇 |
2009年 | 6篇 |
2008年 | 8篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2000年 | 7篇 |
1998年 | 10篇 |
1997年 | 16篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 14篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 9篇 |
1971年 | 7篇 |
1970年 | 10篇 |
1969年 | 7篇 |
1968年 | 5篇 |
1967年 | 8篇 |
1966年 | 5篇 |
排序方式: 共有608条查询结果,搜索用时 15 毫秒
481.
482.
Maria Mälksoo 《Contemporary Security Policy》2016,37(3):374-388
Security strategies are important sites for narrating the EU into existence as a security actor. The unveiling of a new global strategy on foreign and security policy for the EU immediately post-Brexit could be conceived as a pledge to remain together as a Union for the purposes of contributing to global security in a particular way. This paper offers a brief stock-taking of the EU’s way of writing security from the European Security Strategy (2003) to the EU Global Strategy (2016). A concise exegesis of these documents exposes an interesting dynamic: as exercises in ordering the world, both strategic guidelines have turned out to be major exercises in ordering the self. The comparative snapshot shows the EU as increasingly anxious to prove its relevance for its own citizens, yet notably less confident about its actual convincingness as an ontological security framework for the EU’s constituent members over time. 相似文献
483.
A military cannot hope to improve in wartime if it cannot learn. Ideally, in wartime, formal learning ceases and the application of knowledge begins. But this is optimistic. In 1942, USAAF Eighth Air Force assumed it had the means necessary for victory. In reality, its technique and technology were only potentially – rather than actually – effective. What remained was to create the practice of daylight bombing – to learn. This article (1) recovers a wartime learning process that created new knowledge, (2) tests existing tacit hypotheses in military adaptation research, and (3) offers additional theoretical foundation to explain how knowledge is created in wartime 相似文献
484.
485.
486.
487.
Traditional inventory systems treat all demands of a given item equally. This approach is optimal if the penalty costs of all customers are the same, but it is not optimal if the penalty costs are different for different customer classes. Then, demands of customers with high penalty costs must be filled before demands of customers with low penalty costs. A commonly used inventory policy for dealing with demands with different penalty costs is the critical level inventory policy. Under this policy demands with low penalty costs are filled as long as inventory is above a certain critical level. If the inventory reaches the critical level, only demands with high penalty costs are filled and demands with low penalty costs are backordered. In this article, we consider a critical level policy for a periodic review inventory system with two demand classes. Because traditional approaches cannot be used to find the optimal parameters of the policy, we use a multidimensional Markov chain to model the inventory system. We use a sample path approach to prove several properties of this inventory system. Although the cost function is not convex, we can build on these properties to develop an optimization approach that finds the optimal solution. We also present some numerical results. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
488.
Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
489.
The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces. 相似文献
490.
An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999 相似文献