全文获取类型
收费全文 | 3181篇 |
免费 | 341篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 44篇 |
化学工业 | 799篇 |
金属工艺 | 138篇 |
机械仪表 | 98篇 |
建筑科学 | 78篇 |
矿业工程 | 20篇 |
能源动力 | 159篇 |
轻工业 | 718篇 |
水利工程 | 14篇 |
石油天然气 | 10篇 |
无线电 | 162篇 |
一般工业技术 | 649篇 |
冶金工业 | 66篇 |
原子能技术 | 9篇 |
自动化技术 | 561篇 |
出版年
2024年 | 7篇 |
2023年 | 32篇 |
2022年 | 28篇 |
2021年 | 125篇 |
2020年 | 117篇 |
2019年 | 141篇 |
2018年 | 222篇 |
2017年 | 204篇 |
2016年 | 243篇 |
2015年 | 190篇 |
2014年 | 251篇 |
2013年 | 419篇 |
2012年 | 228篇 |
2011年 | 164篇 |
2010年 | 155篇 |
2009年 | 173篇 |
2008年 | 127篇 |
2007年 | 105篇 |
2006年 | 66篇 |
2005年 | 36篇 |
2004年 | 45篇 |
2003年 | 44篇 |
2002年 | 36篇 |
2001年 | 13篇 |
2000年 | 25篇 |
1999年 | 12篇 |
1998年 | 17篇 |
1997年 | 9篇 |
1996年 | 8篇 |
1995年 | 11篇 |
1994年 | 11篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1990年 | 15篇 |
1988年 | 7篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 18篇 |
1984年 | 27篇 |
1983年 | 31篇 |
1982年 | 18篇 |
1981年 | 20篇 |
1980年 | 19篇 |
1979年 | 16篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 6篇 |
1973年 | 8篇 |
排序方式: 共有3525条查询结果,搜索用时 15 毫秒
51.
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. 相似文献
52.
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. 相似文献
53.
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. 相似文献
54.
55.
56.
57.
Bogdan Branowski Leszek Pacholski Michał Rychlik Marek Zabłocki Piotr Pohl 《人机工程学与制造业中的人性因素》2013,23(4):255-266
The article presents a new concept of combining the three dimensions (3D) of a person's manipulation space. The data concern information about the reach of the arms and biomechanical data about limiting the load of a disabled person sitting in a wheelchair. Measurement data were acquired empirically, on original measuring station. The data included, respectively, arms' reach (static and dynamic) or, alternatively, measurements of limiting forces. The obtained data were processed into virtual 3D surfaces of arms' reach and forces. These surfaces provide the required graphic model of anthropotechnical and biomechanical data. Developed model was utilized to perform a virtual analysis of the accessibility of a disabled person to technical means: in a market sale space and in the ergonomic analysis into the space of a personal car. The presented method of 3D graphic modeling of anthropometrical and biomechanical data can be universally applied in ergonomic designing of work stations not only for disabled persons. © 2011 Wiley Periodicals, Inc. 相似文献
58.
Przemysław Mazurek 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2013,17(6):1095-1106
Track-before-detect (TBD) algorithms are used for tracking systems, where the object’s signal is below the noise floor (low-SNR objects). A lot of computations and memory transfers for real-time signal processing are necessary. GPGPU in parallel processing devices for TBD algorithms is well suited. Finding optimal or suboptimal code, due to lack of documentation for low-level programming of GPGPUs is not possible. High-level code optimization is necessary and the evolutionary approach, based on the single parent and single child is considered, that is local search approach. Brute force search technique is not feasible, because there are N! code variants, where N is the number of motion vectors components. The proposed evolutionary operator—LREI (local random extraction and insertion) allows source code reordering for the reduction of computation time due to better organization of memory transfer and the texture cache content. The starting point, based on the sorting and the minimal execution time metric is proposed. The unbiased random and biased sorting techniques are compared using experimental approach. Tests shows significant improvements of the computation speed, about 8 % over the conventional code for CUDA code. The time period of optimization for the sample code is about 1 h (1,000 iterations) for the considered recursive spatio-temporal TBD algorithm. 相似文献
59.
Paweł Jankowski Dominika Ogończyk Ladislav Derzsi Wojciech Lisowski Piotr Garstecki 《Microfluidics and nanofluidics》2013,14(3-4):597-604
Modification of the surfaces of polycarbonate (PC) with the use of a solution of tin (II) chloride renders them hydrophilic. The surface draping is stable against exposure to water and to alcohols. Exposure to alkanes reduces but does not diminish the effect. The method is compatible—in using the same solvent and temperature—with the hydrophobic modification of PC (Jankowski et al. in Lab Chip 11:1151–1156, 2011). The combination of these methods makes it possible to generate single and multiple monodisperse emulsions with the use of flow-focusing junctions in systems made in PC—a material that is suitable for fabrication of multilayer, high-throughput microfluidic devices. 相似文献
60.
Paweł Jankowski Dominika Ogończyk Ladislav Derzsi Wojciech Lisowski Piotr Garstecki 《Microfluidics and nanofluidics》2013,14(5):767-774
Modification of the surfaces of polycarbonate (PC) with the use of a solution of tin (II) chloride renders them hydrophilic. The surface draping is stable against exposure to water and to alcohols. Exposure to alkanes reduces but does not diminish the effect. The method is compatible—in using the same solvent and temperature—with the hydrophobic modification of PC Jankowski et al. ( Lab Chip 11:748–752, 2011). The combination of these methods makes it possible to generate single and multiple monodisperse emulsions with the use of flow-focusing junctions in systems made in PC—material that is suitable for fabrication of multilayer, high throughput microfluidic devices. 相似文献