全文获取类型
收费全文 | 17748篇 |
免费 | 1546篇 |
国内免费 | 901篇 |
专业分类
化学 | 4715篇 |
晶体学 | 85篇 |
力学 | 6998篇 |
综合类 | 170篇 |
数学 | 3299篇 |
物理学 | 4928篇 |
出版年
2024年 | 21篇 |
2023年 | 185篇 |
2022年 | 394篇 |
2021年 | 449篇 |
2020年 | 486篇 |
2019年 | 360篇 |
2018年 | 411篇 |
2017年 | 448篇 |
2016年 | 525篇 |
2015年 | 548篇 |
2014年 | 679篇 |
2013年 | 1219篇 |
2012年 | 852篇 |
2011年 | 1111篇 |
2010年 | 796篇 |
2009年 | 1018篇 |
2008年 | 997篇 |
2007年 | 1004篇 |
2006年 | 934篇 |
2005年 | 802篇 |
2004年 | 797篇 |
2003年 | 706篇 |
2002年 | 612篇 |
2001年 | 492篇 |
2000年 | 470篇 |
1999年 | 421篇 |
1998年 | 431篇 |
1997年 | 402篇 |
1996年 | 353篇 |
1995年 | 298篇 |
1994年 | 278篇 |
1993年 | 251篇 |
1992年 | 241篇 |
1991年 | 174篇 |
1990年 | 163篇 |
1989年 | 133篇 |
1988年 | 123篇 |
1987年 | 82篇 |
1986年 | 89篇 |
1985年 | 96篇 |
1984年 | 83篇 |
1983年 | 41篇 |
1982年 | 95篇 |
1981年 | 32篇 |
1980年 | 20篇 |
1979年 | 16篇 |
1978年 | 12篇 |
1976年 | 12篇 |
1971年 | 6篇 |
1957年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献
62.
We consider a multipath maximum flow problem introduced by Kishimoto (Networks 27(4)(1996)279-291). The focus is on efficient transformation from arc flows into multipath flows, where a multipath flow is a nonnegative combination of multipaths. A new algorithm that is more efficient than existing ones is proposed for the transformation. 相似文献
63.
64.
65.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献
66.
67.
某轴流压气机叶尖间隙效应实验研究 总被引:3,自引:0,他引:3
本文对某低速轴流压气机叶尖间隙尺度对性能的影响进行了实验研究,并通过不同的机匣结构情况研究一种叶尖漏流不敏感机匣。实验表明,不同的间隙尺度对叶轮机总体性能存在十分明显的影响。对绝大部分运行状态,小间隙下的压升和效率均明显高于大间隙的情况。另外,所采用的毛刷式和篦齿式的机匣实验结果表明,不论毛刷式还是篦齿式机匣,在大流量负攻角情况下对性能的影响不大,但毛刷式机匣并不能达到提高失速裕度的目的,而篦齿式机匣在小流量情况下对压升有所提高,但对效率影响不大。 相似文献
68.
E. E. Ergozhin N. A. Bektenov A. K. Mekebaeva N. N. Chopabaeva 《Chemistry of Natural Compounds》2003,39(3):299-302
Phosphorus-containing cellulose cation exchangers were synthesized by reaction of wood cellulose with orthophosphoric acid and the ternary polymer from glycidylmethacrylate, styrene, and maleic anhydride. The effects of the ratio of reactants, temperature, and duration of the reaction on the phosphorylation and exchange capacity of the modified cellulose material were studied. 相似文献
69.
The piston problem is investigated in the case where the length of the cylinder is infinite (on both sides) and the ratio m/M is a very small parameter, where m is the mass of one particle of the gaz and M is the mass of the piston. Introducing initial conditions such that the stochastic motion of the piston remains in the average at the origin (no drift), it is shown that the time evolution of the fluids, analytically derived from Liouville equation in a previous work, agrees with the Second Law of thermodynamics. We thus have a non equilibrium microscopical model whose evolution can be explicitly shown to obey the two laws of thermodynamics. 相似文献
70.
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. 相似文献