全文获取类型
收费全文 | 176001篇 |
免费 | 22087篇 |
国内免费 | 16437篇 |
专业分类
电工技术 | 20180篇 |
技术理论 | 14篇 |
综合类 | 20847篇 |
化学工业 | 6743篇 |
金属工艺 | 3966篇 |
机械仪表 | 10850篇 |
建筑科学 | 8289篇 |
矿业工程 | 4370篇 |
能源动力 | 3558篇 |
轻工业 | 4857篇 |
水利工程 | 3475篇 |
石油天然气 | 3396篇 |
武器工业 | 1774篇 |
无线电 | 30759篇 |
一般工业技术 | 10352篇 |
冶金工业 | 3295篇 |
原子能技术 | 1003篇 |
自动化技术 | 76797篇 |
出版年
2024年 | 1155篇 |
2023年 | 3303篇 |
2022年 | 6024篇 |
2021年 | 6643篇 |
2020年 | 6729篇 |
2019年 | 5189篇 |
2018年 | 4606篇 |
2017年 | 5504篇 |
2016年 | 5956篇 |
2015年 | 6619篇 |
2014年 | 10752篇 |
2013年 | 10199篇 |
2012年 | 12320篇 |
2011年 | 13295篇 |
2010年 | 10340篇 |
2009年 | 11168篇 |
2008年 | 11574篇 |
2007年 | 13129篇 |
2006年 | 11379篇 |
2005年 | 10129篇 |
2004年 | 8588篇 |
2003年 | 7611篇 |
2002年 | 6100篇 |
2001年 | 4989篇 |
2000年 | 4209篇 |
1999年 | 3592篇 |
1998年 | 2804篇 |
1997年 | 2299篇 |
1996年 | 1875篇 |
1995年 | 1517篇 |
1994年 | 1180篇 |
1993年 | 829篇 |
1992年 | 605篇 |
1991年 | 459篇 |
1990年 | 388篇 |
1989年 | 340篇 |
1988年 | 228篇 |
1987年 | 132篇 |
1986年 | 115篇 |
1985年 | 121篇 |
1984年 | 86篇 |
1983年 | 103篇 |
1982年 | 76篇 |
1981年 | 56篇 |
1980年 | 41篇 |
1979年 | 33篇 |
1978年 | 24篇 |
1977年 | 16篇 |
1975年 | 11篇 |
1973年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
一种基于三次样条函数求离子浓度的自动算法 总被引:1,自引:0,他引:1
本文提出了一种用三次样条函数模拟双次标准加入法测量方程,直接求解离子浓度的自动算法。比较了三咱不同边界条件下用要池数计算离子浓度的结果。造出节点区间两极端点的二阶导数为零时的三次样条函数为最佳模拟函数。并讨论了该方法在实际分析中误差的来源及消除办法。经对一系列文献数据的验算对比,表明本法完全可代替传统的迭代法和查图法,且能方便地设置在智能化的电位分析系统中。 相似文献
42.
本文介绍了Windows环境下基于消息的DDE和基于动态链接库的DDEML的区别,并详细叙述了如何使用DDEML编制Windows应用程序。 相似文献
43.
中国古典园林三维造型研究 总被引:1,自引:0,他引:1
论述了采用层次结构化及参数化三维造型方法,建立一个以造型函数库为核心,从而构造各类、各级园林景观构件表面模型的方法和过程。对于某些非建筑类的园林配景构件,采用了Fractal方法进行造型。 相似文献
44.
Panagiotis N. Zarros Myung J. Lee Tarek N. Saadawi 《Journal of Network and Systems Management》1994,2(4):361-382
In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the expected packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. An enhancement to improve synchronization which deals with the estimation of the time offsets between the individual periods of the sources and the period of the receiver is also presented. The error of the proposed algorithm is enumerated by the Chernoff bound and demonstrated by simulation and is shown to be acceptable in practical application. The algorithm can also be employed when traffic sources operate with different periods. 相似文献
45.
Claudia Popien Axel Kuepper Bernd Meyer 《Journal of Network and Systems Management》1994,2(4):383-400
New requirements of growing computer networks and information systems have an influence on extended client/server models with increased functionality. This forms the basis for service management in distributed systems which is realized by a service trading concept. This paper studies the requirements derived from the Open Distributed Processing (ODP) Reference Model in order to consider an open service market. Furthermore, it examines management possibilities for describing the service trading scenario. Because of similar architectures and properties ODP services, service offers, types, exporters and traders are mapped onto management components and modeled as managed objects. Therefore, the Guidelines for the Definition of Managed Objects (GDMO) are used. The final concept allows a precise and unambiguous study of the service trading scenario and provides means for exporting and importing of service offers in a distributed environment. 相似文献
46.
不等波纹函数低通原型的理论及应用 总被引:3,自引:0,他引:3
本文提出不等波纹函数低通原型,并对其理论进行初步探讨。切比雪夫函数及最平坦型巴特活兹函数皆为其特例。文中给出不等波纹函数的几个性质,最后给出两个应用实例,消除耦合环自感部分的影响;抑制高次模的微带圆盘腔带通滤波器。 相似文献
47.
48.
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. 相似文献
49.
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. 相似文献
50.