全文获取类型
收费全文 | 492篇 |
免费 | 23篇 |
国内免费 | 1篇 |
出版年
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条查询结果,搜索用时 15 毫秒
211.
212.
213.
Kobi Michael 《战略研究杂志》2013,36(3):421-446
The changes in the nature of warfare and its transformation toward Low Intensity Conflict (LIC) intrastate conflict have challenged the patterns of interaction between the political and the military echelons in Israel. It seems that the political echelon's superiority is maintained at the institutional and formal levels, but on the substantive level, which demands relying on knowledge and systematic staff work, the political echelon's position is weakened and loses its validity. Introducing the military echelon in Israel as an epistemic authority regarding the violent confrontation and the main outlines of the military knowledge development process might clarify why the absence of the required dialogue between the echelons and the weakness of the intellectual effort increased the military's influence over the shaping of Israeli conflict-management strategy. The argument's validity and its explanatory power can be found relevant for other countries whose militaries are deeply involved in the management of LIC. 相似文献
214.
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. 相似文献
215.
This paper presents a modified analytical model to evaluate the trajectories of various lift separation sabot configurations. The aerodynamic forces acting on the sabot surfaces during a supersonic flight are modeled in the present analytical model by incorporating the pressures on the windward side of the sabot due to the detached/attached shock and its reflections and then integrated using the 3-DoF dynamical equations. The trajectory and the aerodynamic coefficients were obtained for these config-urations at a projectile Mach number of 3. The sabot configurations, which include two new designs, are compared with each other and with the conventional free flight trajectory data of the conventional sabots. The mechanical interaction between the sabot and projectile is also addressed in the present work. The comparison shows that the new designs with the aerodynamic surfaces close to the center of gravity, lift-off from the projectile with minimal mechanical interaction compared to a conventional sabot. 相似文献
216.
In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
217.
218.
219.
220.