首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2480篇
  免费   79篇
  国内免费   7篇
化学   1935篇
晶体学   7篇
力学   23篇
数学   305篇
物理学   296篇
  2023年   14篇
  2022年   14篇
  2021年   33篇
  2020年   59篇
  2019年   40篇
  2018年   14篇
  2017年   14篇
  2016年   72篇
  2015年   62篇
  2014年   78篇
  2013年   124篇
  2012年   158篇
  2011年   165篇
  2010年   89篇
  2009年   78篇
  2008年   142篇
  2007年   116篇
  2006年   119篇
  2005年   124篇
  2004年   132篇
  2003年   90篇
  2002年   99篇
  2001年   47篇
  2000年   43篇
  1999年   35篇
  1998年   27篇
  1997年   38篇
  1996年   38篇
  1995年   38篇
  1994年   46篇
  1993年   41篇
  1992年   36篇
  1991年   22篇
  1990年   25篇
  1989年   26篇
  1988年   29篇
  1987年   15篇
  1985年   28篇
  1984年   17篇
  1983年   9篇
  1982年   19篇
  1981年   18篇
  1980年   12篇
  1979年   18篇
  1978年   11篇
  1977年   17篇
  1976年   13篇
  1975年   11篇
  1973年   9篇
  1970年   10篇
排序方式: 共有2566条查询结果,搜索用时 15 毫秒
151.
We consider a matched queueing network PH/M/coPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.The work was supported by the Max-Planck-Gesellschaft, Germany, and the Chinese Academy ofSciences.  相似文献   
152.
Summary We discuss the limiting path measures of Markov processes with either a mean field or a polaron type interaction of the paths. In the polaron type situation the strength is decaying at large distances on the time axis, and so the interaction is of short range in time. In contrast, in the mean field model, the interaction is weak, but of long range in time. Donsker and Varadhan proved that for the partition functions, there is a transition from the polaron type to the mean field interaction when passing to a limit by letting the strength tend to zero while increasing the range. The discussion of the path measures is more subtle. We treat the mean field case as an example of a differentiable interaction and discuss the transition from the polaron type to the mean field interaction for two instructive examples.Research supported by the Swiss National Foundation (21-29833.90)This article was processed by the authors using the Springer-Verlag TEX ProbTh macro package 1991.  相似文献   
153.
The paper is concerned with the extension of the classical study of probability measures on a compact group which are square roots of the Haar measure, due to Diaconis and Shahshahani, to the context of compact quantum groups. We provide a simple characterisation for compact quantum groups which admit no non-trivial square roots of the Haar state in terms of their corepresentation theory. In particular it is shown that such compact quantum groups are necessarily of Kac type and their subalgebras generated by the coefficients of a fixed two-dimensional irreducible corepresentation are isomorphic (as finite quantum groups) to the algebra of functions on the group of unit quaternions. An example of a quantum group whose Haar state admits no nontrivial square root and which is neither commutative nor cocommutative is given.  相似文献   
154.
The classical algebraic approach to graph transformation is a mathematical theory based on categorical techniques with several interesting applications in computer science. In this paper, a new semantics of graph transformation systems (in the algebraic, double-pushout (DPO) approach) is proposed in order to make them suitable for the specification of concurrent and reactive systems. Classically, a graph transformation system comes with a fixed behavioral interpretation. Firstly, all transformation steps are intended to be completely specified by the rules of the system, that is, there is an implicit frame condition: it is assumed that there is a complete control about the evolution of the system. Hence, the interaction between the system and its (possibly unknown) environment, which is essential in a reactive system, cannot be modeled explicitly. Secondly, each sequence of transformation steps represents a legal computation of the system, and this makes it difficult to model systems with control. The first issue is addressed by providing graph transformation rules with a loose semantics, allowing for unspecified effects which are interpreted as activities of the environment. This is formalized by the notion of double-pullback transitions, which replace (and generalize) the well-known double-pushout diagrams by allowing for spontaneous changes in the context of a rule application. Two characterizations of double-pullback transitions are provided: the first one describes them in terms of extended direct DPO derivations, and the second one as incomplete views of parallel or amalgamated derivations. The issue of constraining the behavior of a system to transformation sequences satisfying certain properties is addressed instead by introducing a general notion of logic of behavioral constraints, which includes instances like start graphs, application and consistency conditions, and temporal logic constraints. The loose semantics of a system with restricted behavior is defined as a category of coalgebras over a suitable functor. Such category has a final object which includes all finite and infinite transition sequences satisfying the constraints.  相似文献   
155.
156.
In this paper we discuss Weyl matrix balls in the context of the matricial versions of the classical interpolation problems named after Carathéodory and Schur. Our particular focus will be on studying the monotonicity of suitably normalized semi-radii of the corresponding Weyl matrix balls. We, furthermore, devote a fair bit of attention to characterizing the case in which equality holds for particular matricial inequalities. Solving these problems will provide us with a new perspective on the role of the central functions for the classes of Carathéodory and Schur.  相似文献   
157.
We describe and to some extent characterize a new family of Kähler spin manifolds admitting non-trivial imaginary Kählerian Killing spinors.  相似文献   
158.
We introduce the notion of even Clifford structures on Riemannian manifolds, which for rank r=2 and r=3 reduce to almost Hermitian and quaternion-Hermitian structures respectively. We give the complete classification of manifolds carrying parallel rank r even Clifford structures: Kähler, quaternion-Kähler and Riemannian products of quaternion-Kähler manifolds for r=2,3 and 4 respectively, several classes of 8-dimensional manifolds (for 5?r?8), families of real, complex and quaternionic Grassmannians (for r=8,6 and 5 respectively), and Rosenfeld?s elliptic projective planes OP2, (CO)P2, (HO)P2 and (OO)P2, which are symmetric spaces associated to the exceptional simple Lie groups F4, E6, E7 and E8 (for r=9,10,12 and 16 respectively). As an application, we classify all Riemannian manifolds whose metric is bundle-like along the curvature constancy distribution, generalizing well-known results in Sasakian and 3-Sasakian geometry.  相似文献   
159.
Necessary and sufficient conditions are obtained for the boundedness of Berezin transformation on Lebesgue space Lp(B, dVβ) in the real unit ball B in Rn. As an application, we prove that Gleason type problem is solvable in hyperbolic harmonic Bergman spaces. Furthermore we investigate the boundary behavior of the solutions of Gleason type problem.  相似文献   
160.
The accumulation of the Jacobian matrix F of a vector function can be regarded as a transformation of its linearized computational graph into a subgraph of the directed complete bipartite graph Kn,m. This transformation can be performed by applying different elimination techniques that may lead to varying costs for computing F. This paper introduces face elimination as the basic technique for accumulating Jacobian matrices by using a minimal number of arithmetic operations. Its superiority over both edge and vertex elimination methods is shown. The intention is to establish the conceptual basis for the ongoing development of algorithms for optimizing the computation of Jacobian matrices.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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