全文获取类型
收费全文 | 729194篇 |
免费 | 8756篇 |
国内免费 | 2311篇 |
专业分类
电工技术 | 13489篇 |
综合类 | 738篇 |
化学工业 | 107201篇 |
金属工艺 | 28596篇 |
机械仪表 | 23017篇 |
建筑科学 | 16800篇 |
矿业工程 | 3922篇 |
能源动力 | 19481篇 |
轻工业 | 56791篇 |
水利工程 | 7643篇 |
石油天然气 | 13013篇 |
武器工业 | 85篇 |
无线电 | 88058篇 |
一般工业技术 | 143528篇 |
冶金工业 | 139225篇 |
原子能技术 | 15530篇 |
自动化技术 | 63144篇 |
出版年
2021年 | 6260篇 |
2020年 | 4733篇 |
2019年 | 6076篇 |
2018年 | 10249篇 |
2017年 | 10356篇 |
2016年 | 10990篇 |
2015年 | 7117篇 |
2014年 | 11772篇 |
2013年 | 33995篇 |
2012年 | 18986篇 |
2011年 | 25894篇 |
2010年 | 20701篇 |
2009年 | 23354篇 |
2008年 | 24155篇 |
2007年 | 23973篇 |
2006年 | 21381篇 |
2005年 | 19324篇 |
2004年 | 18494篇 |
2003年 | 18439篇 |
2002年 | 17358篇 |
2001年 | 17248篇 |
2000年 | 16473篇 |
1999年 | 17188篇 |
1998年 | 42989篇 |
1997年 | 30142篇 |
1996年 | 23467篇 |
1995年 | 17590篇 |
1994年 | 15676篇 |
1993年 | 15534篇 |
1992年 | 11543篇 |
1991年 | 10886篇 |
1990年 | 10615篇 |
1989年 | 10200篇 |
1988年 | 9765篇 |
1987年 | 8683篇 |
1986年 | 8420篇 |
1985年 | 9622篇 |
1984年 | 8830篇 |
1983年 | 8044篇 |
1982年 | 7409篇 |
1981年 | 7700篇 |
1980年 | 7064篇 |
1979年 | 6988篇 |
1978年 | 6810篇 |
1977年 | 7912篇 |
1976年 | 10300篇 |
1975年 | 6047篇 |
1974年 | 5835篇 |
1973年 | 5882篇 |
1972年 | 4793篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
121.
122.
I. S. W. B. Prasetya 《Formal Aspects of Computing》1994,6(4):466-470
UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent. 相似文献
123.
Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex 相似文献
124.
Uses a Markov process to model a real-time expert system architecture characterized by message passing and event-driven scheduling. The model is applied to the performance evaluation of rule grouping for real-time expert systems running on this architecture. An optimizing algorithm based on Kernighan-Lin heuristic graph partitioning for the real-time architecture is developed and a demonstration system based on the model and algorithm has been developed and tested on a portion of the advanced GPS receiver (AGR) and manned manoeuvring unit (MMU) knowledge bases 相似文献
125.
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 相似文献
126.
Several variations of cache-based checkpointing for rollback error recovery from transient errors in shared-memory multiprocessors have been recently developed. By modifying the cache replacement policy, these techniques use the inherent redundancy in the memory hierarchy to periodically checkpoint the computation state. Three schemes, different in the manner in which they avoid rollback propagation, are evaluated in this paper. By simulation with address traces from parallel applications running on an Encore Multimax shared-memory multiprocessor, we evaluate the performance effect of integrating the recovery schemes in the cache coherence protocol. Our results indicate that the cache-based schemes can provide checkpointing capability with low performance overhead, but with uncontrollable high variability in the checkpoint interval 相似文献
127.
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 相似文献
128.
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 相似文献
129.
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. 相似文献
130.
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. 相似文献