全文获取类型
收费全文 | 13338篇 |
免费 | 2122篇 |
国内免费 | 972篇 |
专业分类
化学 | 6834篇 |
晶体学 | 84篇 |
力学 | 858篇 |
综合类 | 152篇 |
数学 | 4386篇 |
物理学 | 4118篇 |
出版年
2024年 | 12篇 |
2023年 | 118篇 |
2022年 | 200篇 |
2021年 | 348篇 |
2020年 | 387篇 |
2019年 | 456篇 |
2018年 | 408篇 |
2017年 | 511篇 |
2016年 | 570篇 |
2015年 | 483篇 |
2014年 | 751篇 |
2013年 | 1242篇 |
2012年 | 814篇 |
2011年 | 910篇 |
2010年 | 761篇 |
2009年 | 843篇 |
2008年 | 922篇 |
2007年 | 867篇 |
2006年 | 758篇 |
2005年 | 673篇 |
2004年 | 602篇 |
2003年 | 589篇 |
2002年 | 505篇 |
2001年 | 366篇 |
2000年 | 321篇 |
1999年 | 296篇 |
1998年 | 224篇 |
1997年 | 245篇 |
1996年 | 191篇 |
1995年 | 169篇 |
1994年 | 126篇 |
1993年 | 99篇 |
1992年 | 95篇 |
1991年 | 78篇 |
1990年 | 60篇 |
1989年 | 54篇 |
1988年 | 40篇 |
1987年 | 37篇 |
1986年 | 35篇 |
1985年 | 54篇 |
1984年 | 32篇 |
1983年 | 23篇 |
1982年 | 35篇 |
1981年 | 28篇 |
1980年 | 10篇 |
1979年 | 20篇 |
1978年 | 15篇 |
1977年 | 13篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
Karl Sigman 《Operations Research Letters》2007,35(5):581-583
In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments. 相似文献
102.
D. Abouelaoualim 《Pramana》2006,66(2):455-465
We develop a theoretical model to the scattering time due to the electron-confined LO-phonon in GaAs-AlxGa1-xAs superlattice taking into account the sub-band parabolicity. Using the new analytic wave function of electron miniband conduction
of superlattice and a reformulation slab model for the confined LO-phonon modes, an expression for the electron-confined LO-phonon
scattering time is obtained. In solving numerically a partial differential equation for the phonon generation rate, our results
show that forx = 0.45, the LO-phonon in superlattice changes from a bulk-like propagating mode to a confined mode. The dispersion of the
relaxation time due to the emission of confined LO-phonons depends strongly on the total energy. 相似文献
103.
104.
105.
106.
Aza-Michael addition of optically pure 4-phenyl-2-oxazolidinone to 3,3,3-trifluoro-1-nitropropene proceeds smoothly at low temperature with a high yield. Diastereoselectivity of the addition depends on the base used and lithiated species proved to be highly efficient affording 92% de. Optically pure 1,2-diamino-3,3,3-trifluoropropane is prepared in 58% yield from the aza-Michael addition product through a three-step procedure. 相似文献
107.
安全质量费用工期在网络计划中的系统优化研究 总被引:1,自引:0,他引:1
施工网络计划中安全、质量、费用、工期达到综合优化是工程管理决策追求的目标,在工程项目管理中对这4个指标进行全面系统分析,并且进行综合均衡优化,对于提高工程项目的综合效益至关重要.采取在网络计划所有可行的施工方案中寻求最优的方案组合,从而达到总目标的优化.并且通过一个实例来说明本方法的应用. 相似文献
108.
We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting pn(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for pn(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability
pm(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n0 servers are occupied, 0≤ n0≤ m). Numerical studies back up the asymptotic analysis.
AMS subject classification: 60K25,34E10
Supported in part by NSF grants DMS-99-71656 and DMS-02-02815 相似文献
109.
110.
Online weighted flow time and deadline scheduling 总被引:1,自引:0,他引:1
Luca Becchetti Stefano Leonardi Alberto Marchetti-Spaccamela Kirk Pruhs 《Journal of Discrete Algorithms》2006,4(3):339
In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|ri,pmtn|∑wiFi. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling. 相似文献