全文获取类型
收费全文 | 414401篇 |
免费 | 4704篇 |
国内免费 | 1011篇 |
专业分类
电工技术 | 7290篇 |
综合类 | 398篇 |
化学工业 | 64454篇 |
金属工艺 | 16413篇 |
机械仪表 | 12579篇 |
建筑科学 | 9767篇 |
矿业工程 | 2529篇 |
能源动力 | 9804篇 |
轻工业 | 38734篇 |
水利工程 | 4438篇 |
石油天然气 | 8356篇 |
武器工业 | 39篇 |
无线电 | 45079篇 |
一般工业技术 | 79402篇 |
冶金工业 | 78180篇 |
原子能技术 | 9951篇 |
自动化技术 | 32703篇 |
出版年
2021年 | 3509篇 |
2019年 | 3357篇 |
2018年 | 5624篇 |
2017年 | 5647篇 |
2016年 | 6015篇 |
2015年 | 3798篇 |
2014年 | 6558篇 |
2013年 | 18189篇 |
2012年 | 10572篇 |
2011年 | 14422篇 |
2010年 | 11548篇 |
2009年 | 12864篇 |
2008年 | 13237篇 |
2007年 | 13363篇 |
2006年 | 11730篇 |
2005年 | 10592篇 |
2004年 | 10143篇 |
2003年 | 9836篇 |
2002年 | 9619篇 |
2001年 | 9538篇 |
2000年 | 9310篇 |
1999年 | 9365篇 |
1998年 | 22563篇 |
1997年 | 15982篇 |
1996年 | 12500篇 |
1995年 | 9423篇 |
1994年 | 8476篇 |
1993年 | 8219篇 |
1992年 | 6422篇 |
1991年 | 6014篇 |
1990年 | 6065篇 |
1989年 | 5997篇 |
1988年 | 5732篇 |
1987年 | 4979篇 |
1986年 | 4907篇 |
1985年 | 5700篇 |
1984年 | 5375篇 |
1983年 | 4917篇 |
1982年 | 4528篇 |
1981年 | 4697篇 |
1980年 | 4478篇 |
1979年 | 4459篇 |
1978年 | 4525篇 |
1977年 | 4996篇 |
1976年 | 6602篇 |
1975年 | 3925篇 |
1974年 | 3740篇 |
1973年 | 3870篇 |
1972年 | 3195篇 |
1971年 | 2976篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
The capacitive idling converters derived from the Cuk, SEPIC, Zeta, and flyback topologies allow soft commutation of power switches without the need for additional circuitry, making it possible to increase the switching frequency while maintaining high efficiency 相似文献
72.
73.
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. 相似文献
74.
Solotorevsky G. Gudes E. Meisels A. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(5):681-697
A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem 相似文献
75.
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 相似文献
76.
Moser L.E. Melliar-Smith P.M. Agrawala V. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):459-473
Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols 相似文献
77.
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 相似文献
78.
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 相似文献
79.
Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation. 相似文献
80.
Fernandez E.B. Gudes E. Haiyan Song 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(2):275-292
The integration of object-oriented programming concepts with databases is one of the most significant advances in the evolution of database systems. Many aspects of such a combination have been studied, but there are few models to provide security for this richly structured information. We develop an authorization model for object-oriented databases. This model consists of a set of policies, a structure for authorization rules, and algorithms to evaluate access requests against the authorization rules. User access policies are based on the concept of inherited authorization applied along the class structure hierarchy. We propose also a set of administrative policies that allow the control of user access and its decentralization. Finally, we study the effect of class structuring changes on authorization 相似文献