首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   492篇
  免费   23篇
  国内免费   1篇
  516篇
  2021年   6篇
  2019年   11篇
  2018年   9篇
  2017年   13篇
  2016年   10篇
  2015年   9篇
  2014年   10篇
  2013年   125篇
  2012年   7篇
  2011年   9篇
  2010年   8篇
  2009年   7篇
  2008年   7篇
  2007年   6篇
  2006年   11篇
  2005年   9篇
  2004年   6篇
  2003年   5篇
  2002年   6篇
  2000年   5篇
  1997年   7篇
  1996年   10篇
  1995年   6篇
  1994年   8篇
  1993年   12篇
  1992年   12篇
  1991年   9篇
  1990年   4篇
  1989年   10篇
  1988年   9篇
  1987年   8篇
  1986年   7篇
  1985年   10篇
  1984年   5篇
  1983年   6篇
  1982年   5篇
  1981年   7篇
  1980年   9篇
  1979年   8篇
  1978年   8篇
  1976年   7篇
  1975年   13篇
  1974年   6篇
  1973年   9篇
  1972年   5篇
  1971年   5篇
  1970年   6篇
  1969年   4篇
  1968年   5篇
  1967年   4篇
排序方式: 共有516条查询结果,搜索用时 0 毫秒
261.
The premise of most Western thinking on counterinsurgency is that success depends on establishing a perception of legitimacy among local populations. The path to legitimacy is often seen as the improvement of governance in the form of effective and efficient administration of government and public services. However, good governance is not the only basis for claims to legitimacy, especially in environments where ethnic or religious identities are politically salient. Some experience in Iraq suggests that in environments where such identities are contested, claims to legitimacy may rest primarily on the identity of who governs, rather than on how whoever governs, governs. This article outlines the intellectual foundations of existing policy and doctrine on counterinsurgency, and argues that development and analysis of counterinsurgency strategy would benefit from a greater focus on the role of ethnic and religious identity in irregular warfare.  相似文献   
262.
263.
264.
265.
266.
We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
267.
268.
The Brain of an Army: a Popular Account of the German General Staff. By Spenser Wilkinson. Archibald Constable, London (1st edition 1890, 2nd edition 1895)  相似文献   
269.
270.
n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity Fi, a processing time Ei, a deadline Di, relative to each request of task i, a task-request interrupt overhead Ii, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号