首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   71960篇
  免费   1815篇
  国内免费   387篇
化学   43455篇
晶体学   402篇
力学   1721篇
综合类   6篇
数学   12106篇
物理学   16472篇
  2021年   614篇
  2020年   864篇
  2019年   724篇
  2018年   784篇
  2017年   787篇
  2016年   1666篇
  2015年   1396篇
  2014年   1563篇
  2013年   3321篇
  2012年   3161篇
  2011年   3628篇
  2010年   2265篇
  2009年   1923篇
  2008年   3282篇
  2007年   3134篇
  2006年   3180篇
  2005年   2875篇
  2004年   2637篇
  2003年   2166篇
  2002年   2031篇
  2001年   1396篇
  2000年   1192篇
  1999年   976篇
  1998年   898篇
  1997年   914篇
  1996年   1013篇
  1995年   896篇
  1994年   974篇
  1993年   926篇
  1992年   954篇
  1991年   765篇
  1990年   738篇
  1989年   704篇
  1988年   696篇
  1987年   654篇
  1986年   656篇
  1985年   919篇
  1984年   938篇
  1983年   762篇
  1982年   836篇
  1981年   784篇
  1980年   801篇
  1979年   719篇
  1978年   738篇
  1977年   707篇
  1976年   618篇
  1975年   577篇
  1974年   575篇
  1973年   502篇
  1967年   510篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
82.
We prove stability of rotationally symmetric translating solutions to mean curvature flow. For initial data that converge spatially at infinity to such a soliton, we obtain convergence for large times to that soliton without imposing any decay rates. The authors are members of SFB 647/B3 “Raum – Zeit – Materie: Singularity Structure, Long-time Behaviour and Dynamics of Solutions of Non-linear Evolution Equations”.  相似文献   
83.
In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.  相似文献   
84.
Brandau  C.  Bartsch  T.  Böhm  S.  Böhme  C.  Hoffknecht  A.  Kieslich  S.  Knopp  H.  Schippers  S.  Shi  W.  Müller  A.  Grün  N.  Scheid  W.  Steih  T.  Bosch  F.  Franzke  B.  Kozhuharov  C.  Krämer  A.  Mokler  P. H.  Nolden  F.  Steck  M.  Stöhlker  T.  Stachura  Z. 《Hyperfine Interactions》2003,146(1-4):41-45
Hyperfine Interactions - An overview of measurements of dielectronic recombination (DR) with the heaviest lithiumlike ions is presented. The experiments have been carried out at the heavy ion...  相似文献   
85.
86.
87.
A new resonator design for doubly resonant continuous-wave (CW) intracavity sum-frequency mixing (SFM) is reported. 1.12 W of coherent radiation at 588 nm is generated by mixing 1062-nm Nd:GdVO4laser and 1319-nm Nd:YAG laser. The optical-to-optical conversion efficiency is up to 3.7%.  相似文献   
88.
Let Top 0 be the category of topological T 0-spaces, QU 0 the category of quasi-uniform T 0-spaces, T : QU 0 Top 0 the usual forgetful functor and K : QU 0 QU 0 the bicompletion reflector with unit k : 1 → K. Any T-section F : Top 0 QU 0 is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU 0 is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).  相似文献   
89.
90.
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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