全文获取类型
收费全文 | 2234篇 |
免费 | 94篇 |
国内免费 | 182篇 |
专业分类
电工技术 | 54篇 |
综合类 | 185篇 |
化学工业 | 45篇 |
金属工艺 | 48篇 |
机械仪表 | 210篇 |
建筑科学 | 73篇 |
矿业工程 | 23篇 |
能源动力 | 20篇 |
轻工业 | 13篇 |
水利工程 | 14篇 |
石油天然气 | 7篇 |
武器工业 | 7篇 |
无线电 | 127篇 |
一般工业技术 | 52篇 |
冶金工业 | 11篇 |
原子能技术 | 9篇 |
自动化技术 | 1612篇 |
出版年
2023年 | 12篇 |
2022年 | 15篇 |
2021年 | 21篇 |
2020年 | 19篇 |
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 21篇 |
2016年 | 34篇 |
2015年 | 60篇 |
2014年 | 91篇 |
2013年 | 104篇 |
2012年 | 138篇 |
2011年 | 175篇 |
2010年 | 135篇 |
2009年 | 111篇 |
2008年 | 175篇 |
2007年 | 141篇 |
2006年 | 124篇 |
2005年 | 120篇 |
2004年 | 111篇 |
2003年 | 103篇 |
2002年 | 69篇 |
2001年 | 77篇 |
2000年 | 49篇 |
1999年 | 57篇 |
1998年 | 56篇 |
1997年 | 48篇 |
1996年 | 45篇 |
1995年 | 40篇 |
1994年 | 50篇 |
1993年 | 26篇 |
1992年 | 24篇 |
1991年 | 20篇 |
1990年 | 16篇 |
1989年 | 13篇 |
1988年 | 15篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 22篇 |
1984年 | 20篇 |
1983年 | 20篇 |
1982年 | 8篇 |
1981年 | 14篇 |
1980年 | 6篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 11篇 |
1971年 | 3篇 |
排序方式: 共有2510条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
STEP-NC是由欧美提出的新的数控接口标准,目的是取代旧的数控标准ISO6983。本文首先分析了STEP-NC的两种应用标准:ISO14649(ARM)和STEPAP238(AIM),并且分析了Part21和Part28的应用领域及Part21文件格式和其中的信息产生方法。然後介绍了ST-Developer环境下ROSEC++颠库编程接口及其应用程序的早、晚编联方式,并且以此为基础设计了整个程序的编程流程,重点介绍了工艺规划设计。最后给出了在C++编程环境下利用ROSE库函数写入形成STEP AP238文件的方法。 相似文献
3.
建筑工程投标报价优选模型 总被引:1,自引:0,他引:1
金季岚 《信息技术与信息化》2007,(5):70-72,59
通过建立区间二次规划数学模型、灰色模型、多目标规划等模型,建立材料价格和用量的选择模型,提供投标单位一种便捷的调整工程造价和控制造价的手段。 相似文献
4.
5.
本文介绍了笔者设计并实现的一种新型的面向对象的程序设计语言,着重讨论了在设计过程中采用的新的概念,并和其它类似语言作了比较. 相似文献
6.
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. 相似文献
7.
介绍使用DirectPlay进行网络编程的一般思路和方法 ,并举出实例进行具体说明。 相似文献
8.
本文介绍了纸尿裤生产线自动控制系统的硬件组成和应用软件。选用三菱运动控制器,设计出满足高精度相位、速度、位置、张力控制要求的自动化系统。 相似文献
9.
10.
C. Pronk 《Software》1992,22(10):885-897
During standardization discussions on Modula-2 the question was raised whether the future standard should need a clause stating a set of minimal requirements for conforming implementations regarding the ‘structuredness’ of lexical, syntactical and run-time constructs in programs written in this language. It was decided to test a number of compilers to find their actual limits on the structuredness of some of these constructs. The test results do not only show these limits, but the inability of some compilers to handle large and complex inputs is shown as well. 相似文献