全文获取类型
收费全文 | 255篇 |
免费 | 7篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 30篇 |
机械仪表 | 1篇 |
建筑科学 | 10篇 |
轻工业 | 24篇 |
石油天然气 | 1篇 |
无线电 | 19篇 |
一般工业技术 | 52篇 |
冶金工业 | 52篇 |
自动化技术 | 71篇 |
出版年
2023年 | 2篇 |
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 10篇 |
2013年 | 7篇 |
2012年 | 10篇 |
2011年 | 17篇 |
2010年 | 4篇 |
2009年 | 16篇 |
2008年 | 18篇 |
2007年 | 10篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2001年 | 7篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1972年 | 2篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1968年 | 1篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有262条查询结果,搜索用时 31 毫秒
101.
Full- and partial- (orthographic or phonemic) repetition effects for Hebrew voweled and unvoweled words and nonwords were examined at Lags 0 and 15 between the first and the second presentations. For voweled words, phonemic and orthographic partial-repetition effects were equivalent at Lag 0, each about half the size of the full-repetition effect. At Lag 15, the full-repetition effect was reduced to the size of phonemic repetition, which was as big as it was at Lag 0. In contrast, the orthographic repetition effect disappeared. For unvoweled words, the phonemic repetition effect was significant only at Lag 0, whereas the full-repetition effect was significant at both lags. Lexical decisions for both voweled and unvoweled nonwords were facilitated only by full repetition at Lag 0. It was concluded that addition of vowel marks attracted the subjects' attention and, therefore, lexical decisions for voweled stimuli were mediated by phonemic analysis. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
102.
103.
104.
105.
We investigated the psychological reality of the concept of orthographical depth and its influence on visual word recognition by examining naming performance in Hebrew, English, and Serbo-Croatian. Experiment 1 revealed that the lexical status of the stimulus (high-frequency words, low-frequency words, and nonwords) significantly affected naming in Hebrew (the deepest of the three orthographies). This effect was only moderate in English and nonsignificant in Serbo-Croatian (the shallowest of the three orthographies). Moreover, only in Hebrew did lexical status have similar effects on naming and lexical decision performance. Experiment 2 revealed that semantic priming effects in naming were larger in Hebrew than in English and completely absent in Serbo-Croatian. Experiment 3 revealed that a large proportion of nonlexical tokens (nonwords) in the stimulus list affects naming words in Hebrew and in English, but not in Serbo-Croatian. Results support the orthographical depth hypothesis and suggest, in general, that in shallow orthographies phonology is generated directly from print, whereas in deep orthographies phonology is derived from the internal lexicon. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
106.
Shlomo Zilberstein François Charpillet Philippe Chassaing 《Annals of Mathematics and Artificial Intelligence》2003,39(1-2):1-18
We address the problem of building an interruptible real-time system using non-interruptible components. Some artificial intelligence techniques offer a tradeoff between computation time and quality of results, but their run-time must be determined when they are activated. These techniques, called contract algorithms, introduce a complex scheduling problem when there is uncertainty about the amount of time available for problem-solving. We show how to optimally sequence contract algorithms to create the best possible interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problem-solving and provide useful guidance for embedding contract algorithms in applications. 相似文献
107.
The superior performance of the binary turbo codes has stimulated vigorous efforts in generating bandwidth efficient modulation schemes adhering to these codes. Several approaches for the integration of turbo-coding and modulation have emerged in recent years but none seem to dominate. In the bit interleaved coded modulation (Bicm) scheme is used to achieve high bandwidth and power efficiency, while separating coding and modulation. As is now well known, theBicm scheme achieves capacity remarkably close to the constellation channel capacity. The turbo-Bicm scheme enjoys high coding diversity (well suited for fading channels), high flexibility as well as design and implementation simplicity, while maintaining good power efficiency. The system comprises one standard turbo code, an interleaver, a mapper and a modulator at the transmitter, corresponding to a demodulator, a de-interleaver and a turbo decoder at the receiver. A modified system, which improves on performance by incorporating the demodulation in the iterative decoding procedure, is investigated, and some performance gain is demonstrated, especially for low rate codes. Information theoretic arguments for the somewhat minor potential improvement in performance are detailed. The preferred mapper and interleaver for this system are considered. Extending previous works, for higher level modulations, we analyze a system including a convolutional code, an interleaver, a differential encoder (De), a mapper and a modulator at the transmitter. As for theBpsk modulation, the serial concatenation of a convolutional code withDe outperforms the single convolutional code. The serial concatenation withDe approach is analyzed also for a turbo code, where it is found to fail in achieving performance improvement. Several structures for the serial concatenation withDe are examined. These results are substantiated through the ‘spectral thinning’ phenomena of the weight distribution of the convolutional and turbocodes. 相似文献
108.
The performance of either structured or random turbo-block codes and binary, systematic block codes operating over the additive white Gaussian noise (Awgn) channel, is assessed by upper bounds on the error probalities of maximum likelihood (Ml) decoding. These bounds on the block and bit error probability which depend respectively on the distance spectrum and the input-output weight enumeration function (Iowef) of these codes, are compared, for a variety of cases, to simulated performance of iterative decoding and also to some reported simulated lower bounds on the performance ofMl decoders. The comparisons facilitate to assess the efficiency of iterative decoding (as compared to the optimalMl decoding rule) on one hand and the tightness of the examined upper bounds on the other. We focus here on uniformly interleaved and parallel concatenated turbo-Hamming codes, and to that end theIowefs of Hamming and turbo-Hamming codes are calculated by an efficient algorithm. The usefulness of the bounds is demonstrated for uniformly interleaved turbo-Hamming codes at rates exceeding the cut-off rate, where the results are compared to the simulated performance of iteratively decoded turbo-Hamming codes with structured and statistical interleavers. We consider also the ensemble performance of ‘repeat and accumulate’ (Ka) codes, a family of serially concatenated turbo-block codes, introduced by Divsalar, Jin and McEliece. Although, the outer and inner codes possess a very simple structure: a repetitive and a differential encoder respectively, our upper bounds indicate impressive performance at rates considerably beyond the cut-off rate. This is also evidenced in literature by computer simulations of the performance of iteratively decodedRa codes with a particular structured interleaver. 相似文献
109.
Two distributed algorithms are presented for a network using a common communication channel (e.g. radio) in which all nodes are within signal range and in line of sight of each other: (a) an algorithm to compute all
internode distances (in terms of propagation delays) in the network. the algorithm requires only 2 messages per node, and provides each node with the distances to all other nodes. (b) An algorithm for constructing a minimum-weight spanning tree (MST) in such a network. This algorithm starts out with the information provided by (a) and ends with each node possessing the explicit knowledge of the full MST. The algorithm requires at most log2
N messages per node. The internal processing in each node needsO(N logN) time andO(N) space. All messages required by (a) and (b) contain at most one edge weight plus 2 log2
N bits. Some possible applications of the algorithms are: position-location, tuning acknowledgement time-out mechanisms, tuning the scheduling functions of access protocols that are sensitive to individual internode propagation delays, and selecting performance effective transmission sequences for round robin access protocols.Yaron I. Gold received the B.Sc. (Cum Laude, 1970) and M.Sc. (1975), both in Electrical Engineering, from the Technion, Israel institute of Technology, and the Ph.D. (1981) in Computer Science, from the University of Minnesota, Minneapolis.From 1970 to 1975 Yaron Gold served as Research and Development Officer in the Israeli Defense Forces, leading a group of several scientists, engineers and technicians. From 1982 to 1984 he was on the faculty of the Department of Electrical Engineering the Department of Electrical Engineering and Computer Science at the University of Connecticut. During that period he also served as consultant for United Technologies Corporation and for Battelle Laboratories. Presently, Dr. Gold is on the faculty of the Computer Science Department at the Technion.His research interests include Computer Networks and Communications, Simulation and Intelligent Systems.Shlomo Moran received the B.Sc. and D.Sc. degrees in mathematics from Technion, Israel Institute of Technology, Haifa, in 1975 and 1979, respectively.From 1979 to 1981 he was assistant professor and a visiting research specialist at the University of Minnesota, Minneapolis. From 1981 to 1985 he was a senior lecturer at the Department of Computer Science, Technion, and from 1985 to 1986 he was a World Trade visitor at IBM Thomas J. Watson Research Center, Yorktown Heights. Currently he is associate professor at the Department of Computer Science, Technion.His research interests include distributed algorithms, computational complexity, combinatorics, graph theory and geometric aspects of communication networks.This work was supported in part by NSF grant ECS-8307186Part of this research was done while this author was with the University of ConnecticutPart of this research was done while this author was with IBM, Thomas J. Watson Research Center 相似文献
110.
Belman N Acharya S Konovalov O Vorobiev A Israelachvili J Efrima S Golan Y 《Nano letters》2008,8(11):3858-3864
The packing of anisotropic ultranarrow nanoparticles ( r 相似文献