全文获取类型
收费全文 | 607篇 |
免费 | 27篇 |
国内免费 | 4篇 |
专业分类
638篇 |
出版年
2022年 | 3篇 |
2021年 | 16篇 |
2020年 | 11篇 |
2019年 | 6篇 |
2018年 | 4篇 |
2017年 | 23篇 |
2016年 | 14篇 |
2015年 | 15篇 |
2014年 | 23篇 |
2013年 | 85篇 |
2012年 | 34篇 |
2011年 | 35篇 |
2010年 | 35篇 |
2009年 | 28篇 |
2008年 | 32篇 |
2007年 | 17篇 |
2006年 | 21篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 9篇 |
2001年 | 4篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1989年 | 12篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有638条查询结果,搜索用时 15 毫秒
51.
计算了一类二次Hamilton微分系统的一阶Mel’nikov函数,通过此方法对该系统在三次多项式扰动下分岔的极限环个数进行了估计。 相似文献
52.
We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998 相似文献
53.
Nathaniel L. Moir 《Small Wars & Insurgencies》2017,28(6):909-946
This article assesses Bernard Fall’s concept of Vietnamese Revolutionary Warfare in Indochina between 1953 and 1958. It also investigates differences in the conceptualization of Revolutionary Warfare between Fall and proponents of French military doctrine known as la guerre révolutionnaire. The last component of the article considers limits of Fall’s influence on counterinsurgency doctrine. 相似文献
54.
Stephan Frühling 《Contemporary Security Policy》2017,38(1):47-53
The swearing in of Donald Trump as the 45th President of the United States presages, at the very least, a period of flux in American strategy with respect to the relationship between nuclear weapons and alliances. In this response to three thoughtful rejoinders to our article, “Nuclear weapons, the United States and alliances in Europe and Asia: Toward an institutional perspective,” we clarify key aspects of our argument and discuss why alliance institutions are likely to be relatively robust in the face of change, how they can influence national decision-making, and argue that they may exert a moderating influence over the new administration. 相似文献
55.
Edward L. Hannan 《海军后勤学研究》1982,29(1):113-118
This paper investigates the two-person zero-sum multiple payoff game in which the objective is to minimize a player's total underachievement from a fixed set of goals. It is demonstrated that a previous formulation of this problem can be substantially simplified. 相似文献
56.
Preference for food in the function of the time since last consumption and total preference in the function of eating frequency are equivalent mathematical representations of attitudes governing food consumption. The observed and postulated properties of these functions imply a formal correspondence between preference maximizing and variety seeking behavior. 相似文献
58.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
59.
60.