首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3398篇
  免费   85篇
  国内免费   1篇
  2021年   37篇
  2019年   92篇
  2018年   53篇
  2017年   83篇
  2016年   79篇
  2015年   61篇
  2014年   68篇
  2013年   734篇
  2010年   36篇
  2009年   39篇
  2008年   50篇
  2007年   53篇
  2006年   36篇
  2005年   43篇
  2004年   58篇
  2003年   42篇
  2002年   57篇
  2000年   34篇
  1999年   41篇
  1998年   49篇
  1997年   47篇
  1996年   62篇
  1995年   43篇
  1994年   59篇
  1993年   65篇
  1992年   59篇
  1991年   74篇
  1990年   40篇
  1989年   72篇
  1988年   78篇
  1987年   71篇
  1986年   72篇
  1985年   66篇
  1984年   36篇
  1983年   42篇
  1982年   44篇
  1981年   46篇
  1980年   51篇
  1979年   45篇
  1978年   49篇
  1977年   45篇
  1976年   45篇
  1975年   46篇
  1974年   52篇
  1973年   50篇
  1972年   52篇
  1971年   43篇
  1970年   40篇
  1969年   40篇
  1968年   34篇
排序方式: 共有3484条查询结果,搜索用时 62 毫秒
891.
892.
Book reviews     
European Security in the New Political Environment by James H. Wyllie, London: Addison, Wesley Longman, 1997, ISBN 0-582-24403-X (pbk), £13.99

Russia and Europe: The Emerging Security Agenda edited by Vladimir Baranovsky, Oxford: Oxford University Press, SIPRI, 1997, ISBN 0-19-829201-5 (hbk), £45.00

The Defeat of Japan by David Rees, Westport, Connecticut and London: Praeger, ISBN 0-275-95955-4 (hbk), £46.50

The Collective Naval Defence of the Empire, 1900-1940 by Nicholas Tracy (ed.), London: Ashgate, for the Navy Records Society, 1997, ISBN 1859-284-027 (hbk), £59.50

Knights in White Armour The New Art of War and Peace by Christopher Bellamy, London: Pimlico Press, 1997, ISBN 0-7126-739-03 (pbk), £12.50

Regional Orders: Building Security in a New World by avid A. Lake and Patrick M. Morgan (eds), University Park: Penn State Press, 1997, ISBN 0-271-01703-i (hbk), £49.50/$55, ISBN 0-271-01704-X (pbk), £7.95/$19.95

Contested Social Orders and International Politics by David Skidmore (ed.), Nashville: Vanderbilt University Press, 1997, ISBN 0-8265-1284-4 (hbk), $32.95

The Politics of Threat: Minuteman Vulnerability in American National Security Policy by David H. Dunn. London: Macmillan Press, 1997, ISBN 0-333-67816-8 (hbk), £45.00

The Sociology of the Military by Guiseppe Caforio (ed.), Cheltenham: Edward Elgar, 1998, ISBN 1-85898-619-2, 704 pp., £150

The Nordic Nations in the New Western Security Regime by Ingemar Dorfer, Baltimore: Johns Hopkins University Press, 1997, ISBN 0-943875-83-8 (hbk), £27, ISBN 0-943875-82-X (pbk), £13  相似文献   
893.
894.
895.
896.
897.
898.
One branch of the reliability literature is concerned with devising statistical procedures with various nonparametric “restricted family” model assumptions because of the potential improved operating characteristics of such procedures over totally nonparametric ones. In the single-sample problem with unknown increasing failure rate (IFR) distribution F, (1) maximum-likelihood estimators of F have been calculated, (2) upper or lower tolerance limits for F have been determined, and (3) tests of the null hypothesis that F is exponential have been constructed. Barlow and Campo proposed graphical methods for assessing goodness of fit to the IFR model when the validity of this assumption is unknown. This article proposes several analytic tests of the IFR null hypothesis based on the maximum distance and area between the cumulative hazard function and its greatest convex minorant (GCM), and the maximum distance and area between the total time on test statistic and its GCM. A table of critical points is provided to implement a specific test having good overall power properties.  相似文献   
899.
The one-on-one stochastic duel is extended to the general two-on-one duel for the first time. The state equations, win probabilities, mean value, and variance functions are derived. The case where one side has Erlang (2) firing times and the other is negative exponential is compared with the corresponding “Stochastic Lanchester” and Lanchester models to demonstrate their nonequivalence.  相似文献   
900.
Kanet addressed the problem of scheduling n jobs on one machine so as to minimize the sum of absolute lateness under a restrictive assumption on their common due date. This article extends the results to the problem of scheduling n jobs on m parallel identical processors in order to minimize the sum of absolute lateness. Also, a heuristic algorithm for a more general version with no restriction on the common due date, for the problem of n-job single-machine scheduling is presented and its performance is reported.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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