全文获取类型
收费全文 | 36488篇 |
免费 | 1299篇 |
国内免费 | 280篇 |
专业分类
化学 | 25552篇 |
晶体学 | 289篇 |
力学 | 739篇 |
综合类 | 1篇 |
数学 | 6218篇 |
物理学 | 5268篇 |
出版年
2023年 | 171篇 |
2022年 | 333篇 |
2021年 | 452篇 |
2020年 | 623篇 |
2019年 | 609篇 |
2018年 | 435篇 |
2017年 | 403篇 |
2016年 | 961篇 |
2015年 | 854篇 |
2014年 | 1036篇 |
2013年 | 1795篇 |
2012年 | 2221篇 |
2011年 | 2547篇 |
2010年 | 1364篇 |
2009年 | 1221篇 |
2008年 | 2344篇 |
2007年 | 2166篇 |
2006年 | 2176篇 |
2005年 | 2034篇 |
2004年 | 1745篇 |
2003年 | 1429篇 |
2002年 | 1389篇 |
2001年 | 528篇 |
2000年 | 508篇 |
1999年 | 431篇 |
1998年 | 413篇 |
1997年 | 442篇 |
1996年 | 484篇 |
1995年 | 343篇 |
1994年 | 388篇 |
1993年 | 359篇 |
1992年 | 336篇 |
1991年 | 303篇 |
1990年 | 262篇 |
1989年 | 226篇 |
1988年 | 237篇 |
1987年 | 238篇 |
1986年 | 195篇 |
1985年 | 405篇 |
1984年 | 354篇 |
1983年 | 298篇 |
1982年 | 363篇 |
1981年 | 297篇 |
1980年 | 319篇 |
1979年 | 266篇 |
1978年 | 249篇 |
1977年 | 236篇 |
1976年 | 232篇 |
1975年 | 209篇 |
1974年 | 177篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Maria Chudnovsky Jim Geelen Bert Gerards Luis Goddyn Michael Lohman Paul Seymour 《Combinatorica》2006,26(5):521-532
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint
A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem.
These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research
was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow. 相似文献
52.
Let T be a suitable system of classical set theory. We will show, that the Σ1 spectrum of T, i.e. the set of ordinals having good Σ1 definition in T is an initial segment of the ordinals.
Received: 11 October 1999 / Published online: 12 December 2001 相似文献
53.
Michael Giudici 《Designs, Codes and Cryptography》2006,39(2):163-172
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial
cosets of E in C.
Michael Giudici - The author holds an Australian Postdoctoral Fellowship. 相似文献
54.
Apurba Bhattacharya Nitin C. Patel Michael Peddicord Luca Parlanti John A. Grosso 《Tetrahedron letters》2006,47(30):5341-5343
An efficient, one-pot, phase transfer N-amination technology was developed. The protocol utilizes chloramine, an inexpensive and safe electrophilic aminating agent potentially viable for commercial manufacturing. 相似文献
55.
A two-dimensional framework (G,p) is
a graph G = (V,E) together with a map p: V → ℝ2. We view (G,p) as a straight line realization of G in ℝ2. Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length.
A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points
corresponding to u and v is the same
in all pairs of equivalent generic realizations of G. The graph G is globally rigid
if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the
first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs.
As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid
graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given
generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3]. 相似文献
56.
Michael A. Mandell 《Publications Mathématiques de L'IHéS》2006,103(1):213-246
Finite type nilpotent spaces are weakly equivalent if and only if their singular cochains are quasi-isomorphic as E∞ algebras. The cochain functor from the homotopy category of finite type nilpotent spaces to the homotopy category of E∞ algebras is faithful but not full. 相似文献
57.
Michael McLendon 《Topology and its Applications》2007,154(18):3140-3144
For a surface F, the Kauffman bracket skein module of F×[0,1], denoted K(F), admits a natural multiplication which makes it an algebra. When specialized at a complex number t, nonzero and not a root of unity, we have Kt(F), a vector space over C. In this paper, we will use the product-to-sum formula of Frohman and Gelca to show that the vector space Kt(T2) has five distinct traces. One trace, the Yang-Mills measure, is obtained by picking off the coefficient of the empty skein. The other four traces on Kt(T2) correspond to the four singular points of the moduli space of flat SU(2)-connections on the torus. 相似文献
58.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem. 相似文献
59.
An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.
60.
This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions. 相似文献