全文获取类型
收费全文 | 11420篇 |
免费 | 364篇 |
国内免费 | 369篇 |
专业分类
化学 | 913篇 |
晶体学 | 3篇 |
力学 | 444篇 |
综合类 | 90篇 |
数学 | 9774篇 |
物理学 | 929篇 |
出版年
2023年 | 79篇 |
2022年 | 117篇 |
2021年 | 151篇 |
2020年 | 137篇 |
2019年 | 175篇 |
2018年 | 163篇 |
2017年 | 211篇 |
2016年 | 202篇 |
2015年 | 185篇 |
2014年 | 450篇 |
2013年 | 681篇 |
2012年 | 600篇 |
2011年 | 526篇 |
2010年 | 524篇 |
2009年 | 741篇 |
2008年 | 792篇 |
2007年 | 805篇 |
2006年 | 531篇 |
2005年 | 458篇 |
2004年 | 379篇 |
2003年 | 363篇 |
2002年 | 357篇 |
2001年 | 278篇 |
2000年 | 296篇 |
1999年 | 235篇 |
1998年 | 227篇 |
1997年 | 209篇 |
1996年 | 243篇 |
1995年 | 217篇 |
1994年 | 186篇 |
1993年 | 168篇 |
1992年 | 167篇 |
1991年 | 136篇 |
1990年 | 118篇 |
1989年 | 81篇 |
1988年 | 93篇 |
1987年 | 66篇 |
1986年 | 101篇 |
1985年 | 140篇 |
1984年 | 100篇 |
1983年 | 31篇 |
1982年 | 85篇 |
1981年 | 52篇 |
1980年 | 53篇 |
1979年 | 50篇 |
1978年 | 64篇 |
1977年 | 54篇 |
1976年 | 32篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
2.
Clemens G. Raab Georg Regensburger Jamal Hossein Poor 《Journal of Pure and Applied Algebra》2021,225(5):106564
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials. 相似文献
3.
4.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
5.
自Tanaka等1982年提出模糊回归概念以来,该问题已得到广泛的研究。作为主要估计方法之一的模糊最小二乘估计以其与统计最小二乘估计的密切联系更受到人们的重视。本文依据适当定义的两个模糊数之间的距离,提出了模糊线性回归模型的一个约束最小二乘估计方法,该方法不仅能使估计的模糊参数的宽度具有非负性而且估计的模糊参数的中心线与传统的最小二乘估计相一致。最后,通过数值例子说明了所提方法的具体应用。 相似文献
6.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
7.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
8.
Boban Marinković 《Mathematical Methods of Operations Research》2006,63(3):513-524
We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem. 相似文献
9.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
10.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献