全文获取类型
收费全文 | 2219篇 |
免费 | 107篇 |
国内免费 | 152篇 |
专业分类
化学 | 536篇 |
晶体学 | 9篇 |
力学 | 51篇 |
综合类 | 49篇 |
数学 | 1409篇 |
物理学 | 424篇 |
出版年
2023年 | 26篇 |
2022年 | 50篇 |
2021年 | 44篇 |
2020年 | 50篇 |
2019年 | 65篇 |
2018年 | 50篇 |
2017年 | 71篇 |
2016年 | 62篇 |
2015年 | 53篇 |
2014年 | 98篇 |
2013年 | 173篇 |
2012年 | 103篇 |
2011年 | 121篇 |
2010年 | 118篇 |
2009年 | 156篇 |
2008年 | 195篇 |
2007年 | 165篇 |
2006年 | 138篇 |
2005年 | 77篇 |
2004年 | 82篇 |
2003年 | 74篇 |
2002年 | 62篇 |
2001年 | 60篇 |
2000年 | 47篇 |
1999年 | 42篇 |
1998年 | 47篇 |
1997年 | 23篇 |
1996年 | 31篇 |
1995年 | 33篇 |
1994年 | 22篇 |
1993年 | 15篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 11篇 |
1989年 | 8篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 12篇 |
1985年 | 10篇 |
1984年 | 9篇 |
1983年 | 2篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1973年 | 2篇 |
1971年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有2478条查询结果,搜索用时 62 毫秒
1.
2.
G.E. Farr 《Discrete Mathematics》2019,342(5):1510-1519
This paper continues the study of combinatorial properties of binary functions — that is, functions such that , where is a finite set. Binary functions have previously been shown to admit families of transforms that generalise duality, including a trinity transform, and families of associated minor operations that generalise deletion and contraction, with both these families parameterised by the complex numbers. Binary function representations exist for graphs (via the indicator functions of their cutset spaces) and indeed arbitrary matroids (as shown by the author previously). In this paper, we characterise degenerate elements – analogues of loops and coloops – in binary functions, with respect to any set of minor operations from our complex-parameterised family. We then apply this to study the relationship between binary functions and Tutte’s alternating dimaps, which also support a trinity transform and three associated minor operations. It is shown that only the simplest alternating dimaps have binary representations of the form we consider, which seems to be the most direct type of representation. The question of whether there exist other, more sophisticated types of binary function representations for alternating dimaps is left open. 相似文献
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.
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. 相似文献
5.
用Quantum Sutton-Chen多体势对Ag6Cu4和CuNi液态金属凝固过程进行了分子动力学模拟研究.在冷却速率2×1012到2×1014K/s范围内,CuNi总是形成fcc晶体结构,而Ag6Cu4总是形成非晶态结构.考虑到CuNi及AgCu中原子半径之比分别为1.025和1.13,那么模拟结果证实了原子的尺寸差别是非晶态合金形成的一个主要影响因素.此外采用键对及原子多面体类型指数法对凝固过程中微观结构组态变化的分析,不但能说明二十面体结构在非晶态合金形成和稳定性中所起的关键作用,又有助于对液态金属的凝固过程、非晶态结构特征的深入理解. 相似文献
6.
7.
8.
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. 相似文献
9.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
10.
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. 相似文献