首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   28735篇
  免费   823篇
  国内免费   230篇
化学   19573篇
晶体学   135篇
力学   658篇
综合类   1篇
数学   5448篇
物理学   3973篇
  2022年   188篇
  2021年   276篇
  2020年   351篇
  2019年   320篇
  2018年   279篇
  2017年   293篇
  2016年   604篇
  2015年   637篇
  2014年   663篇
  2013年   1419篇
  2012年   1426篇
  2011年   1724篇
  2010年   963篇
  2009年   823篇
  2008年   1472篇
  2007年   1481篇
  2006年   1567篇
  2005年   1412篇
  2004年   1337篇
  2003年   1104篇
  2002年   1051篇
  2001年   455篇
  2000年   416篇
  1999年   398篇
  1998年   385篇
  1997年   436篇
  1996年   405篇
  1995年   367篇
  1994年   399篇
  1993年   352篇
  1992年   325篇
  1991年   332篇
  1990年   286篇
  1989年   295篇
  1988年   269篇
  1987年   223篇
  1986年   255篇
  1985年   372篇
  1984年   372篇
  1983年   326篇
  1982年   354篇
  1981年   328篇
  1980年   349篇
  1979年   275篇
  1978年   307篇
  1977年   284篇
  1976年   228篇
  1975年   197篇
  1974年   201篇
  1973年   176篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
This paper describes symmetries of all integrable difference equations that belong to the famous Adler–Bobenko–Suris classification. For each equation, the characteristics of symmetries satisfy a functional equation, which we solve by reducing it to a system of partial differential equations. In this way, all five-point symmetries of integrable equations on the quad-graph are found. These include mastersymmetries, which allow one to construct infinite hierarchies of local symmetries. We also demonstrate a connection between the symmetries of quad-graph equations and those of the corresponding Toda type difference equations.  相似文献   
102.
We give trace norm estimates for products of integral operators and for diffusion semigroups. These are applied to differences of heat semigroups. A natural example of an integral operator with finite trace which is not trace class is given.  相似文献   
103.
104.
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.  相似文献   
105.
106.
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.

  相似文献   

107.
108.
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.  相似文献   
109.
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.  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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