全文获取类型
收费全文 | 5019篇 |
免费 | 165篇 |
国内免费 | 260篇 |
专业分类
化学 | 1243篇 |
晶体学 | 2篇 |
力学 | 247篇 |
综合类 | 17篇 |
数学 | 3149篇 |
物理学 | 786篇 |
出版年
2023年 | 55篇 |
2022年 | 66篇 |
2021年 | 74篇 |
2020年 | 67篇 |
2019年 | 96篇 |
2018年 | 78篇 |
2017年 | 90篇 |
2016年 | 82篇 |
2015年 | 92篇 |
2014年 | 169篇 |
2013年 | 383篇 |
2012年 | 312篇 |
2011年 | 254篇 |
2010年 | 252篇 |
2009年 | 353篇 |
2008年 | 360篇 |
2007年 | 355篇 |
2006年 | 236篇 |
2005年 | 191篇 |
2004年 | 186篇 |
2003年 | 155篇 |
2002年 | 151篇 |
2001年 | 99篇 |
2000年 | 99篇 |
1999年 | 77篇 |
1998年 | 102篇 |
1997年 | 100篇 |
1996年 | 110篇 |
1995年 | 89篇 |
1994年 | 109篇 |
1993年 | 82篇 |
1992年 | 77篇 |
1991年 | 50篇 |
1990年 | 43篇 |
1989年 | 42篇 |
1988年 | 25篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 34篇 |
1984年 | 30篇 |
1983年 | 14篇 |
1982年 | 43篇 |
1981年 | 19篇 |
1980年 | 21篇 |
1979年 | 27篇 |
1978年 | 16篇 |
1977年 | 11篇 |
1976年 | 8篇 |
1973年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有5444条查询结果,搜索用时 0 毫秒
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.
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. 相似文献
4.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
5.
An Application of Branch and Cut to Open Pit Mine Scheduling 总被引:5,自引:0,他引:5
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. 相似文献
6.
The natural modes of a discrete linear system are orthogonal with respect to the mass and stiffness matrices in a generalized sense. However, these modes are usually not orthogonal to each other in the ordinary sense. The purpose of this paper is to document a number of conditions under which the modes are also orthogonal in an ordinary fashion. 相似文献
7.
8.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
9.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
10.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献