首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   113206篇
  免费   5181篇
  国内免费   4208篇
化学   50311篇
晶体学   1241篇
力学   8383篇
综合类   280篇
数学   35904篇
物理学   26476篇
  2024年   72篇
  2023年   595篇
  2022年   863篇
  2021年   1058篇
  2020年   1224篇
  2019年   1215篇
  2018年   11219篇
  2017年   10986篇
  2016年   7428篇
  2015年   2283篇
  2014年   2039篇
  2013年   2790篇
  2012年   6728篇
  2011年   13577篇
  2010年   7737篇
  2009年   8106篇
  2008年   8945篇
  2007年   10883篇
  2006年   2234篇
  2005年   3069篇
  2004年   2878篇
  2003年   3030篇
  2002年   2079篇
  2001年   1153篇
  2000年   1076篇
  1999年   877篇
  1998年   829篇
  1997年   693篇
  1996年   771篇
  1995年   634篇
  1994年   555篇
  1993年   520篇
  1992年   453篇
  1991年   403篇
  1990年   342篇
  1989年   279篇
  1988年   268篇
  1987年   217篇
  1986年   231篇
  1985年   228篇
  1984年   166篇
  1983年   109篇
  1982年   131篇
  1981年   105篇
  1980年   105篇
  1979年   109篇
  1978年   84篇
  1977年   58篇
  1976年   60篇
  1973年   73篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
993.
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.  相似文献   
994.
995.
996.
We have measured the resistivity of the YBa2Cu3O7–Ag composite system with Ag volume fraction,p Ag ranging from 0–100%. The percolation behavior and the normal-state resistivity are studied. We find a three-dimensional threshold for the Ag matrix occurring atp Ag 20% and a threshold for the superconducting matrix occurring at 1–p Ag30%. The electrical resistivity is interpreted in terms of a resistivity model for granular YBa2Cu3O7 proposed by Halbritter et al. [Z. Phys. B —Condensed Matter71, 411 (1988)]. Based on this model, we show that the resistivities between the YBa2Cu3O7 grains and flaws in the grains are greatly diminished in the samples, indicating significantly improved grain growth behavior of the YBa2Cu3O7 phase resulting from the addition of Ag. With the diminishing of the grain boundary resistivities, an intrinsic value for the temperature coefficient of resistivity, (1/gr)(d/dT), can be inferred, which is 3.3×10–3/K at 300 K. This value is very close to that observed in the Cu–O2 planes in single crystals and epitaxial films of YBa2Cu3O7.  相似文献   
997.
998.
In the paper, we give the almost sure limiting behaviour of the increments of partial sums of a-mixing sequence when the moment generating functions do not exist. The results obtained are close to those for an independent sequence provided that the mixing coefficients tend to zero rapidly enough.The Project Supported by National Natural Science Foundation of China.  相似文献   
999.
Optimality for set functions with values in ordered vector spaces   总被引:3,自引:0,他引:3  
Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.  相似文献   
1000.
We first demonstrate that mixed strategies are relevant in decision analysis for a maximin decision-maker quite apart from any game-theory considerations. This rectifies the apparent misconception that results from MS/OR textbooks which discuss mixed strategies only in the game-theory setting. Next we show an example of an implementable mixed strategy, by which we mean a mixed decision strategy which does not require randomization for its implementation. This application is to portfolio construction.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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