全文获取类型
收费全文 | 38485篇 |
免费 | 1192篇 |
国内免费 | 285篇 |
专业分类
化学 | 26790篇 |
晶体学 | 304篇 |
力学 | 809篇 |
综合类 | 1篇 |
数学 | 6530篇 |
物理学 | 5528篇 |
出版年
2023年 | 183篇 |
2022年 | 346篇 |
2021年 | 465篇 |
2020年 | 649篇 |
2019年 | 652篇 |
2018年 | 445篇 |
2017年 | 412篇 |
2016年 | 1008篇 |
2015年 | 899篇 |
2014年 | 1070篇 |
2013年 | 1853篇 |
2012年 | 2305篇 |
2011年 | 2619篇 |
2010年 | 1415篇 |
2009年 | 1245篇 |
2008年 | 2401篇 |
2007年 | 2229篇 |
2006年 | 2265篇 |
2005年 | 2133篇 |
2004年 | 1828篇 |
2003年 | 1508篇 |
2002年 | 1439篇 |
2001年 | 569篇 |
2000年 | 546篇 |
1999年 | 448篇 |
1998年 | 426篇 |
1997年 | 457篇 |
1996年 | 499篇 |
1995年 | 365篇 |
1994年 | 419篇 |
1993年 | 383篇 |
1992年 | 358篇 |
1991年 | 319篇 |
1990年 | 291篇 |
1989年 | 255篇 |
1988年 | 252篇 |
1987年 | 253篇 |
1986年 | 223篇 |
1985年 | 437篇 |
1984年 | 384篇 |
1983年 | 327篇 |
1982年 | 384篇 |
1981年 | 329篇 |
1980年 | 332篇 |
1979年 | 282篇 |
1978年 | 274篇 |
1977年 | 257篇 |
1976年 | 257篇 |
1975年 | 236篇 |
1974年 | 222篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
41.
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. 相似文献
42.
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. 相似文献
43.
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. 相似文献
44.
The N-carboethoxy precursor to (±)-tecomanine has been prepared in 11 steps from 2-methyl-1-buten-3-yne. The key step, Pauson-Khand cyclization of a methylated 5-aza-6-nonen-1-yne succeeds, but only in low yield, a consequence of the dialkyl substitution about the azaenyne framework. Nevertheless, the overall sequence to that point is one of the more efficient to be described. 相似文献
45.
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. 相似文献
46.
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.
47.
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. 相似文献
48.
49.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献
50.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献