全文获取类型
收费全文 | 331篇 |
免费 | 12篇 |
专业分类
化学 | 72篇 |
力学 | 6篇 |
数学 | 197篇 |
物理学 | 68篇 |
出版年
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 4篇 |
2017年 | 6篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 5篇 |
2013年 | 9篇 |
2012年 | 19篇 |
2011年 | 21篇 |
2010年 | 10篇 |
2009年 | 6篇 |
2008年 | 17篇 |
2007年 | 18篇 |
2006年 | 18篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 9篇 |
1988年 | 4篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 10篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1971年 | 1篇 |
1964年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有343条查询结果,搜索用时 0 毫秒
71.
Given a family of sets L, where the sets in L admit k degrees of freedom, we prove that not all (k+1)-dimensional posets are containment posets of sets in L. Our results depend on the following enumerative result of independent interest: Let P(n, k) denote the number of partially ordered sets on n labeled elements of dimension k. We show that log P(n, k)nk log n where k is fixed and n is large.Research supported in part by Allon Fellowship and by a grant from Bat Sheva de Rothschild Foundation.Research supported in part by the Office of Naval Research, contract number N00014-85-K0622. 相似文献
72.
Noga Alon 《Combinatorica》1996,16(3):301-311
It is shown that there exists a positivec so that for any large integerm, any graph with 2m
2edges contains a bipartite subgraph with at least
edges. This is tight up to the constantc and settles a problem of Erdös. It is also proved that any triangle-free graph withe>1 edges contains a bipartite subgraph with at least e/2+c e
4/5 edges for some absolute positive constantc. This is tight up to the constantc.Research supported in part by a USA Israeli BSF grant and by the Fund for Basic Research administered by the Israel Academy of Sciences. 相似文献
73.
Noga Alon 《Journal of Algebraic Combinatorics》1995,4(3):189-195
A graph G is t-tough if any induced subgraph of it with x > 1 connected components is obtained from G by deleting at least tx vertices. It is shown that for every t and g there are t-tough graphs of girth strictly greater than g. This strengthens a recent result of Bauer, van den Heuvel and Schmeichel who proved the above for g = 3, and hence disproves in a strong sense a conjecture of Chvátal that there exists an absolute constant t
0 so that every t
0-tough graph is pancyclic. The proof is by an explicit construction based on the tight relationship between the spectral properties of a regular graph and its expansion properties. A similar technique provides a simple construction of triangle-free graphs with independence number m on (m
4/3) vertices, improving previously known explicit constructions by Erdös and by Chung, Cleve and Dagum. 相似文献
74.
A disjoint system of type (?, ?, k, n) is a collection ?? = {??1,…, ??m} of pairwise disjoint families of k-subsets of an n-element set satisfying the following condition. For every ordered pair ??i and ??j of distinct members of ?? and for every A ? ??i there exists a B ? ??j that does not intersect A. Let Dn (?, ?, k) denote the maximum possible cardinality of a disjoint system of type (?, ?, k, n). It is shown that for every fixed k ? 2,. This settles a problem of Ahlswede, Cai, and Zhang. Several related problems are considered as well. 相似文献
75.
Assume we havek points in general position in the plane such that the ratio between the maximum distance of any pair of points to the minimum distance of any pair of points is at mostk, for some positive constant. We show that there exist at leastk
1/4 of these points which are the vertices of a convex polygon, for some positive constant=(). On the other hand, we show that for every fixed>0, ifk>k(), then there is a set ofk points in the plane for which the above ratio is at most 4k, which does not contain a convex polygon of more thank
1/3+
vertices.The work of the first author was supported in part by the Allon Fellowship, by the Bat Sheva de Rothschild Foundation, by the Fund for Basic Research administered by the Israel Academy of Sciences, and by the Center for Absorbtion in Science. Work by the second author was supported by the Technion V. P.R. Fund, Grant No. 100-0679. The third author's work was supported by the Natural Sciences and Engineering Research Council, Canada, and the joint project Combinatorial Optimization of the Natural Science and Engineering Research Council (NSERC), Canada, and the German Research Association (Deutsche Forschungsgemeinschaft, SFB 303). 相似文献
76.
Noga Alon 《Combinatorica》1986,6(3):201-206
An equivalence graph is a vertex disjoint union of complete graphs. For a graphG, let eq(G) be the minimum number of equivalence subgraphs ofG needed to cover all edges ofG. Similarly, let cc(G) be the minimum number of complete subgraphs ofG needed to cover all its edges. LetH be a graph onn vertices with maximal degree ≦d (and minimal degree ≧1), and letG= \(\bar H\) be its complement. We show that $$\log _2 n - \log _2 d \leqq eq(G) \leqq cc(G) \leqq 2e^2 (d + 1)^2 \log _e n.$$ The lower bound is proved by multilinear techniques (exterior algebra), and its assertion for the complement of ann-cycle settles a problem of Frankl. The upper bound is proved by probabilistic arguments, and it generalizes results of de Caen, Gregory and Pullman. 相似文献
77.
Ofir E. Alon 《Molecular physics》2019,117(15-16):2108-2120
Static and dynamic properties of Bose-Einstein condensates in annular traps are investigated by solving the many-boson Schrödinger equation numerically accurately using the multiconfigurational time-dependent Hartree for bosons method. We concentrate on weakly-interacting bosons exhibiting low depletion. Analysis of the mean-field position variance, which accounts for the shape of the density only, and the many-body position variance, which incorporates a tiny amount of excitations through the reduced two-particle density matrix, shows that the former behaves essentially as a quasi-one-dimensional quantity whereas the latter as a two-dimensional quantity. This brings another dimension to the physics of bosons in ring-shaped traps. 相似文献
78.
Fractal properties in time series of human behavior and physiology are quite ubiquitous, and several methods to capture such properties have been proposed in the past decades. Fractal properties are marked by similarities in statistical characteristics over time and space, and it has been suggested that such properties can be well-captured through recurrence quantification analysis. However, no methods to capture fractal fluctuations by means of recurrence-based methods have been developed yet. The present paper takes this suggestion as a point of departure to propose and test several approaches to quantifying fractal fluctuations in synthetic and empirical time-series data using recurrence-based analysis. We show that such measures can be extracted based on recurrence plots, and contrast the different approaches in terms of their accuracy and range of applicability. 相似文献
79.
We consider the problem of representing the visibility graph of line segments as a union of cliques and bipartite cliques.
Given a graphG, a familyG={G
1,G
2,...,G
k
} is called aclique cover ofG if (i) eachG
i
is a clique or a bipartite clique, and (ii) the union ofG
i
isG. The size of the clique coverG is defined as ∑
i=1
k
n
i
, wheren
i
is the number of vertices inG
i
. Our main result is that there are visibility graphs ofn nonintersecting line segments in the plane whose smallest clique cover has size Ω(n
2/log2
n). An upper bound ofO(n
2/logn) on the clique cover follows from a well-known result in extremal graph theory. On the other hand, we show that the visibility
graph of a simple polygon always admits a clique cover of sizeO(nlog3
n), and that there are simple polygons whose visibility graphs require a clique cover of size Ω(n logn).
The work by the first author was supported by National Science Foundation Grant CCR-91-06514. The work by the second author
was supported by a USA-Israeli BSF grant. The work by the third author was supported by National Science Foundation Grant
CCR-92-11541. 相似文献
80.
The k-th power of a graph G is the graph whose vertex set is V(G)
k
, where two distinct k-tuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon capacity of G, c(G), is lim
k→∞
α(G
k
)1/k
, where α(G) denotes the independence number of G. When G is the characteristic graph of a channel C, c(G) measures the effective alphabet size of C in a zero-error protocol. A sum of channels, C = Σ
i
C
i
, describes a setting when there are t ≥ 2 senders, each with his own channel C
i
, and each letter in a word can be selected from any of the channels. This corresponds to a disjoint union of the characteristic
graphs, G = Σ
i
G
i
. It is well known that c(G) ≥ Σ
i
c(G
i
), and in [1] it is shown that in fact c(G) can be larger than any fixed power of the above sum.
We extend the ideas of [1] and show that for every F, a family of subsets of [t], it is possible to assign a channel C
i
to each sender i ∈ [t], such that the capacity of a group of senders X ⊂ [t] is high iff X contains some F ∈ F. This corresponds to a case where only privileged subsets of senders are allowed to transmit in a high rate. For instance,
as an analogue to secret sharing, it is possible to ensure that whenever at least k senders combine their channels, they obtain a high capacity, however every group of k − 1 senders has a low capacity (and yet is not totally denied of service). In the process, we obtain an explicit Ramsey construction
of an edge-coloring of the complete graph on n vertices by t colors, where every induced subgraph on exp vertices contains all t colors.
Research supported in part by a USA-Israeli BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva
Center for Geometry at Tel Aviv University.
Research partially supported by a Charles Clore Foundation Fellowship. 相似文献