全文获取类型
收费全文 | 566750篇 |
免费 | 6228篇 |
国内免费 | 1004篇 |
专业分类
电工技术 | 10508篇 |
综合类 | 466篇 |
化学工业 | 90043篇 |
金属工艺 | 23335篇 |
机械仪表 | 18497篇 |
建筑科学 | 12530篇 |
矿业工程 | 4312篇 |
能源动力 | 14429篇 |
轻工业 | 45755篇 |
水利工程 | 6941篇 |
石油天然气 | 14961篇 |
武器工业 | 39篇 |
无线电 | 60277篇 |
一般工业技术 | 116228篇 |
冶金工业 | 95559篇 |
原子能技术 | 14681篇 |
自动化技术 | 45421篇 |
出版年
2021年 | 5481篇 |
2019年 | 5267篇 |
2018年 | 9201篇 |
2017年 | 9409篇 |
2016年 | 9831篇 |
2015年 | 6029篇 |
2014年 | 10243篇 |
2013年 | 26101篇 |
2012年 | 15772篇 |
2011年 | 21089篇 |
2010年 | 16968篇 |
2009年 | 18817篇 |
2008年 | 19067篇 |
2007年 | 18766篇 |
2006年 | 16286篇 |
2005年 | 14742篇 |
2004年 | 14007篇 |
2003年 | 13690篇 |
2002年 | 13246篇 |
2001年 | 12850篇 |
2000年 | 12329篇 |
1999年 | 12011篇 |
1998年 | 27650篇 |
1997年 | 20038篇 |
1996年 | 15627篇 |
1995年 | 12005篇 |
1994年 | 10859篇 |
1993年 | 10614篇 |
1992年 | 8332篇 |
1991年 | 8103篇 |
1990年 | 7990篇 |
1989年 | 7763篇 |
1988年 | 7478篇 |
1987年 | 6747篇 |
1986年 | 6533篇 |
1985年 | 7390篇 |
1984年 | 6700篇 |
1983年 | 6437篇 |
1982年 | 5776篇 |
1981年 | 5896篇 |
1980年 | 5630篇 |
1979年 | 5733篇 |
1978年 | 5663篇 |
1977年 | 6179篇 |
1976年 | 7685篇 |
1975年 | 5108篇 |
1974年 | 4903篇 |
1973年 | 4980篇 |
1972年 | 4279篇 |
1971年 | 4038篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
161.
A new commercially available diode model is described. This unified model is capable of simulating the widest range of diode technologies of any presently available. The emphasis of this paper is on describing the model's extensive features and flexibility in the different domains of operation and is of particular interest in power applications 相似文献
162.
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 相似文献
163.
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. 相似文献
164.
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 相似文献
165.
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 相似文献
166.
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 相似文献
167.
McKinley P.K. Xu H. Esfahanian A.-H. Ni L.M. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(12):1252-1265
Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log 2 m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given 相似文献
168.
Weijia Shang O'Keefe M.T. Fortes J.A.B. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(2):193-204
This paper describes several loop transformation techniques for extracting parallelism from nested loop structures. Nested loops can then be scheduled to run in parallel so that execution time is minimized. One technique is called selective cycle shrinking, and the other is called true dependence cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how true dependence shrinking is related to conflict-free mappings of higher dimensional algorithms into lower dimensional processor arrays. Methods are proposed in this paper to find the selective and true dependence shrinkings with minimum total execution time by applying the techniques of finding optimal linear schedules and optimal and conflict-free mappings proposed by W. Shang and A.B. Fortes 相似文献
169.
We develop a characterization for m-fault-tolerant extensions, and for optimal m-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows that this problem is equivalent to an interesting combinatorial problem on the partitioning of integers. This characterization leads to a new procedure for constructing an optimal m-fault-tolerant extension of any complete multipartite graph, for any m⩾0. The proposed procedure is mainly useful when the size of the graph is relatively small, because the search time required is exponential. This exponential search, however, is not always necessary. We prove several necessary conditions that help us, in several cases, to identify some optimal m-fault-tolerant extensions without performing any search 相似文献
170.
Studies the complexity of the problem of allocating m modules to n processors in a distributed system to minimize total communication and execution costs. When the communication graph is a tree, Bokhari has shown that the optimum allocation can be determined in O(mn2) time. Recently, this result has been generalized by Fernandez-Baca, who has proposed an allocation algorithm in O(mnk+1) when the communication graph is a partial k-tree. The author shows that in the case where communication costs are uniform, the module allocation problem can be solved in O(mn) time if the communication graph is a tree. This algorithm is asymptotically optimum 相似文献