全文获取类型
收费全文 | 594113篇 |
免费 | 9582篇 |
国内免费 | 2134篇 |
专业分类
电工技术 | 10591篇 |
综合类 | 789篇 |
化学工业 | 90440篇 |
金属工艺 | 23001篇 |
机械仪表 | 16979篇 |
建筑科学 | 14475篇 |
矿业工程 | 2555篇 |
能源动力 | 16160篇 |
轻工业 | 54542篇 |
水利工程 | 5816篇 |
石油天然气 | 10402篇 |
武器工业 | 52篇 |
无线电 | 64474篇 |
一般工业技术 | 115751篇 |
冶金工业 | 117331篇 |
原子能技术 | 11199篇 |
自动化技术 | 51272篇 |
出版年
2022年 | 3728篇 |
2021年 | 6160篇 |
2020年 | 4546篇 |
2019年 | 5659篇 |
2018年 | 9777篇 |
2017年 | 9465篇 |
2016年 | 10044篇 |
2015年 | 7219篇 |
2014年 | 11294篇 |
2013年 | 28779篇 |
2012年 | 17722篇 |
2011年 | 23383篇 |
2010年 | 18532篇 |
2009年 | 20501篇 |
2008年 | 20801篇 |
2007年 | 20524篇 |
2006年 | 17547篇 |
2005年 | 15932篇 |
2004年 | 15156篇 |
2003年 | 14762篇 |
2002年 | 13974篇 |
2001年 | 14025篇 |
2000年 | 12901篇 |
1999年 | 13752篇 |
1998年 | 36709篇 |
1997年 | 25671篇 |
1996年 | 19573篇 |
1995年 | 14395篇 |
1994年 | 12354篇 |
1993年 | 12089篇 |
1992年 | 8582篇 |
1991年 | 8047篇 |
1990年 | 7805篇 |
1989年 | 7567篇 |
1988年 | 6938篇 |
1987年 | 6215篇 |
1986年 | 6079篇 |
1985年 | 6761篇 |
1984年 | 6317篇 |
1983年 | 5568篇 |
1982年 | 5256篇 |
1981年 | 5364篇 |
1980年 | 5150篇 |
1979年 | 4965篇 |
1978年 | 4732篇 |
1977年 | 5928篇 |
1976年 | 8099篇 |
1975年 | 4108篇 |
1974年 | 3843篇 |
1973年 | 3980篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
151.
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 相似文献
152.
153.
Different hierarchical models in pattern analysis and recognition are proposed, based on occurrence probability of patterns. As an important application of recognizing handprinted characters, three typical kinds of hierarchical models such asM
89-89,M
89-36 andM
36-36 have been presented, accompanied by the computer algorithms for computing recognition rates of pattern parts. Moreover, a comparative study of their recognition rates has been conducted theoretically; and numerical experiments have been carried out to verify the analytical conclusions made. Various hierarchical models deliberated in this paper can provide users more or better choices of pattern models in practical application, and lead to a uniform computational scheme (or code). The recognition rates of parts can be improved remarkably by a suitable hierarchical model. For the modelM
89-36 in which case some of the Canadian standard handprinted characters have multiple occurrence probabilities, the total mean recognition rates of the given sample may reach 120% of that by the model proposed by Li et al., and 156% of that obtained from the subjective experiments reported by Suen. 相似文献
154.
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 相似文献
155.
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 相似文献
156.
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 相似文献
157.
A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, was studied by S. Even and S. Rajsbaum (1990) under the assumption that message transmission delays and processing times are constant. We study the behavior of the simple synchronizer when processing times and transmission delays are random. The main performance measure is the rate of a network, i.e., the average number of computational steps executed by a processor in the network per unit time. We analyze the effect of the topology and the probability distributions of the random variables on the behavior of the network. For random variables with exponential distribution, we provide tight (i.e., attainable) bounds and study the effect of a bottleneck processor on the rate 相似文献
158.
We consider the design problem for a class of discrete-time and continuous-time neural networks. We obtain a characterization of all connection weights that store a given set of vectors into the network, that is, each given vector becomes an equilibrium point of the network. We also give sufficient conditions that guarantee the asymptotic stability of these equilibrium points. 相似文献
159.
160.