首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16994篇
  免费   344篇
  国内免费   312篇
化学   1658篇
晶体学   29篇
力学   117篇
综合类   15篇
数学   14525篇
物理学   1306篇
  2023年   26篇
  2022年   38篇
  2021年   43篇
  2020年   78篇
  2019年   392篇
  2018年   427篇
  2017年   237篇
  2016年   154篇
  2015年   218篇
  2014年   428篇
  2013年   1296篇
  2012年   593篇
  2011年   1128篇
  2010年   1010篇
  2009年   1185篇
  2008年   1337篇
  2007年   1349篇
  2006年   1017篇
  2005年   599篇
  2004年   539篇
  2003年   483篇
  2002年   372篇
  2001年   358篇
  2000年   353篇
  1999年   402篇
  1998年   328篇
  1997年   282篇
  1996年   305篇
  1995年   370篇
  1994年   349篇
  1993年   274篇
  1992年   212篇
  1991年   131篇
  1990年   112篇
  1989年   104篇
  1988年   84篇
  1987年   78篇
  1986年   85篇
  1985年   117篇
  1984年   106篇
  1983年   56篇
  1982年   89篇
  1981年   88篇
  1980年   84篇
  1979年   63篇
  1978年   89篇
  1977年   61篇
  1976年   53篇
  1975年   26篇
  1974年   22篇
排序方式: 共有10000条查询结果,搜索用时 437 毫秒
51.
52.
The questions raised by A. M. Turing in his paper on thought and machines are discussed. Human thought is considered in turn as a concept of normal language usage, as a basic concept of psychology, and as the basis of intellectual activity. It is concluded that neither of these notions of thought identifies something specific that a human being can or cannot do. The imitation game proposed by Turing for deciding whether a machine can think is found to result from an arbitrary empoverishment of the channel of communication between the interrogator and the item under investigation. Turing's notions of thinking are shown to lead to logical difficulties. An alternative view of consciousness, that would place it beyond the reach of any finite test, is finally discussed.  相似文献   
53.
Modifying complex plane rotations, we derive a new Jacobi-type algorithm for the Hermitian eigendecomposition, which uses only real arithmetic. When the fast-scaled rotations are incorporated, the new algorithm brings a substantial reduction in computational costs. The new method has the same convergence properties and parallelism as the symmetric Jacobi algorithm. Computational test results show that it produces accurate eigenvalues and eigenvectors and achieves great reduction in computational time.The work of this author was supported in part by the National Science Foundation grant CCR-8813493 and by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.The work of this author was supported in part by the University of Minnesota Army High Performance Computing Research Center contract DAAL 03-89-C-0038.  相似文献   
54.
Summary. We study a diffusion model of an interacting particles system with general drift and diffusion coefficients, and electrostatic inter-particles repulsion. More precisely, the finite particle system is shown to be well defined thanks to recent results on multivalued stochastic differential equations (see [2]), and then we consider the behaviour of this system when the number of particles goes to infinity (through the empirical measure process). In the particular case of affine drift and constant diffusion coefficient, we prove that a limiting measure-valued process exists and is the unique solution of a deterministic PDE. Our treatment of the convergence problem (as ) is partly similar to that of T. Chan [3] and L.C.G. Rogers - Z. Shi [5], except we consider here a more general case allowing collisions between particles, which leads to a second-order limiting PDE. Received: 5 August 1996 / In revised form: 17 October 1996  相似文献   
55.
Let Ω be an open and bounded subset ofR n with locally Lipschitz boundary. We prove that the functionsv∈SBV(Ω,R m ) whose jump setS vis essentially closed and polyhedral and which are of classW k, ∞ (S v,R m) for every integerk are strongly dense inGSBV p(Ω,R m ), in the sense that every functionu inGSBV p(Ω,R m ) is approximated inL p(Ω,R m ) by a sequence of functions {v k{j∈N with the described regularity such that the approximate gradients ∇v jconverge inL p(Ω,R nm ) to the approximate gradient ∇u and the (n−1)-dimensional measure of the jump setsS v j converges to the (n−1)-dimensional measure ofS u. The structure ofS v can be further improved in casep≤2.
Sunto Sia Ω un aperto limitato diR n con frontiera localmente Lipschitziana. In questo lavoro si dimostra che le funzioniv∈SBV(Ω,R m ) con insieme di saltoS v essenzialmente chiuso e poliedrale che sono di classeW k, ∞ (S v,R m ) per ogni interok sono fortemente dense inGSBV p(Ω,R m ), nel senso che ogni funzioneuGSBV p(Ω,R m ) è approssimata inL p(Ω,R m ) da una successione di funzioni {v j}j∈N con la regolaritá descritta tali che i gradienti approssimati ∇v jconvergono inL p(Ω,R nm ) al gradiente approssimato ∇u e la misura (n−1)-dimensionale degli insiemi di saltoS v jconverge alla misura (n−1)-dimensionale diS u. La struttura diS vpuó essere migliorata nel caso in cuip≤2.
  相似文献   
56.
57.
Summary We produce complete solution formulas of selected functional equations of the formf(x +y) ±f(x + σ (ν)) = Σ I 2 =1 g l (x)h l (y),x, yG, where the functionsf,g 1,h 1 to be determined are complex valued functions on an abelian groupG and where σ:G→G is an involution ofG. The special case of σ=−I encompasses classical functional equations like d’Alembert’s, Wilson’s first generalization of it, Jensen’s equation and the quadratic equation. We solve these equations, the equation for symmetric second differences in product form and similar functional equations for a general involution σ.  相似文献   
58.
59.
Regularity of multiwavelets   总被引:7,自引:0,他引:7  
The motivation for this paper is an interesting observation made by Plonka concerning the factorization of the matrix symbol associated with the refinement equation for B-splines with equally spaced multiple knots at integers and subsequent developments which relate this factorization to regularity of refinable vector fields over the real line. Our intention is to contribute to this train of ideas which is partially driven by the importance of refinable vector fields in the construction of multiwavelets. The use of subdivision methods will allow us to consider the problem almost entirely in the spatial domain and leads to exact characterizations of differentiability and Hölder regularity in arbitrary L p spaces. We first study the close relationship between vector subdivision schemes and a generalized notion of scalar subdivision schemes based on bi-infinite matrices with certain periodicity properties. For the latter type of subdivision scheme we will derive criteria for convergence and Hölder regularity of the limit function, which mainly depend on the spectral radius of a bi-infinite matrix induced by the subdivision operator, and we will show that differentiability of the limit functions can be characterized by factorization properties of the subdivision operator. By switching back to vector subdivision we will transfer these results to refinable vectors fields and obtain characterizations of regularity by factorization and spectral radius properties of the symbol associated to the refinable vector field. Finally, we point out how multiwavelets can be generated from orthonormal refinable bi-infinite vector fields.  相似文献   
60.
Summary. We present a simple proof, based on modified logarithmic Sobolev inequalities, of Talagrand’s concentration inequality for the exponential distribution. We actually observe that every measure satisfying a Poincaré inequality shares the same concentration phenomenon. We also discuss exponential integrability under Poincaré inequalities and its consequence to sharp diameter upper bounds on spectral gaps. Received: 10 June 1996 / In revised form: 9 August 1996  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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