首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1114篇
  免费   75篇
  国内免费   147篇
化学   10篇
力学   25篇
综合类   35篇
数学   1226篇
物理学   40篇
  2024年   1篇
  2023年   6篇
  2022年   17篇
  2021年   15篇
  2020年   21篇
  2019年   29篇
  2018年   36篇
  2017年   42篇
  2016年   33篇
  2015年   16篇
  2014年   51篇
  2013年   83篇
  2012年   39篇
  2011年   57篇
  2010年   67篇
  2009年   71篇
  2008年   92篇
  2007年   90篇
  2006年   81篇
  2005年   69篇
  2004年   54篇
  2003年   62篇
  2002年   43篇
  2001年   36篇
  2000年   31篇
  1999年   28篇
  1998年   33篇
  1997年   26篇
  1996年   20篇
  1995年   12篇
  1994年   10篇
  1993年   9篇
  1992年   5篇
  1991年   7篇
  1990年   6篇
  1989年   2篇
  1988年   6篇
  1987年   4篇
  1986年   3篇
  1985年   5篇
  1984年   4篇
  1983年   2篇
  1982年   2篇
  1980年   2篇
  1979年   2篇
  1977年   1篇
  1976年   2篇
  1973年   1篇
  1936年   2篇
排序方式: 共有1336条查询结果,搜索用时 15 毫秒
81.
设φ(z)=(φ1(z),…,φ_n(z))是D~n到自身的一个全纯映射,ψ(z)是D~n上的全纯函数,其中D~n是C~n中的单位多圆柱.研究了单位多圆柱上Bloch型空阊之间的加权复合算子ψC_φ的本性范数,并给出了其上下界估计.  相似文献   
82.
In the paper we construct a system of bounded functions which generates an uncomplemented subspace in the Lorentz space Λ(α) for all α∈(0,1). Lower bounds of the norms of the projector onto such subspaces are obtained. Translated fromMatematicheskie Zametki, Vol. 68, No. 1, pp. 57–65, July, 2000.  相似文献   
83.
84.
The successive approximation method was applied for the first time by N.I. Ioakimidis to solve practical cases of a Cauchy singular integral equation: the airfoil one. In this paper we study a more general case. We prove the convergence of the method in this general case. The proposed method has been tested for two kernels which are particularly important in practice. Finally, some numerical examples illustrate the accuracy of the method.  相似文献   
85.
In this paper we present an algorithm which, for a given (sparse) matrix, constructs a partition of its set of row-indices, such that each subset of this partition (except the last one obtained) contains indices which correspond to mutually orthogonal rows. We then use such decompositions in some classes of block-projections methods, previously extended by the author to general inconsistent linear least-squares problems. Numerical experiments on an inconsistent and rank-deficient least-squares model problem are described in the last section of the paper.  相似文献   
86.
Summary For a given fractional 2 m factorial (2 m -FF) designT, the constitution of a block plan to divideT intok (2 r−1<k≦2 r ) blocks withr block factors each at two levels is proposed and investigated. The well-known three norms of the confounding matrix are used as measures for determining a “good” block plan. Some theorems concerning the constitution of a block plan are derived for a 2 m -FF design of odd or even resolution. Two norms which may be preferred over the other norm are slightly modified. For each value ofN assemblies with 11≦N≦26, optimum block plans fork=2 blocks with block sizes [N/2] andN−[N/2] minimizing the two norms are presented forA-optimal balanced 24-FF designs of resolutionV given by Srivastava and Chopra (Technometrics,13, 257–269).  相似文献   
87.
A theorem and a corollary in the paper cited in the title were stated incorrectly, as was pointed out by Christopher Hammond. We now state correctly and prove both of them. These results still generalize and explain the geometric meaning of the Cowen-Hurst norm formula. We also include additional references and provide an example relevant for further study.  相似文献   
88.
This paper deals with the class of continuous-time linear systems with Markovian jumps and multiple time delays. The systems that we are treating are assumed to have time-varying delays in their dynamics which can be different and also have uncertainties in the system parameters. The time-varying structure of the bounded uncertainties is considered. Delay-dependent conditions for stochastic stability and stochastic stabilizability and their robustness are considered. A design algorithm for a stabilizing memoryless controller is proposed. All the results are given in the LMI formalism.  相似文献   
89.
90.
矩阵方程AXAT=C的对称斜反对称解   总被引:1,自引:0,他引:1  
设A∈Rm×n,C∈Rm×m给定,利用矩阵的广义奇异值分解和对称斜反对称矩阵的性质,得到了矩阵方程(1)AXAT=C存在对称斜反对称解的充要条件和通解表达式;证明了若方程(1)有解,则一定存在唯一极小范数解,并给出了极小范数解的具体表达式和求解步骤.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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