全文获取类型
收费全文 | 21905篇 |
免费 | 890篇 |
国内免费 | 1144篇 |
专业分类
化学 | 5024篇 |
晶体学 | 49篇 |
力学 | 753篇 |
综合类 | 236篇 |
数学 | 12634篇 |
物理学 | 5243篇 |
出版年
2024年 | 23篇 |
2023年 | 78篇 |
2022年 | 143篇 |
2021年 | 138篇 |
2020年 | 242篇 |
2019年 | 285篇 |
2018年 | 307篇 |
2017年 | 382篇 |
2016年 | 428篇 |
2015年 | 252篇 |
2014年 | 527篇 |
2013年 | 1552篇 |
2012年 | 919篇 |
2011年 | 1090篇 |
2010年 | 965篇 |
2009年 | 3533篇 |
2008年 | 2875篇 |
2007年 | 1620篇 |
2006年 | 1010篇 |
2005年 | 864篇 |
2004年 | 813篇 |
2003年 | 682篇 |
2002年 | 569篇 |
2001年 | 435篇 |
2000年 | 443篇 |
1999年 | 393篇 |
1998年 | 460篇 |
1997年 | 421篇 |
1996年 | 242篇 |
1995年 | 382篇 |
1994年 | 339篇 |
1993年 | 271篇 |
1992年 | 328篇 |
1991年 | 283篇 |
1990年 | 133篇 |
1989年 | 116篇 |
1988年 | 72篇 |
1987年 | 38篇 |
1986年 | 23篇 |
1985年 | 42篇 |
1984年 | 28篇 |
1983年 | 23篇 |
1982年 | 32篇 |
1981年 | 35篇 |
1980年 | 22篇 |
1979年 | 21篇 |
1978年 | 24篇 |
1977年 | 13篇 |
1976年 | 7篇 |
1973年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
In this paper we prove existence results for semilinear neutral functional differential inclusions with finite or infinite
delay in Banach spaces. Our theory makes use of analytic semigroups and fractional powers of closed operators, integrated
semigroups and cosine families.
相似文献
62.
Youssef Randjiou 《Journal of Theoretical Probability》2006,19(3):701-720
Let μ+(t) and μ−(t) be the locations of the maximum and minimum, respectively, of a standard Brownian motion in the interval [0,t]. We establish a joint integral test for the lower functions of μ+(t) and μ−(t), in the sense of Paul Lévy. In particular, it yields the law of the iterated logarithm for max(μ+(t),μ−(t)) as a straightforward consequence. Our result is in agreement with well-known theorems of Chung and Erdős [(1952) Trans. Amer. Math. Soc. 72, 179–186.], and Csáki, F?ldes and Révész [(1987) Prob. Theory Relat. Fields
76, 477–497].
相似文献
63.
Yukio Iida Masahiro Shibutani Katsuhiko Kobayashi Kazuhiko Ohnuma Yoichi Miyake Toru Noda 《Optical Review》2006,13(2):87-92
The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric
double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric
double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric
double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to
obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration
method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval
algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change
in value. 相似文献
64.
Bubble pressure points of ethanol–1,1,1,2,3,3,3-heptafluoropropane (HFC-227ea refrigerant) mixtures from the third Industrial Fluid Properties Simulation Challenge are computed using publicly available molecular simulation software. Several published force fields are compared against the known answers provided in the contest guidelines and the best force fields are used to make predictions for the unknown results. 相似文献
65.
66.
67.
We prove equivalence of the definitions by the author and by Korevaar and Schoen of the Sobolev classes of mappings of a domain of an arithmetic n-dimensional space to a metric space. 相似文献
68.
T. Domínguez Benavides 《Journal of Mathematical Analysis and Applications》2004,291(1):100-108
Let X be a Banach space whose characteristic of noncompact convexity is less than 1 and satisfies the nonstrict Opial condition. Let C be a bounded closed convex subset of X, KC(X) the family of all compact convex subsets of X and T a nonexpansive mapping from C into KC(X) with bounded range. We prove that T has a fixed point. The nonstrict Opial condition can be removed if, in addition, T is an 1-χ-contractive mapping. 相似文献
69.
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 相似文献
70.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem. 相似文献