全文获取类型
收费全文 | 12136篇 |
免费 | 1578篇 |
国内免费 | 1490篇 |
专业分类
电工技术 | 1053篇 |
综合类 | 1071篇 |
化学工业 | 348篇 |
金属工艺 | 132篇 |
机械仪表 | 1104篇 |
建筑科学 | 235篇 |
矿业工程 | 121篇 |
能源动力 | 169篇 |
轻工业 | 88篇 |
水利工程 | 237篇 |
石油天然气 | 33篇 |
武器工业 | 78篇 |
无线电 | 1616篇 |
一般工业技术 | 1281篇 |
冶金工业 | 462篇 |
原子能技术 | 34篇 |
自动化技术 | 7142篇 |
出版年
2024年 | 27篇 |
2023年 | 193篇 |
2022年 | 314篇 |
2021年 | 358篇 |
2020年 | 459篇 |
2019年 | 397篇 |
2018年 | 401篇 |
2017年 | 477篇 |
2016年 | 531篇 |
2015年 | 594篇 |
2014年 | 825篇 |
2013年 | 1285篇 |
2012年 | 950篇 |
2011年 | 908篇 |
2010年 | 697篇 |
2009年 | 854篇 |
2008年 | 860篇 |
2007年 | 871篇 |
2006年 | 762篇 |
2005年 | 691篇 |
2004年 | 539篇 |
2003年 | 428篇 |
2002年 | 350篇 |
2001年 | 282篇 |
2000年 | 193篇 |
1999年 | 180篇 |
1998年 | 132篇 |
1997年 | 95篇 |
1996年 | 81篇 |
1995年 | 82篇 |
1994年 | 62篇 |
1993年 | 43篇 |
1992年 | 41篇 |
1991年 | 31篇 |
1990年 | 20篇 |
1989年 | 19篇 |
1988年 | 9篇 |
1986年 | 15篇 |
1985年 | 15篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1963年 | 5篇 |
1961年 | 10篇 |
1960年 | 5篇 |
1959年 | 9篇 |
1958年 | 7篇 |
1957年 | 5篇 |
1956年 | 7篇 |
1955年 | 8篇 |
1954年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
陈奉贤 《计算机工程与科学》2022,44(7):1181-1190
高性能集群的作业调度通常使用作业调度系统来实现,准确填写作业运行时间能在很大程度上提升作业调度效率。现有的研究通常使用机器学习的预测方式,在预测精度和实用性上还存在一定的提升空间。为了进一步提高集群作业运行时间预测的准确率,考虑先对集群作业日志进行聚类,将作业类别信息添加到作业特征中,再使用基于注意力机制的NR-Transformer网络对作业日志数据建模和预测。在数据处理上,根据与预测目标的相关性、特征的完整性和数据的有效性,从历史日志数据集中筛选出7维特征,并按作业运行时间的长度将其划分为多个作业集,再对各作业集分别进行训练和预测。实验结果表明,相比于传统机器学习和BP神经网络,时序神经网络结构有更好的预测性能,其中NR-Transformer在各作业集上都有较好的性能。 相似文献
2.
3.
Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed. 相似文献
4.
Nan Lin Marie-Anne Rosemberg Wei Li Emily Meza-Wilson Christopher Godwin Stuart Batterman 《Indoor air》2021,31(1):26-39
Hotel housekeepers represent a large, low-income, predominantly minority, and high-risk workforce. Little is known about their exposure to chemicals, including volatile organic compounds (VOCs). This study evaluates VOC exposures of housekeepers, sources and factors affecting VOC levels, and provides preliminary estimates of VOC-related health risks. We utilized indoor and personal sampling at two hotels, assessed ventilation, and characterized the VOC composition of cleaning agents. Personal sampling of hotel staff showed a total target VOC concentration of 57 ± 36 µg/m3 (mean ± SD), about twice that of indoor samples. VOCs of greatest health significance included chloroform and formaldehyde. Several workers had exposure to alkanes that could cause non-cancer effects. VOC levels were negatively correlated with estimated air change rates. The composition and concentrations of the tested products and air samples helped identify possible emission sources, which included building sources (for formaldehyde), disinfection by-products in the laundry room, and cleaning products. VOC levels and the derived health risks in this study were at the lower range found in the US buildings. The excess lifetime cancer risk (average of 4.1 × 10−5) still indicates a need to lower exposure by reducing or removing toxic constituents, especially formaldehyde, or by increasing ventilation rates. 相似文献
5.
Yu-yan Yang Lin Fan Jiao Wang Yuan-duo Zhu Xu Li Xin-qi Wang Xu Yan Li Li Yu-jing Zhang Wen-jing Yang Xiao-yuan Yao Xian-liang Wang 《Indoor air》2021,31(5):1391-1401
Household fine particulate matter (PM2.5) pollution greatly impacts residents' health. To explore the current national situation of household PM2.5 pollution in China, a study was conducted based on literature published from 1998 to 2018. After extracting data from the literature in conformity with the requirements, the nationwide household-weighted mean concentration of household PM2.5 (HPL) was calculated. Subgroup analyses of spatial, geographic, and temporal differences were also done. The estimated overall HPL in China was 132.2 ± 117.7 μg/m3. HPL in the rural area (164.3 ± 104.5 μg/m3) was higher than that in the urban area (123.9 ± 122.3 μg/m3). For HPLs of indoor sampling sites, the kitchen was the highest, followed by the bedroom and living room. There were significant differences of geographic distributions. The HPLs in the South were higher than the North in four seasons. The inhaled dose of household PM2.5 among school-age children differed from provinces with the highest dose up to 5.9 μg/(kg·d). Countermeasures should be carried out to reduce indoor pollution and safeguard health urgently. 相似文献
6.
王文宇 《信息安全与通信保密》2021,(2)
个人信息因其自身携带隐私特性,与每个个体息息相关。个人信息保护不当,影响公众权益、企业利益以及社会秩序。在互联网、大数据、5G万物互联的时代,个人信息被广泛收集和使用,必须妥善解决个人信息保护问题,才能保障整个数据产业健康发展。而现有的个人信息保护方法或技术,不足以应对新形势下的保护诉求。基于数据运营安全的个人信息保护,针对当前个人信息保护的新形势和新诉求,提出结合人工智能,通过数据运营安全对结构化、半结构化、非结构化的个人信息流动的保护,涵盖从生产到运维,从采集、传输、存储、处理、分析、共享、销毁全生命周期保护,深入数据运营中内嵌防护,同时与业务解耦,达到保护个人信息安全的目标。 相似文献
7.
Containers, enabling lightweight environment and performance isolation, fast and flexible deployment, and fine-grained resource sharing, have gained popularity in better application management and deployment in addition to hardware virtualization. They are being widely used by organizations to deploy their increasingly diverse workloads derived from modern-day applications such as web services, big data, and internet of things in either proprietary clusters or private and public cloud data centers. This has led to the emergence of container orchestration platforms, which are designed to manage the deployment of containerized applications in large-scale clusters. These systems are capable of running hundreds of thousands of jobs across thousands of machines. To do so efficiently, they must address several important challenges including scalability, fault tolerance and availability, efficient resource utilization, and request throughput maximization among others. This paper studies these management systems and proposes a taxonomy that identifies different mechanisms that can be used to meet the aforementioned challenges. The proposed classification is then applied to various state-of-the-art systems leading to the identification of open research challenges and gaps in the literature intended as future directions for researchers. 相似文献
8.
Eco-driving has been proposed as an approach to significantly reduce greenhouse gas emissions arising from personal automobile use. Eco-driving is the adoption of a measured driving style, minimising unnecessary breaking and aggressive acceleration. Eco-driving can be seen as a low cost and immediate approach to emission reduction as it involves the modification of drivers’ behaviours as opposed to the development and implementation of newer, more efficient technology. Despite the proposed benefits of eco-driving, numerous challenges are faced in order to encourage the adoption of these behaviours and maintain them long term. This narrative review presents the concept of eco-driving, with a focus on the long-term maintenance of these behaviours, including training programmes and feedback devices. It is clear within current literature that, despite the economic and environmental benefits of adopting eco-driving, drivers require feedback on their actions in order to promote long-term, behavioural, change. 相似文献
9.
A novel couple-based particle swarm optimization (CPSO) is presented in this paper, and applied to solve the short-term hydrothermal scheduling (STHS) problem. In CPSO, three improvements are proposed compared to the canonical particle swarm optimization, aimed at overcoming the premature convergence problem. Dynamic particle couples, a unique sub-group structure in maintaining population diversity, is adopted as the population topology, in which every two particles compose a particle couple randomly in each iteration. Based on this topology, an intersectional learning strategy using the partner learning information of last iteration is employed in every particle couple, which can automatically reveal useful history information and reduce the overly rapid evolution speed. Meanwhile, the coefficients of each particle in a particle couple are set as distinct so that the particle movement patterns can be described and controlled more precisely. In order to demonstrate the effectiveness of our proposed CPSO, the algorithm is firstly tested with four multimodal benchmark functions, and then applied to solve an engineering multimodal problem known as STHS, in which two typical test systems with four different cases are tested, and the results are compared with those of other evolutionary methods published in the literature. 相似文献
10.
This article addresses the no-wait flowshop scheduling problem with simultaneous consideration of common due date assignment, convex resource allocation and learning effect in a two machine setting. The processing time of each job can be controlled by its position in a sequence and also by allocating extra resource, which is a convex function of the amount of a common continuously divisible resource allocated to the job. The objective is to determine the optimal common due date, the resource allocation and the schedule of jobs such that the total earliness, tardiness and common due date cost (the total resource consumption cost) are minimized under the constraint condition that the total resource consumption cost (the total earliness, tardiness and common due date cost) is limited. Polynomial time algorithms are developed for two versions of the problem. 相似文献