首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   796篇
  免费   31篇
  国内免费   2篇
化学   566篇
晶体学   2篇
力学   13篇
数学   73篇
物理学   175篇
  2021年   5篇
  2020年   16篇
  2019年   11篇
  2018年   9篇
  2017年   12篇
  2016年   19篇
  2015年   19篇
  2014年   19篇
  2013年   35篇
  2012年   38篇
  2011年   49篇
  2010年   21篇
  2009年   10篇
  2008年   44篇
  2007年   60篇
  2006年   44篇
  2005年   37篇
  2004年   21篇
  2003年   21篇
  2002年   24篇
  2001年   15篇
  2000年   22篇
  1999年   9篇
  1998年   6篇
  1997年   6篇
  1996年   12篇
  1995年   13篇
  1994年   14篇
  1993年   6篇
  1992年   11篇
  1991年   14篇
  1990年   5篇
  1989年   7篇
  1988年   6篇
  1986年   5篇
  1985年   11篇
  1984年   9篇
  1983年   6篇
  1982年   11篇
  1981年   9篇
  1980年   10篇
  1979年   7篇
  1978年   6篇
  1977年   14篇
  1976年   7篇
  1975年   15篇
  1974年   7篇
  1973年   9篇
  1972年   6篇
  1966年   3篇
排序方式: 共有829条查询结果,搜索用时 15 毫秒
41.
42.
The truncated Newton algorithm was devised by Dembo and Steihaug (Ref. 1) for solving large sparse unconstrained optimization problems. When far from a minimum, an accurate solution to the Newton equations may not be justified. Dembo's method solves these equations by the conjugate direction method, but truncates the iteration when a required degree of accuracy has been obtained. We present favorable numerical results obtained with the algorithm and compare them with existing codes for large-scale optimization.  相似文献   
43.
44.
45.
46.
47.
Induction of decision trees via evolutionary programming   总被引:1,自引:0,他引:1  
Decision trees have been used extensively in cheminformatics for modeling various biochemical endpoints including receptor-ligand binding, ADME properties, environmental impact, and toxicity. The traditional approach to inducing decision trees based upon a given training set of data involves recursive partitioning which selects partitioning variables and their values in a greedy manner to optimize a given measure of purity. This methodology has numerous benefits including classifier interpretability and the capability of modeling nonlinear relationships. The greedy nature of induction, however, may fail to elucidate underlying relationships between the data and endpoints. Using evolutionary programming, decision trees are induced which are significantly more accurate than trees induced by recursive partitioning. Furthermore, when assessed on previously unseen data in a 10-fold cross-validated manner, evolutionary programming induced trees exhibit a significantly higher accuracy on previously unseen data. This methodology is compared to single-tree and multiple-tree recursive partitioning in two domains (aerobic biodegradability and hepatotoxicity) and shown to produce less complex classifiers with average increases in predictive accuracy of 5-10% over the traditional method.  相似文献   
48.
We compute the rapidity distribution of the virtual photon produced in the Drell-Yan process through next-to-next-to-leading order in perturbative QCD. We introduce a powerful new method for calculating differential distributions in hard scattering processes. This method is based upon a generalization of the optical theorem; it allows the integration-by-parts technology developed for multiloop diagrams to be applied to noninclusive phase-space integrals, and permits a high degree of automation. We apply our results to the analysis of fixed-target experiments.  相似文献   
49.
Cr(III) complexes of tridentate SNS ligands have been prepared and evaluated as catalysts for ethylene trimerization, with several giving very high activity and excellent selectivity toward 1-hexene when activated with methylaluminoxane. The new complexes illustrate the potential of sulfur-based ligands on early transition metals for catalysis.  相似文献   
50.
Described herein is the semiautomated preparation of a 20-member aminomethyl-substituted biaryl library. The two-step solution-phase synthesis was achieved via sequential N-alkylation of various amines with either 3- or 4-bromobenzyl bromide and Suzuki cross-coupling of the resultant aryl bromides with various boronic acids.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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