全文获取类型
收费全文 | 2601篇 |
免费 | 178篇 |
国内免费 | 84篇 |
专业分类
化学 | 100篇 |
晶体学 | 2篇 |
力学 | 43篇 |
综合类 | 29篇 |
数学 | 2530篇 |
物理学 | 159篇 |
出版年
2024年 | 12篇 |
2023年 | 47篇 |
2022年 | 73篇 |
2021年 | 47篇 |
2020年 | 102篇 |
2019年 | 98篇 |
2018年 | 93篇 |
2017年 | 85篇 |
2016年 | 64篇 |
2015年 | 55篇 |
2014年 | 91篇 |
2013年 | 221篇 |
2012年 | 75篇 |
2011年 | 133篇 |
2010年 | 132篇 |
2009年 | 242篇 |
2008年 | 191篇 |
2007年 | 146篇 |
2006年 | 151篇 |
2005年 | 94篇 |
2004年 | 87篇 |
2003年 | 89篇 |
2002年 | 75篇 |
2001年 | 61篇 |
2000年 | 65篇 |
1999年 | 59篇 |
1998年 | 48篇 |
1997年 | 43篇 |
1996年 | 23篇 |
1995年 | 16篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 15篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2863条查询结果,搜索用时 15 毫秒
951.
This paper gives a pathwise construction of Jackson-type queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools for these results are the subadditive ergodic theorem, which is used to derive a strong law of large numbers, and basic theorems on monotone stochastic recursive sequences. The techniques which are proposed here apply to other and more general classes of discrete event systems, like Petri nets or GSMPs. The paper also provides new results on the Jackson-type networks with i.i.d. driving sequences which were studied in the past.The work of this author was supported in part by a grant from the European Commission DG XIII, under the BRA Qmips contract.The work of this author was supported by a sabbatical grant from INRIA Sophia Antipolis. 相似文献
952.
953.
扩展时间事件图的分析 总被引:2,自引:0,他引:2
本文研究了一类扩展时间事件图的分析问题,证明了系统的输出时间序列有三类.有限序列,准周期序列,近似于Dlogp q的序列. 相似文献
954.
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical asymmetry between incoming and outgoing edges. We show that the model exhibits a percolation transition and discuss its universality. Below the threshold, the distribution of component sizes decreases algebraically with a continuously varying exponent depending on the average connectivity. We prove that the transition is of infinite order by deriving the exact asymptotic formula for the size of the giant component close to the threshold. We also present a thorough analysis of aging properties. We compute local-in-time profiles for the components of finite size and for the giant component, showing in particular that the giant component is always dense among the oldest nodes but invades only an exponentially small fraction of the young nodes close to the threshold. 相似文献
955.
A cyclic face 2‐colourable triangulation of the complete graph Kn in an orientable surface exists for n ≡ 7 (mod 12). Such a triangulation corresponds to a cyclic bi‐embedding of a pair of Steiner triple systems of order n, the triples being defined by the faces in each of the two colour classes. We investigate in the general case the production of such bi‐embeddings from solutions to Heffter's first difference problem and appropriately labelled current graphs. For n = 19 and n = 31 we give a complete explanation for those pairs of Steiner triple systems which do not admit a cyclic bi‐embedding and we show how all non‐isomorphic solutions may be identified. For n = 43 we describe the structures of all possible current graphs and give a more detailed analysis in the case of the Heawood graph. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 92–110, 2002; DOI 10.1002/jcd.10001 相似文献
956.
We consider uniform random walks on finite graphs withn nodes. When the hitting times are symmetric, the expected covering time is at least 1/2n logn-O(n log logn) uniformly over all such graphs. We also obtain bounds for the covering times in terms of the eigenvalues of the transition matrix of the Markov chain. For distance-regular graphs, a general lower bound of (n-1) logn is obtained. For hypercubes and binomial coefficient graphs, the limit law of the covering time is obtained as well. 相似文献
957.
In order to avoid interference in cellular telephone networks, sets of radio frequencies are to be assigned to transmitters such that adjacent transmitters are allotted disjoint sets of frequencies. Often these transmitters are laid out like vertices of a triangular lattice in a plane. This problem corresponds to the problem of multicoloring an induced subgraph of a triangular lattice with integer demands associated with each vertex. We deal with the simpler case of triangle-free subgraphs of the lattice. [Frédéric Havet, Discrete Math. 233 (2001) 1–3] uses inductive arguments to prove that triangle-free hexagonal graphs can be colored with colors where ωd is the maximum demand on a clique in the graph. We give a simpler proof and hope that our techniques can be used to prove the conjecture by [McDiarmid and Reed, Networks Suppl. 36 (2000) 114–117] that these graphs are -multicolorable. 相似文献
958.
A well‐known conjecture of Erd?s states that given an infinite graph G and sets A, ? V(G), there exists a family of disjoint A ? B paths ?? together with an A ? B separator X consisting of a choice of one vertex from each path in ??. There is a natural extension of this conjecture in which A, B, and X may contain ends as well as vertices. We prove this extension by reducing it to the vertex version, which was recently proved by Aharoni and Berger. © 2005 Wiley Periodicals, Inc. J Graph Theory 50: 199–211, 2005 相似文献
959.
The key to Seymour's Regular Matroid Decomposition Theorem is his result that each 3‐connected regular matroid with no R10‐ or R12‐minor is graphic or cographic. We present a proof of this in terms of signed graphs. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005 相似文献
960.
A number of results in hamiltonian graph theory are of the form “
implies
”, where
is a property of graphs that is NP-hard and
is a cycle structure property of graphs that is also NP-hard. An example of such a theorem is the well-known Chvátal–Erd
s Theorem, which states that every graph G with κ is hamiltonian. Here κ is the vertex connectivity of G and is the cardinality of a largest set of independent vertices of G. In another paper Chvátal points out that the proof of this result is in fact a polynomial time construction that either produces a Hamilton cycle or a set of more than κ independent vertices. In this note we point out that other theorems in hamiltonian graph theory have a similar character. In particular, we present a constructive proof of a well-known theorem of Jung (Ann. Discrete Math. 3 (1978) 129) for graphs on 16 or more vertices. 相似文献