全文获取类型
收费全文 | 12108篇 |
免费 | 1834篇 |
国内免费 | 1305篇 |
专业分类
电工技术 | 1629篇 |
技术理论 | 3篇 |
综合类 | 1322篇 |
化学工业 | 327篇 |
金属工艺 | 216篇 |
机械仪表 | 1639篇 |
建筑科学 | 400篇 |
矿业工程 | 202篇 |
能源动力 | 185篇 |
轻工业 | 97篇 |
水利工程 | 148篇 |
石油天然气 | 177篇 |
武器工业 | 105篇 |
无线电 | 1651篇 |
一般工业技术 | 862篇 |
冶金工业 | 138篇 |
原子能技术 | 106篇 |
自动化技术 | 6040篇 |
出版年
2024年 | 56篇 |
2023年 | 153篇 |
2022年 | 249篇 |
2021年 | 328篇 |
2020年 | 349篇 |
2019年 | 303篇 |
2018年 | 330篇 |
2017年 | 444篇 |
2016年 | 515篇 |
2015年 | 607篇 |
2014年 | 771篇 |
2013年 | 776篇 |
2012年 | 976篇 |
2011年 | 971篇 |
2010年 | 716篇 |
2009年 | 753篇 |
2008年 | 772篇 |
2007年 | 902篇 |
2006年 | 734篇 |
2005年 | 695篇 |
2004年 | 630篇 |
2003年 | 511篇 |
2002年 | 417篇 |
2001年 | 380篇 |
2000年 | 324篇 |
1999年 | 240篇 |
1998年 | 199篇 |
1997年 | 202篇 |
1996年 | 151篇 |
1995年 | 156篇 |
1994年 | 125篇 |
1993年 | 99篇 |
1992年 | 105篇 |
1991年 | 48篇 |
1990年 | 42篇 |
1989年 | 47篇 |
1988年 | 39篇 |
1987年 | 25篇 |
1986年 | 17篇 |
1985年 | 22篇 |
1984年 | 17篇 |
1983年 | 11篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 16 毫秒
41.
42.
Andrzej Ciepielewski 《International journal of parallel programming》1991,20(6):421-451
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB 相似文献
43.
Parthasarathy P. Tirumalai Meng Lee Michael S. Schlansker 《The Journal of supercomputing》1991,5(2-3):119-136
Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops—REPEAT-UNTIL, WHILE, and loops with more than one exit, in which the trip count is not known beforehand—can also be overlapped efficiently on multiple-issue pipelined machines. The approach is described with respect to a specific machine model, but it can be extended to other models. Special features in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples.An earlier version of this paper was presented at Supercomputing '90. 相似文献
44.
Due to interference, path loss, multipath fading, background noise, and many other factors, wireless communication normally
cannot provide a wireless link with both a high data rate and a long transmission range. To address this problem, striping
network traffic in parallel over multiple lower-data-rate but longer-transmission-range wireless channels may be used. In
this paper, we propose a new striping method and evaluate its performances over multiple IEEE 802.11(b) channels under various
conditions. Our extensive simulation results show that this method is quite effective for such an application.
S.Y. Wang is an Associate Professor of the Department of Computer Science and Information Engineering at National Chiao Tung University,
Taiwan. He received his Master and Ph.D. degree in computer science from Harvard University in 1997 and 1999, respectively.
His research interests include wireless networks, Internet technologies, network simulations, and operating systems. He is
the author of the NCTUns 2.0 network simulator and emulator, which is being widely used by network and communication researchers.
More information about the tool is available at http://NSL.csie.nctu.edu.tw/nctuns.html.
C.H. Hwang received his master degree in computer science from NCTU in 2002 and currently is working for a network company.
C.L. Chou currently is a third-year Ph.D. student at the Department of Computer Science and Information Engineering, National Chiao
TungUniversity (NCTU), Taiwan. He received his master degree in computer science from NCTU in 2002. 相似文献
45.
46.
可编程光学二值双轨逻辑门 总被引:1,自引:0,他引:1
基于双轨逻辑,本文提出一种可级联的并行二值逻辑门。所有十六种二值逻辑运算可以采用偏振半波相延编程来实现。也提出了用电光晶体实现实时编程的方法。本文中给出了实验结果。 相似文献
47.
通过修正求解Chebyshev多项式的Clenshaw和Forsythe算法。提出了求解一般正交多项式的两种并行算法。并通过讨论这两种并行算法矩阵形式的舍入误差,对它们的稳定性进行了分析。 相似文献
48.
Stanley C. Ahalt Prakoon Chen Cheng-Taou Chou Tzyy-Ping Jung 《The Journal of supercomputing》1992,5(4):307-330
We describe an implementation of a vector quantization codebook design algorithm based on the frequencysensitive competitive learning artificial neural network. The implementation, designed for use on high-performance computers, employs both multitasking and vectorization techniques. A C version of the algorithm tested on a CRAY Y-MP8/864 is discussed. We show how the implementation can be used to perform vector quantization, and demonstrate its use in compressing digital video image data. Two images are used, with various size codebooks, to test the performance of the implementation. The results show that the supercomputer techniques employed have significantly decreased the total execution time without affecting vector quantization performance.This work was supported by a Cray University Research Award and by NASA Lewis research grant number NAG3-1164. 相似文献
49.
针对SAT问题的复杂性及求解速度缓慢的问题,采用可重构器件FPGA设计,实现了静态回溯搜索算法SAT问题并行处理器,提出了研制动态SAT并行处理器的设想。 相似文献
50.
Simulation at the gate level is computationally very expensive.Parallel processing is one technique to reduce simulation time.Possessing knowledge of the distribution of computational activity insimulation can aid in parallelizing it efficiently. We present a newcharacterization of the distribution of the computational workload infault simulation. An empirical analysis shows that the workloaddistribution is circuit specific, and is largely independent of thevector set being simulated. An inexpensive method to predict theworkload distribution is also discussed. 相似文献