全文获取类型
收费全文 | 3630篇 |
免费 | 408篇 |
国内免费 | 182篇 |
专业分类
化学 | 492篇 |
晶体学 | 6篇 |
力学 | 535篇 |
综合类 | 80篇 |
数学 | 1865篇 |
物理学 | 1242篇 |
出版年
2024年 | 10篇 |
2023年 | 48篇 |
2022年 | 97篇 |
2021年 | 83篇 |
2020年 | 96篇 |
2019年 | 99篇 |
2018年 | 93篇 |
2017年 | 136篇 |
2016年 | 135篇 |
2015年 | 92篇 |
2014年 | 184篇 |
2013年 | 262篇 |
2012年 | 171篇 |
2011年 | 193篇 |
2010年 | 168篇 |
2009年 | 206篇 |
2008年 | 235篇 |
2007年 | 235篇 |
2006年 | 204篇 |
2005年 | 171篇 |
2004年 | 155篇 |
2003年 | 138篇 |
2002年 | 131篇 |
2001年 | 120篇 |
2000年 | 108篇 |
1999年 | 81篇 |
1998年 | 78篇 |
1997年 | 63篇 |
1996年 | 66篇 |
1995年 | 57篇 |
1994年 | 36篇 |
1993年 | 34篇 |
1992年 | 41篇 |
1991年 | 22篇 |
1990年 | 19篇 |
1989年 | 21篇 |
1988年 | 14篇 |
1987年 | 13篇 |
1986年 | 19篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 3篇 |
1982年 | 15篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1973年 | 7篇 |
1969年 | 2篇 |
1957年 | 2篇 |
排序方式: 共有4220条查询结果,搜索用时 15 毫秒
31.
We review the Lorentz-covariant approach to loop quantum gravity. This approach solves the Immirzi parameter problem occurring in the standard loop approach based on the SU(2) gauge group. We show that there exists a unique loop quantization preserving all the classical symmetries at the quantum level and that the results obtained with it, such as the area operator spectrum, are independent of the Immirzi parameter. The standard SU(2) approach violates the diffeomorphism invariance and is therefore an incorrect quantization of gravity. 相似文献
32.
33.
Jean-Pierre Dedieu Gregorio Malajovich Mike Shub 《Foundations of Computational Mathematics》2005,5(2):145-171
We prove a linear bound on the average total curvature of the
central path of linear programming theory in terms of the number
of independent variables of the primal problem, and independent of
the number of constraints. 相似文献
34.
Various problems associated with optimal path planning for mobile observers such as mobile robots equipped with cameras to obtain maximum visual coverage of a surface in the three-dimensional Euclidean space are considered. The existence of solutions to these problems is discussed first. Then, optimality conditions are derived by considering local path perturbations. Numerical algorithms for solving the corresponding approximate problems are proposed. Detailed solutions to the optimal path planning problems for a few examples are given. 相似文献
35.
魏嵬 《数学的实践与认识》2007,37(16):76-83
为给转炉设计提供依据,需要计算炉液倾动的重心.利用数学方法将实际问题进行简化,通过分析炉液倾动过程中变量间的相互关系,来确定每个倾动角度对应情况下的液面位置.利用数学中三重积分的有关应用,进一步得出转炉在每个倾动角度为α∈(0,π2)时的重心计算方法及相关结论,在理论上为工程计算重心的方法提供参考. 相似文献
36.
We extend an earlier method for solving kinetic boundary layer problems to the case of particles moving in aspatially inhomogeneous background. The method is developed for a gas mixture containing a supersaturated vapor and a light carrier gas from which a small droplet condenses. The release of heat of condensation causes a temperature difference between droplet and gas in the quasistationary state; the kinetic equation describing the vapor is the stationary Klein-Kramers equation for Brownian particles diffusing in a temperature gradient. By means of an expansion in Burnett functions, this equation is transformed into a set of coupled algebrodifferential equations. By numerical integration we construct fundamental solutions of this equation that are subsequently combined linearly to fulfill appropriate mesoscopic boundary conditions for particles leaving the droplet surface. In view of the intrinsic numerical instability of the system of equations, a novel procedure is developed to remove the admixture of fast growing solutions to the solutions of interest. The procedure is tested for a few model problems and then applied to a slightly simplified condensation problem with parameters corresponding to the condensation of mercury in a background of neon. The effects of thermal gradients and thermodiffusion on the growth rate of the droplet are small (of the order of 1%), but well outside of the margin of error of the method. 相似文献
37.
J. Schulte 《Journal of statistical physics》1993,70(5-6):1343-1347
The thermodynamic stability of4He4–13 at 3.2 K is investigated with the classical Monte Carlo method, with the semiclassical path-integral Monte Carlo (PIMC) method, and with the semiclassical all-order many-body method. In the all-order many-body simulation the dipole-dipole approximation including short-range correction is used. The resulting stability plots are discussed and related to recent TOF experiments by Stephens and King. It is found that with classical Monte Carlo of course the characteristics of the measured mass spectrum cannot be resolved. With PIMC, switching on more and more quantum mechanics. by raising the number of virtual time steps results in more structure in the stability plot, but this did not lead to sufficient agreement with the TOF experiment. Only the all-order many-body method resolved the characteristic structures of the measured mass spectrum, including magic numbers. The result shows the influence of quantum statistics and quantum mechanics on the stability of small neutral helium clusters. 相似文献
38.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
39.
本文通过对有效需求一物价指数统计模型的研究 ,估计出了有效需求方程 ,并且通过对模型的估计结果分析得出如下结论 :物价指数对有效需求的影响是显著的 :通货紧缩、物价指数持续走低是有效需求不足的主要原因 ,治理通货紧缩应该是解决我国有效需求不足的主要任务。 相似文献
40.
Hossam A. Zaki 《Computational Optimization and Applications》1995,4(1):23-45
State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented. 相似文献