全文获取类型
收费全文 | 484984篇 |
免费 | 5151篇 |
国内免费 | 1283篇 |
专业分类
电工技术 | 8076篇 |
综合类 | 288篇 |
化学工业 | 74855篇 |
金属工艺 | 22821篇 |
机械仪表 | 16846篇 |
建筑科学 | 10626篇 |
矿业工程 | 4277篇 |
能源动力 | 10591篇 |
轻工业 | 36439篇 |
水利工程 | 6080篇 |
石油天然气 | 14794篇 |
武器工业 | 32篇 |
无线电 | 51422篇 |
一般工业技术 | 105485篇 |
冶金工业 | 76122篇 |
原子能技术 | 14217篇 |
自动化技术 | 38447篇 |
出版年
2021年 | 4376篇 |
2019年 | 4251篇 |
2018年 | 7777篇 |
2017年 | 8026篇 |
2016年 | 8663篇 |
2015年 | 5050篇 |
2014年 | 8642篇 |
2013年 | 21220篇 |
2012年 | 13473篇 |
2011年 | 17848篇 |
2010年 | 14199篇 |
2009年 | 15905篇 |
2008年 | 16408篇 |
2007年 | 16135篇 |
2006年 | 14024篇 |
2005年 | 12569篇 |
2004年 | 12215篇 |
2003年 | 11963篇 |
2002年 | 11300篇 |
2001年 | 11548篇 |
2000年 | 10840篇 |
1999年 | 10611篇 |
1998年 | 22478篇 |
1997年 | 16433篇 |
1996年 | 12487篇 |
1995年 | 9811篇 |
1994年 | 8791篇 |
1993年 | 8871篇 |
1992年 | 7005篇 |
1991年 | 6916篇 |
1990年 | 6850篇 |
1989年 | 6574篇 |
1988年 | 6389篇 |
1987年 | 5706篇 |
1986年 | 5530篇 |
1985年 | 6315篇 |
1984年 | 5910篇 |
1983年 | 5581篇 |
1982年 | 5212篇 |
1981年 | 5317篇 |
1980年 | 5173篇 |
1979年 | 5207篇 |
1978年 | 5284篇 |
1977年 | 5538篇 |
1976年 | 6550篇 |
1975年 | 4725篇 |
1974年 | 4725篇 |
1973年 | 4819篇 |
1972年 | 4093篇 |
1971年 | 3753篇 |
排序方式: 共有10000条查询结果,搜索用时 12 毫秒
81.
We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer 相似文献
82.
in the above paper Yu (IEEE Trans. Neural Networks, vol.3, no.6, p.1019-21 (1992)) claims to prove that local minima do not exist in the error surface of backpropagation networks being trained on data with t distinct input patterns when the network is capable of exactly representing arbitrary mappings on t input patterns. The commenter points out that the proof presented is flawed, so that the resulting claims remain unproved. In reply, Yu points out that the undesired phenomenon that was sited can be avoided by simply imposing the arbitrary mapping capacity of the network on lemma 1 in the article. 相似文献
83.
84.
Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation. 相似文献
85.
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. 相似文献
86.
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 相似文献
87.
We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel 相似文献
88.
This paper proposes a system based on a parallel genetic algorithm with enhanced encoding and operational abilities. The system, used to evolve feedforward artificial neural networks, has been applied to two widely different problem areas: Boolean function learning and robot control. It is shown that the good results obtained in both cases are due to two factors: first, the enhanced exploration abilities provided by the search-space reducing evolution of both coding granularity and network topology, and, second, the enhanced exploitational abilities due to a recently proposed cooperative local optimizing genetic operator. 相似文献
89.
What is the implication for business when information technology (IT) changes in the workplace without a commensurate change in the composition of business programs educating tomorrow's employees? A survey of MBA graduates forms the basis of this article on the IT skills needed in the marketplace. 相似文献
90.