全文获取类型
收费全文 | 10642篇 |
免费 | 1258篇 |
国内免费 | 511篇 |
专业分类
化学 | 792篇 |
晶体学 | 13篇 |
力学 | 1305篇 |
综合类 | 381篇 |
数学 | 7067篇 |
物理学 | 2853篇 |
出版年
2024年 | 18篇 |
2023年 | 108篇 |
2022年 | 238篇 |
2021年 | 293篇 |
2020年 | 226篇 |
2019年 | 246篇 |
2018年 | 263篇 |
2017年 | 393篇 |
2016年 | 491篇 |
2015年 | 337篇 |
2014年 | 636篇 |
2013年 | 685篇 |
2012年 | 550篇 |
2011年 | 648篇 |
2010年 | 516篇 |
2009年 | 674篇 |
2008年 | 703篇 |
2007年 | 714篇 |
2006年 | 599篇 |
2005年 | 559篇 |
2004年 | 447篇 |
2003年 | 392篇 |
2002年 | 378篇 |
2001年 | 329篇 |
2000年 | 289篇 |
1999年 | 269篇 |
1998年 | 221篇 |
1997年 | 208篇 |
1996年 | 182篇 |
1995年 | 141篇 |
1994年 | 99篇 |
1993年 | 103篇 |
1992年 | 86篇 |
1991年 | 42篇 |
1990年 | 56篇 |
1989年 | 32篇 |
1988年 | 34篇 |
1987年 | 27篇 |
1986年 | 36篇 |
1985年 | 33篇 |
1984年 | 34篇 |
1983年 | 11篇 |
1982年 | 18篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
1.
2.
科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高. 相似文献
3.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
4.
João Marcos G. Barbosa Milenna K. Fernandes Rodrigues Lurian C. David Taynara C. e Silva Danielly A. Fortuna Lima Naiara Z. Pereira Emmanuel B. D'Alessandro Anselmo E. de Oliveira Paulo H. Jorge da Cunha Maria Clorinda S. Fioravanti Nelson R. Antoniosi Filho 《Biomedical chromatography : BMC》2020,34(11):e4935
An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication. 相似文献
5.
Greg Orosi 《商业与工业应用随机模型》2015,31(4):515-527
In this work, we suggest a novel quadratic programming‐based algorithm to generate an arbitrage‐free call option surface. The empirical performance of the proposed method is evaluated using S&P 500 Index call options. Our results indicate that the proposed method provides a more precise fit to observed option prices than other alternative methodologies. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
6.
In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively. 相似文献
7.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
8.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
9.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献
10.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献