首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   562426篇
  免费   7398篇
  国内免费   2172篇
化学   307014篇
晶体学   8391篇
力学   23533篇
综合类   14篇
数学   68321篇
物理学   164723篇
  2020年   3882篇
  2019年   4063篇
  2018年   4515篇
  2017年   4306篇
  2016年   7865篇
  2015年   5945篇
  2014年   8392篇
  2013年   25437篇
  2012年   18585篇
  2011年   23272篇
  2010年   14768篇
  2009年   14594篇
  2008年   21027篇
  2007年   21322篇
  2006年   20404篇
  2005年   18885篇
  2004年   16897篇
  2003年   15076篇
  2002年   14738篇
  2001年   16265篇
  2000年   12595篇
  1999年   10106篇
  1998年   8393篇
  1997年   8223篇
  1996年   8056篇
  1995年   7499篇
  1994年   7096篇
  1993年   6930篇
  1992年   7653篇
  1991年   7583篇
  1990年   7075篇
  1989年   6955篇
  1988年   7135篇
  1987年   6899篇
  1986年   6593篇
  1985年   9368篇
  1984年   9603篇
  1983年   7913篇
  1982年   8699篇
  1981年   8497篇
  1980年   8282篇
  1979年   8328篇
  1978年   8671篇
  1977年   8467篇
  1976年   8517篇
  1975年   8081篇
  1974年   7928篇
  1973年   8378篇
  1972年   5125篇
  1971年   3900篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
52.
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.  相似文献   
53.
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,...  相似文献   
54.
55.
The results of investigation of optical image detectors designed for the largest problem, near-VUV, range of the spectrum are presented. The possibility of using a dual-stage image detection system to appreciably lower the sensitivity threshold and make computer data processing feasible is considered. The integration of a UV module into a wideband image detector is studied.  相似文献   
56.
57.
58.
59.
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.  相似文献   
60.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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