首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   43468篇
  免费   790篇
  国内免费   418篇
化学   20009篇
晶体学   309篇
力学   1684篇
综合类   13篇
数学   11807篇
物理学   10854篇
  2023年   138篇
  2022年   216篇
  2021年   363篇
  2020年   436篇
  2019年   506篇
  2018年   1550篇
  2017年   1709篇
  2016年   1290篇
  2015年   1091篇
  2014年   997篇
  2013年   1529篇
  2012年   4141篇
  2011年   3520篇
  2010年   2438篇
  2009年   2070篇
  2008年   1429篇
  2007年   1399篇
  2006年   1403篇
  2005年   5131篇
  2004年   4461篇
  2003年   2736篇
  2002年   903篇
  2001年   519篇
  2000年   256篇
  1999年   356篇
  1998年   263篇
  1997年   232篇
  1996年   208篇
  1995年   183篇
  1994年   156篇
  1993年   121篇
  1992年   254篇
  1991年   230篇
  1990年   199篇
  1989年   147篇
  1988年   144篇
  1987年   104篇
  1986年   87篇
  1985年   108篇
  1984年   89篇
  1983年   65篇
  1982年   77篇
  1981年   67篇
  1979年   70篇
  1978年   70篇
  1977年   60篇
  1976年   129篇
  1975年   64篇
  1974年   77篇
  1973年   78篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
43.
44.
Dukhovny  Alexander 《Queueing Systems》1997,27(3-4):351-366
We consider systems of GI/M/1 type with bulk arrivals, bulk service and exponential server vacations. The generating functions of the steady-state probabilities of the embedded Markov chain are found in terms of Riemann boundary value problems, a necessary and sufficient condition of ergodicity is proved. Explicit formulas are obtained for the case where the generating function of the arrival group size is rational. Resonance between the vacation rate and the system is studied. Complete formulas are given for the cases of single and geometric arrivals. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
45.
The classical Yang–Baxter equation(CYBE) is an algebraic equation central in the theory of integrable systems. Its nondegenerate solutions were classified by Belavin and Drinfeld. Quantization of CYBE led to the theory of quantum groups. A geometric interpretation of CYBE was given by Drinfeld and gave rise to the theory of Poisson–Lie groups. The classical dynamical Yang–Baxter equation (CDYBE) is an important differential equation analogous to CYBE and introduced by Felder as the consistency condition for the differential Knizhnik–Zamolodchikov–Bernard equations for correlation functions in conformal field theory on tori. Quantization of CDYBE allowed Felder to introduce an interesting elliptic analog of quantum groups. It becomes clear that numerous important notions and results connected with CYBE have dynamical analogs. In this paper we classify solutions to CDYBE and give geometric interpretation to CDYBE. The classification and interpretation are remarkably analogous to the Belavin–Drinfeld picture. Received: 24 March 1997 / Accepted: 20 June 1997  相似文献   
46.
Properties of the unions of sampling and interpolation sets for Bergman spaces are discussed in conjunction with the examples given by Seip (1993). Their relationship to the classical interpolation sequences is explored. In addition, the role played by canonical divisors in the study of these sets is examined and an example of a sampling set is constructed in the disk.

  相似文献   

47.
We consider the question of factorizability in tensor product spaces, and argue that the correlations associated with entangled states are even more problematic in the general case involving any tensor product of Hilbert spaces, than in the Einstein, Podolsky, and Rosen case with only two [1].  相似文献   
48.
49.
An assembly of cation receptor 1 and anion receptor 2 via the hydrogen bonding melamine-barbiturate structural motif complexes sodium thiocyanate, sodium iodide, and sodium azide in apolar solvents.  相似文献   
50.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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