全文获取类型
收费全文 | 461255篇 |
免费 | 5399篇 |
国内免费 | 1211篇 |
专业分类
电工技术 | 8680篇 |
综合类 | 579篇 |
化学工业 | 70773篇 |
金属工艺 | 18055篇 |
机械仪表 | 14381篇 |
建筑科学 | 10728篇 |
矿业工程 | 2320篇 |
能源动力 | 10740篇 |
轻工业 | 42873篇 |
水利工程 | 4668篇 |
石油天然气 | 8158篇 |
武器工业 | 98篇 |
无线电 | 54368篇 |
一般工业技术 | 86687篇 |
冶金工业 | 86135篇 |
原子能技术 | 10184篇 |
自动化技术 | 38438篇 |
出版年
2021年 | 3760篇 |
2019年 | 3651篇 |
2018年 | 6274篇 |
2017年 | 6276篇 |
2016年 | 6654篇 |
2015年 | 4204篇 |
2014年 | 7188篇 |
2013年 | 19821篇 |
2012年 | 11561篇 |
2011年 | 15732篇 |
2010年 | 12462篇 |
2009年 | 13930篇 |
2008年 | 14854篇 |
2007年 | 14913篇 |
2006年 | 13444篇 |
2005年 | 12059篇 |
2004年 | 11632篇 |
2003年 | 11326篇 |
2002年 | 11072篇 |
2001年 | 10942篇 |
2000年 | 10563篇 |
1999年 | 10569篇 |
1998年 | 24924篇 |
1997年 | 17749篇 |
1996年 | 13927篇 |
1995年 | 10858篇 |
1994年 | 9686篇 |
1993年 | 9459篇 |
1992年 | 7509篇 |
1991年 | 6978篇 |
1990年 | 6995篇 |
1989年 | 6663篇 |
1988年 | 6419篇 |
1987年 | 5612篇 |
1986年 | 5559篇 |
1985年 | 6421篇 |
1984年 | 6085篇 |
1983年 | 5485篇 |
1982年 | 5186篇 |
1981年 | 5376篇 |
1980年 | 5080篇 |
1979年 | 4905篇 |
1978年 | 4798篇 |
1977年 | 5479篇 |
1976年 | 6876篇 |
1975年 | 4338篇 |
1974年 | 4196篇 |
1973年 | 4341篇 |
1972年 | 3549篇 |
1971年 | 3295篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
Michael D. Vose 《Annals of Mathematics and Artificial Intelligence》1994,10(4):423-434
This paper examines the influence of mutation on the behavior of genetic algorithms through a series of examples and experiments. The results provide an existence proof that mutation is a far more profound operator than has ever been recognized. Implications are discussed which point to the importance of open questions concerning genetic algorithms. The paper also reviews the implementation of the infinite population model of Vose which forms the computational basis of this investigation. 相似文献
82.
Fernandez E.B. Gudes E. Haiyan Song 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(2):275-292
The integration of object-oriented programming concepts with databases is one of the most significant advances in the evolution of database systems. Many aspects of such a combination have been studied, but there are few models to provide security for this richly structured information. We develop an authorization model for object-oriented databases. This model consists of a set of policies, a structure for authorization rules, and algorithms to evaluate access requests against the authorization rules. User access policies are based on the concept of inherited authorization applied along the class structure hierarchy. We propose also a set of administrative policies that allow the control of user access and its decentralization. Finally, we study the effect of class structuring changes on authorization 相似文献
83.
Shrivastava S.K. McCue D.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(4):421-432
The object-oriented approach to system structuring has found widespread acceptance among designers and developers of robust computing systems. The authors propose a system structure for distributed programming systems that support persistent objects and describe how properties such as persistence and recoverability can be implemented. The proposed structure is modular, permitting easy exploitation of any distributed computing facilities provided by the underlying system. An existing system constructed according to the principles espoused here is examined to illustrate the practical utility of the proposed approach to system structuring 相似文献
84.
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 相似文献
85.
We present the design of E-kernel, an embedding kernel on the Victor V256 message-passing partitionable multiprocessor, developed for the support of program mapping and network reconfiguration. E-kernel supports the embedding of a new network topology onto Victor's 2D mesh and also the embedding of a task graph onto the 2D mesh network or the reconfigured network. In the current implementation, the reconfigured network can be a line or an even-size ring, and the task graphs meshes or tori of a variety of dimensions and shapes or graphs with similar topologies. For application programs having these task graph topologies and that are designed according to the communication model of E-kernel, they can be run without any change on partitions connected by the 2D mesh, line, or ring. Further, E-kernel attempts the communication optimization of these programs on the different networks automatically, thus making both the network topology and the communication optimization attempt completely transparent to the application programs. Many of the embeddings used in E-kernel are optimal or asymptotically optimal (with respect to minimum dilation cost). The implementation of E-kernel translated some of the many theoretical results in graph embeddings into practical tools for program mapping and network reconfiguration in a parallel system. E-kernel is functional on Victor V256. Measurements of E-kernel's performance on V256 are also included 相似文献
86.
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. 相似文献
87.
Nonlinear adaptive filters based on a variety of neural network models have been used successfully for system identification and noise-cancellation in a wide class of applications. An important problem in data communications is that of channel equalization, i.e., the removal of interferences introduced by linear or nonlinear message corrupting mechanisms, so that the originally transmitted symbols can be recovered correctly at the receiver. In this paper we introduce an adaptive recurrent neural network (RNN) based equalizer whose small size and high performance makes it suitable for high-speed channel equalization. We propose RNN based structures for both trained adaptation and blind equalization, and we evaluate their performance via extensive simulations for a variety of signal modulations and communication channel models. It is shown that the RNN equalizers have comparable performance with traditional linear filter based equalizers when the channel interferences are relatively mild, and that they outperform them by several orders of magnitude when either the channel's transfer function has spectral nulls or severe nonlinear distortion is present. In addition, the small-size RNN equalizers, being essentially generalized IIR filters, are shown to outperform multilayer perceptron equalizers of larger computational complexity in linear and nonlinear channel equalization cases. 相似文献
88.
The cascade correlation is a very flexible, efficient and fast algorithm for supervised learning. It incrementally builds the network by adding hidden units one at a time, until the desired input/output mapping is achieved. It connects all the previously installed units to the new unit being added. Consequently, each new unit in effect adds a new layer and the fan-in of the hidden and output units keeps on increasing as more units get added. The resulting structure could be hard to implement in VLSI, because the connections are irregular and the fan-in is unbounded. Moreover, the depth or the propagation delay through the resulting network is directly proportional to the number of units and can be excessive. We have modified the algorithm to generate networks with restricted fan-in and small depth (propagation delay) by controlling the connectivity. Our results reveal that there is a tradeoff between connectivity and other performance attributes like depth, total number of independent parameters, and learning time. 相似文献
89.
90.
Effective systems development techniques attract a lot of attention, but little has been done to effectively address systems maintenance. This article describes an effective, proven approach to resurrecting existing systems and Increasing their useful life, using a system that employs both software tools and a rigorous methodology. 相似文献