全文获取类型
收费全文 | 66572篇 |
免费 | 6578篇 |
国内免费 | 5174篇 |
专业分类
化学 | 15453篇 |
晶体学 | 1855篇 |
力学 | 10737篇 |
综合类 | 767篇 |
数学 | 31410篇 |
物理学 | 18102篇 |
出版年
2024年 | 105篇 |
2023年 | 530篇 |
2022年 | 985篇 |
2021年 | 1162篇 |
2020年 | 1469篇 |
2019年 | 1526篇 |
2018年 | 1586篇 |
2017年 | 1875篇 |
2016年 | 2181篇 |
2015年 | 1733篇 |
2014年 | 2915篇 |
2013年 | 4691篇 |
2012年 | 3328篇 |
2011年 | 4773篇 |
2010年 | 4113篇 |
2009年 | 4296篇 |
2008年 | 4368篇 |
2007年 | 4343篇 |
2006年 | 3774篇 |
2005年 | 3462篇 |
2004年 | 2991篇 |
2003年 | 2602篇 |
2002年 | 2433篇 |
2001年 | 1917篇 |
2000年 | 1833篇 |
1999年 | 1637篇 |
1998年 | 1540篇 |
1997年 | 1312篇 |
1996年 | 1146篇 |
1995年 | 1052篇 |
1994年 | 942篇 |
1993年 | 775篇 |
1992年 | 769篇 |
1991年 | 568篇 |
1990年 | 510篇 |
1989年 | 420篇 |
1988年 | 307篇 |
1987年 | 277篇 |
1986年 | 204篇 |
1985年 | 288篇 |
1984年 | 240篇 |
1983年 | 132篇 |
1982年 | 181篇 |
1981年 | 179篇 |
1980年 | 143篇 |
1979年 | 118篇 |
1978年 | 149篇 |
1977年 | 139篇 |
1976年 | 107篇 |
1974年 | 59篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective. 相似文献
72.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
73.
We show that the difference between the Schrödinger uncertainty relations (UR) and the Heisenberg UR is fundamental. We propose a modified version of stochastic mechanics that allows clearly demonstrating that the contributions from the anticommutator and the commutator to the Schrödinger UR are equally important. A classification of quantum states minimizing the Schrödinger UR at an arbitrary instant is proposed. We show that the correlation of the coordinate and momentum fluctuations in such correlated-coherent states (CCS) is largely determined by the contributions from not only the commutator but also the anticommutator of the corresponding operators. We demonstrate that the character of this correlation changes qualitatively in time from the antiphase correlation typical for the Heisenberg UR to the inphase correlation for which the contribution from the anticommutator is decisive. We comparatively analyze properties of a free microparticle and a quantum oscillator in CCS and show that the CCS correspond to traveling-standing de Broglie waves in both models. 相似文献
74.
75.
76.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
77.
最速下降规则不失为一可用规则 总被引:5,自引:4,他引:1
本从统计意义上平均迭代次数的观点出发,指出求解线性规划的最速下降规则是可取的,好用的。 相似文献
78.
关于AOR迭代法的研究 总被引:5,自引:0,他引:5
陈恒新 《应用数学与计算数学学报》2002,16(1):40-46
本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω(0≤γ≤ω0)的最小值是h1,1. 相似文献
79.
线性分式规划最优解集的求法 总被引:5,自引:0,他引:5
薛声家 《应用数学与计算数学学报》2002,16(1):90-96
本文使用多面集的表示定理,导出了线性分式规划最优解集的结构,并给出确定全部最优解的计算步骤。 相似文献
80.
陈泽乾 《数学物理学报(B辑英文版)》2002,22(3)
A new framework of Gaussian white noise calculus is established, in line with generalized expansion in [3, 4, 7]. A suitable frame of Fock expansion is presented on Gaussian generalized expansion functionals being introduced here, which provides the integral kernel operator decomposition of the second quantization of Koopman operators for chaotic dynamical systems, in terms of annihilation operators dt and its dual, creation operators t*. 相似文献