全文获取类型
收费全文 | 10656篇 |
免费 | 1063篇 |
国内免费 | 713篇 |
专业分类
化学 | 1620篇 |
晶体学 | 23篇 |
力学 | 738篇 |
综合类 | 192篇 |
数学 | 7771篇 |
物理学 | 2088篇 |
出版年
2024年 | 17篇 |
2023年 | 67篇 |
2022年 | 147篇 |
2021年 | 197篇 |
2020年 | 189篇 |
2019年 | 215篇 |
2018年 | 220篇 |
2017年 | 286篇 |
2016年 | 341篇 |
2015年 | 241篇 |
2014年 | 462篇 |
2013年 | 775篇 |
2012年 | 552篇 |
2011年 | 526篇 |
2010年 | 496篇 |
2009年 | 602篇 |
2008年 | 683篇 |
2007年 | 697篇 |
2006年 | 605篇 |
2005年 | 576篇 |
2004年 | 500篇 |
2003年 | 417篇 |
2002年 | 448篇 |
2001年 | 423篇 |
2000年 | 375篇 |
1999年 | 369篇 |
1998年 | 285篇 |
1997年 | 252篇 |
1996年 | 221篇 |
1995年 | 184篇 |
1994年 | 143篇 |
1993年 | 121篇 |
1992年 | 112篇 |
1991年 | 92篇 |
1990年 | 68篇 |
1989年 | 59篇 |
1988年 | 52篇 |
1987年 | 51篇 |
1986年 | 47篇 |
1985年 | 55篇 |
1984年 | 59篇 |
1983年 | 20篇 |
1982年 | 36篇 |
1981年 | 22篇 |
1980年 | 21篇 |
1979年 | 27篇 |
1978年 | 12篇 |
1977年 | 22篇 |
1976年 | 14篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
51.
A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics. 相似文献
52.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
53.
Let Cld
AW
(X) be the hyperspace of nonempty closed subsets of a normed linear space X with the Attouch–Wets topology. It is shown that the space Cld
AW
(X) and its various subspaces are AR's. Moreover, if X is an infinite-dimensional Banach space with weight w(X) then Cld
AW
(X) is homeomorphic to a Hilbert space with weight 2
w(X). 相似文献
54.
Máté Matolcsi 《Acta Mathematica Hungarica》2005,108(1-2):129-136
Summary He present work deals with estimations of the n-th linear polarization constant c(H)n of an n-dimensional real Hilbert space H. We provide some new lower bounds on the value of sup║y║=1 │1,y> ... n,y>│, where x1, ... ,xn are unit vectors in H. In particular, the results improve an earlier estimate of Marcus. However, the intriguing conjecture c(H) n= nn/2 remains open. 相似文献
55.
In the present article, we aim at treating the existence of fundamental solutions of linear partial differential operators with constant coefficients from the viewpoint of setting up explicit formulae yielding fundamental solutions. 相似文献
56.
The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets. 相似文献
57.
This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation. 相似文献
58.
L. Contesse-Becker 《Journal of Optimization Theory and Applications》1993,79(2):273-310
In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile). 相似文献
59.
谐振子薛定谔方程的简单解法 总被引:2,自引:0,他引:2
物质的许多物理与化学性质都可以用线性谐振子模型解释,本文用简单的数学运算求解线性谐振子的薛定谔方程,避免了特殊函数等复杂的数学运算,得出了量子力学教材完全相同的结果。 相似文献
60.
O. Yu. Dashkova 《Algebra and Logic》2007,46(5):297-302
We are concerned with infinite-dimensional locally soluble linear groups of infinite central dimension that are not soluble
A3-groups and all of whose proper subgroups, which are not soluble A3-groups, have finite central dimension. The structure of groups in this class is described. The case of infinite-dimensional
locally nilpotent linear groups satisfying the specified conditions is treated separately. A similar problem is solved for
infinite-dimensional locally soluble linear groups of infinite fundamental dimension that are not soluble A3-groups and all of whose proper subgroups, which are not soluble A3-groups, have finite fundamental dimension.
__________
Translated from Algebra i Logika, Vol. 46, No. 5, pp. 548–559, September–October, 2007. 相似文献