首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8850篇
  免费   388篇
  国内免费   698篇
化学   1101篇
晶体学   12篇
力学   421篇
综合类   54篇
数学   6827篇
物理学   1521篇
  2023年   87篇
  2022年   90篇
  2021年   95篇
  2020年   161篇
  2019年   174篇
  2018年   202篇
  2017年   223篇
  2016年   253篇
  2015年   180篇
  2014年   364篇
  2013年   606篇
  2012年   346篇
  2011年   396篇
  2010年   357篇
  2009年   554篇
  2008年   625篇
  2007年   572篇
  2006年   519篇
  2005年   457篇
  2004年   322篇
  2003年   393篇
  2002年   359篇
  2001年   267篇
  2000年   270篇
  1999年   280篇
  1998年   227篇
  1997年   246篇
  1996年   133篇
  1995年   130篇
  1994年   115篇
  1993年   75篇
  1992年   66篇
  1991年   64篇
  1990年   70篇
  1989年   57篇
  1988年   55篇
  1987年   48篇
  1986年   41篇
  1985年   54篇
  1984年   57篇
  1983年   19篇
  1982年   43篇
  1981年   38篇
  1980年   42篇
  1979年   31篇
  1978年   31篇
  1977年   41篇
  1976年   25篇
  1974年   18篇
  1973年   18篇
排序方式: 共有9936条查询结果,搜索用时 15 毫秒
101.
The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator does not depend on the probability law of Y as soon as this law possesses a continuous density. This feature is related to the “arbitrary functions principle” (Poincaré, Hopf). We give extensions of this property to Rd and to the Wiener space for some approximations of the Brownian motion. This gives new approximations of the Ornstein-Uhlenbeck gradient. These results apply to the discretization of some stochastic differential equations encountered in mechanics.  相似文献   
102.
线性相关计算法形成数字剪切散斑相关条纹图   总被引:8,自引:0,他引:8  
何玉明 《光子学报》1995,24(1):13-17
本文提出了用线性相关计算法形成数字剪切散斑干涉条纹的新方法,从理论分析和实验研究均证明,用该方法所获得的数字剪切散斑相关条纹图在图象监视器上易于观看,条纹图象光强无直流分量影响且可见度较减模式要高,该新方法的采用为今后的条纹图象分析奠定了基础。  相似文献   
103.
Stochastic algorithms for optimization problems, where function evaluations are done by Monte Carlo simulations, are presented. At each iteratex i, they draw a predetermined numbern(i) of sample points from an underlying probability space; based on these sample points, they compute a feasible-descent direction, an Armijo stepsize, and the next iteratex i+1. For an appropriate optimality function , corresponding to an optimality condition, it is shown that, ifn(i) , then (x i) 0, whereJ is a set of integers whose upper density is zero. First, convergence is shown for a general algorithm prototype: then, a steepest-descent algorithm for unconstrained problems and a feasible-direction algorithm for problems with inequality constraints are developed. A numerical example is supplied.  相似文献   
104.
Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x n)}, where {x n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper.  相似文献   
105.
I study poles and zeros of zeta functions in one-dimensional maps. Numerical and analytical arguments are given to show that the first pole of one such zeta function is given by the first zero ofanother zeta function: this describes convergence of the calculations of the first zero, which is generally the physically interesting quantity. Some remarks on how these results should generalize to zeta functions of dynamical systems with pruned symbolic dynamics and in higher dimensions follow.  相似文献   
106.
A method of using algebraic curves to obtain estimates of critical points accurate enough to identify them as simple algebraic numbers (if that is what they are) is discussed and illustrated with an application to the (q-state Potts model on the triangular lattice for cases of pure two-site interactions and pure three-site interactions. In the latter case the critical point is conjectured to be . In a similar conjecture for the critical percolation probability on thedirected square lattice,q c 1/2 (q c +3)=2(q c +p c =1).  相似文献   
107.
Extra integrals of motion and the Lax representation are found for interacting spin systems with the HamiltonianH = (J/2) j, k=1,j k N P(j – k) j k , where one of the periods of the WeierstrassP function is equal toN. The Heisenberg and Haldane-Shastry chains appear as limiting cases of these systems at some values of the second period. The simplest eigenvectors and eigenvalues ofH corresponding to the scattering of two spin waves are presented explicitly for these finite-dimensional systems and for their infinite-dimensional version.  相似文献   
108.
Fayolle  Guy 《Queueing Systems》1989,5(1-3):167-183
A simple and quite general approach is proposed to derive criteria for transience and ergodicity of a certain class of irreducibleN-dimensional Markov chains in + N assuming a boundedness condition on the second moment of the jumps. The method consists in constructing convenient smooth supermartingales outside some compact set. The Lyapounov functions introduced belong to the set of quadratic forms in + N and do not always have a definite sign. Existence and construction of these forms is shown to be basically equivalent to finding vectors satisfying a system of linear inequalities.Part I is restricted toN=2, in which case a complete characterization is obtained for the type of random walks analyzed by Malyshev and Mensikov, thus relaxing their condition of boundedness of the jumps. The motivation for this work is partly from a large class of queueing systems that give rise to random walks in + N   相似文献   
109.
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.  相似文献   
110.
This paper deals with dynamic systems described by nonlinear differential-difference equations of retarded type. The problem considered is to determine the initial function and certain system parameters which minimize a given cost functional. A computational method is presented and some convergence results are given. Numerical examples of linear and nonlinear systems are also included.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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