全文获取类型
收费全文 | 6325篇 |
免费 | 471篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 88篇 |
综合类 | 3篇 |
化学工业 | 1381篇 |
金属工艺 | 225篇 |
机械仪表 | 153篇 |
建筑科学 | 159篇 |
矿业工程 | 25篇 |
能源动力 | 244篇 |
轻工业 | 1049篇 |
水利工程 | 26篇 |
石油天然气 | 16篇 |
无线电 | 223篇 |
一般工业技术 | 1153篇 |
冶金工业 | 1123篇 |
原子能技术 | 26篇 |
自动化技术 | 908篇 |
出版年
2023年 | 44篇 |
2022年 | 38篇 |
2021年 | 160篇 |
2020年 | 160篇 |
2019年 | 177篇 |
2018年 | 297篇 |
2017年 | 289篇 |
2016年 | 335篇 |
2015年 | 273篇 |
2014年 | 347篇 |
2013年 | 581篇 |
2012年 | 374篇 |
2011年 | 366篇 |
2010年 | 281篇 |
2009年 | 276篇 |
2008年 | 223篇 |
2007年 | 205篇 |
2006年 | 130篇 |
2005年 | 85篇 |
2004年 | 92篇 |
2003年 | 89篇 |
2002年 | 78篇 |
2001年 | 38篇 |
2000年 | 37篇 |
1999年 | 27篇 |
1998年 | 201篇 |
1997年 | 212篇 |
1996年 | 143篇 |
1995年 | 107篇 |
1994年 | 61篇 |
1993年 | 74篇 |
1992年 | 30篇 |
1991年 | 17篇 |
1990年 | 29篇 |
1989年 | 15篇 |
1988年 | 18篇 |
1987年 | 22篇 |
1986年 | 18篇 |
1985年 | 32篇 |
1984年 | 55篇 |
1983年 | 48篇 |
1982年 | 53篇 |
1981年 | 64篇 |
1980年 | 72篇 |
1979年 | 39篇 |
1978年 | 41篇 |
1977年 | 115篇 |
1976年 | 246篇 |
1975年 | 21篇 |
1973年 | 16篇 |
排序方式: 共有6802条查询结果,搜索用时 671 毫秒
101.
102.
In this paper, a novel reaching law for discrete‐time variable structure systems is proposed. It ensures that the representative point (state) of the controlled plant approaches the switching plane in finite time and then crosses it in every subsequent step. Moreover, the proposed reaching law ensures that for the nominal plant the absolute value of the sliding variable asymptotically decreases to zero, and for the perturbed plant, it converges to a smaller interval around zero than with the application of previously proposed reaching laws. The control method proposed in this paper guarantees asymptotic stability of the nominal system and uniform ultimate boundedness of the perturbed one. Furthermore, the method ensures that the sliding variable rate of change (i.e. the difference between its values at any two subsequent sampling instants) is bounded by design parameters, which do not depend on the system initial conditions. This is a highly desirable property, as it results in a priori specified, ‘almost’ constant convergence rate of the sliding variable when the system state is far off the switching plane and helps enforce state constraints in the system. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
103.
Wojciech Chmiel Jacek Dańda Andrzej Dziech Sebastian Ernst Piotr Kadłuczka Zbigniew Mikrut Piotr Pawlik Piotr Szwed Igor Wojnicki 《Multimedia Tools and Applications》2016,75(17):10529-10560
Intelligent Transportation Systems (ITS) aim to improve safety, mobility and environmental performance of road transport. The INSIGMA project provides a fresh look at the possible innovations in this field, by enhancing the functionality and accuracy of ITS in urban environments. This paper describes the architecture, sensors, processing algorithms, output modules and advantages of the developed system. A comparison of existing ITS systems has been provided as background. Special attention has been given to performance and privacy issues, as the system includes social aspects such as location monitoring. 相似文献
104.
Tomasz Idziaszek Michał Skrzypczak Mikołaj Bojańczyk 《Theory of Computing Systems》2016,58(4):614-663
An infinite tree is called thin if it contains only countably many infinite branches. Thin trees can be seen as intermediate structures between infinite words and infinite trees. In this work we investigate properties of regular languages of thin trees. Our main tool is an algebra suitable for thin trees. Using this framework we characterize various classes of regular languages: commutative, open in the standard topology, and definable in weak MSO logic among all trees. We also show that in various meanings thin trees are not as rich as all infinite trees. In particular we observe a collapse of the parity index to the level (1, 3) and a collapse of the topological complexity to co-analytic sets. Moreover, a gap property is shown: a regular language of thin trees is either weak MSO-definable among all trees or co-analytic-complete. 相似文献
105.
Jędrzej M. Marszałkowski Maciej Drozdowski Jakub Marszałkowski 《Journal of Grid Computing》2016,14(1):153-170
In this paper we analyze the impact of memory hierarchies on time-energy trade-off in parallel computations. Contemporary computing systems have deep memory hierarchies with significantly different speeds and power consumptions. This results in nonlinear phenomena in the processing time and energy usage emerging when the size of the computation is growing. In this paper the nonlinear dependence of the time and energy on the size of the solved problem is formalized and verified using measurements in practical computer systems. Then it is applied to formulate a problem of minimum time and minimum energy scheduling parallel processing of divisible loads. Divisible load theory is a scheduling and performance model of data-parallel applications. Mathematical programming is exploited to solve the scheduling problem. A trade-off between energy and schedule length is analyzed and again nonlinear relationships between these two criteria are observed. Further performance analysis reveals that energy consumption and schedule length are ruled by a complex interplay between the costs and speeds of on-core and out-of-core computations, communication delays, and activating new machines. 相似文献
106.
In this work, we present a method of decomposition of arbitrary unitary matrix \(U\in \mathbf {U}(2^k)\) into a product of single-qubit negator and controlled-\(\sqrt{\text{ NOT }}\) gates. Since the product results with negator matrix, which can be treated as complex analogue of bistochastic matrix, our method can be seen as complex analogue of Sinkhorn–Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively, and resulting circuit consists of \(O(4^k)\) entangling gates, which is proved to be optimal. An example of such transformation is presented. 相似文献
107.
In this work we aim at proving central limit theorems for open quantum walks on \({\mathbb {Z}}^d\). We study the case when there are various classes of vertices in the network. In particular, we investigate two ways of distributing the vertex classes in the network. First, we assign the classes in a regular pattern. Secondly, we assign each vertex a random class with a transition invariant distribution. For each way of distributing vertex classes, we obtain an appropriate central limit theorem, illustrated by numerical examples. These theorems may have application in the study of complex systems in quantum biology and dissipative quantum computation. 相似文献
108.
109.
110.