全文获取类型
收费全文 | 9617篇 |
免费 | 728篇 |
国内免费 | 259篇 |
学科分类
数理化 | 10604篇 |
出版年
2024年 | 15篇 |
2023年 | 97篇 |
2022年 | 216篇 |
2021年 | 330篇 |
2020年 | 195篇 |
2019年 | 214篇 |
2018年 | 233篇 |
2017年 | 324篇 |
2016年 | 301篇 |
2015年 | 220篇 |
2014年 | 449篇 |
2013年 | 544篇 |
2012年 | 604篇 |
2011年 | 469篇 |
2010年 | 437篇 |
2009年 | 550篇 |
2008年 | 546篇 |
2007年 | 598篇 |
2006年 | 483篇 |
2005年 | 422篇 |
2004年 | 332篇 |
2003年 | 314篇 |
2002年 | 291篇 |
2001年 | 262篇 |
2000年 | 261篇 |
1999年 | 194篇 |
1998年 | 211篇 |
1997年 | 192篇 |
1996年 | 138篇 |
1995年 | 161篇 |
1994年 | 133篇 |
1993年 | 111篇 |
1992年 | 102篇 |
1991年 | 85篇 |
1990年 | 77篇 |
1989年 | 61篇 |
1988年 | 48篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 54篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 23篇 |
1981年 | 21篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 23篇 |
1977年 | 32篇 |
1976年 | 20篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 671 毫秒
151.
在聚酰胶片上以13%SDBS(十二烷基苯磺酸钠)+7%Triton X-100〔聚乙二醇-对-(1.1,3,3-四甲基)丁基苯基醚〕+(2+3)氨水(1+5+1)为展开剂,用胶束薄层色谱法分离和测定了柠檬黄、亮蓝、苋菜红、胭脂红和赤藓红。测定波长分别为440、632、535、525和528 nm,线性范围分别为0.1~2、0.05~1、0.05~1、0.05~1和0.05~1μg/斑点。方法用于测定软饮料糖果及药用胶囊中的合成色素,获得了满意的结果。此外,还对展开剂的最佳组成进行了单纯形法优化。 相似文献
152.
In the paper, the behaviour of interior point algorithms is analyzed by using a variable metric method approach. A class of
polynomial variable metric algorithms is given achieving O ((n/β)L) iterations for solving a canonical form linear optimization problem with respect to a wide class of Riemannian metrics,
wheren is the number of dimensions and β a fixed value. It is shown that the vector fields of several interior point algorithms
for linear optimization is the negative Riemannian gradient vector field of a linear a potential or a logarithmic barrier
function for suitable Riemannian metrics.
Research Partially supported by the Hungarian National Research Foundation, Grant Nos. OTKA-T016413 and OTKA-2116. 相似文献
153.
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. 相似文献
154.
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. 相似文献
155.
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. 相似文献
156.
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. 相似文献
157.
灰色模型的最优化及其参数的直接求法 总被引:2,自引:0,他引:2
基于灰色模型的内涵表达式和白化方程响应式均为等比级数的观点,提出了一种不用求ago值、均值,不涉及灰色微分方程,白化微分方程概念,直接求灰色模型参数a,c的方法,通过此方法建立的新模型不仅从理论上可保证是在满足给定评价标准为模拟绝对误差平方和最小(或模拟相对误差平方和最小)、给定精度条件下的最优化模型,从而结束了灰色模型只有更优,没有最优的历史.并从理论上证明了新模型具有白化指数律重合性、白化系数律重合性,伸缩变换一致性.最后通过实例编程验证该方法具有可操作性,且预测精度高,效果好. 相似文献
158.
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. 相似文献
159.
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 相似文献
160.
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.
相似文献