全文获取类型
收费全文 | 13631篇 |
免费 | 661篇 |
国内免费 | 639篇 |
专业分类
化学 | 635篇 |
晶体学 | 4篇 |
力学 | 354篇 |
综合类 | 102篇 |
数学 | 7789篇 |
物理学 | 514篇 |
综合类 | 5533篇 |
出版年
2024年 | 26篇 |
2023年 | 77篇 |
2022年 | 161篇 |
2021年 | 181篇 |
2020年 | 202篇 |
2019年 | 189篇 |
2018年 | 190篇 |
2017年 | 251篇 |
2016年 | 271篇 |
2015年 | 264篇 |
2014年 | 577篇 |
2013年 | 628篇 |
2012年 | 704篇 |
2011年 | 634篇 |
2010年 | 572篇 |
2009年 | 753篇 |
2008年 | 780篇 |
2007年 | 902篇 |
2006年 | 661篇 |
2005年 | 676篇 |
2004年 | 558篇 |
2003年 | 516篇 |
2002年 | 487篇 |
2001年 | 429篇 |
2000年 | 446篇 |
1999年 | 349篇 |
1998年 | 322篇 |
1997年 | 305篇 |
1996年 | 322篇 |
1995年 | 294篇 |
1994年 | 262篇 |
1993年 | 241篇 |
1992年 | 254篇 |
1991年 | 220篇 |
1990年 | 173篇 |
1989年 | 140篇 |
1988年 | 167篇 |
1987年 | 98篇 |
1986年 | 106篇 |
1985年 | 119篇 |
1984年 | 84篇 |
1983年 | 22篇 |
1982年 | 51篇 |
1981年 | 38篇 |
1980年 | 35篇 |
1979年 | 28篇 |
1978年 | 49篇 |
1977年 | 48篇 |
1976年 | 27篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
961.
E. Übi 《Central European Journal of Mathematics》2008,6(1):171-178
The strictly convex quadratic programming problem is transformed to the least distance problem — finding the solution of minimum
norm to the system of linear inequalities. This problem is equivalent to the linear least squares problem on the positive
orthant. It is solved using orthogonal transformations, which are memorized as products. Like in the revised simplex method,
an auxiliary matrix is used for computations. Compared to the modified-simplex type methods, the presented dual algorithm
QPLS requires less storage and solves ill-conditioned problems more precisely. The algorithm is illustrated by some difficult
problems.
相似文献
962.
线性目标规划法—一种实用的多目标优化设计方法 总被引:2,自引:0,他引:2
本文主要介绍线性目标规划法的基本原理和实现过程。该方法设计思路新颖,技巧独特;通过运行作者研制的用FORTRAN77语言编制的相应计算机程序对算例的考核,表明线性目标规划法不失为一种有效的多目标优化设计方法。 相似文献
963.
On convergence properties of a least-distance programming procedure for minimization problems under linear constraints 总被引:3,自引:0,他引:3
G. L. Xue 《Journal of Optimization Theory and Applications》1986,50(2):365-370
In Ref. 1, Bazaraa and Goode provided an algorithm for solving a nonlinear programming problem with linear constraints. In this paper, we show that this algorithm possesses good convergence properties.This paper was written under the guidance of Associate Professor C. Y. Wang. The author takes great pleasure in thanking him. 相似文献
964.
杨久志 《江苏大学学报(自然科学版)》1997,(1)
论述了用对偶矢量计算开环机构末杆自由度在机构自由度计算中的应用,并给出以这种方法计算各种不同类型闭环机构自由度的算例. 相似文献
965.
Minimum weight edge covering problem, known as a classic problem in graph theory, is employed in many scientific and engineering applications. In the applications, the weight may denote cost, time, or opponent’s payoff, which can be vague in practice. This paper considers the edge covering problem under fuzzy environment, and formulates three models which are expected minimum weight edge cover model, α-minimum weight edge cover model, and the most minimum weight edge cover model. As an extension for the models, we respectively introduce the crisp equivalent of each model in the case that the weights are independent trapezoidal fuzzy variables. Due to the complexity of the problem, a hybrid intelligent algorithm is employed to solve the models, which can deal with the problem with any type of fuzzy weights. At last, some numerical experiments are given to show the application of the models and the robustness of the algorithm. 相似文献
966.
Changing economic conditions make the selling price and demand quantity more and more uncertain in the market. The conventional inventory models determine the selling price and order quantity for a retailer’s maximal profit with exactly known parameters. This paper develops a solution method to derive the fuzzy profit of the inventory model when the demand quantity and unit cost are fuzzy numbers. Since the parameters contained in the inventory model are fuzzy, the profit value calculated from the model should be fuzzy as well. Based on the extension principle, the fuzzy inventory problem is transformed into a pair of two-level mathematical programs to derive the upper bound and lower bound of the fuzzy profit at possibility level α. According to the duality theorem of geometric programming, the pair of two-level mathematical programs is transformed into a pair of conventional geometric programs to solve. By enumerating different α values, the upper bound and lower bound of the fuzzy profit are collected to approximate the membership function. Since the profit of the inventory problem is expressed by the membership function rather than by a crisp value, more information is provided for making decisions. 相似文献
967.
本文研究了线性规划的求解问题.利用对偶转化的方法,获得了一个计算效率高的新的无人工变量通用算法.该新算法比最近提出的无人工变量算法push-to-pull算法效率更高. 相似文献
968.
In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed. We study the effect of the use of transformations on the approximation of univariate (convex) functions. In this paper, we show that these transformations can be used to construct upper and lower bounds for nonconvex functions. Moreover, we show that by using such transformations of the input variable or the output variable, we obtain tighter upper and lower bounds for the approximation of convex functions than without these approximations. We show that these transformations can be applied to the approximation of a (convex) Pareto curve that is associated with a (convex) bi-objective optimization problem. 相似文献
969.
Radu Ioan Bo? Sorin-Mihai Grad 《Journal of Mathematical Analysis and Applications》2008,337(2):1315-1325
We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature. 相似文献
970.
陈桂雄 《贵州工业大学学报(自然科学版)》1990,(3)
对机构构件在空间的一般位置采用二元数表示,并对广义螺旋付单环五杆空间机构各构件之间的联系规律进行分析,导出了机构各构件在空间一般位置位相的旋量计算方法。 相似文献