首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   586366篇
  免费   7091篇
  国内免费   1898篇
化学   307346篇
晶体学   8847篇
力学   26264篇
综合类   14篇
数学   71611篇
物理学   181273篇
  2021年   4521篇
  2020年   4966篇
  2019年   5409篇
  2018年   6806篇
  2017年   6911篇
  2016年   10524篇
  2015年   6795篇
  2014年   10533篇
  2013年   27343篇
  2012年   20826篇
  2011年   25355篇
  2010年   17512篇
  2009年   17329篇
  2008年   22887篇
  2007年   23184篇
  2006年   21721篇
  2005年   19265篇
  2004年   17787篇
  2003年   15733篇
  2002年   15583篇
  2001年   17693篇
  2000年   13458篇
  1999年   10723篇
  1998年   8845篇
  1997年   8612篇
  1996年   8404篇
  1995年   7473篇
  1994年   7218篇
  1993年   7016篇
  1992年   7743篇
  1991年   7824篇
  1990年   7434篇
  1989年   7223篇
  1988年   7254篇
  1987年   7070篇
  1986年   6767篇
  1985年   9189篇
  1984年   9321篇
  1983年   7651篇
  1982年   8068篇
  1981年   7848篇
  1980年   7600篇
  1979年   7951篇
  1978年   8035篇
  1977年   7952篇
  1976年   7925篇
  1975年   7643篇
  1974年   7403篇
  1973年   7633篇
  1972年   4931篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
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.  相似文献   
82.
Russian Journal of General Chemistry - 8-Phenyltetrazolo[5,1-b][1,3,4]thiadiazepine was obtained as a result of intermolecular cyclization of 1-amino-1H-tetrazole-5-thiol and 3-phenyl-2-propynal....  相似文献   
83.
84.
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.  相似文献   
85.
86.
87.
Russian Chemical Bulletin - Quantum chemical calculations and a comparative analysis of Raman spectra of 3,4,5-triphenyl-1-propyl-1,2-diphosphole (1),...  相似文献   
88.
89.
90.
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号