首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19894篇
  免费   1688篇
  国内免费   1879篇
化学   2705篇
晶体学   61篇
力学   1382篇
综合类   506篇
数学   13862篇
物理学   4945篇
  2024年   31篇
  2023年   188篇
  2022年   321篇
  2021年   385篇
  2020年   432篇
  2019年   479篇
  2018年   423篇
  2017年   519篇
  2016年   536篇
  2015年   443篇
  2014年   836篇
  2013年   1339篇
  2012年   814篇
  2011年   1126篇
  2010年   1099篇
  2009年   1376篇
  2008年   1430篇
  2007年   1418篇
  2006年   1295篇
  2005年   1081篇
  2004年   889篇
  2003年   910篇
  2002年   782篇
  2001年   682篇
  2000年   580篇
  1999年   573篇
  1998年   530篇
  1997年   460篇
  1996年   360篇
  1995年   261篇
  1994年   212篇
  1993年   190篇
  1992年   183篇
  1991年   140篇
  1990年   111篇
  1989年   106篇
  1988年   93篇
  1987年   73篇
  1986年   54篇
  1985年   96篇
  1984年   75篇
  1983年   49篇
  1982年   79篇
  1981年   67篇
  1980年   53篇
  1979年   78篇
  1978年   51篇
  1977年   45篇
  1976年   35篇
  1974年   25篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
The tradition of mutual trust between science and the public appears to have been broken in recent years. It is necessary to define the boundaries of science and to reflect upon the responsibility of the scientist.  相似文献   
992.
993.
A dynamic factorization algorithm is developed which algebraically partitions the basis inverse in such a manner so that the simplex method can be executed from a series of small inverses and the basis itself. This partition is maintained dynamically so that the additional memory required to represent the basis inverse reduces to this series of small inverses for in-core implementations.The algorithm is intended for use in solving general large-scale linear programming problems. This new method of basis representation should permit rather large problems to be solved completely in-core.Preliminary computational experience is presented and comparisons are made with Reid's sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases. The computational experience indicated that a significant reduction in memory requirements can usually be obtained using the dynamic factorization approach with only a slight (up to about 20%) degradation of execution time.This research was supported in part by the Air Force Office of Scientific Research, Air Force System Command, USAF, under AFOSR Contract/Grant Number AFOSR-74-2715.  相似文献   
994.
995.
For a convex-concave functionL(x, y), we define the functionf(x) which is obtained by maximizingL with respect toy over a specified set. The minimization problem with objective functionf is considered. We derive necessary conditions of optimality for this problem. Based upon these necessary conditions, we define its dual problem. Furthermore, a duality theorem and a converse duality theorem are obtained. It is made clear that these results are extensions of those derived in studies on a class of nondifferentiable mathematical programming problems.This work was supported by the Japan Society for the Promotion of Sciences.  相似文献   
996.
997.
In the last paper, the geometry of the Sz.-Nagy-Foia model for contraction operators on Hilbert spaces was used to advantage in several problems of multivariate analysis. The lifting of intertwining operators, one of the basic results from the Sz.-Nagy-Foia theory, is now recognized as the most adequate operatorial form of the deep classical results of the extrapolation theory. The labeling of the exact intertwining dilations given by [1]Acta Sci. Math. (Szeged) 40 9–32] and the recursive methods used there open a broad perspective for using the Sz.-Nagy-Foia model in multivariate filtering theory. In this paper, using the notion of correlated action (see [5 and 6] Rev. Roumaine Math. Pures Appl. 23, No. 9 1393–1423]) as a time domain, a linear filtering problem is formulated and its solution in terms of the coefficients of the analytic function which factorizes the spectral distribution of the known data and the coefficients of an analytic function which describes the cross correlations is given. In some special cases it is shown that the filter coefficients can be determined using recursive methods from the intertwining dilation theory, of the autocorrelation function of the known data and an intertwining operator, interpreted as the initial estimator given by the prior statistics.  相似文献   
998.
In this work we consider some familiar and some new concepts of positive dependence for interchangeable bivariate distributions. By characterizing distributions which are positively dependent according to some of these concepts, we indicate real situations in which these concepts arise naturally. For the various families of positively dependent distributions we prove some closure properties and demonstrate all the possible logical relations. Some inequalities are shown and applied to determine whether under- (or over-) estimates, of various probabilistic quantities, occur when a positively dependent distribution is assumed (falsely) to be the product of its marginals (that is, when two positively dependent random variables are assumed, falsely, to be independent). Specific applications in reliability theory, statistical mechanics and reversible Markov processes are discussed. This work was partially supported by National Science Foundation GP-30707X1. It is part of the author's Ph.D. dissertation prepared at the University of Rochester and supervised by A. W. Marshall. Now at Indiana University.  相似文献   
999.
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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