全文获取类型
收费全文 | 10903篇 |
免费 | 786篇 |
国内免费 | 353篇 |
专业分类
化学 | 1734篇 |
晶体学 | 31篇 |
力学 | 1152篇 |
综合类 | 161篇 |
数学 | 7213篇 |
物理学 | 1751篇 |
出版年
2024年 | 22篇 |
2023年 | 116篇 |
2022年 | 369篇 |
2021年 | 351篇 |
2020年 | 239篇 |
2019年 | 257篇 |
2018年 | 273篇 |
2017年 | 362篇 |
2016年 | 334篇 |
2015年 | 245篇 |
2014年 | 480篇 |
2013年 | 615篇 |
2012年 | 668篇 |
2011年 | 527篇 |
2010年 | 494篇 |
2009年 | 610篇 |
2008年 | 620篇 |
2007年 | 678篇 |
2006年 | 537篇 |
2005年 | 477篇 |
2004年 | 382篇 |
2003年 | 360篇 |
2002年 | 328篇 |
2001年 | 296篇 |
2000年 | 288篇 |
1999年 | 225篇 |
1998年 | 238篇 |
1997年 | 221篇 |
1996年 | 155篇 |
1995年 | 176篇 |
1994年 | 142篇 |
1993年 | 122篇 |
1992年 | 111篇 |
1991年 | 92篇 |
1990年 | 83篇 |
1989年 | 67篇 |
1988年 | 53篇 |
1987年 | 47篇 |
1986年 | 47篇 |
1985年 | 56篇 |
1984年 | 52篇 |
1983年 | 17篇 |
1982年 | 30篇 |
1981年 | 25篇 |
1980年 | 19篇 |
1979年 | 32篇 |
1978年 | 21篇 |
1977年 | 30篇 |
1976年 | 20篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
The paper deals with the global minimization of a differentiable cost function mapping a ball of a finite dimensional Euclidean space into an interval of real numbers. It is established that a suitable random perturbation of the gradient method with a fixed parameter generates a bounded minimizing sequence and leads to a global minimum: the perturbation avoids convergence to local minima. The stated results suggest an algorithm for the numerical approximation of global minima: experiments are performed for the problem of fitting a sum of exponentials to discrete data and to a nonlinear system involving about 5000 variables. The effect of the random perturbation is examined by comparison with the purely deterministic gradient method. 相似文献
32.
利用集值映射切导数与半可微概念,给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。 相似文献
33.
We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved. 相似文献
34.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
35.
Researchers first examined the problem of separable concave programming more than thirty years ago, making it one of the earliest branches of nonlinear programming to be explored. This paper proposes a new algorithm that finds the exact global minimum of this problem in a finite number of iterations. In addition to proving that our algorithm terminates finitely, the paper extends a guarantee of finiteness to all branch-and-bound algorithms for concave programming that (1) partition exhaustively using rectangular subdivisions and (2) branch on the incumbent solution when possible. The algorithm uses domain reduction techniques to accelerate convergence; it solves problems with as many as 100 nonlinear variables, 400 linear variables and 50 constraints in about five minutes on an IBM RS/6000 Power PC. An industrial application with 152 nonlinear variables, 593 linear variables, and 417 constraints is also solved in about ten minutes. 相似文献
36.
A method of simulated annealing in optimization of a computer generated holo-gram(CGH)is presented.The characteristics of energy in annealing curve are analyzed.Thecooling schedule such as giving an initial temperature,the temperature function,the numberof interactions and stopping criterion are discussed.As an example,an optimization of phaserelief kinoform,a CGH with multiple phase levels,is implemented. 相似文献
37.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
38.
CONE-DIRECTED CONTINGENT DERIVATIVES AND GENERALIZED PREINVEX SET-VALUED OPTIMIZATION 总被引:2,自引:0,他引:2
丘京辉 《数学物理学报(B辑英文版)》2007,27(1):211-218
By using cone-directed contingent derivatives, the unified necessary and suffi-cient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set valued optimization. 相似文献
39.
Scalarization for pointwise well-posed vectorial problems 总被引:1,自引:1,他引:0
M. Durea 《Mathematical Methods of Operations Research》2007,66(3):409-418
The aim of this paper is to develop a method of study of Tykhonov well-posedness notions for vector valued problems using
a class of scalar problems. Having a vectorial problem, the scalarization technique we use allows us to construct a class
of scalar problems whose well-posedness properties are equivalent with the most known well-posedness properties of the original
problem. Then a well-posedness property of a quasiconvex level-closed problem is derived.
相似文献
40.
Abdulaziz S. Alidi 《Applied Mathematical Modelling》1992,16(12):645-651
The improper handling and disposal of hazardous wastes cause threats to human health and the environment. One reason for the improper handling and disposal of these wastes is that not much consideration is usually given to the logistical aspects of hazardous waste systems. In this paper an integer goal programming model is developed that takes into consideration the multiple goals and needs of many groups involved in managing and planning hazardous waste systems. The model can easily be implemented and can be used to address many of the issues related to facility location, recycling, treatment, and disposal of hazardous wastes. 相似文献