全文获取类型
收费全文 | 14667篇 |
免费 | 2664篇 |
国内免费 | 1364篇 |
专业分类
化学 | 3564篇 |
晶体学 | 240篇 |
力学 | 3732篇 |
综合类 | 202篇 |
数学 | 2695篇 |
物理学 | 8262篇 |
出版年
2024年 | 40篇 |
2023年 | 149篇 |
2022年 | 433篇 |
2021年 | 437篇 |
2020年 | 438篇 |
2019年 | 398篇 |
2018年 | 420篇 |
2017年 | 530篇 |
2016年 | 653篇 |
2015年 | 573篇 |
2014年 | 809篇 |
2013年 | 1265篇 |
2012年 | 889篇 |
2011年 | 1029篇 |
2010年 | 844篇 |
2009年 | 888篇 |
2008年 | 958篇 |
2007年 | 1039篇 |
2006年 | 918篇 |
2005年 | 789篇 |
2004年 | 648篇 |
2003年 | 643篇 |
2002年 | 556篇 |
2001年 | 485篇 |
2000年 | 477篇 |
1999年 | 393篇 |
1998年 | 406篇 |
1997年 | 246篇 |
1996年 | 216篇 |
1995年 | 178篇 |
1994年 | 183篇 |
1993年 | 139篇 |
1992年 | 98篇 |
1991年 | 109篇 |
1990年 | 76篇 |
1989年 | 56篇 |
1988年 | 50篇 |
1987年 | 43篇 |
1986年 | 41篇 |
1985年 | 48篇 |
1984年 | 20篇 |
1983年 | 12篇 |
1982年 | 18篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1976年 | 10篇 |
1975年 | 2篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
The grain boundary is an interface and the surface tension is one of its important thermodynamic properties. In this paper,
the surface tension of the ∑9 grain boundary for α-Fe at various temperatures and pressures is calculated by means of Computer
Molecular Dynamics (CMD). The results agree satisfactorily with the experimental data. It is shown that the contribution of
entropy to surface tension of grain boundary can be ignored.
The project supported by the National Natural Science Foundation of China and the Science Foundation of Chinese Academy of
Sciences. 相似文献
42.
CdZnTe核探测器的蒙特卡罗模拟的初步研究 总被引:6,自引:0,他引:6
以CdZnTe核探测器的工作原理为依据,探测器内反应的随机性和反应产生的电子空穴对数目的统计规律为物理模型,应用Visual C + + 自行编制了蒙特卡罗模拟软件.模拟了γ射线在CdZnTe探测器中的响应能谱,并将模拟结果与实际器件的测试结果进行了比较讨论.模拟能谱与实际测得的能谱的主峰符合较好.此外,通过分析57Co源辐照下探测效率与器件厚度的关系,可以推测探测效率达到最大时所对应CdZnTe探测器的理想厚度 相似文献
43.
Bai-suo JIN~ 《中国科学A辑(英文版)》2007,50(9):1303-1315
In the factor analysis model with large cross-section and time-series dimensions,we pro- pose a new method to estimate the number of factors.Specially if the idiosyncratic terms satisfy a linear time series model,the estimators of the parameters can be obtained in the time series model. The theoretical properties of the estimators are also explored.A simulation study and an empirical analysis are conducted. 相似文献
44.
Zhengqian Luo Guoyong Sun Zhiping Cai Miaoling Si Qibo Li 《Optics Communications》2007,277(1):118-124
In this paper, continuous wave Yb3+-doped double-clad fiber lasers (DCFLs) with linear-cavity are investigated theoretically and numerically using the rate equations. Under the steady state conditions, the simplified analytic solutions of Yb3+-doped DCFLs under considering the scattering loss are deduced in the strongly pump condition. Compared with the known analytic solutions in published literatures, our analytic solutions are more accurate, especially, at higher reflectivity of output mirror. In addition, a fast and stable algorithm based on the Newton-Raphson method is proposed to simulate numerically Yb3+-doped DCFLs. The results by simplified analytic solutions are in good agreement with those by the numerical simulation. Moreover, we have performed the optimization of an Yb3+-doped DCFL using the simplified analytic solutions and the numerical simulations, respectively. 相似文献
45.
S. V. Dil’man 《Mathematical Notes》2006,79(5-6):625-631
In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained. 相似文献
46.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems
in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient
algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such
tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable
bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric
sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key
idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation
then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance
sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates
it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for
the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.
相似文献
47.
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to the great number of tests to be performed, optimization of the simulation code is of prime importance. This paper describes two mathematical models for the minimization of the memory access times for a cycle-based simulator.An integrated circuit being viewed as a directed acyclic graph, the problem consists in building a graph order on the vertices, compatible with the relation order induced by the graph, in order to minimize a cost function that represents the memory access time. For both proposed cost functions, we show that the corresponding problems are NP-complete. However, we show that the special cases where the graphs are in-trees or out-trees can be solved in polynomial time. 相似文献
48.
49.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献
50.