首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84958篇
  免费   599篇
  国内免费   413篇
化学   28790篇
晶体学   811篇
力学   6898篇
数学   33174篇
物理学   16297篇
  2023年   57篇
  2022年   64篇
  2021年   191篇
  2020年   163篇
  2019年   164篇
  2018年   10501篇
  2017年   10319篇
  2016年   6289篇
  2015年   1084篇
  2014年   551篇
  2013年   670篇
  2012年   4180篇
  2011年   10930篇
  2010年   5888篇
  2009年   6260篇
  2008年   6944篇
  2007年   9083篇
  2006年   541篇
  2005年   1609篇
  2004年   1784篇
  2003年   2149篇
  2002年   1225篇
  2001年   340篇
  2000年   370篇
  1999年   235篇
  1998年   256篇
  1997年   226篇
  1996年   263篇
  1995年   185篇
  1994年   147篇
  1993年   141篇
  1992年   103篇
  1991年   103篇
  1990年   83篇
  1989年   89篇
  1988年   93篇
  1987年   102篇
  1986年   98篇
  1985年   93篇
  1984年   75篇
  1982年   80篇
  1981年   75篇
  1980年   76篇
  1979年   70篇
  1978年   68篇
  1964年   96篇
  1963年   134篇
  1962年   161篇
  1961年   143篇
  1960年   144篇
排序方式: 共有10000条查询结果,搜索用时 21 毫秒
101.
 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I 5 E 1 is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I 5 E 1 cannot prove the MRDP theorem. On the other hand it is shown that I 1 E 1 proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I 0 E 1 proves 𝒟 contains all predicates of the form (∀ib)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity  相似文献   
102.
103.
 This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉab) for which there is an ω-maximal automorphism mapping ˉa to ˉb. Received: 12 December 2001 / Published online: 10 October 2002 Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture' Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57 Key words or phrases: Automorphism – Recursively saturated structure  相似文献   
104.
This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.  相似文献   
105.
106.
A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method.  相似文献   
107.
A novel super-hydrophobic stearic acid (STA) film with a water contact angle of 166o was prepared by chemical adsorption on aluminum wafer coated with polyethyleneimine (PEI) film. The micro-tribological behavior of the super-hydrophobic STA monolayer was compared with that of the polished and PEI-coated Al surfaces. The effect of relative humidity on the adhesion and friction was investigated as well. It was found that the STA monolayer showed decreased friction, while the adhesive force was greatly decreased by increasing the surface roughness of the Al wafer to reduce the contact area between the atomic force microscope (AFM) tip and the sample surface to be tested. Thus the friction and adhesion of the Al wafer was effectively decreased by generating the STA monolayer, which indicated that it could be feasible and rational to prepare a surface with good adhesion resistance and lubricity by properly controlling the surface morphology and the chemical composition. Both the adhesion and friction decreased as the relative humidity was lowered from 65% to 10%, though the decrease extent became insignificant for the STA monolayer. The project supported by the National Natural Science Foundation of China (50375151, 50323007, 10225209) and the Chinese Academy of Sciences (KJCX-SW-L2)  相似文献   
108.
We carried out detailed calculations for photorefractive wave-mixing switches based on one of three crystals with high electro-optic coefficients, namely, BaTiO3, Strontium Barium Niobate (SBN (0.75)), and Potasium Sodium Strontium Barium Niobate (KNSBN). A comparison of results for the three crystals shows that a 0_-cut BaTiO3 crystal is suitable for a longitudinal switch and requires a voltage of about 80 for a 2-mm-thick crystal to induce sufficient phase mismatch. The electrodes must be transparent for the incident and diffracted beams. A 45_-cut SBN (0.75) crystal, however, is suitable for a lateral switch and requires a voltage of about 150 for a 1-mm-wide crystal. The electrodes do not need to be transparent.  相似文献   
109.
110.
The errata concern mainly the last computations for the universality of the local statistics of eigenvalues at the edge of the spectrum in parts (iii) of Theorems 2.3 and 2.4.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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