全文获取类型
收费全文 | 345篇 |
免费 | 9篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 13篇 |
2015年 | 8篇 |
2014年 | 4篇 |
2013年 | 96篇 |
2011年 | 6篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 11篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 7篇 |
1972年 | 4篇 |
1971年 | 7篇 |
1970年 | 2篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有354条查询结果,搜索用时 15 毫秒
101.
John D. Waghelstein 《Small Wars & Insurgencies》2013,24(3):360-378
The Lord's Resistance Army (LRA) has created a pervasive climate of fear in northern Uganda. This study addresses the purpose of this conduct. Diverging from the traditional ‘greed-grievance’ approach to the study of new wars, the LRA's behaviour is analyzed from a strategic perspective. Specifically, the article focuses on the LRA's use of mutilation, abduction, surprise, and unpredictable attacks. The conclusion is that the LRA is strategically using fear as a force multiplier, to further its organizational survival, and as a way to fight a political ‘dirty war’. 相似文献
102.
103.
104.
T. V. Paul 《战略研究杂志》2013,36(1):149-169
The pattern of civil–military interaction in India is informed by the notion that civilians should refrain from involvement in operational matters. The emergence of this trend can be traced back to the defeat against China in 1962. In its aftermath, the belief that the debacle occurred because of civilian interference took hold. Thereafter, politicians restricted themselves to giving overall directives, leaving operational matters to the military. The Indian ‘victory’ in the subsequent war with Pakistan was seen as vindicating this arrangement. This essay argues that the conventional reading of the China crisis is at best misleading and at worst erroneous. Further, it contends that the subsequent war with Pakistan actually underscores the problems of civilian non-involvement in operational issues. The historical narrative underpinning the norm of civilian abstention is at the very least dubious. 相似文献
105.
John J. Yurechko 《战略研究杂志》2013,36(1):44-73
One of the effects of Deng Xiaoping's economic reforms is the steady erosion of the ideological integrity of Marxism‐Leninism‐Maoism. To compensate for that erosion, the Chinese Communist Party has turned to patriotic nationalism for a new source of legitimacy. China's new nationalism transcends mere rhetoric but is manifested in the behavior of its armed forces ‐ which makes an understanding of the nationalist ideology of the People's Liberation Army (PLA) important. As revealed in PLA and related military publications, that ideology is a potentially problematic mix of wounded pride, historical resentment, and irredentism. 相似文献
106.
107.
In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ Cj, the makespan Cmax, and the maximum lateness Lmax. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
108.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
109.
In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
110.
We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献