首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27335篇
  免费   600篇
  国内免费   106篇
化学   15431篇
晶体学   176篇
力学   851篇
综合类   9篇
数学   3770篇
物理学   7804篇
  2023年   123篇
  2022年   263篇
  2021年   478篇
  2020年   415篇
  2019年   395篇
  2018年   463篇
  2017年   425篇
  2016年   717篇
  2015年   590篇
  2014年   692篇
  2013年   1150篇
  2012年   1434篇
  2011年   1630篇
  2010年   924篇
  2009年   897篇
  2008年   1356篇
  2007年   1322篇
  2006年   1189篇
  2005年   1598篇
  2004年   1608篇
  2003年   1131篇
  2002年   770篇
  2001年   645篇
  2000年   583篇
  1999年   385篇
  1998年   313篇
  1997年   309篇
  1996年   384篇
  1995年   334篇
  1994年   329篇
  1993年   351篇
  1992年   344篇
  1991年   283篇
  1990年   222篇
  1989年   214篇
  1988年   191篇
  1987年   178篇
  1986年   178篇
  1985年   234篇
  1984年   220篇
  1983年   188篇
  1982年   193篇
  1981年   187篇
  1980年   178篇
  1979年   153篇
  1978年   179篇
  1977年   146篇
  1976年   142篇
  1974年   136篇
  1973年   123篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
51.
52.
YBa2Cu3O7-x (YBCO) bulk is one of the most important high temperature superconducting materials for magnetic levitation applications, because it has a high magnetic irreversibility field Hirr at liquid nitrogen temperature, and can grow into large grains. The levitation force of YBCO bulk is proportional to the critical current density (Jc) and grain radius (r)[1], so higher Jc and r are appreciated for YBCO bulks to achieve higher levitation force. Now single-domain YBCO bulks up to s…  相似文献   
53.
Affine Arithmetic: Concepts and Applications   总被引:2,自引:0,他引:2  
Affine arithmetic is a model for self-validated numerical computation that keeps track of first-order correlations between computed and input quantities. We explain the main concepts in affine arithmetic and how it handles the dependency problem in standard interval arithmetic. We also describe some of its applications.  相似文献   
54.
55.
56.
On-line sample pretreatment by means of the phase-system switching approach is an interesting technique for the analysis of aqueous samples, e.g., plasma, by means of supercritical-fluid chromatography. In order to analyse plasma samples the following analytical procedure is used. The plasma sample is injected on to a short precolumn, which is washed with water and subsequently dried with nitrogen. Next, the solutes are desorbed with the supercritical mobile phase, analysed with packed-column supercritical-fluid chromatography and detected with either a UV detector or a mass spectrometer, equipped with a moving-belt interface. The herbicide diuron is selected as a test compound to study the feasibility of this approach. Using a selective detector the procedure is sufficiently sensitive to detect diuron in plasma, but not appropriate to detect the diuron metabolites in a post-mortem plasma sample. These have been identified with liquid chromatography/mass spectrometry. The detection limit of diuron in plasma using the procedure described is about 30 ng/mL.  相似文献   
57.
Thermodynamic fluctuations in systems that are in nonequilibrium steady states are always spatially long ranged, in contrast to fluctuations in thermodynamic equilibrium. In the present paper we consider a fluid subjected to a stationary temperature gradient. Two different physical mechanisms have been identified by which the temperature gradient causes long-ranged fluctuations. One cause is the presence of couplings between fluctuating fields. Secondly, spatial variation of the strength of random forces, resulting from the local version of the fluctuation-dissipation theorem, has also been shown to generate long-ranged fluctuations. We evaluate the contributions to the long-ranged temperature fluctuations due to both mechanisms. While the inhomogeneously correlated Langevin noise does lead to long-ranged fluctuations, in practice, they turn out to be negligible as compared to nonequilibrium temperature fluctuations resulting from the coupling between temperature and velocity fluctuations.  相似文献   
58.
In this article the main theorem establishes the necessity and sufficiency of the Poincaré-Hopf inequalities in order for the Morse inequalities to hold. The convex hull of the collection of all Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data determines a Morse polytope defined on the nonnegative orthant. Using results from network flow theory, a scheme is provided for constructing all possible Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data. Geometrical properties of this polytope are described.

  相似文献   

59.
It is a well-known feature of odd space-time dimensions d that there exist two inequivalent fundamental representations A and B of the Dirac gamma matrices. Moreover, the parity transformation swaps the fermion fields living in A and B. As a consequence, a parity-invariant Lagrangian can only be constructed by incorporating both the representations. Based upon these ideas and contrary to long-held belief, we show that in addition to a discrete exchange symmetry for the massless case, we can also define chiral symmetry provided the Lagrangian contains fields corresponding to both the inequivalent representations. We also study the transformation properties of the corresponding chiral currents under parity and charge-conjugation operations. We work explicitly in 2 + 1 dimensions and later show how some of these ideas generalize to an arbitrary number of odd dimensions.  相似文献   
60.
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (UbV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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