全文获取类型
收费全文 | 754952篇 |
免费 | 9131篇 |
国内免费 | 1382篇 |
专业分类
电工技术 | 13738篇 |
综合类 | 760篇 |
化学工业 | 118445篇 |
金属工艺 | 32365篇 |
机械仪表 | 24796篇 |
建筑科学 | 17212篇 |
矿业工程 | 5321篇 |
能源动力 | 18125篇 |
轻工业 | 63012篇 |
水利工程 | 8972篇 |
石油天然气 | 17373篇 |
武器工业 | 65篇 |
无线电 | 79138篇 |
一般工业技术 | 152314篇 |
冶金工业 | 130198篇 |
原子能技术 | 17791篇 |
自动化技术 | 65840篇 |
出版年
2021年 | 6507篇 |
2019年 | 6257篇 |
2018年 | 14748篇 |
2017年 | 15015篇 |
2016年 | 13906篇 |
2015年 | 7395篇 |
2014年 | 12209篇 |
2013年 | 32449篇 |
2012年 | 20394篇 |
2011年 | 29928篇 |
2010年 | 24614篇 |
2009年 | 26337篇 |
2008年 | 26971篇 |
2007年 | 27936篇 |
2006年 | 20520篇 |
2005年 | 20097篇 |
2004年 | 18705篇 |
2003年 | 18253篇 |
2002年 | 17181篇 |
2001年 | 16338篇 |
2000年 | 15806篇 |
1999年 | 15511篇 |
1998年 | 36402篇 |
1997年 | 26186篇 |
1996年 | 20394篇 |
1995年 | 15736篇 |
1994年 | 14158篇 |
1993年 | 13852篇 |
1992年 | 10829篇 |
1991年 | 10332篇 |
1990年 | 10349篇 |
1989年 | 10109篇 |
1988年 | 9738篇 |
1987年 | 8688篇 |
1986年 | 8524篇 |
1985年 | 9711篇 |
1984年 | 8940篇 |
1983年 | 8439篇 |
1982年 | 7687篇 |
1981年 | 7812篇 |
1980年 | 7540篇 |
1979年 | 7521篇 |
1978年 | 7443篇 |
1977年 | 8276篇 |
1976年 | 10477篇 |
1975年 | 6718篇 |
1974年 | 6410篇 |
1973年 | 6530篇 |
1972年 | 5584篇 |
1971年 | 5198篇 |
排序方式: 共有10000条查询结果,搜索用时 23 毫秒
991.
992.
993.
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. 相似文献
994.
Cured samples of a nitrogen-containing acetylene-terminated resin, N,N′-(1,3-phenylene-dimethylidene)bis(3-ethynylaniline), have been heated at 10°C/min up to 900°C in a pyroprobe attached to a gas chromatograph/mass spectrometer (GC/MS). Analysis of the volatiles evolved during heating identified both gases and higher boiling compounds. The major higher boiling compounds are benzene, toluene, xylene, aniline, benzonitrile, m-methylaniline, and m-methylbenzonitrile; the gases include ammonia, methane, and traces of carbon dioxide. Correlations between sample temperature and the evolution of each of these compounds have been made. The onset of all volatile formation occurs between 450 and 500°C. The higher boiling volatiles peak, then end by approximately 700°C, while the gases peak then fall off but are still being evolved at 900°C. Average weight loss measurements of 13.6% at 700°C and 15.7% at 900°C agree with previously published thermogravimetric analysis (TGA) data. © 1993 John Wiley & Sons, Inc. 相似文献
995.
996.
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 相似文献
997.
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 相似文献
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.
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 相似文献
1000.
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 相似文献