首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   482872篇
  免费   6131篇
  国内免费   1851篇
化学   262015篇
晶体学   7074篇
力学   20297篇
综合类   23篇
数学   60509篇
物理学   140936篇
  2018年   4133篇
  2017年   4236篇
  2016年   6400篇
  2015年   5103篇
  2014年   6757篇
  2013年   20640篇
  2012年   17178篇
  2011年   20154篇
  2010年   12876篇
  2009年   12551篇
  2008年   17145篇
  2007年   17569篇
  2006年   16839篇
  2005年   18863篇
  2004年   16972篇
  2003年   13989篇
  2002年   12207篇
  2001年   14003篇
  2000年   10721篇
  1999年   8615篇
  1998年   6873篇
  1997年   6749篇
  1996年   6747篇
  1995年   6174篇
  1994年   5916篇
  1993年   5600篇
  1992年   6510篇
  1991年   6255篇
  1990年   5933篇
  1989年   5810篇
  1988年   6005篇
  1987年   5741篇
  1986年   5474篇
  1985年   7702篇
  1984年   7803篇
  1983年   6406篇
  1982年   6848篇
  1981年   6862篇
  1980年   6512篇
  1979年   6786篇
  1978年   6964篇
  1977年   6843篇
  1976年   6770篇
  1975年   6529篇
  1974年   6327篇
  1973年   6514篇
  1972年   3954篇
  1971年   3058篇
  1968年   3403篇
  1967年   3305篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
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.  相似文献   
43.
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.  相似文献   
44.
45.
46.
47.
48.
49.
50.
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号