全文获取类型
收费全文 | 816篇 |
免费 | 19篇 |
出版年
2021年 | 18篇 |
2019年 | 28篇 |
2018年 | 12篇 |
2017年 | 18篇 |
2016年 | 17篇 |
2015年 | 21篇 |
2014年 | 16篇 |
2013年 | 157篇 |
2008年 | 9篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2005年 | 11篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 21篇 |
1996年 | 12篇 |
1995年 | 9篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 20篇 |
1989年 | 14篇 |
1988年 | 20篇 |
1987年 | 19篇 |
1986年 | 23篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 21篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 8篇 |
1975年 | 15篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 10篇 |
1969年 | 11篇 |
1968年 | 7篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有835条查询结果,搜索用时 15 毫秒
821.
Sean M. Evans 《Low Intensity Conflict & Law Enforcement》2005,13(3):262-279
This paper underscores the theory that efficacious law enforcement intelligence addresses current problems of criminal insurgency including acts of terrorism, asymmetric warfare and low intensity conflict, and suggests possible solutions. By introducing the notion of crime as insurgency, a new paradigm may be developed that could assist practitioners and academics alike in analyzing, solving and managing crime. By shifting the perspective for both military and civilian forces from their traditionally reactive stance, to a proactive posture, and merging national security with homeland defense on the most perplexing issues and threats facing US security, this work may provide a base upon which new and actionable policies can be designed. Public administrators must take seriously the lessons from past failures. The single most important supposition being, sound policy is reliant upon good intelligence. 相似文献
822.
This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
823.
India and Pakistan are currently engaged in a competition for escalation dominance. While New Delhi is preparing for a limited conventional campaign against Pakistan, Islamabad is pursuing limited nuclear options to deter India. Together, these trends could increase the likelihood of nuclear conflict. India, for example, might conclude that it can launch an invasion without provoking a nuclear reprisal, while Pakistan might believe that it can employ nuclear weapons without triggering a nuclear exchange. Even if war can be avoided, these trends could eventually compel India to develop its own limited nuclear options in an effort to enhance deterrence and gain coercive leverage over Pakistan. 相似文献
824.
825.
We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
826.
827.
Irina S. Dolinskaya 《海军后勤学研究》2012,59(5):325-339
This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
828.
In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last. 相似文献
829.
830.
Yogesh Joshi 《The Nonproliferation Review》2019,26(5-6):481-497
ABSTRACTIndia is advancing slowly toward operationalizing its nuclear triad. Its first nuclear-propelled ballistic-missile submarine (SSBN), the INS Arihant, conducted its maiden deterrent patrol in November 2018. However, doubts exist around the capability of India’s SSBN, the effectiveness of its command and control, and its effects on regional stability in South Asia. This article examines the history and future trajectory of India’s sea-based nuclear forces and describes how India seeks to maintain robust command and control over its undersea nuclear weapons. 相似文献