首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   414853篇
  免费   5510篇
  国内免费   1473篇
化学   209433篇
晶体学   5264篇
力学   19951篇
综合类   7篇
数学   71209篇
物理学   115972篇
  2020年   2359篇
  2019年   2248篇
  2018年   12230篇
  2017年   11997篇
  2016年   10317篇
  2015年   4621篇
  2014年   5363篇
  2013年   15789篇
  2012年   15310篇
  2011年   24360篇
  2010年   14225篇
  2009年   14394篇
  2008年   19679篇
  2007年   21833篇
  2006年   13505篇
  2005年   13339篇
  2004年   12248篇
  2003年   11383篇
  2002年   10272篇
  2001年   10834篇
  2000年   8429篇
  1999年   6610篇
  1998年   5379篇
  1997年   5187篇
  1996年   5389篇
  1995年   4864篇
  1994年   4617篇
  1993年   4511篇
  1992年   4898篇
  1991年   4643篇
  1990年   4367篇
  1989年   4150篇
  1988年   4429篇
  1987年   4089篇
  1986年   3953篇
  1985年   5725篇
  1984年   5791篇
  1983年   4736篇
  1982年   5119篇
  1981年   5160篇
  1980年   4908篇
  1979年   4996篇
  1978年   5017篇
  1977年   4954篇
  1976年   4894篇
  1975年   4765篇
  1974年   4606篇
  1973年   4800篇
  1972年   2693篇
  1971年   2010篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
32.
33.
Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L9(34) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded.  相似文献   
34.
35.
36.
37.
A tertiary hydroxy group α to a carboxyl moiety comprises a key structural motif in many bioactive substances. With the herein presented metal‐free rearrangement of imides triggered by hypervalent λ3‐iodane, an easy and selective way to gain access to such a compound class, namely α,α‐disubstituted‐α‐hydroxy carboxylamides, was established. Their additional methylene bromide side chain constitutes a useful handle for rapid diversification, as demonstrated by a series of further functionalizations. Moreover, the in situ formation of an iodine(III) species under the reaction conditions was proven. Our findings clearly corroborate that hypervalent λ3‐benziodoxolones are involved in these organocatalytic reactions.  相似文献   
38.
39.
40.
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号