全文获取类型
收费全文 | 1907篇 |
免费 | 127篇 |
国内免费 | 82篇 |
专业分类
化学 | 86篇 |
晶体学 | 1篇 |
力学 | 116篇 |
综合类 | 15篇 |
数学 | 1499篇 |
物理学 | 399篇 |
出版年
2024年 | 5篇 |
2023年 | 18篇 |
2022年 | 21篇 |
2021年 | 21篇 |
2020年 | 44篇 |
2019年 | 51篇 |
2018年 | 55篇 |
2017年 | 55篇 |
2016年 | 52篇 |
2015年 | 40篇 |
2014年 | 95篇 |
2013年 | 177篇 |
2012年 | 74篇 |
2011年 | 91篇 |
2010年 | 73篇 |
2009年 | 99篇 |
2008年 | 105篇 |
2007年 | 117篇 |
2006年 | 107篇 |
2005年 | 88篇 |
2004年 | 81篇 |
2003年 | 89篇 |
2002年 | 88篇 |
2001年 | 45篇 |
2000年 | 60篇 |
1999年 | 56篇 |
1998年 | 50篇 |
1997年 | 37篇 |
1996年 | 22篇 |
1995年 | 19篇 |
1994年 | 24篇 |
1993年 | 14篇 |
1992年 | 16篇 |
1991年 | 12篇 |
1990年 | 12篇 |
1989年 | 12篇 |
1988年 | 10篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 15篇 |
1984年 | 8篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1973年 | 3篇 |
排序方式: 共有2116条查询结果,搜索用时 46 毫秒
41.
If
is a quasitriangular Lie bialgebra, the formal Poisson group
can be given a braiding structure. This was achieved by Weinstein and Xu using purely geometrical means, and independently by the authors by means of quantum groups. In this paper we compare these two approaches. First, we show that the braidings they produce share several similar properties (in particular, the construction is functorial); secondly, in the simplest case (G=SL2) they do coincide. The question then rises of whether they are always the same this is positively answered in a separate paper. 相似文献
42.
《Surface and interface analysis : SIA》2004,36(1):61-70
In spectroscopy, the recorded spectra can often be modelled as the noisy convolution product of an instrumental function with the ‘true’ signal to be estimated. Such models have often been used for high‐resolution electron energy‐loss spectroscopy (HREELS). In this article, a new method is suggested to estimate the ‘true’ HREELS signal, i.e. the original electronic diffusion function with ‘true’ peak intensities. Our method relies upon the use of wavelets that, because they exhibit simultaneous time and frequency localization, are well‐suited for signal analysis. Firstly, a wavelet shrinkage algorithm is used to filter the noise. This is achieved by decomposing the noisy signal into an appropriate wavelet basis and then thresholding the wavelet coefficients that contain noise. This algorithm has a particular threshold related to frequency and time. Secondly, the broadening due to the instrumental response is eliminated through a deconvolution process. This step mainly rests on the existing relation between the Lipschitz regularity of the signal and the decay with scale of its wavelet coefficients and on least squares. The efficiency of this technique is highlighted by comparing the results obtained with those provided by other published methods. This work is the second in a series of three papers in this issue. The first one presents background knowledge on the wavelets required to understand the estimation methods. The third paper explores the application of wavelet filtering and deconvolution techniques to x‐ray photoelectron spectroscopy. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
43.
Simple modules over the Leibniz pairs are studied. Simple Poisson modules over Poisson algebras of the semisimple associative algebra structure are determined and they are nothing but simple bimodules over simple associative algebras with standard noncommutative Poisson algebra structure. 相似文献
44.
A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C1, C2,…, Ct of t columns and for each choice = (1,…,t) Δ of signs, the linear combination ∑j=1t jCj contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (1, …, t) of signs in δ, the linear combination ∑j=1t jCj contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described. 相似文献
45.
《Journal of Functional Analysis》2007,247(1):138-168
We investigate some basic questions concerning the relationship between the restricted Grassmannian and the theory of Banach Lie-Poisson spaces. By using universal central extensions of Lie algebras, we find that the restricted Grassmannian is symplectomorphic to symplectic leaves in certain Banach Lie-Poisson spaces, and the underlying Banach space can be chosen to be even a Hilbert space. Smoothness of numerous adjoint and coadjoint orbits of the restricted unitary group is also established. Several pathological properties of the restricted algebra are pointed out. 相似文献
46.
Iddo Eliazar 《Queueing Systems》2007,55(1):71-82
We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated.
We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied
to various examples, including ones with infinite queues and non-summable workloads.
AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10 相似文献
47.
Peter A. Markowich Gerhard Rein Gershon Wolansky 《Journal of statistical physics》2002,106(5-6):1221-1239
We consider the Schrödinger–Poisson system in the repulsive (plasma physics) Coulomb case. Given a stationary state from a certain class we prove its nonlinear stability, using an appropriately defined energy-Casimir functional as Lyapunov function. To obtain such states we start with a given Casimir functional and construct a new functional which is in some sense dual to the corresponding energy-Casimir functional. This dual functional has a unique maximizer which is a stationary state of the Schrödinger–Poisson system and lies in the stability class. The stationary states are parameterized by the equation of state, giving the occupation probabilities of the quantum states as a strictly decreasing function of their energy levels. 相似文献
48.
Wolfgang Stadje 《Journal of Theoretical Probability》1998,11(1):197-208
For increasing sequences of real numbers we consider two types of asymptotic behavior that remind of the defining property of a (homogeneous) Poisson process according to which the numbers of points in disjoint intervals are independent and follow Poisson distributions with specified parameters. We prove that almost all paths of a Poisson process show this asymptotic behavior, and characterize the Poisson process by these properties. Further we discuss the connection to equidistribution notions. 相似文献
49.
Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149. 相似文献
50.
The Hamiltonian formulation of the usual complex quantum mechanics in the theory of generalized quantum dynamics is discussed.
After the total trace Lagrangian, total trace Hamiltonian and two kinds of Poisson brackets are introduced, both the equations
of motion of some total trace functionals which are expressed by total trace Poisson brackets and the equations of motion
of some operators which are expressed by the without-total-trace Poisson brackets are obtained. Then a set of basic equations
of motion of the usual complex quantum mechanics are obtained, which are also expressed by the Poisson brackets and total
trace Hamiltonian in the generalized quantum dynamics. The set of equations of motion are consistent with the corresponding
Heisenberg equations.
Project supported by Prof. T.D. Lee’s NNSC Grant, the National Natural Science Foundation of China, the Foundation of Ph.
D. Directing Programme of Chinese University, and the Chinese Academy of Sciences. 相似文献