全文获取类型
收费全文 | 742896篇 |
免费 | 9666篇 |
国内免费 | 2004篇 |
专业分类
电工技术 | 13871篇 |
综合类 | 1035篇 |
化学工业 | 111818篇 |
金属工艺 | 27090篇 |
机械仪表 | 21122篇 |
建筑科学 | 18461篇 |
矿业工程 | 2946篇 |
能源动力 | 20355篇 |
轻工业 | 67104篇 |
水利工程 | 6922篇 |
石油天然气 | 11573篇 |
武器工业 | 45篇 |
无线电 | 87291篇 |
一般工业技术 | 141539篇 |
冶金工业 | 145673篇 |
原子能技术 | 14033篇 |
自动化技术 | 63688篇 |
出版年
2021年 | 6351篇 |
2020年 | 4634篇 |
2019年 | 5944篇 |
2018年 | 10071篇 |
2017年 | 9796篇 |
2016年 | 10291篇 |
2015年 | 7219篇 |
2014年 | 12050篇 |
2013年 | 34162篇 |
2012年 | 19093篇 |
2011年 | 26643篇 |
2010年 | 20937篇 |
2009年 | 23695篇 |
2008年 | 24366篇 |
2007年 | 24060篇 |
2006年 | 21146篇 |
2005年 | 19452篇 |
2004年 | 18773篇 |
2003年 | 18432篇 |
2002年 | 17616篇 |
2001年 | 17746篇 |
2000年 | 16646篇 |
1999年 | 17694篇 |
1998年 | 45071篇 |
1997年 | 31799篇 |
1996年 | 24560篇 |
1995年 | 18576篇 |
1994年 | 16478篇 |
1993年 | 16034篇 |
1992年 | 11683篇 |
1991年 | 10985篇 |
1990年 | 10796篇 |
1989年 | 10494篇 |
1988年 | 9953篇 |
1987年 | 8667篇 |
1986年 | 8655篇 |
1985年 | 9883篇 |
1984年 | 9094篇 |
1983年 | 8255篇 |
1982年 | 7675篇 |
1981年 | 7858篇 |
1980年 | 7394篇 |
1979年 | 7240篇 |
1978年 | 6849篇 |
1977年 | 8354篇 |
1976年 | 10914篇 |
1975年 | 5986篇 |
1974年 | 5706篇 |
1973年 | 5794篇 |
1972年 | 4769篇 |
排序方式: 共有10000条查询结果,搜索用时 21 毫秒
141.
A constant-time algorithm for labeling the connected components of an N×N image on a reconfigurable network of N3 processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N/sup 2+(1/d/), for any 1⩽d⩽log N, if O(d) time is allowed 相似文献
142.
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 相似文献
143.
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 相似文献
144.
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 相似文献
145.
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 相似文献
146.
147.
The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization 相似文献
148.
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 相似文献
149.
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 相似文献
150.
Malloy B.A. Lloyd E.L. Soffa M.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):498-508
A new approach is given for scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors. The key idea in our approach is to exploit the fine grained parallelism present in the instruction stream. In this context, schedules are constructed by a careful balancing of execution and communication costs at the level of individual instructions, and their data dependencies. Three methods are used to evaluate our approach. First, several existing methods are extended to the fine grained situation. Our approach is then compared to these methods using both static schedule length analyses, and simulated executions of the scheduled code. In each instance, our method is found to provide significantly shorter schedules. Second, by varying parameters such as the speed of the instruction set, and the speed/parallelism in the interconnection structure, simulation techniques are used to examine the effects of various architectural considerations on the executions of the schedules. These results show that our approach provides significant speedups in a wide-range of situations. Third, schedules produced by our approach are executed on a two-processor Data General shared memory multiprocessor system. These experiments show that there is a strong correlation between our simulation results, and these actual executions, and thereby serve to validate the simulation studies. Together, our results establish that fine grained parallelism can be exploited in a substantial manner when scheduling a sequential instruction stream for execution “in parallel” on asynchronous multiprocessors 相似文献