全文获取类型
收费全文 | 867篇 |
免费 | 21篇 |
出版年
2021年 | 13篇 |
2019年 | 28篇 |
2018年 | 22篇 |
2017年 | 20篇 |
2016年 | 21篇 |
2015年 | 19篇 |
2014年 | 14篇 |
2013年 | 190篇 |
2011年 | 8篇 |
2009年 | 12篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 19篇 |
2004年 | 17篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 18篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 26篇 |
1989年 | 15篇 |
1988年 | 12篇 |
1987年 | 23篇 |
1986年 | 15篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 12篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 15篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 10篇 |
1966年 | 7篇 |
排序方式: 共有888条查询结果,搜索用时 15 毫秒
101.
Gregory M. Reichberg 《Journal of Military Ethics》2017,16(3-4):220-238
Jacques Maritain (1882–1973) is widely recognized as one of the foremost Catholic philosophers of modern times. He wrote groundbreaking works in all branches of philosophy. For a period of about 10 years, beginning in 1933, he discussed matters relating to war and ethics. Writing initially about Gandhi, whose strategy of non-violence he sought to incorporate within a Christian conception of political action, Maritain proceeded to comment more specifically on the religious aspects of armed force in “On Holy War,” an essay about the civil war then ongoing in Spain (1936–1939). After the outbreak of World War II in September 1939, Maritain penned a series of essays that sought to explain why the Anglo–French declarations of war were warranted on Christian just war principles. While the secondary literature on Maritain’s thought is extensive, thus far there has been little systematic exploration of his writings on war. In what follows I seek to remedy this lacuna, by examining how he conceptualized just war in the three phases outlined above. 相似文献
102.
Adam D.M. Svendsen 《Defense & Security Analysis》2015,31(1):58-73
This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain. 相似文献
103.
Who did it? Attribution is fundamental. Human lives and the security of the state may depend on ascribing agency to an agent. In the context of computer network intrusions, attribution is commonly seen as one of the most intractable technical problems, as either solvable or not solvable, and as dependent mainly on the available forensic evidence. But is it? Is this a productive understanding of attribution? — This article argues that attribution is what states make of it. To show how, we introduce the Q Model: designed to explain, guide, and improve the making of attribution. Matching an offender to an offence is an exercise in minimising uncertainty on three levels: tactically, attribution is an art as well as a science; operationally, attribution is a nuanced process not a black-and-white problem; and strategically, attribution is a function of what is at stake politically. Successful attribution requires a range of skills on all levels, careful management, time, leadership, stress-testing, prudent communication, and recognising limitations and challenges. 相似文献
104.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
105.
While the arrival of nuclear weapons coincided roughly with the development of short, medium, intermediate, and eventually intercontinental missiles, the contribution of missile technology to the deterrence equation is often lost. If nuclear weapons were eliminated, even new generation missiles with conventional payloads could struggle to render effective deterrence. But some of the physical and psychological effects commonly ascribed to nuclear weapons could still be in play. And in a world without nuclear weapons, thinking about the use and control of force from the nuclear age would also deserve renewed attention. 相似文献
106.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
107.
108.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
109.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
110.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献