全文获取类型
收费全文 | 25242篇 |
免费 | 2541篇 |
国内免费 | 2409篇 |
专业分类
电工技术 | 1546篇 |
技术理论 | 1篇 |
综合类 | 2989篇 |
化学工业 | 912篇 |
金属工艺 | 285篇 |
机械仪表 | 1622篇 |
建筑科学 | 1546篇 |
矿业工程 | 415篇 |
能源动力 | 520篇 |
轻工业 | 420篇 |
水利工程 | 644篇 |
石油天然气 | 283篇 |
武器工业 | 136篇 |
无线电 | 2229篇 |
一般工业技术 | 2804篇 |
冶金工业 | 859篇 |
原子能技术 | 87篇 |
自动化技术 | 12894篇 |
出版年
2024年 | 36篇 |
2023年 | 266篇 |
2022年 | 462篇 |
2021年 | 524篇 |
2020年 | 734篇 |
2019年 | 656篇 |
2018年 | 617篇 |
2017年 | 777篇 |
2016年 | 874篇 |
2015年 | 971篇 |
2014年 | 1747篇 |
2013年 | 2175篇 |
2012年 | 2027篇 |
2011年 | 1829篇 |
2010年 | 1475篇 |
2009年 | 1771篇 |
2008年 | 1804篇 |
2007年 | 1850篇 |
2006年 | 1584篇 |
2005年 | 1451篇 |
2004年 | 1121篇 |
2003年 | 937篇 |
2002年 | 754篇 |
2001年 | 686篇 |
2000年 | 535篇 |
1999年 | 450篇 |
1998年 | 338篇 |
1997年 | 257篇 |
1996年 | 209篇 |
1995年 | 211篇 |
1994年 | 177篇 |
1993年 | 140篇 |
1992年 | 125篇 |
1991年 | 100篇 |
1990年 | 89篇 |
1989年 | 94篇 |
1988年 | 64篇 |
1987年 | 31篇 |
1986年 | 29篇 |
1985年 | 26篇 |
1984年 | 24篇 |
1983年 | 18篇 |
1982年 | 11篇 |
1981年 | 15篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1975年 | 9篇 |
1964年 | 8篇 |
1963年 | 9篇 |
1961年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 250 毫秒
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.
5.
Fatemeh Abdi 《Optimization methods & software》2019,34(1):25-36
In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm. 相似文献
6.
Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound. 相似文献
7.
8.
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. 相似文献
9.
Nasser Samadzadehaghdam Bahador Makkiabadi Sadegh Masjoodi Mohammad Mohammadi Fahimeh Mohagheghian 《International journal of imaging systems and technology》2019,29(4):686-700
Brain source imaging based on EEG aims to reconstruct the neural activities producing the scalp potentials. This includes solving the forward and inverse problems. The aim of the inverse problem is to estimate the activity of the brain sources based on the measured data and leadfield matrix computed in the forward step. Spatial filtering, also known as beamforming, is an inverse method that reconstructs the time course of the source at a particular location by weighting and linearly combining the sensor data. In this paper, we considered a temporal assumption related to the time course of the source, namely sparsity, in the Linearly Constrained Minimum Variance (LCMV) beamformer. This assumption sounds reasonable since not all brain sources are active all the time such as epileptic spikes and also some experimental protocols such as electrical stimulations of a peripheral nerve can be sparse in time. Developing the sparse beamformer is done by incorporating L1-norm regularization of the beamformer output in the relevant cost function while obtaining the filter weights. We called this new beamformer SParse LCMV (SP-LCMV). We compared the performance of the SP-LCMV with that of LCMV for both superficial and deep sources with different amplitudes using synthetic EEG signals. Also, we compared them in localization and reconstruction of sources underlying electric median nerve stimulation. Results show that the proposed sparse beamformer can enhance reconstruction of sparse sources especially in the case of sources with high amplitude spikes. 相似文献
10.
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. 相似文献