首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   30334篇
  免费   846篇
  国内免费   241篇
化学   20418篇
晶体学   143篇
力学   703篇
综合类   1篇
数学   5671篇
物理学   4485篇
  2021年   290篇
  2020年   360篇
  2019年   328篇
  2018年   293篇
  2017年   303篇
  2016年   629篇
  2015年   644篇
  2014年   690篇
  2013年   1507篇
  2012年   1524篇
  2011年   1826篇
  2010年   1007篇
  2009年   854篇
  2008年   1578篇
  2007年   1566篇
  2006年   1636篇
  2005年   1484篇
  2004年   1413篇
  2003年   1165篇
  2002年   1111篇
  2001年   493篇
  2000年   453篇
  1999年   422篇
  1998年   403篇
  1997年   452篇
  1996年   434篇
  1995年   393篇
  1994年   422篇
  1993年   380篇
  1992年   359篇
  1991年   339篇
  1990年   294篇
  1989年   303篇
  1988年   288篇
  1987年   232篇
  1986年   252篇
  1985年   392篇
  1984年   405篇
  1983年   331篇
  1982年   382篇
  1981年   340篇
  1980年   370篇
  1979年   299篇
  1978年   336篇
  1977年   305篇
  1976年   257篇
  1975年   209篇
  1974年   222篇
  1973年   193篇
  1972年   125篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
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.  相似文献   
122.
123.
For linear statistical ill-posed problems in Hilbert spaces we introduce an adaptive procedure to recover the unknown solution from indirect discrete and noisy data. This procedure is shown to be order optimal for a large class of problems. Smoothness of the solution is measured in terms of general source conditions. The concept of operator monotone functions turns out to be an important tool for the analysis.

  相似文献   

124.
125.
The small-signal analysis of a simple model of three rate equations is performed rigorously by means of both the Routh-Hurwitz theorem and Descartes' sign rule, and the relationship between bistable behaviour and self-sustained pulsations (SSPs) is investigated. Because one eigenvalue of the Jacobian of the model system is always negative, small-amplitude, sinusoidal SSPs can be described in terms of Haken's dressed-mode variables on a two-dimensional centre manifold. Possible simplifications for the switching modelling are also mentioned.  相似文献   
126.
Microelectromagnet for magnetic manipulation in lab-on-a-chip systems   总被引:5,自引:0,他引:5  
We demonstrate a simple scheme for fabrication of microelectromagnets consisting of planar spiral coils semi-encapsulated in soft magnetic yokes using conventional microfabrication techniques. The microelectromagnets are suitable for applications operating at frequencies below 250 kHz. Conventional fabrication schemes for planar microelectromagnets typically rely on five mask steps. We allow the current to flow in the soft magnetic yoke and thereby two mask steps are eliminated. We have characterized the electromagnets electrically, the results agree well with theory, and the implications arising from current flowing in the magnetic yoke are discussed. We have integrated the microelectromagnets with microfluidic channels, and demonstrated separation of commercially available magnetic beads from a fluid in a microfluidic system, i.e. a lab-on-a-chip system.  相似文献   
127.
128.
Empirical minimization   总被引:3,自引:0,他引:3  
We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.  相似文献   
129.
130.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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