全文获取类型
收费全文 | 18411篇 |
免费 | 1719篇 |
国内免费 | 1369篇 |
专业分类
化学 | 3065篇 |
晶体学 | 100篇 |
力学 | 1025篇 |
综合类 | 408篇 |
数学 | 12768篇 |
物理学 | 4133篇 |
出版年
2024年 | 30篇 |
2023年 | 195篇 |
2022年 | 310篇 |
2021年 | 436篇 |
2020年 | 597篇 |
2019年 | 565篇 |
2018年 | 554篇 |
2017年 | 564篇 |
2016年 | 587篇 |
2015年 | 428篇 |
2014年 | 737篇 |
2013年 | 1454篇 |
2012年 | 755篇 |
2011年 | 935篇 |
2010年 | 854篇 |
2009年 | 1128篇 |
2008年 | 1164篇 |
2007年 | 1116篇 |
2006年 | 1043篇 |
2005年 | 840篇 |
2004年 | 782篇 |
2003年 | 797篇 |
2002年 | 715篇 |
2001年 | 660篇 |
2000年 | 616篇 |
1999年 | 533篇 |
1998年 | 472篇 |
1997年 | 353篇 |
1996年 | 322篇 |
1995年 | 241篇 |
1994年 | 236篇 |
1993年 | 168篇 |
1992年 | 153篇 |
1991年 | 137篇 |
1990年 | 114篇 |
1989年 | 101篇 |
1988年 | 112篇 |
1987年 | 82篇 |
1986年 | 59篇 |
1985年 | 92篇 |
1984年 | 91篇 |
1983年 | 43篇 |
1982年 | 61篇 |
1981年 | 50篇 |
1980年 | 29篇 |
1979年 | 41篇 |
1978年 | 32篇 |
1977年 | 33篇 |
1976年 | 30篇 |
1973年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
L''. Holá 《Set-Valued Analysis》2003,11(2):133-151
Our paper studies the topology of uniform convergence on compact sets on the space of densely continuous forms (introduced by Hammer and McCoy (1997)), usco and minimal usco maps. We generalize and complete results from Hammer and McCoy (1997) concerning the space D(X,Y) of densely continuous forms from X to Y. Let X be a Hausdorff topological space, (Y,d) be a metric space and D
k
(X,Y) the topology of uniform convergence on compact sets on D(X,Y). We prove the following main results: D
k
(X,Y) is metrizable iff D
k
(X,Y) is first countable iff X is hemicompact. This result gives also a positive answer to question 4.1 of McCoy (1998). If moreover X is a locally compact hemicompact space and (Y,d) is a locally compact complete metric space, then D
k
(X,Y) is completely metrizable, thus improving a result from McCoy (1998). We study also the question, suggested by Hammer and McCoy (1998), when two compatible metrics on Y generate the same topologies of uniform convergence on compact sets on D(X,Y). The completeness of the topology of uniform convergence on compact sets on the space of set-valued maps with closed graphs, usco and minimal usco maps is also discussed. 相似文献
992.
In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a d‐regular graph G on n vertices satisfies and n is large enough, then G is Hamiltonian. We also show how our main result can be used to prove that for every c >0 and large enough n a Cayley graph X (G,S), formed by choosing a set S of c log5 n random generators in a group G of order n, is almost surely Hamiltonian. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 17–33, 2003 相似文献
993.
An upper bound on the Ramsey number r(K2,n‐s,K2,n) where s ≥ 2 is presented. Considering certain r(K2,n‐s,K2,n)‐colorings obtained from strongly regular graphs, we additionally prove that this bound matches the exact value of r(K2,n‐s,K2,n) in infinitely many cases if holds. Moreover, the asymptotic behavior of r(K2,m,K2,n) is studied for n being sufficiently large depending on m. We conclude with a table of all known Ramsey numbers r(K2,m,K2,n) where m,n ≤ 10. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 252–268, 2003 相似文献
994.
Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003 相似文献
995.
Suppose that
,
, and
are three discrete probability distributions related by the equation (E):
, where
denotes the k-fold convolution of
In this paper, we investigate the relation between the asymptotic behaviors of
and
. It turns out that, for wide classes of sequences
and
, relation (E) implies that
, where
is the mean of
. The main object of this paper is to discuss the rate of convergence in this result. In our main results, we obtain O-estimates and exact asymptotic estimates for the difference
. 相似文献
996.
Minimizing risk models in stochastic shortest path problems 总被引:1,自引:0,他引:1
Yoshio Ohtsubo 《Mathematical Methods of Operations Research》2003,57(1):79-88
997.
Consider a regular diffusion process X with finite speed measure m. Denote the normalized speed measure by μ. We prove that the uniform law of large numbers
holds if the class
has an envelope function that is μ-integrable, or if
is bounded in L
p(μ) for some p>1. In contrast with uniform laws of large numbers for i.i.d. random variables, we do not need conditions on the ‘size’ of
the class
in terms of bracketing or covering numbers. The result is a consequence of a number of asymptotic properties of diffusion
local time that we derive. We apply our abstract results to improve consistency results for the local time estimator (LTE)
and to prove consistency for a class of simple M-estimators.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
998.
A process is considered whose quality deteriorates accordingto a constant failure intensity . As in practice it can be difficultto estimate the true value of the purpose of this paper isto present a strategy which can be applied without knowing .In order to maximize the number of conforming items per timeunit perfect inspections and renewals are performed. The lengthof the inspection interval is described by an arithmetical sequenceand changes by the time depending on perceived assignable causes.Optimal adaptive control plans provide nearly the same performanceas in the case when is known. 相似文献
999.
Norbert Polat 《Czechoslovak Mathematical Journal》2001,51(3):477-492
For an end and a tree T of a graph G we denote respectively by m() and m
T
() the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m
T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m
T
() = f() for every end of G. 相似文献
1000.
Stefan Felsner 《Order》2001,18(1):19-37
We define an analogue of Schnyder's tree decompositions for 3-connected planar graphs. Based on this structure we obtain: Let G be a 3-connected planar graph with f faces, then G has a convex drawing with its vertices embedded on the (f–1)×(f–1) grid. Let G be a 3-connected planar graph. The dimension of the incidence order of vertices, edges and bounded faces of G is at most 3.The second result is originally due to Brightwell and Trotter. Here we give a substantially simpler proof. 相似文献