全文获取类型
收费全文 | 230108篇 |
免费 | 31503篇 |
国内免费 | 23335篇 |
专业分类
电工技术 | 26530篇 |
技术理论 | 17篇 |
综合类 | 28662篇 |
化学工业 | 14721篇 |
金属工艺 | 6261篇 |
机械仪表 | 14658篇 |
建筑科学 | 16583篇 |
矿业工程 | 6862篇 |
能源动力 | 8101篇 |
轻工业 | 5710篇 |
水利工程 | 10224篇 |
石油天然气 | 8817篇 |
武器工业 | 2940篇 |
无线电 | 31176篇 |
一般工业技术 | 15962篇 |
冶金工业 | 6341篇 |
原子能技术 | 1590篇 |
自动化技术 | 79791篇 |
出版年
2024年 | 1591篇 |
2023年 | 4309篇 |
2022年 | 8126篇 |
2021年 | 9025篇 |
2020年 | 9399篇 |
2019年 | 7508篇 |
2018年 | 6759篇 |
2017年 | 8137篇 |
2016年 | 9083篇 |
2015年 | 9757篇 |
2014年 | 14442篇 |
2013年 | 14341篇 |
2012年 | 16774篇 |
2011年 | 17890篇 |
2010年 | 14037篇 |
2009年 | 14751篇 |
2008年 | 15045篇 |
2007年 | 16931篇 |
2006年 | 14560篇 |
2005年 | 12871篇 |
2004年 | 10591篇 |
2003年 | 9316篇 |
2002年 | 7417篇 |
2001年 | 6184篇 |
2000年 | 5270篇 |
1999年 | 4183篇 |
1998年 | 3315篇 |
1997年 | 2724篇 |
1996年 | 2408篇 |
1995年 | 1981篇 |
1994年 | 1559篇 |
1993年 | 1079篇 |
1992年 | 841篇 |
1991年 | 618篇 |
1990年 | 492篇 |
1989年 | 405篇 |
1988年 | 255篇 |
1987年 | 157篇 |
1986年 | 132篇 |
1985年 | 127篇 |
1984年 | 124篇 |
1983年 | 69篇 |
1982年 | 90篇 |
1981年 | 42篇 |
1980年 | 52篇 |
1979年 | 55篇 |
1978年 | 17篇 |
1974年 | 10篇 |
1959年 | 21篇 |
1951年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
本文首先给出了一种新的2.5D 实体表示法,然后在此基础上提出了“原型”的概念。原型法的思想运用在结构库的管理中主要体现在它将模具结构与构成这种结构的零件之间的强联系变成弱联系,结构库面向的对象是一个具有整体性和可运算性的结构原型。这样的原型结构库基本上达到了通用性与开放性的要求。 相似文献
102.
We consider a language of operations which pass parameters by means of a stack. An algebra over the set of type signatures is introduced, which allows the type signature of a program to be obtained from the type signatures of its constituent operations.Although the theories apply in principle to any stack based language, they have been evolved with particular regard to the proposed ANSI Standard Forth language, which is currently implemented in a type free manner. We hope this work will stimulate an interest in Forth amongst those applying algebraic techniques in software engineering, and we hope to lay the theoretical foundations for implementing practical type checkers to support Forth. 相似文献
103.
104.
A mixed mode digital/analog special purpose VLSI hardware implementation of an associative memory with neural architecture is presented. The memory concept is based on a matrix architecture with binary storage elements holding the connection weights. To enhance the processing speed analog circuit techniques are applied to implement the algorithm for the association. To keep the memory density as high as possible two design strategies are considered. First, the number of transistors per storage element is kept to a minimum. In this paper a circuit technique that uses a single 6-transistor cell for weight storage and analog signal processing is proposed. Second, the device precision has been chosen to a moderate level to save area as much as possible. Since device mismatch limits the performance of analog circuits, the impact of device precision on the circuit performance is explicitly discussed. It is shown that the device precision limits the number of rows activated in parallel. Since the input vector as well as the output vector are considered to be sparsely coded it is concluded, that even for large matrices the proposed circuit technique is appropriate and ultra large scale integration with a large number of connection weights is feasible. 相似文献
105.
In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated. 相似文献
106.
The evaluation of microcomputer programs: an area of debate 总被引:1,自引:0,他引:1
V. M. Johnston 《Journal of Computer Assisted Learning》1987,3(1):40-50
107.
108.
109.
Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks 总被引:3,自引:0,他引:3
The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness. 相似文献
110.