全文获取类型
收费全文 | 23519篇 |
免费 | 3949篇 |
国内免费 | 2880篇 |
专业分类
电工技术 | 4872篇 |
综合类 | 2250篇 |
化学工业 | 469篇 |
金属工艺 | 182篇 |
机械仪表 | 1595篇 |
建筑科学 | 444篇 |
矿业工程 | 245篇 |
能源动力 | 652篇 |
轻工业 | 113篇 |
水利工程 | 542篇 |
石油天然气 | 136篇 |
武器工业 | 193篇 |
无线电 | 3525篇 |
一般工业技术 | 1678篇 |
冶金工业 | 248篇 |
原子能技术 | 58篇 |
自动化技术 | 13146篇 |
出版年
2024年 | 66篇 |
2023年 | 434篇 |
2022年 | 731篇 |
2021年 | 819篇 |
2020年 | 994篇 |
2019年 | 846篇 |
2018年 | 779篇 |
2017年 | 1029篇 |
2016年 | 1087篇 |
2015年 | 1264篇 |
2014年 | 1734篇 |
2013年 | 2073篇 |
2012年 | 1873篇 |
2011年 | 1736篇 |
2010年 | 1408篇 |
2009年 | 1571篇 |
2008年 | 1655篇 |
2007年 | 1770篇 |
2006年 | 1409篇 |
2005年 | 1388篇 |
2004年 | 1169篇 |
2003年 | 909篇 |
2002年 | 761篇 |
2001年 | 594篇 |
2000年 | 434篇 |
1999年 | 382篇 |
1998年 | 283篇 |
1997年 | 205篇 |
1996年 | 179篇 |
1995年 | 183篇 |
1994年 | 144篇 |
1993年 | 89篇 |
1992年 | 79篇 |
1991年 | 58篇 |
1990年 | 33篇 |
1989年 | 29篇 |
1988年 | 19篇 |
1987年 | 10篇 |
1986年 | 21篇 |
1985年 | 20篇 |
1984年 | 18篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
陈奉贤 《计算机工程与科学》2022,44(7):1181-1190
高性能集群的作业调度通常使用作业调度系统来实现,准确填写作业运行时间能在很大程度上提升作业调度效率。现有的研究通常使用机器学习的预测方式,在预测精度和实用性上还存在一定的提升空间。为了进一步提高集群作业运行时间预测的准确率,考虑先对集群作业日志进行聚类,将作业类别信息添加到作业特征中,再使用基于注意力机制的NR-Transformer网络对作业日志数据建模和预测。在数据处理上,根据与预测目标的相关性、特征的完整性和数据的有效性,从历史日志数据集中筛选出7维特征,并按作业运行时间的长度将其划分为多个作业集,再对各作业集分别进行训练和预测。实验结果表明,相比于传统机器学习和BP神经网络,时序神经网络结构有更好的预测性能,其中NR-Transformer在各作业集上都有较好的性能。 相似文献
2.
3.
4.
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. 相似文献
5.
Ning Wang Yinya Li Guoqing Qi Andong Sheng 《International Journal of Adaptive Control and Signal Processing》2019,33(7):1174-1188
This paper investigates the state estimation issue for a class of wireless sensor networks (WSNs) with the consideration of limited energy resources. First, a multirate estimation model is established, and then, a new event‐triggered two‐stage information fusion algorithm is developed based on the optimal fusion criterion weighted by matrices. Compared with the existing methods, the presented fusion algorithm can significantly reduce the communication cost in WSNs and save energy resources of sensors efficiently. Furthermore, by presetting a desired containment probability over the interval [0,1] with the developed event‐triggered mechanism, one can obtain a suitable compromise between the communication cost and the estimation accuracy. Finally, a numerical simulation for the WSN tracking system is given to demonstrate the effectiveness of the proposed method. 相似文献
6.
Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method. 相似文献
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.
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. 相似文献
9.
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. 相似文献
10.