全文获取类型
收费全文 | 5277篇 |
免费 | 419篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 65篇 |
综合类 | 10篇 |
化学工业 | 1575篇 |
金属工艺 | 173篇 |
机械仪表 | 118篇 |
建筑科学 | 144篇 |
矿业工程 | 26篇 |
能源动力 | 208篇 |
轻工业 | 957篇 |
水利工程 | 32篇 |
石油天然气 | 21篇 |
无线电 | 256篇 |
一般工业技术 | 1001篇 |
冶金工业 | 321篇 |
原子能技术 | 12篇 |
自动化技术 | 781篇 |
出版年
2023年 | 76篇 |
2022年 | 170篇 |
2021年 | 306篇 |
2020年 | 192篇 |
2019年 | 205篇 |
2018年 | 303篇 |
2017年 | 267篇 |
2016年 | 324篇 |
2015年 | 273篇 |
2014年 | 331篇 |
2013年 | 559篇 |
2012年 | 350篇 |
2011年 | 307篇 |
2010年 | 247篇 |
2009年 | 263篇 |
2008年 | 213篇 |
2007年 | 185篇 |
2006年 | 140篇 |
2005年 | 94篇 |
2004年 | 97篇 |
2003年 | 85篇 |
2002年 | 76篇 |
2001年 | 28篇 |
2000年 | 44篇 |
1999年 | 22篇 |
1998年 | 37篇 |
1997年 | 31篇 |
1996年 | 23篇 |
1995年 | 27篇 |
1994年 | 22篇 |
1993年 | 24篇 |
1992年 | 20篇 |
1991年 | 10篇 |
1990年 | 23篇 |
1989年 | 9篇 |
1988年 | 13篇 |
1987年 | 15篇 |
1986年 | 13篇 |
1985年 | 26篇 |
1984年 | 32篇 |
1983年 | 35篇 |
1982年 | 22篇 |
1981年 | 27篇 |
1980年 | 23篇 |
1979年 | 28篇 |
1978年 | 9篇 |
1977年 | 11篇 |
1976年 | 15篇 |
1975年 | 11篇 |
1973年 | 10篇 |
排序方式: 共有5700条查询结果,搜索用时 15 毫秒
41.
42.
43.
44.
Julia Heidemann Mathias Klier Andrea Landherr Steffen Zimmermann 《Electronic Markets》2013,23(1):73-84
In light of the growing relevance of customer-oriented business strategies IT investments in the field of Customer Relationship Management have increased considerably. However, firms often could not realize sufficient returns on these IT investments. One major reason for this failure seems to be the lack of appropriate approaches to determine the economic impact of such investments ex ante. Therefore, we develop an economic model to determine the optimal level of Customer Relationship Management IT investments. Using this approach, firms can evaluate, to what extent investments in Customer Relationship Management IT are reasonable. One major result is that in most cases the “all or nothing strategy” pursued by many firms does not lead to the optimal level of investments. To illustrate the practical utility and applicability of the approach, we provide a real world example of a German financial services provider. 相似文献
45.
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. 相似文献
46.
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. 相似文献
47.
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. 相似文献
48.
As part of the efforts to understand the intricacies of the k-colorability problem, different distributions over k-colorable graphs have been analyzed. While the problem is notoriously hard (not even reasonably approximable) in the worst case, the average case (with respect to such distributions) often turns out to be “easy”. Semi-random models mediate between these two extremes and are more suitable to imitate “real-life” instances than purely random models. In this work we consider semi-random variants of the planted k-colorability distribution. This continues a line of research pursued by Coja-Oghlan, and by Krivelevich and Vilenchik. Our aim is to study a more general semi-random framework than those suggested so far. On the one hand we show that previous algorithmic techniques extend to our more general semi-random setting; on the other hand we give a hardness result, proving that a closely related semi-random model is intractable. Thus we provide some indication about which properties of the input distribution make the k-colorability problem hard. 相似文献
49.
We have attempted to bring together two areas which are challenging for both IS research and practice: forms of coordination and management of knowledge in the context of global, virtual software development projects. We developed a more comprehensive, knowledge-based model of how coordination can be achieved, and\illustrated the heuristic and explanatory power of the model when applied to global software projects experiencing different degrees of success. We first reviewed the literature on coordination and determined what is known about coordination of knowledge in global software projects. From this we developed a new, distinctive knowledge-based model of coordination, which was then employed to analyze two case studies of global software projects, at SAP and Baan, to illustrate the utility of the model. 相似文献
50.
Samples of -Fe (Armco) have been deformed by 50% in compression. These have then been annealed at 400 °C, considerably below the conventional recrystallization temperature, and the evolution of grain size and shape quantified. Initially the grain size is found to decrease whilst, at the same time, the grain-shape anisotropy also decreases. It is suggested that a continuous recrystallization process which favours the generation of higher angle grain boundaries is the underlying mechanism. Annealing for longer times gives rise to an increase in grain size with the development of undulations on the grain surfaces. The mechanism suggested for this behaviour involves the annihilation of segments of sub-boundaries on to a pre-existing boundary from either side of the boundary. 相似文献