全文获取类型
收费全文 | 4848篇 |
免费 | 569篇 |
国内免费 | 534篇 |
专业分类
电工技术 | 392篇 |
综合类 | 549篇 |
化学工业 | 149篇 |
金属工艺 | 71篇 |
机械仪表 | 237篇 |
建筑科学 | 273篇 |
矿业工程 | 72篇 |
能源动力 | 111篇 |
轻工业 | 43篇 |
水利工程 | 229篇 |
石油天然气 | 147篇 |
武器工业 | 69篇 |
无线电 | 563篇 |
一般工业技术 | 286篇 |
冶金工业 | 69篇 |
原子能技术 | 37篇 |
自动化技术 | 2654篇 |
出版年
2024年 | 9篇 |
2023年 | 67篇 |
2022年 | 57篇 |
2021年 | 85篇 |
2020年 | 95篇 |
2019年 | 120篇 |
2018年 | 85篇 |
2017年 | 126篇 |
2016年 | 130篇 |
2015年 | 162篇 |
2014年 | 216篇 |
2013年 | 263篇 |
2012年 | 284篇 |
2011年 | 345篇 |
2010年 | 277篇 |
2009年 | 334篇 |
2008年 | 356篇 |
2007年 | 450篇 |
2006年 | 346篇 |
2005年 | 318篇 |
2004年 | 252篇 |
2003年 | 233篇 |
2002年 | 193篇 |
2001年 | 140篇 |
2000年 | 132篇 |
1999年 | 120篇 |
1998年 | 104篇 |
1997年 | 114篇 |
1996年 | 98篇 |
1995年 | 71篇 |
1994年 | 88篇 |
1993年 | 59篇 |
1992年 | 39篇 |
1991年 | 45篇 |
1990年 | 18篇 |
1989年 | 23篇 |
1988年 | 19篇 |
1987年 | 13篇 |
1986年 | 4篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1962年 | 2篇 |
排序方式: 共有5951条查询结果,搜索用时 15 毫秒
11.
对快速击实试验研究成果进行了总结,并介绍了应用快速击实试验研究成果的经验.不论是重型击实还是轻型击实,也不论击实试验所给定的击实功能多大,应用"一点法"或"快速法"击实试验原理,对土料都有一定要求."一点法"击实试验与快速击实试验所用土体的比重在2.67~2.73之间,当被测土样的比重超越此范围时,在绘制击实曲线时可适当偏离ρdmax计算值的点,但这个误差是很小的,通常ρdmax的影响在±0.01 g/cm3以内,而对ωop的影响在±0.5%以内.结合工程实例,对击实试验成果的简化校正作了详细介绍. 相似文献
12.
This paper presents a quantum protocol that demonstrates that weak coin flipping with bias ≈0.239, less than 1/4, is possible. A bias of 1/4 was the smallest known, and followed from the strong coin flipping protocol of Ambainis in [33rd STOC, 2001] (also proposed by Spekkens and Rudolph [Phys. Rev. A 65 (2002) 012310]). Protocols with yet smaller bias ≈0.207 have independently been discovered by Ambainis (2001) and Spekkens and Rudolph [Phys. Rev. Lett. 89 (2002) 227901]. We also present an alternative strong coin flipping protocol with bias 1/4 with analysis simpler than that of Ambainis [33rd STOC, 2001]. 相似文献
13.
John Watrous 《Computational Complexity》2003,12(1-2):48-84
This paper studies the space-complexity of predicting the
long-term behavior of a class of stochastic processes based on evolutions
and measurements of quantum mechanical systems. These processes
generalize a wide range of both quantum and classical space-bounded
computations, including unbounded error computations given by machines
having algebraic number transition amplitudes or probabilities.
It is proved that any space s quantum stochastic process from this class
can be simulated probabilistically with unbounded error in space O(s),
and therefore deterministically in space O(s2). 相似文献
14.
通过在广东工业大学数学专业7年的专业调整实践,探索了广东工业大学应用数学学院以信息科学、统计科学为数学专业方向的社会时代背景,说明了各个专业方向培养的侧重点和就业前景,阐明了传统学科专业与新增专业方向的联系与区别。 相似文献
15.
F. Pasquarelli 《Journal of scientific computing》1995,10(3):289-304
The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%). 相似文献
16.
17.
Brian J. Ross 《Formal Aspects of Computing》1997,9(3):331-348
Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools. 相似文献
18.
Dmitri E. Nikonov George I. Bourianoff Paolo A. Gargini 《Journal of Superconductivity and Novel Magnetism》2006,19(6):497-513
Quantum limits of power dissipation in spintronic computing are estimated. A computing element composed of a single electron
in a quantum dot is considered. Dynamics of its spin due to external magnetic field and interaction with adjacent dots are
described via the Bloch equations. Spin relaxation due to magnetic noise from various sources is described as coupling to
a reservoir. Resulting dissipation of energy is calculated and is shown to be much less than the thermal limit, ∼kT per bit,
if the rate of spin relaxation is much slower than the switching rate. Clues on how to engineer an energy efficient spintronic
device are provided. 相似文献
19.
Bo Gyeong Kang 《Information Processing Letters》2006,97(6):219-224
In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for an arbitrary chosen point can be transformed into the plain pairing for a trace zero point which has a special form to compute them more efficiently. Then the optimizations made for computing squared pairings are combined with the computation of pairings on these trace zero points, to achieve even better performance for the computation of the 4th powered Weil pairing. 相似文献
20.