首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11345篇
  免费   878篇
  国内免费   1245篇
化学   1013篇
晶体学   17篇
力学   470篇
综合类   203篇
数学   9160篇
物理学   2605篇
  2024年   17篇
  2023年   102篇
  2022年   117篇
  2021年   186篇
  2020年   235篇
  2019年   291篇
  2018年   297篇
  2017年   332篇
  2016年   352篇
  2015年   237篇
  2014年   537篇
  2013年   1059篇
  2012年   481篇
  2011年   633篇
  2010年   584篇
  2009年   816篇
  2008年   780篇
  2007年   842篇
  2006年   699篇
  2005年   622篇
  2004年   531篇
  2003年   549篇
  2002年   500篇
  2001年   337篇
  2000年   372篇
  1999年   366篇
  1998年   317篇
  1997年   267篇
  1996年   191篇
  1995年   109篇
  1994年   102篇
  1993年   67篇
  1992年   70篇
  1991年   44篇
  1990年   40篇
  1989年   42篇
  1988年   45篇
  1987年   35篇
  1986年   28篇
  1985年   31篇
  1984年   38篇
  1983年   19篇
  1982年   35篇
  1981年   17篇
  1980年   24篇
  1979年   19篇
  1978年   16篇
  1977年   10篇
  1972年   5篇
  1936年   5篇
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
1.
We prove a well-posedness result for two pseudo-parabolic problems, which can be seen as two models for the same electrical conduction phenomenon in heterogeneous media, neglecting the magnetic field. One of the problems is the concentration limit of the other one, when the thickness of the dielectric inclusions goes to zero. The concentrated problem involves a transmission condition through interfaces, which is mediated by a suitable Laplace-Beltrami type equation.  相似文献   
2.
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.  相似文献   
3.
4.
5.
6.
Inner derivations and norm equality   总被引:3,自引:0,他引:3  

We characterize when the norm of the sum of two bounded operators on a Hilbert space is equal to the sum of their norms.

  相似文献   

7.
A general theory of operators on Boson Fock space is discussed in terms of the white noise distribution theory on Gaussian space (white noise calculus). An integral kernel operator is generalized from two aspects: (i) The use of an operator-valued distribution as an integral kernel leads us to the Fubini type theorem which allows an iterated integration in an integral kernel operator. As an application a white noise approach to quantum stochastic integrals is discussed and a quantum Hitsuda–Skorokhod integral is introduced. (ii) The use of pointwise derivatives of annihilation and creation operators assures the partial integration in an integral kernel operator. In particular, the particle flux density becomes a distribution with values in continuous operators on white noise functions and yields a representation of a Lie algebra of vector fields by means of such operators.  相似文献   
8.
In this note, we use inexact Newton-like methods to find solutions of nonlinear operator equations on Banach spaces with a convergence structure. Our technique involves the introduction of a generalized norm as an operator from a linear space into a partially ordered Banach space. In this way, the metric properties of the examined problem can be analyzed more precisely. Moreover, this approach allows us to derive from the same theorem, on the one hand, semilocal results of Kantorovich-type, and on the other hand, global results based on monotonicity considerations. By imposing very general Lipschitz-like conditions on the operators involved, on the one hand, we cover a wider range of problems, and on the other hand, by choosing our operators appropriately, we can find sharper error bounds on the distances involved than before. Furthermore, we show that special cases of our results reduce to the corresponding ones already in the literature. Finally, several examples are being provided where our results compare favorably with earlier ones.  相似文献   
9.
Algebra matrix and similarity classification of operators   总被引:1,自引:0,他引:1  
In this paper, by the Gelfand representation theory and the Silov idempotents theorem, we first obtain a central decomposition theorem related to a unital semi-simple n-homogeneous Banach algebra, and then give a similarity classification of two strongly irreducible Cowen-Douglas operators using this theorem.  相似文献   
10.
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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