首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   492617篇
  免费   9975篇
  国内免费   4285篇
化学   273623篇
晶体学   7146篇
力学   21491篇
综合类   284篇
数学   57023篇
物理学   147310篇
  2020年   3887篇
  2019年   3883篇
  2018年   4759篇
  2017年   4598篇
  2016年   7256篇
  2015年   5913篇
  2014年   7821篇
  2013年   22003篇
  2012年   17418篇
  2011年   20838篇
  2010年   13200篇
  2009年   13117篇
  2008年   18179篇
  2007年   18410篇
  2006年   17570篇
  2005年   18131篇
  2004年   16259篇
  2003年   13674篇
  2002年   12398篇
  2001年   14272篇
  2000年   11084篇
  1999年   9094篇
  1998年   7319篇
  1997年   7187篇
  1996年   7304篇
  1995年   6585篇
  1994年   6300篇
  1993年   5924篇
  1992年   6761篇
  1991年   6461篇
  1990年   6080篇
  1989年   5927篇
  1988年   6083篇
  1987年   5818篇
  1986年   5553篇
  1985年   7773篇
  1984年   7853篇
  1983年   6435篇
  1982年   6853篇
  1981年   6856篇
  1980年   6497篇
  1979年   6762篇
  1978年   6942篇
  1977年   6829篇
  1976年   6725篇
  1975年   6506篇
  1974年   6303篇
  1973年   6477篇
  1972年   3927篇
  1968年   3379篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
51.
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.  相似文献   
52.
In this communication, we report the synthesis of small‐sized (<10 nm), water‐soluble, magnetic nanoparticles (MNPs) coated with polyhedral oligomeric silsesquioxanes (POSS), which contain either polyethylene glycol (PEG) or octa(tetramethylammonium) (OctaTMA) as functional groups. The POSS‐coated MNPs exhibit superparamagnetic behavior with saturation magnetic moments (51–53 emu g?1) comparable to silica‐coated MNPs. They also provide good colloidal stability at different pH and salt concentrations, and low cytotoxicity to MCF‐7 human breast epithelial cells. The relaxivity data and magnetic resonance (MR) phantom images demonstrate the potential application of these MNPs in bioimaging.  相似文献   
53.
54.
55.
56.
57.
58.
59.
60.
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号