全文获取类型
收费全文 | 11149篇 |
免费 | 1045篇 |
国内免费 | 752篇 |
专业分类
化学 | 2094篇 |
晶体学 | 27篇 |
力学 | 792篇 |
综合类 | 225篇 |
数学 | 7210篇 |
物理学 | 2598篇 |
出版年
2024年 | 18篇 |
2023年 | 113篇 |
2022年 | 153篇 |
2021年 | 225篇 |
2020年 | 289篇 |
2019年 | 294篇 |
2018年 | 275篇 |
2017年 | 319篇 |
2016年 | 415篇 |
2015年 | 272篇 |
2014年 | 507篇 |
2013年 | 942篇 |
2012年 | 470篇 |
2011年 | 655篇 |
2010年 | 588篇 |
2009年 | 661篇 |
2008年 | 685篇 |
2007年 | 706篇 |
2006年 | 608篇 |
2005年 | 568篇 |
2004年 | 501篇 |
2003年 | 489篇 |
2002年 | 440篇 |
2001年 | 366篇 |
2000年 | 342篇 |
1999年 | 283篇 |
1998年 | 268篇 |
1997年 | 198篇 |
1996年 | 189篇 |
1995年 | 155篇 |
1994年 | 116篇 |
1993年 | 98篇 |
1992年 | 94篇 |
1991年 | 93篇 |
1990年 | 56篇 |
1989年 | 57篇 |
1988年 | 47篇 |
1987年 | 36篇 |
1986年 | 45篇 |
1985年 | 47篇 |
1984年 | 38篇 |
1983年 | 16篇 |
1982年 | 30篇 |
1981年 | 30篇 |
1980年 | 28篇 |
1979年 | 33篇 |
1978年 | 18篇 |
1977年 | 20篇 |
1976年 | 24篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
Some properties of the bilevel programming problem 总被引:8,自引:0,他引:8
J. F. Bard 《Journal of Optimization Theory and Applications》1991,68(2):371-378
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. 相似文献
92.
This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
93.
Jerzy Cioslowski 《Theoretical chemistry accounts》1992,81(4-5):319-327
Summary A new index, called the differential density matrix overlap (DDMO), is proposed for assessment of the electron correlation effects in atoms and molecules. DDMO can be easily calculated as the negative value of the correlation energy derivative with respect to the relative position of the occupied and virtual orbitals. DDMO is transparent to physical interpretation. It can serve as a tool for analyzing the accuracy of approximate electron correlation methods and the validity of the Hartree-Fock wavefunction as the zeroth-order approximation. The properties of DDMO are discussed using test calculations on 11 atoms and molecules as an example. 相似文献
94.
Dan Hefetz Michael Krivelevich Tibor Szabó 《Journal of Combinatorial Theory, Series A》2007,114(5):840-853
Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K2n for every q?cn/logn for an appropriate constant c, and the (1,q) Hamilton cycle game on Kn for every q?cnloglogloglogn/lognlogloglogn for an appropriate constant c. We also determine exactly those values of q for which Enforcer can win the (1,q) connectivity game on Kn. This result is quite surprising as it substantially differs from its Maker-Breaker analog. Our method extends easily to improve a result of Lu [X. Lu, A note on biased and non-biased games, Discrete Appl. Math. 60 (1995) 285-291], regarding forcing an opponent to pack many pairwise edge disjoint spanning trees in his graph. 相似文献
95.
蒋忠樟 《数学的实践与认识》2007,37(15):174-179
实对称正定矩阵的复合矩阵正定性的研究已有结论,但对于一般意义下的正定矩阵的复合矩阵是否仍然是正定的研究需要利用一般的正定矩阵的标准形的复合矩阵进行讨论,给出了一般公式及具体算法,为讨论其复合矩阵的正定性提供了基础条件. 相似文献
96.
本文研究了独立随机变量之和的绝对矩的几个性质, 其中包括$\ep|X+Y|-\ep|X-Y|$的表达式, 这里$X$和$Y$是相互独立的随机变量. 相似文献
97.
98.
本文解决了超立方体的Laplace矩阵的谱问题.n维超立方体Q。的Laplace矩阵L(Q)的谱specL(Qn)。[0 2 4…2n Cn^0 Cn^1 Cn^2 … Cn^n],.其中2t(t=0,1,2,…,n)为L(Qn)的n+1个不同的特征值,二项式系数Cn为特征值2t的重数. 相似文献
99.
100.
Lina Mallozzi 《Operations Research Letters》2007,35(2):151-154
A noncooperative game theoretical approach is considered for the multifacility location problem. It turns out that the facility location game is a potential game in the sense of Monderer and Shapley and some properties of the game are studied. 相似文献