全文获取类型
收费全文 | 3039篇 |
免费 | 135篇 |
国内免费 | 261篇 |
专业分类
化学 | 518篇 |
晶体学 | 2篇 |
力学 | 174篇 |
综合类 | 30篇 |
数学 | 2268篇 |
物理学 | 443篇 |
出版年
2024年 | 4篇 |
2023年 | 33篇 |
2022年 | 47篇 |
2021年 | 42篇 |
2020年 | 50篇 |
2019年 | 67篇 |
2018年 | 62篇 |
2017年 | 67篇 |
2016年 | 89篇 |
2015年 | 51篇 |
2014年 | 127篇 |
2013年 | 194篇 |
2012年 | 125篇 |
2011年 | 157篇 |
2010年 | 134篇 |
2009年 | 220篇 |
2008年 | 234篇 |
2007年 | 199篇 |
2006年 | 191篇 |
2005年 | 162篇 |
2004年 | 117篇 |
2003年 | 117篇 |
2002年 | 103篇 |
2001年 | 103篇 |
2000年 | 96篇 |
1999年 | 88篇 |
1998年 | 85篇 |
1997年 | 72篇 |
1996年 | 61篇 |
1995年 | 38篇 |
1994年 | 29篇 |
1993年 | 27篇 |
1992年 | 28篇 |
1991年 | 19篇 |
1990年 | 17篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 25篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 14篇 |
1981年 | 16篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有3435条查询结果,搜索用时 15 毫秒
91.
Let X={X(t), t[0,1]} be a process on [0,1] and VX=Conv{(t,x)t[0,1], x=X(t)} be the convex hull of its path.The structure of the set ext(VX) of extreme points of VX is studied. For a Gaussian process X with stationary increments it is proved that:
- • The set ext(VX) is negligible if X is non-differentiable.
- • If X is absolutely continuous process and its derivative X′ is continuous but non-differentiable, then ext(VX) is also negligible and moreover it is a Cantor set.
92.
On Clique-Transversals and Clique-Independent Sets 总被引:1,自引:0,他引:1
Guillermo Durán Min Chih Lin Jayme L. Szwarcfiter 《Annals of Operations Research》2002,116(1-4):71-77
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A clique-independent set is a subset of pairwise disjoint cliques of G. Denote by
C
(G) and
C
(G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when
C
(H)=
C
(H), for every induced subgraph H of G. In this paper, we prove that every graph not containing a 4-wheel nor a 3-fan as induced subgraphs and such that every odd cycle of length greater than 3 has a short chord is clique-perfect. The proof leads to polynomial time algorithms for finding the parameters
C
(G) and
C
(G), for graphs belonging to this class. In addition, we prove that to decide whether or not a given subset of vertices of a graph is a clique-transversal is Co-NP-Complete. The complexity of this problem has been mentioned as unknown in the literature. Finally, we describe a family of highly clique-imperfect graphs, that is, a family of graphs G whose difference
C
(G)–
C
(G) is arbitrarily large. 相似文献
93.
Given a precompact subset of a type Banach space , where , we prove that for every and all
holds, where is the absolutely convex hull of and denotes the dyadic entropy number. With this inequality we show in particular that for given and with for all the inequality holds true for all . We also prove that this estimate is asymptotically optimal whenever has no better type than . For this answers a question raised by Carl, Kyrezi, and Pajor which has been solved up to now only for the Hilbert space case by F. Gao.
holds, where is the absolutely convex hull of and denotes the dyadic entropy number. With this inequality we show in particular that for given and with for all the inequality holds true for all . We also prove that this estimate is asymptotically optimal whenever has no better type than . For this answers a question raised by Carl, Kyrezi, and Pajor which has been solved up to now only for the Hilbert space case by F. Gao.
94.
Tero Kilpelä inen Xiao Zhong 《Proceedings of the American Mathematical Society》2002,130(6):1681-1688
We show that sets of Hausdorff measure zero are removable for -Hölder continuous solutions to quasilinear elliptic equations similar to the -Laplacian. The result is optimal. We also treat larger sets in terms of a growth condition. In particular, our results apply to quasiregular mappings.
95.
Paul J. Szeptycki 《Proceedings of the American Mathematical Society》2002,130(12):3713-3717
An almost disjoint family is said to be soft if there is an infinite set that meets each in a nonempty but finite set. We consider the associated cardinal invariant defined to be the minimal cardinality of an almost disjoint family that is not soft. We show that this cardinal coincides with J. Brendle's cardinal .
96.
97.
A subset of the -dimensional torus is called a set of uniqueness, or -set, if every multiple trigonometric series spherically converging to outside vanishes identically. We show that all countable sets are -sets and also that sets are -sets for every . In particular, , where is the Cantor set, is an set and hence a -set. We will say that is a -set if every multiple trigonometric series spherically Abel summable to outside and having certain growth restrictions on its coefficients vanishes identically. The above-mentioned results hold also for sets. In addition, every -set has measure , and a countable union of closed -sets is a -set.
98.
We show that there do not exist computable functions f 1(e, i), f 2(e, i), g 1(e, i), g 2(e, i) such that for all e, i ∈ ω, (1) $ {\left( {W_{{f_{1} {\left( {e,i} \right)}}} - W_{{f_{2} {\left( {e,i} \right)}}} } \right)} \leqslant _{{\rm T}} {\left( {W_{e} - W_{i} } \right)}; $ (2) $ {\left( {W_{{g_{1} {\left( {e,i} \right)}}} - W_{{g_{2} {\left( {e,i} \right)}}} } \right)} \leqslant _{{\rm T}} {\left( {W_{e} - W_{i} } \right)}; $ (3) $ {\left( {W_{e} - W_{i} } \right)} \not\leqslant _{{\rm T}} {\left( {W_{{f_{1} {\left( {e,i} \right)}}} - W_{{f_{2} {\left( {e,i} \right)}}} } \right)} \oplus {\left( {W_{{g_{1} {\left( {e,i} \right)}}} - W_{{g_{2} {\left( {e,i} \right)}}} } \right)}; $ (4) $ {\left( {W_{e} - W_{i} } \right)} \not\leqslant _{{\rm T}} {\left( {W_{{f_{1} {\left( {e,i} \right)}}} - W_{{f_{2} {\left( {e,i} \right)}}} } \right)}{\text{unless}}{\left( {W_{e} - W_{i} } \right)} \leqslant _{{\rm T}} {\emptyset};{\text{and}} $ (5) $ {\left( {W_{e} - W_{i} } \right)} \leqslant _{{\rm T}} {\left( {W_{{g_{1} {\left( {e,i} \right)}}} - W_{{g_{2} {\left( {e,i} \right)}}} } \right)}{\text{unless}}{\left( {W_{e} - W_{i} } \right)} \leqslant _{{\rm T}} {\emptyset}. $ It follows that the splitting theorems of Sacks and Cooper cannot be combined uniformly. 相似文献
99.
Decision-making in an environment of uncertainty and imprecision for real-world problems is a complex task. In this paper it is introduced general finite state fuzzy Markov chains that have a finite convergence to a stationary (may be periodic) solution. The Cesaro average and the -potential for fuzzy Markov chains are defined, then it is shown that the relationship between them corresponds to the Blackwell formula in the classical theory of Markov decision processes. Furthermore, it is pointed out that recurrency does not necessarily imply ergodicity. However, if a fuzzy Markov chain is ergodic, then the rows of its ergodic projection equal the greatest eigen fuzzy set of the transition matrix. Then, the fuzzy Markov chain is shown to be a robust system with respect to small perturbations of the transition matrix, which is not the case for the classical probabilistic Markov chains. Fuzzy Markov decision processes are finally introduced and discussed. 相似文献
100.
Our main aim from this work is to see which theorems in classical probability theory are still valid in fuzzy probability theory. Following Gudder's approach [Demonestratio Mathematica 31(3), 1998, 235–254; Foundations of Physics, 30, 1663–1678] to fuzzy probability theory, the basic concepts of the theory, that is of fuzzy probability measures and fuzzy random variables (observables), are presented. We show that fuzzy random variables extend the usual ones. Moreover, we prove that for any separable metrizable space, the crisp observables coincide with random variables. Then we prove the existence of a joint observable for any collection of observables, and we prove the weak law of large numbers and the central limit theorem in the fuzzy context. We construct a new definition of almost everywhere convergence. After proving that Gudder's definition implies ours and presenting an example that indicates that the converse is not true, we prove the strong law of large numbers according to this definition. 相似文献