首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   373677篇
  免费   1907篇
  国内免费   710篇
化学   159968篇
晶体学   5412篇
力学   23479篇
综合类   3篇
数学   73579篇
物理学   113853篇
  2021年   3131篇
  2020年   3421篇
  2019年   4204篇
  2018年   16408篇
  2017年   16352篇
  2016年   13839篇
  2015年   4340篇
  2014年   7167篇
  2013年   12453篇
  2012年   13773篇
  2011年   21923篇
  2010年   15448篇
  2009年   16006篇
  2008年   17831篇
  2007年   19664篇
  2006年   10175篇
  2005年   9853篇
  2004年   9825篇
  2003年   9676篇
  2002年   9024篇
  2001年   7894篇
  2000年   6336篇
  1999年   4637篇
  1998年   4437篇
  1997年   4264篇
  1996年   3927篇
  1995年   3412篇
  1994年   3437篇
  1993年   3470篇
  1992年   3437篇
  1991年   3857篇
  1990年   3840篇
  1989年   3855篇
  1988年   3603篇
  1987年   3687篇
  1986年   3380篇
  1985年   3900篇
  1984年   4129篇
  1983年   3528篇
  1982年   3728篇
  1981年   3411篇
  1980年   3178篇
  1979年   3665篇
  1978年   3720篇
  1977年   3873篇
  1976年   3947篇
  1975年   3687篇
  1974年   3537篇
  1973年   3712篇
  1972年   3194篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
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.  相似文献   
992.
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).  相似文献   
993.
994.
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.  相似文献   
995.
996.
997.
998.
999.
1000.
A problem in the optimal estimation of a linear dynamical system is solved under the condition that the effects on the system of noise and observation error belong to a prescribed parallelepiped region.Translated fromVychislitel'naya i Prikladnaya Matematika, No. 69, pp. 110–114, 1989.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号