首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16399篇
  免费   596篇
  国内免费   455篇
化学   5303篇
晶体学   183篇
力学   205篇
综合类   48篇
数学   7901篇
物理学   2105篇
无线电   1705篇
  2023年   67篇
  2022年   139篇
  2021年   116篇
  2020年   196篇
  2019年   320篇
  2018年   297篇
  2017年   252篇
  2016年   262篇
  2015年   293篇
  2014年   477篇
  2013年   704篇
  2012年   541篇
  2011年   953篇
  2010年   738篇
  2009年   1052篇
  2008年   918篇
  2007年   1007篇
  2006年   805篇
  2005年   700篇
  2004年   754篇
  2003年   693篇
  2002年   615篇
  2001年   478篇
  2000年   428篇
  1999年   383篇
  1998年   367篇
  1997年   346篇
  1996年   373篇
  1995年   373篇
  1994年   360篇
  1993年   316篇
  1992年   289篇
  1991年   170篇
  1990年   155篇
  1989年   173篇
  1988年   117篇
  1987年   119篇
  1986年   109篇
  1985年   123篇
  1984年   116篇
  1983年   68篇
  1982年   104篇
  1981年   84篇
  1980年   88篇
  1979年   109篇
  1978年   94篇
  1977年   69篇
  1976年   54篇
  1974年   23篇
  1973年   23篇
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
1.
Like the lower central series of a nilpotent group, filters generalize the connection between nilpotent groups and graded Lie rings. However, unlike the case with the lower central series, the associated graded Lie ring may share few features with the original group: e.g. the associated Lie ring can be trivial or arbitrarily large. We determine properties of filters such that every isomorphism between groups is induced by an isomorphism between graded Lie rings.  相似文献   
2.
3.
4.
微机械可调谐滤波器的研制   总被引:6,自引:4,他引:2  
利用 Ga As/Al Ga As分布反馈 Bragg反射镜在 Ga As衬底上制作了一个微机械的调谐滤波器 .该器件在 7V调谐电压下调谐范围达28nm  相似文献   
5.
非线性互补问题的一种全局收敛的显式光滑Newton方法   总被引:2,自引:0,他引:2  
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。  相似文献   
6.
We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP n . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP n and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH n . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996  相似文献   
7.
Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996  相似文献   
8.
9.
In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.  相似文献   
10.
We have studied the individual adsorption of Mn and Bi, and their coadsorption on Cu(0 0 1) by low-energy electron diffraction (LEED). For Mn, we have determined the c(2 × 2) structure formed at 300 K, whose structure had been determined by several methods. We reconfirmed by a tensor LEED analysis that it is a substitutional structure and that a previously reported large corrugation (0.30 Å) between substitutional Mn and remaining surface Cu atoms coincides perfectly with the present value. In the individual adsorption of Bi, we have found a c(4 × 2) structure, which is formed by cooling below ∼250 K a surface prepared by Bi deposition of ∼0.25 ML coverage at 300 K where streaky half-order LEED spots appear. The c(4 × 2) structure has been determined by the tensor LEED analysis at 130 K and it is a substitutional structure. In the coadsorption, we found a c(6 × 4) structure, which has been determined by the tensor LEED analysis. It is very similar to the previously determined structure of the c(6 × 4) formed by coadsorption of Mg and Bi, and embedded MnBi4 clusters are arranged in the top Cu layer instead of MgBi4. Large lateral displacements of Bi atoms in the c(6 × 4)-(Mn + Bi) suggest that the Mn atoms undergo the size-enhancement caused by their large magnetic moment.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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