全文获取类型
收费全文 | 10781篇 |
免费 | 382篇 |
国内免费 | 49篇 |
专业分类
化学 | 6955篇 |
晶体学 | 68篇 |
力学 | 289篇 |
数学 | 2029篇 |
物理学 | 1871篇 |
出版年
2023年 | 58篇 |
2022年 | 141篇 |
2021年 | 162篇 |
2020年 | 170篇 |
2019年 | 200篇 |
2018年 | 204篇 |
2017年 | 196篇 |
2016年 | 347篇 |
2015年 | 304篇 |
2014年 | 328篇 |
2013年 | 664篇 |
2012年 | 739篇 |
2011年 | 773篇 |
2010年 | 457篇 |
2009年 | 414篇 |
2008年 | 639篇 |
2007年 | 575篇 |
2006年 | 537篇 |
2005年 | 510篇 |
2004年 | 435篇 |
2003年 | 367篇 |
2002年 | 307篇 |
2001年 | 169篇 |
2000年 | 147篇 |
1999年 | 106篇 |
1998年 | 87篇 |
1997年 | 82篇 |
1996年 | 100篇 |
1995年 | 74篇 |
1994年 | 92篇 |
1993年 | 70篇 |
1992年 | 73篇 |
1991年 | 91篇 |
1990年 | 88篇 |
1989年 | 85篇 |
1988年 | 78篇 |
1987年 | 65篇 |
1985年 | 84篇 |
1984年 | 114篇 |
1983年 | 63篇 |
1982年 | 95篇 |
1981年 | 77篇 |
1980年 | 78篇 |
1979年 | 56篇 |
1978年 | 68篇 |
1977年 | 71篇 |
1976年 | 58篇 |
1975年 | 45篇 |
1974年 | 51篇 |
1973年 | 62篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
Daniel Král’ Jan Kratochvíl Andrzej Proskurowski Heinz-Jürgen Voss 《Discrete Applied Mathematics》2006,154(4):660-672
A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases. 相似文献
62.
63.
64.
65.
Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r
q
, whereq depends on the properties of the norm. We specify it in the case ofL
spaces, >1. 相似文献
66.
Herbert Edelsbrunner Leonidas Guibas Micha Sharir 《Discrete and Computational Geometry》1990,5(1):197-216
We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m
2/3
n logn +n
2); we can calculatem such cells specified by a point in each, in worst-case timeO(m
2/3
n log3
n+n
2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m
2/3
n logn+n
2), but this number is onlyO(m
3/5–
n
4/5+2
+m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m
3/4–
n
3/4+3
+m) log2
n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m
3/4–
n
3/4+3
+m] log2
n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m
2/3
n
d/3 logn+n
d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147. 相似文献
67.
Herbert Edelsbrunner Leonidas Guibas John Hershberger Raimund Seidel Micha Sharir Jack Snoeyink Emo Welzl 《Discrete and Computational Geometry》1989,4(1):433-466
Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n
2) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space1 and (n
3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n
1/3)+O(K) time, given(n
4/3) space and (n
5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m
2/3
n
2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center. 相似文献
68.
Summary Motivated by different mean value properties, the functional equationsf(x) – f(y)/x–y=[(x, y)], (i)xf(y) – yf(x)/x–y=[(x, y)] (ii) (x y) are completely solved when, are arithmetic, geometric or harmonic means andx, y elements of proper real intervals. In view of a duality between (i) and (ii), three of the results are consequences of other three.The equation (ii) is also solved when is a (strictly monotonic) quasiarithmetic mean while the real interval contains 0 and when is the arithmetic mean while the domain is a field of characteristic different from 2 and 3. (A result similar to the latter has been proved previously for (i).) 相似文献
69.
L. Havela P. Kratochvíl P. Lukáč B. Smola A. Svobodová 《Czechoslovak Journal of Physics》1988,38(4):384-387
The softening processes during and after the hot deformation (850–1180 C) in AISI 321 stainless steel were studied with respect to true strains
D and true strain rates
. The analysis of deformation curves indicates the occurrence of dynamic recrystallization for values of Zener-Hollomon parameterZ1015 s–1. The retardation of static recrystallization by fine Ti(N, C) precipitates is documented by microstructure studies and by variations of annealing conditions. 相似文献
70.