全文获取类型
收费全文 | 2535篇 |
免费 | 213篇 |
国内免费 | 150篇 |
专业分类
化学 | 315篇 |
晶体学 | 1篇 |
力学 | 112篇 |
综合类 | 81篇 |
数学 | 1892篇 |
物理学 | 497篇 |
出版年
2024年 | 6篇 |
2023年 | 29篇 |
2022年 | 87篇 |
2021年 | 74篇 |
2020年 | 74篇 |
2019年 | 76篇 |
2018年 | 71篇 |
2017年 | 78篇 |
2016年 | 84篇 |
2015年 | 66篇 |
2014年 | 103篇 |
2013年 | 180篇 |
2012年 | 106篇 |
2011年 | 118篇 |
2010年 | 136篇 |
2009年 | 136篇 |
2008年 | 165篇 |
2007年 | 158篇 |
2006年 | 145篇 |
2005年 | 97篇 |
2004年 | 105篇 |
2003年 | 106篇 |
2002年 | 82篇 |
2001年 | 89篇 |
2000年 | 76篇 |
1999年 | 69篇 |
1998年 | 62篇 |
1997年 | 44篇 |
1996年 | 40篇 |
1995年 | 27篇 |
1994年 | 31篇 |
1993年 | 20篇 |
1992年 | 25篇 |
1991年 | 16篇 |
1990年 | 17篇 |
1989年 | 10篇 |
1988年 | 6篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 9篇 |
1984年 | 12篇 |
1983年 | 2篇 |
1982年 | 13篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1973年 | 2篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2898条查询结果,搜索用时 0 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class
of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve
model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given
for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively.
Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature
for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions
for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there
exist UMRE estimators of parameters in the variance components model are obtained for the first time. 相似文献
3.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
4.
图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件. 相似文献
5.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
6.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
7.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
8.
应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查,将所得数据转换成重要值,以杂草在27个样点中的重要值为运算指标,应用主成分分析法和图论聚类中的最小生成树法,对24种杂草的生态学相似性进行了比较,指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因:杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。 相似文献
9.
We present in this paper an efficient approach for solving the problem of planning the long-term (multiyear) operation of a multireservoir hydroelectric power system for the critical period with a monthly variable load. This load is equal to a certain percentage of the total generation at the end of the year, subject to satisfying a number of constraints on the hydrosystem, using the minimum norm formulation.The proposed method is efficient in computing time and in calculating the total expected benefits from the system during the critical period. Numerical results are reported for a real system in operation consisting of two rivers. Each river has two series reservoirs.This work was supported by the Natural Science and Engineering Research Council of Canada, Grant No. A4146. 相似文献
10.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献