全文获取类型
收费全文 | 374164篇 |
免费 | 1955篇 |
国内免费 | 703篇 |
专业分类
化学 | 160648篇 |
晶体学 | 5414篇 |
力学 | 23469篇 |
综合类 | 3篇 |
数学 | 73418篇 |
物理学 | 113870篇 |
出版年
2021年 | 3168篇 |
2020年 | 3457篇 |
2019年 | 4226篇 |
2018年 | 16427篇 |
2017年 | 16355篇 |
2016年 | 13877篇 |
2015年 | 4361篇 |
2014年 | 7202篇 |
2013年 | 12464篇 |
2012年 | 13792篇 |
2011年 | 21956篇 |
2010年 | 15460篇 |
2009年 | 16027篇 |
2008年 | 17849篇 |
2007年 | 19683篇 |
2006年 | 10201篇 |
2005年 | 9881篇 |
2004年 | 9849篇 |
2003年 | 9691篇 |
2002年 | 9033篇 |
2001年 | 7900篇 |
2000年 | 6331篇 |
1999年 | 4642篇 |
1998年 | 4437篇 |
1997年 | 4263篇 |
1996年 | 3927篇 |
1995年 | 3411篇 |
1994年 | 3432篇 |
1993年 | 3466篇 |
1992年 | 3435篇 |
1991年 | 3848篇 |
1990年 | 3836篇 |
1989年 | 3852篇 |
1988年 | 3604篇 |
1987年 | 3687篇 |
1986年 | 3380篇 |
1985年 | 3897篇 |
1984年 | 4129篇 |
1983年 | 3523篇 |
1982年 | 3728篇 |
1981年 | 3411篇 |
1980年 | 3180篇 |
1979年 | 3672篇 |
1978年 | 3724篇 |
1977年 | 3877篇 |
1976年 | 3949篇 |
1975年 | 3690篇 |
1974年 | 3542篇 |
1973年 | 3714篇 |
1972年 | 3197篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
V. A. Klyachin 《Siberian Mathematical Journal》1992,33(5):928-932
Volgograd. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 33, No. 5, pp. 201–205, September–October, 1992. 相似文献
992.
Christian Prins 《The Journal of the Operational Research Society》1994,45(6):611-623
Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints. 相似文献
993.
Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n2 log2n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(logm/n log nn)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(nε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n). 相似文献
994.
995.
G. V. Plyatsko V. N. Maksimovich L. V. Khomlyak 《Journal of Mathematical Sciences》1992,62(1):2518-2523
We solve the thermoplastic problem for a semi-infinite plate under local nonstationary heating by heat sources. The physical equations are taken to be the relations of the nonisothermic theory of plastic flow associated with the Mises fluidity condition. The solution of the problem is constructed by the method of integral equations and the self-correcting method of sequential loading, where time is taken as the loading parameter. We carry out numerical computations of the stresses in the case of heating a plate with heat output by normal-circular heat sources. We study the problem of optimization of heating regimes in order to introduce favorable residual compressive stresses (from the point of view of hardness) in a given region of a half-plane. Two figures.Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 27, 1988, pp. 29–34. 相似文献
996.
997.
998.
999.
1000.