全文获取类型
收费全文 | 1487篇 |
免费 | 86篇 |
国内免费 | 32篇 |
专业分类
化学 | 66篇 |
晶体学 | 1篇 |
力学 | 137篇 |
综合类 | 11篇 |
数学 | 1229篇 |
物理学 | 161篇 |
出版年
2023年 | 16篇 |
2022年 | 19篇 |
2021年 | 24篇 |
2020年 | 23篇 |
2019年 | 23篇 |
2018年 | 21篇 |
2017年 | 31篇 |
2016年 | 30篇 |
2015年 | 36篇 |
2014年 | 62篇 |
2013年 | 99篇 |
2012年 | 82篇 |
2011年 | 51篇 |
2010年 | 50篇 |
2009年 | 76篇 |
2008年 | 83篇 |
2007年 | 98篇 |
2006年 | 87篇 |
2005年 | 58篇 |
2004年 | 57篇 |
2003年 | 52篇 |
2002年 | 52篇 |
2001年 | 46篇 |
2000年 | 34篇 |
1999年 | 47篇 |
1998年 | 34篇 |
1997年 | 35篇 |
1996年 | 25篇 |
1995年 | 26篇 |
1994年 | 26篇 |
1993年 | 19篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 14篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 19篇 |
1985年 | 15篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 13篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1974年 | 5篇 |
1973年 | 1篇 |
排序方式: 共有1605条查询结果,搜索用时 15 毫秒
71.
A multiple objective waste-disposal model is developed and analysed. The model is a modification of the single objective waste-disposal model of Alley, Aguado and Remson. The solution structure is obtained using the method of constraints so that dual variables (shadow prices) are available with the solutions. 相似文献
72.
Roman Barták 《Annals of Operations Research》2003,118(1-4):101-119
Global constraints provide strong filtering algorithms to reduce the search space when solving large combinatorial problems. In this paper we propose to make the global constraints dynamic, i.e., to allow extending the set of constrained variables during search. We describe a generic dynamisation technique for an arbitrary monotonic global constraint and we compare it with the semantic-based dynamisation for the alldifferent constraint. At the end we sketch a dynamisation technique for non-monotonic global constraints. A comparison with existing methods to model dynamic problems is given as well. 相似文献
73.
线性约束最优化的一个共轭投影梯度法 总被引:1,自引:0,他引:1
本结合共轭梯度法及梯度投影法的思想,建立线性等式约束最优化的一个新算法,称之为共轭投影梯度法。分别对二次凸目标函数和一般目标函数分析和论证了算法的重要性质和收敛性。 相似文献
74.
Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints 总被引:2,自引:0,他引:2
Jean-Baptiste Hiriart-Urruty 《Journal of Global Optimization》2001,21(4):443-453
For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality. 相似文献
75.
A. I. Pavlov 《Mathematical Notes》2000,68(3):370-377
The main result of this paper is the following theorem. Suppose thatτ(n) = ∑
d|n
l and the arithmetical functionF satisfies the following conditions:
Then there exist constantsA
1,A
2, andA
3 such that for any fixed \g3\s>0 the following relation holds:
. Moreover, if for any primep the inequality \vbf(p)\vb\s<1 holds and the functionF is strongly multiplicative, thenA
1\s>0.
Translated fromMatematicheskie Zametki, Vol. 68, No. 3, pp. 429–438, September, 2000. 相似文献
1) | the functionF is multiplicative; |
2) | ifF(n) = ∑ d|n f(d), then there exists an α>0 such that the relationf(n)=O(n −α) holds asn→∞. |
76.
Aleksandar Jurišić Jack Koolen Paul Terwilliger 《Journal of Algebraic Combinatorics》2000,12(2):163-197
We consider a distance-regular graph with diameter d 3 and eigenvalues k = 0 > 1 > ... >
d
. We show the intersection numbers a
1, b
1 satisfy
We say is tight whenever is not bipartite, and equality holds above. We characterize the tight property in a number of ways. For example, we show is tight if and only if the intersection numbers are given by certain rational expressions involving d independent parameters. We show is tight if and only if a
1 0, a
d = 0, and is 1-homogeneous in the sense of Nomura. We show is tight if and only if each local graph is connected strongly-regular, with nontrivial eigenvalues –1 – b
1(1 + 1)–1 and –1 – b
1(1 +
d
)–1. Three infinite families and nine sporadic examples of tight distance-regular graphs are given. 相似文献
77.
78.
Shu-min Li 《Reports on Mathematical Physics》2007,60(1):107-116
By analyzing the virtual work of reaction forces, we prove the failure of the vakonomic model in obtaining the correct equations of motion for nonholonomic mechanical systems. Only when the constraint is integrable can the actual equation of motion be obtained. We show that the null virtual work condition of reaction forces is a robust criterion on the validity of various models of analytical mechanics. For an illustration, classical examples are discussed. 相似文献
79.
为提高移动机器人的位置估计精度和跟踪效果,提出一种基于道路约束条件下的移动机器人鲁棒约束H∞滤波(CHF)跟踪算法.首先,将机器人移动的道路网络作为跟踪的约束条件,并利用当前统计模型对机器人的运动进行建模.其次,将道路约束条件作为机器人跟踪的非线性状态约束,利用最小协方差估计推导了鲁棒CHF递推方程.通过拉格朗日乘子法对非线性约束优化估计问题进行求解,并利用约束信息对CHF算法的状态更新过程进行了改进.最后,通过对CHF算法和无约束的H∞滤波算法的跟踪性能进行了对比分析和验证.仿真结果表明,该算法可以实现机器人的跟踪,且跟踪精度优于HF算法. 相似文献
80.
A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty
function, nor a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different
trust-regions to cope with the nonlinearities of the objective function and the constraints, and allows inexact SQP steps
that do not lie exactly in the nullspace of the local Jacobian. Preliminary numerical experiments on CUTEr problems indicate that the method performs well.
相似文献