全文获取类型
收费全文 | 2197篇 |
免费 | 107篇 |
国内免费 | 40篇 |
专业分类
化学 | 1419篇 |
晶体学 | 32篇 |
力学 | 83篇 |
综合类 | 1篇 |
数学 | 421篇 |
物理学 | 388篇 |
出版年
2023年 | 19篇 |
2022年 | 39篇 |
2021年 | 63篇 |
2020年 | 42篇 |
2019年 | 48篇 |
2018年 | 53篇 |
2017年 | 53篇 |
2016年 | 94篇 |
2015年 | 72篇 |
2014年 | 101篇 |
2013年 | 169篇 |
2012年 | 170篇 |
2011年 | 171篇 |
2010年 | 90篇 |
2009年 | 86篇 |
2008年 | 121篇 |
2007年 | 133篇 |
2006年 | 118篇 |
2005年 | 91篇 |
2004年 | 87篇 |
2003年 | 80篇 |
2002年 | 51篇 |
2001年 | 30篇 |
2000年 | 33篇 |
1999年 | 24篇 |
1998年 | 16篇 |
1997年 | 11篇 |
1996年 | 33篇 |
1995年 | 25篇 |
1994年 | 23篇 |
1993年 | 10篇 |
1992年 | 14篇 |
1991年 | 18篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 9篇 |
1986年 | 6篇 |
1985年 | 12篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1982年 | 17篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1975年 | 7篇 |
1974年 | 3篇 |
排序方式: 共有2344条查询结果,搜索用时 31 毫秒
1.
2.
Analysis Mathematica - We introduce and study the k-Hankel Gabor transform. We investigate the localization operators for this transform. In particular, we study their trace class properties and we... 相似文献
3.
4.
5.
The dynamics of multiphoton transitions in a two-level spin system excited by transverse microwave and longitudinal RF fields with the frequencies ωmw and ωrf, respectively, is analyzed. The effective time-independent Hamiltonian describing the “dressed” spin states of the “spin + bichromatic field” system is obtained by using the Krylov-Bogoliubov-Mitropolsky averaging method. The direct detection of the time behavior of the spin system by the method of nonstationary nutations makes it possible to identify the multiphoton transitions for resonances ω0 = ωmw + rωrf (ω0 is the central frequency of the EPR line, r = 1, 2), to measure the amplitudes of the effective fields of these transitions, and to determine the features generated by the inhomogeneous broadening of the EPR line. It is shown that the Bloch-Siegert shifts for multiphoton resonances at the inhomogeneous broadening of spectral lines reduce only the nutation amplitude but do not change their frequencies. 相似文献
6.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
7.
We consider noncommutative line bundles associated with the Hopf fibrations of SUq(2) over all Podle? spheres and with a locally trivial Hopf fibration of S3pq. These bundles are given as finitely generated projective modules associated via 1-dimensional representations of U(1) with Galois-type extensions encoding the principal fibrations of SUq(2) and S3pq. We show that the Chern numbers of these modules coincide with the winding numbers of representations defining them. To cite this article: P.M. Hajac et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003). 相似文献
8.
Research supported by the NSF Grant DMS-8602672 相似文献
9.
Wojciech Pieczynski 《Comptes Rendus Mathematique》2002,335(3):275-278
The Hidden Markov Chains (HMC) are widely applied in various problems. This succes is mainly due to the fact that the hidden process can be recovered even in the case of very large set of data. These models have been recetly generalized to ‘Pairwise Markov Chains’ (PMC) model, which admit the same processing power and a better modeling one. The aim of this note is to propose further generalization called Triplet Markov Chains (TMC), in which the distribution of the couple (hidden process, observed process) is the marginal distribution of a Markov chain. Similarly to HMC, we show that posterior marginals are still calculable in Triplets Markov Chains. We provide a necessary and sufficient condition that a TMC is a PMC, which shows that the new model is strictly more general. Furthermore, a link with the Dempster–Shafer fusion is specified. To cite this article: W. Pieczynski, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 275–278. 相似文献
10.