全文获取类型
收费全文 | 942篇 |
免费 | 34篇 |
国内免费 | 2篇 |
专业分类
化学 | 419篇 |
晶体学 | 4篇 |
力学 | 27篇 |
数学 | 255篇 |
物理学 | 273篇 |
出版年
2022年 | 8篇 |
2021年 | 13篇 |
2020年 | 7篇 |
2019年 | 20篇 |
2018年 | 16篇 |
2017年 | 7篇 |
2016年 | 29篇 |
2015年 | 17篇 |
2014年 | 13篇 |
2013年 | 61篇 |
2012年 | 28篇 |
2011年 | 51篇 |
2010年 | 25篇 |
2009年 | 30篇 |
2008年 | 52篇 |
2007年 | 51篇 |
2006年 | 40篇 |
2005年 | 43篇 |
2004年 | 35篇 |
2003年 | 36篇 |
2002年 | 25篇 |
2001年 | 16篇 |
2000年 | 10篇 |
1997年 | 14篇 |
1996年 | 11篇 |
1995年 | 14篇 |
1994年 | 17篇 |
1993年 | 6篇 |
1992年 | 14篇 |
1991年 | 12篇 |
1990年 | 15篇 |
1989年 | 17篇 |
1988年 | 18篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 16篇 |
1984年 | 13篇 |
1983年 | 12篇 |
1982年 | 10篇 |
1981年 | 18篇 |
1980年 | 12篇 |
1979年 | 7篇 |
1978年 | 16篇 |
1977年 | 14篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 10篇 |
1969年 | 4篇 |
排序方式: 共有978条查询结果,搜索用时 26 毫秒
1.
2.
Algebras and Representation Theory - We would like to correct two errors in our paper Involutions of type G2 over a field of characteristic 2 [2]. 相似文献
3.
A rectilinear drawing of a graph is one where each edge is drawn as a straight-line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer k ≥ 4, a class of graphs of crossing number k, but unbounded rectilinear crossing number. This is best possible since the rectilinear crossing number is equal to the crossing number whenever the latter is at most 3. Further, if we consider drawings where each edge is drawn as a polygonal line segment with at most one break point, then the resulting crossing number is at most quadratic in the regular crossing number. © 1993 John Wiley & Sons, Inc. 相似文献
4.
Nathaniel A. Friedman 《Israel Journal of Mathematics》1989,68(3):365-375
A weakly mixing transformationT and a sequence (d
n) are constructed such thatT is uniformly mixing on (d
n),T is uniformly sweeping out on ([αd
n]) for allα∈(0, 1), and for all rationalα∈(0, 1)T is not mixing on ([αd
n]). 相似文献
5.
We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported. 相似文献
6.
If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time. 相似文献
7.
We study a leader follower game with two players: a terrorist and a state where the later one installs facilities that provide support in case of a terrorist attack. While the Terrorist attacks one of the metropolitan areas to maximize his utility, the State, which acts as a leader, installs the facilities such that the metropolitan area attacked is the one that minimizes her disutility (i.e., minimizes ‘loss’). We solve the problem efficiently for one facility and we formulate it as a mathematical programming problem for a general number of facilities. We demonstrate the problem via a case study of the 20 largest metropolitan areas in the United States. 相似文献
8.
Marcelo Samuel Berman 《International Journal of Theoretical Physics》1992,31(8):1447-1450
Dirac's large number hypothesis (LNH) and the Whitrow-Randall-Sciama relation are related to some cosmological models. The LNH and Whitrow-Randall-Sciama relations are neither equivalent nor consistent in general relativity, but they may both be valid in the Brans-Dicke theory and in another theory considered in this paper. 相似文献
9.
The following is a conjecture of Ulam: In any partition of the integer lattice on the plane into uniformly bounded sets, there exists a set that is adjacent to at least six other sets. Two sets are adjacent if each contain a vertex of the same unit square. This problem is generalized as follows. Given any uniformly bounded partitionP of the vertex set of an infinite graphG with finite maximum degree, letP
(G) denote the graph obtained by letting each set of the partition be a vertex ofP
(G) where two vertices ofP
(G) are adjacent if and only if the corresponding sets have an edge between them. The Ulam number ofG is defined as the minimum of the maximum degree ofP
(G) where the minimum is taken over all uniformly bounded partitionsP. We have characterized the graphs with Ulam number 0, 1, and 2. Restricting the partitions of the vertex set to connected subsets, we obtain the connected Ulam number ofG. We have evaluated the connected Ulam numbers for several infinite graphs. For instance we have shown that the connected Ulam number is 4 ifG is an infinite grid graph. We have settled the Ulam conjecture for the connected case by proving that the connected Ulam number is 6 for an infinite triangular grid graph. The general Ulam conjecture is equivalent to proving that the Ulam number of the infinite triangular grid graph equals 6. We also describe some interesting geometric consequences of the Ulam number, mainly concerning good drawings of infinite graphs. 相似文献
10.
O Berman 《The Journal of the Operational Research Society》2007,58(10):1396-1396