首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   74455篇
  免费   5141篇
  国内免费   3036篇
化学   40272篇
晶体学   1167篇
力学   4242篇
综合类   222篇
数学   8223篇
物理学   28506篇
  2023年   682篇
  2022年   1267篇
  2021年   1406篇
  2020年   1459篇
  2019年   1394篇
  2018年   1571篇
  2017年   1453篇
  2016年   2190篇
  2015年   1758篇
  2014年   2396篇
  2013年   4040篇
  2012年   4408篇
  2011年   4995篇
  2010年   3508篇
  2009年   3439篇
  2008年   3895篇
  2007年   3659篇
  2006年   3424篇
  2005年   2875篇
  2004年   2447篇
  2003年   2044篇
  2002年   1913篇
  2001年   2490篇
  2000年   1926篇
  1999年   1772篇
  1998年   1373篇
  1997年   1365篇
  1996年   1179篇
  1995年   1097篇
  1994年   985篇
  1993年   858篇
  1992年   894篇
  1991年   833篇
  1990年   797篇
  1989年   693篇
  1988年   672篇
  1987年   617篇
  1986年   528篇
  1985年   604篇
  1984年   587篇
  1983年   427篇
  1982年   458篇
  1981年   424篇
  1980年   347篇
  1979年   418篇
  1978年   395篇
  1977年   412篇
  1976年   416篇
  1975年   369篇
  1973年   358篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Siberian Mathematical Journal - A lattice homomorphism between quasi-Banach lattices is known to be compact if and only if it is a sum of a series of rank one lattice...  相似文献   
12.
For an integer s0, a graph G is s-hamiltonian if for any vertex subset S?V(G) with |S|s, G?S is hamiltonian, and G is s-hamiltonian connected if for any vertex subset S?V(G) with |S|s, G?S is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of s-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for s2, a line graph L(G) is s-hamiltonian if and only if L(G) is (s+2)-connected. In this paper we prove the following.(i) For an integer s2, the line graph L(G) of a claw-free graph G is s-hamiltonian if and only if L(G) is (s+2)-connected.(ii) The line graph L(G) of a claw-free graph G is 1-hamiltonian connected if and only if L(G) is 4-connected.  相似文献   
13.
Herein, we propose the construction of a sandwich-structured host filled with continuous 2D catalysis–conduction interfaces. This MoN-C-MoN trilayer architecture causes the strong conformal adsorption of S/Li2Sx and its high-efficiency conversion on the two-sided nitride polar surfaces, which are supplied with high-flux electron transfer from the buried carbon interlayer. The 3D self-assembly of these 2D sandwich structures further reinforces the interconnection of conductive and catalytic networks. The maximized exposure of adsorptive/catalytic planes endows the MoN-C@S electrode with excellent cycling stability and high rate performance even under high S loading and low host surface area. The high conductivity of this trilayer texture does not compromise the capacity retention after the S content is increased. Such a job-synergistic mode between catalytic and conductive functions guarantees the homogeneous deposition of S/Li2Sx, and avoids thick and devitalized accumulation (electrode passivation) even after high-rate and long-term cycling.  相似文献   
14.
15.
16.
We study the full counting statistics of transport electrons through a semiconductor two-level quantum dot with Rashba spin–orbit (SO) coupling, which acts as a nonabelian gauge field and thus induces the electron transition between two levels along with the spin flip. By means of the quantum master equation approach, shot noise and skewness are obtained at finite temperature with two-body Coulomb interaction. We particularly demonstrate the crucial effect of SO coupling on the super-Poissonian fluctuation of transport electrons, in terms of which the SO coupling can be probed by the zero-frequency cumulants. While the charge currents are not sensitive to the SO coupling.  相似文献   
17.
In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.  相似文献   
18.
19.
Su  X. F.  Zhang  Y. L.  Maximov  A. L.  Zhang  K.  Xin  Q.  Feng  C. Q.  Bai  X. F.  Wu  W. 《Russian Journal of Applied Chemistry》2020,93(1):127-136
Russian Journal of Applied Chemistry - Nanoscale ZSM-5 (AlZ5-D) and Ga-substituted ZSM-5 zeolites ((Al,Ga)Z5-D and GaZ5-D) were synthesized by a green dry-gel conversion strategy. For comparison,...  相似文献   
20.
Journal of Thermal Analysis and Calorimetry - In the present work, pyrolysis kinetic mechanism was studied for regenerated cellulosic fiber (RCF) and composite RCF containing silicon/nitrogen flame...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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