首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   348189篇
  免费   10702篇
  国内免费   5366篇
化学   194851篇
晶体学   4697篇
力学   15377篇
综合类   292篇
数学   40589篇
物理学   108451篇
  2021年   2866篇
  2020年   3417篇
  2019年   3310篇
  2018年   3170篇
  2017年   2984篇
  2016年   5531篇
  2015年   4886篇
  2014年   6443篇
  2013年   16511篇
  2012年   13789篇
  2011年   16578篇
  2010年   10469篇
  2009年   10425篇
  2008年   14701篇
  2007年   14685篇
  2006年   14220篇
  2005年   12716篇
  2004年   11279篇
  2003年   9909篇
  2002年   9665篇
  2001年   10839篇
  2000年   8498篇
  1999年   6879篇
  1998年   5576篇
  1997年   5379篇
  1996年   5432篇
  1995年   4964篇
  1994年   4636篇
  1993年   4358篇
  1992年   4837篇
  1991年   4608篇
  1990年   4300篇
  1989年   4059篇
  1988年   4320篇
  1987年   3949篇
  1986年   3827篇
  1985年   5465篇
  1984年   5492篇
  1983年   4447篇
  1982年   4810篇
  1981年   4828篇
  1980年   4561篇
  1979年   4673篇
  1978年   4612篇
  1977年   4590篇
  1976年   4560篇
  1975年   4451篇
  1974年   4317篇
  1973年   4486篇
  1972年   2532篇
排序方式: 共有10000条查询结果,搜索用时 93 毫秒
41.
42.
43.
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.  相似文献   
44.
A strategy based on covalent organic frameworks for ultrafast ion transport involves designing an ionic interface to mediate ion motion. Electrolyte chains were integrated onto the walls of one-dimensional channels to construct ionic frameworks via pore surface engineering, so that the ionic interface can be systematically tuned at the desired composition and density. This strategy enables a quantitative correlation between interface and ion transport and unveils a full picture of managing ionic interface to achieve high-rate ion transport. Moreover, the effect of interfaces was scaled on ion transport; ion mobility is increased in an exponential mode with the ionic interface. This strategy not only sets a benchmark system but also offers a general guidance for designing ionic interface that is key to systems for energy conversion and storage.  相似文献   
45.
46.
47.
48.
49.
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.  相似文献   
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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