全文获取类型
收费全文 | 736839篇 |
免费 | 9038篇 |
国内免费 | 1548篇 |
专业分类
电工技术 | 13466篇 |
综合类 | 629篇 |
化学工业 | 113508篇 |
金属工艺 | 32439篇 |
机械仪表 | 24498篇 |
建筑科学 | 16923篇 |
矿业工程 | 5357篇 |
能源动力 | 18419篇 |
轻工业 | 57868篇 |
水利工程 | 8858篇 |
石油天然气 | 17106篇 |
武器工业 | 43篇 |
无线电 | 79111篇 |
一般工业技术 | 151443篇 |
冶金工业 | 125599篇 |
原子能技术 | 17409篇 |
自动化技术 | 64749篇 |
出版年
2021年 | 6469篇 |
2019年 | 6197篇 |
2018年 | 14856篇 |
2017年 | 15115篇 |
2016年 | 13961篇 |
2015年 | 7376篇 |
2014年 | 12196篇 |
2013年 | 32271篇 |
2012年 | 20255篇 |
2011年 | 29741篇 |
2010年 | 24624篇 |
2009年 | 26320篇 |
2008年 | 26755篇 |
2007年 | 27656篇 |
2006年 | 19934篇 |
2005年 | 19848篇 |
2004年 | 18408篇 |
2003年 | 17950篇 |
2002年 | 16620篇 |
2001年 | 15914篇 |
2000年 | 15440篇 |
1999年 | 15275篇 |
1998年 | 35975篇 |
1997年 | 25952篇 |
1996年 | 20289篇 |
1995年 | 15393篇 |
1994年 | 13961篇 |
1993年 | 13594篇 |
1992年 | 10500篇 |
1991年 | 10171篇 |
1990年 | 9912篇 |
1989年 | 9705篇 |
1988年 | 9352篇 |
1987年 | 8358篇 |
1986年 | 8091篇 |
1985年 | 9274篇 |
1984年 | 8447篇 |
1983年 | 8046篇 |
1982年 | 7188篇 |
1981年 | 7390篇 |
1980年 | 6990篇 |
1979年 | 7143篇 |
1978年 | 7027篇 |
1977年 | 7851篇 |
1976年 | 10012篇 |
1975年 | 6262篇 |
1974年 | 6030篇 |
1973年 | 6106篇 |
1972年 | 5171篇 |
1971年 | 4863篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
992.
John C. Hart Gordon W. Lescinsky Daniel J. Sandin Thomas A. DeFanti Louis H. Kauffman 《The Visual computer》1993,9(7):346-355
The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well. 相似文献
993.
994.
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. 相似文献
995.
Kemper A. Kilger C. Moerkotte G. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(4):587-608
View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM 相似文献
996.
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 相似文献
997.
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 相似文献
998.
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 相似文献
999.
Nicol D.M. Greenberg A.G. Lubachevsky B.D. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(8):849-859
Considers the use of massively parallel architectures to execute a trace-driven simulation of a single cache set. A method is presented for the least-recently-used (LRU) policy, which, regardless of the set size C, runs in time O(log N) using N processors on the EREW (exclusive read, exclusive write) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/log N processors. We present timings of this algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference-based line replacement policies are considered, which includes LRU as well as the least-frequently-used (LFU) and random replacement policies. A simulation method is presented for any such policy that, on any trace of length N directed to a C line set, runs in O(C log N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well suited for SIMD implementation 相似文献
1000.
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 相似文献