首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27168篇
  免费   646篇
  国内免费   162篇
化学   18262篇
晶体学   225篇
力学   690篇
综合类   1篇
数学   4539篇
物理学   4259篇
  2021年   201篇
  2020年   238篇
  2019年   313篇
  2018年   270篇
  2017年   228篇
  2016年   495篇
  2015年   378篇
  2014年   497篇
  2013年   1415篇
  2012年   1256篇
  2011年   1590篇
  2010年   829篇
  2009年   677篇
  2008年   1453篇
  2007年   1485篇
  2006年   1480篇
  2005年   1475篇
  2004年   1275篇
  2003年   1077篇
  2002年   1042篇
  2001年   373篇
  2000年   306篇
  1999年   246篇
  1998年   296篇
  1997年   316篇
  1996年   401篇
  1995年   306篇
  1994年   290篇
  1993年   289篇
  1992年   277篇
  1991年   246篇
  1990年   227篇
  1989年   243篇
  1988年   274篇
  1987年   254篇
  1986年   248篇
  1985年   389篇
  1984年   438篇
  1983年   325篇
  1982年   431篇
  1981年   408篇
  1980年   344篇
  1979年   334篇
  1978年   352篇
  1977年   336篇
  1976年   279篇
  1975年   273篇
  1974年   264篇
  1973年   239篇
  1972年   143篇
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
81.
The present paper deals with the study of a Durrmeyer-type integral modification of certain modified Baskakov operators. Here we study simultaneous approximation properties for these operators by using the iterative combinations. We obtain an asymptotic formula and an error estimation in terms of higher order modulus of continuity for these operators.   相似文献   
82.
83.
A Generalized Optical Logic Element or GOLE is device that performs any of the 16 Boolean logic operations on signals in an optical beam with very fast switching among functions. The advantages of a generalized or universal gate in manufacturing are obvious. Extremely flexible functioning becomes possible if the GOLE functionality is switched in response to earlier computations. Likewise Field Programmable Gate Arrays or FPGAs can be used to fix the GOLE functions, making one of the most powerful and flexible processor units ever designed - called a Field GOLE. Such systems can be made in bulk optics to utilize Spatial Light Modulator or SLM capabilities, but integrated optics on silicon will be the choice for most applications. GOLEs can be generalized in several ways to become Fredkin gates and generalized Fredkin gates. They can also be cascaded similarly to electronic gates.  相似文献   
84.
85.
It is proved that for finite groups G, the probability thattwo randomly chosen elements of G generate a soluble subgrouptends to zero as the index of the largest soluble normal subgroupof G tends to infinity.  相似文献   
86.
In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation.  相似文献   
87.
E. P. Wigner's argument that the probability of the existence of self-reproducing units, e.g., organisms, is zero according to standard quantum theory is stated and analyzed. Theorems are presented which indicate that Wigner's mathematical result in fact should not be interpreted as asserting the improbability of self-reproducing units.  相似文献   
88.
The synthesis of the title compounds has been achieved in concise, highly regiocontrolled fashion from commercially available (+)-sclareolide. In addition, we offer evidence that the structure of a newly reported natural product from Zingiber ottensii is incorrect.  相似文献   
89.
90.
John Ginsburg 《Order》1989,6(2):137-157
For a partially ordered setP and an elementx ofP, a subsetS ofP is called a cutset forx inP if every element ofS is noncomparable tox and every maximal chain ofP meets {x}∪S. We letc(P) denote the smallest integerk such that every elementx ofP has a cutsetS with ‖S‖?k: Ifc(P)?n we say thatP has then-cutset property. Our results bear on the following question: givenP, what is the smallestn such thatP can be embedded in a partially ordered set having then-cutset property? As usual, 2 n denotes the Boolean lattice of all subsets of ann-element set, andB n denotes the set of atoms and co-atoms of 2 n . We establish the following results: (i) a characterization, by means of forbidden configurations, of whichP can be embedded in a partially ordered set having the 1-cutset property; (ii) ifP contains a copy of 2 n , thenc(P)?2[n/2]?1; (iii) for everyn>3 there is a partially ordered setP containing 2 n such thatc(P)<c(2 n ); (iv) for every positive integern there is a positive integerN such that, ifB m is contained in a partially ordered set having then-cutset property, thenm?N.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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