全文获取类型
收费全文 | 433671篇 |
免费 | 5103篇 |
国内免费 | 1330篇 |
专业分类
电工技术 | 8041篇 |
综合类 | 467篇 |
化学工业 | 64158篇 |
金属工艺 | 19000篇 |
机械仪表 | 14155篇 |
建筑科学 | 9555篇 |
矿业工程 | 2986篇 |
能源动力 | 10378篇 |
轻工业 | 33479篇 |
水利工程 | 5104篇 |
石油天然气 | 10510篇 |
武器工业 | 87篇 |
无线电 | 51680篇 |
一般工业技术 | 88001篇 |
冶金工业 | 76387篇 |
原子能技术 | 10868篇 |
自动化技术 | 35248篇 |
出版年
2021年 | 3729篇 |
2019年 | 3632篇 |
2018年 | 6434篇 |
2017年 | 6545篇 |
2016年 | 6945篇 |
2015年 | 4177篇 |
2014年 | 7103篇 |
2013年 | 18615篇 |
2012年 | 11241篇 |
2011年 | 14861篇 |
2010年 | 11818篇 |
2009年 | 13255篇 |
2008年 | 14059篇 |
2007年 | 13922篇 |
2006年 | 12356篇 |
2005年 | 11296篇 |
2004年 | 10697篇 |
2003年 | 10497篇 |
2002年 | 10021篇 |
2001年 | 10152篇 |
2000年 | 9585篇 |
1999年 | 9780篇 |
1998年 | 23122篇 |
1997年 | 16483篇 |
1996年 | 12874篇 |
1995年 | 9981篇 |
1994年 | 8801篇 |
1993年 | 8930篇 |
1992年 | 7091篇 |
1991年 | 6749篇 |
1990年 | 6509篇 |
1989年 | 6228篇 |
1988年 | 6081篇 |
1987年 | 5319篇 |
1986年 | 5313篇 |
1985年 | 6068篇 |
1984年 | 5684篇 |
1983年 | 5241篇 |
1982年 | 4844篇 |
1981年 | 4901篇 |
1980年 | 4783篇 |
1979年 | 4692篇 |
1978年 | 4558篇 |
1977年 | 5058篇 |
1976年 | 6061篇 |
1975年 | 4186篇 |
1974年 | 4086篇 |
1973年 | 4187篇 |
1972年 | 3482篇 |
1971年 | 3218篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
72.
Graefe G. Linville A. Shapiro L.D. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(6):934-944
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine 相似文献
73.
Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead 相似文献
74.
Arguello F. Bruguera J.D. Doallo R. Zapata E.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1091-1099
We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rn. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms 相似文献
75.
Ju D.-C.R. Chuan-Lin Wu Carini P. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1113-1120
We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators 相似文献
76.
Weight smoothing to improve network generalization 总被引:2,自引:0,他引:2
A weight smoothing algorithm is proposed in this paper to improve a neural network's generalization capability. The algorithm can be used when the data patterns to be classified are presented on an n-dimensional grid (n>/=1) and there exists some correlations among neighboring data points within a pattern. For a fully-interconnected feedforward net, no such correlation information is embedded into the architecture. Consequently, the correlations can only be extracted through sufficient amount of network training. With the proposed algorithm, a smoothing constraint is incorporated into the objective function of backpropagation to reflect the neighborhood correlations and to seek those solutions that have smooth connection weights. Experiments were performed on problems of waveform classification, multifont alphanumeric character recognition, and handwritten numeral recognition. The results indicate that (1) networks trained with the algorithm do have smooth connection weights, and (2) they generalize better. 相似文献
77.
Network information criterion-determining the number of hiddenunits for an artificial neural network model 总被引:6,自引:0,他引:6
The problem of model selection, or determination of the number of hidden units, can be approached statistically, by generalizing Akaike's information criterion (AIC) to be applicable to unfaithful (i.e., unrealizable) models with general loss criteria including regularization terms. The relation between the training error and the generalization error is studied in terms of the number of the training examples and the complexity of a network which reduces to the number of parameters in the ordinary statistical theory of AIC. This relation leads to a new network information criterion which is useful for selecting the optimal network model based on a given training set. 相似文献
78.
Michael D. Vose 《Annals of Mathematics and Artificial Intelligence》1994,10(4):423-434
This paper examines the influence of mutation on the behavior of genetic algorithms through a series of examples and experiments. The results provide an existence proof that mutation is a far more profound operator than has ever been recognized. Implications are discussed which point to the importance of open questions concerning genetic algorithms. The paper also reviews the implementation of the infinite population model of Vose which forms the computational basis of this investigation. 相似文献
79.
Shrivastava S.K. McCue D.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(4):421-432
The object-oriented approach to system structuring has found widespread acceptance among designers and developers of robust computing systems. The authors propose a system structure for distributed programming systems that support persistent objects and describe how properties such as persistence and recoverability can be implemented. The proposed structure is modular, permitting easy exploitation of any distributed computing facilities provided by the underlying system. An existing system constructed according to the principles espoused here is examined to illustrate the practical utility of the proposed approach to system structuring 相似文献
80.
Pipelining and bypassing in a VLIW processor 总被引:1,自引:0,他引:1
This short note describes issues involved in the bypassing mechanism for a very long instruction word (VLIW) processor and its relation to the pipeline structure of the processor. The authors first describe the pipeline structure of their processor and analyze its performance and compare it to typical RISC-style pipeline structures given the context of a processor with multiple functional units. Next they study the performance effects of various bypassing schemes in terms of their effectiveness in resolving pipeline data hazards and their effect on the processor cycle time 相似文献