全文获取类型
收费全文 | 98501篇 |
免费 | 3811篇 |
国内免费 | 2858篇 |
专业分类
化学 | 38706篇 |
晶体学 | 982篇 |
力学 | 8189篇 |
综合类 | 209篇 |
数学 | 34100篇 |
物理学 | 22984篇 |
出版年
2024年 | 78篇 |
2023年 | 445篇 |
2022年 | 777篇 |
2021年 | 849篇 |
2020年 | 905篇 |
2019年 | 860篇 |
2018年 | 11001篇 |
2017年 | 10719篇 |
2016年 | 6973篇 |
2015年 | 1883篇 |
2014年 | 1495篇 |
2013年 | 1898篇 |
2012年 | 5562篇 |
2011年 | 12360篇 |
2010年 | 6808篇 |
2009年 | 7182篇 |
2008年 | 7761篇 |
2007年 | 9812篇 |
2006年 | 1344篇 |
2005年 | 2226篇 |
2004年 | 2336篇 |
2003年 | 2564篇 |
2002年 | 1570篇 |
2001年 | 750篇 |
2000年 | 748篇 |
1999年 | 593篇 |
1998年 | 576篇 |
1997年 | 469篇 |
1996年 | 536篇 |
1995年 | 440篇 |
1994年 | 376篇 |
1993年 | 328篇 |
1992年 | 300篇 |
1991年 | 269篇 |
1990年 | 229篇 |
1989年 | 213篇 |
1988年 | 151篇 |
1987年 | 146篇 |
1986年 | 133篇 |
1985年 | 125篇 |
1984年 | 84篇 |
1983年 | 82篇 |
1982年 | 78篇 |
1981年 | 60篇 |
1980年 | 61篇 |
1979年 | 52篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Toshikazu Kimura 《The Journal of the Operational Research Society》1991,42(7):595-603
This paper deals with refining Cosmetatos's approximation for the mean waiting time in an M/D/s queue. Although his approximation performs quite well in heavy traffic, it overestimates the true value when the number of servers is large or the traffic is light. We first focus on a normalized quantity that is a ratio of the mean waiting times for the M/D/s and M/M/s queues. Using some asymptotic properties of the quantity, we modify Cosmetatos's approximation to obtain better accuracy both for large s and in light traffic. To see the quality of our approximation, we compare it with the exact value and some previous approximations. Extensive numerical tests indicate that the relative percentage error is less than 1% for almost all cases with s ≤ 20 and at most 5% for other cases. 相似文献
992.
Toshikazu Kimura 《The Journal of the Operational Research Society》1991,42(11):959-970
We provide two distribution-dependent approximations for the mean waiting time in a GI/G/s queue. Both approximations are weighted combinations of the exact mean waiting times for the GI/M/s and M/D/s queues each of which has the same mean service time and traffic intensity as in the approximating GI/G/s queue. The weights in the approximations are expressed by the service-time c.d.f. and the first two moments of interarrival and service times. To examine the performance of our approximations, they are numerically compared with exact solutions and previous two-moment approximations for various cases. Extensive numerical comparisons indicate that the relative percentage errors of the approximations are of the order of 5% in moderate traffic and 1% in heavy traffic, except for extreme cases. 相似文献
993.
994.
995.
996.
997.
Yongjin Xu Beisheng Kang Xuetai Chen Yuanba Cai Yonghan Hu Jiaxi Lu 《Journal of Cluster Science》1992,3(2):167-177
Complex Co4mp4(Hmp)(PBu
3
n
)3 (1) (H2mp=o-Mercaptophenol) was obtained from the reaction of CoCl2 and H2mp in the presence of PBu
n
3 and NaOMe with restricted oxidation. X-ray crystallographic data: triclinic, space group
,a=15.657(5) Å,b=20.469(8) Å,c=12.383(3) Å,=93.59(3)°, =112.45(2)°, =93.65(3)°,V=3648.7 Å3,Z=2,D
c
=1.33 g/cm3;R=0.065. The molecule consists of four cobalt atoms unsymmetrically bridged by S or S and O atoms from four of the five mp ligands. The fifth mp is terminally chelated to Co(4) which is in a distorted trigonal bipyramidal geometry, while Co(1)-Co(3) are square pyramidal. Atom Co(2) is bonded to Co(1) and Co(3) (average distance 2.632 Å) with strong interactions while Co(4) is only loosely connected to Co(1) (3.402 Å) and Co(3) (2.956 Å) through oxygen bridges and a hydrogen bond. The different coordination environments O2S2P, S4P, and O4S of the cobalt atoms make the molecule highly asymmetrical. XPS fitting data confirm the difference of the Co atoms. FABMS data indicate the possible fragmentation routes. The complex is paramagnetic with eff=5.2 B. 相似文献
998.
Robert W. Ashford Peter Connard Robert Daniel 《The Journal of the Operational Research Society》1992,43(5):519-531
The time-consuming process of solving large-scale Mixed Integer Programming problems using the branch-and-bound technique can be speeded up by introducing a degree of parallelism into the basic algorithm. This paper describes the development and implementation of a parallel branch-and-bound algorithm created by adapting a commercial MIP solver. Inherent in the design of this software are certain ad hoc methods, the use of which are necessary in the effective solution of real problems. The extent to which these ad hoc methods can successfully be transferred to a parallel environment, in this case an array of at most nine transputers, is discussed. Computational results on a variety of real integer programming problems are reported. 相似文献
999.
A general approximate analytic theory of the multijunction grill is developed. Omitting the evanescent modes in the subsidiary waveguides both at the junction and at the grill mouth and neglecting multiple wave reflection between the same places we derive simple formulae for the reflection coefficient, the amplitudes of the incident and reflected waves and the spectral power density. All these quantities are expressed through the basic grill parameters (the electric length of the structure and the phase shift between adjacent waveguides) and two sets of the reflection coefficients describing wave reflections in the subsidiary waveguides at the junction and at the mouth. The approximate expressions for these coefficients are also given. The results are compared with numerical solution of two specific examples and they prove to be useful for the optimization and design of the multijunction grills. For the JET structure, which is composed of multijunction sections, it is shown that, in the case of the dense plasma, many results can be obtained from the simple formulae for two-waveguide multijunction grill.A part of this work was done at the stay of the second author in the Joint Institute of Nuclear Research in Dubna and he wishes to thank that Institution for hospitality. 相似文献
1000.
Rahul Mukerjee 《The Journal of the Operational Research Society》1982,33(10):957-959
The problem of minimising E(X) subject to the constraints X ? 0, P(X ? b) ? a(0 < a < 1) has been considered, where b is a non-negative random variable with continuous probability distribution. A necessary and sufficient condition for randomised decisions to be superior to the non-randomised one has been derived. 相似文献