首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27866篇
  免费   871篇
  国内免费   174篇
化学   19627篇
晶体学   269篇
力学   624篇
综合类   2篇
数学   4252篇
物理学   4137篇
  2022年   163篇
  2021年   277篇
  2020年   443篇
  2019年   395篇
  2018年   270篇
  2017年   273篇
  2016年   584篇
  2015年   505篇
  2014年   641篇
  2013年   1313篇
  2012年   1415篇
  2011年   1806篇
  2010年   894篇
  2009年   741篇
  2008年   1495篇
  2007年   1533篇
  2006年   1503篇
  2005年   1477篇
  2004年   1295篇
  2003年   1024篇
  2002年   1027篇
  2001年   337篇
  2000年   335篇
  1999年   293篇
  1998年   301篇
  1997年   356篇
  1996年   421篇
  1995年   309篇
  1994年   278篇
  1993年   336篇
  1992年   270篇
  1991年   264篇
  1990年   235篇
  1989年   198篇
  1988年   211篇
  1987年   219篇
  1986年   187篇
  1985年   314篇
  1984年   377篇
  1983年   269篇
  1982年   332篇
  1981年   344篇
  1980年   270篇
  1979年   261篇
  1978年   319篇
  1977年   251篇
  1976年   235篇
  1975年   214篇
  1974年   231篇
  1973年   196篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
12.
13.
In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.  相似文献   
14.
15.
16.

The combinatorial integral approximation decomposition splits the optimization of a discrete-valued control into two steps: solving a continuous relaxation of the discrete control problem, and computing a discrete-valued approximation of the relaxed control. Different algorithms exist for the second step to construct piecewise constant discrete-valued approximants that are defined on given decompositions of the domain. It is known that the resulting discrete controls can be constructed such that they converge to a relaxed control in the \(\hbox {weak}^*\) topology of \(L^\infty \) if the grid constant of this decomposition is driven to zero. We exploit this insight to formulate a general approximation result for optimization problems, which feature discrete and distributed optimization variables, and which are governed by a compact control-to-state operator. We analyze the topology induced by the grid refinements and prove convergence rates of the control vectors for two problem classes. We use a reconstruction problem from signal processing to demonstrate both the applicability of the method outside the scope of differential equations, the predominant case in the literature, and the effectiveness of the approach.

  相似文献   
17.
Results from 5D induced-matter and membrane theory with null paths are extended to show that a particle obeys the 4D Klein-Gordon equation but with a variable mass. The Dirac equation also follows, but raises concerns about 4D quantization in the two natural 5D gauges, and reopens the question of a Regge-like trajectory for the spin angular momenta and squared masses of gravitationally-dominated systems.  相似文献   
18.
19.
Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP th -degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910  相似文献   
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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