全文获取类型
收费全文 | 37721篇 |
免费 | 3929篇 |
国内免费 | 2733篇 |
专业分类
电工技术 | 2863篇 |
技术理论 | 8篇 |
综合类 | 5466篇 |
化学工业 | 2959篇 |
金属工艺 | 1000篇 |
机械仪表 | 2362篇 |
建筑科学 | 3695篇 |
矿业工程 | 1312篇 |
能源动力 | 1419篇 |
轻工业 | 528篇 |
水利工程 | 1052篇 |
石油天然气 | 914篇 |
武器工业 | 614篇 |
无线电 | 3431篇 |
一般工业技术 | 4491篇 |
冶金工业 | 2419篇 |
原子能技术 | 348篇 |
自动化技术 | 9502篇 |
出版年
2024年 | 148篇 |
2023年 | 615篇 |
2022年 | 815篇 |
2021年 | 1043篇 |
2020年 | 1206篇 |
2019年 | 1092篇 |
2018年 | 1130篇 |
2017年 | 1281篇 |
2016年 | 1379篇 |
2015年 | 1407篇 |
2014年 | 2159篇 |
2013年 | 2614篇 |
2012年 | 2357篇 |
2011年 | 2701篇 |
2010年 | 2184篇 |
2009年 | 2279篇 |
2008年 | 2349篇 |
2007年 | 2460篇 |
2006年 | 2288篇 |
2005年 | 2019篇 |
2004年 | 1648篇 |
2003年 | 1357篇 |
2002年 | 1163篇 |
2001年 | 943篇 |
2000年 | 822篇 |
1999年 | 715篇 |
1998年 | 549篇 |
1997年 | 499篇 |
1996年 | 421篇 |
1995年 | 407篇 |
1994年 | 328篇 |
1993年 | 280篇 |
1992年 | 254篇 |
1991年 | 189篇 |
1990年 | 156篇 |
1989年 | 170篇 |
1988年 | 133篇 |
1987年 | 74篇 |
1986年 | 93篇 |
1985年 | 69篇 |
1984年 | 69篇 |
1983年 | 50篇 |
1982年 | 56篇 |
1981年 | 43篇 |
1980年 | 32篇 |
1979年 | 33篇 |
1978年 | 30篇 |
1977年 | 26篇 |
1964年 | 27篇 |
1955年 | 36篇 |
排序方式: 共有10000条查询结果,搜索用时 18 毫秒
71.
煤矿监控图像增强算法的分析与实现 总被引:1,自引:0,他引:1
针对煤矿井下粉尘多、光照差的恶劣环境使得矿井监控图像偏暗、对比度低、视觉效果差的特点,提出了一种基于小波变换和模糊理论的图像增强算法。该算法选择小波变换为工具分解图像,应用新的模糊隶属度和增强算子对高频信息进行模糊处理,利用直方图均衡化对低频信息进行处理,最后对图像进行重构。处理结果较好地增强了图像细节信息,从整体上改善了图像效果。 相似文献
72.
本文讨论非嵌套信息结构的递阶队决策问题和控制均享信息结构的LQG分散控制问题,文中首先证明这两类问题的信息结构都是“部分控制嵌入”的,进而给出最优策略(或控制)存在的充要条件和当此条件成立时最优策略(或控制)的表达式。 相似文献
73.
Information theory offers a means for analyzing some constraints on the reading and copying process in Old English. Entropy for strings of various lengths offers a baseline measure of the uncertainty involved in transmission of Old English texts, while avoiding the pitfalls of applying models of modern reading to early medieval practice. Analysis of lengthy prose and verse texts in Old English revealed uniformly high values for entropy at all string lengths. High entropies may be the result of the language's irregular orthography, poetic koiné, and several dialects and imply that the language may have been easy to write but difficult to read. The low redundancy of the language which its high entropy values indicate suggests that the reader of Old English played an enhanced role in decoding a text and may provide an explanation for the high variability in the transmission of Old English verse.Katherine O'Brien O 'Keeffe is Professor of English at Texas A&M University and a co-director of its Interdisciplinary Group for Historical Literary Study.William Rundell is Professor of Mathematics at Texas A&M University. 相似文献
74.
Sidney C. Bailin 《Journal of Automated Reasoning》1988,4(3):269-286
We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo -reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that -unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).This material is based upon work supported by the National Science Foundation under award number ISI-8560438. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation. 相似文献
75.
A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of successful scientific inquiry is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible. 相似文献
76.
Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1))
) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The algorithms use the well known basic scheme of obtaining linear equations for logarithms of small primes and then solving them to obtain a database to be used for the computation of individual logarithms. The novel ingredients are new ways of obtaining linear equations and new methods of solving these linear equations by adaptations of sparse matrix methods from numerical analysis to the case of finite rings. While some of the new logarithm algorithms are adaptations of known integer factorization algorithms, others are new and can be adapted to yield integer factorization algorithms. 相似文献
77.
The specific heat at constant pressure, C
p, of aluminum measured by Ditmars, Plint, and Shukla has been reduced to the volume V
0 appropriate for 0 K employing the Murnaghan equation. The C
v0 thus obtained is compared with the theoretical C
v0 calculated in the harmonic and the lowest-order anharmonic approximation from three different pseudopotentials (Harrison, Ashcroft, and Dagens-Rasolt-Taylor) as well as a phenomenological Morse potential. The higher-order (
4) anharmonic contributions are calculated from the same nearest-neighbor Morse potential as in the lowest-order anharmonic theory. The role of the vacancy and the higher-order anharmonic contributions to C
v0 has been examined and we conclude that the
4 contributions to C
v0 are much smaller than the vacancy contribution. After removal of the vacancy contribution, the reduced C
v0 is found to be in excellent agreement with the Ashcroft and Harrison pseudopotentials as well as the Morse potential including the
2 and
4 contributions to C
v0. 相似文献
78.
79.
80.