首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2991篇
  免费   83篇
  国内免费   4篇
化学   1796篇
晶体学   35篇
力学   74篇
数学   339篇
物理学   834篇
  2020年   28篇
  2019年   25篇
  2017年   22篇
  2016年   76篇
  2015年   63篇
  2014年   52篇
  2013年   131篇
  2012年   102篇
  2011年   118篇
  2010年   87篇
  2009年   78篇
  2008年   118篇
  2007年   139篇
  2006年   118篇
  2005年   83篇
  2004年   83篇
  2003年   82篇
  2002年   79篇
  2001年   74篇
  2000年   67篇
  1999年   66篇
  1998年   34篇
  1997年   41篇
  1996年   48篇
  1995年   49篇
  1994年   39篇
  1993年   40篇
  1992年   67篇
  1991年   36篇
  1990年   50篇
  1989年   34篇
  1988年   45篇
  1987年   30篇
  1986年   35篇
  1985年   50篇
  1984年   37篇
  1983年   33篇
  1982年   39篇
  1981年   33篇
  1980年   53篇
  1979年   40篇
  1978年   36篇
  1977年   47篇
  1976年   31篇
  1975年   36篇
  1974年   27篇
  1973年   25篇
  1971年   24篇
  1967年   26篇
  1966年   24篇
排序方式: 共有3078条查询结果,搜索用时 15 毫秒
11.
We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times.  相似文献   
12.
We describe links between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lovász’s theta function. It turns out that the connection between the convex bodies defining the semidefinite relaxations mimics the connection existing between the corresponding polyhedra. We also show how the semidefinite relaxations can be combined with the classical linear relaxations in order to obtain tighter relaxations. This work was done while the author visited CWI, Amsterdam, The Netherlands. Svata Poljak untimely deceased in April 1995. We shall both miss Svata very much. Svata was an excellent colleague, from whom we learned a lot of mathematics and with whom working was always a very enjoyable experience; above all, Svata was a very nice person and a close friend of us. The research was partly done while the author visited CWI, Amsterdam, in October 1994 with a grant fom the Stieltjes Institute, whose support is gratefully acknowledged. Partially supported also by GACR 0519. Research support by Christian Doppler Laboratorium für Diskrete Optimierung.  相似文献   
13.
14.
After reviewing the presently available quadrature schemes for the discrete ordinates method, the accuracy of different schemes is analyzed and evaluated. It is shown from a comprehensive error analysis that the moment conditions have to satisfied not only for the principal coordinates directions, as it is mostly carried out, but for any arbitrary test direction. Among the schemes with approximately 50 discrete ordinates the DCT-020-2468 quadrature was found to give the best accuracy. The highest accuracy among all schemes is achieved by the LC-11 quadrature which requires 96 discrete ordinates. This scheme is rarely used up to date and deserves more attention for high accuracy predictions.  相似文献   
15.
16.
Patent-Teil     
Ohne Zusammenfassung  相似文献   
17.
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.  相似文献   
18.
The Nd:YAG laser-induced breakdown of 20 μm glass microspheres was investigated using time-resolved optical shadow and Schlieren images. Time-resolved imaging showed the location of the initial breakdown and the shockwave motion over its first 400 μm of expansion. Measured shockwave velocities were in the range of 1–10 km/s and showed a linear dependency on laser fluence within 30 ns.  相似文献   
19.
20.
Management of moisture penetration and hydrolytic degradation of polylactide (PLA) is extremely important during the manufacturing, shipping, storage, and end-use of PLA products. Moisture transport, crystallization, and degradation, in PLA have been measured through a variety of experimental techniques including size-exclusion chromatography, differential scanning calorimetry, and X-ray diffraction. Quartz crystal microbalance and dynamic vapor sorption experiments have also been used to measure moisture sorption isotherms in PLA films with varying crystallinity. A surprising result is that, within the accuracy of the experiments, crystalline and amorphous PLA films exhibit identical sorption isotherms.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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