全文获取类型
收费全文 | 85271篇 |
免费 | 13702篇 |
国内免费 | 10525篇 |
专业分类
电工技术 | 6578篇 |
技术理论 | 4篇 |
综合类 | 9322篇 |
化学工业 | 3741篇 |
金属工艺 | 2214篇 |
机械仪表 | 4934篇 |
建筑科学 | 2487篇 |
矿业工程 | 1359篇 |
能源动力 | 1833篇 |
轻工业 | 1369篇 |
水利工程 | 1078篇 |
石油天然气 | 1445篇 |
武器工业 | 843篇 |
无线电 | 13525篇 |
一般工业技术 | 5271篇 |
冶金工业 | 3206篇 |
原子能技术 | 246篇 |
自动化技术 | 50043篇 |
出版年
2024年 | 990篇 |
2023年 | 3217篇 |
2022年 | 5209篇 |
2021年 | 5327篇 |
2020年 | 4852篇 |
2019年 | 3657篇 |
2018年 | 2847篇 |
2017年 | 3009篇 |
2016年 | 3499篇 |
2015年 | 3761篇 |
2014年 | 5174篇 |
2013年 | 5066篇 |
2012年 | 5407篇 |
2011年 | 6068篇 |
2010年 | 5084篇 |
2009年 | 5330篇 |
2008年 | 5621篇 |
2007年 | 5751篇 |
2006年 | 4827篇 |
2005年 | 4282篇 |
2004年 | 3499篇 |
2003年 | 2984篇 |
2002年 | 2483篇 |
2001年 | 2100篇 |
2000年 | 1852篇 |
1999年 | 1487篇 |
1998年 | 1223篇 |
1997年 | 1033篇 |
1996年 | 820篇 |
1995年 | 642篇 |
1994年 | 491篇 |
1993年 | 376篇 |
1992年 | 284篇 |
1991年 | 156篇 |
1990年 | 138篇 |
1989年 | 106篇 |
1988年 | 77篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 65篇 |
1984年 | 63篇 |
1983年 | 61篇 |
1982年 | 58篇 |
1979年 | 24篇 |
1965年 | 26篇 |
1964年 | 30篇 |
1963年 | 26篇 |
1959年 | 20篇 |
1957年 | 24篇 |
1955年 | 23篇 |
排序方式: 共有10000条查询结果,搜索用时 640 毫秒
1.
Machine learning algorithms have been widely used in mine fault diagnosis. The correct selection of the suitable algorithms is the key factor that affects the fault diagnosis. However, the impact of machine learning algorithms on the prediction performance of mine fault diagnosis models has not been fully evaluated. In this study, the windage alteration faults (WAFs) diagnosis models, which are based on K-nearest neighbor algorithm (KNN), multi-layer perceptron (MLP), support vector machine (SVM), and decision tree (DT), are constructed. Furthermore, the applicability of these four algorithms in the WAFs diagnosis is explored by a T-type ventilation network simulation experiment and the field empirical application research of Jinchuan No. 2 mine. The accuracy of the fault location diagnosis for the four models in both networks was 100%. In the simulation experiment, the mean absolute percentage error (MAPE) between the predicted values and the real values of the fault volume of the four models was 0.59%, 97.26%, 123.61%, and 8.78%, respectively. The MAPE for the field empirical application was 3.94%, 52.40%, 25.25%, and 7.15%, respectively. The results of the comprehensive evaluation of the fault location and fault volume diagnosis tests showed that the KNN model is the most suitable algorithm for the WAFs diagnosis, whereas the prediction performance of the DT model was the second-best. This study realizes the intelligent diagnosis of WAFs, and provides technical support for the realization of intelligent ventilation. 相似文献
2.
Polarization imaging can retrieve inaccurate objects’ 3D shapes with fine textures, whereas coarse but accurate depths can be provided by binocular stereo vision. To take full advantage of these two complementary techniques, we investigate a novel 3D reconstruction method based on the fusion of polarization imaging and binocular stereo vision for high quality 3D reconstruction. We first generate the polarization surface by correcting the azimuth angle errors on the basis of registered binocular depth, to solve the azimuthal ambiguity in the polarization imaging. Then we propose a joint 3D reconstruction model for depth fusion, including a data fitting term and a robust low-rank matrix factorization constraint. The former is to transfer textures from the polarization surface to the fused depth by assuming their relationship linear, whereas the latter is to utilize the low-frequency part of binocular depth to improve the accuracy of the fused depth considering the influences of missing-entries and outliers. To solve the optimization problem in the proposed model, we adopt an efficient solution based on the alternating direction method of multipliers. Extensive experiments have been conducted to demonstrate the efficiency of the proposed method in comparison with state-of-the-art methods and to exhibit its wide application prospects in 3D reconstruction. 相似文献
3.
A key element in solving real-life data science problems is selecting the types of models to use. Tree ensemble models (such as XGBoost) are usually recommended for classification and regression problems with tabular data. However, several deep learning models for tabular data have recently been proposed, claiming to outperform XGBoost for some use cases. This paper explores whether these deep models should be a recommended option for tabular data by rigorously comparing the new deep models to XGBoost on various datasets. In addition to systematically comparing their performance, we consider the tuning and computation they require. Our study shows that XGBoost outperforms these deep models across the datasets, including the datasets used in the papers that proposed the deep models. We also demonstrate that XGBoost requires much less tuning. On the positive side, we show that an ensemble of deep models and XGBoost performs better on these datasets than XGBoost alone. 相似文献
4.
本文主要总结了新冠疫情期间作者的电磁场理论课程在线教学经验。对比分析了录播和直播的优缺点后,选择录播教学方式。基于超星网络教学平台,展示了录播网络教学的具体措施,包括网上答疑和学习效果检查以及在线批改作业等。给出了网络教学可以为线下教学继续使用的方法和手段,为疫情结束后的正常教学提供了新的网络教学补充措施。 相似文献
5.
边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明:和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。 相似文献
6.
In the Internet of Things (IoT), a huge amount of valuable data is generated by various IoT applications. As the IoT technologies become more complex, the attack methods are more diversified and can cause serious damages. Thus, establishing a secure IoT network based on user trust evaluation to defend against security threats and ensure the reliability of data source of collected data have become urgent issues, in this paper, a Data Fusion and transfer learning empowered granular Trust Evaluation mechanism (DFTE) is proposed to address the above challenges. Specifically, to meet the granularity demands of trust evaluation, time–space empowered fine/coarse grained trust evaluation models are built utilizing deep transfer learning algorithms based on data fusion. Moreover, to prevent privacy leakage and task sabotage, a dynamic reward and punishment mechanism is developed to encourage honest users by dynamically adjusting the scale of reward or punishment and accurately evaluating users’ trusts. The extensive experiments show that: (i) the proposed DFTE achieves high accuracy of trust evaluation under different granular demands through efficient data fusion; (ii) DFTE performs excellently in participation rate and data reliability. 相似文献
7.
Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets. 相似文献
8.
Engineering new glass compositions have experienced a sturdy tendency to move forward from (educated) trial-and-error to data- and simulation-driven strategies. In this work, we developed a computer program that combines data-driven predictive models (in this case, neural networks) with a genetic algorithm to design glass compositions with desired combinations of properties. First, we induced predictive models for the glass transition temperature (Tg) using a dataset of 45,302 compositions with 39 different chemical elements, and for the refractive index (nd) using a dataset of 41,225 compositions with 38 different chemical elements. Then, we searched for relevant glass compositions using a genetic algorithm informed by a design trend of glasses having high nd (1.7 or more) and low Tg (500 °C or less). Two candidate compositions suggested by the combined algorithms were selected and produced in the laboratory. These compositions are significantly different from those in the datasets used to induce the predictive models, showing that the used method is indeed capable of exploration. Both glasses met the constraints of the work, which supports the proposed framework. Therefore, this new tool can be immediately used for accelerating the design of new glasses. These results are a stepping stone in the pathway of machine learning-guided design of novel glasses. 相似文献
9.
In this paper, we strive to propose a self-interpretable framework, termed PrimitiveTree, that incorporates deep visual primitives condensed from deep features with a conventional decision tree, bridging the gap between deep features extracted from deep neural networks (DNNs) and trees’ transparent decision-making processes. Specifically, we utilize a codebook, which embeds the continuous deep features into a finite discrete space (deep visual primitives) to distill the most common semantic information. The decision tree adopts the spatial location information and the mapped primitives to present the decision-making process of the deep features in a tree hierarchy. Moreover, the trained interpretable PrimitiveTree can inversely explain the constituents of the deep features, highlighting the most critical and semantic-rich image patches attributing to the final predictions of the given DNN. Extensive experiments and visualization results validate the effectiveness and interpretability of our method. 相似文献
10.
To save bandwidth and storage space as well as speed up data transmission, people usually perform lossy compression on images. Although the JPEG standard is a simple and effective compression method, it usually introduces various visually unpleasing artifacts, especially the notorious blocking artifacts. In recent years, deep convolutional neural networks (CNNs) have seen remarkable development in compression artifacts reduction. Despite the excellent performance, most deep CNNs suffer from heavy computation due to very deep and wide architectures. In this paper, we propose an enhanced wide-activated residual network (EWARN) for efficient and accurate image deblocking. Specifically, we propose an enhanced wide-activated residual block (EWARB) as basic construction module. Our EWARB gives rise to larger activation width, better use of interdependencies among channels, and more informative and discriminative non-linearity activation features without more parameters than residual block (RB) and wide-activated residual block (WARB). Furthermore, we introduce an overlapping patches extraction and combination (OPEC) strategy into our network in a full convolution way, leading to large receptive field, enforced compatibility among adjacent blocks, and efficient deblocking. Extensive experiments demonstrate that our EWARN outperforms several state-of-the-art methods quantitatively and qualitatively with relatively small model size and less running time, achieving a good trade-off between performance and complexity. 相似文献