首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   483篇
  免费   0篇
  483篇
  2021年   6篇
  2019年   12篇
  2018年   6篇
  2017年   9篇
  2016年   8篇
  2015年   3篇
  2014年   9篇
  2013年   99篇
  2012年   4篇
  2010年   3篇
  2009年   5篇
  2007年   13篇
  2004年   3篇
  2003年   7篇
  2002年   6篇
  2001年   3篇
  2000年   5篇
  1999年   3篇
  1998年   10篇
  1997年   9篇
  1996年   11篇
  1995年   5篇
  1994年   7篇
  1993年   12篇
  1992年   10篇
  1991年   9篇
  1990年   11篇
  1989年   19篇
  1988年   17篇
  1987年   9篇
  1986年   15篇
  1985年   9篇
  1984年   4篇
  1983年   3篇
  1982年   11篇
  1981年   6篇
  1980年   7篇
  1979年   9篇
  1978年   9篇
  1977年   6篇
  1976年   6篇
  1975年   4篇
  1974年   8篇
  1973年   5篇
  1972年   3篇
  1971年   8篇
  1970年   7篇
  1969年   6篇
  1967年   9篇
  1948年   4篇
排序方式: 共有483条查询结果,搜索用时 0 毫秒
341.
342.
343.
A plethora of arguments from the ‘public choice school’ suggest that public goods are ‘under‐supplied’ by comparison with public sector provision of more private goods. The implication is that rent seeking by the ‘military‐industrial complex’ serves, in some measure, to offset potential allocative inefficiency. In this paper a comparison of rent seeking by producers of public goods and producers of private goods identifies a bias that favours public good supply. The bias results from the different way in which collective demand for public goods and for private goods is expressed. The prospect of larger rents to the ‘military‐industrial complex’ implies greater rent‐seeking expenditures in this sector. The extent to which public goods (and, in particular, defence) are ‘under supplied’ is much exaggerated.  相似文献   
344.
345.
A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius rp (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported.  相似文献   
346.
347.
This article demonstrates that assurances and carrots accompanied credible threats every time Western coercion succeeded in Bosnia. This finding is hardly surprising as it merely confirms earlier research on coercive diplomacy, but it is nevertheless important because the crucial role played by assurances and carrots has been completely ignored in most analyses to date. It also has important policy implications at a time when Western, and particularly American, policy‐makers tend to ignore this fact at their peril. US policy towards Iraq and Western policy towards Yugoslavia have been based almost exclusively on the stick in recent years, and its lack of success is therefore not surprising. If Western policy‐makers had learned the right lessons from Bosnia, they would have known that strategies coupling credible threats with credible assurances and carrots would have been more likely to succeed.  相似文献   
348.
Book reviews     
John Horsfield, The Art of Leadership in War. The Royal Navy From the Age of Nelson to the End of World War II. Westport, Conn. and London: Greenwood Press, 1980. Pp. 240; £14.75.

John Joseph Timothy Sweet, Iron Arm: The Mechanization of Mussolini's Army, 1920–1940. Westport, Connecticut &; London: Greenwood Press. 1980. Pp. 207; £15.50.

Peter H. Merkl, The Making of a Stormtrooper. Princeton, N.J: Princeton U.P., 1980. Pp. 328; £8.60.

Greg Herken, The Winning Weapon: The Atomic Bomb in the Cold War 1945–1950. New York: Alfred A. Knopf, 1980. Pp. 425; $15.00.

Geoffrey Smith and Nelson W. Polsby, British Government and its Discontents. New York: Basic Books, and London: Harper and Row, 1981. Pp. 202; £7.95.

Seweryn Bialer (ed.), The Domestic Context of Soviet Foreign Policy. Boulder, Colorado: Westview Press and London: Croom Helm, 1981. Pp. 441; £14.95.

Jerry F. Hough, Soviet Leadership in Transition. Washington, D.C.: Brookings Institution and Oxford, Basil Blackwell, 1981. Pp. 175; £12.00 (hb.) and £3.95 (pb.)

Edward F. Mickolus, Transnational Terrorism: A Chronology of Events 1968–1979. London: Aldwych Press, 1980. Pp. 967; £39.95.

Barry Rubin, The Great Powers in the Middle East, 1941–47; The Road to the Cold War, London: Frank Cass, 1980. Pp. 254; £14.50;

Daniel Heradstveit, The Arab‐Israeli Conflict; Psychological Obstacles to Peace. Oslo: Universittsforlaget, 1979. Pp. 234; £11.60;

Janice Gross Stein, and Raymond Tanter, Rational Decision‐making; Israel's Security Choices 1967. Columbus. Ohio; Ohio State University Press, 1980. Pp. 399; $35.  相似文献   
349.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered.  相似文献   
350.
A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号