全文获取类型
收费全文 | 19627篇 |
免费 | 1170篇 |
国内免费 | 1129篇 |
专业分类
电工技术 | 634篇 |
综合类 | 5611篇 |
化学工业 | 1145篇 |
金属工艺 | 544篇 |
机械仪表 | 739篇 |
建筑科学 | 1124篇 |
矿业工程 | 273篇 |
能源动力 | 93篇 |
轻工业 | 788篇 |
水利工程 | 193篇 |
石油天然气 | 354篇 |
武器工业 | 153篇 |
无线电 | 1323篇 |
一般工业技术 | 711篇 |
冶金工业 | 1273篇 |
原子能技术 | 36篇 |
自动化技术 | 6932篇 |
出版年
2024年 | 71篇 |
2023年 | 186篇 |
2022年 | 361篇 |
2021年 | 429篇 |
2020年 | 404篇 |
2019年 | 285篇 |
2018年 | 256篇 |
2017年 | 325篇 |
2016年 | 442篇 |
2015年 | 495篇 |
2014年 | 1165篇 |
2013年 | 962篇 |
2012年 | 1289篇 |
2011年 | 1463篇 |
2010年 | 1240篇 |
2009年 | 1174篇 |
2008年 | 1282篇 |
2007年 | 1460篇 |
2006年 | 1355篇 |
2005年 | 1266篇 |
2004年 | 1038篇 |
2003年 | 962篇 |
2002年 | 712篇 |
2001年 | 619篇 |
2000年 | 461篇 |
1999年 | 355篇 |
1998年 | 264篇 |
1997年 | 234篇 |
1996年 | 181篇 |
1995年 | 187篇 |
1994年 | 161篇 |
1993年 | 113篇 |
1992年 | 105篇 |
1991年 | 87篇 |
1990年 | 58篇 |
1989年 | 55篇 |
1988年 | 43篇 |
1987年 | 32篇 |
1986年 | 22篇 |
1985年 | 36篇 |
1984年 | 35篇 |
1983年 | 20篇 |
1981年 | 14篇 |
1980年 | 13篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1975年 | 16篇 |
1963年 | 11篇 |
1961年 | 12篇 |
1955年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
本文给出一种全新的页面描述语言文本,它是一种真正的程序设计语言,而且是一种面向对象的智能语言。本语言已具有绿色软件的品格。 相似文献
32.
Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs. 相似文献
33.
34.
The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.
In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model. 相似文献
35.
试论就业形势与战略 总被引:5,自引:1,他引:4
刘庆唐 《重庆理工大学学报(自然科学版)》2005,19(1):7-10
论述了就业的特殊重要性、目前我国就业形势的极端严重性,以及所应当采取的战略和措施。 相似文献
36.
37.
Staub Adrian; Rayner Keith; Pollatsek Alexander; Hy?n? Jukka; Majewski Helen 《Canadian Metallurgical Quarterly》2007,33(6):1162
Readers' eye movements were monitored as they read sentences containing noun-noun compounds that varied in frequency (e.g., elevator mechanic, mountain lion). The left constituent of the compound was either plausible or implausible as a head noun at the point at which it appeared, whereas the compound as a whole was always plausible. When the head noun analysis of the left constituent was implausible, reading times on this word were inflated, beginning with the first fixation. This finding is consistent with previous demonstrations of very rapid effects of plausibility on eye movements. Compound frequency did not modulate the plausibility effect, and all disruption was resolved by the time readers' eyes moved to the next word. These findings suggest (contra Kennison, 2005) that the parser initially analyzes a singular noun as a head instead of a modifier. In addition, the findings confirm that the very rapid effect of plausibility on eye movements is not due to strategic factors, because in the present experiment, unlike in previous demonstrations, this effect appeared in sentences that were globally plausible. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
38.
《C语言程序设计》课堂教学方法的探讨 总被引:1,自引:0,他引:1
王宏林 《数字社区&智能家居》2007,2(6):1440-1440,1455
《C语言程序设计》一直是计算机专业及相关专业的专业基础课。该课程既难教又难学。传统的教学方法往往过分注重语法形式的介绍,却忽视了算法的讲解,使得学生无法解决一些实际编程,也很容易挫伤学生的学习兴趣。为此应以算法教学为主。因材施教,合理使用教材,在改用多媒体教学的同时,适当配以板书。调动学生的主观能动性,提高其编程能力。 相似文献
39.
U. Reimer
H. -J. Schek
《Data & Knowledge Engineering》1989,4(4):321-352The first part of this paper introduces the basic constructs of a frame representation model and gives a formal definition for them. Subsequently the nested relational model (NF2) is described as an extension of the classical relational model to support relation-valued attributes. In the second part of this paper both models are compared with each other and a mapping of frame representation structures to NF2 structures is specified. The structural similarities between frames and NF2 relations are made clear and it is shown that their main difference is due to the type polymorphism introduced by the concept hierarchy of the frame model. This causes type collisions to occur in the strictly typed NF2 model when frames are directly mapped to NF2 structures. Two solutions to this problem are suggested and compared. The paper concludes with a reformulation of query operations of the frame model in terms of NF2 algebra operations. 相似文献
40.
We describe a formal language/notation for DNA molecules that may contain nicks and gaps. The elements of the language, DNA
expressions, denote formal DNA molecules. Different DNA expressions may denote the same formal DNA molecule. We analyse the
shortest DNA expressions denoting a given formal DNA molecule. We determine lower bounds on their lengths and explain how
we construct these minimal DNA expressions. 相似文献