全文获取类型
收费全文 | 5599篇 |
免费 | 653篇 |
国内免费 | 625篇 |
专业分类
电工技术 | 91篇 |
综合类 | 335篇 |
化学工业 | 123篇 |
金属工艺 | 46篇 |
机械仪表 | 140篇 |
建筑科学 | 275篇 |
矿业工程 | 213篇 |
能源动力 | 78篇 |
轻工业 | 115篇 |
水利工程 | 27篇 |
石油天然气 | 65篇 |
武器工业 | 13篇 |
无线电 | 487篇 |
一般工业技术 | 175篇 |
冶金工业 | 62篇 |
原子能技术 | 20篇 |
自动化技术 | 4612篇 |
出版年
2024年 | 15篇 |
2023年 | 45篇 |
2022年 | 105篇 |
2021年 | 109篇 |
2020年 | 128篇 |
2019年 | 112篇 |
2018年 | 120篇 |
2017年 | 163篇 |
2016年 | 184篇 |
2015年 | 224篇 |
2014年 | 374篇 |
2013年 | 295篇 |
2012年 | 403篇 |
2011年 | 511篇 |
2010年 | 370篇 |
2009年 | 447篇 |
2008年 | 470篇 |
2007年 | 437篇 |
2006年 | 386篇 |
2005年 | 326篇 |
2004年 | 296篇 |
2003年 | 234篇 |
2002年 | 195篇 |
2001年 | 140篇 |
2000年 | 118篇 |
1999年 | 103篇 |
1998年 | 102篇 |
1997年 | 97篇 |
1996年 | 50篇 |
1995年 | 63篇 |
1994年 | 48篇 |
1993年 | 37篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 14篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 4篇 |
排序方式: 共有6877条查询结果,搜索用时 15 毫秒
1.
Quan Nguyen Minh Quoc Dat Lai Hoang Nguy Minh Minh Tu Tran Kieu Ngoc Lam Gia Uyen Le My Phung Hang Hoang Dung Nguyen Tran Diem Ai Chau Ngoc Thuc Trinh Doan 《International Journal of Food Science & Technology》2022,57(7):4507-4517
To prevent the adulteration of agricultural resources and provide a solution to enhance the green coffee bean supply chain, authentication using the near-infrared spectroscopy (NIRS) technique was investigated. Partial least square with discrimination analysis (PLS-DA) models combined with various preprocessing methods were built from NIR spectra of 153 Vietnamese green coffee samples. The model combined with the standard normal variate and the first order of derivative yielded excellent performance in predicting coffee species with the error cross-validation of 0.0261. PLS-DA model of mean centre and first-order derivative spectra also yielded good performance in verifying geographical indication of green coffee with the error of 0.0656. By contrast, the predicting abilities of post-harvest methods were poor. The overall results showed a high potential of the NIRS in online authentication practices. 相似文献
2.
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. 相似文献
3.
《International Journal of Hydrogen Energy》2022,47(75):32303-32314
Membrane electrode assembly (MEA) is considered a key component of a proton exchange membrane fuel cell (PEMFC). However, developing a new MEA to meet desired properties, such as operation under low-humidity conditions without a humidifier, is a time- and cost-consuming process. This study employs a machine-learning-based approach using K-nearest neighbor (KNN) and neural networks (NN) in the MEA development process by identifying a suitable catalyst layer (CL) recipe in MEA. Minimum redundancy maximum relevance and principal component analysis were implemented to specify the most important predictor and reduce the data dimension. The number of predictors was found to play an essential role in the accuracy of the KNN and NN models although the predictors have self-correlations. The KNN model with a K of 7 was found to minimize the model loss with a loss of 11.9%. The NN model constructed by three corresponding hidden layers with nine, eight, and nine nodes can achieve the lowest error of 0.1293 for the Pt catalyst and 0.031 for PVA as a good additive blending in the CL of the MEA. However, even if the error is low, the prediction of PVA seems to be inaccurate, regardless of the model structure. Therefore, the KNN model is more appropriate for CL recipe prediction. 相似文献
4.
Ensemble pruning deals with the selection of base learners prior to combination in order to improve prediction accuracy and efficiency. In the ensemble literature, it has been pointed out that in order for an ensemble classifier to achieve higher prediction accuracy, it is critical for the ensemble classifier to consist of accurate classifiers which at the same time diverse as much as possible. In this paper, a novel ensemble pruning method, called PL-bagging, is proposed. In order to attain the balance between diversity and accuracy of base learners, PL-bagging employs positive Lasso to assign weights to base learners in the combination step. Simulation studies and theoretical investigation showed that PL-bagging filters out redundant base learners while it assigns higher weights to more accurate base learners. Such improved weighting scheme of PL-bagging further results in higher classification accuracy and the improvement becomes even more significant as the ensemble size increases. The performance of PL-bagging was compared with state-of-the-art ensemble pruning methods for aggregation of bootstrapped base learners using 22 real and 4 synthetic datasets. The results indicate that PL-bagging significantly outperforms state-of-the-art ensemble pruning methods such as Boosting-based pruning and Trimmed bagging. 相似文献
5.
Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks. 相似文献
6.
The purpose of feature construction is to create new higher-level features from original ones. Genetic Programming (GP) was usually employed to perform feature construction tasks due to its flexible representation. Filter-based approach and wrapper-based approach are two commonly used feature construction approaches according to their different evaluation functions. In this paper, we propose a hybrid feature construction approach using genetic programming (Hybrid-GPFC) that combines filter’s fitness function and wrapper’s fitness function, and propose a multiple feature construction method that stores top excellent individuals during a single GP run. Experiments on ten datasets show that our proposed multiple feature construction method (Fcm) can achieve better (or equivalent) classification performance than the single feature construction method (Fcs), and our Hybrid-GPFC can obtain better classification performance than filter-based feature construction approaches (Filter-GPFC) and wrapper-based feature construction approaches (Wrapper-GPFC) in most cases. Further investigations on combinations of constructed features and original features show that constructed features augmented with original features do not improve the classification performance comparing with constructed features only. The comparisons with three state-of-art methods show that in majority of cases, our proposed hybrid multiple feature construction approach can achieve better classification performance. 相似文献
7.
Frequency band selection (FBS) in rotating machinery fault diagnosis aims to recognize frequency band location including a fault transient out of a full band spectrum, and thus fault diagnosis can suppress noise influence from other frequency components. Impulsiveness and cyclostationarity have been recently recognized as two distinctive signatures of a transient. Thus, many studies have focused on developing quantification metrics of the two signatures and using them as indicators to guide FBS. However, most previous studies almost ignore another aspect of FBS, i.e. health reference, which significantly affect FBS performance. To address this issue, this paper investigates importance of a health reference and recognize it as the third critical aspect in FBS. With help of the health reference, the frequency band where the fault transient exists could be located. A novel approach based on classification is proposed to integrate all three aspects (impulsiveness, cyclostationarity, and health reference) for FBS. Classification accuracy is developed as a novel indicator to select the most sensitive frequency band for rotating machinery fault diagnosis. The proposed method (coined by accugram) has been validated on benchmark and experiment datasets. Comparison results show its effectiveness and robustness over conventional envelope analysis, the kurtogram, and the infogram. 相似文献
8.
在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。 相似文献
9.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods.
Recommended by: Patrick Valduriez 相似文献
10.