首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1999篇
  免费   211篇
  国内免费   153篇
化学   191篇
晶体学   6篇
力学   354篇
综合类   52篇
数学   1041篇
物理学   719篇
  2023年   10篇
  2022年   23篇
  2021年   31篇
  2020年   50篇
  2019年   36篇
  2018年   37篇
  2017年   44篇
  2016年   50篇
  2015年   47篇
  2014年   95篇
  2013年   165篇
  2012年   109篇
  2011年   129篇
  2010年   86篇
  2009年   132篇
  2008年   134篇
  2007年   132篇
  2006年   114篇
  2005年   101篇
  2004年   95篇
  2003年   90篇
  2002年   82篇
  2001年   68篇
  2000年   57篇
  1999年   58篇
  1998年   44篇
  1997年   50篇
  1996年   43篇
  1995年   39篇
  1994年   33篇
  1993年   23篇
  1992年   24篇
  1991年   16篇
  1990年   12篇
  1989年   13篇
  1988年   15篇
  1987年   5篇
  1986年   10篇
  1985年   12篇
  1984年   7篇
  1983年   4篇
  1982年   5篇
  1981年   6篇
  1980年   5篇
  1979年   5篇
  1978年   4篇
  1976年   3篇
  1973年   2篇
  1972年   2篇
  1959年   2篇
排序方式: 共有2363条查询结果,搜索用时 171 毫秒
31.
The dispersion characteristic of the plasma-loaded relativistic backward wave oscillator has been analyzed. The theoretical model has been established and the numerical calculations accord with the experimental results, which provides some useful suggestions on the designing of slow-wave structure of BWO.  相似文献   
32.
We give a recursive method for building X p (a,b) for each prime p. Arnold’s triangle is composed of positive integers: for a>1 and 0<b<a, X p (a,b) is the degree of the highest power of p dividing the difference of the binomial coefficients C pa pb C a b .   相似文献   
33.
We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail several relevant examples. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
34.
We consider a four-dimensional generalization of Hess–Appel’rot system and costruct its Lax pair. Both classical and algebro-geometric integration procedure are proceeded. The algebro-geometric integration is based on deep facts from geometry of Prym varieties such as the Mumford relation and Mumford-Dalalyan theory. The integration is similar to the integration of Lagrange bitop which has recetly been performed by the authors.  相似文献   
35.
In this paper we evaluate methods for calculating dispersion relations for waves with wavelengths of the order of hundreds of nanometres propagating in square waveguides with imperfectly conducting walls. The methods considered here are based on those used previously for rectangular dielectric waveguides.  相似文献   
36.
Curran猜想的解答   总被引:2,自引:0,他引:2  
班桂宁  班桂林 《数学进展》1996,25(2):159-162
本文确定了能作为有限群自同构群的P-群的最佳下最,彻底解决了Curran在1989年提出的关于此最佳下界的三个猜想。  相似文献   
37.
孟现磊  于肇贤 《光子学报》1996,25(6):496-500
本文构造了双参数变形玻色湮没算符高次幂a'k(k≥3)的k个正交归一木征态的数学结构,发现它们能构成一个完备的Hilbert空间,并且讨论了它们的量子统计性质.  相似文献   
38.
Interdiffusion coefficient have been measured for 1,1,2,2-tetrabromoethane in 21 organic solvents in order to ascertain the influence of shape, size, viscosity, nature and degree of branching, of the solvent molecules on transport properties. None of the existing correlations for diffusion in binary liquid systems appear to fit all the experimental data. Steric effects due to the solvent molecules are shown to be very important in the interpretation of the diffusion process.  相似文献   
39.
For an arbitrary poset P, subposets {P i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.  相似文献   
40.
The differential equations and the boundary conditions for the nonequilibrium binary distribution function of an unsymmetrical binary electrolyte are derived from the Ebeling-Falkenhagen continuity equation. The connection between the Onsager reciprocal relation and the binary distribution functions is shown. Further, Feistel's result for thec logc contribution to the conductance is extended to unsymmetrical binary electrolytes. The reason for the difference between Feistel's and Chen'sc logc term is explained, and the significance of Onsager's reciprocal relation for the calculation ofc logc and higher-concentration contributions of the conductance is discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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