全文获取类型
收费全文 | 10241篇 |
免费 | 644篇 |
国内免费 | 557篇 |
专业分类
化学 | 765篇 |
晶体学 | 24篇 |
力学 | 328篇 |
综合类 | 132篇 |
数学 | 1832篇 |
物理学 | 1403篇 |
综合类 | 6958篇 |
出版年
2024年 | 25篇 |
2023年 | 71篇 |
2022年 | 181篇 |
2021年 | 205篇 |
2020年 | 173篇 |
2019年 | 147篇 |
2018年 | 155篇 |
2017年 | 218篇 |
2016年 | 255篇 |
2015年 | 297篇 |
2014年 | 457篇 |
2013年 | 486篇 |
2012年 | 496篇 |
2011年 | 664篇 |
2010年 | 488篇 |
2009年 | 595篇 |
2008年 | 630篇 |
2007年 | 851篇 |
2006年 | 701篇 |
2005年 | 657篇 |
2004年 | 549篇 |
2003年 | 431篇 |
2002年 | 421篇 |
2001年 | 349篇 |
2000年 | 309篇 |
1999年 | 235篇 |
1998年 | 199篇 |
1997年 | 182篇 |
1996年 | 168篇 |
1995年 | 121篇 |
1994年 | 125篇 |
1993年 | 100篇 |
1992年 | 90篇 |
1991年 | 98篇 |
1990年 | 69篇 |
1989年 | 65篇 |
1988年 | 54篇 |
1987年 | 29篇 |
1986年 | 26篇 |
1985年 | 22篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1979年 | 4篇 |
1977年 | 9篇 |
1976年 | 3篇 |
1969年 | 1篇 |
1959年 | 3篇 |
1955年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
31.
M. A. Diniz-Ehrhardt M. A. Gomes-Ruggiero J. M. Martínez S. A. Santos 《Journal of Optimization Theory and Applications》2004,123(3):497-517
The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP. 相似文献
32.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
33.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
34.
A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics. 相似文献
35.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
36.
数字散斑干涉技术在振动分析中的应用 总被引:2,自引:0,他引:2
首次将相移技术应用于频闪数字散斑干涉计量中,对物体的振动进行了定量分析.实验证明,这种方法有广泛的实用价值.另外,介绍了一套自动分析系统,讨论了各参数对测量结果的影响. 相似文献
37.
谱任意的符号模式矩阵 总被引:1,自引:0,他引:1
一个n阶符号模式矩阵A称为是谱任意的,如果对任意的实系数n次首1多项式r(x),在A的定性矩阵类Q(A)中至少存在一个实矩阵B,使得B的特征多项式是r(x),文中证明了当n为奇数时n阶谱任意符号模式矩阵是存在的。 相似文献
38.
A. A. Dokukin 《Computational Mathematics and Mathematical Physics》2006,46(5):914-918
To validate approximate optimization schemes for estimate calculation algorithms (ECAs), it is necessary to compute the optimal height, which cannot be done in a reasonable amount of time. A variety of samples are built for which the optimal height of the ECAs is known by construction. 相似文献
39.
The implementation of a nonzero-order joint transform correlator using the double port Mach-Zehnder interferometric technique is proposed and demonstrated. This approach provides on-line processing for directly removing the zero-order components of a joint power spectrum in one step and performs the nonzero-order optical correlation. Experimental results are presented and discussed. 相似文献
40.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献