全文获取类型
收费全文 | 10904篇 |
免费 | 774篇 |
国内免费 | 343篇 |
专业分类
化学 | 1339篇 |
晶体学 | 31篇 |
力学 | 1112篇 |
综合类 | 152篇 |
数学 | 7796篇 |
物理学 | 1591篇 |
出版年
2024年 | 25篇 |
2023年 | 109篇 |
2022年 | 347篇 |
2021年 | 344篇 |
2020年 | 224篇 |
2019年 | 247篇 |
2018年 | 262篇 |
2017年 | 347篇 |
2016年 | 330篇 |
2015年 | 247篇 |
2014年 | 496篇 |
2013年 | 647篇 |
2012年 | 637篇 |
2011年 | 502篇 |
2010年 | 481篇 |
2009年 | 603篇 |
2008年 | 625篇 |
2007年 | 666篇 |
2006年 | 543篇 |
2005年 | 481篇 |
2004年 | 376篇 |
2003年 | 348篇 |
2002年 | 330篇 |
2001年 | 300篇 |
2000年 | 296篇 |
1999年 | 219篇 |
1998年 | 246篇 |
1997年 | 216篇 |
1996年 | 150篇 |
1995年 | 169篇 |
1994年 | 149篇 |
1993年 | 122篇 |
1992年 | 107篇 |
1991年 | 94篇 |
1990年 | 91篇 |
1989年 | 70篇 |
1988年 | 51篇 |
1987年 | 52篇 |
1986年 | 42篇 |
1985年 | 64篇 |
1984年 | 60篇 |
1983年 | 23篇 |
1982年 | 40篇 |
1981年 | 30篇 |
1980年 | 33篇 |
1979年 | 47篇 |
1978年 | 30篇 |
1977年 | 42篇 |
1976年 | 31篇 |
1974年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
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. 相似文献
92.
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. 相似文献
93.
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. 相似文献
94.
Preparation of Papers 总被引:8,自引:0,他引:8
We motivate the study of a vector variational inequality by a practical flow equilibrium problem on a network, namely a generalization of the well-known Wardrop equilibrium principle. Both weak and strong forms of the vector variational inequality are discussed and their relationships to a vector optimization problem are established under various convexity assumptions. 相似文献
95.
灰色模型的最优化及其参数的直接求法 总被引:2,自引:0,他引:2
基于灰色模型的内涵表达式和白化方程响应式均为等比级数的观点,提出了一种不用求ago值、均值,不涉及灰色微分方程,白化微分方程概念,直接求灰色模型参数a,c的方法,通过此方法建立的新模型不仅从理论上可保证是在满足给定评价标准为模拟绝对误差平方和最小(或模拟相对误差平方和最小)、给定精度条件下的最优化模型,从而结束了灰色模型只有更优,没有最优的历史.并从理论上证明了新模型具有白化指数律重合性、白化系数律重合性,伸缩变换一致性.最后通过实例编程验证该方法具有可操作性,且预测精度高,效果好. 相似文献
96.
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. 相似文献
97.
The subject of spectral distribution methods where one derives and applies the locally smoothed forms of observables in nuclei
is briefly reviewed. It is well understood that the local forms (with respect to energy) of the level density function, expectation
values and strength densities are Gaussian, linear (or ratio of Gaussians) and a bivariate Gaussian respectively. To accomodate
symmetries in the above forms, one has to deal with multivariate distributions in general; for example the angular-momentum
(J) decomposition leads to a bivariate Gaussian form for the level density. These results extend to indefinitely large spaces
by method of partitioning and they generate convolution forms. The origin of these remarkable spectral properties is discussed
and shell model examples are given to substantiate their applicability to nuclear systems. Spectral distribution theory is
a practical, usable theory because the smoothed forms are defined in terms of traces of low particle-rank operators, and the
trace information propagates. Finally we discuss the application of the spectral methods for a wide range of nuclear problems;
these include binding energies, orbit occupancies, electromagnetic andβ-decay sum rule quantities, analysis of operators, symmetry breaking, numerical level densities, and determination of bounds
on time-reversal non-invariant part of nucleon-nucleon interaction. 相似文献
98.
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with
k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values.
Received: August 2001 / Accepted: January 2002?Published online March 27, 2002 相似文献
99.
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.
相似文献
100.
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. 相似文献