首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   44855篇
  免费   9687篇
  国内免费   1421篇
化学   47098篇
晶体学   329篇
力学   600篇
综合类   1篇
数学   4372篇
物理学   3563篇
  2021年   185篇
  2020年   1285篇
  2019年   2629篇
  2018年   1053篇
  2017年   677篇
  2016年   3467篇
  2015年   3602篇
  2014年   3544篇
  2013年   4360篇
  2012年   3119篇
  2011年   2347篇
  2010年   2961篇
  2009年   2926篇
  2008年   2568篇
  2007年   1947篇
  2006年   1654篇
  2005年   1798篇
  2004年   1627篇
  2003年   1504篇
  2002年   2162篇
  2001年   1480篇
  2000年   1376篇
  1999年   461篇
  1998年   175篇
  1997年   172篇
  1996年   137篇
  1995年   143篇
  1994年   151篇
  1993年   168篇
  1992年   161篇
  1991年   148篇
  1990年   145篇
  1989年   169篇
  1988年   162篇
  1987年   166篇
  1986年   143篇
  1985年   253篇
  1984年   219篇
  1983年   151篇
  1982年   193篇
  1981年   175篇
  1980年   226篇
  1979年   218篇
  1978年   222篇
  1977年   254篇
  1976年   204篇
  1975年   192篇
  1974年   153篇
  1973年   200篇
  1971年   105篇
排序方式: 共有10000条查询结果,搜索用时 886 毫秒
1.
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.  相似文献   
2.
3.
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).  相似文献   
4.
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.  相似文献   
5.
6.
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.  相似文献   
7.
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.  相似文献   
8.
9.
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.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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