首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   116626篇
  免费   3517篇
  国内免费   2914篇
化学   51917篇
晶体学   1342篇
力学   8112篇
综合类   197篇
数学   35592篇
物理学   25897篇
  2023年   372篇
  2022年   948篇
  2021年   1132篇
  2020年   1032篇
  2019年   1073篇
  2018年   11104篇
  2017年   10975篇
  2016年   7337篇
  2015年   2184篇
  2014年   2058篇
  2013年   2960篇
  2012年   6877篇
  2011年   13650篇
  2010年   7888篇
  2009年   8090篇
  2008年   9356篇
  2007年   11102篇
  2006年   2678篇
  2005年   3367篇
  2004年   3289篇
  2003年   3420篇
  2002年   2471篇
  2001年   1230篇
  2000年   1097篇
  1999年   769篇
  1998年   639篇
  1997年   518篇
  1996年   632篇
  1995年   431篇
  1994年   376篇
  1993年   402篇
  1992年   294篇
  1991年   296篇
  1990年   230篇
  1989年   215篇
  1988年   163篇
  1987年   171篇
  1986年   139篇
  1985年   156篇
  1984年   115篇
  1983年   97篇
  1982年   120篇
  1981年   111篇
  1980年   88篇
  1979年   97篇
  1978年   86篇
  1977年   59篇
  1976年   63篇
  1975年   57篇
  1973年   64篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002  相似文献   
72.
73.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008  相似文献   
74.
The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).  相似文献   
75.
76.
We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.  相似文献   
77.
The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.  相似文献   
78.
张鹏  周印华  刘秀芬  田文晶  李敏  张国 《物理学报》2006,55(10):5494-5498
研究了不同比例的PVK与齐聚PPV衍生物DBVP掺杂体系的能量转移和发光特性.通过对PVK,DBVP及PVK:DBVP掺杂体系的UV-vis,PL和PLE光谱的研究,分析了PVK与DBVP之间的能量转移过程.利用PVK在体系中类似于溶剂的分散作用,制备了结构为ITO/PEDOT/PVK:DBVP/LiF/Al的电致发光器件,研究了掺杂体系的电致发光性能.结果表明,在掺杂体系的光致发光和电致发光中,PVK的发射被有效地抑制,PVK与DBVP之间发生了非常有效的能量转移,通过调节PVK与DBVP的比例,可以获得蓝色和绿色发光,同时可以改善器件的发光性能,当PVK与DBVP的重量比为1∶2时,器件的绿色发光效率达到1·06cd/A,此时发光亮度为52cd/m2.  相似文献   
79.
非傍轴平顶高斯光束M2因子两种定义的比较研究   总被引:3,自引:2,他引:1  
基于功率密度的二阶矩方法,推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式·研究表明,当w0/λ→0时,远场发散角趋于渐近值θmax=63.435°,与阶数无关·使用非傍轴高斯光束代替傍轴高斯光束作为理想光束,研究了非傍轴FG光束的M2因子,并与传统定义的M2因子作了比较·在非傍轴范畴,非傍轴FG光束的M2因子不仅与阶数N有关,而且与w0/λ有关·按照定义,当w0/λ→0时,非傍轴FG光束的M2因子不等于0,对阶数N=1,2,3时,M2因子分别趋于0.913,0.882和0.886·当N→∞时,M2因子取最小值M2min=0.816·  相似文献   
80.
This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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