全文获取类型
收费全文 | 9000篇 |
免费 | 271篇 |
国内免费 | 144篇 |
专业分类
化学 | 398篇 |
晶体学 | 5篇 |
力学 | 429篇 |
综合类 | 93篇 |
数学 | 7912篇 |
物理学 | 578篇 |
出版年
2023年 | 35篇 |
2022年 | 72篇 |
2021年 | 99篇 |
2020年 | 119篇 |
2019年 | 124篇 |
2018年 | 115篇 |
2017年 | 181篇 |
2016年 | 161篇 |
2015年 | 117篇 |
2014年 | 347篇 |
2013年 | 473篇 |
2012年 | 452篇 |
2011年 | 346篇 |
2010年 | 346篇 |
2009年 | 526篇 |
2008年 | 522篇 |
2007年 | 581篇 |
2006年 | 384篇 |
2005年 | 378篇 |
2004年 | 301篇 |
2003年 | 292篇 |
2002年 | 296篇 |
2001年 | 255篇 |
2000年 | 260篇 |
1999年 | 235篇 |
1998年 | 190篇 |
1997年 | 165篇 |
1996年 | 200篇 |
1995年 | 207篇 |
1994年 | 133篇 |
1993年 | 141篇 |
1992年 | 137篇 |
1991年 | 123篇 |
1990年 | 104篇 |
1989年 | 74篇 |
1988年 | 91篇 |
1987年 | 60篇 |
1986年 | 85篇 |
1985年 | 157篇 |
1984年 | 125篇 |
1983年 | 70篇 |
1982年 | 74篇 |
1981年 | 38篇 |
1980年 | 33篇 |
1979年 | 28篇 |
1978年 | 48篇 |
1977年 | 47篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 13篇 |
排序方式: 共有9415条查询结果,搜索用时 15 毫秒
1.
A fundamental question in random matrix theory is to quantify the optimal rate of convergence to universal laws. We take up this problem for the Laguerre β ensemble, characterized by the Dyson parameter β, and the Laguerre weight , in the hard edge limit. The latter relates to the eigenvalues in the vicinity of the origin in the scaled variable . Previous work has established the corresponding functional form of various statistical quantities—for example, the distribution of the smallest eigenvalue, provided that . We show, using the theory of multidimensional hypergeometric functions based on Jack polynomials, that with the modified hard edge scaling , the rate of convergence to the limiting distribution is , which is optimal. In the case , general the explicit functional form of the distribution of the smallest eigenvalue at this order can be computed, as it can for and general . An iterative scheme is presented to numerically approximate the functional form for general . 相似文献
2.
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. 相似文献
3.
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. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
9.
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. 相似文献
10.
Constraint Programming and Operations Research: Comments from an Operations Researcher 总被引:4,自引:0,他引:4
Michel Gendreau 《Journal of Heuristics》2002,8(1):19-24
This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research. 相似文献