全文获取类型
收费全文 | 161714篇 |
免费 | 3817篇 |
国内免费 | 2537篇 |
专业分类
化学 | 67859篇 |
晶体学 | 2399篇 |
力学 | 10419篇 |
综合类 | 198篇 |
数学 | 31286篇 |
物理学 | 55907篇 |
出版年
2023年 | 442篇 |
2022年 | 752篇 |
2021年 | 1013篇 |
2020年 | 1122篇 |
2019年 | 1094篇 |
2018年 | 10622篇 |
2017年 | 11447篇 |
2016年 | 5974篇 |
2015年 | 2299篇 |
2014年 | 1944篇 |
2013年 | 3159篇 |
2012年 | 7797篇 |
2011年 | 17086篇 |
2010年 | 10242篇 |
2009年 | 10276篇 |
2008年 | 14093篇 |
2007年 | 17782篇 |
2006年 | 2670篇 |
2005年 | 9469篇 |
2004年 | 5653篇 |
2003年 | 5277篇 |
2002年 | 3035篇 |
2001年 | 1982篇 |
2000年 | 1732篇 |
1999年 | 1263篇 |
1998年 | 1030篇 |
1997年 | 913篇 |
1996年 | 1029篇 |
1995年 | 891篇 |
1994年 | 833篇 |
1993年 | 700篇 |
1992年 | 778篇 |
1991年 | 750篇 |
1990年 | 711篇 |
1989年 | 658篇 |
1988年 | 631篇 |
1987年 | 611篇 |
1986年 | 534篇 |
1985年 | 610篇 |
1984年 | 623篇 |
1983年 | 486篇 |
1982年 | 516篇 |
1981年 | 491篇 |
1980年 | 423篇 |
1979年 | 517篇 |
1978年 | 498篇 |
1977年 | 431篇 |
1976年 | 462篇 |
1975年 | 401篇 |
1973年 | 433篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C.R.Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C.R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C.R.Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质. 相似文献
102.
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. 相似文献
103.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
104.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
105.
Possible Loss and Recovery of Gibbsianness¶During the Stochastic Evolution of Gibbs Measures 总被引:1,自引:1,他引:0
A.C.D. van Enter R. Fernández F. den Hollander F. Redig 《Communications in Mathematical Physics》2002,226(1):101-130
We consider Ising-spin systems starting from an initial Gibbs measure ν and evolving under a spin-flip dynamics towards a
reversible Gibbs measure μ≠ν. Both ν and μ are assumed to have a translation-invariant finite-range interaction. We study
the Gibbsian character of the measure νS(t) at time t and show the following:
(1) For all ν and μ, νS(t) is Gibbs for small t.
(2) If both ν and μ have a high or infinite temperature, then νS(t) is Gibbs for all t > 0.
(3) If ν has a low non-zero temperature and a zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t and non-Gibbs for large t.
(4) If ν has a low non-zero temperature and a non-zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t, non-Gibbs for intermediate t, and Gibbs for large t.
The regime where μ has a low or zero temperature and t is not small remains open. This regime presumably allows for many different scenarios.
Received: 26 April 2001 / Accepted: 10 October 2001 相似文献
106.
给出了线和n-2的n阶(0,1)-矩阵的最大积和式的积分表达式,并证明了该积分表达式与[1]得到的组合表达式等价。 相似文献
107.
108.
109.
The revival of the nondiffracting vortex beam after its interaction with the 2D on axis obstacle is examined. We show that the phase topology and the spatial distribution of the orbital angular momentum of the beam transmitted through the obstacle regenerate to the initial form during further free propagation. We verify that the healing effect appears even if the interaction is accompanied by the exchange of the orbital angular momentum. 相似文献
110.
Robert M. O'Keefe 《The Journal of the Operational Research Society》1989,40(5):415-422
Cognitive style refers to differences that can be perceived in individuals due to differing cognitive structures. There has been a large amount of research on how cognitive style affects managerial decision-making, particularly in the context of management information systems, but little or no attempt to relate these findings to operational research. This paper reviews the findings of cognitive-style research from the perspective of operational research, and draws a number of useful inferences concerning the matching of OR aids to managers, the presentation of information and recommendations, the use and acceptance of OR, and the structure of OR groups. Further, it is argued that cognitive-style findings help to give a justification to the move towards ‘soft’ approaches to analysis. 相似文献