首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   46936篇
  免费   11439篇
  国内免费   3589篇
化学   49186篇
晶体学   478篇
力学   1195篇
综合类   215篇
数学   3685篇
物理学   7205篇
  2024年   19篇
  2023年   190篇
  2022年   333篇
  2021年   526篇
  2020年   1617篇
  2019年   2918篇
  2018年   1364篇
  2017年   986篇
  2016年   3868篇
  2015年   3988篇
  2014年   4037篇
  2013年   4873篇
  2012年   3945篇
  2011年   3254篇
  2010年   3614篇
  2009年   3575篇
  2008年   3254篇
  2007年   2539篇
  2006年   2168篇
  2005年   2217篇
  2004年   2014篇
  2003年   1815篇
  2002年   2677篇
  2001年   1907篇
  2000年   1697篇
  1999年   671篇
  1998年   249篇
  1997年   211篇
  1996年   206篇
  1995年   167篇
  1994年   152篇
  1993年   138篇
  1992年   97篇
  1991年   78篇
  1990年   68篇
  1989年   45篇
  1988年   52篇
  1987年   41篇
  1986年   33篇
  1985年   52篇
  1984年   38篇
  1983年   35篇
  1982年   25篇
  1981年   26篇
  1980年   26篇
  1979年   30篇
  1978年   16篇
  1977年   14篇
  1976年   18篇
  1974年   16篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
International Journal of Theoretical Physics - Quantum coherence, coming from quantum superposition, occupies a significant position in the field of physics. We put forward a lower bound of the...  相似文献   
2.
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.  相似文献   
3.
4.
The development of high‐surface‐area carbon electrodes with a defined pore size distribution and the incorporation of pseudo‐active materials to optimize the overall capacitance and conductivity without destroying the stability are at present important research areas. Composite electrodes of carbon nano‐onions (CNOs) and polypyrrole (Ppy) were fabricated to improve the specific capacitance of a supercapacitor. The carbon nanostructures were uniformly coated with Ppy by chemical polymerization or by electrochemical potentiostatic deposition to form homogenous composites or bilayers. The materials were characterized by transmission‐ and scanning electron microscopy, differential thermogravimetric analyses, FTIR spectroscopy, piezoelectric microgravimetry, and cyclic voltammetry. The composites show higher mechanical and electrochemical stabilities, with high specific capacitances of up to about 800 F g?1 for the CNOs/SDS/Ppy composites (chemical synthesis) and about 1300 F g?1 for the CNOs/Ppy bilayer (electrochemical deposition).  相似文献   
5.
A two‐step synthesis of structurally diverse pyrrole‐containing bicyclic systems is reported. ortho‐Nitro‐haloarenes coupled with vinylic N‐methyliminodiacetic acid (MIDA) boronates generate ortho‐vinyl‐nitroarenes, which undergo a “metal‐free” nitrene insertion, resulting in a new pyrrole ring. This novel synthetic approach has a wide substrate tolerance and it is applicable in the preparation of more complex “drug‐like” molecules. Interestingly, an ortho‐nitro‐allylarene derivative furnished a cyclic β‐aminophosphonate motif.  相似文献   
6.
7.
A new strategy for the synthesis of tetrahydroisoquinolines based on the Pd0‐catalyzed intramolecular α‐arylation of sulfones is reported. The combination of this Pd‐catalyzed reaction with intermolecular Michael and aza‐Michael reactions allows the development of two‐ and three‐step domino processes to synthesize diversely functionalized scaffolds from readily available starting materials.  相似文献   
8.
Enantiopure β‐amino acids represent interesting scaffolds for peptidomimetics, foldamers and bioactive compounds. However, the synthesis of highly substituted analogues is still a major challenge. Herein, we describe the spontaneous rearrangement of 4‐carboxy‐2‐oxoazepane α,α‐amino acids to lead to 2′‐oxopiperidine‐containing β2,3,3‐amino acids, upon basic or acid hydrolysis of the 2‐oxoazepane α,α‐amino acid ester. Under acidic conditions, a totally stereoselective synthetic route has been developed. The reordering process involved the spontaneous breakdown of an amide bond, which typically requires strong conditions, and the formation of a new bond leading to the six‐membered heterocycle. A quantum mechanical study was carried out to obtain insight into the remarkable ease of this rearrangement, which occurs at room temperature, either in solution or upon storage of the 4‐carboxylic acid substituted 2‐oxoazepane derivatives. This theoretical study suggests that the rearrangement process occurs through a concerted mechanism, in which the energy of the transition states can be lowered by the participation of a catalytic water molecule. Interestingly, it also suggested a role for the carboxylic acid at position 4 of the 2‐oxoazepane ring, which facilitates this rearrangement, participating directly in the intramolecular catalysis.  相似文献   
9.
10.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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