全文获取类型
收费全文 | 5384篇 |
免费 | 365篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 70篇 |
综合类 | 7篇 |
化学工业 | 1637篇 |
金属工艺 | 60篇 |
机械仪表 | 105篇 |
建筑科学 | 212篇 |
矿业工程 | 10篇 |
能源动力 | 203篇 |
轻工业 | 702篇 |
水利工程 | 45篇 |
石油天然气 | 7篇 |
无线电 | 349篇 |
一般工业技术 | 1011篇 |
冶金工业 | 371篇 |
原子能技术 | 29篇 |
自动化技术 | 936篇 |
出版年
2024年 | 16篇 |
2023年 | 98篇 |
2022年 | 326篇 |
2021年 | 399篇 |
2020年 | 185篇 |
2019年 | 188篇 |
2018年 | 218篇 |
2017年 | 192篇 |
2016年 | 266篇 |
2015年 | 195篇 |
2014年 | 283篇 |
2013年 | 361篇 |
2012年 | 354篇 |
2011年 | 457篇 |
2010年 | 293篇 |
2009年 | 252篇 |
2008年 | 301篇 |
2007年 | 243篇 |
2006年 | 168篇 |
2005年 | 151篇 |
2004年 | 132篇 |
2003年 | 118篇 |
2002年 | 85篇 |
2001年 | 61篇 |
2000年 | 49篇 |
1999年 | 50篇 |
1998年 | 39篇 |
1997年 | 31篇 |
1996年 | 39篇 |
1995年 | 23篇 |
1994年 | 21篇 |
1993年 | 22篇 |
1992年 | 25篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 10篇 |
1983年 | 10篇 |
1982年 | 11篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 8篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1967年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有5754条查询结果,搜索用时 0 毫秒
921.
922.
What Business Owners Expect From a Crisis Manager? A Competency Model: Survey Results From Czech Businesses 下载免费PDF全文
This competency model of a crisis manager has been developed based on cooperation with managers and experts in the field of crisis management. The brainwriting method was used to generate an overview of the competencies expected of a crisis manager. Using a mind map three basic groups of competencies were developed. The participants used Saaty's method to determine the significance of individual competencies. The different attributes of individual competencies according to the level of their development were established. Finally all individual competencies were assigned a target value which indicates the expected level of competence for the position of a crisis manager. The model of competencies is a practical tool for the establishment of crisis management system in a company. 相似文献
923.
Marco Cariglia Alfredo Vargas-Paredes Mauro M. Doria Antonio Bianconi Milorad V. Milošević Andrea Perali 《Journal of Superconductivity and Novel Magnetism》2016,29(12):3081-3086
Ultrathin superconductors of different materials are becoming a powerful platform to find mechanisms for enhancement of superconductivity, exploiting shape resonances in different superconducting properties. Here, we evaluate the superconducting gap and its spatial profile, the multiple gap components, and the chemical potential, of generic superconducting nanofilms, considering the pairing attraction and its energy scale as tunable parameters, from weak to strong coupling, at fixed electron density. Superconducting properties are evaluated at mean field level as a function of the thickness of the nanofilm, in order to characterize the shape resonances in the superconducting gap. We find that the most pronounced shape resonances are generated for weakly coupled superconductors, while approaching the strong coupling regime the shape resonances are rounded by a mixing of the subbands due to the large energy gaps extending over large energy scales. Finally, we find that the spatial profile, transverse to the nanofilm, of the superconducting gap acquires a flat behavior in the shape resonance region, indicating that a robust and uniform multigap superconducting state can arise at resonance. 相似文献
924.
High-quality industrial processes, characterized by a low fraction of non-conforming items, require paying special attention to the statistical control methods employed since traditional Shewhart's control charts are no longer suitable. In this article, CCC-r charts are considered based on the cumulative count of conforming items inspected until r non-conforming items are observed. However, even though these charts have shown to be useful for high-quality processes, they are characterized by a biased average run length (ARL). In order to help engineers interested in this control methodology to select the best option, a computational study of statistical validation was performed to compare the two most outstanding procedures for the cases r = 2, 3, and 4. The performance was evaluated based on the ARL under control. The application of the CCC-r chart to a real process is shown with data from an automobile parts plant. Finally, analysis and discussion of the results are presented. 相似文献
925.
Reyhaneh Neghabat Shirazi Fawaz Aldabbagh William Ronan Andrea Erxleben Yury Rochev Peter McHugh 《Journal of materials science. Materials in medicine》2016,27(10):154
In this study, the effects of material thickness and processing method on the degradation rate and the changes in the mechanical properties of poly(lactic-co-glycolic acid) material during simulated physiological degradation were investigated. Two types of poly(lactic-co-glycolic acid) materials were considered: 0.12?mm solvent-cast films and 1?mm compression-moulded plates. The experimental results presented in this study were compared to the experimental results of Shirazi et al. (Acta Biomaterialia 10(11):4695–703, 2014) for 0.25?mm solvent-cast films. These experimental observations were used to validate the computational modelling predictions of Shirazi et al. (J Mech Behav Biomed Mater 54: 48–59, 2016) on critical diffusion length scale and also to refine the model parameters. The specific material processing methods considered here did not have a significant effect on the degradation rate and the changes in mechanical properties during degradation; however, they influenced the initial molecular weight and they determined the stiffness and hardness of the poly(lactic-co-glycolic acid) material. The experimental observations strongly supported the computational modelling predictions that showed no significant difference in the degradation rate and the changes in the elastic modulus of poly(lactic-co-glycolic acid) films for thicknesses larger than 100?μm. 相似文献
926.
927.
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price approach to find proven optimal solutions to TOP. The pricing sub-problem is solved by a bounded bidirectional dynamic programming algorithm with decremental state space relaxation featuring a two-phase dominance rule relaxation. The new method is able to close 17 previously unsolved benchmark instances. In addition, we propose a Branch-and-Cut-and-Price approach using subset-row inequalities and show the effectiveness of these cuts in solving TOP. 相似文献
928.
929.
Valerio Arnaboldi Massimiliano La Gala Andrea Passarella Marco Conti 《Peer-to-Peer Networking and Applications》2016,9(6):1195-1208
Distributed Online Social Networks (DOSN) are a valid alternative to OSN based on peer-to-peer communications. Without centralised data management, DOSN must provide the users with higher level of control over their personal information and privacy. Thus, users may wish to restrict their personal network to a limited set of peers, depending on the level of trust with them. This means that the effective social network (used for information exchange) may be a subset of the complete social network, and may present different structural patterns, which could limit information diffusion. In this paper, we estimate the capability of DOSN to diffuse content based on trust between social peers. To have a realistic representation of a OSN friendship graph, we consider a large-scale Facebook network, from which we estimate the trust level between friends. Then, we consider only social links above a certain threshold of trust, and we analyse the potential capability of the resulting graph to spread information through several structural indices. We test four possible thresholds, coinciding with the definition of personal social circles derived from sociology and anthropology. The results show that limiting the network to “active social contacts” leads to a graph with high network connectivity, where the nodes are still well-connected to each other, thus information can potentially cover a large number of nodes with respect to the original graph. On the other hand, the coverage drops for more restrictive assumptions. Nevertheless the re-insertion of a single excluded friend for each user is sufficient to obtain good coverage (i.e., always higher than 40 %) even in the most restricted graphs. We also analyse the potential capability of the network to spread information (i.e., network spreadability), studying the properties of the social paths between any pairs of users in the graph, which represent the effective channels traversed by information. The value of contact frequency between pairs of users determines a decay of trust along the path (the higher the contact frequency the lower the decay), and a consequent decay in the level of trustworthiness of information traversing the path. We show that selecting the link to re-insert in the network with probability proportional to its level of trust is the best re-insertion strategy, as it leads to the best connectivity/spreadability combination. 相似文献
930.