全文获取类型
收费全文 | 27593篇 |
免费 | 4740篇 |
国内免费 | 2857篇 |
专业分类
化学 | 18351篇 |
晶体学 | 269篇 |
力学 | 1922篇 |
综合类 | 218篇 |
数学 | 3413篇 |
物理学 | 11017篇 |
出版年
2024年 | 106篇 |
2023年 | 592篇 |
2022年 | 1067篇 |
2021年 | 1051篇 |
2020年 | 1102篇 |
2019年 | 1043篇 |
2018年 | 974篇 |
2017年 | 920篇 |
2016年 | 1345篇 |
2015年 | 1303篇 |
2014年 | 1540篇 |
2013年 | 2062篇 |
2012年 | 2426篇 |
2011年 | 2448篇 |
2010年 | 1640篇 |
2009年 | 1595篇 |
2008年 | 1740篇 |
2007年 | 1497篇 |
2006年 | 1371篇 |
2005年 | 1162篇 |
2004年 | 864篇 |
2003年 | 693篇 |
2002年 | 621篇 |
2001年 | 518篇 |
2000年 | 518篇 |
1999年 | 630篇 |
1998年 | 528篇 |
1997年 | 522篇 |
1996年 | 488篇 |
1995年 | 464篇 |
1994年 | 385篇 |
1993年 | 345篇 |
1992年 | 285篇 |
1991年 | 251篇 |
1990年 | 239篇 |
1989年 | 186篇 |
1988年 | 145篇 |
1987年 | 124篇 |
1986年 | 93篇 |
1985年 | 94篇 |
1984年 | 63篇 |
1983年 | 50篇 |
1982年 | 52篇 |
1981年 | 22篇 |
1980年 | 12篇 |
1979年 | 4篇 |
1976年 | 1篇 |
1959年 | 1篇 |
1957年 | 7篇 |
1936年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
Zhengcheng Wang Shangyan Zhou Wei Liao Qian Zhou Meida Chen Jin Long Prof. Qingmei Wang 《Chemistry (Weinheim an der Bergstrasse, Germany)》2022,28(66):e202201987
The designs of efficient and inexpensive Pt-based catalysts for methanol oxidation reaction (MOR) are essential to boost the commercialization of direct methanol fuel cells. Here, the highly catalytic performance PtFe alloys supported on multiwalled carbon nanotubes (MWCNTs) decorating nitrogen-doped carbon (NC) have been successfully prepared via co-engineering of the surface composition and electronic structure. The Pt1Fe3@NC/MWCNTs catalyst with moderate Fe3+ feeding content (0.86 mA/mgPt) exhibits 2.26-fold enhancement in MOR mass activity compared to pristine Pt/C catalyst (0.38 mA/mgPt). Furthermore, the CO oxidation initial potential of Pt1Fe3@NC/MWCNTs catalyst is lower relative to Pt/C catalyst (0.71 V and 0.80 V). Benefited from the optimal surface compositions, the anti-corrosion ability of MWCNT, strong electron interaction between PtFe alloys and MWCNTs and the N-doped carbon (NC) layer, the Pt1Fe3@NC/MWCNTs catalyst presents an improved MOR performance and anti-CO poisoning ability. This study would open up new perspective for designing efficient electrocatalysts for the DMFCs field. 相似文献
3.
Wang Rong Li Xu Zhou Youshi Cao Shuxuan Xu Honghao Han Wenjuan Zhang Yuxia Liu Junhai 《Journal of Russian Laser Research》2022,43(4):476-481
Journal of Russian Laser Research - We demonstrate a passively-mode-locked Pr3+: LuLiF4 laser operated at the 604 nm orange wave-length, using monolayer graphene as a saturable absorber. The... 相似文献
4.
Designs, Codes and Cryptography - Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial... 相似文献
5.
In this paper, we study vanishing and splitting results on a complete smooth metric measure space \((M^n,g,\mathrm {e}^{-f}\mathrm {d}v)\) with various negative m-Bakry-Émery Ricci curvature lower bounds in terms of the first eigenvalue \(\lambda _1(\Delta _f)\) of the weighted Laplacian \(\Delta _f\), i.e., \(\mathrm {Ric}_{m,n}\ge -a\lambda _1(\Delta _f)-b\) for \(0<a\le \dfrac{m}{m-1}, b\ge 0\). In particular, we consider three main cases for different a and b with or without conditions on \(\lambda _1(\Delta _f)\). These results are extensions of Dung and Vieira, and weighted generalizations of Li-Wang, Dung-Sung, and Vieira.
相似文献6.
For an integer , a graph is -hamiltonian if for any vertex subset with , is hamiltonian, and is -hamiltonian connected if for any vertex subset with , 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 -hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for , a line graph is -hamiltonian if and only if is -connected. In this paper we prove the following.(i) For an integer , the line graph of a claw-free graph is -hamiltonian if and only if is -connected.(ii) The line graph of a claw-free graph is 1-hamiltonian connected if and only if is 4-connected. 相似文献
7.
Rongrong Li Hongjie Peng Qingping Wu Xuejun Zhou Jiang He Hangjia Shen Minghui Yang Chilin Li 《Angewandte Chemie (Weinheim an der Bergstrasse, Germany)》2020,132(29):12227-12236
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. 相似文献
8.
An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows 下载免费PDF全文
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. 相似文献
9.
10.