全文获取类型
收费全文 | 5332篇 |
免费 | 406篇 |
国内免费 | 241篇 |
专业分类
化学 | 1386篇 |
晶体学 | 19篇 |
力学 | 408篇 |
综合类 | 137篇 |
数学 | 3005篇 |
物理学 | 1024篇 |
出版年
2024年 | 5篇 |
2023年 | 98篇 |
2022年 | 125篇 |
2021年 | 147篇 |
2020年 | 138篇 |
2019年 | 82篇 |
2018年 | 104篇 |
2017年 | 145篇 |
2016年 | 194篇 |
2015年 | 132篇 |
2014年 | 243篇 |
2013年 | 314篇 |
2012年 | 257篇 |
2011年 | 292篇 |
2010年 | 281篇 |
2009年 | 366篇 |
2008年 | 390篇 |
2007年 | 410篇 |
2006年 | 313篇 |
2005年 | 250篇 |
2004年 | 242篇 |
2003年 | 188篇 |
2002年 | 177篇 |
2001年 | 144篇 |
2000年 | 127篇 |
1999年 | 113篇 |
1998年 | 117篇 |
1997年 | 78篇 |
1996年 | 77篇 |
1995年 | 50篇 |
1994年 | 47篇 |
1993年 | 46篇 |
1992年 | 33篇 |
1991年 | 32篇 |
1990年 | 25篇 |
1989年 | 23篇 |
1988年 | 29篇 |
1987年 | 15篇 |
1986年 | 16篇 |
1985年 | 22篇 |
1984年 | 21篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 9篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有5979条查询结果,搜索用时 15 毫秒
1.
以羧甲基纤维素(CMC)、明胶和MOF(Cu)@biochar为原料,采用简单有效的冷冻干燥方法制备了(CMC/Gelatin/MOF(Cu)@biochar)杂化气凝胶,并用傅里叶变换红外光谱(FT-IR)、热重分析(TG)、X射线粉末衍射(XRD)、扫描电镜(SEM)和X射线光电子能谱(XPS)技术对其进行了表征;研究了MOF(Cu)@biochar含量、pH和不同的盐水溶液对杂化气凝胶溶胀行为的影响;以该气凝胶负载氯化铵,制备了一种新型缓释肥料(SRF),并研究了含2%(wt)SRF的沙性土壤的保水能力;SRF在土壤中第30天的累积释放率为79.4%;肥料在土壤中释放符合非Fickian扩散和阳离子交换的协同作用机理。 相似文献
2.
科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高. 相似文献
3.
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. 相似文献
4.
This paper considers the problem of building a set of hybrid abstractions for affine systems in order to compute over approximations of the reachable space. Each abstraction is based on a decomposition of the continuous state space that is defined by hyperplanes generated by linear combinations of two vectors. The choice of these vectors is based on consideration of the dynamics of the system and uses, for example, the left eigenvectors of the matrix that defines these dynamics. We show that the reachability calculus can then be performed on a combination of such abstractions and how its accuracy depends on the choice of hyperplanes that define the decomposition. 相似文献
5.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
6.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
7.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
8.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
9.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
10.
Toward Fuzzy Optimization without Mathematical Ambiguity 总被引:15,自引:0,他引:15
Baoding Liu 《Fuzzy Optimization and Decision Making》2002,1(1):43-63
Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed. 相似文献