首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   652264篇
  免费   7068篇
  国内免费   1896篇
化学   327688篇
晶体学   9040篇
力学   31200篇
综合类   14篇
数学   90470篇
物理学   202816篇
  2021年   4478篇
  2020年   4954篇
  2019年   5400篇
  2018年   12937篇
  2017年   13539篇
  2016年   13295篇
  2015年   7414篇
  2014年   10597篇
  2013年   27368篇
  2012年   23790篇
  2011年   33995篇
  2010年   22746篇
  2009年   22531篇
  2008年   30371篇
  2007年   32957篇
  2006年   21807篇
  2005年   24267篇
  2004年   20195篇
  2003年   18109篇
  2002年   16555篇
  2001年   17778篇
  2000年   13649篇
  1999年   10728篇
  1998年   8858篇
  1997年   8608篇
  1996年   8497篇
  1995年   7520篇
  1994年   7253篇
  1993年   7041篇
  1992年   7759篇
  1991年   7867篇
  1990年   7462篇
  1989年   7260篇
  1988年   7297篇
  1987年   7117篇
  1986年   6804篇
  1985年   9229篇
  1984年   9255篇
  1983年   7575篇
  1982年   7976篇
  1981年   7786篇
  1980年   7525篇
  1979年   7927篇
  1978年   8021篇
  1977年   7879篇
  1976年   7901篇
  1975年   7586篇
  1974年   7370篇
  1973年   7606篇
  1972年   4887篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
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.  相似文献   
102.
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....  相似文献   
103.
104.
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.  相似文献   
105.
106.
107.
Russian Chemical Bulletin - Quantum chemical calculations and a comparative analysis of Raman spectra of 3,4,5-triphenyl-1-propyl-1,2-diphosphole (1),...  相似文献   
108.
109.
110.
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号