首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   122739篇
  免费   1880篇
  国内免费   414篇
化学   51950篇
晶体学   1027篇
力学   7412篇
综合类   1篇
数学   39824篇
物理学   24819篇
  2023年   335篇
  2022年   335篇
  2021年   549篇
  2020年   712篇
  2019年   662篇
  2018年   11006篇
  2017年   10779篇
  2016年   7559篇
  2015年   2187篇
  2014年   1672篇
  2013年   3372篇
  2012年   6536篇
  2011年   12877篇
  2010年   7254篇
  2009年   7397篇
  2008年   8769篇
  2007年   10688篇
  2006年   2202篇
  2005年   3256篇
  2004年   3221篇
  2003年   3378篇
  2002年   2266篇
  2001年   1248篇
  2000年   1278篇
  1999年   846篇
  1998年   727篇
  1997年   588篇
  1996年   806篇
  1995年   544篇
  1994年   581篇
  1993年   544篇
  1992年   531篇
  1991年   475篇
  1990年   515篇
  1989年   433篇
  1988年   439篇
  1987年   397篇
  1986年   382篇
  1985年   499篇
  1984年   465篇
  1983年   372篇
  1982年   376篇
  1981年   392篇
  1980年   327篇
  1979年   319篇
  1978年   305篇
  1977年   281篇
  1976年   293篇
  1974年   264篇
  1973年   288篇
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
991.
This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.  相似文献   
992.
In this note, we characterize the regular probability measures satisfying the Choquet-Deny convolution equation =* on Abelian topological semigroups for a given probability measure .  相似文献   
993.
For eachd1 there is a constantc d>0 such that any finite setXR d contains a subsetYX, |Y|[1/4d(d+3)]+1 having the following property: ifEY is an ellipsoid, then |E X|c d |X|.On leave from the Mathematical Institute of the Hungarian Academy of Sciences, 1364 Budapest, P.O. Box 127, Hungary. Supported by a research fellowship from the Science and Engineering Research Council, U.K., and by Hungarian National Foundation for Scientific Research Grant No. 1812.  相似文献   
994.
995.
We study the effects of some of the most important and typical structural changes in two-phase systems on selected structural parameters obtained from small-angle x-ray scattering (SAXS) measurements. To limit the present study, it was assumed that the Phase, 1, embedded in the matrix
  1. is monodispersed and homogeneous,
  2. possesses one of the three most extreme shapes (spherical, fibrillar or lamellar) and
  3. changes its behaviour
  1. through type change (spinodal or nucleotic or coarsening), without changing the shape,
  2. through a change of the shape only, or
  3. through a) (type change) and b) (shape change) simultaneously.
To find the type of change for three basically different shapes of Phase 1 and to calculate its intensity (amount of the change) the following three SAXS parameters must be compared before and after the treatment of the system:
  1. chord lengthl 1 (and/or radius of gyrationR),
  2. volume partw 1 of the Phase 1, and
  3. relative inner surfaceS v of the system.
It is shown by this comparison that by the pure type change in the case of
  1. spinodal change, all three SAXRS parameters are increasing or decreasing simultaneously and proportional to a power of the intensity of the change,
  2. nucleotic change,l 1 (and/orR) is unchanged, the other two (w 1 andS v ) are increasing or decreasing simultaneously and directly proportional to the intensity,
  3. coarsening change,w 1 is unchanged and anincreasing ofl 1 is always accompanied by adecreasing ofS v and vice versa.
In addition to this type change, the cases of mere changes of the shape (“shape change”) and finally of simultaneous type and/or shape change are studied. For the case of pure shape change the alteration of the dimensions (chord lengthl 1 and/or radius of gyrationR) must be followed. The limitations of the analyses of the simultaneous type and/or shape change are discussed in detail.  相似文献   
996.
997.
998.
Summary Motivated by different mean value properties, the functional equationsf(x) – f(y)/x–y=[(x, y)], (i)xf(y) – yf(x)/x–y=[(x, y)] (ii) (x y) are completely solved when, are arithmetic, geometric or harmonic means andx, y elements of proper real intervals. In view of a duality between (i) and (ii), three of the results are consequences of other three.The equation (ii) is also solved when is a (strictly monotonic) quasiarithmetic mean while the real interval contains 0 and when is the arithmetic mean while the domain is a field of characteristic different from 2 and 3. (A result similar to the latter has been proved previously for (i).)  相似文献   
999.
1000.
In the following note we investigate the second smallest distance between finitely many points on the sphere. Actually we look for the smallest upper bound for the second smallest distance between n points on the unit sphere. We solve this problem for n=9 and also we give a general, non-trivial upper bound for the second smallest distance of n points with n9.Supported by the Hungarian National Foundation for Scientific Research, Number 1238.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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