全文获取类型
收费全文 | 233篇 |
免费 | 16篇 |
国内免费 | 27篇 |
专业分类
化学 | 28篇 |
力学 | 3篇 |
数学 | 48篇 |
物理学 | 197篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 7篇 |
2011年 | 26篇 |
2010年 | 19篇 |
2009年 | 38篇 |
2008年 | 15篇 |
2007年 | 72篇 |
2006年 | 24篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 1篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 4篇 |
排序方式: 共有276条查询结果,搜索用时 31 毫秒
261.
We examine the transition between discrete and ultradiscrete (cellular-automaton-like) systems, the dynamics of which exhibit limit cycles. Motivated by results obtained previously for three-dimensional systems, we consider here a more manageable two-dimensional model. We show that one can follow the changes in dynamics of the system when a parameter that tunes the discrete-ultradiscrete transition is varied. In particular we explain the phenomenon of the splitting of a discrete limit cycle to a profusion of periodic orbits at the ultradiscrete limit. 相似文献
262.
Hafiz Fukhar-ud-din 《Journal of Mathematical Analysis and Applications》2007,328(2):821-829
In this paper, we consider a generalized iterative process with errors to approximate the common fixed points of two asymptotically quasi-nonexpansive mappings. A convergence theorem has been obtained which generalizes a known result. This theorem has then been used to prove another convergence theorem which, in turn, generalizes a number of results. 相似文献
263.
David Kyed 《Journal of Functional Analysis》2011,261(6):1469-1493
We prove a Delorme-Guichardet type theorem for discrete quantum groups expressing property (T) of the quantum group in question in terms of its first cohomology groups. As an application, we show that the first L2-Betti number of a discrete property (T) quantum group vanishes. 相似文献
264.
Let G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r} and Dr(x)=Nr[x]∩D, where d(x,y) denotes the number of edges in any shortest path between x and y. D is known as an r-identifying code (r-locating-dominating set, respectively), if for all vertices x∈V (x∈V?D, respectively), Dr(x) are all nonempty and different. Roberts and Roberts [D.L. Roberts, F.S. Roberts, Locating sensors in paths and cycles: the case of 2-identifying codes, European Journal of Combinatorics 29 (2008) 72-82] provided complete results for the paths and cycles when r=2. In this paper, we provide results for a remaining open case in cycles and complete results in paths for r-identifying codes; we also give complete results for 2-locating-dominating sets in cycles, which completes the results of Bertrand et al. [N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics 25 (2004) 969-987]. 相似文献
265.
266.
Recent developments in dynamic kinetic resolution 总被引:1,自引:0,他引:1
Hélène Pellissier Author Vitae 《Tetrahedron》2008,64(8):1563-1601
267.
A nontrivial solution is obtained for a class of superquadratic elliptic problems by variational methods. 相似文献
268.
Horst Alzer 《Journal of Mathematical Analysis and Applications》2006,320(1):145-162
The authors apply a classical series identity involving the psi (or digamma) function with a view to deriving series representations for a number of known mathematical constants. Several closely-related consequences and results are also considered. 相似文献
269.
Let M be a smooth, compact, orientable, weakly pseudoconvex manifold of dimension 3, embedded in (N2), of codimension one or more, and endowed with the induced CR structure. Assuming that the tangential Cauchy-Riemann operator has closed range in L2(M) in order to rule out the Rossi example, we push regularity up to show has closed range in Hs(M) for all s>0. We then use the Szegö projection to show there is a smooth solution for the problem given smooth data. The results are obtained via microlocalization by piecing together estimates for functions and (0,1) forms that hold on different microlocal regions. 相似文献
270.
Takeshi Katsura 《Journal of Functional Analysis》2009,257(5):1589-127
We give various necessary and sufficient conditions for an AF-algebra to be isomorphic to a graph C∗-algebra, an Exel-Laca algebra, and an ultragraph C∗-algebra. We also explore consequences of these results. In particular, we show that all stable AF-algebras are both graph C∗-algebras and Exel-Laca algebras, and that all simple AF-algebras are either graph C∗-algebras or Exel-Laca algebras. In addition, we obtain a characterization of AF-algebras that are isomorphic to the C∗-algebra of a row-finite graph with no sinks. 相似文献