全文获取类型
收费全文 | 3798篇 |
免费 | 343篇 |
国内免费 | 183篇 |
专业分类
电工技术 | 294篇 |
综合类 | 208篇 |
化学工业 | 93篇 |
金属工艺 | 145篇 |
机械仪表 | 467篇 |
建筑科学 | 111篇 |
矿业工程 | 62篇 |
能源动力 | 42篇 |
轻工业 | 33篇 |
水利工程 | 6篇 |
石油天然气 | 51篇 |
武器工业 | 36篇 |
无线电 | 646篇 |
一般工业技术 | 80篇 |
冶金工业 | 38篇 |
原子能技术 | 40篇 |
自动化技术 | 1972篇 |
出版年
2024年 | 4篇 |
2023年 | 12篇 |
2022年 | 36篇 |
2021年 | 41篇 |
2020年 | 59篇 |
2019年 | 36篇 |
2018年 | 39篇 |
2017年 | 51篇 |
2016年 | 59篇 |
2015年 | 70篇 |
2014年 | 194篇 |
2013年 | 184篇 |
2012年 | 244篇 |
2011年 | 300篇 |
2010年 | 214篇 |
2009年 | 208篇 |
2008年 | 223篇 |
2007年 | 269篇 |
2006年 | 269篇 |
2005年 | 274篇 |
2004年 | 233篇 |
2003年 | 199篇 |
2002年 | 162篇 |
2001年 | 132篇 |
2000年 | 106篇 |
1999年 | 107篇 |
1998年 | 97篇 |
1997年 | 93篇 |
1996年 | 72篇 |
1995年 | 56篇 |
1994年 | 70篇 |
1993年 | 60篇 |
1992年 | 28篇 |
1991年 | 25篇 |
1990年 | 23篇 |
1989年 | 16篇 |
1988年 | 6篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 16篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有4324条查询结果,搜索用时 15 毫秒
1.
用CPLD实现SRAM工艺FPGA的安全应用 总被引:1,自引:0,他引:1
提出了一种利用CPLD产生的伪随机码来加密SRAM工艺FPGA的方法,并详细介绍了具体的电路和VHDL代码。 相似文献
2.
本文介绍一种智能型、高精度PWR控制器SA4828,其控制实行全数字化产生三相脉宽调制波形.本文采用此器件设计大功率直流电源应用于22KW直流电机测试,对感性负载表现出具有纹波小,响应迅速、硬件电路简洁、控制简单易于编写的优点。 相似文献
3.
This paper describes the implementation of a stereo-vision system using Field Programmable Gate Arrays (FPGAs). Reconfigurable hardware, including FPGAs, is an attractive platform for implementing vision algorithms due to its ability to exploit parallelism often found in these algorithms, and due to the speed with which applications can be developed as compared to hardware. The system outputs 8-bit, subpixel disparity estimates for 256× 360 pixel images at 30,fps. A local-weighted phase correlation algorithm for stereo disparity [Fleet, D. J.: {Int. Conf. Syst. Man Cybernetics 1:48–54 (1994)] is implemented. Despite the complexity of performing correlations on multiscale, multiorientation phase data, the system runs as much as 300 times faster in hardware than its software implementation. This paper describes the hardware platform used, the algorithm, and the issues encountered during its hardware implementation. Of particular interest is the implementation of multiscale, steerable filters, which are widely used in computer vision algorithms. Several trade-offs (reducing the number of filter orientations from three to two, using fixed-point computation, changing the location of one localized low-pass filter, and using L1 instead of L2 norms) were required to both fit the design into the available hardware and to achieve video-rate processing. Finally, results from the system are given both for synthetic data sets as well as several standard stereo-pair test images. 相似文献
4.
A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation
from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond
to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite
system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems
in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC
program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving
termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort,
merge-sort, merge, split, fair-split and append, etc., can be proved.
This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687
Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074.
M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in
the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs
from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer
science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für
Informatik, Saarbrücken until January 1997.
Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas
of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer
vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from
MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief
of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on
Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science.
R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in
the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and
verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a
faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological
University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of
Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International
Conferences and has been on the Editorial Committees. 相似文献
5.
The aditi deductive database system 总被引:2,自引:0,他引:2
Jayen Vaghanl BSc Kotagiri Ramamohanarao Ph.D. David B. Kemp Ph.D. Zoltan Somogyi Ph.D. Peter J. Stuckey Ph.D. Tim S. Leask BSc James Harland Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(2):245-288
Deductive databases generalize relational databases by providing support for recursive views and non-atomic data. Aditi is a deductive system based on the client-server model; it is inherently multi-user and capable of exploiting parallelism on shared-memory multiprocessors. The back-end uses relational technology for efficiency in the management of disk-based data and uses optimization algorithms especially developed for the bottom-up evaluation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures. 相似文献
6.
宝钢研制的全氢罩式炉控制系统分析 总被引:4,自引:0,他引:4
对宝钢研制的全氢罩式炉计算机控制系统的逻辑结构、工作原理及硬件配置进行了分析.该系统与引进的系统相比,在通讯方式、程序结构、操作分析、报警和开放性等方面都有所改进. 相似文献
7.
高肖林 《中国材料科技与设备》2007,4(2):92-94
中厚板厂3500mm精轧机快速换辊自控系统,集可编程序控制器、变频传动技术、液压控制于一体。实现了工作辊、支承辊准确、快速地更换。通过网络技术与其他控制系统进行数据交换、操作及连锁,使轧制生产线实现了全自动化轧制,不仅改善了工人的劳动强度,还提高了产品的产量及质量,取得了巨大的社会效益及经济效益。 相似文献
8.
The objective of this note is to propose a method for stabilization of structurally fixed modes in expansions of LTI dynamic systems in the scope of overlapping decentralized control design based on the expansion/contraction framework, enabling successful design for a broader class of problems than considered so far. The method is based on a judicious choice of complementary matrices in the expanded space. Numerical examples are provided to illustrate simplicity and efficiency of the proposed approach. 相似文献
9.
介绍了Lattice公司生产的在系统可编程通用数字开关芯片ispGDS14的内部结构和性能特点,并通过实例说明了在GDS开发环境下对ispGDS14进行编程的方法。 相似文献
10.
Pre-pruning and Post-pruning are two standard techniques for handling noise in decision tree learning. Pre-pruning deals with noise during learning, while post-pruning addresses this problem after an overfitting theory has been learned. We first review several adaptations of pre- and post-pruning techniques for separate-and-conquer rule learning algorithms and discuss some fundamental problems. The primary goal of this paper is to show how to solve these problems with two new algorithms that combine and integrate pre- and post-pruning. 相似文献