全文获取类型
收费全文 | 21821篇 |
免费 | 3614篇 |
国内免费 | 3669篇 |
专业分类
化学 | 17083篇 |
晶体学 | 333篇 |
力学 | 1225篇 |
综合类 | 275篇 |
数学 | 2461篇 |
物理学 | 7727篇 |
出版年
2024年 | 46篇 |
2023年 | 378篇 |
2022年 | 642篇 |
2021年 | 754篇 |
2020年 | 824篇 |
2019年 | 842篇 |
2018年 | 716篇 |
2017年 | 741篇 |
2016年 | 1022篇 |
2015年 | 1063篇 |
2014年 | 1288篇 |
2013年 | 1764篇 |
2012年 | 1932篇 |
2011年 | 2104篇 |
2010年 | 1538篇 |
2009年 | 1444篇 |
2008年 | 1665篇 |
2007年 | 1446篇 |
2006年 | 1373篇 |
2005年 | 1077篇 |
2004年 | 902篇 |
2003年 | 732篇 |
2002年 | 699篇 |
2001年 | 615篇 |
2000年 | 521篇 |
1999年 | 452篇 |
1998年 | 373篇 |
1997年 | 304篇 |
1996年 | 297篇 |
1995年 | 255篇 |
1994年 | 225篇 |
1993年 | 192篇 |
1992年 | 148篇 |
1991年 | 129篇 |
1990年 | 137篇 |
1989年 | 87篇 |
1988年 | 82篇 |
1987年 | 52篇 |
1986年 | 60篇 |
1985年 | 46篇 |
1984年 | 38篇 |
1983年 | 30篇 |
1982年 | 21篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1973年 | 3篇 |
1957年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
New heuristics for over-constrained flight to gate assignments 总被引:1,自引:0,他引:1
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results. 相似文献
52.
53.
The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets. 相似文献
54.
55.
56.
57.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
58.
一类Narcissistic反应过渡态的优化 总被引:1,自引:0,他引:1
我们对一类narcissistic 反应XCH_2-CH_2Y→[过渡态TS]→YCH_2—CH_2X (1)进行了研究,结果表明其过渡态能在对称性限制下由能量极小化方法较容易地给出. 采用IMSPAK分子轨道从头算程序,在IBM VM/370计算机系统上用STO—3G极小基组以平衡几何构型的能量梯度优化方法,在对称性限制下对反应(1)的几种反应体系的过渡态构型进行了优化,其结果列于表1. 相似文献
59.
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal
constant composition codes meeting the upper bound given by [13]. 相似文献
60.
Hong-Nian Li Xiao-Xiong WangWang-Feng Ding 《Journal of Electron Spectroscopy and Related Phenomena》2006
Using X-ray photoemission measurements, we have determined the attenuation length of C 1s photoelectrons in C60 film to be 21.5 Å with the incident photon energy of Mg Kα radiation. The inelastic mean free path calculated with the TPP-2M algorithm coincides fairly well with the experimentally determined attenuation length, indicating the validity of the algorithm to fullerene and fullerides. The inelastic mean free paths for some fullerides, i.e. K3C60, K6C60, Ba4C60, Sm2.75C60 and Sm6C60 are calculated to help the quantitative analyses of the photoemission spectra for these compounds. 相似文献