首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   345848篇
  免费   5843篇
  国内免费   2535篇
化学   194258篇
晶体学   4664篇
力学   13661篇
综合类   17篇
数学   41242篇
物理学   100384篇
  2021年   2346篇
  2020年   2599篇
  2019年   2572篇
  2018年   2689篇
  2017年   2543篇
  2016年   5169篇
  2015年   4260篇
  2014年   5534篇
  2013年   16261篇
  2012年   13231篇
  2011年   16079篇
  2010年   9871篇
  2009年   9832篇
  2008年   14368篇
  2007年   14506篇
  2006年   13900篇
  2005年   12803篇
  2004年   11820篇
  2003年   10081篇
  2002年   9857篇
  2001年   10633篇
  2000年   8173篇
  1999年   6511篇
  1998年   5228篇
  1997年   5023篇
  1996年   5137篇
  1995年   4585篇
  1994年   4342篇
  1993年   4220篇
  1992年   4647篇
  1991年   4442篇
  1990年   4150篇
  1989年   3935篇
  1988年   4206篇
  1987年   3896篇
  1986年   3785篇
  1985年   5494篇
  1984年   5529篇
  1983年   4483篇
  1982年   4857篇
  1981年   4896篇
  1980年   4622篇
  1979年   4727篇
  1978年   4727篇
  1977年   4700篇
  1976年   4645篇
  1975年   4562篇
  1974年   4394篇
  1973年   4580篇
  1972年   2598篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
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.  相似文献   
42.
There are thousands of papers published every year investigating the properties and possible applications of ionic liquids. Industrial use of these exceptional fluids requires adequate understanding of their physical properties, in order to create the ionic liquid that will optimally suit the application. Computational property prediction arose from the urgent need to minimise the time and cost that would be required to experimentally test different combinations of ions. This review discusses the use of machine learning algorithms as property prediction tools for ionic liquids (either as standalone methods or in conjunction with molecular dynamics simulations), presents common problems of training datasets and proposes ways that could lead to more accurate and efficient models.

In this review article, the authors discuss the use of machine learning algorithms as tools for the prediction of physical and chemical properties of ionic liquids.  相似文献   
43.
44.
45.
46.
47.
48.
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.  相似文献   
49.
50.
Journal of Thermal Analysis and Calorimetry - The aim of this work is to synthesize and characterize a new structured silver–clay dried, calcined or sintered at different temperatures...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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