全文获取类型
收费全文 | 13424篇 |
免费 | 2425篇 |
国内免费 | 1271篇 |
专业分类
化学 | 3298篇 |
晶体学 | 221篇 |
力学 | 3374篇 |
综合类 | 172篇 |
数学 | 2567篇 |
物理学 | 7488篇 |
出版年
2024年 | 27篇 |
2023年 | 137篇 |
2022年 | 383篇 |
2021年 | 393篇 |
2020年 | 406篇 |
2019年 | 368篇 |
2018年 | 339篇 |
2017年 | 477篇 |
2016年 | 575篇 |
2015年 | 529篇 |
2014年 | 796篇 |
2013年 | 1245篇 |
2012年 | 840篇 |
2011年 | 991篇 |
2010年 | 843篇 |
2009年 | 940篇 |
2008年 | 950篇 |
2007年 | 1001篇 |
2006年 | 839篇 |
2005年 | 718篇 |
2004年 | 587篇 |
2003年 | 558篇 |
2002年 | 475篇 |
2001年 | 403篇 |
2000年 | 375篇 |
1999年 | 310篇 |
1998年 | 344篇 |
1997年 | 216篇 |
1996年 | 171篇 |
1995年 | 139篇 |
1994年 | 135篇 |
1993年 | 114篇 |
1992年 | 83篇 |
1991年 | 72篇 |
1990年 | 60篇 |
1989年 | 43篇 |
1988年 | 37篇 |
1987年 | 35篇 |
1986年 | 30篇 |
1985年 | 41篇 |
1984年 | 23篇 |
1983年 | 10篇 |
1982年 | 20篇 |
1981年 | 5篇 |
1980年 | 9篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 5篇 |
1971年 | 2篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
71.
72.
73.
74.
Discrete global descent method for discrete global optimization and nonlinear integer programming 总被引:2,自引:0,他引:2
A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization
problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function
f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function.
The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers
of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer
variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method. 相似文献
75.
戴滨林 《数学物理学报(A辑)》2007,27(5):935-940
该文对高维非初等Mò'bius变换群进行了研究,得到了一些重要性质,给出了几个关于离散准则和代数收敛性的定理. 相似文献
76.
Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities. 相似文献
77.
78.
E. de A. Gonçalves V. M. de Oliveira A. Rosas P. R.A. Campos 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,59(1):127-132
Adaptation of populations takes place with the occurrence and subsequent fixation of mutations that confer some selective
advantage
to the individuals which acquire it. For this reason, the study of the process of fixation of advantageous mutations has a
long history
in the population genetics literature. Particularly, the previous investigations aimed to find out the main evolutionary forces
affecting the strength of natural selection in the populations.
In the current work, we investigate the dynamics of fixation of beneficial mutations in a subdivided population. The subpopulations
(demes)
can exchange migrants
among their neighbors, in a migration network which is assumed to have either a random graph or a scale-free topology. We
have observed that the migration rate
drastically affects the dynamics of mutation fixation, despite of the fact that the probability of fixation is invariant on
the
migration rate, accordingly to
Maruyama's conjecture. In addition, we have noticed a topological dependence of the adaptive evolution of the population when
clonal interference
becomes effective. 相似文献
79.
80.
Jim Foster 《Journal of Combinatorial Theory, Series A》2007,114(8):1515-1525
We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle. We then apply this theorem to prove Graham's 1975 conjecture that the diameter graph of a maximal 2m-gon (m?3) must be a cycle of length 2m−1 with one additional edge attached to it. 相似文献