全文获取类型
收费全文 | 3791篇 |
免费 | 396篇 |
国内免费 | 191篇 |
专业分类
化学 | 749篇 |
晶体学 | 24篇 |
力学 | 324篇 |
综合类 | 132篇 |
数学 | 1829篇 |
物理学 | 1320篇 |
出版年
2023年 | 22篇 |
2022年 | 55篇 |
2021年 | 99篇 |
2020年 | 70篇 |
2019年 | 54篇 |
2018年 | 79篇 |
2017年 | 105篇 |
2016年 | 141篇 |
2015年 | 102篇 |
2014年 | 165篇 |
2013年 | 235篇 |
2012年 | 167篇 |
2011年 | 213篇 |
2010年 | 184篇 |
2009年 | 231篇 |
2008年 | 283篇 |
2007年 | 284篇 |
2006年 | 240篇 |
2005年 | 224篇 |
2004年 | 198篇 |
2003年 | 149篇 |
2002年 | 140篇 |
2001年 | 125篇 |
2000年 | 122篇 |
1999年 | 103篇 |
1998年 | 92篇 |
1997年 | 76篇 |
1996年 | 71篇 |
1995年 | 57篇 |
1994年 | 46篇 |
1993年 | 38篇 |
1992年 | 28篇 |
1991年 | 30篇 |
1990年 | 23篇 |
1989年 | 18篇 |
1988年 | 22篇 |
1987年 | 11篇 |
1986年 | 15篇 |
1985年 | 15篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1979年 | 4篇 |
1977年 | 9篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1969年 | 1篇 |
1959年 | 3篇 |
排序方式: 共有4378条查询结果,搜索用时 15 毫秒
21.
数字散斑干涉技术在振动分析中的应用 总被引:2,自引:0,他引:2
首次将相移技术应用于频闪数字散斑干涉计量中,对物体的振动进行了定量分析.实验证明,这种方法有广泛的实用价值.另外,介绍了一套自动分析系统,讨论了各参数对测量结果的影响. 相似文献
22.
谱任意的符号模式矩阵 总被引:1,自引:0,他引:1
一个n阶符号模式矩阵A称为是谱任意的,如果对任意的实系数n次首1多项式r(x),在A的定性矩阵类Q(A)中至少存在一个实矩阵B,使得B的特征多项式是r(x),文中证明了当n为奇数时n阶谱任意符号模式矩阵是存在的。 相似文献
23.
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. 相似文献
24.
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. 相似文献
25.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献
26.
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog2n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m3logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found. 相似文献
27.
Thomas Wanner 《Transactions of the American Mathematical Society》2004,356(6):2251-2279
Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.
In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.
28.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
29.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
30.
Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities. 相似文献