全文获取类型
收费全文 | 234篇 |
免费 | 3篇 |
出版年
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 11篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 68篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2008年 | 2篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 7篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1971年 | 1篇 |
1970年 | 3篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
排序方式: 共有237条查询结果,搜索用时 31 毫秒
101.
102.
James Hasik 《Defense & Security Analysis》2013,29(3):203-217
Since the publication in 2002 of John Nagl's Learning to Eat Soup with a Knife, organizational learning has been widely presumed an important ingredient for success in counterinsurgency. But sampling the literature from before and after this time shows remarkably little analytical treatment of the issue of learning and even confusion over what it may mean. This article considers the theories, hypotheses, research strategies, threats to validity, methods of measurement, treatments of time, and general lack of statistical analysis in the work to date and recommends a course for future research. 相似文献
103.
104.
105.
106.
Surulola James Eke 《Defense & Security Analysis》2015,31(4):319-329
Boko Haram (BH) is an insurgent group that operates mainly in northeastern Nigeria. Its stated aim is to establish an Islamic state, and it employs terrorism as its strategy. Earlier interests of security analysts centred on the drivers of BH uprising and the possibility of its internationalisation. Today's concerns relate more to why the rebellion has lasted this long. In toeing the same line, this article demonstrates that BH is a purposive terror group against which the government has evolved no viable strategy. It examines some gains of BH over the past six years and how it benefitted from the government's underestimation of its capacity and determination. It concludes that to effectively engage BH, the Nigerian government must revaluate its threat and sincerely pursue an expanded strategy beyond the current military-centric approach. To be effective, government's response must be packaged in such a way as to enhance human security in the region. 相似文献
107.
108.
This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017 相似文献
109.
110.
We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance. 相似文献